-
Notifications
You must be signed in to change notification settings - Fork 3.5k
/
builder.h
997 lines (792 loc) · 32.4 KB
/
builder.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
// 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.
#ifndef ARROW_BUILDER_H
#define ARROW_BUILDER_H
#include <array>
#include <cstdint>
#include <functional>
#include <limits>
#include <memory>
#include <string>
#include <vector>
#include "arrow/buffer.h"
#include "arrow/memory_pool.h"
#include "arrow/status.h"
#include "arrow/type.h"
#include "arrow/type_traits.h"
#include "arrow/util/bit-util.h"
#include "arrow/util/hash.h"
#include "arrow/util/macros.h"
#include "arrow/util/visibility.h"
namespace arrow {
class Array;
class Decimal128;
constexpr int64_t kBinaryMemoryLimit = std::numeric_limits<int32_t>::max() - 1;
constexpr int64_t kListMaximumElements = std::numeric_limits<int32_t>::max() - 1;
namespace internal {
struct ArrayData;
} // namespace internal
constexpr int64_t kMinBuilderCapacity = 1 << 5;
/// Base class for all data array builders.
//
/// This class provides a facilities for incrementally building the null bitmap
/// (see Append methods) and as a side effect the current number of slots and
/// the null count.
class ARROW_EXPORT ArrayBuilder {
public:
explicit ArrayBuilder(const std::shared_ptr<DataType>& type, MemoryPool* pool)
: type_(type),
pool_(pool),
null_bitmap_(NULLPTR),
null_count_(0),
null_bitmap_data_(NULLPTR),
length_(0),
capacity_(0) {}
virtual ~ArrayBuilder() = default;
/// For nested types. Since the objects are owned by this class instance, we
/// skip shared pointers and just return a raw pointer
ArrayBuilder* child(int i) { return children_[i].get(); }
int num_children() const { return static_cast<int>(children_.size()); }
int64_t length() const { return length_; }
int64_t null_count() const { return null_count_; }
int64_t capacity() const { return capacity_; }
/// Append to null bitmap
Status AppendToBitmap(bool is_valid);
/// Vector append. Treat each zero byte as a null. If valid_bytes is null
/// assume all of length bits are valid.
Status AppendToBitmap(const uint8_t* valid_bytes, int64_t length);
/// Set the next length bits to not null (i.e. valid).
Status SetNotNull(int64_t length);
/// Allocates initial capacity requirements for the builder. In most
/// cases subclasses should override and call their parent class's
/// method as well.
virtual Status Init(int64_t capacity);
/// Resizes the null_bitmap array. In most
/// cases subclasses should override and call their parent class's
/// method as well.
virtual Status Resize(int64_t new_bits);
/// Ensures there is enough space for adding the number of elements by checking
/// capacity and calling Resize if necessary.
Status Reserve(int64_t elements);
/// For cases where raw data was memcpy'd into the internal buffers, allows us
/// to advance the length of the builder. It is your responsibility to use
/// this function responsibly.
Status Advance(int64_t elements);
std::shared_ptr<PoolBuffer> null_bitmap() const { return null_bitmap_; }
/// \brief Return result of builder as an internal generic ArrayData
/// object. Resets builder except for dictionary builder
///
/// \param[out] out the finalized ArrayData object
/// \return Status
virtual Status FinishInternal(std::shared_ptr<ArrayData>* out) = 0;
/// \brief Return result of builder as an Array object.
/// Resets the builder except for DictionaryBuilder
///
/// \param[out] out the finalized Array object
/// \return Status
Status Finish(std::shared_ptr<Array>* out);
std::shared_ptr<DataType> type() const { return type_; }
// Unsafe operations (don't check capacity/don't resize)
// Append to null bitmap.
void UnsafeAppendToBitmap(bool is_valid) {
if (is_valid) {
BitUtil::SetBit(null_bitmap_data_, length_);
} else {
++null_count_;
}
++length_;
}
protected:
ArrayBuilder() {}
std::shared_ptr<DataType> type_;
MemoryPool* pool_;
// When null_bitmap are first appended to the builder, the null bitmap is allocated
std::shared_ptr<PoolBuffer> null_bitmap_;
int64_t null_count_;
uint8_t* null_bitmap_data_;
// Array length, so far. Also, the index of the next element to be added
int64_t length_;
int64_t capacity_;
// Child value array builders. These are owned by this class
std::vector<std::unique_ptr<ArrayBuilder>> children_;
void Reset();
// Vector append. Treat each zero byte as a nullzero. If valid_bytes is null
// assume all of length bits are valid.
void UnsafeAppendToBitmap(const uint8_t* valid_bytes, int64_t length);
void UnsafeAppendToBitmap(const std::vector<bool>& is_valid);
// Set the next length bits to not null (i.e. valid).
void UnsafeSetNotNull(int64_t length);
private:
ARROW_DISALLOW_COPY_AND_ASSIGN(ArrayBuilder);
};
class ARROW_EXPORT NullBuilder : public ArrayBuilder {
public:
explicit NullBuilder(MemoryPool* pool ARROW_MEMORY_POOL_DEFAULT)
: ArrayBuilder(null(), pool) {}
Status AppendNull() {
++null_count_;
++length_;
return Status::OK();
}
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
};
template <typename Type>
class ARROW_EXPORT PrimitiveBuilder : public ArrayBuilder {
public:
using value_type = typename Type::c_type;
explicit PrimitiveBuilder(const std::shared_ptr<DataType>& type, MemoryPool* pool)
: ArrayBuilder(type, pool), data_(NULLPTR), raw_data_(NULLPTR) {}
using ArrayBuilder::Advance;
/// Write nulls as uint8_t* (0 value indicates null) into pre-allocated memory
Status AppendNulls(const uint8_t* valid_bytes, int64_t length) {
RETURN_NOT_OK(Reserve(length));
UnsafeAppendToBitmap(valid_bytes, length);
return Status::OK();
}
Status AppendNull() {
RETURN_NOT_OK(Reserve(1));
UnsafeAppendToBitmap(false);
return Status::OK();
}
std::shared_ptr<Buffer> data() const { return data_; }
/// \brief Append a sequence of elements in one shot
/// \param[in] values a contiguous C array of values
/// \param[in] length the number of values to append
/// \param[in] valid_bytes an optional sequence of bytes where non-zero
/// indicates a valid (non-null) value
/// \return Status
Status Append(const value_type* values, int64_t length,
const uint8_t* valid_bytes = NULLPTR);
/// \brief Append a sequence of elements in one shot
/// \param[in] values a contiguous C array of values
/// \param[in] length the number of values to append
/// \param[in] is_valid an std::vector<bool> indicating valid (1) or null
/// (0). Equal in length to values
/// \return Status
Status Append(const value_type* values, int64_t length,
const std::vector<bool>& is_valid);
/// \brief Append a sequence of elements in one shot
/// \param[in] values a std::vector of values
/// \param[in] is_valid an std::vector<bool> indicating valid (1) or null
/// (0). Equal in length to values
/// \return Status
Status Append(const std::vector<value_type>& values, const std::vector<bool>& is_valid);
/// \brief Append a sequence of elements in one shot
/// \param[in] values a std::vector of values
/// \return Status
Status Append(const std::vector<value_type>& values);
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
Status Init(int64_t capacity) override;
/// Increase the capacity of the builder to accommodate at least the indicated
/// number of elements
Status Resize(int64_t capacity) override;
protected:
std::shared_ptr<PoolBuffer> data_;
value_type* raw_data_;
};
/// Base class for all Builders that emit an Array of a scalar numerical type.
template <typename T>
class ARROW_EXPORT NumericBuilder : public PrimitiveBuilder<T> {
public:
using typename PrimitiveBuilder<T>::value_type;
using PrimitiveBuilder<T>::PrimitiveBuilder;
template <typename T1 = T>
explicit NumericBuilder(
typename std::enable_if<TypeTraits<T1>::is_parameter_free, MemoryPool*>::type pool
ARROW_MEMORY_POOL_DEFAULT)
: PrimitiveBuilder<T1>(TypeTraits<T1>::type_singleton(), pool) {}
using PrimitiveBuilder<T>::Append;
using PrimitiveBuilder<T>::Init;
using PrimitiveBuilder<T>::Resize;
using PrimitiveBuilder<T>::Reserve;
/// Append a single scalar and increase the size if necessary.
Status Append(const value_type val) {
RETURN_NOT_OK(ArrayBuilder::Reserve(1));
UnsafeAppend(val);
return Status::OK();
}
/// Append a single scalar under the assumption that the underlying Buffer is
/// large enough.
///
/// This method does not capacity-check; make sure to call Reserve
/// beforehand.
void UnsafeAppend(const value_type val) {
BitUtil::SetBit(null_bitmap_data_, length_);
raw_data_[length_++] = val;
}
protected:
using PrimitiveBuilder<T>::length_;
using PrimitiveBuilder<T>::null_bitmap_data_;
using PrimitiveBuilder<T>::raw_data_;
};
// Builders
using UInt8Builder = NumericBuilder<UInt8Type>;
using UInt16Builder = NumericBuilder<UInt16Type>;
using UInt32Builder = NumericBuilder<UInt32Type>;
using UInt64Builder = NumericBuilder<UInt64Type>;
using Int8Builder = NumericBuilder<Int8Type>;
using Int16Builder = NumericBuilder<Int16Type>;
using Int32Builder = NumericBuilder<Int32Type>;
using Int64Builder = NumericBuilder<Int64Type>;
using TimestampBuilder = NumericBuilder<TimestampType>;
using Time32Builder = NumericBuilder<Time32Type>;
using Time64Builder = NumericBuilder<Time64Type>;
using Date32Builder = NumericBuilder<Date32Type>;
using Date64Builder = NumericBuilder<Date64Type>;
using HalfFloatBuilder = NumericBuilder<HalfFloatType>;
using FloatBuilder = NumericBuilder<FloatType>;
using DoubleBuilder = NumericBuilder<DoubleType>;
namespace internal {
class ARROW_EXPORT AdaptiveIntBuilderBase : public ArrayBuilder {
public:
explicit AdaptiveIntBuilderBase(MemoryPool* pool);
/// Write nulls as uint8_t* (0 value indicates null) into pre-allocated memory
Status AppendNulls(const uint8_t* valid_bytes, int64_t length) {
RETURN_NOT_OK(Reserve(length));
UnsafeAppendToBitmap(valid_bytes, length);
return Status::OK();
}
Status AppendNull() {
RETURN_NOT_OK(Reserve(1));
UnsafeAppendToBitmap(false);
return Status::OK();
}
std::shared_ptr<Buffer> data() const { return data_; }
Status Init(int64_t capacity) override;
/// Increase the capacity of the builder to accommodate at least the indicated
/// number of elements
Status Resize(int64_t capacity) override;
protected:
std::shared_ptr<PoolBuffer> data_;
uint8_t* raw_data_;
uint8_t int_size_;
};
// Check if we would need to expand the underlying storage type
inline uint8_t ExpandedIntSize(int64_t val, uint8_t current_int_size) {
if (current_int_size == 8 ||
(current_int_size < 8 &&
(val > static_cast<int64_t>(std::numeric_limits<int32_t>::max()) ||
val < static_cast<int64_t>(std::numeric_limits<int32_t>::min())))) {
return 8;
} else if (current_int_size == 4 ||
(current_int_size < 4 &&
(val > static_cast<int64_t>(std::numeric_limits<int16_t>::max()) ||
val < static_cast<int64_t>(std::numeric_limits<int16_t>::min())))) {
return 4;
} else if (current_int_size == 2 ||
(current_int_size == 1 &&
(val > static_cast<int64_t>(std::numeric_limits<int8_t>::max()) ||
val < static_cast<int64_t>(std::numeric_limits<int8_t>::min())))) {
return 2;
} else {
return 1;
}
}
// Check if we would need to expand the underlying storage type
inline uint8_t ExpandedUIntSize(uint64_t val, uint8_t current_int_size) {
if (current_int_size == 8 ||
(current_int_size < 8 &&
(val > static_cast<uint64_t>(std::numeric_limits<uint32_t>::max())))) {
return 8;
} else if (current_int_size == 4 ||
(current_int_size < 4 &&
(val > static_cast<uint64_t>(std::numeric_limits<uint16_t>::max())))) {
return 4;
} else if (current_int_size == 2 ||
(current_int_size == 1 &&
(val > static_cast<uint64_t>(std::numeric_limits<uint8_t>::max())))) {
return 2;
} else {
return 1;
}
}
} // namespace internal
class ARROW_EXPORT AdaptiveUIntBuilder : public internal::AdaptiveIntBuilderBase {
public:
explicit AdaptiveUIntBuilder(MemoryPool* pool ARROW_MEMORY_POOL_DEFAULT);
using ArrayBuilder::Advance;
/// Scalar append
Status Append(const uint64_t val) {
RETURN_NOT_OK(Reserve(1));
BitUtil::SetBit(null_bitmap_data_, length_);
uint8_t new_int_size = internal::ExpandedUIntSize(val, int_size_);
if (new_int_size != int_size_) {
RETURN_NOT_OK(ExpandIntSize(new_int_size));
}
switch (int_size_) {
case 1:
reinterpret_cast<uint8_t*>(raw_data_)[length_++] = static_cast<uint8_t>(val);
break;
case 2:
reinterpret_cast<uint16_t*>(raw_data_)[length_++] = static_cast<uint16_t>(val);
break;
case 4:
reinterpret_cast<uint32_t*>(raw_data_)[length_++] = static_cast<uint32_t>(val);
break;
case 8:
reinterpret_cast<uint64_t*>(raw_data_)[length_++] = val;
break;
default:
return Status::NotImplemented("This code shall never be reached");
}
return Status::OK();
}
/// \brief Append a sequence of elements in one shot
/// \param[in] values a contiguous C array of values
/// \param[in] length the number of values to append
/// \param[in] valid_bytes an optional sequence of bytes where non-zero
/// indicates a valid (non-null) value
/// \return Status
Status Append(const uint64_t* values, int64_t length,
const uint8_t* valid_bytes = NULLPTR);
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
protected:
Status ExpandIntSize(uint8_t new_int_size);
template <typename new_type, typename old_type>
typename std::enable_if<sizeof(old_type) >= sizeof(new_type), Status>::type
ExpandIntSizeInternal();
#define __LESS(a, b) (a) < (b)
template <typename new_type, typename old_type>
typename std::enable_if<__LESS(sizeof(old_type), sizeof(new_type)), Status>::type
ExpandIntSizeInternal();
#undef __LESS
template <typename new_type>
Status ExpandIntSizeN();
};
class ARROW_EXPORT AdaptiveIntBuilder : public internal::AdaptiveIntBuilderBase {
public:
explicit AdaptiveIntBuilder(MemoryPool* pool ARROW_MEMORY_POOL_DEFAULT);
using ArrayBuilder::Advance;
/// Scalar append
Status Append(const int64_t val) {
RETURN_NOT_OK(Reserve(1));
BitUtil::SetBit(null_bitmap_data_, length_);
uint8_t new_int_size = internal::ExpandedIntSize(val, int_size_);
if (new_int_size != int_size_) {
RETURN_NOT_OK(ExpandIntSize(new_int_size));
}
switch (int_size_) {
case 1:
reinterpret_cast<int8_t*>(raw_data_)[length_++] = static_cast<int8_t>(val);
break;
case 2:
reinterpret_cast<int16_t*>(raw_data_)[length_++] = static_cast<int16_t>(val);
break;
case 4:
reinterpret_cast<int32_t*>(raw_data_)[length_++] = static_cast<int32_t>(val);
break;
case 8:
reinterpret_cast<int64_t*>(raw_data_)[length_++] = val;
break;
default:
return Status::NotImplemented("This code shall never be reached");
}
return Status::OK();
}
/// \brief Append a sequence of elements in one shot
/// \param[in] values a contiguous C array of values
/// \param[in] length the number of values to append
/// \param[in] valid_bytes an optional sequence of bytes where non-zero
/// indicates a valid (non-null) value
/// \return Status
Status Append(const int64_t* values, int64_t length,
const uint8_t* valid_bytes = NULLPTR);
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
protected:
Status ExpandIntSize(uint8_t new_int_size);
template <typename new_type, typename old_type>
typename std::enable_if<sizeof(old_type) >= sizeof(new_type), Status>::type
ExpandIntSizeInternal();
#define __LESS(a, b) (a) < (b)
template <typename new_type, typename old_type>
typename std::enable_if<__LESS(sizeof(old_type), sizeof(new_type)), Status>::type
ExpandIntSizeInternal();
#undef __LESS
template <typename new_type>
Status ExpandIntSizeN();
};
class ARROW_EXPORT BooleanBuilder : public ArrayBuilder {
public:
explicit BooleanBuilder(MemoryPool* pool ARROW_MEMORY_POOL_DEFAULT);
explicit BooleanBuilder(const std::shared_ptr<DataType>& type, MemoryPool* pool);
using ArrayBuilder::Advance;
/// Write nulls as uint8_t* (0 value indicates null) into pre-allocated memory
Status AppendNulls(const uint8_t* valid_bytes, int64_t length) {
RETURN_NOT_OK(Reserve(length));
UnsafeAppendToBitmap(valid_bytes, length);
return Status::OK();
}
Status AppendNull() {
RETURN_NOT_OK(Reserve(1));
UnsafeAppendToBitmap(false);
return Status::OK();
}
std::shared_ptr<Buffer> data() const { return data_; }
/// Scalar append
Status Append(const bool val) {
RETURN_NOT_OK(Reserve(1));
BitUtil::SetBit(null_bitmap_data_, length_);
if (val) {
BitUtil::SetBit(raw_data_, length_);
} else {
BitUtil::ClearBit(raw_data_, length_);
}
++length_;
return Status::OK();
}
Status Append(const uint8_t val) { return Append(val != 0); }
/// \brief Append a sequence of elements in one shot
/// \param[in] values a contiguous array of bytes (non-zero is 1)
/// \param[in] length the number of values to append
/// \param[in] valid_bytes an optional sequence of bytes where non-zero
/// indicates a valid (non-null) value
/// \return Status
Status Append(const uint8_t* values, int64_t length,
const uint8_t* valid_bytes = NULLPTR);
/// \brief Append a sequence of elements in one shot
/// \param[in] values a contiguous C array of values
/// \param[in] length the number of values to append
/// \param[in] is_valid an std::vector<bool> indicating valid (1) or null
/// (0). Equal in length to values
/// \return Status
Status Append(const uint8_t* values, int64_t length, const std::vector<bool>& is_valid);
/// \brief Append a sequence of elements in one shot
/// \param[in] values a std::vector of bytes
/// \param[in] is_valid an std::vector<bool> indicating valid (1) or null
/// (0). Equal in length to values
/// \return Status
Status Append(const std::vector<uint8_t>& values, const std::vector<bool>& is_valid);
/// \brief Append a sequence of elements in one shot
/// \param[in] values a std::vector of bytes
/// \return Status
Status Append(const std::vector<uint8_t>& values);
/// \brief Append a sequence of elements in one shot
/// \param[in] values an std::vector<bool> indicating true (1) or false
/// \param[in] is_valid an std::vector<bool> indicating valid (1) or null
/// (0). Equal in length to values
/// \return Status
Status Append(const std::vector<bool>& values, const std::vector<bool>& is_valid);
/// \brief Append a sequence of elements in one shot
/// \param[in] values an std::vector<bool> indicating true (1) or false
/// \return Status
Status Append(const std::vector<bool>& values);
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
Status Init(int64_t capacity) override;
/// Increase the capacity of the builder to accommodate at least the indicated
/// number of elements
Status Resize(int64_t capacity) override;
protected:
std::shared_ptr<PoolBuffer> data_;
uint8_t* raw_data_;
};
// ----------------------------------------------------------------------
// List builder
/// \class ListBuilder
/// \brief Builder class for variable-length list array value types
///
/// To use this class, you must append values to the child array builder and use
/// the Append function to delimit each distinct list value (once the values
/// have been appended to the child array) or use the bulk API to append
/// a sequence of offests and null values.
///
/// A note on types. Per arrow/type.h all types in the c++ implementation are
/// logical so even though this class always builds list array, this can
/// represent multiple different logical types. If no logical type is provided
/// at construction time, the class defaults to List<T> where t is taken from the
/// value_builder/values that the object is constructed with.
class ARROW_EXPORT ListBuilder : public ArrayBuilder {
public:
/// Use this constructor to incrementally build the value array along with offsets and
/// null bitmap.
ListBuilder(MemoryPool* pool, std::unique_ptr<ArrayBuilder> value_builder,
const std::shared_ptr<DataType>& type = NULLPTR);
Status Init(int64_t elements) override;
Status Resize(int64_t capacity) override;
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
/// \brief Vector append
///
/// If passed, valid_bytes is of equal length to values, and any zero byte
/// will be considered as a null for that slot
Status Append(const int32_t* offsets, int64_t length,
const uint8_t* valid_bytes = NULLPTR);
/// \brief Start a new variable-length list slot
///
/// This function should be called before beginning to append elements to the
/// value builder
Status Append(bool is_valid = true);
Status AppendNull() { return Append(false); }
ArrayBuilder* value_builder() const;
protected:
TypedBufferBuilder<int32_t> offsets_builder_;
std::unique_ptr<ArrayBuilder> value_builder_;
std::shared_ptr<Array> values_;
Status AppendNextOffset();
void Reset();
};
// ----------------------------------------------------------------------
// Binary and String
/// \class BinaryBuilder
/// \brief Builder class for variable-length binary data
class ARROW_EXPORT BinaryBuilder : public ArrayBuilder {
public:
explicit BinaryBuilder(MemoryPool* pool ARROW_MEMORY_POOL_DEFAULT);
BinaryBuilder(const std::shared_ptr<DataType>& type, MemoryPool* pool);
Status Append(const uint8_t* value, int32_t length);
Status Append(const char* value, int32_t length) {
return Append(reinterpret_cast<const uint8_t*>(value), length);
}
Status Append(const std::string& value) {
return Append(value.c_str(), static_cast<int32_t>(value.size()));
}
Status AppendNull();
Status Init(int64_t elements) override;
Status Resize(int64_t capacity) override;
/// \brief Ensures there is enough allocated capacity to append the indicated
/// number of bytes to the value data buffer without additional allocations
Status ReserveData(int64_t elements);
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
/// \return size of values buffer so far
int64_t value_data_length() const { return value_data_builder_.length(); }
/// \return capacity of values buffer
int64_t value_data_capacity() const { return value_data_builder_.capacity(); }
/// Temporary access to a value.
///
/// This pointer becomes invalid on the next modifying operation.
const uint8_t* GetValue(int64_t i, int32_t* out_length) const;
protected:
TypedBufferBuilder<int32_t> offsets_builder_;
TypedBufferBuilder<uint8_t> value_data_builder_;
Status AppendNextOffset();
void Reset();
};
/// \class StringBuilder
/// \brief Builder class for UTF8 strings
class ARROW_EXPORT StringBuilder : public BinaryBuilder {
public:
using BinaryBuilder::BinaryBuilder;
explicit StringBuilder(MemoryPool* pool ARROW_MEMORY_POOL_DEFAULT);
using BinaryBuilder::Append;
Status Append(const std::vector<std::string>& values, uint8_t* null_bytes);
};
// ----------------------------------------------------------------------
// FixedSizeBinaryBuilder
class ARROW_EXPORT FixedSizeBinaryBuilder : public ArrayBuilder {
public:
FixedSizeBinaryBuilder(const std::shared_ptr<DataType>& type,
MemoryPool* pool ARROW_MEMORY_POOL_DEFAULT);
Status Append(const uint8_t* value);
template <size_t NBYTES>
Status Append(const std::array<uint8_t, NBYTES>& value) {
RETURN_NOT_OK(Reserve(1));
UnsafeAppendToBitmap(true);
return byte_builder_.Append(value);
}
Status Append(const uint8_t* data, int64_t length,
const uint8_t* valid_bytes = NULLPTR);
Status Append(const std::string& value);
Status AppendNull();
Status Init(int64_t elements) override;
Status Resize(int64_t capacity) override;
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
/// \return size of values buffer so far
int64_t value_data_length() const { return byte_builder_.length(); }
/// Temporary access to a value.
///
/// This pointer becomes invalid on the next modifying operation.
const uint8_t* GetValue(int64_t i) const;
protected:
int32_t byte_width_;
BufferBuilder byte_builder_;
};
class ARROW_EXPORT Decimal128Builder : public FixedSizeBinaryBuilder {
public:
explicit Decimal128Builder(const std::shared_ptr<DataType>& type,
MemoryPool* pool ARROW_MEMORY_POOL_DEFAULT);
using FixedSizeBinaryBuilder::Append;
Status Append(const Decimal128& val);
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
};
using DecimalBuilder = Decimal128Builder;
// ----------------------------------------------------------------------
// Struct
// ---------------------------------------------------------------------------------
// StructArray builder
/// Append, Resize and Reserve methods are acting on StructBuilder.
/// Please make sure all these methods of all child-builders' are consistently
/// called to maintain data-structure consistency.
class ARROW_EXPORT StructBuilder : public ArrayBuilder {
public:
StructBuilder(const std::shared_ptr<DataType>& type, MemoryPool* pool,
std::vector<std::unique_ptr<ArrayBuilder>>&& field_builders);
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
/// Null bitmap is of equal length to every child field, and any zero byte
/// will be considered as a null for that field, but users must using app-
/// end methods or advance methods of the child builders' independently to
/// insert data.
Status Append(int64_t length, const uint8_t* valid_bytes) {
RETURN_NOT_OK(Reserve(length));
UnsafeAppendToBitmap(valid_bytes, length);
return Status::OK();
}
/// Append an element to the Struct. All child-builders' Append method must
/// be called independently to maintain data-structure consistency.
Status Append(bool is_valid = true) {
RETURN_NOT_OK(Reserve(1));
UnsafeAppendToBitmap(is_valid);
return Status::OK();
}
Status AppendNull() { return Append(false); }
ArrayBuilder* field_builder(int i) const { return field_builders_[i].get(); }
int num_fields() const { return static_cast<int>(field_builders_.size()); }
protected:
std::vector<std::unique_ptr<ArrayBuilder>> field_builders_;
};
// ----------------------------------------------------------------------
// Dictionary builder
namespace internal {
// TODO(ARROW-1176): Use Tensorflow's StringPiece instead of this here.
struct WrappedBinary {
WrappedBinary(const uint8_t* ptr, int32_t length) : ptr_(ptr), length_(length) {}
const uint8_t* ptr_;
int32_t length_;
};
template <typename T>
struct DictionaryScalar {
using type = typename T::c_type;
};
template <>
struct DictionaryScalar<BinaryType> {
using type = WrappedBinary;
};
template <>
struct DictionaryScalar<StringType> {
using type = WrappedBinary;
};
template <>
struct DictionaryScalar<FixedSizeBinaryType> {
using type = uint8_t const*;
};
} // namespace internal
/// \brief Array builder for created encoded DictionaryArray from dense array
///
/// Unlike other builders, dictionary builder does not completely reset the state
/// on Finish calls. The arrays built after the initial Finish call will reuse
/// the previously created encoding and build a delta dictionary when new terms
/// occur.
///
/// data
template <typename T>
class ARROW_EXPORT DictionaryBuilder : public ArrayBuilder {
public:
using Scalar = typename internal::DictionaryScalar<T>::type;
~DictionaryBuilder() override {}
DictionaryBuilder(const std::shared_ptr<DataType>& type, MemoryPool* pool);
template <typename T1 = T>
explicit DictionaryBuilder(
typename std::enable_if<TypeTraits<T1>::is_parameter_free, MemoryPool*>::type pool)
: DictionaryBuilder<T1>(TypeTraits<T1>::type_singleton(), pool) {}
/// \brief Append a scalar value
Status Append(const Scalar& value);
/// \brief Append a scalar null value
Status AppendNull();
/// \brief Append a whole dense array to the builder
Status AppendArray(const Array& array);
Status Init(int64_t elements) override;
Status Resize(int64_t capacity) override;
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
/// is the dictionary builder in the delta building mode
bool is_building_delta() { return entry_id_offset_ > 0; }
protected:
Status DoubleTableSize();
Scalar GetDictionaryValue(typename TypeTraits<T>::BuilderType& dictionary_builder,
int64_t index);
int64_t HashValue(const Scalar& value);
bool SlotDifferent(hash_slot_t slot, const Scalar& value);
Status AppendDictionary(const Scalar& value);
std::shared_ptr<Buffer> hash_table_;
int32_t* hash_slots_;
/// Size of the table. Must be a power of 2.
int64_t hash_table_size_;
// offset for the entry ids. Used to build delta dictionaries,
// increased on every InternalFinish by the number of current entries
// in the dictionary
int64_t entry_id_offset_;
// Store hash_table_size_ - 1, so that j & mod_bitmask_ is equivalent to j %
// hash_table_size_, but uses far fewer CPU cycles
int64_t mod_bitmask_;
typename TypeTraits<T>::BuilderType dict_builder_;
typename TypeTraits<T>::BuilderType overflow_dict_builder_;
AdaptiveIntBuilder values_builder_;
int32_t byte_width_;
/// Size at which we decide to resize
int64_t hash_table_load_threshold_;
};
template <>
class ARROW_EXPORT DictionaryBuilder<NullType> : public ArrayBuilder {
public:
~DictionaryBuilder() override;
DictionaryBuilder(const std::shared_ptr<DataType>& type, MemoryPool* pool);
explicit DictionaryBuilder(MemoryPool* pool);
/// \brief Append a scalar null value
Status AppendNull();
/// \brief Append a whole dense array to the builder
Status AppendArray(const Array& array);
Status Init(int64_t elements) override;
Status Resize(int64_t capacity) override;
Status FinishInternal(std::shared_ptr<ArrayData>* out) override;
protected:
AdaptiveIntBuilder values_builder_;
};
class ARROW_EXPORT BinaryDictionaryBuilder : public DictionaryBuilder<BinaryType> {
public:
using DictionaryBuilder::Append;
using DictionaryBuilder::DictionaryBuilder;
Status Append(const uint8_t* value, int32_t length) {
return Append(internal::WrappedBinary(value, length));
}
Status Append(const char* value, int32_t length) {
return Append(
internal::WrappedBinary(reinterpret_cast<const uint8_t*>(value), length));
}
Status Append(const std::string& value) {
return Append(internal::WrappedBinary(reinterpret_cast<const uint8_t*>(value.c_str()),
static_cast<int32_t>(value.size())));
}
};
/// \brief Dictionary array builder with convenience methods for strings
class ARROW_EXPORT StringDictionaryBuilder : public DictionaryBuilder<StringType> {
public:
using DictionaryBuilder::Append;
using DictionaryBuilder::DictionaryBuilder;
Status Append(const uint8_t* value, int32_t length) {
return Append(internal::WrappedBinary(value, length));
}
Status Append(const char* value, int32_t length) {
return Append(
internal::WrappedBinary(reinterpret_cast<const uint8_t*>(value), length));
}
Status Append(const std::string& value) {
return Append(internal::WrappedBinary(reinterpret_cast<const uint8_t*>(value.c_str()),
static_cast<int32_t>(value.size())));
}
};
// ----------------------------------------------------------------------
// Helper functions
Status ARROW_EXPORT MakeBuilder(MemoryPool* pool, const std::shared_ptr<DataType>& type,
std::unique_ptr<ArrayBuilder>* out);
} // namespace arrow
#endif // ARROW_BUILDER_H_