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

use super::traits::JpmNode;
use super::innerptr::{InnerPtr, IntoPtr};
use ::Key;
//use super::leaf_linear::LeafLinear;
use super::leaf_bitmap::LeafBitmap;
use super::branch_uncompressed::BranchUncompressed;
use super::branch_linear::BranchLinear;
use ::rudymap::results::InsertResult;

use std::marker::PhantomData;

#[derive(Copy, Clone)]
pub struct Empty<K: Key, V> {
    phantom: PhantomData<(K, V)>,
}

impl<K: Key, V> Empty<K, V> {
    pub fn new() -> Empty<K, V> {
        Empty {
            phantom: PhantomData
        }
    }
}

impl<K: Key, V> JpmNode<K, V> for Empty<K, V> {
    fn get(&self, key: &[u8]) -> Option<&V> {
        None
    }

    fn get_mut(&mut self, key: &[u8]) -> Option<&mut V> {
        None
    }

    fn insert(&mut self, key: &[u8], value: V) -> InsertResult<V> {
        InsertResult::Resize(value)
    }

    fn expand(self, pop: usize, key: &[u8], value: V) -> InnerPtr<K, V> {
        //let mut leaf_linear = Box::new(LeafLinear::new());
        //leaf_linear.insert(key, value).success();
        //leaf_linear
        if key.len() == 1 {
            let mut leaf = Box::new(LeafBitmap::new());
            leaf.insert(key, value).success();
            IntoPtr::into_ptr(leaf, pop)
        } else {
            let mut branch = Box::new(BranchLinear::new());
            branch.insert(key, value).success();
            IntoPtr::into_ptr(branch, pop)
        }
    }
}