Struct egg::SimpleRunner

pub struct SimpleRunner { /* fields omitted */ }

Methods

impl SimpleRunner

pub fn with_iter_limit(self, iter_limit: usize) -> Self

pub fn with_node_limit(self, node_limit: usize) -> Self

pub fn with_initial_match_limit(self, initial_match_limit: usize) -> Self

Trait Implementations

impl Default for SimpleRunner

fn default() -> Self

Returns the "default value" for a type.

impl<L, M> Runner<L, M> for SimpleRunner where
    L: Language,
    M: Metadata<L>, 

type Error = SimpleRunnerError

fn pre_step(&mut self, egraph: &mut EGraph<L, M>) -> Result<(), Self::Error>

fn during_step(&mut self, egraph: &EGraph<L, M>) -> Result<(), Self::Error>

fn post_step(
    &mut self,
    iteration: &Iteration,
    _egraph: &mut EGraph<L, M>
) -> Result<(), Self::Error>

fn search_rewrite(
    &mut self,
    egraph: &mut EGraph<L, M>,
    rewrite: &Rewrite<L, M>
) -> Vec<SearchMatches>

Dictates search behavior

fn apply_rewrite(
    &mut self,
    egraph: &mut EGraph<L, M>,
    rewrite: &Rewrite<L, M>,
    matches: Vec<SearchMatches>
) -> usize

Dictates how matches will be applied.

fn step(
    &mut self,
    egraph: &mut EGraph<L, M>,
    rules: &[Rewrite<L, M>]
) -> Result<Iteration, Self::Error>

fn run(
    &mut self,
    egraph: &mut EGraph<L, M>,
    rules: &[Rewrite<L, M>]
) -> (Vec<Iteration>, Self::Error)

fn run_expr(
    &mut self,
    initial_expr: RecExpr<L>,
    rules: &[Rewrite<L, M>]
) -> (EGraph<L, M>, RunReport<L, Self::Error>)