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"

#include "emman.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);
};

// alas new/delete cannot be specified as inline in C++11 (see 17.6.4.6)
void *operator new (size_t s) throw (std::bad_alloc);
void operator delete (void *p) throw ();

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) { }

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