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