Enum wagon_parser::parser::inverse::Inverse

pub enum Inverse {
    Not(SpannableNode<Comparison>),
    Comparison(SpannableNode<Comparison>),
}

Either a Comparison prepend by ! or just a Comparison.

Grammar

Inverse -> “!”? Comparison;

Variants

Not(SpannableNode<Comparison>)

!

Comparison(SpannableNode<Comparison>)

The next layer down.

Implementations

impl Inverse

pub fn new_unspanned_not(arg_0: Comparison) -> Self

Construct a Self::Not with dummy span information.

pub fn new_unspanned_comparison(arg_0: Comparison) -> Self

Construct a Self::Comparison with dummy span information.

Trait Implementations

impl Clone for Inverse

fn clone(&self) -> Inverse

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Inverse

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

Formats the value using the given formatter.

impl Display for Inverse

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

Formats the value using the given formatter.

impl Hash for Inverse

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Parse for Inverse

fn parse(lexer: &mut LexerBridge<'_>) -> ParseResult<Self>

where Self: Sized,

Given a lexer, try to parse a valid instance of this node.

fn parse_sep( lexer: &mut LexerBridge<'_>, join: Tokens ) -> ParseResult<Vec<Self>>

where Self: Sized,

Parse multiple instances of this node, separated by a Tokens.

fn parse_sep_end( lexer: &mut LexerBridge<'_>, join: Tokens, end: Tokens ) -> ParseResult<Vec<Self>>

where Self: Sized,

Parse multiple instances of this node, separated by a Tokens end ended by a (possibly different) Tokens.

impl PartialEq for Inverse

fn eq(&self, other: &Inverse) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Inverse

impl StructuralPartialEq for Inverse