lbug 0.16.1

An in-process property graph database management system built for query speed and scalability
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
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
#include "common/arrow/arrow_converter.h"
#include "common/exception/runtime.h"
#include "common/types/int128_t.h"
#include "common/types/interval_t.h"
#include "common/types/types.h"
#include "common/vector/value_vector.h"
#include "function/cast/functions/numeric_limits.h"

namespace lbug {
namespace common {

// scans are based on data specification found here
// https://arrow.apache.org/docs/format/Columnar.html

// all offsets are measured by value, not physical size

template<typename Func>
static void rowIter(const ValueVector& outputVector, uint64_t count, Func&& func) {
    // Use sel_vector only if it is unfiltered. For copying the first n elements, count param should
    // be used instead
    if (outputVector.state != nullptr && !outputVector.state->getSelVector().isUnfiltered()) {
        outputVector.state->getSelVector().forEach(func);
    } else {
        for (uint64_t i = 0; i < count; i++) {
            func(i);
        }
    }
}

template<typename T>
static void scanArrowArrayFixedSizePrimitive(const ArrowArray* array, ValueVector& outputVector,
    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
    auto arrayBuffer = (const T*)array->buffers[1];

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            auto curValue = arrayBuffer[i + srcOffset];
            outputVector.setValue<T>(i + dstOffset, curValue);
        }
    });
}

template<typename SRC, typename DST>
static void scanArrowArrayFixedSizePrimitiveAndCastTo(const ArrowArray* array,
    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {
    auto arrayBuffer = (const SRC*)array->buffers[1];

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            auto curValue = arrayBuffer[i + srcOffset];
            outputVector.setValue<DST>(i + dstOffset, (DST)curValue);
        }
    });
}

template<>
void scanArrowArrayFixedSizePrimitive<bool>(const ArrowArray* array, ValueVector& outputVector,
    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
    auto arrayBuffer = (const uint8_t*)array->buffers[1];

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        outputVector.setValue<bool>(i + dstOffset,
            NullMask::isNull((const uint64_t*)arrayBuffer, i + srcOffset));
    });
}

static void scanArrowArrayDurationScaledUp(const ArrowArray* array, ValueVector& outputVector,
    ArrowNullMaskTree* mask, int64_t scaleFactor, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {
    auto arrayBuffer = ((const int64_t*)array->buffers[1]) + srcOffset;

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            auto curValue = arrayBuffer[i];
            outputVector.setValue<interval_t>(i + dstOffset,
                interval_t(0, 0, curValue * scaleFactor));
        }
    });
}

static void scanArrowArrayDurationScaledDown(const ArrowArray* array, ValueVector& outputVector,
    ArrowNullMaskTree* mask, int64_t scaleFactor, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {
    auto arrayBuffer = ((const int64_t*)array->buffers[1]) + srcOffset;

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            auto curValue = arrayBuffer[i];
            outputVector.setValue<interval_t>(i + dstOffset,
                interval_t(0, 0, curValue / scaleFactor));
        }
    });
}

static void scanArrowArrayMonthInterval(const ArrowArray* array, ValueVector& outputVector,
    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
    auto arrayBuffer = ((const int32_t*)array->buffers[1]) + srcOffset;

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            auto curValue = arrayBuffer[i];
            outputVector.setValue<interval_t>(i + dstOffset, interval_t(curValue, 0, 0));
        }
    });
}

static void scanArrowArrayDayTimeInterval(const ArrowArray* array, ValueVector& outputVector,
    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
    auto arrayBuffer = ((const int64_t*)array->buffers[1]) + srcOffset;

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            int64_t curValue = arrayBuffer[i];
            int32_t day = curValue;
            int64_t micros = (curValue >> (4 * sizeof(int64_t))) * 1000;
            // arrow stores ms, while we store us
            outputVector.setValue<interval_t>(i + dstOffset, interval_t(0, day, micros));
        }
    });
}

static void scanArrowArrayMonthDayNanoInterval(const ArrowArray* array, ValueVector& outputVector,
    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
    auto arrayBuffer =
        (const int64_t*)((const uint8_t*)array->buffers[1] + srcOffset * 16); // 16 bits per value

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            int64_t curValue = arrayBuffer[2 * i];
            int32_t month = curValue;
            int32_t day = curValue >> (4 * sizeof(int64_t));
            int64_t micros = arrayBuffer[2 * i + 1] / 1000;
            outputVector.setValue<interval_t>(i + dstOffset, interval_t(month, day, micros));
        }
    });
}

template<typename offsetsT>
static void scanArrowArrayBLOB(const ArrowArray* array, ValueVector& outputVector,
    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
    auto offsets = ((const offsetsT*)array->buffers[1]) + srcOffset;
    auto arrayBuffer = (const uint8_t*)array->buffers[2];

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            auto curOffset = offsets[i], nextOffset = offsets[i + 1];
            const uint8_t* data = arrayBuffer + curOffset;
            auto length = nextOffset - curOffset;
            BlobVector::addBlob(&outputVector, i + dstOffset, data, length);
        }
    });
}

static void scanArrowArrayBLOBView(const ArrowArray* array, ValueVector& outputVector,
    ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset, uint64_t count) {
    auto arrayBuffer = (const uint8_t*)(array->buffers[1]);
    auto valueBuffs = (const uint8_t**)(array->buffers + 2);
    // BLOB value buffers begin from index 2 onwards

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            auto curView = (const int32_t*)(arrayBuffer + (i + srcOffset) * 16);
            // view structures are 16 bytes long
            auto viewLength = curView[0];
            if (viewLength <= 12) {
                BlobVector::addBlob(&outputVector, i + dstOffset, (uint8_t*)(curView + 1),
                    viewLength);
            } else {
                auto bufIndex = curView[2];
                auto offset = curView[3];
                BlobVector::addBlob(&outputVector, i + dstOffset, valueBuffs[bufIndex] + offset,
                    viewLength);
            }
        }
    });
}

static void scanArrowArrayFixedBLOB(const ArrowArray* array, ValueVector& outputVector,
    ArrowNullMaskTree* mask, int64_t BLOBsize, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {
    auto arrayBuffer = ((const uint8_t*)array->buffers[1]) + srcOffset * BLOBsize;

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            BlobVector::addBlob(&outputVector, i + dstOffset, arrayBuffer + i * BLOBsize, BLOBsize);
        }
    });
}

template<typename offsetsT>
static void scanArrowArrayList(const ArrowSchema* schema, const ArrowArray* array,
    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {
    auto offsets = ((const offsetsT*)array->buffers[1]) + srcOffset;
    uint64_t auxDstPosition = function::NumericLimits<uint64_t>::maximum();

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        auto curOffset = offsets[i], nextOffset = offsets[i + 1];
        // don't check for validity, since we still need to update the offsets
        auto newEntry = ListVector::addList(&outputVector, nextOffset - curOffset);
        outputVector.setValue<list_entry_t>(i + dstOffset, newEntry);
        if (auxDstPosition == function::NumericLimits<uint64_t>::maximum()) {
            auxDstPosition = newEntry.offset;
        }
    });

    if (auxDstPosition == function::NumericLimits<uint64_t>::maximum()) {
        auxDstPosition = 0;
    }

    ValueVector* auxiliaryBuffer = ListVector::getDataVector(&outputVector);
    ArrowConverter::fromArrowArray(schema->children[0], array->children[0], *auxiliaryBuffer,
        mask->getChild(0), offsets[0] + array->children[0]->offset, auxDstPosition,
        offsets[count] - offsets[0]);
}

template<typename offsetsT>
static void scanArrowArrayListView(const ArrowSchema* schema, const ArrowArray* array,
    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {
    auto offsets = ((const offsetsT*)array->buffers[1]) + srcOffset;
    auto sizes = ((const offsetsT*)array->buffers[2]) + srcOffset;
    ValueVector* auxiliaryBuffer = ListVector::getDataVector(&outputVector);

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            auto curOffset = offsets[i], size = sizes[i];
            auto newEntry = ListVector::addList(&outputVector, size);
            outputVector.setValue<list_entry_t>(i + dstOffset, newEntry);
            ArrowNullMaskTree childTree(schema->children[0], array->children[0], srcOffset, count);
            // make our own child here. precomputing through the mask tree is too complicated
            ArrowConverter::fromArrowArray(schema->children[0], array->children[0],
                *auxiliaryBuffer, &childTree, curOffset, newEntry.offset, newEntry.size);
        }
    });
}

static void scanArrowArrayFixedList(const ArrowSchema* schema, const ArrowArray* array,
    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {
    auto numElements = ArrayType::getNumElements(outputVector.dataType);

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        auto newEntry = ListVector::addList(&outputVector, numElements);
        outputVector.setValue<list_entry_t>(i + dstOffset, newEntry);
    });

    auto auxiliaryBuffer = ListVector::getDataVector(&outputVector);
    ArrowConverter::fromArrowArray(schema->children[0], array->children[0], *auxiliaryBuffer,
        mask->getChild(0), srcOffset * numElements + array->children[0]->offset,
        dstOffset * numElements, count * numElements);
}

static void scanArrowArrayStruct(const ArrowSchema* schema, const ArrowArray* array,
    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            outputVector.setValue<int64_t>(i + dstOffset,
                i + dstOffset); // struct_entry_t doesn't work for some reason
        }
    });

    for (int64_t j = 0; j < schema->n_children; j++) {
        ArrowConverter::fromArrowArray(schema->children[j], array->children[j],
            *StructVector::getFieldVector(&outputVector, j).get(), mask->getChild(j),
            srcOffset + array->children[j]->offset, dstOffset, count);
    }
}

static void scanArrowArrayDenseUnion(const ArrowSchema* schema, const ArrowArray* array,
    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {
    auto types = ((const uint8_t*)array->buffers[0]) + srcOffset;
    auto dstTypes = (uint16_t*)UnionVector::getTagVector(&outputVector)->getData();
    auto offsets = ((const int32_t*)array->buffers[1]) + srcOffset;
    std::vector<int32_t> firstIncident(array->n_children, INT32_MAX);

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        auto curType = types[i];
        auto curOffset = offsets[i];
        if (curOffset < firstIncident[curType]) {
            firstIncident[curType] = curOffset;
        }
        if (!mask->isNull(i)) {
            dstTypes[i] = curType;
            auto childOffset =
                mask->getChild(curType)->offsetBy(curOffset - firstIncident[curType]);
            ArrowConverter::fromArrowArray(schema->children[curType], array->children[curType],
                *UnionVector::getValVector(&outputVector, curType), &childOffset,
                curOffset + array->children[curType]->offset, i + dstOffset, 1);
            // may be inefficient, since we're only scanning a single value
        }
    });
}

static void scanArrowArraySparseUnion(const ArrowSchema* schema, const ArrowArray* array,
    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {
    auto types = ((const uint8_t*)array->buffers[0]) + srcOffset;
    auto dstTypes = (uint16_t*)UnionVector::getTagVector(&outputVector)->getData();

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            dstTypes[i] = types[i];
        }
    });

    // it is specified that values that aren't selected in the type buffer
    // must also be semantically correct. this is why this scanning works.
    // however, there is possibly room for optimization here.
    // eg. nulling out unselected children
    for (int8_t i = 0; i < array->n_children; i++) {
        ArrowConverter::fromArrowArray(schema->children[i], array->children[i],
            *UnionVector::getValVector(&outputVector, i), mask->getChild(i),
            srcOffset + array->children[i]->offset, dstOffset, count);
    }
}

template<typename offsetsT>
static void scanArrowArrayDictionaryEncoded(const ArrowSchema* schema, const ArrowArray* array,
    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {

    auto values = ((const offsetsT*)array->buffers[1]) + srcOffset;

    mask->copyToValueVector(&outputVector, dstOffset, count);

    rowIter(outputVector, count, [&](auto i) {
        if (!mask->isNull(i)) {
            auto dictOffseted = mask->getDictionary()->offsetBy(values[i]);
            ArrowConverter::fromArrowArray(schema->dictionary, array->dictionary, outputVector,
                &dictOffseted, values[i] + array->dictionary->offset, i + dstOffset,
                1); // possibly inefficient?
        }
    });
}

static void scanArrowArrayRunEndEncoded(const ArrowSchema* schema, const ArrowArray* array,
    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {

    const ArrowArray* runEndArray = array->children[0];
    auto runEndBuffer = (const uint32_t*)runEndArray->buffers[1];

    // binary search run end corresponding to srcOffset
    auto runEndIdx = runEndArray->offset;
    {
        auto L = runEndArray->offset, H = L + runEndArray->length;
        while (H >= L) {
            auto M = (H + L) >> 1;
            if (runEndBuffer[M] < srcOffset) {
                runEndIdx = M;
                H = M - 1;
            } else {
                L = M + 1;
            }
        }
    }

    rowIter(outputVector, count, [&](auto i) {
        while (i + srcOffset >= runEndBuffer[runEndIdx + 1]) {
            runEndIdx++;
        }
        auto valuesOffseted = mask->getChild(1)->offsetBy(runEndIdx);
        ArrowConverter::fromArrowArray(schema->children[1], array->children[1], outputVector,
            &valuesOffseted, runEndIdx, i + dstOffset,
            1); // there is optimization to be made here...
    });
}

void ArrowConverter::fromArrowArray(const ArrowSchema* schema, const ArrowArray* array,
    ValueVector& outputVector, ArrowNullMaskTree* mask, uint64_t srcOffset, uint64_t dstOffset,
    uint64_t count) {
    const auto arrowType = schema->format;
    if (array->dictionary != nullptr) {
        switch (arrowType[0]) {
        case 'c':
            return scanArrowArrayDictionaryEncoded<int8_t>(schema, array, outputVector, mask,
                srcOffset, dstOffset, count);
        case 'C':
            return scanArrowArrayDictionaryEncoded<uint8_t>(schema, array, outputVector, mask,
                srcOffset, dstOffset, count);
        case 's':
            return scanArrowArrayDictionaryEncoded<int16_t>(schema, array, outputVector, mask,
                srcOffset, dstOffset, count);
        case 'S':
            return scanArrowArrayDictionaryEncoded<uint16_t>(schema, array, outputVector, mask,
                srcOffset, dstOffset, count);
        case 'i':
            return scanArrowArrayDictionaryEncoded<int32_t>(schema, array, outputVector, mask,
                srcOffset, dstOffset, count);
        case 'I':
            return scanArrowArrayDictionaryEncoded<uint32_t>(schema, array, outputVector, mask,
                srcOffset, dstOffset, count);
        case 'l':
            return scanArrowArrayDictionaryEncoded<int64_t>(schema, array, outputVector, mask,
                srcOffset, dstOffset, count);
        case 'L':
            return scanArrowArrayDictionaryEncoded<uint64_t>(schema, array, outputVector, mask,
                srcOffset, dstOffset, count);
        default:
            throw RuntimeException("Invalid Index Type: " + std::string(arrowType));
        }
    }
    switch (arrowType[0]) {
    case 'n':
        // NULL
        outputVector.setAllNull();
        return;
    case 'b':
        // BOOL
        return scanArrowArrayFixedSizePrimitive<bool>(array, outputVector, mask, srcOffset,
            dstOffset, count);
    case 'c':
        // INT8
        return scanArrowArrayFixedSizePrimitive<int8_t>(array, outputVector, mask, srcOffset,
            dstOffset, count);
    case 'C':
        // UINT8
        return scanArrowArrayFixedSizePrimitive<uint8_t>(array, outputVector, mask, srcOffset,
            dstOffset, count);
    case 's':
        // INT16
        return scanArrowArrayFixedSizePrimitive<int16_t>(array, outputVector, mask, srcOffset,
            dstOffset, count);
    case 'S':
        // UINT16
        return scanArrowArrayFixedSizePrimitive<uint16_t>(array, outputVector, mask, srcOffset,
            dstOffset, count);
    case 'i':
        // INT32
        return scanArrowArrayFixedSizePrimitive<int32_t>(array, outputVector, mask, srcOffset,
            dstOffset, count);
    case 'I':
        // UINT32
        return scanArrowArrayFixedSizePrimitive<uint32_t>(array, outputVector, mask, srcOffset,
            dstOffset, count);
    case 'l':
        // INT64
        return scanArrowArrayFixedSizePrimitive<int64_t>(array, outputVector, mask, srcOffset,
            dstOffset, count);
    case 'L':
        // UINT64
        return scanArrowArrayFixedSizePrimitive<uint64_t>(array, outputVector, mask, srcOffset,
            dstOffset, count);
    case 'f':
        // FLOAT
        return scanArrowArrayFixedSizePrimitive<float>(array, outputVector, mask, srcOffset,
            dstOffset, count);
    case 'g':
        // DOUBLE
        return scanArrowArrayFixedSizePrimitive<double>(array, outputVector, mask, srcOffset,
            dstOffset, count);
    case 'z':
        // BLOB
        return scanArrowArrayBLOB<int32_t>(array, outputVector, mask, srcOffset, dstOffset, count);
    case 'Z':
        // LONG BLOB
        return scanArrowArrayBLOB<int64_t>(array, outputVector, mask, srcOffset, dstOffset, count);
    case 'u':
        // STRING
        return scanArrowArrayBLOB<int32_t>(array, outputVector, mask, srcOffset, dstOffset, count);
    case 'U':
        // LONG STRING
        return scanArrowArrayBLOB<int64_t>(array, outputVector, mask, srcOffset, dstOffset, count);
    case 'v':
        switch (arrowType[1]) {
        case 'z':
            // BINARY VIEW
        case 'u':
            // STRING VIEW
            return scanArrowArrayBLOBView(array, outputVector, mask, srcOffset, dstOffset, count);
        default:
            UNREACHABLE_CODE;
        }
    case 'd': {
        switch (outputVector.dataType.getPhysicalType()) {
        case PhysicalTypeID::INT16:
            return scanArrowArrayFixedSizePrimitiveAndCastTo<int128_t, int16_t>(array, outputVector,
                mask, srcOffset, dstOffset, count);
        case PhysicalTypeID::INT32:
            return scanArrowArrayFixedSizePrimitiveAndCastTo<int128_t, int32_t>(array, outputVector,
                mask, srcOffset, dstOffset, count);
        case PhysicalTypeID::INT64:
            return scanArrowArrayFixedSizePrimitiveAndCastTo<int128_t, int64_t>(array, outputVector,
                mask, srcOffset, dstOffset, count);
        case PhysicalTypeID::INT128:
            return scanArrowArrayFixedSizePrimitive<int128_t>(array, outputVector, mask, srcOffset,
                dstOffset, count);
        default:
            UNREACHABLE_CODE;
        }
    }
    case 'w':
        // FIXED BLOB
        return scanArrowArrayFixedBLOB(array, outputVector, mask, std::stoi(arrowType + 2),
            srcOffset, dstOffset, count);
    case 't':
        switch (arrowType[1]) {
        case 'd':
            // DATE
            if (arrowType[2] == 'D') {
                // days since unix epoch
                return scanArrowArrayFixedSizePrimitive<int32_t>(array, outputVector, mask,
                    srcOffset, dstOffset, count);
            } else {
                // ms since unix epoch
                return scanArrowArrayFixedSizePrimitive<int64_t>(array, outputVector, mask,
                    srcOffset, dstOffset, count);
            }
        case 't':
            // TODO pure time type
            UNREACHABLE_CODE;
        case 's':
            // TIMESTAMP
            return scanArrowArrayFixedSizePrimitive<int64_t>(array, outputVector, mask, srcOffset,
                dstOffset, count);
        case 'D':
            // DURATION (LBUG INTERVAL)
            switch (arrowType[2]) {
            case 's':
                // consider implement overflow checking here?
                return scanArrowArrayDurationScaledUp(array, outputVector, mask, 1000000, srcOffset,
                    dstOffset, count);
            case 'm':
                return scanArrowArrayDurationScaledUp(array, outputVector, mask, 1000, srcOffset,
                    dstOffset, count);
            case 'u':
                return scanArrowArrayDurationScaledUp(array, outputVector, mask, 1, srcOffset,
                    dstOffset, count);
            case 'n':
                return scanArrowArrayDurationScaledDown(array, outputVector, mask, 1000, srcOffset,
                    dstOffset, count);
            default:
                UNREACHABLE_CODE;
            }
        case 'i':
            // INTERVAL
            switch (arrowType[2]) {
            case 'M':
                return scanArrowArrayMonthInterval(array, outputVector, mask, srcOffset, dstOffset,
                    count);
            case 'D':
                return scanArrowArrayDayTimeInterval(array, outputVector, mask, srcOffset,
                    dstOffset, count);
            case 'n':
                return scanArrowArrayMonthDayNanoInterval(array, outputVector, mask, srcOffset,
                    dstOffset, count);
            default:
                UNREACHABLE_CODE;
            }
        default:
            UNREACHABLE_CODE;
        }
    case '+':
        switch (arrowType[1]) {
        case 'r':
            // RUN END ENCODED
            return scanArrowArrayRunEndEncoded(schema, array, outputVector, mask, srcOffset,
                dstOffset, count);
        case 'l':
            // LIST
            return scanArrowArrayList<int32_t>(schema, array, outputVector, mask, srcOffset,
                dstOffset, count);
        case 'L':
            // LONG LIST
            return scanArrowArrayList<int64_t>(schema, array, outputVector, mask, srcOffset,
                dstOffset, count);
        case 'w': {
            // ARRAY
            RUNTIME_CHECK({
                auto arrowNumElements = std::stoul(arrowType + 3);
                auto outputNumElements = ArrayType::getNumElements(outputVector.dataType);
                DASSERT(arrowNumElements == outputNumElements);
            });
            return scanArrowArrayFixedList(schema, array, outputVector, mask, srcOffset, dstOffset,
                count);
        }
        case 's':
            // STRUCT
            return scanArrowArrayStruct(schema, array, outputVector, mask, srcOffset, dstOffset,
                count);
        case 'm':
            // MAP
            return scanArrowArrayList<int32_t>(schema, array, outputVector, mask, srcOffset,
                dstOffset, count);
        case 'u':
            if (arrowType[2] == 'd') {
                // DENSE UNION
                return scanArrowArrayDenseUnion(schema, array, outputVector, mask, srcOffset,
                    dstOffset, count);
            } else {
                // SPARSE UNION
                return scanArrowArraySparseUnion(schema, array, outputVector, mask, srcOffset,
                    dstOffset, count);
            }
        case 'v':
            switch (arrowType[2]) {
            case 'l':
                return scanArrowArrayListView<int32_t>(schema, array, outputVector, mask, srcOffset,
                    dstOffset, count);
            case 'L':
                return scanArrowArrayListView<int64_t>(schema, array, outputVector, mask, srcOffset,
                    dstOffset, count);
                // LONG LIST VIEW
            default:
                UNREACHABLE_CODE;
            }
        default:
            UNREACHABLE_CODE;
        }
    default:
        UNREACHABLE_CODE;
    }
}

void ArrowConverter::fromArrowArray(const ArrowSchema* schema, const ArrowArray* array,
    ValueVector& outputVector) {
    ArrowNullMaskTree mask(schema, array, array->offset, array->length);
    return fromArrowArray(schema, array, outputVector, &mask, array->offset, 0, array->length);
}

} // namespace common
} // namespace lbug