Struct hibitset::BitSetAnd
[−]
[src]
pub struct BitSetAnd<A: BitSetLike, B: BitSetLike>(pub A, pub B);
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: Debug + BitSetLike, B: Debug + BitSetLike> Debug for BitSetAnd<A, B>
[src]
impl<A: BitSetLike, B: BitSetLike> BitSetLike for BitSetAnd<A, B>
[src]
fn layer3(&self) -> usize
Return a usize where each bit represents if any word in layer2 has been set. Read more
fn layer2(&self, i: usize) -> usize
Return the usize from the array of usizes that indicates if any bit has been set in layer1 Read more
fn layer1(&self, i: usize) -> usize
Return the usize from the array of usizes that indicates if any bit has been set in layer0 Read more
fn layer0(&self, i: usize) -> usize
Return a usize that maps to the direct 1:1 association with each index of the set Read more
fn iter(self) -> BitIter<Self> where
Self: Sized,
Self: Sized,
Create an iterator that will scan over the keyspace
fn par_iter(self) -> BitParIter<Self> where
Self: Sized,
Self: Sized,
Create a parallel iterator that will scan over the keyspace