A set of
K for densely indexed entity references.
EntitySet data structure uses the dense index space to implement a set with a bitvector.
EntitySet is used to associate secondary information with entities.
EntitySet implementation for all value types.
Create a new empty set.
pub fn with_capacity(capacity: usize) -> Self[src]
Creates a new empty set with the specified capacity.
Get the element at
k if it exists.
Is this set completely empty?
pub fn cardinality(&self) -> usize[src]
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
Remove all entries from this set.
Iterate over all the keys in this set.
Resize the set to have
n entries by adding default entries as needed.
Insert the element at
Removes and returns the entity from the set if it exists.
type Owned = T
The resulting type after obtaining ownership.
fn clone_into(&self, target: &mut T)[src]
type Error = Infallible
The type returned in the event of a conversion error.