1 |
root |
1.4 |
#ifndef ESTL_H_ |
2 |
|
|
#define ESTL_H_ |
3 |
sf-exg |
1.2 |
|
4 |
sf-exg |
1.1 |
#include <stdlib.h> |
5 |
|
|
#include <string.h> |
6 |
|
|
|
7 |
root |
1.9 |
#include "ecb.h" |
8 |
|
|
|
9 |
sf-exg |
1.5 |
template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
10 |
|
|
template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
11 |
sf-exg |
1.1 |
|
12 |
root |
1.3 |
template<typename T, typename U> static inline void swap (T& a, U& b) { T t = a; a = (T)b; b = (U)t; } |
13 |
sf-exg |
1.1 |
|
14 |
|
|
template <typename I, typename T> |
15 |
|
|
I find (I first, I last, const T& value) |
16 |
|
|
{ |
17 |
|
|
while (first != last && *first != value) |
18 |
|
|
++first; |
19 |
|
|
|
20 |
|
|
return first; |
21 |
|
|
} |
22 |
|
|
|
23 |
root |
1.8 |
#include <new> |
24 |
|
|
|
25 |
|
|
#if __cplusplus >= 201103L |
26 |
|
|
#include <type_traits> |
27 |
|
|
#endif |
28 |
|
|
|
29 |
root |
1.9 |
// original version taken from MICO, but this has been completely rewritten |
30 |
|
|
// known limitations w.r.t. std::vector |
31 |
|
|
// - many methods missing |
32 |
|
|
// - no error checking, no exceptions thrown |
33 |
|
|
// - size_type is 32bit even on 64 bit hosts, so limited to 2**31 elements |
34 |
|
|
// - no allocator support |
35 |
|
|
// - we don't really care about const correctness, but we try |
36 |
|
|
// - we don't care about namespaces and stupid macros the user might define |
37 |
sf-exg |
1.1 |
template<class T> |
38 |
|
|
struct simplevec |
39 |
|
|
{ |
40 |
root |
1.9 |
#if ESTL_BIG_VECTOR |
41 |
|
|
// shoudl use size_t/ssize_t, but that's not portable enough for us |
42 |
|
|
typedef unsigned long size_type; |
43 |
|
|
typedef long difference_type; |
44 |
|
|
#else |
45 |
|
|
typedef uint32_t size_type; |
46 |
|
|
typedef int32_t difference_type; |
47 |
|
|
#endif |
48 |
|
|
|
49 |
|
|
typedef T value_type; |
50 |
|
|
typedef T *iterator; |
51 |
root |
1.3 |
typedef const T *const_iterator; |
52 |
root |
1.9 |
typedef T *pointer; |
53 |
|
|
typedef const T *const_pointer; |
54 |
|
|
typedef T &reference; |
55 |
|
|
typedef const T &const_reference; |
56 |
|
|
// missing: allocator_type |
57 |
|
|
// missing: reverse iterator |
58 |
|
|
|
59 |
|
|
private: |
60 |
|
|
size_type sze, res; |
61 |
|
|
T *buf; |
62 |
sf-exg |
1.1 |
|
63 |
root |
1.9 |
// we shamelessly optimise for "simple" types. everything |
64 |
|
|
// "not simple enough" will use the slow path. |
65 |
root |
1.8 |
static bool is_simple_enough () |
66 |
|
|
{ |
67 |
root |
1.9 |
return 1; // we are not there yet |
68 |
root |
1.8 |
#if __cplusplus >= 201103L |
69 |
|
|
return std::is_trivially_assignable<T, T>::value |
70 |
|
|
&& std::is_trivially_constructable<T>::value |
71 |
|
|
&& std::is_trivially_copyable<T>::value |
72 |
|
|
&& std::is_trivially_destructible<T>::value; |
73 |
|
|
#elif ECB_GCC_VERSION(4,4) |
74 |
|
|
return __has_trivial_assign (T) |
75 |
|
|
&& __has_trivial_constructor (T) |
76 |
|
|
&& __has_trivial_copy (T) |
77 |
|
|
&& __has_trivial_destructor (T); |
78 |
|
|
#else |
79 |
|
|
return 0; |
80 |
|
|
#endif |
81 |
|
|
} |
82 |
|
|
|
83 |
root |
1.9 |
static void construct (iterator a, size_type n = 1) |
84 |
root |
1.3 |
{ |
85 |
root |
1.9 |
if (!is_simple_enough ()) |
86 |
|
|
while (n--) |
87 |
|
|
new (*a++) T (); |
88 |
root |
1.3 |
} |
89 |
|
|
|
90 |
root |
1.9 |
static void destruct (iterator a, size_type n = 1) |
91 |
root |
1.3 |
{ |
92 |
root |
1.8 |
if (!is_simple_enough ()) |
93 |
root |
1.9 |
while (n--) |
94 |
|
|
(*a++).~T (); |
95 |
root |
1.3 |
} |
96 |
|
|
|
97 |
root |
1.9 |
static void cop_new (iterator a, iterator b) { new (a) T (*b); } |
98 |
|
|
static void cop_set (iterator a, iterator b) { *a = *b ; } |
99 |
root |
1.3 |
|
100 |
root |
1.8 |
// these copy helpers actually use the copy constructor, not assignment |
101 |
root |
1.9 |
static void copy_lower (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator) = cop_new) |
102 |
root |
1.8 |
{ |
103 |
|
|
if (is_simple_enough ()) |
104 |
|
|
memmove (dst, src, sizeof (T) * n); |
105 |
|
|
else |
106 |
|
|
while (n--) |
107 |
root |
1.9 |
op (dst++, src++); |
108 |
root |
1.8 |
} |
109 |
|
|
|
110 |
root |
1.9 |
static void copy_higher (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator) = cop_new) |
111 |
root |
1.8 |
{ |
112 |
|
|
if (is_simple_enough ()) |
113 |
|
|
memmove (dst, src, sizeof (T) * n); |
114 |
|
|
else |
115 |
|
|
while (n--) |
116 |
root |
1.9 |
op (dst + n, src + n); |
117 |
root |
1.8 |
} |
118 |
|
|
|
119 |
root |
1.9 |
static void copy (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator) = cop_new) |
120 |
root |
1.8 |
{ |
121 |
|
|
if (is_simple_enough ()) |
122 |
|
|
memcpy (dst, src, sizeof (T) * n); |
123 |
|
|
else |
124 |
root |
1.9 |
copy_lower (dst, src, n, op); |
125 |
|
|
} |
126 |
|
|
|
127 |
|
|
static T *alloc (size_type n) ecb_cold |
128 |
|
|
{ |
129 |
|
|
return (T *)::operator new ((size_t) (sizeof (T) * n)); |
130 |
|
|
} |
131 |
|
|
|
132 |
|
|
void dealloc () ecb_cold |
133 |
|
|
{ |
134 |
|
|
destruct (buf, sze); |
135 |
|
|
::operator delete (buf); |
136 |
|
|
} |
137 |
|
|
|
138 |
|
|
size_type good_size (size_type n) ecb_cold |
139 |
|
|
{ |
140 |
|
|
return n ? 2UL << ecb_ld32 (n) : 5; |
141 |
root |
1.8 |
} |
142 |
|
|
|
143 |
|
|
void ins (iterator where, size_type n) |
144 |
root |
1.3 |
{ |
145 |
root |
1.9 |
size_type pos = where - begin (); |
146 |
|
|
|
147 |
|
|
if (ecb_expect_false (sze + n > res)) |
148 |
root |
1.3 |
{ |
149 |
root |
1.9 |
res = good_size (sze + n); |
150 |
root |
1.3 |
|
151 |
root |
1.9 |
T *nbuf = alloc (res); |
152 |
|
|
copy (nbuf, buf, sze, cop_new); |
153 |
|
|
dealloc (); |
154 |
|
|
buf = nbuf; |
155 |
root |
1.3 |
} |
156 |
root |
1.9 |
|
157 |
|
|
construct (buf + sze, n); |
158 |
|
|
copy_higher (buf + pos + n, buf + pos, sze - pos, cop_set); |
159 |
|
|
sze += n; |
160 |
root |
1.3 |
} |
161 |
sf-exg |
1.1 |
|
162 |
|
|
public: |
163 |
root |
1.9 |
size_type capacity () const { return res; } |
164 |
|
|
size_type size () const { return sze; } |
165 |
|
|
bool empty () const { return size () == 0; } |
166 |
|
|
|
167 |
|
|
const_iterator begin () const { return &buf [ 0]; } |
168 |
|
|
iterator begin () { return &buf [ 0]; } |
169 |
|
|
const_iterator end () const { return &buf [sze ]; } |
170 |
|
|
iterator end () { return &buf [sze ]; } |
171 |
|
|
const_reference front () const { return buf [ 0]; } |
172 |
|
|
reference front () { return buf [ 0]; } |
173 |
|
|
const_reference back () const { return buf [sze - 1]; } |
174 |
|
|
reference back () { return buf [sze - 1]; } |
175 |
|
|
|
176 |
root |
1.3 |
void reserve (size_type sz) |
177 |
|
|
{ |
178 |
root |
1.9 |
if (ecb_expect_true (sz <= res)) |
179 |
|
|
return; |
180 |
root |
1.3 |
|
181 |
root |
1.9 |
sz = good_size (sz); |
182 |
|
|
T *nbuf = alloc (sz); |
183 |
root |
1.3 |
|
184 |
root |
1.9 |
copy (nbuf, begin (), sze); |
185 |
|
|
dealloc (); |
186 |
|
|
|
187 |
|
|
buf = nbuf; |
188 |
|
|
res = sz; |
189 |
root |
1.3 |
} |
190 |
|
|
|
191 |
root |
1.7 |
void resize (size_type sz) |
192 |
|
|
{ |
193 |
|
|
reserve (sz); |
194 |
root |
1.8 |
|
195 |
|
|
if (is_simple_enough ()) |
196 |
root |
1.9 |
sze = sz; |
197 |
root |
1.8 |
else |
198 |
|
|
{ |
199 |
root |
1.9 |
while (sze < sz) construct (buf + sze++); |
200 |
|
|
while (sze > sz) destruct (buf + --sze); |
201 |
root |
1.8 |
} |
202 |
root |
1.7 |
} |
203 |
|
|
|
204 |
root |
1.3 |
simplevec () |
205 |
root |
1.9 |
: sze(0), res(0), buf(0) |
206 |
root |
1.3 |
{ |
207 |
|
|
} |
208 |
|
|
|
209 |
root |
1.9 |
simplevec (size_type n, const T &t = T ()) |
210 |
|
|
: sze(0), res(0), buf(0) |
211 |
root |
1.3 |
{ |
212 |
|
|
insert (begin (), n, t); |
213 |
|
|
} |
214 |
|
|
|
215 |
|
|
simplevec (const_iterator first, const_iterator last) |
216 |
root |
1.9 |
: sze(0), res(0), buf(0) |
217 |
root |
1.3 |
{ |
218 |
|
|
insert (begin (), first, last); |
219 |
|
|
} |
220 |
|
|
|
221 |
|
|
simplevec (const simplevec<T> &v) |
222 |
root |
1.9 |
: sze(0), res(0), buf(0) |
223 |
root |
1.3 |
{ |
224 |
root |
1.8 |
insert (begin (), v.begin (), v.end ()); |
225 |
root |
1.3 |
} |
226 |
|
|
|
227 |
|
|
simplevec<T> &operator= (const simplevec<T> &v) |
228 |
|
|
{ |
229 |
root |
1.9 |
swap (simplevec<T> (v)); |
230 |
root |
1.3 |
return *this; |
231 |
|
|
} |
232 |
|
|
|
233 |
|
|
~simplevec () |
234 |
|
|
{ |
235 |
root |
1.8 |
dealloc (); |
236 |
root |
1.3 |
} |
237 |
|
|
|
238 |
root |
1.9 |
void swap (simplevec<T> &t) |
239 |
root |
1.3 |
{ |
240 |
root |
1.9 |
::swap (sze, t.sze); |
241 |
|
|
::swap (res, t.res); |
242 |
|
|
::swap (buf, t.buf); |
243 |
root |
1.3 |
} |
244 |
|
|
|
245 |
|
|
void clear () |
246 |
|
|
{ |
247 |
root |
1.9 |
destruct (buf, sze); |
248 |
|
|
sze = 0; |
249 |
root |
1.3 |
} |
250 |
|
|
|
251 |
|
|
void push_back (const T &t) |
252 |
|
|
{ |
253 |
root |
1.9 |
reserve (sze + 1); |
254 |
|
|
new (buf + sze++) T (t); |
255 |
root |
1.3 |
} |
256 |
|
|
|
257 |
|
|
void pop_back () |
258 |
|
|
{ |
259 |
root |
1.9 |
destruct (buf + --sze); |
260 |
root |
1.3 |
} |
261 |
|
|
|
262 |
root |
1.9 |
const T &operator [](size_type idx) const { return buf[idx]; } |
263 |
|
|
T &operator [](size_type idx) { return buf[idx]; } |
264 |
root |
1.3 |
|
265 |
|
|
iterator insert (iterator pos, const T &t) |
266 |
|
|
{ |
267 |
root |
1.8 |
size_type at = pos - begin (); |
268 |
root |
1.10 |
|
269 |
root |
1.8 |
ins (pos, 1); |
270 |
root |
1.10 |
buf [at] = t; |
271 |
|
|
|
272 |
|
|
return buf + at; |
273 |
root |
1.3 |
} |
274 |
|
|
|
275 |
|
|
iterator insert (iterator pos, const_iterator first, const_iterator last) |
276 |
|
|
{ |
277 |
root |
1.8 |
size_type n = last - first; |
278 |
|
|
size_type at = pos - begin (); |
279 |
root |
1.3 |
|
280 |
root |
1.9 |
ins (pos, n); |
281 |
root |
1.10 |
copy (buf + at, first, n, cop_set); |
282 |
root |
1.3 |
|
283 |
root |
1.10 |
return buf + at; |
284 |
root |
1.3 |
} |
285 |
|
|
|
286 |
|
|
iterator insert (iterator pos, size_type n, const T &t) |
287 |
|
|
{ |
288 |
root |
1.8 |
size_type at = pos - begin (); |
289 |
root |
1.3 |
|
290 |
root |
1.9 |
ins (pos, n); |
291 |
|
|
|
292 |
root |
1.10 |
for (iterator i = buf + at; n--; ) |
293 |
|
|
*i++ = t; |
294 |
root |
1.3 |
|
295 |
root |
1.10 |
return buf + at; |
296 |
root |
1.3 |
} |
297 |
|
|
|
298 |
|
|
void erase (iterator first, iterator last) |
299 |
|
|
{ |
300 |
root |
1.9 |
size_t n = last - first; |
301 |
root |
1.8 |
|
302 |
root |
1.9 |
copy_lower (last, first, end () - last, cop_set); |
303 |
|
|
sze -= n; |
304 |
|
|
destruct (buf + sze, n); |
305 |
root |
1.3 |
} |
306 |
|
|
|
307 |
|
|
void erase (iterator pos) |
308 |
|
|
{ |
309 |
|
|
if (pos != end ()) |
310 |
root |
1.8 |
erase (pos, pos + 1); |
311 |
root |
1.3 |
} |
312 |
sf-exg |
1.1 |
}; |
313 |
|
|
|
314 |
|
|
template<class T> |
315 |
root |
1.3 |
bool operator ==(const simplevec<T> &v1, const simplevec<T> &v2) |
316 |
sf-exg |
1.1 |
{ |
317 |
root |
1.3 |
if (v1.size () != v2.size ()) return false; |
318 |
|
|
|
319 |
|
|
return !v1.size () || !memcmp (&v1[0], &v2[0], v1.size () * sizeof (T)); |
320 |
sf-exg |
1.1 |
} |
321 |
|
|
|
322 |
|
|
template<class T> |
323 |
root |
1.3 |
bool operator <(const simplevec<T> &v1, const simplevec<T> &v2) |
324 |
sf-exg |
1.1 |
{ |
325 |
root |
1.3 |
unsigned long minlast = min (v1.size (), v2.size ()); |
326 |
|
|
|
327 |
|
|
for (unsigned long i = 0; i < minlast; ++i) |
328 |
|
|
{ |
329 |
|
|
if (v1[i] < v2[i]) return true; |
330 |
|
|
if (v2[i] < v1[i]) return false; |
331 |
sf-exg |
1.1 |
} |
332 |
root |
1.3 |
return v1.size () < v2.size (); |
333 |
sf-exg |
1.1 |
} |
334 |
|
|
|
335 |
|
|
template<typename T> |
336 |
|
|
struct vector : simplevec<T> |
337 |
|
|
{ |
338 |
|
|
}; |
339 |
sf-exg |
1.2 |
|
340 |
|
|
#endif |
341 |
root |
1.3 |
|