Enum RewriteStrategy 

pub enum RewriteStrategy {
    Innermost,
    Outermost,
    LeftmostInnermost,
    LeftmostOutermost,
    Parallel,
}

The strategy used when applying rewrite rules.

Variants

Innermost

Reduce innermost redexes first (call-by-value).

Outermost

Reduce outermost redexes first (call-by-name / lazy).

LeftmostInnermost

Leftmost-innermost: standard reduction order for functional languages.

LeftmostOutermost

Leftmost-outermost: used in lambda calculus normal order.

Parallel

Reduce all redexes simultaneously.

Trait Implementations

impl Clone for RewriteStrategy

fn clone(&self) -> RewriteStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RewriteStrategy

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

Formats the value using the given formatter.

impl PartialEq for RewriteStrategy

fn eq(&self, other: &RewriteStrategy) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for RewriteStrategy

impl StructuralPartialEq for RewriteStrategy