Enum SortAlgorithm 

pub enum SortAlgorithm {
    Auto,
    Comparison,
    Radix,
}

Sort algorithm selection for argsort operations

Variants

Auto

Automatically select the best algorithm for the data type.

When config.stable = true, this falls back to comparison sort which preserves relative order of equal elements. When stable = false, radix sort may be selected for eligible types.

Comparison

Standard comparison sort, O(n log n).

Respects config.stable: when true, uses a stable sort that preserves relative order of equal elements; when false, uses an unstable sort.

Radix

LSD radix sort for integers, O(n*k).

Always unstable — the config.stable flag is ignored when this algorithm is explicitly selected.

Trait Implementations

impl Clone for SortAlgorithm

fn clone(&self) -> SortAlgorithm

Returns a duplicate 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 Default for SortAlgorithm

fn default() -> SortAlgorithm

Returns the “default value” for a type.

impl PartialEq for SortAlgorithm

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for SortAlgorithm

impl Eq for SortAlgorithm

impl StructuralPartialEq for SortAlgorithm