rxvt-unicode/src/rxvtutil.h

#ifndef RXVT_UTIL_H
#define RXVT_UTIL_H

#include <cstdlib>
#include <cstring>

#define PP_CONCAT_(a, b) a ## b
#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
#define PP_STRINGIFY_(a) #a
#define PP_STRINGIFY(a) PP_STRINGIFY_(a)

extern class byteorder {
  static unsigned int e; // at least 32 bits
public:
  byteorder ();

  static bool big_endian    () { return e == 0x11223344; };
  static bool network       () { return e == 0x11223344; };
  static bool little_endian () { return e == 0x44332211; };
  static bool vax           () { return e == 0x44332211; };
} byteorder;

// various utility functions
template<typename T, typename U> static inline T    min    (T  a, U b) { return a < (T)b ? a : (T)b; }
template<typename T, typename U> static inline void min_it (T &a, U b) {    a = a < (T)b ? a : (T)b; }
template<typename T, typename U> static inline T    max    (T  a, U b) { return a > (T)b ? a : (T)b; }
template<typename T, typename U> static inline void max_it (T &a, U b) {    a = a > (T)b ? a : (T)b; }

template<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; }
template<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; }

template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }

// linear interpolation
template<typename T, typename U, typename P>
static inline
T lerp (T a, U b, P p)
{
  return (int(a) * int(p) + int(b) * int(100 - p)) / 100;
}

// in range including end
#define IN_RANGE_INC(val,beg,end) \
  ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))

// in range excluding end
#define IN_RANGE_EXC(val,beg,end) \
  ((unsigned int)(val) - (unsigned int)(beg) <  (unsigned int)(end) - (unsigned int)(beg))

// makes dynamically allocated objects zero-initialised
struct zero_initialized {
  void *operator new (size_t s);
  void operator delete (void *p, size_t s);
};

/* simplevec taken (and heavily modified), from:
 * 
 *  MICO --- a free CORBA implementation
 *  Copyright (C) 1997-98 Kay Roemer & Arno Puder
 */
template<class T>
struct simplevec {
    typedef T* iterator;
    typedef const T* const_iterator;
    typedef unsigned long size_type;

private:
    size_type _last, _size;
    T *_buf;

public:
    const_iterator begin () const
    {
        return &_buf[0];
    }
    iterator begin ()
    {
        return &_buf[0];
    }
    const_iterator end () const
    {
        return &_buf[_last];
    }
    iterator end ()
    {
        return &_buf[_last];
    }
    size_type capacity () const
    {
        return _size;
    }
    size_type size () const
    {
        return _last;
    }

private:
    static T *alloc (size_type n)
    {
        return (T *)::operator new ((size_t) (n * sizeof (T)));
    }
    static void dealloc (T *buf)
    {
        if (buf)
            ::operator delete (buf);
    }

    void reserve (iterator where, size_type n)
    {
        if (_last + n <= _size) {
            memmove (where+n, where, (end ()-where)*sizeof (T));
        } else {
            size_type sz = _last+n;
            sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
            T *nbuf = alloc (sz);
            if (_buf) {
                memcpy (nbuf, begin (), (where-begin ())*sizeof (T));
                memcpy (nbuf + (where-begin ()) + n, where,
                        (end ()-where)*sizeof (T));
                dealloc (_buf);
            }
            _buf = nbuf;
            _size = sz;
        }
    }

public:
    void reserve (size_type sz)
    {
        if (_size < sz) {
            sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
            T *nbuf = alloc (sz);
            if (_buf) {
                memcpy (nbuf, begin (), size ()*sizeof (T));
                dealloc (_buf);
            }
            _buf = nbuf;
            _size = sz;
        }
    }
    simplevec ()
    : _last(0), _size(0), _buf(0)
    {
    }
    simplevec (size_type n, const T& t = T ())
    : _last(0), _size(0), _buf(0)
    {
        insert (begin (), n, t);
    }
    simplevec (const_iterator first, const_iterator last)
    : _last(0), _size(0), _buf(0)
    {
        insert (begin (), first, last);
    }
    simplevec (const simplevec<T> &v)
    : _last(0), _size(0), _buf(0)
    {
        reserve (v._last);
        memcpy (_buf, v.begin (), v.size ()*sizeof (T));
        _last = v._last;
    }
    simplevec<T> &operator= (const simplevec<T> &v)
    {
        if (this != &v) {
            _last = 0;
            reserve (v._last);
            memcpy (_buf, v.begin (), v.size ()*sizeof (T));
            _last = v._last;
        }
        return *this;
    }
    ~simplevec ()
    {
        dealloc (_buf);
    }
    const T &front () const
    {
        //ministl_assert (size () > 0);
        return _buf[0];
    }
    T &front ()
    {
        //ministl_assert (size () > 0);
        return _buf[0];
    }
    const T &back () const
    {
        //ministl_assert (size () > 0);
        return _buf[_last-1];
    }
    T &back ()
    {
        //ministl_assert (size () > 0);
        return _buf[_last-1];
    }
    bool empty () const
    {
        return _last == 0;
    }
    void clear ()
    {
        _last = 0;
    }
    void push_back (const T &t)
    {
        reserve (_last+1);
        *end () = t;
        ++_last;
    }
    void push_back (T &t)
    {
        reserve (_last+1);
        *end () = t;
        ++_last;
    }
    void pop_back ()
    {
        //ministl_assert (size () > 0);
        --_last;
    }
    const T &operator[] (size_type idx) const
    {
        //ministl_assert (idx < size ());
        return _buf[idx];
    }
    T &operator[] (size_type idx)
    {
        //ministl_assert (idx < size ());
        return _buf[idx];
    }
    iterator insert (iterator pos, const T &t)
    {
        //ministl_assert (pos <= end ());
        long at = pos - begin ();
        reserve (pos, 1);
        pos = begin ()+at;
        *pos = t;
        ++_last;
        return pos;
    }
    iterator insert (iterator pos, const_iterator first, const_iterator last)
    {
        //ministl_assert (pos <= end ());
        long n = last - first;
        long at = pos - begin ();
        if (n > 0) {
            reserve (pos, n);
            pos = begin ()+at;
            memcpy (pos, first, (last-first)*sizeof (T));
            _last += n;
        }
        return pos;
    }
    iterator insert (iterator pos, size_type n, const T &t)
    {
        //ministl_assert (pos <= end ());
        long at = pos - begin ();
        if (n > 0) {
            reserve (pos, n);
            pos = begin ()+at;
            for (int i = 0; i < n; ++i)
                pos[i] = t;
            _last += n;
        }
        return pos;
    }
    void erase (iterator first, iterator last)
    {
        if (last != first) {
            memmove (first, last, (end () - last) * sizeof (T));
            _last -= last - first;
        }
    }
    void erase (iterator pos)
    {
        if (pos != end ()) {
            memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
            --_last;
        }
    }
    void swap (simplevec<T> &t)
    {
        ::swap(_last, t._last);
        ::swap(_size, t._size);
        ::swap(_buf, t._buf);
    }
};

template<class T>
bool operator== (const simplevec<T> &v1, const simplevec<T> &v2)
{
    if (v1.size () != v2.size ())
        return false;
    return !v1.size () || !memcmp (&v1[0], &v2[0], v1.size ()*sizeof (T));
}

template<class T>
bool operator< (const simplevec<T> &v1, const simplevec<T> &v2)
{
    unsigned long minlast = min (v1.size (), v2.size ());
    for (unsigned long i = 0; i < minlast; ++i) {
        if (v1[i] < v2[i])
            return true;
        if (v2[i] < v1[i])
            return false;
    }
    return v1.size () < v2.size ();
}


template<typename T>
struct vector : simplevec<T>
{ };

#if 0
template<typename T>
struct rxvt_vec : simplevec<void *> {
  typedef T *iterator;

  void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
  T pop_back () { return (T*)simplevec<void *>::pop_back (); }
  void erase (int i) { erase (begin () + i); }
  void erase (iterator i) { simplevec<void *>::erase ((void **)i); }
  iterator begin () const { return (iterator)simplevec<void *>::begin (); }
  iterator end () const { return (iterator)simplevec<void *>::end (); }
  T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
  const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
};
#endif

template <typename I, typename T>
I find (I first, I last, const T& value)
{
  while (first != last && *first != value)
    ++first;

  return first;
}

template<typename T>
struct auto_ptr {
  T *p;

  auto_ptr () : p (0) { }
  auto_ptr (T *a) : p (a) { }

  auto_ptr (auto_ptr<T> &a)
  {
    p = a.p;
    a.p = 0;
  }

  template<typename A>
  auto_ptr (auto_ptr<A> &a)
  {
    p = a.p;
    a.p = 0;
  }

  ~auto_ptr ()
  {
    delete p;
  }

  // void because it makes sense in our context
  void operator = (T *a)
  {
    delete p;
    p = a;
  }

  void operator = (auto_ptr &a)
  {
    *this = a.p;
    a.p = 0;
  }

  template<typename A>
  void operator = (auto_ptr<A> &a)
  {
    *this = a.p;
    a.p = 0;
  }

  operator T * () const { return p; }

  T *operator -> () const { return p; }
  T &operator * () const { return *p; }

  T *get ()
  {
    T *r = p;
    p = 0;
    return r;
  }
};

typedef auto_ptr<char> auto_str;

struct stringvec : simplevec<char *>
{
  ~stringvec ()
  {
    for (char **c = begin (); c != end (); c++)
      free (*c);
  }
};

// return a very temporary (and never deallocated) buffer. keep small.
void *rxvt_temp_buf (int len);

template<typename T>
inline T *
rxvt_temp_buf (int len)
{
  return (T *)rxvt_temp_buf (len * sizeof (T));
}

#endif

Revision:	1.21
Committed:	Sun Jan 29 20:51:28 2006 UTC (18 years, 4 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.20:	+8 -0 lines
Log Message:	* empty log message *
#	User	Rev	Content
1	root	1.1	#ifndef RXVT_UTIL_H
2			#define RXVT_UTIL_H
3
4	root	1.19	#include <cstdlib>
5	root	1.4	#include <cstring>
6
7	root	1.15	#define PP_CONCAT_(a, b) a ## b
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
12	root	1.1	extern class byteorder {
13			static unsigned int e; // at least 32 bits
14			public:
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
23	root	1.16	// various utility functions
24	root	1.13	template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
25			template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
26			template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
27			template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
28
29			template<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; }
30			template<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
32	root	1.14	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
33	root	1.8
34	root	1.21	// linear interpolation
35			template<typename T, typename U, typename P>
36			static inline
37			T lerp (T a, U b, P p)
38			{
39			return (int(a) * int(p) + int(b) * int(100 - p)) / 100;
40			}
41
42	root	1.11	// in range including end
43			#define IN_RANGE_INC(val,beg,end) \
44	root	1.9	((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
45	root	1.1
46	root	1.11	// in range excluding end
47			#define IN_RANGE_EXC(val,beg,end) \
48			((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
49
50	root	1.16	// makes dynamically allocated objects zero-initialised
51	root	1.4	struct zero_initialized {
52			void *operator new (size_t s);
53			void operator delete (void *p, size_t s);
54			};
55
56			/* simplevec taken (and heavily modified), from:
57			*
58			* MICO --- a free CORBA implementation
59			* Copyright (C) 1997-98 Kay Roemer & Arno Puder
60			*/
61			template<class T>
62			struct simplevec {
63			typedef T* iterator;
64			typedef const T* const_iterator;
65			typedef unsigned long size_type;
66
67			private:
68			size_type _last, _size;
69			T *_buf;
70
71			public:
72			const_iterator begin () const
73			{
74	root	1.8	return &_buf[0];
75	root	1.4	}
76			iterator begin ()
77			{
78	root	1.8	return &_buf[0];
79	root	1.4	}
80			const_iterator end () const
81			{
82	root	1.8	return &_buf[_last];
83	root	1.4	}
84			iterator end ()
85			{
86	root	1.8	return &_buf[_last];
87	root	1.4	}
88			size_type capacity () const
89			{
90	root	1.8	return _size;
91	root	1.4	}
92			size_type size () const
93			{
94	root	1.8	return _last;
95	root	1.4	}
96
97			private:
98			static T *alloc (size_type n)
99			{
100	root	1.8	return (T )::operator new ((size_t) (n sizeof (T)));
101	root	1.4	}
102			static void dealloc (T *buf)
103			{
104	root	1.8	if (buf)
105			::operator delete (buf);
106	root	1.4	}
107
108			void reserve (iterator where, size_type n)
109			{
110	root	1.8	if (_last + n <= _size) {
111			memmove (where+n, where, (end ()-where)*sizeof (T));
112			} else {
113			size_type sz = _last+n;
114			sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
115			T *nbuf = alloc (sz);
116			if (_buf) {
117			memcpy (nbuf, begin (), (where-begin ())*sizeof (T));
118			memcpy (nbuf + (where-begin ()) + n, where,
119			(end ()-where)*sizeof (T));
120			dealloc (_buf);
121			}
122			_buf = nbuf;
123			_size = sz;
124			}
125	root	1.4	}
126
127			public:
128			void reserve (size_type sz)
129			{
130	root	1.8	if (_size < sz) {
131			sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
132			T *nbuf = alloc (sz);
133			if (_buf) {
134			memcpy (nbuf, begin (), size ()*sizeof (T));
135			dealloc (_buf);
136			}
137			_buf = nbuf;
138			_size = sz;
139			}
140	root	1.4	}
141			simplevec ()
142			: _last(0), _size(0), _buf(0)
143			{
144			}
145			simplevec (size_type n, const T& t = T ())
146			: _last(0), _size(0), _buf(0)
147			{
148	root	1.8	insert (begin (), n, t);
149	root	1.4	}
150			simplevec (const_iterator first, const_iterator last)
151			: _last(0), _size(0), _buf(0)
152			{
153	root	1.8	insert (begin (), first, last);
154	root	1.4	}
155			simplevec (const simplevec<T> &v)
156			: _last(0), _size(0), _buf(0)
157			{
158	root	1.8	reserve (v._last);
159			memcpy (_buf, v.begin (), v.size ()*sizeof (T));
160			_last = v._last;
161	root	1.4	}
162			simplevec<T> &operator= (const simplevec<T> &v)
163			{
164	root	1.8	if (this != &v) {
165			_last = 0;
166			reserve (v._last);
167			memcpy (_buf, v.begin (), v.size ()*sizeof (T));
168			_last = v._last;
169			}
170	root	1.4	return *this;
171			}
172			~simplevec ()
173			{
174	root	1.8	dealloc (_buf);
175	root	1.4	}
176			const T &front () const
177			{
178	root	1.8	//ministl_assert (size () > 0);
179			return _buf[0];
180	root	1.4	}
181			T &front ()
182			{
183	root	1.8	//ministl_assert (size () > 0);
184			return _buf[0];
185	root	1.4	}
186			const T &back () const
187			{
188	root	1.8	//ministl_assert (size () > 0);
189			return _buf[_last-1];
190	root	1.4	}
191			T &back ()
192			{
193	root	1.8	//ministl_assert (size () > 0);
194			return _buf[_last-1];
195	root	1.4	}
196			bool empty () const
197			{
198	root	1.8	return _last == 0;
199	root	1.4	}
200			void clear ()
201			{
202	root	1.8	_last = 0;
203	root	1.4	}
204			void push_back (const T &t)
205			{
206	root	1.8	reserve (_last+1);
207			*end () = t;
208			++_last;
209	root	1.4	}
210			void push_back (T &t)
211			{
212	root	1.8	reserve (_last+1);
213			*end () = t;
214			++_last;
215	root	1.4	}
216			void pop_back ()
217			{
218	root	1.8	//ministl_assert (size () > 0);
219			--_last;
220	root	1.4	}
221			const T &operator[] (size_type idx) const
222			{
223	root	1.8	//ministl_assert (idx < size ());
224			return _buf[idx];
225	root	1.4	}
226			T &operator[] (size_type idx)
227			{
228	root	1.8	//ministl_assert (idx < size ());
229			return _buf[idx];
230	root	1.4	}
231			iterator insert (iterator pos, const T &t)
232			{
233	root	1.8	//ministl_assert (pos <= end ());
234			long at = pos - begin ();
235			reserve (pos, 1);
236			pos = begin ()+at;
237			*pos = t;
238			++_last;
239			return pos;
240	root	1.4	}
241			iterator insert (iterator pos, const_iterator first, const_iterator last)
242			{
243			//ministl_assert (pos <= end ());
244	root	1.8	long n = last - first;
245			long at = pos - begin ();
246			if (n > 0) {
247			reserve (pos, n);
248			pos = begin ()+at;
249			memcpy (pos, first, (last-first)*sizeof (T));
250			_last += n;
251			}
252			return pos;
253	root	1.4	}
254			iterator insert (iterator pos, size_type n, const T &t)
255			{
256			//ministl_assert (pos <= end ());
257	root	1.8	long at = pos - begin ();
258			if (n > 0) {
259			reserve (pos, n);
260			pos = begin ()+at;
261			for (int i = 0; i < n; ++i)
262			pos[i] = t;
263			_last += n;
264			}
265			return pos;
266	root	1.4	}
267			void erase (iterator first, iterator last)
268			{
269	root	1.8	if (last != first) {
270	root	1.18	memmove (first, last, (end () - last) * sizeof (T));
271	root	1.8	_last -= last - first;
272			}
273	root	1.4	}
274			void erase (iterator pos)
275			{
276			if (pos != end ()) {
277	root	1.18	memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
278	root	1.4	--_last;
279			}
280			}
281	root	1.8	void swap (simplevec<T> &t)
282			{
283			::swap(_last, t._last);
284			::swap(_size, t._size);
285			::swap(_buf, t._buf);
286			}
287	root	1.4	};
288
289			template<class T>
290			bool operator== (const simplevec<T> &v1, const simplevec<T> &v2)
291			{
292			if (v1.size () != v2.size ())
293	root	1.8	return false;
294	root	1.4	return !v1.size () \|\| !memcmp (&v1[0], &v2[0], v1.size ()*sizeof (T));
295			}
296
297			template<class T>
298			bool operator< (const simplevec<T> &v1, const simplevec<T> &v2)
299			{
300			unsigned long minlast = min (v1.size (), v2.size ());
301			for (unsigned long i = 0; i < minlast; ++i) {
302			if (v1[i] < v2[i])
303	root	1.8	return true;
304			if (v2[i] < v1[i])
305			return false;
306	root	1.4	}
307			return v1.size () < v2.size ();
308			}
309
310	root	1.1
311			template<typename T>
312			struct vector : simplevec<T>
313			{ };
314
315			#if 0
316			template<typename T>
317			struct rxvt_vec : simplevec<void *> {
318			typedef T *iterator;
319
320			void push_back (T d) { simplevec<void >::push_back ((void )d); }
321			T pop_back () { return (T)simplevec<void >::pop_back (); }
322			void erase (int i) { erase (begin () + i); }
323			void erase (iterator i) { simplevec<void >::erase ((void *)i); }
324			iterator begin () const { return (iterator)simplevec<void *>::begin (); }
325			iterator end () const { return (iterator)simplevec<void *>::end (); }
326			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])); }
328			};
329			#endif
330
331			template <typename I, typename T>
332			I find (I first, I last, const T& value)
333			{
334			while (first != last && *first != value)
335			++first;
336
337			return first;
338			}
339
340			template<typename T>
341			struct auto_ptr {
342			T *p;
343
344			auto_ptr () : p (0) { }
345			auto_ptr (T *a) : p (a) { }
346
347			auto_ptr (auto_ptr<T> &a)
348			{
349			p = a.p;
350			a.p = 0;
351			}
352
353			template<typename A>
354			auto_ptr (auto_ptr<A> &a)
355			{
356			p = a.p;
357			a.p = 0;
358			}
359
360			~auto_ptr ()
361			{
362			delete p;
363			}
364
365			// void because it makes sense in our context
366			void operator = (T *a)
367			{
368			delete p;
369			p = a;
370			}
371
372			void operator = (auto_ptr &a)
373			{
374			*this = a.p;
375			a.p = 0;
376			}
377
378			template<typename A>
379			void operator = (auto_ptr<A> &a)
380			{
381			*this = a.p;
382			a.p = 0;
383			}
384
385			operator T * () const { return p; }
386
387			T *operator -> () const { return p; }
388			T &operator * () const { return *p; }
389
390			T *get ()
391			{
392			T *r = p;
393			p = 0;
394			return r;
395			}
396			};
397
398			typedef auto_ptr<char> auto_str;
399
400			struct stringvec : simplevec<char *>
401			{
402			~stringvec ()
403			{
404			for (char **c = begin (); c != end (); c++)
405	root	1.19	free (*c);
406	root	1.1	}
407			};
408	root	1.3
409	root	1.20	// return a very temporary (and never deallocated) buffer. keep small.
410			void *rxvt_temp_buf (int len);
411
412			template<typename T>
413			inline T *
414			rxvt_temp_buf (int len)
415			{
416			return (T )rxvt_temp_buf (len sizeof (T));
417			}
418
419	root	1.1	#endif
420