rxvt-unicode/src/rxvtutil.h

#ifndef RXVT_UTIL_H
#define RXVT_UTIL_H

#include <cstring>

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;

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

#define IN_RANGE(val,beg,end) \
  ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))

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++)
      delete [] *c;
  }
};

#endif

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