-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathredis.cpp
More file actions
374 lines (325 loc) · 9.43 KB
/
redis.cpp
File metadata and controls
374 lines (325 loc) · 9.43 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
373
374
/*
* qb - C++ Actor Framework
* Copyright (C) 2011-2025 isndev (cpp.actor). All rights reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "redis.h"
namespace {
// Constants for infinity representations in Redis range queries
const std::string NEGATIVE_INFINITY_NUMERIC = "-inf";
const std::string POSITIVE_INFINITY_NUMERIC = "+inf";
const std::string NEGATIVE_INFINITY_STRING = "-";
const std::string POSITIVE_INFINITY_STRING = "+";
/**
* @brief Creates an unbounded representation of a value
*
* Prepends "(" to the value to indicate an open bound in Redis range queries.
*
* @param bnd The value to convert to unbounded format
* @return String representation of the unbounded value
*/
std::string unbound(const std::string &bnd);
/**
* @brief Creates a bounded representation of a value
*
* Prepends "[" to the value to indicate a closed bound in Redis range queries.
*
* @param bnd The value to convert to bounded format
* @return String representation of the bounded value
*/
std::string bound(const std::string &bnd);
} // namespace
namespace qb::redis {
/**
* @brief Gets the lower bound for an unbounded double interval
* @return String representing negative infinity for numeric ranges
*/
const std::string &
UnboundedInterval<double>::lower() const {
return NEGATIVE_INFINITY_NUMERIC;
}
/**
* @brief Gets the upper bound for an unbounded double interval
* @return String representing positive infinity for numeric ranges
*/
const std::string &
UnboundedInterval<double>::upper() const {
return POSITIVE_INFINITY_NUMERIC;
}
/**
* @brief Constructs a bounded interval for double values
*
* @param min Minimum value of the interval
* @param max Maximum value of the interval
* @param type Type of bounds (open, closed, etc.)
*/
BoundedInterval<double>::BoundedInterval(double min, double max, BoundType type)
: _min(std::to_string(min))
, _max(std::to_string(max)) {
switch (type) {
case BoundType::CLOSED:
// Do nothing
break;
case BoundType::OPEN:
_min = unbound(_min);
_max = unbound(_max);
break;
case BoundType::LEFT_OPEN:
_min = unbound(_min);
break;
case BoundType::RIGHT_OPEN:
_max = unbound(_max);
break;
default:
throw Error("Unknow BoundType");
}
}
/**
* @brief Constructs a left-bounded interval for double values
*
* @param min Minimum value of the interval
* @param type Type of bounds (open or right-open)
*/
LeftBoundedInterval<double>::LeftBoundedInterval(double min, BoundType type)
: _min(std::to_string(min)) {
switch (type) {
case BoundType::OPEN:
_min = unbound(_min);
break;
case BoundType::RIGHT_OPEN:
// Do nothing.
break;
default:
throw Error("Bound type can only be OPEN or RIGHT_OPEN");
}
}
/**
* @brief Gets the upper bound for a left-bounded double interval
* @return String representing positive infinity for numeric ranges
*/
const std::string &
LeftBoundedInterval<double>::upper() const {
return POSITIVE_INFINITY_NUMERIC;
}
/**
* @brief Constructs a right-bounded interval for double values
*
* @param max Maximum value of the interval
* @param type Type of bounds (open or left-open)
*/
RightBoundedInterval<double>::RightBoundedInterval(double max, BoundType type)
: _max(std::to_string(max)) {
switch (type) {
case BoundType::OPEN:
_max = unbound(_max);
break;
case BoundType::LEFT_OPEN:
// Do nothing.
break;
default:
throw Error("Bound type can only be OPEN or LEFT_OPEN");
}
}
/**
* @brief Gets the lower bound for a right-bounded double interval
* @return String representing negative infinity for numeric ranges
*/
const std::string &
RightBoundedInterval<double>::lower() const {
return NEGATIVE_INFINITY_NUMERIC;
}
/**
* @brief Gets the lower bound for an unbounded string interval
* @return String representing negative infinity for string ranges
*/
const std::string &
UnboundedInterval<std::string>::lower() const {
return NEGATIVE_INFINITY_STRING;
}
/**
* @brief Gets the upper bound for an unbounded string interval
* @return String representing positive infinity for string ranges
*/
const std::string &
UnboundedInterval<std::string>::upper() const {
return POSITIVE_INFINITY_STRING;
}
/**
* @brief Constructs a bounded interval for string values
*
* @param min Minimum value of the interval
* @param max Maximum value of the interval
* @param type Type of bounds (open, closed, etc.)
*/
BoundedInterval<std::string>::BoundedInterval(const std::string &min,
const std::string &max, BoundType type) {
switch (type) {
case BoundType::CLOSED:
_min = bound(min);
_max = bound(max);
break;
case BoundType::OPEN:
_min = unbound(min);
_max = unbound(max);
break;
case BoundType::LEFT_OPEN:
_min = unbound(min);
_max = bound(max);
break;
case BoundType::RIGHT_OPEN:
_min = bound(min);
_max = unbound(max);
break;
default:
throw Error("Unknow BoundType");
}
}
/**
* @brief Constructs a left-bounded interval for string values
*
* @param min Minimum value of the interval
* @param type Type of bounds (open or right-open)
*/
LeftBoundedInterval<std::string>::LeftBoundedInterval(const std::string &min,
BoundType type) {
switch (type) {
case BoundType::OPEN:
_min = unbound(min);
break;
case BoundType::RIGHT_OPEN:
_min = bound(min);
break;
default:
throw Error("Bound type can only be OPEN or RIGHT_OPEN");
}
}
/**
* @brief Gets the upper bound for a left-bounded string interval
* @return String representing positive infinity for string ranges
*/
const std::string &
LeftBoundedInterval<std::string>::upper() const {
return POSITIVE_INFINITY_STRING;
}
/**
* @brief Constructs a right-bounded interval for string values
*
* @param max Maximum value of the interval
* @param type Type of bounds (open or left-open)
*/
RightBoundedInterval<std::string>::RightBoundedInterval(const std::string &max,
BoundType type) {
switch (type) {
case BoundType::OPEN:
_max = unbound(max);
break;
case BoundType::LEFT_OPEN:
_max = bound(max);
break;
default:
throw Error("Bound type can only be OPEN or LEFT_OPEN");
}
}
/**
* @brief Gets the lower bound for a right-bounded string interval
* @return String representing negative infinity for string ranges
*/
const std::string &
RightBoundedInterval<std::string>::lower() const {
return NEGATIVE_INFINITY_STRING;
}
} // namespace qb::redis
namespace {
std::string
unbound(const std::string &bnd) {
return "(" + bnd;
}
std::string
bound(const std::string &bnd) {
return "[" + bnd;
}
} // namespace
namespace std {
std::string
to_string(qb::redis::BitOp op) {
switch (op) {
case qb::redis::BitOp::AND:
return "AND";
case qb::redis::BitOp::OR:
return "OR";
case qb::redis::BitOp::XOR:
return "XOR";
case qb::redis::BitOp::NOT:
return "NOT";
}
return {};
}
std::string
to_string(qb::redis::UpdateType op) {
switch (op) {
case qb::redis::UpdateType::EXIST:
return "XX";
case qb::redis::UpdateType::NOT_EXIST:
return "NX";
default:
return {};
}
}
std::string
to_string(qb::redis::Aggregation op) {
switch (op) {
case qb::redis::Aggregation::SUM:
return "SUM";
case qb::redis::Aggregation::MIN:
return "MIN";
case qb::redis::Aggregation::MAX:
return "MAX";
}
return {};
}
std::string
to_string(qb::redis::GeoUnit op) {
switch (op) {
case qb::redis::GeoUnit::M:
return "m";
case qb::redis::GeoUnit::KM:
return "km";
case qb::redis::GeoUnit::MI:
return "mi";
case qb::redis::GeoUnit::FT:
return "ft";
}
return {};
}
std::string
to_string(qb::redis::InsertPosition pos) {
switch (pos) {
case qb::redis::InsertPosition::BEFORE:
return "BEFORE";
case qb::redis::InsertPosition::AFTER:
return "AFTER";
}
return {};
}
std::string
to_string(qb::redis::ListPosition pos) {
switch (pos) {
case qb::redis::ListPosition::LEFT:
return "LEFT";
case qb::redis::ListPosition::RIGHT:
return "RIGHT";
}
return {};
}
} // namespace std