Enum BinOp

pub enum BinOp {
    Add,
    Sub,
    Div,
    Mul,
    Power,
    Mod,
}

A binary operation type. Having a seperate enum for this avoids repitition and allows for some optimisations downstream.

Variants

Add

Addition. Example: 10+14 is 24

Sub

Subtraction. Example: 5-3 is 2

Div

Division. Example: 32/4 is 8

Mul

Multiplication. Example: 5*11 is 55

Power

Power of. Example: (3^3 or 3**3) is 81

Mod

Modulo. Example: 20 % 2 is 0

Trait Implementations

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