A fast `TrieTree` for multiple data types
Memory-efficient trie data structures based on radix tree
A fast, memory-efficient radix tree (compressed trie) implementation in Rust with UTF-8 support
Fast, memory-efficient Trie (prefix tree) implementation with autocomplete support - Rust implementation
Forked version of fast IPv4/IPv6 lookup trie.
Fast IPv4/IPv6 lookup trie.
High-performance hybrid data structure that combines the benefits of tries and B+ trees to provide efficient key-value storage with adaptive behavior based on data patterns.
Hierarchical bitmap tree. Integer-key map that can intersect FAST.
High-performance Adaptive Radix Tree implementation with SIMD optimizations
Ordered integer set (u32/u64/u128) for data with locality. O(1) range counting. Stable O(log log U) latency.
Rust-based Radix Tree for fast prefix lookup, supporting named param, glob, regex
High-performance Adaptive Radix Tree with TTL, DFA pattern matching, and atomic counters
No description provided.
No description provided.