20 #ifndef THETA_INTERSECTION_BASE_HPP_
21 #define THETA_INTERSECTION_BASE_HPP_
30 typename CompactSketch,
33 class theta_intersection_base {
35 using hash_table = theta_update_sketch_base<Entry, ExtractKey, Allocator>;
36 using resize_factor =
typename hash_table::resize_factor;
37 using comparator = compare_by_key<ExtractKey>;
38 theta_intersection_base(uint64_t seed,
const Policy& policy,
const Allocator& allocator);
40 template<
typename FwdSketch>
41 void update(FwdSketch&& sketch);
43 CompactSketch get_result(
bool ordered =
true)
const;
45 bool has_result()
const;
47 const Policy& get_policy()
const;
57 #include "theta_intersection_base_impl.hpp"
DataSketches namespace.
Definition: binomial_bounds.hpp:38