nb-tree 0.2.0-alpha01

Very simple tree structure with generic node and branch data.
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

use crate::prelude::Path;

use self::{absolute::Absolute, skip_below::SkipBelow};

pub mod absolute;
//pub mod combine;
pub mod depth;
pub mod skip_below;
pub mod sortable;
pub mod width;

#[derive(Debug, PartialEq)]
pub struct TraversalNode<N, B> {
    pub path: Path<B>,
    pub data: N,
}

pub trait TreeIterTools: Iterator + Sized {
    fn absolute<B>(self) -> Absolute<Self, B> {
        Absolute::new(self)
    }

    fn skip_below<P, B>(self, predicate: P) -> SkipBelow<Self, P, B>
    where
        P: FnMut(&Self::Item) -> bool,
        Self: std::marker::Sized,
    {
        SkipBelow::new(self, predicate)
    }
}

impl<T: Iterator + Sized> TreeIterTools for T {}