pub struct EntryBuilder<'a, K, T, IK>{ /* private fields */ }Expand description
Implementations§
Source§impl<'a, K, T, IK> EntryBuilder<'a, K, T, IK>
impl<'a, K, T, IK> EntryBuilder<'a, K, T, IK>
Sourcepub fn and_extend(self, default: impl IntoIterator<Item = T>) -> Entry<'a, K, T>
pub fn and_extend(self, default: impl IntoIterator<Item = T>) -> Entry<'a, K, T>
Extends the entry, creating it if needed
Sourcepub fn and_insert(self, default: T) -> Entry<'a, K, T>
pub fn and_insert(self, default: T) -> Entry<'a, K, T>
Inserts into the entry, creating it if needed
Sourcepub fn or_extend(self, default: impl IntoIterator<Item = T>) -> Entry<'a, K, T>
pub fn or_extend(self, default: impl IntoIterator<Item = T>) -> Entry<'a, K, T>
Finds the entry, and if it does not exist, extends with the provided value.
Sourcepub fn or_insert(self, default: T) -> Entry<'a, K, T>
pub fn or_insert(self, default: T) -> Entry<'a, K, T>
Finds the entry, and if it does not exist, inserts the value.
Sourcepub fn or_create(self) -> Entry<'a, K, T>
pub fn or_create(self) -> Entry<'a, K, T>
Finds the entry, and if it does not exist, creates it.
Sourcepub fn find(self) -> Option<ExistingEntry<'a, K, T>>
pub fn find(self) -> Option<ExistingEntry<'a, K, T>>
Finds the entry, but does not create one. This method short circuits on the first missing key.
Auto Trait Implementations§
impl<'a, K, T, IK> Freeze for EntryBuilder<'a, K, T, IK>where
IK: Freeze,
impl<'a, K, T, IK> RefUnwindSafe for EntryBuilder<'a, K, T, IK>
impl<'a, K, T, IK> Send for EntryBuilder<'a, K, T, IK>
impl<'a, K, T, IK> Sync for EntryBuilder<'a, K, T, IK>
impl<'a, K, T, IK> Unpin for EntryBuilder<'a, K, T, IK>where
IK: Unpin,
impl<'a, K, T, IK> !UnwindSafe for EntryBuilder<'a, K, T, IK>
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