Struct hibitset::BitSetNot

pub struct BitSetNot<A: BitSetLike>(pub A);

BitSetNot takes a BitSetLike item, and produced an inverted virtual set. Note: the implementation is sub-optimal because layers 1-3 are not active.

Trait Implementations

impl<A: Debug + BitSetLike> Debug for BitSetNot<A>

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

Formats the value using the given formatter.

impl<A: BitSetLike> BitSetLike for BitSetNot<A>

fn layer3(&self) -> usize

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

fn layer2(&self, _: usize) -> usize

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

fn layer1(&self, _: usize) -> usize

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

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

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

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

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

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

Gets the usize corresponding to layer and index.

Important traits for BitIter<T>

impl<T> Iterator for BitIter<T> where
    T: BitSetLike,  type Item = u32;

fn iter(self) -> BitIter<Self> where     Self: Sized,

Create an iterator that will scan over the keyspace

fn par_iter(self) -> BitParIter<Self> where     Self: Sized,

Create a parallel iterator that will scan over the keyspace

impl<A> IntoIterator for BitSetNot<A> where     A: 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

Creates an iterator from a value.

impl<A> Not for BitSetNot<A> where     A: BitSetLike,

type Output = BitSetNot<Self>

The resulting type after applying the ! operator.

fn not(self) -> Self::Output

Performs the unary ! operation.

impl<A, T> BitAnd<T> for BitSetNot<A> where     T: BitSetLike,     A: BitSetLike,

type Output = BitSetAnd<Self, T>

The resulting type after applying the & operator.

fn bitand(self, rhs: T) -> Self::Output

Performs the & operation.

impl<A, T> BitOr<T> for BitSetNot<A> where     T: BitSetLike,     A: BitSetLike,

type Output = BitSetOr<Self, T>

The resulting type after applying the | operator.

fn bitor(self, rhs: T) -> Self::Output

Performs the | operation.

impl<A, T> BitXor<T> for BitSetNot<A> where     T: BitSetLike,     A: BitSetLike,

type Output = BitSetXor<Self, T>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: T) -> Self::Output

Performs the ^ operation.

impl<'a, A> IntoIterator for &'a BitSetNot<A> where     A: 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

Creates an iterator from a value.

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

type Output = BitSetNot<Self>

The resulting type after applying the ! operator.

fn not(self) -> Self::Output

Performs the unary ! operation.

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

type Output = BitSetAnd<Self, T>

The resulting type after applying the & operator.

fn bitand(self, rhs: T) -> Self::Output

Performs the & operation.

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

type Output = BitSetOr<Self, T>

The resulting type after applying the | operator.

fn bitor(self, rhs: T) -> Self::Output

Performs the | operation.

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

type Output = BitSetXor<Self, T>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: T) -> Self::Output

Performs the ^ operation.