ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/util.h
(Generate patch)

Comparing deliantra/server/include/util.h (file contents):
Revision 1.20 by root, Sun Dec 17 23:10:35 2006 UTC vs.
Revision 1.27 by root, Mon Jan 15 00:40:49 2007 UTC

… …
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>
13 18
14// use a gcc extension for auto declarations until ISO C++ sanctifies them 19// use a gcc extension for auto declarations until ISO C++ sanctifies them
15#define AUTODECL(var,expr) typeof(expr) var = (expr) 20#define AUTODECL(var,expr) typeof(expr) var = (expr)
16 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)
28
29// in range including end
30#define IN_RANGE_INC(val,beg,end) \
31 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
32
33// in range excluding end
34#define IN_RANGE_EXC(val,beg,end) \
35 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
36
17// makes dynamically allocated objects zero-initialised 37// makes dynamically allocated objects zero-initialised
18struct zero_initialised 38struct zero_initialised
19{ 39{
20 void *operator new (size_t s, void *p) 40 void *operator new (size_t s, void *p)
21 { 41 {
… …
53 73
54// also copies src into the new area, like "memdup" 74// also copies src into the new area, like "memdup"
55// if src is 0, clears the memory 75// if src is 0, clears the memory
56template<typename T> 76template<typename T>
57inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); } 77inline T *salloc (int n, T *src) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), (void *)src); }
78
79// clears the memory
80template<typename T>
81inline T *salloc0(int n = 1) throw (std::bad_alloc) { return (T *)salloc_ (n * sizeof (T), 0); }
58 82
59// for symmetry 83// for symmetry
60template<typename T> 84template<typename T>
61inline void sfree (T *ptr, int n = 1) throw () 85inline void sfree (T *ptr, int n = 1) throw ()
62{ 86{
… …
116 { 140 {
117 p->~Tp (); 141 p->~Tp ();
118 } 142 }
119}; 143};
120 144
121struct refcounted
122{
123 refcounted () : refcnt (0) { }
124// virtual ~refcounted ();
125 void refcnt_inc () { ++refcnt; }
126 void refcnt_dec () { --refcnt; }
127 bool dead () { return refcnt == 0; }
128 mutable int refcnt;
129#if 0
130private:
131 static refcounted *rc_first;
132 refcounted *rc_next;
133#endif
134};
135
136template<class T> 145template<class T>
137struct refptr 146struct refptr
138{ 147{
139 T *p; 148 T *p;
140 149
… …
161 T &operator * () const { return *p; } 170 T &operator * () const { return *p; }
162 T *operator ->() const { return p; } 171 T *operator ->() const { return p; }
163 172
164 operator T *() const { return p; } 173 operator T *() const { return p; }
165}; 174};
175
176typedef refptr<maptile> maptile_ptr;
177typedef refptr<object> object_ptr;
178typedef refptr<archetype> arch_ptr;
179typedef refptr<client> client_ptr;
180typedef refptr<player> player_ptr;
166 181
167struct str_hash 182struct str_hash
168{ 183{
169 std::size_t operator ()(const char *s) const 184 std::size_t operator ()(const char *s) const
170 { 185 {
… …
196 { 211 {
197 return !strcmp (a, b); 212 return !strcmp (a, b);
198 } 213 }
199}; 214};
200 215
201#include <vector>
202
203template<class obj> 216template<class T>
204struct unordered_vector : std::vector<obj, slice_allocator<obj> > 217struct unordered_vector : std::vector<T, slice_allocator<T> >
205{ 218{
206 typedef typename unordered_vector::iterator iterator; 219 typedef typename unordered_vector::iterator iterator;
207 220
208 void erase (unsigned int pos) 221 void erase (unsigned int pos)
209 { 222 {
… …
214 } 227 }
215 228
216 void erase (iterator i) 229 void erase (iterator i)
217 { 230 {
218 erase ((unsigned int )(i - this->begin ())); 231 erase ((unsigned int )(i - this->begin ()));
232 }
233};
234
235template<class T, int T::* index>
236struct object_vector : std::vector<T *, slice_allocator<T *> >
237{
238 void insert (T *obj)
239 {
240 assert (!(obj->*index));
241 push_back (obj);
242 obj->*index = this->size ();
243 }
244
245 void insert (T &obj)
246 {
247 insert (&obj);
248 }
249
250 void erase (T *obj)
251 {
252 assert (obj->*index);
253 int pos = obj->*index;
254 obj->*index = 0;
255
256 if (pos < this->size ())
257 {
258 (*this)[pos - 1] = (*this)[this->size () - 1];
259 (*this)[pos - 1]->*index = pos;
260 }
261
262 this->pop_back ();
263 }
264
265 void erase (T &obj)
266 {
267 errase (&obj);
219 } 268 }
220}; 269};
221 270
222template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 271template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
223template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 272template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
… …
238typedef double tstamp; 287typedef double tstamp;
239 288
240// return current time as timestampe 289// return current time as timestampe
241tstamp now (); 290tstamp now ();
242 291
292int similar_direction (int a, int b);
293
243#endif 294#endif
244 295

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines