Struct hi_sparse_bitset::Reduce

pub struct Reduce<Op, S, Cache> { /* private fields */ }

Bitsets iterator reduction, as lazy bitset.

Constructed by reduce and reduce_w_cache.

Trait Implementations

impl<'a, Op, S, Storage, Rhs> BitAnd<Rhs> for &'a Reduce<Op, S, Storage>

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

Returns intersection of self and rhs bitsets.

type Output = BitSetOp<BitAndOp, &'a Reduce<Op, S, Storage>, Rhs>

The resulting type after applying the & operator.

impl<Op, S, Storage, Rhs> BitAnd<Rhs> for Reduce<Op, S, Storage>

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

Returns intersection of self and rhs bitsets.

type Output = BitSetOp<BitAndOp, Reduce<Op, S, Storage>, Rhs>

The resulting type after applying the & operator.

impl<'a, Op, S, Storage, Rhs> BitOr<Rhs> for &'a Reduce<Op, S, Storage>

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

Returns union of self and rhs bitsets.

type Output = BitSetOp<BitOrOp, &'a Reduce<Op, S, Storage>, Rhs>

The resulting type after applying the | operator.

impl<Op, S, Storage, Rhs> BitOr<Rhs> for Reduce<Op, S, Storage>

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

Returns union of self and rhs bitsets.

type Output = BitSetOp<BitOrOp, Reduce<Op, S, Storage>, Rhs>

The resulting type after applying the | operator.

impl<Op, S, Cache> BitSetBase for Reduce<Op, S, Cache>

where Op: BinaryOp, S: Iterator + Clone, S::Item: LevelMasks,

type Conf = <<S as Iterator>::Item as BitSetBase>::Conf

impl<'a, Op, S, Storage, Rhs> BitXor<Rhs> for &'a Reduce<Op, S, Storage>

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

Returns symmetric difference of self and rhs bitsets.

type Output = BitSetOp<BitXorOp, &'a Reduce<Op, S, Storage>, Rhs>

The resulting type after applying the ^ operator.

impl<Op, S, Storage, Rhs> BitXor<Rhs> for Reduce<Op, S, Storage>

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

Returns symmetric difference of self and rhs bitsets.

type Output = BitSetOp<BitXorOp, Reduce<Op, S, Storage>, Rhs>

The resulting type after applying the ^ operator.

impl<Op: Clone, S: Clone, Cache: Clone> Clone for Reduce<Op, S, Cache>

fn clone(&self) -> Reduce<Op, S, Cache>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, Op, S, Storage> IntoIterator for &'a Reduce<Op, S, Storage>

where Op: BinaryOp, S: Iterator + Clone, S::Item: LevelMasksExt, Storage: ReduceCache,

type Item = usize

The type of the elements being iterated over.

type IntoIter = <<&'a Reduce<Op, S, Storage> as BitSetInterface>::IntoBlockIter as BlockIterator>::IndexIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<Op, S, Storage> IntoIterator for Reduce<Op, S, Storage>

where Op: BinaryOp, S: Iterator + Clone, S::Item: LevelMasksExt, Storage: ReduceCache,

type Item = usize

The type of the elements being iterated over.

type IntoIter = <<Reduce<Op, S, Storage> as BitSetInterface>::IntoBlockIter as BlockIterator>::IndexIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, Op, S, Storage, Rhs> Sub<Rhs> for &'a Reduce<Op, S, Storage>

fn sub(self, rhs: Rhs) -> Self::Output

Returns difference of self and rhs bitsets.

Or relative complement of rhs in self.

type Output = BitSetOp<BitSubOp, &'a Reduce<Op, S, Storage>, Rhs>

The resulting type after applying the - operator.

impl<Op, S, Storage, Rhs> Sub<Rhs> for Reduce<Op, S, Storage>

fn sub(self, rhs: Rhs) -> Self::Output

Returns difference of self and rhs bitsets.

Or relative complement of rhs in self.

type Output = BitSetOp<BitSubOp, Reduce<Op, S, Storage>, Rhs>

The resulting type after applying the - operator.