pub fn walk_tree_integrity<S, V>(
source: &S,
roots: impl IntoIterator<Item = ContentHash>,
visitor: &mut V,
) -> Result<()>Expand description
Walk all trees reachable from roots, deduplicating visited trees.
Missing root or subtree trees are skipped silently. Gitlink entries are not descended into. Visitation order is depth-first, sorted tree entry order.