Assuming slice is sorted and totally ordered, returns the minimum i for which slice[i] > key, or slice.len() if no such i exists
(slice: &[T], key: &T)
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected