Struct egg::EGraph

pub struct EGraph<L, M> { /* fields omitted */ }

Data structure to keep track of equalities between expressions.

An egraph (EGraph) is a data structure to maintain equivalence classes of expressions. An egraph conceptually is a set of eclasses (EClass) each of which contains equivalent enodes (ENode).

An enode is conceptually and operator with children, but instead of children being other operators or values, the children are eclasses.

Methods

impl<L, M> EGraph<L, M>

pub fn classes(&self) -> impl Iterator<Item = &EClass<L, M>>

pub fn classes_mut(&mut self) -> impl Iterator<Item = &mut EClass<L, M>>

pub fn is_empty(&self) -> bool

pub fn total_size(&self) -> usize

Returns the number of nodes in the EGraph.

Actually returns the size of the hash cons index.

let mut egraph = EGraph::<&str, ()>::default();
let x = egraph.add(enode!("x"));
let y = egraph.add(enode!("y"));
// only one eclass
egraph.union(x, y);

assert_eq!(egraph.total_size(), 2);

pub fn number_of_classes(&self) -> usize

pub fn find(&self, id: Id) -> Id

pub fn dot(&self) -> Dot<L, M>

impl<L: Language, M: Metadata<L>> EGraph<L, M>

pub fn from_expr(expr: &RecExpr<L>) -> (Self, Id)

pub fn add_expr(&mut self, expr: &RecExpr<L>) -> Id

pub fn add(&mut self, enode: ENode<L>) -> Id

pub fn equivs(&self, expr1: &RecExpr<L>, expr2: &RecExpr<L>) -> Vec<Id>

pub fn rebuild(&mut self)

pub fn union(&mut self, id1: Id, id2: Id) -> Id

pub fn union_if_different(&mut self, id1: Id, id2: Id) -> Option<Id>

pub fn dump<'a>(&'a self) -> impl Debug + 'a

Trait Implementations

impl<L: Clone, M: Clone> Clone for EGraph<L, M>

fn clone(&self) -> EGraph<L, M>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<L: Language, M: Debug> Debug for EGraph<L, M>

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

Formats the value using the given formatter.

impl<L, M> Default for EGraph<L, M>

fn default() -> EGraph<L, M>

Returns the "default value" for a type.

impl<L: Language, M> Index<u32> for EGraph<L, M>

type Output = EClass<L, M>

The returned type after indexing.

fn index(&self, id: Id) -> &Self::Output

Performs the indexing (container[index]) operation.