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.48 by root, Mon Jun 4 12:19:08 2007 UTC vs.
Revision 1.56 by root, Sun Sep 9 06:25:46 2007 UTC

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
… …
334 333
335typedef tausworthe_random_generator rand_gen; 334typedef tausworthe_random_generator rand_gen;
336 335
337extern rand_gen rndm; 336extern rand_gen rndm;
338 337
338INTERFACE_CLASS (attachable)
339struct 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
351extern refcnt_base::refcnt_t refcnt_dummy;
352
339template<class T> 353template<class T>
340struct refptr 354struct 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
370typedef refptr<maptile> maptile_ptr; 403typedef 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
410template<class T> 447template<class T>
411struct unordered_vector : std::vector<T, slice_allocator<T> > 448struct 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
429template<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
478typedef int object_vector_index;
479
480template<class T, object_vector_index T::*indexmember>
430struct object_vector : std::vector<T *, slice_allocator<T *> > 481struct object_vector : std::vector<T *, slice_allocator<T *> >
431{ 482{
432 typedef typename object_vector::iterator iterator; 483 typedef typename object_vector::iterator iterator;
433 484
434 bool contains (const T *obj) const 485 bool contains (const T *obj) const
435 { 486 {
436 return obj->*index; 487 return obj->*indexmember;
437 } 488 }
438 489
439 iterator find (const T *obj) 490 iterator find (const T *obj)
440 { 491 {
441 return obj->*index 492 return obj->*indexmember
442 ? this->begin () + obj->*index - 1 493 ? this->begin () + obj->*indexmember - 1
443 : this->end (); 494 : this->end ();
444 } 495 }
445 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
446 void insert (T *obj) 503 void insert (T *obj)
447 { 504 {
448 assert (!(obj->*index));
449 push_back (obj); 505 push_back (obj);
450 obj->*index = this->size ();
451 } 506 }
452 507
453 void insert (T &obj) 508 void insert (T &obj)
454 { 509 {
455 insert (&obj); 510 insert (&obj);
456 } 511 }
457 512
458 void erase (T *obj) 513 void erase (T *obj)
459 { 514 {
460 assert (obj->*index);
461 unsigned int pos = obj->*index; 515 unsigned int pos = obj->*indexmember;
462 obj->*index = 0; 516 obj->*indexmember = 0;
463 517
464 if (pos < this->size ()) 518 if (pos < this->size ())
465 { 519 {
466 (*this)[pos - 1] = (*this)[this->size () - 1]; 520 (*this)[pos - 1] = (*this)[this->size () - 1];
467 (*this)[pos - 1]->*index = pos; 521 (*this)[pos - 1]->*indexmember = pos;
468 } 522 }
469 523
470 this->pop_back (); 524 this->pop_back ();
471 } 525 }
472 526
473 void erase (T &obj) 527 void erase (T &obj)
474 { 528 {
475 errase (&obj); 529 erase (&obj);
476 } 530 }
477}; 531};
478 532
479// 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
480void assign (char *dst, const char *src, int maxlen); 534void assign (char *dst, const char *src, int maxlen);
… …
491// return current time as timestampe 545// return current time as timestampe
492tstamp now (); 546tstamp now ();
493 547
494int similar_direction (int a, int b); 548int similar_direction (int a, int b);
495 549
496// like printf, but returns a std::string 550// like sprintf, but returns a "static" buffer
497const std::string format (const char *format, ...); 551const char *format (const char *format, ...);
498 552
499#endif 553#endif
500 554

Diff Legend

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