/* ** tileatlas.h ** ** This file is part of mkxp. ** ** Copyright (C) 2013 Jonas Kulla ** ** mkxp is free software: you can redistribute it and/or modify ** it under the terms of the GNU General Public License as published by ** the Free Software Foundation, either version 2 of the License, or ** (at your option) any later version. ** ** mkxp 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 General Public License for more details. ** ** You should have received a copy of the GNU General Public License ** along with mkxp. If not, see . */ #ifndef TILEATLAS_H #define TILEATLAS_H #include "etc-internal.h" #include namespace TileAtlas { /* Abstract definition of a blit * operation with undefined rect width */ struct Blit { Vec2i src; Vec2i dst; int h; Blit(int sx, int sy, int dx, int dy, int h) : src(sx, sy), dst(dx, dy), h(h) {} }; typedef std::vector BlitVec; /* Calculates the minimum atlas size required to hold * a tileset of height 'tilesetH'. If the required dimensions * exceed 'maxAtlasSize', Vec2i(-1, -1) is returned. */ Vec2i minSize(int tilesetH, int maxAtlasSize); /* Calculates a series of blits necessary to fill an atlas * of size 'atlasSize' with a tileset of height 'tilesetH'. * Usually fed results from 'minSize()'. */ BlitVec calcBlits(int tilesetH, const Vec2i &atlasSize); /* Translates a tile coordinate (not pixel!) to a physical * pixel coordinate in the atlas */ Vec2i tileToAtlasCoor(int tileX, int tileY, int tilesetH, int atlasH); } #endif // TILEATLAS_H