Wait-free thread-safe single-consumer single-producer ring buffer using SharedArrayBuffer
-
Updated
Nov 15, 2025 - JavaScript
Wait-free thread-safe single-consumer single-producer ring buffer using SharedArrayBuffer
Zero-dependency data structures: linked lists (doubly/singly linked, circular), deques, ring buffers, unrolled lists, caches (LRU, LFU, SLRU, Clock, FIFO), heaps (binary, indexed, pairing), timer wheels, object pools, queues, stacks, splay trees, skip lists.
A tiny (232 bytes) and fast Circular Buffer implementation
A simple and lightweight forgetful circular buffer (circlular queue) in TypeScript
A flight recorder for Node-RED: rolling message recordings dumped as structured incidents on demand, on error, or on watermark — with readable post-mortem reports and crash-surviving persistence.
RingBuffer - Store a limited data set in a circular array
Zero-copy lock-free ring buffer with 64-bit monotonic sequencing and sub-microsecond cross-thread dispatch
To associate your repository with the ring-buffer topic, visit your repo's landing page and select "manage topics."