tui-treelistview 0.2.0

Interactive tree list widget for Ratatui
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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90

use crate::model::{TreeChildren, TreeModel};

type PostorderFrame<'a, Id> = (Id, Option<&'a [Id]>);

pub struct TreeWalkNode<'a, Id> {
    pub parent: Option<Id>,
    pub id: Id,
    pub children: TreeChildren<'a, Id>,
}

pub struct TreeWalk<'a, T: TreeModel> {
    model: &'a T,
    stack: Vec<(Option<T::Id>, T::Id)>,
}

impl<'a, T: TreeModel> TreeWalk<'a, T> {
    pub fn forest(model: &'a T) -> Self {
        let mut stack = Vec::with_capacity(model.size_hint().min(1024));
        stack.extend(model.roots().map(|id| (None, id)));
        stack.reverse();
        Self { model, stack }
    }

    pub fn subtree(model: &'a T, parent: Option<T::Id>, root: T::Id) -> Self {
        Self {
            model,
            stack: vec![(parent, root)],
        }
    }
}

impl<'a, T: TreeModel> Iterator for TreeWalk<'a, T> {
    type Item = TreeWalkNode<'a, T::Id>;

    #[inline]
    fn next(&mut self) -> Option<Self::Item> {
        let (parent, id) = self.stack.pop()?;
        let children = self.model.children(id);
        self.stack.extend(
            children
                .loaded_slice()
                .iter()
                .rev()
                .copied()
                .map(|child| (Some(id), child)),
        );
        Some(TreeWalkNode {
            parent,
            id,
            children,
        })
    }
}

pub struct TreePostorderNode<'a, Id> {
    pub id: Id,
    pub children: &'a [Id],
}

pub struct TreePostorder<'a, T: TreeModel> {
    model: &'a T,
    stack: Vec<PostorderFrame<'a, T::Id>>,
}

impl<'a, T: TreeModel> TreePostorder<'a, T> {
    pub fn forest(model: &'a T) -> Self {
        let mut stack = Vec::with_capacity(model.size_hint().min(1024));
        stack.extend(model.roots().map(|id| (id, None)));
        stack.reverse();
        Self { model, stack }
    }
}

impl<'a, T: TreeModel> Iterator for TreePostorder<'a, T> {
    type Item = TreePostorderNode<'a, T::Id>;

    #[inline]
    fn next(&mut self) -> Option<Self::Item> {
        loop {
            let (id, children) = self.stack.pop()?;
            if let Some(children) = children {
                return Some(TreePostorderNode { id, children });
            }
            let children = self.model.children(id).loaded_slice();
            self.stack.push((id, Some(children)));
            self.stack
                .extend(children.iter().rev().copied().map(|child| (child, None)));
        }
    }
}