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

use crate::TreeVariant;
use orx_selfref_col::NodePtr;

/// Ancestors iterators which starts from a node and yields nodes bottom-up until the root
/// of the tree is reached.
pub struct AncestorsIterPtr<V>
where
    V: TreeVariant,
{
    root_ptr: NodePtr<V>,
    current: Option<NodePtr<V>>,
}

impl<V: TreeVariant> AncestorsIterPtr<V> {
    pub(crate) fn new(root_ptr: NodePtr<V>, descendant_ptr: NodePtr<V>) -> Self {
        Self {
            root_ptr,
            current: Some(descendant_ptr),
        }
    }
}

impl<V: TreeVariant> Iterator for AncestorsIterPtr<V> {
    type Item = NodePtr<V>;

    fn next(&mut self) -> Option<Self::Item> {
        self.current.inspect(|&ptr| {
            let node = unsafe { &*ptr.ptr() };

            self.current = match ptr == self.root_ptr {
                false => node.prev().get(),
                true => None,
            };
        })
    }
}

impl<V: TreeVariant> Clone for AncestorsIterPtr<V> {
    fn clone(&self) -> Self {
        Self {
            root_ptr: self.root_ptr,
            current: self.current,
        }
    }
}

unsafe impl<V: TreeVariant> Send for AncestorsIterPtr<V> where V::Item: Send {}

unsafe impl<V: TreeVariant> Sync for AncestorsIterPtr<V> where V::Item: Sync {}