Struct abstutil::collections::FixedMap

pub struct FixedMap<K: IndexableKey, V> {
    inner: Vec<Option<V>>,
    key_type: PhantomData<K>,
}

A drop-in replacement for BTreeMap, where the keys have the property of being array indices. Some values may be missing. Much more efficient at operations on individual objects, because it just becomes a simple array lookup.

Fields

inner: Vec<Option<V>>

key_type: PhantomData<K>

Implementations

impl<K: IndexableKey, V> FixedMap<K, V>

pub fn new() -> FixedMap<K, V>

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

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

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

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

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

pub fn values(&self) -> Flatten<Iter<'_, Option<V>>>

Trait Implementations

impl<K: Clone + IndexableKey, V: Clone> Clone for FixedMap<K, V>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: IndexableKey, V> Default for FixedMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, K: IndexableKey, V> Deserialize<'de> for FixedMap<K, V> where
    V: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<K: IndexableKey, V> Index<&'_ K> for FixedMap<K, V>

type Output = V

The returned type after indexing.

fn index(&self, key: &K) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<K: IndexableKey, V> Serialize for FixedMap<K, V> where
    V: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.