22 template<
typename Array,
typename Policy,
typename Allocator>
23 array_tuple_union<Array, Policy, Allocator>::array_tuple_union(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):
24 Base(lg_cur_size, lg_nom_size, rf, p, theta, seed, policy, allocator)
27 template<
typename Array,
typename Policy,
typename Allocator>
28 auto array_tuple_union<Array, Policy, Allocator>::get_result(
bool ordered)
const -> CompactSketch {
29 return CompactSketch(this->state_.get_policy().get_external_policy().get_num_values(), Base::get_result(ordered));
34 template<
typename Array,
typename Policy,
typename Allocator>
35 array_tuple_union<Array, Policy, Allocator>::builder::builder(
const Policy& policy,
const Allocator& allocator):
36 tuple_base_builder<builder, Policy, typename Array::allocator_type>(policy, allocator) {}
38 template<
typename Array,
typename Policy,
typename Allocator>
39 auto array_tuple_union<Array, Policy, Allocator>::builder::build() const -> array_tuple_union {
40 return array_tuple_union(this->starting_lg_size(), this->lg_k_, this->rf_, this->p_, this->starting_theta(), this->seed_, this->policy_, this->allocator_);
DataSketches namespace.
Definition: binomial_bounds.hpp:38