Struct rayon_hash::HashMap
source · pub struct HashMap<K, V, S = RandomState> { /* private fields */ }
Expand description
A hash map implemented with linear probing and Robin Hood bucket stealing.
By default, HashMap
uses a hashing algorithm selected to provide
resistance against HashDoS attacks. The algorithm is randomly seeded, and a
reasonable best-effort is made to generate this seed from a high quality,
secure source of randomness provided by the host without blocking the
program. Because of this, the randomness of the seed depends on the output
quality of the system’s random number generator when the seed is created.
In particular, seeds generated when the system’s entropy pool is abnormally
low such as during system boot may be of a lower quality.
The default hashing algorithm is currently SipHash 1-3, though this is subject to change at any point in the future. While its performance is very competitive for medium sized keys, other hashing algorithms will outperform it for small keys such as integers as well as large keys such as long strings, though those algorithms will typically not protect against attacks such as HashDoS.
The hashing algorithm can be replaced on a per-HashMap
basis using the
default
, with_hasher
, and with_capacity_and_hasher
methods. Many
alternative algorithms are available on crates.io, such as the fnv
crate.
It is required that the keys implement the Eq
and Hash
traits, although
this can frequently be achieved by using #[derive(PartialEq, Eq, Hash)]
.
If you implement these yourself, it is important that the following
property holds:
k1 == k2 -> hash(k1) == hash(k2)
In other words, if two keys are equal, their hashes must be equal.
It is a logic error for a key to be modified in such a way that the key’s
hash, as determined by the Hash
trait, or its equality, as determined by
the Eq
trait, changes while it is in the map. This is normally only
possible through Cell
, RefCell
, global state, I/O, or unsafe code.
Relevant papers/articles:
- Pedro Celis. “Robin Hood Hashing”
- Emmanuel Goossaert. “Robin Hood hashing”
- Emmanuel Goossaert. “Robin Hood hashing: backward shift deletion”
Examples
use rayon_hash::HashMap;
// Type inference lets us omit an explicit type signature (which
// would be `HashMap<String, String>` in this example).
let mut book_reviews = HashMap::new();
// Review some books.
book_reviews.insert(
"Adventures of Huckleberry Finn".to_string(),
"My favorite book.".to_string(),
);
book_reviews.insert(
"Grimms' Fairy Tales".to_string(),
"Masterpiece.".to_string(),
);
book_reviews.insert(
"Pride and Prejudice".to_string(),
"Very enjoyable.".to_string(),
);
book_reviews.insert(
"The Adventures of Sherlock Holmes".to_string(),
"Eye lyked it alot.".to_string(),
);
// Check for a specific one.
// When collections store owned values (String), they can still be
// queried using references (&str).
if !book_reviews.contains_key("Les Misérables") {
println!("We've got {} reviews, but Les Misérables ain't one.",
book_reviews.len());
}
// oops, this review has a lot of spelling mistakes, let's delete it.
book_reviews.remove("The Adventures of Sherlock Holmes");
// Look up the values associated with some keys.
let to_find = ["Pride and Prejudice", "Alice's Adventure in Wonderland"];
for &book in &to_find {
match book_reviews.get(book) {
Some(review) => println!("{}: {}", book, review),
None => println!("{} is unreviewed.", book)
}
}
// Iterate over everything.
for (book, review) in &book_reviews {
println!("{}: \"{}\"", book, review);
}
HashMap
also implements an Entry API
, which allows
for more complex methods of getting, setting, updating and removing keys and
their values:
use rayon_hash::HashMap;
// type inference lets us omit an explicit type signature (which
// would be `HashMap<&str, u8>` in this example).
let mut player_stats = HashMap::new();
fn random_stat_buff() -> u8 {
// could actually return some random value here - let's just return
// some fixed value for now
42
}
// insert a key only if it doesn't already exist
player_stats.entry("health").or_insert(100);
// insert a key using a function that provides a new value only if it
// doesn't already exist
player_stats.entry("defence").or_insert_with(random_stat_buff);
// update a key, guarding against the key possibly not being set
let stat = player_stats.entry("attack").or_insert(100);
*stat += random_stat_buff();
The easiest way to use HashMap
with a custom type as key is to derive Eq
and Hash
.
We must also derive PartialEq
.
use rayon_hash::HashMap;
#[derive(Hash, Eq, PartialEq, Debug)]
struct Viking {
name: String,
country: String,
}
impl Viking {
/// Create a new Viking.
fn new(name: &str, country: &str) -> Viking {
Viking { name: name.to_string(), country: country.to_string() }
}
}
// Use a HashMap to store the vikings' health points.
let mut vikings = HashMap::new();
vikings.insert(Viking::new("Einar", "Norway"), 25);
vikings.insert(Viking::new("Olaf", "Denmark"), 24);
vikings.insert(Viking::new("Harald", "Iceland"), 12);
// Use derived implementation to print the status of the vikings.
for (viking, health) in &vikings {
println!("{:?} has {} hp", viking, health);
}
A HashMap
with fixed list of elements can be initialized from an array:
use rayon_hash::HashMap;
fn main() {
let timber_resources: HashMap<&str, i32> =
[("Norway", 100),
("Denmark", 50),
("Iceland", 10)]
.iter().cloned().collect();
// use the values stored in map
}
Implementations
sourceimpl<K, V: Send, S> HashMap<K, V, S>
impl<K, V: Send, S> HashMap<K, V, S>
pub fn par_values_mut(&mut self) -> ParValuesMut<'_, K, V>
sourceimpl<K, V, S> HashMap<K, V, S>where
K: Eq + Hash + Sync,
V: PartialEq + Sync,
S: BuildHasher + Sync,
impl<K, V, S> HashMap<K, V, S>where
K: Eq + Hash + Sync,
V: PartialEq + Sync,
S: BuildHasher + Sync,
sourceimpl<K: Hash + Eq, V> HashMap<K, V, RandomState>
impl<K: Hash + Eq, V> HashMap<K, V, RandomState>
sourcepub fn new() -> HashMap<K, V, RandomState>
pub fn new() -> HashMap<K, V, RandomState>
Creates an empty HashMap
.
The hash map is initially created with a capacity of 0, so it will not allocate until it is first inserted into.
Examples
use rayon_hash::HashMap;
let mut map: HashMap<&str, i32> = HashMap::new();
sourcepub fn with_capacity(capacity: usize) -> HashMap<K, V, RandomState>
pub fn with_capacity(capacity: usize) -> HashMap<K, V, RandomState>
Creates an empty HashMap
with the specified capacity.
The hash map will be able to hold at least capacity
elements without
reallocating. If capacity
is 0, the hash map will not allocate.
Examples
use rayon_hash::HashMap;
let mut map: HashMap<&str, i32> = HashMap::with_capacity(10);
sourceimpl<K, V, S> HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher,
impl<K, V, S> HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher,
sourcepub fn with_hasher(hash_builder: S) -> HashMap<K, V, S>
pub fn with_hasher(hash_builder: S) -> HashMap<K, V, S>
Creates an empty HashMap
which will use the given hash builder to hash
keys.
The created map has the default initial capacity.
Warning: hash_builder
is normally randomly generated, and
is designed to allow HashMaps to be resistant to attacks that
cause many collisions and very poor performance. Setting it
manually using this function can expose a DoS attack vector.
Examples
use rayon_hash::HashMap;
use rayon_hash::hash_map::RandomState;
let s = RandomState::new();
let mut map = HashMap::with_hasher(s);
map.insert(1, 2);
sourcepub fn with_capacity_and_hasher(
capacity: usize,
hash_builder: S
) -> HashMap<K, V, S>
pub fn with_capacity_and_hasher(
capacity: usize,
hash_builder: S
) -> HashMap<K, V, S>
Creates an empty HashMap
with the specified capacity, using hash_builder
to hash the keys.
The hash map will be able to hold at least capacity
elements without
reallocating. If capacity
is 0, the hash map will not allocate.
Warning: hash_builder
is normally randomly generated, and
is designed to allow HashMaps to be resistant to attacks that
cause many collisions and very poor performance. Setting it
manually using this function can expose a DoS attack vector.
Examples
use rayon_hash::HashMap;
use rayon_hash::hash_map::RandomState;
let s = RandomState::new();
let mut map = HashMap::with_capacity_and_hasher(10, s);
map.insert(1, 2);
sourcepub fn hasher(&self) -> &S
pub fn hasher(&self) -> &S
Returns a reference to the map’s BuildHasher
.
Examples
use rayon_hash::HashMap;
use rayon_hash::hash_map::RandomState;
let hasher = RandomState::new();
let map: HashMap<i32, i32> = HashMap::with_hasher(hasher);
let hasher: &RandomState = map.hasher();
sourcepub fn capacity(&self) -> usize
pub fn capacity(&self) -> usize
Returns the number of elements the map can hold without reallocating.
This number is a lower bound; the HashMap<K, V>
might be able to hold
more, but is guaranteed to be able to hold at least this many.
Examples
use rayon_hash::HashMap;
let map: HashMap<i32, i32> = HashMap::with_capacity(100);
assert!(map.capacity() >= 100);
sourcepub fn reserve(&mut self, additional: usize)
pub fn reserve(&mut self, additional: usize)
Reserves capacity for at least additional
more elements to be inserted
in the HashMap
. The collection may reserve more space to avoid
frequent reallocations.
Panics
Panics if the new allocation size overflows usize
.
Examples
use rayon_hash::HashMap;
let mut map: HashMap<&str, i32> = HashMap::new();
map.reserve(10);
sourcepub fn shrink_to_fit(&mut self)
pub fn shrink_to_fit(&mut self)
Shrinks the capacity of the map as much as possible. It will drop down as much as possible while maintaining the internal rules and possibly leaving some space in accordance with the resize policy.
Examples
use rayon_hash::HashMap;
let mut map: HashMap<i32, i32> = HashMap::with_capacity(100);
map.insert(1, 2);
map.insert(3, 4);
assert!(map.capacity() >= 100);
map.shrink_to_fit();
assert!(map.capacity() >= 2);
sourcepub fn keys(&self) -> Keys<'_, K, V> ⓘ
pub fn keys(&self) -> Keys<'_, K, V> ⓘ
An iterator visiting all keys in arbitrary order.
The iterator element type is &'a K
.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
map.insert("a", 1);
map.insert("b", 2);
map.insert("c", 3);
for key in map.keys() {
println!("{}", key);
}
sourcepub fn values(&self) -> Values<'_, K, V> ⓘ
pub fn values(&self) -> Values<'_, K, V> ⓘ
An iterator visiting all values in arbitrary order.
The iterator element type is &'a V
.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
map.insert("a", 1);
map.insert("b", 2);
map.insert("c", 3);
for val in map.values() {
println!("{}", val);
}
sourcepub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ
pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ
An iterator visiting all values mutably in arbitrary order.
The iterator element type is &'a mut V
.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
map.insert("a", 1);
map.insert("b", 2);
map.insert("c", 3);
for val in map.values_mut() {
*val = *val + 10;
}
for val in map.values() {
println!("{}", val);
}
sourcepub fn iter(&self) -> Iter<'_, K, V> ⓘ
pub fn iter(&self) -> Iter<'_, K, V> ⓘ
An iterator visiting all key-value pairs in arbitrary order.
The iterator element type is (&'a K, &'a V)
.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
map.insert("a", 1);
map.insert("b", 2);
map.insert("c", 3);
for (key, val) in map.iter() {
println!("key: {} val: {}", key, val);
}
sourcepub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ
pub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ
An iterator visiting all key-value pairs in arbitrary order,
with mutable references to the values.
The iterator element type is (&'a K, &'a mut V)
.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
map.insert("a", 1);
map.insert("b", 2);
map.insert("c", 3);
// Update all values
for (_, val) in map.iter_mut() {
*val *= 2;
}
for (key, val) in &map {
println!("key: {} val: {}", key, val);
}
sourcepub fn entry(&mut self, key: K) -> Entry<'_, K, V>
pub fn entry(&mut self, key: K) -> Entry<'_, K, V>
Gets the given key’s corresponding entry in the map for in-place manipulation.
Examples
use rayon_hash::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);
sourcepub fn len(&self) -> usize
pub fn len(&self) -> usize
Returns the number of elements in the map.
Examples
use rayon_hash::HashMap;
let mut a = HashMap::new();
assert_eq!(a.len(), 0);
a.insert(1, "a");
assert_eq!(a.len(), 1);
sourcepub fn is_empty(&self) -> bool
pub fn is_empty(&self) -> bool
Returns true if the map contains no elements.
Examples
use rayon_hash::HashMap;
let mut a = HashMap::new();
assert!(a.is_empty());
a.insert(1, "a");
assert!(!a.is_empty());
sourcepub fn drain(&mut self) -> Drain<'_, K, V> ⓘ
pub fn drain(&mut self) -> Drain<'_, K, V> ⓘ
Clears the map, returning all key-value pairs as an iterator. Keeps the allocated memory for reuse.
Examples
use rayon_hash::HashMap;
let mut a = HashMap::new();
a.insert(1, "a");
a.insert(2, "b");
for (k, v) in a.drain().take(1) {
assert!(k == 1 || k == 2);
assert!(v == "a" || v == "b");
}
assert!(a.is_empty());
sourcepub fn clear(&mut self)
pub fn clear(&mut self)
Clears the map, removing all key-value pairs. Keeps the allocated memory for reuse.
Examples
use rayon_hash::HashMap;
let mut a = HashMap::new();
a.insert(1, "a");
a.clear();
assert!(a.is_empty());
sourcepub fn get<Q: ?Sized>(&self, k: &Q) -> Option<&V>where
K: Borrow<Q>,
Q: Hash + Eq,
pub fn get<Q: ?Sized>(&self, k: &Q) -> Option<&V>where
K: Borrow<Q>,
Q: Hash + Eq,
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.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
map.insert(1, "a");
assert_eq!(map.get(&1), Some(&"a"));
assert_eq!(map.get(&2), None);
sourcepub fn contains_key<Q: ?Sized>(&self, k: &Q) -> boolwhere
K: Borrow<Q>,
Q: Hash + Eq,
pub fn contains_key<Q: ?Sized>(&self, k: &Q) -> boolwhere
K: Borrow<Q>,
Q: Hash + Eq,
Returns true if the map contains a value for the specified 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.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
map.insert(1, "a");
assert_eq!(map.contains_key(&1), true);
assert_eq!(map.contains_key(&2), false);
sourcepub fn get_mut<Q: ?Sized>(&mut self, k: &Q) -> Option<&mut V>where
K: Borrow<Q>,
Q: Hash + Eq,
pub fn get_mut<Q: ?Sized>(&mut self, k: &Q) -> Option<&mut V>where
K: Borrow<Q>,
Q: Hash + Eq,
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.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
map.insert(1, "a");
if let Some(x) = map.get_mut(&1) {
*x = "b";
}
assert_eq!(map[&1], "b");
sourcepub fn insert(&mut self, k: K, v: V) -> Option<V>
pub fn insert(&mut self, k: K, v: V) -> Option<V>
Inserts a key-value pair into the map.
If the map did not have this key present, None
is returned.
If the map did have this key present, the value is updated, and the old
value is returned. The key is not updated, though; this matters for
types that can be ==
without being identical. See the module-level
documentation for more.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
assert_eq!(map.insert(37, "a"), None);
assert_eq!(map.is_empty(), false);
map.insert(37, "b");
assert_eq!(map.insert(37, "c"), Some("b"));
assert_eq!(map[&37], "c");
sourcepub fn remove<Q: ?Sized>(&mut self, k: &Q) -> Option<V>where
K: Borrow<Q>,
Q: Hash + Eq,
pub fn remove<Q: ?Sized>(&mut self, k: &Q) -> Option<V>where
K: Borrow<Q>,
Q: Hash + Eq,
Removes a key from the map, returning the value at the key if the key was previously in the map.
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.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
map.insert(1, "a");
assert_eq!(map.remove(&1), Some("a"));
assert_eq!(map.remove(&1), None);
sourcepub fn remove_entry<Q: ?Sized>(&mut self, k: &Q) -> Option<(K, V)>where
K: Borrow<Q>,
Q: Hash + Eq,
pub fn remove_entry<Q: ?Sized>(&mut self, k: &Q) -> Option<(K, V)>where
K: Borrow<Q>,
Q: Hash + Eq,
Removes a key from the map, returning the stored key and value if the key was previously in the map.
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.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
map.insert(1, "a");
assert_eq!(map.remove_entry(&1), Some((1, "a")));
assert_eq!(map.remove(&1), None);
sourcepub fn retain<F>(&mut self, f: F)where
F: FnMut(&K, &mut V) -> bool,
pub fn retain<F>(&mut self, f: F)where
F: FnMut(&K, &mut V) -> bool,
Retains only the elements specified by the predicate.
In other words, remove all pairs (k, v)
such that f(&k,&mut v)
returns false
.
Examples
use rayon_hash::HashMap;
let mut map: HashMap<i32, i32> = (0..8).map(|x|(x, x*10)).collect();
map.retain(|&k, _| k % 2 == 0);
assert_eq!(map.len(), 4);
Trait Implementations
sourceimpl<'a, K, V, S> Extend<(&'a K, &'a V)> for HashMap<K, V, S>where
K: Eq + Hash + Copy,
V: Copy,
S: BuildHasher,
impl<'a, K, V, S> Extend<(&'a K, &'a V)> for HashMap<K, V, S>where
K: Eq + Hash + Copy,
V: Copy,
S: BuildHasher,
sourcefn extend<T: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iter: T)
fn extend<T: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iter: T)
sourcefn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)sourceimpl<K, V, S> Extend<(K, V)> for HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher,
impl<K, V, S> Extend<(K, V)> for HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher,
sourcefn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)
fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)
sourcefn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)sourceimpl<K, V, S> FromIterator<(K, V)> for HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher + Default,
impl<K, V, S> FromIterator<(K, V)> for HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher + Default,
sourceimpl<K, V, S> FromParallelIterator<(K, V)> for HashMap<K, V, S>where
K: Eq + Hash + Send,
V: Send,
S: BuildHasher + Default + Send,
impl<K, V, S> FromParallelIterator<(K, V)> for HashMap<K, V, S>where
K: Eq + Hash + Send,
V: Send,
S: BuildHasher + Default + Send,
Collect (key, value) pairs from a parallel iterator into a hashmap. If multiple pairs correspond to the same key, then the ones produced earlier in the parallel iterator will be overwritten, just as with a sequential iterator.
sourcefn from_par_iter<P>(par_iter: P) -> Selfwhere
P: IntoParallelIterator<Item = (K, V)>,
fn from_par_iter<P>(par_iter: P) -> Selfwhere
P: IntoParallelIterator<Item = (K, V)>,
par_iter
. Read moresourceimpl<'a, K, Q: ?Sized, V, S> Index<&'a Q> for HashMap<K, V, S>where
K: Eq + Hash + Borrow<Q>,
Q: Eq + Hash,
S: BuildHasher,
impl<'a, K, Q: ?Sized, V, S> Index<&'a Q> for HashMap<K, V, S>where
K: Eq + Hash + Borrow<Q>,
Q: Eq + Hash,
S: BuildHasher,
sourceimpl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher,
impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher,
sourceimpl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher,
impl<'a, K, V, S> IntoIterator for &'a mut HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher,
sourceimpl<K, V, S> IntoIterator for HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher,
impl<K, V, S> IntoIterator for HashMap<K, V, S>where
K: Eq + Hash,
S: BuildHasher,
sourcefn into_iter(self) -> IntoIter<K, V> ⓘ
fn into_iter(self) -> IntoIter<K, V> ⓘ
Creates a consuming iterator, that is, one that moves each key-value pair out of the map in arbitrary order. The map cannot be used after calling this.
Examples
use rayon_hash::HashMap;
let mut map = HashMap::new();
map.insert("a", 1);
map.insert("b", 2);
map.insert("c", 3);
// Not possible with .iter()
let vec: Vec<(&str, i32)> = map.into_iter().collect();
sourceimpl<'a, K: Sync, V: Sync, S> IntoParallelIterator for &'a HashMap<K, V, S>
impl<'a, K: Sync, V: Sync, S> IntoParallelIterator for &'a HashMap<K, V, S>
sourceimpl<'a, K: Sync, V: Send, S> IntoParallelIterator for &'a mut HashMap<K, V, S>
impl<'a, K: Sync, V: Send, S> IntoParallelIterator for &'a mut HashMap<K, V, S>
type Iter = ParIterMut<'a, K, V>
type Iter = ParIterMut<'a, K, V>
sourcefn into_par_iter(self) -> Self::Iter
fn into_par_iter(self) -> Self::Iter
self
into a parallel iterator. Read moresourceimpl<K: Send, V: Send, S> IntoParallelIterator for HashMap<K, V, S>
impl<K: Send, V: Send, S> IntoParallelIterator for HashMap<K, V, S>
type Iter = ParIntoIter<K, V>
type Iter = ParIntoIter<K, V>
sourcefn into_par_iter(self) -> Self::Iter
fn into_par_iter(self) -> Self::Iter
self
into a parallel iterator. Read moresourceimpl<'a, K, V, S> ParallelExtend<(&'a K, &'a V)> for HashMap<K, V, S>where
K: Copy + Eq + Hash + Send + Sync,
V: Copy + Send + Sync,
S: BuildHasher + Send,
impl<'a, K, V, S> ParallelExtend<(&'a K, &'a V)> for HashMap<K, V, S>where
K: Copy + Eq + Hash + Send + Sync,
V: Copy + Send + Sync,
S: BuildHasher + Send,
Extend a hash map with copied items from a parallel iterator.
sourcefn par_extend<I>(&mut self, par_iter: I)where
I: IntoParallelIterator<Item = (&'a K, &'a V)>,
fn par_extend<I>(&mut self, par_iter: I)where
I: IntoParallelIterator<Item = (&'a K, &'a V)>,
par_iter
. Read moresourceimpl<K, V, S> ParallelExtend<(K, V)> for HashMap<K, V, S>where
K: Eq + Hash + Send,
V: Send,
S: BuildHasher + Send,
impl<K, V, S> ParallelExtend<(K, V)> for HashMap<K, V, S>where
K: Eq + Hash + Send,
V: Send,
S: BuildHasher + Send,
Extend a hash map with items from a parallel iterator.
sourcefn par_extend<I>(&mut self, par_iter: I)where
I: IntoParallelIterator<Item = (K, V)>,
fn par_extend<I>(&mut self, par_iter: I)where
I: IntoParallelIterator<Item = (K, V)>,
par_iter
. Read moresourceimpl<K, V, S> PartialEq<HashMap<K, V, S>> for HashMap<K, V, S>where
K: Eq + Hash,
V: PartialEq,
S: BuildHasher,
impl<K, V, S> PartialEq<HashMap<K, V, S>> for HashMap<K, V, S>where
K: Eq + Hash,
V: PartialEq,
S: BuildHasher,
impl<K, V, S> Eq for HashMap<K, V, S>where
K: Eq + Hash,
V: Eq,
S: BuildHasher,
Auto Trait Implementations
impl<K, V, S> RefUnwindSafe for HashMap<K, V, S>where
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V, S> Send for HashMap<K, V, S>where
K: Send,
S: Send,
V: Send,
impl<K, V, S> Sync for HashMap<K, V, S>where
K: Sync,
S: Sync,
V: Sync,
impl<K, V, S> Unpin for HashMap<K, V, S>where
K: Unpin,
S: Unpin,
V: Unpin,
impl<K, V, S> UnwindSafe for HashMap<K, V, S>where
K: UnwindSafe,
S: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
sourceimpl<'data, I> IntoParallelRefIterator<'data> for Iwhere
I: 'data + ?Sized,
&'data I: IntoParallelIterator,
impl<'data, I> IntoParallelRefIterator<'data> for Iwhere
I: 'data + ?Sized,
&'data I: IntoParallelIterator,
type Iter = <&'data I as IntoParallelIterator>::Iter
type Iter = <&'data I as IntoParallelIterator>::Iter
type Item = <&'data I as IntoParallelIterator>::Item
type Item = <&'data I as IntoParallelIterator>::Item
&'data T
reference type. Read moresourcefn par_iter(&'data self) -> <I as IntoParallelRefIterator<'data>>::Iter
fn par_iter(&'data self) -> <I as IntoParallelRefIterator<'data>>::Iter
self
into a parallel iterator. Read moresourceimpl<'data, I> IntoParallelRefMutIterator<'data> for Iwhere
I: 'data + ?Sized,
&'data mut I: IntoParallelIterator,
impl<'data, I> IntoParallelRefMutIterator<'data> for Iwhere
I: 'data + ?Sized,
&'data mut I: IntoParallelIterator,
type Iter = <&'data mut I as IntoParallelIterator>::Iter
type Iter = <&'data mut I as IntoParallelIterator>::Iter
type Item = <&'data mut I as IntoParallelIterator>::Item
type Item = <&'data mut I as IntoParallelIterator>::Item
&'data mut T
reference. Read moresourcefn par_iter_mut(
&'data mut self
) -> <I as IntoParallelRefMutIterator<'data>>::Iter
fn par_iter_mut(
&'data mut self
) -> <I as IntoParallelRefMutIterator<'data>>::Iter
self
. Read more