bootandy/archived-dust
1
0
Fork 0
mirror of https://github.com/bootandy/dust.git synced 2026-06-08 11:29:05 +03:00
Code Issues 21 Packages Projects Releases 10 Wiki Activity

better display-children-finding code

Browse Source
This commit is contained in:
Joe Ardent
2018-03-21 13:43:52 -07:00
parent 617b0d2971
commit e75a666a4c
1 changed files with 7 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/utils.rs
+7 -7
View File
@@ -177,16 +177,16 @@ fn display_node<S: Into<String>>(
}); });
let mut is_biggest = true; let mut is_biggest = true;
let mut has_display_children = false;
for node in to_display { for node in to_display {
if node_to_print.children().contains(node) { if node_to_print.children().contains(node) {
let has_children = node.children().len() > 0; let has_display_children = node.children()
if node.entry().name().matches("/").count() == printable_node_slashes + 1 { .iter()
.fold(false, |has_kids, n| has_kids || to_display.contains(&n));
let has_children = node.children().len() > 0 && has_display_children;
if node.entry().name().matches('/').count() == printable_node_slashes + 1 {
num_siblings -= 1; num_siblings -= 1;
for ref n in node.children().iter() {
has_display_children = has_display_children || to_display.contains(n);
}
let has_children = has_children && has_display_children;
let tree_chars = { let tree_chars = {
if num_siblings == 0 { if num_siblings == 0 {
if has_children { if has_children {