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
|
/*
* Copyright (C) 2016 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.
*/
#include "resultset.h"
#include "log.h"
using Sink::Storage::Identifier;
ResultSet::ResultSet() : mIt(nullptr)
{
}
ResultSet::ResultSet(const ValueGenerator &generator, const SkipValue &skip) : mIt(nullptr), mValueGenerator(generator), mSkip(skip)
{
}
ResultSet::ResultSet(const QVector<Identifier> &resultSet)
: mResultSet(resultSet),
mIt(mResultSet.constBegin()),
mSkip([this]() {
if (mIt != mResultSet.constEnd()) {
mIt++;
}
}),
mFirst(true)
{
}
ResultSet::ResultSet(const ResultSet &other) : mResultSet(other.mResultSet), mIt(nullptr), mFirst(true)
{
if (other.mValueGenerator) {
mValueGenerator = other.mValueGenerator;
mSkip = other.mSkip;
} else {
mResultSet = other.mResultSet;
mIt = mResultSet.constBegin();
mSkip = [this]() {
if (mIt != mResultSet.constEnd()) {
mIt++;
}
};
}
}
bool ResultSet::next()
{
Q_ASSERT(!mValueGenerator);
if (mIt) {
if (mIt != mResultSet.constEnd() && !mFirst) {
mIt++;
}
mFirst = false;
return mIt != mResultSet.constEnd();
} else {
next([](const Result &) { return false; });
}
return false;
}
bool ResultSet::next(const Callback &callback)
{
Q_ASSERT(mValueGenerator);
return mValueGenerator(callback);
}
void ResultSet::skip(int number)
{
Q_ASSERT(mSkip);
for (int i = 0; i < number; i++) {
mSkip();
}
}
ResultSet::ReplayResult ResultSet::replaySet(int offset, int batchSize, const Callback &callback)
{
skip(offset);
int counter = 0;
while (!batchSize || (counter < batchSize)) {
const bool ret = next([&counter, callback](const ResultSet::Result &result) {
counter++;
callback(result);
});
if (!ret) {
return {counter, true};
}
};
return {counter, false};
}
Identifier ResultSet::id()
{
if (mIt) {
if (mIt == mResultSet.constEnd()) {
return {};
}
Q_ASSERT(mIt != mResultSet.constEnd());
return *mIt;
} else {
return mCurrentValue;
}
}
bool ResultSet::isEmpty()
{
return mResultSet.isEmpty();
}
|
