20 #ifndef THETA_UNION_BASE_HPP_
21 #define THETA_UNION_BASE_HPP_
23 #include "theta_update_sketch_base.hpp"
32 typename CompactSketch,
35 class theta_union_base {
37 using hash_table = theta_update_sketch_base<Entry, ExtractKey, Allocator>;
38 using resize_factor =
typename hash_table::resize_factor;
39 using comparator = compare_by_key<ExtractKey>;
41 theta_union_base(uint8_t lg_cur_size, uint8_t lg_nom_size, resize_factor rf,
float p, uint64_t theta, uint64_t seed,
const Policy& policy,
const Allocator& allocator);
43 template<
typename FwdSketch>
44 void update(FwdSketch&& sketch);
46 CompactSketch get_result(
bool ordered =
true)
const;
48 const Policy& get_policy()
const;
55 uint64_t union_theta_;
60 #include "theta_union_base_impl.hpp"
DataSketches namespace.
Definition: binomial_bounds.hpp:38