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

Comparing deliantra/server/include/map.h (file contents):
Revision 1.33 by root, Mon Dec 25 14:43:23 2006 UTC vs.
Revision 1.87 by root, Tue Sep 4 05:43:21 2007 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
4 Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT is free software: you can redistribute it and/or modify
8 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
9 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version. 11 * (at your option) any later version.
11 12 *
12 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,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 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
18 along with this program; if not, write to the Free Software 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 *
20
21 The authors can be reached via e-mail at crossfire@schmorp.de 21 * The authors can be reached via e-mail to <crossfire@schmorp.de>
22*/ 22 */
23 23
24/* 24/*
25 * The maptile is allocated each time a new map is opened. 25 * The maptile is allocated each time a new map is opened.
26 * It contains pointers (very indirectly) to all objects on the map. 26 * It contains pointers (very indirectly) to all objects on the map.
27 */ 27 */
28 28
29#ifndef MAP_H 29#ifndef MAP_H
30#define MAP_H 30#define MAP_H
31 31
32#include <tr1/unordered_map>
33
34#include "region.h"
32#include "cfperl.h" 35#include "cfperl.h"
33 36
34/* We set this size - this is to make magic map work properly on 37/* We set this size - this is to make magic map work properly on
35 * tiled maps. There is no requirement that this matches the 38 * tiled maps. There is no requirement that this matches the
36 * tiled maps size - it just seemed like a reasonable value. 39 * tiled maps size - it just seemed like a reasonable value.
37 * Magic map code now always starts out putting the player in the 40 * Magic map code now always starts out putting the player in the
38 * center of the map - this makes the most sense when dealing 41 * center of the map - this makes the most sense when dealing
39 * with tiled maps. 42 * with tiled maps.
40 * We also figure out the magicmap color to use as we process the 43 * We also figure out the magicmap color to use as we process the
44#define MAGIC_MAP_SIZE 50 47#define MAGIC_MAP_SIZE 50
45#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 48#define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2
46 49
47#define MAP_LAYERS 3 50#define MAP_LAYERS 3
48 51
49/* This is when the map will reset */
50#define MAP_WHEN_RESET(m) ((m)->reset_time)
51
52#define MAP_RESET_TIMEOUT(m) ((m)->reset_timeout)
53#define MAP_DIFFICULTY(m) ((m)->difficulty)
54#define MAP_TIMEOUT(m) ((m)->timeout)
55#define MAP_SWAP_TIME(m) ((m)->swap_time)
56#define MAP_OUTDOORS(m) ((m)->outdoor)
57
58/* mape darkness used to enforce the MAX_DARKNESS value.
59 * but IMO, if it is beyond max value, that should be fixed
60 * on the map or in the code.
61 */
62#define MAP_DARKNESS(m) (m)->darkness
63
64/* Convenient function - total number of spaces is used
65 * in many places.
66 */
67#define MAP_SIZE(m) ((m)->width * (m)->height)
68
69#define MAP_ENTER_X(m) (m)->enter_x
70#define MAP_ENTER_Y(m) (m)->enter_y
71
72#define MAP_TEMP(m) (m)->temp
73#define MAP_PRESSURE(m) (m)->pressure
74#define MAP_HUMID(m) (m)->humid
75#define MAP_WINDSPEED(m) (m)->windspeed
76#define MAP_WINDDIRECTION(m) (m)->winddir
77#define MAP_SKYCOND(m) (m)->sky
78#define MAP_WORLDPARTX(m) (m)->wpartx
79#define MAP_WORLDPARTY(m) (m)->wparty
80#define MAP_NOSMOOTH(m) (m)->nosmooth
81
82/* options passed to ready_map_name and load_original_map */
83#define MAP_FLUSH 0x1
84#define MAP_PLAYER_UNIQUE 0x2
85#define MAP_BLOCK 0x4
86#define MAP_STYLE 0x8
87#define MAP_OVERLAY 0x10
88
89/* Values for in_memory below. Should probably be an enumerations */ 52/* Values for in_memory below. Should probably be an enumerations */
90#define MAP_IN_MEMORY 1 53enum {
91#define MAP_SWAPPED 2 54 MAP_IN_MEMORY,
92#define MAP_LOADING 3 55 MAP_SWAPPED,
93#define MAP_SAVING 4 56 MAP_LOADING,
57 MAP_SAVING,
58};
94 59
95/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should 60/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should
96 * really be used, as it is multi tile aware. However, there are some cases 61 * really be used, as it is multi tile aware. However, there are some cases
97 * where it is known the map is not tiled or the values are known 62 * where it is known the map is not tiled or the values are known
98 * consistent (eg, op->map, op->x, op->y) 63 * consistent (eg, op->map, op->x, op->y)
99 */ 64 */
100// all those macros are herewith declared legacy 65// all those macros are herewith declared legacy
101#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () 66#define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags ()
102#define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light 67#define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light
103#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bottom 68#define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot
104#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top 69#define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top
105#define GET_MAP_FACE(M,X,Y,L) (M)->at((X),(Y)).faces[L]
106#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] 70#define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L]
107#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block 71#define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block
108#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow 72#define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow
109#define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on 73#define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on
110#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off 74#define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off
111 75
112/* You should really know what you are doing before using this - you 76/* You should really know what you are doing before using this - you
113 * should almost always be using out_of_map instead, which takes into account 77 * should almost always be using out_of_map instead, which takes into account
114 * map tiling. 78 * map tiling.
115 */ 79 */
116#define OUT_OF_REAL_MAP(M,X,Y) ((X)<0 || (Y)<0 || (X)>=(M)->width || (Y)>=(M)->height) 80#define OUT_OF_REAL_MAP(M,X,Y) (!(IN_RANGE_EXC ((X), 0, (M)->width) && IN_RANGE_EXC ((Y), 0, (M)->height)))
117 81
118/* These are used in the MapLook flags element. They are not used in 82/* These are used in the MapLook flags element. They are not used in
119 * in the object flags structure. 83 * in the object flags structure.
120 */ 84 */
121#define P_BLOCKSVIEW 0x01 85#define P_BLOCKSVIEW 0x01
127 * this was introduced to make shops safer 91 * this was introduced to make shops safer
128 * but is useful in other situations */ 92 * but is useful in other situations */
129#define P_IS_ALIVE 0x10 /* something alive is on this space */ 93#define P_IS_ALIVE 0x10 /* something alive is on this space */
130#define P_NO_CLERIC 0x20 /* no clerical spells cast here */ 94#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
131 95
132#define P_NEED_UPDATE 0x80 /* this space is out of date */ 96#define P_UPTODATE 0x80 /* this space is up to date */
133 97
134/* The following two values are not stored in the MapLook flags, but instead 98/* The following two values are not stored in the MapLook flags, but instead
135 * used in the get_map_flags value - that function is used to return 99 * used in the get_map_flags value - that function is used to return
136 * the flag value, as well as other conditions - using a more general 100 * the flag value, as well as other conditions - using a more general
137 * function that does more of the work can hopefully be used to replace 101 * function that does more of the work can hopefully be used to replace
152 * This puts it all in one place, and should also make it easier 116 * This puts it all in one place, and should also make it easier
153 * to extend information about a space. 117 * to extend information about a space.
154 */ 118 */
155struct mapspace 119struct mapspace
156{ 120{
157 object *bottom; /* lowest object on this space */ 121 object *bot, *top; /* lowest/highest object on this space */
158 object *top; /* Highest object on this space */
159 New_Face *faces[MAP_LAYERS]; /* faces for the 3 layers */
160 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ 122 object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */
161 uint8 flags_; /* flags about this space (see the P_ values above) */ 123 uint8 flags_; /* flags about this space (see the P_ values above) */
162 sint8 light; /* How much light this space provides */ 124 sint8 light; /* How much light this space provides */
163 MoveType move_block; /* What movement types this space blocks */ 125 MoveType move_block; /* What movement types this space blocks */
164 MoveType move_slow; /* What movement types this space slows */ 126 MoveType move_slow; /* What movement types this space slows */
166 MoveType move_off; /* What movement types are activated */ 128 MoveType move_off; /* What movement types are activated */
167 129
168 void update_ (); 130 void update_ ();
169 void update () 131 void update ()
170 { 132 {
171 if (flags_ & P_NEED_UPDATE) 133 if (!(flags_ & P_UPTODATE))
172 update_ (); 134 update_ ();
173 } 135 }
174 136
175 uint8 flags () 137 uint8 flags ()
176 { 138 {
189 if (op->type == PLAYER) 151 if (op->type == PLAYER)
190 return op; 152 return op;
191 153
192 return 0; 154 return 0;
193 } 155 }
194};
195 156
196/* 157 // return the item volume on this mapspace in cm³
197 * this is an overlay structure of the whole world. It exists as a simple 158 uint64 volume () const;
198 * high level map, which doesn't contain the full data of the underlying map.
199 * in this map, only things such as weather are recorded. By doing so, we
200 * can keep the entire world parameters in memory, and act as a whole on
201 * them at once. We can then, in a separate loop, update the actual world
202 * with the new values we have assigned.
203 */
204
205struct weathermap_t
206{
207 sint16 temp; /* base temperature of this tile (F) */
208 sint16 pressure; /* barometric pressure (mb) */
209 sint8 humid; /* humitidy of this tile */
210 sint8 windspeed; /* windspeed of this tile */
211 sint8 winddir; /* direction of wind */
212 sint8 sky; /* sky conditions */
213 sint32 avgelev; /* average elevation */
214 uint32 rainfall; /* cumulative rainfall */
215 uint8 darkness; /* indicates level of darkness of map */
216 uint8 water; /* 0-100 percentage of water tiles */
217 /*Dynamic parts */
218 sint16 realtemp; /* temperature at a given calculation step for this tile */
219};
220
221/*
222 * Each map is in a given region of the game world and links to a region definiton, so
223 * they have to appear here in the headers, before the mapdef
224 */
225struct region : zero_initialised
226{
227 struct region *next; /* pointer to next region, NULL for the last one */
228 const char *name; /* Shortend name of the region as maps refer to it */
229 const char *parent_name; /*
230 * So that parent and child regions can be defined in
231 * any order, we keep hold of the parent_name during
232 * initialisation, and the children get assigned to their
233 * parents later. (before runtime on the server though)
234 * nothing outside the init code should ever use this value.
235 */
236 struct region *parent; /*
237 * Pointer to the region that is a parent of the current
238 * region, if a value isn't defined in the current region
239 * we traverse this series of pointers until it is.
240 */
241 const char *longname; /* Official title of the region, this might be defined
242 * to be the same as name*/
243 const char *msg; /* the description of the region */
244 uint32 counter; /* A generic counter for holding temporary data. */
245 sint8 fallback; /* whether, in the event of a region not existing,
246 * this should be the one we fall back on as the default */
247 char *jailmap; /*where a player that is arrested in this region should be imprisoned. */
248 sint16 jailx, jaily; /* The coodinates in jailmap to which the player should be sent. */
249}; 159};
250 160
251struct shopitems : zero_initialised 161struct shopitems : zero_initialised
252{ 162{
253 const char *name; /* name of the item in question, null if it is the default item */ 163 const char *name; /* name of the item in question, null if it is the default item */
254 const char *name_pl; /* plural name */ 164 const char *name_pl; /* plural name */
255 int typenum; /* itemtype number we need to match 0 if it is the default price */ 165 int typenum; /* itemtype number we need to match 0 if it is the default price */
256 sint8 strength; /* the degree of specialisation the shop has in this item, 166 sint8 strength; /* the degree of specialisation the shop has in this item,
257 * as a percentage from -100 to 100 */ 167 * as a percentage from -100 to 100 */
258 int index; /* being the size of the shopitems array. */ 168 int index; /* being the size of the shopitems array. */
169};
170
171// map I/O, what to load/save
172enum {
173 IO_HEADER = 0x01, // the "arch map" pseudo object
174 IO_OBJECTS = 0x02, // the non-unique objects
175 IO_UNIQUES = 0x04, // unique objects
259}; 176};
260 177
261/* In general, code should always use the macros 178/* In general, code should always use the macros
262 * above (or functions in map.c) to access many of the 179 * above (or functions in map.c) to access many of the
263 * values in the map structure. Failure to do this will 180 * values in the map structure. Failure to do this will
267 * break map tiling. 184 * break map tiling.
268 */ 185 */
269INTERFACE_CLASS (maptile) 186INTERFACE_CLASS (maptile)
270struct maptile : zero_initialised, attachable 187struct maptile : zero_initialised, attachable
271{ 188{
272 sint32 ACC (RO, width), ACC (RO, height); /* Width and height of map. */ 189 sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
273 struct mapspace *spaces; /* Array of spaces on this map */ 190 struct mapspace *spaces; /* Array of spaces on this map */
191 uint8 *regions; /* region index per mapspace, if != 0 */
192 region_ptr *regionmap; /* index to region */
274 193
275 maptile *ACC (RW, next); /* Next map, linked list */ 194 tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
276 char *ACC (RO, tmpname); /* Name of temporary file */ 195
277 char *ACC (RO, name); /* Name of map as given by its creator */ 196 shstr ACC (RW, name); /* Name of map as given by its creator */
278 struct region *ACC (RW, region); /* What jurisdiction in the game world this map is ruled by 197 region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by
279 * points to the struct containing all the properties of 198 * points to the struct containing all the properties of
280 * the region */ 199 * the region */
281 uint32 ACC (RW, reset_time); /* when this map should reset */ 200 double ACC (RW, reset_time);
282 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map 201 uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
283 * should be reset 202 * should be reset
284 */ 203 */
204 bool ACC (RW, dirty); /* if true, something was inserted or removed */
205 bool ACC (RW, no_reset); // must not reset this map
285 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by 206 bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
286 * players entering/exiting map 207 * players entering/exiting map
287 */ 208 */
288 bool ACC (RW, unique); /* if set, this is a per player unique map */
289 bool ACC (RW, templatemap); /* if set, this is a template map */
290 bool ACC (RW, nosmooth); /* if set the content of this map has smoothlevel=0 forced */
291 sint32 ACC (RW, timeout); /* swapout is set to this */ 209 sint32 ACC (RW, timeout); /* swapout is set to this */
292 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ 210 sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */
293 uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must 211 uint32 ACC (RW, in_memory); /* If not true, the map has been freed and must
294 * be loaded before used. The map,omap and map_ob 212 * be loaded before used. The map,omap and map_ob
295 * arrays will be allocated when the map is loaded */ 213 * arrays will be allocated when the map is loaded */
296 sint16 ACC (RW, players); /* How many players are on this level right now */ 214 sint16 players; /* How many players are on this map right now */
297 uint16 ACC (RW, difficulty); /* What level the player should be to play here */ 215 uint16 ACC (RW, difficulty); /* What level the player should be to play here */
298 216
217 bool ACC (RW, per_player);
218 bool ACC (RW, per_party);
219 bool ACC (RW, outdoor); /* True if an outdoor map */
220 bool ACC (RW, nodrop); /* avoid dropping anything on this map */
299 uint8 ACC (RW, darkness); /* indicates level of darkness of map */ 221 uint8 ACC (RW, darkness); /* indicates level of darkness of map */
222
300 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ 223 uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */
301 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ 224 uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */
302 bool ACC (RW, outdoor); /* True if an outdoor map */
303 oblinkpt *buttons; /* Linked list of linked lists of buttons */ 225 oblinkpt *buttons; /* Linked list of linked lists of buttons */
304 sint16 ACC (RW, temp); /* base temperature of this tile (F) */ 226 sint16 ACC (RW, temp); /* base temperature of this tile (F) */
305 sint16 ACC (RW, pressure); /* barometric pressure (mb) */ 227 sint16 ACC (RW, pressure); /* barometric pressure (mb) */
306 sint8 ACC (RW, humid); /* humitidy of this tile */ 228 sint8 ACC (RW, humid); /* humitidy of this tile */
307 sint8 ACC (RW, windspeed); /* windspeed of this tile */ 229 sint8 ACC (RW, windspeed); /* windspeed of this tile */
308 sint8 ACC (RW, winddir); /* direction of wind */ 230 sint8 ACC (RW, winddir); /* direction of wind */
309 sint8 ACC (RW, sky); /* sky conditions */ 231 sint8 ACC (RW, sky); /* sky conditions */
310 int ACC (RW, wpartx), ACC (RW, wparty); /*Highly fasten conversion between worldmap and weathermap */ 232 int ACC (RW, worldpartx), ACC (RW, worldparty); /*Highly fasten conversion between worldmap and weathermap */
311 struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */ 233 struct shopitems *shopitems; /* a semi-colon seperated list of item-types the map's shop will trade in */
312 char *ACC (RO, shoprace); /* the preffered race of the local shopkeeper */ 234 shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
313 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */ 235 double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
314 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */ 236 sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
315 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */ 237 sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
316 char *ACC (RO, msg); /* Message map creator may have left */ 238 shstr ACC (RW, msg); /* Message map creator may have left */
317 char *ACC (RO, maplore); /* Map lore information */ 239 shstr ACC (RW, maplore); /* Map lore information */
318 char *tile_path[4]; /* path to adjoining maps */ 240 shstr ACC (RW, tile_path[4]); /* path to adjoining maps */
319 maptile *tile_map[4]; /* Next map, linked list */ 241 maptile *ACC (RW, tile_map[4]); /* Next map, linked list */
320 char ACC (RW, path)[HUGE_BUF]; /* Filename of the map */ 242 shstr ACC (RW, path); /* Filename of the map */
243 int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
244 uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
245
246 MTH void activate ();
247 MTH void deactivate ();
248
249 // allocates all (empty) mapspace
250 MTH void alloc ();
251 // deallocates the mapspaces (and destroys all objects)
252 MTH void clear ();
253
254 MTH void fix_auto_apply ();
255 MTH void do_decay_objects ();
256 MTH void update_buttons ();
257 MTH int change_map_light (int change);
258 static void change_all_map_light (int change); //PERL
259 MTH void set_darkness_map ();
260 MTH int estimate_difficulty () const;
261
262 MTH void play_sound (faceidx sound, int x, int y) const;
263
264 // set the given flag on all objects in the map
265 MTH void set_object_flag (int flag, int value = 1);
266
267 MTH void link_multipart_objects ();
268 MTH void clear_unique_items ();
269
270 MTH void clear_header ();
271 MTH void clear_links_to (maptile *m);
272
273 MTH struct region *region (int x, int y) const;
274
275 // load the header pseudo-object
276 bool _load_header (object_thawer &thawer);
277 MTH bool _load_header (object_thawer *thawer) { return _load_header (*thawer); }
278
279 // load objects into the map
280 bool _load_objects (object_thawer &thawer);
281 MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); }
282
283 // save objects into the given file (uses IO_ flags)
284 bool _save_objects (object_freezer &freezer, int flags);
285 MTH bool _save_objects (const char *path, int flags);
286
287 // save the header pseudo object _only_
288 bool _save_header (object_freezer &freezer);
289 MTH bool _save_header (const char *path);
321 290
322 maptile (); 291 maptile ();
292 maptile (int w, int h);
323 ~maptile (); 293 ~maptile ();
294
324 void do_destroy (); 295 void do_destroy ();
325 void gather_callbacks (AV *&callbacks, event_type event) const; 296 void gather_callbacks (AV *&callbacks, event_type event) const;
326 297
327 void allocate (); 298 MTH int size () const { return width * height; }
328 299
300 MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0);
301
302 MTH void touch () { last_access = runtime; }
303
304 MTH bool tile_available (int dir, bool load = true);
305
306 // find the map that is at coordinate x|y relative to this map
307 // TODO: need a better way than passing by reference
308 // TODO: make perl interface
309 maptile *xy_find (sint16 &x, sint16 &y);
310
311 // like xy_find, but also loads the map
312 maptile *xy_load (sint16 &x, sint16 &y);
313
314 void do_load_sync ();//PERL
315
316 // make sure the map is loaded
317 MTH void load_sync ()
318 {
319 if (!spaces)
320 do_load_sync ();
321 }
322
323 void make_map_floor (char **layout, char *floorstyle, random_map_params *RP);
324 bool generate_random_map (random_map_params *RP);
325
326 static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL
327 static maptile *find_sync (const char *path, maptile *original = 0);//PERL
328 static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL
329 MTH object *pick_random_object () const;
330
329 mapspace const &at (uint32 x, uint32 y) const { return spaces [x + width * y]; } 331 mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
330 mapspace &at (uint32 x, uint32 y) { return spaces [x + width * y]; } 332 mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
331}; 333};
332 334
333/* This is used by get_rangevector to determine where the other 335/* This is used by get_rangevector to determine where the other
334 * creature is. get_rangevector takes into account map tiling, 336 * creature is. get_rangevector takes into account map tiling,
335 * so you just can not look the the map coordinates and get the 337 * so you just can not look the the map coordinates and get the
346 int distance_y; 348 int distance_y;
347 int direction; 349 int direction;
348 object *part; 350 object *part;
349}; 351};
350 352
353//TODO: these should be refactored into things like xy_normalise
354// and so on.
355int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny);
356int ob_blocked (const object *ob, maptile *m, sint16 x, sint16 y);
357int out_of_map (maptile *m, int x, int y);
358maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y);
359void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags);
360void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags);
361int on_same_map (const object *op1, const object *op2);
362int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy);
363
364// adjust map, x and y for tiled maps and return true if the position is valid at all
365inline bool
366xy_normalise (maptile *&map, sint16 &x, sint16 &y)
367{
368 // when in range, do a quick return, otherwise go the slow route
369 return
370 (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
371 || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
372}
373
351inline mapspace & 374inline mapspace &
352object::ms () const 375object::ms () const
353{ 376{
354 return map->at (x, y); 377 return map->at (x, y);
355} 378}
356 379
380// not used anywhere *yet*
381struct mapxy {
382 maptile *m;
383 sint16 x, y;
384
385 mapxy (maptile *m, sint16 x, sint16 y)
386 : m(m), x(x), y(y)
387 { }
388
389 mapxy (object *op)
390 : m(op->map), x(op->x), y(op->y)
391 { }
392
393 mapxy &move (int dir)
394 {
395 x += freearr_x [dir];
396 y += freearr_y [dir];
397
398 return *this;
399 }
400
401 operator void *() const { return (void *)m; }
402 mapxy &operator =(const object *op)
403 {
404 m = op->map;
405 x = op->x;
406 y = op->y;
407
408 return *this;
409 }
410
411 mapspace *operator ->() const { return &m->at (x, y); }
412 mapspace *operator * () const { return &m->at (x, y); }
413
414 bool normalise ()
415 {
416 return xy_normalise (m, x, y);
417 }
418
419 object *insert (object *op, object *originator = 0, int flags = 0) const
420 {
421 m->insert (op, x, y, originator, flags);
422 }
423};
424
425inline const mapxy &
426object::operator =(const mapxy &pos)
427{
428 map = pos.m;
429 x = pos.x;
430 y = pos.y;
431
432 return pos;
433}
434
357#endif 435#endif
358 436

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines