datasketches-cpp
|
array tuple intersection More...
#include <array_tuple_intersection.hpp>
Public Member Functions | |
array_tuple_intersection (uint64_t seed=DEFAULT_SEED, const Policy &policy=Policy(), const Allocator &allocator=Allocator()) | |
Constructor. More... | |
CompactSketch | get_result (bool ordered=true) const |
Produces a copy of the current state of the intersection. More... | |
Public Member Functions inherited from tuple_intersection< Array, Policy, typename Array::allocator_type > | |
tuple_intersection (uint64_t seed=DEFAULT_SEED, const Policy &policy=Policy(), const typename Array::allocator_type &allocator=typename Array::allocator_type()) | |
Constructor. More... | |
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... | |
array tuple intersection
|
explicit |
Constructor.
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 |
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.
ordered | optional flag to specify if an ordered sketch should be produced |