Struct IntersectionCombination

pub struct IntersectionCombination<L, R> { /* private fields */ }

Intersection struct used for chaining Object’s.

Returns cells which are present in 2 sets. But not in one of them

Trait Implementations

impl<L: Debug, R: Debug> Debug for IntersectionCombination<L, R>

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

Formats the value using the given formatter.

impl<L, R> Object for IntersectionCombination<L, R>

where L: Object, R: Object,

type Iter = IntersectIter<<L as Object>::Iter>

An Iterator which returns a list of cells.

fn cells<T>(&self, table: &Table<T>) -> Self::Iter

where T: Records,

Cells returns a set of coordinates of cells

fn and<O>(self, rhs: O) -> UnionCombination<Self, O>

where O: Object,

Combines cells. It doesn’t repeat cells.

fn not<O>(self, rhs: O) -> DiffCombination<Self, O>

where O: Object,

Excludes rhs cells from this cells.

fn intersect<O>(self, rhs: O) -> IntersectionCombination<Self, O>

where O: Object,

Returns cells which are present in both Objects only.

fn inverse(self) -> InversionCombination<Self>

Returns cells which are not present in target Object.