Function core::slice::sort::insertion_sort_shift_right
source · fn insertion_sort_shift_right<T, F>(v: &mut [T], offset: usize, is_less: &mut F)where
F: FnMut(&T, &T) -> bool,
🔬This is a nightly-only experimental API. (
slice_internals
)Expand description
Sort v
assuming v[offset..]
is already sorted.
Never inline this function to avoid code bloat. It still optimizes nicely and has practically no performance impact. Even improving performance in some cases.