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.16 by root, Wed Jan 11 00:59:58 2006 UTC vs.
Revision 1.48 by root, Thu Jan 19 17:10:51 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 <stdlib.h>
4#include <cstring> 5#include <string.h>
6#include "ecb.h"
5 7
6#define PP_CONCAT_(a, b) a ## b 8// increases code size unless -fno-enforce-eh-specs
7#define PP_CONCAT(a, b) PP_CONCAT_(a, b) 9#if __GNUC__
8#define PP_STRINGIFY_(a) #a 10# define NOTHROW
9#define PP_STRINGIFY(a) PP_STRINGIFY_(a) 11# define THROW(x)
10 12#else
11extern class byteorder { 13# define NOTHROW throw()
12 static unsigned int e; // at least 32 bits 14# define THROW(x) throw x
13public: 15#endif
14 byteorder ();
15
16 static bool big_endian () { return e == 0x11223344; };
17 static bool network () { return e == 0x11223344; };
18 static bool little_endian () { return e == 0x44332211; };
19 static bool vax () { return e == 0x44332211; };
20} byteorder;
21 16
22// various utility functions 17// various utility functions
23template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 18template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
24template<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; }
25template<typename T, typename U> static inline T max (T a, U b) { return 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; }
… …
28template<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; } 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; }
29template<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; } 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; }
30 25
31template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 26template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
32 27
28template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }
29
30// linear interpolation
31template<typename T, typename U, typename P>
32static inline
33T lerp (T a, U b, P p)
34{
35 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}
46
47// return a very temporary (and never deallocated) buffer. keep small.
48void *rxvt_temp_buf (int len);
49
50template<typename T>
51static inline T *
52rxvt_temp_buf (int len)
53{
54 return (T *)rxvt_temp_buf (len * sizeof (T));
55}
56
33// in range including end 57// in range including end
34#define IN_RANGE_INC(val,beg,end) \ 58#define IN_RANGE_INC(val,beg,end) \
35 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 59 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
36 60
37// in range excluding end 61// in range excluding end
38#define IN_RANGE_EXC(val,beg,end) \ 62#define IN_RANGE_EXC(val,beg,end) \
39 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 63 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
40 64
65// for m >= -n, ensure remainder lies between 0..n-1
66#define MOD(m,n) (((m) + (n)) % (n))
67
41// makes dynamically allocated objects zero-initialised 68// makes dynamically allocated objects zero-initialised
42struct zero_initialized { 69struct zero_initialized
70{
43 void *operator new (size_t s); 71 void *operator new (size_t s);
44 void operator delete (void *p, size_t s); 72 void operator delete (void *p, size_t s);
45}; 73};
46 74
47/* simplevec taken (and heavily modified), from: 75/* simplevec taken (and heavily modified), from:
48 * 76 *
49 * MICO --- a free CORBA implementation 77 * MICO --- a free CORBA implementation
50 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 78 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
51 */ 79 */
52template<class T> 80template<class T>
53struct simplevec { 81struct simplevec
82{
54 typedef T* iterator; 83 typedef T* iterator;
55 typedef const T* const_iterator; 84 typedef const T* const_iterator;
56 typedef unsigned long size_type; 85 typedef unsigned long size_type;
57 86
58private: 87private:
… …
256 return pos; 285 return pos;
257 } 286 }
258 void erase (iterator first, iterator last) 287 void erase (iterator first, iterator last)
259 { 288 {
260 if (last != first) { 289 if (last != first) {
261 memmove (first, last, (end ()-last)*sizeof (T)); 290 memmove (first, last, (end () - last) * sizeof (T));
262 _last -= last - first; 291 _last -= last - first;
263 } 292 }
264 } 293 }
265 void erase (iterator pos) 294 void erase (iterator pos)
266 { 295 {
267 if (pos != end ()) { 296 if (pos != end ()) {
268 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 297 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
269 --_last; 298 --_last;
270 } 299 }
271 } 300 }
272 void swap (simplevec<T> &t) 301 void swap (simplevec<T> &t)
273 { 302 {
… …
299} 328}
300 329
301 330
302template<typename T> 331template<typename T>
303struct vector : simplevec<T> 332struct vector : simplevec<T>
304{ }; 333{
334};
335
336struct stringvec : simplevec<char *>
337{
338 ~stringvec ()
339 {
340 for (char **c = begin (); c != end (); c++)
341 free (*c);
342 }
343};
305 344
306#if 0 345#if 0
307template<typename T> 346template<typename T>
308struct rxvt_vec : simplevec<void *> { 347struct rxvt_vec : simplevec<void *>
348{
309 typedef T *iterator; 349 typedef T *iterator;
310 350
311 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 351 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
312 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 352 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
313 void erase (int i) { erase (begin () + i); } 353 void erase (int i) { erase (begin () + i); }
… …
317 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 357 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
318 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } 358 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
319}; 359};
320#endif 360#endif
321 361
322template <typename I, typename T>
323I find (I first, I last, const T& value)
324{
325 while (first != last && *first != value)
326 ++first;
327
328 return first;
329}
330
331template<typename T> 362template<typename T>
332struct auto_ptr { 363struct auto_ptr
364{
333 T *p; 365 T *p;
334 366
335 auto_ptr () : p (0) { } 367 auto_ptr () : p (0) { }
336 auto_ptr (T *a) : p (a) { } 368 auto_ptr (T *a) : p (a) { }
337 369
… …
386 } 418 }
387}; 419};
388 420
389typedef auto_ptr<char> auto_str; 421typedef auto_ptr<char> auto_str;
390 422
391struct stringvec : simplevec<char *>
392{
393 ~stringvec ()
394 {
395 for (char **c = begin (); c != end (); c++)
396 delete [] *c;
397 }
398};
399
400// temporarily replace the process environment
401extern char **environ;
402
403struct temp_environ
404{
405 char **prev;
406
407 temp_environ (const stringvec *envv)
408 : prev (environ)
409 {
410 if (envv)
411 environ = (char **)envv->begin ();
412 }
413
414 ~temp_environ ()
415 {
416 environ = prev;
417 }
418};
419
420#endif 423#endif
421 424

Diff Legend

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