WaterAdopter.cpp 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261
  1. /*
  2. * WaterAdopter.cpp, part of VCMI engine
  3. *
  4. * Authors: listed in file AUTHORS in main folder
  5. *
  6. * License: GNU General Public License v2.0 or later
  7. * Full text of license available in license.txt file, in main folder
  8. *
  9. */
  10. #include "StdInc.h"
  11. #include "WaterAdopter.h"
  12. #include "CMapGenerator.h"
  13. #include "RmgMap.h"
  14. #include "../mapping/CMap.h"
  15. #include "../mapping/CMapEditManager.h"
  16. #include "../mapObjects/CObjectClassesHandler.h"
  17. #include "RmgPath.h"
  18. #include "RmgObject.h"
  19. #include "ObjectManager.h"
  20. #include "Functions.h"
  21. #include "RoadPlacer.h"
  22. #include "TreasurePlacer.h"
  23. #include "TownPlacer.h"
  24. #include "ConnectionsPlacer.h"
  25. #include "TileInfo.h"
  26. void WaterAdopter::process()
  27. {
  28. createWater(map.getMapGenOptions().getWaterContent());
  29. }
  30. void WaterAdopter::init()
  31. {
  32. //make dependencies
  33. DEPENDENCY_ALL(WaterAdopter);
  34. DEPENDENCY(TownPlacer);
  35. POSTFUNCTION(ConnectionsPlacer);
  36. POSTFUNCTION(TreasurePlacer);
  37. }
  38. void WaterAdopter::createWater(EWaterContent::EWaterContent waterContent)
  39. {
  40. if(waterContent == EWaterContent::NONE || zone.isUnderground() || zone.getType() == ETemplateZoneType::WATER)
  41. return; //do nothing
  42. distanceMap = zone.area().computeDistanceMap(reverseDistanceMap);
  43. //add border tiles as water for ISLANDS
  44. if(waterContent == EWaterContent::ISLANDS)
  45. {
  46. waterArea.unite(collectDistantTiles(zone, zone.getSize() + 1));
  47. waterArea.unite(zone.area().getBorder());
  48. }
  49. //protect some parts from water for NORMAL
  50. if(waterContent == EWaterContent::NORMAL)
  51. {
  52. waterArea.unite(collectDistantTiles(zone, zone.getSize() - 1));
  53. auto sliceStart = RandomGeneratorUtil::nextItem(reverseDistanceMap[0], generator.rand);
  54. auto sliceEnd = RandomGeneratorUtil::nextItem(reverseDistanceMap[0], generator.rand);
  55. //at least 25% without water
  56. bool endPassed = false;
  57. for(int counter = 0; counter < reverseDistanceMap[0].size() / 4 || !endPassed; ++sliceStart, ++counter)
  58. {
  59. if(sliceStart == reverseDistanceMap[0].end())
  60. sliceStart = reverseDistanceMap[0].begin();
  61. if(sliceStart == sliceEnd)
  62. endPassed = true;
  63. noWaterArea.add(*sliceStart);
  64. }
  65. rmg::Area noWaterSlice;
  66. for(int i = 1; i < reverseDistanceMap.size(); ++i)
  67. {
  68. for(auto & t : reverseDistanceMap[i])
  69. {
  70. if(noWaterArea.distanceSqr(t) < 3)
  71. noWaterSlice.add(t);
  72. }
  73. noWaterArea.unite(noWaterSlice);
  74. }
  75. }
  76. //generating some irregularity of coast
  77. int coastIdMax = sqrt(reverseDistanceMap.size()); //size of coastTilesMap shows the most distant tile from water
  78. assert(coastIdMax > 0);
  79. std::list<int3> tilesQueue;
  80. rmg::Tileset tilesChecked;
  81. for(int coastId = coastIdMax; coastId >= 0; --coastId)
  82. {
  83. //amount of iterations shall be proportion of coast perimeter
  84. const int coastLength = reverseDistanceMap[coastId].size() / (coastId + 3);
  85. for(int coastIter = 0; coastIter < coastLength; ++coastIter)
  86. {
  87. int3 tile = *RandomGeneratorUtil::nextItem(reverseDistanceMap[coastId], generator.rand);
  88. if(tilesChecked.find(tile) != tilesChecked.end())
  89. continue;
  90. if(map.isUsed(tile) || map.isFree(tile)) //prevent placing water nearby town
  91. continue;
  92. tilesQueue.push_back(tile);
  93. tilesChecked.insert(tile);
  94. }
  95. }
  96. //if tile is marked as water - connect it with "big" water
  97. while(!tilesQueue.empty())
  98. {
  99. int3 src = tilesQueue.front();
  100. tilesQueue.pop_front();
  101. if(waterArea.contains(src))
  102. continue;
  103. waterArea.add(src);
  104. map.foreach_neighbour(src, [&src, this, &tilesChecked, &tilesQueue](const int3 & dst)
  105. {
  106. if(tilesChecked.count(dst))
  107. return;
  108. if(distanceMap[dst] >= 0 && distanceMap[src] - distanceMap[dst] == 1)
  109. {
  110. tilesQueue.push_back(dst);
  111. tilesChecked.insert(dst);
  112. }
  113. });
  114. }
  115. waterArea.subtract(noWaterArea);
  116. //start filtering of narrow places and coast atrifacts
  117. rmg::Area waterAdd;
  118. for(int coastId = 1; coastId <= coastIdMax; ++coastId)
  119. {
  120. for(auto& tile : reverseDistanceMap[coastId])
  121. {
  122. //collect neighbout water tiles
  123. auto collectionLambda = [this](const int3 & t, std::set<int3> & outCollection)
  124. {
  125. if(waterArea.contains(t))
  126. {
  127. reverseDistanceMap[0].insert(t);
  128. outCollection.insert(t);
  129. }
  130. };
  131. std::set<int3> waterCoastDirect, waterCoastDiag;
  132. map.foreachDirectNeighbour(tile, std::bind(collectionLambda, std::placeholders::_1, std::ref(waterCoastDirect)));
  133. map.foreachDiagonalNeighbour(tile, std::bind(collectionLambda, std::placeholders::_1, std::ref(waterCoastDiag)));
  134. int waterCoastDirectNum = waterCoastDirect.size();
  135. int waterCoastDiagNum = waterCoastDiag.size();
  136. //remove tiles which are mostly covered by water
  137. if(waterCoastDirectNum >= 3)
  138. {
  139. waterAdd.add(tile);
  140. continue;
  141. }
  142. if(waterCoastDiagNum == 4 && waterCoastDirectNum == 2)
  143. {
  144. waterAdd.add(tile);
  145. continue;
  146. }
  147. if(waterCoastDirectNum == 2 && waterCoastDiagNum >= 2)
  148. {
  149. int3 diagSum, dirSum;
  150. for(auto & i : waterCoastDiag)
  151. diagSum += i - tile;
  152. for(auto & i : waterCoastDirect)
  153. dirSum += i - tile;
  154. if(diagSum == int3() || dirSum == int3())
  155. {
  156. waterAdd.add(tile);
  157. continue;
  158. }
  159. if(waterCoastDiagNum == 3 && diagSum != dirSum)
  160. {
  161. waterAdd.add(tile);
  162. continue;
  163. }
  164. }
  165. }
  166. }
  167. waterArea.unite(waterAdd);
  168. //filtering tiny "lakes"
  169. for(auto& tile : reverseDistanceMap[0]) //now it's only coast-water tiles
  170. {
  171. if(!waterArea.contains(tile)) //for ground tiles
  172. continue;
  173. std::vector<int3> groundCoast;
  174. map.foreachDirectNeighbour(tile, [this, &groundCoast](const int3 & t)
  175. {
  176. if(!waterArea.contains(t) && zone.area().contains(t)) //for ground tiles of same zone
  177. {
  178. groundCoast.push_back(t);
  179. }
  180. });
  181. if(groundCoast.size() >= 3)
  182. {
  183. waterArea.erase(tile);
  184. }
  185. else
  186. {
  187. if(groundCoast.size() == 2)
  188. {
  189. if(groundCoast[0] + groundCoast[1] == int3())
  190. {
  191. waterArea.erase(tile);
  192. }
  193. }
  194. }
  195. }
  196. map.getZones()[waterZoneId]->area().unite(waterArea);
  197. zone.area().subtract(waterArea);
  198. zone.areaPossible().subtract(waterArea);
  199. distanceMap = zone.area().computeDistanceMap(reverseDistanceMap);
  200. }
  201. void WaterAdopter::setWaterZone(TRmgTemplateZoneId water)
  202. {
  203. waterZoneId = water;
  204. }
  205. rmg::Area WaterAdopter::getCoastTiles() const
  206. {
  207. if(reverseDistanceMap.empty())
  208. return rmg::Area();
  209. return rmg::Area(reverseDistanceMap.at(0));
  210. }
  211. char WaterAdopter::dump(const int3 & t)
  212. {
  213. if(noWaterArea.contains(t))
  214. return 'X';
  215. if(waterArea.contains(t))
  216. return '~';
  217. auto distanceMapIter = distanceMap.find(t);
  218. if(distanceMapIter != distanceMap.end())
  219. {
  220. if(distanceMapIter->second > 9)
  221. return '%';
  222. auto distStr = std::to_string(distanceMapIter->second);
  223. if(distStr.length() > 0)
  224. return distStr[0];
  225. }
  226. return Modificator::dump(t);
  227. }