forked from facebookincubator/velox
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathVectorReaderWriter.cpp
More file actions
154 lines (123 loc) · 4.69 KB
/
Copy pathVectorReaderWriter.cpp
File metadata and controls
154 lines (123 loc) · 4.69 KB
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
/*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* Licensed 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 <iostream>
#include "velox/expression/VectorReaders.h"
#include "velox/expression/VectorWriters.h"
#include "velox/type/Type.h"
#include "velox/vector/BaseVector.h"
using namespace facebook::velox;
/// This file contains examples to use VectorReader and VectorWriter to
/// read/write Velox vectors.
/// VectorReaders and VectorWriters are efficient and lazy and should be used
/// unless there's a clear reason not to.
namespace {
// produce serial number for each call
auto serial() {
static int64_t n = 0;
return n++;
}
} // namespace
int main() {
const int num_rows = 8;
memory::MemoryManager::initialize(memory::MemoryManager::Options{});
/****************** Vector Writer **********************/
// Define rows to write
SelectivityVector rows{num_rows};
// Array<Map<int,int>>
auto type = TypeFactory<TypeKind::ARRAY>::create(
TypeFactory<TypeKind::MAP>::create(BIGINT(), BIGINT()));
auto pool = memory::memoryManager()->addLeafPool();
// result vector
VectorPtr result;
// 1. Make sure result is writable for rows of interest
BaseVector::ensureWritable(rows, type, pool.get(), result);
// 2. Define a vector writer VectorWriter<T> where T is the type expressed in
// the simple function type system.
exec::VectorWriter<Array<Map<int64_t, int64_t>>> vectorWriter;
// 3. Initialize the writer to write to result vector.
vectorWriter.init(*result->as<ArrayVector>());
rows.applyToSelected([&](vector_size_t row) {
// 4. To write to a specific row call setOffset(row) followed by current()
// to get the writer at that row
vectorWriter.setOffset(row);
auto& arrayWriter = vectorWriter.current();
// Insert a map element to the array
auto& child = arrayWriter.add_item();
// Insert 2 kv pairs to the map
child.emplace(serial(), serial());
child.emplace(serial(), serial());
// Insert an empty map
arrayWriter.add_item();
// 5. After finishing writing the row call commit(), or commit(false) to
// write a null
vectorWriter.commit();
});
// 6. After finishing writing all rows, call finish()
vectorWriter.finish();
/****************** Vector Reader **********************/
// 1. Decode the vector for rows of interest.
DecodedVector decoded;
decoded.decode(*result, rows);
// 2. Define vectorReader<T> where T is the type of the vector being read, T
// is expressed in the simple function type system
exec::VectorReader<Array<Map<int64_t, int64_t>>> reader(&decoded);
std::cout << "Reading Vector: " << std::endl;
rows.applyToSelected([&](vector_size_t row) {
// Check if the row is null.
if (reader.isSet(row) == false) {
std::cout << "[]" << std::endl;
return;
}
std::cout << "[";
// 3. To read a row call reader[row] and it will return a std::like object
// that represents the elements at the row.
// arrayView has std::vector<std::optional<V>> interface
auto arrayView = reader[row];
// Elements of the array have std::map<int, std::optional<int>>
// interface.
for (const auto& container : arrayView) {
if (container.has_value()) {
std::cout << " {";
for (const auto& [k, v] : container.value()) {
std::cout << "(" << k << ", "
<< (v.has_value() ? std::to_string(v.value()) : "") << ")";
}
std::cout << "} ";
} else {
std::cout << " null ";
}
}
std::cout << "]" << std::endl;
});
// Null-free reading when knowing the container doesn't have null value
assert(!decoded.mayHaveNullsRecursive());
std::cout << "Reading null-free Vector: " << std::endl;
rows.applyToSelected([&](vector_size_t row) {
std::cout << "[";
// Read the row null-free. arrayView has std::vector<V>
auto arrayView = reader.readNullFree(row);
// Elements of the array have std::map<int, int> interface.
for (const auto& container : arrayView) {
std::cout << " {";
for (const auto& [k, v] : container) {
std::cout << "(" << k << ", " << v << ")";
}
std::cout << "} ";
}
std::cout << "]" << std::endl;
});
return 0;
}