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
|
// 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.
#include "arrow/array/builder_union.h"
#include <cstddef>
#include <utility>
#include "arrow/buffer.h"
#include "arrow/util/checked_cast.h"
#include "arrow/util/logging.h"
namespace arrow20 {
using internal::checked_cast;
using internal::checked_pointer_cast;
Status BasicUnionBuilder::FinishInternal(std::shared_ptr<ArrayData>* out) {
int64_t length = types_builder_.length();
std::shared_ptr<Buffer> types;
RETURN_NOT_OK(types_builder_.Finish(&types));
std::vector<std::shared_ptr<ArrayData>> child_data(children_.size());
for (size_t i = 0; i < children_.size(); ++i) {
RETURN_NOT_OK(children_[i]->FinishInternal(&child_data[i]));
}
*out = ArrayData::Make(type(), length, {nullptr, types}, /*null_count=*/0);
(*out)->child_data = std::move(child_data);
return Status::OK();
}
Status DenseUnionBuilder::AppendArraySlice(const ArraySpan& array, const int64_t offset,
const int64_t length) {
const int8_t* type_codes = array.GetValues<int8_t>(1);
const int32_t* offsets = array.GetValues<int32_t>(2);
for (int64_t row = offset; row < offset + length; row++) {
const int8_t type_code = type_codes[row];
const int child_id = type_id_to_child_id_[type_code];
const int32_t union_offset = offsets[row];
RETURN_NOT_OK(Append(type_code));
RETURN_NOT_OK(type_id_to_children_[type_code]->AppendArraySlice(
array.child_data[child_id], union_offset, /*length=*/1));
}
return Status::OK();
}
Status DenseUnionBuilder::FinishInternal(std::shared_ptr<ArrayData>* out) {
ARROW_RETURN_NOT_OK(BasicUnionBuilder::FinishInternal(out));
(*out)->buffers.resize(3);
ARROW_RETURN_NOT_OK(offsets_builder_.Finish(&(*out)->buffers[2]));
return Status::OK();
}
BasicUnionBuilder::BasicUnionBuilder(
MemoryPool* pool, int64_t alignment,
const std::vector<std::shared_ptr<ArrayBuilder>>& children,
const std::shared_ptr<DataType>& type)
: ArrayBuilder(pool, alignment),
child_fields_(children.size()),
types_builder_(pool, alignment) {
const auto& union_type = checked_cast<const UnionType&>(*type);
mode_ = union_type.mode();
DCHECK_EQ(children.size(), union_type.type_codes().size());
type_codes_ = union_type.type_codes();
children_ = children;
type_id_to_child_id_.resize(union_type.max_type_code() + 1, -1);
type_id_to_children_.resize(union_type.max_type_code() + 1, nullptr);
DCHECK_LE(
type_id_to_children_.size() - 1,
static_cast<decltype(type_id_to_children_)::size_type>(UnionType::kMaxTypeCode));
for (size_t i = 0; i < children.size(); ++i) {
child_fields_[i] = union_type.field(static_cast<int>(i));
auto type_id = union_type.type_codes()[i];
type_id_to_child_id_[type_id] = static_cast<int>(i);
type_id_to_children_[type_id] = children[i].get();
}
}
int8_t BasicUnionBuilder::AppendChild(const std::shared_ptr<ArrayBuilder>& new_child,
const std::string& field_name) {
children_.push_back(new_child);
auto new_type_id = NextTypeId();
type_id_to_child_id_[new_type_id] = static_cast<int>(children_.size() - 1);
type_id_to_children_[new_type_id] = new_child.get();
child_fields_.push_back(field(field_name, nullptr));
type_codes_.push_back(static_cast<int8_t>(new_type_id));
return new_type_id;
}
std::shared_ptr<DataType> BasicUnionBuilder::type() const {
std::vector<std::shared_ptr<Field>> child_fields(child_fields_.size());
for (size_t i = 0; i < child_fields.size(); ++i) {
child_fields[i] = child_fields_[i]->WithType(children_[i]->type());
}
return mode_ == UnionMode::SPARSE ? sparse_union(std::move(child_fields), type_codes_)
: dense_union(std::move(child_fields), type_codes_);
}
int8_t BasicUnionBuilder::NextTypeId() {
// Find type_id such that type_id_to_children_[type_id] == nullptr
// and use that for the new child. Start searching at dense_type_id_
// since type_id_to_children_ is densely packed up at least up to dense_type_id_
for (; static_cast<size_t>(dense_type_id_) < type_id_to_children_.size();
++dense_type_id_) {
if (type_id_to_children_[dense_type_id_] == nullptr) {
return dense_type_id_++;
}
}
DCHECK_LT(
type_id_to_children_.size(),
static_cast<decltype(type_id_to_children_)::size_type>(UnionType::kMaxTypeCode));
// type_id_to_children_ is already densely packed, so just append the new child
type_id_to_child_id_.resize(type_id_to_child_id_.size() + 1);
type_id_to_children_.resize(type_id_to_children_.size() + 1);
return dense_type_id_++;
}
Status SparseUnionBuilder::AppendArraySlice(const ArraySpan& array, const int64_t offset,
const int64_t length) {
for (size_t i = 0; i < type_codes_.size(); i++) {
RETURN_NOT_OK(type_id_to_children_[type_codes_[i]]->AppendArraySlice(
array.child_data[i], array.offset + offset, length));
}
const int8_t* type_codes = array.GetValues<int8_t>(1);
RETURN_NOT_OK(types_builder_.Append(type_codes + offset, length));
return Status::OK();
}
} // namespace arrow20
|
