# Struct im::hashmap::HashMap
[−]
[src]

pub struct HashMap<K, V, S = RandomState> { /* fields omitted */ }

A hash map.

An immutable hash map using hash array mapped tries.

Most operations on this map are O(log_{x} n) for a
suitably high *x* that it should be nearly O(1) for most maps.
Because of this, it's a great choice for a generic map as long as
you don't mind that keys will need to implement
`Hash`

and `Eq`

.

Map entries will have a predictable order based on the hasher
being used. Unless otherwise specified, all maps will share an
instance of the default
`RandomState`

hasher,
which will produce consistent hashes for the duration of its
lifetime, but not between restarts of your program.

## Methods

`impl<K, V> HashMap<K, V, RandomState> where`

K: Hash + Eq,

[src]

K: Hash + Eq,

`pub fn new() -> Self`

[src]

Construct an empty hash map.

`pub fn singleton<RK, RV>(k: RK, v: RV) -> HashMap<K, V> where`

RK: Shared<K>,

RV: Shared<V>,

[src]

RK: Shared<K>,

RV: Shared<V>,

Construct a hash map with a single mapping.

# Examples

let map = HashMap::singleton(123, "onetwothree"); assert_eq!( map.get(&123), Some(Arc::new("onetwothree")) );

`impl<K, V, S> HashMap<K, V, S>`

[src]

`pub fn is_empty(&self) -> bool`

[src]

Test whether a hash map is empty.

Time: O(1)

# Examples

assert!( !hashmap!{1 => 2}.is_empty() ); assert!( HashMap::<i32, i32>::new().is_empty() );

`pub fn len(&self) -> usize`

[src]

Get the size of a hash map.

Time: O(1)

# Examples

assert_eq!(3, hashmap!{ 1 => 11, 2 => 22, 3 => 33 }.len());

`pub fn iter(&self) -> Iter<(Arc<K>, Arc<V>)>`

[src]

Get an iterator over the key/value pairs of a hash map.

Please note that the order is consistent between maps using the same hasher, but no other ordering guarantee is offered. Items will not come out in insertion order or sort order. They will, however, come out in the same order every time for the same map.

#### ⓘImportant traits for Keys<K, V>`pub fn keys(&self) -> Keys<K, V>`

[src]

Get an iterator over a hash map's keys.

Please note that the order is consistent between maps using the same hasher, but no other ordering guarantee is offered. Items will not come out in insertion order or sort order. They will, however, come out in the same order every time for the same map.

#### ⓘImportant traits for Values<K, V>`pub fn values(&self) -> Values<K, V>`

[src]

Get an iterator over a hash map's values.

Please note that the order is consistent between maps using the same hasher, but no other ordering guarantee is offered. Items will not come out in insertion order or sort order. They will, however, come out in the same order every time for the same map.

`impl<K, V, S> HashMap<K, V, S> where`

K: Hash + Eq,

S: BuildHasher,

[src]

K: Hash + Eq,

S: BuildHasher,

`pub fn with_hasher<RS>(hasher: RS) -> Self where`

RS: Shared<S>,

[src]

RS: Shared<S>,

Construct an empty hash map using the provided hasher.

`pub fn new_from<K1, V1>(&self) -> HashMap<K1, V1, S> where`

K1: Hash + Eq,

[src]

K1: Hash + Eq,

Construct an empty hash map using the same hasher as the current hash map.

`pub fn get(&self, k: &K) -> Option<Arc<V>>`

[src]

Get the value for a key from a hash map.

Time: O(log n)

# Examples

let map = hashmap!{123 => "lol"}; assert_eq!( map.get(&123), Some(Arc::new("lol")) );

`pub fn get_or<RV>(&self, k: &K, default: RV) -> Arc<V> where`

RV: Shared<V>,

[src]

RV: Shared<V>,

Get the value for a key from a hash map, or a default value if the key isn't in the map.

Time: O(log n)

# Examples

let map = hashmap!{123 => "lol"}; assert_eq!( map.get_or(&123, "hi"), Arc::new("lol") ); assert_eq!( map.get_or(&321, "hi"), Arc::new("hi") );

`pub fn contains_key(&self, k: &K) -> bool`

[src]

Test for the presence of a key in a hash map.

Time: O(log n)

# Examples

let map = hashmap!{123 => "lol"}; assert!( map.contains_key(&123) ); assert!( !map.contains_key(&321) );

`pub fn insert<RK, RV>(&self, k: RK, v: RV) -> Self where`

RK: Shared<K>,

RV: Shared<V>,

[src]

RK: Shared<K>,

RV: Shared<V>,

Construct a new hash map by inserting a key/value mapping into a map.

If the map already has a mapping for the given key, the previous value is overwritten.

Time: O(log n)

# Examples

let map = hashmap!{}; assert_eq!( map.insert(123, "123"), hashmap!{123 => "123"} );

`pub fn insert_mut<RK, RV>(&mut self, k: RK, v: RV) where`

RK: Shared<K>,

RV: Shared<V>,

[src]

RK: Shared<K>,

RV: Shared<V>,

Insert a key/value mapping into a map.

If the map already has a mapping for the given key, the previous value is overwritten.

This is a copy-on-write operation, so that the parts of the set's structure which are shared with other sets will be safely copied before mutating.

Time: O(log n)

# Examples

let mut map = hashmap!{}; map.insert_mut(123, "123"); map.insert_mut(456, "456"); assert_eq!( map, hashmap!{123 => "123", 456 => "456"} );

`pub fn set<RK, RV>(&self, k: RK, v: RV) -> Self where`

RK: Shared<K>,

RV: Shared<V>,

[src]

RK: Shared<K>,

RV: Shared<V>,

Construct a new map by inserting a key/value mapping into a map.

This is an alias for `insert`

.

Time: O(log n)

`pub fn set_mut<RK, RV>(&mut self, k: RK, v: RV) where`

RK: Shared<K>,

RV: Shared<V>,

[src]

RK: Shared<K>,

RV: Shared<V>,

Insert a key/value mapping into a map, mutating it in place when it is safe to do so.

This is an alias for `insert_mut`

.

Time: O(log n)

`pub fn insert_with<RK, RV, F>(self, k: RK, v: RV, f: F) -> Self where`

RK: Shared<K>,

RV: Shared<V>,

F: Fn(Arc<V>, Arc<V>) -> Arc<V>,

[src]

RK: Shared<K>,

RV: Shared<V>,

F: Fn(Arc<V>, Arc<V>) -> Arc<V>,

Construct a new hash map by inserting a key/value mapping into a map.

If the map already has a mapping for the given key, we call the provided function with the old value and the new value, and insert the result as the new value.

Time: O(log n)

`pub fn insert_with_key<RK, RV, F>(self, k: RK, v: RV, f: F) -> Self where`

F: Fn(Arc<K>, Arc<V>, Arc<V>) -> Arc<V>,

RK: Shared<K>,

RV: Shared<V>,

[src]

F: Fn(Arc<K>, Arc<V>, Arc<V>) -> Arc<V>,

RK: Shared<K>,

RV: Shared<V>,

Construct a new map by inserting a key/value mapping into a map.

If the map already has a mapping for the given key, we call the provided function with the key, the old value and the new value, and insert the result as the new value.

Time: O(log n)

`pub fn insert_lookup_with_key<RK, RV, F>(`

self,

k: RK,

v: RV,

f: F

) -> (Option<Arc<V>>, Self) where

F: Fn(Arc<K>, Arc<V>, Arc<V>) -> Arc<V>,

RK: Shared<K>,

RV: Shared<V>,

[src]

self,

k: RK,

v: RV,

f: F

) -> (Option<Arc<V>>, Self) where

F: Fn(Arc<K>, Arc<V>, Arc<V>) -> Arc<V>,

RK: Shared<K>,

RV: Shared<V>,

Construct a new map by inserting a key/value mapping into a map, returning the old value for the key as well as the new map.

If the map already has a mapping for the given key, we call the provided function with the key, the old value and the new value, and insert the result as the new value.

Time: O(log n)

`pub fn update<F>(&self, k: &K, f: F) -> Self where`

F: Fn(Arc<V>) -> Option<Arc<V>>,

[src]

F: Fn(Arc<V>) -> Option<Arc<V>>,

Update the value for a given key by calling a function with the current value and overwriting it with the function's return value.

Time: O(log n)

`pub fn update_with_key<F>(&self, k: &K, f: F) -> Self where`

F: Fn(Arc<K>, Arc<V>) -> Option<Arc<V>>,

[src]

F: Fn(Arc<K>, Arc<V>) -> Option<Arc<V>>,

Update the value for a given key by calling a function with the key and the current value and overwriting it with the function's return value.

Time: O(log n)

`pub fn update_lookup_with_key<F>(&self, k: &K, f: F) -> (Option<Arc<V>>, Self) where`

F: Fn(Arc<K>, Arc<V>) -> Option<Arc<V>>,

[src]

F: Fn(Arc<K>, Arc<V>) -> Option<Arc<V>>,

Update the value for a given key by calling a function with the key and the current value and overwriting it with the function's return value.

If the key was not in the map, the function is never called and the map is left unchanged.

Return a tuple of the old value, if there was one, and the new map.

Time: O(log n)

`pub fn alter<RK, F>(&self, f: F, k: RK) -> Self where`

F: Fn(Option<Arc<V>>) -> Option<Arc<V>>,

RK: Shared<K>,

[src]

F: Fn(Option<Arc<V>>) -> Option<Arc<V>>,

RK: Shared<K>,

Update the value for a given key by calling a function with the current value and overwriting it with the function's return value.

This is like the `update`

method, except with more
control: the function gets an
`Option<V>`

and returns the same, so
that it can decide to delete a mapping instead of updating the
value, and decide what to do if the key isn't in the map.

Time: O(log n)

`pub fn remove(&self, k: &K) -> Self`

[src]

Remove a key/value pair from a hash map, if it exists.

Time: O(log n)

`pub fn remove_mut(&mut self, k: &K)`

[src]

Remove a key/value mapping from a map if it exists.

This is a copy-on-write operation, so that the parts of the set's structure which are shared with other sets will be safely copied before mutating.

Time: O(log n)

# Examples

let mut map = hashmap!{123 => "123", 456 => "456"}; map.remove_mut(&123); map.remove_mut(&456); assert!(map.is_empty());

`pub fn pop(&self, k: &K) -> Option<(Arc<V>, Self)>`

[src]

Remove a key/value pair from a map, if it exists, and return the removed value as well as the updated list.

Time: O(log n)

`pub fn pop_mut(&mut self, k: &K) -> Option<Arc<V>>`

[src]

Remove a key/value pair from a map, if it exists, and return the removed value.

This is a copy-on-write operation, so that the parts of the set's structure which are shared with other sets will be safely copied before mutating.

Time: O(log n)

`pub fn pop_with_key(&self, k: &K) -> Option<(Arc<K>, Arc<V>, Self)>`

[src]

Remove a key/value pair from a map, if it exists, and return the removed key and value as well as the updated list.

Time: O(log n)

`pub fn pop_with_key_mut(&mut self, k: &K) -> Option<(Arc<K>, Arc<V>)>`

[src]

Remove a key/value pair from a map, if it exists, and return the removed key and value.

Time: O(log n)

`pub fn union(&self, other: &Self) -> Self`

[src]

Construct the union of two maps, keeping the values in the current map when keys exist in both maps.

`pub fn union_with<F, RM>(&self, other: RM, f: F) -> Self where`

F: Fn(Arc<V>, Arc<V>) -> Arc<V>,

RM: Borrow<Self>,

[src]

F: Fn(Arc<V>, Arc<V>) -> Arc<V>,

RM: Borrow<Self>,

Construct the union of two maps, using a function to decide what to do with the value when a key is in both maps.

`pub fn union_with_key<F, RM>(&self, other: RM, f: F) -> Self where`

F: Fn(Arc<K>, Arc<V>, Arc<V>) -> Arc<V>,

RM: Borrow<Self>,

[src]

F: Fn(Arc<K>, Arc<V>, Arc<V>) -> Arc<V>,

RM: Borrow<Self>,

Construct the union of two maps, using a function to decide what to do with the value when a key is in both maps. The function receives the key as well as both values.

`pub fn unions<I>(i: I) -> Self where`

S: Default,

I: IntoIterator<Item = Self>,

[src]

S: Default,

I: IntoIterator<Item = Self>,

Construct the union of a sequence of maps, selecting the value of the leftmost when a key appears in more than one map.

`pub fn unions_with<I, F>(i: I, f: F) -> Self where`

S: Default,

I: IntoIterator<Item = Self>,

F: Fn(Arc<V>, Arc<V>) -> Arc<V>,

[src]

S: Default,

I: IntoIterator<Item = Self>,

F: Fn(Arc<V>, Arc<V>) -> Arc<V>,

Construct the union of a sequence of maps, using a function to decide what to do with the value when a key is in more than one map.

`pub fn unions_with_key<I, F>(i: I, f: F) -> Self where`

S: Default,

I: IntoIterator<Item = Self>,

F: Fn(Arc<K>, Arc<V>, Arc<V>) -> Arc<V>,

[src]

S: Default,

I: IntoIterator<Item = Self>,

F: Fn(Arc<K>, Arc<V>, Arc<V>) -> Arc<V>,

Construct the union of a sequence of maps, using a function to decide what to do with the value when a key is in more than one map. The function receives the key as well as both values.

`pub fn difference<B, RM>(&self, other: RM) -> Self where`

RM: Borrow<HashMap<K, B, S>>,

[src]

RM: Borrow<HashMap<K, B, S>>,

Construct the difference between two maps by discarding keys which occur in both maps.

`pub fn difference_with<B, RM, F>(&self, other: RM, f: F) -> Self where`

F: Fn(Arc<V>, Arc<B>) -> Option<Arc<V>>,

RM: Borrow<HashMap<K, B, S>>,

[src]

F: Fn(Arc<V>, Arc<B>) -> Option<Arc<V>>,

RM: Borrow<HashMap<K, B, S>>,

Construct the difference between two maps by using a function to decide what to do if a key occurs in both.

`pub fn difference_with_key<B, RM, F>(&self, other: RM, f: F) -> Self where`

F: Fn(Arc<K>, Arc<V>, Arc<B>) -> Option<Arc<V>>,

RM: Borrow<HashMap<K, B, S>>,

[src]

F: Fn(Arc<K>, Arc<V>, Arc<B>) -> Option<Arc<V>>,

RM: Borrow<HashMap<K, B, S>>,

Construct the difference between two maps by using a function to decide what to do if a key occurs in both. The function receives the key as well as both values.

`pub fn intersection<B, RM>(&self, other: RM) -> Self where`

RM: Borrow<HashMap<K, B, S>>,

[src]

RM: Borrow<HashMap<K, B, S>>,

Construct the intersection of two maps, keeping the values from the current map.

`pub fn intersection_with<B, C, RM, F>(`

&self,

other: RM,

f: F

) -> HashMap<K, C, S> where

F: Fn(Arc<V>, Arc<B>) -> Arc<C>,

RM: Borrow<HashMap<K, B, S>>,

[src]

&self,

other: RM,

f: F

) -> HashMap<K, C, S> where

F: Fn(Arc<V>, Arc<B>) -> Arc<C>,

RM: Borrow<HashMap<K, B, S>>,

Construct the intersection of two maps, calling a function with both values for each key and using the result as the value for the key.

`pub fn intersection_with_key<B, C, RM, F>(`

&self,

other: RM,

f: F

) -> HashMap<K, C, S> where

F: Fn(Arc<K>, Arc<V>, Arc<B>) -> Arc<C>,

RM: Borrow<HashMap<K, B, S>>,

[src]

&self,

other: RM,

f: F

) -> HashMap<K, C, S> where

F: Fn(Arc<K>, Arc<V>, Arc<B>) -> Arc<C>,

RM: Borrow<HashMap<K, B, S>>,

Construct the intersection of two maps, calling a function with the key and both values for each key and using the result as the value for the key.

`pub fn merge_with_key<B, C, RM, FC, F1, F2>(`

&self,

other: RM,

combine: FC,

only1: F1,

only2: F2

) -> HashMap<K, C, S> where

RM: Borrow<HashMap<K, B, S>>,

FC: Fn(Arc<K>, Arc<V>, Arc<B>) -> Option<Arc<C>>,

F1: Fn(Self) -> HashMap<K, C, S>,

F2: Fn(HashMap<K, B, S>) -> HashMap<K, C, S>,

[src]

&self,

other: RM,

combine: FC,

only1: F1,

only2: F2

) -> HashMap<K, C, S> where

RM: Borrow<HashMap<K, B, S>>,

FC: Fn(Arc<K>, Arc<V>, Arc<B>) -> Option<Arc<C>>,

F1: Fn(Self) -> HashMap<K, C, S>,

F2: Fn(HashMap<K, B, S>) -> HashMap<K, C, S>,

Merge two maps.

First, we call the `combine`

function for each key/value pair
which exists in both maps, updating the value or discarding it
according to the function's return value.

The `only1`

and `only2`

functions are called with the
key/value pairs which are only in the first and the second
list respectively. The results of these are then merged with
the result of the first operation.

`pub fn is_submap_by<B, RM, F>(&self, other: RM, cmp: F) -> bool where`

F: Fn(Arc<V>, Arc<B>) -> bool,

RM: Borrow<HashMap<K, B, S>>,

[src]

F: Fn(Arc<V>, Arc<B>) -> bool,

RM: Borrow<HashMap<K, B, S>>,

Test whether a map is a submap of another map, meaning that all keys in our map must also be in the other map, with the same values.

Use the provided function to decide whether values are equal.

`pub fn is_proper_submap_by<B, RM, F>(&self, other: RM, cmp: F) -> bool where`

F: Fn(Arc<V>, Arc<B>) -> bool,

RM: Borrow<HashMap<K, B, S>>,

[src]

F: Fn(Arc<V>, Arc<B>) -> bool,

RM: Borrow<HashMap<K, B, S>>,

Test whether a map is a proper submap of another map, meaning that all keys in our map must also be in the other map, with the same values. To be a proper submap, ours must also contain fewer keys than the other map.

Use the provided function to decide whether values are equal.

`pub fn is_submap<RM>(&self, other: RM) -> bool where`

V: PartialEq,

RM: Borrow<Self>,

[src]

V: PartialEq,

RM: Borrow<Self>,

Test whether a map is a submap of another map, meaning that all keys in our map must also be in the other map, with the same values.

`pub fn is_proper_submap<RM>(&self, other: RM) -> bool where`

V: PartialEq,

RM: Borrow<Self>,

[src]

V: PartialEq,

RM: Borrow<Self>,

Test whether a map is a proper submap of another map, meaning that all keys in our map must also be in the other map, with the same values. To be a proper submap, ours must also contain fewer keys than the other map.

## Trait Implementations

`impl<K: Ord, V, S> From<HashMap<K, V, S>> for OrdMap<K, V>`

[src]

`impl<'a, K: Ord, V, S> From<&'a HashMap<K, V, S>> for OrdMap<K, V>`

[src]

`impl<K, V, S> Clone for HashMap<K, V, S>`

[src]

`fn clone(&self) -> Self`

[src]

Returns a copy of the value. Read more

`fn clone_from(&mut self, source: &Self)`

1.0.0[src]

Performs copy-assignment from `source`

. Read more

`impl<K, V, S> PartialEq for HashMap<K, V, S> where`

K: Hash + Eq,

V: PartialEq,

S: BuildHasher,

[src]

K: Hash + Eq,

V: PartialEq,

S: BuildHasher,

`fn eq(&self, other: &Self) -> bool`

[src]

This method tests for `self`

and `other`

values to be equal, and is used by `==`

. Read more

`fn ne(&self, other: &Rhs) -> bool`

1.0.0[src]

This method tests for `!=`

.

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

[src]

`impl<K, V, S> PartialOrd for HashMap<K, V, S> where`

K: Hash + Eq + PartialOrd,

V: PartialOrd,

S: BuildHasher,

[src]

K: Hash + Eq + PartialOrd,

V: PartialOrd,

S: BuildHasher,

`fn partial_cmp(&self, other: &Self) -> Option<Ordering>`

[src]

This method returns an ordering between `self`

and `other`

values if one exists. Read more

`fn lt(&self, other: &Rhs) -> bool`

1.0.0[src]

This method tests less than (for `self`

and `other`

) and is used by the `<`

operator. Read more

`fn le(&self, other: &Rhs) -> bool`

1.0.0[src]

This method tests less than or equal to (for `self`

and `other`

) and is used by the `<=`

operator. Read more

`fn gt(&self, other: &Rhs) -> bool`

1.0.0[src]

This method tests greater than (for `self`

and `other`

) and is used by the `>`

operator. Read more

`fn ge(&self, other: &Rhs) -> bool`

1.0.0[src]

This method tests greater than or equal to (for `self`

and `other`

) and is used by the `>=`

operator. Read more

`impl<K, V, S> Ord for HashMap<K, V, S> where`

K: Hash + Eq + Ord,

V: Ord,

S: BuildHasher,

[src]

K: Hash + Eq + Ord,

V: Ord,

S: BuildHasher,

`fn cmp(&self, other: &Self) -> Ordering`

[src]

This method returns an `Ordering`

between `self`

and `other`

. Read more

`fn max(self, other: Self) -> Self`

1.21.0[src]

Compares and returns the maximum of two values. Read more

`fn min(self, other: Self) -> Self`

1.21.0[src]

Compares and returns the minimum of two values. Read more

`impl<K, V, S> Hash for HashMap<K, V, S> where`

K: Hash,

V: Hash,

[src]

K: Hash,

V: Hash,

`fn hash<H>(&self, state: &mut H) where`

H: Hasher,

[src]

H: Hasher,

Feeds this value into the given [`Hasher`

]. Read more

`fn hash_slice<H>(data: &[Self], state: &mut H) where`

H: Hasher,

1.3.0[src]

H: Hasher,

Feeds a slice of this type into the given [`Hasher`

]. Read more

`impl<K, V, S> Default for HashMap<K, V, S> where`

K: Hash + Eq,

S: BuildHasher + Default,

[src]

K: Hash + Eq,

S: BuildHasher + Default,

`impl<'a, K, V, S> Add for &'a HashMap<K, V, S> where`

K: Hash + Eq,

S: BuildHasher,

[src]

K: Hash + Eq,

S: BuildHasher,

`type Output = HashMap<K, V, S>`

The resulting type after applying the `+`

operator.

`fn add(self, other: Self) -> Self::Output`

[src]

Performs the `+`

operation.

`impl<K, V, S> Debug for HashMap<K, V, S> where`

K: Debug,

V: Debug,

[src]

K: Debug,

V: Debug,

`fn fmt(&self, f: &mut Formatter) -> Result<(), Error>`

[src]

Formats the value using the given formatter. Read more

`impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S>`

[src]

`type Item = (Arc<K>, Arc<V>)`

The type of the elements being iterated over.

`type IntoIter = Iter<(Arc<K>, Arc<V>)>`

Which kind of iterator are we turning this into?

`fn into_iter(self) -> Self::IntoIter`

[src]

Creates an iterator from a value. Read more

`impl<K, V, S> IntoIterator for HashMap<K, V, S>`

[src]

`type Item = (Arc<K>, Arc<V>)`

The type of the elements being iterated over.

`type IntoIter = Iter<(Arc<K>, Arc<V>)>`

Which kind of iterator are we turning this into?

`fn into_iter(self) -> Self::IntoIter`

[src]

Creates an iterator from a value. Read more

`impl<K, V, RK, RV, S> FromIterator<(RK, RV)> for HashMap<K, V, S> where`

K: Hash + Eq,

RK: Shared<K>,

RV: Shared<V>,

S: BuildHasher + Default,

[src]

K: Hash + Eq,

RK: Shared<K>,

RV: Shared<V>,

S: BuildHasher + Default,

`fn from_iter<T>(i: T) -> Self where`

T: IntoIterator<Item = (RK, RV)>,

[src]

T: IntoIterator<Item = (RK, RV)>,

Creates a value from an iterator. Read more

`impl<K, V, S> AsRef<HashMap<K, V, S>> for HashMap<K, V, S>`

[src]

`impl<'a, K: Hash + Eq, V: Clone, RK, RV, S> From<&'a [(RK, RV)]> for HashMap<K, V, S> where`

&'a RK: Shared<K>,

&'a RV: Shared<V>,

S: BuildHasher + Default,

[src]

&'a RK: Shared<K>,

&'a RV: Shared<V>,

S: BuildHasher + Default,

`impl<K: Hash + Eq, V, RK, RV, S> From<Vec<(RK, RV)>> for HashMap<K, V, S> where`

RK: Shared<K>,

RV: Shared<V>,

S: BuildHasher + Default,

[src]

RK: Shared<K>,

RV: Shared<V>,

S: BuildHasher + Default,

`impl<'a, K: Hash + Eq, V, RK, RV, S> From<&'a Vec<(RK, RV)>> for HashMap<K, V, S> where`

&'a RK: Shared<K>,

&'a RV: Shared<V>,

S: BuildHasher + Default,

[src]

&'a RK: Shared<K>,

&'a RV: Shared<V>,

S: BuildHasher + Default,

`impl<K: Hash + Eq, V, RK: Hash + Eq, RV, S> From<HashMap<RK, RV>> for HashMap<K, V, S> where`

RK: Shared<K>,

RV: Shared<V>,

S: BuildHasher + Default,

[src]

RK: Shared<K>,

RV: Shared<V>,

S: BuildHasher + Default,

`impl<'a, K: Hash + Eq, V, RK: Hash + Eq, RV, S> From<&'a HashMap<RK, RV>> for HashMap<K, V, S> where`

&'a RK: Shared<K>,

&'a RV: Shared<V>,

S: BuildHasher + Default,

[src]

&'a RK: Shared<K>,

&'a RV: Shared<V>,

S: BuildHasher + Default,

`impl<K: Hash + Eq, V, RK, RV, S> From<BTreeMap<RK, RV>> for HashMap<K, V, S> where`

RK: Shared<K>,

RV: Shared<V>,

S: BuildHasher + Default,

[src]

RK: Shared<K>,

RV: Shared<V>,

S: BuildHasher + Default,

`impl<'a, K: Hash + Eq, V, RK, RV, S> From<&'a BTreeMap<RK, RV>> for HashMap<K, V, S> where`

&'a RK: Shared<K>,

&'a RV: Shared<V>,

S: BuildHasher + Default,

[src]

&'a RK: Shared<K>,

&'a RV: Shared<V>,

S: BuildHasher + Default,