| ▼Cbase_theta_sketch_alloc< Allocator > | Abstract base class for Theta sketch |
| Ctheta_sketch_alloc< std::allocator< uint64_t > > | |
| ▼Ctheta_sketch_alloc< Allocator > | Base class for the Theta Sketch, a generalization of the Kth Minimum Value (KMV) sketch |
| Ccompact_theta_sketch_alloc< Allocator > | Compact Theta sketch |
| Cupdate_theta_sketch_alloc< Allocator > | Update Theta sketch |
| Cwrapped_compact_theta_sketch_alloc< Allocator > | Wrapped Compact Theta sketch |
| Cbase_theta_sketch_alloc< std::allocator< uint64_t > > | |
| Cbounds_binomial_proportions | Confidence intervals for binomial proportions |
| Cbounds_on_ratios_in_sampled_sets | Bounds on ratios in sampled sets |
| Cbounds_on_ratios_in_theta_sketched_sets< ExtractKey > | Bounds on ratios in Theta sketched sets |
| Ccount_min_sketch< W, Allocator > | C++ implementation of the CountMin sketch data structure of Cormode and Muthukrishnan |
| Ccpc_sketch_alloc< A > | High performance C++ implementation of Compressed Probabilistic Counting (CPC) Sketch |
| Ccpc_union_alloc< A > | High performance C++ implementation of Compressed Probabilistic Counting (CPC) Union |
| Cdefault_array_tuple_union_policy< Array > | Default array tuple union policy |
| Cdefault_array_tuple_update_policy< Array, Allocator > | Default array tuple update policy |
| Cdensity_sketch< T, Kernel, Allocator > | Density sketch |
| Cdensity_sketch< T, K, A > | |
| Cebpps_sketch< T, A > | An implementation of an Exact and Bounded Sampling Proportional to Size sketch |
| Cfrequent_items_sketch< T, W, H, E, A > | Frequent Items sketch |
| Chll_union_alloc< A > | This performs union operations for HLL sketches |
| CHllSketchImpl< A > | This is a high performance implementation of Phillipe Flajolet's HLL sketch but with significantly improved error behavior |
| CHllSketchImpl< std::allocator< uint8_t > > | |
| Cjaccard_similarity_base< Union, Intersection, ExtractKey > | Base class for Jaccard similarity |
| Ckll_sketch< T, C, A > | Implementation of a very compact quantiles sketch with lazy compaction scheme and nearly optimal accuracy per retained item |
| Ckolmogorov_smirnov | Kolmogorov-Smirnov test for KLL or Quantiles sketches |
| Cquantiles_sketch< T, Comparator, Allocator > | This is a stochastic streaming sketch that enables near-real time analysis of the approximate distribution from a very large stream in a single pass |
| Cquantiles_sorted_view< T, Comparator, Allocator > | Sorted view for quantiles sketches (REQ, KLL and Quantiles) |
| Cquantiles_sorted_view< T, C, A > | |
| Cquantiles_sorted_view< T, std::less< T >, std::allocator< T > > | |
| Creq_sketch< T, Comparator, Allocator > | Relative Error Quantiles Sketch |
| Cfrequent_items_sketch< T, W, H, E, A >::row | Row in the output from get_frequent_items |
| Cserde< T, Enable > | Interface for serializing and deserializing items |
| Cserde< std::string > | Serde for std::string items |
| Cserde< T, typename std::enable_if< std::is_arithmetic< T >::value >::type > | Serde for all fixed-size arithmetic types (int and float of different sizes) |
| Ctheta_a_not_b_alloc< Allocator > | Theta A-not-B (set difference) |
| ▼Ctheta_base_builder< Derived, Allocator > | Theta base builder |
| ▼Ctuple_base_builder< builder, Policy, Allocator > | |
| Cupdate_array_tuple_sketch< Array, Policy, Allocator >::builder | Update array tuple sketch builder |
| ▼Ctuple_base_builder< builder, P, A > | |
| Ctuple_union< Summary, Policy, Allocator >::builder | Tuple union builder |
| Cupdate_tuple_sketch< Summary, Update, Policy, Allocator >::builder | Update Tuple sketch builder |
| Ctuple_base_builder< Derived, Policy, Allocator > | Tuple base builder |
| ▼Ctheta_base_builder< builder, A > | |
| Ctheta_union_alloc< Allocator >::builder | Theta union builder |
| ▼Ctheta_base_builder< builder, Allocator > | |
| Cupdate_theta_sketch_alloc< Allocator >::builder | Update Theta sketch builder |
| Ctheta_intersection_alloc< Allocator > | Theta intersection |
| Ctheta_union_alloc< Allocator > | Theta Union |
| ▼Ctuple_a_not_b< Summary, Allocator > | Tuple A-not-B |
| Carray_tuple_a_not_b< Array, Allocator > | Array tuple A-not-B |
| Ctuple_a_not_b< Array, typename Array::allocator_type > | |
| ▼Ctuple_intersection< Summary, Policy, Allocator > | Tuple intersection |
| Carray_tuple_intersection< Array, Policy, Allocator > | Array tuple intersection |
| Ctuple_intersection< Array, Policy, typename Array::allocator_type > | |
| ▼Ctuple_sketch< Summary, Allocator > | Base class for Tuple sketch |
| Ccompact_tuple_sketch< Array, typename Array::allocator_type > | |
| Cupdate_tuple_sketch< Array, Array, default_array_tuple_update_policy< Array >, typename Array::allocator_type > | |
| ▼Ccompact_tuple_sketch< Summary, Allocator > | Compact Tuple sketch |
| Ccompact_array_tuple_sketch< Array, Allocator > | Compact array tuple sketch |
| ▼Cupdate_tuple_sketch< Summary, Update, Policy, Allocator > | Update Tuple sketch |
| Cupdate_array_tuple_sketch< Array, Policy, Allocator > | Update array tuple sketch |
| Ctuple_sketch< Array, typename Array::allocator_type > | |
| Ctuple_sketch< Summary, std::allocator< Summary > > | |
| ▼Ctuple_union< Summary, Policy, Allocator > | Tuple Union |
| Carray_tuple_union< Array, Policy, Allocator > | Array tuple union |
| Ctuple_union< Array, default_array_tuple_union_policy< Array >, typename Array::allocator_type > | |
| Cvar_opt_sketch< T, A > | This sketch samples data from a stream of items |
| Cvar_opt_sketch< T, A > | |
| Cvar_opt_sketch< T, std::allocator< T > > | |
| Cvar_opt_union< T, A > | Provides a unioning operation over var_opt_sketch objects |
| CXXHash64 | XXHash (64 bit), based on Yann Collet's descriptions, see http://cyan4973.github.io/xxHash/ |
