Struct map_split::HashMapD [] [src]

pub struct HashMapD<'a, K: 'a, V: 'a, S: 'a, SplitType>(_, _)
where
    K: Eq + Hash,
    S: BuildHasher
;

A wrapper around a HashMap which provides access to the D portion of a Splittable4 value type

Methods

impl<'a, K: 'a, V: 'a, S, SplitType> HashMapD<'a, K, V, S, SplitType> where
    K: Eq + Hash,
    S: BuildHasher
[src]

An iterator visiting all key-value pairs in arbitrary order. Iterator element type is (&'b K, &'b V::D).

An iterator visiting all key-value pairs in arbitrary order. Iterator element type is (&'b K, &'b mut V::D).

Returns the number of elements the map can hold without reallocating.

This number is a lower bound; the HashMap might be able to hold more, but is guaranteed to be able to hold at least this many.

Returns the number of elements in the map.

Returns true if the map contains no elements.

Returns a reference to the value corresponding to the key.

The key may be any borrowed form of the map's key type, but Hash and Eq on the borrowed form must match those for the key type.

Returns a mutable reference to the value corresponding to the key.

The key may be any borrowed form of the map's key type, but Hash and Eq on the borrowed form must match those for the key type.