Struct DepthFirstTraversal 

pub struct DepthFirstTraversal<'provider> { /* private fields */ }

A depth-first walk over a subtree, in document order.

Implementations

impl<'provider> DepthFirstTraversal<'provider>

pub fn new( root: NodeState<'provider>, root_path: &str, descent_limit: Option<usize>, ) -> Self

Creates a traversal of the subtree rooted at root, whose content path is root_path (any spelling; it is normalized). A descent limit of Some(limit) visits nodes at most limit levels below the root; None visits the whole subtree.

pub fn next_node(&mut self) -> Result<Option<VisitedNode<'_, 'provider>>>

Advances to the next node in document order, or Ok(None) when the subtree is exhausted. The returned VisitedNode borrows the traversal’s path buffer, so it lives until the next call.