ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libptytty/src/estl.h
(Generate patch)

Comparing libptytty/src/estl.h (file contents):
Revision 1.7 by root, Thu May 17 18:06:38 2012 UTC vs.
Revision 1.29 by sf-exg, Thu Nov 13 13:58:12 2014 UTC

… …
2#define ESTL_H_ 2#define ESTL_H_
3 3
4#include <stdlib.h> 4#include <stdlib.h>
5#include <string.h> 5#include <string.h>
6 6
7#include "ecb.h"
8
7template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 9template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
8template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 10template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
9 11
10template<typename T, typename U> static inline void swap (T& a, U& b) { T t = a; a = (T)b; b = (U)t; } 12template<typename T, typename U> static inline void swap (T& a, U& b) { T t = a; a = (T)b; b = (U)t; }
11 13
… …
16 ++first; 18 ++first;
17 19
18 return first; 20 return first;
19} 21}
20 22
21/* simplevec taken (and heavily modified), from: 23#include <new>
22 * 24
23 * MICO --- a free CORBA implementation 25#if ECB_CPP11
24 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 26 #include <type_traits>
25 * originally GPLv2 or any later 27#endif
26 */ 28
29namespace estl
30{
31#if ESTL_LARGE_MEMORY_MODEL
32 // should use size_t/ssize_t, but that's not portable enough for us
33 typedef unsigned long size_type;
34 typedef long difference_type;
35#else
36 typedef uint32_t size_type;
37 typedef int32_t difference_type;
38#endif
39
40 template<typename T>
41 struct scoped_ptr
42 {
43 T *p;
44
45 scoped_ptr () : p (0) { }
46
47 explicit
48 scoped_ptr (T *a) : p (a) { }
49
50 ~scoped_ptr ()
51 {
52 delete p;
53 }
54
55 void reset (T *a)
56 {
57 delete p;
58 p = a;
59 }
60
61 T *operator ->() const { return p; }
62 T &operator *() const { return *p; }
63
64 operator T *() { return p; }
65 T *get () const { return p; }
66
67 private:
68 scoped_ptr (const scoped_ptr &);
69 scoped_ptr &operator =(const scoped_ptr &);
70 };
71
72 template<typename T>
73 struct scoped_array
74 {
75 T *p;
76
77 scoped_array () : p (0) { }
78
79 explicit
80 scoped_array (T *a) : p (a) { }
81
82 ~scoped_array ()
83 {
84 delete [] p;
85 }
86
87 void reset (T *a)
88 {
89 delete [] p;
90 p = a;
91 }
92
93 operator T *() { return p; }
94 T *get () const { return p; }
95
96 private:
97 scoped_array (const scoped_array &);
98 scoped_array &operator =(const scoped_array &);
99 };
100}
101
102// original version taken from MICO, but this has been completely rewritten
103// known limitations w.r.t. std::vector
104// - many methods missing
105// - no error checking, no exceptions thrown (e.g. at())
106// - size_type is 32bit even on 64 bit hosts, so limited to 2**31 elements
107// - no allocator support
108// - we don't really care about const correctness, but we try
109// - we don't care about namespaces and stupid macros the user might define
110// - no bool specialisation
27template<class T> 111template<class T>
28struct simplevec 112struct simplevec
29{ 113{
114 typedef estl::size_type size_type;
115
116 typedef T value_type;
30 typedef T *iterator; 117 typedef T *iterator;
31 typedef const T *const_iterator; 118 typedef const T *const_iterator;
32 typedef unsigned long size_type; 119 typedef T *pointer;
120 typedef const T *const_pointer;
121 typedef T &reference;
122 typedef const T &const_reference;
123 // missing: allocator_type
124 // missing: reverse iterator
33 125
34private: 126private:
35 size_type _last, _size; 127 size_type sze, res;
36 T *_buf; 128 T *buf;
129
130 // we shamelessly optimise for "simple" types. everything
131 // "not simple enough" will use the slow path.
132 static bool is_simple_enough ()
133 {
134 #if ECB_CPP11
135 return std::is_trivially_assignable<T, T>::value
136 && std::is_trivially_constructible<T>::value
137 && std::is_trivially_copyable<T>::value
138 && std::is_trivially_destructible<T>::value;
139 #elif ECB_GCC_VERSION(4,4) || ECB_CLANG_VERSION(2,8)
140 return __has_trivial_assign (T)
141 && __has_trivial_constructor (T)
142 && __has_trivial_copy (T)
143 && __has_trivial_destructor (T);
144 #else
145 return 0;
146 #endif
147 }
148
149 static void construct (iterator a, size_type n = 1)
150 {
151 if (!is_simple_enough ())
152 while (n--)
153 new (a++) T ();
154 }
155
156 static void destruct (iterator a, size_type n = 1)
157 {
158 if (!is_simple_enough ())
159 while (n--)
160 (*a++).~T ();
161 }
162
163 template<class I>
164 static void cop_new (iterator a, I b) { new (a) T (*b); }
165 template<class I>
166 static void cop_set (iterator a, I b) { *a = *b ; }
167
168 // MUST copy forwards
169 template<class I>
170 static void copy (iterator dst, I src, size_type n, void (*op)(iterator, I))
171 {
172 while (n--)
173 op (dst++, src++);
174 }
175
176 static void copy (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator))
177 {
178 if (is_simple_enough ())
179 memcpy (dst, src, sizeof (T) * n);
180 else
181 copy<iterator> (dst, src, n, op);
182 }
183
184 static T *alloc (size_type n) ecb_cold
185 {
186 return (T *)::operator new ((size_t) (sizeof (T) * n));
187 }
188
189 void dealloc () ecb_cold
190 {
191 destruct (buf, sze);
192 ::operator delete (buf);
193 }
194
195 size_type good_size (size_type n) ecb_cold
196 {
197 return n ? 2UL << ecb_ld32 (n) : 5;
198 }
199
200 void ins (iterator where, size_type n)
201 {
202 size_type pos = where - begin ();
203
204 if (ecb_expect_false (sze + n > res))
205 {
206 res = good_size (sze + n);
207
208 T *nbuf = alloc (res);
209 copy (nbuf, buf, sze, cop_new);
210 dealloc ();
211 buf = nbuf;
212 }
213
214 construct (buf + sze, n);
215
216 iterator src = buf + pos;
217 if (is_simple_enough ())
218 memmove (src + n, src, sizeof (T) * (sze - pos));
219 else
220 for (size_type i = sze - pos; i--; )
221 cop_set (src + n + i, src + i);
222
223 sze += n;
224 }
37 225
38public: 226public:
39 const_iterator begin () const { return &_buf[0]; }
40 iterator begin () { return &_buf[0]; }
41
42 const_iterator end () const { return &_buf[_last]; }
43 iterator end () { return &_buf[_last]; }
44
45 size_type capacity () const { return _size; } 227 size_type capacity () const { return res; }
46 size_type size () const { return _last; } 228 size_type size () const { return sze; }
229 bool empty () const { return size () == 0; }
47 230
48private: 231 size_t max_size () const
49 static T *alloc (size_type n)
50 { 232 {
51 return (T *)::operator new ((size_t) (n * sizeof (T))); 233 return (~(size_type)0) >> 1;
52 } 234 }
53 235
54 static void dealloc (T *buf) 236 const_iterator begin () const { return &buf [ 0]; }
55 { 237 iterator begin () { return &buf [ 0]; }
56 if (buf) 238 const_iterator end () const { return &buf [sze ]; }
57 ::operator delete (buf); 239 iterator end () { return &buf [sze ]; }
58 } 240 const_reference front () const { return buf [ 0]; }
241 reference front () { return buf [ 0]; }
242 const_reference back () const { return buf [sze - 1]; }
243 reference back () { return buf [sze - 1]; }
59 244
60 size_type good_size (size_type n) 245 void reserve (size_type sz)
61 { 246 {
62 return max (n, _size ? _size * 2 : 5); 247 if (ecb_expect_true (sz <= res))
63 } 248 return;
64 249
65 void reserve (iterator where, size_type n) 250 sz = good_size (sz);
251 T *nbuf = alloc (sz);
252
253 copy (nbuf, begin (), sze, cop_new);
254 dealloc ();
255
256 buf = nbuf;
257 res = sz;
258 }
259
260 void resize (size_type sz)
66 { 261 {
67 if (_last + n <= _size) 262 reserve (sz);
68 memmove (where + n, where, (end () - where) * sizeof (T)); 263
264 if (is_simple_enough ())
265 sze = sz;
69 else 266 else
70 { 267 {
71 size_type sz = _last + n; 268 while (sze < sz) construct (buf + sze++);
72 sz = good_size (sz); 269 while (sze > sz) destruct (buf + --sze);
73 T *nbuf = alloc (sz);
74
75 if (_buf)
76 {
77 memcpy (nbuf, begin (), (where - begin ()) * sizeof (T));
78 memcpy (nbuf + (where - begin ()) + n, where, (end () - where) * sizeof (T));
79 dealloc (_buf);
80 }
81
82 _buf = nbuf;
83 _size = sz;
84 } 270 }
85 } 271 }
86 272
87public:
88 void reserve (size_type sz)
89 {
90 if (_size < sz)
91 {
92 sz = good_size (sz);
93 T *nbuf = alloc (sz);
94
95 if (_buf)
96 {
97 memcpy (nbuf, begin (), size () * sizeof (T));
98 dealloc (_buf);
99 }
100
101 _buf = nbuf;
102 _size = sz;
103 }
104 }
105
106 void resize (size_type sz)
107 {
108 reserve (sz);
109 _last = sz;
110 }
111
112 simplevec () 273 simplevec ()
113 : _last(0), _size(0), _buf(0) 274 : sze(0), res(0), buf(0)
114 { 275 {
115 } 276 }
116 277
117 simplevec (size_type n, const T& t = T ()) 278 simplevec (size_type n, const T &t = T ())
118 : _last(0), _size(0), _buf(0)
119 { 279 {
120 insert (begin (), n, t); 280 sze = res = n;
281 buf = alloc (sze);
282
283 while (n--)
284 new (buf + n) T (t);
121 } 285 }
122 286
123 simplevec (const_iterator first, const_iterator last) 287 simplevec (const_iterator first, const_iterator last)
124 : _last(0), _size(0), _buf(0)
125 { 288 {
126 insert (begin (), first, last); 289 sze = res = last - first;
290 buf = alloc (sze);
291 copy (buf, first, sze, cop_new);
127 } 292 }
128 293
129 simplevec (const simplevec<T> &v) 294 simplevec (const simplevec<T> &v)
130 : _last(0), _size(0), _buf(0) 295 : sze(0), res(0), buf(0)
131 { 296 {
132 reserve (v._last); 297 sze = res = v.size ();
133 memcpy (_buf, v.begin (), v.size () * sizeof (T)); 298 buf = alloc (sze);
134 _last = v._last; 299 copy (buf, v.begin (), sze, cop_new);
300 }
301
302 ~simplevec ()
303 {
304 dealloc ();
305 }
306
307 void swap (simplevec<T> &t)
308 {
309 ::swap (sze, t.sze);
310 ::swap (res, t.res);
311 ::swap (buf, t.buf);
312 }
313
314 void clear ()
315 {
316 destruct (buf, sze);
317 sze = 0;
318 }
319
320 void push_back (const T &t)
321 {
322 reserve (sze + 1);
323 new (buf + sze++) T (t);
324 }
325
326 void pop_back ()
327 {
328 destruct (buf + --sze);
329 }
330
331 const_reference operator [](size_type idx) const { return buf[idx]; }
332 reference operator [](size_type idx) { return buf[idx]; }
333
334 const_reference at (size_type idx) const { return buf [idx]; }
335 reference at (size_type idx) { return buf [idx]; }
336
337 void assign (const_iterator first, const_iterator last)
338 {
339 simplevec<T> v (first, last);
340 swap (v);
341 }
342
343 void assign (size_type n, const T &t)
344 {
345 simplevec<T> v (n, t);
346 swap (v);
135 } 347 }
136 348
137 simplevec<T> &operator= (const simplevec<T> &v) 349 simplevec<T> &operator= (const simplevec<T> &v)
138 { 350 {
139 if (this != &v) 351 assign (v.begin (), v.end ());
140 {
141 _last = 0;
142 reserve (v._last);
143 memcpy (_buf, v.begin (), v.size () * sizeof (T));
144 _last = v._last;
145 }
146
147 return *this; 352 return *this;
148 } 353 }
149 354
150 ~simplevec ()
151 {
152 dealloc (_buf);
153 }
154
155 const T &front () const { return _buf[ 0]; }
156 T &front () { return _buf[ 0]; }
157 const T &back () const { return _buf[_last-1]; }
158 T &back () { return _buf[_last-1]; }
159
160 bool empty () const
161 {
162 return _last == 0;
163 }
164
165 void clear ()
166 {
167 _last = 0;
168 }
169
170 void push_back (const T &t)
171 {
172 reserve (_last+1);
173 *end () = t;
174 ++_last;
175 }
176
177 void push_back (T &t)
178 {
179 reserve (_last+1);
180 *end () = t;
181 ++_last;
182 }
183
184 void pop_back ()
185 {
186 --_last;
187 }
188
189 const T &operator [](size_type idx) const { return _buf[idx]; }
190 T &operator [](size_type idx) { return _buf[idx]; }
191
192 iterator insert (iterator pos, const T &t) 355 iterator insert (iterator pos, const T &t)
193 { 356 {
194 long at = pos - begin (); 357 size_type at = pos - begin ();
358
195 reserve (pos, 1); 359 ins (pos, 1);
196 pos = begin () + at; 360 buf [at] = t;
197 *pos = t; 361
198 ++_last; 362 return buf + at;
363 }
364
365 iterator insert (iterator pos, const_iterator first, const_iterator last)
366 {
367 size_type n = last - first;
368 size_type at = pos - begin ();
369
370 ins (pos, n);
371 copy (buf + at, first, n, cop_set);
372
373 return buf + at;
374 }
375
376 iterator insert (iterator pos, size_type n, const T &t)
377 {
378 size_type at = pos - begin ();
379
380 ins (pos, n);
381
382 for (iterator i = buf + at; n--; )
383 *i++ = t;
384
385 return buf + at;
386 }
387
388 iterator erase (iterator first, iterator last)
389 {
390 size_type n = last - first;
391 size_type c = end () - last;
392
393 if (is_simple_enough ())
394 memmove (first, last, sizeof (T) * c);
395 else
396 copy (first, last, c, cop_set);
397
398 sze -= n;
399 destruct (buf + sze, n);
400
401 return first;
402 }
403
404 iterator erase (iterator pos)
405 {
406 if (pos != end ())
407 erase (pos, pos + 1);
408
199 return pos; 409 return pos;
200 }
201
202 iterator insert (iterator pos, const_iterator first, const_iterator last)
203 {
204 long n = last - first;
205 long at = pos - begin ();
206
207 if (n > 0)
208 {
209 reserve (pos, n);
210 pos = begin () + at;
211 memcpy (pos, first, (last - first) * sizeof (T));
212 _last += n;
213 }
214
215 return pos;
216 }
217
218 iterator insert (iterator pos, size_type n, const T &t)
219 {
220 long at = pos - begin ();
221
222 if (n > 0)
223 {
224 reserve (pos, n);
225 pos = begin () + at;
226 for (int i = 0; i < n; ++i)
227 pos[i] = t;
228 _last += n;
229 }
230
231 return pos;
232 }
233
234 void erase (iterator first, iterator last)
235 {
236 if (last != first)
237 {
238 memmove (first, last, (end () - last) * sizeof (T));
239 _last -= last - first;
240 }
241 }
242
243 void erase (iterator pos)
244 {
245 if (pos != end ())
246 {
247 memmove (pos, pos + 1, (end () - (pos + 1)) * sizeof (T));
248 --_last;
249 }
250 }
251
252 void swap (simplevec<T> &t)
253 {
254 ::swap (_last, t._last);
255 ::swap (_size, t._size);
256 ::swap (_buf, t._buf);
257 } 410 }
258}; 411};
259 412
260template<class T> 413template<class T>
261bool operator ==(const simplevec<T> &v1, const simplevec<T> &v2) 414bool operator ==(const simplevec<T> &v1, const simplevec<T> &v2)

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines