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.150 by root, Wed Sep 12 11:10:10 2007 UTC vs.
Revision 1.179 by root, Mon Jul 14 23:57:46 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24#ifndef OBJECT_H 24#ifndef OBJECT_H
25#define OBJECT_H 25#define OBJECT_H
26 26
65 const char *nonuse_name; /* Name to describe objects we can't use */ 65 const char *nonuse_name; /* Name to describe objects we can't use */
66} Body_Locations; 66} Body_Locations;
67 67
68extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; 68extern Body_Locations body_locations[NUM_BODY_LOCATIONS];
69 69
70#define NUM_COINS 4 /* number of coin types */
71extern const char *const coins[NUM_COINS + 1];
72
70/* 73/*
71 * Each object (this also means archetypes!) could have a few of these 74 * Each object (this also means archetypes!) could have a few of these
72 * "dangling" from it; this could also end up containing 'parse errors'. 75 * "dangling" from it; this could also end up containing 'parse errors'.
73 * 76 *
74 * key and value are shared-strings. 77 * key and value are shared-strings.
75 * 78 *
76 * Please use get_ob_key_value(), set_ob_key_value() from object.c rather than 79 * Please use kv_get/kv_set/kv_del from object rather than
77 * accessing the list directly. 80 * accessing the list directly.
78 * Exception is if you want to walk this list for some reason. 81 * Exception is if you want to walk this list for some reason.
79 */ 82 */
80struct key_value 83struct key_value : slice_allocated
81{ 84{
82 key_value *next; 85 key_value *next;
83 shstr key, value; 86 shstr key, value;
84}; 87};
85 88
86struct UUID 89struct UUID
87{ 90{
88 uint64 seq; 91 uint64 seq;
92
93 static UUID cur; // last uuid generated
94 static void init ();
95 static UUID gen ();
89 96
90 UUID () { } 97 UUID () { }
91 UUID (uint64 seq) : seq(seq) { } 98 UUID (uint64 seq) : seq(seq) { }
92 operator uint64() { return seq; } 99 operator uint64() { return seq; }
93 void operator =(uint64 seq) { this->seq = seq; } 100 void operator =(uint64 seq) { this->seq = seq; }
101
102 typedef char BUF [32];
103
104 bool parse (const char *s)
105 {
106 return sscanf (s, "<1.%" SCNx64 ">", &seq) == 1;
107 }
108
109 const char *c_str (char *buf, int len) const
110 {
111 snprintf (buf, len, "<1.%" PRIx64 ">", seq);
112
113 return buf;
114 }
115
116 const char *c_str () const
117 {
118 static BUF buf;
119
120 return c_str (buf, sizeof (buf));
121 }
94}; 122};
95
96extern void init_uuid ();
97extern UUID gen_uuid ();
98extern const uint64 UUID_SKIP;
99 123
100/* Definition for WILL_APPLY values. Replaces having harcoded values 124/* Definition for WILL_APPLY values. Replaces having harcoded values
101 * sprinkled in the code. Note that some of these also replace fields 125 * sprinkled in the code. Note that some of these also replace fields
102 * that were in the can_apply area. What is the point of having both 126 * that were in the can_apply area. What is the point of having both
103 * can_apply and will_apply? 127 * can_apply and will_apply?
153 177
154 float ACC (RW, speed); /* The overall speed of this object */ 178 float ACC (RW, speed); /* The overall speed of this object */
155 float ACC (RW, speed_left); /* How much speed is left to spend this round */ 179 float ACC (RW, speed_left); /* How much speed is left to spend this round */
156 uint32 ACC (RW, nrof); /* How many of the objects */ 180 uint32 ACC (RW, nrof); /* How many of the objects */
157 181
158 /* This next big block are basically used for monsters and equipment */ 182 /* This next big block is basically used for monsters and equipment */
159 uint16 ACC (RW, client_type); /* Public type information. see doc/Developers/objects */ 183 uint16 ACC (RW, client_type); /* Public type information. see doc/Developers/objects */
160 184
161 sint16 ACC (RW, resist[NROFATTACKS]); /* Resistance adjustments for attacks */ 185 sint16 ACC (RW, resist[NROFATTACKS]); /* Resistance adjustments for attacks */
162 uint32 ACC (RW, attacktype); /* Bitmask of attacks this object does */ 186 uint32 ACC (RW, attacktype); /* Bitmask of attacks this object does */
163 uint32 ACC (RW, path_attuned);/* Paths the object is attuned to */ 187 uint32 ACC (RW, path_attuned);/* Paths the object is attuned to */
180 sint8 ACC (RW, item_power); /* power rating of the object */ 204 sint8 ACC (RW, item_power); /* power rating of the object */
181 sint8 ACC (RW, gen_sp_armour);/* sp regen penalty this object has (was last_heal) */ 205 sint8 ACC (RW, gen_sp_armour);/* sp regen penalty this object has (was last_heal) */
182 sint8 ACC (RW, glow_radius); /* indicates the glow radius of the object */ 206 sint8 ACC (RW, glow_radius); /* indicates the glow radius of the object */
183 sint32 ACC (RW, weight); /* Attributes of the object */ 207 sint32 ACC (RW, weight); /* Attributes of the object */
184 sint32 ACC (RW, weight_limit);/* Weight-limit of object */ 208 sint32 ACC (RW, weight_limit);/* Weight-limit of object */
185 sint32 ACC (RW, carrying); /* How much weight this object contains */ 209 sint32 ACC (RW, carrying); /* How much weight this object contains, must be 0 if nrof == 0 */
186 sint64 ACC (RW, perm_exp); /* Permanent exp */ 210 sint64 ACC (RW, perm_exp); /* Permanent exp */
187 uint32 ACC (RW, weapontype); /* type of weapon */ 211 uint32 ACC (RW, weapontype); /* type of weapon */
188 uint32 ACC (RW, tooltype); /* type of tool or build facility */ 212 uint32 ACC (RW, tooltype); /* type of tool or build facility */
189 body_slot slot [NUM_BODY_LOCATIONS]; 213 body_slot slot [NUM_BODY_LOCATIONS];
190 faceidx ACC (RW, face); /* the graphical face */ 214 faceidx ACC (RW, face); /* the graphical face */
236 bool ACC (RW, flag[NUM_FLAGS]); 260 bool ACC (RW, flag[NUM_FLAGS]);
237#endif 261#endif
238 uint16 ACC (RW, animation_id);/* An index into the animation array */ 262 uint16 ACC (RW, animation_id);/* An index into the animation array */
239 uint8 ACC (RW, anim_speed); /* ticks between animation-frames */ 263 uint8 ACC (RW, anim_speed); /* ticks between animation-frames */
240 uint8 ACC (RW, last_anim); /* last sequence used to draw face */ 264 uint8 ACC (RW, last_anim); /* last sequence used to draw face */
241 sint16 ACC (RW, elevation); /* elevation of this terrain - not currently used */
242 uint8 ACC (RW, smoothlevel); /* how to smooth this square around */ 265 uint8 ACC (RW, smoothlevel); /* how to smooth this square around */
243 uint8 ACC (RW, will_apply); /* See crossfire.doc */ 266 uint8 ACC (RW, will_apply); /* See crossfire.doc */
267 uint16 ACC (RW, cached_sp); /* cached spell points used for a spell, used by esrv_update_spells */
268 uint16 ACC (RW, cached_grace);/* cached grace points used for a spell, used by esrv_update_spells */
269 uint16 ACC (RW, cached_eat); /* cached food, used by esrv_update_spells */
244}; 270};
245 271
246struct object : zero_initialised, object_copy 272struct object : zero_initialised, object_copy
247{ 273{
248 // These variables are not changed by ->copy_to 274 // These variables are not changed by ->copy_to
270 object *ACC (RW, more); /* Pointer to the rest of a large body of objects */ 296 object *ACC (RW, more); /* Pointer to the rest of a large body of objects */
271 object *head; /* Points to the main object of a large body */ // NO ACC, perl semantics are different 297 object *head; /* Points to the main object of a large body */ // NO ACC, perl semantics are different
272 client_container *seen_by; // seen by which player/container currently? 298 client_container *seen_by; // seen by which player/container currently?
273 key_value *key_values; /* Fields not explictly known by the loader. */ 299 key_value *key_values; /* Fields not explictly known by the loader. */
274 300
301 // privates / perl
302 const shstr &kv_get (const shstr &key) const;
303 void kv_del (const shstr &key);
304 void kv_set (const shstr &key, const shstr &value);
305
306 // custom extra fields management
307 struct key_value_access_proxy
308 {
309 object &ob;
310 shstr key;
311
312 key_value_access_proxy (object &ob, const shstr &key)
313 : ob (ob), key (key)
314 {
315 }
316
317 const key_value_access_proxy &operator =(const shstr &value) const
318 {
319 ob.kv_set (key, value);
320 return *this;
321 }
322
323 operator const shstr &() const { return ob.kv_get (key); }
324 operator const char *() const { return ob.kv_get (key); }
325
326 private:
327 void operator =(int);
328 };
329
330 // operator [] is too annoying to use
331 const key_value_access_proxy kv (const shstr &key)
332 {
333 return key_value_access_proxy (*this, key);
334 }
335
275 bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all 336 bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all
276 MTH void post_load_check (); // do some adjustments after parsing 337 MTH void post_load_check (); // do some adjustments after parsing
277 static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go. 338 static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go.
278 bool write (object_freezer &f); 339 bool write (object_freezer &f);
279 340
280 MTH int slottype () const; 341 MTH int slottype () const;
281 MTH static object *create (); 342 MTH static object *create ();
282 const mapxy &operator =(const mapxy &pos); 343 const mapxy &operator =(const mapxy &pos);
283 object &operator =(const object &src);
284 MTH void copy_to (object *dst); 344 MTH void copy_to (object *dst);
285 MTH object *clone (); // create + copy_to 345 MTH object *clone (); // create + copy_to a single object
346 MTH object *deep_clone (); // copy whole more chain and inventory
286 void do_destroy (); 347 void do_destroy ();
287 void gather_callbacks (AV *&callbacks, event_type event) const; 348 void gather_callbacks (AV *&callbacks, event_type event) const;
288 MTH void destroy (bool destroy_inventory = false); 349 MTH void destroy (bool destroy_inventory = false);
289 350
290 // recursively destroy all objects in inventory, optionally dropping them to the ground instead 351 // recursively destroy all objects in inventory, optionally dropping them to the ground instead
291 MTH void destroy_inv (bool drop_to_ground = false); 352 MTH void destroy_inv (bool drop_to_ground = false);
292 MTH object *insert (object *item); // insert into inventory 353 MTH object *insert (object *item); // insert into inventory
293 MTH void play_sound (faceidx sound) const; 354 MTH void play_sound (faceidx sound);
294 355
295 void do_remove (); 356 void do_remove ();
296 MTH void remove () 357 MTH void remove ()
297 { 358 {
298 if (!flag [FLAG_REMOVED]) 359 if (!flag [FLAG_REMOVED])
353 // info must hold 256 * 3 bytes currently 414 // info must hold 256 * 3 bytes currently
354 const char *debug_desc (char *info) const; 415 const char *debug_desc (char *info) const;
355 MTH const char *debug_desc () const; // uses at least 3 round-robin buffers 416 MTH const char *debug_desc () const; // uses at least 3 round-robin buffers
356 const char *flag_desc (char *desc, int len) const; 417 const char *flag_desc (char *desc, int len) const;
357 418
419 MTH bool decrease (sint32 nr = 1); // returns true if anything is left
420 MTH object *split (sint32 nr = 1); // return 0 on failure
421
358 int number_of () const 422 MTH int number_of () const
359 { 423 {
360 return nrof ? nrof : 1; 424 return nrof ? nrof : 1;
361 } 425 }
362 426
363 uint64 total_weight () const 427 MTH sint32 total_weight () const
364 { 428 {
365 return weight * number_of (); 429 return (weight + carrying) * number_of ();
366 } 430 }
431
432 MTH void update_weight ();
367 433
368 // return the dominant material of this item, always return something 434 // return the dominant material of this item, always return something
369 const materialtype_t *dominant_material () const; 435 const materialtype_t *dominant_material () const;
370 436
371 // return the volume of this object in cm³ 437 // return the volume of this object in cm³
372 uint64 volume () const 438 MTH uint64 volume () const
373 { 439 {
374 return total_weight () 440 return total_weight ()
375 * 1000 441 * 1000
376 * (type == CONTAINER ? 1000 : 1) 442 * (type == CONTAINER ? 1000 : 1)
377 / dominant_material ()->density; 443 / dominant_material ()->density;
401 /* This return true if object has still randomitems which 467 /* This return true if object has still randomitems which
402 * could be expanded. 468 * could be expanded.
403 */ 469 */
404 MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; } 470 MTH bool has_random_items () const { return randomitems && !flag [FLAG_IS_A_TEMPLATE]; }
405 471
472 MTH bool has_dialogue () const { return *&msg == '@'; }
473
474 // returns the outermost owner, never returns 0
475 MTH object *outer_owner ()
476 {
477 for (object *op = this; ; op = op->owner)
478 if (!op->owner)
479 return op;
480 }
481
482 // returns the outermost environment, never returns 0
483 MTH object *outer_env ()
484 {
485 for (object *op = this; ; op = op->env)
486 if (!op->env)
487 return op;
488 }
489
406 // returns the player that has this object in his inventory, or 0 490 // returns the player that has this object in his inventory, or 0
491 // we assume the player is always the outer env
407 MTH object *in_player () const 492 MTH object *in_player ()
408 { 493 {
409 for (object *op = env; op; op = op->env) 494 object *op = outer_env ();
410 if (op->type == PLAYER)
411 return op;
412 495
413 return 0; 496 return op->type == PLAYER ? op : 0;
414 } 497 }
415 498
416 // "temporary" helper function 499 // "temporary" helper function
417 MTH object *head_ () 500 MTH object *head_ ()
418 { 501 {
421 504
422 MTH bool is_head () 505 MTH bool is_head ()
423 { 506 {
424 return head_ () == this; 507 return head_ () == this;
425 } 508 }
509
510 MTH bool is_on_map () const
511 {
512 return !env && !flag [FLAG_REMOVED];
513 }
514
515 // returns the player that cna see this object, if any
516 MTH object *visible_to () const;
426 517
427 MTH std::string long_desc (object *who = 0); 518 MTH std::string long_desc (object *who = 0);
428 MTH std::string describe_monster (object *who = 0); 519 MTH std::string describe_monster (object *who = 0);
429 MTH std::string describe_item (object *who = 0); 520 MTH std::string describe_item (object *who = 0);
430 MTH std::string describe (object *who = 0); 521 MTH std::string describe (object *who = 0);
445 MTH void activate (); 536 MTH void activate ();
446 MTH void deactivate (); 537 MTH void deactivate ();
447 MTH void activate_recursive (); 538 MTH void activate_recursive ();
448 MTH void deactivate_recursive (); 539 MTH void deactivate_recursive ();
449 540
450 // set the givne flag on all objects in the inventory recursively 541 // set the given flag on all objects in the inventory recursively
451 MTH void set_flag_inv (int flag, int value = 1); 542 MTH void set_flag_inv (int flag, int value = 1);
452 543
453 void enter_exit (object *exit);//Perl 544 void enter_exit (object *exit);//Perl
454 MTH void enter_map (maptile *newmap, int x, int y); 545 MTH void enter_map (maptile *newmap, int x, int y);
546 void player_goto (const char *path, int x, int y); // only for players
455 547
456 // returns the mapspace this object is in 548 // returns the mapspace this object is in
457 mapspace &ms () const; 549 mapspace &ms () const;
458 550
459 // fully recursive iterator 551 // fully recursive iterator
495 { 587 {
496 return this; 588 return this;
497 } 589 }
498 590
499 /* This returns TRUE if the object is something that 591 /* This returns TRUE if the object is something that
500 * should be displayed in the floorbox/inventory window 592 * a client might want to know about.
501 */ 593 */
502 MTH bool client_visible () const 594 MTH bool client_visible () const
503 { 595 {
504 return !invisible && type != PLAYER; 596 return !invisible && type != PLAYER;
505 } 597 }
506 598
599 // the client does nrof * this weight
600 MTH sint32 client_weight () const
601 {
602 return weight + carrying;
603 }
604
507 MTH struct region *region () const; 605 MTH struct region *region () const;
508 606
509 void statusmsg (const char *msg, int color = NDI_BLACK); 607 void statusmsg (const char *msg, int color = NDI_BLACK);
510 void failmsg (const char *msg, int color = NDI_RED); 608 void failmsg (const char *msg, int color = NDI_RED);
609
610 const char *query_inventory (object *who = 0, const char *indent = "");
511 611
512 MTH const_octet_string ref () const; // creates and returns a consistent persistent object reference 612 MTH const_octet_string ref () const; // creates and returns a consistent persistent object reference
513 static object *deref (const_octet_string ref); // returns the object from the generated refreence, if possible 613 static object *deref (const_octet_string ref); // returns the object from the generated refreence, if possible
514 614
515protected: 615protected:
516 void link (); 616 void link ();
517 void unlink (); 617 void unlink ();
518 618
519 object (); 619 object ();
520 ~object (); 620 ~object ();
621
622private:
623 object &operator =(const object &);
624 object (const object &);
521}; 625};
522 626
523// move this object to the top of its env's inventory to speed up 627// move this object to the top of its env's inventory to speed up
524// searches for it. 628// searches for it.
525static object * 629static object *
546} objectlink; 650} objectlink;
547 651
548typedef struct oblinkpt 652typedef struct oblinkpt
549{ /* Used to link together several object links */ 653{ /* Used to link together several object links */
550 struct oblnk *link; 654 struct oblnk *link;
551 long value; /* Used as connected value in buttons/gates */ 655 sint32 value; /* Used as connected value in buttons/gates */
552 struct oblinkpt *next; 656 struct oblinkpt *next;
553} oblinkpt; 657} oblinkpt;
554 658
555object *find_skill_by_name (object *who, const char *name); 659object *find_skill_by_name (object *who, const char *name);
556object *find_skill_by_name (object *who, const shstr &sh); 660object *find_skill_by_name (object *who, const shstr &sh);
566 */ 670 */
567 671
568INTERFACE_CLASS (archetype) 672INTERFACE_CLASS (archetype)
569struct archetype : object 673struct archetype : object
570{ 674{
675 static arch_ptr empty; // the empty_archetype
676 MTH static void gc ();
677
571 archetype (const char *name); 678 archetype (const char *name);
572 ~archetype (); 679 ~archetype ();
573 void gather_callbacks (AV *&callbacks, event_type event) const; 680 void gather_callbacks (AV *&callbacks, event_type event) const;
574 681
575 static archetype *read (object_thawer &f);
576
577 MTH static archetype *get (const_utf8_string name); // find or create
578 MTH static archetype *find (const_utf8_string name); 682 MTH static archetype *find (const_utf8_string name);
579 683
580 MTH void link (); 684 MTH void link ();
581 MTH void unlink (); 685 MTH void unlink ();
582 686
687 MTH static object *get (const char *name); // (find() || singularity)->instance()
688 MTH object *instance ();
689
583 object_vector_index ACC (RW, archid); // index in archvector 690 object_vector_index ACC (RW, archid); // index in archvector
584 shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ 691 shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */
585 bool ACC (RW, stub); // if true, this is an invalid archetype
586 692
587 sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ 693 sint8 ACC (RW, min_x), ACC (RW, min_y); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */
588 sint8 ACC (RW, max_x), ACC (RW, max_y); 694 sint8 ACC (RW, max_x), ACC (RW, max_y);
695
696 // support for archetype loading
697 static archetype *read (object_thawer &f);
698 MTH static void commit_load (); // commit any objects loaded, resolves cyclic dependencies and more
699 static void postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch); /* postpone other_arch reference */
589}; 700};
701
702// compatbiility, remove once replaced by ->instance
703inline object *
704arch_to_object (archetype *at)
705{
706 return at->instance ();
707}
590 708
591inline void 709inline void
592object_freezer::put (keyword k, archetype *v) 710object_freezer::put (keyword k, archetype *v)
593{ 711{
594 put (k, v ? &v->archname : (const char *)0); 712 put (k, v ? &v->archname : (const char *)0);
600 718
601extern objectvec objects; 719extern objectvec objects;
602extern activevec actives; 720extern activevec actives;
603extern archvec archetypes; 721extern archvec archetypes;
604 722
723// "safely" iterate over inv in a way such that the current item is removable
724// quite horrible, thats why its hidden in some macro
725#define for_inv_removable(op,var) \
726 for (object *var, *next_ = (op)->inv; (var = next_), var && (next_ = var->below), var; )
727
605#define for_all_objects(var) \ 728#define for_all_objects(var) \
606 for (unsigned _i = 0; _i < objects.size (); ++_i) \ 729 for (unsigned _i = 0; _i < objects.size (); ++_i) \
607 statementvar (object *, var, objects [_i]) 730 statementvar (object *, var, objects [_i])
608 731
609#define for_all_actives(var) \ 732#define for_all_actives(var) \
610 for (unsigned _i = 0; _i < actives.size (); ++_i) \ 733 for (unsigned _i = 0; _i < actives.size (); ++_i) \
611 statementvar (object *, var, actives [_i]) 734 statementvar (object *, var, actives [_i])
612 735
613#define for_all_archetypes(var) \ 736#define for_all_archetypes(var) \
614 for (unsigned _i = 0; _i < archetypes.size (); ++_i) \ 737 for (unsigned _i = 0; _i < archetypes.size (); ++_i) \
615 statementvar (archetype *, var, archetypes [_i]) 738 statementvar (archetype *, var, archetypes [_i])
616 739
617/* Used by update_object to know if the object being passed is 740/* Used by update_object to know if the object being passed is
618 * being added or removed. 741 * being added or removed.
637 * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - 760 * INS_BELOW_ORIGINATOR: Insert new object immediately below originator -
638 * Use for treasure chests so the new object is the highest thing 761 * Use for treasure chests so the new object is the highest thing
639 * beneath the player, but not actually above it. Note - the 762 * beneath the player, but not actually above it. Note - the
640 * map and x,y coordinates for the object to be inserted must 763 * map and x,y coordinates for the object to be inserted must
641 * match the originator. 764 * match the originator.
642 * INS_MAP_LOAD: disable lots of checkings done at insertion to
643 * speed up map loading process, as we assume the ordering in
644 * loaded map is correct.
645 * 765 *
646 * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY 766 * Note that INS_BELOW_ORIGINATOR, INS_ON_TOP, INS_ABOVE_FLOOR_ONLY
647 * are mutually exclusive. The behaviour for passing more than one 767 * are mutually exclusive. The behaviour for passing more than one
648 * should be considered undefined - while you may notice what happens 768 * should be considered undefined - while you may notice what happens
649 * right now if you pass more than one, that could very well change 769 * right now if you pass more than one, that could very well change
652#define INS_NO_MERGE 0x0001 772#define INS_NO_MERGE 0x0001
653#define INS_ABOVE_FLOOR_ONLY 0x0002 773#define INS_ABOVE_FLOOR_ONLY 0x0002
654#define INS_NO_WALK_ON 0x0004 774#define INS_NO_WALK_ON 0x0004
655#define INS_ON_TOP 0x0008 775#define INS_ON_TOP 0x0008
656#define INS_BELOW_ORIGINATOR 0x0010 776#define INS_BELOW_ORIGINATOR 0x0010
657#define INS_MAP_LOAD 0x0020
658 777
659#define ARCH_DEPLETION "depletion" 778#define ARCH_DEPLETION "depletion"
660 779
661#endif 780#endif
662 781

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines