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

use super::reclaimer::DaryReclaimer;
use crate::TreeVariant;
use core::marker::PhantomData;
use orx_selfref_col::{RefsArrayLeftMost, RefsSingle, Variant};

/// A dynamic tree where each of the nodes might have any number of child nodes.
pub struct Dary<const D: usize, T> {
    p: PhantomData<T>,
}

/// # SAFETY
///
/// Tree variants do not hold any data; and hence, safe to sync.
unsafe impl<const D: usize, T> Sync for Dary<D, T> {}

/// # SAFETY
///
/// Tree variants do not hold any data; and hence, safe to sync.
unsafe impl<const D: usize, T> Send for Dary<D, T> {}

impl<const D: usize, T> Variant for Dary<D, T> {
    type Item = T;

    type Prev = RefsSingle<Self>;

    type Next = RefsArrayLeftMost<D, Self>;

    type Ends = RefsSingle<Self>;
}

impl<const D: usize, T> TreeVariant for Dary<D, T> {
    type Reclaimer = DaryReclaimer;

    type Children = RefsArrayLeftMost<D, Self>;
}