ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/rxvt-unicode/src/rxvtutil.h
(Generate patch)

Comparing rxvt-unicode/src/rxvtutil.h (file contents):
Revision 1.48 by root, Thu Jan 19 17:10:51 2012 UTC vs.
Revision 1.49 by sf-exg, Sat Jan 21 13:47:19 2012 UTC

… …
2#define RXVT_UTIL_H 2#define RXVT_UTIL_H
3 3
4#include <stdlib.h> 4#include <stdlib.h>
5#include <string.h> 5#include <string.h>
6#include "ecb.h" 6#include "ecb.h"
7#include "estl.h"
7 8
8// increases code size unless -fno-enforce-eh-specs 9// increases code size unless -fno-enforce-eh-specs
9#if __GNUC__ 10#if __GNUC__
10# define NOTHROW 11# define NOTHROW
11# define THROW(x) 12# define THROW(x)
… …
13# define NOTHROW throw() 14# define NOTHROW throw()
14# define THROW(x) throw x 15# define THROW(x) throw x
15#endif 16#endif
16 17
17// various utility functions 18// various utility functions
18template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
19template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } 19template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
20template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
21template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } 20template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
22 21
23template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } 22template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; }
24template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; } 23template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; }
25
26template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
27 24
28template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } 25template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }
29 26
30// linear interpolation 27// linear interpolation
31template<typename T, typename U, typename P> 28template<typename T, typename U, typename P>
32static inline 29static inline
33T lerp (T a, U b, P p) 30T lerp (T a, U b, P p)
34{ 31{
35 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; 32 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
36}
37
38template <typename I, typename T>
39I find (I first, I last, const T& value)
40{
41 while (first != last && *first != value)
42 ++first;
43
44 return first;
45} 33}
46 34
47// return a very temporary (and never deallocated) buffer. keep small. 35// return a very temporary (and never deallocated) buffer. keep small.
48void *rxvt_temp_buf (int len); 36void *rxvt_temp_buf (int len);
49 37
… …
68// makes dynamically allocated objects zero-initialised 56// makes dynamically allocated objects zero-initialised
69struct zero_initialized 57struct zero_initialized
70{ 58{
71 void *operator new (size_t s); 59 void *operator new (size_t s);
72 void operator delete (void *p, size_t s); 60 void operator delete (void *p, size_t s);
73};
74
75/* simplevec taken (and heavily modified), from:
76 *
77 * MICO --- a free CORBA implementation
78 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
79 */
80template<class T>
81struct simplevec
82{
83 typedef T* iterator;
84 typedef const T* const_iterator;
85 typedef unsigned long size_type;
86
87private:
88 size_type _last, _size;
89 T *_buf;
90
91public:
92 const_iterator begin () const
93 {
94 return &_buf[0];
95 }
96 iterator begin ()
97 {
98 return &_buf[0];
99 }
100 const_iterator end () const
101 {
102 return &_buf[_last];
103 }
104 iterator end ()
105 {
106 return &_buf[_last];
107 }
108 size_type capacity () const
109 {
110 return _size;
111 }
112 size_type size () const
113 {
114 return _last;
115 }
116
117private:
118 static T *alloc (size_type n)
119 {
120 return (T *)::operator new ((size_t) (n * sizeof (T)));
121 }
122 static void dealloc (T *buf)
123 {
124 if (buf)
125 ::operator delete (buf);
126 }
127
128 void reserve (iterator where, size_type n)
129 {
130 if (_last + n <= _size) {
131 memmove (where+n, where, (end ()-where)*sizeof (T));
132 } else {
133 size_type sz = _last+n;
134 sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
135 T *nbuf = alloc (sz);
136 if (_buf) {
137 memcpy (nbuf, begin (), (where-begin ())*sizeof (T));
138 memcpy (nbuf + (where-begin ()) + n, where,
139 (end ()-where)*sizeof (T));
140 dealloc (_buf);
141 }
142 _buf = nbuf;
143 _size = sz;
144 }
145 }
146
147public:
148 void reserve (size_type sz)
149 {
150 if (_size < sz) {
151 sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
152 T *nbuf = alloc (sz);
153 if (_buf) {
154 memcpy (nbuf, begin (), size ()*sizeof (T));
155 dealloc (_buf);
156 }
157 _buf = nbuf;
158 _size = sz;
159 }
160 }
161 simplevec ()
162 : _last(0), _size(0), _buf(0)
163 {
164 }
165 simplevec (size_type n, const T& t = T ())
166 : _last(0), _size(0), _buf(0)
167 {
168 insert (begin (), n, t);
169 }
170 simplevec (const_iterator first, const_iterator last)
171 : _last(0), _size(0), _buf(0)
172 {
173 insert (begin (), first, last);
174 }
175 simplevec (const simplevec<T> &v)
176 : _last(0), _size(0), _buf(0)
177 {
178 reserve (v._last);
179 memcpy (_buf, v.begin (), v.size ()*sizeof (T));
180 _last = v._last;
181 }
182 simplevec<T> &operator= (const simplevec<T> &v)
183 {
184 if (this != &v) {
185 _last = 0;
186 reserve (v._last);
187 memcpy (_buf, v.begin (), v.size ()*sizeof (T));
188 _last = v._last;
189 }
190 return *this;
191 }
192 ~simplevec ()
193 {
194 dealloc (_buf);
195 }
196 const T &front () const
197 {
198 //ministl_assert (size () > 0);
199 return _buf[0];
200 }
201 T &front ()
202 {
203 //ministl_assert (size () > 0);
204 return _buf[0];
205 }
206 const T &back () const
207 {
208 //ministl_assert (size () > 0);
209 return _buf[_last-1];
210 }
211 T &back ()
212 {
213 //ministl_assert (size () > 0);
214 return _buf[_last-1];
215 }
216 bool empty () const
217 {
218 return _last == 0;
219 }
220 void clear ()
221 {
222 _last = 0;
223 }
224 void push_back (const T &t)
225 {
226 reserve (_last+1);
227 *end () = t;
228 ++_last;
229 }
230 void push_back (T &t)
231 {
232 reserve (_last+1);
233 *end () = t;
234 ++_last;
235 }
236 void pop_back ()
237 {
238 //ministl_assert (size () > 0);
239 --_last;
240 }
241 const T &operator[] (size_type idx) const
242 {
243 //ministl_assert (idx < size ());
244 return _buf[idx];
245 }
246 T &operator[] (size_type idx)
247 {
248 //ministl_assert (idx < size ());
249 return _buf[idx];
250 }
251 iterator insert (iterator pos, const T &t)
252 {
253 //ministl_assert (pos <= end ());
254 long at = pos - begin ();
255 reserve (pos, 1);
256 pos = begin ()+at;
257 *pos = t;
258 ++_last;
259 return pos;
260 }
261 iterator insert (iterator pos, const_iterator first, const_iterator last)
262 {
263 //ministl_assert (pos <= end ());
264 long n = last - first;
265 long at = pos - begin ();
266 if (n > 0) {
267 reserve (pos, n);
268 pos = begin ()+at;
269 memcpy (pos, first, (last-first)*sizeof (T));
270 _last += n;
271 }
272 return pos;
273 }
274 iterator insert (iterator pos, size_type n, const T &t)
275 {
276 //ministl_assert (pos <= end ());
277 long at = pos - begin ();
278 if (n > 0) {
279 reserve (pos, n);
280 pos = begin ()+at;
281 for (int i = 0; i < n; ++i)
282 pos[i] = t;
283 _last += n;
284 }
285 return pos;
286 }
287 void erase (iterator first, iterator last)
288 {
289 if (last != first) {
290 memmove (first, last, (end () - last) * sizeof (T));
291 _last -= last - first;
292 }
293 }
294 void erase (iterator pos)
295 {
296 if (pos != end ()) {
297 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
298 --_last;
299 }
300 }
301 void swap (simplevec<T> &t)
302 {
303 ::swap(_last, t._last);
304 ::swap(_size, t._size);
305 ::swap(_buf, t._buf);
306 }
307};
308
309template<class T>
310bool operator== (const simplevec<T> &v1, const simplevec<T> &v2)
311{
312 if (v1.size () != v2.size ())
313 return false;
314 return !v1.size () || !memcmp (&v1[0], &v2[0], v1.size ()*sizeof (T));
315}
316
317template<class T>
318bool operator< (const simplevec<T> &v1, const simplevec<T> &v2)
319{
320 unsigned long minlast = min (v1.size (), v2.size ());
321 for (unsigned long i = 0; i < minlast; ++i) {
322 if (v1[i] < v2[i])
323 return true;
324 if (v2[i] < v1[i])
325 return false;
326 }
327 return v1.size () < v2.size ();
328}
329
330
331template<typename T>
332struct vector : simplevec<T>
333{
334}; 61};
335 62
336struct stringvec : simplevec<char *> 63struct stringvec : simplevec<char *>
337{ 64{
338 ~stringvec () 65 ~stringvec ()

Diff Legend

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