turbosort 0.1.1

SIMD-accelerated radix sort for primitive types
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13

//! Quicksort for medium arrays (17 ≤ n ≤ 512).
//!
//! Dispatches to SIMD-accelerated partition when available (Phase 4),
//! falls back to scalar Hoare partition.

use crate::key::SortableKey;

/// Sort a slice of 17..=512 elements.
#[inline]
pub fn sort<T: SortableKey>(slice: &mut [T]) {
    debug_assert!((17..=512).contains(&slice.len()));
    crate::arch::sort_small(slice);
}