Circular queue Packages

Immutable fixed-length list (a.k.a circular buffer) with an event emitter for Typescript and Javascript


Data structure and graph processing library written in modern JavaScript

A tiny (232 bytes), fast and heap safe Circular Buffer implementation

A Queue factory for creating various Queue data structures.

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

TypeScript/JavaScript implementation of a circular buffer, circular queue, cyclic buffer or ring buffer. A data structure that uses a single, fixed-size buffer as if it were connected end-to-end. This structure lends itself easily to buffering data stream

A ring buffer that manages memory in chunks to support large capacity for data bursts with low overhead when small.

Replace your slow Array based fixed length ring buffer, or circular queue, with ring-buffer. RingBuffer is roughly 10x faster, and is a drop in replacement.

Typescript implementation of queues, such as priority queue and circular queue.

Circular queue in Typescript

Data structure and algorithms implementation in Javascript