Struct fyrox::asset::core::BiDirHashMap
source · pub struct BiDirHashMap<K, V> { /* private fields */ }Implementations§
source§impl<K, V> BiDirHashMap<K, V>where
K: Hash + Eq + Clone,
V: Hash + Eq + Clone,
impl<K, V> BiDirHashMap<K, V>where K: Hash + Eq + Clone, V: Hash + Eq + Clone,
pub fn insert(&mut self, key: K, value: V) -> Option<V>
pub fn remove_by_key(&mut self, key: &K) -> Option<V>
pub fn contains_key<Q>(&self, key: &Q) -> boolwhere K: Borrow<Q>, Q: Hash + Eq + ?Sized,
pub fn remove_by_value(&mut self, value: &V) -> Option<K>
pub fn contains_value<Q>(&self, value: &Q) -> boolwhere V: Borrow<Q>, Q: Hash + Eq + ?Sized,
pub fn value_of(&self, node: &K) -> Option<&V>
pub fn key_of(&self, value: &V) -> Option<&K>
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
pub fn clear(&mut self)
pub fn forward_map(&self) -> &HashMap<K, V, BuildHasherDefault<FxHasher>>
pub fn backward_map(&self) -> &HashMap<V, K, BuildHasherDefault<FxHasher>>
pub fn into_inner( self ) -> (HashMap<K, V, BuildHasherDefault<FxHasher>>, HashMap<V, K, BuildHasherDefault<FxHasher>>)
Trait Implementations§
source§impl<K, V> Clone for BiDirHashMap<K, V>where
K: Clone,
V: Clone,
impl<K, V> Clone for BiDirHashMap<K, V>where K: Clone, V: Clone,
source§fn clone(&self) -> BiDirHashMap<K, V>
fn clone(&self) -> BiDirHashMap<K, V>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moresource§impl<K, V> Default for BiDirHashMap<K, V>
impl<K, V> Default for BiDirHashMap<K, V>
source§fn default() -> BiDirHashMap<K, V>
fn default() -> BiDirHashMap<K, V>
Returns the “default value” for a type. Read more
source§impl<K, V> From<HashMap<K, V, BuildHasherDefault<FxHasher>>> for BiDirHashMap<K, V>where
K: Hash + Eq + Clone,
V: Hash + Eq + Clone,
impl<K, V> From<HashMap<K, V, BuildHasherDefault<FxHasher>>> for BiDirHashMap<K, V>where K: Hash + Eq + Clone, V: Hash + Eq + Clone,
source§fn from(
forward_map: HashMap<K, V, BuildHasherDefault<FxHasher>>
) -> BiDirHashMap<K, V>
fn from( forward_map: HashMap<K, V, BuildHasherDefault<FxHasher>> ) -> BiDirHashMap<K, V>
Converts to this type from the input type.
source§impl<K, V> FromIterator<(K, V)> for BiDirHashMap<K, V>where
K: Hash + Eq + Clone,
V: Hash + Eq + Clone,
impl<K, V> FromIterator<(K, V)> for BiDirHashMap<K, V>where K: Hash + Eq + Clone, V: Hash + Eq + Clone,
source§fn from_iter<T>(iter: T) -> BiDirHashMap<K, V>where
T: IntoIterator<Item = (K, V)>,
fn from_iter<T>(iter: T) -> BiDirHashMap<K, V>where T: IntoIterator<Item = (K, V)>,
Creates a value from an iterator. Read more
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§
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
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.source§impl<T> FieldValue for Twhere
T: 'static,
impl<T> FieldValue for Twhere T: 'static,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<T> ScriptMessagePayload for Twhere
T: 'static + Send,
impl<T> ScriptMessagePayload for Twhere T: 'static + Send,
source§fn as_any_ref(&self) -> &(dyn Any + 'static)
fn as_any_ref(&self) -> &(dyn Any + 'static)
Returns
self as &dyn Anysource§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Returns
self as &dyn Any§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.