orx-tree 2.2.0

A beautiful tree 🌳 with convenient, efficient, parallelizable growth, mutation and traversal features.
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 super::enumeration::Enumeration;

#[derive(Clone)]
pub struct Val;
impl Enumeration for Val {
    type Item<D> = D;

    #[inline(always)]
    fn node_data<D>(element: &Self::Item<D>) -> &D {
        element
    }

    #[inline(always)]
    fn map_node_data<D, M, E>(element: Self::Item<D>, map: M) -> Self::Item<E>
    where
        M: FnOnce(D) -> E,
    {
        map(element)
    }
}

#[derive(Clone)]
pub struct DepthVal;
impl Enumeration for DepthVal {
    type Item<D> = (usize, D);

    #[inline(always)]
    fn node_data<D>(element: &Self::Item<D>) -> &D {
        &element.1
    }

    #[inline(always)]
    fn map_node_data<D, M, E>(element: Self::Item<D>, map: M) -> Self::Item<E>
    where
        M: FnOnce(D) -> E,
    {
        (element.0, map(element.1))
    }
}

#[derive(Clone)]
pub struct SiblingIdxVal;
impl Enumeration for SiblingIdxVal {
    type Item<D> = (usize, D);

    #[inline(always)]
    fn node_data<D>(element: &Self::Item<D>) -> &D {
        &element.1
    }

    #[inline(always)]
    fn map_node_data<D, M, E>(element: Self::Item<D>, map: M) -> Self::Item<E>
    where
        M: FnOnce(D) -> E,
    {
        (element.0, map(element.1))
    }
}

#[derive(Clone)]
pub struct DepthSiblingIdxVal;
impl Enumeration for DepthSiblingIdxVal {
    type Item<D> = (usize, usize, D);

    #[inline(always)]
    fn node_data<D>(element: &Self::Item<D>) -> &D {
        &element.2
    }

    #[inline(always)]
    fn map_node_data<D, M, E>(element: Self::Item<D>, map: M) -> Self::Item<E>
    where
        M: FnOnce(D) -> E,
    {
        (element.0, element.1, map(element.2))
    }
}