Struct hibitset::BitSetAll

pub struct BitSetAll;

BitSetAll is a bitset with all bits set. Essentially the same as BitSetNot(BitSet::new()) but without any allocation.

Trait Implementations

impl<T> BitAnd<T> for BitSetAll where
    T: 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> BitAnd<T> for &'a BitSetAll where
    T: BitSetLike, 

type Output = BitSetAnd<Self, T>

The resulting type after applying the & operator.

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

Performs the & operation.

impl<T> BitOr<T> for BitSetAll where
    T: 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> BitOr<T> for &'a BitSetAll where
    T: BitSetLike, 

type Output = BitSetOr<Self, T>

The resulting type after applying the | operator.

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

Performs the | operation.

impl BitSetLike for BitSetAll

fn layer3(&self) -> usize

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

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

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

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

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

fn layer0(&self, _id: 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.

fn is_empty(&self) -> bool

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

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<T> BitXor<T> for BitSetAll where
    T: 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, T> BitXor<T> for &'a BitSetAll where
    T: BitSetLike, 

type Output = BitSetXor<Self, T>

The resulting type after applying the ^ operator.

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

Performs the ^ operation.

impl Clone for BitSetAll

fn clone(&self) -> BitSetAll

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BitSetAll

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

Formats the value using the given formatter.

impl IntoIterator for BitSetAll

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> IntoIterator for &'a BitSetAll

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 Not for BitSetAll

type Output = BitSetNot<Self>

The resulting type after applying the ! operator.

fn not(self) -> Self::Output

Performs the unary ! operation.

impl<'a> Not for &'a BitSetAll

type Output = BitSetNot<Self>

The resulting type after applying the ! operator.

fn not(self) -> Self::Output

Performs the unary ! operation.