Function driftsort_main
pub(in ::slice::sort::stable) fn driftsort_main<T, F: FnMut(&T, &T) -> bool, BufT: BufGuard<T>>(v: &mut [T], is_less: &mut F)See sort
Deliberately don't inline the main sorting routine entrypoint to ensure the inlined insertion sort i-cache footprint remains minimal.