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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.295 by root, Fri Nov 6 13:03:34 2009 UTC vs.
Revision 1.318 by root, Sat Apr 3 02:27:24 2010 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 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
10 * Free Software Foundation, either version 3 of the License, or (at your 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * option) any later version. 11 * option) any later version.
26#include <stdio.h> 26#include <stdio.h>
27#include <sys/types.h> 27#include <sys/types.h>
28#include <sys/uio.h> 28#include <sys/uio.h>
29#include <object.h> 29#include <object.h>
30#include <sproto.h> 30#include <sproto.h>
31#include <loader.h>
32 31
33#include <bitset> 32#include <bitset>
34 33
35UUID UUID::cur; 34UUID UUID::cur;
36static uint64_t seq_next_save; 35static uint64_t seq_next_save;
77 CALL_CALL ("cf::write_uuid", G_DISCARD); 76 CALL_CALL ("cf::write_uuid", G_DISCARD);
78 CALL_END; 77 CALL_END;
79} 78}
80 79
81static void 80static void
82read_uuid (void) 81read_uuid ()
83{ 82{
84 char filename[MAX_BUF]; 83 char filename[MAX_BUF];
85 84
86 sprintf (filename, "%s/uuid", settings.localdir); 85 sprintf (filename, "%s/uuid", settings.localdir);
87 86
101 100
102 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); 101 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
103 _exit (1); 102 _exit (1);
104 } 103 }
105 104
106 UUID::BUF buf; 105 char buf [UUID::MAX_LEN];
107 buf[0] = 0; 106 buf[0] = 0;
108 fgets (buf, sizeof (buf), fp); 107 fgets (buf, sizeof (buf), fp);
109 108
110 if (!UUID::cur.parse (buf)) 109 if (!UUID::cur.parse (buf))
111 { 110 {
138 137
139void 138void
140UUID::init () 139UUID::init ()
141{ 140{
142 read_uuid (); 141 read_uuid ();
142}
143
144bool
145UUID::parse (const char *s)
146{
147 if (*s++ != '<' || *s++ != '1' || *s++ != '.')
148 return false;
149
150 seq = 0;
151
152 while (*s != '>')
153 {
154 if (*s < '0')
155 return false;
156
157 // this gives nice branchless code with gcc
158 assert ('0' < 'a' && '0' == 48 && 'a' == 97);
159 int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15;
160
161 seq = (seq << 4) | digit;
162
163 ++s;
164 }
165
166 return true;
167}
168
169char *
170UUID::append (char *buf) const
171{
172 *buf++ = '<';
173 *buf++ = '1';
174 *buf++ = '.';
175
176 uint64_t seq = this->seq;
177 const int bits = 64;
178 char nz = 0;
179 static const char tohex [] = "0123456789abcdef";
180
181 // assert (len >= 3 + bits / 4 + 1 + 1);
182 for (int i = bits / 4; --i; )
183 {
184 uint8_t digit = seq >> (bits - 4);
185
186 *buf = tohex [digit];
187 nz |= digit;
188 buf += nz ? 1 : 0;
189 seq <<= 4;
190 }
191
192 // last digit is special - always emit
193 uint8_t digit = seq >> (bits - 4);
194 *buf++ = tohex [digit];
195
196 *buf++ = '>';
197
198 return buf;
199}
200
201char *
202UUID::c_str () const
203{
204 static char buf [MAX_LEN];
205 *append (buf) = 0;
206 return buf;
143} 207}
144 208
145/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 209/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
146static bool 210static bool
147compare_ob_value_lists_one (const object *wants, const object *has) 211compare_ob_value_lists_one (const object *wants, const object *has)
183 * Improvements made with merge: Better checking on potion, and also 247 * Improvements made with merge: Better checking on potion, and also
184 * check weight 248 * check weight
185 */ 249 */
186bool object::can_merge_slow (object *ob1, object *ob2) 250bool object::can_merge_slow (object *ob1, object *ob2)
187{ 251{
188 /* A couple quicksanity checks */ 252 /* A couple quick sanity checks */
189 if (ob1 == ob2 253 if (ob1 == ob2
190 || ob1->type != ob2->type 254 || ob1->type != ob2->type
191 || ob1->speed != ob2->speed
192 || ob1->value != ob2->value 255 || ob1->value != ob2->value
193 || ob1->name != ob2->name) 256 || ob1->name != ob2->name
257 || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED)
194 return 0; 258 return 0;
195 259
196 /* Do not merge objects if nrof would overflow, assume nrof 260 /* Do not merge objects if nrof would overflow, assume nrof
197 * is always 0 .. 2**31-1 */ 261 * is always 0 .. 2**31-1 */
198 if (ob1->nrof > 0x7fffffff - ob2->nrof) 262 if (ob1->nrof > 0x7fffffff - ob2->nrof)
219 || ob1->magic != ob2->magic 283 || ob1->magic != ob2->magic
220 || ob1->slaying != ob2->slaying 284 || ob1->slaying != ob2->slaying
221 || ob1->skill != ob2->skill 285 || ob1->skill != ob2->skill
222 || ob1->value != ob2->value 286 || ob1->value != ob2->value
223 || ob1->animation_id != ob2->animation_id 287 || ob1->animation_id != ob2->animation_id
224 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other 288 || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other
225 || ob1->client_type != ob2->client_type 289 || ob1->client_type != ob2->client_type
226 || ob1->materialname != ob2->materialname 290 || ob1->material != ob2->material
227 || ob1->lore != ob2->lore 291 || ob1->lore != ob2->lore
228 || ob1->subtype != ob2->subtype 292 || ob1->subtype != ob2->subtype
229 || ob1->move_type != ob2->move_type 293 || ob1->move_type != ob2->move_type
230 || ob1->move_block != ob2->move_block 294 || ob1->move_block != ob2->move_block
231 || ob1->move_allow != ob2->move_allow 295 || ob1->move_allow != ob2->move_allow
232 || ob1->move_on != ob2->move_on 296 || ob1->move_on != ob2->move_on
233 || ob1->move_off != ob2->move_off 297 || ob1->move_off != ob2->move_off
234 || ob1->move_slow != ob2->move_slow 298 || ob1->move_slow != ob2->move_slow
235 || ob1->move_slow_penalty != ob2->move_slow_penalty 299 || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f)
236 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) 300 || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist))
237 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) 301 || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats)))
238 return 0; 302 return 0;
239 303
240 if ((ob1->flag ^ ob2->flag) 304 if ((ob1->flag ^ ob2->flag)
442{ 506{
443 return dump_object (this); 507 return dump_object (this);
444} 508}
445 509
446/* 510/*
447 * get_nearest_part(multi-object, object 2) returns the part of the
448 * multi-object 1 which is closest to the second object.
449 * If it's not a multi-object, it is returned.
450 */
451static object *
452get_nearest_part (object *op, const object *pl)
453{
454 object *tmp, *closest;
455 int last_dist, i;
456
457 if (!op->more)
458 return op;
459
460 for (last_dist = distance (op, pl), closest = op, tmp = op->more;
461 tmp;
462 tmp = tmp->more)
463 if ((i = distance (tmp, pl)) < last_dist)
464 closest = tmp, last_dist = i;
465
466 return closest;
467}
468
469/*
470 * Returns the object which has the count-variable equal to the argument. 511 * Returns the object which has the count-variable equal to the argument.
471 * VERRRY slow. 512 * VERRRY slow.
472 */ 513 */
473object * 514object *
474find_object (tag_t i) 515find_object (tag_t i)
475{ 516{
476 for_all_objects (op) 517 for_all_objects (op)
477 if (op->count == i) 518 if (op->count == i)
519 return op;
520
521 return 0;
522}
523
524/*
525 * Returns the object which has the uuid equal to the argument.
526 * MOAR VERRRY slow.
527 */
528
529object *
530find_object_uuid (UUID i)
531{
532 for_all_objects (op)
533 if (op->uuid == i)
478 return op; 534 return op;
479 535
480 return 0; 536 return 0;
481} 537}
482 538
533 if (slot [body_combat].info) return slot_combat; 589 if (slot [body_combat].info) return slot_combat;
534 if (slot [body_range ].info) return slot_ranged; 590 if (slot [body_range ].info) return slot_ranged;
535 } 591 }
536 592
537 return slot_none; 593 return slot_none;
538}
539
540bool
541object::change_weapon (object *ob)
542{
543 if (current_weapon == ob)
544 return true;
545
546 if (chosen_skill)
547 chosen_skill->flag [FLAG_APPLIED] = false;
548
549 current_weapon = ob;
550 chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill);
551
552 if (chosen_skill)
553 chosen_skill->flag [FLAG_APPLIED] = true;
554
555 update_stats ();
556
557 if (ob)
558 {
559 // now check wether any body locations became invalid, in which case
560 // we cannot apply the weapon at the moment.
561 for (int i = 0; i < NUM_BODY_LOCATIONS; ++i)
562 if (slot[i].used < 0)
563 {
564 current_weapon = chosen_skill = 0;
565 update_stats ();
566
567 new_draw_info_format (NDI_UNIQUE, 0, this,
568 "You try to balance all your items at once, "
569 "but the %s is just too much for your body. "
570 "[You need to unapply some items first - use the 'body' command to see "
571 "how many items you cna wera on a specific body part.]", &ob->name);
572 return false;
573 }
574
575 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
576 }
577 else
578 ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons.");
579
580 if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL)
581 {
582 LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s",
583 &name, ob->debug_desc ());
584 return false;
585 }
586
587 return true;
588} 594}
589 595
590/* Zero the key_values on op, decrementing the shared-string 596/* Zero the key_values on op, decrementing the shared-string
591 * refcounts and freeing the links. 597 * refcounts and freeing the links.
592 */ 598 */
645 tail = new_link; 651 tail = new_link;
646 } 652 }
647 } 653 }
648 } 654 }
649 655
650 if (speed < 0)
651 dst->speed_left -= rndm ();
652
653 dst->activate (); 656 dst->activate ();
654} 657}
655 658
656void 659void
657object::instantiate () 660object::instantiate ()
658{ 661{
659 if (!uuid.seq) // HACK 662 if (!uuid.seq) // HACK
660 uuid = UUID::gen (); 663 uuid = UUID::gen ();
661 664
665 // TODO: unclean state changes, should nt be done in copy_to AND instantiate
666 if (flag [FLAG_RANDOM_SPEED] && speed)
667 speed_left = - speed - rndm (); // TODO animation
668 else
662 speed_left = -0.1f; 669 speed_left = -1.;
670
663 /* copy the body_info to the body_used - this is only really 671 /* copy the body_info to the body_used - this is only really
664 * need for monsters, but doesn't hurt to do it for everything. 672 * need for monsters, but doesn't hurt to do it for everything.
665 * by doing so, when a monster is created, it has good starting 673 * by doing so, when a monster is created, it has good starting
666 * values for the body_used info, so when items are created 674 * values for the body_used info, so when items are created
667 * for it, they can be properly equipped. 675 * for it, they can be properly equipped.
675object * 683object *
676object::clone () 684object::clone ()
677{ 685{
678 object *neu = create (); 686 object *neu = create ();
679 copy_to (neu); 687 copy_to (neu);
688
689 // TODO: unclean state changes, should not be done in clone AND instantiate
690 if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed)
691 neu->speed_left = - neu->speed - rndm (); // TODO animation
692
680 neu->map = map; // not copied by copy_to 693 neu->map = map; // not copied by copy_to
681 return neu; 694 return neu;
682} 695}
683 696
684/* 697/*
702 * This function needs to be called whenever the speed of an object changes. 715 * This function needs to be called whenever the speed of an object changes.
703 */ 716 */
704void 717void
705object::set_speed (float speed) 718object::set_speed (float speed)
706{ 719{
707 if (flag [FLAG_FREED] && speed)
708 {
709 LOG (llevError, "Object %s is freed but has speed.\n", &name);
710 speed = 0;
711 }
712
713 this->speed = speed; 720 this->speed = speed;
714 721
715 if (has_active_speed ()) 722 if (has_active_speed ())
716 activate (); 723 activate ();
717 else 724 else
767 774
768 if (!(m.flags_ & P_UPTODATE)) 775 if (!(m.flags_ & P_UPTODATE))
769 /* nop */; 776 /* nop */;
770 else if (action == UP_OBJ_INSERT) 777 else if (action == UP_OBJ_INSERT)
771 { 778 {
779#if 0
772 // this is likely overkill, TODO: revisit (schmorp) 780 // this is likely overkill, TODO: revisit (schmorp)
773 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) 781 if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW))
774 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) 782 || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC))
775 || (op->is_player () && !(m.flags_ & P_PLAYER)) 783 || (op->is_player () && !(m.flags_ & P_PLAYER))
776 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) 784 || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE))
781 || (m.move_slow | op->move_slow) != m.move_slow 789 || (m.move_slow | op->move_slow) != m.move_slow
782 /* This isn't perfect, but I don't expect a lot of objects to 790 /* This isn't perfect, but I don't expect a lot of objects to
783 * have move_allow right now. 791 * have move_allow right now.
784 */ 792 */
785 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block 793 || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block
786 || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp)
787 m.invalidate (); 794 m.invalidate ();
795#else
796 // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp)
797 m.invalidate ();
798#endif
788 } 799 }
789 /* if the object is being removed, we can't make intelligent 800 /* if the object is being removed, we can't make intelligent
790 * decisions, because remove_ob can't really pass the object 801 * decisions, because remove_ob can't really pass the object
791 * that is being removed. 802 * that is being removed.
792 */ 803 */
804object::object () 815object::object ()
805{ 816{
806 SET_FLAG (this, FLAG_REMOVED); 817 SET_FLAG (this, FLAG_REMOVED);
807 818
808 //expmul = 1.0; declared const for the time being 819 //expmul = 1.0; declared const for the time being
809 face = blank_face; 820 face = blank_face;
821 material = MATERIAL_NULL;
810} 822}
811 823
812object::~object () 824object::~object ()
813{ 825{
814 unlink (); 826 unlink ();
1085 1097
1086 above = 0; 1098 above = 0;
1087 below = 0; 1099 below = 0;
1088 env = 0; 1100 env = 0;
1089 1101
1090 /* NO_FIX_PLAYER is set when a great many changes are being 1102 if (pl && pl->is_player ())
1091 * made to players inventory. If set, avoiding the call
1092 * to save cpu time.
1093 */ 1103 {
1094 if (pl) 1104 if (expect_false (pl->contr->combat_ob == this))
1095 if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER)))
1096 { 1105 {
1097 pl->update_stats (); 1106 pl->apply (pl->contr->combat_ob, AP_UNAPPLY);
1107 pl->contr->combat_ob = 0;
1108 if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob);
1109 }
1098 1110
1111 if (expect_false (pl->contr->ranged_ob == this))
1112 {
1113 pl->apply (pl->contr->ranged_ob, AP_UNAPPLY);
1114 pl->contr->ranged_ob = 0;
1115 if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob);
1116 }
1117
1118 pl->contr->queue_stats_update ();
1119
1099 if (glow_radius && pl->is_on_map ()) 1120 if (expect_false (glow_radius) && pl->is_on_map ())
1100 update_all_los (pl->map, pl->x, pl->y); 1121 update_all_los (pl->map, pl->x, pl->y);
1101 } 1122 }
1102 } 1123 }
1103 else if (map) 1124 else if (map)
1104 { 1125 {
1105 map->dirty = true; 1126 map->dirty = true;
1106 mapspace &ms = this->ms (); 1127 mapspace &ms = this->ms ();
1226 1247
1227 object *prev = this; 1248 object *prev = this;
1228 1249
1229 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) 1250 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1230 { 1251 {
1231 object *op = arch_to_object (at); 1252 object *op = at->instance ();
1232 1253
1233 op->name = name; 1254 op->name = name;
1234 op->name_pl = name_pl; 1255 op->name_pl = name_pl;
1235 op->title = title; 1256 op->title = title;
1236 1257
1274 * Passing 0 for flag gives proper default values, so flag really only needs 1295 * Passing 0 for flag gives proper default values, so flag really only needs
1275 * to be set if special handling is needed. 1296 * to be set if special handling is needed.
1276 * 1297 *
1277 * Return value: 1298 * Return value:
1278 * new object if 'op' was merged with other object 1299 * new object if 'op' was merged with other object
1279 * NULL if 'op' was destroyed 1300 * NULL if there was an error (destroyed, blocked etc.)
1280 * just 'op' otherwise 1301 * just 'op' otherwise
1281 */ 1302 */
1282object * 1303object *
1283insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1304insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1284{ 1305{
1511 1532
1512 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1533 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1513 if (tmp->arch->archname == archname) /* same archetype */ 1534 if (tmp->arch->archname == archname) /* same archetype */
1514 tmp->destroy (); 1535 tmp->destroy ();
1515 1536
1516 object *tmp = arch_to_object (archetype::find (archname)); 1537 object *tmp = archetype::find (archname)->instance ();
1517 1538
1518 tmp->x = op->x; 1539 tmp->x = op->x;
1519 tmp->y = op->y; 1540 tmp->y = op->y;
1520 1541
1521 insert_ob_in_map (tmp, op->map, op, 0); 1542 insert_ob_in_map (tmp, op->map, op, 0);
1526{ 1547{
1527 if (where->env) 1548 if (where->env)
1528 return where->env->insert (this); 1549 return where->env->insert (this);
1529 else 1550 else
1530 return where->map->insert (this, where->x, where->y, originator, flags); 1551 return where->map->insert (this, where->x, where->y, originator, flags);
1552}
1553
1554// check whether we can put this into the map, respect max_volume, max_items
1555bool
1556object::can_drop_at (maptile *m, int x, int y, object *originator)
1557{
1558 mapspace &ms = m->at (x, y);
1559
1560 int items = ms.items ();
1561
1562 if (!items // testing !items ensures we can drop at least one item
1563 || (items < m->max_items
1564 && ms.volume () < m->max_volume))
1565 return true;
1566
1567 if (originator && originator->is_player ())
1568 originator->contr->failmsg (format (
1569 "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>",
1570 query_name ()
1571 ));
1572
1573 return false;
1531} 1574}
1532 1575
1533/* 1576/*
1534 * decrease(object, number) decreases a specified number from 1577 * decrease(object, number) decreases a specified number from
1535 * the amount of an object. If the amount reaches 0, the object 1578 * the amount of an object. If the amount reaches 0, the object
1675 if (op->glow_radius && is_on_map ()) 1718 if (op->glow_radius && is_on_map ())
1676 { 1719 {
1677 update_stats (); 1720 update_stats ();
1678 update_all_los (map, x, y); 1721 update_all_los (map, x, y);
1679 } 1722 }
1680 else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) 1723 else if (is_player ())
1681 // if this is a player's inventory, update stats 1724 // if this is a player's inventory, update stats
1682 update_stats (); 1725 contr->queue_stats_update ();
1683 1726
1684 INVOKE_OBJECT (INSERT, this); 1727 INVOKE_OBJECT (INSERT, this);
1685 1728
1686 return op; 1729 return op;
1687} 1730}
2455{ 2498{
2456 return map ? map->region (x, y) 2499 return map ? map->region (x, y)
2457 : region::default_region (); 2500 : region::default_region ();
2458} 2501}
2459 2502
2460const materialtype_t *
2461object::dominant_material () const
2462{
2463 if (materialtype_t *mt = name_to_material (materialname))
2464 return mt;
2465
2466 return name_to_material (shstr_unknown);
2467}
2468
2469void 2503void
2470object::open_container (object *new_container) 2504object::open_container (object *new_container)
2471{ 2505{
2472 if (container == new_container) 2506 if (container == new_container)
2473 return; 2507 return;
2507 // TODO: this does not seem to serve any purpose anymore? 2541 // TODO: this does not seem to serve any purpose anymore?
2508#if 0 2542#if 0
2509 // insert the "Close Container" object. 2543 // insert the "Close Container" object.
2510 if (archetype *closer = new_container->other_arch) 2544 if (archetype *closer = new_container->other_arch)
2511 { 2545 {
2512 object *closer = arch_to_object (new_container->other_arch); 2546 object *closer = new_container->other_arch->instance ();
2513 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2547 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2514 new_container->insert (closer); 2548 new_container->insert (closer);
2515 } 2549 }
2516#endif 2550#endif
2517 2551
2623 2657
2624 insert (force); 2658 insert (force);
2625 } 2659 }
2626} 2660}
2627 2661
2662void object::change_move_type (MoveType mt)
2663{
2664 if (move_type == mt)
2665 return;
2666
2667 if (is_on_map ())
2668 {
2669 // we are on the map, so handle move_on/off effects
2670 remove ();
2671 move_type = mt;
2672 map->insert (this, x, y, this);
2673 }
2674 else
2675 move_type = mt;
2676}
2677

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines