Classic trie implementation capable of mapping any T to char iterator.
Fast in-memory IP prefix routing tables for IPv4 and IPv6. Longest Prefix Match via stride-4 treebitmap, built on ipnetx.
High-performance Adaptive Radix Tree implementation with SIMD optimizations
Sans-I/O ZMTP codec, message types, and routing logic. Backend-agnostic core for omq-tokio / omq-compio.
Procedural macros for the lighter crate
Macro for rewriting string matches as tries
Production HTTP server for the lexrs lexicon library
OpenEPD: open, fused English IPA pronunciation dictionary (~280k US English words). Misaki + CMUdict + WikiPron, canonical IPA with provenance and frequency-derived rarity. CC-BY-SA 4.0.
The extremely fast, zero-overhead HTTP engine for the Chopin framework.
Levenshtein/Universal Automata for approximate string matching using various dictionary backends
The first compiled Unix shell — bytecode VM, worker pool, AOP intercept, Rkyv caching
Routing middleware for Hyper http library using Prefix tree (trie) for path finding.