Struct cranelift_entity::EntitySet

pub struct EntitySet<K> where
    K: EntityRef,  { /* fields omitted */ }

A set of K for densely indexed entity references.

The EntitySet data structure uses the dense index space to implement a set with a bitvector. Like SecondaryMap, an EntitySet is used to associate secondary information with entities.

Methods

impl<K> EntitySet<K> where
    K: EntityRef, 

Shared EntitySet implementation for all value types.

pub fn new() -> Self

Create a new empty set.

pub fn with_capacity(capacity: usize) -> Self

Creates a new empty set with the specified capacity.

pub fn contains(&self, k: K) -> bool

Get the element at k if it exists.

pub fn is_empty(&self) -> bool

Is this set completely empty?

pub fn cardinality(&self) -> usize

Returns the cardinality of the set. More precisely, it returns the number of calls to insert with different key values, that have happened since the the set was most recently cleared or created with new.

pub fn clear(&mut self)

Remove all entries from this set.

Important traits for Keys<K>

impl<K: EntityRef> Iterator for Keys<K> type Item = K;

pub fn keys(&self) -> Keys<K>

Iterate over all the keys in this set.

pub fn resize(&mut self, n: usize)

Resize the set to have n entries by adding default entries as needed.

pub fn insert(&mut self, k: K) -> bool

Insert the element at k.

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

Removes and returns the entity from the set if it exists.

Trait Implementations

impl<K: Debug> Debug for EntitySet<K> where
    K: EntityRef, 

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

Formats the value using the given formatter.

impl<K: Clone> Clone for EntitySet<K> where
    K: EntityRef, 

fn clone(&self) -> EntitySet<K>

Returns a copy of the value.

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

Performs copy-assignment from source.