artful 0.1.1

Low-memory overhead and high-performance adaptive radix tree
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

use crate::ArtKey;

#[repr(align(8))]
pub(crate) struct Leaf<K: ArtKey, V> {
    pub(crate) key: K,
    pub(crate) val: V,
}

impl<K: ArtKey, V> Leaf<K, V> {
    pub(crate) fn new(key: K, val: V) -> Leaf<K, V> {
        Leaf { key, val }
    }

    pub(crate) fn matches(&self, key: &[u8]) -> bool {
        let leaf_key = self.key.get_bytes();
        if leaf_key.len() != key.len() {
            return false;
        }

        return leaf_key == key;
    }
}