API Documentation

Structure representing rewrite rules.

Compile a theory to a closure that does the pattern matching job Returns a RuntimeGeneratedFunction, which does not use eval and is as fast as a regular Julia anonymous function 🔥

Compile a theory at runtime to a closure that does the pattern matching job

Type representing a cache of RuntimeGeneratedFunctions corresponding to right hand sides of dynamic rules

When creating a theory, type assertions in the left hand contain symbols. We want to replace the type symbols with the real type values, to fully support the subtyping mechanism during pattern matching.

Generates a tuple containing the list of formal parameters (Symbols) and the RuntimeGeneratedFunction corresponding to the right hand side of a :dynamicRule.

Represents a rule scheduler for the equality saturation process

A Rewrite Scheduler that implements exponential rule backoff. For each rewrite, there exists a configurable initial match limit. If a rewrite search yield more than this limit, then we ban this rule for number of iterations, double its limit, and double the time it will be banned next time.

This seems effective at preventing explosive rules like associativity from taking an unfair amount of resources.

A simple Rewrite Scheduler that applies every rule every time

Should return true if the e-graph can be said to be saturated

This function is called before pattern matching on the e-graph

Should return true if the rule r should be skipped

This function is called after pattern matching on the e-graph

Definitions of various utility functions for metaprogramming

Add a & expression

Breadth First Walk (Tree Prewalk) on expressions mutates expression in-place.

Breadth First Walk (Tree Prewalk) on expressions. Does not mutate expressions.

HARD FIX of n-arity of operators in Expr trees

Make a block expression from an array of exprs

Binarize n-ary operators (+ and *) and call rmlines

Depth First Walk (Tree Postwalk) on expressions, mutates expression in-place.

Depth First Walk (Tree Postwalk) on expressions. Does not mutate expressions.

Add a dollar expression

Iterates a function f on datum until a fixed point is reached where f(x) == x

Like normalize but keeps a vector of hashes to detect cycles, returns the current datum when a cycle is detected

Remove LineNumberNode from quoted blocks of code