Struct iron::typemap::TypeMap
[−]
[src]
pub struct TypeMap<A = UnsafeAny + 'static> where A: UnsafeAnyExt + ?Sized {
// some fields omitted
}
A map keyed by types.
Can contain one value of any type for each key type, as defined by the Assoc trait.
You usually do not need to worry about the A type parameter, but it
can be used to add bounds to the possible value types that can
be stored in this map. Usually, you are looking for ShareMap
, which
is Send + Sync
.
Methods
impl TypeMap<UnsafeAny + 'static>
impl<A> TypeMap<A> where A: UnsafeAnyExt + ?Sized
fn custom() -> TypeMap<A>
Create a new, empty TypeMap.
Can be used with any A
parameter; new
is specialized to get around
the required type annotations when using this function.
fn insert<K>(&mut self, val: K::Value) -> Option<K::Value> where K: Key, K::Value: Any, K::Value: Implements<A>
Insert a value into the map with a specified key type.
fn get<K>(&self) -> Option<&K::Value> where K: Key, K::Value: Any, K::Value: Implements<A>
Find a value in the map and get a reference to it.
fn get_mut<K>(&mut self) -> Option<&mut K::Value> where K: Key, K::Value: Any, K::Value: Implements<A>
Find a value in the map and get a mutable reference to it.
fn contains<K>(&self) -> bool where K: Key
Check if a key has an associated value stored in the map.
fn remove<K>(&mut self) -> Option<K::Value> where K: Key, K::Value: Any, K::Value: Implements<A>
Remove a value from the map.
Returns true
if a value was removed.
fn entry<K>(&'a mut self) -> Entry<'a, K, A> where K: Key, K::Value: Any, K::Value: Implements<A>
Get the given key's corresponding entry in the map for in-place manipulation.
unsafe fn data(&self) -> &HashMap<TypeId, Box<A>, RandomState>
Read the underlying HashMap
unsafe fn data_mut(&mut self) -> &mut HashMap<TypeId, Box<A>, RandomState>
Get a mutable reference to the underlying HashMap
fn len(&self) -> usize
Get the number of values stored in the map.
fn is_empty(&self) -> bool
Return true if the map contains no values.
fn clear(&mut self)
Remove all entries from the map.