Struct HandleBitSet

pub struct HandleBitSet<T>
where
    T: Handled,
{ /* private fields */ }

An efficient set of handles.

This data-structure is an efficient implementation of a set of handles. Since handles actually represents integer indices, a set of handles can be represented by a vector of “is-present” bits. This implementation of a set of handles is based on such “bit-vectors”.

Implementations

impl<T> HandleBitSet<T>

where T: Handled,

pub fn new() -> Self

Creates a new, empty, set of handles.

pub fn contains(&self, handle: Handle<T>) -> bool

Checks whether a given handle is contained in the set.

pub fn insert(&mut self, handle: Handle<T>) -> bool

Insert a given handle to the set.

Returns true if the handle wasn’t previously in the set, and false otherwise.

pub fn union(&self, other: &Self) -> Self

Calculates the union of this set and another set of handles.

pub fn is_empty(&self) -> bool

Checks whether the set has no handles in it.

impl<T> HandleBitSet<T>

where T: Handled,

pub fn iter<'a>(&'a self) -> impl Iterator<Item = Handle<T>> + 'a

Get an iterator over the handles in the set.

Trait Implementations

impl<T> Clone for HandleBitSet<T>

where T: Handled,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for HandleBitSet<T>

where T: Handled,

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

Formats the value using the given formatter.

impl<'a, T> Extend<&'a Handle<T>> for HandleBitSet<T>

where T: Handled,

fn extend<I: IntoIterator<Item = &'a Handle<T>>>(&mut self, iter: I)

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<T> Extend<Handle<T>> for HandleBitSet<T>

where T: Handled,

fn extend<I: IntoIterator<Item = Handle<T>>>(&mut self, iter: I)

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<'a, T> FromIterator<&'a Handle<T>> for HandleBitSet<T>

where T: Handled,

fn from_iter<U>(iter: U) -> Self

where U: IntoIterator<Item = &'a Handle<T>>,

Creates a value from an iterator.

impl<T> FromIterator<Handle<T>> for HandleBitSet<T>

where T: Handled,

fn from_iter<U>(iter: U) -> Self

where U: IntoIterator<Item = Handle<T>>,

Creates a value from an iterator.

impl<T: Handled> Hash for HandleBitSet<T>

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

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, T> IntoIterator for &'a HandleBitSet<T>

where T: Handled,

type Item = Handle<T>

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for HandleBitSet<T>

where T: Handled,

type Item = Handle<T>

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> PartialEq for HandleBitSet<T>

where T: Handled,

fn eq(&self, other: &Self) -> 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<T: Handled> Eq for HandleBitSet<T>