1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
|
/*
* The Mana World
* Copyright 2004 The Mana World Development Team
*
* This file is part of The Mana World.
*
* The Mana World is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* any later version.
*
* The Mana World is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with The Mana World; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* $Id$
*/
#ifndef _TMW_MAP_H
#define _TMW_MAP_H
#include <list>
#include <map>
#include <vector>
class Being;
class Graphics;
class Image;
class Tileset;
struct PATH_NODE;
/**
* A meta tile stores additional information about a location on a tile map.
* This is information that doesn't need to be repeated for each tile in each
* layer of the map.
*/
class MetaTile
{
public:
/**
* Constructor.
*/
MetaTile();
// Pathfinding members
int Fcost; /**< Estimation of total path cost */
int Gcost; /**< Cost from start to this location */
int Hcost; /**< Estimated cost to goal */
int whichList; /**< No list, open list or closed list */
int parentX; /**< X coordinate of parent tile */
int parentY; /**< Y coordinate of parent tile */
bool walkable; /**< Can beings walk on this tile */
};
/**
* A location on a tile map. Used for pathfinding, open list.
*/
class Location
{
public:
/**
* Constructor.
*/
Location(int x, int y, MetaTile *tile);
/**
* Comparison operator.
*/
bool operator< (const Location &loc) const;
int x, y;
MetaTile *tile;
};
/**
* A tile map.
*/
class Map
{
public:
/**
* Constructor, taking map and tile size as parameters.
*/
Map(int width, int height, int tileWidth, int tileHeight);
/**
* Destructor.
*/
~Map();
/**
* Draws the map to the given graphics output.
*/
void draw(Graphics *graphics, int scrollX, int scrollY, int layer);
/**
* Sets the size of the map. This will destroy any existing map data.
*/
void setSize(int width, int height);
/**
* Adds a tileset to this map.
*/
void
addTileset(Tileset *tileset);
/**
* Sets a tile using a global tile id. Used by the layer loading
* routine.
*/
void
setTileWithGid(int x, int y, int layer, int gid);
/**
* Set tile ID.
*/
void setTile(int x, int y, int layer, Image *img);
/**
* Get tile ID.
*/
Image *getTile(int x, int y, int layer);
/**
* Get tile reference.
*/
MetaTile *getMetaTile(int x, int y);
/**
* Set walkability flag for a tile
*/
void setWalk(int x, int y, bool walkable);
/**
* Tell if a tile is walkable or not, includes checking beings.
*/
bool getWalk(int x, int y);
/**
* Tell if a tile collides, not including a check on beings.
*/
bool tileCollides(int x, int y);
/**
* Returns the width of this map.
*/
int
getWidth() { return mWidth; }
/**
* Returns the height of this map.
*/
int
getHeight() { return mHeight; }
/**
* Returns the tile width of this map.
*/
int
getTileWidth() { return mTileWidth; }
/**
* Returns the tile height used by this map.
*/
int
getTileHeight() { return mTileHeight; }
/**
* Find a path from one location to the next.
*/
std::list<PATH_NODE>
findPath(int startX, int startY, int destX, int destY);
/**
* Get a map property.
*
* @return the value of the given property or an empty string when it
* doesn't exist.
*/
std::string getProperty(const std::string &name);
/**
* Returns whether a certain property is available.
*/
bool hasProperty(const std::string &name);
/**
* Set a map property.
*/
void setProperty(const std::string &name, const std::string &value);
private:
/**
* Converts a global tile id to the Image* pointing to the associated
* tile image.
*/
Image*
getTileWithGid(int gid);
/**
* Finds the tile set that a tile with the given global id is part of.
*/
Tileset*
getTilesetWithGid(int gid);
int mWidth, mHeight;
int mTileWidth, mTileHeight;
MetaTile *metaTiles;
Image **tiles;
std::map<std::string,std::string> properties;
typedef std::vector<Tileset*> Tilesets;
Tilesets tilesets;
// Pathfinding members
int onClosedList, onOpenList;
};
#endif
|
