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

Diff Legend

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