equal
deleted
inserted
replaced
|
1 |
|
2 // STLport regression testsuite component. |
|
3 // To compile as a separate example, please #define MAIN. |
|
4 |
|
5 #include <iostream> |
|
6 #include <algorithm> |
|
7 #include <deque> |
|
8 #include <queue> |
|
9 |
|
10 #ifdef MAIN |
|
11 #define pqueue1_test main |
|
12 #endif |
|
13 |
|
14 #if !defined (STLPORT) || defined(__STL_USE_NAMESPACES) |
|
15 using namespace std; |
|
16 #endif |
|
17 int pqueue1_test(int, char**) |
|
18 { |
|
19 int failures=0,i=0; |
|
20 int arr[3]; |
|
21 cout<<"Results of pqueue1_test:"<<endl; |
|
22 priority_queue<int, deque<int>, less<int> > q; |
|
23 q.push(42); |
|
24 q.push(101); |
|
25 q.push(69); |
|
26 while(!q.empty()) |
|
27 { |
|
28 arr[i]=q.top(); |
|
29 cout << q.top() << endl; |
|
30 q.pop(); |
|
31 i++; |
|
32 } |
|
33 |
|
34 if(101 !=arr[0]) |
|
35 failures++; |
|
36 else if(69 !=arr[1]) |
|
37 failures++; |
|
38 else if(42 !=arr[2]) |
|
39 failures++; |
|
40 |
|
41 if(failures) |
|
42 return 1; |
|
43 else |
|
44 return 0; |
|
45 } |