1use crate::tree::{NodeId, PrintTree};
3use std::io;
4
5pub fn print_tree(tree: &impl PrintTree, root: NodeId) {
7 let mut buffer = Vec::<u8>::new();
9 write_tree(&mut buffer, tree, root).expect("Wrote tree debug representation to Stdout");
10 println!("{}", std::str::from_utf8(&buffer).unwrap());
11}
12
13pub fn write_tree(mut writer: impl io::Write, tree: &impl PrintTree, root: NodeId) -> io::Result<()> {
15 writeln!(writer, "TREE")?;
16 write_node(&mut writer, tree, root, false, String::new())?;
17
18 fn write_node(
20 writer: &mut impl io::Write,
21 tree: &impl PrintTree,
22 node_id: NodeId,
23 has_sibling: bool,
24 lines_string: String,
25 ) -> io::Result<()> {
26 let layout = &tree.get_final_layout(node_id);
27 let display = tree.get_debug_label(node_id);
28 let num_children = tree.child_count(node_id);
29
30 let fork_string = if has_sibling { "├── " } else { "└── " };
31 #[cfg(feature = "content_size")]
32 writeln!(
33 writer,
34 "{lines}{fork} {display} [x: {x:<4} y: {y:<4} w: {width:<4} h: {height:<4} content_w: {content_width:<4} content_h: {content_height:<4} border: l:{bl} r:{br} t:{bt} b:{bb}, padding: l:{pl} r:{pr} t:{pt} b:{pb}] ({key:?})",
35 lines = lines_string,
36 fork = fork_string,
37 display = display,
38 x = layout.location.x,
39 y = layout.location.y,
40 width = layout.size.width,
41 height = layout.size.height,
42 content_width = layout.content_size.width,
43 content_height = layout.content_size.height,
44 bl = layout.border.left,
45 br = layout.border.right,
46 bt = layout.border.top,
47 bb = layout.border.bottom,
48 pl = layout.padding.left,
49 pr = layout.padding.right,
50 pt = layout.padding.top,
51 pb = layout.padding.bottom,
52 key = node_id,
53 )?;
54 #[cfg(not(feature = "content_size"))]
55 writeln!(
56 writer,
57 "{lines}{fork} {display} [x: {x:<4} y: {y:<4} width: {width:<4} height: {height:<4}] ({key:?})",
58 lines = lines_string,
59 fork = fork_string,
60 display = display,
61 x = layout.location.x,
62 y = layout.location.y,
63 width = layout.size.width,
64 height = layout.size.height,
65 key = node_id,
66 );
67 let bar = if has_sibling { "│ " } else { " " };
68 let new_string = lines_string + bar;
69
70 for (index, child) in tree.child_ids(node_id).enumerate() {
72 let has_sibling = index < num_children - 1;
73 write_node(writer, tree, child, has_sibling, new_string.clone())?;
74 }
75 Ok(())
76 }
77 Ok(())
78}