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
|
/***************************************************************************
* Copyright (C) 2005-2008 by the FIFE team *
* http://www.fifengine.de *
* This file is part of FIFE. *
* *
* FIFE is free software; you can redistribute it and/or *
* modify it under the terms of the GNU Lesser General Public *
* License as published by the Free Software Foundation; either *
* version 2.1 of the License, or (at your option) any later version. *
* *
* This library 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 *
* Lesser General Public License for more details. *
* *
* You should have received a copy of the GNU Lesser General Public *
* License along with this library; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *
***************************************************************************/
#ifndef FIFE_LAYER_H
#define FIFE_LAYER_H
// Standard C++ library includes
#include <algorithm>
#include <string>
#include <vector>
#include <set>
// 3rd party library includes
// FIFE includes
// These includes are split up in two parts, separated by one empty line
// First block: files included from the FIFE root src directory
// Second block: files included from the same folder
#include "util/base/fifeclass.h"
#include "util/structures/rect.h"
#include "model/metamodel/modelcoords.h"
#include "model/metamodel/object.h"
#include "instance.h"
namespace FIFE {
class Map;
class Selection;
class CellGrid;
class Object;
class InstanceTree;
/** Defines how pathing can be performed on this layer
*
* CELL_EDGES_ONLY allows pather to use only cell edges when moving instances from cell to cell on map
* CELL_EDGES_AND_DIAGONALS allows pather to use both cell edges and diagonals when moving instances from cell to cell on map
* FREEFORM allows pather to find shortest route regardless of cellgrid used on the layer
*/
enum PathingStrategy {
CELL_EDGES_ONLY,
CELL_EDGES_AND_DIAGONALS,
FREEFORM
};
/** Listener interface for changes happening on a layer
*/
class LayerChangeListener {
public:
virtual ~LayerChangeListener() {};
/** Called when some instance is changed on layer. @see InstanceChangeType
* @param layer where change occurred
* @param changedInstances list of instances containing some changes
* @note Does not report creations and deletions
*/
virtual void onLayerChanged(Layer* layer, std::vector<Instance*>& changedInstances) = 0;
/** Called when some instance gets created on layer
* @param layer where change occurred
* @param instance which got created
*/
virtual void onInstanceCreate(Layer* layer, Instance* instance) = 0;
/** Called when some instance gets deleted on layer
* @param layer where change occurred
* @param instance which will be deleted
* @note right after this call, instance actually gets deleted!
*/
virtual void onInstanceDelete(Layer* layer, Instance* instance) = 0;
};
/** A basic layer on a map
*/
class Layer : public FifeClass {
public:
/** Constructor
* Layers are created by calling addLayer from map, thus
* this method should really be called only by map or test code.
*/
Layer(const std::string& identifier, Map* map, CellGrid* grid);
/** Destructs a Layer instance
*/
~Layer();
/** Get the id of this layer.
*/
const std::string& getId() const { return m_id; }
/** Sets the identifier for this layer.
*/
void setId(const std::string& id) { m_id = id; }
/** Get the map this layer is contained in
*/
Map* getMap() const { return m_map; }
/** Get the Cellgrid
* @return pointer to a valid cellgrid
*/
CellGrid* getCellGrid() const { return m_grid; }
/** Set the Cellgrid
*/
void setCellGrid(CellGrid* grid) { m_grid = grid; }
/** Get the instance tree.
* @return this layers instance tree.
*/
InstanceTree* getInstanceTree(void) const { return m_instanceTree; }
/** Check existance of objects on this layer
* @return True, if objects exist.
*/
bool hasInstances() const;
/** Add an instance of an object at a specific position
*/
Instance* createInstance(Object* object, const ModelCoordinate& p, const std::string& id="");
/** Add an instance of an object at a specific position
*/
Instance* createInstance(Object* object, const ExactModelCoordinate& p, const std::string& id="");
/** Add a valid instance at a specific position. This is temporary. It will be moved to a higher level
later so that we can ensure that each Instance only lives in one layer.
*/
bool addInstance(Instance* instance, const ExactModelCoordinate& p);
/** Remove an instance from the layer
*/
void deleteInstance(Instance* object);
/** Get the list of instances on this layer
*/
const std::vector<Instance*>& getInstances() const { return m_instances; }
/** Get the list of instances on this layer with the given identifier.
*/
std::vector<Instance*> getInstances(const std::string& id);
/** Returns instances that match given location.
* @param loc location where to fetch instances from
* @param use_exactcoordinates if true, comparison is done using exact coordinates. if not, cell coordinates are used
*/
std::vector<Instance*> getInstancesAt(Location& loc, bool use_exactcoordinates=false);
/** Returns instances that match given rect.
* @param rec rect where to fetch instances from
*/
std::list<Instance*> getInstancesIn(Rect& rec);
/** Get the first instance on this layer with the given identifier.
*/
Instance* getInstance(const std::string& identifier);
/** Set object visibility
*/
void setInstancesVisible(bool vis);
/** Sets the transparency of all instances on the layer. 0=opaque, 255=transparent
* @parm transparency Transparency value from 0-255.
*/
void setLayerTransparency(uint8_t transparency);
/** Returns the layer's transparency value
*/
uint8_t getLayerTransparency();
/** Retrieves the minimum/maximum coordinates of instances on the layer.
* @param min A reference to a ModelCoordinate that will hold the minimum coordinate.
* @param max A reference to a ModelCoordinate that will hold the maximum coordinate.
* @param layer A pointer to another layer that can be used to cast coordinates bettween layers.
*/
void getMinMaxCoordinates(ModelCoordinate& min, ModelCoordinate& max, const Layer* layer = 0) const;
/** Determines if a given cell on the layer contains a blocking instance
*
* @param cellCoordinate A const reference to a model coordinate of the cell in question.
* @return A boolean, true if it is blocked false otherwise.
*/
bool cellContainsBlockingInstance(const ModelCoordinate& cellCoordinate);
/** Toggle object visibility
* @see setObjectsVisible
*/
void toggleInstancesVisible();
/** Check object visibility
* @see setObjectsVisible
*/
bool areInstancesVisible() const { return m_instances_visibility; }
/** Called periodically to update events on layer
* @returns true if layer was changed since the last update, false otherwise
*/
bool update();
/** Sets pathing strategy for the layer
* @see PathingStrategy
*/
void setPathingStrategy(PathingStrategy strategy) { m_pathingstrategy = strategy; }
/** Gets pathing strategy for the layer
* @see PathingStrategy
*/
PathingStrategy getPathingStrategy() const { return m_pathingstrategy; }
/** Adds new change listener
* @param listener to add
*/
void addChangeListener(LayerChangeListener* listener);
/** Removes associated change listener
* @param listener to remove
*/
void removeChangeListener(LayerChangeListener* listener);
/** Returns true, if layer information was changed during previous update round
*/
bool isChanged() { return m_changed; }
/** Returns instances that were changed during previous update round.
* @note does not contain created or deleted instances
*/
std::vector<Instance*>& getChangedInstances() { return m_changedinstances; }
void setInstanceActivityStatus(Instance* instance, bool active);
protected:
std::string m_id;
Map* m_map;
bool m_instances_visibility;
uint8_t m_transparency;
// all the instances on this layer
std::vector<Instance*> m_instances;
// all the active instances on this layer
std::set<Instance*> m_active_instances;
//The instance tree
InstanceTree* m_instanceTree;
// layer's cellgrid
CellGrid* m_grid;
// pathing strategy for the layer
PathingStrategy m_pathingstrategy;
// listeners for layer changes
std::vector<LayerChangeListener*> m_changelisteners;
// holds changed instances after each update
std::vector<Instance*> m_changedinstances;
// true if layer (or it's instance) information was changed during previous update round
bool m_changed;
};
} // FIFE
#endif
|