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
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
|
/****************************************************************************
**
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the test suite 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 Technology Preview License Agreement accompanying
** this package.
**
** 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.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QObject>
#include <QTest>
#include <QCache>
#include <QContiguousCache>
#include <QDebug>
#include <stdio.h>
class tst_QContiguousCache : public QObject
{
Q_OBJECT
public:
tst_QContiguousCache() {}
virtual ~tst_QContiguousCache() {}
private slots:
void empty();
void swap();
void append_data();
void append();
void prepend_data();
void prepend();
void asScrollingList();
void complexType();
void operatorAt();
void cacheBenchmark();
void contiguousCacheBenchmark();
void setCapacity();
void zeroCapacity();
};
QTEST_MAIN(tst_QContiguousCache)
void tst_QContiguousCache::empty()
{
QContiguousCache<int> c(10);
QCOMPARE(c.capacity(), 10);
QCOMPARE(c.count(), 0);
QVERIFY(c.isEmpty());
c.append(1);
QCOMPARE(c.count(), 1);
QVERIFY(!c.isEmpty());
c.clear();
QCOMPARE(c.capacity(), 10);
QCOMPARE(c.count(), 0);
QVERIFY(c.isEmpty());
c.prepend(1);
QCOMPARE(c.count(), 1);
QVERIFY(!c.isEmpty());
c.clear();
QCOMPARE(c.count(), 0);
QVERIFY(c.isEmpty());
QCOMPARE(c.capacity(), 10);
}
void tst_QContiguousCache::swap()
{
QContiguousCache<int> c1(10), c2(100);
c1.append(1);
c1.swap(c2);
QCOMPARE(c1.capacity(), 100);
QCOMPARE(c1.count(), 0 );
QCOMPARE(c2.capacity(), 10 );
QCOMPARE(c2.count(), 1 );
}
void tst_QContiguousCache::append_data()
{
QTest::addColumn<int>("start");
QTest::addColumn<int>("count");
QTest::addColumn<int>("cacheSize");
QTest::addColumn<bool>("invalidIndexes");
QTest::newRow("0+30[10]") << 0 << 30 << 10 << false;
QTest::newRow("300+30[10]") << 300 << 30 << 10 << false;
QTest::newRow("MAX-10+30[10]") << INT_MAX-10 << 30 << 10 << true;
}
void tst_QContiguousCache::append()
{
QFETCH(int, start);
QFETCH(int, count);
QFETCH(int, cacheSize);
QFETCH(bool, invalidIndexes);
int i, j;
QContiguousCache<int> c(cacheSize);
i = 1;
QCOMPARE(c.available(), cacheSize);
if (start == 0)
c.append(i++);
else
c.insert(start, i++);
while (i < count) {
c.append(i);
QCOMPARE(c.available(), qMax(0, cacheSize - i));
QCOMPARE(c.first(), qMax(1, i-cacheSize+1));
QCOMPARE(c.last(), i);
QCOMPARE(c.count(), qMin(i, cacheSize));
QCOMPARE(c.isFull(), i >= cacheSize);
i++;
}
QCOMPARE(c.areIndexesValid(), !invalidIndexes);
if (invalidIndexes)
c.normalizeIndexes();
QVERIFY(c.areIndexesValid());
// test taking from end until empty.
for (j = 0; j < cacheSize; j++, i--) {
QCOMPARE(c.takeLast(), i-1);
QCOMPARE(c.count(), cacheSize-j-1);
QCOMPARE(c.available(), j+1);
QVERIFY(!c.isFull());
QCOMPARE(c.isEmpty(), j==cacheSize-1);
}
}
void tst_QContiguousCache::prepend_data()
{
QTest::addColumn<int>("start");
QTest::addColumn<int>("count");
QTest::addColumn<int>("cacheSize");
QTest::addColumn<bool>("invalidIndexes");
QTest::newRow("30-30[10]") << 30 << 30 << 10 << false;
QTest::newRow("300-30[10]") << 300 << 30 << 10 << false;
QTest::newRow("10-30[10]") << 10 << 30 << 10 << true;
}
void tst_QContiguousCache::prepend()
{
QFETCH(int, start);
QFETCH(int, count);
QFETCH(int, cacheSize);
QFETCH(bool, invalidIndexes);
int i, j;
QContiguousCache<int> c(cacheSize);
i = 1;
QCOMPARE(c.available(), cacheSize);
c.insert(start, i++);
while(i < count) {
c.prepend(i);
QCOMPARE(c.available(), qMax(0, cacheSize - i));
QCOMPARE(c.last(), qMax(1, i-cacheSize+1));
QCOMPARE(c.first(), i);
QCOMPARE(c.count(), qMin(i, cacheSize));
QCOMPARE(c.isFull(), i >= cacheSize);
i++;
}
QCOMPARE(c.areIndexesValid(), !invalidIndexes);
if (invalidIndexes)
c.normalizeIndexes();
QVERIFY(c.areIndexesValid());
// test taking from start until empty.
for (j = 0; j < cacheSize; j++, i--) {
QCOMPARE(c.takeFirst(), i-1);
QCOMPARE(c.count(), cacheSize-j-1);
QCOMPARE(c.available(), j+1);
QVERIFY(!c.isFull());
QCOMPARE(c.isEmpty(), j==cacheSize-1);
}
}
void tst_QContiguousCache::asScrollingList()
{
int i;
QContiguousCache<int> c(10);
// Once allocated QContiguousCache should not
// allocate any additional memory for non
// complex data types.
QBENCHMARK {
// simulate scrolling in a list of items;
for(i = 0; i < 10; ++i) {
QCOMPARE(c.available(), 10-i);
c.append(i);
}
QCOMPARE(c.firstIndex(), 0);
QCOMPARE(c.lastIndex(), 9);
QCOMPARE(c.first(), 0);
QCOMPARE(c.last(), 9);
QVERIFY(!c.containsIndex(-1));
QVERIFY(!c.containsIndex(10));
QCOMPARE(c.available(), 0);
for (i = 0; i < 10; ++i) {
QVERIFY(c.containsIndex(i));
QCOMPARE(c.at(i), i);
QCOMPARE(c[i], i);
QCOMPARE(((const QContiguousCache<int>)c)[i], i);
}
for (i = 10; i < 30; ++i)
c.append(i);
QCOMPARE(c.firstIndex(), 20);
QCOMPARE(c.lastIndex(), 29);
QCOMPARE(c.first(), 20);
QCOMPARE(c.last(), 29);
QVERIFY(!c.containsIndex(19));
QVERIFY(!c.containsIndex(30));
QCOMPARE(c.available(), 0);
for (i = 20; i < 30; ++i) {
QVERIFY(c.containsIndex(i));
QCOMPARE(c.at(i), i);
QCOMPARE(c[i], i);
QCOMPARE(((const QContiguousCache<int> )c)[i], i);
}
for (i = 19; i >= 10; --i)
c.prepend(i);
QCOMPARE(c.firstIndex(), 10);
QCOMPARE(c.lastIndex(), 19);
QCOMPARE(c.first(), 10);
QCOMPARE(c.last(), 19);
QVERIFY(!c.containsIndex(9));
QVERIFY(!c.containsIndex(20));
QCOMPARE(c.available(), 0);
for (i = 10; i < 20; ++i) {
QVERIFY(c.containsIndex(i));
QCOMPARE(c.at(i), i);
QCOMPARE(c[i], i);
QCOMPARE(((const QContiguousCache<int> )c)[i], i);
}
for (i = 200; i < 220; ++i)
c.insert(i, i);
QCOMPARE(c.firstIndex(), 210);
QCOMPARE(c.lastIndex(), 219);
QCOMPARE(c.first(), 210);
QCOMPARE(c.last(), 219);
QVERIFY(!c.containsIndex(209));
QVERIFY(!c.containsIndex(300));
QCOMPARE(c.available(), 0);
for (i = 210; i < 220; ++i) {
QVERIFY(c.containsIndex(i));
QCOMPARE(c.at(i), i);
QCOMPARE(c[i], i);
QCOMPARE(((const QContiguousCache<int> )c)[i], i);
}
c.clear(); // needed to reset benchmark
}
// from a specific bug that was encountered. 100 to 299 cached, attempted to cache 250 - 205 via insert, failed.
// bug was that item at 150 would instead be item that should have been inserted at 250
c.setCapacity(200);
for(i = 100; i < 300; ++i)
c.insert(i, i);
for (i = 250; i <= 306; ++i)
c.insert(i, 1000+i);
for (i = 107; i <= 306; ++i) {
QVERIFY(c.containsIndex(i));
QCOMPARE(c.at(i), i < 250 ? i : 1000+i);
}
}
struct RefCountingClassData
{
QBasicAtomicInt ref;
static RefCountingClassData shared_null;
};
RefCountingClassData RefCountingClassData::shared_null = {
Q_BASIC_ATOMIC_INITIALIZER(1)
};
class RefCountingClass
{
public:
RefCountingClass() : d(&RefCountingClassData::shared_null) { d->ref.ref(); }
RefCountingClass(const RefCountingClass &other)
{
d = other.d;
d->ref.ref();
}
~RefCountingClass()
{
if (!d->ref.deref())
delete d;
}
RefCountingClass &operator=(const RefCountingClass &other)
{
if (!d->ref.deref())
delete d;
d = other.d;
d->ref.ref();
return *this;
}
int refCount() const { return d->ref; }
private:
RefCountingClassData *d;
};
void tst_QContiguousCache::complexType()
{
RefCountingClass original;
QContiguousCache<RefCountingClass> contiguousCache(10);
contiguousCache.append(original);
QCOMPARE(original.refCount(), 3);
contiguousCache.removeFirst();
QCOMPARE(original.refCount(), 2); // shared null, 'original'.
contiguousCache.append(original);
QCOMPARE(original.refCount(), 3);
contiguousCache.clear();
QCOMPARE(original.refCount(), 2);
for(int i = 0; i < 100; ++i)
contiguousCache.insert(i, original);
QCOMPARE(original.refCount(), 12); // shared null, 'original', + 10 in contiguousCache.
contiguousCache.clear();
QCOMPARE(original.refCount(), 2);
for (int i = 0; i < 100; i++)
contiguousCache.append(original);
QCOMPARE(original.refCount(), 12); // shared null, 'original', + 10 in contiguousCache.
contiguousCache.clear();
QCOMPARE(original.refCount(), 2);
for (int i = 0; i < 100; i++)
contiguousCache.prepend(original);
QCOMPARE(original.refCount(), 12); // shared null, 'original', + 10 in contiguousCache.
contiguousCache.clear();
QCOMPARE(original.refCount(), 2);
for (int i = 0; i < 100; i++)
contiguousCache.append(original);
contiguousCache.takeLast();
QCOMPARE(original.refCount(), 11);
contiguousCache.takeFirst();
QCOMPARE(original.refCount(), 10);
}
void tst_QContiguousCache::operatorAt()
{
RefCountingClass original;
QContiguousCache<RefCountingClass> contiguousCache(10);
for (int i = 25; i < 35; ++i)
contiguousCache[i] = original;
QCOMPARE(original.refCount(), 12); // shared null, orig, items in cache
// verify const access does not copy items.
const QContiguousCache<RefCountingClass> copy(contiguousCache);
for (int i = 25; i < 35; ++i)
QCOMPARE(copy[i].refCount(), 12);
// verify modifying the original increments ref count (e.g. does a detach)
contiguousCache[25] = original;
QCOMPARE(original.refCount(), 22);
}
/*
Benchmarks must be near identical in tasks to be fair.
QCache uses pointers to ints as its a requirement of QCache,
whereas QContiguousCache doesn't support pointers (won't free them).
Given the ability to use simple data types is a benefit, its
fair. Although this obviously must take into account we are
testing QContiguousCache use cases here, QCache has its own
areas where it is the more sensible class to use.
*/
void tst_QContiguousCache::cacheBenchmark()
{
QBENCHMARK {
QCache<int, int> cache;
cache.setMaxCost(100);
for (int i = 0; i < 1000; i++)
cache.insert(i, new int(i));
}
}
void tst_QContiguousCache::contiguousCacheBenchmark()
{
QBENCHMARK {
QContiguousCache<int> contiguousCache(100);
for (int i = 0; i < 1000; i++)
contiguousCache.insert(i, i);
}
}
void tst_QContiguousCache::setCapacity()
{
int i;
QContiguousCache<int> contiguousCache(100);
for (i = 280; i < 310; ++i)
contiguousCache.insert(i, i);
QCOMPARE(contiguousCache.capacity(), 100);
QCOMPARE(contiguousCache.count(), 30);
QCOMPARE(contiguousCache.firstIndex(), 280);
QCOMPARE(contiguousCache.lastIndex(), 309);
for (i = contiguousCache.firstIndex(); i <= contiguousCache.lastIndex(); ++i) {
QVERIFY(contiguousCache.containsIndex(i));
QCOMPARE(contiguousCache.at(i), i);
}
contiguousCache.setCapacity(150);
QCOMPARE(contiguousCache.capacity(), 150);
QCOMPARE(contiguousCache.count(), 30);
QCOMPARE(contiguousCache.firstIndex(), 280);
QCOMPARE(contiguousCache.lastIndex(), 309);
for (i = contiguousCache.firstIndex(); i <= contiguousCache.lastIndex(); ++i) {
QVERIFY(contiguousCache.containsIndex(i));
QCOMPARE(contiguousCache.at(i), i);
}
contiguousCache.setCapacity(20);
QCOMPARE(contiguousCache.capacity(), 20);
QCOMPARE(contiguousCache.count(), 20);
QCOMPARE(contiguousCache.firstIndex(), 290);
QCOMPARE(contiguousCache.lastIndex(), 309);
for (i = contiguousCache.firstIndex(); i <= contiguousCache.lastIndex(); ++i) {
QVERIFY(contiguousCache.containsIndex(i));
QCOMPARE(contiguousCache.at(i), i);
}
}
void tst_QContiguousCache::zeroCapacity()
{
QContiguousCache<int> contiguousCache;
QCOMPARE(contiguousCache.capacity(),0);
contiguousCache.setCapacity(10);
QCOMPARE(contiguousCache.capacity(),10);
contiguousCache.setCapacity(0);
QCOMPARE(contiguousCache.capacity(),0);
}
#include "tst_qcontiguouscache.moc"
|