rudy 0.0.1

Judy array implementation in pure 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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57

use std::iter::FromIterator;
use rudymap::root_leaf::RootLeaf;
use super::innerptr::InnerPtr;
use super::traits::JpmNode;
use ::rudymap::results::InsertResult;
use ::rudymap::rootptr::RootPtr;
use ::Key;

pub struct Jpm<K: Key, V> {
    head: InnerPtr<K, V>,
    len: usize
}

impl<K: Key, V> Jpm<K, V> {
    pub fn new() -> Jpm<K, V> {
        Jpm {
            head: InnerPtr::empty(),
            len: 0
        }
    }
}

impl<K: Key, V> RootLeaf<K, V> for Jpm<K, V> {
    fn get(&self, key: K) -> Option<&V> {
        let bytes = key.into_bytes();
        self.head.get(bytes.as_ref())
    }

    fn get_mut(&mut self, key: K) -> Option<&mut V> {
        let bytes = key.into_bytes();
        self.head.get_mut(bytes.as_ref())
    }

    fn insert(&mut self, key: K, value: V) -> InsertResult<V> {
        let bytes = key.into_bytes();
        InsertResult::Success(self.head.insert(bytes.as_ref(), value))
    }

    fn expand(mut self, key: K, value: V) -> RootPtr<K, V> {
        self.insert(key, value).success();
        Box::new(self).into()
    }

    fn len(&self) -> usize {
        self.len
    }
}

impl<K: Key, V> FromIterator<(K, V)> for Jpm<K, V> {
    fn from_iter<I>(iter: I) -> Self where I: IntoIterator<Item=(K, V)> {
        let mut jpm = Jpm::new();
        for (key, value) in iter {
            jpm.insert(key, value).success();
        }
        jpm
    }
}