Struct style::custom_properties::OrderedMap

pub struct OrderedMap<K, V> where
    K: PrecomputedHash + Hash + Eq + Clone,  { /* fields omitted */ }

A map that preserves order for the keys, and that is easily indexable.

Methods

impl<K, V> OrderedMap<K, V> where
    K: Eq + PrecomputedHash + Hash + Clone, 

pub fn new() -> Self

Creates a new ordered map.

pub fn insert(&mut self, key: K, value: V)

Insert a new key-value pair.

pub fn get(&self, key: &K) -> Option<&V>

Get a value given its key.

pub fn contains_key(&self, key: &K) -> bool

Get whether there's a value on the map for key.

pub fn get_key_at(&self, index: u32) -> Option<&K>

Get the key located at the given index.

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

impl<'a, K, V> Iterator for OrderedMapIterator<'a, K, V> where
    K: Eq + PrecomputedHash + Hash + Clone,  type Item = (&'a K, &'a V);

pub fn iter<'a>(&'a self) -> OrderedMapIterator<'a, K, V>

Get an ordered map iterator.

pub fn len(&self) -> usize

Get the count of items in the map.

pub fn is_empty(&self) -> bool

Returns whether this map is empty.

Trait Implementations

impl<K: Clone, V: Clone> Clone for OrderedMap<K, V> where
    K: PrecomputedHash + Hash + Eq + Clone, 

fn clone(&self) -> OrderedMap<K, V>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for OrderedMap<K, V> where
    K: PrecomputedHash + Hash + Eq + Clone, 

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

Formats the value using the given formatter.

impl<K: Eq, V: Eq> Eq for OrderedMap<K, V> where
    K: PrecomputedHash + Hash + Eq + Clone, 

impl<K: PartialEq, V: PartialEq> PartialEq for OrderedMap<K, V> where
    K: PrecomputedHash + Hash + Eq + Clone, 

fn eq(&self, __arg_0: &OrderedMap<K, V>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &OrderedMap<K, V>) -> bool

This method tests for !=.