flange-flat-tree 0.2.2

A tree that can be expanded by attaching new values to the node without mutability of the old ones
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

/*! The vec tree is the basic data structure
for a tree.
It stores it values in a vector.

When you use a `Builder` you reate a `VecTree`.
*/

use crate::navigator::Navigator;

use super::subtree::subtree_impl::SubtreeImpl;
use super::{tree_data::TreeData, Tree};

pub struct VecTree<A> {
    pub nav: Navigator,
    pub values: Vec<A>,
}

impl<'a, A> TreeData for &'a VecTree<A> {
    type Node = &'a A;

    fn get(self, index: usize) -> Self::Node {
        &self.values[index]
    }

    fn count(self) -> usize {
        self.values.len()
    }

    fn get_nav(&self) -> &Navigator {
        &self.nav
    }
}

impl<'a, A> Tree<'a> for VecTree<A>
where
    A: 'a,
{
    type Node = &'a A;
    type SubtreeType = SubtreeImpl<&'a VecTree<A>>;

    fn at_pos(&'a self, index: usize) -> Self::SubtreeType {
        SubtreeImpl::new(self, index)
    }

    fn get_nav(&self) -> &Navigator {
        &self.nav
    }
}