binary_search_slice in rustc_data_structures::binary_search_util - Rust
Description: Uses a sorted slice `data: &[E]` as a kind of “multi-map”. The `key_fn` extracts a key of type `K` from the data, and this function finds the range of elements that match the key. `data` must have been sorted as if by a call to `sort_by_key` for this to work.

Skip to main content

## binary_search_slice

# Function binary_search_slice

Source

    pub fn binary_search_slice<'d, E, K>(
        data: &'d [E],
        key_fn: impl Fn(&E) -> K,
        key: &K,
    ) -> &'d [E]where
        K: Ord,

Expand description

Uses a sorted slice `data: &[E]` as a kind of “multi-map”. The `key_fn` extracts a key of type `K` from the data, and this function finds the range of elements that match the key. `data` must have been sorted as if by a call to `sort_by_key` for this to work.