Struct enso_flexer::prelude::weak_table::weak_key_hash_map::VacantEntry [−][src]
pub struct VacantEntry<'a, K, V>(_)
where
K: 'a + WeakKey,
V: 'a;
Expand description
A vacant entry, which can be inserted in or viewed.
Implementations
impl<'a, K, V> VacantEntry<'a, K, V> where
K: WeakKey,
[src]
impl<'a, K, V> VacantEntry<'a, K, V> where
K: WeakKey,
[src]pub fn key(&self) -> &<K as WeakElement>::Strong
[src]
pub fn key(&self) -> &<K as WeakElement>::Strong
[src]Gets a reference to the key that would be used when inserting a
value through the VacantEntry
.
pub fn into_key(self) -> <K as WeakElement>::Strong
[src]
pub fn into_key(self) -> <K as WeakElement>::Strong
[src]Returns ownership of the key.
Trait Implementations
Auto Trait Implementations
impl<'a, K, V> RefUnwindSafe for VacantEntry<'a, K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
<K as WeakElement>::Strong: RefUnwindSafe,
K: RefUnwindSafe,
V: RefUnwindSafe,
<K as WeakElement>::Strong: RefUnwindSafe,
impl<'a, K, V> Send for VacantEntry<'a, K, V> where
K: Send,
V: Send,
<K as WeakElement>::Strong: Send,
K: Send,
V: Send,
<K as WeakElement>::Strong: Send,
impl<'a, K, V> Sync for VacantEntry<'a, K, V> where
K: Sync,
V: Sync,
<K as WeakElement>::Strong: Sync,
K: Sync,
V: Sync,
<K as WeakElement>::Strong: Sync,
impl<'a, K, V> Unpin for VacantEntry<'a, K, V> where
<K as WeakElement>::Strong: Unpin,
<K as WeakElement>::Strong: Unpin,
impl<'a, K, V> !UnwindSafe for VacantEntry<'a, K, V>
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> HasRefValue for T where
T: ?Sized,
[src]
impl<T> HasRefValue for T where
T: ?Sized,
[src]type RefValue = T
impl<T> PhantomConversions for T
[src]
impl<T> PhantomConversions for T
[src]fn phantom_into<P>() -> P where
Self: PhantomInto<P>,
[src]
Self: PhantomInto<P>,
fn phantom_from<P>() -> Self where
P: PhantomInto<Self>,
[src]
P: PhantomInto<Self>,
impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
pub fn to_subset(&self) -> Option<SS>
pub fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
impl<T> TypeDisplay for T
[src]
impl<T> TypeDisplay for T
[src]pub default fn type_display() -> String
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
pub fn vzip(self) -> V
impl<T> Writer for T
[src]
impl<T> Writer for T
[src]pub default fn write_by_level(&self, message: &Array)
[src]
pub default fn write_by_level(&self, message: &Array)
[src]Write message using the appropriate console method.