Tuple intersection. More...

Public Member Functions
	tuple_intersection (uint64_t seed=DEFAULT_SEED, const Policy &policy=Policy(), const Allocator &allocator=Allocator())
	Constructor. More...

template<typename FwdSketch >
void	update (FwdSketch &&sketch)
	Updates the intersection with a given sketch. More...

CompactSketch	get_result (bool ordered=true) const
	Produces a copy of the current state of the intersection. More...

bool	has_result () const
	Returns true if the state of the intersection is defined (not infinite "universe"). More...

Detailed Description

Tuple intersection.

Computes intersection of Tuple sketches.

Constructor & Destructor Documentation

explicit

Constructor.

Parameters

seed	for the hash function that was used to create the sketch
policy	user-defined way of combining Summary during intersection
allocator	to use for allocating and deallocating memory

void update ( FwdSketch && sketch )

Updates the intersection with a given sketch.

The intersection can be viewed as starting from the "universe" set, and every update can reduce the current set to leave the overlapping subset only.

Parameters

sketch represents input set for the intersection

auto get_result ( bool ordered = true ) const

Produces a copy of the current state of the intersection.

If update() was not called, the state is the infinite "universe", which is considered an undefined state, and throws an exception.

Parameters

ordered optional flag to specify if an ordered sketch should be produced

bool has_result

Returns true if the state of the intersection is defined (not infinite "universe").

The documentation for this class was generated from the following files: