22 template<
typename S,
typename P,
typename A>
23 tuple_union<S, P, A>::tuple_union(uint8_t lg_cur_size, uint8_t lg_nom_size, resize_factor rf,
float p, uint64_t theta, uint64_t seed,
const P& policy,
const A& allocator):
24 state_(lg_cur_size, lg_nom_size, rf, p, theta, seed, internal_policy(policy), allocator)
27 template<
typename S,
typename P,
typename A>
29 void tuple_union<S, P, A>::update(SS&& sketch) {
30 state_.update(std::forward<SS>(sketch));
33 template<
typename S,
typename P,
typename A>
35 return state_.get_result(ordered);
38 template<
typename S,
typename P,
typename A>
40 return state_.
reset();
43 template<
typename S,
typename P,
typename A>
47 template<
typename S,
typename P,
typename A>
49 return tuple_union(this->starting_lg_size(), this->lg_k_, this->rf_, this->p_, this->starting_theta(), this->seed_, this->policy_, this->allocator_);
Compact Tuple sketch.
Definition: tuple_sketch.hpp:416
Tuple base builder.
Definition: tuple_sketch.hpp:614
Tuple union builder.
Definition: tuple_union.hpp:101
tuple_union build() const
Create an instance of the union with predefined parameters.
Definition: tuple_union_impl.hpp:48
Tuple Union.
Definition: tuple_union.hpp:45
void reset()
Reset the union to the initial empty state.
Definition: tuple_union_impl.hpp:39
DataSketches namespace.
Definition: binomial_bounds.hpp:38