Struct egg::BackoffScheduler

pub struct BackoffScheduler { /* fields omitted */ }

A RewriteScheduler that implements exponentional 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.

BackoffScheduler is configurable in the builder-pattern style.

Implementations

impl BackoffScheduler

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

Set the initial match limit after which a rule will be banned. Default: 1,000

pub fn with_ban_length(self, ban_length: usize) -> Self

Set the initial ban length. Default: 5 iterations

pub fn do_not_ban(self, name: impl Into<String>) -> Self

Never ban a particular rule.

Trait Implementations

impl Default for BackoffScheduler

fn default() -> Self

Returns the "default value" for a type.

impl<L, N> RewriteScheduler<L, N> for BackoffScheduler where
    L: Language,
    N: Analysis<L>, 

fn can_stop(&mut self, iteration: usize) -> bool

Whether or not the Runner is allowed to say it has saturated.

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

A hook allowing you to customize rewrite searching behavior. Useful to implement rule management.

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

A hook allowing you to customize rewrite application behavior. Useful to implement rule management.