pub struct BitSetNot<A: BitSetLike>(pub A);
Expand description
BitSetNot
takes a BitSetLike
item, and produced an inverted virtual set.
Note: the implementation is sub-optimal because layers 1-3 are not active.
Tuple Fields§
§0: A
Trait Implementations§
Source§impl<'a, A, T> BitAnd<T> for &'a BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
impl<'a, A, T> BitAnd<T> for &'a BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
Source§impl<A, T> BitAnd<T> for BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
impl<A, T> BitAnd<T> for BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
Source§impl<'a, A, T> BitOr<T> for &'a BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
impl<'a, A, T> BitOr<T> for &'a BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
Source§impl<A, T> BitOr<T> for BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
impl<A, T> BitOr<T> for BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
Source§impl<A: BitSetLike> BitSetLike for BitSetNot<A>
impl<A: BitSetLike> BitSetLike for BitSetNot<A>
Source§fn layer3(&self) -> usize
fn layer3(&self) -> usize
Return a
usize
where each bit represents if any word in layer2
has been set.Source§fn layer2(&self, _: usize) -> usize
fn layer2(&self, _: usize) -> usize
Return the
usize
from the array of usizes that indicates if any
bit has been set in layer1Source§fn layer1(&self, _: usize) -> usize
fn layer1(&self, _: usize) -> usize
Return the
usize
from the array of usizes that indicates if any
bit has been set in layer0Source§fn layer0(&self, i: usize) -> usize
fn layer0(&self, i: usize) -> usize
Return a
usize
that maps to the direct 1:1 association with
each index of the setSource§fn get_from_layer(&self, layer: usize, idx: usize) -> usize
fn get_from_layer(&self, layer: usize, idx: usize) -> usize
Gets the
usize
corresponding to layer and index. Read moreSource§fn is_empty(&self) -> bool
fn is_empty(&self) -> bool
Returns true if this
BitSetLike
contains nothing, and false otherwise.Source§fn iter(self) -> BitIter<Self> ⓘwhere
Self: Sized,
fn iter(self) -> BitIter<Self> ⓘwhere
Self: Sized,
Create an iterator that will scan over the keyspace
Source§fn par_iter(self) -> BitParIter<Self>where
Self: Sized,
fn par_iter(self) -> BitParIter<Self>where
Self: Sized,
Create a parallel iterator that will scan over the keyspace
Source§impl<'a, A, T> BitXor<T> for &'a BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
impl<'a, A, T> BitXor<T> for &'a BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
Source§impl<A, T> BitXor<T> for BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
impl<A, T> BitXor<T> for BitSetNot<A>where
T: BitSetLike,
A: BitSetLike,
Source§impl<'a, A> IntoIterator for &'a BitSetNot<A>where
A: BitSetLike,
impl<'a, A> IntoIterator for &'a BitSetNot<A>where
A: BitSetLike,
Source§impl<A> IntoIterator for BitSetNot<A>where
A: BitSetLike,
impl<A> IntoIterator for BitSetNot<A>where
A: BitSetLike,
Source§impl<'a, A> Not for &'a BitSetNot<A>where
A: BitSetLike,
impl<'a, A> Not for &'a BitSetNot<A>where
A: BitSetLike,
Auto Trait Implementations§
impl<A> Freeze for BitSetNot<A>where
A: Freeze,
impl<A> RefUnwindSafe for BitSetNot<A>where
A: RefUnwindSafe,
impl<A> Send for BitSetNot<A>where
A: Send,
impl<A> Sync for BitSetNot<A>where
A: Sync,
impl<A> Unpin for BitSetNot<A>where
A: Unpin,
impl<A> UnwindSafe for BitSetNot<A>where
A: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more