Enum OptWork 

pub enum OptWork {
    Same,
    Less,
}

What an optimization does to the WORK a program performs, as opposed to how fast it performs it.

Benchmarks compare languages running the same algorithm. An optimization that replaces the algorithm makes the comparison a different one — a fair demonstration of the compiler, and one a reader must be told about: every benchmark a OptWork::Less optimization fires on carries a note saying what the compiler did (benchmarks/lib/benchmarks.tsv, locked by benchmark_collapse_lock), and is left out of the same-algorithm geometric mean. Every registry row must say which it is, so a new pass cannot change a result unannounced.

Variants

Same

The same algorithm in cheaper machine code: the program’s loops, recursion and data structures all still run.

Less

A different, cheaper algorithm when it fires: memoized recursion, a loop or recursion replaced by its closed form, a symmetric search cut in half, a map replaced by an array its keys index, a loop replaced by one instruction, work moved to compile time.

Trait Implementations

impl Clone for OptWork

fn clone(&self) -> OptWork

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OptWork

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

Formats the value using the given formatter.

impl PartialEq for OptWork

fn eq(&self, other: &OptWork) -> 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 Copy for OptWork

impl Eq for OptWork

impl StructuralPartialEq for OptWork