[−][src]Enum ordermap::Entry
Entry for an existing key-value pair or a vacant location to insert one.
FIXME: Remove dependence on the S
parameter
(to match HashMap).
Variants
Occupied(OccupiedEntry<'a, K, V, S>)
Existing slot with equivalent key.
Vacant(VacantEntry<'a, K, V, S>)
Vacant slot (no equivalent key in the map).
Implementations
impl<'a, K, V, S> Entry<'a, K, V, S>
[src]
pub fn or_insert(self, default: V) -> &'a mut V
[src]
Computes in O(1) time (amortized average).
pub fn or_insert_with<F>(self, call: F) -> &'a mut V where
F: FnOnce() -> V,
[src]
F: FnOnce() -> V,
Computes in O(1) time (amortized average).
pub fn key(&self) -> &K
[src]
pub fn index(&self) -> usize
[src]
Return the index where the key-value pair exists or will be inserted.
Auto Trait Implementations
impl<'a, K, V, S> RefUnwindSafe for Entry<'a, K, V, S> where
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
impl<'a, K, V, S> Send for Entry<'a, K, V, S> where
K: Send,
S: Send,
V: Send,
K: Send,
S: Send,
V: Send,
impl<'a, K, V, S> Sync for Entry<'a, K, V, S> where
K: Sync,
S: Sync,
V: Sync,
K: Sync,
S: Sync,
V: Sync,
impl<'a, K, V, S> Unpin for Entry<'a, K, V, S> where
K: Unpin,
K: Unpin,
impl<'a, K, V, S = RandomState> !UnwindSafe for Entry<'a, K, V, S>
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
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, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,