Struct Map

pub struct Map<K: Ord, V> {
    pub values: Vec<V>,
    pub map: BTreeMap<K, usize>,
}

An insert-only mapping where the data is stored in an internal vector.

Fields

values: Vec<V>

Values vector containing the actual values.

map: BTreeMap<K, usize>

Map of keys to positions in the values vector.

Implementations

impl<K: Ord, V> Map<K, V>

pub fn insert(&mut self, key: K, value: V) -> Result<usize, V>

Insert a new value into the map, returning the attempted value as an error if it was already occupied.

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

Get a reference to an entry.

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

Get a mutable reference to an entry.

Trait Implementations

impl<K: Clone + Ord, V: Clone> Clone for Map<K, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Ord, V: Debug> Debug for Map<K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K: Ord, V> Default for Map<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K: PartialEq + Ord, V: PartialEq> PartialEq for Map<K, V>

fn eq(&self, other: &Map<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: Ord, V> StructuralPartialEq for Map<K, V>