bernardo-tui 0.2.7

A keyboard-only, distraction-free TUI widget library
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120

use std::borrow::Cow;
use std::collections::HashSet;
use std::fmt::Debug;

use crate::fs::fsf_async_tree_iter::FsAsyncTreeIt;
use crate::fs::path::SPath;
use crate::primitives::common_query::CommonQuery;
use crate::primitives::tree::filter_policy::FilterPolicy;
use crate::primitives::tree::tree_node::{FilterRef, TreeItFilter, TreeNode};
use crate::promise::streaming_promise::StreamingPromise;
use log::error;

#[derive(Debug, Clone)]
pub struct DirTreeNode {
    sp: SPath,
}

impl DirTreeNode {
    pub fn new(sp: SPath) -> Self {
        DirTreeNode { sp }
    }

    pub fn spath(&self) -> &SPath {
        &self.sp
    }
}

#[derive(Debug, Clone)]
pub struct FileTreeNode {
    sp: SPath,
}

impl FileTreeNode {
    pub fn new(sp: SPath) -> Self {
        FileTreeNode { sp }
    }

    pub fn spath(&self) -> &SPath {
        &self.sp
    }
}

impl TreeNode<SPath> for FileTreeNode {
    fn id(&self) -> &SPath {
        &self.sp
    }

    fn label(&self) -> Cow<str> {
        self.sp.label()
    }

    fn is_leaf(&self) -> bool {
        self.sp.is_file()
    }

    fn child_iter(&self) -> Box<dyn Iterator<Item = Self> + '_> {
        match self.sp.blocking_list() {
            Ok(items) => Box::new(items.into_iter().map(FileTreeNode::new)) as Box<dyn Iterator<Item = Self>>,
            Err(e) => {
                error!("fail to call blocking_list for {:?} because {:?}", self, e);
                Box::new(std::iter::empty()) as Box<dyn Iterator<Item = Self>>
            }
        }
    }

    fn is_complete(&self) -> bool {
        true //TODO
    }

    fn get_streaming_promise_instead_of_iterator(
        &self,
        filter_op: Option<(FilterRef<FileTreeNode>, FilterPolicy)>,
        expanded_op: Option<HashSet<SPath>>,
    ) -> Option<Box<dyn StreamingPromise<(u16, Self)>>> {
        Some(Box::new(FsAsyncTreeIt::new(self.clone(), filter_op, expanded_op)))
        // TODO add expanded
    }
}

impl TreeNode<SPath> for DirTreeNode {
    fn id(&self) -> &SPath {
        &self.sp
    }

    fn label(&self) -> Cow<str> {
        self.sp.label()
    }

    fn is_leaf(&self) -> bool {
        self.child_iter().next().is_none()
    }

    fn child_iter(&self) -> Box<dyn Iterator<Item = Self> + '_> {
        match self.sp.blocking_list() {
            Ok(items) => Box::new(items.into_iter().filter(|c| c.is_dir()).map(DirTreeNode::new)) as Box<dyn Iterator<Item = Self>>,
            Err(e) => {
                error!("fail to call blocking_list for {:?} because {:?}", self, e);
                Box::new(std::iter::empty()) as Box<dyn Iterator<Item = Self>>
            }
        }
    }

    fn is_complete(&self) -> bool {
        true //TODO
    }
}

impl TreeItFilter<FileTreeNode> for CommonQuery {
    fn call(&self, node: &FileTreeNode) -> bool {
        let label = node.sp.label();
        self.matches(label.as_ref())
    }
}

impl TreeItFilter<DirTreeNode> for CommonQuery {
    fn call(&self, node: &DirTreeNode) -> bool {
        let label = node.sp.label();
        self.matches(label.as_ref())
    }
}