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
|
/****************************************************************************
**
** Implementation of cached TQt SQL result classes
**
**
** Copyright (C) 1992-2008 Trolltech ASA. All rights reserved.
**
** This file is part of the sql module of the TQt GUI Toolkit.
**
** This file may be used under the terms of the GNU General
** Public License versions 2.0 or 3.0 as published by the Free
** Software Foundation and appearing in the files LICENSE.GPL2
** and LICENSE.GPL3 included in the packaging of this file.
** Alternatively you may (at your option) use any later version
** of the GNU General Public License if such license has been
** publicly approved by Trolltech ASA (or its successors, if any)
** and the KDE Free TQt Foundation.
**
** Please review the following information to ensure GNU General
** Public Licensing requirements will be met:
** http://trolltech.com/products/qt/licenses/licensing/opensource/.
** If you are unsure which license is appropriate for your use, please
** review the following information:
** http://trolltech.com/products/qt/licenses/licensing/licensingoverview
** or contact the sales department at sales@trolltech.com.
**
** This file may be used under the terms of the Q Public License as
** defined by Trolltech ASA and appearing in the file LICENSE.TQPL
** included in the packaging of this file. Licensees holding valid TQt
** Commercial licenses may use this file in accordance with the TQt
** Commercial License Agreement provided with the Software.
**
** This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
** INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
** A PARTICULAR PURPOSE. Trolltech reserves all rights not granted
** herein.
**
**********************************************************************/
#include "qsqlcachedresult.h"
#include <ntqdatetime.h>
#ifndef TQT_NO_SQL
static const uint initial_cache_size = 128;
class TQtSqlCachedResultPrivate
{
public:
TQtSqlCachedResultPrivate();
bool seek(int i);
void init(int count, bool fo);
void cleanup();
TQtSqlCachedResult::RowCache* next();
void revertLast();
TQtSqlCachedResult::RowsetCache *cache;
TQtSqlCachedResult::RowCache *current;
int rowCacheEnd;
int colCount;
bool forwardOnly;
};
TQtSqlCachedResultPrivate::TQtSqlCachedResultPrivate():
cache(0), current(0), rowCacheEnd(0), colCount(0), forwardOnly(FALSE)
{
}
void TQtSqlCachedResultPrivate::cleanup()
{
if (cache) {
for (int i = 0; i < rowCacheEnd; ++i)
delete (*cache)[i];
delete cache;
cache = 0;
}
if (forwardOnly)
delete current;
current = 0;
forwardOnly = FALSE;
colCount = 0;
rowCacheEnd = 0;
}
void TQtSqlCachedResultPrivate::init(int count, bool fo)
{
cleanup();
forwardOnly = fo;
colCount = count;
if (fo)
current = new TQtSqlCachedResult::RowCache(count);
else
cache = new TQtSqlCachedResult::RowsetCache(initial_cache_size);
}
TQtSqlCachedResult::RowCache *TQtSqlCachedResultPrivate::next()
{
if (forwardOnly)
return current;
Q_ASSERT(cache);
current = new TQtSqlCachedResult::RowCache(colCount);
if (rowCacheEnd == (int)cache->size())
cache->resize(cache->size() * 2);
cache->insert(rowCacheEnd++, current);
return current;
}
bool TQtSqlCachedResultPrivate::seek(int i)
{
if (forwardOnly || i < 0)
return FALSE;
if (i >= rowCacheEnd)
return FALSE;
current = (*cache)[i];
return TRUE;
}
void TQtSqlCachedResultPrivate::revertLast()
{
if (forwardOnly)
return;
--rowCacheEnd;
delete current;
current = 0;
}
//////////////
TQtSqlCachedResult::TQtSqlCachedResult(const TQSqlDriver * db ): TQSqlResult ( db )
{
d = new TQtSqlCachedResultPrivate();
}
TQtSqlCachedResult::~TQtSqlCachedResult()
{
delete d;
}
void TQtSqlCachedResult::init(int colCount)
{
d->init(colCount, isForwardOnly());
}
bool TQtSqlCachedResult::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() == TQSql::AfterLast)
return FALSE;
while(at() < i - 1) {
if (!gotoNext(0))
return FALSE;
setAt(at() + 1);
}
if (!gotoNext(d->current))
return FALSE;
setAt(at() + 1);
return TRUE;
}
if (d->seek(i)) {
setAt(i);
return TRUE;
}
setAt(d->rowCacheEnd - 1);
while (at() < i) {
if (!cacheNext())
return FALSE;
}
return TRUE;
}
bool TQtSqlCachedResult::fetchNext()
{
if (d->seek(at() + 1)) {
setAt(at() + 1);
return TRUE;
}
return cacheNext();
}
bool TQtSqlCachedResult::fetchPrev()
{
return fetch(at() - 1);
}
bool TQtSqlCachedResult::fetchFirst()
{
if (d->forwardOnly && at() != TQSql::BeforeFirst) {
return FALSE;
}
if (d->seek(0)) {
setAt(0);
return TRUE;
}
return cacheNext();
}
bool TQtSqlCachedResult::fetchLast()
{
if (at() == TQSql::AfterLast) {
if (d->forwardOnly)
return FALSE;
else
return fetch(d->rowCacheEnd - 1);
}
int i = at();
while (fetchNext())
i++; /* brute force */
if (d->forwardOnly && at() == TQSql::AfterLast) {
setAt(i);
return TRUE;
} else {
return fetch(d->rowCacheEnd - 1);
}
}
TQVariant TQtSqlCachedResult::data(int i)
{
if (!d->current || i >= (int)d->current->size() || i < 0)
return TQVariant();
return (*d->current)[i];
}
bool TQtSqlCachedResult::isNull(int i)
{
if (!d->current || i >= (int)d->current->size() || i < 0)
return TRUE;
return (*d->current)[i].isNull();
}
void TQtSqlCachedResult::cleanup()
{
setAt(TQSql::BeforeFirst);
setActive(FALSE);
d->cleanup();
}
bool TQtSqlCachedResult::cacheNext()
{
if (!gotoNext(d->next())) {
d->revertLast();
return FALSE;
}
setAt(at() + 1);
return TRUE;
}
int TQtSqlCachedResult::colCount() const
{
return d->colCount;
}
#endif // TQT_NO_SQL
|