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; } |
|
|
23 | |
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; } |
|
|
33 | |
|
|
34 | // in range including end |
24 | #define IN_RANGE(val,beg,end) \ |
35 | #define IN_RANGE_INC(val,beg,end) \ |
25 | ((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)) |
26 | |
37 | |
|
|
38 | // in range excluding end |
|
|
39 | #define IN_RANGE_EXC(val,beg,end) \ |
|
|
40 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
|
|
41 | |
|
|
42 | // makes dynamically allocated objects zero-initialised |
27 | struct zero_initialized { |
43 | struct zero_initialized { |
28 | void *operator new (size_t s); |
44 | void *operator new (size_t s); |
29 | void operator delete (void *p, size_t s); |
45 | void operator delete (void *p, size_t s); |
30 | }; |
46 | }; |
31 | |
47 | |
… | |
… | |
241 | return pos; |
257 | return pos; |
242 | } |
258 | } |
243 | void erase (iterator first, iterator last) |
259 | void erase (iterator first, iterator last) |
244 | { |
260 | { |
245 | if (last != first) { |
261 | if (last != first) { |
246 | memmove (first, last, (end ()-last)*sizeof (T)); |
262 | memmove (first, last, (end () - last) * sizeof (T)); |
247 | _last -= last - first; |
263 | _last -= last - first; |
248 | } |
264 | } |
249 | } |
265 | } |
250 | void erase (iterator pos) |
266 | void erase (iterator pos) |
251 | { |
267 | { |
252 | if (pos != end ()) { |
268 | if (pos != end ()) { |
253 | memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); |
269 | memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T)); |
254 | --_last; |
270 | --_last; |
255 | } |
271 | } |
256 | } |
272 | } |
257 | void swap (simplevec<T> &t) |
273 | void swap (simplevec<T> &t) |
258 | { |
274 | { |
… | |
… | |
376 | struct stringvec : simplevec<char *> |
392 | struct stringvec : simplevec<char *> |
377 | { |
393 | { |
378 | ~stringvec () |
394 | ~stringvec () |
379 | { |
395 | { |
380 | for (char **c = begin (); c != end (); c++) |
396 | for (char **c = begin (); c != end (); c++) |
381 | delete [] *c; |
397 | free (*c); |
382 | } |
398 | } |
383 | }; |
399 | }; |
384 | |
400 | |
385 | #endif |
401 | #endif |
386 | |
402 | |