/
layer.h
353 lines (287 loc) · 8.85 KB
/
layer.h
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
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
/*
* layer.h
* Copyright 2008-2010, Thorbjørn Lindeijer <thorbjorn@lindeijer.nl>
* Copyright 2009, Jeff Bland <jeff@teamphobic.com>
*
* This file is part of libtiled.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
* EVENT SHALL THE CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#include "object.h"
#include "tileset.h"
#include <QPixmap>
#include <QRect>
#include <QSet>
#include <QString>
#include <QVector>
namespace Tiled {
class GroupLayer;
class Map;
class ImageLayer;
class ObjectGroup;
class TileLayer;
/**
* A map layer.
*/
class TILEDSHARED_EXPORT Layer : public Object
{
public:
enum TypeFlag {
TileLayerType = 0x01,
ObjectGroupType = 0x02,
ImageLayerType = 0x04,
GroupLayerType = 0x08
};
enum { AnyLayerType = 0xFF };
/**
* Constructor.
*/
Layer(TypeFlag type, const QString &name, int x, int y);
/**
* Returns the type of this layer.
*/
TypeFlag layerType() const { return mLayerType; }
/**
* Returns the name of this layer.
*/
const QString &name() const { return mName; }
/**
* Sets the name of this layer.
*/
void setName(const QString &name) { mName = name; }
/**
* Returns the opacity of this layer.
*/
float opacity() const { return mOpacity; }
/**
* Sets the opacity of this layer.
*/
void setOpacity(float opacity) { mOpacity = opacity; }
float effectiveOpacity() const;
/**
* Returns the visibility of this layer.
*/
bool isVisible() const { return mVisible; }
/**
* Returns the lock status of current layer.
*/
bool isLocked() const { return mLocked; }
/**
* Returns the lock status of layer including parent layers.
*/
bool isUnlocked() const;
bool isHidden() const;
/**
* Sets the visibility of this layer.
*/
void setVisible(bool visible) { mVisible = visible; }
void setLocked(bool locked) { mLocked = locked; }
/**
* Returns the map this layer is part of.
*/
Map *map() const { return mMap; }
/**
* Returns the parent layer, if any.
*/
GroupLayer *parentLayer() const { return mParentLayer; }
bool isParentOrSelf(const Layer *candidate) const;
int depth() const;
int siblingIndex() const;
QList<Layer*> siblings() const;
/**
* Returns the x position of this layer (in tiles).
*/
int x() const { return mX; }
/**
* Sets the x position of this layer (in tiles).
*/
void setX(int x) { mX = x; }
/**
* Returns the y position of this layer (in tiles).
*/
int y() const { return mY; }
/**
* Sets the y position of this layer (in tiles).
*/
void setY(int y) { mY = y; }
/**
* Returns the position of this layer (in tiles).
*/
QPoint position() const { return QPoint(mX, mY); }
/**
* Sets the position of this layer (in tiles).
*/
void setPosition(QPoint pos) { setPosition(pos.x(), pos.y()); }
void setPosition(int x, int y) { mX = x; mY = y; }
void setOffset(const QPointF &offset);
QPointF offset() const;
QPointF totalOffset() const;
virtual bool isEmpty() const = 0;
/**
* Computes and returns the set of tilesets used by this layer.
*/
virtual QSet<SharedTileset> usedTilesets() const = 0;
/**
* Returns whether this layer is referencing the given tileset.
*/
virtual bool referencesTileset(const Tileset *tileset) const = 0;
/**
* Replaces all references to tiles from \a oldTileset with tiles from
* \a newTileset.
*/
virtual void replaceReferencesToTileset(Tileset *oldTileset,
Tileset *newTileset) = 0;
/**
* Returns whether this layer can merge together with the \a other layer.
*/
virtual bool canMergeWith(Layer *other) const = 0;
/**
* Returns a newly allocated layer that is the result of merging this layer
* with the \a other layer. Where relevant, the other layer is considered
* to be on top of this one.
*
* Should only be called when canMergeWith returns true.
*/
virtual Layer *mergedWith(Layer *other) const = 0;
/**
* Returns a duplicate of this layer. The caller is responsible for the
* ownership of this newly created layer.
*/
virtual Layer *clone() const = 0;
// These functions allow checking whether this Layer is an instance of the
// given subclass without relying on a dynamic_cast.
bool isTileLayer() const { return mLayerType == TileLayerType; }
bool isObjectGroup() const { return mLayerType == ObjectGroupType; }
bool isImageLayer() const { return mLayerType == ImageLayerType; }
bool isGroupLayer() const { return mLayerType == GroupLayerType; }
// These actually return this layer cast to one of its subclasses.
TileLayer *asTileLayer();
ObjectGroup *asObjectGroup();
ImageLayer *asImageLayer();
GroupLayer *asGroupLayer();
protected:
/**
* Sets the map this layer is part of. Should only be called from the
* Map class.
*/
virtual void setMap(Map *map) { mMap = map; }
void setParentLayer(GroupLayer *groupLayer) { mParentLayer = groupLayer; }
Layer *initializeClone(Layer *clone) const;
QString mName;
TypeFlag mLayerType;
int mX;
int mY;
QPointF mOffset;
float mOpacity;
bool mVisible;
Map *mMap;
GroupLayer *mParentLayer;
bool mLocked;
friend class Map;
friend class GroupLayer;
};
/**
* Sets the drawing offset in pixels of this layer.
*/
inline void Layer::setOffset(const QPointF &offset)
{
mOffset = offset;
}
/**
* Returns the drawing offset in pixels of this layer.
*/
inline QPointF Layer::offset() const
{
return mOffset;
}
/**
* An iterator for iterating over the layers of a map, in the order in which
* they are drawn. When iterating forward, group layers are traversed after
* their children.
*
* Modifying the layer hierarchy while an iterator is active will lead to
* undefined results!
*/
class TILEDSHARED_EXPORT LayerIterator
{
public:
LayerIterator(const Map *map, int layerTypes = Layer::AnyLayerType);
LayerIterator(Layer *start);
Layer *currentLayer() const;
int currentSiblingIndex() const;
bool hasNextSibling() const;
bool hasPreviousSibling() const;
bool hasParent() const;
Layer *next();
Layer *previous();
void toFront();
void toBack();
private:
const Map *mMap;
Layer *mCurrentLayer;
int mSiblingIndex;
int mLayerTypes;
};
/**
* Iterate the given map, starting from the first layer.
*/
inline LayerIterator::LayerIterator(const Map *map, int layerTypes)
: mMap(map)
, mCurrentLayer(nullptr)
, mSiblingIndex(-1)
, mLayerTypes(layerTypes)
{}
/**
* Iterate the layer's map, starting at the given \a layer.
*/
inline LayerIterator::LayerIterator(Layer *start)
: mMap(start ? start->map() : nullptr)
, mCurrentLayer(start)
, mSiblingIndex(start ? start->siblingIndex() : -1)
, mLayerTypes(Layer::AnyLayerType)
{}
inline Layer *LayerIterator::currentLayer() const
{
return mCurrentLayer;
}
inline int LayerIterator::currentSiblingIndex() const
{
return mSiblingIndex;
}
inline bool LayerIterator::hasNextSibling() const
{
if (!mCurrentLayer)
return false;
return mSiblingIndex + 1 < mCurrentLayer->siblings().size();
}
inline bool LayerIterator::hasPreviousSibling() const
{
return mSiblingIndex > 0;
}
inline bool LayerIterator::hasParent() const
{
return mCurrentLayer && mCurrentLayer->parentLayer();
}
TILEDSHARED_EXPORT int globalIndex(Layer *layer);
TILEDSHARED_EXPORT Layer *layerAtGlobalIndex(const Map *map, int index);
} // namespace Tiled