-
-
Notifications
You must be signed in to change notification settings - Fork 344
Expand file tree
/
Copy pathwindow_function_tests.cpp
More file actions
249 lines (219 loc) · 10.1 KB
/
Copy pathwindow_function_tests.cpp
File metadata and controls
249 lines (219 loc) · 10.1 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
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
#include <sqlite_orm/sqlite_orm.h>
#include <catch2/catch_all.hpp>
using namespace sqlite_orm;
TEST_CASE("window functions") {
struct DenseRankDemo {
int id = 0;
std::string val;
};
struct T1 {
int a = 0;
std::string b;
std::string c;
};
struct T2 {
std::string a;
std::string b;
};
auto storage = make_storage(
"",
make_table("DenseRankDemo",
make_column("id", &DenseRankDemo::id, primary_key().autoincrement()),
make_column("Val", &DenseRankDemo::val)),
make_table("t1", make_column("a", &T1::a, primary_key()), make_column("b", &T1::b), make_column("c", &T1::c)),
make_table("t2", make_column("a", &T2::a), make_column("b", &T2::b)));
storage.sync_schema();
SECTION("DENSE_RANK - Issue #1478") {
// SQL: INSERT INTO DenseRankDemo(Val) VALUES('A'),('B'),('C'),('C'),('D'),('D'),('E');
storage.insert(DenseRankDemo{0, "A"});
storage.insert(DenseRankDemo{0, "B"});
storage.insert(DenseRankDemo{0, "C"});
storage.insert(DenseRankDemo{0, "C"});
storage.insert(DenseRankDemo{0, "D"});
storage.insert(DenseRankDemo{0, "D"});
storage.insert(DenseRankDemo{0, "E"});
// SQL: SELECT Val, DENSE_RANK() OVER (ORDER BY Val) ValRank FROM DenseRankDemo
auto rows = storage.select(columns(&DenseRankDemo::val, dense_rank().over(order_by(&DenseRankDemo::val))));
REQUIRE(rows.size() == 7);
// A=1, B=2, C=3, C=3, D=4, D=4, E=5
REQUIRE(std::get<1>(rows[0]) == 1);
REQUIRE(std::get<1>(rows[1]) == 2);
REQUIRE(std::get<1>(rows[2]) == 3);
REQUIRE(std::get<1>(rows[3]) == 3);
REQUIRE(std::get<1>(rows[4]) == 4);
REQUIRE(std::get<1>(rows[5]) == 4);
REQUIRE(std::get<1>(rows[6]) == 5);
}
SECTION("ROW_NUMBER with PARTITION BY") {
storage.replace(T2{"a", "one"});
storage.replace(T2{"a", "two"});
storage.replace(T2{"a", "three"});
storage.replace(T2{"b", "four"});
storage.replace(T2{"c", "five"});
storage.replace(T2{"c", "six"});
// SQL: SELECT a, row_number() OVER (PARTITION BY a ORDER BY b) FROM t2
auto rows = storage.select(columns(&T2::a, row_number().over(partition_by(&T2::a), order_by(&T2::b))));
REQUIRE(rows.size() == 6);
// Each partition restarts numbering
int maxRowNum = 0;
std::string lastA;
for (auto& [a, rn]: rows) {
if (a != lastA) {
lastA = a;
maxRowNum = 0;
}
REQUIRE(rn > maxRowNum);
maxRowNum = rn;
}
}
SECTION("Ranking functions") {
storage.replace(T2{"a", "one"});
storage.replace(T2{"a", "two"});
storage.replace(T2{"a", "three"});
storage.replace(T2{"b", "four"});
storage.replace(T2{"c", "five"});
storage.replace(T2{"c", "six"});
// SQL: SELECT a, row_number() OVER win, rank() OVER win, dense_rank() OVER win,
// percent_rank() OVER win, cume_dist() OVER win
// FROM t2 WINDOW win AS (ORDER BY a)
auto rows = storage.select(columns(&T2::a,
row_number().over(order_by(&T2::a)),
rank().over(order_by(&T2::a)),
dense_rank().over(order_by(&T2::a)),
percent_rank().over(order_by(&T2::a)),
cume_dist().over(order_by(&T2::a))));
REQUIRE(rows.size() == 6);
// row 1: a='a', row_number=1, rank=1, dense_rank=1
REQUIRE(std::get<1>(rows[0]) == 1);
REQUIRE(std::get<2>(rows[0]) == 1);
REQUIRE(std::get<3>(rows[0]) == 1);
}
SECTION("LAG and LEAD") {
storage.replace(T1{1, "A", "one"});
storage.replace(T1{2, "B", "two"});
storage.replace(T1{3, "C", "three"});
storage.replace(T1{4, "D", "one"});
storage.replace(T1{5, "E", "two"});
// SQL: SELECT b, lag(b) OVER (ORDER BY a), lead(b) OVER (ORDER BY a) FROM t1
auto rows =
storage.select(columns(&T1::b, lag(&T1::b).over(order_by(&T1::a)), lead(&T1::b).over(order_by(&T1::a))));
REQUIRE(rows.size() == 5);
// First row: lag is NULL (empty string for std::string), lead is "B"
REQUIRE(std::get<1>(rows[0]) == "");
REQUIRE(std::get<2>(rows[0]) == "B");
// Last row: lag is "D", lead is NULL (empty string)
REQUIRE(std::get<1>(rows[4]) == "D");
REQUIRE(std::get<2>(rows[4]) == "");
}
SECTION("FIRST_VALUE, LAST_VALUE, NTH_VALUE") {
storage.replace(T1{1, "A", "one"});
storage.replace(T1{2, "B", "two"});
storage.replace(T1{3, "C", "three"});
storage.replace(T1{4, "D", "one"});
storage.replace(T1{5, "E", "two"});
// SQL: SELECT b, first_value(b) OVER win, last_value(b) OVER win, nth_value(b, 3) OVER win
// FROM t1 WINDOW win AS (ORDER BY b ROWS BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW)
auto frameSpec = rows(unbounded_preceding(), current_row());
auto result = storage.select(columns(&T1::b,
first_value(&T1::b).over(order_by(&T1::b), frameSpec),
last_value(&T1::b).over(order_by(&T1::b), frameSpec),
nth_value(&T1::b, 3).over(order_by(&T1::b), frameSpec)));
REQUIRE(result.size() == 5);
for (auto& row: result) {
REQUIRE(std::get<1>(row) == "A");
}
REQUIRE(std::get<2>(result[0]) == "A");
REQUIRE(std::get<2>(result[1]) == "B");
}
SECTION("Aggregate with OVER and frame") {
storage.replace(T1{1, "A", "one"});
storage.replace(T1{2, "B", "two"});
storage.replace(T1{3, "C", "three"});
storage.replace(T1{4, "D", "one"});
storage.replace(T1{5, "E", "two"});
// SQL: SELECT a, sum(a) OVER (ORDER BY a ROWS BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW) FROM t1
auto frameSpec = rows(unbounded_preceding(), current_row());
auto result = storage.select(columns(&T1::a, sum(&T1::a).over(order_by(&T1::a), frameSpec)));
REQUIRE(result.size() == 5);
REQUIRE(*std::get<1>(result[0]) == 1);
REQUIRE(*std::get<1>(result[1]) == 3);
REQUIRE(*std::get<1>(result[2]) == 6);
REQUIRE(*std::get<1>(result[3]) == 10);
REQUIRE(*std::get<1>(result[4]) == 15);
}
SECTION("FILTER + OVER") {
storage.replace(T1{1, "A", "one"});
storage.replace(T1{2, "B", "two"});
storage.replace(T1{3, "C", "three"});
storage.replace(T1{4, "D", "one"});
storage.replace(T1{5, "E", "two"});
// SQL: SELECT a, count(a) FILTER (WHERE c = 'one') OVER (ORDER BY a ROWS BETWEEN UNBOUNDED PRECEDING AND CURRENT ROW) FROM t1
auto frameSpec = rows(unbounded_preceding(), current_row());
auto result = storage.select(
columns(&T1::a,
count(&T1::a).filter(where(c(&T1::c) == std::string("one"))).over(order_by(&T1::a), frameSpec)));
REQUIRE(result.size() == 5);
REQUIRE(std::get<1>(result[0]) == 1);
REQUIRE(std::get<1>(result[1]) == 1);
REQUIRE(std::get<1>(result[2]) == 1);
REQUIRE(std::get<1>(result[3]) == 2);
REQUIRE(std::get<1>(result[4]) == 2);
}
SECTION("NTILE") {
storage.replace(T2{"a", "one"});
storage.replace(T2{"a", "two"});
storage.replace(T2{"a", "three"});
storage.replace(T2{"b", "four"});
storage.replace(T2{"c", "five"});
storage.replace(T2{"c", "six"});
// SQL: SELECT a, b, ntile(2) OVER (ORDER BY a) FROM t2
auto rows = storage.select(columns(&T2::a, &T2::b, ntile(2).over(order_by(&T2::a))));
REQUIRE(rows.size() == 6);
// ntile(2) divides 6 rows into 2 groups: first 3 get 1, last 3 get 2
REQUIRE(std::get<2>(rows[0]) == 1);
REQUIRE(std::get<2>(rows[1]) == 1);
REQUIRE(std::get<2>(rows[2]) == 1);
REQUIRE(std::get<2>(rows[3]) == 2);
REQUIRE(std::get<2>(rows[4]) == 2);
REQUIRE(std::get<2>(rows[5]) == 2);
}
}
TEST_CASE("window functions - issue #475 count over with where order by limit") {
struct UserProfile {
int id = 0;
std::string firstName;
std::string lastName;
};
auto storage = make_storage("",
make_table("user_profile",
make_column("id", &UserProfile::id, primary_key().autoincrement()),
make_column("first_name", &UserProfile::firstName),
make_column("last_name", &UserProfile::lastName)));
storage.sync_schema();
storage.insert(UserProfile{0, "Alice", "Smith"});
storage.insert(UserProfile{0, "Bob", "Jones"});
storage.insert(UserProfile{0, "Charlie", "Brown"});
storage.insert(UserProfile{0, "Diana", "Davis"});
storage.insert(UserProfile{0, "Eve", "Wilson"});
int refId = 0;
int resultPerPage = 3;
// SQL: SELECT id, first_name, last_name, COUNT(id) OVER ()
// FROM user_profile WHERE id > ? ORDER BY id LIMIT ?
auto rows = storage.select(
columns(&UserProfile::id, &UserProfile::firstName, &UserProfile::lastName, count(&UserProfile::id).over()),
where(c(&UserProfile::id) > refId),
order_by(&UserProfile::id),
limit(resultPerPage));
REQUIRE(rows.size() == 3);
// Every row should have total_count=5 (total rows in table)
REQUIRE(std::get<0>(rows[0]) == 1);
REQUIRE(std::get<1>(rows[0]) == "Alice");
REQUIRE(std::get<2>(rows[0]) == "Smith");
REQUIRE(std::get<3>(rows[0]) == 5);
REQUIRE(std::get<0>(rows[1]) == 2);
REQUIRE(std::get<1>(rows[1]) == "Bob");
REQUIRE(std::get<3>(rows[1]) == 5);
REQUIRE(std::get<0>(rows[2]) == 3);
REQUIRE(std::get<1>(rows[2]) == "Charlie");
REQUIRE(std::get<3>(rows[2]) == 5);
}