/* * ObstaclePlacer.cpp, part of VCMI engine * * Authors: listed in file AUTHORS in main folder * * License: GNU General Public License v2.0 or later * Full text of license available in license.txt file, in main folder * */ #include "StdInc.h" #include "../mapObjects/CObjectClassesHandler.h" #include "ObstaclePlacer.h" #include "ObjectManager.h" #include "TreasurePlacer.h" #include "RockPlacer.h" #include "WaterRoutes.h" #include "WaterProxy.h" #include "RoadPlacer.h" #include "RiverPlacer.h" #include "RmgMap.h" #include "CMapGenerator.h" #include "../CRandomGenerator.h" #include "Functions.h" #include "../mapping/CMapEditManager.h" VCMI_LIB_NAMESPACE_BEGIN void ObstacleProxy::collectPossibleObstacles(TerrainId terrain) { //get all possible obstacles for this terrain for(auto primaryID : VLC->objtypeh->knownObjects()) { for(auto secondaryID : VLC->objtypeh->knownSubObjects(primaryID)) { auto handler = VLC->objtypeh->getHandlerFor(primaryID, secondaryID); if(handler->isStaticObject()) { for(const auto & temp : handler->getTemplates()) { if(temp->canBePlacedAt(terrain) && temp->getBlockMapOffset().valid()) obstaclesBySize[temp->getBlockedOffsets().size()].push_back(temp); } } } } for(const auto & o : obstaclesBySize) { possibleObstacles.emplace_back(o); } boost::sort(possibleObstacles, [](const ObstaclePair &p1, const ObstaclePair &p2) -> bool { return p1.first > p2.first; //bigger obstacles first }); } int ObstacleProxy::getWeightedObjects(const int3 & tile, const CMap * map, CRandomGenerator & rand, std::list & allObjects, std::vector> & weightedObjects) { int maxWeight = std::numeric_limits::min(); for(auto & possibleObstacle : possibleObstacles) { if(!possibleObstacle.first) continue; auto shuffledObstacles = possibleObstacle.second; RandomGeneratorUtil::randomShuffle(shuffledObstacles, rand); for(const auto & temp : shuffledObstacles) { auto handler = VLC->objtypeh->getHandlerFor(temp->id, temp->subid); auto * obj = handler->create(temp); allObjects.emplace_back(*obj); rmg::Object * rmgObject = &allObjects.back(); for(const auto & offset : obj->getBlockedOffsets()) { rmgObject->setPosition(tile - offset); if(!map->isInTheMap(rmgObject->getPosition())) continue; if(!rmgObject->getArea().getSubarea([map](const int3 & t) { return !map->isInTheMap(t); }).empty()) continue; if(isProhibited(rmgObject->getArea())) continue; int coverageBlocked = 0; int coveragePossible = 0; //do not use area intersection in optimization purposes for(const auto & t : rmgObject->getArea().getTilesVector()) { auto coverage = verifyCoverage(t); if(coverage.first) ++coverageBlocked; if(coverage.second) ++coveragePossible; } int coverageOverlap = possibleObstacle.first - coverageBlocked - coveragePossible; int weight = possibleObstacle.first + coverageBlocked - coverageOverlap * possibleObstacle.first; assert(coverageOverlap >= 0); if(weight > maxWeight) { weightedObjects.clear(); maxWeight = weight; weightedObjects.emplace_back(rmgObject, rmgObject->getPosition()); if(weight > 0) break; } else if(weight == maxWeight) weightedObjects.emplace_back(rmgObject, rmgObject->getPosition()); } } if(maxWeight > 0) break; } return maxWeight; } void ObstacleProxy::placeObstacles(CMap * map, CRandomGenerator & rand) { //reverse order, since obstacles begin in bottom-right corner, while the map coordinates begin in top-left auto blockedTiles = blockedArea.getTilesVector(); int tilePos = 0; std::set objs; while(!blockedArea.empty() && tilePos < blockedArea.getTilesVector().size()) { auto tile = blockedArea.getTilesVector()[tilePos]; std::list allObjects; std::vector> weightedObjects; int maxWeight = getWeightedObjects(tile, map, rand, allObjects, weightedObjects); if(weightedObjects.empty()) { tilePos += 1; continue; } auto objIter = RandomGeneratorUtil::nextItem(weightedObjects, rand); objIter->first->setPosition(objIter->second); placeObject(*objIter->first, objs); blockedArea.subtract(objIter->first->getArea()); tilePos = 0; postProcess(*objIter->first); if(maxWeight < 0) logGlobal->warn("Placed obstacle with negative weight at %s", objIter->second.toString()); for(auto & o : allObjects) { if(&o != objIter->first) o.clear(); } } finalInsertion(map->getEditManager(), objs); } void ObstacleProxy::finalInsertion(CMapEditManager * manager, std::set & instances) { manager->insertObjects(instances); //insert as one operation - for undo purposes } std::pair ObstacleProxy::verifyCoverage(const int3 & t) const { return {blockedArea.contains(t), false}; } void ObstacleProxy::placeObject(rmg::Object & object, std::set & instances) { for (auto * instance : object.instances()) { instances.insert(&instance->object()); } } void ObstacleProxy::postProcess(const rmg::Object & object) { } bool ObstacleProxy::isProhibited(const rmg::Area & objArea) const { return false; } void ObstaclePlacer::process() { manager = zone.getModificator(); if(!manager) return; riverManager = zone.getModificator(); collectPossibleObstacles(zone.getTerrainType()); blockedArea = zone.area().getSubarea([this](const int3 & t) { return map.shouldBeBlocked(t); }); blockedArea.subtract(zone.areaUsed()); zone.areaPossible().subtract(blockedArea); prohibitedArea = zone.freePaths() + zone.areaUsed() + manager->getVisitableArea(); placeObstacles(&map.map(), generator.rand); } void ObstaclePlacer::init() { DEPENDENCY(ObjectManager); DEPENDENCY(TreasurePlacer); DEPENDENCY(WaterRoutes); DEPENDENCY(WaterProxy); DEPENDENCY(RoadPlacer); DEPENDENCY_ALL(RockPlacer); } std::pair ObstaclePlacer::verifyCoverage(const int3 & t) const { return {map.shouldBeBlocked(t), zone.areaPossible().contains(t)}; } void ObstaclePlacer::placeObject(rmg::Object & object, std::set &) { manager->placeObject(object, false, false); } void ObstaclePlacer::postProcess(const rmg::Object & object) { //river processing if(riverManager) { const auto objTypeName = object.instances().front()->object().typeName; if(objTypeName == "mountain") riverManager->riverSource().unite(object.getArea()); else if(objTypeName == "lake") riverManager->riverSink().unite(object.getArea()); } } bool ObstaclePlacer::isProhibited(const rmg::Area & objArea) const { if(prohibitedArea.overlap(objArea)) return true; if(!zone.area().contains(objArea)) return true; return false; } void ObstaclePlacer::finalInsertion(CMapEditManager *, std::set &) { } VCMI_LIB_NAMESPACE_END