1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * |
5 | * |
6 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
6 | * Crossfire TRT is free software: you can redistribute it and/or modify |
7 | * under the terms of the GNU General Public License as published by the Free |
7 | * it under the terms of the GNU General Public License as published by |
8 | * Software Foundation; either version 2 of the License, or (at your option) |
8 | * the Free Software Foundation, either version 3 of the License, or |
9 | * any later version. |
9 | * (at your option) any later version. |
10 | * |
10 | * |
11 | * This program is distributed in the hope that it will be useful, but |
11 | * This program is distributed in the hope that it will be useful, |
12 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * for more details. |
14 | * GNU General Public License for more details. |
15 | * |
15 | * |
16 | * You should have received a copy of the GNU General Public License along |
16 | * You should have received a copy of the GNU General Public License |
17 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
17 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
18 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
19 | * |
18 | * |
20 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
19 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | */ |
20 | */ |
22 | |
21 | |
23 | #ifndef UTIL_H__ |
22 | #ifndef UTIL_H__ |
… | |
… | |
53 | #include <glib.h> |
52 | #include <glib.h> |
54 | |
53 | |
55 | #include <shstr.h> |
54 | #include <shstr.h> |
56 | #include <traits.h> |
55 | #include <traits.h> |
57 | |
56 | |
58 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
57 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
59 | #define auto(var,expr) decltype(expr) var = (expr) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
60 | |
59 | |
61 | // very ugly macro that basicaly declares and initialises a variable |
60 | // very ugly macro that basicaly declares and initialises a variable |
62 | // that is in scope for the next statement only |
61 | // that is in scope for the next statement only |
63 | // works only for stuff that can be assigned 0 and converts to false |
62 | // works only for stuff that can be assigned 0 and converts to false |
64 | // (note: works great for pointers) |
63 | // (note: works great for pointers) |
65 | // most ugly macro I ever wrote |
64 | // most ugly macro I ever wrote |
66 | #define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
65 | #define statementvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
67 | |
66 | |
68 | // in range including end |
67 | // in range including end |
69 | #define IN_RANGE_INC(val,beg,end) \ |
68 | #define IN_RANGE_INC(val,beg,end) \ |
70 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
69 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
71 | |
70 | |
… | |
… | |
334 | |
333 | |
335 | typedef tausworthe_random_generator rand_gen; |
334 | typedef tausworthe_random_generator rand_gen; |
336 | |
335 | |
337 | extern rand_gen rndm; |
336 | extern rand_gen rndm; |
338 | |
337 | |
|
|
338 | INTERFACE_CLASS (attachable) |
|
|
339 | struct refcnt_base |
|
|
340 | { |
|
|
341 | typedef int refcnt_t; |
|
|
342 | mutable refcnt_t ACC (RW, refcnt); |
|
|
343 | |
|
|
344 | MTH void refcnt_inc () const { ++refcnt; } |
|
|
345 | MTH void refcnt_dec () const { --refcnt; } |
|
|
346 | |
|
|
347 | refcnt_base () : refcnt (0) { } |
|
|
348 | }; |
|
|
349 | |
|
|
350 | // to avoid branches with more advanced compilers |
|
|
351 | extern refcnt_base::refcnt_t refcnt_dummy; |
|
|
352 | |
339 | template<class T> |
353 | template<class T> |
340 | struct refptr |
354 | struct refptr |
341 | { |
355 | { |
|
|
356 | // p if not null |
|
|
357 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
|
|
358 | |
|
|
359 | void refcnt_dec () |
|
|
360 | { |
|
|
361 | if (!is_constant (p)) |
|
|
362 | --*refcnt_ref (); |
|
|
363 | else if (p) |
|
|
364 | --p->refcnt; |
|
|
365 | } |
|
|
366 | |
|
|
367 | void refcnt_inc () |
|
|
368 | { |
|
|
369 | if (!is_constant (p)) |
|
|
370 | ++*refcnt_ref (); |
|
|
371 | else if (p) |
|
|
372 | ++p->refcnt; |
|
|
373 | } |
|
|
374 | |
342 | T *p; |
375 | T *p; |
343 | |
376 | |
344 | refptr () : p(0) { } |
377 | refptr () : p(0) { } |
345 | refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
378 | refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); } |
346 | refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
379 | refptr (T *p) : p(p) { refcnt_inc (); } |
347 | ~refptr () { if (p) p->refcnt_dec (); } |
380 | ~refptr () { refcnt_dec (); } |
348 | |
381 | |
349 | const refptr<T> &operator =(T *o) |
382 | const refptr<T> &operator =(T *o) |
350 | { |
383 | { |
|
|
384 | // if decrementing ever destroys we need to reverse the order here |
351 | if (p) p->refcnt_dec (); |
385 | refcnt_dec (); |
352 | p = o; |
386 | p = o; |
353 | if (p) p->refcnt_inc (); |
387 | refcnt_inc (); |
354 | |
|
|
355 | return *this; |
388 | return *this; |
356 | } |
389 | } |
357 | |
390 | |
358 | const refptr<T> &operator =(const refptr<T> o) |
391 | const refptr<T> &operator =(const refptr<T> &o) |
359 | { |
392 | { |
360 | *this = o.p; |
393 | *this = o.p; |
361 | return *this; |
394 | return *this; |
362 | } |
395 | } |
363 | |
396 | |
364 | T &operator * () const { return *p; } |
397 | T &operator * () const { return *p; } |
365 | T *operator ->() const { return p; } |
398 | T *operator ->() const { return p; } |
366 | |
399 | |
367 | operator T *() const { return p; } |
400 | operator T *() const { return p; } |
368 | }; |
401 | }; |
369 | |
402 | |
370 | typedef refptr<maptile> maptile_ptr; |
403 | typedef refptr<maptile> maptile_ptr; |
… | |
… | |
405 | { |
438 | { |
406 | return !strcmp (a, b); |
439 | return !strcmp (a, b); |
407 | } |
440 | } |
408 | }; |
441 | }; |
409 | |
442 | |
|
|
443 | // Mostly the same as std::vector, but insert/erase can reorder |
|
|
444 | // the elements, making append(=insert)/remove O(1) instead of O(n). |
|
|
445 | // |
|
|
446 | // NOTE: only some forms of erase are available |
410 | template<class T> |
447 | template<class T> |
411 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
448 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
412 | { |
449 | { |
413 | typedef typename unordered_vector::iterator iterator; |
450 | typedef typename unordered_vector::iterator iterator; |
414 | |
451 | |
… | |
… | |
424 | { |
461 | { |
425 | erase ((unsigned int )(i - this->begin ())); |
462 | erase ((unsigned int )(i - this->begin ())); |
426 | } |
463 | } |
427 | }; |
464 | }; |
428 | |
465 | |
429 | template<class T, int T::* index> |
466 | // This container blends advantages of linked lists |
|
|
467 | // (efficiency) with vectors (random access) by |
|
|
468 | // by using an unordered vector and storing the vector |
|
|
469 | // index inside the object. |
|
|
470 | // |
|
|
471 | // + memory-efficient on most 64 bit archs |
|
|
472 | // + O(1) insert/remove |
|
|
473 | // + free unique (but varying) id for inserted objects |
|
|
474 | // + cache-friendly iteration |
|
|
475 | // - only works for pointers to structs |
|
|
476 | // |
|
|
477 | // NOTE: only some forms of erase/insert are available |
|
|
478 | typedef int object_vector_index; |
|
|
479 | |
|
|
480 | template<class T, object_vector_index T::*indexmember> |
430 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
481 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
431 | { |
482 | { |
|
|
483 | typedef typename object_vector::iterator iterator; |
|
|
484 | |
|
|
485 | bool contains (const T *obj) const |
|
|
486 | { |
|
|
487 | return obj->*indexmember; |
|
|
488 | } |
|
|
489 | |
|
|
490 | iterator find (const T *obj) |
|
|
491 | { |
|
|
492 | return obj->*indexmember |
|
|
493 | ? this->begin () + obj->*indexmember - 1 |
|
|
494 | : this->end (); |
|
|
495 | } |
|
|
496 | |
|
|
497 | void push_back (T *obj) |
|
|
498 | { |
|
|
499 | std::vector<T *, slice_allocator<T *> >::push_back (obj); |
|
|
500 | obj->*indexmember = this->size (); |
|
|
501 | } |
|
|
502 | |
432 | void insert (T *obj) |
503 | void insert (T *obj) |
433 | { |
504 | { |
434 | assert (!(obj->*index)); |
|
|
435 | push_back (obj); |
505 | push_back (obj); |
436 | obj->*index = this->size (); |
|
|
437 | } |
506 | } |
438 | |
507 | |
439 | void insert (T &obj) |
508 | void insert (T &obj) |
440 | { |
509 | { |
441 | insert (&obj); |
510 | insert (&obj); |
442 | } |
511 | } |
443 | |
512 | |
444 | void erase (T *obj) |
513 | void erase (T *obj) |
445 | { |
514 | { |
446 | assert (obj->*index); |
|
|
447 | unsigned int pos = obj->*index; |
515 | unsigned int pos = obj->*indexmember; |
448 | obj->*index = 0; |
516 | obj->*indexmember = 0; |
449 | |
517 | |
450 | if (pos < this->size ()) |
518 | if (pos < this->size ()) |
451 | { |
519 | { |
452 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
520 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
453 | (*this)[pos - 1]->*index = pos; |
521 | (*this)[pos - 1]->*indexmember = pos; |
454 | } |
522 | } |
455 | |
523 | |
456 | this->pop_back (); |
524 | this->pop_back (); |
457 | } |
525 | } |
458 | |
526 | |
459 | void erase (T &obj) |
527 | void erase (T &obj) |
460 | { |
528 | { |
461 | errase (&obj); |
529 | erase (&obj); |
462 | } |
530 | } |
463 | }; |
531 | }; |
464 | |
532 | |
465 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
533 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
466 | void assign (char *dst, const char *src, int maxlen); |
534 | void assign (char *dst, const char *src, int maxlen); |
… | |
… | |
477 | // return current time as timestampe |
545 | // return current time as timestampe |
478 | tstamp now (); |
546 | tstamp now (); |
479 | |
547 | |
480 | int similar_direction (int a, int b); |
548 | int similar_direction (int a, int b); |
481 | |
549 | |
482 | // like printf, but returns a std::string |
550 | // like sprintf, but returns a "static" buffer |
483 | const std::string format (const char *format, ...); |
551 | const char *format (const char *format, ...); |
484 | |
552 | |
485 | #endif |
553 | #endif |
486 | |
554 | |