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
|
/*
* Copyright (C) 2014 Christian Mollekopf <chrigi_1@fastmail.fm>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the
* Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#pragma once
#include <QVector>
#include <QMap>
#include <QVariant>
#include <functional>
#include "metadata_generated.h"
#include "entitybuffer.h"
#include "applicationdomaintype.h"
#include "storage/key.h"
/*
* An iterator to a result set.
*
* We'll eventually want to lazy load results in next().
*/
class ResultSet
{
public:
struct Result {
Result(const Sink::ApplicationDomain::ApplicationDomainType &e, Sink::Operation op,
const QMap<QByteArray, QVariant> &v = {}, const QVector<Sink::Storage::Identifier> &a = {})
: entity(e), operation(op), aggregateValues(v), aggregateIds(a)
{
}
Sink::ApplicationDomain::ApplicationDomainType entity;
Sink::Operation operation;
QMap<QByteArray, QVariant> aggregateValues;
QVector<Sink::Storage::Identifier> aggregateIds;
};
typedef std::function<void(const Result &)> Callback;
typedef std::function<bool(Callback)> ValueGenerator;
typedef std::function<Sink::Storage::Identifier()> IdGenerator;
typedef std::function<void()> SkipValue;
ResultSet();
ResultSet(const ValueGenerator &generator, const SkipValue &skip);
ResultSet(const IdGenerator &generator);
ResultSet(const QVector<Sink::Storage::Identifier> &resultSet);
ResultSet(const ResultSet &other);
bool next();
bool next(const Callback &callback);
void skip(int number);
struct ReplayResult {
qint64 replayedEntities;
bool replayedAll;
};
ReplayResult replaySet(int offset, int batchSize, const Callback &callback);
Sink::Storage::Identifier id();
bool isEmpty();
private:
QVector<Sink::Storage::Identifier> mResultSet;
QVector<Sink::Storage::Identifier>::ConstIterator mIt;
Sink::Storage::Identifier mCurrentValue;
IdGenerator mGenerator;
ValueGenerator mValueGenerator;
SkipValue mSkip;
bool mFirst;
};
|
