Enum unflow::grammar::designparser::Library_expContextAll[][src]

pub enum Library_expContextAll<'input> {
    Library_objectContext(Library_objectContext<'input>),
    Library_configContext(Library_configContext<'input>),
    Error(Library_expContext<'input>),
}

Variants

Library_objectContext(Library_objectContext<'input>)
Library_configContext(Library_configContext<'input>)
Error(Library_expContext<'input>)

Trait Implementations

impl<'input> Debug for Library_expContextAll<'input>[src]

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

Formats the value using the given formatter. Read more

impl<'input> Deref for Library_expContextAll<'input>[src]

type Target = dyn Library_expContextAttrs<'input> + 'input

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target[src]

Dereferences the value.

impl<'input, 'a> Listenable<dyn DesignListener<'input> + 'a> for Library_expContextAll<'input>[src]

fn enter(&self, listener: &mut (dyn DesignListener<'input> + 'a))[src]

Calls corresponding enter callback on listener T

fn exit(&self, listener: &mut (dyn DesignListener<'input> + 'a))[src]

Calls corresponding exit callback on listener T

impl<'a> TidAble<'a> for Library_expContextAll<'a>[src]

impl<'input, 'a> Visitable<dyn DesignVisitor<'input> + 'a> for Library_expContextAll<'input>[src]

fn accept(&self, visitor: &mut (dyn DesignVisitor<'input> + 'a))[src]

Calls corresponding visit callback on visitorVis

impl<'input> DerefSeal for Library_expContextAll<'input>[src]

impl<'input> DesignParserContext<'input> for Library_expContextAll<'input>[src]

Auto Trait Implementations

impl<'input> !RefUnwindSafe for Library_expContextAll<'input>

impl<'input> !Send for Library_expContextAll<'input>

impl<'input> !Sync for Library_expContextAll<'input>

impl<'input> Unpin for Library_expContextAll<'input>

impl<'input> !UnwindSafe for Library_expContextAll<'input>

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

pub fn type_id(&self) -> TypeId[src]

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

pub fn borrow(&self) -> &T[src]

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

pub fn borrow_mut(&mut self) -> &mut T[src]

Mutably borrows from an owned value. Read more

impl<'input, T, I> CustomRuleContext<'input> for T where
    I: ParserRuleContext<'input> + 'input + ?Sized,
    T: DerefSeal<Target = I> + 'input + Debug + Tid<'input>, 
[src]

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

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

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

pub fn get_rule_index(&self) -> usize[src]

Rule index that corresponds to this context type

pub fn get_alt_number(&self) -> isize[src]

pub fn set_alt_number(&self, _alt_number: isize)[src]

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

Performs the conversion.

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

pub fn into(self) -> U[src]

Performs the conversion.

impl<'input, T> NodeText for T where
    T: CustomRuleContext<'input>, 
[src]

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

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

impl<T> NodeText for T[src]

pub default fn get_node_text(&self, _rule_names: &[&str]) -> String[src]

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

impl<'input, T, I> ParseTree<'input> for T where
    I: ParserRuleContext<'input> + 'input + ?Sized,
    T: DerefSeal<Target = I> + 'input + Debug + Tid<'input>, 
[src]

pub fn get_source_interval(&self) -> Interval[src]

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

pub fn get_text(&self) -> String[src]

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

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

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

impl<'input, T, I> ParserRuleContext<'input> for T where
    I: ParserRuleContext<'input> + 'input + ?Sized,
    T: DerefSeal<Target = I> + 'input + Debug + Tid<'input>, 
[src]

pub fn set_exception(&self, e: ANTLRError)[src]

pub fn set_start(
    &self,
    t: Option<<<T as CustomRuleContext<'input>>::TF as TokenFactory<'input>>::Tok>
)
[src]

pub fn start<'a>(
    &'a self
) -> Ref<'a, <<T as CustomRuleContext<'input>>::TF as TokenFactory<'input>>::Inner> where
    'input: 'a, 
[src]

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

pub fn start_mut<'a>(
    &'a self
) -> RefMut<'a, <<T as CustomRuleContext<'input>>::TF as TokenFactory<'input>>::Tok> where
    'input: 'a, 
[src]

pub fn set_stop(
    &self,
    t: Option<<<T as CustomRuleContext<'input>>::TF as TokenFactory<'input>>::Tok>
)
[src]

pub fn stop<'a>(
    &'a self
) -> Ref<'a, <<T as CustomRuleContext<'input>>::TF as TokenFactory<'input>>::Inner> where
    'input: 'a, 
[src]

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

pub fn stop_mut<'a>(
    &'a self
) -> RefMut<'a, <<T as CustomRuleContext<'input>>::TF as TokenFactory<'input>>::Tok> where
    'input: 'a, 
[src]

pub fn add_child(
    &self,
    child: Rc<<<I as CustomRuleContext<'input>>::Ctx as ParserNodeType<'input>>::Type>
)
[src]

pub fn remove_last_child(&self)[src]

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

fn children_of_type<T>(&self) -> Vec<Rc<T>, Global> where
    T: ParserRuleContext<'input, TF = Self::TF, Ctx = Self::Ctx> + 'input, 
[src]

fn get_token(
    &self,
    ttype: isize,
    pos: usize
) -> Option<Rc<LeafNode<'input, Self::Ctx, NoError>>>
[src]

fn get_tokens(
    &self,
    ttype: isize
) -> Vec<Rc<LeafNode<'input, Self::Ctx, NoError>>, Global>
[src]

impl<'input, T, I> RuleContext<'input> for T where
    I: ParserRuleContext<'input> + 'input + ?Sized,
    T: DerefSeal<Target = I> + 'input + Debug + Tid<'input>, 
[src]

pub fn get_invoking_state(&self) -> isize[src]

Internal parser state

pub fn set_invoking_state(&self, t: isize)[src]

Sets internal parser state

pub fn is_empty(&self) -> bool[src]

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

pub fn get_parent_ctx(
    &self
) -> Option<Rc<<<I as CustomRuleContext<'input>>::Ctx as ParserNodeType<'input>>::Type>>
[src]

Get parent context

pub fn set_parent(
    &self,
    parent: &Option<Rc<<<I as CustomRuleContext<'input>>::Ctx as ParserNodeType<'input>>::Type>>
)
[src]

Set parent context

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

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

Prints list of parent rules

pub 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>, 
[src]

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

pub fn self_id(&self) -> TypeId

Returns type id of the type of self Read more

pub fn id() -> TypeId

Returns type id of this type

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

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

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

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

Attempts to downcast self to T behind reference

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

Attempts to downcast self to T behind mutable reference

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

Attempts to downcast self to T behind Rc pointer

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

Attempts to downcast self to T behind Arc pointer

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

Attempts to downcast self to T behind Box pointer

impl<'input, T, I> Tree<'input> for T where
    I: ParserRuleContext<'input> + 'input + ?Sized,
    T: DerefSeal<Target = I> + 'input + Debug + Tid<'input>, 
[src]

pub fn get_parent(
    &self
) -> Option<Rc<<<I as CustomRuleContext<'input>>::Ctx as ParserNodeType<'input>>::Type>>
[src]

pub fn has_parent(&self) -> bool[src]

pub fn get_payload(&self) -> Box<dyn Any + 'static, Global>

Notable traits for Box<R, Global>

impl<R> Read for Box<R, Global> where
    R: Read + ?Sized
impl<W> Write for Box<W, Global> where
    W: Write + ?Sized
impl<F, A> Future for Box<F, A> where
    A: Allocator + 'static,
    F: Future + Unpin + ?Sized
type Output = <F as Future>::Output;impl<I, A> Iterator for Box<I, A> where
    I: Iterator + ?Sized,
    A: Allocator
type Item = <I as Iterator>::Item;
[src]

pub fn get_child(
    &self,
    i: usize
) -> Option<Rc<<<I as CustomRuleContext<'input>>::Ctx as ParserNodeType<'input>>::Type>>
[src]

pub fn get_child_count(&self) -> usize[src]

pub fn get_children<'a>(
    &'a self
) -> Box<dyn Iterator<Item = Rc<<<T as CustomRuleContext<'input>>::Ctx as ParserNodeType<'input>>::Type>> + 'a, Global>

Notable traits for Box<R, Global>

impl<R> Read for Box<R, Global> where
    R: Read + ?Sized
impl<W> Write for Box<W, Global> where
    W: Write + ?Sized
impl<F, A> Future for Box<F, A> where
    A: Allocator + 'static,
    F: Future + Unpin + ?Sized
type Output = <F as Future>::Output;impl<I, A> Iterator for Box<I, A> where
    I: Iterator + ?Sized,
    A: Allocator
type Item = <I as Iterator>::Item;
where
    'input: 'a, 
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

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

Performs the conversion.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

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

The type returned in the event of a conversion error.

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

Performs the conversion.