Enum BinOp 

pub enum BinOp {
    Add(Token),
    Minus(Token),
    Mul(Token),
    Mod(Token),
    Pow(Token),
    Div(Token),
    IDiv(Token),
    BAnd(Token),
    BOr(Token),
    BXor(Token),
    Shl(Token),
    Shr(Token),
    Concat(Token),
    Ne(Token),
    Eq(Token),
    Lt(Token),
    Le(Token),
    Gt(Token),
    Ge(Token),
    And(Token),
    Or(Token),
    None,
}

Variants

Add(Token)

Minus(Token)

Mul(Token)

Mod(Token)

Pow(Token)

Div(Token)

IDiv(Token)

BAnd(Token)

BOr(Token)

BXor(Token)

Shl(Token)

Shr(Token)

Concat(Token)

Ne(Token)

Eq(Token)

Lt(Token)

Le(Token)

Gt(Token)

Ge(Token)

And(Token)

Or(Token)

None

Implementations

impl BinOp

pub fn from_token(token: Token) -> BinOp

pub fn priority(&self) -> BinOpPriority

pub fn is_comp(&self) -> bool

Trait Implementations

impl Clone for BinOp

fn clone(&self) -> BinOp

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Comments for BinOp

fn get_comments(&self) -> Vec<&str>

fn has_comments(&self) -> bool

impl Debug for BinOp

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

Formats the value using the given formatter.

impl PartialEq for BinOp

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