qptrie 0.2.1

A QP-Trie implementation for Rust
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

A QP-Trie implementation for Rust
=================================

[API documentation](https://docs.rs/qptrie)

A qp-trie implementation for Rust

A [qp-trie](http://dotat.at/prog/qp/) is a fast and compact associative array
optimized for short keys.

It is similar to a crit-bit trie, with a larger fan-out per internal node.

It supports the following operations at high speed:

* See whether a key is in the trie and retrieve an optional associated value
* Add a `(key, value)` pair to the trie
* Remove a key from the trie
* Find all keys matching a given prefix

This implementation uses 4 bits per index and doesn't require strings to be
zero-terminated: keys can be made of arbitrary binary data.

# Example
```rust
extern crate qptrie;
use qptrie::Trie;

let mut trie = Trie::default();
trie.insert("key number one", 1);
trie.insert("key number two", 2);

let v = trie.get(&"key number one").unwrap();

for (k, v) in trie.prefix_iter(&"key").include_prefix() {
     println!("{} => {}", k, v);
}

trie.remove(&"key number one");
```