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
|
#include "mkql_computation_node_ut.h"
#include <yql/essentials/minikql/mkql_runtime_version.h>
namespace NKikimr {
namespace NMiniKQL {
Y_UNIT_TEST_SUITE(TMiniKQLWideNodesTest) {
// TDOD: fixme
#if 0
Y_UNIT_TEST_LLVM(TestWideDiscard) {
TSetup<LLVM> setup;
TProgramBuilder& pb = *setup.PgmBuilder;
const auto data0 = pb.NewDataLiteral<NUdf::EDataSlot::String>("000");
const auto data1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("100");
const auto data2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("200");
const auto data3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("300");
const auto dataType = pb.NewDataType(NUdf::TDataType<char*>::Id);
const auto list = pb.NewList(dataType, {data0, data1, data2, data3});
const auto pgmReturn = pb.FromFlow(pb.Discard(pb.ExpandMap(pb.ToFlow(list), [](TRuntimeNode) { return TRuntimeNode::TList(); })));
const auto graph = setup.BuildGraph(pgmReturn);
const auto iterator = graph->GetValue();
NUdf::TUnboxedValue item;
UNIT_ASSERT_VALUES_EQUAL(NUdf::EFetchStatus::Finish, iterator.Fetch(item));
UNIT_ASSERT_VALUES_EQUAL(NUdf::EFetchStatus::Finish, iterator.Fetch(item));
}
#endif
Y_UNIT_TEST_LLVM(TestDiscard) {
TSetup<LLVM> setup;
TProgramBuilder& pb = *setup.PgmBuilder;
const auto data0 = pb.NewDataLiteral<NUdf::EDataSlot::String>("000");
const auto data1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("100");
const auto data2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("200");
const auto data3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("300");
const auto dataType = pb.NewDataType(NUdf::TDataType<char*>::Id);
const auto list = pb.NewList(dataType, {data0, data1, data2, data3});
const auto pgmReturn = pb.FromFlow(pb.Discard(pb.ToFlow(list)));
const auto graph = setup.BuildGraph(pgmReturn);
const auto iterator = graph->GetValue();
NUdf::TUnboxedValue item;
UNIT_ASSERT_VALUES_EQUAL(NUdf::EFetchStatus::Finish, iterator.Fetch(item));
UNIT_ASSERT_VALUES_EQUAL(NUdf::EFetchStatus::Finish, iterator.Fetch(item));
}
Y_UNIT_TEST_LLVM(TestTakeOverSource) {
TSetup<LLVM> setup;
TProgramBuilder& pb = *setup.PgmBuilder;
const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.Take(pb.Source(), pb.NewDataLiteral<ui64>(666ULL)), [&](TRuntimeNode::TList) { return pb.NewTuple({}); }));
const auto graph = setup.BuildGraph(pgmReturn);
UNIT_ASSERT_VALUES_EQUAL(graph->GetValue().GetListLength(), 666ULL);
}
Y_UNIT_TEST_LLVM(TestSkipAndTake) {
TSetup<LLVM> setup;
TProgramBuilder& pb = *setup.PgmBuilder;
const auto list = pb.ListFromRange(pb.NewDataLiteral<ui32>(100U), pb.NewDataLiteral<ui32>(666U), pb.NewDataLiteral<ui32>(3U));
const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.Take(pb.Skip(pb.ExpandMap(pb.ToFlow(pb.Enumerate(list)),
[&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 1U), pb.Nth(item, 0U)}; }),
pb.NewDataLiteral<ui64>(42ULL)), pb.NewDataLiteral<ui64>(4ULL)),
[&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple({items.back(), items.front()}); }));
const auto graph = setup.BuildGraph(pgmReturn);
const auto iterator = graph->GetValue().GetListIterator();
NUdf::TUnboxedValue item;
UNIT_ASSERT(iterator.Next(item));
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(0).template Get<ui64>(), 42);
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(1).template Get<ui32>(), 226);
UNIT_ASSERT(iterator.Next(item));
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(0).template Get<ui64>(), 43);
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(1).template Get<ui32>(), 229);
UNIT_ASSERT(iterator.Next(item));
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(0).template Get<ui64>(), 44);
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(1).template Get<ui32>(), 232);
UNIT_ASSERT(iterator.Next(item));
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(0).template Get<ui64>(), 45);
UNIT_ASSERT_VALUES_EQUAL(item.GetElement(1).template Get<ui32>(), 235);
UNIT_ASSERT(!iterator.Next(item));
UNIT_ASSERT(!iterator.Next(item));
}
Y_UNIT_TEST_LLVM(TestSkipAndTakeSingular) {
TSetup<LLVM> setup;
TProgramBuilder& pb = *setup.PgmBuilder;
constexpr ui64 limit = 100;
constexpr ui64 offset = 100;
const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.Take(pb.Skip(pb.Source(),
pb.NewDataLiteral<ui64>(offset)), pb.NewDataLiteral<ui64>(limit)),
[&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); }));
const auto graph = setup.BuildGraph(pgmReturn);
const auto length = graph->GetValue().GetListLength();
UNIT_ASSERT_VALUES_EQUAL(limit, length);
}
Y_UNIT_TEST_LLVM(TestDoNotCalculateSkipped) {
TSetup<LLVM> setup;
TProgramBuilder& pb = *setup.PgmBuilder;
const auto list = pb.ListFromRange(pb.NewDataLiteral<ui64>(100ULL), pb.NewDataLiteral<ui64>(135ULL), pb.NewDataLiteral<ui64>(5ULL));
const auto trap = pb.NewDataLiteral<NUdf::EDataSlot::String>("IT'S A TRAP!");
const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.Skip(pb.WideMap(pb.ExpandMap(pb.ToFlow(pb.Enumerate(list)),
[&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 1U), pb.Nth(item, 0U)}; }),
[&](TRuntimeNode::TList items) -> TRuntimeNode::TList { return {pb.Unwrap(pb.Div(items.front(), items.back()), trap, __FILE__, __LINE__, 0)}; }),
pb.NewDataLiteral<ui64>(3ULL)),
[&](TRuntimeNode::TList items) -> TRuntimeNode { return items.front(); }));
const auto graph = setup.BuildGraph(pgmReturn);
const auto iterator = graph->GetValue().GetListIterator();
NUdf::TUnboxedValue item;
UNIT_ASSERT(iterator.Next(item));
UNIT_ASSERT_VALUES_EQUAL(item.template Get<ui64>(), 38ULL);
UNIT_ASSERT(iterator.Next(item));
UNIT_ASSERT_VALUES_EQUAL(item.template Get<ui64>(), 30ULL);
UNIT_ASSERT(iterator.Next(item));
UNIT_ASSERT_VALUES_EQUAL(item.template Get<ui64>(), 25ULL);
UNIT_ASSERT(iterator.Next(item));
UNIT_ASSERT_VALUES_EQUAL(item.template Get<ui64>(), 21ULL);
UNIT_ASSERT(!iterator.Next(item));
UNIT_ASSERT(!iterator.Next(item));
}
} // Y_UNIT_TEST_SUITE(TMiniKQLWideNodesTest)
} // namespace NMiniKQL
} // namespace NKikimr
|
