datasketches-cpp
Loading...
Searching...
No Matches
HllUnion-internal.hpp
1/*
2 * Licensed to the Apache Software Foundation (ASF) under one
3 * or more contributor license agreements. See the NOTICE file
4 * distributed with this work for additional information
5 * regarding copyright ownership. The ASF licenses this file
6 * to you under the Apache License, Version 2.0 (the
7 * "License"); you may not use this file except in compliance
8 * with the License. You may obtain a copy of the License at
9 *
10 * http://www.apache.org/licenses/LICENSE-2.0
11 *
12 * Unless required by applicable law or agreed to in writing,
13 * software distributed under the License is distributed on an
14 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15 * KIND, either express or implied. See the License for the
16 * specific language governing permissions and limitations
17 * under the License.
18 */
19
20#ifndef _HLLUNION_INTERNAL_HPP_
21#define _HLLUNION_INTERNAL_HPP_
22
23#include "hll.hpp"
24
25#include "HllSketchImpl.hpp"
26#include "HllArray.hpp"
27#include "HllUtil.hpp"
28
29#include <stdexcept>
30#include <string>
31
32namespace datasketches {
33
34template<typename A>
35hll_union_alloc<A>::hll_union_alloc(uint8_t lg_max_k, const A& allocator):
36 lg_max_k_(HllUtil<A>::checkLgK(lg_max_k)),
37 gadget_(lg_max_k, target_hll_type::HLL_8, false, allocator)
38{}
39
40template<typename A>
41hll_sketch_alloc<A> hll_union_alloc<A>::get_result(target_hll_type target_type) const {
42 if (gadget_.sketch_impl->getCurMode() == hll_mode::HLL) {
43 static_cast<HllArray<A>*>(gadget_.sketch_impl)->check_rebuild_kxq_cur_min();
44 }
45 return hll_sketch_alloc<A>(gadget_, target_type);
46}
47
48template<typename A>
49void hll_union_alloc<A>::update(const hll_sketch_alloc<A>& sketch) {
50 if (sketch.is_empty()) { return; }
51 union_impl(sketch, lg_max_k_);
52}
53
54template<typename A>
55void hll_union_alloc<A>::update(hll_sketch_alloc<A>&& sketch) {
56 if (sketch.is_empty()) { return; }
57 // taking over the sketch is only possible if its memory can be released with the union's allocator
58 if (gadget_.is_empty() && sketch.get_target_type() == HLL_8 && sketch.get_lg_config_k() <= lg_max_k_
59 && sketch.sketch_impl->getAllocator() == gadget_.sketch_impl->getAllocator()) {
60 if (sketch.get_current_mode() == HLL || sketch.get_lg_config_k() == lg_max_k_) {
61 gadget_ = std::move(sketch);
62 }
63 }
64 union_impl(sketch, lg_max_k_);
65}
66
67template<typename A>
68void hll_union_alloc<A>::update(const std::string& datum) {
69 gadget_.update(datum);
70}
71
72template<typename A>
73void hll_union_alloc<A>::update(uint64_t datum) {
74 gadget_.update(datum);
75}
76
77template<typename A>
78void hll_union_alloc<A>::update(uint32_t datum) {
79 gadget_.update(datum);
80}
81
82template<typename A>
83void hll_union_alloc<A>::update(uint16_t datum) {
84 gadget_.update(datum);
85}
86
87template<typename A>
88void hll_union_alloc<A>::update(uint8_t datum) {
89 gadget_.update(datum);
90}
91
92template<typename A>
93void hll_union_alloc<A>::update(int64_t datum) {
94 gadget_.update(datum);
95}
96
97template<typename A>
98void hll_union_alloc<A>::update(int32_t datum) {
99 gadget_.update(datum);
100}
101
102template<typename A>
103void hll_union_alloc<A>::update(int16_t datum) {
104 gadget_.update(datum);
105}
106
107template<typename A>
108void hll_union_alloc<A>::update(int8_t datum) {
109 gadget_.update(datum);
110}
111
112template<typename A>
113void hll_union_alloc<A>::update(double datum) {
114 gadget_.update(datum);
115}
116
117template<typename A>
118void hll_union_alloc<A>::update(float datum) {
119 gadget_.update(datum);
120}
121
122template<typename A>
123void hll_union_alloc<A>::update(const void* data, size_t length_bytes) {
124 gadget_.update(data, length_bytes);
125}
126
127template<typename A>
128void hll_union_alloc<A>::coupon_update(uint32_t coupon) {
129 if (coupon == HllUtil<A>::EMPTY) { return; }
130 HllSketchImpl<A>* result = gadget_.sketch_impl->coupon_update(coupon);
131 if (result != gadget_.sketch_impl) {
132 if (gadget_.sketch_impl != nullptr) { gadget_.sketch_impl->get_deleter()(gadget_.sketch_impl); }
133 gadget_.sketch_impl = result;
134 }
135}
136
137template<typename A>
139 if (gadget_.sketch_impl->getCurMode() == hll_mode::HLL) {
140 static_cast<HllArray<A>*>(gadget_.sketch_impl)->check_rebuild_kxq_cur_min();
141 }
142 return gadget_.get_estimate();
143}
144
145template<typename A>
147 if (gadget_.sketch_impl->getCurMode() == hll_mode::HLL) {
148 static_cast<HllArray<A>*>(gadget_.sketch_impl)->check_rebuild_kxq_cur_min();
149 }
150 return gadget_.get_composite_estimate();
151}
152
153template<typename A>
154double hll_union_alloc<A>::get_lower_bound(uint8_t num_std_dev) const {
155 if (gadget_.sketch_impl->getCurMode() == hll_mode::HLL) {
156 static_cast<HllArray<A>*>(gadget_.sketch_impl)->check_rebuild_kxq_cur_min();
157 }
158 return gadget_.get_lower_bound(num_std_dev);
159}
160
161template<typename A>
162double hll_union_alloc<A>::get_upper_bound(uint8_t num_std_dev) const {
163 if (gadget_.sketch_impl->getCurMode() == hll_mode::HLL) {
164 static_cast<HllArray<A>*>(gadget_.sketch_impl)->check_rebuild_kxq_cur_min();
165 }
166 return gadget_.get_upper_bound(num_std_dev);
167}
168
169template<typename A>
171 return gadget_.get_lg_config_k();
172}
173
174template<typename A>
176 // always coupon collection mode: the gadget is an internal detail and must not
177 // inherit a full-size state from whatever sketches happen to have been unioned in
178 gadget_.reset(false);
179}
180
181template<typename A>
183 return gadget_.is_empty();
184}
185
186template<typename A>
187bool hll_union_alloc<A>::is_out_of_order_flag() const {
188 return gadget_.is_out_of_order_flag();
189}
190
191template<typename A>
192hll_mode hll_union_alloc<A>::get_current_mode() const {
193 return gadget_.get_current_mode();
194}
195
196template<typename A>
197bool hll_union_alloc<A>::is_estimation_mode() const {
198 return gadget_.is_estimation_mode();
199}
200
201template<typename A>
205
206template<typename A>
207double hll_union_alloc<A>::get_rel_err(bool upper_bound, bool unioned,
208 uint8_t lg_config_k, uint8_t num_std_dev) {
209 return HllUtil<A>::getRelErr(upper_bound, unioned, lg_config_k, num_std_dev);
210}
211
212template<typename A>
213HllSketchImpl<A>* hll_union_alloc<A>::copy_or_downsample(const HllSketchImpl<A>* src_impl, uint8_t tgt_lg_k,
214 const A& allocator) {
215 if (src_impl->getCurMode() != HLL) {
216 throw std::logic_error("Attempt to downsample non-HLL sketch");
217 }
218 const HllArray<A>* src = static_cast<const HllArray<A>*>(src_impl);
219 const uint8_t src_lg_k = src->getLgConfigK();
220 // a copy keeps the source's allocator, so it is only made if that is the union's allocator
221 if (src_lg_k <= tgt_lg_k && src->getAllocator() == allocator) {
222 return src->copyAs(HLL_8);
223 }
224 typedef typename std::allocator_traits<A>::template rebind_alloc<Hll8Array<A>> hll8Alloc;
225 const uint8_t lg_k = std::min(src_lg_k, tgt_lg_k);
226 Hll8Array<A>* tgtHllArr = new (hll8Alloc(allocator).allocate(1)) Hll8Array<A>(lg_k, allocator);
227 tgtHllArr->mergeHll(*src);
228 //both of these are required for isomorphism
229 tgtHllArr->putHipAccum(src->getHipAccum());
230 tgtHllArr->putOutOfOrderFlag(src->isOutOfOrderFlag());
231 return tgtHllArr;
232}
233
234template<typename A>
235inline HllSketchImpl<A>* hll_union_alloc<A>::leak_free_coupon_update(HllSketchImpl<A>* impl, uint32_t coupon) {
236 HllSketchImpl<A>* result = impl->couponUpdate(coupon);
237 if (result != impl) {
238 impl->get_deleter()(impl);
239 }
240 return result;
241}
242
243template<typename A>
244void hll_union_alloc<A>::union_impl(const hll_sketch_alloc<A>& sketch, uint8_t lg_max_k) {
245 const HllSketchImpl<A>* src_impl = sketch.sketch_impl; //default
246 HllSketchImpl<A>* dst_impl = gadget_.sketch_impl; //default
247 // the gadget allocates with the union's allocator: the input sketch may use another allocator
248 // instance (e.g. a stateful one), and copies of it would keep that allocator
249 const A allocator = dst_impl->getAllocator();
250 if (src_impl->getCurMode() == LIST || src_impl->getCurMode() == SET) {
251 if (dst_impl->isEmpty() && src_impl->getLgConfigK() == dst_impl->getLgConfigK()
252 && src_impl->getAllocator() == allocator) {
253 dst_impl = src_impl->copyAs(HLL_8);
254 gadget_.sketch_impl->get_deleter()(gadget_.sketch_impl); // gadget to be replaced
255 } else {
256 const CouponList<A>* src = static_cast<const CouponList<A>*>(src_impl);
257 for (auto coupon: *src) {
258 dst_impl = leak_free_coupon_update(dst_impl, coupon); //assignment required
259 }
260 }
261 } else if (!dst_impl->isEmpty()) { // src is HLL
262 if (dst_impl->getCurMode() == LIST || dst_impl->getCurMode() == SET) {
263 // swap so that src is LIST or SET, tgt is HLL
264 // use lg_max_k because LIST has effective K of 2^26
265 const CouponList<A>* src = static_cast<const CouponList<A>*>(dst_impl);
266 dst_impl = copy_or_downsample(src_impl, lg_max_k, allocator);
267 static_cast<Hll8Array<A>*>(dst_impl)->mergeList(*src);
268 gadget_.sketch_impl->get_deleter()(gadget_.sketch_impl); // gadget to be replaced
269 } else { // gadget is HLL
270 if (src_impl->getLgConfigK() < dst_impl->getLgConfigK()) {
271 dst_impl = copy_or_downsample(dst_impl, sketch.get_lg_config_k(), allocator);
272 gadget_.sketch_impl->get_deleter()(gadget_.sketch_impl); // gadget to be replaced
273 }
274 const HllArray<A>* src = static_cast<const HllArray<A>*>(src_impl);
275 static_cast<Hll8Array<A>*>(dst_impl)->mergeHll(*src);
276 dst_impl->putOutOfOrderFlag(true);
277 static_cast<Hll8Array<A>*>(dst_impl)->putHipAccum(0);
278 }
279 } else { // src is HLL, gadget is empty
280 dst_impl = copy_or_downsample(src_impl, lg_max_k, allocator);
281 gadget_.sketch_impl->get_deleter()(gadget_.sketch_impl); // gadget to be replaced
282 }
283 gadget_.sketch_impl = dst_impl; // gadget replaced
284}
285
286}
287
288#endif // _HLLUNION_INTERNAL_HPP_
This is a high performance implementation of Phillipe Flajolet's HLL sketch but with significantly im...
Definition HllSketchImpl.hpp:31
target_hll_type get_target_type() const
Returns the union's target HLL mode (from target_hll_type).
Definition HllUnion-internal.hpp:202
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:146
double get_estimate() const
Returns the current cardinality estimate.
Definition HllUnion-internal.hpp:138
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:182
uint8_t get_lg_config_k() const
Returns union's configured lg_k value.
Definition HllUnion-internal.hpp:170
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:154
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:175
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:207
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:162
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