[−][src]Struct 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: BitSetLike, B: BitSetLike> BitSetLike for BitSetAnd<A, B>
[src]
fn layer3(&self) -> usize
[src]
fn layer2(&self, i: usize) -> usize
[src]
fn layer1(&self, i: usize) -> usize
[src]
fn layer0(&self, i: usize) -> usize
[src]
fn contains(&self, i: u32) -> bool
[src]
fn get_from_layer(&self, layer: usize, idx: usize) -> usize
[src]
Gets the usize
corresponding to layer and index. Read more
fn is_empty(&self) -> bool
[src]
Returns true if this BitSetLike
contains nothing, and false otherwise.
ⓘImportant traits for BitIter<T>fn iter(self) -> BitIter<Self> where
Self: Sized,
[src]
Self: Sized,
Create an iterator that will scan over the keyspace
fn par_iter(self) -> BitParIter<Self> where
Self: Sized,
[src]
Self: Sized,
Create a parallel iterator that will scan over the keyspace
impl<A: DrainableBitSet, B: DrainableBitSet> DrainableBitSet for BitSetAnd<A, B>
[src]
fn remove(&mut self, i: u32) -> bool
[src]
ⓘImportant traits for DrainBitIter<'a, T>fn drain<'a>(&'a mut self) -> DrainBitIter<'a, Self> where
Self: Sized,
[src]
Self: Sized,
Create a draining iterator that will scan over the keyspace and clears it while doing so.
impl<A, B> IntoIterator for BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
[src]
A: BitSetLike,
B: BitSetLike,
type Item = <BitIter<Self> as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = BitIter<Self>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter
[src]
impl<'a, A, B> IntoIterator for &'a BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
[src]
A: BitSetLike,
B: BitSetLike,
type Item = <BitIter<Self> as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = BitIter<Self>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter
[src]
impl<A: Debug + BitSetLike, B: Debug + BitSetLike> Debug for BitSetAnd<A, B>
[src]
impl<A, B> Not for BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
[src]
A: BitSetLike,
B: BitSetLike,
type Output = BitSetNot<Self>
The resulting type after applying the !
operator.
fn not(self) -> Self::Output
[src]
impl<'a, A, B> Not for &'a BitSetAnd<A, B> where
A: BitSetLike,
B: BitSetLike,
[src]
A: BitSetLike,
B: BitSetLike,
type Output = BitSetNot<Self>
The resulting type after applying the !
operator.
fn not(self) -> Self::Output
[src]
impl<A, B, T> BitAnd<T> for BitSetAnd<A, B> where
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
[src]
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
type Output = BitSetAnd<Self, T>
The resulting type after applying the &
operator.
fn bitand(self, rhs: T) -> Self::Output
[src]
impl<'a, A, B, T> BitAnd<T> for &'a BitSetAnd<A, B> where
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
[src]
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
type Output = BitSetAnd<Self, T>
The resulting type after applying the &
operator.
fn bitand(self, rhs: T) -> Self::Output
[src]
impl<A, B, T> BitOr<T> for BitSetAnd<A, B> where
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
[src]
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
type Output = BitSetOr<Self, T>
The resulting type after applying the |
operator.
fn bitor(self, rhs: T) -> Self::Output
[src]
impl<'a, A, B, T> BitOr<T> for &'a BitSetAnd<A, B> where
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
[src]
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
type Output = BitSetOr<Self, T>
The resulting type after applying the |
operator.
fn bitor(self, rhs: T) -> Self::Output
[src]
impl<A, B, T> BitXor<T> for BitSetAnd<A, B> where
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
[src]
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
type Output = BitSetXor<Self, T>
The resulting type after applying the ^
operator.
fn bitxor(self, rhs: T) -> Self::Output
[src]
impl<'a, A, B, T> BitXor<T> for &'a BitSetAnd<A, B> where
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
[src]
T: BitSetLike,
A: BitSetLike,
B: BitSetLike,
Auto Trait Implementations
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> Send for BitSetAnd<A, B> where
A: Send,
B: Send,
A: Send,
B: Send,
impl<A, B> UnwindSafe for BitSetAnd<A, B> where
A: UnwindSafe,
B: UnwindSafe,
A: UnwindSafe,
B: UnwindSafe,
impl<A, B> RefUnwindSafe for BitSetAnd<A, B> where
A: RefUnwindSafe,
B: RefUnwindSafe,
A: RefUnwindSafe,
B: RefUnwindSafe,
Blanket Implementations
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> From<T> for T
[src]
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, 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<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> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,