A Rust implementation of generic prefix tree (trie) map with wildcard capture support
A prefix tree (map and set), implemented without any unsafe
Memory efficient trie (prefix tree) and map library based on LOUDS
A map and set interfaces using trie data structure
Persistent hash map based on CHAMP — canonical form, O(1) structural equality via AdHash, COW structural sharing
Binary that integrates XLS capabilities into a driver program
A highly parallel Perl 5 interpreter written in Rust
Pure-Rust AV1 codec — orphan-rebuild scaffold pending clean-room re-implementation.
Persistent & Immutable Data Structures in Rust
fork of [prust](https://github.com/victorcolombo) for [scopegraphs](http://docs.rs/scopegraphs)
Prefix trie (tree) datastructure (both a set and a map) that provides exact and longest-prefix matches.
High-performance Adaptive Radix Tree implementation with SIMD optimizations
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.