Function rayon::slice::quicksort::recurse

fn recurse<'a, T, F>(
    v: &'a mut [T],
    is_less: &F,
    pred: Option<&'a mut T>,
    limit: u32
)where
    T: Send,
    F: Fn(&T, &T) -> bool + Sync,

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.