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.45 by root, Sat May 26 15:44:05 2007 UTC vs.
Revision 1.51 by root, Sun Jul 1 05:00:18 2007 UTC

1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 *
6 * Crossfire TRT is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 *
19 * The authors can be reached via e-mail to <crossfire@schmorp.de>
20 */
21
1#ifndef UTIL_H__ 22#ifndef UTIL_H__
2#define UTIL_H__ 23#define UTIL_H__
3 24
4//#define PREFER_MALLOC 25//#define PREFER_MALLOC
5 26
… …
11# define is_constant(c) 0 32# define is_constant(c) 0
12# define expect(expr,value) (expr) 33# define expect(expr,value) (expr)
13# define prefetch(addr,rw,locality) 34# define prefetch(addr,rw,locality)
14#endif 35#endif
15 36
37#if __GNUC__ < 4 || (__GNUC__ == 4 || __GNUC_MINOR__ < 4)
38# define decltype(x) typeof(x)
39#endif
40
16// put into ifs if you are very sure that the expression 41// put into ifs if you are very sure that the expression
17// is mostly true or mosty false. note that these return 42// is mostly true or mosty false. note that these return
18// booleans, not the expression. 43// booleans, not the expression.
19#define expect_false(expr) expect ((expr) != 0, 0) 44#define expect_false(expr) expect ((expr) != 0, 0)
20#define expect_true(expr) expect ((expr) != 0, 1) 45#define expect_true(expr) expect ((expr) != 0, 1)
… …
27#include <glib.h> 52#include <glib.h>
28 53
29#include <shstr.h> 54#include <shstr.h>
30#include <traits.h> 55#include <traits.h>
31 56
32// 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)
33#define auto(var,expr) typeof(expr) var = (expr) 58#define auto(var,expr) decltype(expr) var = (expr)
34 59
35// very ugly macro that basicaly declares and initialises a variable 60// very ugly macro that basicaly declares and initialises a variable
36// that is in scope for the next statement only 61// that is in scope for the next statement only
37// 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
38// (note: works great for pointers) 63// (note: works great for pointers)
39// most ugly macro I ever wrote 64// most ugly macro I ever wrote
40#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)
41 66
42// in range including end 67// in range including end
43#define IN_RANGE_INC(val,beg,end) \ 68#define IN_RANGE_INC(val,beg,end) \
44 ((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))
45 70
… …
379 { 404 {
380 return !strcmp (a, b); 405 return !strcmp (a, b);
381 } 406 }
382}; 407};
383 408
409// Mostly the same as std::vector, but insert/erase can reorder
410// the elements, making insret/remove O(1) instead of O(n).
411//
412// NOTE: only some forms of erase/insert are available
384template<class T> 413template<class T>
385struct unordered_vector : std::vector<T, slice_allocator<T> > 414struct unordered_vector : std::vector<T, slice_allocator<T> >
386{ 415{
387 typedef typename unordered_vector::iterator iterator; 416 typedef typename unordered_vector::iterator iterator;
388 417
… …
398 { 427 {
399 erase ((unsigned int )(i - this->begin ())); 428 erase ((unsigned int )(i - this->begin ()));
400 } 429 }
401}; 430};
402 431
403template<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
444typedef int object_vector_index;
445
446template<class T, object_vector_index T::*indexmember>
404struct object_vector : std::vector<T *, slice_allocator<T *> > 447struct object_vector : std::vector<T *, slice_allocator<T *> >
405{ 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
406 void insert (T *obj) 463 void insert (T *obj)
407 { 464 {
408 assert (!(obj->*index));
409 push_back (obj); 465 push_back (obj);
410 obj->*index = this->size (); 466 obj->*indexmember = this->size ();
411 } 467 }
412 468
413 void insert (T &obj) 469 void insert (T &obj)
414 { 470 {
415 insert (&obj); 471 insert (&obj);
416 } 472 }
417 473
418 void erase (T *obj) 474 void erase (T *obj)
419 { 475 {
420 assert (obj->*index);
421 unsigned int pos = obj->*index; 476 unsigned int pos = obj->*indexmember;
422 obj->*index = 0; 477 obj->*indexmember = 0;
423 478
424 if (pos < this->size ()) 479 if (pos < this->size ())
425 { 480 {
426 (*this)[pos - 1] = (*this)[this->size () - 1]; 481 (*this)[pos - 1] = (*this)[this->size () - 1];
427 (*this)[pos - 1]->*index = pos; 482 (*this)[pos - 1]->*indexmember = pos;
428 } 483 }
429 484
430 this->pop_back (); 485 this->pop_back ();
431 } 486 }
432 487
433 void erase (T &obj) 488 void erase (T &obj)
434 { 489 {
435 errase (&obj); 490 erase (&obj);
436 } 491 }
437}; 492};
438 493
439// 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
440void assign (char *dst, const char *src, int maxlen); 495void assign (char *dst, const char *src, int maxlen);

Diff Legend

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