mnemonist - Curated collection of data structures for the JavaScript language.

•    Javascript

---

Mnemonist is a curated collection of data structures for the JavaScript language. It gathers classic data structures (think heap, trie etc.) as well as more exotic ones such as Buckhard-Keller trees etc.

data-structure bag bimap bit-array bit-set bit-vector bitset bk-tree burkhard-keller-tree circular-buffer counter data-structures disjoint-set fibonacci-heap fuzzy-map hashed-array-tree heap interval-tree inverted-index linked-list multimap multiset queue sparse-set stack structures suffix-tree symspell trie union-find vantage-point-tree vector vp-tree

Buckets-Swift - Swift Collection Data Structures Library

•    Swift

---

Buckets is a complete, tested and documented collections library for swift.Carthage is a decentralized dependency manager that automates the process of adding frameworks to your application.

swift-3 queue deque stack priority-queue matrix multiset multimap bimap graph trie bitarray circular-buffer bloom-filter swift-package-manager carthage cocoapods

bipbuffer - A circular buffer alternative written in C under a BSD license

•    C

---

A circular buffer alternative written in C under a BSD license

circular-buffer bipbuffer queue ring

cbuffer - A circular buffer written in C using Posix calls to create a contiguously mapped memory space

•    C

---

Circular buffers are tricky. The caller needs to know if the polled item crosses the maximum size of the underlying array.This circular buffer uses a mmap magic trick to make the caller's life easier.

buffer ring-buffer circular-buffer

ringbufferjs - A simple ring buffer data structure for Node.js and the browser

•    Javascript

---

A simple ring buffer data structure for Node.js and the browser. Initializes a new empty RingBuffer with the default capacity (50).

ring buffer circular queue ring-buffer circular-buffer data-structure