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

Comparing deliantra/server/common/map.C (file contents):
Revision 1.129 by root, Wed Sep 12 11:10:09 2007 UTC vs.
Revision 1.136 by root, Mon Apr 21 23:35:24 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-2003,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001-2003,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#include <unistd.h> 24#include <unistd.h>
25 25
26#include "global.h" 26#include "global.h"
27#include "funcpoint.h"
28 27
29#include "loader.h" 28#include "loader.h"
30 29
31#include "path.h" 30#include "path.h"
32 31
… …
245 244
246 insert_ob_in_ob (tmp, container); 245 insert_ob_in_ob (tmp, container);
247 tmp = next; 246 tmp = next;
248 } 247 }
249 248
250 /* sum_weight will go through and calculate what all the containers are 249 // go through and calculate what all the containers are carrying.
251 * carrying. 250 //TODO: remove
252 */ 251 container->update_weight ();
253 sum_weight (container);
254} 252}
255 253
256void 254void
257maptile::set_object_flag (int flag, int value) 255maptile::set_object_flag (int flag, int value)
258{ 256{
… …
307bool 305bool
308maptile::_load_objects (object_thawer &f) 306maptile::_load_objects (object_thawer &f)
309{ 307{
310 for (;;) 308 for (;;)
311 { 309 {
312 coroapi::cede_to_tick_every (100); // cede once in a while 310 coroapi::cede_to_tick (); // cede once in a while
313 311
314 switch (f.kw) 312 switch (f.kw)
315 { 313 {
316 case KW_arch: 314 case KW_arch:
317 if (object *op = object::read (f, this)) 315 if (object *op = object::read (f, this))
318 { 316 {
317 // TODO: why?
319 if (op->inv) 318 if (op->inv)
320 sum_weight (op); 319 op->update_weight ();
321 320
322 insert_ob_in_map (op, this, op, INS_NO_MERGE | INS_NO_WALK_ON | INS_ON_TOP | INS_MAP_LOAD); 321 if (IN_RANGE_EXC (op->x, 0, width) && IN_RANGE_EXC (op->y, 0, height))
322 {
323 // we insert manually because
324 // a) its way faster
325 // b) we remove manually, too, and there are good reasons for that
326 // c) its correct
327 mapspace &ms = at (op->x, op->y);
328
329 op->flag [FLAG_REMOVED] = false;
330
331 op->above = 0;
332 op->below = ms.top;
333
334 if (ms.top)
335 ms.top->above = op;
336 else
337 ms.bot = op;
338
339 ms.top = op;
340 ms.flags_ = 0;
341 }
342 else
343 {
344 f.parse_warn (format ("object %s out of range", op->debug_desc ()));
345 op->destroy ();
346 }
323 } 347 }
324 348
325 continue; 349 continue;
326 350
327 case KW_EOF: 351 case KW_EOF:
… …
1196maptile::tile_available (int dir, bool load) 1220maptile::tile_available (int dir, bool load)
1197{ 1221{
1198 if (!tile_path[dir]) 1222 if (!tile_path[dir])
1199 return 0; 1223 return 0;
1200 1224
1201 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_IN_MEMORY)) 1225 if (tile_map[dir] && (!load || tile_map[dir]->in_memory == MAP_ACTIVE))
1202 return 1; 1226 return 1;
1203 1227
1204 if ((tile_map[dir] = find_async (tile_path[dir], this, load))) 1228 if ((tile_map[dir] = find_async (tile_path[dir], this, load)))
1205 return 1; 1229 return 1;
1206 1230
… …
1595{ 1619{
1596 if (!sound) 1620 if (!sound)
1597 return; 1621 return;
1598 1622
1599 for_all_players (pl) 1623 for_all_players (pl)
1600 if (pl->observe->map == this) 1624 if (pl->ob->map == this)
1601 if (client *ns = pl->ns) 1625 if (client *ns = pl->ns)
1602 { 1626 {
1603 int dx = x - pl->observe->x; 1627 int dx = x - pl->ob->x;
1604 int dy = y - pl->observe->y; 1628 int dy = y - pl->ob->y;
1605 1629
1606 int distance = idistance (dx, dy); 1630 int distance = idistance (dx, dy);
1607 1631
1608 if (distance <= MAX_SOUND_DISTANCE) 1632 if (distance <= MAX_SOUND_DISTANCE)
1609 ns->play_sound (sound, dx, dy); 1633 ns->play_sound (sound, dx, dy);

Diff Legend

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