Function bisection::bisect_right

pub fn bisect_right<T>(a: &[T], x: &T) -> usize where
    T: Ord, 

Return the index where x should be inserted in a, 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 after the rightmost occurence of x.