-
rpds
Persistent data structures with structural sharing
-
unicode-ident
Determine whether characters have the XID_Start or XID_Continue properties according to Unicode Standard Annex #31
-
matchit
A high performance, zero-copy URL router
-
trie-rs
Memory efficient trie (prefix tree) and map library based on LOUDS
-
surrealkv
A low-level, versioned, embedded, ACID-compliant, key-value database for Rust
-
indextree
Arena based tree structure by using indices instead of reference counted pointers
-
radix_trie
Generic radix trie data-structure
-
trie-db
Merkle-Patricia Trie generic over key hasher and node encoding
-
patricia_tree
Memory-efficient data structures based on patricia tree
-
icu_collections
Collection of API for use in ICU libraries
-
prefix-trie
Prefix trie (tree) datastructure (both a set and a map) that provides exact and longest-prefix matches
-
zerotrie
A data structure that efficiently maps strings to integers
-
unicode-id-start
Determine whether characters have the ID_Start or ID_Continue properties according to Unicode Standard Annex #31
-
yada
double-array trie library aiming for fast search and compact data representation
-
rustrict
profanity filter for Rust
-
vart
An immutable versioned adaptive radix trie
-
daachorse
Double-Array Aho-Corasick
-
cita_trie
Modified Patricia Tree (aka Trie)
-
pfds
Purely Functional Data Structures
-
qp-trie
An idiomatic and fast QP-trie implementation in pure Rust, written with an emphasis on safety
-
wnfs-wasm
WebNative Filesystem API (WebAssembly)
-
iptrie
IPv4/v6 prefixes lookup structures (based on tries)
-
wnfs
WebNative filesystem core implementation
-
iprange
manage IP ranges
-
wordcut-engine
Word segmentation/breaking library
-
memory-db
In-memory implementation of hash-db, useful for tests
-
tst
Ternary search trie collection in rust with similar API to std::collections as it possible
-
hash-db
Trait for hash-keyed databases
-
unicode-casing
Titlecase helper function on characters
-
nybbles
Efficient nibble-sized (4-bit) byte sequence data structure
-
masstree
A high-performance concurrent ordered map (trie of B+trees) - alpha release, not production ready
-
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
-
general-sam
A general suffix automaton implementation in Rust
-
zipora
High-performance Rust implementation providing advanced data structures and compression algorithms with memory safety guarantees. Features LRU page cache, sophisticated caching layer…
-
cedarwood
efficiently-updatable double-array trie in Rust (ported from cedar)
-
yeslogic-ucd-generate
A program for generating packed representations of the Unicode character database that can be efficiently searched with support for additional tables
-
trie-root
In-memory patricia trie operations
-
avila-atom
Atomic computational structures - Option, Result, Vec, HashMap built from nucleus
-
plain_trie
Classic trie implementation capable of mapping any T to char iterator
-
ad-editor
An adaptable text editor
-
tetengo_trie
A trie library implemented with a double array
-
anomaly-grid
Sequential pattern analysis through variable-order Markov chains. Built for detecting deviations in finite-alphabet sequences.
-
wayfind
A speedy, flexible router
-
bgpsim
A network control-plane simulator
-
treerder
Trie ordering for type implementing Orderable
-
xtri
A fast, memory-efficient radix tree (compressed trie) implementation in Rust with UTF-8 support
-
lr_trie
Left-Right trie is trie capable of mapping any string to any string
-
ip2asn
A high-performance, memory-efficient Rust crate for mapping IP addresses to Autonomous System (AS) information
-
toktrie
LLM Token Trie library
-
dyn_trie
Dynamic trie is trie capable of mapping any T to any char iterator
-
keymaps
standardized encoding for key codes
-
t-oc
Trie Occurrence Counter is frequency dictionary for any type implementing Iterator<Item = char>
-
probly-search
A lightweight full-text search engine with a fully customizable scoring function
-
bevy_minibuffer
A gamedev console inspired by classic Unix text editors
-
tpuf_icu_collections_211
Collection of API for use in ICU libraries
-
wnfs-hamt
IPLD HAMT implementation for Webnative Filesystem
-
toktrie_hf_tokenizers
HuggingFace tokenizers library support for toktrie and llguidance
-
quilibrium-verkle
Verkle trie implementation with KZG commitments for Quilibrium
-
path_resolver
trie-based data structure to track and resolve relative path ownership across multiple packages
-
macho2
A better MachO parser library
-
art
adaptive radix trie
-
hattrie
A high-performance, cache-conscious, ordered map for string keys, based on the HAT-trie paper
-
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
-
fractal_algebra
fractal algebra experimentation
-
sensitive-rs
sensitive data detection and filtering, supporting Chinese and English text with trie-based algorithms
-
embellama
High-performance Rust library for generating text embeddings using llama-cpp
-
liblevenshtein
Levenshtein/Universal Automata for approximate string matching using various dictionary backends
-
ucd-trie
A trie for storing Unicode codepoint sets and maps
-
icu_codepointtrie_builder
Runtime builder for CodePointTrie
-
portmatching
Fast Graph Matching for Port Graphs
-
fuzzy_prefix_search
Fuzzy search for prefix matches
-
ergokv
Easily store and retrieve data from TiKV with a derive
-
fqdn-trie
FQDN (Fully Qualified Domain Name) lookup structures (based on tries)
-
publicsuffix2
Extract root domain and suffix from a domain name
-
rustic_testing
rustic_testuing - library for test support in rustic-rs
-
range-filters
High-performance range filter implementation - DIVA (VLDB 2025 Best Research Paper)
-
match-domain
Rapid checker for the prefix and suffix matching of domain names
-
unicode-id-trie-rle
Unicode identifier (UAX #31) checker using a deduplicated trie with run-length encoded leaves
-
trie-hard
Fast implementation of trie data structure
-
avila-tokenizers
The most complete tokenizer library in Rust - BPE, WordPiece, Unigram, with native support for GPT, BERT, Llama, Claude
-
nickel-lang-vector
Persistent vectors for Nickel
-
tpuf_collections_211
Collection of API for use in ICU libraries
-
hibit_tree
Hierarchical bitmap tree. Integer-key map that can intersect FAST.
-
token_trie
A high-performance Radix Trie implementation with sorted children for efficient binary search operations
-
basic_trie
Trie implementation in Rust
-
trie_hard_rs
Fast, memory-efficient Trie (prefix tree) implementation with autocomplete support - Rust implementation
-
spacetimedb-fs-utils
Assorted utilities for filesystem operations used in SpacetimeDB
-
hightower-kv
Embedded log-structured key-value store with optional auth helpers
-
dawg
Directed Acyclic Word Graph
-
ucd-generate
A program for generating packed representations of the Unicode character database that can be efficiently searched
-
spider_network_blocker
Web crawler network blocking urls and patterns
-
radix_route_matcher
A high-performance route matching library based on Radix Tree
-
udevrs
Pure Rust implementation of the user-land udev library
-
grapheme_machine
Grapheme cluster text segmentation (UAX #29) state machine for streaming input
-
aneubeck-daachorse
Daachorse: Double-Array Aho-Corasick
-
CompactPrefixRadix
a minimalistic but efficient radix tree implementation with extra prefix support
-
rstrie
A generalized Trie implementation for Rust
-
boggle-maker
Rust tools for Boggle enthusiasts: board generation and analysis
-
poetrie
Poetic trie crafted with intetion to ease searching of rhymes for poems
-
katac
command-line application to streamline the process of practicing coding katas
-
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
-
darts-clone-rs
Rust binding of a clone of Darts (Double-ARray Trie System)
-
fs-tree
Filesystem path Trie with an API focused on filesystem operations
-
goodrouter
a bi directional trie router for all your routing needs
-
region-cn
A lib to search chinese region by 6-digit administrative code with trier or search in place
-
radixmap
Rust-based Radix Tree for fast prefix lookup, supporting named param, glob, regex
-
uv-cache-info
internal component crate of uv
-
trie_rcv
Ranked Choice Voting implementation using Tries in Rust
-
sequence_trie
Trie-like data-structure for storing sequences of values
-
ipnet-trie
IPv4 and IPv6 network fast lookup trie
-
radix_trees
Various radix tree (trie) data structures
-
qptrie
A QP-Trie implementation for Rust
-
marisa-rs
Safe Rust wrapper for the marisa-trie C++ library
-
marisa-ffi
Rust FFI bindings for libmarisa - a space-efficient trie data structure
-
pavex_matchit
A fork of matchit, to get some unreleased fixes in Pavex
-
wayback-rpki
A command-line tool to provide API for RPKI ROAs lookup with historical data
-
crawdad-rkyv
Crawdad: ChaRActer-Wise Double-Array Dictionary with rkyv support
-
trying
Basic trie crate
-
ip_network_table-deps-treebitmap
Forked version of fast IPv4/IPv6 lookup trie
-
comtains
Zero-allocation byte-set matcher generated at compile time
-
pons
Rust package for contract bridge
-
easy-trie
trie implementation in Rust
-
arca
Various utilities used in my crates
-
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
-
trie
An ordered map and set based on a trie
-
crawdad
ChaRActer-Wise Double-Array Dictionary
-
lr_rust_shared_structs
shared_structs sub library for lr_rust
-
bitstring-trees
Trees based on bitstrings
-
ternary-tree
Ternary Search Trees, with no unsafe blocks
-
fast_trie
A memory efficient trie library
-
shared_structs
sub library for hfytr's parsing library
-
libdarts-sys
Low level native binding to darts-clone
-
u8_ternary_tree
A Ternary Search Tree based on [u8] input and output
-
scopegraphs-prust-lib
fork of prust for scopegraphs
-
prefix_tree_map
generic prefix tree (trie) map with wildcard capture support
-
wildcard-trie
A space-efficient router / radix-trie that supports wildcards
-
ipcheck-rs
A command tool generates typescript ip checker from CIDR
-
quotick
Embedded tick market data (trade, quote, ..) database storage optimized for billions of data points
-
trie-db-fun
Merkle-Patricia Trie generic over key hasher and node encoding
-
bit-parallelism
Small integer specialized, word level, parallel algorithms and data structures
-
kv-trie-rs
KV capable prefix trie library based on LOUDS
-
ruchei-collections
Collections to support the implementation of ruchei
-
kermit-iters
Iterators used in Kermit
-
ranagrams
anagram discovery tool
-
clash_rules
a clash yaml rule parser and matching algorithms provider
-
igo-rs
Pure Rust port of the Igo, a POS(Part-Of-Speech) tagger for Japanese (日本語 形態素解析)
-
settrie
Fast subset and superset queries
-
hash-trie
Hash Array Mapped Trie (HAMT) Immutable Set Implementation
-
twie
fast and compact prefix tries
-
forestrie
Quick string matches
-
tongrams
Tons of N-grams
-
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.
-
unicode-id-trie-rle-derived-core-properties
A parser for the unicode database DerivedCoreProperties.txt file used in the unicode-id-trie-rle crate
-
trie-match
Fast match macro
-
cmap
Concurrent multi-writer hash-map using trie
-
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
-
hat_trie
A hat-trie implementation that support prefix match iteration
-
fr-trie
Fuzzy Radix Trie
-
artsy
ART Tree data structure library
-
pruning_radix_trie
Pruning Radix Trie, originally by Wolf Garbe
-
forestrie-builder
Build a trie and convert it TokenStream
-
contrie
Concurrent map and set
-
prfx
Prefix Tree
-
adivon
Data Structures of daily use: Graph, HashTable, PriorityQueue, Trie, SuffixTree, Rope, SplayTree, SkipList, RedBlackTree
-
suggestion_trie
A Radix trie for suggestion search, it allows to search for data indexed by a set of keywords fast
-
sp-io
I/O for Substrate runtimes
-
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
-
roggle
A Boggle solver written in Rust!
-
fast_trie_tree
A fast
TrieTreefor multiple data types -
littlechestnutgames-trie
A generalized trie implementation for quick prefix searching
-
alloy-trie
Fast Merkle-Patricia Trie (MPT) state root calculator and proof generator for prefix-sorted nibbles
-
trie-generic
A trie with generic content
-
sp-trie
Patricia trie stuff using a parity-scale-codec node format
-
weighted_trie
Weighted prefix trie for autosuggestions
-
darts
A double array trie, A Forward Maximum Matching Searcher
-
interned-string
High-performance and concurrent string interning for general purpose use
-
nomt
Nearly Optimal Merkle Trie - Schema and Database
-
librualg
Collection of basic algorithms for everyday development
-
sc-state-db
State database maintenance. Handles canonicalization and pruning in the 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
-
reference-trie
reference trie format
-
lighter
Macro for rewriting string matches as tries
-
smoldot
Primitives to build a client for Substrate-based blockchains
-
pour
Optionally consed radix tries for fast set operations
-
waffle-trie
Trie mapping for waffle
-
hardly-trie
efficient trie data structure implementation
-
rust-cedar
efficiently-updatable double-array trie in Rust (ported from cedar)
-
transition-table
transition table utilities for keyword parser
-
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
-
another_radix_trie
Rust built radix tree library
-
pex-trie
A parser combinator library for Rust
-
simple_trie
array backed trie
-
trie_map
A trie with good iterator support backed by a hashmap
-
search-autocompletion
Search Auto Completion
-
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
-
radixdb
a radix tree data structure for in memory or zero copy on disk storage
-
ab-radix-trie
A compressed radix trie implementation supporting matching rules
-
nutrimatic
Tools for reading Nutrimatic (https://nutrimatic.org) index files
-
dawgdic
Port of DAFSA in safe Rust (original implementation courtesy to Susumu Yata)
-
kona-mpt
interacting with and iterating through a merkle patricia trie
-
firewood-storage
Storage layer for Firewood, an embedded key-value store optimized for blockchain state
-
substrate-state-trie-migration-rpc
Node-specific RPC methods for interaction with state trie migration
-
very_simple_trie
A Trie or prefix tree is a specialized tree-like data structure used for efficient storage
-
ddk-trie
Data structures for storage and retrival of numerical Discreet Log Contracts (DLC)
-
bm-le
Little endian 256-bit layer for binary merkle trie with ssz compatibility and extensions
-
dyld-trie
A little library for parsing Dyld trie
-
v-trie
Just a generic compressed prefix tree
-
peel
Dynamic packet parsing within trees
-
char_trie
Text segmentation based on trie tree, High performance, support for custom dictionary
Try searching with DuckDuckGo or on crates.io.