… | |
… | |
6 | #else |
6 | #else |
7 | # define is_constant(c) 0 |
7 | # define is_constant(c) 0 |
8 | #endif |
8 | #endif |
9 | |
9 | |
10 | #include <cstddef> |
10 | #include <cstddef> |
|
|
11 | #include <new> |
|
|
12 | #include <vector> |
11 | |
13 | |
12 | #include <glib.h> |
14 | #include <glib.h> |
|
|
15 | |
|
|
16 | #include <shstr.h> |
|
|
17 | #include <traits.h> |
|
|
18 | |
|
|
19 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
|
|
20 | #define AUTODECL(var,expr) typeof(expr) var = (expr) |
|
|
21 | |
|
|
22 | // very ugly macro that basicaly declares and initialises a variable |
|
|
23 | // that is in scope for the next statement only |
|
|
24 | // works only for stuff that can be assigned 0 and converts to false |
|
|
25 | // (note: works great for pointers) |
|
|
26 | // most ugly macro I ever wrote |
|
|
27 | #define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
13 | |
28 | |
14 | // makes dynamically allocated objects zero-initialised |
29 | // makes dynamically allocated objects zero-initialised |
15 | struct zero_initialised |
30 | struct zero_initialised |
16 | { |
31 | { |
17 | void *operator new (size_t s, void *p) |
32 | void *operator new (size_t s, void *p) |
… | |
… | |
39 | { |
54 | { |
40 | g_slice_free1 (s, p); |
55 | g_slice_free1 (s, p); |
41 | } |
56 | } |
42 | }; |
57 | }; |
43 | |
58 | |
44 | void throw_bad_alloc () throw (std::bad_alloc); |
59 | void *salloc_ (int n) throw (std::bad_alloc); |
45 | |
|
|
46 | void *alloc (int s) throw (std::bad_alloc); |
60 | void *salloc_ (int n, void *src) throw (std::bad_alloc); |
47 | void dealloc (void *p, int s) throw (); |
61 | |
|
|
62 | // strictly the same as g_slice_alloc, but never returns 0 |
|
|
63 | template<typename T> |
|
|
64 | inline T *salloc (int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T)); } |
|
|
65 | |
|
|
66 | // also copies src into the new area, like "memdup" |
|
|
67 | // if src is 0, clears the memory |
|
|
68 | template<typename T> |
|
|
69 | inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } |
|
|
70 | |
|
|
71 | // clears the memory |
|
|
72 | template<typename T> |
|
|
73 | inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); } |
|
|
74 | |
|
|
75 | // for symmetry |
|
|
76 | template<typename T> |
|
|
77 | inline void sfree (T *ptr, int n = 1) throw () |
|
|
78 | { |
|
|
79 | g_slice_free1 (n * sizeof (T), (void *)ptr); |
|
|
80 | } |
48 | |
81 | |
49 | // a STL-compatible allocator that uses g_slice |
82 | // a STL-compatible allocator that uses g_slice |
50 | // boy, this is verbose |
83 | // boy, this is verbose |
51 | template<typename Tp> |
84 | template<typename Tp> |
52 | struct slice_allocator |
85 | struct slice_allocator |
… | |
… | |
75 | pointer address (reference x) const { return &x; } |
108 | pointer address (reference x) const { return &x; } |
76 | const_pointer address (const_reference x) const { return &x; } |
109 | const_pointer address (const_reference x) const { return &x; } |
77 | |
110 | |
78 | pointer allocate (size_type n, const_pointer = 0) |
111 | pointer allocate (size_type n, const_pointer = 0) |
79 | { |
112 | { |
80 | return static_cast<pointer>(alloc (n * sizeof (Tp))); |
113 | return salloc<Tp> (n); |
81 | } |
114 | } |
82 | |
115 | |
83 | void deallocate (pointer p, size_type n) |
116 | void deallocate (pointer p, size_type n) |
84 | { |
117 | { |
85 | dealloc (static_cast<void *>(p), n); |
118 | sfree<Tp> (p, n); |
86 | } |
119 | } |
87 | |
120 | |
88 | size_type max_size ()const throw () |
121 | size_type max_size ()const throw () |
89 | { |
122 | { |
90 | return size_t (-1) / sizeof (Tp); |
123 | return size_t (-1) / sizeof (Tp); |
… | |
… | |
97 | |
130 | |
98 | void destroy (pointer p) |
131 | void destroy (pointer p) |
99 | { |
132 | { |
100 | p->~Tp (); |
133 | p->~Tp (); |
101 | } |
134 | } |
102 | }; |
|
|
103 | |
|
|
104 | struct refcounted |
|
|
105 | { |
|
|
106 | mutable int refcnt; |
|
|
107 | refcounted () : refcnt (0) { } |
|
|
108 | void refcnt_inc () { ++refcnt; } |
|
|
109 | void refcnt_dec () { --refcnt; |
|
|
110 | if (refcnt < 0)abort();}//D |
|
|
111 | }; |
135 | }; |
112 | |
136 | |
113 | template<class T> |
137 | template<class T> |
114 | struct refptr |
138 | struct refptr |
115 | { |
139 | { |
… | |
… | |
138 | T &operator * () const { return *p; } |
162 | T &operator * () const { return *p; } |
139 | T *operator ->() const { return p; } |
163 | T *operator ->() const { return p; } |
140 | |
164 | |
141 | operator T *() const { return p; } |
165 | operator T *() const { return p; } |
142 | }; |
166 | }; |
|
|
167 | |
|
|
168 | typedef refptr<maptile> maptile_ptr; |
|
|
169 | typedef refptr<object> object_ptr; |
|
|
170 | typedef refptr<archetype> arch_ptr; |
|
|
171 | typedef refptr<client> client_ptr; |
|
|
172 | typedef refptr<player> player_ptr; |
143 | |
173 | |
144 | struct str_hash |
174 | struct str_hash |
145 | { |
175 | { |
146 | std::size_t operator ()(const char *s) const |
176 | std::size_t operator ()(const char *s) const |
147 | { |
177 | { |
… | |
… | |
173 | { |
203 | { |
174 | return !strcmp (a, b); |
204 | return !strcmp (a, b); |
175 | } |
205 | } |
176 | }; |
206 | }; |
177 | |
207 | |
178 | #include <vector> |
|
|
179 | |
|
|
180 | template<class obj> |
208 | template<class T> |
181 | struct unordered_vector : std::vector<obj, slice_allocator<obj> > |
209 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
182 | { |
210 | { |
183 | typedef typename unordered_vector::iterator iterator; |
211 | typedef typename unordered_vector::iterator iterator; |
184 | |
212 | |
185 | void erase (unsigned int pos) |
213 | void erase (unsigned int pos) |
186 | { |
214 | { |
… | |
… | |
191 | } |
219 | } |
192 | |
220 | |
193 | void erase (iterator i) |
221 | void erase (iterator i) |
194 | { |
222 | { |
195 | erase ((unsigned int )(i - this->begin ())); |
223 | erase ((unsigned int )(i - this->begin ())); |
|
|
224 | } |
|
|
225 | }; |
|
|
226 | |
|
|
227 | template<class T, int T::* index> |
|
|
228 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
|
|
229 | { |
|
|
230 | void insert (T *obj) |
|
|
231 | { |
|
|
232 | assert (!(obj->*index)); |
|
|
233 | push_back (obj); |
|
|
234 | obj->*index = this->size (); |
|
|
235 | } |
|
|
236 | |
|
|
237 | void insert (T &obj) |
|
|
238 | { |
|
|
239 | insert (&obj); |
|
|
240 | } |
|
|
241 | |
|
|
242 | void erase (T *obj) |
|
|
243 | { |
|
|
244 | assert (obj->*index); |
|
|
245 | int pos = obj->*index; |
|
|
246 | obj->*index = 0; |
|
|
247 | |
|
|
248 | if (pos < this->size ()) |
|
|
249 | { |
|
|
250 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
|
|
251 | (*this)[pos - 1]->*index = pos; |
|
|
252 | } |
|
|
253 | |
|
|
254 | this->pop_back (); |
|
|
255 | } |
|
|
256 | |
|
|
257 | void erase (T &obj) |
|
|
258 | { |
|
|
259 | errase (&obj); |
196 | } |
260 | } |
197 | }; |
261 | }; |
198 | |
262 | |
199 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
263 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
200 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
264 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
… | |
… | |
210 | inline void assign (char (&dst)[N], const char *src) |
274 | inline void assign (char (&dst)[N], const char *src) |
211 | { |
275 | { |
212 | assign ((char *)&dst, src, N); |
276 | assign ((char *)&dst, src, N); |
213 | } |
277 | } |
214 | |
278 | |
|
|
279 | typedef double tstamp; |
|
|
280 | |
|
|
281 | // return current time as timestampe |
|
|
282 | tstamp now (); |
|
|
283 | |
|
|
284 | int similar_direction (int a, int b); |
|
|
285 | |
215 | #endif |
286 | #endif |
216 | |
287 | |