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

use super::subtree::sealed::SubTreeCore;
use crate::{
    Dfs, MemoryPolicy, NodeRef, TreeVariant,
    pinned_storage::PinnedStorage,
    traversal::{over::OverDepthPtr, traverser_core::TraverserCore},
};
use core::marker::PhantomData;
use orx_selfref_col::NodePtr;

pub struct ClonedSubTree<'a, V, M, P, N>
where
    V: TreeVariant + 'a,
    M: MemoryPolicy,
    P: PinnedStorage,
    N: NodeRef<'a, V, M, P>,
    V::Item: Clone,
{
    node: N,
    phantom: PhantomData<&'a (V, M, P)>,
}

impl<'a, V, M, P, N> ClonedSubTree<'a, V, M, P, N>
where
    V: TreeVariant + 'a,
    M: MemoryPolicy,
    P: PinnedStorage,
    N: NodeRef<'a, V, M, P>,
    V::Item: Clone,
{
    pub(crate) fn new(node: N) -> Self {
        Self {
            node,
            phantom: PhantomData,
        }
    }
}

impl<'a, V, M, P, N> SubTreeCore<V> for ClonedSubTree<'a, V, M, P, N>
where
    V: TreeVariant + 'a,
    M: MemoryPolicy,
    P: PinnedStorage,
    N: NodeRef<'a, V, M, P>,
    V::Item: Clone,
{
    fn root_ptr(&self) -> NodePtr<V> {
        self.node.node_ptr()
    }

    fn root_parent_ptr(&self) -> Option<NodePtr<V>> {
        let root = unsafe { &*self.node.node_ptr().ptr() };
        root.prev().get()
    }

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

    fn create_subtree(&mut self) -> impl IntoIterator<Item = (usize, <V>::Item)> {
        let ptr = self.node.node_ptr();
        let iter_ptr = Dfs::<OverDepthPtr>::iter_ptr_with_owned_storage(ptr);
        iter_ptr.map(|(depth, ptr)| {
            (
                depth,
                unsafe { &*ptr.ptr() }
                    .data()
                    .expect("node is active")
                    .clone(),
            )
        })
    }
}