Method initNewMap

game/state/rules/battle/battlemap.cpp:1397–1443

}

void BattleMap::initNewMap(sp<Battle> b)
{
	// Init visibility
	for (auto &o : b->participants)
	{
		b->visibleTiles[o] = std::vector<bool>(b->size.x * b->size.y * b->size.z, false);
		b->visibleBlocks[o] = std::vector<bool>(b->losBlocks.size(), false);
		b->visibleUnits[o] = {};
	}

	// Init los block pathfinding

	// Vars
	int size = b->losBlocks.size();
	auto &losBlocks = b->losBlocks;
	auto &linkAvailable = b->linkAvailable;

	// Mark all blocks for update
	b->linkNeedsUpdate = std::vector<bool>(size * size, false);
	b->blockNeedsUpdate = std::vector<bool>(size, true);

	// Init which blocks are adjacent (this never changes)
	linkAvailable = std::vector<bool>(size * size, false);
	for (int i = 0; i < size - 1; i++)
	{
		auto &b1 = *losBlocks[i];
		for (int j = i + 1; j < size; j++)
		{
			auto &b2 = *losBlocks[j];
			if (doTwoSectorsIntersect(
			        b1.start.x, b1.start.y, b1.start.z, b1.end - b1.start + Vec3<int>{1, 1, 1},
			        b2.start.x, b2.start.y, b2.start.z, b2.end - b2.start + Vec3<int>{1, 1, 1}))
			{
				linkAvailable[i + j * size] = true;
				linkAvailable[j + i * size] = true;
			}
		}
	}

	// Init arrays for further use
	for (auto &type : BattleUnitTypeList)
	{
		b->blockAvailable[type] = std::vector<bool>(size, false);
		b->blockCenterPos[type] = std::vector<Vec3<int>>(size, Vec3<int>());
		b->linkCost[type] = std::vector<int>(size * size, -1);
	}
}

void BattleMap::unloadTiles()
{