JSPM

Lightweight, type-safe, and memory-efficient queue for resource-sensitive applications.

Priority queue data structures

A lightweight and dependency-free collection of essential data structures and graph algorithms, written entirely in TypeScript. This library supports CommonJS, ESM, and browser environments, and includes utility functions for practical, everyday tasks in

deq (dequeue) places records in a redis queue for high throughput and dequeues them into your choice of (slower write-speed) datastore

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.

Some Basic Data Structures for use in JavaScript

dequeue

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

A robust and efficient data structures library.

Collection of elements where insert, delete happens only at the ends.

Queue data structure with enqueue, dequeue, peek, size and flush methods

Fast Queue implementation in javascript

Tiny queue data structure