pub fn key(&self) -> &K {
        match &self.vacant_key {
            None => self.inner.reborrow().into_kv().0,
            Some(key) => key,
        }
    }
/// Returns the key of the entry.
///
/// # Examples
///
/// ```
/// use bptree::BpTreeMap;
///
/// let mut map = BpTreeMap::<&str, ()>::new();
/// let entry = map.entry("Hello");
/// assert_eq!(entry.key(), &"Hello");
/// ```
Returns the key of the entry.
Returns the key of the entry .
pub fn key(&self) -> &K {
        match &self.vacant_key {
            None => self.inner.reborrow().into_kv().0,
            Some(key) => key,
        }
    }
pub fn key ( & self ) -> & K { match & self . vacant_key { None => self . inner . reborrow ( ) . into_kv ( ) . 0 , Some ( key ) => key , } }
Returns the key of the entry.
Returns the key of the entry .
&self
&self
examples
```
use bptree::BpTreeMap.


` ` ` use bptree :: BpTreeMap .