ragit 0.4.5

git-like rag pipeline
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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151

use std::collections::hash_map::{Entry, HashMap};
use serde::Serialize;

#[derive(Clone, Debug, Serialize)]
pub struct FileTree {
    is_dir: bool,
    children: HashMap<String, FileTree>,
}

impl FileTree {
    pub fn root() -> Self {
        FileTree {
            is_dir: true,
            children: HashMap::new(),
        }
    }

    pub fn len(&self) -> usize {
        if self.is_dir {
            self.children.values().map(|f| f.len()).sum()
        }

        else {
            1
        }
    }

    pub fn is_empty(&self) -> bool {
        self.is_dir && self.children.is_empty()
    }

    pub fn to_paths(&self) -> Vec<String> {
        let mut result = vec![];

        for (k, v) in self.children.iter() {
            if v.is_dir {
                for p in v.to_paths().iter() {
                    result.push(format!("{k}/{p}"));
                }
            }

            else {
                result.push(k.to_string());
            }
        }

        result
    }

    // NOTE: There are a lot of hard-coded integers in this function. They're all
    //       just arbitrary numbers. I haven't done enough tests on them, and I
    //       have to.
    //       I don't want to make these configurable; that'd confuse
    //       new-comers, right?
    pub fn render(&self) -> String {
        let total_files: usize = self.children.values().map(|f| f.len()).sum();

        if total_files < 30 {
            let mut paths = self.to_paths();
            paths.sort();
            paths.join("\n")
        }

        else {
            let mut dirs = vec![];
            let mut excessive_dirs = 0;
            let mut files = vec![];
            let mut excessive_files = 0;

            for (k, v) in self.children.iter() {
                if v.is_dir {
                    dirs.push((k.to_string(), v.len()));
                }

                else {
                    files.push(k.to_string());
                }
            }

            dirs.sort_by_key(|(d, _)| d.to_string());
            files.sort();

            if dirs.len() > 15 {
                excessive_dirs = dirs.len() - 15;
                dirs = dirs[..15].to_vec();
            }

            if files.len() > 15 {
                excessive_files = files.len() - 15;
                files = files[..15].to_vec();
            }

            let mut lines = vec![
                dirs.iter().map(
                    |(d, f)| format!("{d}/    ({f} files in it, recursively)")
                ).collect::<Vec<_>>(),
                files,
            ].concat();

            match (excessive_dirs, excessive_files) {
                (0, 0) => {},
                (0, f) => {
                    lines.push(format!("... and {f} more files"));
                },
                (d, 0) => {
                    lines.push(format!("... and {d} more directories"));
                },
                (d, f) => {
                    lines.push(format!("... and {d} more directories and {f} more files"));
                },
            }

            lines.join("\n")
        }
    }

    pub fn insert(&mut self, path: &str) {
        let path_elements = path.split(|s| s == '/').filter(|s| !s.is_empty()).collect::<Vec<_>>();
        self.insert_worker(&path_elements);
    }

    fn insert_worker(&mut self, path_elements: &[&str]) {
        if path_elements.len() == 1 {
            self.children.insert(
                path_elements[0].to_string(),
                FileTree {
                    is_dir: false,
                    children: HashMap::new(),
                },
            );
        }

        else {
            let dir_name = &path_elements[0];

            match self.children.entry(dir_name.to_string()) {
                Entry::Occupied(mut f) => {
                    f.get_mut().insert_worker(&path_elements[1..]);
                },
                Entry::Vacant(e) => {
                    let mut children = FileTree {
                        is_dir: true,
                        children: HashMap::new(),
                    };
                    children.insert_worker(&path_elements[1..]);
                    e.insert(children);
                },
            }
        }
    }
}