| 1 |
/*************************************************************************** |
| 2 |
* Copyright (C) 2005-2019 by the FIFE team * |
| 3 |
* http://www.fifengine.net * |
| 4 |
* This file is part of FIFE. * |
| 5 |
* * |
| 6 |
* FIFE is free software; you can redistribute it and/or * |
| 7 |
* modify it under the terms of the GNU Lesser General Public * |
| 8 |
* License as published by the Free Software Foundation; either * |
| 9 |
* version 2.1 of the License, or (at your option) any later version. * |
| 10 |
* * |
| 11 |
* This library is distributed in the hope that it will be useful, * |
| 12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of * |
| 13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * |
| 14 |
* Lesser General Public License for more details. * |
| 15 |
* * |
| 16 |
* You should have received a copy of the GNU Lesser General Public * |
| 17 |
* License along with this library; if not, write to the * |
| 18 |
* Free Software Foundation, Inc., * |
| 19 |
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA * |
| 20 |
***************************************************************************/ |
| 21 |
|
| 22 |
// Standard C++ library includes |
| 23 |
#include <string> |
| 24 |
|
| 25 |
// 3rd party library includes |
| 26 |
#include <boost/lexical_cast.hpp> |
| 27 |
|
| 28 |
// FIFE includes |
| 29 |
// These includes are split up in two parts, separated by one empty line |
| 30 |
// First block: files included from the FIFE root src directory |
| 31 |
// Second block: files included from the same folder |
| 32 |
#include "util/base/exception.h" |
| 33 |
#include "util/structures/purge.h" |
| 34 |
#include "util/structures/rect.h" |
| 35 |
#include "view/camera.h" |
| 36 |
#include "view/rendererbase.h" |
| 37 |
#include "video/renderbackend.h" |
| 38 |
|
| 39 |
#include "map.h" |
| 40 |
#include "layer.h" |
| 41 |
#include "cellcache.h" |
| 42 |
#include "instance.h" |
| 43 |
#include "triggercontroller.h" |
| 44 |
|
| 45 |
namespace FIFE { |
| 46 |
|
| 47 |
Map::Map(const std::string& identifier, RenderBackend* renderBackend, |
| 48 |
const std::vector<RendererBase*>& renderers, TimeProvider* tp_master): |
| 49 |
m_id(identifier), |
| 50 |
m_filename(""), |
| 51 |
m_timeProvider(tp_master), |
| 52 |
m_changeListeners(), |
| 53 |
m_changedLayers(), |
| 54 |
m_renderBackend(renderBackend), |
| 55 |
m_renderers(renderers), |
| 56 |
m_changed(false) { |
| 57 |
|
| 58 |
m_triggerController = new TriggerController(this); |
| 59 |
} |
| 60 |
|
| 61 |
Map::~Map() { |
| 62 |
delete m_triggerController; |
| 63 |
// remove all cameras |
| 64 |
std::vector<Camera*>::iterator iter = m_cameras.begin(); |
| 65 |
for ( ; iter != m_cameras.end(); ++iter) { |
| 66 |
delete *iter; |
| 67 |
} |
| 68 |
m_cameras.clear(); |
| 69 |
|
| 70 |
deleteLayers(); |
| 71 |
} |
| 72 |
|
| 73 |
Layer* Map::getLayer(const std::string& id) { |
| 74 |
std::list<Layer*>::const_iterator it = m_layers.begin(); |
| 75 |
for(; it != m_layers.end(); ++it) { |
| 76 |
if((*it)->getId() == id) |
| 77 |
return *it; |
| 78 |
} |
| 79 |
return NULL; |
| 80 |
} |
| 81 |
|
| 82 |
uint32_t Map::getLayerCount() const { |
| 83 |
return m_layers.size(); |
| 84 |
} |
| 85 |
|
| 86 |
Layer* Map::createLayer(const std::string& identifier, CellGrid* grid) { |
| 87 |
std::list<Layer*>::const_iterator it = m_layers.begin(); |
| 88 |
for(; it != m_layers.end(); ++it) { |
| 89 |
if(identifier == (*it)->getId()) |
| 90 |
throw NameClash(identifier); |
| 91 |
} |
| 92 |
|
| 93 |
Layer* layer = new Layer(identifier, this, grid); |
| 94 |
m_layers.push_back(layer); |
| 95 |
m_changed = true; |
| 96 |
std::vector<MapChangeListener*>::iterator i = m_changeListeners.begin(); |
| 97 |
while (i != m_changeListeners.end()) { |
| 98 |
(*i)->onLayerCreate(this, layer); |
| 99 |
++i; |
| 100 |
} |
| 101 |
|
| 102 |
return layer; |
| 103 |
} |
| 104 |
|
| 105 |
void Map::deleteLayer(Layer* layer) { |
| 106 |
std::list<Layer*>::iterator it = m_layers.begin(); |
| 107 |
for(; it != m_layers.end(); ++it) { |
| 108 |
if((*it) == layer) { |
| 109 |
std::vector<MapChangeListener*>::iterator i = m_changeListeners.begin(); |
| 110 |
while (i != m_changeListeners.end()) { |
| 111 |
(*i)->onLayerDelete(this, layer); |
| 112 |
++i; |
| 113 |
} |
| 114 |
delete layer; |
| 115 |
m_layers.erase(it); |
| 116 |
return ; |
| 117 |
} |
| 118 |
} |
| 119 |
m_changed = true; |
| 120 |
} |
| 121 |
|
| 122 |
void Map::deleteLayers() { |
| 123 |
std::list<Layer*> temp_layers = m_layers; |
| 124 |
std::list<Layer*>::iterator temp_it = temp_layers.begin(); |
| 125 |
for(; temp_it != temp_layers.end(); ++temp_it) { |
| 126 |
std::vector<MapChangeListener*>::iterator i = m_changeListeners.begin(); |
| 127 |
while (i != m_changeListeners.end()) { |
| 128 |
(*i)->onLayerDelete(this, *temp_it); |
| 129 |
++i; |
| 130 |
} |
| 131 |
std::list<Layer*>::iterator it = m_layers.begin(); |
| 132 |
for(; it != m_layers.end(); ++it) { |
| 133 |
if(*it == *temp_it) { |
| 134 |
delete *it; |
| 135 |
m_layers.erase(it); |
| 136 |
break; |
| 137 |
} |
| 138 |
} |
| 139 |
} |
| 140 |
} |
| 141 |
|
| 142 |
void Map::getMinMaxCoordinates(ExactModelCoordinate& min, ExactModelCoordinate& max) { |
| 143 |
if (m_layers.empty()) { |
| 144 |
return; |
| 145 |
} |
| 146 |
std::list<Layer*>::iterator it = m_layers.begin(); |
| 147 |
Layer* layer = *it; |
| 148 |
for (; it != m_layers.end(); ++it) { |
| 149 |
ModelCoordinate newMin, newMax; |
| 150 |
(*it)->getMinMaxCoordinates(newMin, newMax, layer); |
| 151 |
|
| 152 |
if (newMin.x < min.x) { |
| 153 |
min.x = newMin.x; |
| 154 |
} |
| 155 |
if (newMax.x > max.x) { |
| 156 |
max.x = newMax.x; |
| 157 |
} |
| 158 |
if (newMin.y < min.y) { |
| 159 |
min.y = newMin.y; |
| 160 |
} |
| 161 |
if (newMax.y > max.y) { |
| 162 |
max.y = newMax.y; |
| 163 |
} |
| 164 |
} |
| 165 |
Location lmin(layer); |
| 166 |
Location lmax(layer); |
| 167 |
lmin.setExactLayerCoordinates(min); |
| 168 |
lmax.setExactLayerCoordinates(max); |
| 169 |
|
| 170 |
min = lmin.getMapCoordinates(); |
| 171 |
max = lmax.getMapCoordinates(); |
| 172 |
} |
| 173 |
|
| 174 |
bool Map::update() { |
| 175 |
m_changedLayers.clear(); |
| 176 |
// transfer instances from one layer to another |
| 177 |
if (!m_transferInstances.empty()) { |
| 178 |
std::map<Instance*, Location>::iterator it = m_transferInstances.begin(); |
| 179 |
for (; it != m_transferInstances.end(); ++it) { |
| 180 |
Instance* inst = (*it).first; |
| 181 |
Location target_loc = (*it).second; |
| 182 |
Layer* source = inst->getOldLocationRef().getLayer(); |
| 183 |
Layer* target = target_loc.getLayer(); |
| 184 |
if (source != target) { |
| 185 |
source->removeInstance(inst); |
| 186 |
target->addInstance(inst, target_loc.getExactLayerCoordinates()); |
| 187 |
} |
| 188 |
} |
| 189 |
m_transferInstances.clear(); |
| 190 |
} |
| 191 |
std::vector<CellCache*> cellCaches; |
| 192 |
std::list<Layer*>::iterator it = m_layers.begin(); |
| 193 |
// update Layers |
| 194 |
for(; it != m_layers.end(); ++it) { |
| 195 |
if ((*it)->update()) { |
| 196 |
m_changedLayers.push_back(*it); |
| 197 |
} |
| 198 |
CellCache* cache = (*it)->getCellCache(); |
| 199 |
if (cache) { |
| 200 |
cellCaches.push_back(cache); |
| 201 |
} |
| 202 |
} |
| 203 |
// loop over Caches and update |
| 204 |
for (std::vector<CellCache*>::iterator cacheIt = cellCaches.begin(); |
| 205 |
cacheIt != cellCaches.end(); ++cacheIt) { |
| 206 |
(*cacheIt)->update(); |
| 207 |
} |
| 208 |
if (!m_changedLayers.empty()) { |
| 209 |
std::vector<MapChangeListener*>::iterator i = m_changeListeners.begin(); |
| 210 |
while (i != m_changeListeners.end()) { |
| 211 |
(*i)->onMapChanged(this, m_changedLayers); |
| 212 |
++i; |
| 213 |
} |
| 214 |
} |
| 215 |
|
| 216 |
// loop over cameras and update if enabled |
| 217 |
std::vector<Camera*>::iterator camIter = m_cameras.begin(); |
| 218 |
for ( ; camIter != m_cameras.end(); ++camIter) { |
| 219 |
if ((*camIter)->isEnabled()) { |
| 220 |
(*camIter)->update(); |
| 221 |
(*camIter)->render(); |
| 222 |
} |
| 223 |
} |
| 224 |
|
| 225 |
bool retval = m_changed; |
| 226 |
m_changed = false; |
| 227 |
return retval; |
| 228 |
} |
| 229 |
|
| 230 |
void Map::addChangeListener(MapChangeListener* listener) { |
| 231 |
m_changeListeners.push_back(listener); |
| 232 |
} |
| 233 |
|
| 234 |
void Map::removeChangeListener(MapChangeListener* listener) { |
| 235 |
std::vector<MapChangeListener*>::iterator i = m_changeListeners.begin(); |
| 236 |
while (i != m_changeListeners.end()) { |
| 237 |
if ((*i) == listener) { |
| 238 |
m_changeListeners.erase(i); |
| 239 |
return; |
| 240 |
} |
| 241 |
++i; |
| 242 |
} |
| 243 |
} |
| 244 |
|
| 245 |
Camera* Map::addCamera(const std::string &id, const Rect& viewport) { |
| 246 |
if (getCamera(id)) { |
| 247 |
std::string errorStr = "Camera: " + id + " already exists"; |
| 248 |
throw NameClash(errorStr); |
| 249 |
} |
| 250 |
|
| 251 |
// create new camera and add to list of cameras |
| 252 |
Camera* camera = new Camera(id, this, viewport, m_renderBackend); |
| 253 |
m_cameras.push_back(camera); |
| 254 |
|
| 255 |
std::vector<RendererBase*>::iterator iter = m_renderers.begin(); |
| 256 |
for ( ; iter != m_renderers.end(); ++iter) { |
| 257 |
camera->addRenderer((*iter)->clone()); |
| 258 |
} |
| 259 |
|
| 260 |
return camera; |
| 261 |
} |
| 262 |
|
| 263 |
void Map::removeCamera(const std::string &id) { |
| 264 |
std::vector<Camera*>::iterator iter = m_cameras.begin(); |
| 265 |
for ( ; iter != m_cameras.end(); ++iter) { |
| 266 |
if ((*iter)->getId() == id) { |
| 267 |
// camera has been found delete it |
| 268 |
delete *iter; |
| 269 |
|
| 270 |
// now remove it from the vector |
| 271 |
// note this invalidates iterators, but we do not need |
| 272 |
// to worry about it in this case since we are done |
| 273 |
m_cameras.erase(iter); |
| 274 |
|
| 275 |
break; |
| 276 |
} |
| 277 |
} |
| 278 |
} |
| 279 |
|
| 280 |
Camera* Map::getCamera(const std::string &id) { |
| 281 |
std::vector<Camera*>::iterator iter = m_cameras.begin(); |
| 282 |
for ( ; iter != m_cameras.end(); ++iter) { |
| 283 |
if ((*iter)->getId() == id) { |
| 284 |
return *iter; |
| 285 |
} |
| 286 |
} |
| 287 |
|
| 288 |
return NULL; |
| 289 |
} |
| 290 |
|
| 291 |
const std::vector<Camera*>& Map::getCameras() const { |
| 292 |
return m_cameras; |
| 293 |
} |
| 294 |
|
| 295 |
uint32_t Map::getActiveCameraCount() const { |
| 296 |
uint32_t count = 0; |
| 297 |
std::vector<Camera*>::const_iterator it = m_cameras.begin(); |
| 298 |
for ( ; it != m_cameras.end(); ++it) { |
| 299 |
if ((*it)->isEnabled()) { |
| 300 |
count += 1; |
| 301 |
} |
| 302 |
} |
| 303 |
return count; |
| 304 |
} |
| 305 |
|
| 306 |
void Map::addInstanceForTransfer(Instance* instance, const Location& target) { |
| 307 |
std::pair<std::map<Instance*, Location>::iterator, bool> insertiter = m_transferInstances.insert(std::make_pair(instance, target)); |
| 308 |
if (insertiter.second == false) { |
| 309 |
Location& loc = insertiter.first->second; |
| 310 |
loc.setLayer(target.getLayer()); |
| 311 |
loc.setExactLayerCoordinates(target.getExactLayerCoordinates()); |
| 312 |
} |
| 313 |
} |
| 314 |
|
| 315 |
void Map::removeInstanceForTransfer(Instance* instance) { |
| 316 |
std::map<Instance*, Location>::iterator it = m_transferInstances.find(instance); |
| 317 |
if (it != m_transferInstances.end()) { |
| 318 |
m_transferInstances.erase(it); |
| 319 |
} |
| 320 |
} |
| 321 |
|
| 322 |
void Map::initializeCellCaches() { |
| 323 |
if (m_layers.empty()) { |
| 324 |
return; |
| 325 |
} |
| 326 |
|
| 327 |
std::list<Layer*>::iterator layit = m_layers.begin(); |
| 328 |
// first add interacts to walkables |
| 329 |
for (; layit != m_layers.end(); ++layit) { |
| 330 |
if ((*layit)->isInteract()) { |
| 331 |
Layer* temp = getLayer((*layit)->getWalkableId()); |
| 332 |
if (temp) { |
| 333 |
temp->addInteractLayer(*layit); |
| 334 |
} |
| 335 |
} |
| 336 |
} |
| 337 |
// then create CellCaches for walkables |
| 338 |
layit = m_layers.begin(); |
| 339 |
for (; layit != m_layers.end(); ++layit) { |
| 340 |
if ((*layit)->isWalkable()) { |
| 341 |
(*layit)->createCellCache(); |
| 342 |
} |
| 343 |
} |
| 344 |
} |
| 345 |
|
| 346 |
void Map::finalizeCellCaches() { |
| 347 |
// create Cells and generate neighbours |
| 348 |
std::list<Layer*>::iterator layit = m_layers.begin(); |
| 349 |
for (; layit != m_layers.end(); ++layit) { |
| 350 |
CellCache* cache = (*layit)->getCellCache(); |
| 351 |
if (cache) { |
| 352 |
cache->createCells(); |
| 353 |
cache->forceUpdate(); |
| 354 |
} |
| 355 |
} |
| 356 |
} |
| 357 |
} //FIFE |
| 358 |
|