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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
|
/// In the flat_tree structure, every "node" is just a line, there's
/// no link from a child to its parent or from a parent to its children.
use std::cmp::{self, Ordering};
use std::fs;
use std::path::PathBuf;
use crate::file_sizes::Size;
use crate::task_sync::TaskLifetime;
use crate::tree_options::TreeOptions;
#[derive(Debug, Clone, PartialEq)]
pub enum LineType {
File,
Dir,
SymLinkToDir(String), //
SymLinkToFile(String), // (to file or to symlink)
Pruning, // a "xxx unlisted" line
}
/// a line in the representation of the file hierarchy
#[derive(Debug)]
pub struct TreeLine {
pub left_branchs: Box<[bool]>, // a depth-sized array telling whether a branch pass
pub depth: u16,
pub name: String, // name of the first unlisted, in case of Pruning
pub path: PathBuf,
pub line_type: LineType,
pub has_error: bool,
pub unlisted: usize, // number of not listed children (Dir) or brothers (Pruning)
pub score: i32, // 0 if there's no pattern
pub size: Option<Size>, // None when not measured
pub mode: u32, // unix file mode
pub uid: u32, // unix user id
pub gid: u32, // unix group id
}
#[derive(Debug)]
pub struct Tree {
pub lines: Box<[TreeLine]>,
pub selection: usize, // there's always a selection (starts with root, which is 0)
pub options: TreeOptions,
pub scroll: i32, // the number of lines at the top hidden because of scrolling
pub nb_gitignored: u32, // number of times a gitignore pattern excluded a file
}
impl TreeLine {
pub fn is_selectable(&self) -> bool {
match &self.line_type {
LineType::Pruning => false,
_ => true,
}
}
pub fn is_dir(&self) -> bool {
match &self.line_type {
LineType::Dir => true,
LineType::SymLinkToDir(_) => true,
_ => false,
}
}
pub fn is_file(&self) -> bool {
match &self.line_type {
LineType::File => true,
_ => false,
}
}
// build and return the absolute targeted path: either self.path or the
// solved canonicalized symlink
// (the path may be invalid if the symlink is)
pub fn target(&self) -> PathBuf {
match &self.line_type {
LineType::SymLinkToFile(target) | LineType::SymLinkToDir(target) => {
let mut target_path = PathBuf::from(target);
if target_path.is_relative() {
target_path = self.path.parent().unwrap().join(target_path);
}
if let Ok(canonic) = fs::canonicalize(&target_path) {
target_path = canonic;
}
target_path
}
_ => self.path.clone(),
}
}
}
impl PartialEq for TreeLine {
fn eq(&self, other: &TreeLine) -> bool {
self.path == other.path
}
}
impl Eq for TreeLine {}
impl Ord for TreeLine {
// paths are sorted in a complete ignore case way
// (A<a<B<b)
fn cmp(&self, other: &TreeLine) -> Ordering {
let mut sci = self.path.components();
let mut oci = other.path.components();
loop {
match sci.next() {
Some(sc) => {
match oci.next() {
Some(oc) => {
let scs = sc.as_os_str().to_string_lossy();
let ocs = oc.as_os_str().to_string_lossy();
let lower_ordering = scs.to_lowercase().cmp(&ocs.to_lowercase());
if lower_ordering != Ordering::Equal {
return lower_ordering;
}
let ordering = scs.cmp(&ocs);
if ordering != Ordering::Equal {
return ordering;
}
}
None => {
return Ordering::Greater;
}
};
}
None => {
if oci.next().is_some() {
return Ordering::Less;
} else {
return Ordering::Equal;
}
}
};
}
}
}
impl PartialOrd for TreeLine {
fn partial_cmp(&self, other: &TreeLine) -> Option<cmp::Ordering> {
Some(self.cmp(other))
}
}
impl Tree {
// do what must be done after line additions or removals:
// - sort the lines
// - compute left branchs
pub fn after_lines_changed(&mut self) {
// we sort the lines
self.lines.sort();
for i in 1..self.lines.len() {
for d in 0..self.lines[i].left_branchs.len() {
self.lines[i].left_branchs[d] = false;
}
}
// then we discover the branches (for the drawing)
// and we mark the last children as pruning, if they have unlisted brothers
let mut last_parent_index: usize = self.lines.len() + 1;
for end_index in (1..self.lines.len()).rev() {
let depth = (self.lines[end_index].depth - 1) as usize;
let start_index = {
let parent_index = {
let parent_path = &self.lines[end_index].path.parent();
match parent_path {
Some(parent_path) => {
let mut index = end_index;
loop {
index -= 1;
if self.lines[index].path == *parent_path {
break;
}
if index == 0 {
break;
}
}
index
}
None => end_index, // Should not happen
}
};
if parent_index != last_parent_index {
// the line at end_index is the last listed child of the line at parent_index
let unlisted = self.lines[parent_index].unlisted;
if unlisted > 0 {
self.lines[end_index].line_type = LineType::Pruning;
self.lines[end_index].unlisted = unlisted + 1;
self.lines[parent_index].unlisted = 0;
}
last_parent_index = parent_index;
}
parent_index + 1
};
for i in start_index..=end_index {
self.lines[i].left_branchs[depth] = true;
}
}
}
pub fn has_branch(&self, line_index: usize, depth: usize) -> bool {
if line_index >= self.lines.len() {
return false;
}
let line = &self.lines[line_index];
depth < usize::from(line.depth) && line.left_branchs[depth]
}
pub fn move_selection(&mut self, dy: i32, page_height: i32) {
// only work for +1 or -1
let l = self.lines.len();
loop {
self.selection = (self.selection + ((l as i32) + dy) as usize) % l;
if self.lines[self.selection].is_selectable() {
break;
}
}
// we adjust the scroll
let l = l as i32;
let sel = self.selection as i32;
if dy < 0 && sel < self.scroll + 5 {
self.scroll = (self.scroll + 2 * dy).max(0);
} else if dy > 0 && l > page_height && sel > self.scroll + page_height - 5 {
self.scroll += 2 * dy;
}
}
pub fn try_scroll(&mut self, dy: i32, page_h
|