mirror of
https://github.com/opentibiabr/remeres-map-editor
synced 2026-08-15 18:26:04 -04:00
Add editor support for exporting Cyclopedia and CipSoft protobuf assets from the currently loaded map. Main changes: - Add File > Client Assets actions for Static House Data export, Cyclopedia minimap and satellite export, and restoring timestamped client asset backups. - Keep generic minimap and tileset exports under File > Export. - Export staticdata, staticmapdata, and mapdata protobuf files with content-hashed filenames. - Update catalog-content.json so generated assets are picked up by the client. - Merge compatible CipSoft templates when they match the loaded map. - Fall back to generated data for custom maps instead of failing the export. - Support filtered house exports. - Report warnings for missing or failed static map entries. - Emit aligned MINIMAP and sprite-based SATELLITE assets for the documented scales, including the 1/16 layer. - Keep Cyclopedia export progress in the status bar instead of using a blocking modal progress dialog. Performance: - Precompute floor and chunk plans for global map exports. - Write BMP output directly. - Reuse minimap renders for matching satellite assets. - Parallelize asset hash and LZMA encoding through a bounded worker queue. - Remove modal progress overhead from the export path. - Revert the tile-grid satellite optimization after profiling showed it shifted cost without improving total export time. Documentation: - Document the export contract in docs/static-data.md. - Add docs/cyclopedia-export-roadmap.md with deferred optimization candidates and follow-up notes. Scope: - Focus this change on the Cyclopedia/staticdata protobuf export path and the export-specific performance work needed for practical global map exports. - Move unrelated runtime, performance, and UI experiments out of this branch. Validation: - Ran static inspection and git diff checks during the export changes. - Reviewed Visual Studio CPU profiles after each global map export performance pass. - Verified hash and LZMA work moved into bounded async workers. - Verified the restore action is labeled as restore and grouped under File > Client Assets, not File > Export. This adds the editor-side pipeline needed to generate client Cyclopedia assets from a loaded map while keeping the export flow recoverable, documented, and practical for large maps.
904 lines
17 KiB
C++
904 lines
17 KiB
C++
//////////////////////////////////////////////////////////////////////
|
|
// This file is part of Remere's Map Editor
|
|
//////////////////////////////////////////////////////////////////////
|
|
// Remere's Map Editor 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 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// Remere's Map Editor 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
|
//////////////////////////////////////////////////////////////////////
|
|
|
|
#include "main.h"
|
|
|
|
#include "brush.h"
|
|
|
|
#include "tile.h"
|
|
#include "monster.h"
|
|
#include "house.h"
|
|
#include "basemap.h"
|
|
#include "spawn_monster.h"
|
|
#include "ground_brush.h"
|
|
#include "wall_brush.h"
|
|
#include "carpet_brush.h"
|
|
#include "table_brush.h"
|
|
#include "graphics.h"
|
|
#include "npc.h"
|
|
#include "spawn_npc.h"
|
|
#include "object_pool.h"
|
|
|
|
void* Tile::operator new(size_t size) {
|
|
return rme::allocatePooledObject(size);
|
|
}
|
|
|
|
void Tile::operator delete(void* ptr) noexcept {
|
|
rme::deallocatePooledObject(ptr);
|
|
}
|
|
|
|
#ifdef DEBUG_MEM
|
|
void* Tile::operator new(size_t size, const char*, int) {
|
|
return rme::allocatePooledObject(size);
|
|
}
|
|
|
|
void Tile::operator delete(void* ptr, const char*, int) noexcept {
|
|
rme::deallocatePooledObject(ptr);
|
|
}
|
|
#endif
|
|
|
|
Tile::Tile(int x, int y, int z) :
|
|
location(nullptr),
|
|
ground(nullptr),
|
|
spawnMonster(nullptr),
|
|
npc(nullptr),
|
|
spawnNpc(nullptr),
|
|
house_id(0),
|
|
mapflags(0),
|
|
statflags(0),
|
|
minimapColor(INVALID_MINIMAP_COLOR) {
|
|
////
|
|
}
|
|
|
|
Tile::Tile(TileLocation &loc) :
|
|
location(&loc),
|
|
ground(nullptr),
|
|
spawnMonster(nullptr),
|
|
npc(nullptr),
|
|
spawnNpc(nullptr),
|
|
house_id(0),
|
|
mapflags(0),
|
|
statflags(0),
|
|
minimapColor(INVALID_MINIMAP_COLOR) {
|
|
////
|
|
}
|
|
|
|
Tile::~Tile() {
|
|
while (!items.empty()) {
|
|
delete items.back();
|
|
items.pop_back();
|
|
}
|
|
|
|
while (!monsters.empty()) {
|
|
delete monsters.back();
|
|
monsters.pop_back();
|
|
}
|
|
// printf("%d,%d,%d,%p\n", tilePos.x, tilePos.y, tilePos.z, ground);
|
|
delete ground;
|
|
delete spawnMonster;
|
|
delete npc;
|
|
delete spawnNpc;
|
|
}
|
|
|
|
Tile* Tile::deepCopy(BaseMap &map) const {
|
|
Tile* copy = map.allocator.allocateTile(location);
|
|
copy->flags = flags;
|
|
copy->house_id = house_id;
|
|
if (spawnMonster) {
|
|
copy->spawnMonster = spawnMonster->deepCopy();
|
|
}
|
|
if (spawnNpc) {
|
|
copy->spawnNpc = spawnNpc->deepCopy();
|
|
}
|
|
if (npc) {
|
|
copy->npc = npc->deepCopy();
|
|
}
|
|
// Spawncount & exits are not transferred on copy!
|
|
if (ground) {
|
|
copy->ground = ground->deepCopy();
|
|
}
|
|
|
|
for (const auto monster : monsters) {
|
|
copy->monsters.emplace_back(monster->deepCopy());
|
|
}
|
|
for (const Item* item : items) {
|
|
copy->items.push_back(item->deepCopy());
|
|
}
|
|
for (unsigned int zone : zones) {
|
|
copy->zones.insert(zone);
|
|
}
|
|
return copy;
|
|
}
|
|
|
|
uint32_t Tile::memsize() const {
|
|
uint32_t mem = sizeof(*this);
|
|
if (ground) {
|
|
mem += ground->memsize();
|
|
}
|
|
|
|
for (const Item* item : items) {
|
|
mem += item->memsize();
|
|
}
|
|
|
|
mem += sizeof(Item*) * items.capacity();
|
|
|
|
return mem;
|
|
}
|
|
|
|
int Tile::size() const {
|
|
int sz = 0;
|
|
if (ground) {
|
|
++sz;
|
|
}
|
|
sz += items.size();
|
|
sz += monsters.size();
|
|
if (spawnMonster) {
|
|
++sz;
|
|
}
|
|
if (npc) {
|
|
++sz;
|
|
}
|
|
if (spawnNpc) {
|
|
++sz;
|
|
}
|
|
if (location) {
|
|
if (location->getHouseExits()) {
|
|
++sz;
|
|
}
|
|
if (location->getSpawnMonsterCount()) {
|
|
++sz;
|
|
}
|
|
if (location->getSpawnNpcCount()) {
|
|
++sz;
|
|
}
|
|
if (location->getWaypointCount()) {
|
|
++sz;
|
|
}
|
|
}
|
|
return sz;
|
|
}
|
|
|
|
void Tile::merge(Tile* other) {
|
|
|
|
if (!other) {
|
|
return;
|
|
}
|
|
|
|
if (other->isPZ()) {
|
|
setPZ(true);
|
|
}
|
|
if (other->house_id) {
|
|
house_id = other->house_id;
|
|
}
|
|
|
|
if (other->ground) {
|
|
delete ground;
|
|
ground = other->ground;
|
|
other->ground = nullptr;
|
|
}
|
|
|
|
if (other->spawnMonster) {
|
|
delete spawnMonster;
|
|
spawnMonster = other->spawnMonster;
|
|
other->spawnMonster = nullptr;
|
|
}
|
|
|
|
if (other->npc) {
|
|
delete npc;
|
|
npc = other->npc;
|
|
other->npc = nullptr;
|
|
}
|
|
|
|
if (other->spawnNpc) {
|
|
delete spawnNpc;
|
|
spawnNpc = other->spawnNpc;
|
|
other->spawnNpc = nullptr;
|
|
}
|
|
|
|
for (const auto monster : other->monsters) {
|
|
addMonster(monster);
|
|
}
|
|
other->monsters.clear();
|
|
|
|
for (Item* item : other->items) {
|
|
addItem(item);
|
|
}
|
|
other->items.clear();
|
|
}
|
|
|
|
bool Tile::hasProperty(enum ITEMPROPERTY prop) const {
|
|
if (prop == PROTECTIONZONE && isPZ()) {
|
|
return true;
|
|
}
|
|
|
|
if (ground && ground->hasProperty(prop)) {
|
|
return true;
|
|
}
|
|
|
|
for (const Item* item : items) {
|
|
if (item->hasProperty(prop)) {
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
uint16_t Tile::getGroundSpeed() const noexcept {
|
|
if (ground && !ground->isMetaItem()) {
|
|
return ground->getGroundSpeed();
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int Tile::getIndexOf(Item* item) const {
|
|
if (!item) {
|
|
return wxNOT_FOUND;
|
|
}
|
|
|
|
int index = 0;
|
|
if (ground) {
|
|
if (ground == item) {
|
|
return index;
|
|
}
|
|
index++;
|
|
}
|
|
|
|
if (!items.empty()) {
|
|
auto it = std::find(items.begin(), items.end(), item);
|
|
if (it != items.end()) {
|
|
index += (it - items.begin());
|
|
return index;
|
|
}
|
|
}
|
|
return wxNOT_FOUND;
|
|
}
|
|
|
|
Item* Tile::getTopItem() const {
|
|
if (!items.empty() && !items.back()->isMetaItem()) {
|
|
return items.back();
|
|
}
|
|
if (ground && !ground->isMetaItem()) {
|
|
return ground;
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
Item* Tile::getItemAt(int index) const {
|
|
if (index < 0) {
|
|
return nullptr;
|
|
}
|
|
if (ground) {
|
|
if (index == 0) {
|
|
return ground;
|
|
}
|
|
index--;
|
|
}
|
|
if (!items.empty() && index >= 0 && index < items.size()) {
|
|
return items.at(index);
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
void Tile::addMonster(Monster* monster) {
|
|
if (!monster) {
|
|
return;
|
|
}
|
|
|
|
monsters.emplace_back(monster);
|
|
|
|
if (monster->isSelected()) {
|
|
statflags |= TILESTATE_SELECTED;
|
|
}
|
|
}
|
|
|
|
void Tile::addItem(Item* item) {
|
|
if (!item) {
|
|
return;
|
|
}
|
|
|
|
addItem(item, item->getItemType());
|
|
}
|
|
|
|
namespace {
|
|
FORCEINLINE ItemVector::iterator findBottomInsertPosition(ItemVector &items, int topOrder) {
|
|
return std::find_if(items.begin(), items.end(), [topOrder](const Item* existingItem) {
|
|
const ItemType &existingType = existingItem->getItemType();
|
|
return !existingType.alwaysOnBottom || topOrder < existingType.alwaysOnTopOrder;
|
|
});
|
|
}
|
|
}
|
|
|
|
void Tile::addItem(Item* item, const ItemType &type) {
|
|
if (!item) {
|
|
return;
|
|
}
|
|
if (type.isGroundTile()) {
|
|
// printf("ADDING GROUND\n");
|
|
delete ground;
|
|
ground = item;
|
|
return;
|
|
}
|
|
|
|
if (items.empty()) {
|
|
constexpr size_t initialTileItemCapacity = 4;
|
|
items.reserve(initialTileItemCapacity);
|
|
}
|
|
|
|
ItemVector::iterator it;
|
|
|
|
uint16_t gid = type.ground_equivalent;
|
|
if (gid != 0) {
|
|
delete ground;
|
|
ground = Item::Create(gid);
|
|
// At the very bottom!
|
|
it = items.begin();
|
|
} else {
|
|
if (type.alwaysOnBottom) {
|
|
it = findBottomInsertPosition(items, type.alwaysOnTopOrder);
|
|
} else {
|
|
items.emplace_back(item);
|
|
|
|
if (item->isSelected()) {
|
|
statflags |= TILESTATE_SELECTED;
|
|
}
|
|
return;
|
|
}
|
|
}
|
|
|
|
items.insert(it, item);
|
|
|
|
if (item->isSelected()) {
|
|
statflags |= TILESTATE_SELECTED;
|
|
}
|
|
}
|
|
|
|
void Tile::addLoadedItem(Item* item, const ItemType &type) {
|
|
if (!item) {
|
|
return;
|
|
}
|
|
|
|
const bool createsGroundEquivalent = !type.isGroundTile() && type.ground_equivalent != 0;
|
|
addItem(item, type);
|
|
|
|
if (type.isGroundTile()) {
|
|
updateStateForItem(item, type);
|
|
return;
|
|
}
|
|
|
|
if (createsGroundEquivalent && ground) {
|
|
updateStateForItem(ground, ground->getItemType());
|
|
}
|
|
updateStateForItem(item, type);
|
|
}
|
|
|
|
bool Tile::removeItem(const Item* item) {
|
|
for (auto it = items.begin(); it != items.end(); ++it) {
|
|
if (*it == item) {
|
|
delete *it;
|
|
items.erase(it);
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
void Tile::clearGround() {
|
|
delete ground;
|
|
ground = nullptr;
|
|
}
|
|
|
|
void Tile::replaceGround(Item* newGround) {
|
|
delete ground;
|
|
ground = newGround;
|
|
}
|
|
|
|
void Tile::clearMonsters() {
|
|
for (Monster* m : monsters) {
|
|
delete m;
|
|
}
|
|
monsters.clear();
|
|
}
|
|
|
|
void Tile::clearSpawnMonster() {
|
|
delete spawnMonster;
|
|
spawnMonster = nullptr;
|
|
}
|
|
|
|
void Tile::select() {
|
|
if (size() == 0) {
|
|
return;
|
|
}
|
|
if (ground) {
|
|
ground->select();
|
|
}
|
|
if (spawnMonster) {
|
|
spawnMonster->select();
|
|
}
|
|
if (spawnNpc) {
|
|
spawnNpc->select();
|
|
}
|
|
if (npc) {
|
|
npc->select();
|
|
}
|
|
|
|
for (const auto monster : monsters) {
|
|
monster->select();
|
|
}
|
|
for (Item* item : items) {
|
|
item->select();
|
|
}
|
|
|
|
statflags |= TILESTATE_SELECTED;
|
|
}
|
|
|
|
void Tile::deselect() {
|
|
if (ground) {
|
|
ground->deselect();
|
|
}
|
|
if (spawnMonster) {
|
|
spawnMonster->deselect();
|
|
}
|
|
if (spawnNpc) {
|
|
spawnNpc->deselect();
|
|
}
|
|
if (npc) {
|
|
npc->deselect();
|
|
}
|
|
|
|
for (const auto monster : monsters) {
|
|
monster->deselect();
|
|
}
|
|
|
|
for (Item* item : items) {
|
|
item->deselect();
|
|
}
|
|
|
|
statflags &= ~TILESTATE_SELECTED;
|
|
}
|
|
|
|
Monster* Tile::getTopMonster() const {
|
|
return !monsters.empty() ? monsters.back() : nullptr;
|
|
}
|
|
|
|
std::vector<Monster*> Tile::popSelectedMonsters() {
|
|
std::vector<Monster*> popMonsters;
|
|
|
|
std::erase_if(monsters, [&](const auto monster) {
|
|
if (monster->isSelected()) {
|
|
popMonsters.emplace_back(monster);
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
});
|
|
|
|
statflags &= ~TILESTATE_SELECTED;
|
|
return popMonsters;
|
|
}
|
|
|
|
std::vector<Monster*> Tile::getSelectedMonsters() {
|
|
std::vector<Monster*> selectedMonters;
|
|
std::copy_if(monsters.begin(), monsters.end(), std::back_inserter(selectedMonters), [](const auto monster) {
|
|
return monster->isSelected();
|
|
});
|
|
|
|
return selectedMonters;
|
|
}
|
|
|
|
bool Tile::isMonsterRepeated(const std::string &searchMonster) const {
|
|
return std::ranges::find_if(monsters, [&](const auto monster) {
|
|
return monster->getTypeName() == searchMonster;
|
|
})
|
|
!= monsters.end();
|
|
}
|
|
|
|
Item* Tile::getTopSelectedItem() {
|
|
for (auto it = items.rbegin(); it != items.rend(); ++it) {
|
|
if ((*it)->isSelected() && !(*it)->isMetaItem()) {
|
|
return *it;
|
|
}
|
|
}
|
|
if (ground && ground->isSelected() && !ground->isMetaItem()) {
|
|
return ground;
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
ItemVector Tile::popSelectedItems(bool ignoreTileSelected) {
|
|
ItemVector pop_items;
|
|
|
|
if (!ignoreTileSelected && !isSelected()) {
|
|
return pop_items;
|
|
}
|
|
|
|
if (ground && ground->isSelected()) {
|
|
pop_items.push_back(ground);
|
|
ground = nullptr;
|
|
}
|
|
|
|
for (auto it = items.begin(); it != items.end();) {
|
|
Item* item = (*it);
|
|
if (item->isSelected()) {
|
|
pop_items.push_back(item);
|
|
it = items.erase(it);
|
|
} else {
|
|
++it;
|
|
}
|
|
}
|
|
|
|
statflags &= ~TILESTATE_SELECTED;
|
|
return pop_items;
|
|
}
|
|
|
|
ItemVector Tile::getSelectedItems() {
|
|
ItemVector selected_items;
|
|
|
|
if (!isSelected()) {
|
|
return selected_items;
|
|
}
|
|
|
|
if (ground && ground->isSelected()) {
|
|
selected_items.push_back(ground);
|
|
}
|
|
|
|
for (Item* item : items) {
|
|
if (item->isSelected()) {
|
|
selected_items.push_back(item);
|
|
}
|
|
}
|
|
|
|
return selected_items;
|
|
}
|
|
|
|
uint8_t Tile::getMiniMapColor() const {
|
|
if (minimapColor != INVALID_MINIMAP_COLOR) {
|
|
return minimapColor;
|
|
}
|
|
|
|
for (auto it = items.rbegin(); it != items.rend(); ++it) {
|
|
uint8_t color = (*it)->getMiniMapColor();
|
|
if (color != 0) {
|
|
return color;
|
|
}
|
|
}
|
|
|
|
// check ground too
|
|
if (hasGround()) {
|
|
return ground->getMiniMapColor();
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
void Tile::updateStateForItem(const Item* item, const ItemType &type) {
|
|
if (item->isSelected()) {
|
|
statflags |= TILESTATE_SELECTED;
|
|
}
|
|
if (item->getUniqueID() != 0) {
|
|
statflags |= TILESTATE_UNIQUE;
|
|
}
|
|
if (type.sprite) {
|
|
const uint8_t color = type.sprite->getMiniMapColor();
|
|
if (color != 0) {
|
|
minimapColor = color;
|
|
}
|
|
}
|
|
if (type.unpassable) {
|
|
statflags |= TILESTATE_BLOCKING;
|
|
}
|
|
if (type.isOptionalBorder) {
|
|
statflags |= TILESTATE_OP_BORDER;
|
|
}
|
|
if (type.isTable) {
|
|
statflags |= TILESTATE_HAS_TABLE;
|
|
}
|
|
if (type.isCarpet) {
|
|
statflags |= TILESTATE_HAS_CARPET;
|
|
}
|
|
}
|
|
|
|
void Tile::finalizeLoadedState() {
|
|
if ((statflags & TILESTATE_BLOCKING) == 0 && !ground && items.empty()) {
|
|
statflags |= TILESTATE_BLOCKING;
|
|
}
|
|
}
|
|
|
|
void Tile::update() {
|
|
statflags &= TILESTATE_MODIFIED;
|
|
minimapColor = INVALID_MINIMAP_COLOR;
|
|
|
|
if (spawnMonster && spawnMonster->isSelected()) {
|
|
statflags |= TILESTATE_SELECTED;
|
|
}
|
|
if (spawnNpc && spawnNpc->isSelected()) {
|
|
statflags |= TILESTATE_SELECTED;
|
|
}
|
|
if (!monsters.empty()) {
|
|
for (const auto monster : monsters) {
|
|
if (monster->isSelected()) {
|
|
statflags |= TILESTATE_SELECTED;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if (npc && npc->isSelected()) {
|
|
statflags |= TILESTATE_SELECTED;
|
|
}
|
|
|
|
if (ground) {
|
|
const ItemType &groundType = ground->getItemType();
|
|
if (ground->isSelected()) {
|
|
statflags |= TILESTATE_SELECTED;
|
|
}
|
|
if (groundType.unpassable) {
|
|
statflags |= TILESTATE_BLOCKING;
|
|
}
|
|
if (ground->getUniqueID() != 0) {
|
|
statflags |= TILESTATE_UNIQUE;
|
|
}
|
|
if (groundType.sprite) {
|
|
const uint8_t color = groundType.sprite->getMiniMapColor();
|
|
if (color != 0) {
|
|
minimapColor = color;
|
|
}
|
|
}
|
|
}
|
|
|
|
for (const Item* item : items) {
|
|
const ItemType &type = item->getItemType();
|
|
|
|
if (item->isSelected()) {
|
|
statflags |= TILESTATE_SELECTED;
|
|
}
|
|
if (item->getUniqueID() != 0) {
|
|
statflags |= TILESTATE_UNIQUE;
|
|
}
|
|
if (type.sprite) {
|
|
const uint8_t color = type.sprite->getMiniMapColor();
|
|
if (color != 0) {
|
|
minimapColor = color;
|
|
}
|
|
}
|
|
|
|
if (type.unpassable) {
|
|
statflags |= TILESTATE_BLOCKING;
|
|
}
|
|
if (type.isOptionalBorder) {
|
|
statflags |= TILESTATE_OP_BORDER;
|
|
}
|
|
if (type.isTable) {
|
|
statflags |= TILESTATE_HAS_TABLE;
|
|
}
|
|
if (type.isCarpet) {
|
|
statflags |= TILESTATE_HAS_CARPET;
|
|
}
|
|
}
|
|
|
|
if ((statflags & TILESTATE_BLOCKING) == 0) {
|
|
if (!ground && items.empty()) {
|
|
statflags |= TILESTATE_BLOCKING;
|
|
}
|
|
}
|
|
}
|
|
|
|
void Tile::borderize(BaseMap* parent) {
|
|
GroundBrush::doBorders(parent, this);
|
|
}
|
|
|
|
void Tile::addBorderItem(Item* item) {
|
|
if (!item) {
|
|
return;
|
|
}
|
|
ASSERT(item->isBorder());
|
|
items.insert(items.begin(), item);
|
|
}
|
|
|
|
GroundBrush* Tile::getGroundBrush() const {
|
|
if (ground && ground->getGroundBrush()) {
|
|
return ground->getGroundBrush();
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
void Tile::cleanBorders() {
|
|
if (items.empty()) {
|
|
return;
|
|
}
|
|
|
|
for (auto it = items.begin(); it != items.end();) {
|
|
Item* item = (*it);
|
|
// Borders should only be on the bottom, we can ignore the rest of the items
|
|
if (!item->isBorder()) {
|
|
break;
|
|
}
|
|
|
|
delete item;
|
|
it = items.erase(it);
|
|
}
|
|
}
|
|
|
|
void Tile::wallize(BaseMap* parent) {
|
|
WallBrush::doWalls(parent, this);
|
|
}
|
|
|
|
Item* Tile::getWall() const {
|
|
for (Item* item : items) {
|
|
if (item->isWall()) {
|
|
return item;
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
Item* Tile::getCarpet() const {
|
|
for (Item* item : items) {
|
|
if (item->isCarpet()) {
|
|
return item;
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
Item* Tile::getTable() const {
|
|
for (Item* item : items) {
|
|
if (item->isTable()) {
|
|
return item;
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
void Tile::addWallItem(Item* item) {
|
|
if (!item) {
|
|
return;
|
|
}
|
|
ASSERT(item->isWall());
|
|
|
|
addItem(item);
|
|
}
|
|
|
|
void Tile::cleanWalls(bool dontdelete) {
|
|
if (items.empty()) {
|
|
return;
|
|
}
|
|
|
|
for (auto it = items.begin(); it != items.end();) {
|
|
Item* item = (*it);
|
|
if (item && item->isWall()) {
|
|
if (!dontdelete) {
|
|
delete item;
|
|
}
|
|
it = items.erase(it);
|
|
} else {
|
|
++it;
|
|
}
|
|
}
|
|
}
|
|
|
|
void Tile::cleanWalls(WallBrush* brush) {
|
|
ItemVector::iterator it;
|
|
|
|
for (auto it = items.begin(); it != items.end();) {
|
|
Item* item = (*it);
|
|
if (item && item->isWall() && brush->hasWall(item)) {
|
|
delete item;
|
|
it = items.erase(it);
|
|
} else {
|
|
++it;
|
|
}
|
|
}
|
|
}
|
|
|
|
void Tile::cleanTables(bool dontdelete) {
|
|
if (items.empty()) {
|
|
return;
|
|
}
|
|
|
|
for (auto it = items.begin(); it != items.end();) {
|
|
Item* item = (*it);
|
|
if (item && item->isTable()) {
|
|
if (!dontdelete) {
|
|
delete item;
|
|
}
|
|
it = items.erase(it);
|
|
} else {
|
|
++it;
|
|
}
|
|
}
|
|
}
|
|
|
|
void Tile::tableize(BaseMap* parent) {
|
|
TableBrush::doTables(parent, this);
|
|
}
|
|
|
|
void Tile::carpetize(BaseMap* parent) {
|
|
CarpetBrush::doCarpets(parent, this);
|
|
}
|
|
|
|
void Tile::selectGround() {
|
|
bool selected = false;
|
|
if (ground) {
|
|
ground->select();
|
|
selected = true;
|
|
}
|
|
ItemVector::iterator it;
|
|
|
|
for (Item* item : items) {
|
|
if (!item->isBorder()) {
|
|
break;
|
|
}
|
|
item->select();
|
|
selected = true;
|
|
}
|
|
|
|
if (selected) {
|
|
statflags |= TILESTATE_SELECTED;
|
|
}
|
|
}
|
|
|
|
void Tile::deselectGround() {
|
|
if (ground) {
|
|
ground->deselect();
|
|
}
|
|
for (Item* item : items) {
|
|
if (!item->isBorder()) {
|
|
break;
|
|
}
|
|
|
|
item->deselect();
|
|
}
|
|
}
|
|
|
|
void Tile::setHouse(House* house) {
|
|
house_id = (house ? house->id : 0);
|
|
}
|
|
|
|
void Tile::addHouseExit(House* house) {
|
|
if (!house) {
|
|
return;
|
|
}
|
|
|
|
HouseExitList* exits = location->createHouseExits();
|
|
exits->push_back(house->id);
|
|
}
|
|
|
|
void Tile::removeHouseExit(House* house) {
|
|
if (!house) {
|
|
return;
|
|
}
|
|
|
|
HouseExitList* exits = location->getHouseExits();
|
|
if (!exits || exits->empty()) {
|
|
return;
|
|
}
|
|
|
|
auto it = std::find(exits->begin(), exits->end(), house->id);
|
|
if (it != exits->end()) {
|
|
exits->erase(it);
|
|
}
|
|
}
|
|
|
|
bool Tile::hasHouseExit(uint32_t houseId) const {
|
|
const HouseExitList* exits = getHouseExits();
|
|
if (!exits || exits->empty()) {
|
|
return false;
|
|
}
|
|
|
|
auto it = std::find(exits->begin(), exits->end(), houseId);
|
|
return it != exits->end();
|
|
}
|