rxvt-unicode/src/rxvtutil.h

#ifndef RXVT_UTIL_H
#define RXVT_UTIL_H

#include <cstdlib>
#include <cstring>

using namespace std;

#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)

#define HAVE_GCC_BUILTINS (__GNUC__ >= 4 || (__GNUC__ == 3 && __GNUC_MINOR__ == 4))

#if __GNUC__ >= 4
# define rxvt_attribute(x) __attribute__(x)
#else
# define rxvt_attribute(x)
#endif

#define NORETURN rxvt_attribute ((noreturn))
#define UNUSED   rxvt_attribute ((unused))
#define CONST    rxvt_attribute ((const))

// increases code size unless -fno-enforce-eh-specs
#if __GNUC__
# define NOTHROW
# define THROW(x)
#else
# define NOTHROW  throw()
# define THROW(x) throw x
#endif

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

template<typename T> static inline T squared_diff (T a, T b) { return (a-b)*(a-b); }

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

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

  return first;
}

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

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

// some bit functions, xft fuck me plenty
#if HAVE_GCC_BUILTINS
static inline int ctz      (unsigned int x) { return __builtin_ctz      (x); }
static inline int popcount (unsigned int x) { return __builtin_popcount (x); }
#else
// count trailing zero bits and count # of one bits
int ctz      (unsigned int x) CONST;
int popcount (unsigned int x) CONST;
#endif

// 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>
{
};

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

#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 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;

#endif

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