Struct style::selector_map::MaybeCaseInsensitiveHashMap

pub struct MaybeCaseInsensitiveHashMap<K: PrecomputedHash + Hash + Eq, V: 'static>(_);

Wrapper for PrecomputedHashMap that does ASCII-case-insensitive lookup in quirks mode.

Methods

impl<V: 'static> MaybeCaseInsensitiveHashMap<Atom, V>

pub fn new() -> Self

Empty map

pub fn entry(&mut self, key: Atom, quirks_mode: QuirksMode) -> Entry<Atom, V>

HashMap::entry

pub fn try_entry(
    &mut self,
    key: Atom,
    quirks_mode: QuirksMode
) -> Result<Entry<Atom, V>, FailedAllocationError>

HashMap::try_entry

Important traits for Iter<'a, K, V>

impl<'a, K, V> Iterator for Iter<'a, K, V> type Item = (&'a K, &'a V);

pub fn iter(&self) -> Iter<Atom, V>

HashMap::iter

pub fn clear(&mut self)

HashMap::clear

pub fn get(&self, key: &Atom, quirks_mode: QuirksMode) -> Option<&V>

HashMap::get

Trait Implementations

impl<K: Debug + PrecomputedHash + Hash + Eq, V: Debug + 'static> Debug for MaybeCaseInsensitiveHashMap<K, V>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<K: PrecomputedHash + Hash + Eq, V: 'static> MallocSizeOf for MaybeCaseInsensitiveHashMap<K, V> where
    K: MallocSizeOf,
    V: MallocSizeOf, 

fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself.