|
31
|
1 |
|
|
|
2 |
// STLport regression testsuite component.
|
|
|
3 |
// To compile as a separate example, please #define MAIN.
|
|
|
4 |
|
|
|
5 |
#include <iostream>
|
|
|
6 |
#include <cstring>
|
|
|
7 |
#include <vector>
|
|
|
8 |
#include <algorithm>
|
|
|
9 |
#include <iterator>
|
|
|
10 |
#include <functional>
|
|
|
11 |
|
|
|
12 |
#if !defined (STLPORT) || defined(__STL_USE_NAMESPACES)
|
|
|
13 |
using namespace std;
|
|
|
14 |
#endif
|
|
|
15 |
|
|
|
16 |
#ifdef MAIN
|
|
|
17 |
#define uniqcpy2_test main
|
|
|
18 |
#endif
|
|
|
19 |
static bool str_equal(const char* a_, const char* b_)
|
|
|
20 |
{
|
|
|
21 |
return strcmp(a_, b_) == 0 ? 1 : 0;
|
|
|
22 |
}
|
|
|
23 |
|
|
|
24 |
int uniqcpy2_test(int, char**)
|
|
|
25 |
{
|
|
|
26 |
int failures=0;
|
|
|
27 |
cout<<"Results of uniqcpy2_test:"<<endl;
|
|
|
28 |
|
|
|
29 |
char* labels[] = { "Q","Q","W","W","E","E","R","T","T","Y","Y" };
|
|
|
30 |
|
|
|
31 |
const unsigned count = sizeof(labels) / sizeof(labels[0]);
|
|
|
32 |
ostream_iterator <char*> iter(cout);
|
|
|
33 |
char* arr1[12];
|
|
|
34 |
char* arr2[7];
|
|
|
35 |
|
|
|
36 |
|
|
|
37 |
copy((char**)labels, (char**)labels + count, (char**)arr1);
|
|
|
38 |
arr1[11]='\0';
|
|
|
39 |
|
|
|
40 |
|
|
|
41 |
if(strcmp("Q",arr1[0])!=0)
|
|
|
42 |
failures++;
|
|
|
43 |
else if(strcmp(arr1[1],"Q")!=0)
|
|
|
44 |
failures++;
|
|
|
45 |
else if(strcmp(arr1[2],"W")!=0)
|
|
|
46 |
failures++;
|
|
|
47 |
else if(strcmp(arr1[3],"W")!=0)
|
|
|
48 |
failures++;
|
|
|
49 |
else if(strcmp(arr1[4],"E")!=0)
|
|
|
50 |
failures++;
|
|
|
51 |
else if(strcmp(arr1[5],"E")!=0)
|
|
|
52 |
failures++;
|
|
|
53 |
else if(strcmp(arr1[6],"R")!=0)
|
|
|
54 |
failures++;
|
|
|
55 |
else if(strcmp(arr1[7],"T")!=0)
|
|
|
56 |
failures++;
|
|
|
57 |
else if(strcmp(arr1[8],"T")!=0)
|
|
|
58 |
failures++;
|
|
|
59 |
else if(strcmp(arr1[9],"Y")!=0)
|
|
|
60 |
failures++;
|
|
|
61 |
else if(strcmp(arr1[10],"Y")!=0)
|
|
|
62 |
failures++;
|
|
|
63 |
|
|
|
64 |
|
|
|
65 |
|
|
|
66 |
copy((char**)arr1,(char**)arr1 +10 ,iter);
|
|
|
67 |
|
|
|
68 |
cout << endl;
|
|
|
69 |
|
|
|
70 |
char* uCopy[count];
|
|
|
71 |
fill((char**)uCopy, (char**)uCopy + count, (char*)"");
|
|
|
72 |
unique_copy((char**)labels, (char**)labels + count, (char**)uCopy, str_equal);
|
|
|
73 |
|
|
|
74 |
copy((char**)labels, (char**)labels + count,(char**)arr1);
|
|
|
75 |
arr1[11]='\0';
|
|
|
76 |
|
|
|
77 |
if(strcmp(arr1[0],"Q")!=0)
|
|
|
78 |
failures++;
|
|
|
79 |
else if(strcmp(arr1[1],"Q")!=0)
|
|
|
80 |
failures++;
|
|
|
81 |
else if(strcmp(arr1[2],"W")!=0)
|
|
|
82 |
failures++;
|
|
|
83 |
else if(strcmp(arr1[3],"W")!=0)
|
|
|
84 |
failures++;
|
|
|
85 |
else if(strcmp(arr1[4],"E")!=0)
|
|
|
86 |
failures++;
|
|
|
87 |
else if(strcmp(arr1[5],"E")!=0)
|
|
|
88 |
failures++;
|
|
|
89 |
else if(strcmp(arr1[6],"R")!=0)
|
|
|
90 |
failures++;
|
|
|
91 |
else if(strcmp(arr1[7],"T")!=0)
|
|
|
92 |
failures++;
|
|
|
93 |
else if(strcmp(arr1[8],"T")!=0)
|
|
|
94 |
failures++;
|
|
|
95 |
else if(strcmp(arr1[9],"Y")!=0)
|
|
|
96 |
failures++;
|
|
|
97 |
else if(strcmp(arr1[10],"Y")!=0)
|
|
|
98 |
failures++;
|
|
|
99 |
|
|
|
100 |
|
|
|
101 |
|
|
|
102 |
|
|
|
103 |
copy((char**)arr1 ,(char**)arr1 + count,iter);
|
|
|
104 |
cout << endl;
|
|
|
105 |
|
|
|
106 |
copy((char**)uCopy, (char**)uCopy + count, (char**)arr2);
|
|
|
107 |
arr2[6]='\0';
|
|
|
108 |
|
|
|
109 |
if(strcmp(arr2[0],"Q")!=0)
|
|
|
110 |
failures++;
|
|
|
111 |
else if(strcmp(arr2[1],"W")!=0)
|
|
|
112 |
failures++;
|
|
|
113 |
else if(strcmp(arr2[2],"E")!=0)
|
|
|
114 |
failures++;
|
|
|
115 |
else if(strcmp(arr2[3],"R")!=0)
|
|
|
116 |
failures++;
|
|
|
117 |
else if(strcmp(arr2[4],"T")!=0)
|
|
|
118 |
failures++;
|
|
|
119 |
else if(strcmp(arr2[5],"Y")!=0)
|
|
|
120 |
failures++;
|
|
|
121 |
|
|
|
122 |
|
|
|
123 |
copy((char**)arr2 ,(char**)arr2 +6,iter);
|
|
|
124 |
cout << endl;
|
|
|
125 |
|
|
|
126 |
if(failures)
|
|
|
127 |
return 1;
|
|
|
128 |
else
|
|
|
129 |
return 0;
|
|
|
130 |
}
|
|
|
131 |
|
|
|
132 |
|