Enum SortBackend 

#[non_exhaustive]
pub enum SortBackend {
    InsertionSort,
    RadixSort,
    BitonicSort,
}

Sort algorithm variants with identical output contracts.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

InsertionSort

Insertion sort: minimal fixed overhead for small inputs.

RadixSort

Radix sort: stable throughput for skewed integer distributions.

BitonicSort

Bitonic sort: GPU-friendly general-purpose fallback.

Trait Implementations

impl Clone for SortBackend

fn clone(&self) -> SortBackend

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for SortBackend

impl Debug for SortBackend

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

Formats the value using the given formatter.

impl Eq for SortBackend

impl PartialEq for SortBackend

fn eq(&self, other: &SortBackend) -> 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 StructuralPartialEq for SortBackend