pub fn remove<Q: ?Sized>(&mut self, key: &Q) -> Option<V>
    where
        Q: Ord,
        K: Borrow<Q>,
    {
        self.remove_entry(key).map(|(_, val)| val)
    }
/// Removes the key-value pair from the map according to the given key. Only the value is
/// returned.
///
/// 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 mut map = BpTreeMap::from([(1, "One"), (2, "Two")]);
/// assert_eq!(map.remove(&2), Some("Two"));
/// assert_eq!(map.remove(&2), None);
/// assert_eq!(map.len(), 1);
/// ```
Removes the key-value pair from the map according to the given key. Only the value is
returned.

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.
Removes the key - value pair from the map according to the given key . Only the value is returned . 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 remove<Q: ?Sized>(&mut self, key: &Q) -> Option<V>
    where
        Q: Ord,
        K: Borrow<Q>,
    {
        self.remove_entry(key).map(|(_, val)| val)
    }
pub fn remove < Q : ? Sized > ( & mut self , key : & Q ) -> Option < V > where Q : Ord , K : Borrow < Q > , { self . remove_entry ( key ) . map ( | ( _ , val ) | val ) }
Removes the key-value pair from the map according to the given key.
Removes the key - value pair from the map according to the given key .
&mut self
key
&Q
&mut self
key
&Q
examples
```
use bptree::BpTreeMap.


` ` ` use bptree :: BpTreeMap .