| 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 | |
| 6 | extern class byteorder { |
12 | extern class byteorder { |
| 7 | static unsigned int e; // at least 32 bits |
13 | static unsigned int e; // at least 32 bits |
| 8 | public: |
14 | public: |
| 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 | |
| 17 | template<typename T, typename U> |
23 | // various utility functions |
| 18 | static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
24 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
| 19 | template<typename T, typename U> |
25 | template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
| 20 | static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
26 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
| 21 | template<typename T> |
27 | template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } |
| 22 | static inline void swap (T& a, T& b) { T t=a; a=b; b=t; } |
28 | |
|
|
29 | template<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; } |
|
|
30 | template<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; } |
|
|
31 | |
|
|
32 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
| 23 | |
33 | |
| 24 | // in range including end |
34 | // in range including end |
| 25 | #define IN_RANGE_INC(val,beg,end) \ |
35 | #define IN_RANGE_INC(val,beg,end) \ |
| 26 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
36 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
| 27 | |
37 | |
| 28 | // in range excluding end |
38 | // in range excluding end |
| 29 | #define IN_RANGE_EXC(val,beg,end) \ |
39 | #define IN_RANGE_EXC(val,beg,end) \ |
| 30 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
40 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
| 31 | |
41 | |
|
|
42 | // makes dynamically allocated objects zero-initialised |
| 32 | struct zero_initialized { |
43 | struct zero_initialized { |
| 33 | void *operator new (size_t s); |
44 | void *operator new (size_t s); |
| 34 | void operator delete (void *p, size_t s); |
45 | void operator delete (void *p, size_t s); |
| 35 | }; |
46 | }; |
| 36 | |
47 | |
| … | |
… | |
| 246 | return pos; |
257 | return pos; |
| 247 | } |
258 | } |
| 248 | void erase (iterator first, iterator last) |
259 | void erase (iterator first, iterator last) |
| 249 | { |
260 | { |
| 250 | if (last != first) { |
261 | if (last != first) { |
| 251 | memmove (first, last, (end ()-last)*sizeof (T)); |
262 | memmove (first, last, (end () - last) * sizeof (T)); |
| 252 | _last -= last - first; |
263 | _last -= last - first; |
| 253 | } |
264 | } |
| 254 | } |
265 | } |
| 255 | void erase (iterator pos) |
266 | void erase (iterator pos) |
| 256 | { |
267 | { |
| 257 | if (pos != end ()) { |
268 | if (pos != end ()) { |
| 258 | memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); |
269 | memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T)); |
| 259 | --_last; |
270 | --_last; |
| 260 | } |
271 | } |
| 261 | } |
272 | } |
| 262 | void swap (simplevec<T> &t) |
273 | void swap (simplevec<T> &t) |
| 263 | { |
274 | { |
| … | |
… | |
| 381 | struct stringvec : simplevec<char *> |
392 | struct stringvec : simplevec<char *> |
| 382 | { |
393 | { |
| 383 | ~stringvec () |
394 | ~stringvec () |
| 384 | { |
395 | { |
| 385 | for (char **c = begin (); c != end (); c++) |
396 | for (char **c = begin (); c != end (); c++) |
| 386 | delete [] *c; |
397 | free (*c); |
| 387 | } |
398 | } |
| 388 | }; |
399 | }; |
| 389 | |
400 | |
|
|
401 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
402 | void *rxvt_temp_buf (int len); |
|
|
403 | |
|
|
404 | template<typename T> |
|
|
405 | inline T * |
|
|
406 | rxvt_temp_buf (int len) |
|
|
407 | { |
|
|
408 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
409 | } |
|
|
410 | |
| 390 | #endif |
411 | #endif |
| 391 | |
412 | |
