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.15 by root, Mon Jan 2 15:35:43 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#else
16# define NOTHROW throw()
17# define THROW(x) throw x
18#endif
15 19
16 static bool big_endian () { return e == 0x11223344; }; 20// various utility functions
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
22template<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; }
23template<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; }
24template<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; }
25template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; } 24template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
26 25
27template<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; }
28template<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; }
29 28
30template<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; }
31 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
32// in range including end 60// in range including end
33#define IN_RANGE_INC(val,beg,end) \ 61#define IN_RANGE_INC(val,beg,end) \
34 ((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))
35 63
36// in range excluding end 64// in range excluding end
37#define IN_RANGE_EXC(val,beg,end) \ 65#define IN_RANGE_EXC(val,beg,end) \
38 ((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))
39 67
68// for m >= -n, ensure remainder lies between 0..n-1
69#define MOD(m,n) (((m) + (n)) % (n))
70
71// makes dynamically allocated objects zero-initialised
40struct zero_initialized { 72struct zero_initialized
73{
41 void *operator new (size_t s); 74 void *operator new (size_t s);
42 void operator delete (void *p, size_t s); 75 void operator delete (void *p, size_t s);
43}; 76};
44 77
45/* simplevec taken (and heavily modified), from: 78/* simplevec taken (and heavily modified), from:
46 * 79 *
47 * MICO --- a free CORBA implementation 80 * MICO --- a free CORBA implementation
48 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 81 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
49 */ 82 */
50template<class T> 83template<class T>
51struct simplevec { 84struct simplevec
85{
52 typedef T* iterator; 86 typedef T* iterator;
53 typedef const T* const_iterator; 87 typedef const T* const_iterator;
54 typedef unsigned long size_type; 88 typedef unsigned long size_type;
55 89
56private: 90private:
… …
254 return pos; 288 return pos;
255 } 289 }
256 void erase (iterator first, iterator last) 290 void erase (iterator first, iterator last)
257 { 291 {
258 if (last != first) { 292 if (last != first) {
259 memmove (first, last, (end ()-last)*sizeof (T)); 293 memmove (first, last, (end () - last) * sizeof (T));
260 _last -= last - first; 294 _last -= last - first;
261 } 295 }
262 } 296 }
263 void erase (iterator pos) 297 void erase (iterator pos)
264 { 298 {
265 if (pos != end ()) { 299 if (pos != end ()) {
266 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 300 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
267 --_last; 301 --_last;
268 } 302 }
269 } 303 }
270 void swap (simplevec<T> &t) 304 void swap (simplevec<T> &t)
271 { 305 {
… …
297} 331}
298 332
299 333
300template<typename T> 334template<typename T>
301struct vector : simplevec<T> 335struct vector : simplevec<T>
302{ }; 336{
337};
338
339struct stringvec : simplevec<char *>
340{
341 ~stringvec ()
342 {
343 for (char **c = begin (); c != end (); c++)
344 free (*c);
345 }
346};
303 347
304#if 0 348#if 0
305template<typename T> 349template<typename T>
306struct rxvt_vec : simplevec<void *> { 350struct rxvt_vec : simplevec<void *>
351{
307 typedef T *iterator; 352 typedef T *iterator;
308 353
309 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 354 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
310 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 355 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
311 void erase (int i) { erase (begin () + i); } 356 void erase (int i) { erase (begin () + i); }
… …
315 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 360 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])); } 361 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
317}; 362};
318#endif 363#endif
319 364
320template <typename I, typename T>
321I find (I first, I last, const T& value)
322{
323 while (first != last && *first != value)
324 ++first;
325
326 return first;
327}
328
329template<typename T> 365template<typename T>
330struct auto_ptr { 366struct auto_ptr
367{
331 T *p; 368 T *p;
332 369
333 auto_ptr () : p (0) { } 370 auto_ptr () : p (0) { }
334 auto_ptr (T *a) : p (a) { } 371 auto_ptr (T *a) : p (a) { }
335 372
… …
384 } 421 }
385}; 422};
386 423
387typedef auto_ptr<char> auto_str; 424typedef auto_ptr<char> auto_str;
388 425
389struct stringvec : simplevec<char *>
390{
391 ~stringvec ()
392 {
393 for (char **c = begin (); c != end (); c++)
394 delete [] *c;
395 }
396};
397
398#endif 426#endif
399 427

Diff Legend

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