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

Diff Legend

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