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.13 by root, Wed Dec 21 14:19:19 2005 UTC vs.
Revision 1.21 by root, Sun Jan 29 20:51:28 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)
5 11
6extern class byteorder { 12extern class byteorder {
7 static unsigned int e; // at least 32 bits 13 static unsigned int e; // at least 32 bits
8public: 14public:
9 byteorder (); 15 byteorder ();
… …
12 static bool network () { return e == 0x11223344; }; 18 static bool network () { return e == 0x11223344; };
13 static bool little_endian () { return e == 0x44332211; }; 19 static bool little_endian () { return e == 0x44332211; };
14 static bool vax () { return e == 0x44332211; }; 20 static bool vax () { return e == 0x44332211; };
15} byteorder; 21} byteorder;
16 22
23// various utility functions
17template<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 T min (T a, U b) { return a < (T)b ? a : (T)b; }
18template<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 void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
19template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 26template<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 void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } 27template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
21 28
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; } 29template<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 void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; } 30template<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; }
24 31
32template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
33
34// linear interpolation
25template<typename T, typename U> 35template<typename T, typename U, typename P>
26static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 36static inline
37T lerp (T a, U b, P p)
38{
39 return (int(a) * int(p) + int(b) * int(100 - p)) / 100;
40}
27 41
28// in range including end 42// in range including end
29#define IN_RANGE_INC(val,beg,end) \ 43#define IN_RANGE_INC(val,beg,end) \
30 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 44 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
31 45
32// in range excluding end 46// in range excluding end
33#define IN_RANGE_EXC(val,beg,end) \ 47#define IN_RANGE_EXC(val,beg,end) \
34 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 48 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
35 49
50// makes dynamically allocated objects zero-initialised
36struct zero_initialized { 51struct zero_initialized {
37 void *operator new (size_t s); 52 void *operator new (size_t s);
38 void operator delete (void *p, size_t s); 53 void operator delete (void *p, size_t s);
39}; 54};
40 55
… …
250 return pos; 265 return pos;
251 } 266 }
252 void erase (iterator first, iterator last) 267 void erase (iterator first, iterator last)
253 { 268 {
254 if (last != first) { 269 if (last != first) {
255 memmove (first, last, (end ()-last)*sizeof (T)); 270 memmove (first, last, (end () - last) * sizeof (T));
256 _last -= last - first; 271 _last -= last - first;
257 } 272 }
258 } 273 }
259 void erase (iterator pos) 274 void erase (iterator pos)
260 { 275 {
261 if (pos != end ()) { 276 if (pos != end ()) {
262 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 277 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
263 --_last; 278 --_last;
264 } 279 }
265 } 280 }
266 void swap (simplevec<T> &t) 281 void swap (simplevec<T> &t)
267 { 282 {
… …
385struct stringvec : simplevec<char *> 400struct stringvec : simplevec<char *>
386{ 401{
387 ~stringvec () 402 ~stringvec ()
388 { 403 {
389 for (char **c = begin (); c != end (); c++) 404 for (char **c = begin (); c != end (); c++)
390 delete [] *c; 405 free (*c);
391 } 406 }
392}; 407};
393 408
409// return a very temporary (and never deallocated) buffer. keep small.
410void *rxvt_temp_buf (int len);
411
412template<typename T>
413inline T *
414rxvt_temp_buf (int len)
415{
416 return (T *)rxvt_temp_buf (len * sizeof (T));
417}
418
394#endif 419#endif
395 420

Diff Legend

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