pub fn remove_entry(self) -> Option<(K, V)> {
        match self.vacant_key {
            Some(_) => None,
            None => node::remove_with_root(self.inner, self.self_ptr),
        }
    }
/// Removes the entry from the map if present, returning the key-value pair.
///
/// # Examples
///
/// ```
/// use bptree::BpTreeMap;
///
/// let mut map = BpTreeMap::from([(1, "One"), (2, "Two")]);
/// assert_eq!(map.entry(2).remove_entry(), Some((2, "Two")));
/// assert_eq!(map.entry(2).remove_entry(), None);
/// assert_eq!(map.len(), 1);
/// ```
Removes the entry from the map if present, returning the key-value pair.
Removes the entry from the map if present returning the key - value pair .
pub fn remove_entry(self) -> Option<(K, V)> {
        match self.vacant_key {
            Some(_) => None,
            None => node::remove_with_root(self.inner, self.self_ptr),
        }
    }
pub fn remove_entry ( self ) -> Option < ( K , V ) > { match self . vacant_key { Some ( _ ) => None , None => node :: remove_with_root ( self . inner , self . self_ptr ) , } }
Removes the entry from the map if present, returning the key-value pair.
Removes the entry from the map if present returning the key - value pair .
self
self
examples
```
use bptree::BpTreeMap.


` ` ` use bptree :: BpTreeMap .