pub struct ContainedWalk { /* private fields */ }Expand description
Directory walker (flat or recursive), rooted at a contained handle.
Lazy, pre-order, and non-following — matching walkdir’s default, so a checkout’s
internal links surface as entries rather than being descended and double-walked.
Per-entry errors skip and continue rather than trapping the whole iteration: a
recursive walk over a real checkout is the flagship use case, and one unreadable
subtree should not end it.
Ordering: every directory is yielded before its descendants, and every subtree is
yielded as one contiguous run — nothing outside a directory’s subtree is interleaved
into it. Strictly depth-first down to [MAX_OPEN_DIRS] levels of nesting; past that,
a subdirectory’s own contents follow the rest of its parent’s entries instead of
coming immediately after it, because the descent has to wait for a directory handle.