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
//! Tree search and find operations.
use crate::tree::Tree;
impl Tree {
/// Finds the first node with the given label.
///
/// Returns `Some(&Tree)` if found, `None` otherwise.
///
/// # Examples
///
/// ```
/// use treelog::Tree;
///
/// let tree = Tree::Node("root".to_string(), vec![
/// Tree::Node("child".to_string(), vec![Tree::Leaf(vec!["item".to_string()])])
/// ]);
/// let found = tree.find_node("child");
/// assert!(found.is_some());
/// ```
pub fn find_node(&self, label: &str) -> Option<&Tree> {
if let Tree::Node(node_label, _) = self
&& node_label == label
{
return Some(self);
}
if let Tree::Node(_, children) = self {
for child in children {
if let Some(found) = child.find_node(label) {
return Some(found);
}
}
}
None
}
/// Finds all nodes with the given label.
///
/// Returns a vector of references to matching nodes.
///
/// # Examples
///
/// ```
/// use treelog::Tree;
///
/// let tree = Tree::Node("root".to_string(), vec![
/// Tree::Node("child".to_string(), vec![]),
/// Tree::Node("child".to_string(), vec![]),
/// ]);
/// let found = tree.find_all_nodes("child");
/// assert_eq!(found.len(), 2);
/// ```
pub fn find_all_nodes(&self, label: &str) -> Vec<&Tree> {
let mut results = Vec::new();
self.collect_nodes(label, &mut results);
results
}
fn collect_nodes<'a>(&'a self, label: &str, results: &mut Vec<&'a Tree>) {
if let Tree::Node(node_label, _) = self
&& node_label == label
{
results.push(self);
}
if let Tree::Node(_, children) = self {
for child in children {
child.collect_nodes(label, results);
}
}
}
/// Finds the first leaf containing the given content.
///
/// Returns `Some(&Tree)` if found, `None` otherwise.
///
/// # Examples
///
/// ```
/// use treelog::Tree;
///
/// let tree = Tree::Node("root".to_string(), vec![
/// Tree::Leaf(vec!["item".to_string()])
/// ]);
/// let found = tree.find_leaf("item");
/// assert!(found.is_some());
/// ```
pub fn find_leaf(&self, content: &str) -> Option<&Tree> {
match self {
Tree::Leaf(lines) => {
if lines.iter().any(|line| line.contains(content)) {
return Some(self);
}
}
Tree::Node(_, children) => {
for child in children {
if let Some(found) = child.find_leaf(content) {
return Some(found);
}
}
}
}
None
}
/// Checks if the tree contains a node or leaf with the given label/content.
///
/// Returns `true` if found, `false` otherwise.
///
/// # Examples
///
/// ```
/// use treelog::Tree;
///
/// let tree = Tree::Node("root".to_string(), vec![
/// Tree::Leaf(vec!["item".to_string()])
/// ]);
/// assert!(tree.contains("root"));
/// assert!(tree.contains("item"));
/// ```
pub fn contains(&self, label: &str) -> bool {
match self {
Tree::Node(node_label, _) => {
if node_label == label {
return true;
}
}
Tree::Leaf(lines) => {
if lines.iter().any(|line| line.contains(label)) {
return true;
}
}
}
if let Tree::Node(_, children) = self {
for child in children {
if child.contains(label) {
return true;
}
}
}
false
}
/// Gets the path (indices) to the first node with the given label.
///
/// Returns `Some(Vec<usize>)` if found, where each usize is the index of a child.
/// Returns `None` if not found.
///
/// # Examples
///
/// ```
/// use treelog::Tree;
///
/// let tree = Tree::Node("root".to_string(), vec![
/// Tree::Node("child".to_string(), vec![Tree::Leaf(vec!["item".to_string()])])
/// ]);
/// let path = tree.path_to("child");
/// assert_eq!(path, Some(vec![0]));
/// ```
pub fn path_to(&self, label: &str) -> Option<Vec<usize>> {
let mut path = Vec::new();
if self.find_path(label, &mut path) {
Some(path)
} else {
None
}
}
fn find_path(&self, label: &str, path: &mut Vec<usize>) -> bool {
match self {
Tree::Node(node_label, _) => {
if node_label == label {
return true;
}
}
Tree::Leaf(lines) => {
if lines.iter().any(|line| line.contains(label)) {
return true;
}
}
}
if let Tree::Node(_, children) = self {
for (index, child) in children.iter().enumerate() {
path.push(index);
if child.find_path(label, path) {
return true;
}
path.pop();
}
}
false
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_find_node() {
let tree = Tree::Node(
"root".to_string(),
vec![Tree::Node(
"child".to_string(),
vec![Tree::Leaf(vec!["item".to_string()])],
)],
);
let found = tree.find_node("child");
assert!(found.is_some());
assert_eq!(found.unwrap().label(), Some("child"));
let not_found = tree.find_node("nonexistent");
assert!(not_found.is_none());
}
#[test]
fn test_find_all_nodes() {
let tree = Tree::Node(
"root".to_string(),
vec![
Tree::Node("child".to_string(), vec![]),
Tree::Node("child".to_string(), vec![]),
Tree::Node("other".to_string(), vec![]),
],
);
let found = tree.find_all_nodes("child");
assert_eq!(found.len(), 2);
let found_root = tree.find_all_nodes("root");
assert_eq!(found_root.len(), 1);
}
#[test]
fn test_find_leaf() {
let tree = Tree::Node(
"root".to_string(),
vec![Tree::Leaf(vec!["item".to_string()])],
);
let found = tree.find_leaf("item");
assert!(found.is_some());
assert!(found.unwrap().is_leaf());
let not_found = tree.find_leaf("nonexistent");
assert!(not_found.is_none());
}
#[test]
fn test_contains() {
let tree = Tree::Node(
"root".to_string(),
vec![Tree::Leaf(vec!["item".to_string()])],
);
assert!(tree.contains("root"));
assert!(tree.contains("item"));
assert!(!tree.contains("nonexistent"));
}
#[test]
fn test_path_to() {
let tree = Tree::Node(
"root".to_string(),
vec![Tree::Node(
"child".to_string(),
vec![Tree::Leaf(vec!["item".to_string()])],
)],
);
let path = tree.path_to("child");
assert_eq!(path, Some(vec![0]));
let path_to_item = tree.path_to("item");
assert_eq!(path_to_item, Some(vec![0, 0]));
let path_not_found = tree.path_to("nonexistent");
assert_eq!(path_not_found, None);
}
}