duckdb 0.5.1-dev101.0 → 0.5.1-dev122.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 +9 -9
- package/src/duckdb.hpp +2 -2
- package/src/parquet-amalgamation.cpp +20022 -20022
package/package.json
CHANGED
package/src/duckdb.cpp
CHANGED
|
@@ -6602,7 +6602,7 @@ static void GetBitPosition(idx_t row_idx, idx_t ¤t_byte, uint8_t ¤t_
|
|
|
6602
6602
|
}
|
|
6603
6603
|
|
|
6604
6604
|
static void UnsetBit(uint8_t *data, idx_t current_byte, uint8_t current_bit) {
|
|
6605
|
-
data[current_byte] &= ~(1 << current_bit);
|
|
6605
|
+
data[current_byte] &= ~((uint64_t)1 << current_bit);
|
|
6606
6606
|
}
|
|
6607
6607
|
|
|
6608
6608
|
static void NextBit(idx_t ¤t_byte, uint8_t ¤t_bit) {
|
|
@@ -28654,7 +28654,7 @@ template <idx_t radix_bits>
|
|
|
28654
28654
|
struct RadixPartitioningConstants {
|
|
28655
28655
|
public:
|
|
28656
28656
|
static constexpr const idx_t NUM_RADIX_BITS = radix_bits;
|
|
28657
|
-
static constexpr const idx_t NUM_PARTITIONS = 1 << NUM_RADIX_BITS;
|
|
28657
|
+
static constexpr const idx_t NUM_PARTITIONS = (idx_t)1 << NUM_RADIX_BITS;
|
|
28658
28658
|
static constexpr const idx_t TMP_BUF_SIZE = 8;
|
|
28659
28659
|
|
|
28660
28660
|
public:
|
|
@@ -28672,7 +28672,7 @@ private:
|
|
|
28672
28672
|
struct RadixPartitioning {
|
|
28673
28673
|
public:
|
|
28674
28674
|
static idx_t NumberOfPartitions(idx_t radix_bits) {
|
|
28675
|
-
return 1 << radix_bits;
|
|
28675
|
+
return (idx_t)1 << radix_bits;
|
|
28676
28676
|
}
|
|
28677
28677
|
|
|
28678
28678
|
//! Partition the data in block_collection/string_heap to multiple partitions
|
|
@@ -81085,7 +81085,7 @@ PerfectAggregateHashTable::PerfectAggregateHashTable(Allocator &allocator, Buffe
|
|
|
81085
81085
|
total_required_bits += group_bits;
|
|
81086
81086
|
}
|
|
81087
81087
|
// the total amount of groups we allocate space for is 2^required_bits
|
|
81088
|
-
total_groups = 1 << total_required_bits;
|
|
81088
|
+
total_groups = (uint64_t)1 << total_required_bits;
|
|
81089
81089
|
// we don't need to store the groups in a perfect hash table, since the group keys can be deduced by their location
|
|
81090
81090
|
grouping_columns = group_types_p.size();
|
|
81091
81091
|
layout.Initialize(move(aggregate_objects_p));
|
|
@@ -81269,7 +81269,7 @@ static void ReconstructGroupVectorTemplated(uint32_t group_values[], Value &min,
|
|
|
81269
81269
|
static void ReconstructGroupVector(uint32_t group_values[], Value &min, idx_t required_bits, idx_t shift,
|
|
81270
81270
|
idx_t entry_count, Vector &result) {
|
|
81271
81271
|
// construct the mask for this entry
|
|
81272
|
-
idx_t mask = (1 << required_bits) - 1;
|
|
81272
|
+
idx_t mask = ((uint64_t)1 << required_bits) - 1;
|
|
81273
81273
|
switch (result.GetType().InternalType()) {
|
|
81274
81274
|
case PhysicalType::INT8:
|
|
81275
81275
|
ReconstructGroupVectorTemplated<int8_t>(group_values, min, mask, shift, entry_count, result);
|
|
@@ -85516,7 +85516,7 @@ void RadixPartitionedHashTable::SetGroupingValues() {
|
|
|
85516
85516
|
for (idx_t i = 0; i < grouping.size(); i++) {
|
|
85517
85517
|
if (grouping_set.find(grouping[i]) == grouping_set.end()) {
|
|
85518
85518
|
// we don't group on this value!
|
|
85519
|
-
grouping_value += 1 << (grouping.size() - (i + 1));
|
|
85519
|
+
grouping_value += (int64_t)1 << (grouping.size() - (i + 1));
|
|
85520
85520
|
}
|
|
85521
85521
|
}
|
|
85522
85522
|
grouping_values.push_back(Value::BIGINT(grouping_value));
|
|
@@ -123211,7 +123211,7 @@ bool duckdb_validity_row_is_valid(uint64_t *validity, idx_t row) {
|
|
|
123211
123211
|
}
|
|
123212
123212
|
idx_t entry_idx = row / 64;
|
|
123213
123213
|
idx_t idx_in_entry = row % 64;
|
|
123214
|
-
return validity[entry_idx] & (1 << idx_in_entry);
|
|
123214
|
+
return validity[entry_idx] & ((idx_t)1 << idx_in_entry);
|
|
123215
123215
|
}
|
|
123216
123216
|
|
|
123217
123217
|
void duckdb_validity_set_row_validity(uint64_t *validity, idx_t row, bool valid) {
|
|
@@ -123228,7 +123228,7 @@ void duckdb_validity_set_row_invalid(uint64_t *validity, idx_t row) {
|
|
|
123228
123228
|
}
|
|
123229
123229
|
idx_t entry_idx = row / 64;
|
|
123230
123230
|
idx_t idx_in_entry = row % 64;
|
|
123231
|
-
validity[entry_idx] &= ~(1 << idx_in_entry);
|
|
123231
|
+
validity[entry_idx] &= ~((uint64_t)1 << idx_in_entry);
|
|
123232
123232
|
}
|
|
123233
123233
|
|
|
123234
123234
|
void duckdb_validity_set_row_valid(uint64_t *validity, idx_t row) {
|
|
@@ -123237,7 +123237,7 @@ void duckdb_validity_set_row_valid(uint64_t *validity, idx_t row) {
|
|
|
123237
123237
|
}
|
|
123238
123238
|
idx_t entry_idx = row / 64;
|
|
123239
123239
|
idx_t idx_in_entry = row % 64;
|
|
123240
|
-
validity[entry_idx] |= 1 << idx_in_entry;
|
|
123240
|
+
validity[entry_idx] |= (uint64_t)1 << idx_in_entry;
|
|
123241
123241
|
}
|
|
123242
123242
|
|
|
123243
123243
|
|
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.5.1-
|
|
14
|
+
#define DUCKDB_SOURCE_ID "794992a38"
|
|
15
|
+
#define DUCKDB_VERSION "v0.5.1-dev122"
|
|
16
16
|
//===----------------------------------------------------------------------===//
|
|
17
17
|
// DuckDB
|
|
18
18
|
//
|