2 std-vector.hh -- declare vector
4 source file of the GNU LilyPond music typesetter
6 (c) 2006 Jan Nieuwenhuizen <janneke@gnu.org>
12 #include <algorithm> /* find, reverse, sort */
13 #include <functional> /* unary_function */
19 #include <boost/lambda/lambda.hpp>
23 int default_compare (T const &a, T const &b)
34 int default_compare (T *const &a, T *const &b)
49 #define VPOS ((vsize) -1)
52 #if HAVE_STL_DATA_METHOD
54 #else /* !HAVE_STL_DATA_METHOD */
55 #define vector __vector
61 /* Interface without pointer arithmetic (iterator) semantics. */
62 template<typename T, typename A=std::allocator<T> >
63 class vector : public __vector<T, A>
66 typedef typename __vector<T>::iterator iterator;
67 typedef typename __vector<T>::const_iterator const_iterator;
69 vector<T, A> () : __vector<T, A> ()
73 vector<T, A> (const_iterator b, const_iterator e) : __vector<T, A> (b, e)
92 #endif /* !HAVE_STL_DATA_METHOD */
96 boundary (vector<T> const &v, int dir, vsize i)
99 return v[dir == -1 ? i : v.size () - 1 - i];
104 boundary (vector<T> &v, int dir, vsize i)
107 return v[dir == -1 ? i : v.size () - 1 - i];
112 back (vector<T> const &v, vsize i)
114 return v[v.size () - i - 1];
119 back (vector<T> &v, vsize i)
121 return v[v.size () - i - 1];
126 concat (vector<T> &v, vector<T> const& w)
128 v.insert (v.end (), w.begin (), w.end ());
133 binary_search_bounds (vector<T> const &table,
134 T const &key, int (*compare) (T const &, T const &),
147 cmp = (*lo + *hi) / 2;
149 result = (*compare) (key, table[cmp]);
156 while (*hi - *lo > 1);
161 binary_search_bounds (vector<T*> const &table,
162 T const *key, int (*compare) (T *const &, T *const &),
172 cmp = (*lo + *hi) / 2;
174 result = (*compare) ((T *) key, table[cmp]);
181 while (*hi - *lo > 1);
185 /* FIXME: what if COMPARE is named: int operator == (T const&, T const&),
186 wouldn't that work for most uses of BINARY_SEARCH?
190 binary_search (vector<T> const &v,
191 T const &key, int (*compare) (T const &, T const &),
192 vsize b=0, vsize e=VPOS)
196 typename vector<T>::const_iterator i = find (v.begin () + b,
200 return i - v.begin ();
203 #else // c&p from array.icc; cannot easily use stl_algo:find b.o. compare func.
206 binary_search (vector<T> const &table,
208 int (*compare) (T const &, T const &),
218 binary_search_bounds (table, key, compare, &lo, &hi);
220 if (! (*compare) (key, table[lo]))
232 /* FIXME: the COMPARE functionality is broken? */
235 vector_sort (vector<T> &v, int (*compare) (T const &, T const &),
236 vsize lower=VPOS, vsize upper=VPOS)
238 typename vector<T>::iterator b = v.begin ();
239 typename vector<T>::iterator e = v.begin ();
245 sort (b + lower, e + upper, compare);
250 template<typename T> void
251 vector_sort (vector<T> &v, int (*compare) (T const &, T const &),
252 vsize lower=VPOS, vsize upper=VPOS)
257 upper = v.size () - 1;
259 if (upper == VPOS || lower >= upper)
261 swap (v[lower], v[(lower + upper) / 2]);
263 for (vsize i = lower +1; i <= upper; i++)
264 if (compare (v[i], v[lower]) < 0)
265 swap (v[++last], v[i]);
266 swap (v[lower], v[last]);
267 vector_sort (v, compare, lower, last - 1);
268 vector_sort (v, compare, last + 1, upper);
274 reverse (vector<T> &v)
276 // CHECKME: for a simple vector, like vector<int>, this should
278 reverse (v.begin (), v.end ());
285 v.erase (unique (v.begin (), v.end ()), v.end ());
289 typename vector<T>::const_iterator
290 find (vector<T> const &v, T const &key)
292 return find (v.begin (), v.end (), key);
295 #if HAVE_BOOST_LAMBDA
296 #include <boost/lambda/lambda.hpp>
297 using namespace boost::lambda;
300 junk_pointers (vector<T> &v)
302 for_each (v.begin (), v.end (), (delete _1, _1 = 0));
307 template<typename T> struct del : public unary_function<T, void>
309 void operator() (T x)
318 junk_pointers (vector<T> &v)
321 for_each (v.begin (), v.end (), del<T> ());
324 #endif /* HAVE_BOOST_LAMBDA */
326 #endif /* STD_VECTOR_HH */