2 // Copyright (C) 2004 Tobias Glaesser <tobi.web@gmx.de>
3 // Copyright (C) 2006 Matthias Braun <matze@braunis.de>
5 // This program is free software: you can redistribute it and/or modify
6 // it under the terms of the GNU General Public License as published by
7 // the Free Software Foundation, either version 3 of the License, or
8 // (at your option) any later version.
10 // This program is distributed in the hope that it will be useful,
11 // but WITHOUT ANY WARRANTY; without even the implied warranty of
12 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 // GNU General Public License for more details.
15 // You should have received a copy of the GNU General Public License
16 // along with this program. If not, see <http://www.gnu.org/licenses/>.
18 #include "supertux/tile_manager.hpp"
23 #include "lisp/list_iterator.hpp"
24 #include "supertux/tile_set.hpp"
26 TileManager* tile_manager = NULL;
27 TileSet* current_tileset = NULL;
29 TileManager::TileManager()
33 TileManager::~TileManager()
37 TileSet* TileManager::get_tileset(const std::string &filename)
39 TileSets::const_iterator i = tilesets.find(filename);
40 if(i != tilesets.end())
43 std::auto_ptr<TileSet> tileset (new TileSet(filename));
44 tilesets.insert(std::make_pair(filename, tileset.get()));
46 return tileset.release();
49 TileSet* TileManager::parse_tileset_definition(const Reader& reader)
51 std::auto_ptr<TileSet> result(new TileSet());
53 lisp::ListIterator iter(&reader);
55 const std::string& token = iter.item();
56 if(token != "tileset") {
57 log_warning << "Skipping unrecognized token \"" << token << "\" in tileset definition" << std::endl;
60 const lisp::Lisp* tileset_reader = iter.lisp();
63 if (!tileset_reader->get("file", file)) {
64 log_warning << "Skipping tileset import without file name" << std::endl;
68 const TileSet *tileset = get_tileset(file);
71 uint32_t end = std::numeric_limits<uint32_t>::max();
73 tileset_reader->get("start", start);
74 tileset_reader->get("end", end);
75 tileset_reader->get("offset", offset);
77 result->merge(tileset, start, end, offset);
80 return result.release();