GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
- go
- golang
- data-structure
- map
47,133 repositories indexed
1–9 of 9 · Most stars
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
🔩 Like builtins, but boltons. 250+ constructs, recipes, and snippets which extend (and rely on nothing but) the Python standard library. Nothing like Michael Bolton.
C++14 concurrent lock-free low-latency queue.
A complete, fully tested and documented data structure library written in pure JavaScript.
🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes
🎀 Just the cutest and tiniest queue/deque implementation!
Ordered-concurrently a library for concurrent processing with ordered output in Go. Process work concurrently and returns output in a channel in the order of input. It is useful in concurrently processing items in a queue, and get output in the order provided by the queue.
Queue data structure for Elixir-lang
Json-values allows Java developers to harness the power of persistent data structures when working with JSON data, simplifying complex data manipulation. It provides a purely functional approach to JSON