From Free Software Directory
Jump to: navigation, search


Simple Double Ended Queue Datastructure for Node.js

Dequeue is implemented as a doubly linked circular list with a titular head node--an empty node to designate the beginning and the end of the circularly linked list.

It is a drop-in replacement for javascript-arrays-as-fifo.



Verified by

Verified on


Verified by

Debian: Mike Gabriel <>

Verified on

19 August 2014


License: bsd-2-clause

Leaders and contributors

Sean (lleo) M. Egan contact

Resources and communication

AudienceResource typeURI
Debian (Ref)

Software prerequisites


"contact" is not in the list (Maintainer, Contributor, Developer, Sponsor, Unknown) of allowed values for the "Role" property.

"Debian (Ref)" is not in the list (General, Help, Bug Tracking, Support, Developer) of allowed values for the "Resource audience" property.

Date 2015-07-17
Source Debian
Source link


Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.

The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.