pub fn entry(&mut self, mut key: K) -> Entry<K, V, S> {
        let hash_val = self.make_hash(&key);
        let link = self.hash_table.get_hash_index(hash_val).avl_root_node_ptr();
        let (duplicate, parent, link) =
            unsafe { hash_table::find_duplicate_hash_node(link, &mut key as *mut K, hash_val) };
        if duplicate.is_null() {
            return Entry::Vacant(VacantEntry {
                hash_value: hash_val,
                key,
                parent,
                link,
                hash_map_mut: self,
            });
        } else {
            return Entry::Occupied(OccupiedEntry {
                key: Some(key),
                hash_entry: duplicate.deref_to_hash_entry(),
                hash_map_mut: self,
            });
        };
    }
/// Gets the given key's corresponding entry in the map for in-place manipulation.
///
/// # Examples
///
/// ```
/// use hash_ord::hash_map::HashMap;
///
/// let mut letters = HashMap::new();
///
/// for ch in "a short treatise on fungi".chars() {
///     let counter = letters.entry(ch).or_insert(0);
///     *counter += 1;
/// }
///
/// assert_eq!(letters[&'s'], 2);
/// assert_eq!(letters[&'t'], 3);
/// assert_eq!(letters[&'u'], 1);
/// assert_eq!(letters.get(&'y'), None);
/// ```
Gets the given key's corresponding entry in the map for in-place manipulation.
Gets the given key ' s corresponding entry in the map for in - place manipulation .
pub fn entry(&mut self, mut key: K) -> Entry<K, V, S> {
        let hash_val = self.make_hash(&key);
        let link = self.hash_table.get_hash_index(hash_val).avl_root_node_ptr();
        let (duplicate, parent, link) =
            unsafe { hash_table::find_duplicate_hash_node(link, &mut key as *mut K, hash_val) };
        if duplicate.is_null() {
            return Entry::Vacant(VacantEntry {
                hash_value: hash_val,
                key,
                parent,
                link,
                hash_map_mut: self,
            });
        } else {
            return Entry::Occupied(OccupiedEntry {
                key: Some(key),
                hash_entry: duplicate.deref_to_hash_entry(),
                hash_map_mut: self,
            });
        };
    }
pub fn entry ( & mut self , mut key : K ) -> Entry < K , V , S > { let hash_val = self . make_hash ( & key ) ; let link = self . hash_table . get_hash_index ( hash_val ) . avl_root_node_ptr ( ) ; let ( duplicate , parent , link ) = unsafe { hash_table :: find_duplicate_hash_node ( link , & mut key as * mut K , hash_val ) } ; if duplicate . is_null ( ) { return Entry :: Vacant ( VacantEntry { hash_value : hash_val , key , parent , link , hash_map_mut : self , } ) ; } else { return Entry :: Occupied ( OccupiedEntry { key : Some ( key ) , hash_entry : duplicate . deref_to_hash_entry ( ) , hash_map_mut : self , } ) ; } ; }
Gets the given key's corresponding entry in the map for in-place manipulation.
Gets the given key ' s corresponding entry in the map for in - place manipulation .
&mut self
key
K
examples
```
use hash_ord::hash_map::HashMap.

let mut letters = HashMap::new().

for ch in "a short treatise on fungi".chars() {
let counter = letters.entry(ch).or_insert(0);
counter += 1;
}


` ` ` use hash_ord :: hash_map :: HashMap . let mut letters = HashMap :: new () . for ch in " a short treatise on fungi " . chars () { let counter = letters . entry ( ch ) . or_insert ( 0 ) ; counter + = 1 ; }