|
sl@0
|
1 |
// Copyright (c) 2008-2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
sl@0
|
2 |
// All rights reserved.
|
|
sl@0
|
3 |
// This component and the accompanying materials are made available
|
|
sl@0
|
4 |
// under the terms of "Eclipse Public License v1.0"
|
|
sl@0
|
5 |
// which accompanies this distribution, and is available
|
|
sl@0
|
6 |
// at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
sl@0
|
7 |
//
|
|
sl@0
|
8 |
// Initial Contributors:
|
|
sl@0
|
9 |
// Nokia Corporation - initial contribution.
|
|
sl@0
|
10 |
//
|
|
sl@0
|
11 |
// Contributors:
|
|
sl@0
|
12 |
//
|
|
sl@0
|
13 |
// Description:
|
|
sl@0
|
14 |
//
|
|
sl@0
|
15 |
|
|
sl@0
|
16 |
#include <vector>
|
|
sl@0
|
17 |
#include <algorithm>
|
|
sl@0
|
18 |
#include <list>
|
|
sl@0
|
19 |
#include <deque>
|
|
sl@0
|
20 |
#include <queue>
|
|
sl@0
|
21 |
#include <e32std.h>
|
|
sl@0
|
22 |
|
|
sl@0
|
23 |
#include "cppunit/cppunit_proxy.h"
|
|
sl@0
|
24 |
|
|
sl@0
|
25 |
#if !defined (STLPORT) || defined(_STLP_USE_NAMESPACES)
|
|
sl@0
|
26 |
using namespace std;
|
|
sl@0
|
27 |
#endif
|
|
sl@0
|
28 |
|
|
sl@0
|
29 |
//
|
|
sl@0
|
30 |
// TestCase class
|
|
sl@0
|
31 |
//
|
|
sl@0
|
32 |
class QueueTest : public CPPUNIT_NS::TestCase
|
|
sl@0
|
33 |
{
|
|
sl@0
|
34 |
CPPUNIT_TEST_SUITE(QueueTest);
|
|
sl@0
|
35 |
CPPUNIT_TEST(pqueue1);
|
|
sl@0
|
36 |
CPPUNIT_TEST(queue1);
|
|
sl@0
|
37 |
CPPUNIT_TEST(queue_cov);
|
|
sl@0
|
38 |
CPPUNIT_TEST(pqueue_cov1);
|
|
sl@0
|
39 |
CPPUNIT_TEST(pqueue_cov2);
|
|
sl@0
|
40 |
CPPUNIT_TEST_SUITE_END();
|
|
sl@0
|
41 |
|
|
sl@0
|
42 |
protected:
|
|
sl@0
|
43 |
void pqueue1();
|
|
sl@0
|
44 |
void queue1();
|
|
sl@0
|
45 |
void queue_cov();
|
|
sl@0
|
46 |
void pqueue_cov1();
|
|
sl@0
|
47 |
void pqueue_cov2();
|
|
sl@0
|
48 |
};
|
|
sl@0
|
49 |
|
|
sl@0
|
50 |
CPPUNIT_TEST_SUITE_REGISTRATION(QueueTest);
|
|
sl@0
|
51 |
|
|
sl@0
|
52 |
//
|
|
sl@0
|
53 |
// tests implementation
|
|
sl@0
|
54 |
//
|
|
sl@0
|
55 |
void QueueTest::pqueue1()
|
|
sl@0
|
56 |
{
|
|
sl@0
|
57 |
priority_queue<int, deque<int>, less<int> > q;
|
|
sl@0
|
58 |
q.push(42);
|
|
sl@0
|
59 |
q.push(101);
|
|
sl@0
|
60 |
q.push(69);
|
|
sl@0
|
61 |
|
|
sl@0
|
62 |
CPPUNIT_ASSERT( q.top()==101 );
|
|
sl@0
|
63 |
q.pop();
|
|
sl@0
|
64 |
CPPUNIT_ASSERT( q.top()==69 );
|
|
sl@0
|
65 |
q.pop();
|
|
sl@0
|
66 |
CPPUNIT_ASSERT( q.top()==42 );
|
|
sl@0
|
67 |
q.pop();
|
|
sl@0
|
68 |
|
|
sl@0
|
69 |
CPPUNIT_ASSERT(q.empty());
|
|
sl@0
|
70 |
}
|
|
sl@0
|
71 |
void QueueTest::queue1()
|
|
sl@0
|
72 |
{
|
|
sl@0
|
73 |
queue<int, list<int> > q;
|
|
sl@0
|
74 |
q.push(42);
|
|
sl@0
|
75 |
q.push(101);
|
|
sl@0
|
76 |
q.push(69);
|
|
sl@0
|
77 |
|
|
sl@0
|
78 |
CPPUNIT_ASSERT( q.front()==42 );
|
|
sl@0
|
79 |
q.pop();
|
|
sl@0
|
80 |
CPPUNIT_ASSERT( q.front()==101 );
|
|
sl@0
|
81 |
q.pop();
|
|
sl@0
|
82 |
CPPUNIT_ASSERT( q.front()==69 );
|
|
sl@0
|
83 |
q.pop();
|
|
sl@0
|
84 |
|
|
sl@0
|
85 |
CPPUNIT_ASSERT(q.empty());
|
|
sl@0
|
86 |
}
|
|
sl@0
|
87 |
void QueueTest::queue_cov()
|
|
sl@0
|
88 |
{
|
|
sl@0
|
89 |
__UHEAP_MARK;
|
|
sl@0
|
90 |
{
|
|
sl@0
|
91 |
queue<int, list<int> > q;
|
|
sl@0
|
92 |
q.push(42);
|
|
sl@0
|
93 |
q.push(101);
|
|
sl@0
|
94 |
q.push(69);
|
|
sl@0
|
95 |
|
|
sl@0
|
96 |
CPPUNIT_ASSERT( q.size()==3 );
|
|
sl@0
|
97 |
q.pop();
|
|
sl@0
|
98 |
CPPUNIT_ASSERT( q.size()==2 );
|
|
sl@0
|
99 |
q.pop();
|
|
sl@0
|
100 |
CPPUNIT_ASSERT( q.size()==1 );
|
|
sl@0
|
101 |
q.pop();
|
|
sl@0
|
102 |
|
|
sl@0
|
103 |
CPPUNIT_ASSERT(q.empty());
|
|
sl@0
|
104 |
}
|
|
sl@0
|
105 |
{
|
|
sl@0
|
106 |
queue<int, list<int> > q;
|
|
sl@0
|
107 |
q.push(42);
|
|
sl@0
|
108 |
q.push(101);
|
|
sl@0
|
109 |
q.push(69);
|
|
sl@0
|
110 |
CPPUNIT_ASSERT(q.back() == 69);
|
|
sl@0
|
111 |
}
|
|
sl@0
|
112 |
{
|
|
sl@0
|
113 |
queue<int> myqueue;
|
|
sl@0
|
114 |
queue<int> const& cv = myqueue;
|
|
sl@0
|
115 |
myqueue.push(77);
|
|
sl@0
|
116 |
myqueue.push(16);
|
|
sl@0
|
117 |
CPPUNIT_ASSERT(cv.front() == 77);
|
|
sl@0
|
118 |
CPPUNIT_ASSERT(cv.back() == 16);
|
|
sl@0
|
119 |
}
|
|
sl@0
|
120 |
__UHEAP_MARKEND;
|
|
sl@0
|
121 |
}
|
|
sl@0
|
122 |
void QueueTest::pqueue_cov1()
|
|
sl@0
|
123 |
{
|
|
sl@0
|
124 |
__UHEAP_MARK;
|
|
sl@0
|
125 |
{
|
|
sl@0
|
126 |
priority_queue<int> pq;
|
|
sl@0
|
127 |
pq.push(42);
|
|
sl@0
|
128 |
pq.push(101);
|
|
sl@0
|
129 |
pq.push(69);
|
|
sl@0
|
130 |
|
|
sl@0
|
131 |
CPPUNIT_ASSERT( pq.size()==3 );
|
|
sl@0
|
132 |
pq.pop();
|
|
sl@0
|
133 |
CPPUNIT_ASSERT( pq.size()==2 );
|
|
sl@0
|
134 |
pq.pop();
|
|
sl@0
|
135 |
CPPUNIT_ASSERT( pq.size()==1 );
|
|
sl@0
|
136 |
pq.pop();
|
|
sl@0
|
137 |
CPPUNIT_ASSERT(pq.empty());
|
|
sl@0
|
138 |
}
|
|
sl@0
|
139 |
{
|
|
sl@0
|
140 |
queue<int> myqueue;
|
|
sl@0
|
141 |
queue<int> myqueue1;
|
|
sl@0
|
142 |
bool flag;
|
|
sl@0
|
143 |
|
|
sl@0
|
144 |
myqueue.push(77);
|
|
sl@0
|
145 |
myqueue.push(16);
|
|
sl@0
|
146 |
myqueue1.push(77);
|
|
sl@0
|
147 |
myqueue1.push(17);
|
|
sl@0
|
148 |
flag = myqueue < myqueue1;
|
|
sl@0
|
149 |
CPPUNIT_ASSERT(flag == true);
|
|
sl@0
|
150 |
}
|
|
sl@0
|
151 |
{
|
|
sl@0
|
152 |
queue<int> myqueue;
|
|
sl@0
|
153 |
queue<int> myqueue1;
|
|
sl@0
|
154 |
bool flag;
|
|
sl@0
|
155 |
|
|
sl@0
|
156 |
myqueue.push(77);
|
|
sl@0
|
157 |
myqueue.push(16);
|
|
sl@0
|
158 |
myqueue1.push(77);
|
|
sl@0
|
159 |
myqueue1.push(16);
|
|
sl@0
|
160 |
flag = (myqueue == myqueue1);
|
|
sl@0
|
161 |
CPPUNIT_ASSERT(flag == true);
|
|
sl@0
|
162 |
}
|
|
sl@0
|
163 |
__UHEAP_MARKEND;
|
|
sl@0
|
164 |
}
|
|
sl@0
|
165 |
void QueueTest::pqueue_cov2()
|
|
sl@0
|
166 |
{
|
|
sl@0
|
167 |
__UHEAP_MARK;
|
|
sl@0
|
168 |
int myints[]= {10,60,50,20};
|
|
sl@0
|
169 |
priority_queue<int> first;
|
|
sl@0
|
170 |
priority_queue<int> second (myints,myints+3);
|
|
sl@0
|
171 |
priority_queue< int, vector<int>, greater<int> > third (myints,myints+3);
|
|
sl@0
|
172 |
CPPUNIT_ASSERT(first.empty() == true);
|
|
sl@0
|
173 |
CPPUNIT_ASSERT(second.size() == 3);
|
|
sl@0
|
174 |
CPPUNIT_ASSERT(third.top() == 10);
|
|
sl@0
|
175 |
third.pop();
|
|
sl@0
|
176 |
CPPUNIT_ASSERT(third.top() == 50);
|
|
sl@0
|
177 |
third.pop();
|
|
sl@0
|
178 |
CPPUNIT_ASSERT(third.top() == 60);
|
|
sl@0
|
179 |
__UHEAP_MARKEND;
|
|
sl@0
|
180 |
}
|