Struct fixed_map::storage::OptionStorage [−][src]
pub struct OptionStorage<K, V> where
K: Key<K, V>, { /* fields omitted */ }Expand description
Storage for Option<T>s.
Trait Implementations
impl<K, V> Default for OptionStorage<K, V> where
K: Key<K, V>, [src]
impl<K, V> Default for OptionStorage<K, V> where
K: Key<K, V>, [src]impl<K, V> PartialEq<OptionStorage<K, V>> for OptionStorage<K, V> where
K: Key<K, V>,
K::Storage: PartialEq,
V: PartialEq, [src]
impl<K, V> PartialEq<OptionStorage<K, V>> for OptionStorage<K, V> where
K: Key<K, V>,
K::Storage: PartialEq,
V: PartialEq, [src]impl<K, V> Storage<Option<K>, V> for OptionStorage<K, V> where
K: Key<K, V>, [src]
impl<K, V> Storage<Option<K>, V> for OptionStorage<K, V> where
K: Key<K, V>, [src]type Iter = Iter<K, V>
type Iter = Iter<K, V>Immutable iterator over storage. Uses raw pointers (unsafe) since we don’t have GATs. Read more
type IterMut = IterMut<K, V>
type IterMut = IterMut<K, V>Mutable iterator over storage. Uses raw pointers (unsafe) since we don’t have GATs. Read more
fn insert(&mut self, key: Option<K>, value: V) -> Option<V>[src]
fn insert(&mut self, key: Option<K>, value: V) -> Option<V>[src]This is the storage abstraction for Map::insert.
fn get_mut(&mut self, key: Option<K>) -> Option<&mut V>[src]
fn get_mut(&mut self, key: Option<K>) -> Option<&mut V>[src]This is the storage abstraction for Map::get_mut.
fn remove(&mut self, key: Option<K>) -> Option<V>[src]
fn remove(&mut self, key: Option<K>) -> Option<V>[src]This is the storage abstraction for Map::remove.
fn clear(&mut self)[src]
fn clear(&mut self)[src]This is the storage abstraction for Map::clear.
fn iter_mut(&mut self) -> Self::IterMut[src]
fn iter_mut(&mut self) -> Self::IterMut[src]This is the storage abstraction for Map::iter_mut.
impl<K, V> Eq for OptionStorage<K, V> where
K: Key<K, V>,
K::Storage: Eq,
V: Eq, [src]
K: Key<K, V>,
K::Storage: Eq,
V: Eq,
Auto Trait Implementations
impl<K, V> RefUnwindSafe for OptionStorage<K, V> where
V: RefUnwindSafe,
<K as Key<K, V>>::Storage: RefUnwindSafe,
V: RefUnwindSafe,
<K as Key<K, V>>::Storage: RefUnwindSafe,
impl<K, V> Send for OptionStorage<K, V> where
V: Send,
<K as Key<K, V>>::Storage: Send,
V: Send,
<K as Key<K, V>>::Storage: Send,
impl<K, V> Sync for OptionStorage<K, V> where
V: Sync,
<K as Key<K, V>>::Storage: Sync,
V: Sync,
<K as Key<K, V>>::Storage: Sync,
impl<K, V> Unpin for OptionStorage<K, V> where
V: Unpin,
<K as Key<K, V>>::Storage: Unpin,
V: Unpin,
<K as Key<K, V>>::Storage: Unpin,
impl<K, V> UnwindSafe for OptionStorage<K, V> where
V: UnwindSafe,
<K as Key<K, V>>::Storage: UnwindSafe,
V: UnwindSafe,
<K as Key<K, V>>::Storage: UnwindSafe,
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> ToOwned for T where
T: Clone, [src]
impl<T> ToOwned for T where
T: Clone, [src]type Owned = T
type Owned = TThe resulting type after obtaining ownership.
pub fn to_owned(&self) -> T[src]
pub fn to_owned(&self) -> T[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)[src]
pub fn clone_into(&self, target: &mut T)[src]🔬 This is a nightly-only experimental API. (toowned_clone_into)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more