Struct EGraph 

pub struct EGraph {
    pub classes: Vec<EClass>,
    pub parent: Vec<usize>,
    pub total_nodes: usize,
}

An E-graph for equality saturation.

Fields

classes: Vec<EClass>

E-classes by ID.

parent: Vec<usize>

Union-find parent array.

total_nodes: usize

Number of e-nodes total.

Implementations

impl EGraph

pub fn new() -> Self

Creates an empty E-graph.

pub fn add_node(&mut self, node: &str) -> usize

Adds a new e-class with a single node.

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

Finds the canonical class ID (path-compressed union-find).

pub fn union(&mut self, id1: usize, id2: usize)

Merges two e-classes.

pub fn are_equal(&mut self, id1: usize, id2: usize) -> bool

Checks if two nodes are in the same e-class.

pub fn num_classes(&self) -> usize

Returns the number of e-classes.

Trait Implementations

impl Clone for EGraph

fn clone(&self) -> EGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EGraph

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

Formats the value using the given formatter.

impl Default for EGraph

fn default() -> Self

Returns the “default value” for a type.