Enum Algorithm

pub enum Algorithm {
    Naive,
    DatafrogOpt,
    LocationInsensitive,
    Compare,
    Hybrid,
}

Variants

Naive

Simple rules, but slower to execute

DatafrogOpt

Optimized variant of the rules

LocationInsensitive

Fast to compute, but imprecise: there can be false-positives but no false-negatives. Tailored for quick “early return” situations.

Compare

Compares the Naive and DatafrogOpt variants to ensure they indeed compute the same errors.

Hybrid

Combination of the fast LocationInsensitive pre-pass, followed by the more expensive DatafrogOpt variant.

Implementations

impl Algorithm

pub const OPTIMIZED: &'static [Algorithm]

Optimized variants that ought to be equivalent to “naive”

pub fn variants() -> [&'static str; 5]

Trait Implementations

impl Clone for Algorithm

fn clone(&self) -> Algorithm

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Algorithm

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

Formats the value using the given formatter.

impl FromStr for Algorithm

type Err = String

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl Copy for Algorithm