rxvt-unicode/src/rxvtutil.h

#ifndef RXVT_UTIL_H
#define RXVT_UTIL_H

#include <new>
#include <stdlib.h>
#include <string.h>
#include "ecb.h"
#include "estl.h"

// 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

// various utility functions
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 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> 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;
}

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

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

// for m >= -n, ensure remainder lies between 0..n-1
#define MOD(m,n) (((m) + (n)) % (n))

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

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

inline void *
operator new (size_t size)
{
  // TODO: use rxvt_malloc
  return malloc (size);
}

inline void
operator delete (void *p)
{
  free (p);
}

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

  auto_ptr ()     : p (0) { }

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

  auto_ptr (auto_ptr &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 reset (T *a)
  {
    delete p;
    p = a;
  }

  // void because it makes sense in our context
  void operator =(auto_ptr &a)
  {
    reset (a.release ());
  }

  template<typename A>
  void operator =(auto_ptr<A> &a)
  {
    reset (a.release ());
  }

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

  operator T *()  { return p; }
  T *get () const { return p; }

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

typedef auto_ptr<char> auto_str;

#endif

Revision:	1.57
Committed:	Fri May 25 18:49:59 2012 UTC (12 years ago) by sf-exg
Content type:	text/plain
Branch:	MAIN
Changes since 1.56:	+2 -4 lines
Log Message:	Implement auto_ptr '=' operator using reset/release.
#	Content
1	#ifndef RXVT_UTIL_H
2	#define RXVT_UTIL_H
3
4	#include <new>
5	#include <stdlib.h>
6	#include <string.h>
7	#include "ecb.h"
8	#include "estl.h"
9
10	// increases code size unless -fno-enforce-eh-specs
11	#if __GNUC__
12	# define NOTHROW
13	# define THROW(x)
14	#else
15	# define NOTHROW throw()
16	# define THROW(x) throw x
17	#endif
18
19	// various utility functions
20	template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
21	template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
22
23	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; }
24	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; }
25
26	template<typename T> static inline T squared_diff (T a, T b) { return (a - b) * (a - b); }
27
28	// linear interpolation
29	template<typename T, typename U, typename P>
30	static inline T
31	lerp (T a, U b, P p)
32	{
33	return (long(a) * long(100 - p) + long(b) * long(p) + 50) / 100;
34	}
35
36	// return a very temporary (and never deallocated) buffer. keep small.
37	void *rxvt_temp_buf (int len);
38
39	template<typename T>
40	static inline T *
41	rxvt_temp_buf (int len)
42	{
43	return (T )rxvt_temp_buf (len sizeof (T));
44	}
45
46	// in range including end
47	#define IN_RANGE_INC(val,beg,end) \
48	((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
49
50	// in range excluding end
51	#define IN_RANGE_EXC(val,beg,end) \
52	((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
53
54	// for m >= -n, ensure remainder lies between 0..n-1
55	#define MOD(m,n) (((m) + (n)) % (n))
56
57	// makes dynamically allocated objects zero-initialised
58	struct zero_initialized
59	{
60	void *operator new (size_t s);
61	void operator delete (void *p, size_t s);
62	};
63
64	struct stringvec : simplevec<char *>
65	{
66	~stringvec ()
67	{
68	for (char **c = begin (); c != end (); c++)
69	free (*c);
70	}
71	};
72
73	#if 0
74	template<typename T>
75	struct rxvt_vec : simplevec<void *>
76	{
77	typedef T *iterator;
78
79	void push_back (T d) { simplevec<void >::push_back ((void )d); }
80	T pop_back () { return (T)simplevec<void >::pop_back (); }
81	void erase (int i) { erase (begin () + i); }
82	void erase (iterator i) { simplevec<void >::erase ((void *)i); }
83	iterator begin () const { return (iterator)simplevec<void *>::begin (); }
84	iterator end () const { return (iterator)simplevec<void *>::end (); }
85	T &operator [] (int i) { return * (T ) (& (( (simplevec<void > )this)[i])); }
86	const T &operator [] (int i) const { return * (const T ) (& (( (const simplevec<void > )this)[i])); }
87	};
88	#endif
89
90	inline void *
91	operator new (size_t size)
92	{
93	// TODO: use rxvt_malloc
94	return malloc (size);
95	}
96
97	inline void
98	operator delete (void *p)
99	{
100	free (p);
101	}
102
103	template<typename T>
104	struct auto_ptr
105	{
106	T *p;
107
108	auto_ptr () : p (0) { }
109
110	explicit
111	auto_ptr (T *a) : p (a) { }
112
113	auto_ptr (auto_ptr &a)
114	{
115	p = a.p;
116	a.p = 0;
117	}
118
119	template<typename A>
120	auto_ptr (auto_ptr<A> &a)
121	{
122	p = a.p;
123	a.p = 0;
124	}
125
126	~auto_ptr ()
127	{
128	delete p;
129	}
130
131	void reset (T *a)
132	{
133	delete p;
134	p = a;
135	}
136
137	// void because it makes sense in our context
138	void operator =(auto_ptr &a)
139	{
140	reset (a.release ());
141	}
142
143	template<typename A>
144	void operator =(auto_ptr<A> &a)
145	{
146	reset (a.release ());
147	}
148
149	T *operator ->() const { return p; }
150	T &operator () const { return p; }
151
152	operator T *() { return p; }
153	T *get () const { return p; }
154
155	T *release()
156	{
157	T *r = p;
158	p = 0;
159	return r;
160	}
161	};
162
163	typedef auto_ptr<char> auto_str;
164
165	#endif
166