-
radix_trie
Generic radix trie data-structure
-
trie-rs
Memory efficient trie (prefix tree) and map library based on LOUDS
-
prefix-trie
Prefix trie (tree) datastructure (both a set and a map) that provides exact and longest-prefix matches
-
iptrie
IPv4/v6 prefixes lookup structures (based on tries)
-
ptrie
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes
-
poptrie
A pure-rust implementation of poptrie
-
weighted_trie
Weighted prefix trie for autosuggestions
-
oramacore_ptrie
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes
-
trie_hard_rs
Fast, memory-efficient Trie (prefix tree) implementation with autocomplete support - Rust implementation
-
kv-trie-rs
KV capable prefix trie library based on LOUDS
-
prefix_tree_map
generic prefix tree (trie) map with wildcard capture support
-
twie
fast and compact prefix tries
-
hat_trie
A hat-trie implementation that support prefix match iteration
-
pruning_radix_trie
Pruning Radix Trie, originally by Wolf Garbe
-
littlechestnutgames-trie
A generalized trie implementation for quick prefix searching
-
trie-generic
A trie with generic content
-
prefix-tree
A map and set interfaces using trie data structure
-
ab-radix-trie
A compressed radix trie implementation supporting matching rules
-
metacomplete_ptrie
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes
-
prefix-map
A collection for creating prefix maps
Try searching with DuckDuckGo.