Struct FreeHashMap 

pub struct FreeHashMap<K: NextKey, T> { /* private fields */ }

A HashMap that reuses freed IDs for new entries.

Implementations

impl<K: NextKey, T> FreeHashMap<K, T>

pub fn new() -> Self

pub fn clear(&mut self)

pub fn add(&mut self, value: T) -> K

Adds a new entry and returns its unique ID.

pub fn has_value(&self, value: &T) -> bool

where T: PartialEq,

Checks if a value exists in the map.

pub fn get_id(&self, value: &T) -> Option<K>

where T: PartialEq,

Returns the ID of a given value, if it exists.

pub fn len(&self) -> usize

Returns the number of entries in the map.

pub fn is_empty(&self) -> bool

pub fn has(&self, id: &K) -> bool

Checks if an entry with the given ID exists.

pub fn remove(&mut self, id: K) -> Option<T>

Removes the entry with the given ID, if it exists.

pub fn get(&self, id: &K) -> Option<&T>

Get a reference to an entry.

pub fn get_mut(&mut self, id: &K) -> Option<&mut T>

Get a mutable reference to an entry.

pub fn values(&self) -> impl Iterator<Item = &T>

pub fn values_mut(&mut self) -> impl Iterator<Item = &mut T>

pub fn keys(&self) -> impl Iterator<Item = &K>

pub fn iter(&self) -> Iter<'_, K, T>

pub fn iter_mut(&mut self) -> IterMut<'_, K, T>

Trait Implementations

impl<K: NextKey, T> Default for FreeHashMap<K, T>

fn default() -> Self

Returns the “default value” for a type.

impl<'a, K: NextKey, T> IntoIterator for &'a FreeHashMap<K, T>

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

The type of the elements being iterated over.

type IntoIter = Iter<'a, K, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, K: NextKey, T> IntoIterator for &'a mut FreeHashMap<K, T>

type Item = (&'a K, &'a mut T)

The type of the elements being iterated over.

type IntoIter = IterMut<'a, K, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: NextKey, T> IntoIterator for FreeHashMap<K, T>

type Item = (K, T)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.