22 template<
typename Array,
typename Policy,
typename Allocator>
24 Base(seed, policy, allocator) {}
26 template<
typename Array,
typename Policy,
typename Allocator>
28 return CompactSketch(this->state_.get_policy().get_external_policy().get_num_values(), Base::get_result(ordered));
CompactSketch get_result(bool ordered=true) const
Produces a copy of the current state of the intersection.
Definition: array_tuple_intersection_impl.hpp:27
array_tuple_intersection(uint64_t seed=DEFAULT_SEED, const Policy &policy=Policy(), const Allocator &allocator=Allocator())
Constructor.
Definition: array_tuple_intersection_impl.hpp:23
Compact array tuple sketch.
Definition: array_tuple_sketch.hpp:163
Tuple intersection.
Definition: tuple_intersection.hpp:47
DataSketches namespace.
Definition: binomial_bounds.hpp:38