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 | |
… | |
… | |
405 | { |
404 | { |
406 | return !strcmp (a, b); |
405 | return !strcmp (a, b); |
407 | } |
406 | } |
408 | }; |
407 | }; |
409 | |
408 | |
|
|
409 | // Mostly the same as std::vector, but insert/erase can reorder |
|
|
410 | // the elements, making append(=insert)/remove O(1) instead of O(n). |
|
|
411 | // |
|
|
412 | // NOTE: only some forms of erase are available |
410 | template<class T> |
413 | template<class T> |
411 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
414 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
412 | { |
415 | { |
413 | typedef typename unordered_vector::iterator iterator; |
416 | typedef typename unordered_vector::iterator iterator; |
414 | |
417 | |
… | |
… | |
424 | { |
427 | { |
425 | erase ((unsigned int )(i - this->begin ())); |
428 | erase ((unsigned int )(i - this->begin ())); |
426 | } |
429 | } |
427 | }; |
430 | }; |
428 | |
431 | |
429 | template<class T, int T::* index> |
432 | // This container blends advantages of linked lists |
|
|
433 | // (efficiency) with vectors (random access) by |
|
|
434 | // by using an unordered vector and storing the vector |
|
|
435 | // index inside the object. |
|
|
436 | // |
|
|
437 | // + memory-efficient on most 64 bit archs |
|
|
438 | // + O(1) insert/remove |
|
|
439 | // + free unique (but varying) id for inserted objects |
|
|
440 | // + cache-friendly iteration |
|
|
441 | // - only works for pointers to structs |
|
|
442 | // |
|
|
443 | // NOTE: only some forms of erase/insert are available |
|
|
444 | typedef int object_vector_index; |
|
|
445 | |
|
|
446 | template<class T, object_vector_index T::*indexmember> |
430 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
447 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
431 | { |
448 | { |
|
|
449 | typedef typename object_vector::iterator iterator; |
|
|
450 | |
|
|
451 | bool contains (const T *obj) const |
|
|
452 | { |
|
|
453 | return obj->*indexmember; |
|
|
454 | } |
|
|
455 | |
|
|
456 | iterator find (const T *obj) |
|
|
457 | { |
|
|
458 | return obj->*indexmember |
|
|
459 | ? this->begin () + obj->*indexmember - 1 |
|
|
460 | : this->end (); |
|
|
461 | } |
|
|
462 | |
432 | void insert (T *obj) |
463 | void insert (T *obj) |
433 | { |
464 | { |
434 | assert (!(obj->*index)); |
|
|
435 | push_back (obj); |
465 | push_back (obj); |
436 | obj->*index = this->size (); |
466 | obj->*indexmember = this->size (); |
437 | } |
467 | } |
438 | |
468 | |
439 | void insert (T &obj) |
469 | void insert (T &obj) |
440 | { |
470 | { |
441 | insert (&obj); |
471 | insert (&obj); |
442 | } |
472 | } |
443 | |
473 | |
444 | void erase (T *obj) |
474 | void erase (T *obj) |
445 | { |
475 | { |
446 | assert (obj->*index); |
|
|
447 | unsigned int pos = obj->*index; |
476 | unsigned int pos = obj->*indexmember; |
448 | obj->*index = 0; |
477 | obj->*indexmember = 0; |
449 | |
478 | |
450 | if (pos < this->size ()) |
479 | if (pos < this->size ()) |
451 | { |
480 | { |
452 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
481 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
453 | (*this)[pos - 1]->*index = pos; |
482 | (*this)[pos - 1]->*indexmember = pos; |
454 | } |
483 | } |
455 | |
484 | |
456 | this->pop_back (); |
485 | this->pop_back (); |
457 | } |
486 | } |
458 | |
487 | |
459 | void erase (T &obj) |
488 | void erase (T &obj) |
460 | { |
489 | { |
461 | errase (&obj); |
490 | erase (&obj); |
462 | } |
491 | } |
463 | }; |
492 | }; |
464 | |
493 | |
465 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
494 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
466 | void assign (char *dst, const char *src, int maxlen); |
495 | void assign (char *dst, const char *src, int maxlen); |