ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/rxvt-unicode/src/rxvtutil.h
(Generate patch)

Comparing rxvt-unicode/src/rxvtutil.h (file contents):
Revision 1.18 by root, Tue Jan 17 16:06:48 2006 UTC vs.
Revision 1.45 by sf-exg, Mon May 30 18:39:04 2011 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines