-#define STD_VECTOR 1
-
-#if !STD_VECTOR
-#define Array flower_vector
-#endif
-
#define HAVE_BOOST_LAMBDA 1
#include "std-vector.hh"
#define YAFFUT_MAIN
#include "yaffut.hh"
-#if !STD_VECTOR
-#define vector flower_vector
-#endif
-
-using namespace std;
+using std::vector;
template<typename T>
void
print (vector<T> v)
{
for (vsize i = 0; i < v.size (); i++)
- cout << "v[" << i << "] = " << v[i] << endl;
- cout << endl;
-}
-
-#if !STD_VECTOR
-template<typename T>
-void
-print (Link_array<T> v)
-{
- for (vsize i = 0; i < v.size (); i++)
- cout << "v[" << i << "] = " << *v[i] << endl;
- cout << endl;
+ std::cout << "v[" << i << "] = " << v[i] << std::endl;
+ std::cout << std::endl;
}
-#endif
FUNC (vector_erase)
{
v.sort (default_compare);
#else
//sort (v.begin (), v.end ());
- vector_sort (v, less<int> ());
+ vector_sort (v, std::less<int> ());
#endif
EQUAL (v[0], 0);
EQUAL (v[1], 1);
FUNC (parray_concat)
{
-#if !STD_VECTOR
- Link_array<int> u, v;
-#else
vector<int *> u, v;
-#endif
int a[5] = { 0, 1, 2, 3, 4 };
u.push_back (&a[0]);
u.push_back (&a[1]);
v.push_back (0);
v.push_back (1);
v.push_back (0);
- vector_sort (v, less<int> ());
+ vector_sort (v, std::less<int> ());
uniq (v);
EQUAL (v.size (), vsize (2));
}
v.push_back (0);
v.push_back (1);
v.push_back (2);
- vsize i = binary_search (v, 1, less<int> ());
+ vsize i = binary_search (v, 1, std::less<int> ());
EQUAL (i, vsize (1));
}