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.8 by root, Sun Jan 16 15:59:45 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
20// various utility functions
21template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
22template<typename T, typename U> static inline void min_it (T &a, U b) { a = 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
34template<typename T, typename U, typename P>
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
17template<typename T, typename U> 41template <typename I, typename T>
18static inline T min (T a, U b) { return a < b ? a : (T)b; } 42I find (I first, I last, const T& value)
19template<typename T, typename U> 43{
20static inline T max (T a, U b) { return a > b ? a : (T)b; } 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
21template<typename T> 53template<typename T>
22static inline void swap (T& a, T& b) { T t=a; a=b; b=t; } 54static inline T *
55rxvt_temp_buf (int len)
56{
57 return (T *)rxvt_temp_buf (len * sizeof (T));
58}
23 59
60// in range including end
61#define IN_RANGE_INC(val,beg,end) \
62 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
24 63
64// in range excluding end
65#define IN_RANGE_EXC(val,beg,end) \
66 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
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
25struct zero_initialized { 72struct zero_initialized
73{
26 void *operator new (size_t s); 74 void *operator new (size_t s);
27 void operator delete (void *p, size_t s); 75 void operator delete (void *p, size_t s);
28}; 76};
29 77
30/* simplevec taken (and heavily modified), from: 78/* simplevec taken (and heavily modified), from:
31 * 79 *
32 * MICO --- a free CORBA implementation 80 * MICO --- a free CORBA implementation
33 * Copyright (C) 1997-98 Kay Roemer & Arno Puder 81 * Copyright (C) 1997-98 Kay Roemer & Arno Puder
34 */ 82 */
35template<class T> 83template<class T>
36struct simplevec { 84struct simplevec
85{
37 typedef T* iterator; 86 typedef T* iterator;
38 typedef const T* const_iterator; 87 typedef const T* const_iterator;
39 typedef unsigned long size_type; 88 typedef unsigned long size_type;
40 89
41private: 90private:
… …
239 return pos; 288 return pos;
240 } 289 }
241 void erase (iterator first, iterator last) 290 void erase (iterator first, iterator last)
242 { 291 {
243 if (last != first) { 292 if (last != first) {
244 memmove (first, last, (end ()-last)*sizeof (T)); 293 memmove (first, last, (end () - last) * sizeof (T));
245 _last -= last - first; 294 _last -= last - first;
246 } 295 }
247 } 296 }
248 void erase (iterator pos) 297 void erase (iterator pos)
249 { 298 {
250 if (pos != end ()) { 299 if (pos != end ()) {
251 memmove (pos, pos+1, (end ()- (pos+1))*sizeof (T)); 300 memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
252 --_last; 301 --_last;
253 } 302 }
254 } 303 }
255 void swap (simplevec<T> &t) 304 void swap (simplevec<T> &t)
256 { 305 {
… …
282} 331}
283 332
284 333
285template<typename T> 334template<typename T>
286struct vector : simplevec<T> 335struct vector : simplevec<T>
287{ }; 336{
337};
338
339struct stringvec : simplevec<char *>
340{
341 ~stringvec ()
342 {
343 for (char **c = begin (); c != end (); c++)
344 free (*c);
345 }
346};
288 347
289#if 0 348#if 0
290template<typename T> 349template<typename T>
291struct rxvt_vec : simplevec<void *> { 350struct rxvt_vec : simplevec<void *>
351{
292 typedef T *iterator; 352 typedef T *iterator;
293 353
294 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 354 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
295 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 355 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
296 void erase (int i) { erase (begin () + i); } 356 void erase (int i) { erase (begin () + i); }
… …
300 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 360 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
301 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])); }
302}; 362};
303#endif 363#endif
304 364
305template <typename I, typename T>
306I find (I first, I last, const T& value)
307{
308 while (first != last && *first != value)
309 ++first;
310
311 return first;
312}
313
314template<typename T> 365template<typename T>
315struct auto_ptr { 366struct auto_ptr
367{
316 T *p; 368 T *p;
317 369
318 auto_ptr () : p (0) { } 370 auto_ptr () : p (0) { }
319 auto_ptr (T *a) : p (a) { } 371 auto_ptr (T *a) : p (a) { }
320 372
… …
369 } 421 }
370}; 422};
371 423
372typedef auto_ptr<char> auto_str; 424typedef auto_ptr<char> auto_str;
373 425
374struct stringvec : simplevec<char *>
375{
376 ~stringvec ()
377 {
378 for (char **c = begin (); c != end (); c++)
379 delete [] *c;
380 }
381};
382
383#endif 426#endif
384 427

Diff Legend

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