Function bisection::insort_left_slice

pub fn insort_left_slice<T, I>(a: &mut Vec<T>, x: T, within: I) where
    I: RangeBounds<usize>,
    T: Ord, 

Insert x in a[within], keeping it sorted assuming a is sorted.

If a contains x, insert it just before the leftmost occurence of x.

Panics

Panics if within is out of bounds of a.