using namespace std;
using boost::unit_test::test_suite;
+using namespace boost::unit_test;
template<typename T>
void
#if VECTOR_SORT
v.sort (default_compare);
#else
- vector_sort (v, default_compare);
+ //sort (v.begin (), v.end ());
+ vector_sort (v, less<int> ());
#endif
BOOST_CHECK_EQUAL (v[0], 0);
BOOST_CHECK_EQUAL (v[1], 1);
v.push_back (0);
v.push_back (1);
v.push_back (0);
- vector_sort (v, default_compare);
+ vector_sort (v, less<int> ());
uniq (v);
BOOST_CHECK_EQUAL (v.size (), vsize (2));
}
v.push_back (0);
v.push_back (1);
v.push_back (2);
- vsize i = binary_search (v, 1, &default_compare);
+ vsize i = binary_search (v, 1, less<int> ());
BOOST_CHECK_EQUAL (i, vsize (1));
}
void mingw_slashify ();
void file_find ();
+#include <boost/test/results_reporter.hpp>
+#include <boost/test/framework.hpp>
+#include <boost/test/detail/unit_test_parameters.hpp>
+
test_suite*
init_unit_test_suite (int, char**)
{
vsize i = 0;
vsize j = 0;
vector<int> v;
- binary_search_bounds (v, 1, &default_compare, &i, &j);
+ binary_search (v, 1, less<int> (), i, j);
//binary_search_bounds (v, 1, &default_compare, 0, 0);
//Link_array<char> w;
vector<char*> w;
- binary_search_bounds (w, (char*)1, &default_compare, &i, &j);
+ binary_search (w, (char*)1, less<char*> (), i, j);
test_suite *test = BOOST_TEST_SUITE("Flower");
+
+
test->add (BOOST_TEST_CASE (vector_erase));
test->add (BOOST_TEST_CASE (vector_slice));
test->add (BOOST_TEST_CASE (vector_sorting));
test->add (BOOST_TEST_CASE (vector_search));
test->add (BOOST_TEST_CASE (mingw_slashify));
test->add (BOOST_TEST_CASE (file_find));
+
return test;
}