pub enum OccupiedEntryMut<'a, T: BiHashItem, S: Clone + BuildHasher = DefaultHashBuilder> {
Unique(RefMut<'a, T, S>),
NonUnique {
by_key1: Option<RefMut<'a, T, S>>,
by_key2: Option<RefMut<'a, T, S>>,
},
}
Expand description
A mutable view into an occupied entry in a BiHashMap
.
Returned by OccupiedEntry::get_mut
.
Variants§
Unique(RefMut<'a, T, S>)
All keys point to the same entry.
NonUnique
The keys point to different entries, or some keys are not present.
Implementations§
Source§impl<'a, T: BiHashItem, S: Clone + BuildHasher> OccupiedEntryMut<'a, T, S>
impl<'a, T: BiHashItem, S: Clone + BuildHasher> OccupiedEntryMut<'a, T, S>
Sourcepub fn is_non_unique(&self) -> bool
pub fn is_non_unique(&self) -> bool
Returns true if the OccupiedEntryMut
represents more than one item, or
if some keys are not present.
Sourcepub fn as_unique(&mut self) -> Option<RefMut<'_, T, S>>
pub fn as_unique(&mut self) -> Option<RefMut<'_, T, S>>
Returns a reference to the value if it is unique.
Sourcepub fn by_key1(&mut self) -> Option<RefMut<'_, T, S>>
pub fn by_key1(&mut self) -> Option<RefMut<'_, T, S>>
Returns a mutable reference to the value fetched by the first key.
Trait Implementations§
Source§impl<'a, T: BiHashItem + Debug, S: Clone + BuildHasher> Debug for OccupiedEntryMut<'a, T, S>
impl<'a, T: BiHashItem + Debug, S: Clone + BuildHasher> Debug for OccupiedEntryMut<'a, T, S>
Auto Trait Implementations§
impl<'a, T, S> Freeze for OccupiedEntryMut<'a, T, S>where
S: Freeze,
impl<'a, T, S> RefUnwindSafe for OccupiedEntryMut<'a, T, S>where
T: RefUnwindSafe,
S: RefUnwindSafe,
impl<'a, T, S> Send for OccupiedEntryMut<'a, T, S>
impl<'a, T, S> Sync for OccupiedEntryMut<'a, T, S>
impl<'a, T, S> Unpin for OccupiedEntryMut<'a, T, S>where
S: Unpin,
impl<'a, T, S = RandomState> !UnwindSafe for OccupiedEntryMut<'a, T, S>
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