fn recurse<'a, T, F>(
v: &'a mut [T],
is_less: &mut F,
pred: Option<&'a T>,
limit: u32
)where
F: FnMut(&T, &T) -> bool,
🔬This is a nightly-only experimental API. (
slice_internals
)Expand description
Sorts v
recursively.
If the slice had a predecessor in the original array, it is specified as pred
.
limit
is the number of allowed imbalanced partitions before switching to heapsort
. If zero,
this function will immediately switch to heapsort.