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
|
#include "mkql_computation_node_ut.h"
#include <yql/essentials/minikql/computation/mkql_computation_node_holders.h>
#include <yql/essentials/minikql/computation/mkql_block_builder.h>
#include <util/random/random.h>
namespace NKikimr {
namespace NMiniKQL {
namespace {
template<bool UseRandom, bool DoFilter, bool LLVM>
void DoNestedTuplesCompressTest() {
TSetup<LLVM> setup;
TProgramBuilder& pb = *setup.PgmBuilder;
const auto ui64Type = pb.NewDataType(NUdf::TDataType<ui64>::Id);
const auto boolType = pb.NewDataType(NUdf::TDataType<bool>::Id);
const auto utf8Type = pb.NewDataType(NUdf::EDataSlot::Utf8);
const auto innerTupleType = pb.NewTupleType({ui64Type, boolType, utf8Type});
const auto outerTupleType = pb.NewTupleType({ui64Type, innerTupleType, utf8Type});
const auto finalTupleType = pb.NewTupleType({ui64Type, outerTupleType, boolType});
const auto resultTupleType = pb.NewTupleType({ui64Type, outerTupleType});
TRuntimeNode::TList items;
static_assert(MaxBlockSizeInBytes % 4 == 0);
constexpr size_t fixedStrSize = MaxBlockSizeInBytes / 4;
if constexpr (UseRandom) {
SetRandomSeed(0);
}
for (size_t i = 0; i < 95; ++i) {
std::string str;
bool filterValue;
if constexpr (UseRandom) {
size_t len = RandomNumber<size_t>(2 * MaxBlockSizeInBytes);
str.reserve(len);
for (size_t i = 0; i < len; ++i) {
str.push_back((char)RandomNumber<ui8>(128));
}
if constexpr (DoFilter) {
filterValue = RandomNumber<ui8>() & 1;
} else {
filterValue = true;
}
} else {
str = std::string(fixedStrSize, ' ' + i);
if constexpr (DoFilter) {
filterValue = (i % 4) < 2;
} else {
filterValue = true;
}
}
const auto innerTuple = pb.NewTuple(innerTupleType, {
pb.NewDataLiteral<ui64>(i),
pb.NewDataLiteral<bool>(i % 2),
pb.NewDataLiteral<NUdf::EDataSlot::Utf8>((i % 2) ? str : std::string()),
});
const auto outerTuple = pb.NewTuple(outerTupleType, {
pb.NewDataLiteral<ui64>(i),
innerTuple,
pb.NewDataLiteral<NUdf::EDataSlot::Utf8>((i % 2) ? std::string() : str),
});
const auto finalTuple = pb.NewTuple(finalTupleType, {
pb.NewDataLiteral<ui64>(i),
outerTuple,
pb.NewDataLiteral(filterValue),
});
items.push_back(finalTuple);
}
const auto list = pb.NewList(finalTupleType, std::move(items));
auto node = pb.ToFlow(list);
node = pb.ExpandMap(node, [&](TRuntimeNode item) -> TRuntimeNode::TList {
return {pb.Nth(item, 0U), pb.Nth(item, 1U), pb.Nth(item, 2U)};
});
node = pb.WideToBlocks(node);
node = pb.BlockExpandChunked(node);
node = pb.WideSkipBlocks(node, pb.template NewDataLiteral<ui64>(19));
node = pb.BlockCompress(node, 2);
node = pb.WideFromBlocks(node);
node = pb.NarrowMap(node, [&](TRuntimeNode::TList items) -> TRuntimeNode {
return pb.NewTuple(resultTupleType, {items[0], items[1]});
});
const auto pgmReturn = pb.Collect(node);
const auto graph = setup.BuildGraph(pgmReturn);
const auto iterator = graph->GetValue().GetListIterator();
if constexpr (UseRandom) {
SetRandomSeed(0);
}
for (size_t i = 0; i < 95; ++i) {
std::string str;
bool filterValue;
if constexpr (UseRandom) {
size_t len = RandomNumber<size_t>(2 * MaxBlockSizeInBytes);
str.reserve(len);
for (size_t i = 0; i < len; ++i) {
str.push_back((char)RandomNumber<ui8>(128));
}
if constexpr (DoFilter) {
filterValue = RandomNumber<ui8>() & 1;
} else {
filterValue = true;
}
} else {
str = std::string(fixedStrSize, ' ' + i);
if constexpr (DoFilter) {
filterValue = (i % 4) < 2;
} else {
filterValue = true;
}
}
if (i < 19 || !filterValue) {
continue;
}
NUdf::TUnboxedValue item;
UNIT_ASSERT(iterator.Next(item));
ui64 topNum = item.GetElement(0).Get<ui64>();
const auto& outer = item.GetElement(1);
ui64 num = outer.GetElement(0).Get<ui64>();
const auto& inner = outer.GetElement(1);
auto outerStrVal = outer.GetElement(2);
std::string_view outerStr = outerStrVal.AsStringRef();
ui64 innerNum = inner.GetElement(0).Get<ui64>();
bool innerBool = inner.GetElement(1).Get<bool>();
auto innerStrVal = inner.GetElement(2);
std::string_view innerStr = innerStrVal.AsStringRef();
UNIT_ASSERT_VALUES_EQUAL(num, i);
UNIT_ASSERT_VALUES_EQUAL(topNum, i);
UNIT_ASSERT_VALUES_EQUAL(innerNum, i);
UNIT_ASSERT_VALUES_EQUAL(innerBool, i % 2);
std::string expectedInner = (i % 2) ? str : std::string();
std::string expectedOuter = (i % 2) ? std::string() : str;
UNIT_ASSERT(innerStr == expectedInner);
UNIT_ASSERT(outerStr == expectedOuter);
}
NUdf::TUnboxedValue item;
UNIT_ASSERT(!iterator.Next(item));
UNIT_ASSERT(!iterator.Next(item));
}
} //namespace
Y_UNIT_TEST_SUITE(TMiniKQLBlockCompressTest) {
Y_UNIT_TEST_LLVM(CompressBasic) {
TSetup<LLVM> setup;
TProgramBuilder& pb = *setup.PgmBuilder;
const auto ui64Type = pb.NewDataType(NUdf::TDataType<ui64>::Id);
const auto boolType = pb.NewDataType(NUdf::TDataType<bool>::Id);
const auto tupleType = pb.NewTupleType({boolType, ui64Type, boolType});
const auto data1 = pb.NewTuple(tupleType, {pb.NewDataLiteral(false), pb.NewDataLiteral<ui64>(1ULL), pb.NewDataLiteral(true)});
const auto data2 = pb.NewTuple(tupleType, {pb.NewDataLiteral(true), pb.NewDataLiteral<ui64>(2ULL), pb.NewDataLiteral(false)});
const auto data3 = pb.NewTuple(tupleType, {pb.NewDataLiteral(false), pb.NewDataLiteral<ui64>(3ULL), pb.NewDataLiteral(true)});
const auto data4 = pb.NewTuple(tupleType, {pb.NewDataLiteral(false), pb.NewDataLiteral<ui64>(4ULL), pb.NewDataLiteral(true)});
const auto data5 = pb.NewTuple(tupleType, {pb.NewDataLiteral(true), pb.NewDataLiteral<ui64>(5ULL), pb.NewDataLiteral(false)});
const auto data6 = pb.NewTuple(tupleType, {pb.NewDataLiteral(true), pb.NewDataLiteral<ui64>(6ULL), pb.NewDataLiteral(true)});
const auto data7 = pb.NewTuple(tupleType, {pb.NewDataLiteral(false), pb.NewDataLiteral<ui64>(7ULL), pb.NewDataLiteral(true)});
const auto list = pb.NewList(tupleType, {data1, data2, data3, data4, data5, data6, data7});
const auto flow = pb.ToFlow(list);
const auto wideFlow = pb.ExpandMap(flow, [&](TRuntimeNode item) -> TRuntimeNode::TList {
return {pb.Nth(item, 0U), pb.Nth(item, 1U), pb.Nth(item, 2U)};
});
const auto compressedFlow = pb.WideFromBlocks(pb.BlockCompress(pb.WideToBlocks(wideFlow), 0));
const auto narrowFlow = pb.NarrowMap(compressedFlow, [&](TRuntimeNode::TList items) -> TRuntimeNode {
return pb.NewTuple({items[0], items[1]});
});
const auto pgmReturn = pb.Collect(narrowFlow);
const auto graph = setup.BuildGraph(pgmReturn);
const auto res = graph->GetValue();
const auto iterator = res.GetListIterator();
NUdf::TUnboxedValue item;
UNIT_ASSERT(iterator.Next(item));
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(0).Get<ui64>(), 2);
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(1).Get<bool>(), false);
UNIT_ASSERT(iterator.Next(item));
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(0).Get<ui64>(), 5);
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(1).Get<bool>(), false);
UNIT_ASSERT(iterator.Next(item));
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(0).Get<ui64>(), 6);
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(1).Get<bool>(), true);
UNIT_ASSERT(!iterator.Next(item));
UNIT_ASSERT(!iterator.Next(item));
}
Y_UNIT_TEST_LLVM(CompressNestedTuples) {
DoNestedTuplesCompressTest<false, false, LLVM>();
}
Y_UNIT_TEST_LLVM(CompressNestedTuplesWithFilter) {
DoNestedTuplesCompressTest<false, true, LLVM>();
}
Y_UNIT_TEST_LLVM(CompressNestedTuplesWithRandom) {
DoNestedTuplesCompressTest<true, false, LLVM>();
}
Y_UNIT_TEST_LLVM(CompressNestedTuplesWithRandomWithFilter) {
DoNestedTuplesCompressTest<true, true, LLVM>();
}
}
} // namespace NMiniKQL
} // namespace NKikimr
|
