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 (©) 2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * 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 |
10 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * GNU General Public License for more details. |
17 | * |
18 | * |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * You should have received a copy of the Affero GNU General Public License |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
21 | * <http://www.gnu.org/licenses/>. |
21 | * |
22 | * |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
24 | */ |
24 | |
25 | |
25 | #ifndef OBJECT_H |
26 | #ifndef OBJECT_H |
26 | #define OBJECT_H |
27 | #define OBJECT_H |
… | |
… | |
33 | typedef int tag_t; |
34 | typedef int tag_t; |
34 | |
35 | |
35 | // also see common/item.C |
36 | // also see common/item.C |
36 | enum |
37 | enum |
37 | { |
38 | { |
38 | body_skill, |
39 | # define def(name, use, nonuse) body_ ## name, |
39 | body_combat, |
40 | # include "slotinc.h" |
40 | body_range, |
41 | # 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 |
42 | NUM_BODY_LOCATIONS |
53 | }; |
43 | }; |
54 | |
44 | |
55 | /* See common/item.c */ |
45 | /* See common/item.c */ |
56 | |
46 | |
57 | typedef struct Body_Locations |
47 | struct Body_Locations |
58 | { |
48 | { |
|
|
49 | const char *name; /* Short name/identifier */ |
59 | keyword save_name; /* Name used to load/save it to disk */ |
50 | keyword kw; /* Name used to load/save it to disk */ |
60 | const char *use_name; /* Name used when describing an item we can use */ |
51 | 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 */ |
52 | const char *nonuse_name; /* Name to describe objects we can't use */ |
62 | } Body_Locations; |
53 | }; |
63 | |
54 | |
64 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
55 | extern Body_Locations body_locations[NUM_BODY_LOCATIONS]; |
65 | |
56 | |
66 | // for each set of directions (1 == up, 2 == right, 4 == down, 8 == left) |
57 | // 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). |
58 | // contains the wall suffix (0, 1_3, 1_4 and so on). |
68 | extern const char *wall_suffix[16]; |
59 | extern const char *wall_suffix[16]; |
69 | |
60 | |
70 | #define NUM_COINS 4 /* number of coin types */ |
61 | #define NUM_COINS 4 /* number of coin types */ |
71 | extern const char *const coins[NUM_COINS + 1]; |
62 | extern const char *const coins[NUM_COINS + 1]; |
72 | |
63 | |
… | |
… | |
83 | * accessing the list directly. |
74 | * accessing the list directly. |
84 | * Exception is if you want to walk this list for some reason. |
75 | * Exception is if you want to walk this list for some reason. |
85 | */ |
76 | */ |
86 | struct key_value : slice_allocated |
77 | struct key_value : slice_allocated |
87 | { |
78 | { |
88 | key_value *next; |
79 | key_value *next; // must be first element |
89 | shstr key, value; |
80 | shstr key, value; |
|
|
81 | }; |
|
|
82 | |
|
|
83 | // "crossfires version of a perl hash." |
|
|
84 | struct key_values |
|
|
85 | { |
|
|
86 | key_value *first; // must be first element |
|
|
87 | |
|
|
88 | bool empty() const |
|
|
89 | { |
|
|
90 | return !first; |
|
|
91 | } |
|
|
92 | |
|
|
93 | void clear (); |
|
|
94 | shstr_tmp get (shstr_tmp key) const; |
|
|
95 | void del (shstr_tmp key); |
|
|
96 | void set (shstr_tmp key, shstr_tmp value); |
|
|
97 | |
|
|
98 | void add (shstr_tmp key, shstr_tmp value); // liek set, but doesn't check for duplicates |
|
|
99 | void reverse (); // reverses the ordering, to be used after loading an object |
|
|
100 | key_values &operator =(const key_values &kv); |
|
|
101 | |
|
|
102 | // custom extra fields management |
|
|
103 | struct access_proxy |
|
|
104 | { |
|
|
105 | key_values &kv; |
|
|
106 | shstr_tmp key; |
|
|
107 | |
|
|
108 | access_proxy (key_values &kv, shstr_tmp key) |
|
|
109 | : kv (kv), key (key) |
|
|
110 | { |
|
|
111 | } |
|
|
112 | |
|
|
113 | const access_proxy &operator =(shstr_tmp value) const |
|
|
114 | { |
|
|
115 | kv.set (key, value); |
|
|
116 | return *this; |
|
|
117 | } |
|
|
118 | |
|
|
119 | operator const shstr_tmp () const { return kv.get (key); } |
|
|
120 | operator const char *() const { return kv.get (key); } |
|
|
121 | |
|
|
122 | private: |
|
|
123 | void operator =(int); |
|
|
124 | }; |
|
|
125 | |
|
|
126 | const access_proxy operator [](shstr_tmp key) |
|
|
127 | { |
|
|
128 | return access_proxy (*this, key); |
|
|
129 | } |
90 | }; |
130 | }; |
91 | |
131 | |
92 | //-GPL |
132 | //-GPL |
93 | |
133 | |
94 | struct UUID |
134 | struct UUID |
… | |
… | |
255 | |
295 | |
256 | // 8 free bits |
296 | // 8 free bits |
257 | |
297 | |
258 | //float ACC (RW, expmul) = 1.0; /* needed experience = (calc_exp*expmul) - means some */ |
298 | //float ACC (RW, expmul) = 1.0; /* needed experience = (calc_exp*expmul) - means some */ |
259 | // /* races/classes can need less/more exp to gain levels */ |
299 | // /* races/classes can need less/more exp to gain levels */ |
260 | static const float expmul = 1.0;//D |
300 | constexpr static const float expmul = 1.0;//D |
261 | float ACC (RW, move_slow_penalty); /* How much this slows down the object */ |
301 | float ACC (RW, move_slow_penalty); /* How much this slows down the object */ |
262 | |
302 | |
263 | /* Following are values used by any object */ |
303 | /* Following are values used by any object */ |
264 | /* this objects turns into or what this object creates */ |
304 | /* this objects turns into or what this object creates */ |
265 | treasurelist *ACC (RW, randomitems); /* Items to be generated */ |
305 | treasurelist *ACC (RW, randomitems); /* Items to be generated */ |
… | |
… | |
332 | object *ACC (RW, env); /* Pointer to the object which is the environment. |
372 | object *ACC (RW, env); /* Pointer to the object which is the environment. |
333 | * This is typically the container that the object is in. |
373 | * This is typically the container that the object is in. |
334 | */ |
374 | */ |
335 | object *ACC (RW, more); /* Pointer to the rest of a large body of objects */ |
375 | 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 |
376 | 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 | |
377 | |
339 | MTH void set_flag (int flagnum) |
378 | MTH void set_flag (int flagnum) |
340 | { |
379 | { |
341 | flag [flagnum] = true; |
380 | flag [flagnum] = true; |
342 | } |
381 | } |
… | |
… | |
344 | MTH void clr_flag (int flagnum) |
383 | MTH void clr_flag (int flagnum) |
345 | { |
384 | { |
346 | flag [flagnum] = false; |
385 | flag [flagnum] = false; |
347 | } |
386 | } |
348 | |
387 | |
349 | // privates / perl |
388 | // extra key value pairs |
350 | shstr_tmp kv_get (shstr_tmp key) const; |
389 | key_values kv; |
351 | void kv_del (shstr_tmp key); |
|
|
352 | void kv_set (shstr_tmp key, shstr_tmp value); |
|
|
353 | |
390 | |
354 | //-GPL |
391 | //-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 | |
392 | |
386 | bool parse_kv (object_thawer &f); // parse kv pairs, (ab-)used by archetypes, which should not exist at all |
393 | 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 |
394 | 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. |
395 | static object *read (object_thawer &f, maptile *map = 0); // map argument due to toal design bogosity, must go. |
389 | bool write (object_freezer &f); |
396 | bool write (object_freezer &f); |
… | |
… | |
429 | // object op is trying to move in direction dir. |
436 | // object op is trying to move in direction dir. |
430 | // originator is typically the same as op, but |
437 | // originator is typically the same as op, but |
431 | // can be different if originator is causing op to |
438 | // can be different if originator is causing op to |
432 | // move (originator is pushing op) |
439 | // move (originator is pushing op) |
433 | // returns 0 if the object is not able to move to the |
440 | // returns 0 if the object is not able to move to the |
434 | // desired space, 1 otherwise (in which case we also |
441 | // desired space, 1 otherwise (in which case we also |
435 | // move the object accordingly. This function is |
442 | // move the object accordingly. This function is |
436 | // very similiar to move_object. |
443 | // very similiar to move_object. |
437 | int move (int dir, object *originator); |
444 | int move (int dir, object *originator); |
438 | |
445 | |
439 | int move (int dir) |
446 | int move (int dir) |
… | |
… | |
452 | return op1->value == op2->value |
459 | return op1->value == op2->value |
453 | && op1->name == op2->name |
460 | && op1->name == op2->name |
454 | && can_merge_slow (op1, op2); |
461 | && can_merge_slow (op1, op2); |
455 | } |
462 | } |
456 | |
463 | |
457 | MTH void set_owner (object *owner); |
464 | MTH void set_owner (object_ornull *owner); |
458 | MTH void set_speed (float speed); |
465 | MTH void set_speed (float speed); |
459 | MTH void set_glow_radius (sint8 rad); |
466 | MTH void set_glow_radius (sint8 rad); |
460 | |
467 | |
461 | MTH void open_container (object *new_container); |
468 | MTH void open_container (object *new_container); |
462 | MTH void close_container () |
469 | MTH void close_container () |
… | |
… | |
475 | // strangely enough, using ?: here causes code to inflate |
482 | // strangely enough, using ?: here causes code to inflate |
476 | return type == CONTAINER |
483 | return type == CONTAINER |
477 | && ((env && env->container_ () == this) |
484 | && ((env && env->container_ () == this) |
478 | || (!env && flag [FLAG_APPLIED])); |
485 | || (!env && flag [FLAG_APPLIED])); |
479 | } |
486 | } |
|
|
487 | |
|
|
488 | MTH object *find_spell (const_utf8_string prefix) const; |
480 | |
489 | |
481 | MTH object *force_find (shstr_tmp name); |
490 | MTH object *force_find (shstr_tmp name); |
482 | MTH void force_set_timer (int duration); |
491 | MTH void force_set_timer (int duration); |
483 | MTH object *force_add (shstr_tmp name, int duration = 0); |
492 | MTH object *force_add (shstr_tmp name, int duration = 0); |
484 | |
493 | |
… | |
… | |
515 | MTH int number_of () const |
524 | MTH int number_of () const |
516 | { |
525 | { |
517 | return nrof ? nrof : 1; |
526 | return nrof ? nrof : 1; |
518 | } |
527 | } |
519 | |
528 | |
520 | MTH sint32 total_weight () const |
529 | MTH weight_t total_weight () const |
521 | { |
530 | { |
522 | return (weight + carrying) * number_of (); |
531 | return sint64 (weight + carrying) * number_of (); |
523 | } |
532 | } |
524 | |
533 | |
525 | MTH void update_weight (); |
534 | MTH void update_weight (); |
526 | |
535 | |
527 | // return the dominant material of this item, always return something |
536 | // return the dominant material of this item, always return something |
… | |
… | |
529 | { |
538 | { |
530 | return material; |
539 | return material; |
531 | } |
540 | } |
532 | |
541 | |
533 | // return the volume of this object in cm³ |
542 | // return the volume of this object in cm³ |
534 | MTH uint64 volume () const |
543 | MTH volume_t volume () const |
535 | { |
544 | { |
536 | return (uint64)total_weight () |
545 | return (volume_t)total_weight () |
537 | * 1024 // 1000 actually |
546 | * 1024 // 1000 actually |
538 | * (type == CONTAINER ? 128 : 1) |
547 | * (type == CONTAINER ? 128 : 1) |
539 | / dominant_material ()->density; // ugh, division |
548 | / dominant_material ()->density; // ugh, division |
540 | } |
549 | } |
541 | |
550 | |
… | |
… | |
574 | |
583 | |
575 | static bool msg_has_dialogue (const char *msg) { return *msg == '@'; } |
584 | static bool msg_has_dialogue (const char *msg) { return *msg == '@'; } |
576 | |
585 | |
577 | MTH bool has_dialogue () const { return msg_has_dialogue (&msg); } |
586 | MTH bool has_dialogue () const { return msg_has_dialogue (&msg); } |
578 | |
587 | |
579 | /* need_identify returns true if the item should be identified. This |
588 | /* need_identify returns true if the item should be identified. This |
580 | * function really should not exist - by default, any item not identified |
589 | * function really should not exist - by default, any item not identified |
581 | * should need it. |
590 | * should need it. |
582 | */ |
591 | */ |
583 | MTH bool need_identify () const; |
592 | MTH bool need_identify () const; |
584 | |
593 | |
… | |
… | |
694 | |
703 | |
695 | MTH void activate (); |
704 | MTH void activate (); |
696 | MTH void deactivate (); |
705 | MTH void deactivate (); |
697 | MTH void activate_recursive (); |
706 | MTH void activate_recursive (); |
698 | MTH void deactivate_recursive (); |
707 | MTH void deactivate_recursive (); |
|
|
708 | |
|
|
709 | // prefetch and activate the surrounding area |
|
|
710 | MTH void prefetch_surrounding_maps (); |
699 | |
711 | |
700 | // set the given flag on all objects in the inventory recursively |
712 | // set the given flag on all objects in the inventory recursively |
701 | MTH void set_flag_inv (int flag, int value = 1); |
713 | MTH void set_flag_inv (int flag, int value = 1); |
702 | |
714 | |
703 | void enter_exit (object *exit); // perl |
715 | void enter_exit (object *exit); // perl |
… | |
… | |
792 | * range from 0 through 7. |
804 | * range from 0 through 7. |
793 | */ |
805 | */ |
794 | MTH int anim_frames () const { return anim ().num_animations; } |
806 | MTH int anim_frames () const { return anim ().num_animations; } |
795 | MTH int anim_facings () const { return anim ().facings; } |
807 | MTH int anim_facings () const { return anim ().facings; } |
796 | |
808 | |
|
|
809 | // sets a new animation frame, if the object has animation frames, |
|
|
810 | // and updates the face |
|
|
811 | MTH void update_anim_frame (int frame); |
|
|
812 | |
797 | MTH utf8_string as_string (); |
813 | MTH utf8_string as_string (); |
798 | |
814 | |
799 | // low-level management, statistics, ... |
815 | // low-level management, statistics, ... |
800 | static uint32_t ACC (RW, object_count); |
816 | static uint32_t ACC (RW, object_count); |
801 | static uint32_t ACC (RW, free_count); |
817 | static uint32_t ACC (RW, free_count); |
… | |
… | |
873 | MTH object *instance (); |
889 | MTH object *instance (); |
874 | |
890 | |
875 | MTH void post_load_check (); // do some adjustments after parsing |
891 | MTH void post_load_check (); // do some adjustments after parsing |
876 | |
892 | |
877 | object_vector_index ACC (RW, archid); // index in archvector |
893 | object_vector_index ACC (RW, archid); // index in archvector |
878 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
894 | shstr ACC (RW, archname); /* More definite name, like "generate_kobold" */ |
879 | |
895 | |
880 | sint8 ACC (RW, max_x); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
896 | sint8 ACC (RW, max_x); /* extents, compared to the head (min_x, min_y should be zero, but aren't...) */ |
881 | |
897 | |
882 | // support for archetype loading |
898 | // support for archetype loading |
883 | static archetype *read (object_thawer &f); |
899 | static archetype *read (object_thawer &f); |
… | |
… | |
915 | // "safely" iterate over inv in a way such that the current item is removable |
931 | // "safely" iterate over inv in a way such that the current item is removable |
916 | // quite horrible, that's why its hidden in some macro |
932 | // quite horrible, that's why its hidden in some macro |
917 | #define for_inv_removable(op,var) \ |
933 | #define for_inv_removable(op,var) \ |
918 | for (object *var, *next_ = (op)->inv; (var = next_), var && (next_ = var->below), var; ) |
934 | for (object *var, *next_ = (op)->inv; (var = next_), var && (next_ = var->below), var; ) |
919 | |
935 | |
920 | #define for_all_objects(var) \ |
936 | #define for_all_objects(var) \ |
921 | for (unsigned _i = 0; _i < objects.size (); ++_i) \ |
937 | for (unsigned _i = 0; _i < objects.size (); ++_i) \ |
922 | statementvar (object *, var, objects [_i]) |
938 | statementvar (object *, var, objects [_i]) |
923 | |
939 | |
924 | #define for_all_actives(var) \ |
940 | #define for_all_actives(var) \ |
925 | for (unsigned _i = 0; _i < actives.size (); ++_i) \ |
941 | for (unsigned _i = 0; _i < actives.size (); ++_i) \ |
926 | statementvar (object *, var, actives [_i]) |
942 | statementvar (object *, var, actives [_i]) |
927 | |
943 | |
928 | #define for_all_archetypes(var) \ |
944 | #define for_all_archetypes(var) \ |
929 | for (unsigned _i = 0; _i < archetypes.size (); ++_i) \ |
945 | for (unsigned _i = 0; _i < archetypes.size (); ++_i) \ |
930 | statementvar (archetype *, var, archetypes [_i]) |
946 | statementvar (archetype *, var, archetypes [_i]) |
931 | |
947 | |
932 | //+GPL |
948 | //+GPL |
933 | |
949 | |
934 | /* Used by update_object to know if the object being passed is |
950 | /* Used by update_object to know if the object being passed is |
935 | * being added or removed. |
951 | * being added or removed. |
936 | */ |
952 | */ |
937 | #define UP_OBJ_INSERT 1 |
953 | #define UP_OBJ_INSERT 1 // object was inserted |
938 | #define UP_OBJ_REMOVE 2 |
954 | #define UP_OBJ_REMOVE 2 // object was removed |
939 | #define UP_OBJ_CHANGE 3 |
955 | #define UP_OBJ_CHANGE 3 // object has changed in some unspecified way |
940 | #define UP_OBJ_FACE 4 /* Only thing that changed was the face */ |
956 | #define UP_OBJ_FACE 4 // only thing that changed was the face |
941 | |
957 | |
942 | /* These are flags passed to insert_ob_in_map and |
958 | /* These are flags passed to insert_ob_in_map and |
943 | * insert_ob_in_ob. Note that all flags may not be meaningful |
959 | * insert_ob_in_ob. Note that all flags may not be meaningful |
944 | * for both functions. |
960 | * for both functions. |
945 | * Most are fairly explanatory: |
961 | * Most are fairly explanatory: |
946 | * INS_NO_MERGE: don't try to merge inserted object with ones alrady |
962 | * INS_NO_MERGE: don't try to merge inserted object with ones alrady |
947 | * on space. |
963 | * on space. |
948 | * INS_ABOVE_FLOOR_ONLY: Put object immediatly above the floor. |
964 | * INS_ABOVE_FLOOR_ONLY: Put object immediatly above the floor. |
949 | * INS_NO_WALK_ON: Don't call check_walk_on against the |
965 | * INS_NO_WALK_ON: Don't call check_walk_on against the |
950 | * originator - saves cpu time if you know the inserted object |
966 | * originator - saves cpu time if you know the inserted object |
951 | * is not meaningful in terms of having an effect. |
967 | * is not meaningful in terms of having an effect. |
952 | * INS_ON_TOP: Always put object on top. Generally only needed when loading |
968 | * INS_ON_TOP: Always put object on top. Generally only needed when loading |
953 | * files from disk and ordering needs to be preserved. |
969 | * files from disk and ordering needs to be preserved. |
954 | * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - |
970 | * INS_BELOW_ORIGINATOR: Insert new object immediately below originator - |
955 | * Use for treasure chests so the new object is the highest thing |
971 | * Use for treasure chests so the new object is the highest thing |
956 | * beneath the player, but not actually above it. Note - the |
972 | * beneath the player, but not actually above it. Note - the |
957 | * map and x,y coordinates for the object to be inserted must |
973 | * map and x,y coordinates for the object to be inserted must |
958 | * match the originator. |
974 | * match the originator. |