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

Diff Legend

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