duckdb 0.3.5-dev750.0 → 0.3.5-dev762.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/package.json +1 -1
- package/src/duckdb.cpp +13 -34
- package/src/duckdb.hpp +4 -7
- package/src/parquet-amalgamation.cpp +36433 -36433
- package/src/statement.cpp +85 -65
- package/test/data_type_support.test.js +41 -5
package/package.json
CHANGED
package/src/duckdb.cpp
CHANGED
|
@@ -45933,7 +45933,7 @@ void Vector::Orrify(idx_t count, VectorData &data) {
|
|
|
45933
45933
|
break;
|
|
45934
45934
|
default:
|
|
45935
45935
|
Normalify(count);
|
|
45936
|
-
data.sel = FlatVector::IncrementalSelectionVector(
|
|
45936
|
+
data.sel = FlatVector::IncrementalSelectionVector();
|
|
45937
45937
|
data.data = FlatVector::GetData(*this);
|
|
45938
45938
|
data.validity = FlatVector::Validity(*this);
|
|
45939
45939
|
break;
|
|
@@ -46128,8 +46128,7 @@ void Vector::UTFVerify(const SelectionVector &sel, idx_t count) {
|
|
|
46128
46128
|
}
|
|
46129
46129
|
|
|
46130
46130
|
void Vector::UTFVerify(idx_t count) {
|
|
46131
|
-
|
|
46132
|
-
auto flat_sel = FlatVector::IncrementalSelectionVector(count, owned_sel);
|
|
46131
|
+
auto flat_sel = FlatVector::IncrementalSelectionVector();
|
|
46133
46132
|
|
|
46134
46133
|
UTFVerify(*flat_sel, count);
|
|
46135
46134
|
}
|
|
@@ -46247,8 +46246,7 @@ void Vector::Verify(const SelectionVector &sel, idx_t count) {
|
|
|
46247
46246
|
}
|
|
46248
46247
|
|
|
46249
46248
|
void Vector::Verify(idx_t count) {
|
|
46250
|
-
|
|
46251
|
-
auto flat_sel = FlatVector::IncrementalSelectionVector(count, owned_sel);
|
|
46249
|
+
auto flat_sel = FlatVector::IncrementalSelectionVector();
|
|
46252
46250
|
Verify(*flat_sel, count);
|
|
46253
46251
|
}
|
|
46254
46252
|
|
|
@@ -46277,17 +46275,6 @@ void ConstantVector::SetNull(Vector &vector, bool is_null) {
|
|
|
46277
46275
|
}
|
|
46278
46276
|
}
|
|
46279
46277
|
|
|
46280
|
-
const SelectionVector *FlatVector::IncrementalSelectionVector(idx_t count, SelectionVector &owned_sel) {
|
|
46281
|
-
if (count <= STANDARD_VECTOR_SIZE) {
|
|
46282
|
-
return FlatVector::IncrementalSelectionVector();
|
|
46283
|
-
}
|
|
46284
|
-
owned_sel.Initialize(count);
|
|
46285
|
-
for (idx_t i = 0; i < count; i++) {
|
|
46286
|
-
owned_sel.set_index(i, i);
|
|
46287
|
-
}
|
|
46288
|
-
return &owned_sel;
|
|
46289
|
-
}
|
|
46290
|
-
|
|
46291
46278
|
const SelectionVector *ConstantVector::ZeroSelectionVector(idx_t count, SelectionVector &owned_sel) {
|
|
46292
46279
|
if (count <= STANDARD_VECTOR_SIZE) {
|
|
46293
46280
|
return ConstantVector::ZeroSelectionVector();
|
|
@@ -49337,9 +49324,8 @@ static idx_t DistinctSelectConstant(Vector &left, Vector &right, const Selection
|
|
|
49337
49324
|
template <class LEFT_TYPE, class RIGHT_TYPE, class OP>
|
|
49338
49325
|
static idx_t DistinctSelect(Vector &left, Vector &right, const SelectionVector *sel, idx_t count,
|
|
49339
49326
|
SelectionVector *true_sel, SelectionVector *false_sel) {
|
|
49340
|
-
SelectionVector owned_sel;
|
|
49341
49327
|
if (!sel) {
|
|
49342
|
-
sel = FlatVector::IncrementalSelectionVector(
|
|
49328
|
+
sel = FlatVector::IncrementalSelectionVector();
|
|
49343
49329
|
}
|
|
49344
49330
|
if (left.GetVectorType() == VectorType::CONSTANT_VECTOR && right.GetVectorType() == VectorType::CONSTANT_VECTOR) {
|
|
49345
49331
|
return DistinctSelectConstant<LEFT_TYPE, RIGHT_TYPE, OP>(left, right, sel, count, true_sel, false_sel);
|
|
@@ -49773,9 +49759,8 @@ static idx_t DistinctSelectNested(Vector &left, Vector &right, const SelectionVe
|
|
|
49773
49759
|
// a selection vector in a single pass. But to implement progressive comparisons,
|
|
49774
49760
|
// we have to make multiple passes, so we need to keep track of the original input positions
|
|
49775
49761
|
// and then scatter the output selections when we are done.
|
|
49776
|
-
SelectionVector owned_sel;
|
|
49777
49762
|
if (!sel) {
|
|
49778
|
-
sel = FlatVector::IncrementalSelectionVector(
|
|
49763
|
+
sel = FlatVector::IncrementalSelectionVector();
|
|
49779
49764
|
}
|
|
49780
49765
|
|
|
49781
49766
|
// Make buffered selections for progressive comparisons
|
|
@@ -51697,8 +51682,7 @@ void VectorOperations::Copy(const Vector &source, Vector &target, idx_t source_c
|
|
|
51697
51682
|
break;
|
|
51698
51683
|
}
|
|
51699
51684
|
case VectorType::FLAT_VECTOR: {
|
|
51700
|
-
|
|
51701
|
-
auto sel = FlatVector::IncrementalSelectionVector(source_count, owned_sel);
|
|
51685
|
+
auto sel = FlatVector::IncrementalSelectionVector();
|
|
51702
51686
|
VectorOperations::Copy(source, target, *sel, source_count, source_offset, target_offset);
|
|
51703
51687
|
break;
|
|
51704
51688
|
}
|
|
@@ -51708,8 +51692,7 @@ void VectorOperations::Copy(const Vector &source, Vector &target, idx_t source_c
|
|
|
51708
51692
|
Vector flattened(source.GetType());
|
|
51709
51693
|
VectorOperations::GenerateSequence(flattened, source_count, start, increment);
|
|
51710
51694
|
|
|
51711
|
-
|
|
51712
|
-
auto sel = FlatVector::IncrementalSelectionVector(source_count, owned_sel);
|
|
51695
|
+
auto sel = FlatVector::IncrementalSelectionVector();
|
|
51713
51696
|
VectorOperations::Copy(flattened, target, *sel, source_count, source_offset, target_offset);
|
|
51714
51697
|
break;
|
|
51715
51698
|
}
|
|
@@ -54207,9 +54190,8 @@ static idx_t NestedSelectOperation(Vector &left, Vector &right, const SelectionV
|
|
|
54207
54190
|
// a selection vector in a single pass. But to implement progressive comparisons,
|
|
54208
54191
|
// we have to make multiple passes, so we need to keep track of the original input positions
|
|
54209
54192
|
// and then scatter the output selections when we are done.
|
|
54210
|
-
SelectionVector owned_sel;
|
|
54211
54193
|
if (!sel) {
|
|
54212
|
-
sel = FlatVector::IncrementalSelectionVector(
|
|
54194
|
+
sel = FlatVector::IncrementalSelectionVector();
|
|
54213
54195
|
}
|
|
54214
54196
|
|
|
54215
54197
|
// Make buffered selections for progressive comparisons
|
|
@@ -54959,9 +54941,8 @@ idx_t ExpressionExecutor::DefaultSelect(const Expression &expr, ExpressionState
|
|
|
54959
54941
|
VectorData idata;
|
|
54960
54942
|
intermediate.Orrify(count, idata);
|
|
54961
54943
|
|
|
54962
|
-
SelectionVector owned_sel;
|
|
54963
54944
|
if (!sel) {
|
|
54964
|
-
sel = FlatVector::IncrementalSelectionVector(
|
|
54945
|
+
sel = FlatVector::IncrementalSelectionVector();
|
|
54965
54946
|
}
|
|
54966
54947
|
if (!idata.validity.AllValid()) {
|
|
54967
54948
|
return DefaultSelectSwitch<false>(idata, sel, count, true_sel, false_sel);
|
|
@@ -81601,7 +81582,7 @@ static bool TemplatedOptimumList(Vector &left, idx_t lidx, idx_t lcount, Vector
|
|
|
81601
81582
|
ridx = rvdata.sel->get_index(ridx);
|
|
81602
81583
|
|
|
81603
81584
|
lcount = ListVector::GetListSize(left);
|
|
81604
|
-
rcount = ListVector::GetListSize(
|
|
81585
|
+
rcount = ListVector::GetListSize(right);
|
|
81605
81586
|
|
|
81606
81587
|
// DISTINCT semantics are in effect for nested types
|
|
81607
81588
|
auto lnull = !lvdata.validity.RowIsValid(lidx);
|
|
@@ -100213,8 +100194,7 @@ static void ConcatWSFunction(DataChunk &args, ExpressionState &state, Vector &re
|
|
|
100213
100194
|
return;
|
|
100214
100195
|
}
|
|
100215
100196
|
// no null values
|
|
100216
|
-
|
|
100217
|
-
auto sel = FlatVector::IncrementalSelectionVector(args.size(), owned_sel);
|
|
100197
|
+
auto sel = FlatVector::IncrementalSelectionVector();
|
|
100218
100198
|
TemplatedConcatWS(args, (string_t *)vdata.data, *vdata.sel, *sel, args.size(), result);
|
|
100219
100199
|
return;
|
|
100220
100200
|
}
|
|
@@ -180951,8 +180931,7 @@ void BaseStatistics::Verify(Vector &vector, const SelectionVector &sel, idx_t co
|
|
|
180951
180931
|
}
|
|
180952
180932
|
|
|
180953
180933
|
void BaseStatistics::Verify(Vector &vector, idx_t count) const {
|
|
180954
|
-
|
|
180955
|
-
auto sel = FlatVector::IncrementalSelectionVector(count, owned_sel);
|
|
180934
|
+
auto sel = FlatVector::IncrementalSelectionVector();
|
|
180956
180935
|
Verify(vector, *sel, count);
|
|
180957
180936
|
}
|
|
180958
180937
|
|
|
@@ -184079,7 +184058,7 @@ void ListColumnData::Append(BaseStatistics &stats_p, ColumnAppendState &state, V
|
|
|
184079
184058
|
|
|
184080
184059
|
VectorData vdata;
|
|
184081
184060
|
vdata.validity = list_validity;
|
|
184082
|
-
vdata.sel = FlatVector::IncrementalSelectionVector(
|
|
184061
|
+
vdata.sel = FlatVector::IncrementalSelectionVector();
|
|
184083
184062
|
vdata.data = (data_ptr_t)append_offsets.get();
|
|
184084
184063
|
|
|
184085
184064
|
// append the list offsets
|
package/src/duckdb.hpp
CHANGED
|
@@ -11,8 +11,8 @@ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLI
|
|
|
11
11
|
#pragma once
|
|
12
12
|
#define DUCKDB_AMALGAMATION 1
|
|
13
13
|
#define DUCKDB_AMALGAMATION_EXTENDED 1
|
|
14
|
-
#define DUCKDB_SOURCE_ID "
|
|
15
|
-
#define DUCKDB_VERSION "v0.3.5-
|
|
14
|
+
#define DUCKDB_SOURCE_ID "d4fb733d0"
|
|
15
|
+
#define DUCKDB_VERSION "v0.3.5-dev762"
|
|
16
16
|
//===----------------------------------------------------------------------===//
|
|
17
17
|
// DuckDB
|
|
18
18
|
//
|
|
@@ -3874,7 +3874,6 @@ struct FlatVector {
|
|
|
3874
3874
|
D_ASSERT(vector.GetVectorType() == VectorType::FLAT_VECTOR);
|
|
3875
3875
|
return !vector.validity.RowIsValid(idx);
|
|
3876
3876
|
}
|
|
3877
|
-
DUCKDB_API static const SelectionVector *IncrementalSelectionVector(idx_t count, SelectionVector &owned_sel);
|
|
3878
3877
|
DUCKDB_API static const SelectionVector *IncrementalSelectionVector();
|
|
3879
3878
|
};
|
|
3880
3879
|
|
|
@@ -4896,9 +4895,8 @@ public:
|
|
|
4896
4895
|
template <class LEFT_TYPE, class RIGHT_TYPE, class OP>
|
|
4897
4896
|
static idx_t Select(Vector &left, Vector &right, const SelectionVector *sel, idx_t count, SelectionVector *true_sel,
|
|
4898
4897
|
SelectionVector *false_sel) {
|
|
4899
|
-
SelectionVector owned_sel;
|
|
4900
4898
|
if (!sel) {
|
|
4901
|
-
sel = FlatVector::IncrementalSelectionVector(
|
|
4899
|
+
sel = FlatVector::IncrementalSelectionVector();
|
|
4902
4900
|
}
|
|
4903
4901
|
if (left.GetVectorType() == VectorType::CONSTANT_VECTOR &&
|
|
4904
4902
|
right.GetVectorType() == VectorType::CONSTANT_VECTOR) {
|
|
@@ -5097,9 +5095,8 @@ public:
|
|
|
5097
5095
|
template <class A_TYPE, class B_TYPE, class C_TYPE, class OP>
|
|
5098
5096
|
static idx_t Select(Vector &a, Vector &b, Vector &c, const SelectionVector *sel, idx_t count,
|
|
5099
5097
|
SelectionVector *true_sel, SelectionVector *false_sel) {
|
|
5100
|
-
SelectionVector owned_sel;
|
|
5101
5098
|
if (!sel) {
|
|
5102
|
-
sel = FlatVector::IncrementalSelectionVector(
|
|
5099
|
+
sel = FlatVector::IncrementalSelectionVector();
|
|
5103
5100
|
}
|
|
5104
5101
|
VectorData adata, bdata, cdata;
|
|
5105
5102
|
a.Orrify(count, adata);
|