Enum gf::support::bitpat::BitPatTableStrategy

pub enum BitPatTableStrategy {
    Greedy,
    GreedySparse,
    Linear,
}

Strategy used to build a bit pattern table.

Variants

Greedy

The greedy strategy.

GreedySparse

The greedy strategy, followed by a BitPatTableNode::into_sparse transformation.

Linear

The linear strategy.

Implementations

impl BitPatTableStrategy

pub fn build_table<T>(self, patterns: Vec<(BitPat, T)>) -> BitPatTable<T>

Build a bit pattern table from a number of patterns.

Trait Implementations

impl Clone for BitPatTableStrategy

fn clone(&self) -> BitPatTableStrategy

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Copy for BitPatTableStrategy

impl Debug for BitPatTableStrategy

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

Formats the value using the given formatter.

impl Default for BitPatTableStrategy

fn default() -> Self

Returns the "default value" for a type.

impl Eq for BitPatTableStrategy

impl Hash for BitPatTableStrategy

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl Ord for BitPatTableStrategy

fn cmp(&self, other: &BitPatTableStrategy) -> Ordering

This method returns an Ordering between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl PartialEq<BitPatTableStrategy> for BitPatTableStrategy

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

This method tests for self and other values to be equal, and is used by ==.

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl PartialOrd<BitPatTableStrategy> for BitPatTableStrategy

fn partial_cmp(&self, other: &BitPatTableStrategy) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

#[must_use]fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

#[must_use]fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

#[must_use]fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralEq for BitPatTableStrategy

impl StructuralPartialEq for BitPatTableStrategy