pub fn merge_sort_slices<'a, L: Iterator<Item = &'a MergeSlice>, R: Iterator<Item = &'a MergeSlice>>(
    lhs: L,
    rhs: R,
    comparator: &'a Box<dyn Fn(usize, usize, usize, usize) -> Ordering + '_>
) -> MergeSortSlices<'a, L, R>Notable traits for MergeSortSlices<'a, L, R>impl<'a, L, R> Iterator for MergeSortSlices<'a, L, R> where
    L: Iterator<Item = &'a MergeSlice>,
    R: Iterator<Item = &'a MergeSlice>, 
type Item = MergeSlice;
Available on crate feature compute_merge_sort only.
Expand description

Given two iterators of slices representing two sets of sorted Arrays, and a comparator bound to those Arrays, returns a new iterator of slices denoting how to take slices from each of the arrays such that the resulting array is sorted according to comparator