-
Notifications
You must be signed in to change notification settings - Fork 262
/
containers.h
1827 lines (1733 loc) · 82 KB
/
containers.h
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
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#ifndef CONTAINERS_CONTAINERS_H
#define CONTAINERS_CONTAINERS_H
#include <assert.h>
#include <stdbool.h>
#include <stdio.h>
#include <roaring/containers/array.h>
#include <roaring/containers/bitset.h>
#include <roaring/containers/convert.h>
#include <roaring/containers/mixed_equal.h>
#include <roaring/containers/mixed_intersection.h>
#include <roaring/containers/mixed_negation.h>
#include <roaring/containers/mixed_union.h>
#include <roaring/containers/mixed_xor.h>
#include <roaring/containers/mixed_andnot.h>
#include <roaring/containers/run.h>
// would enum be possible or better?
#define ARRAY_CONTAINER_TYPE_CODE 1
#define RUN_CONTAINER_TYPE_CODE 2
#define BITSET_CONTAINER_TYPE_CODE 3
#define SHARED_CONTAINER_TYPE_CODE 4
// macro for pairing container type codes
#define CONTAINER_PAIR(c1, c2) (4 * (c1) + (c2))
/**
* A shared container is a wrapper around a container
* with reference counting.
*/
struct shared_container_s {
void *container;
uint8_t typecode;
uint32_t counter; // to be managed atomically
};
typedef struct shared_container_s shared_container_t;
/*
* With copy_on_write = true
* Create a new shared container if the typecode is not SHARED_CONTAINER_TYPE,
* otherwise, increase the count
* If copy_on_write = false, then clone.
* Return NULL in case of failure.
**/
void *get_copy_of_container(void *container, uint8_t *typecode,
bool copy_on_write);
/* Frees a shared container (actually decrement its counter and only frees when
* the counter falls to zero). */
void shared_container_free(shared_container_t *container);
/* extract a copy from the shared container, freeing the shared container if
there is just one instance left,
clone instances when the counter is higher than one
*/
void *shared_container_extract_copy(shared_container_t *container,
uint8_t *typecode);
/* access to container underneath */
static const void *container_unwrap_shared(
const void *candidate_shared_container, uint8_t *type) {
if (*type == SHARED_CONTAINER_TYPE_CODE) {
*type =
((const shared_container_t *)candidate_shared_container)->typecode;
assert(*type != SHARED_CONTAINER_TYPE_CODE);
return ((shared_container_t *)candidate_shared_container)->container;
} else {
assert(*type != SHARED_CONTAINER_TYPE_CODE);
return candidate_shared_container;
}
}
/* access to container underneath and queries its type */
static inline uint8_t get_container_type(const void *container, uint8_t type) {
if (type == SHARED_CONTAINER_TYPE_CODE) {
return ((shared_container_t *)container)->typecode;
} else {
return type;
}
}
/**
* Copies a container, requires a typecode. This allocates new memory, caller
* is responsible for deallocation. If the container is not shared, then it is
* physically cloned. Sharable containers are not cloneable.
*/
void *container_clone(const void *container, uint8_t typecode);
/* access to container underneath, cloning it if needed */
static inline void *get_writable_copy_if_shared(
void *candidate_shared_container, uint8_t *type) {
if (*type == SHARED_CONTAINER_TYPE_CODE) {
return shared_container_extract_copy(
(shared_container_t *)candidate_shared_container, type);
} else {
return candidate_shared_container;
}
}
/**
* End of shared container code
*/
static const char *container_names[] = {"bitset", "array", "run", "shared"};
static const char *shared_container_names[] = {
"bitset (shared)", "array (shared)", "run (shared)"};
/**
* Get the container name from the typecode
*/
static inline const char *get_container_name(uint8_t typecode) {
switch (typecode) {
case BITSET_CONTAINER_TYPE_CODE:
return container_names[0];
case ARRAY_CONTAINER_TYPE_CODE:
return container_names[1];
case RUN_CONTAINER_TYPE_CODE:
return container_names[2];
case SHARED_CONTAINER_TYPE_CODE:
return container_names[3];
default:
assert(false);
__builtin_unreachable();
return "unknown";
}
}
static inline const char *get_full_container_name(void *container,
uint8_t typecode) {
switch (typecode) {
case BITSET_CONTAINER_TYPE_CODE:
return container_names[0];
case ARRAY_CONTAINER_TYPE_CODE:
return container_names[1];
case RUN_CONTAINER_TYPE_CODE:
return container_names[2];
case SHARED_CONTAINER_TYPE_CODE:
switch (((shared_container_t *)container)->typecode) {
case BITSET_CONTAINER_TYPE_CODE:
return shared_container_names[0];
case ARRAY_CONTAINER_TYPE_CODE:
return shared_container_names[1];
case RUN_CONTAINER_TYPE_CODE:
return shared_container_names[2];
default:
assert(false);
__builtin_unreachable();
return "unknown";
}
break;
default:
assert(false);
__builtin_unreachable();
return "unknown";
}
__builtin_unreachable();
}
/**
* Get the container cardinality (number of elements), requires a typecode
*/
static inline int container_get_cardinality(const void *container,
uint8_t typecode) {
container = container_unwrap_shared(container, &typecode);
switch (typecode) {
case BITSET_CONTAINER_TYPE_CODE:
return bitset_container_cardinality(
(const bitset_container_t *)container);
case ARRAY_CONTAINER_TYPE_CODE:
return array_container_cardinality(
(const array_container_t *)container);
case RUN_CONTAINER_TYPE_CODE:
return run_container_cardinality(
(const run_container_t *)container);
}
assert(false);
__builtin_unreachable();
return 0; // unreached
}
/* Create a container with all the values between in [min,max) at a
distance k*step from min. */
static inline void *container_from_range(uint8_t *type, uint32_t min,
uint32_t max, uint16_t step) {
if (step == 0) return NULL; // being paranoid
if (step == 1) {
*type = RUN_CONTAINER_TYPE_CODE;
return run_container_create_range(min, max);
}
int size = (max - min + step - 1) / step;
if (size <= DEFAULT_MAX_SIZE) { // array container
*type = ARRAY_CONTAINER_TYPE_CODE;
array_container_t *array = array_container_create_given_capacity(size);
array_container_add_from_range(array, min, max, step);
assert(array->cardinality == size);
return array;
} else { // bitset container
*type = BITSET_CONTAINER_TYPE_CODE;
bitset_container_t *bitset = bitset_container_create();
bitset_container_add_from_range(bitset, min, max, step);
assert(bitset->cardinality == size);
return bitset;
}
}
/**
* "repair" the container after lazy operations.
*/
static inline void *container_repair_after_lazy(void *container,
uint8_t *typecode) {
container = get_writable_copy_if_shared(
container, typecode); // TODO: this introduces unnecessary cloning
void *result = NULL;
switch (*typecode) {
case BITSET_CONTAINER_TYPE_CODE:
((bitset_container_t *)container)->cardinality =
bitset_container_compute_cardinality(
(bitset_container_t *)container);
if (((bitset_container_t *)container)->cardinality <=
DEFAULT_MAX_SIZE) {
result = array_container_from_bitset(
(const bitset_container_t *)container);
bitset_container_free((bitset_container_t *)container);
*typecode = ARRAY_CONTAINER_TYPE_CODE;
return result;
}
return container;
case ARRAY_CONTAINER_TYPE_CODE:
return container; // nothing to do
case RUN_CONTAINER_TYPE_CODE:
return convert_run_to_efficient_container_and_free(
(run_container_t *)container, typecode);
case SHARED_CONTAINER_TYPE_CODE:
assert(false);
}
assert(false);
__builtin_unreachable();
return 0; // unreached
}
/**
* Writes the underlying array to buf, outputs how many bytes were written.
* This is meant to be byte-by-byte compatible with the Java and Go versions of
* Roaring.
* The number of bytes written should be
* container_write(container, buf).
*
*/
static inline int32_t container_write(const void *container, uint8_t typecode,
char *buf) {
container = container_unwrap_shared(container, &typecode);
switch (typecode) {
case BITSET_CONTAINER_TYPE_CODE:
return bitset_container_write((bitset_container_t *)container, buf);
case ARRAY_CONTAINER_TYPE_CODE:
return array_container_write((array_container_t *)container, buf);
case RUN_CONTAINER_TYPE_CODE:
return run_container_write((run_container_t *)container, buf);
}
assert(false);
__builtin_unreachable();
return 0; // unreached
}
/**
* Get the container size in bytes under portable serialization (see
* container_write), requires a
* typecode
*/
static inline int32_t container_size_in_bytes(const void *container,
uint8_t typecode) {
container = container_unwrap_shared(container, &typecode);
switch (typecode) {
case BITSET_CONTAINER_TYPE_CODE:
return bitset_container_size_in_bytes(
(bitset_container_t *)container);
case ARRAY_CONTAINER_TYPE_CODE:
return array_container_size_in_bytes(
(array_container_t *)container);
case RUN_CONTAINER_TYPE_CODE:
return run_container_size_in_bytes((run_container_t *)container);
}
assert(false);
__builtin_unreachable();
return 0; // unreached
}
/**
* print the container (useful for debugging), requires a typecode
*/
void container_printf(const void *container, uint8_t typecode);
/**
* print the content of the container as a comma-separated list of 32-bit values
* starting at base, requires a typecode
*/
void container_printf_as_uint32_array(const void *container, uint8_t typecode,
uint32_t base);
/**
* Checks whether a container is not empty, requires a typecode
*/
static inline bool container_nonzero_cardinality(const void *container,
uint8_t typecode) {
container = container_unwrap_shared(container, &typecode);
switch (typecode) {
case BITSET_CONTAINER_TYPE_CODE:
return bitset_container_nonzero_cardinality(
(bitset_container_t *)container);
case ARRAY_CONTAINER_TYPE_CODE:
return array_container_nonzero_cardinality(
(array_container_t *)container);
case RUN_CONTAINER_TYPE_CODE:
return run_container_nonzero_cardinality(
(run_container_t *)container);
}
assert(false);
__builtin_unreachable();
return 0; // unreached
}
/**
* Recover memory from a container, requires a typecode
*/
static inline void container_free(void *container, uint8_t typecode) {
switch (typecode) {
case BITSET_CONTAINER_TYPE_CODE:
bitset_container_free((bitset_container_t *)container);
break;
case ARRAY_CONTAINER_TYPE_CODE:
array_container_free((array_container_t *)container);
break;
case RUN_CONTAINER_TYPE_CODE:
run_container_free((run_container_t *)container);
break;
case SHARED_CONTAINER_TYPE_CODE:
shared_container_free((shared_container_t *)container);
break;
default:
assert(false);
__builtin_unreachable();
}
}
/**
* Convert a container to an array of values, requires a typecode as well as a
* "base" (most significant values)
* Returns number of ints added.
*/
static inline int container_to_uint32_array(uint32_t *output,
const void *container,
uint8_t typecode, uint32_t base) {
container = container_unwrap_shared(container, &typecode);
switch (typecode) {
case BITSET_CONTAINER_TYPE_CODE:
return bitset_container_to_uint32_array(
output, (bitset_container_t *)container, base);
case ARRAY_CONTAINER_TYPE_CODE:
return array_container_to_uint32_array(
output, (array_container_t *)container, base);
case RUN_CONTAINER_TYPE_CODE:
return run_container_to_uint32_array(
output, (run_container_t *)container, base);
}
assert(false);
__builtin_unreachable();
return 0; // unreached
}
/**
* Add a value to a container, requires a typecode, fills in new_typecode and
* return (possibly different) container.
* This function may allocate a new container, and caller is responsible for
* memory deallocation
*/
static inline void *container_add(void *container, uint16_t val,
uint8_t typecode, uint8_t *new_typecode) {
container = get_writable_copy_if_shared(container, &typecode);
switch (typecode) {
case BITSET_CONTAINER_TYPE_CODE:
bitset_container_set((bitset_container_t *)container, val);
*new_typecode = BITSET_CONTAINER_TYPE_CODE;
return container;
case ARRAY_CONTAINER_TYPE_CODE: {
array_container_t *ac = (array_container_t *)container;
array_container_add(ac, val);
if (array_container_cardinality(ac) > DEFAULT_MAX_SIZE) {
*new_typecode = BITSET_CONTAINER_TYPE_CODE;
return bitset_container_from_array(ac);
} else {
*new_typecode = ARRAY_CONTAINER_TYPE_CODE;
return ac;
}
} break;
case RUN_CONTAINER_TYPE_CODE:
// per Java, no container type adjustments are done (revisit?)
run_container_add((run_container_t *)container, val);
*new_typecode = RUN_CONTAINER_TYPE_CODE;
return container;
default:
assert(false);
__builtin_unreachable();
return NULL;
}
}
/**
* Remove a value from a container, requires a typecode, fills in new_typecode
* and
* return (possibly different) container.
* This function may allocate a new container, and caller is responsible for
* memory deallocation
*/
static inline void *container_remove(void *container, uint16_t val,
uint8_t typecode, uint8_t *new_typecode) {
container = get_writable_copy_if_shared(container, &typecode);
switch (typecode) {
case BITSET_CONTAINER_TYPE_CODE:
if (bitset_container_remove((bitset_container_t *)container, val)) {
if (bitset_container_cardinality(
(bitset_container_t *)container) <= DEFAULT_MAX_SIZE) {
*new_typecode = ARRAY_CONTAINER_TYPE_CODE;
return array_container_from_bitset(
(bitset_container_t *)container);
}
}
*new_typecode = typecode;
return container;
case ARRAY_CONTAINER_TYPE_CODE:
*new_typecode = typecode;
array_container_remove((array_container_t *)container, val);
return container;
case RUN_CONTAINER_TYPE_CODE:
// per Java, no container type adjustments are done (revisit?)
run_container_remove((run_container_t *)container, val);
*new_typecode = RUN_CONTAINER_TYPE_CODE;
return container;
default:
assert(false);
__builtin_unreachable();
return NULL;
}
}
/**
* Check whether a value is in a container, requires a typecode
*/
static inline bool container_contains(const void *container, uint16_t val,
uint8_t typecode) {
container = container_unwrap_shared(container, &typecode);
switch (typecode) {
case BITSET_CONTAINER_TYPE_CODE:
return bitset_container_get((const bitset_container_t *)container,
val);
case ARRAY_CONTAINER_TYPE_CODE:
;
return array_container_contains(
(const array_container_t *)container, val);
case RUN_CONTAINER_TYPE_CODE:
return run_container_contains((const run_container_t *)container,
val);
default:
assert(false);
__builtin_unreachable();
return false;
}
}
int32_t container_serialize(const void *container, uint8_t typecode,
char *buf) WARN_UNUSED;
uint32_t container_serialization_len(const void *container, uint8_t typecode);
void *container_deserialize(uint8_t typecode, const char *buf, size_t buf_len);
/**
* Returns true if the two containers have the same content. Note that
* two containers having different types can be "equal" in this sense.
*/
static inline bool container_equals(const void *c1, uint8_t type1,
const void *c2, uint8_t type2) {
c1 = container_unwrap_shared(c1, &type1);
c2 = container_unwrap_shared(c2, &type2);
switch (CONTAINER_PAIR(type1, type2)) {
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
return bitset_container_equals((bitset_container_t *)c1,
(bitset_container_t *)c2);
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
RUN_CONTAINER_TYPE_CODE):
return run_container_equals_bitset((run_container_t *)c2,
(bitset_container_t *)c1);
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
return run_container_equals_bitset((run_container_t *)c1,
(bitset_container_t *)c2);
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
// java would always return false?
return array_container_equal_bitset((array_container_t *)c2,
(bitset_container_t *)c1);
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
// java would always return false?
return array_container_equal_bitset((array_container_t *)c1,
(bitset_container_t *)c2);
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE, RUN_CONTAINER_TYPE_CODE):
return run_container_equals_array((run_container_t *)c2,
(array_container_t *)c1);
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE, ARRAY_CONTAINER_TYPE_CODE):
return run_container_equals_array((run_container_t *)c1,
(array_container_t *)c2);
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
return array_container_equals((array_container_t *)c1,
(array_container_t *)c2);
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE, RUN_CONTAINER_TYPE_CODE):
return run_container_equals((run_container_t *)c1,
(run_container_t *)c2);
default:
assert(false);
__builtin_unreachable();
return false;
}
}
// macro-izations possibilities for generic non-inplace binary-op dispatch
/**
* Compute intersection between two containers, generate a new container (having
* type result_type), requires a typecode. This allocates new memory, caller
* is responsible for deallocation.
*/
static inline void *container_and(const void *c1, uint8_t type1, const void *c2,
uint8_t type2, uint8_t *result_type) {
c1 = container_unwrap_shared(c1, &type1);
c2 = container_unwrap_shared(c2, &type2);
void *result = NULL;
switch (CONTAINER_PAIR(type1, type2)) {
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
*result_type = bitset_bitset_container_intersection(
(const bitset_container_t *)c1,
(const bitset_container_t *)c2, &result)
? BITSET_CONTAINER_TYPE_CODE
: ARRAY_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
result = array_container_create();
array_container_intersection((const array_container_t *)c1,
(const array_container_t *)c2,
(array_container_t *)result);
*result_type = ARRAY_CONTAINER_TYPE_CODE; // never bitset
return result;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE, RUN_CONTAINER_TYPE_CODE):
result = run_container_create();
run_container_intersection((const run_container_t *)c1,
(const run_container_t *)c2,
(run_container_t *)result);
return convert_run_to_efficient_container_and_free(
(run_container_t *)result, result_type);
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
result = array_container_create();
array_bitset_container_intersection((const array_container_t *)c2,
(const bitset_container_t *)c1,
(array_container_t *)result);
*result_type = ARRAY_CONTAINER_TYPE_CODE; // never bitset
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
result = array_container_create();
*result_type = ARRAY_CONTAINER_TYPE_CODE; // never bitset
array_bitset_container_intersection((const array_container_t *)c1,
(const bitset_container_t *)c2,
(array_container_t *)result);
return result;
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
RUN_CONTAINER_TYPE_CODE):
*result_type = run_bitset_container_intersection(
(const run_container_t *)c2,
(const bitset_container_t *)c1, &result)
? BITSET_CONTAINER_TYPE_CODE
: ARRAY_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
*result_type = run_bitset_container_intersection(
(const run_container_t *)c1,
(const bitset_container_t *)c2, &result)
? BITSET_CONTAINER_TYPE_CODE
: ARRAY_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE, RUN_CONTAINER_TYPE_CODE):
result = array_container_create();
*result_type = ARRAY_CONTAINER_TYPE_CODE; // never bitset
array_run_container_intersection((const array_container_t *)c1,
(const run_container_t *)c2,
(array_container_t *)result);
return result;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE, ARRAY_CONTAINER_TYPE_CODE):
result = array_container_create();
*result_type = ARRAY_CONTAINER_TYPE_CODE; // never bitset
array_run_container_intersection((const array_container_t *)c2,
(const run_container_t *)c1,
(array_container_t *)result);
return result;
default:
assert(false);
__builtin_unreachable();
return NULL;
}
}
/**
* Compute intersection between two containers, with result in the first
container if possible. If the returned pointer is identical to c1,
then the container has been modified. If the returned pointer is different
from c1, then a new container has been created and the caller is responsible
for freeing it.
The type of the first container may change. Returns the modified
(and possibly new) container.
*/
static inline void *container_iand(void *c1, uint8_t type1, const void *c2,
uint8_t type2, uint8_t *result_type) {
c1 = get_writable_copy_if_shared(c1, &type1);
c2 = container_unwrap_shared(c2, &type2);
void *result = NULL;
switch (CONTAINER_PAIR(type1, type2)) {
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
*result_type =
bitset_bitset_container_intersection_inplace(
(bitset_container_t *)c1, (bitset_container_t *)c2, &result)
? BITSET_CONTAINER_TYPE_CODE
: ARRAY_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
array_container_intersection_inplace((array_container_t *)c1,
(const array_container_t *)c2);
*result_type = ARRAY_CONTAINER_TYPE_CODE;
return c1;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE, RUN_CONTAINER_TYPE_CODE):
result = run_container_create();
run_container_intersection((const run_container_t *)c1,
(const run_container_t *)c2,
(run_container_t *)result);
// as of January 2016, Java code used non-in-place intersection for
// two runcontainers
return convert_run_to_efficient_container_and_free(
(run_container_t *)result, result_type);
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
// c1 is a bitmap so no inplace possible
result = array_container_create();
array_bitset_container_intersection((const array_container_t *)c2,
(const bitset_container_t *)c1,
(array_container_t *)result);
*result_type = ARRAY_CONTAINER_TYPE_CODE; // never bitset
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
*result_type = ARRAY_CONTAINER_TYPE_CODE; // never bitset
array_bitset_container_intersection(
(const array_container_t *)c1, (const bitset_container_t *)c2,
(array_container_t *)c1); // allowed
return c1;
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
RUN_CONTAINER_TYPE_CODE):
// will attempt in-place computation
*result_type = run_bitset_container_intersection(
(const run_container_t *)c2,
(const bitset_container_t *)c1, &c1)
? BITSET_CONTAINER_TYPE_CODE
: ARRAY_CONTAINER_TYPE_CODE;
return c1;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
*result_type = run_bitset_container_intersection(
(const run_container_t *)c1,
(const bitset_container_t *)c2, &result)
? BITSET_CONTAINER_TYPE_CODE
: ARRAY_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE, RUN_CONTAINER_TYPE_CODE):
result = array_container_create();
*result_type = ARRAY_CONTAINER_TYPE_CODE; // never bitset
array_run_container_intersection((const array_container_t *)c1,
(const run_container_t *)c2,
(array_container_t *)result);
return result;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE, ARRAY_CONTAINER_TYPE_CODE):
result = array_container_create();
*result_type = ARRAY_CONTAINER_TYPE_CODE; // never bitset
array_run_container_intersection((const array_container_t *)c2,
(const run_container_t *)c1,
(array_container_t *)result);
return result;
default:
assert(false);
__builtin_unreachable();
return NULL;
}
}
/**
* Compute union between two containers, generate a new container (having type
* result_type), requires a typecode. This allocates new memory, caller
* is responsible for deallocation.
*/
static inline void *container_or(const void *c1, uint8_t type1, const void *c2,
uint8_t type2, uint8_t *result_type) {
c1 = container_unwrap_shared(c1, &type1);
c2 = container_unwrap_shared(c2, &type2);
void *result = NULL;
switch (CONTAINER_PAIR(type1, type2)) {
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
result = bitset_container_create();
bitset_container_or((const bitset_container_t *)c1,
(const bitset_container_t *)c2,
(bitset_container_t *)result);
*result_type = BITSET_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
*result_type = array_array_container_union(
(const array_container_t *)c1,
(const array_container_t *)c2, &result)
? BITSET_CONTAINER_TYPE_CODE
: ARRAY_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE, RUN_CONTAINER_TYPE_CODE):
result = run_container_create();
run_container_union((const run_container_t *)c1,
(const run_container_t *)c2,
(run_container_t *)result);
*result_type = RUN_CONTAINER_TYPE_CODE;
// todo: could be optimized since will never convert to array
result = convert_run_to_efficient_container_and_free(
(run_container_t *)result, (uint8_t *)result_type);
return result;
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
result = bitset_container_create();
array_bitset_container_union((const array_container_t *)c2,
(const bitset_container_t *)c1,
(bitset_container_t *)result);
*result_type = BITSET_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
result = bitset_container_create();
array_bitset_container_union((const array_container_t *)c1,
(const bitset_container_t *)c2,
(bitset_container_t *)result);
*result_type = BITSET_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
RUN_CONTAINER_TYPE_CODE):
if (run_container_is_full((run_container_t *)c2)) {
result = run_container_create();
*result_type = RUN_CONTAINER_TYPE_CODE;
run_container_copy((const run_container_t *)c2,
(run_container_t *)result);
return result;
}
result = bitset_container_create();
run_bitset_container_union((const run_container_t *)c2,
(const bitset_container_t *)c1,
(bitset_container_t *)result);
*result_type = BITSET_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
if (run_container_is_full((const run_container_t *)c1)) {
result = run_container_create();
*result_type = RUN_CONTAINER_TYPE_CODE;
run_container_copy((const run_container_t *)c1,
(run_container_t *)result);
return result;
}
result = bitset_container_create();
run_bitset_container_union((const run_container_t *)c1,
(const bitset_container_t *)c2,
(bitset_container_t *)result);
*result_type = BITSET_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE, RUN_CONTAINER_TYPE_CODE):
result = run_container_create();
array_run_container_union((const array_container_t *)c1,
(const run_container_t *)c2,
(run_container_t *)result);
result = convert_run_to_efficient_container_and_free(
(run_container_t *)result, (uint8_t *)result_type);
return result;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE, ARRAY_CONTAINER_TYPE_CODE):
result = run_container_create();
array_run_container_union((const array_container_t *)c2,
(const run_container_t *)c1,
(run_container_t *)result);
result = convert_run_to_efficient_container_and_free(
(run_container_t *)result, (uint8_t *)result_type);
return result;
default:
assert(false);
__builtin_unreachable();
return NULL; // unreached
}
}
/**
* Compute union between two containers, generate a new container (having type
* result_type), requires a typecode. This allocates new memory, caller
* is responsible for deallocation.
*
* This lazy version delays some operations such as the maintenance of the
* cardinality. It requires repair later on the generated containers.
*/
static inline void *container_lazy_or(const void *c1, uint8_t type1,
const void *c2, uint8_t type2,
uint8_t *result_type) {
c1 = container_unwrap_shared(c1, &type1);
c2 = container_unwrap_shared(c2, &type2);
void *result = NULL;
switch (CONTAINER_PAIR(type1, type2)) {
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
result = bitset_container_create();
bitset_container_or_nocard(
(const bitset_container_t *)c1, (const bitset_container_t *)c2,
(bitset_container_t *)result); // is lazy
*result_type = BITSET_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
*result_type = array_array_container_lazy_union(
(const array_container_t *)c1,
(const array_container_t *)c2, &result)
? BITSET_CONTAINER_TYPE_CODE
: ARRAY_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE, RUN_CONTAINER_TYPE_CODE):
result = run_container_create();
run_container_union((const run_container_t *)c1,
(const run_container_t *)c2,
(run_container_t *)result);
*result_type = RUN_CONTAINER_TYPE_CODE;
// we are being lazy
result = convert_run_to_efficient_container(
(run_container_t *)result, result_type);
return result;
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
result = bitset_container_create();
array_bitset_container_lazy_union(
(const array_container_t *)c2, (const bitset_container_t *)c1,
(bitset_container_t *)result); // is lazy
*result_type = BITSET_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
result = bitset_container_create();
array_bitset_container_lazy_union(
(const array_container_t *)c1, (const bitset_container_t *)c2,
(bitset_container_t *)result); // is lazy
*result_type = BITSET_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
RUN_CONTAINER_TYPE_CODE):
if (run_container_is_full((const run_container_t *)c2)) {
result = run_container_create();
*result_type = RUN_CONTAINER_TYPE_CODE;
run_container_copy((const run_container_t *)c2,
(run_container_t *)result);
return result;
}
result = bitset_container_create();
run_bitset_container_lazy_union(
(const run_container_t *)c2, (const bitset_container_t *)c1,
(bitset_container_t *)result); // is lazy
*result_type = BITSET_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
if (run_container_is_full((const run_container_t *)c1)) {
result = run_container_create();
*result_type = RUN_CONTAINER_TYPE_CODE;
run_container_copy((const run_container_t *)c1,
(run_container_t *)result);
return result;
}
result = bitset_container_create();
run_bitset_container_lazy_union(
(const run_container_t *)c1, (const bitset_container_t *)c2,
(bitset_container_t *)result); // is lazy
*result_type = BITSET_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE, RUN_CONTAINER_TYPE_CODE):
result = run_container_create();
array_run_container_union((const array_container_t *)c1,
(const run_container_t *)c2,
(run_container_t *)result);
*result_type = RUN_CONTAINER_TYPE_CODE;
// next line skipped since we are lazy
// result = convert_run_to_efficient_container(result, result_type);
return result;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE, ARRAY_CONTAINER_TYPE_CODE):
result = run_container_create();
array_run_container_union(
(const array_container_t *)c2, (const run_container_t *)c1,
(run_container_t *)result); // TODO make lazy
*result_type = RUN_CONTAINER_TYPE_CODE;
// next line skipped since we are lazy
// result = convert_run_to_efficient_container(result, result_type);
return result;
default:
assert(false);
__builtin_unreachable();
return NULL; // unreached
}
}
/**
* Compute the union between two containers, with result in the first container.
* If the returned pointer is identical to c1, then the container has been
* modified.
* If the returned pointer is different from c1, then a new container has been
* created and the caller is responsible for freeing it.
* The type of the first container may change. Returns the modified
* (and possibly new) container
*/
static inline void *container_ior(void *c1, uint8_t type1, const void *c2,
uint8_t type2, uint8_t *result_type) {
c1 = get_writable_copy_if_shared(c1, &type1);
c2 = container_unwrap_shared(c2, &type2);
void *result = NULL;
switch (CONTAINER_PAIR(type1, type2)) {
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
bitset_container_or((const bitset_container_t *)c1,
(const bitset_container_t *)c2,
(bitset_container_t *)c1);
*result_type = BITSET_CONTAINER_TYPE_CODE;
return c1;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
// Java impl. also does not do real in-place in this case
*result_type = array_array_container_union(
(const array_container_t *)c1,
(const array_container_t *)c2, &result)
? BITSET_CONTAINER_TYPE_CODE
: ARRAY_CONTAINER_TYPE_CODE;
return result;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE, RUN_CONTAINER_TYPE_CODE):
run_container_union_inplace((run_container_t *)c1,
(const run_container_t *)c2);
return convert_run_to_efficient_container((run_container_t *)c1,
result_type);
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
ARRAY_CONTAINER_TYPE_CODE):
array_bitset_container_union((const array_container_t *)c2,
(const bitset_container_t *)c1,
(bitset_container_t *)c1);
*result_type = BITSET_CONTAINER_TYPE_CODE; // never array
return c1;
case CONTAINER_PAIR(ARRAY_CONTAINER_TYPE_CODE,
BITSET_CONTAINER_TYPE_CODE):
// c1 is an array, so no in-place possible
result = bitset_container_create();
*result_type = BITSET_CONTAINER_TYPE_CODE;
array_bitset_container_union((const array_container_t *)c1,
(const bitset_container_t *)c2,
(bitset_container_t *)result);
return result;
case CONTAINER_PAIR(BITSET_CONTAINER_TYPE_CODE,
RUN_CONTAINER_TYPE_CODE):
if (run_container_is_full((const run_container_t *)c2)) {
result = run_container_create();
*result_type = RUN_CONTAINER_TYPE_CODE;
run_container_copy((const run_container_t *)c2,
(run_container_t *)result);
return result;
}
run_bitset_container_union((const run_container_t *)c2,
(const bitset_container_t *)c1,
(bitset_container_t *)c1); // allowed
*result_type = BITSET_CONTAINER_TYPE_CODE;
return c1;
case CONTAINER_PAIR(RUN_CONTAINER_TYPE_CODE,