fn insert_hashed_nocheck(&mut self, hash: SafeHash, k: K, v: V) -> Option<V> {
        let entry = search_hashed(&mut self.table, hash, |key| *key == k).into_entry(k);
        match entry {
            Some(Occupied(mut elem)) => Some(elem.insert(v)),
            Some(Vacant(elem)) => {
                elem.insert(v);
                None
            }
            None => unreachable!(),
        }
    }
/// Insert a pre-hashed key-value pair, without first checking
/// that there's enough room in the buckets. Returns a reference to the
/// newly insert value.
///
/// If the key already exists, the hashtable will be returned untouched
/// and a reference to the existing element will be returned.
Insert a pre-hashed key-value pair, without first checking
that there's enough room in the buckets. Returns a reference to the
newly insert value.

If the key already exists, the hashtable will be returned untouched
and a reference to the existing element will be returned.
Insert a pre - hashed key - value pair without first checking that there ' s enough room in the buckets . Returns a reference to the newly insert value . If the key already exists the hashtable will be returned untouched and a reference to the existing element will be returned .
fn insert_hashed_nocheck(&mut self, hash: SafeHash, k: K, v: V) -> Option<V> {
        let entry = search_hashed(&mut self.table, hash, |key| *key == k).into_entry(k);
        match entry {
            Some(Occupied(mut elem)) => Some(elem.insert(v)),
            Some(Vacant(elem)) => {
                elem.insert(v);
                None
            }
            None => unreachable!(),
        }
    }
fn insert_hashed_nocheck ( & mut self , hash : SafeHash , k : K , v : V ) -> Option < V > { let entry = search_hashed ( & mut self . table , hash , | key | * key == k ) . into_entry ( k ) ; match entry { Some ( Occupied ( mut elem ) ) => Some ( elem . insert ( v ) ) , Some ( Vacant ( elem ) ) => { elem . insert ( v ) ; None } None => unreachable ! ( ) , } }
Insert a pre-hashed key-value pair, without first checking
that there's enough room in the buckets.
Insert a pre - hashed key - value pair without first checking that there ' s enough room in the buckets .
&mut self
hash
SafeHash
k
K
v
V