Function btree_slab::utils::binary_search_min

pub fn binary_search_min<T: Keyed, Q>(
    sorted_slice: &[T],
    key: &Q
) -> Option<usize>where
    T::Key: Borrow<Q>,
    Q: Ord + ?Sized,

Search in sorted_slice for the item with the nearest key smaller or equal to the given one.

sorted_slice is assumed to be sorted.