Struct Add 

pub struct Add<Left: Expr<Scope = Scope>, Right: Expr<Scope = Scope>, Scope>(pub Left, pub Right, pub PhantomData<Scope>)
where
    Left::Return: Add<Right::Return>;

Addition, e.g. a + b.

Tuple Fields

0: Left

1: Right

2: PhantomData<Scope>

Trait Implementations

impl<Left: Expr<Scope = Scope>, Right: Expr<Scope = Scope>, Scope> Expr for Add<Left, Right, Scope>

where Left::Return: Add<Right::Return>,

const COMPLEXITY: usize

Trivial measure of complexity: a variable is 1, an operation is 1, a binary op is 2, a conditional is 3, etc.

type Return = <<Left as Expr>::Return as Add<<Right as Expr>::Return>>::Output

Return type of eval (if not an error).

type Scope = Scope

Data structure holding all variables in scope.

fn eval(&self, scope: &mut Self::Scope) -> Self::Return

Find and return a mutation, if any, that passes the given test suite. Evaluate as if running the original function.