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.272 by root, Sat Dec 27 04:09:58 2008 UTC vs.
Revision 1.289 by root, Sun Oct 11 05:31:54 2009 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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team 4 * Copyright (©) 2005,2006,2007,2008,2009 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 * Deliantra 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
328 // the player inventory itself is always visible 328 // the player inventory itself is always visible
329 if (env->is_player ()) 329 if (env->is_player ())
330 return env; 330 return env;
331 331
332 // else a player could have our env open 332 // else a player could have our env open
333 object *envest = env->outer_env (); 333 object *envest = env->outer_env_or_self ();
334 334
335 // the player itself is always on a map, so we will find him here 335 // the player itself is always on a map, so we will find him here
336 // even if our inv is in a player. 336 // even if our inv is in a player.
337 if (envest->is_on_map ()) 337 if (envest->is_on_map ())
338 if (object *pl = envest->ms ().player ()) 338 if (object *pl = envest->ms ().player ())
431 object_freezer freezer; 431 object_freezer freezer;
432 op->write (freezer); 432 op->write (freezer);
433 return freezer.as_string (); 433 return freezer.as_string ();
434} 434}
435 435
436char *
437object::as_string ()
438{
439 return dump_object (this);
440}
441
436/* 442/*
437 * get_nearest_part(multi-object, object 2) returns the part of the 443 * get_nearest_part(multi-object, object 2) returns the part of the
438 * multi-object 1 which is closest to the second object. 444 * multi-object 1 which is closest to the second object.
439 * If it's not a multi-object, it is returned. 445 * If it's not a multi-object, it is returned.
440 */ 446 */
555 update_stats (); 561 update_stats ();
556 562
557 new_draw_info_format (NDI_UNIQUE, 0, this, 563 new_draw_info_format (NDI_UNIQUE, 0, this,
558 "You try to balance all your items at once, " 564 "You try to balance all your items at once, "
559 "but the %s is just too much for your body. " 565 "but the %s is just too much for your body. "
560 "[You need to unapply some items first.]", &ob->name); 566 "[You need to unapply some items first - use the 'body' command to see "
567 "how many items you cna wera on a specific body part.]", &ob->name);
561 return false; 568 return false;
562 } 569 }
563 570
564 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); 571 //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name);
565 } 572 }
792 799
793object::object () 800object::object ()
794{ 801{
795 SET_FLAG (this, FLAG_REMOVED); 802 SET_FLAG (this, FLAG_REMOVED);
796 803
797 expmul = 1.0; 804 //expmul = 1.0; declared const for the time being
798 face = blank_face; 805 face = blank_face;
799} 806}
800 807
801object::~object () 808object::~object ()
802{ 809{
831{ 838{
832 /* If already on active list, don't do anything */ 839 /* If already on active list, don't do anything */
833 if (active) 840 if (active)
834 return; 841 return;
835 842
836 if (has_active_speed () && flag [FLAG_FREED]) LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
837 if (has_active_speed () && flag [FLAG_DEBUG]) LOG (llevError | logBacktrace, "BUG: tried to activate DEBUG object %s\n", debug_desc ());//D temp
838
839 if (has_active_speed ()) 843 if (has_active_speed ())
844 {
845 if (flag [FLAG_FREED])
846 LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D
847
840 actives.insert (this); 848 actives.insert (this);
849 }
841} 850}
842 851
843void 852void
844object::activate_recursive () 853object::activate_recursive ()
845{ 854{
963 972
964void 973void
965object::do_destroy () 974object::do_destroy ()
966{ 975{
967 if (flag [FLAG_IS_LINKED]) 976 if (flag [FLAG_IS_LINKED])
968 remove_button_link (this); 977 remove_link ();
969 978
970 if (flag [FLAG_FRIENDLY]) 979 if (flag [FLAG_FRIENDLY])
971 remove_friendly_object (this); 980 remove_friendly_object (this);
972 981
973 remove (); 982 remove ();
1097 1106
1098 if (object *pl = ms.player ()) 1107 if (object *pl = ms.player ())
1099 { 1108 {
1100 if (is_player ()) 1109 if (is_player ())
1101 { 1110 {
1111 if (!flag [FLAG_WIZPASS])
1102 ms.smell = ++mapspace::smellcount; // remember the smell of the player 1112 ms.smell = ++mapspace::smellcount; // remember the smell of the player
1103 1113
1104 // leaving a spot always closes any open container on the ground 1114 // leaving a spot always closes any open container on the ground
1105 if (container && !container->env) 1115 if (container && !container->env)
1106 // this causes spurious floorbox updates, but it ensures 1116 // this causes spurious floorbox updates, but it ensures
1107 // that the CLOSE event is being sent. 1117 // that the CLOSE event is being sent.
1285 1295
1286 /* Ideally, the caller figures this out. However, it complicates a lot 1296 /* Ideally, the caller figures this out. However, it complicates a lot
1287 * of areas of callers (eg, anything that uses find_free_spot would now 1297 * of areas of callers (eg, anything that uses find_free_spot would now
1288 * need extra work 1298 * need extra work
1289 */ 1299 */
1300 maptile *newmap = m;
1290 if (!xy_normalise (m, op->x, op->y)) 1301 if (!xy_normalise (newmap, op->x, op->y))
1291 { 1302 {
1292 op->head_ ()->destroy ();// remove head_ once all tail object destroyers found 1303 op->head_ ()->destroy ();// remove head_ once all tail object destroyers found
1293 return 0; 1304 return 0;
1294 } 1305 }
1295 1306
1296 if (object *more = op->more) 1307 if (object *more = op->more)
1297 if (!insert_ob_in_map (more, m, originator, flag)) 1308 if (!insert_ob_in_map (more, m, originator, flag))
1298 return 0; 1309 return 0;
1299 1310
1300 CLEAR_FLAG (op, FLAG_REMOVED); 1311 op->flag [FLAG_REMOVED] = false;
1301 1312 op->env = 0;
1302 op->map = m; 1313 op->map = newmap;
1314
1303 mapspace &ms = op->ms (); 1315 mapspace &ms = op->ms ();
1304 1316
1305 /* this has to be done after we translate the coordinates. 1317 /* this has to be done after we translate the coordinates.
1306 */ 1318 */
1307 if (op->nrof && !(flag & INS_NO_MERGE)) 1319 if (op->nrof && !(flag & INS_NO_MERGE))
1328 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); 1340 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1329 abort (); 1341 abort ();
1330 } 1342 }
1331 1343
1332 if (!originator->is_on_map ()) 1344 if (!originator->is_on_map ())
1345 {
1333 LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", 1346 LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map",
1334 op->debug_desc (), originator->debug_desc ()); 1347 op->debug_desc (), originator->debug_desc ());
1348 abort ();
1349 }
1335 1350
1336 op->above = originator; 1351 op->above = originator;
1337 op->below = originator->below; 1352 op->below = originator->below;
1338 originator->below = op; 1353 originator->below = op;
1339 1354
1471 * blocked() and wall() work properly), and these flags are updated by 1486 * blocked() and wall() work properly), and these flags are updated by
1472 * update_object(). 1487 * update_object().
1473 */ 1488 */
1474 1489
1475 /* if this is not the head or flag has been passed, don't check walk on status */ 1490 /* if this is not the head or flag has been passed, don't check walk on status */
1476 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) 1491 if (!(flag & INS_NO_WALK_ON) && op->is_head ())
1477 { 1492 {
1478 if (check_move_on (op, originator)) 1493 if (check_move_on (op, originator))
1479 return 0; 1494 return 0;
1480 1495
1481 /* If we are a multi part object, lets work our way through the check 1496 /* If we are a multi part object, lets work our way through the check
1492/* this function inserts an object in the map, but if it 1507/* this function inserts an object in the map, but if it
1493 * finds an object of its own type, it'll remove that one first. 1508 * finds an object of its own type, it'll remove that one first.
1494 * op is the object to insert it under: supplies x and the map. 1509 * op is the object to insert it under: supplies x and the map.
1495 */ 1510 */
1496void 1511void
1497replace_insert_ob_in_map (const char *arch_string, object *op) 1512replace_insert_ob_in_map (shstr_tmp archname, object *op)
1498{ 1513{
1499 /* first search for itself and remove any old instances */ 1514 /* first search for itself and remove any old instances */
1500 1515
1501 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) 1516 for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above)
1502 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ 1517 if (tmp->arch->archname == archname) /* same archetype */
1503 tmp->destroy (); 1518 tmp->destroy ();
1504 1519
1505 object *tmp = arch_to_object (archetype::find (arch_string)); 1520 object *tmp = arch_to_object (archetype::find (archname));
1506 1521
1507 tmp->x = op->x; 1522 tmp->x = op->x;
1508 tmp->y = op->y; 1523 tmp->y = op->y;
1509 1524
1510 insert_ob_in_map (tmp, op->map, op, 0); 1525 insert_ob_in_map (tmp, op->map, op, 0);
1696 * on top. 1711 * on top.
1697 */ 1712 */
1698int 1713int
1699check_move_on (object *op, object *originator) 1714check_move_on (object *op, object *originator)
1700{ 1715{
1716 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1717 return 0;
1718
1701 object *tmp; 1719 object *tmp;
1702 maptile *m = op->map; 1720 maptile *m = op->map;
1703 int x = op->x, y = op->y; 1721 int x = op->x, y = op->y;
1704 1722
1705 MoveType move_on, move_slow, move_block; 1723 mapspace &ms = m->at (x, y);
1706 1724
1707 if (QUERY_FLAG (op, FLAG_NO_APPLY)) 1725 ms.update ();
1708 return 0;
1709 1726
1710 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); 1727 MoveType move_on = ms.move_on;
1711 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); 1728 MoveType move_slow = ms.move_slow;
1712 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); 1729 MoveType move_block = ms.move_block;
1713 1730
1714 /* if nothing on this space will slow op down or be applied, 1731 /* if nothing on this space will slow op down or be applied,
1715 * no need to do checking below. have to make sure move_type 1732 * no need to do checking below. have to make sure move_type
1716 * is set, as lots of objects don't have it set - we treat that 1733 * is set, as lots of objects don't have it set - we treat that
1717 * as walking. 1734 * as walking.
1728 return 0; 1745 return 0;
1729 1746
1730 /* The objects have to be checked from top to bottom. 1747 /* The objects have to be checked from top to bottom.
1731 * Hence, we first go to the top: 1748 * Hence, we first go to the top:
1732 */ 1749 */
1733 1750 for (object *next, *tmp = ms.top; tmp; tmp = next)
1734 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1735 {
1736 /* Trim the search when we find the first other spell effect
1737 * this helps performance so that if a space has 50 spell objects,
1738 * we don't need to check all of them.
1739 */
1740 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1741 break;
1742 } 1751 {
1752 next = tmp->below;
1743 1753
1744 for (; tmp; tmp = tmp->below)
1745 {
1746 if (tmp == op) 1754 if (tmp == op)
1747 continue; /* Can't apply yourself */ 1755 continue; /* Can't apply yourself */
1748 1756
1749 /* Check to see if one of the movement types should be slowed down. 1757 /* Check to see if one of the movement types should be slowed down.
1750 * Second check makes sure that the movement types not being slowed 1758 * Second check makes sure that the movement types not being slowed
1755 if (!QUERY_FLAG (op, FLAG_WIZPASS)) 1763 if (!QUERY_FLAG (op, FLAG_WIZPASS))
1756 { 1764 {
1757 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1765 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1758 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) 1766 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1759 { 1767 {
1760
1761 float
1762 diff = tmp->move_slow_penalty * fabs (op->speed); 1768 float diff = tmp->move_slow_penalty * fabs (op->speed);
1763 1769
1764 if (op->is_player ()) 1770 if (op->is_player ())
1765 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1771 if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) ||
1766 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) 1772 (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN)))
1767 diff /= 4.0; 1773 diff /= 4.0;
1768 1774
1769 op->speed_left -= diff; 1775 op->speed_left -= diff;
1770 } 1776 }
1771 } 1777 }
2055 * there is capable of. 2061 * there is capable of.
2056 */ 2062 */
2057int 2063int
2058find_dir (maptile *m, int x, int y, object *exclude) 2064find_dir (maptile *m, int x, int y, object *exclude)
2059{ 2065{
2060 int i, max = SIZEOFFREE, mflags; 2066 int max = SIZEOFFREE, mflags;
2061
2062 sint16 nx, ny;
2063 object *tmp;
2064 maptile *mp;
2065
2066 MoveType blocked, move_type; 2067 MoveType move_type;
2067 2068
2068 if (exclude && exclude->head_ () != exclude) 2069 if (exclude && exclude->head_ () != exclude)
2069 { 2070 {
2070 exclude = exclude->head; 2071 exclude = exclude->head;
2071 move_type = exclude->move_type; 2072 move_type = exclude->move_type;
2074 { 2075 {
2075 /* If we don't have anything, presume it can use all movement types. */ 2076 /* If we don't have anything, presume it can use all movement types. */
2076 move_type = MOVE_ALL; 2077 move_type = MOVE_ALL;
2077 } 2078 }
2078 2079
2079 for (i = 1; i < max; i++) 2080 for (int i = 1; i < max; i++)
2080 { 2081 {
2081 mp = m; 2082 mapxy pos (m, x, y);
2082 nx = x + freearr_x[i]; 2083 pos.move (i);
2083 ny = y + freearr_y[i];
2084 2084
2085 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2085 if (!pos.normalise ())
2086
2087 if (mflags & P_OUT_OF_MAP)
2088 max = maxfree[i]; 2086 max = maxfree[i];
2089 else 2087 else
2090 { 2088 {
2091 mapspace &ms = mp->at (nx, ny); 2089 mapspace &ms = *pos;
2092 2090
2093 blocked = ms.move_block;
2094
2095 if ((move_type & blocked) == move_type) 2091 if ((move_type & ms.move_block) == move_type)
2096 max = maxfree[i]; 2092 max = maxfree [i];
2097 else if (mflags & P_IS_ALIVE) 2093 else if (ms.flags () & P_IS_ALIVE)
2098 { 2094 {
2099 for (tmp = ms.bot; tmp; tmp = tmp->above) 2095 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
2100 if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ()) 2096 if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ())
2101 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) 2097 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2102 break;
2103
2104 if (tmp)
2105 return freedir[i]; 2098 return freedir [i];
2106 } 2099 }
2107 } 2100 }
2108 } 2101 }
2109 2102
2110 return 0; 2103 return 0;
2185 * This basically means that if direction is 15, then it could either go 2178 * This basically means that if direction is 15, then it could either go
2186 * direction 4, 14, or 16 to get back to where we are. 2179 * direction 4, 14, or 16 to get back to where we are.
2187 * Moved from spell_util.c to object.c with the other related direction 2180 * Moved from spell_util.c to object.c with the other related direction
2188 * functions. 2181 * functions.
2189 */ 2182 */
2190int reduction_dir[SIZEOFFREE][3] = { 2183const int reduction_dir[SIZEOFFREE][3] = {
2191 {0, 0, 0}, /* 0 */ 2184 {0, 0, 0}, /* 0 */
2192 {0, 0, 0}, /* 1 */ 2185 {0, 0, 0}, /* 1 */
2193 {0, 0, 0}, /* 2 */ 2186 {0, 0, 0}, /* 2 */
2194 {0, 0, 0}, /* 3 */ 2187 {0, 0, 0}, /* 3 */
2195 {0, 0, 0}, /* 4 */ 2188 {0, 0, 0}, /* 4 */
2333 return tmp; 2326 return tmp;
2334 2327
2335 return 0; 2328 return 0;
2336} 2329}
2337 2330
2338const shstr & 2331shstr_tmp
2339object::kv_get (const shstr &key) const 2332object::kv_get (shstr_tmp key) const
2340{ 2333{
2341 for (key_value *kv = key_values; kv; kv = kv->next) 2334 for (key_value *kv = key_values; kv; kv = kv->next)
2342 if (kv->key == key) 2335 if (kv->key == key)
2343 return kv->value; 2336 return kv->value;
2344 2337
2345 return shstr_null; 2338 return shstr ();
2346} 2339}
2347 2340
2348void 2341void
2349object::kv_set (const shstr &key, const shstr &value) 2342object::kv_set (shstr_tmp key, shstr_tmp value)
2350{ 2343{
2351 for (key_value *kv = key_values; kv; kv = kv->next) 2344 for (key_value *kv = key_values; kv; kv = kv->next)
2352 if (kv->key == key) 2345 if (kv->key == key)
2353 { 2346 {
2354 kv->value = value; 2347 kv->value = value;
2363 2356
2364 key_values = kv; 2357 key_values = kv;
2365} 2358}
2366 2359
2367void 2360void
2368object::kv_del (const shstr &key) 2361object::kv_del (shstr_tmp key)
2369{ 2362{
2370 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) 2363 for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next)
2371 if ((*kvp)->key == key) 2364 if ((*kvp)->key == key)
2372 { 2365 {
2373 key_value *kv = *kvp; 2366 key_value *kv = *kvp;
2504 container = 0; 2497 container = 0;
2505 2498
2506 // client needs item update to make it work, client bug requires this to be separate 2499 // client needs item update to make it work, client bug requires this to be separate
2507 esrv_update_item (UPD_FLAGS, this, old_container); 2500 esrv_update_item (UPD_FLAGS, this, old_container);
2508 2501
2509 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); 2502 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ());
2510 play_sound (sound_find ("chest_close")); 2503 play_sound (sound_find ("chest_close"));
2511 } 2504 }
2512 2505
2513 if (new_container) 2506 if (new_container)
2514 { 2507 {
2524 closer->flag [FLAG_NO_MAP_SAVE] = 1; 2517 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2525 new_container->insert (closer); 2518 new_container->insert (closer);
2526 } 2519 }
2527#endif 2520#endif
2528 2521
2529 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); 2522 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ());
2530 2523
2531 // make sure the container is available, client bug requires this to be separate 2524 // make sure the container is available, client bug requires this to be separate
2532 esrv_send_item (this, new_container); 2525 esrv_send_item (this, new_container);
2533 2526
2534 new_container->flag [FLAG_APPLIED] = true; 2527 new_container->flag [FLAG_APPLIED] = true;
2542// else if (!old_container->env && contr && contr->ns) 2535// else if (!old_container->env && contr && contr->ns)
2543// contr->ns->floorbox_reset (); 2536// contr->ns->floorbox_reset ();
2544} 2537}
2545 2538
2546object * 2539object *
2547object::force_find (const shstr name) 2540object::force_find (shstr_tmp name)
2548{ 2541{
2549 /* cycle through his inventory to look for the MARK we want to 2542 /* cycle through his inventory to look for the MARK we want to
2550 * place 2543 * place
2551 */ 2544 */
2552 for (object *tmp = inv; tmp; tmp = tmp->below) 2545 for (object *tmp = inv; tmp; tmp = tmp->below)
2555 2548
2556 return 0; 2549 return 0;
2557} 2550}
2558 2551
2559object * 2552object *
2560object::force_add (const shstr name, int duration) 2553object::force_add (shstr_tmp name, int duration)
2561{ 2554{
2562 if (object *force = force_find (name)) 2555 if (object *force = force_find (name))
2563 force->destroy (); 2556 force->destroy ();
2564 2557
2565 object *force = get_archetype (FORCE_NAME); 2558 object *force = get_archetype (FORCE_NAME);
2574 2567
2575 return insert (force); 2568 return insert (force);
2576} 2569}
2577 2570
2578void 2571void
2579object::play_sound (faceidx sound) 2572object::play_sound (faceidx sound) const
2580{ 2573{
2581 if (!sound) 2574 if (!sound)
2582 return; 2575 return;
2583 2576
2584 if (flag [FLAG_REMOVED]) 2577 if (is_on_map ())
2585 return;
2586
2587 if (env)
2588 {
2589 if (object *pl = in_player ())
2590 pl->contr->play_sound (sound);
2591 }
2592 else
2593 map->play_sound (sound, x, y); 2578 map->play_sound (sound, x, y);
2579 else if (object *pl = in_player ())
2580 pl->contr->play_sound (sound);
2581}
2582
2583void
2584object::say_msg (const char *msg) const
2585{
2586 if (is_on_map ())
2587 map->say_msg (msg, x, y);
2588 else if (object *pl = in_player ())
2589 pl->contr->play_sound (sound);
2594} 2590}
2595 2591
2596void 2592void
2597object::make_noise () 2593object::make_noise ()
2598{ 2594{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines