Function bisection::bisect_left_slice

pub fn bisect_left_slice<T, I>(a: &[T], x: &T, within: I) -> usize where
    I: RangeBounds<usize>,
    T: Ord, 

Return the index where x should be inserted in a[within], assuming a is sorted.

The return value i is such that all e in a[..i] have e < x, and all e in a[i..] have e >= x.

• If a contains x, a.insert(i, x) will insert just before the leftmost x.

Panics

Panics if within is out of bounds of a.