1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2002-2005 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002-2005,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program 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 2 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
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, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail at crossfire@schmorp.de |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* |
24 | /* |
26 | * The maptile is allocated each time a new map is opened. |
25 | * The maptile is allocated each time a new map is opened. |
27 | * It contains pointers (very indirectly) to all objects on the map. |
26 | * It contains pointers (very indirectly) to all objects on the map. |
… | |
… | |
30 | #ifndef MAP_H |
29 | #ifndef MAP_H |
31 | #define MAP_H |
30 | #define MAP_H |
32 | |
31 | |
33 | #include <tr1/unordered_map> |
32 | #include <tr1/unordered_map> |
34 | |
33 | |
|
|
34 | #include "region.h" |
35 | #include "cfperl.h" |
35 | #include "cfperl.h" |
36 | |
36 | |
37 | /* 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 |
38 | * tiled maps. There is no requirement that this matches the |
38 | * tiled maps. There is no requirement that this matches the |
39 | * tiled maps size - it just seemed like a reasonable value. |
39 | * tiled maps size - it just seemed like a reasonable value. |
… | |
… | |
47 | #define MAGIC_MAP_SIZE 50 |
47 | #define MAGIC_MAP_SIZE 50 |
48 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
48 | #define MAGIC_MAP_HALF MAGIC_MAP_SIZE/2 |
49 | |
49 | |
50 | #define MAP_LAYERS 3 |
50 | #define MAP_LAYERS 3 |
51 | |
51 | |
52 | /* options passed to ready_map_name and load_original_map */ |
52 | /* Values for in_memory below */ |
53 | #define MAP_FLUSH 0x01 |
|
|
54 | #define MAP_PLAYER_UNIQUE 0x02 |
|
|
55 | #define MAP_BLOCK 0x04 |
|
|
56 | #define MAP_STYLE 0x08 |
|
|
57 | #define MAP_OVERLAY 0x10 |
|
|
58 | |
|
|
59 | /* Values for in_memory below. Should probably be an enumerations */ |
|
|
60 | enum { |
53 | enum { |
61 | MAP_IN_MEMORY, |
54 | MAP_ACTIVE, |
|
|
55 | MAP_INACTIVE, // not used atm. |
62 | MAP_SWAPPED, |
56 | MAP_SWAPPED, |
63 | MAP_LOADING, |
57 | MAP_LOADING, |
64 | MAP_SAVING, |
58 | MAP_SAVING, |
65 | }; |
59 | }; |
66 | |
60 | |
… | |
… | |
72 | // all those macros are herewith declared legacy |
66 | // all those macros are herewith declared legacy |
73 | #define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () |
67 | #define GET_MAP_FLAGS(M,X,Y) (M)->at((X),(Y)).flags () |
74 | #define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light |
68 | #define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light |
75 | #define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot |
69 | #define GET_MAP_OB(M,X,Y) (M)->at((X),(Y)).bot |
76 | #define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top |
70 | #define GET_MAP_TOP(M,X,Y) (M)->at((X),(Y)).top |
77 | #define GET_MAP_FACE(M,X,Y,L) (M)->at((X),(Y)).faces[L] |
|
|
78 | #define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] |
71 | #define GET_MAP_FACE_OBJ(M,X,Y,L) (M)->at((X),(Y)).faces_obj[L] |
79 | #define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block |
72 | #define GET_MAP_MOVE_BLOCK(M,X,Y) (M)->at((X),(Y)).move_block |
80 | #define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow |
73 | #define GET_MAP_MOVE_SLOW(M,X,Y) (M)->at((X),(Y)).move_slow |
81 | #define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on |
74 | #define GET_MAP_MOVE_ON(M,X,Y) (M)->at((X),(Y)).move_on |
82 | #define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off |
75 | #define GET_MAP_MOVE_OFF(M,X,Y) (M)->at((X),(Y)).move_off |
… | |
… | |
111 | */ |
104 | */ |
112 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
105 | #define P_OUT_OF_MAP 0x10000 /* This space is outside the map */ |
113 | #define P_NEW_MAP 0x20000 |
106 | #define P_NEW_MAP 0x20000 |
114 | /* Coordinates passed result in a new tiled map */ |
107 | /* Coordinates passed result in a new tiled map */ |
115 | |
108 | |
116 | /* P_NO_PASS is used for ob_blocked() return value. It needs |
|
|
117 | * to be here to make sure the bits don't match with anything. |
|
|
118 | */ |
|
|
119 | #define P_NO_PASS 0x80000 |
|
|
120 | |
|
|
121 | /* Instead of having numerous arrays that have information on a |
109 | /* Instead of having numerous arrays that have information on a |
122 | * particular space (was map, floor, floor2, map_ob), |
110 | * particular space (was map, floor, floor2, map_ob), |
123 | * have this structure take care of that information. |
111 | * have this structure take care of that information. |
124 | * This puts it all in one place, and should also make it easier |
112 | * This puts it all in one place, and should also make it easier |
125 | * to extend information about a space. |
113 | * to extend information about a space. |
126 | */ |
114 | */ |
127 | struct mapspace |
115 | struct mapspace |
128 | { |
116 | { |
129 | object *bot, *top; /* lowest/highest object on this space */ |
117 | object *bot, *top; /* lowest/highest object on this space */ |
130 | facetile *faces[MAP_LAYERS]; /* faces for the 3 layers */ |
|
|
131 | object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ |
118 | object *faces_obj[MAP_LAYERS];/* face objects for the 3 layers */ |
132 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
119 | uint8 flags_; /* flags about this space (see the P_ values above) */ |
133 | sint8 light; /* How much light this space provides */ |
120 | sint8 light; /* How much light this space provides */ |
134 | MoveType move_block; /* What movement types this space blocks */ |
121 | MoveType move_block; /* What movement types this space blocks */ |
135 | MoveType move_slow; /* What movement types this space slows */ |
122 | MoveType move_slow; /* What movement types this space slows */ |
… | |
… | |
160 | if (op->type == PLAYER) |
147 | if (op->type == PLAYER) |
161 | return op; |
148 | return op; |
162 | |
149 | |
163 | return 0; |
150 | return 0; |
164 | } |
151 | } |
165 | }; |
|
|
166 | |
152 | |
167 | /* |
153 | // return the item volume on this mapspace in cm³ |
168 | * Each map is in a given region of the game world and links to a region definiton, so |
154 | uint64 volume () const; |
169 | * they have to appear here in the headers, before the mapdef |
155 | |
170 | */ |
156 | bool blocks (MoveType mt) const |
171 | INTERFACE_CLASS (region) |
157 | { |
172 | struct region : zero_initialised |
158 | return move_block && (mt & move_block) == mt; |
173 | { |
159 | } |
174 | struct region *ACC (RW, next); /* pointer to next region, NULL for the last one */ |
|
|
175 | char *ACC (RW, name); /* Shortend name of the region as maps refer to it */ |
|
|
176 | char *ACC (RW, parent_name); /* |
|
|
177 | * So that parent and child regions can be defined in |
|
|
178 | * any order, we keep hold of the parent_name during |
|
|
179 | * initialisation, and the children get assigned to their |
|
|
180 | * parents later. (before runtime on the server though) |
|
|
181 | * nothing outside the init code should ever use this value. |
|
|
182 | */ |
|
|
183 | struct region *ACC (RW, parent); /* |
|
|
184 | * Pointer to the region that is a parent of the current |
|
|
185 | * region, if a value isn't defined in the current region |
|
|
186 | * we traverse this series of pointers until it is. |
|
|
187 | */ |
|
|
188 | char *ACC (RW, longname); /* Official title of the region, this might be defined |
|
|
189 | * to be the same as name*/ |
|
|
190 | char *ACC (RW, msg); /* the description of the region */ |
|
|
191 | uint32 ACC (RW, counter); /* A generic counter for holding temporary data. */ |
|
|
192 | sint8 ACC (RW, fallback); /* whether, in the event of a region not existing, |
|
|
193 | * this should be the one we fall back on as the default */ |
|
|
194 | char *ACC (RW, jailmap); /*where a player that is arrested in this region should be imprisoned. */ |
|
|
195 | sint16 ACC (RW, jailx), ACC (RW, jaily); /* The coodinates in jailmap to which the player should be sent. */ |
|
|
196 | }; |
160 | }; |
197 | |
161 | |
198 | struct shopitems : zero_initialised |
162 | struct shopitems : zero_initialised |
199 | { |
163 | { |
200 | const char *name; /* name of the item in question, null if it is the default item */ |
164 | const char *name; /* name of the item in question, null if it is the default item */ |
… | |
… | |
223 | INTERFACE_CLASS (maptile) |
187 | INTERFACE_CLASS (maptile) |
224 | struct maptile : zero_initialised, attachable |
188 | struct maptile : zero_initialised, attachable |
225 | { |
189 | { |
226 | sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ |
190 | sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */ |
227 | struct mapspace *spaces; /* Array of spaces on this map */ |
191 | struct mapspace *spaces; /* Array of spaces on this map */ |
|
|
192 | uint8 *regions; /* region index per mapspace, if != 0 */ |
|
|
193 | region_ptr *regionmap; /* index to region */ |
228 | |
194 | |
229 | tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ |
195 | tstamp ACC (RW, last_access); /* last time this map was accessed somehow */ |
230 | |
196 | |
231 | shstr ACC (RW, name); /* Name of map as given by its creator */ |
197 | shstr ACC (RW, name); /* Name of map as given by its creator */ |
232 | struct region *ACC (RW, region); /* What jurisdiction in the game world this map is ruled by |
198 | region_ptr ACC (RW, default_region); /* What jurisdiction in the game world this map is ruled by |
233 | * points to the struct containing all the properties of |
199 | * points to the struct containing all the properties of |
234 | * the region */ |
200 | * the region */ |
235 | double ACC (RW, reset_time); |
201 | double ACC (RW, reset_time); |
236 | uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map |
202 | uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map |
237 | * should be reset |
203 | * should be reset |
238 | */ |
204 | */ |
239 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
205 | bool ACC (RW, dirty); /* if true, something was inserted or removed */ |
|
|
206 | bool ACC (RW, no_reset); // must not reset this map |
240 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
207 | bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by |
241 | * players entering/exiting map |
208 | * players entering/exiting map |
242 | */ |
209 | */ |
243 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
210 | sint32 ACC (RW, timeout); /* swapout is set to this */ |
244 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
211 | sint32 ACC (RW, swap_time); /* When it reaches 0, the map will be swapped out */ |
… | |
… | |
249 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
216 | uint16 ACC (RW, difficulty); /* What level the player should be to play here */ |
250 | |
217 | |
251 | bool ACC (RW, per_player); |
218 | bool ACC (RW, per_player); |
252 | bool ACC (RW, per_party); |
219 | bool ACC (RW, per_party); |
253 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
220 | bool ACC (RW, outdoor); /* True if an outdoor map */ |
|
|
221 | bool ACC (RW, nodrop); /* avoid dropping anything on this map */ |
254 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
222 | uint8 ACC (RW, darkness); /* indicates level of darkness of map */ |
255 | |
223 | |
256 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
224 | uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */ |
257 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
225 | uint16 ACC (RW, enter_y); /* on the map if none are set in the exit */ |
258 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
226 | oblinkpt *buttons; /* Linked list of linked lists of buttons */ |
… | |
… | |
271 | shstr ACC (RW, msg); /* Message map creator may have left */ |
239 | shstr ACC (RW, msg); /* Message map creator may have left */ |
272 | shstr ACC (RW, maplore); /* Map lore information */ |
240 | shstr ACC (RW, maplore); /* Map lore information */ |
273 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
241 | shstr ACC (RW, tile_path[4]); /* path to adjoining maps */ |
274 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
242 | maptile *ACC (RW, tile_map[4]); /* Next map, linked list */ |
275 | shstr ACC (RW, path); /* Filename of the map */ |
243 | shstr ACC (RW, path); /* Filename of the map */ |
|
|
244 | int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace |
|
|
245 | uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace |
276 | |
246 | |
277 | MTH void activate (); |
247 | MTH void activate (); |
278 | MTH void deactivate (); |
248 | MTH void deactivate (); |
279 | |
249 | |
280 | // allocates all (empty) mapspace |
250 | // allocates all (empty) mapspace |
281 | MTH void alloc (); |
251 | MTH void alloc (); |
282 | // deallocates the mapspaces (and destroys all objects) |
252 | // deallocates the mapspaces (and destroys all objects) |
283 | MTH void clear (); |
253 | MTH void clear (); |
284 | |
254 | |
285 | MTH void fix_auto_apply (); |
255 | MTH void fix_auto_apply (); |
286 | MTH void decay_objects (); |
256 | MTH void do_decay_objects (); |
287 | MTH void update_buttons (); |
257 | MTH void update_buttons (); |
288 | MTH int change_map_light (int change); |
258 | MTH int change_map_light (int change); |
289 | static void change_all_map_light (int change); //PERL |
259 | static void change_all_map_light (int change); //PERL |
290 | MTH void set_darkness_map (); |
260 | MTH void set_darkness_map (); |
291 | MTH int estimate_difficulty () const; |
261 | MTH int estimate_difficulty () const; |
292 | |
262 | |
|
|
263 | MTH void play_sound (faceidx sound, int x, int y) const; |
|
|
264 | |
293 | // set the given flag on all objects in the map |
265 | // set the given flag on all objects in the map |
294 | MTH void set_object_flag (int flag, int value = 1); |
266 | MTH void set_object_flag (int flag, int value = 1); |
295 | |
267 | |
296 | MTH void link_multipart_objects (); |
268 | MTH void link_multipart_objects (); |
297 | MTH void clear_unique_items (); |
269 | MTH void clear_unique_items (); |
298 | |
270 | |
299 | MTH void clear_header (); |
271 | MTH void clear_header (); |
300 | MTH void clear_links_to (maptile *m); |
272 | MTH void clear_links_to (maptile *m); |
301 | |
273 | |
|
|
274 | MTH struct region *region (int x, int y) const; |
|
|
275 | |
302 | // loas the header pseudo-object |
276 | // load the header pseudo-object |
303 | bool _load_header (object_thawer &thawer); |
277 | bool _load_header (object_thawer &thawer); |
304 | MTH bool _load_header (const char *path); |
278 | MTH bool _load_header (object_thawer *thawer) { return _load_header (*thawer); } |
305 | |
279 | |
306 | // load objects into the map |
280 | // load objects into the map |
307 | bool _load_objects (object_thawer &thawer); |
281 | bool _load_objects (object_thawer &thawer); |
308 | MTH bool _load_objects (const char *path, bool skip_header = true); |
282 | MTH bool _load_objects (object_thawer *thawer) { return _load_objects (*thawer); } |
309 | |
283 | |
310 | // save objects into the given file (uses IO_ flags) |
284 | // save objects into the given file (uses IO_ flags) |
311 | bool _save_objects (object_freezer &freezer, int flags); |
285 | bool _save_objects (object_freezer &freezer, int flags); |
312 | MTH bool _save_objects (const char *path, int flags); |
286 | MTH bool _save_objects (const char *path, int flags); |
313 | |
287 | |
… | |
… | |
325 | MTH int size () const { return width * height; } |
299 | MTH int size () const { return width * height; } |
326 | |
300 | |
327 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
301 | MTH object *insert (object *op, int x, int y, object *originator = 0, int flags = 0); |
328 | |
302 | |
329 | MTH void touch () { last_access = runtime; } |
303 | MTH void touch () { last_access = runtime; } |
|
|
304 | |
|
|
305 | MTH bool tile_available (int dir, bool load = true); |
330 | |
306 | |
331 | // find the map that is at coordinate x|y relative to this map |
307 | // find the map that is at coordinate x|y relative to this map |
332 | // TODO: need a better way than passing by reference |
308 | // TODO: need a better way than passing by reference |
333 | // TODO: make perl interface |
309 | // TODO: make perl interface |
334 | maptile *xy_find (sint16 &x, sint16 &y); |
310 | maptile *xy_find (sint16 &x, sint16 &y); |
… | |
… | |
346 | } |
322 | } |
347 | |
323 | |
348 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
324 | void make_map_floor (char **layout, char *floorstyle, random_map_params *RP); |
349 | bool generate_random_map (random_map_params *RP); |
325 | bool generate_random_map (random_map_params *RP); |
350 | |
326 | |
|
|
327 | static maptile *find_async (const char *path, maptile *original = 0, bool load = true);//PERL |
351 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
328 | static maptile *find_sync (const char *path, maptile *original = 0);//PERL |
352 | // async prefetch |
329 | static maptile *find_style_sync (const char *dir, const char *file = 0);//PERL |
353 | static maptile *find_async (const char *path, maptile *original = 0);//PERL |
330 | MTH object *pick_random_object () const; |
354 | |
331 | |
355 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
332 | mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; } |
356 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
333 | mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; } |
357 | }; |
334 | }; |
358 | |
335 | |
… | |
… | |
372 | int distance_y; |
349 | int distance_y; |
373 | int direction; |
350 | int direction; |
374 | object *part; |
351 | object *part; |
375 | }; |
352 | }; |
376 | |
353 | |
|
|
354 | // comaptibility cruft start |
377 | //TODO: these should be refactored into things like xy_normalise |
355 | //TODO: these should be refactored into things like xy_normalise |
378 | // and so on. |
356 | // and so on. |
379 | int get_map_flags(maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
357 | int get_map_flags (maptile *oldmap, maptile **newmap, sint16 x, sint16 y, sint16 *nx, sint16 *ny); |
380 | int ob_blocked(const object *ob, maptile *m, sint16 x, sint16 y); |
|
|
381 | int out_of_map(maptile *m, int x, int y); |
358 | int out_of_map (maptile *m, int x, int y); |
382 | maptile *get_map_from_coord(maptile *m, sint16 *x, sint16 *y); |
359 | maptile *get_map_from_coord (maptile *m, sint16 *x, sint16 *y); |
383 | void get_rangevector(object *op1, object *op2, rv_vector *retval, int flags); |
360 | void get_rangevector (object *op1, object *op2, rv_vector *retval, int flags); |
384 | void get_rangevector_from_mapcoord(const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
361 | void get_rangevector_from_mapcoord (const maptile *m, int x, int y, const object *op2, rv_vector *retval, int flags); |
385 | int on_same_map(const object *op1, const object *op2); |
362 | int on_same_map (const object *op1, const object *op2); |
|
|
363 | int adjacent_map (const maptile *map1, const maptile *map2, int *dx, int *dy); |
386 | |
364 | |
387 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
365 | // adjust map, x and y for tiled maps and return true if the position is valid at all |
388 | inline bool |
366 | static inline bool |
389 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
367 | xy_normalise (maptile *&map, sint16 &x, sint16 &y) |
390 | { |
368 | { |
391 | // when in range, do a quick return, otherwise go the slow route |
369 | // when in range, do a quick return, otherwise go the slow route |
392 | return |
370 | return |
393 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
371 | (IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height)) |
394 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
372 | || !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP); |
395 | } |
373 | } |
|
|
374 | // comaptibility cruft end |
396 | |
375 | |
397 | inline mapspace & |
376 | inline mapspace & |
398 | object::ms () const |
377 | object::ms () const |
399 | { |
378 | { |
400 | return map->at (x, y); |
379 | return map->at (x, y); |
401 | } |
380 | } |
402 | |
381 | |
|
|
382 | struct mapxy { |
|
|
383 | maptile *m; |
|
|
384 | sint16 x, y; |
|
|
385 | |
|
|
386 | mapxy (maptile *m, sint16 x, sint16 y) |
|
|
387 | : m(m), x(x), y(y) |
|
|
388 | { } |
|
|
389 | |
|
|
390 | mapxy (object *op) |
|
|
391 | : m(op->map), x(op->x), y(op->y) |
|
|
392 | { } |
|
|
393 | |
|
|
394 | mapxy &move (int dx, int dy) |
|
|
395 | { |
|
|
396 | x += dx; |
|
|
397 | y += dy; |
|
|
398 | |
|
|
399 | return *this; |
|
|
400 | } |
|
|
401 | |
|
|
402 | mapxy &move (int dir) |
|
|
403 | { |
|
|
404 | return move (freearr_x [dir], freearr_y [dir]); |
|
|
405 | } |
|
|
406 | |
|
|
407 | operator void *() const { return (void *)m; } |
|
|
408 | mapxy &operator =(const object *op) |
|
|
409 | { |
|
|
410 | m = op->map; |
|
|
411 | x = op->x; |
|
|
412 | y = op->y; |
|
|
413 | |
|
|
414 | return *this; |
|
|
415 | } |
|
|
416 | |
|
|
417 | mapspace *operator ->() const { return &m->at (x, y); } |
|
|
418 | mapspace &operator * () const { return m->at (x, y); } |
|
|
419 | |
|
|
420 | bool normalise () |
|
|
421 | { |
|
|
422 | return xy_normalise (m, x, y); |
|
|
423 | } |
|
|
424 | |
|
|
425 | object *insert (object *op, object *originator = 0, int flags = 0) const |
|
|
426 | { |
|
|
427 | m->insert (op, x, y, originator, flags); |
|
|
428 | } |
|
|
429 | }; |
|
|
430 | |
|
|
431 | inline const mapxy & |
|
|
432 | object::operator =(const mapxy &pos) |
|
|
433 | { |
|
|
434 | map = pos.m; |
|
|
435 | x = pos.x; |
|
|
436 | y = pos.y; |
|
|
437 | |
|
|
438 | return pos; |
|
|
439 | } |
|
|
440 | |
403 | #endif |
441 | #endif |
404 | |
442 | |