Struct AdaptiveSort 

pub struct AdaptiveSort { /* private fields */ }

Adaptive sorting algorithm that selects optimal strategy based on data patterns

Implementations

impl AdaptiveSort

pub fn new() -> Self

pub fn detect_patterns<T: Ord>(data: &[T]) -> DataPattern

Pattern detection finds pre-sorted regions (skip unnecessary work)

pub fn select_optimal_algorithm<T>( data_len: usize, pattern: DataPattern, data_type: DataType, ) -> SortAlgorithm

Adaptive algorithm selection based on data characteristics

pub fn counting_sort(data: &mut [i32], min: i32, max: i32)

Counting sort for small integer ranges (O(n+k) complexity)

pub fn intern_strings(strings: Vec<String>) -> (Vec<usize>, Vec<Arc<String>>)

String interning for repeated values (reduce memory and comparisons)

pub fn cache_optimized_merge<T: Ord + Copy>( left: &[T], right: &[T], output: &mut [T], )

Cache-optimized merge with prefetching

pub fn parallel_read_file( path: &Path, num_threads: usize, ) -> Result<Vec<Vec<u8>>>

Parallel I/O reading with multiple threads

pub fn three_way_partition<T: Ord + Clone>( data: &mut [T], pivot_idx: usize, ) -> (usize, usize)

Three-way partitioning for datasets with many duplicates

Trait Implementations

impl Default for AdaptiveSort

fn default() -> Self

Returns the “default value” for a type.