Dequeue Packages

Fast Queue implementation in javascript

Tiny queue data structure

Tiny queue data structure. This is a fork of sindresorhus/yocto-queue, but with CommonJS support.

Just the cutest and tiniest queue/deque implementation!

Queue 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.

Tiny queue data structure

A slim and efficient in-memory Deque (doubly-ended queue) for Node.js projects, designed with Data-Oriented Design principles and implemented using a cyclic buffer to optimize memory layout through sequential item allocation. A notable real-world use case

Deque

A modular and efficient implementation of a Priority Queue with enqueue-optimized and dequeue-optimized strategies.

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.

A robust and efficient data structures library.