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
//! File system tree building using walkdir.
use crate::tree::Tree;
use std::path::Path;
impl Tree {
/// Builds a tree from a directory structure.
///
/// Requires the `walkdir` feature.
///
/// Directories become nodes, and files become leaves.
///
/// # Examples
///
/// ```
/// use treelog::Tree;
///
/// let tree = Tree::from_dir(".").unwrap();
/// ```
#[cfg(feature = "arbitrary-walkdir")]
pub fn from_dir<P: AsRef<Path>>(path: P) -> Result<Self, walkdir::Error> {
let path = path.as_ref();
let mut tree = Tree::new_node(
path.file_name()
.and_then(|n| n.to_str())
.unwrap_or(".")
.to_string(),
);
let mut dirs = Vec::new();
let mut files = Vec::new();
for entry_result in walkdir::WalkDir::new(path)
.max_depth(1)
.min_depth(1)
.into_iter()
{
let entry = entry_result?;
let path = entry.path();
if path.is_dir() {
dirs.push(path.to_path_buf());
} else if path.is_file() {
files.push(path.to_path_buf());
}
}
// Sort for consistent output
dirs.sort();
files.sort();
// Add directories as nodes (recursively)
for dir in dirs {
if let Ok(subtree) = Self::from_dir(&dir) {
tree.add_child(subtree);
}
}
// Add files as leaves
for file in files {
if let Some(name) = file.file_name().and_then(|n| n.to_str()) {
tree.add_child(Tree::new_leaf(name.to_string()));
}
}
Ok(tree)
}
/// Builds a tree from a directory structure with a maximum depth.
///
/// Requires the `walkdir` feature.
///
/// # Examples
///
/// ```
/// use treelog::Tree;
///
/// let tree = Tree::from_dir_max_depth(".", 2).unwrap();
/// ```
#[cfg(feature = "arbitrary-walkdir")]
pub fn from_dir_max_depth<P: AsRef<Path>>(
path: P,
max_depth: usize,
) -> Result<Self, walkdir::Error> {
let path = path.as_ref();
let mut tree = Tree::new_node(
path.file_name()
.and_then(|n| n.to_str())
.unwrap_or(".")
.to_string(),
);
if max_depth == 0 {
return Ok(tree);
}
let mut dirs = Vec::new();
let mut files = Vec::new();
for entry_result in walkdir::WalkDir::new(path)
.max_depth(1)
.min_depth(1)
.into_iter()
{
let entry = entry_result?;
let path = entry.path();
if path.is_dir() {
dirs.push(path.to_path_buf());
} else if path.is_file() {
files.push(path.to_path_buf());
}
}
// Sort for consistent output
dirs.sort();
files.sort();
// Add directories as nodes (recursively with reduced depth)
for dir in dirs {
if let Ok(subtree) = Self::from_dir_max_depth(&dir, max_depth - 1) {
tree.add_child(subtree);
}
}
// Add files as leaves
for file in files {
if let Some(name) = file.file_name().and_then(|n| n.to_str()) {
tree.add_child(Tree::new_leaf(name.to_string()));
}
}
Ok(tree)
}
}
#[cfg(test)]
mod tests {
use super::*;
#[cfg(feature = "arbitrary-walkdir")]
#[test]
fn test_from_dir_current() {
// Test with current directory (should always exist)
let tree = Tree::from_dir(".");
assert!(tree.is_ok());
let tree = tree.unwrap();
assert!(tree.is_node());
}
#[cfg(feature = "arbitrary-walkdir")]
#[test]
fn test_from_dir_max_depth() {
// Test with current directory and max depth
let tree = Tree::from_dir_max_depth(".", 1);
assert!(tree.is_ok());
let tree = tree.unwrap();
assert!(tree.is_node());
}
}