blob: f9b6cead56b10bb62af43d07b0737c1f50ef0100 (
plain)
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
|
/*
* 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>
/*
* An iterator to a result set.
*
* We'll eventually want to lazy load results in next().
*/
class ResultSet {
public:
ResultSet(const QVector<QByteArray> &resultSet)
: mResultSet(resultSet),
mIt(nullptr)
{
}
bool next()
{
if (!mIt) {
mIt = mResultSet.constBegin();
} else {
mIt++;
}
return mIt != mResultSet.constEnd();
}
QByteArray id()
{
return *mIt;
}
bool isEmpty()
{
return mResultSet.isEmpty();
}
private:
QVector<QByteArray> mResultSet;
QVector<QByteArray>::ConstIterator mIt;
};
|
