Struct rg3d_core::BiDirHashMap [−][src]
pub struct BiDirHashMap<K, V> { /* fields omitted */ }
Implementations
Trait Implementations
Auto Trait Implementations
impl<K, V> RefUnwindSafe for BiDirHashMap<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for BiDirHashMap<K, V> where
K: Send,
V: Send,
impl<K, V> Sync for BiDirHashMap<K, V> where
K: Sync,
V: Sync,
impl<K, V> Unpin for BiDirHashMap<K, V> where
K: Unpin,
V: Unpin,
impl<K, V> UnwindSafe for BiDirHashMap<K, V> where
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
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.