|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 ** |
|
7 ** This file is part of the test suite of the Qt Toolkit. |
|
8 ** |
|
9 ** $QT_BEGIN_LICENSE:LGPL$ |
|
10 ** No Commercial Usage |
|
11 ** This file contains pre-release code and may not be distributed. |
|
12 ** You may use this file in accordance with the terms and conditions |
|
13 ** contained in the Technology Preview License Agreement accompanying |
|
14 ** this package. |
|
15 ** |
|
16 ** GNU Lesser General Public License Usage |
|
17 ** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 ** General Public License version 2.1 as published by the Free Software |
|
19 ** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 ** packaging of this file. Please review the following information to |
|
21 ** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 ** |
|
24 ** In addition, as a special exception, Nokia gives you certain additional |
|
25 ** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 ** |
|
28 ** If you have questions regarding the use of this file, please contact |
|
29 ** Nokia at qt-info@nokia.com. |
|
30 ** |
|
31 ** |
|
32 ** |
|
33 ** |
|
34 ** |
|
35 ** |
|
36 ** |
|
37 ** |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 |
|
42 |
|
43 #include <QtTest/QtTest> |
|
44 #include <qqueue.h> |
|
45 |
|
46 class tst_QQueue : public QObject |
|
47 { |
|
48 Q_OBJECT |
|
49 |
|
50 private slots: |
|
51 void enqueue_dequeue_data(); |
|
52 void enqueue_dequeue(); |
|
53 }; |
|
54 |
|
55 void tst_QQueue::enqueue_dequeue_data() |
|
56 { |
|
57 QTest::addColumn<int>("num_items"); |
|
58 |
|
59 QTest::newRow("1") << 11; |
|
60 QTest::newRow("2") << 211; |
|
61 QTest::newRow("3") << 1024 + 211; |
|
62 } |
|
63 |
|
64 void tst_QQueue::enqueue_dequeue() |
|
65 { |
|
66 QFETCH(int, num_items); |
|
67 |
|
68 int *values = new int[num_items]; |
|
69 QQueue<int> queue_v; |
|
70 QQueue<int*> queue_p; |
|
71 |
|
72 QVERIFY(queue_v.empty()); |
|
73 QVERIFY(queue_p.empty()); |
|
74 |
|
75 for (int i = 0; i < num_items; i++ ) { |
|
76 values[i] = i; |
|
77 queue_p.enqueue(values + i); |
|
78 queue_v.enqueue(values[i]); |
|
79 } |
|
80 QVERIFY(!queue_p.empty()); |
|
81 QVERIFY(!queue_v.empty()); |
|
82 for (int i = 0; i < num_items; i++ ) { |
|
83 int v, *p; |
|
84 v = queue_v.head(); |
|
85 p = queue_p.head(); |
|
86 QCOMPARE(*p, v); |
|
87 QCOMPARE(v, i); |
|
88 v = queue_v.dequeue(); |
|
89 p = queue_p.dequeue(); |
|
90 QCOMPARE(*p, v); |
|
91 QCOMPARE(v, values[i]); |
|
92 } |
|
93 QVERIFY(queue_v.empty()); |
|
94 QVERIFY(queue_p.empty()); |
|
95 |
|
96 delete[] values; |
|
97 } |
|
98 |
|
99 QTEST_APPLESS_MAIN(tst_QQueue) |
|
100 #include "tst_qqueue.moc" |