|
1 /* |
|
2 * Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies). |
|
3 * All rights reserved. |
|
4 * This component and the accompanying materials are made available |
|
5 * under the terms of "Eclipse Public License v1.0" |
|
6 * which accompanies this distribution, and is available |
|
7 * at the URL "http://www.eclipse.org/legal/epl-v10.html". |
|
8 * |
|
9 * Initial Contributors: |
|
10 * Nokia Corporation - initial contribution. |
|
11 * |
|
12 * Contributors: |
|
13 * |
|
14 * Description: |
|
15 * |
|
16 */ |
|
17 |
|
18 // STLport regression testsuite component. |
|
19 // To compile as a separate example, please #define MAIN. |
|
20 #include <iterator> |
|
21 |
|
22 #include <algorithm> |
|
23 #include <vector> |
|
24 #include <iostream> |
|
25 #include <iterator> |
|
26 // #include <functional> |
|
27 #include <numeric> |
|
28 |
|
29 #ifdef MAIN |
|
30 #define prevprm1_test main |
|
31 #endif |
|
32 |
|
33 #if !defined (STLPORT) || defined(__STL_USE_NAMESPACES) |
|
34 using namespace std; |
|
35 #endif |
|
36 int prevprm1_test(int, char**) |
|
37 { |
|
38 int failures=0; |
|
39 cout<<"Results of prevprm1_test:"<<endl; |
|
40 vector <int> v1(3); |
|
41 iota(v1.begin(), v1.end(), 0); |
|
42 |
|
43 ostream_iterator<int> iter(cout, " "); |
|
44 copy(v1.begin(), v1.end(), iter); |
|
45 cout << endl; |
|
46 |
|
47 if(0!=v1[0]) |
|
48 failures++; |
|
49 else if(1 !=v1[1]) |
|
50 failures++; |
|
51 else if(2!=v1[2]) |
|
52 failures++; |
|
53 |
|
54 |
|
55 for(int i = 0; i < 9; i++) |
|
56 { |
|
57 prev_permutation(v1.begin(), v1.end()); |
|
58 copy(v1.begin(), v1.end(), iter); |
|
59 switch(i) |
|
60 { |
|
61 case 0: if(2 !=v1[0]) |
|
62 failures++; |
|
63 else if(1 !=v1[1]) |
|
64 failures++; |
|
65 else if(0 !=v1[2]) |
|
66 failures++; |
|
67 break; |
|
68 case 1: if(2 !=v1[0]) |
|
69 failures++; |
|
70 else if(0 !=v1[1]) |
|
71 failures++; |
|
72 else if(1 !=v1[2]) |
|
73 failures++; |
|
74 break; |
|
75 case 2: if(1 !=v1[0]) |
|
76 failures++; |
|
77 else if(2 !=v1[1]) |
|
78 failures++; |
|
79 else if(0 !=v1[2]) |
|
80 failures++; |
|
81 break; |
|
82 case 3: if(1 !=v1[0]) |
|
83 failures++; |
|
84 else if(0 !=v1[1]) |
|
85 failures++; |
|
86 else if(2 !=v1[2]) |
|
87 failures++; |
|
88 break; |
|
89 case 4: if(0 !=v1[0]) |
|
90 failures++; |
|
91 else if(2 !=v1[1]) |
|
92 failures++; |
|
93 else if(1 !=v1[2]) |
|
94 failures++; |
|
95 break; |
|
96 |
|
97 case 5: if(0 !=v1[0]) |
|
98 failures++; |
|
99 else if(1 !=v1[1]) |
|
100 failures++; |
|
101 else if(2 !=v1[2]) |
|
102 failures++; |
|
103 break; |
|
104 |
|
105 case 6: if(2 !=v1[0]) |
|
106 failures++; |
|
107 else if(1 !=v1[1]) |
|
108 failures++; |
|
109 else if(0 !=v1[2]) |
|
110 failures++; |
|
111 break; |
|
112 |
|
113 case 7: if(2 !=v1[0]) |
|
114 failures++; |
|
115 else if(0 !=v1[1]) |
|
116 failures++; |
|
117 else if(1 !=v1[2]) |
|
118 failures++; |
|
119 break; |
|
120 |
|
121 case 8: if(1 !=v1[0]) |
|
122 failures++; |
|
123 else if(2 !=v1[1]) |
|
124 failures++; |
|
125 else if(0 !=v1[2]) |
|
126 failures++; |
|
127 break; |
|
128 |
|
129 } |
|
130 cout << endl; |
|
131 } |
|
132 |
|
133 if(failures) |
|
134 return 1; |
|
135 else |
|
136 return 0; |
|
137 } |
|
138 |