sequence_trie 0.3.2

Trie-like data-structure for storing sequences of values.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42

[Sequence Trie][doc]
====

[![Build Status](https://travis-ci.org/michaelsproul/rust_sequence_trie.svg)](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 fragment of a key, this might be the data structure for you!

I'm still undecided about what to call this data-structure, as it's kind of half-way between an unbounded tree and a trie... Suggestions welcome.

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

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

# Usage

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

```toml
[dependencies]
sequence_trie = "*"
```

# See Also

Since writing this sequence trie I've created a radix trie which uses node compression. It has *much* better performance and has reached feature-parity.

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.