-#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;
template<typename T>
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;
-}
-#endif
-
FUNC (vector_erase)
{
vector<int> v;
EQUAL (vector<int> (v.begin (), v.begin ()).size (), vsize (0));
EQUAL (vector<int> (v.begin (), v.end ()).size (), v.size ());
EQUAL (vector<int> (v.begin () + 1, v.begin () + 2).size (),
- vsize (1));
+ vsize (1));
#endif
}
v.insert (1, 0);
#else
v.insert (v.begin (), 1);
-#endif
+#endif
EQUAL (v[0], 1);
#if VECTOR_INSERT
v.insert (2, v.size ());
#else
v.insert (v.end (), 2);
-#endif
+#endif
EQUAL (v.back (), 2);
vector<int> u;
u.insert (u.begin (), v.begin (), v.end ());
FUNC (parray_concat)
{
-#if !STD_VECTOR
- Link_array<int> u, v;
-#else
- vector<int*> u, v;
-#endif
+ vector<int *> u, v;
int a[5] = { 0, 1, 2, 3, 4 };
u.push_back (&a[0]);
u.push_back (&a[1]);