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.8 by root, Sun Jan 16 15:59:45 2005 UTC vs.
Revision 1.23 by root, Sun Jan 29 22:30:21 2006 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 <cstring> 5#include <cstring>
6
7#define PP_CONCAT_(a, b) a ## b
8#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
9#define PP_STRINGIFY_(a) #a
10#define PP_STRINGIFY(a) PP_STRINGIFY_(a)
11
12// actually, some gcc-3.x versions work, too
13#define HAVE_GCC_BUILTINS (__GNUC__ >= 4)
5 14
6extern class byteorder { 15extern class byteorder {
7 static unsigned int e; // at least 32 bits 16 static unsigned int e; // at least 32 bits
8public: 17public:
9 byteorder (); 18 byteorder ();
… …
12 static bool network () { return e == 0x11223344; }; 21 static bool network () { return e == 0x11223344; };
13 static bool little_endian () { return e == 0x44332211; }; 22 static bool little_endian () { return e == 0x44332211; };
14 static bool vax () { return e == 0x44332211; }; 23 static bool vax () { return e == 0x44332211; };
15} byteorder; 24} byteorder;
16 25
26// various utility functions
27template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
28template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
29template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
30template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
31
32template<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; }
33template<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; }
34
35template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
36
37// linear interpolation
17template<typename T, typename U> 38template<typename T, typename U, typename P>
18static inline T min (T a, U b) { return a < b ? a : (T)b; } 39static inline
19template<typename T, typename U> 40T lerp (T a, U b, P p)
20static inline T max (T a, U b) { return a > b ? a : (T)b; } 41{
21template<typename T> 42 return (int(a) * int(p) + int(b) * int(100 - p)) / 100;
22static inline void swap (T& a, T& b) { T t=a; a=b; b=t; } 43}
23 44
45// some bit functions, xft fuck me plenty
46#if HAVE_GCC_BUILTINS
47static inline int ctz (unsigned int x) { return __builtin_ctz (x); }
48static inline int popcount (unsigned int x) { return __builtin_popcount (x); }
49#else
50// count trailing zero bits and count # of one bits
51int ctz (unsigned int x);
52int popcount (unsigned int x);
53#endif
24 54
55// in range including end
56#define IN_RANGE_INC(val,beg,end) \
57 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
58
59// in range excluding end
60#define IN_RANGE_EXC(val,beg,end) \
61 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
62
63// makes dynamically allocated objects zero-initialised
25struct zero_initialized { 64struct zero_initialized {
26 void *operator new (size_t s); 65 void *operator new (size_t s);
27 void operator delete (void *p, size_t s); 66 void operator delete (void *p, size_t s);
28}; 67};
29 68
… …
239 return pos; 278 return pos;
240 } 279 }
241 void erase (iterator first, iterator last) 280 void erase (iterator first, iterator last)
242 { 281 {
243 if (last != first) { 282 if (last != first) {
244 memmove (first, last, (end ()-last)*sizeof (T)); 283 memmove (first, last, (end () - last) * sizeof (T));
245 _last -= last - first; 284 _last -= last - first;
246 } 285 }
247 } 286 }
248 void erase (iterator pos) 287 void erase (iterator pos)
249 { 288 {
250 if (pos != end ()) { 289 if (pos != end ()) {
251 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 290 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
252 --_last; 291 --_last;
253 } 292 }
254 } 293 }
255 void swap (simplevec<T> &t) 294 void swap (simplevec<T> &t)
256 { 295 {
… …
374struct stringvec : simplevec<char *> 413struct stringvec : simplevec<char *>
375{ 414{
376 ~stringvec () 415 ~stringvec ()
377 { 416 {
378 for (char **c = begin (); c != end (); c++) 417 for (char **c = begin (); c != end (); c++)
379 delete [] *c; 418 free (*c);
380 } 419 }
381}; 420};
382 421
422// return a very temporary (and never deallocated) buffer. keep small.
423void *rxvt_temp_buf (int len);
424
425template<typename T>
426inline T *
427rxvt_temp_buf (int len)
428{
429 return (T *)rxvt_temp_buf (len * sizeof (T));
430}
431
383#endif 432#endif
384 433

Diff Legend

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