Struct ComponentIdSet 

pub struct ComponentIdSet(/* private fields */);

A set of ComponentIds.

Implementations

impl ComponentIdSet

pub const fn new() -> ComponentIdSet

Create a new empty ComponentIdSet.

pub fn insert(&mut self, index: ComponentId)

Adds a ComponentId to the set.

pub fn remove(&mut self, index: ComponentId)

Removes a ComponentId from the set.

pub fn clear(&mut self)

Removes all ComponentIds from the set.

pub fn contains(&self, index: ComponentId) -> bool

Returns true if the ComponentId is in the set.

pub fn is_disjoint(&self, other: &ComponentIdSet) -> bool

Returns true if self has no elements in common with other. This is equivalent to checking for an empty intersection.

pub fn is_subset(&self, other: &ComponentIdSet) -> bool

Returns true if the set is a subset of another, i.e. other contains at least all the values in self.

pub fn is_clear(&self) -> bool

Returns true if the set is empty.

pub fn iter(&self) -> ComponentIdIter<Ones<'_>>

Iterates the ComponentIds in the set.

pub fn union<'a>( &'a self, other: &'a ComponentIdSet, ) -> ComponentIdIter<Union<'a>>

Returns a lazy iterator over the union of two ComponentIdSets.

pub fn intersection<'a>( &'a self, other: &'a ComponentIdSet, ) -> ComponentIdIter<Intersection<'a>>

Returns a lazy iterator over the intersection of two ComponentIdSets.

pub fn difference<'a>( &'a self, other: &'a ComponentIdSet, ) -> ComponentIdIter<Difference<'a>>

Returns a lazy iterator over the difference of two ComponentIdSets.

pub fn union_with(&mut self, other: &ComponentIdSet)

In-place union of two ComponentIdSets.

pub fn intersect_with(&mut self, other: &ComponentIdSet)

In-place intersection of two ComponentIdSets.

pub fn difference_with(&mut self, other: &ComponentIdSet)

In-place difference of two ComponentIdSets.

pub fn difference_from(&mut self, other: &ComponentIdSet)

In-place reversed difference of two ComponentIdSets. This sets self to be other.difference(self).

Trait Implementations

impl Clone for ComponentIdSet

fn clone(&self) -> ComponentIdSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ComponentIdSet

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

Formats the value using the given formatter.

impl Default for ComponentIdSet

fn default() -> ComponentIdSet

Returns the “default value” for a type.

impl Extend<ComponentId> for ComponentIdSet

fn extend<T>(&mut self, iter: T)

where T: IntoIterator<Item = ComponentId>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl From<ComponentIdSet> for AccessConflicts

fn from(value: ComponentIdSet) -> AccessConflicts

Converts to this type from the input type.

impl FromIterator<ComponentId> for ComponentIdSet

fn from_iter<T>(iter: T) -> ComponentIdSet

where T: IntoIterator<Item = ComponentId>,

Creates a value from an iterator.

impl Hash for ComponentIdSet

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a> IntoIterator for &'a ComponentIdSet

type Item = ComponentId

The type of the elements being iterated over.

type IntoIter = ComponentIdIter<Ones<'a>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a ComponentIdSet as IntoIterator>::IntoIter

Creates an iterator from a value.

impl IntoIterator for ComponentIdSet

type Item = ComponentId

The type of the elements being iterated over.

type IntoIter = ComponentIdIter<IntoOnes>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <ComponentIdSet as IntoIterator>::IntoIter

Creates an iterator from a value.

impl PartialEq for ComponentIdSet

fn eq(&self, other: &ComponentIdSet) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for ComponentIdSet

impl StructuralPartialEq for ComponentIdSet