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.1 by root, Sun Aug 15 00:37:04 2004 UTC vs.
Revision 1.54 by sf-exg, Fri May 25 07:38:05 2012 UTC

1#ifndef RXVT_UTIL_H 1#ifndef RXVT_UTIL_H
2#define RXVT_UTIL_H 2#define RXVT_UTIL_H
3 3
4extern class byteorder { 4#include <stdlib.h>
5 static unsigned int e; // at least 32 bits 5#include <string.h>
6public: 6#include "ecb.h"
7 byteorder (); 7#include "estl.h"
8 8
9 static bool big_endian () { return e == 0x11223344; }; 9// increases code size unless -fno-enforce-eh-specs
10 static bool network () { return e == 0x11223344; }; 10#if __GNUC__
11 static bool little_endian () { return e == 0x44332211; }; 11# define NOTHROW
12 static bool vax () { return e == 0x44332211; }; 12# define THROW(x)
13} byteorder; 13#else
14# define NOTHROW throw()
15# define THROW(x) throw x
16#endif
14 17
18// various utility functions
15template<typename T, typename U> static inline T min (T a, U b) { return a < b ? a : b; } 19template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
16template<typename T, typename U> static inline T max (T a, U b) { return a > b ? a : b; } 20template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
17 21
18#include "simplevec.h" 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 void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; }
24
25template<typename T> static inline T squared_diff (T a, T b) { return (a - b) * (a - b); }
26
27// linear interpolation
28template<typename T, typename U, typename P>
29static inline
30T lerp (T a, U b, P p)
31{
32 return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
33}
34
35// return a very temporary (and never deallocated) buffer. keep small.
36void *rxvt_temp_buf (int len);
19 37
20template<typename T> 38template<typename T>
39static inline T *
40rxvt_temp_buf (int len)
41{
42 return (T *)rxvt_temp_buf (len * sizeof (T));
43}
44
45// in range including end
46#define IN_RANGE_INC(val,beg,end) \
47 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
48
49// in range excluding end
50#define IN_RANGE_EXC(val,beg,end) \
51 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
52
53// for m >= -n, ensure remainder lies between 0..n-1
54#define MOD(m,n) (((m) + (n)) % (n))
55
56// makes dynamically allocated objects zero-initialised
57struct zero_initialized
58{
59 void *operator new (size_t s);
60 void operator delete (void *p, size_t s);
61};
62
21struct vector : simplevec<T> 63struct stringvec : simplevec<char *>
22{ }; 64{
65 ~stringvec ()
66 {
67 for (char **c = begin (); c != end (); c++)
68 free (*c);
69 }
70};
23 71
24#if 0 72#if 0
25template<typename T> 73template<typename T>
26struct rxvt_vec : simplevec<void *> { 74struct rxvt_vec : simplevec<void *>
75{
27 typedef T *iterator; 76 typedef T *iterator;
28 77
29 void push_back (T d) { simplevec<void *>::push_back ((void *)d); } 78 void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
30 T pop_back () { return (T*)simplevec<void *>::pop_back (); } 79 T pop_back () { return (T*)simplevec<void *>::pop_back (); }
31 void erase (int i) { erase (begin () + i); } 80 void erase (int i) { erase (begin () + i); }
… …
35 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); } 84 T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
36 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); } 85 const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
37}; 86};
38#endif 87#endif
39 88
40template <typename I, typename T> 89template<typename T>
41I find (I first, I last, const T& value) 90struct auto_ptr
42{ 91{
43 while (first != last && *first != value)
44 ++first;
45
46 return first;
47}
48
49template<typename T>
50struct auto_ptr {
51 T *p; 92 T *p;
52 93
53 auto_ptr () : p (0) { } 94 auto_ptr () : p (0) { }
54 auto_ptr (T *a) : p (a) { } 95 auto_ptr (T *a) : p (a) { }
55 96
… …
66 a.p = 0; 107 a.p = 0;
67 } 108 }
68 109
69 ~auto_ptr () 110 ~auto_ptr ()
70 { 111 {
71 delete p; 112 free (p);
113 }
114
115 void reset (T *a)
116 {
117 free (p);
118 p = a;
72 } 119 }
73 120
74 // void because it makes sense in our context 121 // void because it makes sense in our context
75 void operator = (T *a)
76 {
77 delete p;
78 p = a;
79 }
80
81 void operator = (auto_ptr &a) 122 void operator = (auto_ptr &a)
82 { 123 {
83 *this = a.p; 124 *this = a.p;
84 a.p = 0; 125 a.p = 0;
85 } 126 }
… …
104 } 145 }
105}; 146};
106 147
107typedef auto_ptr<char> auto_str; 148typedef auto_ptr<char> auto_str;
108 149
109struct stringvec : simplevec<char *>
110{
111 ~stringvec ()
112 {
113 for (char **c = begin (); c != end (); c++)
114 delete [] *c;
115 }
116};
117#endif 150#endif
118 151

Diff Legend

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