Struct HandleSet 

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

A set of handle IDs, represented as a bitset.

Supports up to 64 handles. Construct via HandleId operators:

let set = imu | gps | lidar;  // HandleSet from 3 handles

Implementations

impl HandleSet

pub const EMPTY: Self

Empty set.

pub const fn insert(self, id: HandleId) -> Self

Insert a handle into the set.

pub const fn contains(self, id: HandleId) -> bool

Check if the set contains a handle.

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

Union of two sets.

pub const fn len(self) -> u32

Number of handles in the set.

pub const fn is_empty(self) -> bool

Check if the set is empty.

Trait Implementations

impl BitOr<HandleId> for HandleSet

type Output = HandleSet

The resulting type after applying the | operator.

fn bitor(self, rhs: HandleId) -> HandleSet

Performs the | operation.

impl BitOr for HandleSet

type Output = HandleSet

The resulting type after applying the | operator.

fn bitor(self, rhs: HandleSet) -> HandleSet

Performs the | operation.

impl Clone for HandleSet

fn clone(&self) -> HandleSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HandleSet

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

Formats the value using the given formatter.

impl Default for HandleSet

fn default() -> HandleSet

Returns the “default value” for a type.

impl PartialEq for HandleSet

fn eq(&self, other: &HandleSet) -> 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 Copy for HandleSet

impl Eq for HandleSet

impl StructuralPartialEq for HandleSet