pub struct HasEntry<K, V> { /* private fields */ }
Expand description
Matches if the map-like collection contains the given key/value pair.
The Matcher
tests for this by converting the map-like data structure
into a key/value pair iterator.
The alternative would be to use the Index trait though experiments showed
that this would not be composable with all_of!
or any_of!
.
Trait Implementations§
Auto Trait Implementations§
impl<K, V> Freeze for HasEntry<K, V>
impl<K, V> RefUnwindSafe for HasEntry<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for HasEntry<K, V>
impl<K, V> Sync for HasEntry<K, V>
impl<K, V> Unpin for HasEntry<K, V>
impl<K, V> UnwindSafe for HasEntry<K, V>where
K: UnwindSafe,
V: UnwindSafe,
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
Mutably borrows from an owned value. Read more