Struct Term 

pub struct Term {
    pub left: SpannableNode<Factor>,
    pub cont: Option<TermP>,
}

A multiplication/division on any number of Factors.

If cont == None, then this is just a Factor.

Grammar

Term -> Factor TermP?;

Fields

left: SpannableNode<Factor>

The left-hand Factor.

cont: Option<TermP>

The optional continuation.

Implementations

impl Term

pub fn new_unspanned(left: Factor, cont: Option<TermP>) -> Self

Constructs a Self with dummy span information.

Trait Implementations

impl Clone for Term

fn clone(&self) -> Term

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Term

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

Formats the value using the given formatter.

impl Display for Term

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

Formats the value using the given formatter.

impl Hash for Term

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 Term

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

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 Term

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl Eq for Term

impl StructuralPartialEq for Term