diff -Nru node-dequeue-1.0.3/debian/changelog node-dequeue-1.0.5/debian/changelog --- node-dequeue-1.0.3/debian/changelog 2013-05-15 09:12:56.000000000 +0000 +++ node-dequeue-1.0.5/debian/changelog 2014-08-19 17:41:46.000000000 +0000 @@ -1,3 +1,15 @@ +node-dequeue (1.0.5-1) unstable; urgency=medium + + * New upstream release. + * debian/rules: + + Add get-orig-source rule. + * debian/control: + + Move packaging Git to pkg-javascript namespace on Alioth. + + Alioth-canonicalize Vcs-*: fields. + + Bump Standards: to 3.9.5. No changes needed. + + -- Mike Gabriel Tue, 19 Aug 2014 19:41:42 +0200 + node-dequeue (1.0.3-2) unstable; urgency=low * /debian/control: diff -Nru node-dequeue-1.0.3/debian/control node-dequeue-1.0.5/debian/control --- node-dequeue-1.0.3/debian/control 2013-05-15 09:12:27.000000000 +0000 +++ node-dequeue-1.0.5/debian/control 2014-08-19 17:40:33.000000000 +0000 @@ -7,10 +7,10 @@ Build-Depends: debhelper (>= 8.0.0), dh-buildinfo, -Standards-Version: 3.9.4 +Standards-Version: 3.9.5 Homepage: https://github.com/lleo/node-dequeue/ -Vcs-Git: git://git.debian.org/collab-maint/node-dequeue.git -Vcs-Browser: http://git.debian.org/?p=collab-maint/node-dequeue.git +Vcs-Git: git://anonscm.debian.org/pkg-javascript/node-dequeue.git +Vcs-Browser: http://anonscm.debian.org/gitweb/?p=pkg-javascript/node-dequeue.git Package: node-dequeue Architecture: all diff -Nru node-dequeue-1.0.3/debian/rules node-dequeue-1.0.5/debian/rules --- node-dequeue-1.0.3/debian/rules 2013-05-07 09:09:42.000000000 +0000 +++ node-dequeue-1.0.5/debian/rules 2014-08-19 17:39:44.000000000 +0000 @@ -6,3 +6,6 @@ %: dh $@ + +get-orig-source: + uscan --noconf --force-download --rename --download-current-version --destdir=.. diff -Nru node-dequeue-1.0.3/lib/dequeue.js node-dequeue-1.0.5/lib/dequeue.js --- node-dequeue-1.0.3/lib/dequeue.js 2012-07-08 02:40:17.000000000 +0000 +++ node-dequeue-1.0.5/lib/dequeue.js 2013-08-29 15:44:05.000000000 +0000 @@ -32,6 +32,16 @@ return n.data } +Dequeue.prototype.last = function(){ + if (this.head.prev === this.head) return + return this.head.prev.data +} + +Dequeue.prototype.first = function(){ + if (this.head.next === this.head) return + return this.head.next.data +} + Dequeue.prototype.empty = function(){ if (this.length === 0 ) return diff -Nru node-dequeue-1.0.3/LICENSE node-dequeue-1.0.5/LICENSE --- node-dequeue-1.0.3/LICENSE 1970-01-01 00:00:00.000000000 +0000 +++ node-dequeue-1.0.5/LICENSE 2013-08-29 15:44:05.000000000 +0000 @@ -0,0 +1,26 @@ +This is the 2-Clause BSD license, aka FreeBSD, copy and pasted from +http://opensource.org/licenses/BSD-2-Clause . + +Copyright (c) 2012, Sean M. Egan +All rights reserved. + +Redistribution and use in source and binary forms, with or without +modification, are permitted provided that the following conditions are met: + +* Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. +* Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" +AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE +IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE +ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE +LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR +CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF +SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS +INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN +CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) +ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE +POSSIBILITY OF SUCH DAMAGE. diff -Nru node-dequeue-1.0.3/package.json node-dequeue-1.0.5/package.json --- node-dequeue-1.0.3/package.json 2012-07-08 02:40:17.000000000 +0000 +++ node-dequeue-1.0.5/package.json 2013-08-29 15:44:05.000000000 +0000 @@ -1,7 +1,7 @@ { "name" : "dequeue" , "main" : "./lib/index.js" -, "version" : "1.0.3" +, "version" : "1.0.5" , "description" : "A simple double ended queue datastructure" , "keywords" : ["datastructure", "queue", "double ended queue", "fifo", "FIFO", "linked list"] , "homepage" : "https://github.com/lleo/node-dequeue" diff -Nru node-dequeue-1.0.3/README.md node-dequeue-1.0.5/README.md --- node-dequeue-1.0.3/README.md 2012-07-08 02:40:17.000000000 +0000 +++ node-dequeue-1.0.5/README.md 2013-08-29 15:44:05.000000000 +0000 @@ -52,6 +52,12 @@ ### `value = deque.shift()` Remove a value off the beginning. +### `value = deque.last()` +Examine the value of the end without removing it. + +### `value = deque.first()` +Examine the value of the beginning without removing it. + ### `deque.empty()` Remove all entries. This is NOT a test for an empty dequeue; use `deque.length` for that.