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__ |
… | |
… | |
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 | extern refcnt_base::refcnt_t refcnt_dummy; |
|
|
351 | |
339 | template<class T> |
352 | template<class T> |
340 | struct refptr |
353 | struct refptr |
341 | { |
354 | { |
|
|
355 | // p if not null |
|
|
356 | refcnt_base::refcnt_t *refcnt_ref () { return p ? &p->refcnt : &refcnt_dummy; } |
|
|
357 | |
|
|
358 | void refcnt_dec () |
|
|
359 | { |
|
|
360 | if (!is_constant (p)) |
|
|
361 | --*refcnt_ref (); |
|
|
362 | else if (p) |
|
|
363 | --p->refcnt; |
|
|
364 | } |
|
|
365 | |
|
|
366 | void refcnt_inc () |
|
|
367 | { |
|
|
368 | if (!is_constant (p)) |
|
|
369 | ++*refcnt_ref (); |
|
|
370 | else if (p) |
|
|
371 | ++p->refcnt; |
|
|
372 | } |
|
|
373 | |
342 | T *p; |
374 | T *p; |
343 | |
375 | |
344 | refptr () : p(0) { } |
376 | refptr () : p(0) { } |
345 | refptr (const refptr<T> &p) : p(p.p) { if (p) p->refcnt_inc (); } |
377 | refptr (const refptr<T> &p) : p(p.p) { refcnt_inc (); } |
346 | refptr (T *p) : p(p) { if (p) p->refcnt_inc (); } |
378 | refptr (T *p) : p(p) { refcnt_inc (); } |
347 | ~refptr () { if (p) p->refcnt_dec (); } |
379 | ~refptr () { refcnt_dec (); } |
348 | |
380 | |
349 | const refptr<T> &operator =(T *o) |
381 | const refptr<T> &operator =(T *o) |
350 | { |
382 | { |
|
|
383 | // if decrementing ever destroys we need to reverse the order here |
351 | if (p) p->refcnt_dec (); |
384 | refcnt_dec (); |
352 | p = o; |
385 | p = o; |
353 | if (p) p->refcnt_inc (); |
386 | refcnt_inc (); |
354 | |
|
|
355 | return *this; |
387 | return *this; |
356 | } |
388 | } |
357 | |
389 | |
358 | const refptr<T> &operator =(const refptr<T> o) |
390 | const refptr<T> &operator =(const refptr<T> &o) |
359 | { |
391 | { |
360 | *this = o.p; |
392 | *this = o.p; |
361 | return *this; |
393 | return *this; |
362 | } |
394 | } |
363 | |
395 | |
364 | T &operator * () const { return *p; } |
396 | T &operator * () const { return *p; } |
365 | T *operator ->() const { return p; } |
397 | T *operator ->() const { return p; } |
366 | |
398 | |
367 | operator T *() const { return p; } |
399 | operator T *() const { return p; } |
368 | }; |
400 | }; |
369 | |
401 | |
370 | typedef refptr<maptile> maptile_ptr; |
402 | typedef refptr<maptile> maptile_ptr; |
… | |
… | |
406 | return !strcmp (a, b); |
438 | return !strcmp (a, b); |
407 | } |
439 | } |
408 | }; |
440 | }; |
409 | |
441 | |
410 | // Mostly the same as std::vector, but insert/erase can reorder |
442 | // Mostly the same as std::vector, but insert/erase can reorder |
411 | // the elements, making insret/remove O(1) instead of O(n). |
443 | // the elements, making append(=insert)/remove O(1) instead of O(n). |
412 | // |
444 | // |
413 | // NOTE: only some forms of erase/insert are available |
445 | // NOTE: only some forms of erase are available |
414 | template<class T> |
446 | template<class T> |
415 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
447 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
416 | { |
448 | { |
417 | typedef typename unordered_vector::iterator iterator; |
449 | typedef typename unordered_vector::iterator iterator; |
418 | |
450 | |
… | |
… | |
459 | return obj->*indexmember |
491 | return obj->*indexmember |
460 | ? this->begin () + obj->*indexmember - 1 |
492 | ? this->begin () + obj->*indexmember - 1 |
461 | : this->end (); |
493 | : this->end (); |
462 | } |
494 | } |
463 | |
495 | |
|
|
496 | void push_back (T *obj) |
|
|
497 | { |
|
|
498 | std::vector<T *, slice_allocator<T *> >::push_back (obj); |
|
|
499 | obj->*indexmember = this->size (); |
|
|
500 | } |
|
|
501 | |
464 | void insert (T *obj) |
502 | void insert (T *obj) |
465 | { |
503 | { |
466 | push_back (obj); |
504 | push_back (obj); |
467 | obj->*indexmember = this->size (); |
|
|
468 | } |
505 | } |
469 | |
506 | |
470 | void insert (T &obj) |
507 | void insert (T &obj) |
471 | { |
508 | { |
472 | insert (&obj); |
509 | insert (&obj); |