pub fn aggregate_tree_from_traversal(
out: (impl Write, bool),
traversal: &Traversal,
roots: &[TreeIndex],
byte_format: ByteFormat,
max_depth: usize,
compute_total: bool,
sort_by_size_in_bytes: bool,
) -> Result<WalkResult>Expand description
Write an already completed traversal as an indented aggregate tree.
roots must contain the traversal’s top-level nodes in their original input order. The
returned error count is derived from the stored metadata-error flags.