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
|
use std::fmt::Display;
use crate::mapping::{
map_tree::{Node, NodeValue},
MapKey,
};
use super::MappingTree;
impl Display for MappingTree {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
fn write_node(
f: &mut std::fmt::Formatter<'_>,
node: &Node,
indention: String,
location: Vec<MapKey>,
is_last: bool,
is_root: bool,
) -> std::fmt::Result {
let node_value = match &node.value {
NodeValue::Parent { children: _ } => "<Parent>".to_owned(),
NodeValue::Child { path, extandable } => {
path.to_owned() + if *extandable { " [exten.]" } else { " [stop]" }
}
};
let new_idention = indention.clone()
+ if is_root {
""
} else {
match is_last {
true => " ",
false => "│ ",
}
};
let bullet = match is_last {
true => String::from("└── "),
false => String::from("├── "),
};
if is_root {
write!(f, ": {}\n", node_value)?;
} else {
write!(
f,
"{}{}\x1b[1;33m{}\x1b[0m: {}\n",
indention,
bullet,
MapKey::display(&location),
node_value,
)?;
};
match &node.value {
NodeValue::Parent { children } => {
let mut children_vec: Vec<(&MapKey, &Node)> = children.iter().collect();
children_vec.sort_by(|(a, _), (b, _)| a.key.cmp(&b.key));
let mut counter = 1;
for (key, child) in &children_vec {
let mut new_location = location.clone();
new_location.push((*key).to_owned());
write_node(
f,
child,
new_idention.clone(),
new_location.clone(),
counter == children_vec.len(),
false,
)?;
counter += 1;
}
}
NodeValue::Child {
path: _,
extandable: _,
} => {
// Do nothing and stop the recursion
}
}
Ok(())
}
write_node(f, &self.root, String::new(), vec![], false, true)?;
Ok(())
}
}
|
