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
|
#include "mkql_match_recognize_rows_formatter.h"
#include <yql/essentials/minikql/mkql_node.h>
#include <yql/essentials/minikql/mkql_node_cast.h>
namespace NKikimr::NMiniKQL::NMatchRecognize {
namespace {
class TOneRowFormatter final : public IRowsFormatter {
public:
explicit TOneRowFormatter(const TState& state) : IRowsFormatter(state) {}
NUdf::TUnboxedValue GetFirstMatchRow(
TComputationContext& ctx,
const TSparseList& rows,
const NUdf::TUnboxedValue& partitionKey,
const TNfaTransitionGraph& graph,
const TNfa::TMatch& match) override {
Match_ = match;
const auto result = DoGetMatchRow(ctx, rows, partitionKey, graph);
IRowsFormatter::Clear();
return result;
}
NUdf::TUnboxedValue GetOtherMatchRow(
TComputationContext& /* ctx */,
const TSparseList& /* rows */,
const NUdf::TUnboxedValue& /* partitionKey */,
const TNfaTransitionGraph& /* graph */) override {
return NUdf::TUnboxedValue{};
}
void Load(TMrInputSerializer& serializer) override {
Match_.Load(serializer);
serializer(CurrentRowIndex_);
}
void Save(TMrOutputSerializer& serializer) const override {
Match_.Save(serializer);
serializer(CurrentRowIndex_);
}
};
class TAllRowsFormatter final : public IRowsFormatter {
public:
explicit TAllRowsFormatter(const IRowsFormatter::TState& state) : IRowsFormatter(state) {}
NUdf::TUnboxedValue GetFirstMatchRow(
TComputationContext& ctx,
const TSparseList& rows,
const NUdf::TUnboxedValue& partitionKey,
const TNfaTransitionGraph& graph,
const TNfa::TMatch& match) override {
Match_ = match;
CurrentRowIndex_ = Match_.BeginIndex;
ToIndexToMatchRangeLookup_ = BuildToIndexToMatchRangeLookup(Match_.Vars);
return GetMatchRow(ctx, rows, partitionKey, graph);
}
NUdf::TUnboxedValue GetOtherMatchRow(
TComputationContext& ctx,
const TSparseList& rows,
const NUdf::TUnboxedValue& partitionKey,
const TNfaTransitionGraph& graph) override {
if (Max<size_t>() == CurrentRowIndex_) {
return NUdf::TUnboxedValue{};
}
return GetMatchRow(ctx, rows, partitionKey, graph);
}
void Load(TMrInputSerializer& serializer) override {
Match_.Load(serializer);
serializer(CurrentRowIndex_);
ToIndexToMatchRangeLookup_ = BuildToIndexToMatchRangeLookup(Match_.Vars);
}
void Save(TMrOutputSerializer& serializer) const override {
Match_.Save(serializer);
serializer(CurrentRowIndex_);
}
private:
static TMap<size_t, TSparseList::TRange> BuildToIndexToMatchRangeLookup(const TMatchedVars<TSparseList::TRange>& vars) {
TMap<size_t, TSparseList::TRange> result;
for (const auto& matchedVar : vars) {
for (const auto& range : matchedVar) {
result.emplace(range.To(), range);
}
}
return result;
}
NUdf::TUnboxedValue GetMatchRow(TComputationContext& ctx, const TSparseList& rows, const NUdf::TUnboxedValue& partitionKey, const TNfaTransitionGraph& graph) {
while (CurrentRowIndex_ <= Match_.EndIndex) {
if (auto iter = ToIndexToMatchRangeLookup_.lower_bound(CurrentRowIndex_);
iter == ToIndexToMatchRangeLookup_.end()) {
MKQL_ENSURE(false, "Internal logic error");
} else if (CurrentRowIndex_ < iter->second.From()) {
++CurrentRowIndex_;
} else if (auto transition = std::get_if<TMatchedVarTransition>(&graph.Transitions.at(iter->second.NfaIndex()));
!transition) {
MKQL_ENSURE(false, "Internal logic error");
} else if (transition->ExcludeFromOutput) {
++CurrentRowIndex_;
} else {
break;
}
}
if (CurrentRowIndex_ > Match_.EndIndex) {
return NUdf::TUnboxedValue{};
}
const auto result = DoGetMatchRow(ctx, rows, partitionKey, graph);
if (CurrentRowIndex_ == Match_.EndIndex) {
Clear();
} else {
++CurrentRowIndex_;
}
return result;
}
void Clear() {
IRowsFormatter::Clear();
ToIndexToMatchRangeLookup_.clear();
}
TMap<size_t, TSparseList::TRange> ToIndexToMatchRangeLookup_;
};
} // anonymous namespace
IRowsFormatter::IRowsFormatter(const TState& state) : State_(state) {}
TOutputColumnOrder IRowsFormatter::GetOutputColumnOrder(
TRuntimeNode outputColumnOrder) {
TOutputColumnOrder result;
auto list = AS_VALUE(TListLiteral, outputColumnOrder);
TConstArrayRef<TRuntimeNode> items(list->GetItems(), list->GetItemsCount());
for (auto item : items) {
const auto entry = AS_VALUE(TStructLiteral, item);
result.emplace_back(
AS_VALUE(TDataLiteral, entry->GetValue(0))->AsValue().Get<ui32>(),
static_cast<EOutputColumnSource>(AS_VALUE(TDataLiteral, entry->GetValue(1))->AsValue().Get<i32>())
);
}
return result;
}
NUdf::TUnboxedValue IRowsFormatter::DoGetMatchRow(TComputationContext& ctx, const TSparseList& rows, const NUdf::TUnboxedValue& partitionKey, const TNfaTransitionGraph& /* graph */) {
NUdf::TUnboxedValue *itemsPtr = nullptr;
const auto result = State_.Cache->NewArray(ctx, State_.OutputColumnOrder.size(), itemsPtr);
for (const auto& columnEntry: State_.OutputColumnOrder) {
switch(columnEntry.SourceType) {
case EOutputColumnSource::PartitionKey:
*itemsPtr++ = partitionKey.GetElement(columnEntry.Index);
break;
case EOutputColumnSource::Measure:
*itemsPtr++ = State_.Measures[columnEntry.Index]->GetValue(ctx);
break;
case EOutputColumnSource::Other:
*itemsPtr++ = rows.Get(CurrentRowIndex_).GetElement(columnEntry.Index);
break;
}
}
return result;
}
std::unique_ptr<IRowsFormatter> IRowsFormatter::Create(const IRowsFormatter::TState& state) {
switch (state.RowsPerMatch) {
case ERowsPerMatch::OneRow:
return std::unique_ptr<IRowsFormatter>(new TOneRowFormatter(state));
case ERowsPerMatch::AllRows:
return std::unique_ptr<IRowsFormatter>(new TAllRowsFormatter(state));
}
}
} //namespace NKikimr::NMiniKQL::NMatchRecognize
|
