Enum Expression

pub enum Expression {
    Number(f64),
    Variable(String),
    Unary {
        op: OperatorType,
        expr: Box<Expression>,
    },
    Binary {
        left: Box<Expression>,
        op: OperatorType,
        right: Box<Expression>,
    },
    Call {
        callee: String,
        args: Vec<Expression>,
    },
}

Expression type, represents… an expression.
It could be everything, from just a number like 2 till a function call

lexper uses this one to recursively evaluate the “main” expression, the one you get from lexper::eval. In that expression all other expressions are nested in and evaluated recursively.

Variants

Number(f64)

Just a number, like “2”

Variable(String)

Some variable inside an expression, like “PI”

Unary

Unary expression, like negotiation -> “-2”

Fields

op: OperatorType

expr: Box<Expression>

Binary

Binary expression, the most common -> “2 + 3”

Fields

left: Box<Expression>

op: OperatorType

right: Box<Expression>

Call

A function call -> “sin(2)”

Fields

callee: String

args: Vec<Expression>

Trait Implementations

impl Debug for Expression

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

Formats the value using the given formatter.

impl PartialEq for Expression

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

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

const 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 Expression