2 This file is part of LilyPond, the GNU music typesetter.
4 Copyright (C) 2006--2014 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 "config.hh" /* needed at least for HAVE_STL_DATA_METHOD */
34 #include <algorithm> /* find, reverse, sort */
35 #include <functional> /* unary_function */
42 int default_compare (T const &a, T const &b)
53 int default_compare (T *const &a, T *const &b)
68 #define VPOS ((vsize) -1)
71 #if HAVE_STL_DATA_METHOD
73 #else /* !HAVE_STL_DATA_METHOD */
74 #define vector __flower_vector
81 /* Interface without pointer arithmetic (iterator) semantics. */
82 template<typename T, typename A = std::allocator<T> >
83 class vector : public __flower_vector<T, A>
86 typedef typename __flower_vector<T>::iterator iterator;
87 typedef typename __flower_vector<T>::const_iterator const_iterator;
89 vector<T, A> () : __flower_vector<T, A> ()
93 vector<T, A> (size_t n) : __flower_vector<T, A> (n)
97 vector<T, A> (vector<T, A> const &v) : __flower_vector<T, A> (v)
101 vector<T, A> (const_iterator b, const_iterator e) : __flower_vector<T, A> (b, e)
118 } /* namespace std */
120 #endif /* !HAVE_STL_DATA_METHOD */
124 boundary (vector<T> const &v, int dir, vsize i)
127 return v[dir == -1 ? i : v.size () - 1 - i];
132 boundary (vector<T> &v, int dir, vsize i)
135 return v[dir == -1 ? i : v.size () - 1 - i];
140 back (vector<T> const &v, vsize i)
142 return v[v.size () - i - 1];
147 back (vector<T> &v, vsize i)
149 return v[v.size () - i - 1];
154 concat (vector<T> &v, vector<T> const &w)
156 v.insert (v.end (), w.begin (), w.end ());
159 template<typename T, typename Compare>
161 lower_bound (vector<T> const &v,
164 vsize b = 0, vsize e = VPOS)
168 typename vector<T>::const_iterator i = lower_bound (v.begin () + b,
173 return i - v.begin ();
176 template<typename T, typename Compare>
178 upper_bound (vector<T> const &v,
181 vsize b = 0, vsize e = VPOS)
186 typename vector<T>::const_iterator i = upper_bound (v.begin () + b,
191 return i - v.begin ();
194 template<typename T, typename Compare>
196 binary_search (vector<T> const &v,
199 vsize b = 0, vsize e = VPOS)
201 vsize lb = lower_bound (v, key, less, b, e);
203 if (lb == v.size () || less (key, v[lb]))
208 template<typename T, typename Compare>
210 vector_sort (vector<T> &v,
212 vsize b = 0, vsize e = VPOS)
217 sort (v.begin () + b, v.begin () + e, less);
222 reverse (vector<T> &v)
224 // CHECKME: for a simple vector, like vector<int>, this should
226 reverse (v.begin (), v.end ());
233 v.erase (unique (v.begin (), v.end ()), v.end ());
237 typename vector<T>::const_iterator
238 find (vector<T> const &v, T const &key)
240 return find (v.begin (), v.end (), key);
243 template<typename T> struct del : public unary_function<T, void>
245 void operator () (T x)
254 junk_pointers (vector<T> &v)
257 for_each (v.begin (), v.end (), del<T> ());
261 vector<string> string_split (string str, char c);
262 string string_join (vector<string> const &strs, const string &infix);
264 #define iterof(i,s) typeof((s).begin()) i((s).begin())
266 #endif /* STD_VECTOR_HH */