Enum Strategy 

#[non_exhaustive]
pub enum Strategy {
    Legacy,
    Gated,
    Vector,
}

How the scanner walks a line. Strategies produce identical matches; they exist so that alternatives can be measured against each other in the same process (see the scanner bench).

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Legacy

Byte-by-byte dispatch on the current byte only, dispatch and trigger finders in separate passes. The original implementation.

Gated

Single pass with context gates: a finder is only invoked when the previous and next bytes allow a match to start.

Vector

Context gates evaluated sixteen bytes at a time with SIMD (or with memchr when the finders start at three bytes or fewer), then the exact gates on the surviving positions (default).

Implementations

impl Strategy

pub const ALL: &[Strategy]

All strategies, in evaluation order.

pub fn name(self) -> &'static str

Short identifier, e.g. for command-line selection.

pub fn parse(name: &str) -> Option<Strategy>

Parses name.

Trait Implementations

impl Clone for Strategy

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Strategy

impl Debug for Strategy

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

Formats the value using the given formatter.

impl Eq for Strategy

impl PartialEq for Strategy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Strategy