20#ifndef THETA_INTERSECTION_HPP_
21#define THETA_INTERSECTION_HPP_
23#include "theta_sketch.hpp"
24#include "theta_intersection_base.hpp"
29template<
typename A>
class theta_intersection_alloc;
32using theta_intersection = theta_intersection_alloc<std::allocator<uint64_t>>;
38template<
typename Allocator = std::allocator<u
int64_t>>
41 using Entry = uint64_t;
42 using ExtractKey = trivial_extract_key;
48 void operator()(uint64_t internal_entry, uint64_t incoming_entry)
const {
49 unused(incoming_entry);
50 unused(internal_entry);
53 using State = theta_intersection_base<Entry, ExtractKey, nop_policy, Sketch, CompactSketch, Allocator>;
68 template<
typename FwdSketch>
69 void update(FwdSketch&& sketch);
92#include "theta_intersection_impl.hpp"
Compact Theta sketch.
Definition theta_sketch.hpp:359
Theta intersection.
Definition theta_intersection.hpp:39
CompactSketch get_result(bool ordered=true) const
Produces a copy of the current state of the intersection.
Definition theta_intersection_impl.hpp:37
bool has_result() const
Returns true if the state of the intersection is defined (not infinite "universe").
Definition theta_intersection_impl.hpp:42
void update(FwdSketch &&sketch)
Updates the intersection with a given sketch.
Definition theta_intersection_impl.hpp:32
Base class for the Theta Sketch, a generalization of the Kth Minimum Value (KMV) sketch.
Definition theta_sketch.hpp:127
DataSketches namespace.
Definition binomial_bounds.hpp:38