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 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322
|
#ifndef __BT_MAP_H__
#define __BT_MAP_H__
/* Battle Tanks Game
* Copyright (C) 2006-2009 Battle Tanks team
*
* This program 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 (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
/*
* Additional rights can be granted beyond the GNU General Public License
* on the terms provided in the Exception. If you modify this file,
* you may extend this exception to your version of the file,
* but you are not obligated to do so. If you do not wish to provide this
* exception without modification, you must delete this exception statement
* from your version and license this file solely under the GPL without exception.
*/
#include "sl08/sl08.h"
#include "export_btanks.h"
#include <map>
#include <string>
#include <stack>
#include <set>
#include "mrt/chunk.h"
#include "math/v2.h"
#include "math/matrix.h"
#include "mrt/singleton.h"
#include "notifying_xml_parser.h"
#include "sdlx/c_map.h"
#include "sdlx/rect.h"
#include "tileset_list.h"
namespace sdlx {
class Surface;
class Rect;
}
class TMXEntity;
class Layer;
class Object;
class MapGenerator;
class BTANKSAPI IMap : public NotifyingXMLParser, public mrt::Serializable {
public:
sl08::signal0<void> load_map_signal;
sl08::signal0<void> load_map_final_signal;
sl08::signal4<void, int, int, int, int> map_resize_signal;
typedef std::set<v3<int> > destroyed_cells;
sl08::signal1<void, const destroyed_cells& > destroyed_cells_signal;
DECLARE_SINGLETON(IMap);
struct TilePosition {
v2<int> position;
bool merged_x;
bool merged_y;
int prev_im;
};
inline const TilesetList & getTilesets() const { return _tilesets; }
void getLayers(std::set<int> &layers_z) const;
Layer* getLayer(const int z);
typedef std::map<const std::string, std::string> PropertyMap;
PropertyMap properties;
IMap();
~IMap();
void clear();
void load(const std::string &name);
const bool loaded() const;
void tick(const float dt);
void render(sdlx::Surface &window, const sdlx::Rect &src, const sdlx::Rect &dst, const int z1, const int z2) const;
const v2<int> get_size() const;
const v2<int> getTileSize() const;
const v2<int> getPathTileSize() const;
virtual const int getImpassability(const Object *obj, const v2<int>& pos, TilePosition *tile_pos = NULL, bool *hidden = NULL) const;
const Matrix<int>& get_impassability_matrix(const int z, const bool only_pierceable = false);
const Matrix<int>& getAreaMatrix(const std::string &name);
//void getSurroundings(Matrix<int> &matrix, const v2<int> &pos, const int filler = -1) const;
void damage(const v2<float> &position, const int hp);
void damage(const v2<float> ¢er_position, const int hp, const float radius);
void _destroy(const int z, const v2<int> &cell);
struct TileDescriptor {
inline TileDescriptor() : surface(0), cmap(0), vmap(0) {}
inline TileDescriptor(sdlx::Surface * surface, sdlx::CollisionMap *cmap, sdlx::CollisionMap *vmap) :
surface(surface), cmap(cmap), vmap(vmap) {}
sdlx::Surface * surface;
sdlx::CollisionMap *cmap, *vmap;
};
typedef std::vector< TileDescriptor > TileMap;
const TileDescriptor & getTile(const size_t idx) const;
void invalidateTile(const int xp, const int yp);
void generateMatrixes();
void get_zBoxes(std::set<int> &layers);
virtual void serialize(mrt::Serializator &s) const;
virtual void deserialize(const mrt::Serializator &s);
inline const std::string &getPath() const { return _path; }
inline const std::string &getName() const { return _name; }
void generateXML(std::string &result) const;
void addLayer(const int after_z, const std::string &name);
void deleteLayer(const int z);
const bool swapLayers(const int z1, const int z2);
void addTileset(const std::string &tileset);
const bool hasSoloLayers() const;
inline const bool torus() const { return _torus; }
template<typename T>
void add(v2<T> &src, const v2<T> &dst) const {
src += dst;
if (!_torus)
return;
validate(src);
}
template<typename T>
const bool contains(const v2<T> &pos) const {
if (_torus)
return true;
return pos.x >= 0 && pos.y >= 0 && pos.x < _tw * _w && pos.y < _th * _h;
}
void validate(v2<int> &result) const {
if (!_torus)
return;
const int w = _tw * _w, h = _th * _h;
result.x %= w;
if (result.x < 0)
result.x += w;
result.y %= h;
if (result.y < 0)
result.y += h;
}
void validate(v2<float> &v) const {
if (!_torus)
return;
const int w = _tw * _w, h = _th * _h;
v.x -= (((int)v.x) / w) * w;
v.y -= (((int)v.y) / h) * h;
if (v.x < 0)
v.x += w;
if (v.y < 0)
v.y += h;
}
template<typename T>
const v2<T> distance(const v2<T> &src, const v2<T> &dst) const {
v2<T> dpos = dst - src;
if (_torus) {
const int w = _tw * _w, h = _th * _h;
const v2<T> abs_dpos (((dpos.x >= 0)? dpos.x: -dpos.x), ((dpos.y >= 0)? dpos.y: -dpos.y));
if (abs_dpos.x > w / 2) {
if (dpos.x > 0) {
dpos.x -= w;
} else if (dpos.x < 0) {
dpos.x += w;
}
}
if (abs_dpos.y > h / 2) {
if (dpos.y > 0) {
dpos.y -= h;
} else if (dpos.y < 0) {
dpos.y += h;
}
}
} //if (_torus)
return dpos;
}
const bool in(const sdlx::Rect &area, int x, int y) const {
if (!_torus)
return area.in(x, y);
const int w = _tw * _w, h = _th * _h;
x -= area.x;
y -= area.y;
x %= w;
if (x < 0) x += w;
y %= h;
if (y < 0) y += h;
return x < area.w && y < area.h;
}
template<typename T>
inline const bool in(const sdlx::Rect &area, const v2<T> &position) const {
return in(area, (int)position.x, (int)position.y);
}
const bool intersects(const sdlx::Rect &area1, const sdlx::Rect &area2) const {
if (!_torus)
return area1.intersects(area2);
else
return in(area1, area2.x, area2.y) ||
in(area2, area1.x, area1.y) ||
in(area1, area2.x + area2.w - 1, area2.y + area2.h - 1) ||
in(area2, area1.x + area1.w - 1, area1.y + area1.h - 1) ||
in(area1, area2.x + area2.w - 1, area2.y) ||
in(area2, area1.x + area1.w - 1, area1.y) ||
in(area1, area2.x, area2.y + area2.h - 1) ||
in(area2, area1.x, area1.y + area1.h - 1);
}
void getSurroundings(Matrix<int> &matrix, const Object *obj, const int filler) const;
inline MapGenerator *getGenerator() { return _generator; }
void resize(const int left_cut, const int right_cut, const int up_cut, const int down_cut);
private:
const int addTiles(const sdlx::Surface *image, const int first_gid);
Matrix<int> &getMatrix(int z, const bool only_pierceable);
Matrix<int> &getMatrix(const std::string &name);
void updateMatrix(const int x, const int y);
void updateMatrix(Matrix<int> &matrix, const Layer *layer);
virtual void start(const std::string &name, Attrs &attr);
virtual void end(const std::string &name);
virtual void cdata(const std::string &data);
const Uint32 getTile(const Layer *l, const int x, const int y) const;
const sdlx::Surface* get_surface(const Layer *l, const int x, const int y) const;
const sdlx::CollisionMap* getCollisionMap(const Layer *l, const int x, const int y) const;
const sdlx::CollisionMap* getVisibilityMap(const Layer *l, const int x, const int y) const;
typedef std::map<const std::pair<int, bool> , Matrix<int> > MatrixMap;
MatrixMap _imp_map;
typedef std::map<const std::string, Matrix<int> > ObjectAreaMap;
ObjectAreaMap _area_map;
inline const bool collides(const Object *obj, const int dx, const int dy, const sdlx::CollisionMap *tile) const;
inline const bool hiddenBy(const Object *obj, const int dx, const int dy, const sdlx::CollisionMap *tile) const;
int _w, _h, _tw, _th, _ptw, _pth, _firstgid, _split;
sdlx::CollisionMap _full_tile;
int _lastz;
mrt::Chunk _data;
std::string _image_name, _image_source;
sdlx::Surface *_image;
bool _image_is_tileset;
PropertyMap _properties;
typedef std::map<const int, Layer *> LayerMap;
LayerMap _layers;
Matrix<int> _cover_map;
std::map<const std::string, std::string> _damage4;
std::map<const std::string, int> _layer_z;
bool _layer;
std::string _layer_name;
TileMap _tiles;
struct Entity {
mrt::XMLParser::Attrs attrs;
std::string data;
Entity(const mrt::XMLParser::Attrs & attrs) : attrs(attrs), data() {}
};
typedef std::stack<Entity> EntityStack;
EntityStack _stack;
IMap(const IMap&);
const IMap& operator=(const IMap&);
MapGenerator *_generator;
TilesetList _tilesets;
std::string _name, _path;
bool _torus;
typedef std::map<const int, int> CorrectionMap;
CorrectionMap _corrections;
void correctGids();
};
PUBLIC_SINGLETON(BTANKSAPI, Map, IMap);
#endif
|