Struct cretonne_entity::EntitySet [−][src]
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 EntityMap
, an EntitySet
is used to associate secondary information with entities.
Methods
impl<K> EntitySet<K> where
K: EntityRef,
[src]
impl<K> EntitySet<K> where
K: EntityRef,
Shared EntitySet
implementation for all value types.
pub fn new() -> Self
[src]
pub fn new() -> Self
Create a new empty set.
pub fn contains(&self, k: K) -> bool
[src]
pub fn contains(&self, k: K) -> bool
Get the element at k
if it exists.
pub fn is_empty(&self) -> bool
[src]
pub fn is_empty(&self) -> bool
Is this set completely empty?
pub fn clear(&mut self)
[src]
pub fn clear(&mut self)
Remove all entries from this set.
ⓘImportant traits for Keys<K>pub fn keys(&self) -> Keys<K>
[src]
ⓘImportant traits for Keys<K>
pub fn keys(&self) -> Keys<K>
Iterate over all the keys in this set.
pub fn resize(&mut self, n: usize)
[src]
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
[src]
pub fn insert(&mut self, k: K) -> bool
Insert the element at k
.
Trait Implementations
impl<K: Debug> Debug for EntitySet<K> where
K: EntityRef,
[src]
impl<K: Debug> Debug for EntitySet<K> where
K: EntityRef,
fn fmt(&self, f: &mut Formatter) -> Result
[src]
fn fmt(&self, f: &mut Formatter) -> Result
Formats the value using the given formatter. Read more
impl<K: Clone> Clone for EntitySet<K> where
K: EntityRef,
[src]
impl<K: Clone> Clone for EntitySet<K> where
K: EntityRef,