Type Alias cranelift_entity::SparseSet

pub type SparseSet<T> = SparseMap<T, T>;

A sparse set of entity references.

Any type that implements EntityRef can be used as a sparse set value too.

Aliased Type

struct SparseSet<T> { /* private fields */ }

Implementations

impl<K, V> SparseMap<K, V>where K: EntityRef, V: SparseMapValue<K>,

pub fn new() -> Self

Create a new empty mapping.

pub fn len(&self) -> usize

Returns the number of elements in the map.

pub fn is_empty(&self) -> bool

Returns true is the map contains no elements.

pub fn clear(&mut self)

Remove all elements from the mapping.

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

Returns a reference to the value corresponding to the key.

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

Returns a mutable reference to the value corresponding to the key.

Note that the returned value must not be mutated in a way that would change its key. This would invalidate the sparse set data structure.

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

Return true if the map contains a value corresponding to key.

pub fn insert(&mut self, value: V) -> Option<V>

Insert a value into the map.

If the map did not have this key present, None is returned.

If the map did have this key present, the value is updated, and the old value is returned.

It is not necessary to provide a key since the value knows its own key already.

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

Remove a value from the map and return it.

pub fn pop(&mut self) -> Option<V>

Remove the last value from the map.

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

Get an iterator over the values in the map.

The iteration order is entirely determined by the preceding sequence of insert and remove operations. In particular, if no elements were removed, this is the insertion order.

pub fn as_slice(&self) -> &[V]

Get the values as a slice.