20#ifndef _HLLUNION_INTERNAL_HPP_
21#define _HLLUNION_INTERNAL_HPP_
25#include "HllSketchImpl.hpp"
26#include "HllArray.hpp"
36 lg_max_k_(HllUtil<A>::checkLgK(lg_max_k)),
42 if (gadget_.sketch_impl->getCurMode() == hll_mode::HLL) {
43 static_cast<HllArray<A>*
>(gadget_.sketch_impl)->check_rebuild_kxq_cur_min();
45 return hll_sketch_alloc<A>(gadget_, target_type);
50 if (sketch.is_empty()) {
return; }
51 union_impl(sketch, lg_max_k_);
56 if (sketch.is_empty()) {
return; }
57 if (gadget_.is_empty() && sketch.get_target_type() ==
HLL_8 && sketch.get_lg_config_k() <= lg_max_k_) {
58 if (sketch.get_current_mode() == HLL || sketch.get_lg_config_k() == lg_max_k_) {
59 gadget_ = std::move(sketch);
62 union_impl(sketch, lg_max_k_);
67 gadget_.update(datum);
72 gadget_.update(datum);
77 gadget_.update(datum);
82 gadget_.update(datum);
87 gadget_.update(datum);
92 gadget_.update(datum);
97 gadget_.update(datum);
102 gadget_.update(datum);
107 gadget_.update(datum);
112 gadget_.update(datum);
117 gadget_.update(datum);
122 gadget_.update(data, length_bytes);
127 if (coupon == HllUtil<A>::EMPTY) {
return; }
128 HllSketchImpl<A>* result = gadget_.sketch_impl->coupon_update(coupon);
129 if (result != gadget_.sketch_impl) {
130 if (gadget_.sketch_impl !=
nullptr) { gadget_.sketch_impl->get_deleter()(gadget_.sketch_impl); }
131 gadget_.sketch_impl = result;
137 if (gadget_.sketch_impl->getCurMode() == hll_mode::HLL) {
138 static_cast<HllArray<A>*
>(gadget_.sketch_impl)->check_rebuild_kxq_cur_min();
140 return gadget_.get_estimate();
145 if (gadget_.sketch_impl->getCurMode() == hll_mode::HLL) {
146 static_cast<HllArray<A>*
>(gadget_.sketch_impl)->check_rebuild_kxq_cur_min();
148 return gadget_.get_composite_estimate();
153 if (gadget_.sketch_impl->getCurMode() == hll_mode::HLL) {
154 static_cast<HllArray<A>*
>(gadget_.sketch_impl)->check_rebuild_kxq_cur_min();
156 return gadget_.get_lower_bound(num_std_dev);
161 if (gadget_.sketch_impl->getCurMode() == hll_mode::HLL) {
162 static_cast<HllArray<A>*
>(gadget_.sketch_impl)->check_rebuild_kxq_cur_min();
164 return gadget_.get_upper_bound(num_std_dev);
169 return gadget_.get_lg_config_k();
176 gadget_.reset(
false);
181 return gadget_.is_empty();
186 return gadget_.is_out_of_order_flag();
190hll_mode hll_union_alloc<A>::get_current_mode()
const {
191 return gadget_.get_current_mode();
195bool hll_union_alloc<A>::is_estimation_mode()
const {
196 return gadget_.is_estimation_mode();
206 uint8_t lg_config_k, uint8_t num_std_dev) {
207 return HllUtil<A>::getRelErr(upper_bound, unioned, lg_config_k, num_std_dev);
212 if (src_impl->getCurMode() != HLL) {
213 throw std::logic_error(
"Attempt to downsample non-HLL sketch");
215 const HllArray<A>* src =
static_cast<const HllArray<A>*
>(src_impl);
216 const int src_lg_k = src->getLgConfigK();
217 if (src_lg_k <= tgt_lg_k) {
218 return src->copyAs(
HLL_8);
220 typedef typename std::allocator_traits<A>::template rebind_alloc<Hll8Array<A>> hll8Alloc;
221 Hll8Array<A>* tgtHllArr =
new (hll8Alloc(src->getAllocator()).allocate(1)) Hll8Array<A>(tgt_lg_k, src->getAllocator());
222 tgtHllArr->mergeHll(*src);
224 tgtHllArr->putHipAccum(src->getHipAccum());
225 tgtHllArr->putOutOfOrderFlag(src->isOutOfOrderFlag());
230inline HllSketchImpl<A>* hll_union_alloc<A>::leak_free_coupon_update(HllSketchImpl<A>* impl, uint32_t coupon) {
231 HllSketchImpl<A>* result = impl->couponUpdate(coupon);
232 if (result != impl) {
233 impl->get_deleter()(impl);
239void hll_union_alloc<A>::union_impl(
const hll_sketch_alloc<A>& sketch, uint8_t lg_max_k) {
240 const HllSketchImpl<A>* src_impl = sketch.sketch_impl;
241 HllSketchImpl<A>* dst_impl = gadget_.sketch_impl;
242 if (src_impl->getCurMode() == LIST || src_impl->getCurMode() == SET) {
243 if (dst_impl->isEmpty() && src_impl->getLgConfigK() == dst_impl->getLgConfigK()) {
244 dst_impl = src_impl->copyAs(
HLL_8);
245 gadget_.sketch_impl->get_deleter()(gadget_.sketch_impl);
247 const CouponList<A>* src =
static_cast<const CouponList<A>*
>(src_impl);
248 for (
auto coupon: *src) {
249 dst_impl = leak_free_coupon_update(dst_impl, coupon);
252 }
else if (!dst_impl->isEmpty()) {
253 if (dst_impl->getCurMode() == LIST || dst_impl->getCurMode() == SET) {
256 const CouponList<A>* src =
static_cast<const CouponList<A>*
>(dst_impl);
257 dst_impl = copy_or_downsample(src_impl, lg_max_k);
258 static_cast<Hll8Array<A>*
>(dst_impl)->mergeList(*src);
259 gadget_.sketch_impl->get_deleter()(gadget_.sketch_impl);
261 if (src_impl->getLgConfigK() < dst_impl->getLgConfigK()) {
262 dst_impl = copy_or_downsample(dst_impl, sketch.get_lg_config_k());
263 gadget_.sketch_impl->get_deleter()(gadget_.sketch_impl);
265 const HllArray<A>* src =
static_cast<const HllArray<A>*
>(src_impl);
266 static_cast<Hll8Array<A>*
>(dst_impl)->mergeHll(*src);
267 dst_impl->putOutOfOrderFlag(
true);
268 static_cast<Hll8Array<A>*
>(dst_impl)->putHipAccum(0);
271 dst_impl = copy_or_downsample(src_impl, lg_max_k);
272 gadget_.sketch_impl->get_deleter()(gadget_.sketch_impl);
274 gadget_.sketch_impl = dst_impl;
This is a high performance implementation of Phillipe Flajolet's HLL sketch but with significantly im...
Definition HllSketchImpl.hpp:31
This performs union operations for HLL sketches.
Definition hll.hpp:453
target_hll_type get_target_type() const
Returns the union's target HLL mode (from target_hll_type).
Definition HllUnion-internal.hpp:200
double get_composite_estimate() const
This is less accurate than the get_estimate() method and is automatically used when the union has gon...
Definition HllUnion-internal.hpp:144
double get_estimate() const
Returns the current cardinality estimate.
Definition HllUnion-internal.hpp:136
void update(const hll_sketch_alloc< A > &sketch)
Update this union operator with the given sketch.
Definition HllUnion-internal.hpp:49
hll_sketch_alloc< A > get_result(target_hll_type tgt_type=HLL_4) const
Returns the result of this union operator with the specified target_hll_type.
Definition HllUnion-internal.hpp:41
bool is_empty() const
Indicates if the union is currently empty.
Definition HllUnion-internal.hpp:180
uint8_t get_lg_config_k() const
Returns union's configured lg_k value.
Definition HllUnion-internal.hpp:168
double get_lower_bound(uint8_t num_std_dev) const
Returns the approximate lower error bound given the specified number of standard deviations.
Definition HllUnion-internal.hpp:152
hll_union_alloc(uint8_t lg_max_k, const A &allocator=A())
Construct an hll_union operator with the given maximum log2 of k.
Definition HllUnion-internal.hpp:35
void reset()
Resets the union to an empty state in coupon collection mode.
Definition HllUnion-internal.hpp:173
static double get_rel_err(bool upper_bound, bool unioned, uint8_t lg_config_k, uint8_t num_std_dev)
Gets the current (approximate) Relative Error (RE) asymptotic values given several parameters.
Definition HllUnion-internal.hpp:205
double get_upper_bound(uint8_t num_std_dev) const
Returns the approximate upper error bound given the specified number of standard deviations.
Definition HllUnion-internal.hpp:160
DataSketches namespace.
Definition binomial_bounds.hpp:38
target_hll_type
Specifies the target type of HLL sketch to be created.
Definition hll.hpp:72
@ HLL_8
8 bits per entry (fastest, fixed size)
Definition hll.hpp:75