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.45 by sf-exg, Mon May 30 18:39:04 2011 UTC vs.
Revision 1.51 by sf-exg, Fri Apr 13 11:46:37 2012 UTC

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

Diff Legend

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