pub enum Strategy {
Fast,
Dfast,
Greedy,
Lazy,
Lazy2,
Btlazy2,
Btopt,
Btultra,
Btultra2,
}Expand description
Match-finder strategy — the drop-in equivalent of C zstd’s
ZSTD_strategy enum (ZSTD_fast … ZSTD_btultra2). The numeric
ordinals match upstream (fast = 1 … btultra2 = 9), so
Strategy::ordinal / Strategy::from_ordinal round-trip with
the C ZSTD_c_strategy parameter value.
Variants§
Fast
ZSTD_fast (1) — single-table fast finder.
Dfast
ZSTD_dfast (2) — two parallel hash tables.
Greedy
ZSTD_greedy (3) — commit the first acceptable match, no lookahead.
Lazy
ZSTD_lazy (4) — one-position lazy lookahead.
Lazy2
ZSTD_lazy2 (5) — two-position lazy lookahead.
Btlazy2
ZSTD_btlazy2 (6) — binary-tree-assisted lazy2.
Btopt
ZSTD_btopt (7) — optimal parser, no ultra refinements.
Btultra
ZSTD_btultra (8) — optimal parser with refined price tables.
Btultra2
ZSTD_btultra2 (9) — optimal parser with two-pass dynamic stats.
Implementations§
Trait Implementations§
impl Copy for Strategy
impl Eq for Strategy
Source§impl Ord for Strategy
impl Ord for Strategy
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialOrd for Strategy
impl PartialOrd for Strategy
impl StructuralPartialEq for Strategy
Auto Trait Implementations§
impl Freeze for Strategy
impl RefUnwindSafe for Strategy
impl Send for Strategy
impl Sync for Strategy
impl Unpin for Strategy
impl UnsafeUnpin for Strategy
impl UnwindSafe for Strategy
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more