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

use std::mem;
use std::ptr;

use super::innerptr::InnerPtr;
use super::traits::JpmNode;
use ::Key;
use ::rudymap::results::InsertResult;

pub struct BranchUncompressed<K: Key, V> {
    array: [InnerPtr<K, V>; 256]
}

impl<K: Key, V> BranchUncompressed<K, V> {
    pub fn new() -> BranchUncompressed<K, V> {
        unsafe {
            let mut branch = BranchUncompressed {
                array: { mem::uninitialized() }
            };
            for position in branch.array.iter_mut() {
                ptr::write(position, InnerPtr::empty());
            }
            branch
        }
    }
}

impl<K: Key, V> JpmNode<K, V> for BranchUncompressed<K, V> {
    fn get(&self, key: &[u8]) -> Option<&V> {
        let (&byte, subkey) = key.split_first().unwrap();
        self.array[byte as usize].get(subkey)
    }

    fn get_mut(&mut self, key: &[u8]) -> Option<&mut V> {
        let (&byte, subkey) = key.split_first().unwrap();
        self.array[byte as usize].get_mut(subkey)
    }

    fn insert(&mut self, key: &[u8], value: V) -> InsertResult<V> {
        let (&byte, subkey) = key.split_first().unwrap();
        let evicted = self.array[byte as usize].insert(subkey, value);
        InsertResult::Success(evicted)
    }

    fn expand(self, population: usize, key: &[u8], value: V) -> InnerPtr<K, V> {
        unreachable!()
    }
}