pub fn reify(egraph: &mut EGraph, term: &Term) -> Option<usize>Expand description
Reify a Syntax term into an E-graph node.
Converts the deep embedding (Syntax) into E-graph nodes, returning the ID of the root node. Subterms are recursively reified and hash-consed (duplicate structures share the same ID).
ยงReturns
Some(id) on successful reification, None if the term cannot be reified.