byte_trie 0.3.0

A compressed trie based on bytes with some weird child node bucket sizes.
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74

use crate::keys::{BitKey, ByteKey, NibbleKey};
pub use crate::BytesTrie;
use crate::{AdaptiveNode, BytesKey};

#[derive(Debug)]
pub struct ByteTrie<T> {
    pub(crate) root: AdaptiveNode<ByteKey, T>,
}

/// A specialized byte based trie with many different sized nodes
///
/// Currently insert only, as that's the only functionality that I needed.
impl<T> BytesTrie<T> for ByteTrie<T> {
    fn new() -> Self {
        Self {
            root: AdaptiveNode::default(),
        }
    }

    fn insert(&mut self, key: &[u8], value: T) {
        let key = ByteKey::from_bytes(&key);
        self.root.insert(key, Some(value));
    }
}

impl<T> Default for ByteTrie<T> {
    fn default() -> Self {
        Self::new()
    }
}

pub struct NibbleTrie<T> {
    pub(crate) root: AdaptiveNode<NibbleKey, T>,
}

impl<T> BytesTrie<T> for NibbleTrie<T> {
    fn new() -> Self {
        Self {
            root: AdaptiveNode::default(),
        }
    }

    fn insert(&mut self, key: &[u8], value: T) {
        let key = NibbleKey::from_bytes(&key);
        self.root.insert(key, Some(value))
    }
}

#[derive(Debug)]
pub struct BitTrie<T> {
    pub(crate) root: AdaptiveNode<BitKey, T>,
}

/// A specialized byte based trie with many different sized nodes
///
/// Currently insert only, as that's the only functionality that I needed.
impl<T> BytesTrie<T> for BitTrie<T> {
    fn new() -> Self {
        Self {
            root: AdaptiveNode::default(),
        }
    }

    fn insert(&mut self, key: &[u8], value: T) {
        let key = BitKey::from_bytes(&key);
        self.root.insert(key, Some(value));
    }
}

impl<T> Default for BitTrie<T> {
    fn default() -> Self {
        Self::new()
    }
}