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