Struct antlr_rust::parser_rule_context::BaseParserRuleContext

source · [−]

pub struct BaseParserRuleContext<'input, Ctx: CustomRuleContext<'input>> {
    pub exception: Option<Box<ANTLRError>>,
    /* private fields */
}

Expand description

Default rule context implementation that keeps everything provided by parser

Fields

exception: Option<Box<ANTLRError>>

error if there was any in this node

Implementations

source

impl<'input, Ctx: CustomRuleContext<'input> + 'input> BaseParserRuleContext<'input, Ctx>

source

pub fn new_parser_ctx(
 parent_ctx: Option<Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>>,
 invoking_state: isize,
 ext: Ctx
) -> Self

source

pub fn copy_from<T: ParserRuleContext<'input, TF = Ctx::TF, Ctx = Ctx::Ctx> + ?Sized>(
ctx: &T,
ext: Ctx
) -> Self

Trait Implementations

source

impl<'input, Ctx: CustomRuleContext<'input>> Borrow<Ctx> for BaseParserRuleContext<'input, Ctx>

source

fn borrow(&self) -> &Ctx

Immutably borrows from an owned value. Read more

source

impl<'input, Ctx: CustomRuleContext<'input>> BorrowMut<Ctx> for BaseParserRuleContext<'input, Ctx>

source

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

Mutably borrows from an owned value. Read more

source

impl<'input, Ctx: CustomRuleContext<'input>> CustomRuleContext<'input> for BaseParserRuleContext<'input, Ctx>

type TF = <Ctx as CustomRuleContext<'input>>::TF

type Ctx = <Ctx as CustomRuleContext<'input>>::Ctx

Type that describes type of context nodes, stored in this context

source

fn get_rule_index(&self) -> usize

Rule index that corresponds to this context type

source

fn get_alt_number(&self) -> isize

source

fn set_alt_number(&self, _alt_number: isize)

source

fn get_node_text(&self, rule_names: &[&str]) -> String

Returns text representation of current node type, rule name for context nodes and token text for terminal nodes Read more

source

impl<'input, Ctx: CustomRuleContext<'input>> Debug for BaseParserRuleContext<'input, Ctx>

source

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more

source

impl<'input, Ctx: CustomRuleContext<'input>> Deref for BaseParserRuleContext<'input, Ctx>

type Target = Ctx

The resulting type after dereferencing.

source

fn deref(&self) -> &Self::Target

Dereferences the value.

source

impl<'input, Ctx: CustomRuleContext<'input>> DerefMut for BaseParserRuleContext<'input, Ctx>

source

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

source

impl<'input, Ctx: CustomRuleContext<'input> + TidAble<'input>> ParseTree<'input> for BaseParserRuleContext<'input, Ctx>

source

fn get_source_interval(&self) -> Interval

Return an {@link Interval} indicating the index in the {@link TokenStream} of the first and last token associated with this subtree. If this node is a leaf, then the interval represents a single token and has interval i..i for token index i. Read more

source

fn get_text(&self) -> String

Return combined text of this AST node. To create resulting string it does traverse whole subtree, also it includes only tokens added to the parse tree Read more

source

fn to_string_tree(
&self,
r: &dyn Recognizer<'input, TF = Self::TF, Node = Self::Ctx>
) -> String

Print out a whole tree, not just a node, in LISP format (root child1 .. childN). Print just a node if this is a leaf. We have to know the recognizer so we can get rule names. Read more

source

impl<'input, Ctx: CustomRuleContext<'input> + TidAble<'input>> ParserRuleContext<'input> for BaseParserRuleContext<'input, Ctx>

source

fn set_exception(&self, _e: ANTLRError)

source

fn set_start(&self, t: Option<<Ctx::TF as TokenFactory<'input>>::Tok>)

source

fn start<'a>(&'a self) -> Ref<'a, <Ctx::TF as TokenFactory<'input>>::Inner> where
'input: 'a,

Get the initial token in this context. Note that the range from start to stop is inclusive, so for rules that do not consume anything (for example, zero length or error productions) this token may exceed stop. Read more

source

fn start_mut<'a>(
&'a self
) -> RefMut<'a, <Self::TF as TokenFactory<'input>>::Tok> where
'input: 'a,

source

fn set_stop(&self, t: Option<<Ctx::TF as TokenFactory<'input>>::Tok>)

source

fn stop<'a>(&'a self) -> Ref<'a, <Ctx::TF as TokenFactory<'input>>::Inner> where
'input: 'a,

Get the final token in this context. Note that the range from start to stop is inclusive, so for rules that do not consume anything (for example, zero length or error productions) this token may precede start. Read more

source

fn stop_mut<'a>(&'a self) -> RefMut<'a, <Self::TF as TokenFactory<'input>>::Tok> where
'input: 'a,

source

fn add_child(&self, child: Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>)

source

fn remove_last_child(&self)

source

fn child_of_type<T>(&self, pos: usize) -> Option<Rc<T>> where
T: ParserRuleContext<'input, TF = Self::TF, Ctx = Self::Ctx> + 'input,
Self: Sized,

source

fn children_of_type<T>(&self) -> Vec<Rc<T>>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,` where
 T: ParserRuleContext<'input, TF = Self::TF, Ctx = Self::Ctx> + 'input,
 Self: Sized,

source

fn get_token(
 &self,
 ttype: isize,
 pos: usize
) -> Option<Rc<TerminalNode<'input, Self::Ctx>>>

source

fn get_tokens(&self, ttype: isize) -> Vec<Rc<TerminalNode<'input, Self::Ctx>>>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

source

impl<'input, Ctx: CustomRuleContext<'input>> RuleContext<'input> for BaseParserRuleContext<'input, Ctx>

source

fn get_invoking_state(&self) -> isize

Internal parser state

source

fn set_invoking_state(&self, t: isize)

Sets internal parser state

source

fn get_parent_ctx(
&self
) -> Option<Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>>

Get parent context

source

fn set_parent(
&self,
parent: &Option<Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>>
)

Set parent context

source

fn is_empty(&self) -> bool

A context is empty if there is no invoking state; meaning nobody called current context. Which is usually true for the root of the syntax tree Read more

source

impl<'input, Ctx: CustomRuleContext<'input>> Tree<'input> for BaseParserRuleContext<'input, Ctx>

source

fn get_parent(&self) -> Option<Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>>

source

fn has_parent(&self) -> bool

source

fn get_payload(&self) -> Box<dyn Any>ⓘNotable traits for Box<W, Global>`impl<W> Write for Box<W, Global> where W: Write + ?Sized, impl<R> Read for Box<R, Global> where R: Read + ?Sized, impl<I, A> Iterator for Box<I, A> where I: Iterator + ?Sized, A: Allocator, type Item = ::Item;impl<F, A> Future for Box<F, A> where F: Future + Unpin + ?Sized, A: Allocator + 'static, type Output = <F as Future>::Output;`

source

fn get_child(
&self,
i: usize
) -> Option<Rc<<Self::Ctx as ParserNodeType<'input>>::Type>>

source

fn get_child_count(&self) -> usize

source

fn get_children<'a>(
 &'a self
) -> Box<dyn Iterator<Item = Rc<<Self::Ctx as ParserNodeType<'input>>::Type>> + 'a>ⓘNotable traits for Box<W, Global>`impl<W> Write for Box<W, Global> where W: Write + ?Sized, impl<R> Read for Box<R, Global> where R: Read + ?Sized, impl<I, A> Iterator for Box<I, A> where I: Iterator + ?Sized, A: Allocator, type Item = ::Item;impl<F, A> Future for Box<F, A> where F: Future + Unpin + ?Sized, A: Allocator + 'static, type Output = <F as Future>::Output;` where
 'input: 'a,

source

impl<'i, Ctx: TidAble<'i>> TidAble<'i> for BaseParserRuleContext<'i, Ctx> where
Ctx: CustomRuleContext<'i>,

Auto Trait Implementations

impl<'input, Ctx> !RefUnwindSafe for BaseParserRuleContext<'input, Ctx>

impl<'input, Ctx> !Send for BaseParserRuleContext<'input, Ctx>

impl<'input, Ctx> !Sync for BaseParserRuleContext<'input, Ctx>

impl<'input, Ctx> Unpin for BaseParserRuleContext<'input, Ctx> where
Ctx: Unpin,
<<Ctx as CustomRuleContext<'input>>::TF as TokenFactory<'input>>::Tok: Unpin,

impl<'input, Ctx> !UnwindSafe for BaseParserRuleContext<'input, Ctx>

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

source

fn downcast_ref<T>(this: &Self) -> Option<&T> where
T: Any,

Attempts to downcast this to T behind reference

source

fn downcast_mut<T>(this: &mut Self) -> Option<&mut T> where
T: Any,

Attempts to downcast this to T behind mutable reference

source

fn downcast_rc<T>(this: Rc<Self>) -> Result<Rc<T>, Rc<Self>> where
T: Any,

Attempts to downcast this to T behind Rc pointer

source

fn downcast_arc<T>(this: Arc<Self>) -> Result<Arc<T>, Arc<Self>> where
T: Any,

Attempts to downcast this to T behind Arc pointer

source

fn downcast_box<T>(
this: Box<Self, Global>
) -> Result<Box<T, Global>, Box<Self, Global>> where
T: Any,

Attempts to downcast this to T behind Box pointer

source

fn downcast_move<T>(this: Self) -> Option<T> where
T: Any,

Attempts to downcast owned Self to T, useful only in generic context as a workaround for specialization Read more

source

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

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

source

impl<T, X> CoerceTo<T> for X where
T: CoerceFrom<X> + ?Sized,

source

fn coerce_rc_to(self: Rc<X>) -> Rc<T>

source

fn coerce_box_to(self: Box<X, Global>) -> Box<T, Global>ⓘNotable traits for Box<W, Global>`impl<W> Write for Box<W, Global> where W: Write + ?Sized, impl<R> Read for Box<R, Global> where R: Read + ?Sized, impl<I, A> Iterator for Box<I, A> where I: Iterator + ?Sized, A: Allocator, type Item = ::Item;impl<F, A> Future for Box<F, A> where F: Future + Unpin + ?Sized, A: Allocator + 'static, type Output = <F as Future>::Output;`

source

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · 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<'input, T> RuleContextExt<'input> for T where
T: 'input + ParserRuleContext<'input> + ?Sized,

source

fn to_string<Z>(
 self: &Rc<T>,
 rule_names: Option<&[&str]>,
 stop: Option<Rc<Z>>
) -> String where
 Z: 'input + ParserRuleContext<'input, Ctx = <T as CustomRuleContext<'input>>::Ctx, TF = <T as CustomRuleContext<'input>>::TF> + ?Sized,
 T: CoerceTo<Z>,
 <T as CustomRuleContext<'input>>::Ctx: ParserNodeType<'input>,
 <<T as CustomRuleContext<'input>>::Ctx as ParserNodeType<'input>>::Type == Z,

Prints list of parent rules

source

fn accept_children<V>(&self, visitor: &mut V) where
V: ParseTreeVisitor<'input, <T as CustomRuleContext<'input>>::Ctx> + ?Sized,
<<T as CustomRuleContext<'input>>::Ctx as ParserNodeType<'input>>::Type: VisitableDyn<V>,

source

impl<'a, T> Tid<'a> for T where
T: TidAble<'a> + ?Sized,

source

fn self_id(&self) -> TypeId

Returns type id of the type of self Read more

source

fn id() -> TypeId

Returns type id of this type

source

impl<'a, X> TidExt<'a> for X where
X: Tid<'a> + ?Sized,

source

fn is<T>(&self) -> bool where
T: Tid<'a>,

Returns true if type behind self is equal to the type of T.

source

fn downcast_ref<T>(&'b self) -> Option<&'b T> where
T: Tid<'a>,

Attempts to downcast self to T behind reference

source

fn downcast_mut<T>(&'b mut self) -> Option<&'b mut T> where
T: Tid<'a>,

Attempts to downcast self to T behind mutable reference

source

fn downcast_rc<T>(self: Rc<Self>) -> Result<Rc<T>, Rc<Self>> where
T: Tid<'a>,

Attempts to downcast self to T behind Rc pointer

source

fn downcast_arc<T>(self: Arc<Self>) -> Result<Arc<T>, Arc<Self>> where
T: Tid<'a>,

Attempts to downcast self to T behind Arc pointer

source

fn downcast_box<T>(
self: Box<Self, Global>
) -> Result<Box<T, Global>, Box<Self, Global>> where
T: Tid<'a>,

Attempts to downcast self to T behind Box pointer

source

fn downcast_move<T>(self) -> Option<T> where
T: Tid<'a>,

Attempts to downcast owned Self to T, useful only in generic context as a workaround for specialization Read more

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

Struct antlr_rust::parser_rule_context::BaseParserRuleContext

Fields

Implementations

impl<'input, Ctx: CustomRuleContext<'input> + 'input> BaseParserRuleContext<'input, Ctx>

pub fn new_parser_ctx( parent_ctx: Option<Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>>, invoking_state: isize, ext: Ctx) -> Self

pub fn copy_from<T: ParserRuleContext<'input, TF = Ctx::TF, Ctx = Ctx::Ctx> + ?Sized>( ctx: &T, ext: Ctx) -> Self

Trait Implementations

impl<'input, Ctx: CustomRuleContext<'input>> Borrow<Ctx> for BaseParserRuleContext<'input, Ctx>

fn borrow(&self) -> &Ctx

impl<'input, Ctx: CustomRuleContext<'input>> BorrowMut<Ctx> for BaseParserRuleContext<'input, Ctx>

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

impl<'input, Ctx: CustomRuleContext<'input>> CustomRuleContext<'input> for BaseParserRuleContext<'input, Ctx>

type TF = <Ctx as CustomRuleContext<'input>>::TF

type Ctx = <Ctx as CustomRuleContext<'input>>::Ctx

fn get_rule_index(&self) -> usize

fn get_alt_number(&self) -> isize

fn set_alt_number(&self, _alt_number: isize)

fn get_node_text(&self, rule_names: &[&str]) -> String

impl<'input, Ctx: CustomRuleContext<'input>> Debug for BaseParserRuleContext<'input, Ctx>

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

impl<'input, Ctx: CustomRuleContext<'input>> Deref for BaseParserRuleContext<'input, Ctx>

type Target = Ctx

fn deref(&self) -> &Self::Target

impl<'input, Ctx: CustomRuleContext<'input>> DerefMut for BaseParserRuleContext<'input, Ctx>

fn deref_mut(&mut self) -> &mut Self::Target

impl<'input, Ctx: CustomRuleContext<'input> + TidAble<'input>> ParseTree<'input> for BaseParserRuleContext<'input, Ctx>

fn get_source_interval(&self) -> Interval

fn get_text(&self) -> String

fn to_string_tree( &self, r: &dyn Recognizer<'input, TF = Self::TF, Node = Self::Ctx>) -> String

impl<'input, Ctx: CustomRuleContext<'input> + TidAble<'input>> ParserRuleContext<'input> for BaseParserRuleContext<'input, Ctx>

fn set_exception(&self, _e: ANTLRError)

fn set_start(&self, t: Option<<Ctx::TF as TokenFactory<'input>>::Tok>)

fn start<'a>(&'a self) -> Ref<'a, <Ctx::TF as TokenFactory<'input>>::Inner> where 'input: 'a,

fn start_mut<'a>( &'a self) -> RefMut<'a, <Self::TF as TokenFactory<'input>>::Tok> where 'input: 'a,

fn set_stop(&self, t: Option<<Ctx::TF as TokenFactory<'input>>::Tok>)

fn stop<'a>(&'a self) -> Ref<'a, <Ctx::TF as TokenFactory<'input>>::Inner> where 'input: 'a,

fn stop_mut<'a>(&'a self) -> RefMut<'a, <Self::TF as TokenFactory<'input>>::Tok> where 'input: 'a,

fn add_child(&self, child: Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>)

fn remove_last_child(&self)

fn child_of_type<T>(&self, pos: usize) -> Option<Rc<T>> where T: ParserRuleContext<'input, TF = Self::TF, Ctx = Self::Ctx> + 'input, Self: Sized,

fn children_of_type<T>(&self) -> Vec<Rc<T>>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where A: Allocator, where T: ParserRuleContext<'input, TF = Self::TF, Ctx = Self::Ctx> + 'input, Self: Sized,

fn get_token( &self, ttype: isize, pos: usize) -> Option<Rc<TerminalNode<'input, Self::Ctx>>>

fn get_tokens(&self, ttype: isize) -> Vec<Rc<TerminalNode<'input, Self::Ctx>>>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where A: Allocator,

impl<'input, Ctx: CustomRuleContext<'input>> RuleContext<'input> for BaseParserRuleContext<'input, Ctx>

fn get_invoking_state(&self) -> isize

fn set_invoking_state(&self, t: isize)

fn get_parent_ctx( &self) -> Option<Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>>

fn set_parent( &self, parent: &Option<Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>>)

fn is_empty(&self) -> bool

impl<'input, Ctx: CustomRuleContext<'input>> Tree<'input> for BaseParserRuleContext<'input, Ctx>

fn get_parent(&self) -> Option<Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>>

fn has_parent(&self) -> bool

fn get_child( &self, i: usize) -> Option<Rc<<Self::Ctx as ParserNodeType<'input>>::Type>>

fn get_child_count(&self) -> usize

impl<'i, Ctx: TidAble<'i>> TidAble<'i> for BaseParserRuleContext<'i, Ctx> where Ctx: CustomRuleContext<'i>,

Auto Trait Implementations

impl<'input, Ctx> !RefUnwindSafe for BaseParserRuleContext<'input, Ctx>

impl<'input, Ctx> !Send for BaseParserRuleContext<'input, Ctx>

impl<'input, Ctx> !Sync for BaseParserRuleContext<'input, Ctx>

impl<'input, Ctx> Unpin for BaseParserRuleContext<'input, Ctx> where Ctx: Unpin, <<Ctx as CustomRuleContext<'input>>::TF as TokenFactory<'input>>::Tok: Unpin,

impl<'input, Ctx> !UnwindSafe for BaseParserRuleContext<'input, Ctx>

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> AnyExt for T where T: Any + ?Sized,

fn downcast_ref<T>(this: &Self) -> Option<&T> where T: Any,

fn downcast_mut<T>(this: &mut Self) -> Option<&mut T> where T: Any,

fn downcast_rc<T>(this: Rc<Self>) -> Result<Rc<T>, Rc<Self>> where T: Any,

fn downcast_arc<T>(this: Arc<Self>) -> Result<Arc<T>, Arc<Self>> where T: Any,

fn downcast_box<T>( this: Box<Self, Global>) -> Result<Box<T, Global>, Box<Self, Global>> where T: Any,

fn downcast_move<T>(this: Self) -> Option<T> where T: Any,

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

fn borrow(&self) -> &T

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

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

impl<T, X> CoerceTo<T> for X where T: CoerceFrom<X> + ?Sized,

fn coerce_rc_to(self: Rc<X>) -> Rc<T>

fn coerce_ref_to(&self) -> &T

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

impl<T> From<T> for T

pub fn new_parser_ctx(
parent_ctx: Option<Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>>,
invoking_state: isize,
ext: Ctx
) -> Self

pub fn copy_from<T: ParserRuleContext<'input, TF = Ctx::TF, Ctx = Ctx::Ctx> + ?Sized>(
ctx: &T,
ext: Ctx
) -> Self

fn to_string_tree(
&self,
r: &dyn Recognizer<'input, TF = Self::TF, Node = Self::Ctx>
) -> String

fn start<'a>(&'a self) -> Ref<'a, <Ctx::TF as TokenFactory<'input>>::Inner> where
'input: 'a,

fn start_mut<'a>(
&'a self
) -> RefMut<'a, <Self::TF as TokenFactory<'input>>::Tok> where
'input: 'a,

fn stop<'a>(&'a self) -> Ref<'a, <Ctx::TF as TokenFactory<'input>>::Inner> where
'input: 'a,

fn stop_mut<'a>(&'a self) -> RefMut<'a, <Self::TF as TokenFactory<'input>>::Tok> where
'input: 'a,

fn child_of_type<T>(&self, pos: usize) -> Option<Rc<T>> where
T: ParserRuleContext<'input, TF = Self::TF, Ctx = Self::Ctx> + 'input,
Self: Sized,

fn children_of_type<T>(&self) -> Vec<Rc<T>>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,` where
T: ParserRuleContext<'input, TF = Self::TF, Ctx = Self::Ctx> + 'input,
Self: Sized,

fn get_token(
&self,
ttype: isize,
pos: usize
) -> Option<Rc<TerminalNode<'input, Self::Ctx>>>

fn get_tokens(&self, ttype: isize) -> Vec<Rc<TerminalNode<'input, Self::Ctx>>>ⓘNotable traits for Vec<u8, A>`impl<A> Write for Vec<u8, A> where A: Allocator,`

fn get_parent_ctx(
&self
) -> Option<Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>>

fn set_parent(
&self,
parent: &Option<Rc<<Ctx::Ctx as ParserNodeType<'input>>::Type>>
)

fn get_child(
&self,
i: usize
) -> Option<Rc<<Self::Ctx as ParserNodeType<'input>>::Type>>

impl<'i, Ctx: TidAble<'i>> TidAble<'i> for BaseParserRuleContext<'i, Ctx> where
Ctx: CustomRuleContext<'i>,

impl<'input, Ctx> Unpin for BaseParserRuleContext<'input, Ctx> where
Ctx: Unpin,
<<Ctx as CustomRuleContext<'input>>::TF as TokenFactory<'input>>::Tok: Unpin,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> AnyExt for T where
T: Any + ?Sized,

fn downcast_ref<T>(this: &Self) -> Option<&T> where
T: Any,

fn downcast_mut<T>(this: &mut Self) -> Option<&mut T> where
T: Any,

fn downcast_rc<T>(this: Rc<Self>) -> Result<Rc<T>, Rc<Self>> where
T: Any,

fn downcast_arc<T>(this: Arc<Self>) -> Result<Arc<T>, Arc<Self>> where
T: Any,

fn downcast_box<T>(
this: Box<Self, Global>
) -> Result<Box<T, Global>, Box<Self, Global>> where
T: Any,

fn downcast_move<T>(this: Self) -> Option<T> where
T: Any,

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

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

impl<T, X> CoerceTo<T> for X where
T: CoerceFrom<X> + ?Sized,

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

impl<'input, T> RuleContextExt<'input> for T where
T: 'input + ParserRuleContext<'input> + ?Sized,

fn accept_children<V>(&self, visitor: &mut V) where
V: ParseTreeVisitor<'input, <T as CustomRuleContext<'input>>::Ctx> + ?Sized,
<<T as CustomRuleContext<'input>>::Ctx as ParserNodeType<'input>>::Type: VisitableDyn<V>,

impl<'a, T> Tid<'a> for T where
T: TidAble<'a> + ?Sized,

impl<'a, X> TidExt<'a> for X where
X: Tid<'a> + ?Sized,

fn is<T>(&self) -> bool where
T: Tid<'a>,

fn downcast_ref<T>(&'b self) -> Option<&'b T> where
T: Tid<'a>,

fn downcast_mut<T>(&'b mut self) -> Option<&'b mut T> where
T: Tid<'a>,

fn downcast_rc<T>(self: Rc<Self>) -> Result<Rc<T>, Rc<Self>> where
T: Tid<'a>,

fn downcast_arc<T>(self: Arc<Self>) -> Result<Arc<T>, Arc<Self>> where
T: Tid<'a>,

fn downcast_box<T>(
self: Box<Self, Global>
) -> Result<Box<T, Global>, Box<Self, Global>> where
T: Tid<'a>,

fn downcast_move<T>(self) -> Option<T> where
T: Tid<'a>,

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

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