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
|
/*
* tileset.cpp
* Copyright 2008-2009, Thorbjørn Lindeijer <thorbjorn@lindeijer.nl>
* Copyrigth 2009, Edward Hutchins <eah1@yahoo.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.
*/
#include "tileset.h"
#include "tile.h"
#include <QBitmap>
using namespace Tiled;
Tileset::~Tileset()
{
qDeleteAll(mTiles);
}
Tile *Tileset::tileAt(int id) const
{
return (id < mTiles.size()) ? mTiles.at(id) : 0;
}
bool Tileset::loadFromImage(const QImage &image, const QString &fileName)
{
Q_ASSERT(mTileWidth > 0 && mTileHeight > 0);
if (image.isNull())
return false;
const int stopWidth = image.width() - mTileWidth;
const int stopHeight = image.height() - mTileHeight;
int oldTilesetSize = mTiles.size();
int tileNum = 0;
for (int y = mMargin; y <= stopHeight; y += mTileHeight + mTileSpacing) {
for (int x = mMargin; x <= stopWidth; x += mTileWidth + mTileSpacing) {
const QImage tileImage = image.copy(x, y, mTileWidth, mTileHeight);
QPixmap tilePixmap = QPixmap::fromImage(tileImage);
if (mTransparentColor.isValid()) {
const QImage mask =
tileImage.createMaskFromColor(mTransparentColor.rgb());
tilePixmap.setMask(QBitmap::fromImage(mask));
}
if (tileNum < oldTilesetSize) {
mTiles.at(tileNum)->setImage(tilePixmap);
} else {
mTiles.append(new Tile(tilePixmap, tileNum, this));
}
++tileNum;
}
}
// Blank out any remaining tiles to avoid confusion
while (tileNum < oldTilesetSize) {
QPixmap tilePixmap = QPixmap(mTileWidth, mTileHeight);
tilePixmap.fill();
mTiles.at(tileNum)->setImage(tilePixmap);
++tileNum;
}
mImageWidth = image.width();
mImageHeight = image.height();
mColumnCount = columnCountForWidth(mImageWidth);
mImageSource = fileName;
return true;
}
Tileset *Tileset::findSimilarTileset(const QList<Tileset*> &tilesets) const
{
foreach (Tileset *candidate, tilesets) {
if (candidate != this
&& candidate->imageSource() == imageSource()
&& candidate->tileWidth() == tileWidth()
&& candidate->tileHeight() == tileHeight()
&& candidate->tileSpacing() == tileSpacing()
&& candidate->margin() == margin()) {
return candidate;
}
}
return 0;
}
int Tileset::columnCountForWidth(int width) const
{
Q_ASSERT(mTileWidth > 0);
return (width - mMargin + mTileSpacing) / (mTileWidth + mTileSpacing);
}
|