Method binary_search_values_by_key

cranelift/entity/src/primary.rs:215–224

Performs a binary search on the values with a key extraction function. Assumes that the values are sorted by the key extracted by the function. If the value is found then `Ok(K)` is returned, containing the entity key of the matching value. If there are multiple matches, then any one of the matches could be returned. If the value is not found then Err(K) is returned, containing the entity key

(&'a self, b: &B, f: F)

    /// If the value is not found then Err(K) is returned, containing the entity key
    /// where a matching element could be inserted while maintaining sorted order.
    pub fn binary_search_values_by_key<'a, B, F>(&'a self, b: &B, f: F) -> Result<K, K>
    where
        F: FnMut(&'a V) -> B,
        B: Ord,
    {
        self.elems
            .binary_search_by_key(b, f)
            .map(|i| K::new(i))
            .map_err(|i| K::new(i))
    }

    /// Analog of `get_raw` except that a raw pointer is returned rather than a
    /// mutable reference.