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 | #include "ecb.h" |
5 | |
7 | |
6 | #define PP_CONCAT_(a, b) a ## b |
8 | using namespace std; |
7 | #define PP_CONCAT(a, b) PP_CONCAT_(a, b) |
|
|
8 | #define PP_STRINGIFY_(a) #a |
|
|
9 | #define PP_STRINGIFY(a) PP_STRINGIFY_(a) |
|
|
10 | |
9 | |
11 | extern class byteorder { |
10 | // increases code size unless -fno-enforce-eh-specs |
12 | static unsigned int e; // at least 32 bits |
11 | #if __GNUC__ |
13 | public: |
12 | # define NOTHROW |
14 | byteorder (); |
13 | # define THROW(x) |
15 | |
14 | #else |
16 | static bool big_endian () { return e == 0x11223344; }; |
15 | # define NOTHROW throw() |
17 | static bool network () { return e == 0x11223344; }; |
16 | # define THROW(x) throw x |
18 | static bool little_endian () { return e == 0x44332211; }; |
17 | #endif |
19 | static bool vax () { return e == 0x44332211; }; |
|
|
20 | } byteorder; |
|
|
21 | |
18 | |
22 | // various utility functions |
19 | // various utility functions |
23 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
20 | 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 void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; } |
21 | 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 T max (T a, U b) { return a > (T)b ? a : (T)b; } |
22 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
… | |
… | |
28 | 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; } |
25 | 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 void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; } |
26 | 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 | |
27 | |
31 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
28 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
32 | |
29 | |
|
|
30 | template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); } |
|
|
31 | |
|
|
32 | // linear interpolation |
|
|
33 | template<typename T, typename U, typename P> |
|
|
34 | static inline |
|
|
35 | T lerp (T a, U b, P p) |
|
|
36 | { |
|
|
37 | return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100; |
|
|
38 | } |
|
|
39 | |
|
|
40 | template <typename I, typename T> |
|
|
41 | I find (I first, I last, const T& value) |
|
|
42 | { |
|
|
43 | while (first != last && *first != value) |
|
|
44 | ++first; |
|
|
45 | |
|
|
46 | return first; |
|
|
47 | } |
|
|
48 | |
|
|
49 | // return a very temporary (and never deallocated) buffer. keep small. |
|
|
50 | void *rxvt_temp_buf (int len); |
|
|
51 | |
|
|
52 | template<typename T> |
|
|
53 | static inline T * |
|
|
54 | rxvt_temp_buf (int len) |
|
|
55 | { |
|
|
56 | return (T *)rxvt_temp_buf (len * sizeof (T)); |
|
|
57 | } |
|
|
58 | |
33 | // in range including end |
59 | // in range including end |
34 | #define IN_RANGE_INC(val,beg,end) \ |
60 | #define IN_RANGE_INC(val,beg,end) \ |
35 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
61 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
36 | |
62 | |
37 | // in range excluding end |
63 | // in range excluding end |
38 | #define IN_RANGE_EXC(val,beg,end) \ |
64 | #define IN_RANGE_EXC(val,beg,end) \ |
39 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
65 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
40 | |
66 | |
|
|
67 | // for m >= -n, ensure remainder lies between 0..n-1 |
|
|
68 | #define MOD(m,n) (((m) + (n)) % (n)) |
|
|
69 | |
41 | // makes dynamically allocated objects zero-initialised |
70 | // makes dynamically allocated objects zero-initialised |
42 | struct zero_initialized { |
71 | struct zero_initialized |
|
|
72 | { |
43 | void *operator new (size_t s); |
73 | void *operator new (size_t s); |
44 | void operator delete (void *p, size_t s); |
74 | void operator delete (void *p, size_t s); |
45 | }; |
75 | }; |
46 | |
76 | |
47 | /* simplevec taken (and heavily modified), from: |
77 | /* simplevec taken (and heavily modified), from: |
48 | * |
78 | * |
49 | * MICO --- a free CORBA implementation |
79 | * MICO --- a free CORBA implementation |
50 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
80 | * Copyright (C) 1997-98 Kay Roemer & Arno Puder |
51 | */ |
81 | */ |
52 | template<class T> |
82 | template<class T> |
53 | struct simplevec { |
83 | struct simplevec |
|
|
84 | { |
54 | typedef T* iterator; |
85 | typedef T* iterator; |
55 | typedef const T* const_iterator; |
86 | typedef const T* const_iterator; |
56 | typedef unsigned long size_type; |
87 | typedef unsigned long size_type; |
57 | |
88 | |
58 | private: |
89 | private: |
… | |
… | |
299 | } |
330 | } |
300 | |
331 | |
301 | |
332 | |
302 | template<typename T> |
333 | template<typename T> |
303 | struct vector : simplevec<T> |
334 | struct vector : simplevec<T> |
304 | { }; |
335 | { |
|
|
336 | }; |
|
|
337 | |
|
|
338 | struct stringvec : simplevec<char *> |
|
|
339 | { |
|
|
340 | ~stringvec () |
|
|
341 | { |
|
|
342 | for (char **c = begin (); c != end (); c++) |
|
|
343 | free (*c); |
|
|
344 | } |
|
|
345 | }; |
305 | |
346 | |
306 | #if 0 |
347 | #if 0 |
307 | template<typename T> |
348 | template<typename T> |
308 | struct rxvt_vec : simplevec<void *> { |
349 | struct rxvt_vec : simplevec<void *> |
|
|
350 | { |
309 | typedef T *iterator; |
351 | typedef T *iterator; |
310 | |
352 | |
311 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
353 | void push_back (T d) { simplevec<void *>::push_back ((void *)d); } |
312 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
354 | T pop_back () { return (T*)simplevec<void *>::pop_back (); } |
313 | void erase (int i) { erase (begin () + i); } |
355 | void erase (int i) { erase (begin () + i); } |
… | |
… | |
317 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
359 | T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } |
318 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
360 | const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } |
319 | }; |
361 | }; |
320 | #endif |
362 | #endif |
321 | |
363 | |
322 | template <typename I, typename T> |
|
|
323 | I find (I first, I last, const T& value) |
|
|
324 | { |
|
|
325 | while (first != last && *first != value) |
|
|
326 | ++first; |
|
|
327 | |
|
|
328 | return first; |
|
|
329 | } |
|
|
330 | |
|
|
331 | template<typename T> |
364 | template<typename T> |
332 | struct auto_ptr { |
365 | struct auto_ptr |
|
|
366 | { |
333 | T *p; |
367 | T *p; |
334 | |
368 | |
335 | auto_ptr () : p (0) { } |
369 | auto_ptr () : p (0) { } |
336 | auto_ptr (T *a) : p (a) { } |
370 | auto_ptr (T *a) : p (a) { } |
337 | |
371 | |
… | |
… | |
386 | } |
420 | } |
387 | }; |
421 | }; |
388 | |
422 | |
389 | typedef auto_ptr<char> auto_str; |
423 | typedef auto_ptr<char> auto_str; |
390 | |
424 | |
391 | struct stringvec : simplevec<char *> |
|
|
392 | { |
|
|
393 | ~stringvec () |
|
|
394 | { |
|
|
395 | for (char **c = begin (); c != end (); c++) |
|
|
396 | delete [] *c; |
|
|
397 | } |
|
|
398 | }; |
|
|
399 | |
|
|
400 | #endif |
425 | #endif |
401 | |
426 | |