Enum ExprKey 

pub enum ExprKey {
    Lit(LcnfLit),
    Var(LcnfVarId),
    Ctor(String, u32, Vec<LcnfArg>),
    Proj(String, u32, LcnfVarId),
    App(LcnfArg, Vec<LcnfArg>),
    CommApp(String, Vec<LcnfArg>),
}

A canonical, hashable key derived from an LCNF let-bound value.

ExprKey normalizes commutative operations so that Add(a,b) and Add(b,a) map to the same key, enabling CSE across re-ordered argument lists.

Variants

Lit(LcnfLit)

Literal value.

Var(LcnfVarId)

Copy / identity: let x = y.

Ctor(String, u32, Vec<LcnfArg>)

Constructor: Ctor(name, tag, args).

Proj(String, u32, LcnfVarId)

Projection: proj_name.idx(var).

App(LcnfArg, Vec<LcnfArg>)

Function application: f(args) — only for pure calls.

CommApp(String, Vec<LcnfArg>)

Normalized commutative application (sorted args).

Trait Implementations

impl Clone for ExprKey

fn clone(&self) -> ExprKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ExprKey

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

Formats the value using the given formatter.

impl Hash for ExprKey

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 PartialEq for ExprKey

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

impl StructuralPartialEq for ExprKey