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

use super::subtree::sealed::SubTreeCore;
use crate::{
    Dfs, MemoryPolicy, NodeMut, NodeMutOrientation, NodeRef, TreeVariant,
    node_ref::NodeRefCore,
    pinned_storage::PinnedStorage,
    traversal::{OverDepthData, traverser_core::TraverserCore},
};
use orx_selfref_col::NodePtr;

pub struct MovedSubTree<'a, V, M, P, MO>
where
    V: TreeVariant + 'a,
    M: MemoryPolicy,
    P: PinnedStorage,
    MO: NodeMutOrientation,
{
    node: NodeMut<'a, V, M, P, MO>,
}

impl<'a, V, M, P, MO> MovedSubTree<'a, V, M, P, MO>
where
    V: TreeVariant + 'a,
    M: MemoryPolicy,
    P: PinnedStorage,
    MO: NodeMutOrientation,
{
    pub(crate) fn new(node: NodeMut<'a, V, M, P, MO>) -> Self {
        Self { node }
    }
}

impl<'a, V, M, P, MO> SubTreeCore<V> for MovedSubTree<'a, V, M, P, MO>
where
    V: TreeVariant + 'a,
    M: MemoryPolicy,
    P: PinnedStorage,
    MO: NodeMutOrientation,
{
    fn root_ptr(&self) -> NodePtr<V> {
        self.node.node_ptr()
    }

    fn root_parent_ptr(&self) -> Option<NodePtr<V>> {
        self.node.parent_ptr()
    }

    fn root_sibling_idx(&self) -> usize {
        self.node.sibling_idx()
    }

    fn create_subtree(&mut self) -> impl IntoIterator<Item = (usize, <V>::Item)> {
        let node = unsafe { self.node.clone_node_mut() };
        Dfs::<OverDepthData>::into_iter_with_owned_storage(node)
    }
}