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