Struct regex_syntax::hir::visitor::HeapVisitor
source · struct HeapVisitor<'a> {
stack: Vec<(&'a Hir, Frame<'a>)>,
}
Expand description
HeapVisitor visits every item in an Hir
recursively using constant stack
size and a heap size proportional to the size of the Hir
.
Fields§
§stack: Vec<(&'a Hir, Frame<'a>)>
A stack of Hir
nodes. This is roughly analogous to the call stack
used in a typical recursive visitor.
Implementations§
source§impl<'a> HeapVisitor<'a>
impl<'a> HeapVisitor<'a>
fn new() -> HeapVisitor<'a>
fn visit<V: Visitor>( &mut self, hir: &'a Hir, visitor: V, ) -> Result<V::Output, V::Err>
Auto Trait Implementations§
impl<'a> Freeze for HeapVisitor<'a>
impl<'a> RefUnwindSafe for HeapVisitor<'a>
impl<'a> Send for HeapVisitor<'a>
impl<'a> Sync for HeapVisitor<'a>
impl<'a> Unpin for HeapVisitor<'a>
impl<'a> UnwindSafe for HeapVisitor<'a>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more