Enum grenad::SortAlgorithm

pub enum SortAlgorithm {
    Stable,
    Unstable,
}

The kind of sort algorithm used by the sorter to sort its internal vector.

Variants

Stable

The stable sort algorithm maintains the relative order of values with equal keys, but it is slower than the unstable algorithm.

Unstable

The unstable sort algorithm is faster than the unstable algorithm, but it does not keep the relative order of values with equal keys.

Trait Implementations

impl Clone for SortAlgorithm

fn clone(&self) -> SortAlgorithm

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SortAlgorithm

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

Formats the value using the given formatter.

impl Copy for SortAlgorithm