Lightweight Path Trie for TypeScript and JavaScript
Directed Acyclic Word Graph
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes.
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes.
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes.
Bitmapped vector trie (mutable, not persistent). Word-size path-cached indexing into essentially a sparse vector. Requires rust-nightly.
IPv4/v6 prefixes lookup structures (based on tries)
A pure-rust implementation of poptrie
A QP-Trie implementation for Rust