[ViewVC] Diff of: cvs/deliantra/server/include/map.h

Comparing deliantra/server/include/map.h (file contents):
Revision 1.30 by root, Wed Dec 20 11:36:39 2006 UTC vs.
Revision 1.99 by root, Thu Dec 4 03:48:19 2008 UTC

…		…
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 (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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	* Deliantra 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 to <support@deliantra.net>
21	The authors can be reached via e-mail at 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
42	* map pointers.	45	* map pointers.
43	*/	46	*/
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 4	50	#define MAP_LAYERS 3
48		51
49	/* This is when the map will reset */	52	/* Values for in_memory below */
50	#define MAP_WHEN_RESET(m) ((m)->reset_time)	53	enum {
51		54	MAP_ACTIVE,
52	#define MAP_RESET_TIMEOUT(m) ((m)->reset_timeout)	55	MAP_INACTIVE, // not used atm.
53	#define MAP_DIFFICULTY(m) ((m)->difficulty)	56	MAP_SWAPPED,
54	#define MAP_TIMEOUT(m) ((m)->timeout)	57	MAP_LOADING,
55	#define MAP_SWAP_TIME(m) ((m)->swap_time)	58	MAP_SAVING,
56	#define MAP_OUTDOORS(m) ((m)->outdoor)	59	};
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	#define MAP_WIDTH(m) (m)->width
65	#define MAP_HEIGHT(m) (m)->height
66
67	/* Convenient function - total number of spaces is used
68	* in many places.
69	*/
70	#define MAP_SIZE(m) ((m)->width * (m)->height)
71
72	#define MAP_ENTER_X(m) (m)->enter_x
73	#define MAP_ENTER_Y(m) (m)->enter_y
74
75	#define MAP_TEMP(m) (m)->temp
76	#define MAP_PRESSURE(m) (m)->pressure
77	#define MAP_HUMID(m) (m)->humid
78	#define MAP_WINDSPEED(m) (m)->windspeed
79	#define MAP_WINDDIRECTION(m) (m)->winddir
80	#define MAP_SKYCOND(m) (m)->sky
81	#define MAP_WORLDPARTX(m) (m)->wpartx
82	#define MAP_WORLDPARTY(m) (m)->wparty
83	#define MAP_NOSMOOTH(m) (m)->nosmooth
84
85	/* options passed to ready_map_name and load_original_map */
86	#define MAP_FLUSH 0x1
87	#define MAP_PLAYER_UNIQUE 0x2
88	#define MAP_BLOCK 0x4
89	#define MAP_STYLE 0x8
90	#define MAP_OVERLAY 0x10
91
92	/* Values for in_memory below. Should probably be an enumerations */
93	#define MAP_IN_MEMORY 1
94	#define MAP_SWAPPED 2
95	#define MAP_LOADING 3
96	#define MAP_SAVING 4
97		60
98	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should	61	/* GET_MAP_FLAGS really shouldn't be used very often - get_map_flags should
99	* really be used, as it is multi tile aware. However, there are some cases	62	* really be used, as it is multi tile aware. However, there are some cases
100	* where it is known the map is not tiled or the values are known	63	* where it is known the map is not tiled or the values are known
101	* consistent (eg, op->map, op->x, op->y)	64	* consistent (eg, op->map, op->x, op->y)
102	*/	65	*/
103	// all those macros are herewith declared legacy	66	// all those macros are herewith declared legacy
104	#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 ()
105	#define GET_MAP_LIGHT(M,X,Y) (M)->at((X),(Y)).light
106	#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
107	#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
108	#define GET_MAP_FACE(M,X,Y,L) (M)->at((X),(Y)).faces[L]
109	#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]
110	#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
111	#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
112	#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
113	#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
114		75
115	/* 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
116	* 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
117	* map tiling.	78	* map tiling.
118	*/	79	*/
119	#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)))
120		81
121	/* 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
122	* in the object flags structure.	83	* in the object flags structure.
123	*/	84	*/
124	#define P_BLOCKSVIEW 0x01	85	#define P_BLOCKSVIEW 0x01
…		…
130	* this was introduced to make shops safer	91	* this was introduced to make shops safer
131	* but is useful in other situations */	92	* but is useful in other situations */
132	#define P_IS_ALIVE 0x10 /* something alive is on this space */	93	#define P_IS_ALIVE 0x10 /* something alive is on this space */
133	#define P_NO_CLERIC 0x20 /* no clerical spells cast here */	94	#define P_NO_CLERIC 0x20 /* no clerical spells cast here */
134		95
135	#define P_NEED_UPDATE 0x80 /* this space is out of date */	96	#define P_UPTODATE 0x80 /* this space is up to date */
136		97
137	/* 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
138	* 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
139	* 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
140	* 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
…		…
142	*/	103	*/
143	#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */	104	#define P_OUT_OF_MAP 0x10000 /* This space is outside the map */
144	#define P_NEW_MAP 0x20000	105	#define P_NEW_MAP 0x20000
145	/* Coordinates passed result in a new tiled map */	106	/* Coordinates passed result in a new tiled map */
146		107
147	/* P_NO_PASS is used for ob_blocked() return value. It needs
148	* to be here to make sure the bits don't match with anything.
149	*/
150	#define P_NO_PASS 0x80000
151
152	/* Instead of having numerous arrays that have information on a	108	/* Instead of having numerous arrays that have information on a
153	* particular space (was map, floor, floor2, map_ob),	109	* particular space (was map, floor, floor2, map_ob),
154	* have this structure take care of that information.	110	* have this structure take care of that information.
155	* This puts it all in one place, and should also make it easier	111	* This puts it all in one place, and should also make it easier
156	* to extend information about a space.	112	* to extend information about a space.
157	*/	113	*/
		114	INTERFACE_CLASS (mapspace)
158	struct mapspace	115	struct mapspace
159	{	116	{
160	object bottom; / lowest object on this space */	117	object *ACC (RW, bot);
161	object top; / Highest object on this space */	118	object ACC (RW, top); / lowest/highest object on this space */
162	New_Face faces[MAP_LAYERS]; / faces for the 3 layers */
163	object faces_obj[MAP_LAYERS];/ face objects for the 3 layers */	119	object ACC (RW, faces_obj[MAP_LAYERS]);/ face objects for the 3 layers */
164	uint8 flags_; /* flags about this space (see the P_ values above) */	120	uint8 flags_; /* flags about this space (see the P_ values above) */
165	sint8 light; /* How much light this space provides */	121	sint8 ACC (RW, light); /* How much light this space provides */
166	MoveType move_block; /* What movement types this space blocks */	122	MoveType ACC (RW, move_block); /* What movement types this space blocks */
167	MoveType move_slow; /* What movement types this space slows */	123	MoveType ACC (RW, move_slow); /* What movement types this space slows */
168	MoveType move_on; /* What movement types are activated */	124	MoveType ACC (RW, move_on); /* What movement types are activated */
169	MoveType move_off; /* What movement types are activated */	125	MoveType ACC (RW, move_off); /* What movement types are activated */
170		126
171	void update_ ();	127	void update_ ();
172	void update ()	128	MTH void update ()
173	{	129	{
174	if (flags_ & P_NEED_UPDATE)	130	if (!(flags_ & P_UPTODATE))
175	update_ ();	131	update_ ();
176	}	132	}
177		133
178	uint8 flags ()	134	MTH uint8 flags ()
179	{	135	{
180	update ();	136	update ();
181	return flags_;	137	return flags_;
182	}	138	}
183		139
184	// maybe only inline quick flags_ checking?
185	object *player ()	140	MTH object *player ()
186	{	141	{
		142	object *op;
		143
187	if (flags () & P_PLAYER)	144	if (flags () & P_PLAYER)
188	for (object *op = bottom; op; op = op->above)	145	for (op = top; op->type != PLAYER; op = op->below)
189	if (op->type == PLAYER)	146	;
190	return op;	147	else
		148	op = 0;
191		149
192	return 0;	150	return op;
193	}	151	}
194	};
195		152
196	/*	153	// return the item volume on this mapspace in cm³
197	* this is an overlay structure of the whole world. It exists as a simple	154	MTH 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		155
205	struct weathermap_t	156	bool blocks (MoveType mt) const
206	{	157	{
207	sint16 temp; /* base temperature of this tile (F) */	158	return move_block && (mt & move_block) == mt;
208	sint16 pressure; /* barometric pressure (mb) */	159	}
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		160
221	/*	161	bool blocks (object *op) const
222	* Each map is in a given region of the game world and links to a region definiton, so	162	{
223	* they have to appear here in the headers, before the mapdef	163	return blocks (op->move_type);
224	*/	164	}
225	struct 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	};	165	};
250		166
251	struct shopitems : zero_initialised	167	struct shopitems : zero_initialised
252	{	168	{
253	const char name; / name of the item in question, null if it is the default item */	169	const char name; / name of the item in question, null if it is the default item */
254	const char name_pl; / plural name */	170	const char name_pl; / plural name */
255	int typenum; /* itemtype number we need to match 0 if it is the default price */	171	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,	172	sint8 strength; /* the degree of specialisation the shop has in this item,
257	* as a percentage from -100 to 100 */	173	* as a percentage from -100 to 100 */
258	int index; /* being the size of the shopitems array. */	174	int index; /* being the size of the shopitems array. */
		175	};
		176
		177	// map I/O, what to load/save
		178	enum {
		179	IO_HEADER = 0x01, // the "arch map" pseudo object
		180	IO_OBJECTS = 0x02, // the non-unique objects
		181	IO_UNIQUES = 0x04, // unique objects
259	};	182	};
260		183
261	/* In general, code should always use the macros	184	/* In general, code should always use the macros
262	* above (or functions in map.c) to access many of the	185	* above (or functions in map.c) to access many of the
263	* values in the map structure. Failure to do this will	186	* values in the map structure. Failure to do this will
264	* almost certainly break various features. You may think	187	* almost certainly break various features. You may think
265	* it is safe to look at width and height values directly	188	* it is safe to look at width and height values directly
266	* (or even through the macros), but doing so will completely	189	* (or even through the macros), but doing so will completely
267	* break map tiling.	190	* break map tiling.
268	*/	191	*/
269	ACC_CLASS (maptile)	192	INTERFACE_CLASS (maptile)
270	struct maptile : zero_initialised, attachable<maptile>	193	struct maptile : zero_initialised, attachable
271	{	194	{
272	sint32 ACC (RO, width), ACC (RO, height); /* Width and height of map. */	195	sint32 ACC (RW, width), ACC (RW, height); /* Width and height of map. */
273	struct mapspace spaces; / Array of spaces on this map */	196	struct mapspace spaces; / Array of spaces on this map */
		197	uint8 regions; / region index per mapspace, if != 0 */
		198	region_ptr regionmap; / index to region */
274		199
275	maptile ACC (RW, next); / Next map, linked list */	200	tstamp ACC (RW, last_access); /* last time this map was accessed somehow */
276	char ACC (RO, tmpname); / Name of temporary file */	201
277	char ACC (RO, name); / Name of map as given by its creator */	202	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	203	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	204	* points to the struct containing all the properties of
280	* the region */	205	* the region */
281	uint32 ACC (RW, reset_time); /* when this map should reset */	206	double ACC (RW, reset_time);
282	uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map	207	uint32 ACC (RW, reset_timeout); /* How many seconds must elapse before this map
283	* should be reset	208	* should be reset
284	*/	209	*/
		210	bool ACC (RW, dirty); /* if true, something was inserted or removed */
		211	bool ACC (RW, no_reset); // must not reset this map
285	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by	212	bool ACC (RW, fixed_resettime); /* if true, reset time is not affected by
286	* players entering/exiting map	213	* players entering/exiting map
287	*/	214	*/
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 */	215	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 */	216	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	217	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	218	* be loaded before used. The map,omap and map_ob
295	* arrays will be allocated when the map is loaded */	219	* arrays will be allocated when the map is loaded */
296	sint16 ACC (RW, players); /* How many players are on this level right now */	220	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 */	221	uint16 ACC (RW, difficulty); /* What level the player should be to play here */
298		222
		223	bool ACC (RW, per_player);
		224	bool ACC (RW, per_party);
		225	bool ACC (RW, outdoor); /* True if an outdoor map */
		226	bool ACC (RW, no_drop); /* avoid auto-dropping (on death) anything on this map */
299	uint8 ACC (RW, darkness); /* indicates level of darkness of map */	227	uint8 ACC (RW, darkness); /* indicates level of darkness of map */
		228
300	uint16 ACC (RW, enter_x); /* enter_x and enter_y are default entrance location */	229	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 */	230	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 */	231	oblinkpt buttons; / Linked list of linked lists of buttons */
304	sint16 ACC (RW, temp); /* base temperature of this tile (F) */	232	sint16 ACC (RW, temp); /* base temperature of this tile (F) */
305	sint16 ACC (RW, pressure); /* barometric pressure (mb) */	233	sint16 ACC (RW, pressure); /* barometric pressure (mb) */
306	sint8 ACC (RW, humid); /* humitidy of this tile */	234	sint8 ACC (RW, humid); /* humitidy of this tile */
307	sint8 ACC (RW, windspeed); /* windspeed of this tile */	235	sint8 ACC (RW, windspeed); /* windspeed of this tile */
308	sint8 ACC (RW, winddir); /* direction of wind */	236	sint8 ACC (RW, winddir); /* direction of wind */
309	sint8 ACC (RW, sky); /* sky conditions */	237	sint8 ACC (RW, sky); /* sky conditions */
310	int ACC (RW, wpartx), ACC (RW, wparty); /Highly fasten conversion between worldmap and weathermap /	238	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 */	239	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 */	240	shstr ACC (RW, shoprace); /* the preffered race of the local shopkeeper */
313	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */	241	double ACC (RW, shopgreed); /* how much our shopkeeper overcharges */
314	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */	242	sint64 ACC (RW, shopmin); /* minimum price a shop will trade for */
315	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */	243	sint64 ACC (RW, shopmax); /* maximum price a shop will offer */
316	char ACC (RO, msg); / Message map creator may have left */	244	shstr ACC (RW, msg); /* Message map creator may have left */
317	char ACC (RO, maplore); / Map lore information */	245	shstr ACC (RW, maplore); /* Map lore information */
318	char tile_path[4]; / path to adjoining maps */	246	shstr ACC (RW, tile_path[4]); /* path to adjoining maps */
319	maptile tile_map[4]; / Next map, linked list */	247	maptile ACC (RW, tile_map[4]); / Next map, linked list */
320	char ACC (RW, path)[HUGE_BUF]; /* Filename of the map */	248	shstr ACC (RW, path); /* Filename of the map */
		249	int ACC (RW, max_nrof); // maximum nrof of any single item on a mapspace
		250	uint64 ACC (RW, max_volume); // maximum volume for all items on a mapspace
		251
		252	MTH void activate ();
		253	MTH void deactivate ();
		254
		255	// allocates all (empty) mapspace
		256	MTH void alloc ();
		257	// deallocates the mapspaces (and destroys all objects)
		258	MTH void clear ();
		259
		260	MTH void fix_auto_apply ();
		261	MTH void do_decay_objects ();
		262	MTH void update_buttons ();
		263	MTH int change_map_light (int change);
		264	static void change_all_map_light (int change); //PERL
		265	MTH void set_darkness_map ();
		266	MTH int estimate_difficulty () const;
		267
		268	MTH void play_sound (faceidx sound, int x, int y) const;
		269
		270	// set the given flag on all objects in the map
		271	MTH void set_object_flag (int flag, int value = 1);
		272	MTH void post_load_original ();
		273
		274	MTH void link_multipart_objects ();
		275	MTH void clear_unique_items ();
		276
		277	MTH void clear_header ();
		278	MTH void clear_links_to (maptile *m);
		279
		280	MTH struct region *region (int x, int y) const;
		281
		282	// load the header pseudo-object
		283	bool _load_header (object_thawer &thawer);
		284	MTH bool _load_header (object_thawer thawer) { return _load_header (thawer); }
		285
		286	// load objects into the map
		287	bool _load_objects (object_thawer &thawer);
		288	MTH bool _load_objects (object_thawer thawer) { return _load_objects (thawer); }
		289
		290	// save objects into the given file (uses IO_ flags)
		291	bool _save_objects (object_freezer &freezer, int flags);
		292	MTH bool _save_objects (const char *path, int flags);
		293
		294	// save the header pseudo object _only_
		295	bool _save_header (object_freezer &freezer);
		296	MTH bool _save_header (const char *path);
321		297
322	maptile ();	298	maptile ();
323	void allocate ();	299	maptile (int w, int h);
		300	~maptile ();
324		301
		302	void do_destroy ();
		303	void gather_callbacks (AV *&callbacks, event_type event) const;
		304
		305	MTH int size () const { return width * height; }
		306
		307	MTH object insert (object op, int x, int y, object *originator = 0, int flags = 0);
		308
		309	MTH void touch () { last_access = runtime; }
		310
		311	MTH bool tile_available (int dir, bool load = true);
		312
		313	// find the map that is at coordinate x\|y relative to this map
		314	// TODO: need a better way than passing by reference
		315	// TODO: make perl interface
		316	maptile *xy_find (sint16 &x, sint16 &y);
		317
		318	// like xy_find, but also loads the map
		319	maptile *xy_load (sint16 &x, sint16 &y);
		320
		321	void do_load_sync ();//PERL
		322
		323	// make sure the map is loaded
		324	MTH void load_sync ()
		325	{
		326	if (!spaces)
		327	do_load_sync ();
		328	}
		329
		330	void make_map_floor (char *layout, char floorstyle, random_map_params *RP);
		331	bool generate_random_map (random_map_params *RP);
		332
		333	static maptile find_async (const char path, maptile *original = 0, bool load = true);//PERL
		334	static maptile find_sync (const char path, maptile *original = 0);//PERL
		335	static maptile find_style_sync (const char dir, const char *file = 0);//PERL
		336	object *pick_random_object (rand_gen &gen = rndm) const;
		337
325	mapspace const &at (uint32 x, uint32 y) const { return spaces [x + width * y]; }	338	mapspace const &at (uint32 x, uint32 y) const { return spaces [x * height + y]; }
326	mapspace &at (uint32 x, uint32 y) { return spaces [x + width * y]; }	339	mapspace &at (uint32 x, uint32 y) { return spaces [x * height + y]; }
327	};	340	};
328		341
329	/* This is used by get_rangevector to determine where the other	342	/* This is used by get_rangevector to determine where the other
330	* creature is. get_rangevector takes into account map tiling,	343	* creature is. get_rangevector takes into account map tiling,
331	* so you just can not look the the map coordinates and get the	344	* so you just can not look the the map coordinates and get the
…		…
342	int distance_y;	355	int distance_y;
343	int direction;	356	int direction;
344	object *part;	357	object *part;
345	};	358	};
346		359
		360	// comaptibility cruft start
		361	//TODO: these should be refactored into things like xy_normalise
		362	// and so on.
		363	int get_map_flags (maptile oldmap, maptile newmap, sint16 x, sint16 y, sint16 nx, sint16 *ny);
		364	int out_of_map (maptile *m, int x, int y);
		365	maptile get_map_from_coord (maptile m, sint16 x, sint16 y);
		366	void get_rangevector (object op1, object op2, rv_vector *retval, int flags);
		367	void get_rangevector_from_mapcoord (const maptile m, int x, int y, const object op2, rv_vector *retval, int flags);
		368	int on_same_map (const object op1, const object op2);
		369	int adjacent_map (const maptile map1, const maptile map2, int dx, int dy);
		370
		371	// adjust map, x and y for tiled maps and return true if the position is valid at all
		372	static inline bool
		373	xy_normalise (maptile *&map, sint16 &x, sint16 &y)
		374	{
		375	// when in range, do a quick return, otherwise go the slow route
		376	return
		377	(IN_RANGE_EXC (x, 0, map->width) && IN_RANGE_EXC (y, 0, map->height))
		378	\|\| !(get_map_flags (map, &map, x, y, &x, &y) & P_OUT_OF_MAP);
		379	}
		380	// comaptibility cruft end
		381
		382	inline mapspace &
		383	object::ms () const
		384	{
		385	return map->at (x, y);
		386	}
		387
		388	struct mapxy {
		389	maptile *m;
		390	sint16 x, y;
		391
		392	mapxy (maptile *m, sint16 x, sint16 y)
		393	: m(m), x(x), y(y)
		394	{ }
		395
		396	mapxy (object *op)
		397	: m(op->map), x(op->x), y(op->y)
		398	{ }
		399
		400	mapxy &move (int dx, int dy)
		401	{
		402	x += dx;
		403	y += dy;
		404
		405	return *this;
		406	}
		407
		408	mapxy &move (int dir)
		409	{
		410	return move (freearr_x [dir], freearr_y [dir]);
		411	}
		412
		413	operator void () const { return (void )m; }
		414	mapxy &operator =(const object *op)
		415	{
		416	m = op->map;
		417	x = op->x;
		418	y = op->y;
		419
		420	return *this;
		421	}
		422
		423	mapspace *operator ->() const { return &m->at (x, y); }
		424	mapspace &operator * () const { return m->at (x, y); }
		425
		426	bool normalise ()
		427	{
		428	return xy_normalise (m, x, y);
		429	}
		430
		431	mapspace &ms () const
		432	{
		433	return m->at (x, y);
		434	}
		435
		436	object insert (object op, object *originator = 0, int flags = 0) const
		437	{
		438	return m->insert (op, x, y, originator, flags);
		439	}
		440	};
		441
		442	inline const mapxy &
		443	object::operator =(const mapxy &pos)
		444	{
		445	map = pos.m;
		446	x = pos.x;
		447	y = pos.y;
		448
		449	return pos;
		450	}
		451
347	#endif	452	#endif
348		453

Diff Legend

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

Comparing deliantra/server/include/map.h (file contents): Revision 1.30 by root, Wed Dec 20 11:36:39 2006 UTC vs. Revision 1.99 by root, Thu Dec 4 03:48:19 2008 UTC

Diff Legend

Comparing deliantra/server/include/map.h (file contents):
Revision 1.30 by root, Wed Dec 20 11:36:39 2006 UTC vs.
Revision 1.99 by root, Thu Dec 4 03:48:19 2008 UTC