[−][src]Struct im_rc::HashMap
An unordered map.
An immutable hash map using hash array mapped tries.
Most operations on this map are O(logx 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 + Clone,
V: Clone,
[src]
impl<K, V> HashMap<K, V, RandomState> where
K: Hash + Eq + Clone,
V: Clone,
| [src] |
Construct an empty hash map.
| [src] |
renamed to unit
for consistency
Construct a hash map with a single mapping.
This method has been deprecated; use unit
instead.
| [src] |
Construct a hash map with a single mapping.
Examples
let map = HashMap::unit(123, "onetwothree"); assert_eq!( map.get(&123), Some(&"onetwothree") );
impl<K, V, S> HashMap<K, V, S> where
K: Clone,
V: Clone,
[src]
impl<K, V, S> HashMap<K, V, S> where
K: Clone,
V: Clone,
| [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() );
| [src] |
Get the size of a hash map.
Time: O(1)
Examples
assert_eq!(3, hashmap!{ 1 => 11, 2 => 22, 3 => 33 }.len());
impl<K, V, S> HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher,
[src]
impl<K, V, S> HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher,
| [src] |
Construct an empty hash map using the provided hasher.
| [src] |
Get a reference to the map's BuildHasher
.
| [src] |
Construct an empty hash map using the same hasher as the current hash map.
ⓘImportant traits for Iter<'a, K, 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 IterMut<'a, K, V>
| [src] |
Get a mutable iterator over the values 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<'a, 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<'a, 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.
| [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(&"lol") );
| [src] |
Get a mutable reference to 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(&"lol") );
| [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(&mut self, k: K, v: V) -> Option<V> | [src] |
Insert 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 mut map = hashmap!{}; map.insert(123, "123"); map.insert(456, "456"); assert_eq!( map, hashmap!{123 => "123", 456 => "456"} );
pub fn remove<BK: ?Sized>(&mut self, k: &BK) -> Option<V> where | [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)
Examples
let mut map = hashmap!{123 => "123", 456 => "456"}; assert_eq!(Some("123"), map.remove(&123)); assert_eq!(Some("456"), map.remove(&456)); assert_eq!(None, map.remove(&789)); assert!(map.is_empty());
pub fn remove_with_key<BK: ?Sized>(&mut self, k: &BK) -> Option<(K, V)> where | [src] |
Remove a key/value pair from a map, if it exists, and return the removed key and value.
Time: O(log n)
Examples
let mut map = hashmap!{123 => "123", 456 => "456"}; assert_eq!(Some((123, "123")), map.remove_with_key(&123)); assert_eq!(Some((456, "456")), map.remove_with_key(&456)); assert_eq!(None, map.remove_with_key(&789)); assert!(map.is_empty());
pub fn clear(&mut self) | [src] |
Discard all elements from the map.
This leaves you with an empty map, and all elements that were previously inside it are dropped.
Time: O(n)
Examples
let mut map = hashmap![1=>1, 2=>2, 3=>3]; map.clear(); assert!(map.is_empty());
| [src] |
Get the Entry
for a key in the map for in-place manipulation.
Time: O(log n)
| [src] |
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.update(123, "123"), hashmap!{123 => "123"} );
| [src] |
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)
| [src] |
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)
| [src] |
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)
| [src] |
Update the value for a given key by calling a function with the current value and overwriting it with the function's return value.
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)
| [src] |
Construct a new map without the given key.
Construct a map that's a copy of the current map, absent the
mapping for key
if it's present.
Time: O(log n)
| [src] |
Remove a key/value pair from a map, if it exists, and return the removed value as well as the updated map.
Time: O(log n)
| [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)
| [src] |
Construct the union of two maps, keeping the values in the current map when keys exist in both maps.
Time: O(n log n)
Examples
let map1 = hashmap!{1 => 1, 3 => 3}; let map2 = hashmap!{2 => 2, 3 => 4}; let expected = hashmap!{1 => 1, 2 => 2, 3 => 3}; assert_eq!(expected, map1.union(map2));
| [src] |
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 is called when a value exists in both maps, and receives the value from the current map as its first argument, and the value from the other map as the second. It should return the value to be inserted in the resulting map.
Time: O(n log n)
| [src] |
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 is called when a value exists in both maps, and receives a reference to the key as its first argument, the value from the current map as the second argument, and the value from the other map as the third argument. It should return the value to be inserted in the resulting map.
Time: O(n log n)
Examples
let map1 = hashmap!{1 => 1, 3 => 4}; let map2 = hashmap!{2 => 2, 3 => 5}; let expected = hashmap!{1 => 1, 2 => 2, 3 => 9}; assert_eq!(expected, map1.union_with_key( map2, |key, left, right| left + right ));
| [src] |
Construct the union of a sequence of maps, selecting the value of the leftmost when a key appears in more than one map.
Time: O(n log n)
Examples
let map1 = hashmap!{1 => 1, 3 => 3}; let map2 = hashmap!{2 => 2}; let expected = hashmap!{1 => 1, 2 => 2, 3 => 3}; assert_eq!(expected, HashMap::unions(vec![map1, map2]));
| [src] |
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 is called when a value exists in multiple maps, and receives the value from the current map as its first argument, and the value from the next map as the second. It should return the value to be inserted in the resulting map.
Time: O(n log n)
| [src] |
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 is called when a value exists in multiple maps, and receives a reference to the key as its first argument, the value from the current map as the second argument, and the value from the next map as the third argument. It should return the value to be inserted in the resulting map.
Time: O(n log n)
| [src] |
Construct the difference between two maps by discarding keys which occur in both maps.
Time: O(n log n)
Examples
let map1 = hashmap!{1 => 1, 3 => 4}; let map2 = hashmap!{2 => 2, 3 => 5}; let expected = hashmap!{1 => 1, 2 => 2}; assert_eq!(expected, map1.difference(map2));
| [src] |
Construct the difference between two maps by using a function to decide what to do if a key occurs in both.
Time: O(n log n)
| [src] |
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.
Time: O(n log n)
Examples
let map1 = hashmap!{1 => 1, 3 => 4}; let map2 = hashmap!{2 => 2, 3 => 5}; let expected = hashmap!{1 => 1, 2 => 2, 3 => 9}; assert_eq!(expected, map1.difference_with_key( map2, |key, left, right| Some(left + right) ));
| [src] |
Construct the intersection of two maps, keeping the values from the current map.
Time: O(n log n)
Examples
let map1 = hashmap!{1 => 1, 2 => 2}; let map2 = hashmap!{2 => 3, 3 => 4}; let expected = hashmap!{2 => 2}; assert_eq!(expected, map1.intersection(map2));
| [src] |
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.
Time: O(n log n)
| [src] |
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.
Time: O(n log n)
Examples
let map1 = hashmap!{1 => 1, 2 => 2}; let map2 = hashmap!{2 => 3, 3 => 4}; let expected = hashmap!{2 => 5}; assert_eq!(expected, map1.intersection_with_key( map2, |key, left, right| left + right ));
| [src] |
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.
Time: O(n log n)
| [src] |
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.
Time: O(n log n)
| [src] |
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.
Time: O(n log n)
Examples
let map1 = hashmap!{1 => 1, 2 => 2}; let map2 = hashmap!{1 => 1, 2 => 2, 3 => 3}; assert!(map1.is_submap(map2));
| [src] |
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.
Time: O(n log n)
Examples
let map1 = hashmap!{1 => 1, 2 => 2}; let map2 = hashmap!{1 => 1, 2 => 2, 3 => 3}; assert!(map1.is_proper_submap(map2)); let map3 = hashmap!{1 => 1, 2 => 2}; let map4 = hashmap!{1 => 1, 2 => 2}; assert!(!map3.is_proper_submap(map4));
Trait Implementations
impl<K: Ord + Hash + Eq + Clone, V: Clone, S: BuildHasher> From<HashMap<K, V, S>> for OrdMap<K, V>
[src]
impl<K: Ord + Hash + Eq + Clone, V: Clone, S: BuildHasher> From<HashMap<K, V, S>> for OrdMap<K, V>
impl<'a, K: Ord + Hash + Eq + Clone, V: Clone, S: BuildHasher> From<&'a HashMap<K, V, S>> for OrdMap<K, V>
[src]
impl<'a, K: Ord + Hash + Eq + Clone, V: Clone, S: BuildHasher> From<&'a HashMap<K, V, S>> for OrdMap<K, V>
impl<'m, 'k, 'v, K: ?Sized, V: ?Sized, OK, OV, SA, SB> From<&'m HashMap<&'k K, &'v V, SA>> for HashMap<OK, OV, SB> where
K: Hash + Eq + ToOwned<Owned = OK>,
V: ToOwned<Owned = OV>,
OK: Hash + Eq + Clone + Borrow<K>,
OV: Borrow<V> + Clone,
SA: BuildHasher,
SB: BuildHasher + Default,
[src]
impl<'m, 'k, 'v, K: ?Sized, V: ?Sized, OK, OV, SA, SB> From<&'m HashMap<&'k K, &'v V, SA>> for HashMap<OK, OV, SB> where
K: Hash + Eq + ToOwned<Owned = OK>,
V: ToOwned<Owned = OV>,
OK: Hash + Eq + Clone + Borrow<K>,
OV: Borrow<V> + Clone,
SA: BuildHasher,
SB: BuildHasher + Default,
impl<'a, K, V, S> From<&'a [(K, V)]> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
[src]
impl<'a, K, V, S> From<&'a [(K, V)]> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
impl<K, V, S> From<Vec<(K, V)>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
[src]
impl<K, V, S> From<Vec<(K, V)>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
impl<'a, K, V, S> From<&'a Vec<(K, V)>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
[src]
impl<'a, K, V, S> From<&'a Vec<(K, V)>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
impl<K, V, S> From<HashMap<K, V, RandomState>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
[src]
impl<K, V, S> From<HashMap<K, V, RandomState>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
impl<'a, K, V, S> From<&'a HashMap<K, V, RandomState>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
[src]
impl<'a, K, V, S> From<&'a HashMap<K, V, RandomState>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
impl<K, V, S> From<BTreeMap<K, V>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
[src]
impl<K, V, S> From<BTreeMap<K, V>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
impl<'a, K, V, S> From<&'a BTreeMap<K, V>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
[src]
impl<'a, K, V, S> From<&'a BTreeMap<K, V>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher,
[src]
impl<'a, K, V, S> IntoIterator for &'a HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher,
type Item = &'a (K, V)
The type of the elements being iterated over.
type IntoIter = Iter<'a, K, V>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter | [src] |
impl<K, V, S> IntoIterator for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher,
[src]
impl<K, V, S> IntoIterator for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher,
type Item = (K, V)
The type of the elements being iterated over.
type IntoIter = ConsumingIter<(K, V)>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter | [src] |
impl<K, V, S> Eq for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Eq + Clone,
S: BuildHasher,
[src]
impl<K, V, S> Eq for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Eq + Clone,
S: BuildHasher,
impl<K, V, S, RK, RV> Extend<(RK, RV)> for HashMap<K, V, S> where
K: Hash + Eq + Clone + From<RK>,
V: Clone + From<RV>,
S: BuildHasher,
[src]
impl<K, V, S, RK, RV> Extend<(RK, RV)> for HashMap<K, V, S> where
K: Hash + Eq + Clone + From<RK>,
V: Clone + From<RV>,
S: BuildHasher,
fn extend<I>(&mut self, iter: I) where | [src] |
impl<K, V, S> PartialOrd<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Hash + Eq + Clone + PartialOrd,
V: PartialOrd + Clone,
S: BuildHasher,
[src]
impl<K, V, S> PartialOrd<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Hash + Eq + Clone + PartialOrd,
V: PartialOrd + Clone,
S: BuildHasher,
fn partial_cmp(&self, other: &Self) -> Option<Ordering> | [src] |
| 1.0.0 [src] |
This method tests less than (for self
and other
) and is used by the <
operator. Read more
| 1.0.0 [src] |
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
| 1.0.0 [src] |
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
| 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> Default for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
[src]
impl<K, V, S> Default for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
impl<K, V, S> PartialEq<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: PartialEq + Clone,
S: BuildHasher,
[src]
impl<K, V, S> PartialEq<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: PartialEq + Clone,
S: BuildHasher,
fn eq(&self, other: &Self) -> bool | [src] |
| 1.0.0 [src] |
This method tests for !=
.
impl<K, V, S> PartialEq<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Eq + Clone,
S: BuildHasher,
[src]
impl<K, V, S> PartialEq<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Eq + Clone,
S: BuildHasher,
fn eq(&self, other: &Self) -> bool | [src] |
| 1.0.0 [src] |
This method tests for !=
.
impl<K, V, S> AsRef<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Clone,
V: Clone,
[src]
impl<K, V, S> AsRef<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Clone,
V: Clone,
impl<K, V, S> Clone for HashMap<K, V, S> where
K: Clone,
V: Clone,
[src]
impl<K, V, S> Clone for HashMap<K, V, S> where
K: Clone,
V: Clone,
fn clone(&self) -> Self | [src] |
fn clone_from(&mut self, source: &Self) | 1.0.0 [src] |
Performs copy-assignment from source
. Read more
impl<K, V, S> Ord for HashMap<K, V, S> where
K: Hash + Eq + Ord + Clone,
V: Ord + Clone,
S: BuildHasher,
[src]
impl<K, V, S> Ord for HashMap<K, V, S> where
K: Hash + Eq + Ord + Clone,
V: Ord + Clone,
S: BuildHasher,
fn cmp(&self, other: &Self) -> Ordering | [src] |
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> Debug for HashMap<K, V, S> where
K: Hash + Eq + Clone + Debug,
V: Debug + Clone,
S: BuildHasher,
[src]
impl<K, V, S> Debug for HashMap<K, V, S> where
K: Hash + Eq + Clone + Debug,
V: Debug + Clone,
S: BuildHasher,
impl<K, V, S> Debug for HashMap<K, V, S> where
K: Hash + Eq + Clone + Ord + Debug,
V: Debug + Clone,
S: BuildHasher,
[src]
impl<K, V, S> Debug for HashMap<K, V, S> where
K: Hash + Eq + Clone + Ord + Debug,
V: Debug + Clone,
S: BuildHasher,
impl<K, V, S> Hash for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Hash + Clone,
S: BuildHasher,
[src]
impl<K, V, S> Hash for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Hash + Clone,
S: BuildHasher,
fn hash<H>(&self, state: &mut H) where | [src] |
fn hash_slice<H>(data: &[Self], state: &mut H) where | 1.3.0 [src] |
Feeds a slice of this type into the given [Hasher
]. Read more
impl<K, V, S> Add<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher,
[src]
impl<K, V, S> Add<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher,
type Output = HashMap<K, V, S>
The resulting type after applying the +
operator.
fn add(self, other: Self) -> Self::Output | [src] |
impl<'a, K, V, S> Add<&'a HashMap<K, V, S>> for &'a HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher,
[src]
impl<'a, K, V, S> Add<&'a HashMap<K, V, S>> for &'a HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher,
type Output = HashMap<K, V, S>
The resulting type after applying the +
operator.
fn add(self, other: Self) -> Self::Output | [src] |
impl<'a, BK: ?Sized, K, V, S> Index<&'a BK> for HashMap<K, V, S> where
BK: Hash + Eq,
K: Hash + Eq + Clone + Borrow<BK>,
V: Clone,
S: BuildHasher,
[src]
impl<'a, BK: ?Sized, K, V, S> Index<&'a BK> for HashMap<K, V, S> where
BK: Hash + Eq,
K: Hash + Eq + Clone + Borrow<BK>,
V: Clone,
S: BuildHasher,
impl<'a, BK: ?Sized, K, V, S> IndexMut<&'a BK> for HashMap<K, V, S> where
BK: Hash + Eq,
K: Hash + Eq + Clone + Borrow<BK>,
V: Clone,
S: BuildHasher,
[src]
impl<'a, BK: ?Sized, K, V, S> IndexMut<&'a BK> for HashMap<K, V, S> where
BK: Hash + Eq,
K: Hash + Eq + Clone + Borrow<BK>,
V: Clone,
S: BuildHasher,
impl<K, V, S> FromIterator<(K, V)> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
[src]
impl<K, V, S> FromIterator<(K, V)> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
fn from_iter<T>(i: T) -> Self where | [src] |
impl<K, V, S> Sum<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
[src]
impl<K, V, S> Sum<HashMap<K, V, S>> for HashMap<K, V, S> where
K: Hash + Eq + Clone,
V: Clone,
S: BuildHasher + Default,
Auto Trait Implementations
impl<K, V, S = RandomState> !Send for HashMap<K, V, S>
impl<K, V, S = RandomState> !Send for HashMap<K, V, S>
impl<K, V, S = RandomState> !Sync for HashMap<K, V, S>
impl<K, V, S = RandomState> !Sync for HashMap<K, V, S>
Blanket Implementations
impl<T> From for T
[src]
impl<T> From for T
impl<I> IntoIterator for I where
I: Iterator,
[src]
impl<I> IntoIterator for I where
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I | [src] |
impl<T, U> Into for T where
U: From<T>,
[src]
impl<T, U> Into for T where
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
impl<T, U> TryFrom for T where
T: From<U>,
[src]
impl<T, U> TryFrom for T where
T: From<U>,
type Error = !
try_from
)The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error> | [src] |
impl<T> Borrow for T where
T: ?Sized,
[src]
impl<T> Borrow for T where
T: ?Sized,
impl<T> BorrowMut for T where
T: ?Sized,
[src]
impl<T> BorrowMut for T where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T | [src] |
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
try_from
)The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error> | [src] |
impl<T> Any for T where
T: 'static + ?Sized,
[src]
impl<T> Any for T where
T: 'static + ?Sized,
fn get_type_id(&self) -> TypeId | [src] |
impl<T> Same for T
[src]
impl<T> Same for T
type Output = T
Should always be Self