-
radix_trie
Generic radix trie data-structure
-
indextree
Arena based tree structure by using indices instead of reference counted pointers
-
ucd-trie
A trie for storing Unicode codepoint sets and maps
-
patricia_tree
Memory-efficient data structures based on patricia tree
-
yada
double-array trie library aiming for fast search and compact data representation
-
vart
An immutable versioned adaptive radix trie
-
cita_trie
Modified Patricia Tree (aka Trie)
-
memory-db
In-memory implementation of hash-db, useful for tests
-
qp-trie
An idiomatic and fast QP-trie implementation in pure Rust, written with an emphasis on safety
-
pathmap
A key-value store with prefix compression, structural sharing, and powerful algebraic operations
-
fast_radix_trie
Memory-efficient trie data structures based on radix tree
-
cedarwood
efficiently-updatable double-array trie in Rust (ported from cedar)
-
zipora
High-performance Rust implementation providing advanced data structures and compression algorithms with memory safety guarantees. Features LRU page cache, sophisticated caching layer…
-
plain_trie
Classic trie implementation capable of mapping any T to char iterator
-
tetengo_trie
A trie library implemented with a double array
-
treerder
Trie ordering for type implementing Orderable
-
xtri
A fast, memory-efficient radix tree (compressed trie) implementation in Rust with UTF-8 support
-
toktrie
LLM Token Trie library
-
lr_trie
Left-Right trie is trie capable of mapping any string to any string
-
dyn_trie
Dynamic trie is trie capable of mapping any T to any char iterator
-
t-oc
Trie Occurrence Counter is frequency dictionary for any type implementing Iterator<Item = char>
-
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
-
quilibrium-verkle
Verkle trie implementation with KZG commitments for Quilibrium
-
sensitive-rs
sensitive data detection and filtering, supporting Chinese and English text with trie-based algorithms
-
hattrie
A high-performance, cache-conscious, ordered map for string keys, based on the HAT-trie paper
-
trie-hard
Fast implementation of trie data structure
-
fuzzy_prefix_search
Fuzzy search for prefix matches
-
fqdn-trie
FQDN (Fully Qualified Domain Name) lookup structures (based on tries)
-
hibit_tree
Hierarchical bitmap tree. Integer-key map that can intersect FAST.
-
dawg
Directed Acyclic Word Graph
-
token_trie
A high-performance Radix Trie implementation with sorted children for efficient binary search operations
-
rstrie
A generalized Trie implementation for Rust
-
basic_trie
Trie implementation in Rust
-
poetrie
Poetic trie crafted with intetion to ease searching of rhymes for poems
-
fs-tree
Filesystem path Trie with an API focused on filesystem operations
-
ipnet-trie
IPv4 and IPv6 network fast lookup trie
-
trie_rcv
Ranked Choice Voting implementation using Tries in Rust
-
sequence_trie
Trie-like data-structure for storing sequences of values
-
radix_trees
Various radix tree (trie) data structures
-
marisa-rs
Safe Rust wrapper for the marisa-trie C++ library
-
marisa-ffi
Rust FFI bindings for libmarisa - a space-efficient trie data structure
-
crawdad-rkyv
Crawdad: ChaRActer-Wise Double-Array Dictionary with rkyv support
-
trying
Basic trie crate
-
comtains
Zero-allocation byte-set matcher generated at compile time
-
easy-trie
trie implementation in Rust
-
regextrie
High-performance Rust library designed for matching a large number of regular expressions against a given input string
-
astrie
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
-
crawdad
ChaRActer-Wise Double-Array Dictionary
-
trie
An ordered map and set based on a trie
-
ternary-tree
Ternary Search Trees, with no unsafe blocks
-
fast_trie
A memory efficient trie library
-
prefix_tree_map
generic prefix tree (trie) map with wildcard capture support
-
wildcard-trie
A space-efficient router / radix-trie that supports wildcards
-
tongrams
Tons of N-grams
-
forestrie
Quick string matches
-
prefix-tree-rs
A Trie (prefix tree) implementation
-
hamt-rs
A Hash Array Mapped Trie implementation based on the *Ideal Hash Trees* paper by Phil Bagwell
-
bitmaptrie
Bitmapped vector trie (mutable, not persistent). Word-size path-cached indexing into essentially a sparse vector. Requires rust-nightly.
-
gtrie
Generic trie implementation with a support of different key and value types
-
atlatl
Double-array tries
-
blitztext
fast keyword extraction and replacement in strings
-
fr-trie
Fuzzy Radix Trie
-
forestrie-builder
Build a trie and convert it TokenStream
-
artsy
ART Tree data structure library
-
prfx
Prefix Tree
-
suggestion_trie
A Radix trie for suggestion search, it allows to search for data indexed by a set of keywords fast
-
flashtext2
The FlashText algorithm implemented in Rust
-
yada_mod
Yada is a yet another double-array trie library aiming for fast search and compact data representation. This fork added a tokenization function
-
radixtree
A radix trie implementation for router, and provides CRUD operations
-
rustgym
solutions
-
alloy-trie
Fast Merkle-Patricia Trie (MPT) state root calculator and proof generator for prefix-sorted nibbles
-
fast_trie_tree
A fast
TrieTreefor multiple data types -
trie-generic
A trie with generic content
-
darts
A double array trie, A Forward Maximum Matching Searcher
-
nomt
Nearly Optimal Merkle Trie - Schema and Database
-
rk-utils
A collection of utility functions and data structures for rust
-
mytrie
Trie implmentation
-
set-trie
A trie for fast subset and superset queries
-
pallet-state-trie-migration
FRAME pallet migration of trie
-
autocomplete
Auto-complete feature using Trie data structure
-
byte_trie
A compressed trie based on bytes with some weird child node bucket sizes
-
word_sensitive
sensitive string matching, the implementation language is rust, and the algorithm used is ac
-
lighter
Macro for rewriting string matches as tries
-
hardly-trie
efficient trie data structure implementation
-
waffle-trie
Trie mapping for waffle
-
rust-cedar
efficiently-updatable double-array trie in Rust (ported from cedar)
-
auto_correct_n_suggest
Dictionary Trie. Performs autosuggestions on words with typos & autocompletes words 🦀
-
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
-
eth_trie
Ethereum-compatible Merkle-Patricia Trie
-
trie-alg
Trie implementation
-
suffix_trie
Suffix trie for searching
-
indextree-ng
Arena based tree structure by using indices instead of reference counted pointers. Fork of indextree by Sascha Grunert which allows to remove nodes
-
prefix-tree
A map and set interfaces using trie data structure
-
simple_trie
array backed trie
-
trie_map
A trie with good iterator support backed by a hashmap
-
search-autocompletion
Search Auto Completion
-
radixdb
a radix tree data structure for in memory or zero copy on disk storage
-
louds
LOUDS implementation for Rust
-
trie_of_lists
Trie library for storing and searching lists of arbitrary data structures efficiently that have substantial overlap. For example file paths
-
nutrimatic
Tools for reading Nutrimatic (https://nutrimatic.org) index files
-
substrate-state-trie-migration-rpc
Node-specific RPC methods for interaction with state trie migration
-
dawgdic
Port of DAFSA in safe Rust (original implementation courtesy to Susumu Yata)
-
dyld-trie
A little library for parsing Dyld trie
-
peel
Dynamic packet parsing within trees
-
char_trie
Text segmentation based on trie tree, High performance, support for custom dictionary
-
pathtrie
A specialised trie for paths in the style of a Patricia or radix trie
-
datrie
Double array trie implementation of rust
-
linear_search_trie
array backed trie, using linear search to traverse nodes
-
basic_tree
basic tree for rust, for now including only trie
-
bintrie
A performant binary trie data structure that doesnt store data or keys
-
vertree
A persistent trie where each node is typed and versioned
-
spyglass
Search engine for documents, inspired by bioinformatics
-
vsdb_trie_db
A lightweight, production-grade Merkle Patricia Trie (MPT) implementation for vsdb
-
trie_tree
basic trie tree for rust
-
dary
double-array construction and search functions
-
hyper-tree-router
Routing middleware for Hyper http library using Prefix tree (trie) for path finding
-
blake3-hasher
blake3-256 implementation of the Hasher trait
-
word-trie
trie for word validation
-
sn-merkle-trie
Minimal starknet merkle patricia trie implementation
-
html-keywords-matching
use ac trie to match keywords in html and replace them with a span tag
-
awesome-trie
Awesome Trie is a fast Implementation of Trie algorithm
-
arbor-cli
A trie-based auto-completion tool
Try searching with DuckDuckGo.