Struct hashvec::HashVec

pub struct HashVec<K: Eq + Hash, V> { /* private fields */ }

Implementations

impl<K: Eq + Hash, V> HashVec<K, V>

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

Creates a new, empty map.

pub fn with_capacity(capacity: usize) -> HashVec<K, V>

Creates a new, empty hashvec with the specified capacity.

pub fn capacity(&self) -> usize

Returns the number of elements the hashvec can hold without reallocating.

pub fn is_empty(&self) -> bool

Returns true if the hashvec contains no elements.

pub fn clear(&mut self)

Clears the hashvec, removing all entries.

Keep in mind this will not reallocate memory.

pub fn insert(&mut self, k: K, v: V)

Inserts an entry into the hashvec, or replaces an existing one

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

Returns a reference to the value corresponding to the key, if it exists.

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

Returns a mutable reference to the value corresponding to the key, if it exists.

pub fn remove_entry(&mut self, k: K) -> Option<(K, V)>

Removes a key from the hashvec, returning the stored key and value if the key was previously in the hashvec.

pub fn index(&self, k: K) -> Option<usize>

Returns the index of the provided key, if the key exists.

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

Removes a key from the hashvec, returning the stored value if the key was previously in the hashvec.

Trait Implementations

impl<K: Debug + Eq + Hash, V: Debug> Debug for HashVec<K, V>

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

Formats the value using the given formatter.

impl<K: Eq + Hash, V> Index<usize> for HashVec<K, V>

type Output = (K, V)

The returned type after indexing.

fn index(&self, i: usize) -> &(K, V)

Performs the indexing (container[index]) operation.

impl<K: Eq + Hash, V> IndexMut<usize> for HashVec<K, V>

fn index_mut(&mut self, i: usize) -> &mut (K, V)

Performs the mutable indexing (container[index]) operation.

impl<'a, K: Eq + Hash, V> IntoIterator for &'a HashVec<K, V>

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

type IntoIter = HashVecIter<'a, K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.