63     pub fn push(&mut self, leaf: impl Into<Tree<D>>) -> &mut Self {  in push()
64         self.leaves.push(leaf.into());  in push()
94         while let Some((last, leaf, spaces)) = queue.pop_front() {  in fmt()
97                     leaf.glyphs.last_item  in fmt()
99                     leaf.glyphs.middle_item  in fmt()
101                 leaf.glyphs.item_indent,  in fmt()
104             if leaf.multiline {  in fmt()
107                         leaf.glyphs.last_skip  in fmt()
109                         leaf.glyphs.middle_skip  in fmt()
111                     leaf.glyphs.skip_indent,  in fmt()
117                     format!("{:#}", leaf.root)  in fmt()
119                     format!("{:}", leaf.root)  in fmt()
151                 leaf.root.fmt(f)?; // Pass along `f.alternate()`  in fmt()
156             if !leaf.leaves.is_empty() {  in fmt()
161                 enqueue_leaves(&mut queue, leaf, child_spaces);  in fmt()
175     for (i, leaf) in parent.leaves.iter().rev().enumerate() {  in enqueue_leaves()
177         queue.push_front((last, leaf, spaces.clone()));  in enqueue_leaves()