44 lines
1,001 B
C++
44 lines
1,001 B
C++
|
// STLport regression testsuite component.
|
||
|
// To compile as a separate example, please #define MAIN.
|
||
|
|
||
|
#include <algorithm>
|
||
|
#include <iostream>
|
||
|
|
||
|
|
||
|
#ifdef MAIN
|
||
|
#define adjfind0_test main
|
||
|
#endif
|
||
|
|
||
|
#if !defined (STLPORT) || defined(__STL_USE_NAMESPACES)
|
||
|
using namespace std;
|
||
|
#endif
|
||
|
int adjfind0_test(int, char**)
|
||
|
{
|
||
|
cout<<"Results of adjfind0_test:"<<endl;
|
||
|
int numbers1 [5] = { 1, 2, 4, 8, 16 };
|
||
|
int numbers2 [5] = { 5, 3, 2, 1, 1 };
|
||
|
|
||
|
int* location = adjacent_find((int*)numbers1, (int*)numbers1 + 5);
|
||
|
|
||
|
if(location != numbers1 + 5)
|
||
|
cout
|
||
|
<< "Found adjacent pair of: "
|
||
|
<< *location
|
||
|
<< " at offset "
|
||
|
<<(location - numbers1)
|
||
|
<< endl;
|
||
|
else
|
||
|
cout << "No adjacent pairs" << endl;
|
||
|
location = adjacent_find((int*)numbers2, (int*)numbers2 + 5);
|
||
|
if(location != numbers2 + 5)
|
||
|
cout
|
||
|
<< "Found adjacent pair of: "
|
||
|
<< *location
|
||
|
<< " at offset "
|
||
|
<<(location - numbers2)
|
||
|
<< endl;
|
||
|
else
|
||
|
cout << "No adjacent pairs" << endl;
|
||
|
return 0;
|
||
|
}
|