Struct oxygengine_core::ecs::hibitset::BitSetAnd

pub struct BitSetAnd<A, B>(pub A, pub B)
 where
    A: BitSetLike,
    B: BitSetLike;

BitSetAnd takes two BitSetLike items, and merges the masks returning a new virtual set, which represents an intersection of the two original sets.

Trait Implementations

impl<'a, A, B, T> BitAnd<T> for &'a BitSetAnd<A, B> where
    T: BitSetLike,
    A: BitSetLike,
    B: BitSetLike, 

type Output = BitSetAnd<&'a BitSetAnd<A, B>, T>

The resulting type after applying the & operator.

pub fn bitand(self, rhs: T) -> <&'a BitSetAnd<A, B> as BitAnd<T>>::Output

Performs the & operation.

impl<A, B, T> BitAnd<T> for BitSetAnd<A, B> where
    T: BitSetLike,
    A: BitSetLike,
    B: BitSetLike, 

type Output = BitSetAnd<BitSetAnd<A, B>, T>

The resulting type after applying the & operator.

pub fn bitand(self, rhs: T) -> <BitSetAnd<A, B> as BitAnd<T>>::Output

Performs the & operation.

impl<A, B, T> BitOr<T> for BitSetAnd<A, B> where
    T: BitSetLike,
    A: BitSetLike,
    B: BitSetLike, 

type Output = BitSetOr<BitSetAnd<A, B>, T>

The resulting type after applying the | operator.

pub fn bitor(self, rhs: T) -> <BitSetAnd<A, B> as BitOr<T>>::Output

Performs the | operation.

impl<'a, A, B, T> BitOr<T> for &'a BitSetAnd<A, B> where
    T: BitSetLike,
    A: BitSetLike,
    B: BitSetLike, 

type Output = BitSetOr<&'a BitSetAnd<A, B>, T>

The resulting type after applying the | operator.

pub fn bitor(self, rhs: T) -> <&'a BitSetAnd<A, B> as BitOr<T>>::Output

Performs the | operation.

impl<A, B> BitSetLike for BitSetAnd<A, B> where
    A: BitSetLike,
    B: BitSetLike, 

pub fn layer3(&self) -> usize

Return a usize where each bit represents if any word in layer2 has been set.

pub fn layer2(&self, i: usize) -> usize

Return the usize from the array of usizes that indicates if any bit has been set in layer1

pub fn layer1(&self, i: usize) -> usize

Return the usize from the array of usizes that indicates if any bit has been set in layer0

pub fn layer0(&self, i: usize) -> usize

Return a usize that maps to the direct 1:1 association with each index of the set

pub fn contains(&self, i: u32) -> bool

Allows checking if set bit is contained in the bit set.

pub fn get_from_layer(&self, layer: usize, idx: usize) -> usize

Gets the usize corresponding to layer and index.

pub fn is_empty(&self) -> bool

Returns true if this BitSetLike contains nothing, and false otherwise.

pub fn iter(self) -> BitIter<Self>

Create an iterator that will scan over the keyspace

impl<'a, A, B, T> BitXor<T> for &'a BitSetAnd<A, B> where
    T: BitSetLike,
    A: BitSetLike,
    B: BitSetLike, 

type Output = BitSetXor<&'a BitSetAnd<A, B>, T>

The resulting type after applying the ^ operator.

pub fn bitxor(self, rhs: T) -> <&'a BitSetAnd<A, B> as BitXor<T>>::Output

Performs the ^ operation.

impl<A, B, T> BitXor<T> for BitSetAnd<A, B> where
    T: BitSetLike,
    A: BitSetLike,
    B: BitSetLike, 

type Output = BitSetXor<BitSetAnd<A, B>, T>

The resulting type after applying the ^ operator.

pub fn bitxor(self, rhs: T) -> <BitSetAnd<A, B> as BitXor<T>>::Output

Performs the ^ operation.

impl<A, B> Clone for BitSetAnd<A, B> where
    A: Clone + BitSetLike,
    B: Clone + BitSetLike, 

pub fn clone(&self) -> BitSetAnd<A, B>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A, B> Debug for BitSetAnd<A, B> where
    A: Debug + BitSetLike,
    B: Debug + BitSetLike, 

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

Formats the value using the given formatter.

impl<A, B> DrainableBitSet for BitSetAnd<A, B> where
    A: DrainableBitSet,
    B: DrainableBitSet, 

pub fn remove(&mut self, i: u32) -> bool

Removes bit from the bit set.

pub fn drain(&'a mut self) -> DrainBitIter<'a, Self>

Create a draining iterator that will scan over the keyspace and clears it while doing so.

impl<'a, A, B> IntoIterator for &'a BitSetAnd<A, B> where
    A: BitSetLike,
    B: BitSetLike, 

type Item = <BitIter<&'a BitSetAnd<A, B>> as Iterator>::Item

The type of the elements being iterated over.

type IntoIter = BitIter<&'a BitSetAnd<A, B>>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> <&'a BitSetAnd<A, B> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<A, B> IntoIterator for BitSetAnd<A, B> where
    A: BitSetLike,
    B: BitSetLike, 

type Item = <BitIter<BitSetAnd<A, B>> as Iterator>::Item

The type of the elements being iterated over.

type IntoIter = BitIter<BitSetAnd<A, B>>

Which kind of iterator are we turning this into?

pub fn into_iter(self) -> <BitSetAnd<A, B> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a, A, B> Join for &'a BitSetAnd<A, B> where
    A: BitSetLike,
    B: BitSetLike, 

type Type = u32

Type of joined components.

type Value = ()

Type of joined storages.

type Mask = &'a BitSetAnd<A, B>

Type of joined bit mask.

pub unsafe fn open(
    self
) -> (<&'a BitSetAnd<A, B> as Join>::Mask, <&'a BitSetAnd<A, B> as Join>::Value)

Open this join by returning the mask and the storages.

pub unsafe fn get(
    &mut <&'a BitSetAnd<A, B> as Join>::Value,
    id: u32
) -> <&'a BitSetAnd<A, B> as Join>::Type

Get a joined component value by a given index.

pub fn join(self) -> JoinIter<Self>

Create a joined iterator over the contents.

pub fn maybe(self) -> MaybeJoin<Self>

Returns a Join-able structure that yields all indices, returning None for all missing elements and Some(T) for found elements.

pub fn is_unconstrained() -> bool

If this Join typically returns all indices in the mask, then iterating over only it or combined with other joins that are also dangerous will cause the JoinIter/ParJoin to go through all indices which is usually not what is wanted and will kill performance.

impl<A, B> Join for BitSetAnd<A, B> where
    A: BitSetLike,
    B: BitSetLike, 

type Type = u32

Type of joined components.

type Value = ()

Type of joined storages.

type Mask = BitSetAnd<A, B>

Type of joined bit mask.

pub unsafe fn open(
    self
) -> (<BitSetAnd<A, B> as Join>::Mask, <BitSetAnd<A, B> as Join>::Value)

Open this join by returning the mask and the storages.

pub unsafe fn get(
    &mut <BitSetAnd<A, B> as Join>::Value,
    id: u32
) -> <BitSetAnd<A, B> as Join>::Type

Get a joined component value by a given index.

pub fn join(self) -> JoinIter<Self>

Create a joined iterator over the contents.

pub fn maybe(self) -> MaybeJoin<Self>

Returns a Join-able structure that yields all indices, returning None for all missing elements and Some(T) for found elements.

pub fn is_unconstrained() -> bool

If this Join typically returns all indices in the mask, then iterating over only it or combined with other joins that are also dangerous will cause the JoinIter/ParJoin to go through all indices which is usually not what is wanted and will kill performance.

impl<A, B> Not for BitSetAnd<A, B> where
    A: BitSetLike,
    B: BitSetLike, 

type Output = BitSetNot<BitSetAnd<A, B>>

The resulting type after applying the ! operator.

pub fn not(self) -> <BitSetAnd<A, B> as Not>::Output

Performs the unary ! operation.

impl<'a, A, B> Not for &'a BitSetAnd<A, B> where
    A: BitSetLike,
    B: BitSetLike, 

type Output = BitSetNot<&'a BitSetAnd<A, B>>

The resulting type after applying the ! operator.

pub fn not(self) -> <&'a BitSetAnd<A, B> as Not>::Output

Performs the unary ! operation.