pub fn contains_key<Q: ?Sized>(&self, key: &Q) -> bool
    where
        Q: Ord,
        K: Borrow<Q>,
    {
        self.get(key).is_some()
    }
/// Returns `true` if the map contains the specified key.
///
/// The key can be any borrowing form of the map's key type, but the ordering on the borrowed
/// form *must* match the ordering on the key type.
///
/// # Examples
///
/// ```
/// use bptree::BpTreeMap;
///
/// let map = BpTreeMap::from([(1, "One"), (2, "Two")]);
/// assert_eq!(map.contains_key(&1), true);
/// assert_eq!(map.contains_key(&10), false);
/// ```
Returns `true` if the map contains the specified key.
The key can be any borrowing form of the map's key type, but the ordering on the borrowed
form *must* match the ordering on the key type.
Returns ` true ` if the map contains the specified key . The key can be any borrowing form of the map ' s key type but the ordering on the borrowed form * must * match the ordering on the key type .
pub fn contains_key<Q: ?Sized>(&self, key: &Q) -> bool
    where
        Q: Ord,
        K: Borrow<Q>,
    {
        self.get(key).is_some()
    }
pub fn contains_key < Q : ? Sized > ( & self , key : & Q ) -> bool where Q : Ord , K : Borrow < Q > , { self . get ( key ) . is_some ( ) }
Returns `true` if the map contains the specified key.
Returns ` true ` if the map contains the specified key .
&self
key
&Q
&self
key
&Q
examples
```
use bptree::BpTreeMap.


` ` ` use bptree :: BpTreeMap .