2 This file is part of LilyPond, the GNU music typesetter.
4 Copyright (C) 2006--2009 Jan Nieuwenhuizen <janneke@gnu.org>
6 LilyPond is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 LilyPond is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with LilyPond. If not, see <http://www.gnu.org/licenses/>.
26 leads to dubious crashes - libstdc++ bug?
29 #define _GLIBCXX_DEBUG 1
33 #include <algorithm> /* find, reverse, sort */
34 #include <functional> /* unary_function */
40 #if HAVE_BOOST_LAMBDA_LAMBDA_HPP
41 #include <boost/lambda/lambda.hpp>
45 int default_compare (T const &a, T const &b)
56 int default_compare (T *const &a, T *const &b)
71 #define VPOS ((vsize) -1)
74 #if HAVE_STL_DATA_METHOD
76 #else /* !HAVE_STL_DATA_METHOD */
77 #define vector __flower_vector
83 /* Interface without pointer arithmetic (iterator) semantics. */
84 template<typename T, typename A=std::allocator<T> >
85 class vector : public __flower_vector<T, A>
88 typedef typename __flower_vector<T>::iterator iterator;
89 typedef typename __flower_vector<T>::const_iterator const_iterator;
91 vector<T, A> () : __flower_vector<T, A> ()
95 vector<T, A> (vector<T, A> const& v) : __flower_vector<T, A> (v)
99 vector<T, A> (const_iterator b, const_iterator e) : __flower_vector<T, A> (b, e)
116 } /* namespace std */
118 #endif /* !HAVE_STL_DATA_METHOD */
122 boundary (vector<T> const &v, int dir, vsize i)
125 return v[dir == -1 ? i : v.size () - 1 - i];
130 boundary (vector<T> &v, int dir, vsize i)
133 return v[dir == -1 ? i : v.size () - 1 - i];
138 back (vector<T> const &v, vsize i)
140 return v[v.size () - i - 1];
145 back (vector<T> &v, vsize i)
147 return v[v.size () - i - 1];
152 concat (vector<T> &v, vector<T> const& w)
154 v.insert (v.end (), w.begin (), w.end ());
157 template<typename T, typename Compare>
159 lower_bound (vector<T> const &v,
162 vsize b=0, vsize e=VPOS)
166 typename vector<T>::const_iterator i = lower_bound (v.begin () + b,
171 return i - v.begin ();
174 template<typename T, typename Compare>
176 upper_bound (vector<T> const &v,
179 vsize b=0, vsize e=VPOS)
184 typename vector<T>::const_iterator i = upper_bound (v.begin () + b,
189 return i - v.begin ();
192 template<typename T, typename Compare>
194 binary_search (vector<T> const &v,
196 Compare less=less<T> (),
197 vsize b=0, vsize e=VPOS)
199 vsize lb = lower_bound (v, key, less, b, e);
201 if (lb == v.size () || less (key, v[lb]))
206 template<typename T, typename Compare>
208 vector_sort (vector<T> &v,
210 vsize b=0, vsize e=VPOS)
215 sort (v.begin () + b, v.begin () + e, less);
220 reverse (vector<T> &v)
222 // CHECKME: for a simple vector, like vector<int>, this should
224 reverse (v.begin (), v.end ());
231 v.erase (unique (v.begin (), v.end ()), v.end ());
235 typename vector<T>::const_iterator
236 find (vector<T> const &v, T const &key)
238 return find (v.begin (), v.end (), key);
241 #if HAVE_BOOST_LAMBDA_LAMBDA_HPP
242 #include <boost/lambda/lambda.hpp>
243 using namespace boost::lambda;
246 junk_pointers (vector<T> &v)
248 for_each (v.begin (), v.end (), (delete _1, _1 = 0));
253 template<typename T> struct del : public unary_function<T, void>
255 void operator() (T x)
264 junk_pointers (vector<T> &v)
267 for_each (v.begin (), v.end (), del<T> ());
270 #endif /* HAVE_BOOST_LAMBDA */
272 vector<string> string_split (string str, char c);
273 string string_join (vector<string> const &strs, string infix);
275 #define iterof(i,s) typeof((s).begin()) i((s).begin())
277 #endif /* STD_VECTOR_HH */