extern crate ansi_term; use crate::display_node::DisplayNode; use self::ansi_term::Colour::Red; use lscolors::{LsColors, Style}; use unicode_width::UnicodeWidthStr; use stfu8::encode_u8; use std::cmp::max; use std::cmp::min; use std::fs; use std::iter::repeat; use std::path::Path; use thousands::Separable; static UNITS: [char; 4] = ['T', 'G', 'M', 'K']; static BLOCKS: [char; 5] = ['█', '▓', '▒', '░', ' ']; pub struct DisplayData { pub short_paths: bool, pub is_reversed: bool, pub colors_on: bool, pub by_filecount: bool, pub num_chars_needed_on_left_most: usize, pub base_size: u64, pub longest_string_length: usize, pub ls_colors: LsColors, pub iso: bool, } impl DisplayData { fn get_tree_chars(&self, was_i_last: bool, has_children: bool) -> &'static str { match (self.is_reversed, was_i_last, has_children) { (true, true, true) => "┌─┴", (true, true, false) => "┌──", (true, false, true) => "├─┴", (true, false, false) => "├──", (false, true, true) => "└─┬", (false, true, false) => "└──", (false, false, true) => "├─┬", (false, false, false) => "├──", } } fn is_biggest(&self, num_siblings: usize, max_siblings: u64) -> bool { if self.is_reversed { num_siblings == (max_siblings - 1) as usize } else { num_siblings == 0 } } fn is_last(&self, num_siblings: usize, max_siblings: u64) -> bool { if self.is_reversed { num_siblings == 0 } else { num_siblings == (max_siblings - 1) as usize } } fn percent_size(&self, node: &DisplayNode) -> f32 { let result = node.size as f32 / self.base_size as f32; if result.is_normal() { result } else { 0.0 } } } struct DrawData<'a> { indent: String, percent_bar: String, display_data: &'a DisplayData, } impl DrawData<'_> { fn get_new_indent(&self, has_children: bool, was_i_last: bool) -> String { let chars = self.display_data.get_tree_chars(was_i_last, has_children); self.indent.to_string() + chars } // TODO: can we test this? fn generate_bar(&self, node: &DisplayNode) -> String { let chars_in_bar = self.percent_bar.chars().count(); let num_bars = chars_in_bar as f32 * self.display_data.percent_size(node); let mut num_not_my_bar = (chars_in_bar as i32) - num_bars as i32; let mut new_bar = "".to_string(); let idx = 5 - min(4, max(1, node.depth)); for c in self.percent_bar.chars() { num_not_my_bar -= 1; if num_not_my_bar <= 0 { new_bar.push(BLOCKS[0]); } else if c == BLOCKS[0] { new_bar.push(BLOCKS[idx]); } else { new_bar.push(c); } } new_bar } } #[allow(clippy::too_many_arguments)] pub fn draw_it( use_full_path: bool, is_reversed: bool, no_colors: bool, no_percents: bool, terminal_width: usize, by_filecount: bool, root_node: DisplayNode, iso: bool, ) { let num_chars_needed_on_left_most = if by_filecount { let max_size = root_node.size; max_size.separate_with_commas().chars().count() } else { 5 // Under normal usage we need 5 chars to display the size of a directory }; assert!( terminal_width > num_chars_needed_on_left_most + 2, "Not enough terminal width" ); let allowed_width = terminal_width - num_chars_needed_on_left_most - 2; let num_indent_chars = 3; let longest_string_length = find_longest_dir_name(&root_node, num_indent_chars, allowed_width, !use_full_path); let max_bar_length = if no_percents || longest_string_length + 7 >= allowed_width as usize { 0 } else { allowed_width as usize - longest_string_length - 7 }; let first_size_bar = repeat(BLOCKS[0]).take(max_bar_length).collect::(); let display_data = DisplayData { short_paths: !use_full_path, is_reversed, colors_on: !no_colors, by_filecount, num_chars_needed_on_left_most, base_size: root_node.size, longest_string_length, ls_colors: LsColors::from_env().unwrap_or_default(), iso, }; let draw_data = DrawData { indent: "".to_string(), percent_bar: first_size_bar, display_data: &display_data, }; display_node(root_node, &draw_data, true, true); } fn find_longest_dir_name( node: &DisplayNode, indent: usize, terminal: usize, long_paths: bool, ) -> usize { let printable_name = get_printable_name(&node.name, long_paths); let longest = min( UnicodeWidthStr::width(&*printable_name) + 1 + indent, terminal, ); // each none root tree drawing is 2 more chars, hence we increment indent by 2 node.children .iter() .map(|c| find_longest_dir_name(c, indent + 2, terminal, long_paths)) .fold(longest, max) } fn display_node(node: DisplayNode, draw_data: &DrawData, is_biggest: bool, is_last: bool) { let indent = draw_data.get_new_indent(!node.children.is_empty(), is_last); let bar_text = draw_data.generate_bar(&node); let to_print = format_string( &node, &*indent, &*bar_text, is_biggest, draw_data.display_data, ); if !draw_data.display_data.is_reversed { println!("{}", to_print) } let dd = DrawData { indent: clean_indentation_string(&*indent), percent_bar: bar_text, display_data: draw_data.display_data, }; let num_siblings = node.num_siblings(); for (count, c) in node .get_children_from_node(draw_data.display_data.is_reversed) .enumerate() { let is_biggest = dd.display_data.is_biggest(count, num_siblings); let was_i_last = dd.display_data.is_last(count, num_siblings); display_node(c, &dd, is_biggest, was_i_last); } if draw_data.display_data.is_reversed { println!("{}", to_print) } } fn clean_indentation_string(s: &str) -> String { let mut is: String = s.into(); // For reversed: is = is.replace("┌─┴", " "); is = is.replace("┌──", " "); is = is.replace("├─┴", "│ "); is = is.replace("─┴", " "); // For normal is = is.replace("└─┬", " "); is = is.replace("└──", " "); is = is.replace("├─┬", "│ "); is = is.replace("─┬", " "); // For both is = is.replace("├──", "│ "); is } fn get_printable_name>(dir_name: &P, long_paths: bool) -> String { let dir_name = dir_name.as_ref(); let printable_name = { if long_paths { match dir_name.parent() { Some(prefix) => match dir_name.strip_prefix(prefix) { Ok(base) => base, Err(_) => dir_name, }, None => dir_name, } } else { dir_name } }; encode_u8(printable_name.display().to_string().as_bytes()) } fn pad_or_trim_filename(node: &DisplayNode, indent: &str, display_data: &DisplayData) -> String { let name = get_printable_name(&node.name, display_data.short_paths); let indent_and_name = format!("{} {}", indent, name); let width = UnicodeWidthStr::width(&*indent_and_name); assert!( display_data.longest_string_length >= width, "Terminal width not wide enough to draw directory tree" ); // Add spaces after the filename so we can draw the % used bar chart. let name_and_padding = name + " " .repeat(display_data.longest_string_length - width) .as_str(); name_and_padding } fn maybe_trim_filename(name_in: String, indent: &str, display_data: &DisplayData) -> String { let indent_length = UnicodeWidthStr::width(indent); assert!( display_data.longest_string_length >= indent_length + 2, "Terminal width not wide enough to draw directory tree" ); let max_size = display_data.longest_string_length - indent_length; if UnicodeWidthStr::width(&*name_in) > max_size { let name = name_in.chars().take(max_size - 2).collect::(); name + ".." } else { name_in } } pub fn format_string( node: &DisplayNode, indent: &str, percent_bar: &str, is_biggest: bool, display_data: &DisplayData, ) -> String { let (percents, name_and_padding) = get_name_percent(node, indent, percent_bar, display_data); let pretty_size = get_pretty_size(node, is_biggest, display_data); let pretty_name = get_pretty_name(node, name_and_padding, display_data); format!("{} {} {}{}", pretty_size, indent, pretty_name, percents) } fn get_name_percent( node: &DisplayNode, indent: &str, bar_chart: &str, display_data: &DisplayData, ) -> (String, String) { if !bar_chart.is_empty() { let percent_size_str = format!("{:.0}%", display_data.percent_size(node) * 100.0); let percents = format!("│{} │ {:>4}", bar_chart, percent_size_str); let name_and_padding = pad_or_trim_filename(node, indent, display_data); (percents, name_and_padding) } else { let n = get_printable_name(&node.name, display_data.short_paths); let name = maybe_trim_filename(n, indent, display_data); ("".into(), name) } } fn get_pretty_size(node: &DisplayNode, is_biggest: bool, display_data: &DisplayData) -> String { let output = if display_data.by_filecount { let size_as_str = node.size.separate_with_commas(); let spaces_to_add = display_data.num_chars_needed_on_left_most - size_as_str.chars().count(); size_as_str + " ".repeat(spaces_to_add).as_str() } else { format!("{:>5}", human_readable_number(node.size, display_data.iso)) }; if is_biggest && display_data.colors_on { format!("{}", Red.paint(output)) } else { output } } fn get_pretty_name( node: &DisplayNode, name_and_padding: String, display_data: &DisplayData, ) -> String { if display_data.colors_on { let meta_result = fs::metadata(node.name.clone()); let directory_color = display_data .ls_colors .style_for_path_with_metadata(node.name.clone(), meta_result.as_ref().ok()); let ansi_style = directory_color .map(Style::to_ansi_term_style) .unwrap_or_default(); format!("{}", ansi_style.paint(name_and_padding)) } else { name_and_padding } } fn human_readable_number(size: u64, iso: bool) -> String { for (i, u) in UNITS.iter().enumerate() { let num: u64 = if iso { 1000 } else { 1024 }; let marker = num.pow((UNITS.len() - i) as u32); if size >= marker { if size / marker < 10 { return format!("{:.1}{}", (size as f32 / marker as f32), u); } else { return format!("{}{}", (size / marker), u); } } } return format!("{}B", size); } mod tests { #[allow(unused_imports)] use super::*; #[allow(unused_imports)] use std::path::PathBuf; #[cfg(test)] fn get_fake_display_data(longest_string_length: usize) -> DisplayData { DisplayData { short_paths: true, is_reversed: false, colors_on: false, by_filecount: false, num_chars_needed_on_left_most: 5, base_size: 1, longest_string_length, ls_colors: LsColors::from_env().unwrap_or_default(), iso: false, } } #[test] fn test_format_str() { let n = DisplayNode { name: PathBuf::from("/short"), size: 2_u64.pow(12), // This is 4.0K depth: 1, children: vec![], }; let indent = "┌─┴"; let percent_bar = ""; let is_biggest = false; let s = format_string( &n, indent, percent_bar, is_biggest, &get_fake_display_data(20), ); assert_eq!(s, " 4.0K ┌─┴ short"); } #[test] fn test_format_str_long_name() { let name = "very_long_name_longer_than_the_eighty_character_limit_very_long_name_this_bit_will_truncate"; let n = DisplayNode { name: PathBuf::from(name), size: 2_u64.pow(12), // This is 4.0K depth: 1, children: vec![], }; let indent = "┌─┴"; let percent_bar = ""; let is_biggest = false; let dd = get_fake_display_data(64); let s = format_string(&n, indent, percent_bar, is_biggest, &dd); assert_eq!( s, " 4.0K ┌─┴ very_long_name_longer_than_the_eighty_character_limit_very_.." ); } #[test] fn test_human_readable_number() { assert_eq!(human_readable_number(1, false), "1B"); assert_eq!(human_readable_number(956, false), "956B"); assert_eq!(human_readable_number(1004, false), "1004B"); assert_eq!(human_readable_number(1024, false), "1.0K"); assert_eq!(human_readable_number(1536, false), "1.5K"); assert_eq!(human_readable_number(1024 * 512, false), "512K"); assert_eq!(human_readable_number(1024 * 1024, false), "1.0M"); assert_eq!( human_readable_number(1024 * 1024 * 1024 - 1, false), "1023M" ); assert_eq!(human_readable_number(1024 * 1024 * 1024 * 20, false), "20G"); assert_eq!( human_readable_number(1024 * 1024 * 1024 * 1024, false), "1.0T" ); } }