[−][src]Struct phf::Map
An immutable map constructed at compile time.
Note
The fields of this struct are public so that they may be initialized by the
phf_map!
macro and code generation. They are subject to change at any
time and should never be accessed directly.
Implementations
impl<K, V> Map<K, V>
[src]
pub fn is_empty(&self) -> bool
[src]
Returns true if the Map
is empty.
pub fn len(&self) -> usize
[src]
Returns the number of entries in the Map
.
pub fn contains_key<T: ?Sized>(&self, key: &T) -> bool where
T: Eq + PhfHash,
K: PhfBorrow<T>,
[src]
T: Eq + PhfHash,
K: PhfBorrow<T>,
Determines if key
is in the Map
.
pub fn get<T: ?Sized>(&self, key: &T) -> Option<&V> where
T: Eq + PhfHash,
K: PhfBorrow<T>,
[src]
T: Eq + PhfHash,
K: PhfBorrow<T>,
Returns a reference to the value that key
maps to.
pub fn get_key<T: ?Sized>(&self, key: &T) -> Option<&K> where
T: Eq + PhfHash,
K: PhfBorrow<T>,
[src]
T: Eq + PhfHash,
K: PhfBorrow<T>,
Returns a reference to the map's internal static instance of the given key.
This can be useful for interning schemes.
pub fn get_entry<T: ?Sized>(&self, key: &T) -> Option<(&K, &V)> where
T: Eq + PhfHash,
K: PhfBorrow<T>,
[src]
T: Eq + PhfHash,
K: PhfBorrow<T>,
Like get
, but returns both the key and the value.
pub fn entries(&self) -> Entries<'_, K, V>ⓘ
[src]
Returns an iterator over the key/value pairs in the map.
Entries are returned in an arbitrary but fixed order.
pub fn keys(&self) -> Keys<'_, K, V>ⓘ
[src]
Returns an iterator over the keys in the map.
Keys are returned in an arbitrary but fixed order.
pub fn values(&self) -> Values<'_, K, V>ⓘ
[src]
Returns an iterator over the values in the map.
Values are returned in an arbitrary but fixed order.
Trait Implementations
impl<K, V> Debug for Map<K, V> where
K: Debug,
V: Debug,
[src]
K: Debug,
V: Debug,
impl<'a, K, V, T: ?Sized> Index<&'a T> for Map<K, V> where
T: Eq + PhfHash,
K: PhfBorrow<T>,
[src]
T: Eq + PhfHash,
K: PhfBorrow<T>,
impl<'a, K, V> IntoIterator for &'a Map<K, V>
[src]
Auto Trait Implementations
impl<K, V> RefUnwindSafe for Map<K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for Map<K, V> where
K: Send + Sync,
V: Send + Sync,
K: Send + Sync,
V: Send + Sync,
impl<K, V> Sync for Map<K, V> where
K: Sync,
V: Sync,
K: Sync,
V: Sync,
impl<K, V> Unpin for Map<K, V> where
K: Unpin,
V: Unpin,
K: Unpin,
V: Unpin,
impl<K, V> UnwindSafe for Map<K, V> where
K: RefUnwindSafe + UnwindSafe,
V: RefUnwindSafe + UnwindSafe,
K: RefUnwindSafe + UnwindSafe,
V: RefUnwindSafe + UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,