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
|
mod app {
use dua::interactive::{EntryData, TerminalApp, Tree, TreeIndexType};
use dua::{ByteFormat, Color, TraversalSorting, WalkOptions};
use failure::Error;
use petgraph::prelude::NodeIndex;
use pretty_assertions::assert_eq;
use std::{ffi::OsString, fmt, path::Path};
use tui::backend::TestBackend;
use tui::Terminal;
fn debug(item: impl fmt::Debug) -> String {
format!("{:?}", item)
}
#[test]
fn it_can_handle_ending_traversal_reaching_top_but_skipping_levels() -> Result<(), Error> {
let (_, app) = initialized_app_and_terminal("sample-01")?;
let expected_tree = sample_01_tree();
assert_eq!(
debug(app.traversal.tree),
debug(expected_tree),
"filesystem graph is stable and matches the directory structure"
);
Ok(())
}
#[test]
fn it_can_handle_ending_traversal_without_reaching_the_top() -> Result<(), Error> {
let (_, app) = initialized_app_and_terminal("sample-02")?;
let expected_tree = sample_02_tree();
assert_eq!(
debug(app.traversal.tree),
debug(expected_tree),
"filesystem graph is stable and matches the directory structure"
);
Ok(())
}
fn initialized_app_and_terminal(
fixture_path: &str,
) -> Result<(Terminal<TestBackend>, TerminalApp), Error> {
let mut terminal = Terminal::new(TestBackend::new(40, 20))?;
let input = Path::new(env!("CARGO_MANIFEST_DIR"))
.join("tests/fixtures")
.join(fixture_path);
let app = TerminalApp::initialize(
&mut terminal,
WalkOptions {
threads: 1,
byte_format: ByteFormat::Metric,
color: Color::None,
sorting: TraversalSorting::AlphabeticalByFileName,
},
vec![input],
)?;
Ok((terminal, app))
}
fn sample_01_tree() -> Tree {
let mut t = Tree::new();
{
let mut add_node = make_add_node(&mut t);
let root_size = 1259070;
let r = add_node("", root_size, None);
{
let s = add_node("sample-01", root_size, Some(r));
{
add_node(".hidden.666", 666, Some(s));
add_node("a", 256, Some(s));
add_node("b.empty", 0, Some(s));
add_node("c.lnk", 1, Some(s));
let d = add_node("dir", 1258024, Some(s));
{
add_node("1000bytes", 1000, Some(d));
add_node("dir-a.1mb", 1_000_000, Some(d));
add_node("dir-a.kb", 1024, Some(d));
let e = add_node("empty-dir", 0, Some(d));
{
add_node(".gitkeep", 0, Some(e));
}
let sub = add_node("sub", 256_000, Some(d));
{
add_node("dir-sub-a.256kb", 256_000, Some(sub));
}
}
add_node("z123.b", 123, Some(s));
}
}
}
t
}
fn sample_02_tree() -> Tree {
let mut t = Tree::new();
{
let mut add_node = make_add_node(&mut t);
let root_size = 1540;
let r = add_node("", root_size, None);
{
let s = add_node("sample-02", root_size, Some(r));
{
add_node("a", 256, Some(s));
add_node("b", 1, Some(s));
let d = add_node("dir", 1283, Some(s));
{
add_node("c", 257, Some(d));
add_node("d", 2, Some(d));
let e = add_node("empty-dir", 0, Some(d));
{
add_node(".gitkeep", 0, Some(e));
}
let sub = add_node("sub", 1024, Some(d));
{
add_node("e", 1024, Some(sub));
}
}
}
}
}
t
}
fn make_add_node<'a>(
t: &'a mut Tree,
) -> impl FnMut(&str, u64, Option<NodeIndex<TreeIndexType>>) -> NodeIndex<TreeIndexType> + 'a
{
move |name, size, maybe_from_idx| {
let n = t.add_node(EntryData {
name: OsString::from(name),
size,
metadata_io_error: false,
});
if let Some(from) = maybe_from_idx {
t.add_edge(from, n, ());
}
n
}
}
}
|
