ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/object.h
(Generate patch)

Comparing deliantra/server/include/object.h (file contents):
Revision 1.254 by root, Fri Jul 2 16:24:24 2010 UTC vs.
Revision 1.262 by root, Mon Oct 1 01:43:39 2012 UTC

1/* 1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * Deliantra is free software: you can redistribute it and/or modify it under 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * the terms of the Affero GNU General Public License as published by the 9 * the terms of the Affero GNU General Public License as published by the
… …
33typedef int tag_t; 33typedef int tag_t;
34 34
35// also see common/item.C 35// also see common/item.C
36enum 36enum
37{ 37{
38 body_skill, 38# define def(name, use, nonuse) body_ ## name,
39 body_combat, 39# include "slotinc.h"
40 body_range, 40# undef def
41 body_shield,
42 body_arm,
43 body_torso,
44 body_head,
45 body_neck,
46 body_finger,
47 body_shoulder,
48 body_foot,
49 body_hand,
50 body_wrist,
51 body_waist,
52 NUM_BODY_LOCATIONS 41 NUM_BODY_LOCATIONS
53}; 42};
54 43
55/* See common/item.c */ 44/* See common/item.c */
56 45
57typedef struct Body_Locations 46struct Body_Locations
58{ 47{
48 const char *name; /* Short name/identifier */
59 keyword save_name; /* Name used to load/save it to disk */ 49 keyword kw; /* Name used to load/save it to disk */
60 const char *use_name; /* Name used when describing an item we can use */ 50 const char *use_name; /* Name used when describing an item we can use */
61 const char *nonuse_name; /* Name to describe objects we can't use */ 51 const char *nonuse_name; /* Name to describe objects we can't use */
62} Body_Locations; 52};
63 53
64extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; 54extern Body_Locations body_locations[NUM_BODY_LOCATIONS];
65 55
66// for each set of directions (1 == up, 2 == right, 4 == down, 8 == left) 56// for each set of directions (1 == up, 2 == right, 4 == down, 8 == left)
67// contaisn the wall suffix (0, 1_3, 1_4 and so on). 57// contains the wall suffix (0, 1_3, 1_4 and so on).
68extern const char *wall_suffix[16]; 58extern const char *wall_suffix[16];
69 59
70#define NUM_COINS 4 /* number of coin types */ 60#define NUM_COINS 4 /* number of coin types */
71extern const char *const coins[NUM_COINS + 1]; 61extern const char *const coins[NUM_COINS + 1];
72 62
… …
83 * accessing the list directly. 73 * accessing the list directly.
84 * Exception is if you want to walk this list for some reason. 74 * Exception is if you want to walk this list for some reason.
85 */ 75 */
86struct key_value : slice_allocated 76struct key_value : slice_allocated
87{ 77{
88 key_value *next; 78 key_value *next; // must be first element
89 shstr key, value; 79 shstr key, value;
80};
81
82// "crossfires version of a perl hash."
83struct key_values
84{
85 key_value *first; // must be first element
86
87 bool empty() const
88 {
89 return !first;
90 }
91
92 void clear ();
93 shstr_tmp get (shstr_tmp key) const;
94 void del (shstr_tmp key);
95 void set (shstr_tmp key, shstr_tmp value);
96
97 void add (shstr_tmp key, shstr_tmp value); // liek set, but doesn't check for duplicates
98 void reverse (); // reverses the ordering, to be used after loading an object
99 key_values &operator =(const key_values &kv);
100
101 // custom extra fields management
102 struct access_proxy
103 {
104 key_values &kv;
105 shstr_tmp key;
106
107 access_proxy (key_values &kv, shstr_tmp key)
108 : kv (kv), key (key)
109 {
110 }
111
112 const access_proxy &operator =(shstr_tmp value) const
113 {
114 kv.set (key, value);
115 return *this;
116 }
117
118 operator const shstr_tmp () const { return kv.get (key); }
119 operator const char *() const { return kv.get (key); }
120
121 private:
122 void operator =(int);
123 };
124
125 const access_proxy operator [](shstr_tmp key)
126 {
127 return access_proxy (*this, key);
128 }
90}; 129};
91 130
92//-GPL 131//-GPL
93 132
94struct UUID 133struct UUID
… …
332 object *ACC (RW, env); /* Pointer to the object which is the environment. 371 object *ACC (RW, env); /* Pointer to the object which is the environment.
333 * This is typically the container that the object is in. 372 * This is typically the container that the object is in.
334 */ 373 */
335 object *ACC (RW, more); /* Pointer to the rest of a large body of objects */ 374 object *ACC (RW, more); /* Pointer to the rest of a large body of objects */
336 object *head; /* Points to the main object of a large body */ // NO ACC, perl semantics are different 375 object *head; /* Points to the main object of a large body */ // NO ACC, perl semantics are different
337 key_value *key_values; /* Fields not explictly known by the loader. */
338 376
339 MTH void set_flag (int flagnum) 377 MTH void set_flag (int flagnum)
340 { 378 {
341 flag [flagnum] = true; 379 flag [flagnum] = true;
342 } 380 }
… …
344 MTH void clr_flag (int flagnum) 382 MTH void clr_flag (int flagnum)
345 { 383 {
346 flag [flagnum] = false; 384 flag [flagnum] = false;
347 } 385 }
348 386
349 // privates / perl 387 // extra key value pairs
350 shstr_tmp kv_get (shstr_tmp key) const; 388 key_values kv;
351 void kv_del (shstr_tmp key);
352 void kv_set (shstr_tmp key, shstr_tmp value);
353 389
354//-GPL 390//-GPL
355
356 // custom extra fields management
357 struct key_value_access_proxy
358 {
359 object &ob;
360 shstr_tmp key;
361
362 key_value_access_proxy (object &ob, shstr_tmp key)
363 : ob (ob), key (key)
364 {
365 }
366
367 const key_value_access_proxy &operator =(shstr_tmp value) const
368 {
369 ob.kv_set (key, value);
370 return *this;
371 }
372
373 operator const shstr_tmp () const { return ob.kv_get (key); }
374 operator const char *() const { return ob.kv_get (key); }
375
376 private:
377 void operator =(int);
378 };
379
380 // operator [] is too annoying to use
381 const key_value_access_proxy kv (shstr_tmp key)
382 {
383 return key_value_access_proxy (*this, key);
384 }
385 391
386 bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all 392 bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all
387 MTH void post_load_check (); // do some adjustments after parsing 393 MTH void post_load_check (); // do some adjustments after parsing
388 static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go. 394 static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go.
389 bool write (object_freezer &f); 395 bool write (object_freezer &f);
… …
452 return op1->value == op2->value 458 return op1->value == op2->value
453 && op1->name == op2->name 459 && op1->name == op2->name
454 && can_merge_slow (op1, op2); 460 && can_merge_slow (op1, op2);
455 } 461 }
456 462
457 MTH void set_owner (object *owner); 463 MTH void set_owner (object_ornull *owner);
458 MTH void set_speed (float speed); 464 MTH void set_speed (float speed);
459 MTH void set_glow_radius (sint8 rad); 465 MTH void set_glow_radius (sint8 rad);
460 466
461 MTH void open_container (object *new_container); 467 MTH void open_container (object *new_container);
462 MTH void close_container () 468 MTH void close_container ()
… …
695 MTH void activate (); 701 MTH void activate ();
696 MTH void deactivate (); 702 MTH void deactivate ();
697 MTH void activate_recursive (); 703 MTH void activate_recursive ();
698 MTH void deactivate_recursive (); 704 MTH void deactivate_recursive ();
699 705
706 // prefetch and activate the surrounding area
707 MTH void prefetch_surrounding_maps ();
708
700 // set the given flag on all objects in the inventory recursively 709 // set the given flag on all objects in the inventory recursively
701 MTH void set_flag_inv (int flag, int value = 1); 710 MTH void set_flag_inv (int flag, int value = 1);
702 711
703 void enter_exit (object *exit); // perl 712 void enter_exit (object *exit); // perl
704 MTH bool enter_map (maptile *newmap, int x, int y); 713 MTH bool enter_map (maptile *newmap, int x, int y);
705 void player_goto (const_utf8_string path, int x, int y); // only for players 714 void player_goto (const_utf8_string path, int x, int y); // only for players
706 MTH bool apply (object *ob, int aflags = AP_APPLY); // ob may be 0 715 MTH bool apply (object *ob, int aflags = AP_APPLY); // ob may be 0
707 716
708 MTH object *mark () const; 717 MTH object *mark () const;
718 MTH void splay_marked ();
709 719
710 // returns the mapspace this object is in 720 // returns the mapspace this object is in
711 mapspace &ms () const; 721 mapspace &ms () const;
712 722
713 // fully recursive iterator 723 // fully recursive iterator

Diff Legend

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