summaryrefslogtreecommitdiffstats
path: root/src/ntree.rs
blob: 26c241cf33a096b12cd65311da90f399b948665f (plain) (blame)
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
78
79
80
81

#[derive(Clone)]
pub struct NTreeNode<T>
{
    value: T,
    children: Vec<NTreeNode<T>>

}

#[derive(Default, Clone)]
pub struct NTree<T>
{
    root: Option<NTreeNode<T>>
}

impl<T> NTree<T>
{
    pub fn set_root_val(
        &mut self,
        val: T)
    {
        self.root = Some(NTreeNode { value: val, children: vec![] });
    }

    pub fn set_root(
        &mut self,
        node: NTreeNode<T>)
    {
        self.root = Some(node);
    }

    pub fn root(&self) -> &Option<NTreeNode<T>> { &self.root }
    pub fn root_mut(&mut self) -> &mut Option<NTreeNode<T>> { &mut self.root }
}

impl<T> NTreeNode<T>
{
    pub fn new(val: T)
    -> Self
    {
        Self {
            value: val,
            children: vec![]
        }
    }
    
    pub fn value(&self) -> &T { &self.value }
    pub fn value_mut(&mut self) -> &mut T { &mut self.value }

    pub fn children(&self) -> &[NTreeNode<T>] { &self.children.as_slice() }

    pub fn as_tree(self)
    -> NTree<T> 
    {
        NTree { root: Some(self) }
    }

    pub fn insert_value(
        &mut self,
        val: T)
    {
        self.children.push(NTreeNode { value: val, children: vec![] });
    }

    pub fn insert_node(
        &mut self,
        subtree: NTreeNode<T>)
    {
        self.children.push(subtree);
    }

    pub fn insert_tree(
        &mut self,
        subtree: NTree<T>)
    {
        match subtree.root {
            Some(subtree_root) => self.insert_node(subtree_root),
            None => { panic!("Tried to put null subtree") }
        }
    }
}