Struct regex_syntax::ast::visitor::HeapVisitor

source ·
struct HeapVisitor<'a> {
    stack: Vec<(&'a Ast, Frame<'a>)>,
    stack_class: Vec<(ClassInduct<'a>, ClassFrame<'a>)>,
}
Expand description

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

Fields§

§stack: Vec<(&'a Ast, Frame<'a>)>

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

§stack_class: Vec<(ClassInduct<'a>, ClassFrame<'a>)>

Similar to the Ast stack above, but is used only for character classes. In particular, character classes embed their own mini recursive syntax.

Implementations§

source§

impl<'a> HeapVisitor<'a>

source

fn new() -> HeapVisitor<'a>

source

fn visit<V: Visitor>( &mut self, ast: &'a Ast, visitor: V, ) -> Result<V::Output, V::Err>

source

fn induct<V: Visitor>( &mut self, ast: &'a Ast, visitor: &mut V, ) -> Result<Option<Frame<'a>>, V::Err>

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

If this visits a class, then the underlying visitor implementation may return an error which will be passed on here.

source

fn pop(&self, induct: Frame<'a>) -> Option<Frame<'a>>

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

source

fn visit_class<V: Visitor>( &mut self, ast: &'a ClassBracketed, visitor: &mut V, ) -> Result<(), V::Err>

source

fn visit_class_pre<V: Visitor>( &self, ast: &ClassInduct<'a>, visitor: &mut V, ) -> Result<(), V::Err>

Call the appropriate Visitor methods given an inductive step.

source

fn visit_class_post<V: Visitor>( &self, ast: &ClassInduct<'a>, visitor: &mut V, ) -> Result<(), V::Err>

Call the appropriate Visitor methods given an inductive step.

source

fn induct_class(&self, ast: &ClassInduct<'a>) -> Option<ClassFrame<'a>>

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

source

fn pop_class(&self, induct: ClassFrame<'a>) -> Option<ClassFrame<'a>>

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

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> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.