libdatasketches_sys 0.1.3

Low-level bindings for Apache DataSketches C++ library
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */

#include <sstream>
#include <stdexcept>

#include <catch2/catch.hpp>
#include <theta_union.hpp>
#include <theta_intersection.hpp>
#include <theta_a_not_b.hpp>

namespace datasketches {

static const uint64_t GT_MIDP_V  = 3L;
static const float MIDP          = 0.5f;

static const uint64_t GT_LOWP_V  = 6L;
static const float LOWP          = 0.1f;
static const long LT_LOWP_V      = 4L;

static const double LOWP_THETA   = LOWP;

enum SkType {
  EMPTY,      // { 1.0,  0, T} Bin: 101  Oct: 05
  EXACT,      // { 1.0, >0, F} Bin: 110  Oct: 06, specify only value
  ESTIMATION, // {<1.0, >0, F} Bin: 010  Oct: 02, specify only value
  DEGENERATE  // {<1.0,  0, F} Bin: 000  Oct: 00, specify p, value
};

void check_result(std::string comment, compact_theta_sketch sk, double theta, uint32_t entries, bool empty) {
  bool thetaOk = sk.get_theta() == theta;
  bool entriesOk = sk.get_num_retained() == entries;
  bool emptyOk = sk.is_empty() == empty;
  if (!thetaOk || !entriesOk || !emptyOk) {
    std::ostringstream s;
    s << comment << ": ";
    if (!thetaOk)   { s << "theta: expected " << theta << ", got " << sk.get_theta() << "; "; }
    if (!entriesOk) { s << "entries: expected " << entries << ", got " << sk.get_num_retained() << "; "; }
    if (!emptyOk)   { s << "empty: expected " << empty << ", got " << sk.is_empty() << "."; }
    FAIL(s.str());
  }
}

update_theta_sketch build_sketch(SkType skType, float p, uint64_t value) {
  update_theta_sketch::builder bldr;
  bldr.set_lg_k(5);

  switch(skType) {
    case EMPTY: { // { 1.0,  0, T}
      return bldr.build();
    }
    case EXACT: { // { 1.0, >0, F}
      auto sk = bldr.build();
      sk.update(value);
      return sk;
    }
    case ESTIMATION: { // {<1.0, >0, F}
      bldr.set_p(p);
      auto sk = bldr.build();
      sk.update(value);
      return sk;
    }
    case DEGENERATE: { // {<1.0,  0, F}
      bldr.set_p(p);
      auto sk = bldr.build();
      sk.update(value); // > theta
      return sk;
    }
    default: throw std::invalid_argument("invalid case");
  }
}

void checks(
  update_theta_sketch& a,
  update_theta_sketch& b,
  double expectedIntersectTheta,
  uint32_t expectedIntersectCount,
  bool expectedIntersectEmpty,
  double expectedAnotbTheta,
  uint32_t expectedAnotbCount,
  bool expectedAnotbEmpty,
  double expectedUnionTheta,
  uint32_t expectedUnionCount,
  bool expectedUnionEmpty
) {
  {
    theta_intersection inter;
    inter.update(a);
    inter.update(b);
    auto csk = inter.get_result();
    check_result("Intersection update sketches", csk, expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty);
  }
  {
    theta_intersection inter;
    inter.update(a.compact());
    inter.update(b.compact());
    auto csk = inter.get_result();
    check_result("Intersection compact sketches", csk, expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty);
  }
  {
    theta_a_not_b a_not_b;
    auto csk = a_not_b.compute(a, b);
    check_result("AnotB update sketches", csk, expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty);
  }
  {
    theta_a_not_b a_not_b;
    auto csk = a_not_b.compute(a.compact(), b.compact());
    check_result("AnotB compact sketches", csk, expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty);
  }
  {
    auto u = theta_union::builder().build();
    u.update(a);
    u.update(b);
    auto csk = u.get_result();
    check_result("Union update sketches", csk, expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
  }
}


TEST_CASE("empty empty") {
  auto a = build_sketch(SkType::EMPTY, 0, 0);
  auto b = build_sketch(SkType::EMPTY, 0, 0);
  const double expectedIntersectTheta = 1.0;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = true;
  const double expectedAnotbTheta = 1.0;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = true;
  const double expectedUnionTheta = 1.0;
  const int expectedUnionCount = 0;
  const bool expectedUnionEmpty = true;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("empty exact") {
  auto a = build_sketch(SkType::EMPTY, 0, 0);
  auto b = build_sketch(SkType::EXACT, 0, GT_MIDP_V);
  const double expectedIntersectTheta = 1.0;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = true;
  const double expectedAnotbTheta = 1.0;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = true;
  const double expectedUnionTheta = 1.0;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("empty degenerate") {
  auto a = build_sketch(SkType::EMPTY, 0, 0);
  auto b = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V);
  const double expectedIntersectTheta = 1.0;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = true;
  const double expectedAnotbTheta = 1.0;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = true;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 0;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("empty estimation") {
  auto a = build_sketch(SkType::EMPTY, 0, 0);
  auto b = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
  const double expectedIntersectTheta = 1.0;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = true;
  const double expectedAnotbTheta = 1.0;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = true;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

// ---

TEST_CASE("exact empty") {
  auto a = build_sketch(SkType::EXACT, 0, GT_MIDP_V);
  auto b = build_sketch(SkType::EMPTY, 0, 0);
  const double expectedIntersectTheta = 1.0;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = true;
  const double expectedAnotbTheta = 1.0;
  const int expectedAnotbCount = 1;
  const bool expectedAnotbEmpty = false;
  const double expectedUnionTheta = 1.0;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("exact exact") {
  auto a = build_sketch(SkType::EXACT, 0, GT_MIDP_V);
  auto b = build_sketch(SkType::EXACT, 0, GT_MIDP_V);
  const double expectedIntersectTheta = 1.0;
  const int expectedIntersectCount = 1;
  const bool expectedIntersectEmpty = false;
  const double expectedAnotbTheta = 1.0;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = true;
  const double expectedUnionTheta = 1.0;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("exact degenerate") {
  auto a = build_sketch(SkType::EXACT, 0, LT_LOWP_V);
  auto b = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V); //entries = 0
  const double expectedIntersectTheta = LOWP_THETA;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = false;
  const double expectedAnotbTheta = LOWP_THETA;
  const int expectedAnotbCount = 1;
  const bool expectedAnotbEmpty = false;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("exact estimation") {
  auto a = build_sketch(SkType::EXACT, 0, LT_LOWP_V);
  auto b = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
  const double expectedIntersectTheta = LOWP_THETA;
  const int expectedIntersectCount = 1;
  const bool expectedIntersectEmpty = false;
  const double expectedAnotbTheta = LOWP_THETA;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = false;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

// ---

TEST_CASE("estimation empty") {
  auto a = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
  auto b = build_sketch(SkType::EMPTY, 0, 0);
  const double expectedIntersectTheta = 1.0;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = true;
  const double expectedAnotbTheta = LOWP_THETA;
  const int expectedAnotbCount = 1;
  const bool expectedAnotbEmpty = false;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("estimation exact") {
  auto a = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
  auto b = build_sketch(SkType::EXACT, 0, LT_LOWP_V);
  const double expectedIntersectTheta = LOWP_THETA;
  const int expectedIntersectCount = 1;
  const bool expectedIntersectEmpty = false;
  const double expectedAnotbTheta = LOWP_THETA;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = false;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("estimation degenerate") {
  auto a = build_sketch(SkType::ESTIMATION, MIDP, LT_LOWP_V);
  auto b = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V);
  const double expectedIntersectTheta = LOWP_THETA;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = false;
  const double expectedAnotbTheta = LOWP_THETA;
  const int expectedAnotbCount = 1;
  const bool expectedAnotbEmpty = false;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("estimation estimation") {
  auto a = build_sketch(SkType::ESTIMATION, MIDP, LT_LOWP_V);
  auto b = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
  const double expectedIntersectTheta = LOWP_THETA;
  const int expectedIntersectCount = 1;
  const bool expectedIntersectEmpty = false;
  const double expectedAnotbTheta = LOWP_THETA;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = false;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

// ---

TEST_CASE("degenerate empty") {
  auto a = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V); //entries = 0
  auto b = build_sketch(SkType::EMPTY, 0, 0);
  const double expectedIntersectTheta = 1.0;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = true;
  const double expectedAnotbTheta = LOWP_THETA;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = false;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 0;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("degenerate exact") {
  auto a = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V); //entries = 0
  auto b = build_sketch(SkType::EXACT, 0, LT_LOWP_V);
  const double expectedIntersectTheta = LOWP_THETA;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = false;
  const double expectedAnotbTheta = LOWP_THETA;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = false;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("degenerate degenerate") {
  auto a = build_sketch(SkType::DEGENERATE, MIDP, GT_MIDP_V); //entries = 0
  auto b = build_sketch(SkType::DEGENERATE, LOWP, GT_LOWP_V);
  const double expectedIntersectTheta = LOWP_THETA;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = false;
  const double expectedAnotbTheta = LOWP_THETA;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = false;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 0;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

TEST_CASE("degenerate estimation") {
  auto a = build_sketch(SkType::DEGENERATE, MIDP, GT_MIDP_V); //entries = 0
  auto b = build_sketch(SkType::ESTIMATION, LOWP, LT_LOWP_V);
  const double expectedIntersectTheta = LOWP_THETA;
  const int expectedIntersectCount = 0;
  const bool expectedIntersectEmpty = false;
  const double expectedAnotbTheta = LOWP_THETA;
  const int expectedAnotbCount = 0;
  const bool expectedAnotbEmpty = false;
  const double expectedUnionTheta = LOWP_THETA;
  const int expectedUnionCount = 1;
  const bool expectedUnionEmpty = false;

  checks(a, b,
      expectedIntersectTheta, expectedIntersectCount, expectedIntersectEmpty,
      expectedAnotbTheta, expectedAnotbCount, expectedAnotbEmpty,
      expectedUnionTheta, expectedUnionCount, expectedUnionEmpty);
}

} /* namespace datasketches */