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
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtSql module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at http://qt.nokia.com/contact.
** $QT_END_LICENSE$
**
****************************************************************************/
#include "private/qsqlcachedresult_p.h"
#include <qvariant.h>
#include <qdatetime.h>
#include <qvector.h>
QT_BEGIN_NAMESPACE
/*
QSqlCachedResult is a convenience class for databases that only allow
forward only fetching. It will cache all the results so we can iterate
backwards over the results again.
All you need to do is to inherit from QSqlCachedResult and reimplement
gotoNext(). gotoNext() will have a reference to the internal cache and
will give you an index where you can start filling in your data. Special
case: If the user actually wants a forward-only query, idx will be -1
to indicate that we are not interested in the actual values.
*/
static const uint initial_cache_size = 128;
class QSqlCachedResultPrivate
{
public:
QSqlCachedResultPrivate();
bool canSeek(int i) const;
inline int cacheCount() const;
void init(int count, bool fo);
void cleanup();
int nextIndex();
void revertLast();
QSqlCachedResult::ValueCache cache;
int rowCacheEnd;
int colCount;
bool forwardOnly;
bool atEnd;
};
QSqlCachedResultPrivate::QSqlCachedResultPrivate():
rowCacheEnd(0), colCount(0), forwardOnly(false), atEnd(false)
{
}
void QSqlCachedResultPrivate::cleanup()
{
cache.clear();
forwardOnly = false;
atEnd = false;
colCount = 0;
rowCacheEnd = 0;
}
void QSqlCachedResultPrivate::init(int count, bool fo)
{
Q_ASSERT(count);
cleanup();
forwardOnly = fo;
colCount = count;
if (fo) {
cache.resize(count);
rowCacheEnd = count;
} else {
cache.resize(initial_cache_size * count);
}
}
int QSqlCachedResultPrivate::nextIndex()
{
if (forwardOnly)
return 0;
int newIdx = rowCacheEnd;
if (newIdx + colCount > cache.size())
cache.resize(qMin(cache.size() * 2, cache.size() + 10000));
rowCacheEnd += colCount;
return newIdx;
}
bool QSqlCachedResultPrivate::canSeek(int i) const
{
if (forwardOnly || i < 0)
return false;
return rowCacheEnd >= (i + 1) * colCount;
}
void QSqlCachedResultPrivate::revertLast()
{
if (forwardOnly)
return;
rowCacheEnd -= colCount;
}
inline int QSqlCachedResultPrivate::cacheCount() const
{
Q_ASSERT(!forwardOnly);
Q_ASSERT(colCount);
return rowCacheEnd / colCount;
}
//////////////
QSqlCachedResult::QSqlCachedResult(const QSqlDriver * db): QSqlResult (db)
{
d = new QSqlCachedResultPrivate();
}
QSqlCachedResult::~QSqlCachedResult()
{
delete d;
}
void QSqlCachedResult::init(int colCount)
{
d->init(colCount, isForwardOnly());
}
bool QSqlCachedResult::fetch(int i)
{
if ((!isActive()) || (i < 0))
return false;
if (at() == i)
return true;
if (d->forwardOnly) {
// speed hack - do not copy values if not needed
if (at() > i || at() == QSql::AfterLastRow)
return false;
while(at() < i - 1) {
if (!gotoNext(d->cache, -1))
return false;
setAt(at() + 1);
}
if (!gotoNext(d->cache, 0))
return false;
setAt(at() + 1);
return true;
}
if (d->canSeek(i)) {
setAt(i);
return true;
}
if (d->rowCacheEnd > 0)
setAt(d->cacheCount());
while (at() < i + 1) {
if (!cacheNext()) {
if (d->canSeek(i))
break;
return false;
}
}
setAt(i);
return true;
}
bool QSqlCachedResult::fetchNext()
{
if (d->canSeek(at() + 1)) {
setAt(at() + 1);
return true;
}
return cacheNext();
}
bool QSqlCachedResult::fetchPrevious()
{
return fetch(at() - 1);
}
bool QSqlCachedResult::fetchFirst()
{
if (d->forwardOnly && at() != QSql::BeforeFirstRow) {
return false;
}
if (d->canSeek(0)) {
setAt(0);
return true;
}
return cacheNext();
}
bool QSqlCachedResult::fetchLast()
{
if (d->atEnd) {
if (d->forwardOnly)
return false;
else
return fetch(d->cacheCount() - 1);
}
int i = at();
while (fetchNext())
++i; /* brute force */
if (d->forwardOnly && at() == QSql::AfterLastRow) {
setAt(i);
return true;
} else {
return fetch(i);
}
}
QVariant QSqlCachedResult::data(int i)
{
int idx = d->forwardOnly ? i : at() * d->colCount + i;
if (i >= d->colCount || i < 0 || at() < 0 || idx >= d->rowCacheEnd)
return QVariant();
return d->cache.at(idx);
}
bool QSqlCachedResult::isNull(int i)
{
int idx = d->forwardOnly ? i : at() * d->colCount + i;
if (i > d->colCount || i < 0 || at() < 0 || idx >= d->rowCacheEnd)
return true;
return d->cache.at(idx).isNull();
}
void QSqlCachedResult::cleanup()
{
setAt(QSql::BeforeFirstRow);
setActive(false);
d->cleanup();
}
void QSqlCachedResult::clearValues()
{
setAt(QSql::BeforeFirstRow);
d->rowCacheEnd = 0;
d->atEnd = false;
}
bool QSqlCachedResult::cacheNext()
{
if (d->atEnd)
return false;
if (!gotoNext(d->cache, d->nextIndex())) {
d->revertLast();
d->atEnd = true;
return false;
}
setAt(at() + 1);
return true;
}
int QSqlCachedResult::colCount() const
{
return d->colCount;
}
QSqlCachedResult::ValueCache &QSqlCachedResult::cache()
{
return d->cache;
}
QT_END_NAMESPACE
|