https://github.com/michaelsproul/rust_sequence_trie

Ergonomic trie data structure
https://github.com/michaelsproul/rust_sequence_trie

data-structures rust trie

Last synced: 5 days ago
JSON representation

Ergonomic trie data structure

• Host: GitHub
• URL: https://github.com/michaelsproul/rust_sequence_trie
• Owner: michaelsproul
• License: other
• Created: 2014-08-27T05:50:16.000Z (over 10 years ago)
• Default Branch: master
• Last Pushed: 2018-10-30T03:23:53.000Z (about 6 years ago)
• Last Synced: 2024-12-13T11:57:41.365Z (11 days ago)
• Topics: data-structures, rust, trie
• Language: Rust
• Homepage: https://docs.rs/sequence_trie/
• Size: 103 KB
• Stars: 26
• Watchers: 5
• Forks: 21
• Open Issues: 11
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGELOG.md
  • License: LICENSE-APACHE

Awesome Lists containing this project

README

        
[Sequence Trie][doc]

====

[![Build Status](https://travis-ci.org/michaelsproul/rust_sequence_trie.svg?branch=master)](https://travis-ci.org/michaelsproul/rust_sequence_trie)

This is a generic Trie implementation that uses a hash map to store child nodes. The Trie is keyed by lists of type `K`, which can be anything implementing `PartialEq`, `Eq`, `Hash` and `Clone`. If your keys are explicit lists and you want to be able to store a different value for each element of a key, this might be the data structure for you!

For more information, see the [API documentation][doc].

[doc]: https://docs.rs/sequence_trie/

# Usage

Add `sequence_trie` to your `Cargo.toml`.

```toml

[dependencies]

sequence_trie = "*"

```

# See Also

* [Radix Trie][radix-trie] – a trie operating on byte-strings, with better performance and a less ergonomic API.

[radix-trie]: https://github.com/michaelsproul/rust_radix_trie

# License

Licensed under either of:

 * [Apache License, Version 2.0](http://www.apache.org/licenses/LICENSE-2.0)

 * [MIT license](http://opensource.org/licenses/MIT)

at your option.

## Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted

for inclusion in the work by you shall be dual licensed as above, without any

additional terms or conditions.