| … | |
… | |
| 254 | /* This is really a spellbook check - really, we should |
254 | /* This is really a spellbook check - really, we should |
| 255 | * check all objects in the inventory. |
255 | * check all objects in the inventory. |
| 256 | */ |
256 | */ |
| 257 | if (ob1->inv || ob2->inv) |
257 | if (ob1->inv || ob2->inv) |
| 258 | { |
258 | { |
| 259 | /* if one object has inventory but the other doesn't, not equiv */ |
259 | if (!(ob1->inv && ob2->inv)) |
| 260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
260 | return 0; /* inventories differ in length */ |
| 261 | return 0; |
|
|
| 262 | |
261 | |
| 263 | /* Now check to see if the two inventory objects could merge */ |
262 | if (ob1->inv->below || ob2->inv->below) |
|
|
263 | return 0; /* more than one object in inv */ |
|
|
264 | |
| 264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
265 | if (!object::can_merge (ob1->inv, ob2->inv)) |
| 265 | return 0; |
266 | return 0; /* inventory objexts differ */ |
| 266 | |
267 | |
| 267 | /* inventory ok - still need to check rest of this object to see |
268 | /* inventory ok - still need to check rest of this object to see |
| 268 | * if it is valid. |
269 | * if it is valid. |
| 269 | */ |
270 | */ |
| 270 | } |
271 | } |
| … | |
… | |
| 305 | { |
306 | { |
| 306 | ob1->optimise (); |
307 | ob1->optimise (); |
| 307 | ob2->optimise (); |
308 | ob2->optimise (); |
| 308 | |
309 | |
| 309 | if (ob1->self || ob2->self) |
310 | if (ob1->self || ob2->self) |
| 310 | if (!cfperl_can_merge (ob1, ob2)) |
311 | { |
|
|
312 | int k1 = ob1->self ? HvTOTALKEYS (SvRV (ob1->self)) : 0; |
|
|
313 | int k2 = ob2->self ? HvTOTALKEYS (SvRV (ob2->self)) : 0; |
|
|
314 | |
|
|
315 | if (k1 != k2) |
| 311 | return 0; |
316 | return 0; |
|
|
317 | else if (k1 == 0) |
|
|
318 | return 1; |
|
|
319 | else if (!cfperl_can_merge (ob1, ob2)) |
|
|
320 | return 0; |
|
|
321 | } |
| 312 | } |
322 | } |
| 313 | |
323 | |
| 314 | /* Everything passes, must be OK. */ |
324 | /* Everything passes, must be OK. */ |
| 315 | return 1; |
325 | return 1; |
| 316 | } |
326 | } |
| … | |
… | |
| 1290 | else |
1300 | else |
| 1291 | { |
1301 | { |
| 1292 | top = ms.bot; |
1302 | top = ms.bot; |
| 1293 | |
1303 | |
| 1294 | /* If there are other objects, then */ |
1304 | /* If there are other objects, then */ |
| 1295 | if ((!(flag & INS_MAP_LOAD)) && top) |
1305 | if (top) |
| 1296 | { |
1306 | { |
| 1297 | object *last = 0; |
1307 | object *last = 0; |
| 1298 | |
1308 | |
| 1299 | /* |
1309 | /* |
| 1300 | * If there are multiple objects on this space, we do some trickier handling. |
1310 | * If there are multiple objects on this space, we do some trickier handling. |
| … | |
… | |
| 1352 | */ |
1362 | */ |
| 1353 | if (last && last->below && last != floor) |
1363 | if (last && last->below && last != floor) |
| 1354 | top = last->below; |
1364 | top = last->below; |
| 1355 | } |
1365 | } |
| 1356 | } /* If objects on this space */ |
1366 | } /* If objects on this space */ |
| 1357 | if (flag & INS_MAP_LOAD) |
|
|
| 1358 | top = ms.top; |
|
|
| 1359 | |
1367 | |
| 1360 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1368 | if (flag & INS_ABOVE_FLOOR_ONLY) |
| 1361 | top = floor; |
1369 | top = floor; |
| 1362 | |
1370 | |
| 1363 | /* Top is the object that our object (op) is going to get inserted above. |
1371 | /* Top is the object that our object (op) is going to get inserted above. |
| … | |
… | |
| 1396 | op->map->touch (); |
1404 | op->map->touch (); |
| 1397 | } |
1405 | } |
| 1398 | |
1406 | |
| 1399 | op->map->dirty = true; |
1407 | op->map->dirty = true; |
| 1400 | |
1408 | |
| 1401 | if (!(flag & INS_MAP_LOAD)) |
|
|
| 1402 | if (object *pl = ms.player ()) |
1409 | if (object *pl = ms.player ()) |
| 1403 | pl->contr->ns->floorbox_update (); |
1410 | pl->contr->ns->floorbox_update (); |
| 1404 | |
1411 | |
| 1405 | /* If this object glows, it may affect lighting conditions that are |
1412 | /* If this object glows, it may affect lighting conditions that are |
| 1406 | * visible to others on this map. But update_all_los is really |
1413 | * visible to others on this map. But update_all_los is really |
| 1407 | * an inefficient way to do this, as it means los for all players |
1414 | * an inefficient way to do this, as it means los for all players |
| 1408 | * on the map will get recalculated. The players could very well |
1415 | * on the map will get recalculated. The players could very well |
| … | |
… | |
| 1991 | * customized, changed states, etc. |
1998 | * customized, changed states, etc. |
| 1992 | */ |
1999 | */ |
| 1993 | int |
2000 | int |
| 1994 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2001 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
| 1995 | { |
2002 | { |
|
|
2003 | int altern[SIZEOFFREE]; |
| 1996 | int index = 0, flag; |
2004 | int index = 0, flag; |
| 1997 | int altern[SIZEOFFREE]; |
|
|
| 1998 | |
2005 | |
| 1999 | for (int i = start; i < stop; i++) |
2006 | for (int i = start; i < stop; i++) |
| 2000 | { |
2007 | { |
| 2001 | mapxy pos (m, x, y); pos.move (i); |
2008 | mapxy pos (m, x, y); pos.move (i); |
| 2002 | |
2009 | |
| … | |
… | |
| 2011 | /* However, often |
2018 | /* However, often |
| 2012 | * ob doesn't have any move type (when used to place exits) |
2019 | * ob doesn't have any move type (when used to place exits) |
| 2013 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
2020 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
| 2014 | */ |
2021 | */ |
| 2015 | if (ob->move_type == 0 && ms.move_block != MOVE_ALL) |
2022 | if (ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
2023 | { |
|
|
2024 | altern [index++] = i; |
| 2016 | continue; |
2025 | continue; |
|
|
2026 | } |
| 2017 | |
2027 | |
| 2018 | /* Basically, if we find a wall on a space, we cut down the search size. |
2028 | /* Basically, if we find a wall on a space, we cut down the search size. |
| 2019 | * In this way, we won't return spaces that are on another side of a wall. |
2029 | * In this way, we won't return spaces that are on another side of a wall. |
| 2020 | * This mostly work, but it cuts down the search size in all directions - |
2030 | * This mostly work, but it cuts down the search size in all directions - |
| 2021 | * if the space being examined only has a wall to the north and empty |
2031 | * if the space being examined only has a wall to the north and empty |
