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

Diff Legend

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