JSPM

LRU and FIFO caches for Client or Server

A simple double ended queue datastructure

Javascript implementation of a queue data structure

Queue data structure

Train a fast (FIFO) queue with a rollback mechanism. Behind the scenes it uses 2 arrays to simulate and perform fast shifting and popping operations without using the Array#shift() method..

Deque

A coordinated queue of actions

Nodejs in-process blocking FIFO queue implementation.

An es6-style iterable queue

A fast and performant *Least Frequently Used* (LFU) sorted set implementation for working with reasonably sized integers (unsigned). Trades memory for performance, optimised for frequently updating and counting a relatively small set of integers (integer

Push messages to an AWS (FIFO) SQS queue

A lightweight queue package supporting both FIFO (First In First Out) and LIFO (Last In First Out) operations. Features include asynchronous iteration, event emission, and batch processing. The queue dynamically resizes, handles push and get timeouts, and

File based FIFO queue

Basic queue implementation in TypeScript with generics support

A generic purpose *"delayed"* FIFO queue with ticket system, inspired by real life.

Quick and dirty Node.js module for reading DMP-processed yaw/pitch/roll and rotation values from an MPU6050

An efficient in-memory FIFO cache with a fixed TTL for Node.js projects, designed to automatically remove outdated records. Unlike widely used LRU caches, FIFO caches do not prioritize retaining popular keys for extended durations. This simplified approac

Efficient Circular FIFO Buffer Implementation.

Container data structures that support queueing and FIFO semantics.

A lightweight, concurrency-throttled FIFO queue

Utility to check based on a queue name, that it is or could be an AWS SQS FIFO queue

A charming little queue filled with awaitable tasks

A slim and efficient in-memory queue for Node.js projects. The implementation employs Data-Oriented Design using a cyclic buffer, optimizing memory layout through sequential item allocation.

Promise Stream. Queue promises and retrieve the resolved/rejected ones in the inserted order

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.

A wrapper of stream.Duplex in object mode to make things more flexible, or more efficient.

Persistent FIFO stack for industrial process flows for Node-RED 4

LRU and FIFO caches for Client or Server

Hose is plugin for your Mongoose schema that allows a fixed length array of nested docs. Useful for storing only the newest subdocs while leaving he oldest to be lost. When a doc is pushed into the array, if length is more than the limit the oldest will b

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.

Traversable JavaScript FIFO

A fast FIFO implementation purely based on Node Buffers

async iterable queue

In-memory object cache written in typescript for Node that supports multiple eviction strategies.

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

A stream that enables asynchronous enrichment of data with concurrency control while preserving FIFO ordering.

Promise Queue Library

A distributed cache system built using Redis with LRU, FIFO, and Random eviction policies.

HTML5 LocalStorage Manager and Data Structures for Angular 2