pub type UnhashMap<K, V> = HashMap<K, V, BuildHasherDefault<Unhasher>>;

Aliased Type§

struct UnhashMap<K, V> {
    base: HashMap<K, V, BuildHasherDefault<Unhasher>, Global>,
}

Fields§

§base: HashMap<K, V, BuildHasherDefault<Unhasher>, Global>

Trait Implementations§

source§

impl<K: Eq + Hash, V: Eq, S: BuildHasher> HashMapExt<K, V> for HashMap<K, V, S>

source§

fn insert_same(&mut self, key: K, value: V)

Same as HashMap::insert, but it may panic if there’s already an entry for key with a value not equal to value
source§

impl<K, V, R, HCX> HashStable<HCX> for HashMap<K, V, R>where K: ToStableHashKey<HCX> + Eq, V: HashStable<HCX>, R: BuildHasher,

source§

fn hash_stable(&self, hcx: &mut HCX, hasher: &mut StableHasher)

Layout§

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 32 bytes