Struct regex_syntax::hir::visitor::HeapVisitor[][src]

struct HeapVisitor<'a> {
    stack: Vec<(&'a Hir, Frame<'a>)>,
}

HeapVisitor visits every item in an Hir recursively using constant stack size and a heap size proportional to the size of the Hir.

Fields

A stack of Hir nodes. This is roughly analogous to the call stack used in a typical recursive visitor.

Methods

impl<'a> HeapVisitor<'a>
[src]

Build a stack frame for the given HIR if one is needed (which occurs if and only if there are child nodes in the HIR). Otherwise, return None.

Pops the given frame. If the frame has an additional inductive step, then return it, otherwise return None.

Auto Trait Implementations

impl<'a> Send for HeapVisitor<'a>

impl<'a> Sync for HeapVisitor<'a>