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
|
/*
* 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 <functional>
#include "domain/applicationdomaintype.h"
#include "metadata_generated.h"
/*
* An iterator to a result set.
*
* We'll eventually want to lazy load results in next().
*/
class ResultSet {
public:
ResultSet()
: mIt(nullptr)
{
}
ResultSet(const std::function<bool(std::function<void(const Akonadi2::ApplicationDomain::ApplicationDomainType::Ptr &, Akonadi2::Operation)>)> &generator)
: mIt(nullptr),
mValueGenerator(generator)
{
}
ResultSet(const std::function<QByteArray()> &generator)
: mIt(nullptr),
mGenerator(generator)
{
}
ResultSet(const QVector<QByteArray> &resultSet)
: mResultSet(resultSet),
mIt(nullptr)
{
}
bool next()
{
if (mGenerator) {
mCurrentValue = mGenerator();
} else {
if (!mIt) {
mIt = mResultSet.constBegin();
} else {
mIt++;
}
return mIt != mResultSet.constEnd();
}
if (!mCurrentValue.isNull()) {
return true;
}
return false;
}
bool next(std::function<bool(const Akonadi2::ApplicationDomain::ApplicationDomainType::Ptr &value, Akonadi2::Operation)> callback)
{
Q_ASSERT(mValueGenerator);
return mValueGenerator(callback);
}
bool next(std::function<void(const QByteArray &key)> callback)
{
if (mGenerator) {
mCurrentValue = mGenerator();
} else {
if (!mIt) {
mIt = mResultSet.constBegin();
} else {
mIt++;
}
return mIt != mResultSet.constEnd();
}
return false;
}
QByteArray id()
{
if (mIt) {
return *mIt;
} else {
return mCurrentValue;
}
}
bool isEmpty()
{
return mResultSet.isEmpty();
}
private:
QVector<QByteArray> mResultSet;
QVector<QByteArray>::ConstIterator mIt;
QByteArray mCurrentValue;
std::function<QByteArray()> mGenerator;
std::function<bool(std::function<void(const Akonadi2::ApplicationDomain::ApplicationDomainType::Ptr &, Akonadi2::Operation)>)> mValueGenerator;
};
|
