Results for fast_trie

A memory efficient trie library.

A fast `TrieTree` for multiple data types

Ordered integer set (u32/u64/u128) for data with locality. O(1) range counting. Stable O(log log U) latency.

Small integer specialized, word level, parallel algorithms and data structures

Memory-efficient trie data structures based on radix tree

Fast Merkle-Patricia Trie (MPT) state root calculator and proof generator for prefix-sorted nibbles

Fast implementation of a trie data structure

IPv4 and IPv6 network fast lookup trie.

A trie for fast subset and superset queries

A fast, compact double-array trie with `no_std` + `alloc` support. Fork of [yada](https://crates.io/crates/yada) providing O(key-length) exact-match and common-prefix search over a flat, cache-friendly byte buffer (4 bytes per node).

Fast IPv4/IPv6 lookup trie.

Forked version of fast IPv4/IPv6 lookup trie.