Enum Strategy 

#[repr(u8)]
pub enum Strategy {
    Fast = 1,
    DFast = 2,
    Greedy = 3,
    Lazy = 4,
    Lazy2 = 5,
    BtLazy2 = 6,
    BtOpt = 7,
    BtUltra = 8,
    BtUltra2 = 9,
}

Match finder (libzstd ZSTD_strategy, values 1..=9).

Variants

Fast = 1

Hash table + skip (ZSTD_fast).

DFast = 2

Double hash (ZSTD_dfast).

Greedy = 3

Hash chain, greedy (ZSTD_greedy).

Lazy = 4

Hash chain, lazy.

Lazy2 = 5

Hash chain, lazy2.

BtLazy2 = 6

Binary tree, lazy2.

BtOpt = 7

Binary tree, optimal parse.

BtUltra = 8

Binary tree, stronger optimal.

BtUltra2 = 9

Binary tree, ultra optimal (levels 20-22).

Implementations

impl Strategy

pub fn from_id(id: i32) -> Option<Self>

Parse libzstd strategy id 1..=9.

pub fn id(self) -> u8

libzstd numeric id.

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

ASCII name (fast .. btultra2).

Trait Implementations

impl Clone for Strategy

fn clone(&self) -> Strategy

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: &Strategy) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Strategy