-
Notifications
You must be signed in to change notification settings - Fork 5.6k
/
value.h
2298 lines (1945 loc) · 75.4 KB
/
value.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
/**
* Copyright (C) 2019-present MongoDB, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the Server Side Public License, version 1,
* as published by MongoDB, Inc.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* Server Side Public License for more details.
*
* You should have received a copy of the Server Side Public License
* along with this program. If not, see
* <http://www.mongodb.com/licensing/server-side-public-license>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the Server Side Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#pragma once
#include <absl/container/flat_hash_map.h>
#include <absl/container/flat_hash_set.h>
#include <boost/predef/hardware/simd.h>
// IWYU pragma: no_include "boost/container/detail/std_fwd.hpp"
// IWYU pragma: no_include "boost/predef/hardware/simd/x86.h"
// IWYU pragma: no_include "boost/predef/hardware/simd/x86/versions.h"
// IWYU pragma: no_include "ext/alloc_traits.h"
// IWYU pragma: no_include "emmintrin.h"
#include <algorithm>
#include <array>
#include <bitset>
#include <climits>
#include <cstdint>
#include <cstring>
#include <limits>
#include <memory>
#include <ostream>
#include <set>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
#include "mongo/base/data_type_endian.h"
#include "mongo/base/data_view.h"
#include "mongo/base/string_data.h"
#include "mongo/bson/bsontypes.h"
#include "mongo/bson/ordering.h"
#include "mongo/config.h" // IWYU pragma: keep
#include "mongo/db/exec/sbe/values/key_string_entry.h"
#include "mongo/db/exec/shard_filterer.h"
#include "mongo/db/fts/fts_matcher.h"
#include "mongo/db/matcher/expression.h"
#include "mongo/db/query/bson_typemask.h"
#include "mongo/db/query/collation/collator_interface.h"
#include "mongo/db/query/datetime/date_time_support.h"
#include "mongo/db/query/index_bounds.h"
#include "mongo/db/record_id.h"
#include "mongo/db/storage/key_string.h"
#include "mongo/db/storage/sorted_data_interface.h"
#include "mongo/platform/bits.h"
#include "mongo/platform/compiler.h"
#include "mongo/platform/decimal128.h"
#include "mongo/platform/endian.h"
#include "mongo/util/assert_util.h"
#include "mongo/util/pcre.h"
#include "mongo/util/represent_as.h"
#include "mongo/util/shared_buffer.h"
#include "mongo/util/str.h"
namespace mongo {
/**
* Forward declarations.
*/
class RecordId;
namespace KeyString {
class Value;
} // namespace KeyString
class TimeZoneDatabase;
class TimeZone;
class JsFunction;
namespace sbe {
/**
* Trivially copyable variation on a tuple theme. This allow us to return tuples through registers.
*/
template <typename...>
struct FastTuple;
template <typename... Ts>
FastTuple(Ts...) -> FastTuple<Ts...>;
template <typename A, typename B, typename C>
struct FastTuple<A, B, C> {
A a;
B b;
C c;
};
struct MakeObjSpec;
class SortSpec;
class InList;
using FrameId = int64_t;
using SpoolId = int64_t;
static constexpr int64_t kInvalidId = LLONG_MIN;
using IndexKeysInclusionSet = std::bitset<Ordering::kMaxCompoundIndexKeys>;
namespace value {
struct CsiCell;
struct ValueBlock;
struct CellBlock;
static constexpr size_t kNewUUIDLength = 16;
/**
* Type dispatch tags.
*
* There are two kinds of SBE types: native types and extended types. In the enum below, native
* types are listed first followed by extended types, with 'EndOfNativeTypeTags' marking the
* boundary between the two.
*
* The 'sbe_values' module take a link-time dependency on the implementations for native types but
* not for extended types.
*
* Extended types cannot be used with value::compareValue() or value::hashValue(). Also, for any
* SBE type 'tag', if 'value::tagToType(tag) != EOO' is true then 'tag' must be a native type.
* Likewise, if 'tag' is an extended type then 'value::tagToType(tag) == EOO' must be true.
*/
enum class TypeTags : uint8_t {
// The value does not exist, aka Nothing in the Maybe monad.
Nothing = 0,
// Numerical data types.
NumberInt32,
NumberInt64,
NumberDouble,
// Date data types.
Date,
Timestamp,
Boolean,
Null,
MinKey,
MaxKey,
// Pointer to sort key component vector. This type is always owned within a SortSpec,
// and is never created, copied, or destroyed by SBE.
sortKeyComponentVector,
// Pointer to a struct with data necessary to read values from a columnstore index cell. The
// values of this type are fully owned by the column_scan stage and are never created, cloned or
// destroyed by SBE.
csiCell,
StringSmall,
// Special marker
EndOfShallowTypeTags = StringSmall,
// Heap values
NumberDecimal,
StringBig,
Array,
ArraySet,
ArrayMultiSet,
Object,
MultiMap,
ObjectId,
RecordId,
// Raw bson values.
bsonObject,
bsonArray,
bsonString,
bsonSymbol,
bsonObjectId,
bsonBinData,
// The bson prefix signifies the fact that this type can only come from BSON (either from disk
// or from user over the wire). It is never created or manipulated by SBE.
bsonUndefined,
bsonRegex,
bsonJavascript,
bsonDBPointer,
bsonCodeWScope,
// Local lambda value
LocalLambda,
// The index key string.
keyString,
// Pointer to a timezone database object.
timeZoneDB,
// Pointer to a timezone object
timeZone,
// Pointer to a collator interface object.
collator,
// Pointer to a ValueBlock object.
valueBlock,
// Pointer to a CellBlock object.
cellBlock,
// Special marker
EndOfNativeTypeTags = cellBlock,
// Pointer to a compiled PCRE regular expression object.
pcreRegex,
// Pointer to a compiled JS function with scope.
jsFunction,
// Pointer to a ShardFilterer for shard filtering.
shardFilterer,
// Pointer to an fts::FTSMatcher object for full text search.
ftsMatcher,
// Pointer to a SortSpec object.
sortSpec,
// Pointer to a MakeObjSpec object.
makeObjSpec,
// Pointer to an IndexBounds object.
indexBounds,
// Pointer to an InList object.
inList,
// Special marker, must be last.
TypeTagsMax,
};
inline constexpr bool isNumber(TypeTags tag) noexcept {
return tag == TypeTags::NumberInt32 || tag == TypeTags::NumberInt64 ||
tag == TypeTags::NumberDouble || tag == TypeTags::NumberDecimal;
}
inline constexpr bool isString(TypeTags tag) noexcept {
return tag == TypeTags::StringSmall || tag == TypeTags::StringBig ||
tag == TypeTags::bsonString;
}
inline constexpr bool isObject(TypeTags tag) noexcept {
return tag == TypeTags::Object || tag == TypeTags::bsonObject;
}
inline constexpr bool isArray(TypeTags tag) noexcept {
return tag == TypeTags::Array || tag == TypeTags::ArraySet || tag == TypeTags::ArrayMultiSet ||
tag == TypeTags::bsonArray;
}
inline constexpr bool isInList(TypeTags tag) noexcept {
return tag == TypeTags::inList;
}
inline constexpr bool isNullish(TypeTags tag) noexcept {
return tag == TypeTags::Nothing || tag == TypeTags::Null || tag == TypeTags::bsonUndefined;
}
inline constexpr bool isObjectId(TypeTags tag) noexcept {
return tag == TypeTags::ObjectId || tag == TypeTags::bsonObjectId;
}
inline constexpr bool isBinData(TypeTags tag) noexcept {
return tag == TypeTags::bsonBinData;
}
inline constexpr bool isRecordId(TypeTags tag) noexcept {
return tag == TypeTags::RecordId;
}
inline constexpr bool isPcreRegex(TypeTags tag) noexcept {
return tag == TypeTags::pcreRegex;
}
inline constexpr bool isBsonRegex(TypeTags tag) noexcept {
return tag == TypeTags::bsonRegex;
}
inline constexpr bool isTimeZone(TypeTags tag) noexcept {
return tag == TypeTags::timeZone;
}
inline constexpr bool isStringOrSymbol(TypeTags tag) noexcept {
return isString(tag) || tag == TypeTags::bsonSymbol;
}
inline constexpr bool isCollatableType(TypeTags tag) noexcept {
return isStringOrSymbol(tag) || isArray(tag) || isObject(tag);
}
inline constexpr bool isShallowType(TypeTags tag) noexcept {
return tag <= TypeTags::EndOfShallowTypeTags;
}
BSONType tagToType(TypeTags tag) noexcept;
/**
* This function takes an SBE TypeTag, looks up the corresponding BSONType t, and then returns a
* bitmask representation of a set of BSONTypes that contains only BSONType t.
*
* For details on how sets of BSONTypes are represented as bitmasks, see mongo::getBSONTypeMask().
*/
inline uint32_t getBSONTypeMask(value::TypeTags tag) noexcept {
BSONType t = value::tagToType(tag);
return getBSONTypeMask(t);
}
/**
* The runtime value. It is a simple 64 bit integer.
*/
using Value = uint64_t;
/**
* Sort direction of ordered sequence.
*/
enum class SortDirection : uint8_t { Descending, Ascending };
/**
* Forward declarations.
*/
/**
* Releases memory allocated for the value. If the value does not have any memory allocated for it,
* does nothing.
*
* NOTE: This function is intentionally marked as 'noexcept' and must not throw. It is used in the
* destructors of several classes to implement RAII concept for values.
*/
void releaseValueDeep(TypeTags tag, Value val) noexcept;
std::pair<TypeTags, Value> copyValue(TypeTags tag, Value val);
std::size_t hashValue(TypeTags tag,
Value val,
const CollatorInterface* collator = nullptr) noexcept;
inline void releaseValue(TypeTags tag, Value val) noexcept {
if (!isShallowType(tag)) {
releaseValueDeep(tag, val);
} else {
// No action is needed to release "shallow" values.
}
}
/**
* Overloads for writing values and tags to stream.
*/
std::ostream& operator<<(std::ostream& os, TypeTags tag);
str::stream& operator<<(str::stream& str, TypeTags tag);
std::ostream& operator<<(std::ostream& os, const std::pair<TypeTags, Value>& value);
str::stream& operator<<(str::stream& str, const std::pair<TypeTags, Value>& value);
/**
* Functions for writing values and tags to a std::string.
*/
std::string print(const std::pair<TypeTags, Value>& value); // production function
std::string printTagAndVal(TypeTags tag, Value value); // debugging function
std::string printTagAndVal(const std::pair<TypeTags, Value>& value); // debugging function
/**
* Performs a three-way comparison for any type that has < and == operators. Additionally,
* guarantees that the result will be exactlty -1, 0, or 1, which is important, because not all
* comparison functions make that guarantee.
*
* The StringData::compare(basic_string_view s) function, for example, only promises that it
* will return a value less than 0 in the case that 'this' is less than 's,' whereas we want to
* return exactly -1.
*/
template <typename T>
int32_t compareHelper(const T lhs, const T rhs) noexcept {
return lhs < rhs ? -1 : (lhs == rhs ? 0 : 1);
}
/**
* Three ways value comparison (aka spaceship operator).
*/
std::pair<TypeTags, Value> compareValue(TypeTags lhsTag,
Value lhsValue,
TypeTags rhsTag,
Value rhsValue,
const StringDataComparator* comparator = nullptr);
inline std::pair<TypeTags, Value> compare3way(TypeTags lhsTag,
Value lhsValue,
TypeTags rhsTag,
Value rhsValue,
const StringDataComparator* comparator = nullptr) {
if (lhsTag == TypeTags::Nothing || rhsTag == TypeTags::Nothing) {
return {TypeTags::Nothing, 0};
}
return compareValue(lhsTag, lhsValue, rhsTag, rhsValue, comparator);
}
bool isNaN(TypeTags tag, Value val) noexcept;
bool isInfinity(TypeTags tag, Value val) noexcept;
/**
* A simple hash combination.
*/
inline std::size_t hashInit() noexcept {
return 17;
}
inline std::size_t hashCombine(std::size_t state, std::size_t val) noexcept {
return state * 31 + val;
}
/**
* RAII guard.
*/
class ValueGuard {
public:
MONGO_COMPILER_ALWAYS_INLINE ValueGuard(const std::pair<TypeTags, Value> typedValue)
: ValueGuard(typedValue.first, typedValue.second) {}
MONGO_COMPILER_ALWAYS_INLINE ValueGuard(TypeTags tag, Value val) : _tag(tag), _value(val) {}
MONGO_COMPILER_ALWAYS_INLINE ValueGuard(bool owned, TypeTags tag, Value val)
: ValueGuard(owned ? tag : TypeTags::Nothing, owned ? val : 0) {}
MONGO_COMPILER_ALWAYS_INLINE ValueGuard(
const FastTuple<bool, value::TypeTags, value::Value>& tuple)
: ValueGuard(tuple.a, tuple.b, tuple.c) {}
ValueGuard() = delete;
ValueGuard(const ValueGuard&) = delete;
ValueGuard(ValueGuard&& other) = delete;
MONGO_COMPILER_ALWAYS_INLINE ~ValueGuard() {
releaseValue(_tag, _value);
}
ValueGuard& operator=(const ValueGuard&) = delete;
ValueGuard& operator=(ValueGuard&& other) = delete;
void reset() {
_tag = TypeTags::Nothing;
_value = 0;
}
private:
TypeTags _tag;
Value _value;
};
class ValueVectorGuard {
public:
MONGO_COMPILER_ALWAYS_INLINE ValueVectorGuard(std::vector<TypeTags>& tags,
std::vector<Value>& values)
: _owned(true), _tags(tags), _values(values) {}
ValueVectorGuard() = delete;
ValueVectorGuard(const ValueVectorGuard&) = delete;
ValueVectorGuard(ValueVectorGuard&& other) = delete;
MONGO_COMPILER_ALWAYS_INLINE ~ValueVectorGuard() {
if (_owned) {
invariant(_tags.size() == _values.size());
for (size_t i = 0; i < _tags.size(); i++) {
releaseValue(_tags[i], _values[i]);
}
}
}
ValueVectorGuard& operator=(const ValueVectorGuard&) = delete;
ValueVectorGuard& operator=(ValueVectorGuard&& other) = delete;
void reset() {
_owned = false;
}
private:
bool _owned;
std::vector<TypeTags>& _tags;
std::vector<Value>& _values;
};
inline char* getRawPointerView(Value val) noexcept {
return reinterpret_cast<char*>(val);
}
inline Decimal128 readDecimal128FromMemory(const ConstDataView& view) {
uint64_t low = view.read<LittleEndian<uint64_t>>();
uint64_t high = view.read<LittleEndian<uint64_t>>(sizeof(uint64_t));
return Decimal128{Decimal128::Value{low, high}};
}
template <class T>
struct dont_deduce_t {
using type = T;
};
template <class T>
using dont_deduce = typename dont_deduce_t<T>::type;
template <typename T>
Value bitcastFrom(
const dont_deduce<T> in) noexcept { // NOLINT(readability-avoid-const-params-in-decls)
static_assert(std::is_pointer_v<T> || std::is_integral_v<T> || std::is_floating_point_v<T>);
static_assert(sizeof(Value) >= sizeof(T));
// Callers must not try to store a pointer to a Decimal128 object in an sbe::value::Value. Any
// Value with the NumberDecimal TypeTag actually stores a pointer to a NumberDecimal as it would
// be represented in a BSONElement: a pair of network-ordered (little-endian) uint64_t values.
// These bytes are _not_ guaranteed to be the same as the bytes in a Decimal128_t object.
//
// To get a NumberDecimal value, either call makeCopyDecimal() or store the value in BSON and
// use sbe::bson::convertFrom().
static_assert(!std::is_same_v<Decimal128, T>);
static_assert(!std::is_same_v<Decimal128*, T>);
if constexpr (std::is_pointer_v<T>) {
// Casting from pointer to integer value is OK.
return reinterpret_cast<Value>(in);
} else if constexpr (std::is_same_v<bool, T>) {
// make_signed_t<bool> is not defined, so we handle the bool type separately here.
return static_cast<Value>(in);
} else if constexpr (std::is_integral_v<T>) {
// Native integer types are converted to Value using static_cast with sign extension.
return static_cast<Value>(static_cast<std::make_signed_t<T>>(in));
}
Value val{0};
memcpy(&val, &in, sizeof(T));
return val;
}
template <typename T>
T bitcastTo(const Value in) noexcept { // NOLINT(readability-avoid-const-params-in-decls)
static_assert(std::is_pointer_v<T> || std::is_integral_v<T> || std::is_floating_point_v<T> ||
std::is_same_v<Decimal128, T>);
if constexpr (std::is_pointer_v<T>) {
// Casting from integer value to pointer is OK.
static_assert(sizeof(Value) == sizeof(T));
return reinterpret_cast<T>(in);
} else if constexpr (std::is_integral_v<T>) {
// Values are converted to native integer types using static_cast. If sizeof(T) is less
// than sizeof(Value), the upper bits of 'in' are discarded.
static_assert(sizeof(Value) >= sizeof(T));
return static_cast<T>(in);
} else if constexpr (std::is_same_v<Decimal128, T>) {
static_assert(sizeof(Value) == sizeof(T*));
return readDecimal128FromMemory(ConstDataView{getRawPointerView(in)});
} else {
static_assert(sizeof(Value) >= sizeof(T));
T val;
memcpy(&val, &in, sizeof(T));
return val;
}
}
/**
* Defines hash value for <TypeTags, Value> pair. To be used in associative containers.
*/
struct ValueHash {
explicit ValueHash(const CollatorInterface* collator = nullptr) : _collator(collator) {}
size_t operator()(const std::pair<TypeTags, Value>& p) const {
return hashValue(p.first, p.second, _collator);
}
const CollatorInterface* getCollator() const {
return _collator;
}
private:
const CollatorInterface* _collator;
};
/**
* Defines equivalence of two <TypeTags, Value> pairs. To be used in associative containers.
*/
struct ValueEq {
explicit ValueEq(const CollatorInterface* collator = nullptr) : _collator(collator) {}
bool operator()(const std::pair<TypeTags, Value>& lhs,
const std::pair<TypeTags, Value>& rhs) const {
auto comparator = _collator;
auto [tag, val] = compareValue(lhs.first, lhs.second, rhs.first, rhs.second, comparator);
if (tag != TypeTags::NumberInt32 || bitcastTo<int32_t>(val) != 0) {
return false;
} else {
return true;
}
}
const CollatorInterface* getCollator() const {
return _collator;
}
private:
const CollatorInterface* _collator;
};
/**
* Defines less or greater, depending on the template instantiation, of two <TypeTags, Value> pairs.
* To be used in associative containers.
*/
template <bool less>
struct ValueCompare {
explicit ValueCompare(const CollatorInterface* collator = nullptr) : _collator(collator) {}
bool operator()(const std::pair<TypeTags, Value>& lhs,
const std::pair<TypeTags, Value>& rhs) const {
auto [tag, val] = compareValue(lhs.first, lhs.second, rhs.first, rhs.second, _collator);
uassert(7548805, "Invalid comparison result", tag == TypeTags::NumberInt32);
if constexpr (less) {
return bitcastTo<int>(val) < 0;
} else {
return bitcastTo<int>(val) > 0;
}
}
const CollatorInterface* getCollator() const {
return _collator;
}
private:
const CollatorInterface* _collator;
};
/**
* 'DeepEqualityHashSet' is a wrapper around 'absl::flat_hash_set' that provides a "truly" deep
* equality comparison function between its instances. The equality operator in the underlying
* 'absl::flat_hash_set' type doesn't use the provided equality functor. Instead, it relies on the
* default comparison function for the key type, which is not preferrable in our usage scenarios.
* This is the main reason for having the 'DeepEqualityHashSet' wrapper type.
*/
template <class T,
class Hash = absl::container_internal::hash_default_hash<T>,
class Eq = absl::container_internal::hash_default_eq<T>,
class Allocator = std::allocator<T>>
class DeepEqualityHashSet {
public:
using SetType = absl::flat_hash_set<T, Hash, Eq, Allocator>;
using iterator = typename SetType::iterator;
using const_iterator = typename SetType::const_iterator;
explicit DeepEqualityHashSet(size_t bucket_count, const Hash& hash, const Eq& eq)
: _values(bucket_count, hash, eq) {}
Hash hash_function() const {
return _values.hash_function();
}
Eq key_eq() const {
return _values.key_eq();
}
size_t size() const {
return _values.size();
}
void reserve(size_t n) {
_values.reserve(n);
}
std::pair<iterator, bool> insert(const T& value) {
return _values.insert(value);
}
bool contains(const T& key) const {
return _values.contains(key);
}
iterator find(const T& key) {
return _values.find(key);
}
const_iterator find(const T& key) const {
return _values.find(key);
}
size_t count(const T& key) const {
return _values.count(key);
}
iterator begin() {
return _values.begin();
}
iterator end() {
return _values.end();
}
const_iterator begin() const {
return _values.begin();
}
const_iterator end() const {
return _values.end();
}
void erase(const_iterator pos) {
_values.erase(pos);
}
template <class T1, class Hash1, class Eq1, class Allocator1>
friend bool operator==(const DeepEqualityHashSet<T1, Hash1, Eq1, Allocator1>& lhs,
const DeepEqualityHashSet<T1, Hash1, Eq1, Allocator1>& rhs) {
using SetTp = typename DeepEqualityHashSet<T1, Hash1, Eq1, Allocator1>::SetType;
const SetTp* inner = &lhs._values;
const SetTp* outer = &rhs._values;
if (outer->size() != inner->size()) {
return false;
}
if (outer->capacity() > inner->capacity()) {
std::swap(inner, outer);
}
for (const auto& e : *outer) {
// The equality check in the 'absl::flat_hash_set' type doesn't use the provided
// equality functor. Instead, it relies on the default comparison function for the key
// type, which is not preferrable in our usage scenarios. This is the main reason for
// having the 'DeepEqualityHashSet' wrapper type.
if (!inner->contains(e)) {
return false;
}
}
return true;
}
template <class T1, class Hash1, class Eq1, class Allocator1>
friend bool operator!=(const DeepEqualityHashSet<T1, Hash1, Eq1, Allocator1>& lhs,
const DeepEqualityHashSet<T1, Hash1, Eq1, Allocator1>& rhs) {
return !(lhs == rhs);
}
private:
SetType _values;
};
/**
* 'DeepEqualityHashMap' is a wrapper around 'absl::flat_hash_map' that provides a "truly" deep
* equality comparison function between its instances. The equality operator in the underlying
* 'absl::flat_hash_map' type doesn't use the provided equality functor. Instead, it relies on the
* default comparison function for the key type, which is not preferrable in our usage scenarios.
* This is the main reason for having the 'DeepEqualityHashMap' wrapper type.
*/
template <class K,
class V,
class Hash = absl::container_internal::hash_default_hash<K>,
class Eq = absl::container_internal::hash_default_eq<K>,
class Allocator = std::allocator<std::pair<const K, V>>>
class DeepEqualityHashMap {
public:
using MapType = absl::flat_hash_map<K, V, ValueHash, ValueEq, Allocator>;
using iterator = typename MapType::iterator;
using const_iterator = typename MapType::const_iterator;
explicit DeepEqualityHashMap(size_t bucket_count, const Hash& hash, const Eq& eq)
: _values(bucket_count, hash, eq) {}
Hash hash_function() const {
return _values.hash_function();
}
Eq key_eq() const {
return _values.key_eq();
}
size_t size() const {
return _values.size();
}
void reserve(size_t n) {
_values.reserve(n);
}
std::pair<iterator, bool> insert(const K& key, const V& val) {
return _values.insert({key, val});
}
auto& operator[](const K& key) {
return _values[key];
}
bool contains(const K& key) const {
return _values.contains(key);
}
iterator find(const K& key) {
return _values.find(key);
}
const_iterator find(const K& key) const {
return _values.find(key);
}
size_t count(const K& key) const {
return _values.count(key);
}
iterator begin() {
return _values.begin();
}
iterator end() {
return _values.end();
}
const_iterator begin() const {
return _values.begin();
}
const_iterator end() const {
return _values.end();
}
template <class K1, class V1, class Hash1, class Eq1, class Allocator1>
friend bool operator==(const DeepEqualityHashMap<K1, V1, Hash1, Eq1, Allocator1>& lhs,
const DeepEqualityHashMap<K1, V1, Hash1, Eq1, Allocator1>& rhs) {
using MapTp = typename DeepEqualityHashMap<K1, V1, Hash1, Eq1, Allocator1>::MapType;
const MapTp* inner = &lhs._values;
const MapTp* outer = &rhs._values;
if (outer->size() != inner->size()) {
return false;
}
if (outer->capacity() > inner->capacity()) {
std::swap(inner, outer);
}
for (const auto& e : *outer) {
// The equality check in the 'absl::flat_hash_map' type doesn't use the provided
// equality functor. Instead, it relies on the default comparison function for the key
// type, which is not preferrable in our usage scenarios. This is the main reason for
// having the 'DeepEqualityHashMap' wrapper type.
auto it = inner->find(e.first);
if (it == inner->end() || it->second != e.second) {
return false;
}
}
return true;
}
template <class K1, class V1, class Hash1, class Eq1, class Allocator1>
friend bool operator!=(const DeepEqualityHashMap<K1, V1, Hash1, Eq1, Allocator1>& lhs,
const DeepEqualityHashMap<K1, V1, Hash1, Eq1, Allocator1>& rhs) {
return !(lhs == rhs);
}
private:
MapType _values;
};
template <typename T>
using ValueMapType = DeepEqualityHashMap<std::pair<TypeTags, Value>, T, ValueHash, ValueEq>;
using ValueSetType = DeepEqualityHashSet<std::pair<TypeTags, Value>, ValueHash, ValueEq>;
/**
* This is the SBE representation of objects/documents. It is a relatively simple structure of
* vectors of field names, type tags, and values.
*/
class Object {
public:
Object() = default;
Object(const Object& other) {
// Reserve space in all vectors, they are the same size. We arbitrarily picked _typeTags
// to determine the size.
reserve(other._typeTags.size());
_names = other._names;
for (size_t idx = 0; idx < other._values.size(); ++idx) {
const auto [tag, val] = copyValue(other._typeTags[idx], other._values[idx]);
_values.push_back(val);
_typeTags.push_back(tag);
}
}
Object(Object&&) = default;
~Object() {
for (size_t idx = 0; idx < _typeTags.size(); ++idx) {
releaseValue(_typeTags[idx], _values[idx]);
}
}
void push_back(StringData name, TypeTags tag, Value val) {
if (tag != TypeTags::Nothing) {
ValueGuard guard{tag, val};
// Reserve space in all vectors, they are the same size. We arbitrarily picked _typeTags
// to determine the size.
if (_typeTags.capacity() == _typeTags.size()) {
// Reserve double capacity.
// Note: we are not concerned about the overflow in the operation below, as the size
// of 'Value' is 8 bytes. Consequently, the maximum capacity ever is 2^64/8 = 2^61.
// We can freely shift 2^61 << 1 without any overflow.
// Note: the case of '_typeTags.capacity() == 1' is handled inside 'reserve' itself.
reserve(_typeTags.capacity() << 1);
}
_names.emplace_back(std::string(name));
_typeTags.push_back(tag);
_values.push_back(val);
guard.reset();
}
}
std::pair<TypeTags, Value> getField(StringData field) {
for (size_t idx = 0; idx < _typeTags.size(); ++idx) {
if (_names[idx] == field) {
return {_typeTags[idx], _values[idx]};
}
}
return {TypeTags::Nothing, 0};
}
bool contains(StringData field) const {
return std::find(_names.begin(), _names.end(), field) != _names.end();
}
auto size() const noexcept {
return _values.size();
}
auto& field(size_t idx) const {
return _names[idx];
}
std::pair<TypeTags, Value> getAt(std::size_t idx) const {
if (idx >= _values.size()) {
return {TypeTags::Nothing, 0};
}
return {_typeTags[idx], _values[idx]};
}
// The in-place update of objects is allowed only in very limited set of contexts (e.g. when
// objects are used in an accumulator slot). The owner of the object must guarantee that no
// other component can observe the value being updated.
void setAt(std::size_t idx, TypeTags tag, Value val) {
if (tag != TypeTags::Nothing && idx < _values.size()) {
releaseValue(_typeTags[idx], _values[idx]);
_typeTags[idx] = tag;
_values[idx] = val;
}
}
void reserve(size_t s) {
// Normalize to at least 1.
s = s ? s : 1;
_typeTags.reserve(s);
_values.reserve(s);
_names.reserve(s);
}
private:
std::vector<TypeTags> _typeTags;
std::vector<Value> _values;
std::vector<std::string> _names;
};
/**
* This is the SBE representation of arrays. It is similar to Object without the field names.
*/
class Array {
public:
Array() = default;
Array(const Array& other) {
reserve(other._vals.size());
for (size_t idx = 0; idx < other._vals.size(); ++idx) {
auto [t, v] = other._vals[idx];
_vals.push_back(copyValue(t, v));
}
}
Array(Array&&) = default;
~Array() {
for (size_t idx = 0; idx < _vals.size(); ++idx) {
releaseValue(_vals[idx].first, _vals[idx].second);
}
}
void push_back(TypeTags tag, Value val) {
if (tag != TypeTags::Nothing) {
ValueGuard guard{tag, val};
_vals.push_back({tag, val});
guard.reset();
}
}
void push_back(std::pair<TypeTags, Value> val) {
push_back(val.first, val.second);
}
void pop_back() {