blob: ec9e660ea1e9c7430b457ff461611b2d6933370f (
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
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
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** 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 <QtTest/QtTest>
#include <qqueue.h>
class tst_QQueue : public QObject
{
Q_OBJECT
private slots:
void enqueue_dequeue_data();
void enqueue_dequeue();
};
void tst_QQueue::enqueue_dequeue_data()
{
QTest::addColumn<int>("num_items");
QTest::newRow("1") << 11;
QTest::newRow("2") << 211;
QTest::newRow("3") << 1024 + 211;
}
void tst_QQueue::enqueue_dequeue()
{
QFETCH(int, num_items);
int *values = new int[num_items];
QQueue<int> queue_v;
QQueue<int*> queue_p;
QVERIFY(queue_v.empty());
QVERIFY(queue_p.empty());
for (int i = 0; i < num_items; i++ ) {
values[i] = i;
queue_p.enqueue(values + i);
queue_v.enqueue(values[i]);
}
QVERIFY(!queue_p.empty());
QVERIFY(!queue_v.empty());
for (int i = 0; i < num_items; i++ ) {
int v, *p;
v = queue_v.head();
p = queue_p.head();
QCOMPARE(*p, v);
QCOMPARE(v, i);
v = queue_v.dequeue();
p = queue_p.dequeue();
QCOMPARE(*p, v);
QCOMPARE(v, values[i]);
}
QVERIFY(queue_v.empty());
QVERIFY(queue_p.empty());
delete[] values;
}
QTEST_APPLESS_MAIN(tst_QQueue)
#include "tst_qqueue.moc"
|
