datasketches 0.2.3 → 0.2.6

Sign up to get free protection for your applications and to get access to all the features.
Files changed (143) hide show
  1. checksums.yaml +4 -4
  2. data/CHANGELOG.md +12 -0
  3. data/README.md +8 -8
  4. data/ext/datasketches/kll_wrapper.cpp +7 -3
  5. data/ext/datasketches/theta_wrapper.cpp +20 -4
  6. data/lib/datasketches/version.rb +1 -1
  7. data/vendor/datasketches-cpp/CMakeLists.txt +25 -5
  8. data/vendor/datasketches-cpp/MANIFEST.in +3 -0
  9. data/vendor/datasketches-cpp/NOTICE +6 -5
  10. data/vendor/datasketches-cpp/README.md +76 -9
  11. data/vendor/datasketches-cpp/cmake/DataSketchesConfig.cmake.in +10 -0
  12. data/vendor/datasketches-cpp/common/CMakeLists.txt +18 -13
  13. data/vendor/datasketches-cpp/common/include/binomial_bounds.hpp +1 -0
  14. data/vendor/datasketches-cpp/common/include/common_defs.hpp +14 -0
  15. data/vendor/datasketches-cpp/{kll → common}/include/kolmogorov_smirnov.hpp +5 -3
  16. data/vendor/datasketches-cpp/{kll → common}/include/kolmogorov_smirnov_impl.hpp +13 -16
  17. data/vendor/datasketches-cpp/common/include/quantile_sketch_sorted_view.hpp +121 -0
  18. data/vendor/datasketches-cpp/common/include/quantile_sketch_sorted_view_impl.hpp +91 -0
  19. data/vendor/datasketches-cpp/common/test/test_type.hpp +2 -0
  20. data/vendor/datasketches-cpp/cpc/CMakeLists.txt +15 -35
  21. data/vendor/datasketches-cpp/cpc/include/cpc_compressor_impl.hpp +3 -1
  22. data/vendor/datasketches-cpp/cpc/include/cpc_confidence.hpp +1 -0
  23. data/vendor/datasketches-cpp/cpc/include/cpc_sketch_impl.hpp +5 -3
  24. data/vendor/datasketches-cpp/cpc/include/cpc_union_impl.hpp +10 -6
  25. data/vendor/datasketches-cpp/cpc/test/cpc_sketch_allocation_test.cpp +17 -0
  26. data/vendor/datasketches-cpp/cpc/test/cpc_sketch_test.cpp +1 -0
  27. data/vendor/datasketches-cpp/cpc/test/cpc_union_test.cpp +2 -0
  28. data/vendor/datasketches-cpp/fi/CMakeLists.txt +5 -15
  29. data/vendor/datasketches-cpp/fi/include/frequent_items_sketch.hpp +37 -5
  30. data/vendor/datasketches-cpp/fi/include/frequent_items_sketch_impl.hpp +29 -11
  31. data/vendor/datasketches-cpp/fi/test/frequent_items_sketch_custom_type_test.cpp +2 -1
  32. data/vendor/datasketches-cpp/fi/test/frequent_items_sketch_test.cpp +1 -0
  33. data/vendor/datasketches-cpp/hll/CMakeLists.txt +33 -56
  34. data/vendor/datasketches-cpp/hll/include/AuxHashMap-internal.hpp +2 -0
  35. data/vendor/datasketches-cpp/hll/include/CompositeInterpolationXTable-internal.hpp +1 -0
  36. data/vendor/datasketches-cpp/hll/include/CouponHashSet-internal.hpp +2 -2
  37. data/vendor/datasketches-cpp/hll/include/CouponList-internal.hpp +1 -0
  38. data/vendor/datasketches-cpp/hll/include/HllSketch-internal.hpp +6 -4
  39. data/vendor/datasketches-cpp/hll/include/HllSketchImpl-internal.hpp +2 -0
  40. data/vendor/datasketches-cpp/hll/include/HllSketchImplFactory.hpp +2 -0
  41. data/vendor/datasketches-cpp/hll/test/AuxHashMapTest.cpp +1 -0
  42. data/vendor/datasketches-cpp/hll/test/CouponHashSetTest.cpp +1 -0
  43. data/vendor/datasketches-cpp/hll/test/CouponListTest.cpp +2 -0
  44. data/vendor/datasketches-cpp/hll/test/HllArrayTest.cpp +1 -0
  45. data/vendor/datasketches-cpp/hll/test/HllSketchTest.cpp +59 -0
  46. data/vendor/datasketches-cpp/hll/test/HllUnionTest.cpp +2 -0
  47. data/vendor/datasketches-cpp/hll/test/TablesTest.cpp +1 -0
  48. data/vendor/datasketches-cpp/kll/CMakeLists.txt +5 -19
  49. data/vendor/datasketches-cpp/kll/include/kll_helper.hpp +0 -4
  50. data/vendor/datasketches-cpp/kll/include/kll_helper_impl.hpp +5 -2
  51. data/vendor/datasketches-cpp/kll/include/kll_sketch.hpp +108 -41
  52. data/vendor/datasketches-cpp/kll/include/kll_sketch_impl.hpp +150 -132
  53. data/vendor/datasketches-cpp/kll/test/kll_sketch_test.cpp +165 -31
  54. data/vendor/datasketches-cpp/kll/test/kolmogorov_smirnov_test.cpp +1 -1
  55. data/vendor/datasketches-cpp/pyproject.toml +1 -1
  56. data/vendor/datasketches-cpp/python/CMakeLists.txt +8 -1
  57. data/vendor/datasketches-cpp/python/README.md +13 -9
  58. data/vendor/datasketches-cpp/python/src/datasketches.cpp +4 -0
  59. data/vendor/datasketches-cpp/python/src/fi_wrapper.cpp +6 -1
  60. data/vendor/datasketches-cpp/python/src/kll_wrapper.cpp +48 -13
  61. data/vendor/datasketches-cpp/python/src/ks_wrapper.cpp +68 -0
  62. data/vendor/datasketches-cpp/python/src/quantiles_wrapper.cpp +240 -0
  63. data/vendor/datasketches-cpp/python/src/req_wrapper.cpp +9 -2
  64. data/vendor/datasketches-cpp/python/src/vector_of_kll.cpp +1 -0
  65. data/vendor/datasketches-cpp/python/tests/kll_test.py +10 -4
  66. data/vendor/datasketches-cpp/python/tests/quantiles_test.py +126 -0
  67. data/vendor/datasketches-cpp/quantiles/CMakeLists.txt +42 -0
  68. data/vendor/datasketches-cpp/quantiles/include/quantiles_sketch.hpp +656 -0
  69. data/vendor/datasketches-cpp/quantiles/include/quantiles_sketch_impl.hpp +1373 -0
  70. data/vendor/datasketches-cpp/quantiles/test/CMakeLists.txt +44 -0
  71. data/vendor/datasketches-cpp/quantiles/test/Qk128_n1000_v0.3.0.sk +0 -0
  72. data/vendor/datasketches-cpp/quantiles/test/Qk128_n1000_v0.6.0.sk +0 -0
  73. data/vendor/datasketches-cpp/quantiles/test/Qk128_n1000_v0.8.0.sk +0 -0
  74. data/vendor/datasketches-cpp/quantiles/test/Qk128_n1000_v0.8.3.sk +0 -0
  75. data/vendor/datasketches-cpp/quantiles/test/Qk128_n50_v0.3.0.sk +0 -0
  76. data/vendor/datasketches-cpp/quantiles/test/Qk128_n50_v0.6.0.sk +0 -0
  77. data/vendor/datasketches-cpp/quantiles/test/Qk128_n50_v0.8.0.sk +0 -0
  78. data/vendor/datasketches-cpp/quantiles/test/Qk128_n50_v0.8.3.sk +0 -0
  79. data/vendor/datasketches-cpp/quantiles/test/kolmogorov_smirnov_test.cpp +110 -0
  80. data/vendor/datasketches-cpp/quantiles/test/quantiles_compatibility_test.cpp +129 -0
  81. data/vendor/datasketches-cpp/quantiles/test/quantiles_sketch_test.cpp +975 -0
  82. data/vendor/datasketches-cpp/req/CMakeLists.txt +6 -21
  83. data/vendor/datasketches-cpp/req/include/req_common.hpp +0 -5
  84. data/vendor/datasketches-cpp/req/include/req_compactor.hpp +6 -0
  85. data/vendor/datasketches-cpp/req/include/req_compactor_impl.hpp +30 -2
  86. data/vendor/datasketches-cpp/req/include/req_sketch.hpp +73 -23
  87. data/vendor/datasketches-cpp/req/include/req_sketch_impl.hpp +95 -63
  88. data/vendor/datasketches-cpp/req/test/req_sketch_test.cpp +74 -3
  89. data/vendor/datasketches-cpp/sampling/CMakeLists.txt +5 -9
  90. data/vendor/datasketches-cpp/sampling/include/var_opt_sketch.hpp +44 -7
  91. data/vendor/datasketches-cpp/sampling/include/var_opt_sketch_impl.hpp +44 -33
  92. data/vendor/datasketches-cpp/sampling/include/var_opt_union.hpp +41 -6
  93. data/vendor/datasketches-cpp/sampling/include/var_opt_union_impl.hpp +33 -15
  94. data/vendor/datasketches-cpp/sampling/test/var_opt_allocation_test.cpp +2 -2
  95. data/vendor/datasketches-cpp/sampling/test/var_opt_sketch_test.cpp +1 -0
  96. data/vendor/datasketches-cpp/sampling/test/var_opt_union_test.cpp +1 -0
  97. data/vendor/datasketches-cpp/setup.py +1 -1
  98. data/vendor/datasketches-cpp/theta/CMakeLists.txt +26 -45
  99. data/vendor/datasketches-cpp/theta/include/bounds_on_ratios_in_sampled_sets.hpp +1 -0
  100. data/vendor/datasketches-cpp/theta/include/compact_theta_sketch_parser_impl.hpp +92 -23
  101. data/vendor/datasketches-cpp/theta/include/theta_helpers.hpp +15 -0
  102. data/vendor/datasketches-cpp/theta/include/theta_intersection_base_impl.hpp +7 -6
  103. data/vendor/datasketches-cpp/theta/include/theta_set_difference_base_impl.hpp +3 -2
  104. data/vendor/datasketches-cpp/theta/include/theta_sketch.hpp +32 -15
  105. data/vendor/datasketches-cpp/theta/include/theta_sketch_impl.hpp +150 -93
  106. data/vendor/datasketches-cpp/theta/include/theta_union.hpp +6 -1
  107. data/vendor/datasketches-cpp/theta/include/theta_union_base.hpp +3 -1
  108. data/vendor/datasketches-cpp/theta/include/theta_union_base_impl.hpp +9 -2
  109. data/vendor/datasketches-cpp/theta/include/theta_union_impl.hpp +8 -5
  110. data/vendor/datasketches-cpp/theta/include/theta_update_sketch_base.hpp +5 -4
  111. data/vendor/datasketches-cpp/theta/include/theta_update_sketch_base_impl.hpp +34 -9
  112. data/vendor/datasketches-cpp/theta/test/CMakeLists.txt +1 -0
  113. data/vendor/datasketches-cpp/theta/test/theta_a_not_b_test.cpp +2 -0
  114. data/vendor/datasketches-cpp/theta/test/theta_compact_empty_from_java_v1.sk +0 -0
  115. data/vendor/datasketches-cpp/theta/test/theta_compact_empty_from_java_v2.sk +0 -0
  116. data/vendor/datasketches-cpp/theta/test/theta_compact_estimation_from_java_v1.sk +0 -0
  117. data/vendor/datasketches-cpp/theta/test/theta_compact_estimation_from_java_v2.sk +0 -0
  118. data/vendor/datasketches-cpp/theta/test/theta_compact_exact_from_java.sk +0 -0
  119. data/vendor/datasketches-cpp/theta/test/theta_intersection_test.cpp +2 -0
  120. data/vendor/datasketches-cpp/theta/test/theta_setop_test.cpp +446 -0
  121. data/vendor/datasketches-cpp/theta/test/theta_sketch_test.cpp +429 -1
  122. data/vendor/datasketches-cpp/theta/test/theta_union_test.cpp +25 -11
  123. data/vendor/datasketches-cpp/tuple/CMakeLists.txt +18 -33
  124. data/vendor/datasketches-cpp/tuple/include/array_of_doubles_sketch.hpp +1 -1
  125. data/vendor/datasketches-cpp/tuple/include/array_of_doubles_sketch_impl.hpp +3 -3
  126. data/vendor/datasketches-cpp/tuple/include/array_of_doubles_union.hpp +1 -1
  127. data/vendor/datasketches-cpp/tuple/include/array_of_doubles_union_impl.hpp +3 -3
  128. data/vendor/datasketches-cpp/tuple/include/tuple_sketch.hpp +29 -9
  129. data/vendor/datasketches-cpp/tuple/include/tuple_sketch_impl.hpp +34 -14
  130. data/vendor/datasketches-cpp/tuple/include/tuple_union.hpp +6 -1
  131. data/vendor/datasketches-cpp/tuple/include/tuple_union_impl.hpp +8 -3
  132. data/vendor/datasketches-cpp/tuple/test/array_of_doubles_sketch_test.cpp +16 -0
  133. data/vendor/datasketches-cpp/tuple/test/tuple_a_not_b_test.cpp +1 -0
  134. data/vendor/datasketches-cpp/tuple/test/tuple_intersection_test.cpp +1 -0
  135. data/vendor/datasketches-cpp/tuple/test/tuple_sketch_test.cpp +46 -8
  136. data/vendor/datasketches-cpp/tuple/test/tuple_union_test.cpp +8 -0
  137. metadata +33 -12
  138. data/vendor/datasketches-cpp/kll/include/kll_quantile_calculator.hpp +0 -75
  139. data/vendor/datasketches-cpp/kll/include/kll_quantile_calculator_impl.hpp +0 -184
  140. data/vendor/datasketches-cpp/req/include/req_quantile_calculator.hpp +0 -69
  141. data/vendor/datasketches-cpp/req/include/req_quantile_calculator_impl.hpp +0 -60
  142. data/vendor/datasketches-cpp/theta/test/theta_update_empty_from_java.sk +0 -0
  143. data/vendor/datasketches-cpp/theta/test/theta_update_estimation_from_java.sk +0 -0
@@ -0,0 +1,446 @@
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
+ #include <sstream>
21
+ #include <stdexcept>
22
+
23
+ #include <catch.hpp>
24
+ #include <theta_union.hpp>
25
+ #include <theta_intersection.hpp>
26
+ #include <theta_a_not_b.hpp>
27
+
28
+ namespace datasketches {
29
+
30
+ static const uint64_t GT_MIDP_V = 3L;
31
+ static const float MIDP = 0.5f;
32
+
33
+ static const uint64_t GT_LOWP_V = 6L;
34
+ static const float LOWP = 0.1f;
35
+ static const long LT_LOWP_V = 4L;
36
+
37
+ static const double LOWP_THETA = LOWP;
38
+
39
+ enum SkType {
40
+ EMPTY, // { 1.0, 0, T} Bin: 101 Oct: 05
41
+ EXACT, // { 1.0, >0, F} Bin: 110 Oct: 06, specify only value
42
+ ESTIMATION, // {<1.0, >0, F} Bin: 010 Oct: 02, specify only value
43
+ DEGENERATE // {<1.0, 0, F} Bin: 000 Oct: 00, specify p, value
44
+ };
45
+
46
+ void check_result(std::string comment, compact_theta_sketch sk, double theta, uint32_t entries, bool empty) {
47
+ bool thetaOk = sk.get_theta() == theta;
48
+ bool entriesOk = sk.get_num_retained() == entries;
49
+ bool emptyOk = sk.is_empty() == empty;
50
+ if (!thetaOk || !entriesOk || !emptyOk) {
51
+ std::ostringstream s;
52
+ s << comment << ": ";
53
+ if (!thetaOk) { s << "theta: expected " << theta << ", got " << sk.get_theta() << "; "; }
54
+ if (!entriesOk) { s << "entries: expected " << entries << ", got " << sk.get_num_retained() << "; "; }
55
+ if (!emptyOk) { s << "empty: expected " << empty << ", got " << sk.is_empty() << "."; }
56
+ FAIL(s.str());
57
+ }
58
+ }
59
+
60
+ update_theta_sketch build_sketch(SkType skType, float p, uint64_t value) {
61
+ update_theta_sketch::builder bldr;
62
+ bldr.set_lg_k(5);
63
+
64
+ switch(skType) {
65
+ case EMPTY: { // { 1.0, 0, T}
66
+ return bldr.build();
67
+ }
68
+ case EXACT: { // { 1.0, >0, F}
69
+ auto sk = bldr.build();
70
+ sk.update(value);
71
+ return sk;
72
+ }
73
+ case ESTIMATION: { // {<1.0, >0, F}
74
+ bldr.set_p(p);
75
+ auto sk = bldr.build();
76
+ sk.update(value);
77
+ return sk;
78
+ }
79
+ case DEGENERATE: { // {<1.0, 0, F}
80
+ bldr.set_p(p);
81
+ auto sk = bldr.build();
82
+ sk.update(value); // > theta
83
+ return sk;
84
+ }
85
+ default: throw std::invalid_argument("invalid case");
86
+ }
87
+ }
88
+
89
+ void checks(
90
+ update_theta_sketch& a,
91
+ update_theta_sketch& b,
92
+ double expectedIntersectTheta,
93
+ uint32_t expectedIntersectCount,
94
+ bool expectedIntersectEmpty,
95
+ double expectedAnotbTheta,
96
+ uint32_t expectedAnotbCount,
97
+ bool expectedAnotbEmpty,
98
+ double expectedUnionTheta,
99
+ uint32_t expectedUnionCount,
100
+ bool expectedUnionEmpty
101
+ ) {
102
+ {
103
+ theta_intersection inter;
104
+ inter.update(a);
105
+ inter.update(b);
106
+ auto csk = inter.get_result();
107
+ check_result("Intersection update sketches", csk, expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty);
108
+ }
109
+ {
110
+ theta_intersection inter;
111
+ inter.update(a.compact());
112
+ inter.update(b.compact());
113
+ auto csk = inter.get_result();
114
+ check_result("Intersection compact sketches", csk, expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty);
115
+ }
116
+ {
117
+ theta_a_not_b a_not_b;
118
+ auto csk = a_not_b.compute(a, b);
119
+ check_result("AnotB update sketches", csk, expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty);
120
+ }
121
+ {
122
+ theta_a_not_b a_not_b;
123
+ auto csk = a_not_b.compute(a.compact(), b.compact());
124
+ check_result("AnotB compact sketches", csk, expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty);
125
+ }
126
+ {
127
+ auto u = theta_union::builder().build();
128
+ u.update(a);
129
+ u.update(b);
130
+ auto csk = u.get_result();
131
+ check_result("Union update sketches", csk, expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
132
+ }
133
+ }
134
+
135
+
136
+ TEST_CASE("empty empty") {
137
+ auto a = build_sketch(SkType::EMPTY, 0, 0);
138
+ auto b = build_sketch(SkType::EMPTY, 0, 0);
139
+ const double expectedIntersectTheta = 1.0;
140
+ const int expectedIntersectCount = 0;
141
+ const bool expectedIntersectEmpty = true;
142
+ const double expectedAnotbTheta = 1.0;
143
+ const int expectedAnotbCount = 0;
144
+ const bool expectedAnotbEmpty = true;
145
+ const double expectedUnionTheta = 1.0;
146
+ const int expectedUnionCount = 0;
147
+ const bool expectedUnionEmpty = true;
148
+
149
+ checks(a, b,
150
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
151
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
152
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
153
+ }
154
+
155
+ TEST_CASE("empty exact") {
156
+ auto a = build_sketch(SkType::EMPTY, 0, 0);
157
+ auto b = build_sketch(SkType::EXACT, 0, GT_MIDP_V);
158
+ const double expectedIntersectTheta = 1.0;
159
+ const int expectedIntersectCount = 0;
160
+ const bool expectedIntersectEmpty = true;
161
+ const double expectedAnotbTheta = 1.0;
162
+ const int expectedAnotbCount = 0;
163
+ const bool expectedAnotbEmpty = true;
164
+ const double expectedUnionTheta = 1.0;
165
+ const int expectedUnionCount = 1;
166
+ const bool expectedUnionEmpty = false;
167
+
168
+ checks(a, b,
169
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
170
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
171
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
172
+ }
173
+
174
+ TEST_CASE("empty degenerate") {
175
+ auto a = build_sketch(SkType::EMPTY, 0, 0);
176
+ auto b = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V);
177
+ const double expectedIntersectTheta = 1.0;
178
+ const int expectedIntersectCount = 0;
179
+ const bool expectedIntersectEmpty = true;
180
+ const double expectedAnotbTheta = 1.0;
181
+ const int expectedAnotbCount = 0;
182
+ const bool expectedAnotbEmpty = true;
183
+ const double expectedUnionTheta = LOWP_THETA;
184
+ const int expectedUnionCount = 0;
185
+ const bool expectedUnionEmpty = false;
186
+
187
+ checks(a, b,
188
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
189
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
190
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
191
+ }
192
+
193
+ TEST_CASE("empty estimation") {
194
+ auto a = build_sketch(SkType::EMPTY, 0, 0);
195
+ auto b = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
196
+ const double expectedIntersectTheta = 1.0;
197
+ const int expectedIntersectCount = 0;
198
+ const bool expectedIntersectEmpty = true;
199
+ const double expectedAnotbTheta = 1.0;
200
+ const int expectedAnotbCount = 0;
201
+ const bool expectedAnotbEmpty = true;
202
+ const double expectedUnionTheta = LOWP_THETA;
203
+ const int expectedUnionCount = 1;
204
+ const bool expectedUnionEmpty = false;
205
+
206
+ checks(a, b,
207
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
208
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
209
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
210
+ }
211
+
212
+ // ---
213
+
214
+ TEST_CASE("exact empty") {
215
+ auto a = build_sketch(SkType::EXACT, 0, GT_MIDP_V);
216
+ auto b = build_sketch(SkType::EMPTY, 0, 0);
217
+ const double expectedIntersectTheta = 1.0;
218
+ const int expectedIntersectCount = 0;
219
+ const bool expectedIntersectEmpty = true;
220
+ const double expectedAnotbTheta = 1.0;
221
+ const int expectedAnotbCount = 1;
222
+ const bool expectedAnotbEmpty = false;
223
+ const double expectedUnionTheta = 1.0;
224
+ const int expectedUnionCount = 1;
225
+ const bool expectedUnionEmpty = false;
226
+
227
+ checks(a, b,
228
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
229
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
230
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
231
+ }
232
+
233
+ TEST_CASE("exact exact") {
234
+ auto a = build_sketch(SkType::EXACT, 0, GT_MIDP_V);
235
+ auto b = build_sketch(SkType::EXACT, 0, GT_MIDP_V);
236
+ const double expectedIntersectTheta = 1.0;
237
+ const int expectedIntersectCount = 1;
238
+ const bool expectedIntersectEmpty = false;
239
+ const double expectedAnotbTheta = 1.0;
240
+ const int expectedAnotbCount = 0;
241
+ const bool expectedAnotbEmpty = true;
242
+ const double expectedUnionTheta = 1.0;
243
+ const int expectedUnionCount = 1;
244
+ const bool expectedUnionEmpty = false;
245
+
246
+ checks(a, b,
247
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
248
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
249
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
250
+ }
251
+
252
+ TEST_CASE("exact degenerate") {
253
+ auto a = build_sketch(SkType::EXACT, 0, LT_LOWP_V);
254
+ auto b = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V); //entries = 0
255
+ const double expectedIntersectTheta = LOWP_THETA;
256
+ const int expectedIntersectCount = 0;
257
+ const bool expectedIntersectEmpty = false;
258
+ const double expectedAnotbTheta = LOWP_THETA;
259
+ const int expectedAnotbCount = 1;
260
+ const bool expectedAnotbEmpty = false;
261
+ const double expectedUnionTheta = LOWP_THETA;
262
+ const int expectedUnionCount = 1;
263
+ const bool expectedUnionEmpty = false;
264
+
265
+ checks(a, b,
266
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
267
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
268
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
269
+ }
270
+
271
+ TEST_CASE("exact estimation") {
272
+ auto a = build_sketch(SkType::EXACT, 0, LT_LOWP_V);
273
+ auto b = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
274
+ const double expectedIntersectTheta = LOWP_THETA;
275
+ const int expectedIntersectCount = 1;
276
+ const bool expectedIntersectEmpty = false;
277
+ const double expectedAnotbTheta = LOWP_THETA;
278
+ const int expectedAnotbCount = 0;
279
+ const bool expectedAnotbEmpty = false;
280
+ const double expectedUnionTheta = LOWP_THETA;
281
+ const int expectedUnionCount = 1;
282
+ const bool expectedUnionEmpty = false;
283
+
284
+ checks(a, b,
285
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
286
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
287
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
288
+ }
289
+
290
+ // ---
291
+
292
+ TEST_CASE("estimation empty") {
293
+ auto a = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
294
+ auto b = build_sketch(SkType::EMPTY, 0, 0);
295
+ const double expectedIntersectTheta = 1.0;
296
+ const int expectedIntersectCount = 0;
297
+ const bool expectedIntersectEmpty = true;
298
+ const double expectedAnotbTheta = LOWP_THETA;
299
+ const int expectedAnotbCount = 1;
300
+ const bool expectedAnotbEmpty = false;
301
+ const double expectedUnionTheta = LOWP_THETA;
302
+ const int expectedUnionCount = 1;
303
+ const bool expectedUnionEmpty = false;
304
+
305
+ checks(a, b,
306
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
307
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
308
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
309
+ }
310
+
311
+ TEST_CASE("estimation exact") {
312
+ auto a = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
313
+ auto b = build_sketch(SkType::EXACT, 0, LT_LOWP_V);
314
+ const double expectedIntersectTheta = LOWP_THETA;
315
+ const int expectedIntersectCount = 1;
316
+ const bool expectedIntersectEmpty = false;
317
+ const double expectedAnotbTheta = LOWP_THETA;
318
+ const int expectedAnotbCount = 0;
319
+ const bool expectedAnotbEmpty = false;
320
+ const double expectedUnionTheta = LOWP_THETA;
321
+ const int expectedUnionCount = 1;
322
+ const bool expectedUnionEmpty = false;
323
+
324
+ checks(a, b,
325
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
326
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
327
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
328
+ }
329
+
330
+ TEST_CASE("estimation degenerate") {
331
+ auto a = build_sketch(SkType::ESTIMATION, MIDP, LT_LOWP_V);
332
+ auto b = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V);
333
+ const double expectedIntersectTheta = LOWP_THETA;
334
+ const int expectedIntersectCount = 0;
335
+ const bool expectedIntersectEmpty = false;
336
+ const double expectedAnotbTheta = LOWP_THETA;
337
+ const int expectedAnotbCount = 1;
338
+ const bool expectedAnotbEmpty = false;
339
+ const double expectedUnionTheta = LOWP_THETA;
340
+ const int expectedUnionCount = 1;
341
+ const bool expectedUnionEmpty = false;
342
+
343
+ checks(a, b,
344
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
345
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
346
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
347
+ }
348
+
349
+ TEST_CASE("estimation estimation") {
350
+ auto a = build_sketch(SkType::ESTIMATION, MIDP, LT_LOWP_V);
351
+ auto b = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
352
+ const double expectedIntersectTheta = LOWP_THETA;
353
+ const int expectedIntersectCount = 1;
354
+ const bool expectedIntersectEmpty = false;
355
+ const double expectedAnotbTheta = LOWP_THETA;
356
+ const int expectedAnotbCount = 0;
357
+ const bool expectedAnotbEmpty = false;
358
+ const double expectedUnionTheta = LOWP_THETA;
359
+ const int expectedUnionCount = 1;
360
+ const bool expectedUnionEmpty = false;
361
+
362
+ checks(a, b,
363
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
364
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
365
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
366
+ }
367
+
368
+ // ---
369
+
370
+ TEST_CASE("degenerate empty") {
371
+ auto a = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V); //entries = 0
372
+ auto b = build_sketch(SkType::EMPTY, 0, 0);
373
+ const double expectedIntersectTheta = 1.0;
374
+ const int expectedIntersectCount = 0;
375
+ const bool expectedIntersectEmpty = true;
376
+ const double expectedAnotbTheta = LOWP_THETA;
377
+ const int expectedAnotbCount = 0;
378
+ const bool expectedAnotbEmpty = false;
379
+ const double expectedUnionTheta = LOWP_THETA;
380
+ const int expectedUnionCount = 0;
381
+ const bool expectedUnionEmpty = false;
382
+
383
+ checks(a, b,
384
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
385
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
386
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
387
+ }
388
+
389
+ TEST_CASE("degenerate exact") {
390
+ auto a = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V); //entries = 0
391
+ auto b = build_sketch(SkType::EXACT, 0, LT_LOWP_V);
392
+ const double expectedIntersectTheta = LOWP_THETA;
393
+ const int expectedIntersectCount = 0;
394
+ const bool expectedIntersectEmpty = false;
395
+ const double expectedAnotbTheta = LOWP_THETA;
396
+ const int expectedAnotbCount = 0;
397
+ const bool expectedAnotbEmpty = false;
398
+ const double expectedUnionTheta = LOWP_THETA;
399
+ const int expectedUnionCount = 1;
400
+ const bool expectedUnionEmpty = false;
401
+
402
+ checks(a, b,
403
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
404
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
405
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
406
+ }
407
+
408
+ TEST_CASE("degenerate degenerate") {
409
+ auto a = build_sketch(SkType::DEGENERATE, MIDP, GT_MIDP_V); //entries = 0
410
+ auto b = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V);
411
+ const double expectedIntersectTheta = LOWP_THETA;
412
+ const int expectedIntersectCount = 0;
413
+ const bool expectedIntersectEmpty = false;
414
+ const double expectedAnotbTheta = LOWP_THETA;
415
+ const int expectedAnotbCount = 0;
416
+ const bool expectedAnotbEmpty = false;
417
+ const double expectedUnionTheta = LOWP_THETA;
418
+ const int expectedUnionCount = 0;
419
+ const bool expectedUnionEmpty = false;
420
+
421
+ checks(a, b,
422
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
423
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
424
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
425
+ }
426
+
427
+ TEST_CASE("degenerate estimation") {
428
+ auto a = build_sketch(SkType::DEGENERATE, MIDP, GT_MIDP_V); //entries = 0
429
+ auto b = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
430
+ const double expectedIntersectTheta = LOWP_THETA;
431
+ const int expectedIntersectCount = 0;
432
+ const bool expectedIntersectEmpty = false;
433
+ const double expectedAnotbTheta = LOWP_THETA;
434
+ const int expectedAnotbCount = 0;
435
+ const bool expectedAnotbEmpty = false;
436
+ const double expectedUnionTheta = LOWP_THETA;
437
+ const int expectedUnionCount = 1;
438
+ const bool expectedUnionEmpty = false;
439
+
440
+ checks(a, b,
441
+ expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
442
+ expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
443
+ expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
444
+ }
445
+
446
+ } /* namespace datasketches */