yocto-queue
Tiny queue data structure
Tiny queue data structure
Priority queue data structures
Priority queue data structures
Queues using linked list, faster than array.shift(), support enqueue,dequeue,enqueue all, dequeue all, clear, forEach, first, last
A simple and fast FIFO collection for enqueuing and dequeuing items.
A small ES6 package for execute functions sequentially.
observable sequence
A spiral deque - high performance and dynamic queue size
deq (dequeue) places records in a redis queue for high throughput and dequeues them into your choice of (slower write-speed) datastore
Queue + Stack ADTs.
Fast performance queue implementation
Collection of elements where insert, delete happens only at the ends.
A pretty small ES6 API for Queue and Stack ADTs.
dequeue
indexed dequeue
A simple and efficient implementation of a queue data structure in TypeScript. This package provides a generic Queue class which can be used in various JavaScript and TypeScript applications where queue functionality is needed.
Priority queue data structures
Just the cutest and tiniest queue/deque implementation!
Queue, ArrayQueue. Javascript & Typescript Data Structure.
This library has a Queue with the following methods: enqueue and dequeue. Enqueue adds item(s) to end of the Queue. Dequeue removes and returns the first item from the beginning of the queue.