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