Struct wagon_parser::parser::disjunct::Disjunct

pub struct Disjunct(pub Vec<SpannableNode<Conjunct>>);

A list of Conjunct nodes, seperated by &&.

Grammar

Disjunct -> [Conjunct] ("&&" Disjunct)?;

Tuple Fields

0: Vec<SpannableNode<Conjunct>>

Implementations

impl Disjunct

pub fn new_unspanned(arg_0: Vec<Conjunct>) -> Self

Constructs a Self with dummy span information.

Trait Implementations

impl Clone for Disjunct

fn clone(&self) -> Disjunct

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Disjunct

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

Formats the value using the given formatter.

impl Display for Disjunct

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

Formats the value using the given formatter.

impl Hash for Disjunct

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 Disjunct

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 Disjunct

fn eq(&self, other: &Disjunct) -> 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 Disjunct

impl StructuralPartialEq for Disjunct