|
sl@0
|
1 |
#include <algorithm>
|
|
sl@0
|
2 |
|
|
sl@0
|
3 |
#include "cppunit/cppunit_proxy.h"
|
|
sl@0
|
4 |
|
|
sl@0
|
5 |
#if !defined (STLPORT) || defined(_STLP_USE_NAMESPACES)
|
|
sl@0
|
6 |
using namespace std;
|
|
sl@0
|
7 |
#endif
|
|
sl@0
|
8 |
|
|
sl@0
|
9 |
//
|
|
sl@0
|
10 |
// TestCase class
|
|
sl@0
|
11 |
//
|
|
sl@0
|
12 |
class BsearchTest : public CPPUNIT_NS::TestCase
|
|
sl@0
|
13 |
{
|
|
sl@0
|
14 |
CPPUNIT_TEST_SUITE(BsearchTest);
|
|
sl@0
|
15 |
CPPUNIT_TEST(bsearch1);
|
|
sl@0
|
16 |
CPPUNIT_TEST(bsearch2);
|
|
sl@0
|
17 |
CPPUNIT_TEST_SUITE_END();
|
|
sl@0
|
18 |
|
|
sl@0
|
19 |
protected:
|
|
sl@0
|
20 |
void bsearch1();
|
|
sl@0
|
21 |
void bsearch2();
|
|
sl@0
|
22 |
static bool str_compare(const char* a_, const char* b_);
|
|
sl@0
|
23 |
};
|
|
sl@0
|
24 |
|
|
sl@0
|
25 |
CPPUNIT_TEST_SUITE_REGISTRATION(BsearchTest);
|
|
sl@0
|
26 |
|
|
sl@0
|
27 |
//
|
|
sl@0
|
28 |
// tests implementation
|
|
sl@0
|
29 |
//
|
|
sl@0
|
30 |
void BsearchTest::bsearch1()
|
|
sl@0
|
31 |
{
|
|
sl@0
|
32 |
int vector[100];
|
|
sl@0
|
33 |
for(int i = 0; i < 100; i++)
|
|
sl@0
|
34 |
vector[i] = i;
|
|
sl@0
|
35 |
CPPUNIT_ASSERT(binary_search(vector, vector + 100, 42));
|
|
sl@0
|
36 |
}
|
|
sl@0
|
37 |
|
|
sl@0
|
38 |
void BsearchTest::bsearch2()
|
|
sl@0
|
39 |
{
|
|
sl@0
|
40 |
char const* labels[] = { "aa", "dd", "ff", "jj", "ss", "zz" };
|
|
sl@0
|
41 |
const unsigned count = sizeof(labels) / sizeof(labels[0]);
|
|
sl@0
|
42 |
// DEC C++ generates incorrect template instatiation code
|
|
sl@0
|
43 |
// for "ff" so must cast
|
|
sl@0
|
44 |
CPPUNIT_ASSERT(binary_search(labels, labels + count, (const char *)"ff", str_compare));
|
|
sl@0
|
45 |
}
|
|
sl@0
|
46 |
bool BsearchTest::str_compare(const char* a_, const char* b_)
|
|
sl@0
|
47 |
{
|
|
sl@0
|
48 |
return strcmp(a_, b_) < 0 ? 1 : 0;
|
|
sl@0
|
49 |
}
|