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
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
|
/*
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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 "qmf/exceptions.h"
#include "qmf/Expression.h"
#include <iostream>
using namespace std;
using namespace qmf;
using namespace qpid::types;
Expression::Expression(const Variant::List& expr)
{
static int level(0);
level++;
Variant::List::const_iterator iter(expr.begin());
string op(iter->asString());
iter++;
if (op == "not") logicalOp = LOGICAL_NOT;
else if (op == "and") logicalOp = LOGICAL_AND;
else if (op == "or") logicalOp = LOGICAL_OR;
else {
logicalOp = LOGICAL_ID;
if (op == "eq") boolOp = BOOL_EQ;
else if (op == "ne") boolOp = BOOL_NE;
else if (op == "lt") boolOp = BOOL_LT;
else if (op == "le") boolOp = BOOL_LE;
else if (op == "gt") boolOp = BOOL_GT;
else if (op == "ge") boolOp = BOOL_GE;
else if (op == "re_match") boolOp = BOOL_RE_MATCH;
else if (op == "exists") boolOp = BOOL_EXISTS;
else if (op == "true") boolOp = BOOL_TRUE;
else if (op == "false") boolOp = BOOL_FALSE;
else
throw QmfException("Invalid operator in predicate expression");
}
if (logicalOp == LOGICAL_ID) {
switch (boolOp) {
case BOOL_EQ:
case BOOL_NE:
case BOOL_LT:
case BOOL_LE:
case BOOL_GT:
case BOOL_GE:
case BOOL_RE_MATCH:
//
// Binary operator: get two operands.
//
operandCount = 2;
break;
case BOOL_EXISTS:
//
// Unary operator: get one operand.
//
operandCount = 1;
break;
case BOOL_TRUE:
case BOOL_FALSE:
//
// Literal operator: no operands.
//
operandCount = 0;
break;
}
for (int idx = 0; idx < operandCount; idx++) {
if (iter == expr.end())
throw QmfException("Too few operands for operation: " + op);
if (iter->getType() == VAR_STRING) {
quoted[idx] = false;
operands[idx] = *iter;
} else if (iter->getType() == VAR_LIST) {
const Variant::List& sublist(iter->asList());
Variant::List::const_iterator subIter(sublist.begin());
if (subIter != sublist.end() && subIter->asString() == "quote") {
quoted[idx] = true;
subIter++;
if (subIter != sublist.end()) {
operands[idx] = *subIter;
subIter++;
if (subIter != sublist.end())
throw QmfException("Extra tokens at end of 'quote'");
}
} else
throw QmfException("Expected '[quote, <token>]'");
} else
throw QmfException("Expected string or list as operand for: " + op);
iter++;
}
if (iter != expr.end())
throw QmfException("Too many operands for operation: " + op);
} else {
//
// This is a logical expression, collect sub-expressions
//
while (iter != expr.end()) {
if (iter->getType() != VAR_LIST)
throw QmfException("Operands of " + op + " must be lists");
expressionList.push_back(boost::shared_ptr<Expression>(new Expression(iter->asList())));
iter++;
}
}
level--;
}
bool Expression::evaluate(const Variant::Map& data) const
{
list<boost::shared_ptr<Expression> >::const_iterator iter;
switch (logicalOp) {
case LOGICAL_ID:
return boolEval(data);
case LOGICAL_NOT:
for (iter = expressionList.begin(); iter != expressionList.end(); iter++)
if ((*iter)->evaluate(data))
return false;
return true;
case LOGICAL_AND:
for (iter = expressionList.begin(); iter != expressionList.end(); iter++)
if (!(*iter)->evaluate(data))
return false;
return true;
case LOGICAL_OR:
for (iter = expressionList.begin(); iter != expressionList.end(); iter++)
if ((*iter)->evaluate(data))
return true;
return false;
}
return false;
}
bool Expression::boolEval(const Variant::Map& data) const
{
Variant val[2];
bool exists[2];
for (int idx = 0; idx < operandCount; idx++) {
if (quoted[idx]) {
exists[idx] = true;
val[idx] = operands[idx];
} else {
Variant::Map::const_iterator mIter(data.find(operands[idx].asString()));
if (mIter == data.end()) {
exists[idx] = false;
} else {
exists[idx] = true;
val[idx] = mIter->second;
}
}
}
switch (boolOp) {
case BOOL_EQ: return (exists[0] && exists[1] && (val[0].asString() == val[1].asString()));
case BOOL_NE: return (exists[0] && exists[1] && (val[0].asString() != val[1].asString()));
case BOOL_LT: return (exists[0] && exists[1] && lessThan(val[0], val[1]));
case BOOL_LE: return (exists[0] && exists[1] && lessEqual(val[0], val[1]));
case BOOL_GT: return (exists[0] && exists[1] && greaterThan(val[0], val[1]));
case BOOL_GE: return (exists[0] && exists[1] && greaterEqual(val[0], val[1]));
case BOOL_RE_MATCH: return false; // TODO
case BOOL_EXISTS: return exists[0];
case BOOL_TRUE: return true;
case BOOL_FALSE: return false;
}
return false;
}
bool Expression::lessThan(const Variant& left, const Variant& right) const
{
switch (left.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
switch (right.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
return left.asInt64() < right.asInt64();
case VAR_STRING:
try {
return left.asInt64() < right.asInt64();
} catch (std::exception&) {}
break;
default:
break;
}
break;
case VAR_FLOAT: case VAR_DOUBLE:
switch (right.getType()) {
case VAR_FLOAT: case VAR_DOUBLE:
return left.asDouble() < right.asDouble();
case VAR_STRING:
try {
return left.asDouble() < right.asDouble();
} catch (std::exception&) {}
break;
default:
break;
}
break;
case VAR_STRING:
switch (right.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
try {
return left.asInt64() < right.asInt64();
} catch (std::exception&) {}
break;
case VAR_FLOAT: case VAR_DOUBLE:
try {
return left.asDouble() < right.asDouble();
} catch (std::exception&) {}
break;
case VAR_STRING:
return left.asString() < right.asString();
default:
break;
}
default:
break;
}
return false;
}
bool Expression::lessEqual(const Variant& left, const Variant& right) const
{
switch (left.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
switch (right.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
return left.asInt64() <= right.asInt64();
case VAR_STRING:
try {
return left.asInt64() <= right.asInt64();
} catch (std::exception&) {}
break;
default:
break;
}
break;
case VAR_FLOAT: case VAR_DOUBLE:
switch (right.getType()) {
case VAR_FLOAT: case VAR_DOUBLE:
return left.asDouble() <= right.asDouble();
case VAR_STRING:
try {
return left.asDouble() <= right.asDouble();
} catch (std::exception&) {}
break;
default:
break;
}
break;
case VAR_STRING:
switch (right.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
try {
return left.asInt64() <= right.asInt64();
} catch (std::exception&) {}
break;
case VAR_FLOAT: case VAR_DOUBLE:
try {
return left.asDouble() <= right.asDouble();
} catch (std::exception&) {}
break;
case VAR_STRING:
return left.asString() <= right.asString();
default:
break;
}
default:
break;
}
return false;
}
bool Expression::greaterThan(const Variant& left, const Variant& right) const
{
switch (left.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
switch (right.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
return left.asInt64() > right.asInt64();
case VAR_STRING:
try {
return left.asInt64() > right.asInt64();
} catch (std::exception&) {}
break;
default:
break;
}
break;
case VAR_FLOAT: case VAR_DOUBLE:
switch (right.getType()) {
case VAR_FLOAT: case VAR_DOUBLE:
return left.asDouble() > right.asDouble();
case VAR_STRING:
try {
return left.asDouble() > right.asDouble();
} catch (std::exception&) {}
break;
default:
break;
}
break;
case VAR_STRING:
switch (right.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
try {
return left.asInt64() > right.asInt64();
} catch (std::exception&) {}
break;
case VAR_FLOAT: case VAR_DOUBLE:
try {
return left.asDouble() > right.asDouble();
} catch (std::exception&) {}
break;
case VAR_STRING:
return left.asString() > right.asString();
default:
break;
}
default:
break;
}
return false;
}
bool Expression::greaterEqual(const Variant& left, const Variant& right) const
{
switch (left.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
switch (right.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
return left.asInt64() >= right.asInt64();
case VAR_STRING:
try {
return left.asInt64() >= right.asInt64();
} catch (std::exception&) {}
break;
default:
break;
}
break;
case VAR_FLOAT: case VAR_DOUBLE:
switch (right.getType()) {
case VAR_FLOAT: case VAR_DOUBLE:
return left.asDouble() >= right.asDouble();
case VAR_STRING:
try {
return left.asDouble() >= right.asDouble();
} catch (std::exception&) {}
break;
default:
break;
}
break;
case VAR_STRING:
switch (right.getType()) {
case VAR_UINT8: case VAR_UINT16: case VAR_UINT32: case VAR_UINT64:
case VAR_INT8: case VAR_INT16: case VAR_INT32: case VAR_INT64:
try {
return left.asInt64() >= right.asInt64();
} catch (std::exception&) {}
break;
case VAR_FLOAT: case VAR_DOUBLE:
try {
return left.asDouble() >= right.asDouble();
} catch (std::exception&) {}
break;
case VAR_STRING:
return left.asString() >= right.asString();
default:
break;
}
default:
break;
}
return false;
}
|
