JSPM

Tiny queue data structure

Priority queue data structures

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

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.

Priority queue data structures

Deque

Queue data structure

Collection of useful and efficient JS tools

A modern JavaScript & TypeScript standard template library (STL) for data structures and algorithms. Includes high-performance implementations of Stack, Queue, Deque, Linked List, Vector, Set, Map, Tree, Heap, and Graph — inspired by C++ STL. Designed for

Tiny queue data structure

Just the cutest and tiniest queue/deque implementation!

Queue + Stack ADTs.

A small ES6 package for execute functions sequentially.

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.

observable sequence

Tiny queue data structure

A spiral deque - high performance and dynamic queue size

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

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 robust and efficient data structures library.

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

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