Repository navigation
Expand file tree
/
Copy pathdynamic_search.cpp
More file actions
372 lines (353 loc) · 14.9 KB
/
Copy pathdynamic_search.cpp
File metadata and controls
372 lines (353 loc) · 14.9 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
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
#include <teaql/core/dynamic_search.hpp>
#include <array>
#include <cmath>
#include <iostream>
namespace teaql::dynamic_search {
DynamicSearchWarning::DynamicSearchWarning(std::allocator_arg_t,
Allocator a,
std::string_view entity,
std::string_view clause,
std::string_view path)
: code("DYNAMIC_SEARCH_UNKNOWN_FIELD", a.resource()), entity(entity, a.resource()),
clause(clause, a.resource()), field_path(path, a.resource()) {}
DynamicSearchWarning::DynamicSearchWarning(std::allocator_arg_t,
Allocator a,
const DynamicSearchWarning& other)
: DynamicSearchWarning(std::allocator_arg, a, other.entity, other.clause, other.field_path) {
code = other.code;
}
Json DynamicSearchWarning::to_json(Memory r) const {
Json json(r);
Json::Object object(r);
object.emplace("code", Json(r, code));
object.emplace("entity", Json(r, entity));
object.emplace("clause", Json(r, clause));
object.emplace("fieldPath", Json(r, field_path));
json.data = std::move(object);
return json;
}
DynamicSearchFilter::DynamicSearchFilter(std::allocator_arg_t,
Allocator a,
std::string_view path,
std::string_view op,
const Json& value)
: field_path(path, a.resource()), operator_name(op, a.resource()), value(a.resource(), value) {}
DynamicSearchFilter::DynamicSearchFilter(std::allocator_arg_t,
Allocator a,
const DynamicSearchFilter& other)
: DynamicSearchFilter(
std::allocator_arg, a, other.field_path, other.operator_name, other.value) {}
DynamicSearchOrder::DynamicSearchOrder(std::allocator_arg_t,
Allocator a,
std::string_view path,
bool descending)
: field_path(path, a.resource()), descending(descending) {}
DynamicSearchOrder::DynamicSearchOrder(std::allocator_arg_t,
Allocator a,
const DynamicSearchOrder& other)
: DynamicSearchOrder(std::allocator_arg, a, other.field_path, other.descending) {}
NormalizedDynamicSearch::NormalizedDynamicSearch(std::allocator_arg_t, Allocator a)
: filters(a.resource()), orders(a.resource()), warnings(a.resource()) {}
NormalizedDynamicSearch::NormalizedDynamicSearch(std::allocator_arg_t,
Allocator a,
const NormalizedDynamicSearch& other)
: NormalizedDynamicSearch(std::allocator_arg, a) {
for (const auto& filter : other.filters) {
filters.emplace_back(filter);
}
for (const auto& order : other.orders) {
orders.emplace_back(order);
}
for (const auto& warning : other.warnings) {
warnings.emplace_back(warning);
}
}
DynamicSearchResult::DynamicSearchResult(std::allocator_arg_t,
Allocator a,
const SelectQuery& query,
std::span<const DynamicSearchWarning> warnings)
: query(std::allocator_arg, a, query), warnings(a.resource()) {
for (const auto& warning : warnings) {
this->warnings.emplace_back(warning);
}
}
DynamicSearchResult::DynamicSearchResult(std::allocator_arg_t,
Allocator a,
const DynamicSearchResult& other)
: DynamicSearchResult(std::allocator_arg, a, other.query, other.warnings) {}
namespace {
[[noreturn]] void fail(std::string_view message) {
throw DynamicSearchError{message};
}
const Json* get(const Json::Object& object, std::string_view key) {
auto it = object.find(key);
return it == object.end() ? nullptr : &it->second;
}
std::optional<std::string_view>
field_type(std::string_view path, std::string_view entity, const SearchModels& models) {
std::array<std::string_view, 16> parts;
std::size_t count = 0;
while (true) {
if (count == parts.size()) {
fail("Invalid search field path");
}
auto dot = path.find('.');
auto part = path.substr(0, dot);
if (part.empty() || part.starts_with('$') || part == "__proto__" || part == "prototype" ||
part == "constructor") {
fail("Invalid search field path");
}
parts[count++] = part;
if (dot == path.npos) {
break;
}
path.remove_prefix(dot + 1);
}
const auto* model = &models.find(entity)->second;
for (std::size_t i = 0; i + 1 < count; ++i) {
auto relation = model->relations.find(parts[i]);
if (relation == model->relations.end()) {
return {};
}
auto target = models.find(relation->second);
if (target == models.end()) {
fail("Invalid trusted search relation metadata");
}
model = &target->second;
}
auto field = model->fields.find(parts[count - 1]);
if (field == model->fields.end()) {
return {};
}
return std::string_view(field->second);
}
bool decimal_text(std::string_view text) {
if (!text.empty() && (text.front() == '+' || text.front() == '-')) {
text.remove_prefix(1);
}
bool dot = false, digit = false;
for (char c : text) {
if (c == '.') {
if (dot || !digit) {
return false;
}
dot = true;
digit = false;
} else if (c >= '0' && c <= '9') {
digit = true;
} else {
return false;
}
}
return digit;
}
void validate_scalar(Memory r, const Json& value, std::string_view kind) {
if (std::holds_alternative<std::monostate>(value.data)) {
return;
}
std::optional<double> number;
if (auto n = std::get_if<double>(&value.data); n && std::isfinite(*n)) {
number = *n;
}
if (auto n = std::get_if<std::int64_t>(&value.data)) {
number = double(*n);
}
if (auto n = std::get_if<std::uint64_t>(&value.data)) {
number = double(*n);
}
const auto* text = std::get_if<String>(&value.data);
bool valid = false;
if (kind == "integer" || kind == "timestamp") {
valid = number && std::abs(*number) <= 9007199254740991.0 && std::trunc(*number) == *number;
} else if (kind == "number") {
valid = bool(number);
} else if (kind == "string") {
valid = text;
} else if (kind == "boolean") {
valid = std::holds_alternative<bool>(value.data);
} else if (kind == "decimal") {
valid = number || (text && decimal_text(*text));
} else if (kind == "date" && text && text->size() == 10 && !text->starts_with("0000")) {
if (auto date = Date::parse(*text)) {
valid = date->to_string(r) == *text;
}
}
if (!valid) {
fail("Invalid value for known search field");
}
}
void emit(std::span<const DynamicSearchWarning> warnings, WarningSink* sink) {
for (const auto& warning : warnings) {
if (sink) {
(*sink)(warning);
} else {
auto r = warning.entity.get_allocator().resource();
auto json = warning.to_json(r);
std::get<Json::Object>(json.data).find("fieldPath")->second = Json(r, "<omitted>");
std::cerr << json.dump(r) << '\n';
}
}
}
}
SearchResult<NormalizedDynamicSearch> normalize_dynamic_search(Memory r,
std::string_view source,
std::string_view entity,
const SearchModels& models,
std::size_t limit,
WarningSink* warn) {
using Outcome = SearchResult<NormalizedDynamicSearch>;
auto validate = [&]() -> Outcome {
try {
if (!limit || !models.contains(entity)) {
fail("Invalid trusted search setup");
}
auto value = Json::parse(r, source);
if (!value) {
fail("Dynamic search requires valid JSON");
}
auto root = std::get_if<Json::Object>(&value->data);
if (!root) {
fail("Expected search object");
}
for (const auto& [key, unused] : *root) {
(void)unused;
if (key != "filter" && key != "orderBy") {
fail("Unsupported dynamic search control");
}
}
const Json::Object empty_filters(r);
const Json::Array empty_orders(r);
const auto* filters = &empty_filters;
const auto* orders = &empty_orders;
if (auto input = get(*root, "filter")) {
filters = std::get_if<Json::Object>(&input->data);
if (!filters) {
fail("Invalid search filter");
}
}
if (auto input = get(*root, "orderBy")) {
orders = std::get_if<Json::Array>(&input->data);
if (!orders) {
fail("Invalid search ordering");
}
}
if (filters->size() > limit || orders->size() > limit - filters->size()) {
fail("Dynamic search exceeds clause limit");
}
NormalizedDynamicSearch result(std::allocator_arg, Allocator(r));
for (const auto& [path, predicate] : *filters) {
std::string_view op = "$eq";
const Json* operand = &predicate;
if (auto parts = std::get_if<Json::Object>(&predicate.data)) {
if (parts->size() != 1) {
fail("Malformed dynamic search operator");
}
op = parts->begin()->first;
operand = &parts->begin()->second;
if (op != "$eq" && op != "$ne" && op != "$gt" && op != "$gte" && op != "$lt" &&
op != "$lte" && op != "$in" && op != "$notIn" && op != "$contains") {
fail("Unsupported dynamic search operator");
}
}
auto items = std::get_if<Json::Array>(&operand->data);
if ((op == "$in" || op == "$notIn") && (!items || items->size() > 1000)) {
fail("Invalid or oversized search value list");
}
auto kind = field_type(path, entity, models);
if (!kind) {
result.warnings.emplace_back(entity, "FILTER", path);
continue;
}
if (op == "$contains" && *kind != "string") {
fail("String operator requires a string field");
}
if (items) {
if (op != "$in" && op != "$notIn") {
fail("Unexpected search value list");
}
for (const auto& item : *items) {
validate_scalar(r, item, *kind);
}
} else {
validate_scalar(r, *operand, *kind);
}
result.filters.emplace_back(path, op, *operand);
}
for (const auto& value : *orders) {
auto order = std::get_if<Json::Object>(&value.data);
if (!order) {
fail("Invalid search ordering");
}
auto field = get(*order, "field");
auto path = field ? std::get_if<String>(&field->data) : nullptr;
if (!path) {
fail("Invalid ordering field");
}
auto direction_value = get(*order, "direction");
auto direction =
direction_value ? std::get_if<String>(&direction_value->data) : nullptr;
if (!direction) {
fail("Invalid ordering direction");
}
if (order->size() != 2 || (*direction != "asc" && *direction != "desc")) {
fail("Invalid dynamic search ordering");
}
if (!field_type(*path, entity, models)) {
result.warnings.emplace_back(entity, "ORDER_BY", *path);
} else {
result.orders.emplace_back(*path, *direction == "desc");
}
}
return Outcome::ok(r, std::move(result));
} catch (const DynamicSearchError& error) {
return Outcome::err(r, error);
}
};
auto result = validate();
if (result) {
emit(result.value().warnings, warn);
}
return result;
}
SearchResult<DynamicSearchResult> merge_dynamic_search(Memory r,
const SelectQuery& base,
std::string_view source,
const SearchModels& models,
FilterBinding filter_binding,
OrderBinding order_binding,
WarningSink* warn) {
using Outcome = SearchResult<DynamicSearchResult>;
auto ignore = [](const DynamicSearchWarning&) {};
WarningSink silent(ignore);
auto search = normalize_dynamic_search(r, source, base.entity, models, 100, &silent);
if (!search) {
return Outcome::err(r, search.error());
}
Vector<Expr> filters(r);
Vector<OrderBy> orders(r);
for (const auto& filter : search.value().filters) {
auto result = filter_binding(filter);
if (!result) {
return Outcome::err(r, result.error());
}
filters.emplace_back(std::move(result).value());
}
for (const auto& order : search.value().orders) {
auto result = order_binding(order);
if (!result) {
return Outcome::err(r, result.error());
}
orders.emplace_back(std::move(result).value());
}
SelectQuery query(std::allocator_arg, Allocator(r), base);
for (const auto& filter : filters) {
query.and_filter(filter);
}
for (auto& order : orders) {
query.order_by.emplace_back(std::move(order));
}
emit(search.value().warnings, warn);
return Outcome::ok(
r, DynamicSearchResult(std::allocator_arg, Allocator(r), query, search.value().warnings));
}
}