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
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
|
#include "mkql_map_join.h"
#include <yql/essentials/minikql/computation/mkql_block_builder.h>
#include <yql/essentials/minikql/computation/mkql_block_impl.h>
#include <yql/essentials/minikql/computation/mkql_block_reader.h>
#include <yql/essentials/minikql/computation/mkql_computation_node_holders_codegen.h>
#include <yql/essentials/minikql/invoke_builtins/mkql_builtins.h>
#include <yql/essentials/minikql/mkql_node_cast.h>
#include <yql/essentials/minikql/mkql_program_builder.h>
#include <util/generic/serialized_enum.h>
namespace NKikimr {
namespace NMiniKQL {
namespace {
size_t CalcMaxBlockLength(const TVector<TType*>& items) {
return CalcBlockLen(std::accumulate(items.cbegin(), items.cend(), 0ULL,
[](size_t max, const TType* type) {
const TType* itemType = AS_TYPE(TBlockType, type)->GetItemType();
return std::max(max, CalcMaxBlockItemSize(itemType));
}));
}
template <bool RightRequired>
class TBlockJoinState : public TBlockState {
public:
TBlockJoinState(TMemoryUsageInfo* memInfo, TComputationContext& ctx,
const TVector<TType*>& inputItems,
const TVector<ui32>& leftIOMap,
const TVector<TType*> outputItems)
: TBlockState(memInfo, outputItems.size())
, InputWidth_(inputItems.size() - 1)
, OutputWidth_(outputItems.size() - 1)
, Inputs_(inputItems.size())
, LeftIOMap_(leftIOMap)
, InputsDescr_(ToValueDescr(inputItems))
{
const auto& pgBuilder = ctx.Builder->GetPgBuilder();
MaxLength_ = CalcMaxBlockLength(outputItems);
for (size_t i = 0; i < inputItems.size(); i++) {
const TType* blockItemType = AS_TYPE(TBlockType, inputItems[i])->GetItemType();
Readers_.push_back(MakeBlockReader(TTypeInfoHelper(), blockItemType));
Converters_.push_back(MakeBlockItemConverter(TTypeInfoHelper(), blockItemType, pgBuilder));
}
// The last output column (i.e. block length) doesn't require a block builder.
for (size_t i = 0; i < OutputWidth_; i++) {
const TType* blockItemType = AS_TYPE(TBlockType, outputItems[i])->GetItemType();
Builders_.push_back(MakeArrayBuilder(TTypeInfoHelper(), blockItemType, ctx.ArrowMemoryPool, MaxLength_, &pgBuilder, &BuilderAllocatedSize_));
}
MaxBuilderAllocatedSize_ = MaxAllocatedFactor_ * BuilderAllocatedSize_;
}
void CopyRow() {
// Copy items from the "left" stream.
// Use the mapping from input fields to output ones to
// produce a tight loop to copy row items.
for (size_t i = 0; i < LeftIOMap_.size(); i++) {
AddItem(GetItem(LeftIOMap_[i]), i);
}
OutputRows_++;
}
void MakeRow(const NUdf::TUnboxedValuePod& value) {
size_t builderIndex = 0;
// Copy items from the "left" stream.
// Use the mapping from input fields to output ones to
// produce a tight loop to copy row items.
for (size_t i = 0; i < LeftIOMap_.size(); i++, builderIndex++) {
AddItem(GetItem(LeftIOMap_[i]), i);
}
// Convert and append items from the "right" dict.
// Since the keys are copied to the output only from the
// "left" stream, process all values unconditionally.
if constexpr (RightRequired) {
for (size_t i = 0; builderIndex < OutputWidth_; i++) {
AddValue(value.GetElement(i), builderIndex++);
}
} else {
if (value) {
for (size_t i = 0; builderIndex < OutputWidth_; i++) {
AddValue(value.GetElement(i), builderIndex++);
}
} else {
while (builderIndex < OutputWidth_) {
AddValue(value, builderIndex++);
}
}
}
OutputRows_++;
}
void MakeBlocks(const THolderFactory& holderFactory) {
Values.back() = holderFactory.CreateArrowBlock(arrow::Datum(std::make_shared<arrow::UInt64Scalar>(OutputRows_)));
OutputRows_ = 0;
BuilderAllocatedSize_ = 0;
for (size_t i = 0; i < Builders_.size(); i++) {
Values[i] = holderFactory.CreateArrowBlock(Builders_[i]->Build(IsFinished_));
}
FillArrays();
}
TBlockItem GetItem(size_t idx) const {
const auto& datum = TArrowBlock::From(Inputs_[idx]).GetDatum();
ARROW_DEBUG_CHECK_DATUM_TYPES(InputsDescr_[idx], datum.descr());
if (datum.is_scalar()) {
return Readers_[idx]->GetScalarItem(*datum.scalar());
}
MKQL_ENSURE(datum.is_array(), "Expecting array");
return Readers_[idx]->GetItem(*datum.array(), Current_);
}
NUdf::TUnboxedValuePod GetValue(const THolderFactory& holderFactory, size_t idx) const {
return Converters_[idx]->MakeValue(GetItem(idx), holderFactory);
}
void Reset() {
Next_ = 0;
InputRows_ = GetBlockCount(Inputs_.back());
}
void Finish() {
IsFinished_ = true;
}
bool NextRow() {
if (Next_ >= InputRows_) {
return false;
}
Current_ = Next_++;
return true;
}
bool HasBlocks() {
return Count > 0;
}
bool IsNotFull() const {
return OutputRows_ < MaxLength_
&& BuilderAllocatedSize_ <= MaxBuilderAllocatedSize_;
}
bool IsEmpty() const {
return OutputRows_ == 0;
}
bool IsFinished() const {
return IsFinished_;
}
NUdf::TUnboxedValue* GetRawInputFields() {
return Inputs_.data();
}
size_t GetInputWidth() const {
// Mind the last block length column.
return InputWidth_ + 1;
}
size_t GetOutputWidth() const {
// Mind the last block length column.
return OutputWidth_ + 1;
}
private:
void AddItem(const TBlockItem& item, size_t idx) {
Builders_[idx]->Add(item);
}
void AddValue(const NUdf::TUnboxedValuePod& value, size_t idx) {
Builders_[idx]->Add(value);
}
size_t Current_ = 0;
size_t Next_ = 0;
bool IsFinished_ = false;
size_t MaxLength_;
size_t BuilderAllocatedSize_ = 0;
size_t MaxBuilderAllocatedSize_ = 0;
static const size_t MaxAllocatedFactor_ = 4;
size_t InputRows_ = 0;
size_t OutputRows_ = 0;
size_t InputWidth_;
size_t OutputWidth_;
TUnboxedValueVector Inputs_;
const TVector<ui32> LeftIOMap_;
const std::vector<arrow::ValueDescr> InputsDescr_;
TVector<std::unique_ptr<IBlockReader>> Readers_;
TVector<std::unique_ptr<IBlockItemConverter>> Converters_;
TVector<std::unique_ptr<IArrayBuilder>> Builders_;
};
template <bool WithoutRight, bool RightRequired, bool IsTuple>
class TBlockWideMapJoinWrapper : public TMutableComputationNode<TBlockWideMapJoinWrapper<WithoutRight, RightRequired, IsTuple>>
{
using TBaseComputation = TMutableComputationNode<TBlockWideMapJoinWrapper<WithoutRight, RightRequired, IsTuple>>;
using TState = TBlockJoinState<RightRequired>;
public:
TBlockWideMapJoinWrapper(TComputationMutables& mutables,
const TVector<TType*>&& resultJoinItems, const TVector<TType*>&& leftStreamItems,
const TVector<ui32>&& leftKeyColumns, const TVector<ui32>&& leftIOMap,
IComputationNode* stream, IComputationNode* dict)
: TBaseComputation(mutables, EValueRepresentation::Boxed)
, ResultJoinItems_(std::move(resultJoinItems))
, LeftStreamItems_(std::move(leftStreamItems))
, LeftKeyColumns_(std::move(leftKeyColumns))
, LeftIOMap_(std::move(leftIOMap))
, Stream_(stream)
, Dict_(dict)
, KeyTupleCache_(mutables)
{}
NUdf::TUnboxedValuePod DoCalculate(TComputationContext& ctx) const {
NUdf::TUnboxedValue* items = nullptr;
const auto keys = KeyTupleCache_.NewArray(ctx, LeftKeyColumns_.size(), items);
const auto state = ctx.HolderFactory.Create<TState>(ctx, LeftStreamItems_,
LeftIOMap_, ResultJoinItems_);
return ctx.HolderFactory.Create<TStreamValue>(ctx.HolderFactory,
std::move(state),
std::move(Stream_->GetValue(ctx)),
std::move(Dict_->GetValue(ctx)),
LeftKeyColumns_,
std::move(keys), items);
}
private:
class TStreamValue : public TComputationValue<TStreamValue> {
using TBase = TComputationValue<TStreamValue>;
public:
TStreamValue(TMemoryUsageInfo* memInfo, const THolderFactory& holderFactory,
NUdf::TUnboxedValue&& blockState, NUdf::TUnboxedValue&& stream,
NUdf::TUnboxedValue&& dict, const TVector<ui32>& leftKeyColumns,
NUdf::TUnboxedValue&& keyValue, NUdf::TUnboxedValue* keyItems)
: TBase(memInfo)
, BlockState_(blockState)
, Stream_(stream)
, Dict_(dict)
, KeyValue_(keyValue)
, KeyItems_(keyItems)
, LeftKeyColumns_(leftKeyColumns)
, HolderFactory_(holderFactory)
{}
private:
NUdf::EFetchStatus WideFetch(NUdf::TUnboxedValue* output, ui32 width) {
auto& blockState = *static_cast<TState*>(BlockState_.AsBoxed().Get());
auto* inputFields = blockState.GetRawInputFields();
const size_t inputWidth = blockState.GetInputWidth();
const size_t outputWidth = blockState.GetOutputWidth();
MKQL_ENSURE(width == outputWidth,
"The given width doesn't equal to the result type size");
while (!blockState.HasBlocks()) {
while (blockState.IsNotFull() && blockState.NextRow()) {
const auto key = MakeKeysTuple(blockState);
if constexpr (WithoutRight) {
if ((key && Dict_.Contains(key)) == RightRequired) {
blockState.CopyRow();
}
} else if (NUdf::TUnboxedValue lookup; key && (lookup = Dict_.Lookup(key))) {
blockState.MakeRow(lookup);
} else if constexpr (!RightRequired) {
blockState.MakeRow(NUdf::TUnboxedValue());
}
}
if (blockState.IsNotFull() && !blockState.IsFinished()) {
switch (Stream_.WideFetch(inputFields, inputWidth)) {
case NUdf::EFetchStatus::Yield:
return NUdf::EFetchStatus::Yield;
case NUdf::EFetchStatus::Ok:
blockState.Reset();
continue;
case NUdf::EFetchStatus::Finish:
blockState.Finish();
break;
}
// Leave the loop, if no values left in the stream.
Y_DEBUG_ABORT_UNLESS(blockState.IsFinished());
}
if (blockState.IsEmpty()) {
return NUdf::EFetchStatus::Finish;
}
blockState.MakeBlocks(HolderFactory_);
}
const auto sliceSize = blockState.Slice();
for (size_t i = 0; i < outputWidth; i++) {
output[i] = blockState.Get(sliceSize, HolderFactory_, i);
}
return NUdf::EFetchStatus::Ok;
}
NUdf::TUnboxedValue MakeKeysTuple(const TState& blockState) const {
// TODO: Handle converters.
if constexpr (!IsTuple) {
return blockState.GetValue(HolderFactory_, LeftKeyColumns_.front());
}
Y_ABORT_IF(KeyItems_ == nullptr);
for (size_t i = 0; i < LeftKeyColumns_.size(); i++) {
KeyItems_[i] = blockState.GetValue(HolderFactory_, LeftKeyColumns_[i]);
}
return KeyValue_;
}
NUdf::TUnboxedValue BlockState_;
NUdf::TUnboxedValue Stream_;
NUdf::TUnboxedValue Dict_;
NUdf::TUnboxedValue KeyValue_;
NUdf::TUnboxedValue* KeyItems_;
const TVector<ui32>& LeftKeyColumns_;
const THolderFactory& HolderFactory_;
};
void RegisterDependencies() const final {
this->DependsOn(Stream_);
this->DependsOn(Dict_);
}
const TVector<TType*> ResultJoinItems_;
const TVector<TType*> LeftStreamItems_;
const TVector<ui32> LeftKeyColumns_;
const TVector<ui32> LeftIOMap_;
IComputationNode* const Stream_;
IComputationNode* const Dict_;
const TContainerCacheOnContext KeyTupleCache_;
};
template<bool RightRequired, bool IsTuple>
class TBlockWideMultiMapJoinWrapper : public TMutableComputationNode<TBlockWideMultiMapJoinWrapper<RightRequired, IsTuple>>
{
using TBaseComputation = TMutableComputationNode<TBlockWideMultiMapJoinWrapper<RightRequired, IsTuple>>;
using TState = TBlockJoinState<RightRequired>;
public:
TBlockWideMultiMapJoinWrapper(TComputationMutables& mutables,
const TVector<TType*>&& resultJoinItems, const TVector<TType*>&& leftStreamItems,
const TVector<ui32>&& leftKeyColumns, const TVector<ui32>&& leftIOMap,
IComputationNode* stream, IComputationNode* dict)
: TBaseComputation(mutables, EValueRepresentation::Boxed)
, ResultJoinItems_(std::move(resultJoinItems))
, LeftStreamItems_(std::move(leftStreamItems))
, LeftKeyColumns_(std::move(leftKeyColumns))
, LeftIOMap_(std::move(leftIOMap))
, Stream_(stream)
, Dict_(dict)
, KeyTupleCache_(mutables)
{}
NUdf::TUnboxedValuePod DoCalculate(TComputationContext& ctx) const {
NUdf::TUnboxedValue* items = nullptr;
const auto keys = KeyTupleCache_.NewArray(ctx, LeftKeyColumns_.size(), items);
const auto state = ctx.HolderFactory.Create<TState>(ctx, LeftStreamItems_,
LeftIOMap_, ResultJoinItems_);
return ctx.HolderFactory.Create<TStreamValue>(ctx.HolderFactory,
std::move(state),
std::move(Stream_->GetValue(ctx)),
std::move(Dict_->GetValue(ctx)),
LeftKeyColumns_,
std::move(keys), items);
}
private:
class TStreamValue : public TComputationValue<TStreamValue> {
using TBase = TComputationValue<TStreamValue>;
public:
TStreamValue(TMemoryUsageInfo* memInfo, const THolderFactory& holderFactory,
NUdf::TUnboxedValue&& blockState, NUdf::TUnboxedValue&& stream,
NUdf::TUnboxedValue&& dict, const TVector<ui32>& leftKeyColumns,
NUdf::TUnboxedValue&& keyValue, NUdf::TUnboxedValue* keyItems)
: TBase(memInfo)
, BlockState_(blockState)
, Stream_(stream)
, Dict_(dict)
, KeyValue_(keyValue)
, KeyItems_(keyItems)
, List_(NUdf::TUnboxedValue::Invalid())
, Iterator_(NUdf::TUnboxedValue::Invalid())
, Current_(NUdf::TUnboxedValue::Invalid())
, LeftKeyColumns_(leftKeyColumns)
, HolderFactory_(holderFactory)
{}
private:
NUdf::EFetchStatus WideFetch(NUdf::TUnboxedValue* output, ui32 width) {
auto& blockState = *static_cast<TState*>(BlockState_.AsBoxed().Get());
auto* inputFields = blockState.GetRawInputFields();
const size_t inputWidth = blockState.GetInputWidth();
const size_t outputWidth = blockState.GetOutputWidth();
MKQL_ENSURE(width == outputWidth,
"The given width doesn't equal to the result type size");
while (!blockState.HasBlocks()) {
if (!Iterator_.IsInvalid()) {
// Process the remaining items from the iterator.
while (blockState.IsNotFull() && Iterator_.Next(Current_)) {
blockState.MakeRow(Current_);
}
}
if (blockState.IsNotFull() && blockState.NextRow()) {
const auto key = MakeKeysTuple(blockState);
// Lookup the item in the right dict. If the lookup succeeds,
// reset the iterator and proceed the execution from the
// beginning of the outer loop. Otherwise, the iterator is
// already invalidated (i.e. finished), so the execution will
// process the next tuple from the left stream.
if (key && (List_ = Dict_.Lookup(key))) {
Iterator_ = List_.GetListIterator();
} else if constexpr (!RightRequired) {
blockState.MakeRow(NUdf::TUnboxedValue());
}
continue;
}
if (blockState.IsNotFull() && !blockState.IsFinished()) {
switch (Stream_.WideFetch(inputFields, inputWidth)) {
case NUdf::EFetchStatus::Yield:
return NUdf::EFetchStatus::Yield;
case NUdf::EFetchStatus::Ok:
blockState.Reset();
continue;
case NUdf::EFetchStatus::Finish:
blockState.Finish();
break;
}
// Leave the loop, if no values left in the stream.
Y_DEBUG_ABORT_UNLESS(blockState.IsFinished());
}
if (blockState.IsEmpty()) {
return NUdf::EFetchStatus::Finish;
}
blockState.MakeBlocks(HolderFactory_);
}
const auto sliceSize = blockState.Slice();
for (size_t i = 0; i < outputWidth; i++) {
output[i] = blockState.Get(sliceSize, HolderFactory_, i);
}
return NUdf::EFetchStatus::Ok;
}
NUdf::TUnboxedValue MakeKeysTuple(const TState& state) const {
// TODO: Handle converters.
if constexpr (!IsTuple) {
return state.GetValue(HolderFactory_, LeftKeyColumns_.front());
}
Y_ABORT_IF(KeyItems_ == nullptr);
for (size_t i = 0; i < LeftKeyColumns_.size(); i++) {
KeyItems_[i] = state.GetValue(HolderFactory_, LeftKeyColumns_[i]);
}
return KeyValue_;
}
NUdf::TUnboxedValue BlockState_;
NUdf::TUnboxedValue Stream_;
NUdf::TUnboxedValue Dict_;
NUdf::TUnboxedValue KeyValue_;
NUdf::TUnboxedValue* KeyItems_;
NUdf::TUnboxedValue List_;
NUdf::TUnboxedValue Iterator_;
NUdf::TUnboxedValue Current_;
const TVector<ui32>& LeftKeyColumns_;
const THolderFactory& HolderFactory_;
};
void RegisterDependencies() const final {
this->DependsOn(Stream_);
this->DependsOn(Dict_);
}
const TVector<TType*> ResultJoinItems_;
const TVector<TType*> LeftStreamItems_;
const TVector<ui32> LeftKeyColumns_;
const TVector<ui32> LeftIOMap_;
IComputationNode* const Stream_;
IComputationNode* const Dict_;
const TContainerCacheOnContext KeyTupleCache_;
};
} // namespace
IComputationNode* WrapBlockMapJoinCore(TCallable& callable, const TComputationNodeFactoryContext& ctx) {
MKQL_ENSURE(callable.GetInputsCount() == 5, "Expected 5 args");
const auto joinType = callable.GetType()->GetReturnType();
MKQL_ENSURE(joinType->IsStream(), "Expected WideStream as a resulting stream");
const auto joinStreamType = AS_TYPE(TStreamType, joinType);
MKQL_ENSURE(joinStreamType->GetItemType()->IsMulti(),
"Expected Multi as a resulting item type");
const auto joinComponents = GetWideComponents(joinStreamType);
MKQL_ENSURE(joinComponents.size() > 0, "Expected at least one column");
const TVector<TType*> joinItems(joinComponents.cbegin(), joinComponents.cend());
const auto leftType = callable.GetInput(0).GetStaticType();
MKQL_ENSURE(leftType->IsStream(), "Expected WideStream as a left stream");
const auto leftStreamType = AS_TYPE(TStreamType, leftType);
MKQL_ENSURE(leftStreamType->GetItemType()->IsMulti(),
"Expected Multi as a left stream item type");
const auto leftStreamComponents = GetWideComponents(leftStreamType);
MKQL_ENSURE(leftStreamComponents.size() > 0, "Expected at least one column");
const TVector<TType*> leftStreamItems(leftStreamComponents.cbegin(), leftStreamComponents.cend());
const auto rightDictNode = callable.GetInput(1);
MKQL_ENSURE(rightDictNode.GetStaticType()->IsDict(),
"Expected Dict as a right join part");
const auto rightDictType = AS_TYPE(TDictType, rightDictNode)->GetPayloadType();
const auto isMulti = rightDictType->IsList();
const auto rightDictItemType = isMulti
? AS_TYPE(TListType, rightDictType)->GetItemType()
: rightDictType;
MKQL_ENSURE(rightDictItemType->IsVoid() || rightDictItemType->IsTuple(),
"Expected Void or Tuple as a right dict item type");
const auto joinKindNode = callable.GetInput(2);
const auto rawKind = AS_VALUE(TDataLiteral, joinKindNode)->AsValue().Get<ui32>();
const auto joinKind = GetJoinKind(rawKind);
Y_ENSURE(joinKind == EJoinKind::Inner || joinKind == EJoinKind::Left ||
joinKind == EJoinKind::LeftSemi || joinKind == EJoinKind::LeftOnly);
const auto keyColumnsLiteral = callable.GetInput(3);
const auto keyColumnsTuple = AS_VALUE(TTupleLiteral, keyColumnsLiteral);
TVector<ui32> leftKeyColumns;
leftKeyColumns.reserve(keyColumnsTuple->GetValuesCount());
for (ui32 i = 0; i < keyColumnsTuple->GetValuesCount(); i++) {
const auto item = AS_VALUE(TDataLiteral, keyColumnsTuple->GetValue(i));
leftKeyColumns.emplace_back(item->AsValue().Get<ui32>());
}
const bool isTupleKey = leftKeyColumns.size() > 1;
const auto keyDropsLiteral = callable.GetInput(4);
const auto keyDropsTuple = AS_VALUE(TTupleLiteral, keyDropsLiteral);
THashSet<ui32> leftKeyDrops;
leftKeyDrops.reserve(keyDropsTuple->GetValuesCount());
for (ui32 i = 0; i < keyDropsTuple->GetValuesCount(); i++) {
const auto item = AS_VALUE(TDataLiteral, keyDropsTuple->GetValue(i));
leftKeyDrops.emplace(item->AsValue().Get<ui32>());
}
const THashSet<ui32> leftKeySet(leftKeyColumns.cbegin(), leftKeyColumns.cend());
for (const auto& drop : leftKeyDrops) {
MKQL_ENSURE(leftKeySet.contains(drop),
"Only key columns has to be specified in drop column set");
}
TVector<ui32> leftIOMap;
// XXX: Mind the last wide item, containing block length.
for (size_t i = 0; i < leftStreamItems.size() - 1; i++) {
if (leftKeyDrops.contains(i)) {
continue;
}
leftIOMap.push_back(i);
}
const auto stream = LocateNode(ctx.NodeLocator, callable, 0);
const auto dict = LocateNode(ctx.NodeLocator, callable, 1);
#define DISPATCH_JOIN(IS_TUPLE) do { \
switch (joinKind) { \
case EJoinKind::Inner: \
if (isMulti) { \
return new TBlockWideMultiMapJoinWrapper<true, IS_TUPLE>(ctx.Mutables, \
std::move(joinItems), std::move(leftStreamItems), \
std::move(leftKeyColumns), std::move(leftIOMap), stream, dict); \
} \
return new TBlockWideMapJoinWrapper<false, true, IS_TUPLE>(ctx.Mutables, \
std::move(joinItems), std::move(leftStreamItems), \
std::move(leftKeyColumns), std::move(leftIOMap), stream, dict); \
case EJoinKind::Left: \
if (isMulti) { \
return new TBlockWideMultiMapJoinWrapper<false, IS_TUPLE>(ctx.Mutables, \
std::move(joinItems), std::move(leftStreamItems), \
std::move(leftKeyColumns), std::move(leftIOMap), stream, dict); \
} \
return new TBlockWideMapJoinWrapper<false, false, IS_TUPLE>(ctx.Mutables, \
std::move(joinItems), std::move(leftStreamItems), \
std::move(leftKeyColumns), std::move(leftIOMap), stream, dict); \
case EJoinKind::LeftSemi: \
return new TBlockWideMapJoinWrapper<true, true, IS_TUPLE>(ctx.Mutables, \
std::move(joinItems), std::move(leftStreamItems), \
std::move(leftKeyColumns), std::move(leftIOMap), stream, dict); \
case EJoinKind::LeftOnly: \
return new TBlockWideMapJoinWrapper<true, false, IS_TUPLE>(ctx.Mutables, \
std::move(joinItems), std::move(leftStreamItems), \
std::move(leftKeyColumns), std::move(leftIOMap), stream, dict); \
default: \
/* TODO: Display the human-readable join kind name. */ \
MKQL_ENSURE(false, "BlockMapJoinCore doesn't support join type #" \
<< static_cast<ui32>(joinKind)); \
} \
} while(0)
if (isTupleKey) {
DISPATCH_JOIN(true);
} else {
DISPATCH_JOIN(false);
}
#undef DISPATCH_JOIN
}
} // namespace NMiniKQL
} // namespace NKikimr
|