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
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
|
/*
* Copyright (C) 2014 Christian Mollekopf <chrigi_1@fastmail.fm>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) version 3, or any
* later version accepted by the membership of KDE e.V. (or its
* successor approved by the membership of KDE e.V.), which shall
* act as a proxy defined in Section 6 of version 3 of the license.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library. If not, see <http://www.gnu.org/licenses/>.
*/
#pragma once
#include "sink_export.h"
#include <QByteArrayList>
#include <QHash>
#include <QSet>
#include "applicationdomaintype.h"
namespace Sink {
class SINK_EXPORT QueryBase
{
public:
struct SINK_EXPORT Comparator {
enum Comparators {
Invalid,
Equals,
Contains,
In,
Fulltext
};
Comparator();
Comparator(const QVariant &v);
Comparator(const QVariant &v, Comparators c);
bool matches(const QVariant &v) const;
bool operator==(const Comparator &other) const;
QVariant value;
Comparators comparator;
};
class SINK_EXPORT Filter {
public:
QByteArrayList ids;
QHash<QByteArray, Comparator> propertyFilter;
bool operator==(const Filter &other) const;
};
QueryBase() = default;
QueryBase(const QByteArray &type) : mType(type) {}
bool operator==(const QueryBase &other) const;
Comparator getFilter(const QByteArray &property) const
{
return mBaseFilterStage.propertyFilter.value(property);
}
template <class T>
Comparator getFilter() const
{
return getFilter(T::name);
}
bool hasFilter(const QByteArray &property) const
{
return mBaseFilterStage.propertyFilter.contains(property);
}
template <class T>
bool hasFilter() const
{
return hasFilter(T::name);
}
void setId(const QByteArray &id)
{
mId = id;
}
QByteArray id() const
{
return mId;
}
void setBaseFilters(const QHash<QByteArray, Comparator> &filter)
{
mBaseFilterStage.propertyFilter = filter;
}
void setFilter(const Filter &filter)
{
mBaseFilterStage = filter;
}
QHash<QByteArray, Comparator> getBaseFilters() const
{
return mBaseFilterStage.propertyFilter;
}
Filter getFilter() const
{
return mBaseFilterStage;
}
QByteArrayList ids() const
{
return mBaseFilterStage.ids;
}
void filter(const QByteArray &id)
{
mBaseFilterStage.ids << id;
}
void filter(const QByteArrayList &ids)
{
mBaseFilterStage.ids << ids;
}
void filter(const QByteArray &property, const QueryBase::Comparator &comparator)
{
mBaseFilterStage.propertyFilter.insert(property, comparator);
}
void setType(const QByteArray &type)
{
mType = type;
}
template<typename T>
void setType()
{
setType(ApplicationDomain::getTypeName<T>());
}
QByteArray type() const
{
return mType;
}
void setSortProperty(const QByteArray &property)
{
mSortProperty = property;
}
QByteArray sortProperty() const
{
return mSortProperty;
}
class FilterStage {
public:
virtual ~FilterStage(){};
};
QList<QSharedPointer<FilterStage>> getFilterStages()
{
return mFilterStages;
}
class Reduce : public FilterStage {
public:
class Selector {
public:
enum Comparator {
Min, //get the minimum value
Max, //get the maximum value
First //Get the first result we get
};
template <typename SelectionProperty>
static Selector max()
{
return Selector(SelectionProperty::name, Max);
}
Selector(const QByteArray &p, Comparator c)
: property(p),
comparator(c)
{
}
QByteArray property;
Comparator comparator;
};
class Aggregator {
public:
enum Operation {
Count,
Collect
};
Aggregator(const QByteArray &p, Operation o, const QByteArray &c = QByteArray())
: resultProperty(p),
operation(o),
propertyToCollect(c)
{
}
QByteArray resultProperty;
Operation operation;
QByteArray propertyToCollect;
};
Reduce(const QByteArray &p, const Selector &s)
: property(p),
selector(s)
{
}
Reduce &count(const QByteArray &propertyName = "count")
{
aggregators << Aggregator(propertyName, Aggregator::Count);
return *this;
}
template <typename T>
Reduce &collect(const QByteArray &propertyName)
{
aggregators << Aggregator(propertyName, Aggregator::Collect, T::name);
return *this;
}
template <typename T>
Reduce &collect()
{
aggregators << Aggregator(QByteArray{T::name} + QByteArray{"Collected"}, Aggregator::Collect, T::name);
return *this;
}
//Reduce on property
QByteArray property;
Selector selector;
QList<Aggregator> aggregators;
//TODO add aggregate functions like:
//.count()
//.collect<Mail::sender>();
//...
//
//Potentially pass-in an identifier under which the result will be available in the result set.
};
Reduce &reduce(const QByteArray &name, const Reduce::Selector &s)
{
auto reduction = QSharedPointer<Reduce>::create(name, s);
mFilterStages << reduction;
return *reduction;
}
template <typename T>
Reduce &reduce(const Reduce::Selector &s)
{
return reduce(T::name, s);
}
/**
* "Bloom" on a property.
*
* For every encountered value of a property,
* a result set is generated containing all entries with the same value.
*
* Example:
* For an input set of one mail; return all emails with the same threadId.
*/
class Bloom : public FilterStage {
public:
//Property to bloom on
QByteArray property;
Bloom(const QByteArray &p)
: property(p)
{
}
};
template <typename T>
void bloom()
{
mFilterStages << QSharedPointer<Bloom>::create(T::name);
}
private:
Filter mBaseFilterStage;
QList<QSharedPointer<FilterStage>> mFilterStages;
QByteArray mType;
QByteArray mSortProperty;
QByteArray mId;
};
/**
* A query that matches a set of entities.
*/
class SINK_EXPORT Query : public QueryBase
{
public:
enum Flag
{
NoFlags = 0,
/** Leave the query running and continuously update the result set. */
LiveQuery = 1,
/** Run the query synchronously. */
SynchronousQuery = 2,
/** Include status updates via notifications */
UpdateStatus = 4
};
Q_DECLARE_FLAGS(Flags, Flag)
template <typename T>
Query &request()
{
requestedProperties << T::name;
return *this;
}
template <typename T>
Query &requestTree()
{
mParentProperty = T::name;
return *this;
}
Query &requestTree(const QByteArray &parentProperty)
{
mParentProperty = parentProperty;
return *this;
}
QByteArray parentProperty() const
{
return mParentProperty;
}
template <typename T>
Query &sort()
{
setSortProperty(T::name);
return *this;
}
template <typename T>
Query &filter(const typename T::Type &value)
{
filter(T::name, QVariant::fromValue(value));
return *this;
}
template <typename T>
Query &containsFilter(const QByteArray &value)
{
static_assert(std::is_same<typename T::Type, QByteArrayList>::value, "The contains filter is only implemented for QByteArray in QByteArrayList");
QueryBase::filter(T::name, QueryBase::Comparator(QVariant::fromValue(value), QueryBase::Comparator::Contains));
return *this;
}
template <typename T>
Query &filter(const QueryBase::Comparator &comparator)
{
QueryBase::filter(T::name, comparator);
return *this;
}
Query &filter(const QByteArray &id)
{
QueryBase::filter(id);
return *this;
}
Query &filter(const QByteArrayList &ids)
{
QueryBase::filter(ids);
return *this;
}
Query &filter(const QByteArray &property, const QueryBase::Comparator &comparator)
{
QueryBase::filter(property, comparator);
return *this;
}
template <typename T>
Query &filter(const ApplicationDomain::Entity &value)
{
filter(T::name, QVariant::fromValue(ApplicationDomain::Reference{value.identifier()}));
return *this;
}
template <typename T>
Query &filter(const Query &query)
{
auto q = query;
q.setType(ApplicationDomain::getTypeName<typename T::ReferenceType>());
filter(T::name, QVariant::fromValue(q));
return *this;
}
Query(const ApplicationDomain::Entity &value) : mLimit(0)
{
filter(value.identifier());
resourceFilter(value.resourceInstanceIdentifier());
}
Query(Flags flags = Flags()) : mLimit(0), mFlags(flags)
{
}
QByteArrayList requestedProperties;
void setFlags(Flags flags)
{
mFlags = flags;
}
Flags flags() const
{
return mFlags;
}
bool liveQuery() const
{
return mFlags.testFlag(LiveQuery);
}
bool synchronousQuery() const
{
return mFlags.testFlag(SynchronousQuery);
}
Query &limit(int l)
{
mLimit = l;
return *this;
}
int limit() const
{
return mLimit;
}
Filter getResourceFilter() const
{
return mResourceFilter;
}
Query &resourceFilter(const QByteArray &id)
{
mResourceFilter.ids << id;
return *this;
}
template <typename T>
Query &resourceFilter(const ApplicationDomain::ApplicationDomainType &entity)
{
mResourceFilter.propertyFilter.insert(T::name, Comparator(entity.identifier()));
return *this;
}
Query &resourceFilter(const QByteArray &name, const Comparator &comparator)
{
mResourceFilter.propertyFilter.insert(name, comparator);
return *this;
}
template <typename T>
Query &resourceContainsFilter(const QVariant &value)
{
return resourceFilter(T::name, Comparator(value, Comparator::Contains));
}
template <typename T>
Query &resourceFilter(const QVariant &value)
{
return resourceFilter(T::name, value);
}
private:
friend class SyncScope;
int mLimit;
Flags mFlags;
Filter mResourceFilter;
QByteArray mParentProperty;
};
class SyncScope : public QueryBase {
public:
using QueryBase::QueryBase;
SyncScope() = default;
SyncScope(const Query &other)
: QueryBase(other),
mResourceFilter(other.mResourceFilter)
{
}
template <typename T>
SyncScope(const T &o)
: QueryBase()
{
resourceFilter(o.resourceInstanceIdentifier());
filter(o.identifier());
setType(ApplicationDomain::getTypeName<T>());
}
Query::Filter getResourceFilter() const
{
return mResourceFilter;
}
SyncScope &resourceFilter(const QByteArray &id)
{
mResourceFilter.ids << id;
return *this;
}
template <typename T>
SyncScope &resourceFilter(const ApplicationDomain::ApplicationDomainType &entity)
{
mResourceFilter.propertyFilter.insert(T::name, Comparator(entity.identifier()));
return *this;
}
SyncScope &resourceFilter(const QByteArray &name, const Comparator &comparator)
{
mResourceFilter.propertyFilter.insert(name, comparator);
return *this;
}
template <typename T>
SyncScope &resourceContainsFilter(const QVariant &value)
{
return resourceFilter(T::name, Comparator(value, Comparator::Contains));
}
template <typename T>
SyncScope &resourceFilter(const QVariant &value)
{
return resourceFilter(T::name, value);
}
template <typename T>
SyncScope &filter(const Query::Comparator &comparator)
{
return filter(T::name, comparator);
}
SyncScope &filter(const QByteArray &id)
{
QueryBase::filter(id);
return *this;
}
SyncScope &filter(const QByteArrayList &ids)
{
QueryBase::filter(ids);
return *this;
}
SyncScope &filter(const QByteArray &property, const Query::Comparator &comparator)
{
QueryBase::filter(property, comparator);
return *this;
}
private:
Query::Filter mResourceFilter;
};
}
SINK_EXPORT QDebug operator<<(QDebug dbg, const Sink::QueryBase::Comparator &);
SINK_EXPORT QDebug operator<<(QDebug dbg, const Sink::QueryBase &);
SINK_EXPORT QDebug operator<<(QDebug dbg, const Sink::Query &);
SINK_EXPORT QDataStream &operator<< (QDataStream &stream, const Sink::QueryBase &query);
SINK_EXPORT QDataStream &operator>> (QDataStream &stream, Sink::QueryBase &query);
Q_DECLARE_OPERATORS_FOR_FLAGS(Sink::Query::Flags)
Q_DECLARE_METATYPE(Sink::QueryBase);
Q_DECLARE_METATYPE(Sink::Query);
|