indextreemap 0.2.0

A BTreeMap-like ordered map with key and positional lookup.
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

use crate::{
    stc::{Item, Node, Pointer},
    KEY_ARRAY, POINTER_ARRAY,
};

impl<K, V> Node<K, V> {
    pub fn take_keys(&mut self) -> [Option<Item<K, V>>; KEY_ARRAY] {
        let mut array: [Option<Item<K, V>>; KEY_ARRAY] = Default::default();

        #[allow(clippy::needless_range_loop)]
        for index in 0..KEY_ARRAY {
            array[index] = self.keys[index].take();
        }
        array
    }
    pub fn take_pointers(&mut self) -> [Option<Pointer<K, V>>; POINTER_ARRAY] {
        let mut array: [Option<Pointer<K, V>>; POINTER_ARRAY] = Default::default();

        #[allow(clippy::needless_range_loop)]
        for index in 0..POINTER_ARRAY {
            array[index] = self.pointers[index].take();
        }
        array
    }
}

impl<K: Ord, V> Node<K, V> {
    pub fn take_last_key(&mut self) -> Option<Item<K, V>> {
        for index in (0..KEY_ARRAY).rev() {
            match &self.keys[index] {
                Some(_) => {
                    let output = self.keys[index].take();
                    if output.is_some() {
                        self.n -= 1;
                    }
                    if self.leaf {
                        self.replace_removed_key(index)
                    }
                    return output;
                }
                None => continue,
            }
        }
        None
    }
}