bst-hashmap 0.1.0

A binary tree implementation with a hashmap-inspired interface.
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

use crate::bst::{Bst, NodeRef};

#[derive(Default)]
pub struct BstHashmap<T: Ord, V>{
    pub bst: Bst<T, V>
}

impl <T: Ord + Clone, V: Clone> BstHashmap<T, V> {
    pub fn insert(&mut self, key: T, value: V) {
        self.bst.insert(key, value);
    }

    pub fn search(&self, key: T) -> Option<V> {
        let node: NodeRef<T, V> = self.bst.search(key);
        match node {
            Some(node) => Some(node.borrow().value.clone()),
            None => None
        }
    }

    pub fn min(&self, key: T) -> Option<(T,V)> {
        let node = self.bst.search(key);
        let min: NodeRef<T, V> = self.bst.min(node);
        match min {
            Some(min_node) => Some((min_node.borrow().key.clone(), min_node.borrow().value.clone())),
            None => None
        }
    }
    
    pub fn max(&self, key: T) -> Option<(T,V)> {
        let node = self.bst.search(key);
        let max: NodeRef<T, V> = self.bst.max(node);
        match max {
            Some(max_node) => Some((max_node.borrow().key.clone(), max_node.borrow().value.clone())),
            None => None
        }
    }

    pub fn remove(&mut self, key: T){
        let node = self.bst.search(key);
        self.bst.remove(node);
    }
}