|
31
|
1 |
|
|
|
2 |
// STLport regression testsuite component.
|
|
|
3 |
// To compile as a separate example, please #define MAIN.
|
|
|
4 |
|
|
|
5 |
#include <iostream>
|
|
|
6 |
#include <list>
|
|
|
7 |
|
|
|
8 |
#ifdef MAIN
|
|
|
9 |
#define list3_test main
|
|
|
10 |
#endif
|
|
|
11 |
|
|
|
12 |
#if !defined (STLPORT) || defined(__STL_USE_NAMESPACES)
|
|
|
13 |
using namespace std;
|
|
|
14 |
#endif
|
|
|
15 |
int list3_test(int, char**)
|
|
|
16 |
{
|
|
|
17 |
cout<<"Results of list3_test:"<<endl;
|
|
|
18 |
char array [] = { 'x', 'l', 'x', 't', 's', 's' };
|
|
|
19 |
char array1[7];
|
|
|
20 |
//char array2[] = {'s','s','t','x','l','x'};
|
|
|
21 |
//char array3[] = {'s','s','t','l'};
|
|
|
22 |
//char array4[] = {'s','t','l'};
|
|
|
23 |
//char array5[] = {'l','s','t'};
|
|
|
24 |
|
|
|
25 |
int a =0,failures = 0;
|
|
|
26 |
|
|
|
27 |
list<char> str(array, array + 6);
|
|
|
28 |
std::list<char>::iterator i;
|
|
|
29 |
cout << "original: ";
|
|
|
30 |
for(i = str.begin(); i != str.end(); i++)
|
|
|
31 |
{
|
|
|
32 |
array1[a++]=*i;
|
|
|
33 |
cout << *i;
|
|
|
34 |
}
|
|
|
35 |
|
|
|
36 |
array1[a] = '\0';
|
|
|
37 |
cout << endl;
|
|
|
38 |
|
|
|
39 |
if(array1[0] != 'x')
|
|
|
40 |
failures++;
|
|
|
41 |
if(array1[1] != 'l')
|
|
|
42 |
failures++;
|
|
|
43 |
if(array1[2] != 'x')
|
|
|
44 |
failures++;
|
|
|
45 |
if(array1[3] != 't')
|
|
|
46 |
failures++;
|
|
|
47 |
if(array1[4] != 's')
|
|
|
48 |
failures++;
|
|
|
49 |
if(array1[5] != 's')
|
|
|
50 |
failures++;
|
|
|
51 |
|
|
|
52 |
|
|
|
53 |
a=0;
|
|
|
54 |
cout << "reversed: ";
|
|
|
55 |
str.reverse();
|
|
|
56 |
for(i = str.begin(); i != str.end(); i++)
|
|
|
57 |
{
|
|
|
58 |
array1[a++]=*i;
|
|
|
59 |
cout << *i;
|
|
|
60 |
}
|
|
|
61 |
array1[a] = '\0';
|
|
|
62 |
cout << endl;
|
|
|
63 |
if(array1[0] != 's')
|
|
|
64 |
failures++;
|
|
|
65 |
if(array1[1] != 's')
|
|
|
66 |
failures++;
|
|
|
67 |
if(array1[2] != 't')
|
|
|
68 |
failures++;
|
|
|
69 |
if(array1[3] != 'x')
|
|
|
70 |
failures++;
|
|
|
71 |
if(array1[4] != 'l')
|
|
|
72 |
failures++;
|
|
|
73 |
if(array1[5] != 'x')
|
|
|
74 |
failures++;
|
|
|
75 |
|
|
|
76 |
a=0;
|
|
|
77 |
cout << "removed: ";
|
|
|
78 |
str.remove('x');
|
|
|
79 |
for(i = str.begin(); i != str.end(); i++)
|
|
|
80 |
{
|
|
|
81 |
array1[a++]=*i;
|
|
|
82 |
cout << *i;
|
|
|
83 |
}
|
|
|
84 |
array1[a] = '\0';
|
|
|
85 |
cout << endl;
|
|
|
86 |
if(array1[0] != 's')
|
|
|
87 |
failures++;
|
|
|
88 |
if(array1[1] != 's')
|
|
|
89 |
failures++;
|
|
|
90 |
if(array1[2] != 't')
|
|
|
91 |
failures++;
|
|
|
92 |
if(array1[3] != 'l')
|
|
|
93 |
failures++;
|
|
|
94 |
|
|
|
95 |
a=0;
|
|
|
96 |
cout << "uniqued: ";
|
|
|
97 |
str.unique();
|
|
|
98 |
for(i = str.begin(); i != str.end(); i++)
|
|
|
99 |
{
|
|
|
100 |
array1[a++]=*i;
|
|
|
101 |
cout << *i;
|
|
|
102 |
}
|
|
|
103 |
array1[a] = '\0';
|
|
|
104 |
cout << endl;
|
|
|
105 |
if(array1[0] != 's')
|
|
|
106 |
failures++;
|
|
|
107 |
if(array1[1] != 't')
|
|
|
108 |
failures++;
|
|
|
109 |
if(array1[2] != 'l')
|
|
|
110 |
failures++;
|
|
|
111 |
|
|
|
112 |
a=0;
|
|
|
113 |
cout << "sorted: ";
|
|
|
114 |
str.sort();
|
|
|
115 |
for(i = str.begin(); i != str.end(); i++)
|
|
|
116 |
{
|
|
|
117 |
array1[a++]=*i;
|
|
|
118 |
cout << *i;
|
|
|
119 |
}
|
|
|
120 |
array1[a] = '\0';
|
|
|
121 |
cout << endl;
|
|
|
122 |
if(array1[0] != 'l')
|
|
|
123 |
failures++;
|
|
|
124 |
if(array1[1] != 's')
|
|
|
125 |
failures++;
|
|
|
126 |
if(array1[2] != 't')
|
|
|
127 |
failures++;
|
|
|
128 |
|
|
|
129 |
return failures;
|
|
|
130 |
}
|