[−]Struct oxygengine_core::ecs::hibitset::BitSetAnd
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, B, T> BitAnd<T> for BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
type Output = BitSetAnd<BitSetAnd<A, B>, T>
The resulting type after applying the &
operator.
fn bitand(self, rhs: T) -> <BitSetAnd<A, B> as BitAnd<T>>::Output
impl<'a, A, B, T> BitAnd<T> for &'a BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
type Output = BitSetAnd<&'a BitSetAnd<A, B>, T>
The resulting type after applying the &
operator.
fn bitand(self, rhs: T) -> <&'a BitSetAnd<A, B> as BitAnd<T>>::Output
impl<'a, A, B, T> BitOr<T> for &'a BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
type Output = BitSetOr<&'a BitSetAnd<A, B>, T>
The resulting type after applying the |
operator.
fn bitor(self, rhs: T) -> <&'a BitSetAnd<A, B> as BitOr<T>>::Output
impl<A, B, T> BitOr<T> for BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
type Output = BitSetOr<BitSetAnd<A, B>, T>
The resulting type after applying the |
operator.
fn bitor(self, rhs: T) -> <BitSetAnd<A, B> as BitOr<T>>::Output
impl<A, B> BitSetLike for BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
A: BitSetLike,
B: BitSetLike,
fn layer3(&self) -> usize
fn layer2(&self, i: usize) -> usize
fn layer1(&self, i: usize) -> usize
fn layer0(&self, i: usize) -> usize
fn contains(&self, i: u32) -> bool
fn get_from_layer(&self, layer: usize, idx: usize) -> usize
fn is_empty(&self) -> bool
fn iter(self) -> BitIter<Self>ⓘ
impl<A, B, T> BitXor<T> for BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
type Output = BitSetXor<BitSetAnd<A, B>, T>
The resulting type after applying the ^
operator.
fn bitxor(self, rhs: T) -> <BitSetAnd<A, B> as BitXor<T>>::Output
impl<'a, A, B, T> BitXor<T> for &'a BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
T: BitSetLike,
type Output = BitSetXor<&'a BitSetAnd<A, B>, T>
The resulting type after applying the ^
operator.
fn bitxor(self, rhs: T) -> <&'a BitSetAnd<A, B> as BitXor<T>>::Output
impl<A, B> Clone for BitSetAnd<A, B> where
A: BitSetLike + Clone,
B: BitSetLike + Clone,
A: BitSetLike + Clone,
B: BitSetLike + Clone,
fn clone(&self) -> BitSetAnd<A, B>
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<A, B> Debug for BitSetAnd<A, B> where
A: BitSetLike + Debug,
B: BitSetLike + Debug,
A: BitSetLike + Debug,
B: BitSetLike + Debug,
impl<A, B> DrainableBitSet for BitSetAnd<A, B> where
A: DrainableBitSet,
B: DrainableBitSet,
A: DrainableBitSet,
B: DrainableBitSet,
fn remove(&mut self, i: u32) -> bool
fn drain(&'a mut self) -> DrainBitIter<'a, Self>ⓘNotable traits for DrainBitIter<'a, T>
impl<'a, T> Iterator for DrainBitIter<'a, T> where
T: DrainableBitSet, type Item = u32;
Notable traits for DrainBitIter<'a, T>
impl<'a, T> Iterator for DrainBitIter<'a, T> where
T: DrainableBitSet, type Item = u32;
impl<A, B> IntoIterator for BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
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?
fn into_iter(self) -> <BitSetAnd<A, B> as IntoIterator>::IntoIter
impl<'a, A, B> IntoIterator for &'a BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
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?
fn into_iter(self) -> <&'a BitSetAnd<A, B> as IntoIterator>::IntoIter
impl<'a, A, B> Join for &'a BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
[src]
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.
unsafe fn open(
self
) -> (<&'a BitSetAnd<A, B> as Join>::Mask, <&'a BitSetAnd<A, B> as Join>::Value)
[src]
self
) -> (<&'a BitSetAnd<A, B> as Join>::Mask, <&'a BitSetAnd<A, B> as Join>::Value)
unsafe fn get(
&mut <&'a BitSetAnd<A, B> as Join>::Value,
id: u32
) -> <&'a BitSetAnd<A, B> as Join>::Type
[src]
&mut <&'a BitSetAnd<A, B> as Join>::Value,
id: u32
) -> <&'a BitSetAnd<A, B> as Join>::Type
fn join(self) -> JoinIter<Self>ⓘ
[src]
fn maybe(self) -> MaybeJoin<Self>
[src]
fn is_unconstrained() -> bool
[src]
impl<A, B> Join for BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
[src]
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.
unsafe fn open(
self
) -> (<BitSetAnd<A, B> as Join>::Mask, <BitSetAnd<A, B> as Join>::Value)
[src]
self
) -> (<BitSetAnd<A, B> as Join>::Mask, <BitSetAnd<A, B> as Join>::Value)
unsafe fn get(
&mut <BitSetAnd<A, B> as Join>::Value,
id: u32
) -> <BitSetAnd<A, B> as Join>::Type
[src]
&mut <BitSetAnd<A, B> as Join>::Value,
id: u32
) -> <BitSetAnd<A, B> as Join>::Type
fn join(self) -> JoinIter<Self>ⓘ
[src]
fn maybe(self) -> MaybeJoin<Self>
[src]
fn is_unconstrained() -> bool
[src]
impl<A, B> Not for BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
A: BitSetLike,
B: BitSetLike,
type Output = BitSetNot<BitSetAnd<A, B>>
The resulting type after applying the !
operator.
fn not(self) -> <BitSetAnd<A, B> as Not>::Output
impl<'a, A, B> Not for &'a BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
A: BitSetLike,
B: BitSetLike,
Auto Trait Implementations
impl<A, B> RefUnwindSafe for BitSetAnd<A, B> where
A: RefUnwindSafe,
B: RefUnwindSafe,
A: RefUnwindSafe,
B: RefUnwindSafe,
impl<A, B> Send for BitSetAnd<A, B> where
A: Send,
B: Send,
A: Send,
B: Send,
impl<A, B> Sync for BitSetAnd<A, B> where
A: Sync,
B: Sync,
A: Sync,
B: Sync,
impl<A, B> Unpin for BitSetAnd<A, B> where
A: Unpin,
B: Unpin,
A: Unpin,
B: Unpin,
impl<A, B> UnwindSafe for BitSetAnd<A, B> where
A: UnwindSafe,
B: UnwindSafe,
A: UnwindSafe,
B: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Any for T where
T: Any,
T: Any,
fn get_type_id(&self) -> TypeId
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Event for T where
T: Send + Sync + 'static,
[src]
T: Send + Sync + 'static,
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T> Resource for T where
T: Any,
[src]
T: Any,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,