pub fn entry(&mut self, key: K) -> Entry<'_, K, V>
    where
        K: Ord,
    {
        let self_ptr: *mut _ = self;
        let root_node = Self::owned_root(&mut self.root).borrow_mut();
        match root_node.search_tree(&key) {
            search::SearchResult::Occupied(inner) => Entry {
                vacant_key: None,
                inner,
                self_ptr,
            },
            search::SearchResult::Vacant(inner) => Entry {
                vacant_key: Some(key),
                inner,
                self_ptr,
            },
        }
    }
/// Returns the entry of the map at the given key for in-place manipulation.
///
/// # Examples
///
/// ```
/// use bptree::BpTreeMap;
///
/// let mut count = BpTreeMap::new();
/// let sample = "Hello world!";
/// for c in sample.bytes() {
///     *count.entry(c).or_insert(0) += 1;
/// }
/// assert_eq!(count[&b'l'], 3);
/// ```
Returns the entry of the map at the given key for in-place manipulation.
Returns the entry of the map at the given key for in - place manipulation .
pub fn entry(&mut self, key: K) -> Entry<'_, K, V>
    where
        K: Ord,
    {
        let self_ptr: *mut _ = self;
        let root_node = Self::owned_root(&mut self.root).borrow_mut();
        match root_node.search_tree(&key) {
            search::SearchResult::Occupied(inner) => Entry {
                vacant_key: None,
                inner,
                self_ptr,
            },
            search::SearchResult::Vacant(inner) => Entry {
                vacant_key: Some(key),
                inner,
                self_ptr,
            },
        }
    }
pub fn entry ( & mut self , key : K ) -> Entry < ' _ , K , V > where K : Ord , { let self_ptr : * mut _ = self ; let root_node = Self :: owned_root ( & mut self . root ) . borrow_mut ( ) ; match root_node . search_tree ( & key ) { search :: SearchResult :: Occupied ( inner ) => Entry { vacant_key : None , inner , self_ptr , } , search :: SearchResult :: Vacant ( inner ) => Entry { vacant_key : Some ( key ) , inner , self_ptr , } , } }
Returns the entry of the map at the given key for in-place manipulation.
Returns the entry of the map at the given key for in - place manipulation .
&mut self
key
K
&mut self
key
K
examples
```
use bptree::BpTreeMap.

let mut count = BpTreeMap::new();
let sample = "Hello world!";
for c in sample.bytes() {
count.entry(c).or_insert(0) += 1;
}
assert_eq!(count[&b'l'], 3);
```
` ` ` use bptree :: BpTreeMap . let mut count = BpTreeMap :: new () ; let sample = " Hello world! " ; for c in sample . bytes () { count . entry ( c ) . or_insert ( 0 ) + = 1 ; } assert_eq! ( count [ &b ' l ' ] 3 ) ; ` ` `