Enum Expr

pub enum Expr<K = usize, V = AnyBox> {
    Binary(ExprBinary<K, V>),
    Nary(ExprNary<K, V>),
    Ternary(ExprTernary<K, V>),
    Unary(ExprUnary<K, V>),
    Constant(V),
    Variable {
        id: IndexId<K>,
        value: V,
    },
}

Variants

Binary(ExprBinary<K, V>)

Nary(ExprNary<K, V>)

Ternary(ExprTernary<K, V>)

Unary(ExprUnary<K, V>)

Constant(V)

Variable

Fields

id: IndexId<K>

value: V

Implementations

impl<K, V> Expr<K, V>

pub const fn is_binary(&self) -> bool

Returns true if the enum is Expr::Binary otherwise false

pub const fn is_nary(&self) -> bool

Returns true if the enum is Expr::Nary otherwise false

pub const fn is_ternary(&self) -> bool

Returns true if the enum is Expr::Ternary otherwise false

pub const fn is_unary(&self) -> bool

Returns true if the enum is Expr::Unary otherwise false

pub const fn is_constant(&self) -> bool

Returns true if the enum is Expr::Constant otherwise false

pub const fn is_variable(&self) -> bool

Returns true if the enum is Expr::Variable otherwise false

impl<K, V> Expr<K, V>

pub fn binary(lhs: Expr<K, V>, rhs: Expr<K, V>, op: BinaryOp) -> Self

pub fn constant(value: V) -> Self

pub fn nary(args: impl IntoIterator<Item = Expr<K, V>>, op: NaryOp) -> Self

pub fn ternary( x: Expr<K, V>, y: Expr<K, V>, z: Expr<K, V>, op: TernaryOp, ) -> Self

pub fn unary(recv: Expr<K, V>, op: UnaryOp) -> Self

pub fn variable(idx: K, value: V) -> Self

pub fn boxed(self) -> Box<Expr<K, V>>

Trait Implementations

impl<K: Clone, V: Clone> Clone for Expr<K, V>

fn clone(&self) -> Expr<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for Expr<K, V>

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

Formats the value using the given formatter.

impl<K: Hash, V: Hash> Hash for Expr<K, V>

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<K: Ord, V: Ord> Ord for Expr<K, V>

fn cmp(&self, other: &Expr<K, V>) -> 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<K: PartialEq, V: PartialEq> PartialEq for Expr<K, V>

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

fn partial_cmp(&self, other: &Expr<K, V>) -> 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<K: Eq, V: Eq> Eq for Expr<K, V>

impl<K, V> StructuralPartialEq for Expr<K, V>