arbutus 0.1.5

Arbutus Trees
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77

use std::collections::BTreeMap;

use crate::{
    node::TreeNode,
    noderef::{NodeRefId, TreeNodeRef},
    Tree, UniqueGenerator,
};

pub trait TreeIndex<R>
where
    R: TreeNodeRef,
{
    fn new() -> Self;
    fn from_tree<G: UniqueGenerator>(tree: &Tree<R, G>) -> Self
    where
        G: UniqueGenerator<Output = NodeRefId<R>> + 'static;
    fn from_node(node: &R) -> Self;
    fn insert(&mut self, id: <<R as TreeNodeRef>::Inner as TreeNode>::Id, node: R);
    fn get(&self, id: &<<R as TreeNodeRef>::Inner as TreeNode>::Id) -> Option<&R>;
    fn get_mut(&mut self, id: &<<R as TreeNodeRef>::Inner as TreeNode>::Id) -> Option<&mut R>;
    fn remove(&mut self, id: &<<R as TreeNodeRef>::Inner as TreeNode>::Id) -> Option<R>;
    fn get_ids(&self) -> Vec<<<R as TreeNodeRef>::Inner as TreeNode>::Id>;
}

#[derive(Debug)]
pub struct BTreeIndex<R>
where
    R: TreeNodeRef,
{
    index: BTreeMap<<<R as TreeNodeRef>::Inner as TreeNode>::Id, R>,
}

impl<R> TreeIndex<R> for BTreeIndex<R>
where
    R: TreeNodeRef + IntoIterator + Clone,
{
    fn new() -> Self {
        Self {
            index: BTreeMap::new(),
        }
    }

    fn from_tree<G: UniqueGenerator>(tree: &Tree<R, G>) -> Self
    where
        G: UniqueGenerator<Output = NodeRefId<R>> + 'static,
    {
        Self::from_node(&tree.root())
    }

    fn from_node(node: &R) -> Self {
        let mut index = Self::new();
        for node in node.clone().into_iter() {
            index.insert(node.node().id().clone(), node.clone());
        }
        index
    }

    fn insert(&mut self, id: <<R as TreeNodeRef>::Inner as TreeNode>::Id, node: R) {
        self.index.insert(id, node);
    }

    fn get(&self, id: &<<R as TreeNodeRef>::Inner as TreeNode>::Id) -> Option<&R> {
        self.index.get(id)
    }

    fn get_mut(&mut self, id: &<<R as TreeNodeRef>::Inner as TreeNode>::Id) -> Option<&mut R> {
        self.index.get_mut(id)
    }

    fn remove(&mut self, id: &<<R as TreeNodeRef>::Inner as TreeNode>::Id) -> Option<R> {
        self.index.remove(id)
    }

    fn get_ids(&self) -> Vec<<<R as TreeNodeRef>::Inner as TreeNode>::Id> {
        self.index.keys().map(|k| *k).collect()
    }
}