Enum ExprLang 

pub enum ExprLang {
    Num(Symbol),
    Add([Id; 2]),
    Mul([Id; 2]),
    Div([Id; 2]),
    Pow([Id; 2]),
    Neg([Id; 1]),
    Inv([Id; 1]),
    Abs([Id; 1]),
    Sin([Id; 1]),
    Cos([Id; 1]),
    Tan([Id; 1]),
    Exp([Id; 1]),
    Log([Id; 1]),
    Sqrt([Id; 1]),
    Asin([Id; 1]),
    Acos([Id; 1]),
    Atan([Id; 1]),
    Sinh([Id; 1]),
    Cosh([Id; 1]),
    Tanh([Id; 1]),
    Re([Id; 1]),
    Im([Id; 1]),
    Conj([Id; 1]),
    Commutator([Id; 2]),
    Anticommutator([Id; 2]),
    TensorProduct([Id; 2]),
    Trace([Id; 1]),
    Dagger([Id; 1]),
    Determinant([Id; 1]),
    Transpose([Id; 1]),
}

The symbolic expression language

Variants

Num(Symbol)

Add([Id; 2])

Mul([Id; 2])

Div([Id; 2])

Pow([Id; 2])

Neg([Id; 1])

Inv([Id; 1])

Abs([Id; 1])

Sin([Id; 1])

Cos([Id; 1])

Tan([Id; 1])

Exp([Id; 1])

Log([Id; 1])

Sqrt([Id; 1])

Asin([Id; 1])

Acos([Id; 1])

Atan([Id; 1])

Sinh([Id; 1])

Cosh([Id; 1])

Tanh([Id; 1])

Re([Id; 1])

Im([Id; 1])

Conj([Id; 1])

Commutator([Id; 2])

Anticommutator([Id; 2])

TensorProduct([Id; 2])

Trace([Id; 1])

Dagger([Id; 1])

Determinant([Id; 1])

Transpose([Id; 1])

Trait Implementations

impl Clone for ExprLang

fn clone(&self) -> ExprLang

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ExprLang

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

Formats the value using the given formatter.

impl Display for ExprLang

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

Formats the value using the given formatter.

impl FromOp for ExprLang

type Error = FromOpError

The error type returned by from_op if its arguments do not represent a valid e-node.

fn from_op(op: &str, children: Vec<Id>) -> Result<Self, Self::Error>

Parse an e-node with operator op and children children.

impl Hash for ExprLang

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 Language for ExprLang

type Discriminant = Discriminant<ExprLang>

Type representing the cases of this language.

fn discriminant(&self) -> Self::Discriminant

Return the Discriminant of this node.

fn matches(&self, other: &Self) -> bool

Returns true if this enode matches another enode. This should only consider the operator and the arity, not the children Ids.

fn children(&self) -> &[Id]

Returns the children of this e-node.

fn children_mut(&mut self) -> &mut [Id]

Returns a mutable slice of the children of this e-node.

fn for_each<F>(&self, f: F)

where F: FnMut(Id),

Runs a given function on each child Id.

fn for_each_mut<F>(&mut self, f: F)

where F: FnMut(&mut Id),

Runs a given function on each child Id, allowing mutation of that Id.

fn try_for_each<E, F>(&self, f: F) -> Result<(), E>

where F: FnMut(Id) -> Result<(), E>,

Runs a falliable function on each child, stopping if the function returns an error.

fn len(&self) -> usize

Returns the number of the children this enode has.

fn is_leaf(&self) -> bool

Returns true if this enode has no children.

fn update_children<F>(&mut self, f: F)

where F: FnMut(Id) -> Id,

Runs a given function to replace the children.

fn map_children<F>(self, f: F) -> Self

where F: FnMut(Id) -> Id,

Creates a new enode with children determined by the given function.

fn fold<F, T>(&self, init: T, f: F) -> T

where F: FnMut(T, Id) -> T,

Folds over the children, given an initial accumulator.

fn all<F>(&self, f: F) -> bool

where F: FnMut(Id) -> bool,

Returns true if the predicate is true on all children. Does not short circuit.

fn any<F>(&self, f: F) -> bool

where F: FnMut(Id) -> bool,

Returns true if the predicate is true on any children. Does not short circuit.

fn join_recexprs<F, Expr>(&self, child_recexpr: F) -> RecExpr<Self>

where F: FnMut(Id) -> Expr, Expr: AsRef<[Self]>,

Make a RecExpr by mapping this enodes children to other RecExprs.

fn build_recexpr<F>(&self, get_node: F) -> RecExpr<Self>

where F: FnMut(Id) -> Self,

Build a RecExpr from an e-node.

fn try_build_recexpr<F, Err>(&self, get_node: F) -> Result<RecExpr<Self>, Err>

where F: FnMut(Id) -> Result<Self, Err>,

Same as Language::build_recexpr, but fallible.

impl Ord for ExprLang

fn cmp(&self, other: &ExprLang) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for ExprLang

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

fn partial_cmp(&self, other: &ExprLang) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for ExprLang

impl StructuralPartialEq for ExprLang