pub struct Parser { /* private fields */ }Implementations§
Trait Implementations§
Source§impl ParseTreeVisitorCompat<'_> for Parser
impl ParseTreeVisitorCompat<'_> for Parser
type Node = CELParserContextType
type Return = IdedExpr
Source§fn temp_result(&mut self) -> &mut Self::Return
fn temp_result(&mut self) -> &mut Self::Return
Temporary storage for
ParseTreeVisitor blanket implementation to work Read morefn visit( &mut self, node: &<Self::Node as ParserNodeType<'_>>::Type, ) -> Self::Return
fn aggregate_results( &self, _aggregate: Self::Return, next: Self::Return, ) -> Self::Return
Source§fn visit_terminal(
&mut self,
_node: &LeafNode<'input, Self::Node, NoError>,
) -> Self::Return
fn visit_terminal( &mut self, _node: &LeafNode<'input, Self::Node, NoError>, ) -> Self::Return
Called on terminal(leaf) node
Source§fn visit_error_node(
&mut self,
_node: &LeafNode<'input, Self::Node, IsError>,
) -> Self::Return
fn visit_error_node( &mut self, _node: &LeafNode<'input, Self::Node, IsError>, ) -> Self::Return
Called on error node
fn visit_children( &mut self, node: &<Self::Node as ParserNodeType<'input>>::Type, ) -> Self::Return
fn should_visit_next_child( &self, node: &<Self::Node as ParserNodeType<'input>>::Type, current: &Self::Return, ) -> bool
Auto Trait Implementations§
impl Freeze for Parser
impl !RefUnwindSafe for Parser
impl !Send for Parser
impl !Sync for Parser
impl Unpin for Parser
impl !UnwindSafe for Parser
Blanket Implementations§
Source§impl<T> AnyExt for T
impl<T> AnyExt for T
Source§fn downcast_ref<T>(this: &Self) -> Option<&T>where
T: Any,
fn downcast_ref<T>(this: &Self) -> Option<&T>where
T: Any,
Attempts to downcast this to
T behind referenceSource§fn downcast_mut<T>(this: &mut Self) -> Option<&mut T>where
T: Any,
fn downcast_mut<T>(this: &mut Self) -> Option<&mut T>where
T: Any,
Attempts to downcast this to
T behind mutable referenceSource§fn downcast_rc<T>(this: Rc<Self>) -> Result<Rc<T>, Rc<Self>>where
T: Any,
fn downcast_rc<T>(this: Rc<Self>) -> Result<Rc<T>, Rc<Self>>where
T: Any,
Attempts to downcast this to
T behind Rc pointerSource§fn downcast_arc<T>(this: Arc<Self>) -> Result<Arc<T>, Arc<Self>>where
T: Any,
fn downcast_arc<T>(this: Arc<Self>) -> Result<Arc<T>, Arc<Self>>where
T: Any,
Attempts to downcast this to
T behind Arc pointerSource§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
Source§impl<T, X> CoerceTo<T> for Xwhere
T: CoerceFrom<X> + ?Sized,
impl<T, X> CoerceTo<T> for Xwhere
T: CoerceFrom<X> + ?Sized,
fn coerce_rc_to(self: Rc<X>) -> Rc<T>
fn coerce_box_to(self: Box<X>) -> Box<T>
fn coerce_ref_to(&self) -> &T
fn coerce_mut_to(&mut self) -> &mut T
Source§impl<'input, Node, T> ParseTreeVisitor<'input, Node> for Twhere
Node: ParserNodeType<'input>,
<Node as ParserNodeType<'input>>::Type: VisitableDyn<T>,
T: ParseTreeVisitorCompat<'input, Node = Node>,
impl<'input, Node, T> ParseTreeVisitor<'input, Node> for Twhere
Node: ParserNodeType<'input>,
<Node as ParserNodeType<'input>>::Type: VisitableDyn<T>,
T: ParseTreeVisitorCompat<'input, Node = Node>,
Source§fn visit_terminal(&mut self, node: &LeafNode<'input, Node, NoError>)
fn visit_terminal(&mut self, node: &LeafNode<'input, Node, NoError>)
Basically alias for
node.accept(self) in visitor implementation
just to make api closer to java
Called on terminal(leaf) nodeSource§fn visit_error_node(&mut self, node: &LeafNode<'input, Node, IsError>)
fn visit_error_node(&mut self, node: &LeafNode<'input, Node, IsError>)
Called on error node
Source§fn visit_children(&mut self, node: &<Node as ParserNodeType<'input>>::Type)
fn visit_children(&mut self, node: &<Node as ParserNodeType<'input>>::Type)
Implement this only if you want to change children visiting algorithm