Struct Walker 

pub struct Walker<'a> { /* private fields */ }

Pre-order DFS over doc.children. At every node, every sink’s enter fires (in slice order); the walker then recurses into the node’s children; finally every sink’s leave fires (in reverse slice order, LIFO).

Document itself is not surfaced as a Node::Document event; the walker iterates doc.children directly. Sinks needing a document boundary subscribe to Frontmatter or to their first node.

Implementations

impl<'a> Walker<'a>

pub fn new(doc: &'a Document) -> Self

pub fn walk(self, sinks: &mut [&mut dyn NodeSink])

Drive the walk. enter fires slice-order, leave fires LIFO.