Enum ApproximationStrategy 

pub enum ApproximationStrategy {
    Nearest,
    First,
    Balanced,
}

Approximation search ordering.

Variants

Nearest

Return candidates ordered by absolute cents error.

First

Return the first admissible candidates in ascending denominator/numerator order.

Balanced

Balance low error with smaller numerator/denominator complexity.

Trait Implementations

impl Clone for ApproximationStrategy

fn clone(&self) -> ApproximationStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ApproximationStrategy

impl Debug for ApproximationStrategy

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

Formats the value using the given formatter.

impl Eq for ApproximationStrategy

impl Hash for ApproximationStrategy

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

where __H: Hasher,

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for ApproximationStrategy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ApproximationStrategy