4 // Copyright (C) 2004 Tobias Glaesser <tobi.web@gmx.de>
5 // Copyright (C) 2006 Matthias Braun <matze@braunis.de>
7 // This program is free software; you can redistribute it and/or
8 // modify it under the terms of the GNU General Public License
9 // as published by the Free Software Foundation; either version 2
10 // of the License, or (at your option) any later version.
12 // This program is distributed in the hope that it will be useful,
13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 // GNU General Public License for more details.
17 // You should have received a copy of the GNU General Public License
18 // along with this program; if not, write to the Free Software
19 // Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
29 #include "video/drawing_context.hpp"
31 #include "lisp/lisp.hpp"
32 #include "lisp/parser.hpp"
33 #include "lisp/list_iterator.hpp"
35 #include "tile_manager.hpp"
36 #include "resources.hpp"
38 TileManager* tile_manager = NULL;
40 TileManager::TileManager(const std::string& filename)
43 Uint32 ticks = SDL_GetTicks();
45 load_tileset(filename);
47 log_debug << "Tiles loaded in " << (SDL_GetTicks() - ticks) / 1000.0 << " seconds" << std::endl;
51 TileManager::~TileManager()
53 for(Tiles::iterator i = tiles.begin(); i != tiles.end(); ++i)
57 void TileManager::load_tileset(std::string filename)
60 for(Tiles::iterator i = tiles.begin(); i != tiles.end(); ++i)
64 std::string::size_type t = filename.rfind('/');
65 if(t == std::string::npos) {
68 tiles_path = filename.substr(0, t+1);
72 const lisp::Lisp* root = parser.parse(filename);
74 const lisp::Lisp* tiles_lisp = root->get_lisp("supertux-tiles");
76 throw std::runtime_error("file is not a supertux tiles file.");
78 lisp::ListIterator iter(tiles_lisp);
80 if(iter.item() == "tile") {
81 Tile* tile = new Tile();
82 tile->parse(*(iter.lisp()));
84 if(tile->id >= tiles.size())
85 tiles.resize(tile->id+1, 0);
87 if(tiles[tile->id] != 0) {
88 log_warning << "Tile with ID " << tile->id << " redefined" << std::endl;
91 tiles[tile->id] = tile;
93 } else if(iter.item() == "tilegroup") {
95 const lisp::Lisp* tilegroup_lisp = iter.lisp();
96 tilegroup_lisp->get("name", tilegroup.name);
97 tilegroup_lisp->get_vector("tiles", tilegroup.tiles);
98 tilegroups.insert(tilegroup);
99 } else if (iter.item() == "tiles") {
100 // List of ids (use 0 if the tile should be ignored)
101 std::vector<unsigned int> ids;
102 // List of attributes of the tile
103 std::vector<unsigned int> attributes;
106 // width and height of the image in tile units, this is used for two
108 // a) so we don't have to load the image here to know its dimensions
109 // b) so that the resulting 'tiles' entry is more robust,
110 // ie. enlarging the image won't break the tile id mapping
111 // FIXME: height is actually not used, since width might be enough for
112 // all purposes, still feels somewhat more natural this way
113 unsigned int width = 0;
114 unsigned int height = 0;
116 iter.lisp()->get_vector("ids", ids);
117 iter.lisp()->get_vector("attributes", attributes);
118 iter.lisp()->get("image", image);
119 iter.lisp()->get("width", width);
120 iter.lisp()->get("height", height);
122 if (ids.size() != attributes.size())
124 std::ostringstream err;
125 err << "Number of ids (" << ids.size() << ") and attributes (" << attributes.size()
126 << ") missmatch for image '" << image << "', but must be equal";
127 throw std::runtime_error(err.str());
130 for(std::vector<unsigned int>::size_type i = 0; i < ids.size() && i < width*height; ++i)
134 if(ids[i] >= tiles.size())
135 tiles.resize(ids[i]+1, 0);
137 int x = 32*(i % width);
138 int y = 32*(i / width);
139 Tile* tile = new Tile(ids[i], attributes[i], Tile::ImageSpec(image, Rect(x, y, x + 32, y + 32)));
140 if (tiles[ids[i]] == 0) {
141 tiles[ids[i]] = tile;
143 log_warning << "Tile with ID " << ids[i] << " redefined" << std::endl;
149 } else if(iter.item() == "properties") {
152 log_warning << "Unknown symbol '" << iter.item() << "' tile defintion file" << std::endl;
157 { // enable this if you want to see a list of free tiles
158 log_info << "Last Tile ID is " << tiles.size()-1 << std::endl;
160 for(int i = 0; i < int(tiles.size()); ++i)
162 if (tiles[i] == 0 && last == -1)
166 else if (tiles[i] && last != -1)
168 log_info << "Free Tile IDs (" << i - last << "): " << last << " - " << i-1 << std::endl;