A compressed trie based on bytes with some weird child node bucket sizes.
Macro for rewriting string matches as tries
Procedural macros for the lighter crate
Safe Rust wrapper for the marisa-trie C++ library
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes.
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes.
submillisecond.com cookbook recipe - data-structures: subms-adaptive-radix-tree. ART with Node4 / Node256 adaptive variants on byte-string keys.
Fast, thread-safe FLIRT (Fast Library Identification and Recognition Technology) signature parser and matcher.
Zero-allocation byte-set matcher generated at compile time
Fast implementation of a trie data structure
Procedural macro that builds comtains byte-set matchers
Generic trie data structure implementation (prefix tree) with support for different key and value types, and functions to search for common prefixes or postfixes.
No description provided.
No description provided.