Rust Radix Trie

This is a Radix Trie implementation in Rust, building on the lessons learnt from TrieMap and Sequence Trie.

Features

• Compressed nodes. Common key prefixes are stored only once.
• Key Generic. Any type that can be serialised as a vector of bytes can be used as a key.
• Safe. No unsafe code (yet).

Usage

Available on Crates.io as radix_trie.

[dependencies]
radix_trie = "*"

Documentation

https://michaelsproul.github.io/rust_radix_trie/

To Do

• Add Trie-specific methods for prefixes, successors, etc.
• Implement the Entry API.
• Add iterators.

License

MIT License. Copyright (c) Michael Sproul 2015.