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.2 by sf-exg, Sat Jan 21 13:44:38 2012 UTC vs.
Revision 1.18 by root, Thu May 24 11:03:47 2012 UTC

1#ifndef ESTL_H 1#ifndef ESTL_H_
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
12template <typename I, typename T> 14template <typename I, typename T>
13I find (I first, I last, const T& value) 15I find (I first, I last, const T& value)
14{ 16{
15 while (first != last && *first != value) 17 while (first != last && *first != value)
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 __cplusplus >= 201103L
24 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 26 #include <type_traits>
25 */ 27#endif
28
29// 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 (e.g. at())
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// - no bool specialisation
26template<class T> 38template<class T>
27struct simplevec 39struct simplevec
28{ 40{
29 typedef T* iterator; 41#if ESTL_BIG_VECTOR
30 typedef const T* const_iterator; 42 // shoudl use size_t/ssize_t, but that's not portable enough for us
31 typedef unsigned long size_type; 43 typedef unsigned long size_type;
44 typedef long difference_type;
45#else
46 typedef uint32_t size_type;
47 typedef int32_t difference_type;
48#endif
49
50 typedef T value_type;
51 typedef T *iterator;
52 typedef const T *const_iterator;
53 typedef T *pointer;
54 typedef const T *const_pointer;
55 typedef T &reference;
56 typedef const T &const_reference;
57 // missing: allocator_type
58 // missing: reverse iterator
32 59
33private: 60private:
34 size_type _last, _size; 61 size_type sze, res;
35 T *_buf; 62 T *buf;
63
64 // we shamelessly optimise for "simple" types. everything
65 // "not simple enough" will use the slow path.
66 static bool is_simple_enough ()
67 {
68 #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 static void construct (iterator a, size_type n = 1)
84 {
85 if (!is_simple_enough ())
86 while (n--)
87 new (a++) T ();
88 }
89
90 static void destruct (iterator a, size_type n = 1)
91 {
92 if (!is_simple_enough ())
93 while (n--)
94 (*a++).~T ();
95 }
96
97 template<class I>
98 static void cop_new (iterator a, I b) { new (a) T (*b); }
99 template<class I>
100 static void cop_set (iterator a, I b) { *a = *b ; }
101
102 // MUST copy forwards
103 template<class I>
104 static void copy (iterator dst, I src, size_type n, void (*op)(iterator, I))
105 {
106 while (n--)
107 op (dst++, src++);
108 }
109
110 static void copy (iterator dst, iterator src, size_type n, void (*op)(iterator, iterator))
111 {
112 if (is_simple_enough ())
113 memcpy (dst, src, sizeof (T) * n);
114 else
115 copy<iterator> (dst, src, n, op);
116 }
117
118 static T *alloc (size_type n) ecb_cold
119 {
120 return (T *)::operator new ((size_t) (sizeof (T) * n));
121 }
122
123 void dealloc () ecb_cold
124 {
125 destruct (buf, sze);
126 ::operator delete (buf);
127 }
128
129 size_type good_size (size_type n) ecb_cold
130 {
131 return n ? 2UL << ecb_ld32 (n) : 5;
132 }
133
134 void ins (iterator where, size_type n)
135 {
136 size_type pos = where - begin ();
137
138 if (ecb_expect_false (sze + n > res))
139 {
140 res = good_size (sze + n);
141
142 T *nbuf = alloc (res);
143 copy (nbuf, buf, sze, cop_new);
144 dealloc ();
145 buf = nbuf;
146 }
147
148 construct (buf + sze, n);
149
150 sze += n;
151
152 iterator src = buf + pos;
153 if (is_simple_enough ())
154 memmove (src + n, src, sizeof (T) * n);
155 else
156 for (size_type i = n; i--; )
157 cop_set (src + n + i, src + i);
158 }
36 159
37public: 160public:
38 const_iterator begin () const 161 size_type capacity () const { return res; }
162 size_type size () const { return sze; }
163 bool empty () const { return size () == 0; }
164
165 size_t max_size () const
166 {
167 return (~(size_type)0) >> 1;
168 }
169
170 const_iterator begin () const { return &buf [ 0]; }
171 iterator begin () { return &buf [ 0]; }
172 const_iterator end () const { return &buf [sze ]; }
173 iterator end () { return &buf [sze ]; }
174 const_reference front () const { return buf [ 0]; }
175 reference front () { return buf [ 0]; }
176 const_reference back () const { return buf [sze - 1]; }
177 reference back () { return buf [sze - 1]; }
178
179 void reserve (size_type sz)
180 {
181 if (ecb_expect_true (sz <= res))
182 return;
183
184 sz = good_size (sz);
185 T *nbuf = alloc (sz);
186
187 copy (nbuf, begin (), sze, cop_new);
188 dealloc ();
189
190 buf = nbuf;
191 res = sz;
192 }
193
194 void resize (size_type sz)
195 {
196 reserve (sz);
197
198 if (is_simple_enough ())
199 sze = sz;
200 else
201 {
202 while (sze < sz) construct (buf + sze++);
203 while (sze > sz) destruct (buf + --sze);
204 }
205 }
206
207 simplevec ()
208 : sze(0), res(0), buf(0)
209 {
210 }
211
212 simplevec (size_type n, const T &t = T ())
213 {
214 sze = res = n;
215 buf = alloc (sze);
216
217 while (n--)
218 new (buf + n) T (t);
219 }
220
221 template<class I>
222 simplevec (I first, I last)
223 {
224 sze = res = last - first;
225 buf = alloc (sze);
226 copy (buf, first, sze, cop_new);
227 }
228
229 simplevec (const simplevec<T> &v)
230 : sze(0), res(0), buf(0)
231 {
232 sze = res = v.size ();
233 buf = alloc (sze);
234 copy (buf, v.begin (), sze, cop_new);
235 }
236
237 ~simplevec ()
238 {
239 dealloc ();
240 }
241
242 void swap (simplevec<T> &t)
243 {
244 ::swap (sze, t.sze);
245 ::swap (res, t.res);
246 ::swap (buf, t.buf);
247 }
248
249 void clear ()
250 {
251 destruct (buf, sze);
252 sze = 0;
253 }
254
255 void push_back (const T &t)
256 {
257 reserve (sze + 1);
258 new (buf + sze++) T (t);
259 }
260
261 void pop_back ()
262 {
263 destruct (buf + --sze);
264 }
265
266 const_reference operator [](size_type idx) const { return buf[idx]; }
267 reference operator [](size_type idx) { return buf[idx]; }
268
269 const_reference at (size_type idx) const { return buf [idx]; }
270 reference at (size_type idx) { return buf [idx]; }
271
272 template<class I>
273 void assign (I first, I last)
274 {
275 swap (simplevec<T> (first, last));
276 }
277
278 void assign (size_type n, const T &t)
279 {
280 swap (simplevec<T> (n, t));
281 }
282
283 simplevec<T> &operator= (const simplevec<T> &v)
284 {
285 assign (v.begin (), v.end ());
286 return *this;
287 }
288
289 iterator insert (iterator pos, const T &t)
290 {
291 size_type at = pos - begin ();
292
293 ins (pos, 1);
294 buf [at] = t;
295
296 return buf + at;
297 }
298
299 template<class I>
300 iterator insert (iterator pos, I first, I last)
301 {
302 size_type n = last - first;
303 size_type at = pos - begin ();
304
305 ins (pos, n);
306 copy (buf + at, first, n, cop_set);
307
308 return buf + at;
309 }
310
311 iterator insert (iterator pos, size_type n, const T &t)
312 {
313 size_type at = pos - begin ();
314
315 ins (pos, n);
316
317 for (iterator i = buf + at; n--; )
318 *i++ = t;
319
320 return buf + at;
321 }
322
323 void erase (iterator first, iterator last)
324 {
325 size_t n = last - first;
326
327 if (is_simple_enough ())
328 memmove (first, last, sizeof (T) * n);
329 else
330 copy<iterator> (first, last, n, cop_set);
331
332 sze -= n;
333 destruct (buf + sze, n);
334 }
335
336 void erase (iterator pos)
337 {
338 if (pos != end ())
339 erase (pos, pos + 1);
340 }
341};
342
343template<class T>
344bool operator ==(const simplevec<T> &v1, const simplevec<T> &v2)
345{
346 if (v1.size () != v2.size ()) return false;
347
348 return !v1.size () || !memcmp (&v1[0], &v2[0], v1.size () * sizeof (T));
349}
350
351template<class T>
352bool operator <(const simplevec<T> &v1, const simplevec<T> &v2)
353{
354 unsigned long minlast = min (v1.size (), v2.size ());
355
356 for (unsigned long i = 0; i < minlast; ++i)
39 { 357 {
40 return &_buf[0]; 358 if (v1[i] < v2[i]) return true;
359 if (v2[i] < v1[i]) return false;
41 } 360 }
42 iterator begin ()
43 {
44 return &_buf[0];
45 }
46 const_iterator end () const
47 {
48 return &_buf[_last];
49 }
50 iterator end ()
51 {
52 return &_buf[_last];
53 }
54 size_type capacity () const
55 {
56 return _size;
57 }
58 size_type size () const
59 {
60 return _last;
61 }
62
63private:
64 static T *alloc (size_type n)
65 {
66 return (T *)::operator new ((size_t) (n * sizeof (T)));
67 }
68 static void dealloc (T *buf)
69 {
70 if (buf)
71 ::operator delete (buf);
72 }
73
74 void reserve (iterator where, size_type n)
75 {
76 if (_last + n <= _size) {
77 memmove (where+n, where, (end ()-where)*sizeof (T));
78 } else {
79 size_type sz = _last+n;
80 sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
81 T *nbuf = alloc (sz);
82 if (_buf) {
83 memcpy (nbuf, begin (), (where-begin ())*sizeof (T));
84 memcpy (nbuf + (where-begin ()) + n, where,
85 (end ()-where)*sizeof (T));
86 dealloc (_buf);
87 }
88 _buf = nbuf;
89 _size = sz;
90 }
91 }
92
93public:
94 void reserve (size_type sz)
95 {
96 if (_size < sz) {
97 sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
98 T *nbuf = alloc (sz);
99 if (_buf) {
100 memcpy (nbuf, begin (), size ()*sizeof (T));
101 dealloc (_buf);
102 }
103 _buf = nbuf;
104 _size = sz;
105 }
106 }
107 simplevec ()
108 : _last(0), _size(0), _buf(0)
109 {
110 }
111 simplevec (size_type n, const T& t = T ())
112 : _last(0), _size(0), _buf(0)
113 {
114 insert (begin (), n, t);
115 }
116 simplevec (const_iterator first, const_iterator last)
117 : _last(0), _size(0), _buf(0)
118 {
119 insert (begin (), first, last);
120 }
121 simplevec (const simplevec<T> &v)
122 : _last(0), _size(0), _buf(0)
123 {
124 reserve (v._last);
125 memcpy (_buf, v.begin (), v.size ()*sizeof (T));
126 _last = v._last;
127 }
128 simplevec<T> &operator= (const simplevec<T> &v)
129 {
130 if (this != &v) {
131 _last = 0;
132 reserve (v._last);
133 memcpy (_buf, v.begin (), v.size ()*sizeof (T));
134 _last = v._last;
135 }
136 return *this;
137 }
138 ~simplevec ()
139 {
140 dealloc (_buf);
141 }
142 const T &front () const
143 {
144 //ministl_assert (size () > 0);
145 return _buf[0];
146 }
147 T &front ()
148 {
149 //ministl_assert (size () > 0);
150 return _buf[0];
151 }
152 const T &back () const
153 {
154 //ministl_assert (size () > 0);
155 return _buf[_last-1];
156 }
157 T &back ()
158 {
159 //ministl_assert (size () > 0);
160 return _buf[_last-1];
161 }
162 bool empty () const
163 {
164 return _last == 0;
165 }
166 void clear ()
167 {
168 _last = 0;
169 }
170 void push_back (const T &t)
171 {
172 reserve (_last+1);
173 *end () = t;
174 ++_last;
175 }
176 void push_back (T &t)
177 {
178 reserve (_last+1);
179 *end () = t;
180 ++_last;
181 }
182 void pop_back ()
183 {
184 //ministl_assert (size () > 0);
185 --_last;
186 }
187 const T &operator[] (size_type idx) const
188 {
189 //ministl_assert (idx < size ());
190 return _buf[idx];
191 }
192 T &operator[] (size_type idx)
193 {
194 //ministl_assert (idx < size ());
195 return _buf[idx];
196 }
197 iterator insert (iterator pos, const T &t)
198 {
199 //ministl_assert (pos <= end ());
200 long at = pos - begin ();
201 reserve (pos, 1);
202 pos = begin ()+at;
203 *pos = t;
204 ++_last;
205 return pos;
206 }
207 iterator insert (iterator pos, const_iterator first, const_iterator last)
208 {
209 //ministl_assert (pos <= end ());
210 long n = last - first;
211 long at = pos - begin ();
212 if (n > 0) {
213 reserve (pos, n);
214 pos = begin ()+at;
215 memcpy (pos, first, (last-first)*sizeof (T));
216 _last += n;
217 }
218 return pos;
219 }
220 iterator insert (iterator pos, size_type n, const T &t)
221 {
222 //ministl_assert (pos <= end ());
223 long at = pos - begin ();
224 if (n > 0) {
225 reserve (pos, n);
226 pos = begin ()+at;
227 for (int i = 0; i < n; ++i)
228 pos[i] = t;
229 _last += n;
230 }
231 return pos;
232 }
233 void erase (iterator first, iterator last)
234 {
235 if (last != first) {
236 memmove (first, last, (end () - last) * sizeof (T));
237 _last -= last - first;
238 }
239 }
240 void erase (iterator pos)
241 {
242 if (pos != end ()) {
243 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
244 --_last;
245 }
246 }
247 void swap (simplevec<T> &t)
248 {
249 ::swap(_last, t._last);
250 ::swap(_size, t._size);
251 ::swap(_buf, t._buf);
252 }
253};
254
255template<class T>
256bool operator== (const simplevec<T> &v1, const simplevec<T> &v2)
257{
258 if (v1.size () != v2.size ())
259 return false;
260 return !v1.size () || !memcmp (&v1[0], &v2[0], v1.size ()*sizeof (T));
261}
262
263template<class T>
264bool operator< (const simplevec<T> &v1, const simplevec<T> &v2)
265{
266 unsigned long minlast = min (v1.size (), v2.size ());
267 for (unsigned long i = 0; i < minlast; ++i) {
268 if (v1[i] < v2[i])
269 return true;
270 if (v2[i] < v1[i])
271 return false;
272 }
273 return v1.size () < v2.size (); 361 return v1.size () < v2.size ();
274} 362}
275 363
276template<typename T> 364template<typename T>
277struct vector : simplevec<T> 365struct vector : simplevec<T>
278{ 366{
279}; 367};
280 368
281#endif 369#endif
370

Diff Legend

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