s/sibblings/siblings/g

This commit is contained in:
Joe Ardent
2018-03-20 20:40:36 -07:00
parent 1c80cbf28b
commit 99f462f023
+3 -3
View File
@@ -278,7 +278,7 @@ fn display_node<S: Into<String>>(
let printable_node_slashes = node_to_print.dir.name.matches('/').count(); let printable_node_slashes = node_to_print.dir.name.matches('/').count();
let mut num_sibblings = to_display.iter().fold(0, |a, b| { let mut num_siblings = to_display.iter().fold(0, |a, b| {
if node_to_print.children.contains(b) if node_to_print.children.contains(b)
&& b.dir.name.matches('/').count() == printable_node_slashes + 1 && b.dir.name.matches('/').count() == printable_node_slashes + 1
{ {
@@ -294,13 +294,13 @@ fn display_node<S: Into<String>>(
if node_to_print.children.contains(node) { if node_to_print.children.contains(node) {
let has_children = node.children.len() > 0; let has_children = node.children.len() > 0;
if node.dir.name.matches("/").count() == printable_node_slashes + 1 { if node.dir.name.matches("/").count() == printable_node_slashes + 1 {
num_sibblings -= 1; num_siblings -= 1;
for ref n in node.children.iter() { for ref n in node.children.iter() {
has_display_children = has_display_children || to_display.contains(n); has_display_children = has_display_children || to_display.contains(n);
} }
let has_children = has_children && has_display_children; let has_children = has_children && has_display_children;
let tree_chars = { let tree_chars = {
if num_sibblings == 0 { if num_siblings == 0 {
if has_children { if has_children {
"└─┬" "└─┬"
} else { } else {