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.83 by root, Thu Feb 1 19:15:38 2007 UTC vs.
Revision 1.86 by root, Thu Feb 15 15:43:36 2007 UTC

… …
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
23 */ 23 */
24 24
25#include <global.h>
26#include <funcpoint.h>
27
28#include <loader.h>
29#include <unistd.h> 25#include <unistd.h>
26
27#include "global.h"
28#include "funcpoint.h"
29
30#include "loader.h"
30 31
31#include "path.h" 32#include "path.h"
32 33
33/* 34/*
34 * This makes a path absolute outside the world of Crossfire. 35 * This makes a path absolute outside the world of Crossfire.
… …
67 char *endbuf; 68 char *endbuf;
68 struct stat statbuf; 69 struct stat statbuf;
69 int mode = 0; 70 int mode = 0;
70 71
71 if (prepend_dir) 72 if (prepend_dir)
72 strcpy (buf, create_pathname (name)); 73 assign (buf, create_pathname (name));
73 else 74 else
74 strcpy (buf, name); 75 assign (buf, name);
75 76
76 /* old method (strchr(buf, '\0')) seemd very odd to me - 77 /* old method (strchr(buf, '\0')) seemd very odd to me -
77 * this method should be equivalant and is clearer. 78 * this method should be equivalant and is clearer.
78 * Can not use strcat because we need to cycle through 79 * Can not use strcat because we need to cycle through
79 * all the names. 80 * all the names.
… …
568maptile::maptile () 569maptile::maptile ()
569{ 570{
570 in_memory = MAP_SWAPPED; 571 in_memory = MAP_SWAPPED;
571 572
572 /* The maps used to pick up default x and y values from the 573 /* The maps used to pick up default x and y values from the
573 * map archetype. Mimic that behaviour. 574 * map archetype. Mimic that behaviour.
574 */ 575 */
575 width = 16; 576 width = 16;
576 height = 16; 577 height = 16;
577 reset_timeout = 0;
578 timeout = 300; 578 timeout = 300;
579 enter_x = 0; 579 max_nrof = 1000; // 1000 items of anything
580 enter_y = 0; 580 max_volume = 2000000; // 2m³
581} 581}
582 582
583maptile::maptile (int w, int h) 583maptile::maptile (int w, int h)
584{ 584{
585 in_memory = MAP_SWAPPED; 585 in_memory = MAP_SWAPPED;
… …
1276 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0; 1276 faces [0] = top; faces_obj [0] = top != blank_face ? top_obj : 0;
1277 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0; 1277 faces [1] = middle; faces_obj [1] = middle != blank_face ? middle_obj : 0;
1278 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0; 1278 faces [2] = floor; faces_obj [2] = floor != blank_face ? floor_obj : 0;
1279} 1279}
1280 1280
1281uint64
1282mapspace::volume () const
1283{
1284 uint64 vol = 0;
1285
1286 for (object *op = top; op && !op->flag [FLAG_NO_PICK]; op = op->below)
1287 vol += op->volume ();
1288
1289 return vol;
1290}
1291
1281/* this updates the orig_map->tile_map[tile_num] value after finding 1292/* this updates the orig_map->tile_map[tile_num] value after finding
1282 * the map. It also takes care of linking back the freshly found 1293 * the map. It also takes care of linking back the freshly found
1283 * maps tile_map values if it tiles back to this one. It returns 1294 * maps tile_map values if it tiles back to this one. It returns
1284 * the value of orig_map->tile_map[tile_num]. 1295 * the value of orig_map->tile_map[tile_num].
1285 */ 1296 */
… …
1570get_rangevector (object *op1, object *op2, rv_vector * retval, int flags) 1581get_rangevector (object *op1, object *op2, rv_vector * retval, int flags)
1571{ 1582{
1572 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y)) 1583 if (!adjacent_map (op1->map, op2->map, &retval->distance_x, &retval->distance_y))
1573 { 1584 {
1574 /* be conservative and fill in _some_ data */ 1585 /* be conservative and fill in _some_ data */
1575 retval->distance = 100000; 1586 retval->distance = 10000;
1576 retval->distance_x = 32767; 1587 retval->distance_x = 10000;
1577 retval->distance_y = 32767; 1588 retval->distance_y = 10000;
1578 retval->direction = 0; 1589 retval->direction = 0;
1579 retval->part = 0; 1590 retval->part = 0;
1580 } 1591 }
1581 else 1592 else
1582 { 1593 {
… …
1587 1598
1588 best = op1; 1599 best = op1;
1589 /* If this is multipart, find the closest part now */ 1600 /* If this is multipart, find the closest part now */
1590 if (!(flags & 0x1) && op1->more) 1601 if (!(flags & 0x1) && op1->more)
1591 { 1602 {
1592 object *tmp;
1593 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi; 1603 int best_distance = retval->distance_x * retval->distance_x + retval->distance_y * retval->distance_y, tmpi;
1594 1604
1595 /* we just take the offset of the piece to head to figure 1605 /* we just take the offset of the piece to head to figure
1596 * distance instead of doing all that work above again 1606 * distance instead of doing all that work above again
1597 * since the distance fields we set above are positive in the 1607 * since the distance fields we set above are positive in the
1598 * same axis as is used for multipart objects, the simply arithmetic 1608 * same axis as is used for multipart objects, the simply arithmetic
1599 * below works. 1609 * below works.
1600 */ 1610 */
1601 for (tmp = op1->more; tmp != NULL; tmp = tmp->more) 1611 for (object *tmp = op1->more; tmp; tmp = tmp->more)
1602 { 1612 {
1603 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) + 1613 tmpi = (op1->x - tmp->x + retval->distance_x) * (op1->x - tmp->x + retval->distance_x) +
1604 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y); 1614 (op1->y - tmp->y + retval->distance_y) * (op1->y - tmp->y + retval->distance_y);
1605 if (tmpi < best_distance) 1615 if (tmpi < best_distance)
1606 { 1616 {
… …
1615 retval->distance_y += op1->y - best->y; 1625 retval->distance_y += op1->y - best->y;
1616 } 1626 }
1617 } 1627 }
1618 1628
1619 retval->part = best; 1629 retval->part = best;
1620 retval->distance = idistance (retval->distance_x, retval->distance_y); 1630 retval->distance = upos_max (abs (retval->distance_x), abs (retval->distance_y));
1621 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y); 1631 retval->direction = find_dir_2 (-retval->distance_x, -retval->distance_y);
1622 } 1632 }
1623} 1633}
1624 1634
1625/* this is basically the same as get_rangevector above, but instead of 1635/* this is basically the same as get_rangevector above, but instead of
… …
1693 return default_region; 1703 return default_region;
1694 1704
1695 return ::region::default_region (); 1705 return ::region::default_region ();
1696} 1706}
1697 1707
1708

Diff Legend

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