Struct EntitySet

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

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.

Implementations

impl<K> EntitySet<K>

where K: EntityRef,

Shared EntitySet implementation for all value types.

pub fn new() -> EntitySet<K>

Create a new empty set.

pub fn with_capacity(capacity: usize) -> EntitySet<K>

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 clear(&mut self)

Remove all entries from this set.

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

Iterate over all the keys in this set.

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> Clone for EntitySet<K>

where K: Clone + EntityRef,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K> Debug for EntitySet<K>

where K: Debug + EntityRef,

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

Formats the value using the given formatter.

impl<K> Default for EntitySet<K>

where K: EntityRef,

fn default() -> EntitySet<K>

Returns the “default value” for a type.