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

Diff Legend

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