/// Merge implementation used when the first run is larger than the second.
Merge implementation used when the first run is larger than the second.
Merge implementation used when the first run is larger than the second .
pub fn merge_hi<T, E, C: Fn(&T, &T) -> Result<bool, E>>(
    list: &mut [T],
    first_len: usize,
    second_len: usize,
    is_greater: C,
) -> Result<(), E> {
    MergeHi::new(list, first_len, second_len, is_greater).merge()
}
pub fn merge_hi < T , E , C : Fn ( & T , & T ) -> Result < bool , E > > ( list : & mut [ T ] , first_len : usize , second_len : usize , is_greater : C , ) -> Result < ( ) , E > { MergeHi :: new ( list , first_len , second_len , is_greater ) . merge ( ) }
Merge implementation used when the first run is larger than the second.
Merge implementation used when the first run is larger than the second .
list
&mut [T]
first_len
usize
second_len
usize
is_greater
C