Enum ethers_providers::call_raw::spoof::Storage
source · pub enum Storage {
Diff(HashMap<H256, H256>),
Replace(HashMap<H256, H256>),
}
Expand description
Wraps a map from storage slot to the overriden value.
Storage overrides can either replace the existing state of an account or they can be treated as a diff on the existing state.
Variants§
Methods from Deref<Target = HashMap<H256, H256>>§
1.0.0 · sourcepub fn capacity(&self) -> usize
Available on crate feature ipc
and (Unix or Windows) only.
pub fn capacity(&self) -> usize
ipc
and (Unix or Windows) only.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 std::collections::HashMap;
let map: HashMap<i32, i32> = HashMap::with_capacity(100);
assert!(map.capacity() >= 100);
1.0.0 · sourcepub fn keys(&self) -> Keys<'_, K, V>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn keys(&self) -> Keys<'_, K, V>
ipc
and (Unix or Windows) only.An iterator visiting all keys in arbitrary order.
The iterator element type is &'a K
.
§Examples
use std::collections::HashMap;
let map = HashMap::from([
("a", 1),
("b", 2),
("c", 3),
]);
for key in map.keys() {
println!("{key}");
}
§Performance
In the current implementation, iterating over keys takes O(capacity) time instead of O(len) because it internally visits empty buckets too.
1.0.0 · sourcepub fn values(&self) -> Values<'_, K, V>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn values(&self) -> Values<'_, K, V>
ipc
and (Unix or Windows) only.An iterator visiting all values in arbitrary order.
The iterator element type is &'a V
.
§Examples
use std::collections::HashMap;
let map = HashMap::from([
("a", 1),
("b", 2),
("c", 3),
]);
for val in map.values() {
println!("{val}");
}
§Performance
In the current implementation, iterating over values takes O(capacity) time instead of O(len) because it internally visits empty buckets too.
1.10.0 · sourcepub fn values_mut(&mut self) -> ValuesMut<'_, K, V>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>
ipc
and (Unix or Windows) only.An iterator visiting all values mutably in arbitrary order.
The iterator element type is &'a mut V
.
§Examples
use std::collections::HashMap;
let mut map = HashMap::from([
("a", 1),
("b", 2),
("c", 3),
]);
for val in map.values_mut() {
*val = *val + 10;
}
for val in map.values() {
println!("{val}");
}
§Performance
In the current implementation, iterating over values takes O(capacity) time instead of O(len) because it internally visits empty buckets too.
1.0.0 · sourcepub fn iter(&self) -> Iter<'_, K, V>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn iter(&self) -> Iter<'_, K, V>
ipc
and (Unix or Windows) only.An iterator visiting all key-value pairs in arbitrary order.
The iterator element type is (&'a K, &'a V)
.
§Examples
use std::collections::HashMap;
let map = HashMap::from([
("a", 1),
("b", 2),
("c", 3),
]);
for (key, val) in map.iter() {
println!("key: {key} val: {val}");
}
§Performance
In the current implementation, iterating over map takes O(capacity) time instead of O(len) because it internally visits empty buckets too.
1.0.0 · sourcepub fn iter_mut(&mut self) -> IterMut<'_, K, V>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn iter_mut(&mut self) -> IterMut<'_, K, V>
ipc
and (Unix or Windows) only.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 std::collections::HashMap;
let mut map = HashMap::from([
("a", 1),
("b", 2),
("c", 3),
]);
// Update all values
for (_, val) in map.iter_mut() {
*val *= 2;
}
for (key, val) in &map {
println!("key: {key} val: {val}");
}
§Performance
In the current implementation, iterating over map takes O(capacity) time instead of O(len) because it internally visits empty buckets too.
1.0.0 · sourcepub fn len(&self) -> usize
Available on crate feature ipc
and (Unix or Windows) only.
pub fn len(&self) -> usize
ipc
and (Unix or Windows) only.Returns the number of elements in the map.
§Examples
use std::collections::HashMap;
let mut a = HashMap::new();
assert_eq!(a.len(), 0);
a.insert(1, "a");
assert_eq!(a.len(), 1);
1.0.0 · sourcepub fn is_empty(&self) -> bool
Available on crate feature ipc
and (Unix or Windows) only.
pub fn is_empty(&self) -> bool
ipc
and (Unix or Windows) only.Returns true
if the map contains no elements.
§Examples
use std::collections::HashMap;
let mut a = HashMap::new();
assert!(a.is_empty());
a.insert(1, "a");
assert!(!a.is_empty());
1.6.0 · sourcepub fn drain(&mut self) -> Drain<'_, K, V>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn drain(&mut self) -> Drain<'_, K, V>
ipc
and (Unix or Windows) only.Clears the map, returning all key-value pairs as an iterator. Keeps the allocated memory for reuse.
If the returned iterator is dropped before being fully consumed, it drops the remaining key-value pairs. The returned iterator keeps a mutable borrow on the map to optimize its implementation.
§Examples
use std::collections::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 extract_if<F>(&mut self, pred: F) -> ExtractIf<'_, K, V, F>
🔬This is a nightly-only experimental API. (hash_extract_if
)Available on crate feature ipc
and (Unix or Windows) only.
pub fn extract_if<F>(&mut self, pred: F) -> ExtractIf<'_, K, V, F>
hash_extract_if
)ipc
and (Unix or Windows) only.Creates an iterator which uses a closure to determine if an element should be removed.
If the closure returns true, the element is removed from the map and yielded. If the closure returns false, or panics, the element remains in the map and will not be yielded.
Note that extract_if
lets you mutate every value in the filter closure, regardless of
whether you choose to keep or remove it.
If the returned ExtractIf
is not exhausted, e.g. because it is dropped without iterating
or the iteration short-circuits, then the remaining elements will be retained.
Use retain
with a negated predicate if you do not need the returned iterator.
§Examples
Splitting a map into even and odd keys, reusing the original map:
#![feature(hash_extract_if)]
use std::collections::HashMap;
let mut map: HashMap<i32, i32> = (0..8).map(|x| (x, x)).collect();
let extracted: HashMap<i32, i32> = map.extract_if(|k, _v| k % 2 == 0).collect();
let mut evens = extracted.keys().copied().collect::<Vec<_>>();
let mut odds = map.keys().copied().collect::<Vec<_>>();
evens.sort();
odds.sort();
assert_eq!(evens, vec![0, 2, 4, 6]);
assert_eq!(odds, vec![1, 3, 5, 7]);
1.18.0 · sourcepub fn retain<F>(&mut self, f: F)
Available on crate feature ipc
and (Unix or Windows) only.
pub fn retain<F>(&mut self, f: F)
ipc
and (Unix or Windows) only.Retains only the elements specified by the predicate.
In other words, remove all pairs (k, v)
for which f(&k, &mut v)
returns false
.
The elements are visited in unsorted (and unspecified) order.
§Examples
use std::collections::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);
§Performance
In the current implementation, this operation takes O(capacity) time instead of O(len) because it internally visits empty buckets too.
1.0.0 · sourcepub fn clear(&mut self)
Available on crate feature ipc
and (Unix or Windows) only.
pub fn clear(&mut self)
ipc
and (Unix or Windows) only.Clears the map, removing all key-value pairs. Keeps the allocated memory for reuse.
§Examples
use std::collections::HashMap;
let mut a = HashMap::new();
a.insert(1, "a");
a.clear();
assert!(a.is_empty());
1.9.0 · sourcepub fn hasher(&self) -> &S
Available on crate feature ipc
and (Unix or Windows) only.
pub fn hasher(&self) -> &S
ipc
and (Unix or Windows) only.Returns a reference to the map’s BuildHasher
.
§Examples
use std::collections::HashMap;
use std::hash::RandomState;
let hasher = RandomState::new();
let map: HashMap<i32, i32> = HashMap::with_hasher(hasher);
let hasher: &RandomState = map.hasher();
1.0.0 · sourcepub fn reserve(&mut self, additional: usize)
Available on crate feature ipc
and (Unix or Windows) only.
pub fn reserve(&mut self, additional: usize)
ipc
and (Unix or Windows) only.Reserves capacity for at least additional
more elements to be inserted
in the HashMap
. The collection may reserve more space to speculatively
avoid frequent reallocations. After calling reserve
,
capacity will be greater than or equal to self.len() + additional
.
Does nothing if capacity is already sufficient.
§Panics
Panics if the new allocation size overflows usize
.
§Examples
use std::collections::HashMap;
let mut map: HashMap<&str, i32> = HashMap::new();
map.reserve(10);
1.57.0 · sourcepub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError>
ipc
and (Unix or Windows) only.Tries to reserve capacity for at least additional
more elements to be inserted
in the HashMap
. The collection may reserve more space to speculatively
avoid frequent reallocations. After calling try_reserve
,
capacity will be greater than or equal to self.len() + additional
if
it returns Ok(())
.
Does nothing if capacity is already sufficient.
§Errors
If the capacity overflows, or the allocator reports a failure, then an error is returned.
§Examples
use std::collections::HashMap;
let mut map: HashMap<&str, isize> = HashMap::new();
map.try_reserve(10).expect("why is the test harness OOMing on a handful of bytes?");
1.0.0 · sourcepub fn shrink_to_fit(&mut self)
Available on crate feature ipc
and (Unix or Windows) only.
pub fn shrink_to_fit(&mut self)
ipc
and (Unix or Windows) only.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 std::collections::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);
1.56.0 · sourcepub fn shrink_to(&mut self, min_capacity: usize)
Available on crate feature ipc
and (Unix or Windows) only.
pub fn shrink_to(&mut self, min_capacity: usize)
ipc
and (Unix or Windows) only.Shrinks the capacity of the map with a lower limit. It will drop down no lower than the supplied limit while maintaining the internal rules and possibly leaving some space in accordance with the resize policy.
If the current capacity is less than the lower limit, this is a no-op.
§Examples
use std::collections::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(10);
assert!(map.capacity() >= 10);
map.shrink_to(0);
assert!(map.capacity() >= 2);
1.0.0 · sourcepub fn entry(&mut self, key: K) -> Entry<'_, K, V>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn entry(&mut self, key: K) -> Entry<'_, K, V>
ipc
and (Unix or Windows) only.Gets the given key’s corresponding entry in the map for in-place manipulation.
§Examples
use std::collections::HashMap;
let mut letters = HashMap::new();
for ch in "a short treatise on fungi".chars() {
letters.entry(ch).and_modify(|counter| *counter += 1).or_insert(1);
}
assert_eq!(letters[&'s'], 2);
assert_eq!(letters[&'t'], 3);
assert_eq!(letters[&'u'], 1);
assert_eq!(letters.get(&'y'), None);
1.0.0 · sourcepub fn get<Q>(&self, k: &Q) -> Option<&V>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn get<Q>(&self, k: &Q) -> Option<&V>
ipc
and (Unix or Windows) only.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 std::collections::HashMap;
let mut map = HashMap::new();
map.insert(1, "a");
assert_eq!(map.get(&1), Some(&"a"));
assert_eq!(map.get(&2), None);
1.40.0 · sourcepub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
ipc
and (Unix or Windows) only.Returns the key-value pair corresponding to the supplied key.
The supplied 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 std::collections::HashMap;
let mut map = HashMap::new();
map.insert(1, "a");
assert_eq!(map.get_key_value(&1), Some((&1, &"a")));
assert_eq!(map.get_key_value(&2), None);
sourcepub fn get_many_mut<Q, const N: usize>(
&mut self,
ks: [&Q; N]
) -> Option<[&mut V; N]>
🔬This is a nightly-only experimental API. (map_many_mut
)Available on crate feature ipc
and (Unix or Windows) only.
pub fn get_many_mut<Q, const N: usize>( &mut self, ks: [&Q; N] ) -> Option<[&mut V; N]>
map_many_mut
)ipc
and (Unix or Windows) only.Attempts to get mutable references to N
values in the map at once.
Returns an array of length N
with the results of each query. For soundness, at most one
mutable reference will be returned to any value. None
will be returned if any of the
keys are duplicates or missing.
§Examples
#![feature(map_many_mut)]
use std::collections::HashMap;
let mut libraries = HashMap::new();
libraries.insert("Bodleian Library".to_string(), 1602);
libraries.insert("Athenæum".to_string(), 1807);
libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
libraries.insert("Library of Congress".to_string(), 1800);
let got = libraries.get_many_mut([
"Athenæum",
"Library of Congress",
]);
assert_eq!(
got,
Some([
&mut 1807,
&mut 1800,
]),
);
// Missing keys result in None
let got = libraries.get_many_mut([
"Athenæum",
"New York Public Library",
]);
assert_eq!(got, None);
// Duplicate keys result in None
let got = libraries.get_many_mut([
"Athenæum",
"Athenæum",
]);
assert_eq!(got, None);
sourcepub unsafe fn get_many_unchecked_mut<Q, const N: usize>(
&mut self,
ks: [&Q; N]
) -> Option<[&mut V; N]>
🔬This is a nightly-only experimental API. (map_many_mut
)Available on crate feature ipc
and (Unix or Windows) only.
pub unsafe fn get_many_unchecked_mut<Q, const N: usize>( &mut self, ks: [&Q; N] ) -> Option<[&mut V; N]>
map_many_mut
)ipc
and (Unix or Windows) only.Attempts to get mutable references to N
values in the map at once, without validating that
the values are unique.
Returns an array of length N
with the results of each query. None
will be returned if
any of the keys are missing.
For a safe alternative see get_many_mut
.
§Safety
Calling this method with overlapping keys is undefined behavior even if the resulting references are not used.
§Examples
#![feature(map_many_mut)]
use std::collections::HashMap;
let mut libraries = HashMap::new();
libraries.insert("Bodleian Library".to_string(), 1602);
libraries.insert("Athenæum".to_string(), 1807);
libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
libraries.insert("Library of Congress".to_string(), 1800);
let got = libraries.get_many_mut([
"Athenæum",
"Library of Congress",
]);
assert_eq!(
got,
Some([
&mut 1807,
&mut 1800,
]),
);
// Missing keys result in None
let got = libraries.get_many_mut([
"Athenæum",
"New York Public Library",
]);
assert_eq!(got, None);
1.0.0 · sourcepub fn contains_key<Q>(&self, k: &Q) -> bool
Available on crate feature ipc
and (Unix or Windows) only.
pub fn contains_key<Q>(&self, k: &Q) -> bool
ipc
and (Unix or Windows) only.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 std::collections::HashMap;
let mut map = HashMap::new();
map.insert(1, "a");
assert_eq!(map.contains_key(&1), true);
assert_eq!(map.contains_key(&2), false);
1.0.0 · sourcepub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>
ipc
and (Unix or Windows) only.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 std::collections::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");
1.0.0 · sourcepub fn insert(&mut self, k: K, v: V) -> Option<V>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn insert(&mut self, k: K, v: V) -> Option<V>
ipc
and (Unix or Windows) only.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 std::collections::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 try_insert(
&mut self,
key: K,
value: V
) -> Result<&mut V, OccupiedError<'_, K, V>>
🔬This is a nightly-only experimental API. (map_try_insert
)Available on crate feature ipc
and (Unix or Windows) only.
pub fn try_insert( &mut self, key: K, value: V ) -> Result<&mut V, OccupiedError<'_, K, V>>
map_try_insert
)ipc
and (Unix or Windows) only.Tries to insert a key-value pair into the map, and returns a mutable reference to the value in the entry.
If the map already had this key present, nothing is updated, and an error containing the occupied entry and the value is returned.
§Examples
Basic usage:
#![feature(map_try_insert)]
use std::collections::HashMap;
let mut map = HashMap::new();
assert_eq!(map.try_insert(37, "a").unwrap(), &"a");
let err = map.try_insert(37, "b").unwrap_err();
assert_eq!(err.entry.key(), &37);
assert_eq!(err.entry.get(), &"a");
assert_eq!(err.value, "b");
1.0.0 · sourcepub fn remove<Q>(&mut self, k: &Q) -> Option<V>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn remove<Q>(&mut self, k: &Q) -> Option<V>
ipc
and (Unix or Windows) only.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 std::collections::HashMap;
let mut map = HashMap::new();
map.insert(1, "a");
assert_eq!(map.remove(&1), Some("a"));
assert_eq!(map.remove(&1), None);
1.27.0 · sourcepub fn remove_entry<Q>(&mut self, k: &Q) -> Option<(K, V)>
Available on crate feature ipc
and (Unix or Windows) only.
pub fn remove_entry<Q>(&mut self, k: &Q) -> Option<(K, V)>
ipc
and (Unix or Windows) only.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 std::collections::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 raw_entry_mut(&mut self) -> RawEntryBuilderMut<'_, K, V, S>
🔬This is a nightly-only experimental API. (hash_raw_entry
)Available on crate feature ipc
and (Unix or Windows) only.
pub fn raw_entry_mut(&mut self) -> RawEntryBuilderMut<'_, K, V, S>
hash_raw_entry
)ipc
and (Unix or Windows) only.Creates a raw entry builder for the HashMap.
Raw entries provide the lowest level of control for searching and manipulating a map. They must be manually initialized with a hash and then manually searched. After this, insertions into a vacant entry still require an owned key to be provided.
Raw entries are useful for such exotic situations as:
- Hash memoization
- Deferring the creation of an owned key until it is known to be required
- Using a search key that doesn’t work with the Borrow trait
- Using custom comparison logic without newtype wrappers
Because raw entries provide much more low-level control, it’s much easier
to put the HashMap into an inconsistent state which, while memory-safe,
will cause the map to produce seemingly random results. Higher-level and
more foolproof APIs like entry
should be preferred when possible.
In particular, the hash used to initialized the raw entry must still be consistent with the hash of the key that is ultimately stored in the entry. This is because implementations of HashMap may need to recompute hashes when resizing, at which point only the keys are available.
Raw entries give mutable access to the keys. This must not be used to modify how the key would compare or hash, as the map will not re-evaluate where the key should go, meaning the keys may become “lost” if their location does not reflect their state. For instance, if you change a key so that the map now contains keys which compare equal, search may start acting erratically, with two keys randomly masking each other. Implementations are free to assume this doesn’t happen (within the limits of memory-safety).
sourcepub fn raw_entry(&self) -> RawEntryBuilder<'_, K, V, S>
🔬This is a nightly-only experimental API. (hash_raw_entry
)Available on crate feature ipc
and (Unix or Windows) only.
pub fn raw_entry(&self) -> RawEntryBuilder<'_, K, V, S>
hash_raw_entry
)ipc
and (Unix or Windows) only.Creates a raw immutable entry builder for the HashMap.
Raw entries provide the lowest level of control for searching and manipulating a map. They must be manually initialized with a hash and then manually searched.
This is useful for
- Hash memoization
- Using a search key that doesn’t work with the Borrow trait
- Using custom comparison logic without newtype wrappers
Unless you are in such a situation, higher-level and more foolproof APIs like
get
should be preferred.
Immutable raw entries have very limited use; you might instead want raw_entry_mut
.
Trait Implementations§
source§impl Default for Storage
impl Default for Storage
The default storage override is a diff on the existing state of the account.
source§impl<'de> Deserialize<'de> for Storage
impl<'de> Deserialize<'de> for Storage
source§fn deserialize<__D>(
__deserializer: __D
) -> Result<Storage, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D
) -> Result<Storage, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
source§impl PartialEq for Storage
impl PartialEq for Storage
source§impl Serialize for Storage
impl Serialize for Storage
source§fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
impl Eq for Storage
impl StructuralPartialEq for Storage
Auto Trait Implementations§
impl RefUnwindSafe for Storage
impl Send for Storage
impl Sync for Storage
impl Unpin for Storage
impl UnwindSafe for Storage
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.