radix_trie

Crates.ioradix_trie
lib.rsradix_trie
version0.2.1
sourcesrc
created_at2015-03-20 20:50:32.652844
updated_at2020-10-22 10:41:54.463635
descriptionGeneric radix trie data-structure.
homepage
repositoryhttps://github.com/michaelsproul/rust_radix_trie
max_upload_size
id1626
size711,662
Developers (github:braun-embedded:developers)

documentation

https://docs.rs/radix_trie/

README

Rust Radix Trie

Unix Build Status Windows Build Status

This is a Radix Trie implementation in Rust, building on the lessons learnt from TrieMap and Sequence Trie. You can read about my experience implementing this data structure here.

Help Wanted, Enquire Within

Since writing this code I haven't used it in anger (or production) so it is no doubt in need of some maintenance, testing and optimisation love. If you would like to help out, try solving an open issue, optimise something, or just have a poke around! Thanks :)

Features

  • Compressed nodes. Common key prefixes are stored only once.
  • Trie-specific methods to look-up closest ancestors and descendants.
  • Key Generic. Any type that can be serialised as a vector of bytes can be used as a key.
  • Safe - no unsafe code.

Documentation

https://docs.rs/radix_trie/

Usage

Available on Crates.io as radix_trie.

Just add radix_trie to the dependencies section of your Cargo.toml, like so:

radix_trie = "0.2"

Contributors

Made by:

License

MIT License. Copyright © Michael Sproul and contributors 2015-present.

Commit count: 129

cargo fmt