Erlang Trie Implementation
- erlang
- data-structures
47,133 repositories indexed
73–96 of 102 · Most stars
Erlang Trie Implementation
pure functional and generic programming for Erlang
A fast and flexible c++ template class for tree data structures
🎀 Just the cutest and tiniest queue/deque implementation!
Containers backed by std.experimental.allocator
A comprehensive, reusable and efficient concurrent-safe generics utility functions and data structures library.
A common lisp library to unify access to common dictionary-like data-structures
Probabilistic set data structure
Fast cartesian product
Graph data structures with multiple heterogeneous metadata for Graphs.jl.
Render Elixir data-structures to HTML, inspired by Hiccup.
Data structures and algorithms in OCaml
Data Structures and streaming algorithms for Common Lisp.
radix tree (also "radix trie" or "compact prefix tree" or "compressed trie")
Generic, zero-alloc, 100%-test covered Quadtree for golang
Better JSON::Any for Crystal
Erlang nif for xor_filter. 'Faster and Smaller Than Bloom and Cuckoo Filters'.
Elixir implementation of bidirectional map and multimap
Erlang Term Info
immutable primitive array/NonEmptyArray wrapper for Scala
A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
Sliding-window and regular top-K sketches, based on HeavyKeeper
graphlb is a crystal library which contains all the graph Data-Structures and Algorithms implemented in crystal-lang.
Fast HyperLogLog implementation for Elixir/Erlang