summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorNiels Martin Hansen <nielsm@indvikleren.dk>2019-02-18 17:32:53 +0100
committerNiels Martin Hansen <nielsm@indvikleren.dk>2019-03-09 20:27:11 +0100
commit7b56be0f3ac0a0257c10dc7ebe32c1fe95ea6253 (patch)
tree400b6342bf04d500db26fc525c02e2f608feb577 /src
parentd7522e5e8ffa8a922668e8f6f99e1fecbab11dbe (diff)
downloadopenttd-7b56be0f3ac0a0257c10dc7ebe32c1fe95ea6253.tar.xz
Codechange: Make a k-d tree index of towns
Diffstat (limited to 'src')
-rw-r--r--src/misc.cpp3
-rw-r--r--src/saveload/afterload.cpp2
-rw-r--r--src/saveload/town_sl.cpp1
-rw-r--r--src/town.h3
-rw-r--r--src/town_cmd.cpp69
-rw-r--r--src/town_kdtree.h20
6 files changed, 61 insertions, 37 deletions
diff --git a/src/misc.cpp b/src/misc.cpp
index 8151f2dd3..c3130d85b 100644
--- a/src/misc.cpp
+++ b/src/misc.cpp
@@ -28,6 +28,7 @@
#include "core/pool_type.hpp"
#include "game/game.hpp"
#include "linkgraph/linkgraphschedule.h"
+#include "town_kdtree.h"
#include "safeguards.h"
@@ -75,6 +76,8 @@ void InitializeGame(uint size_x, uint size_y, bool reset_date, bool reset_settin
LinkGraphSchedule::Clear();
PoolBase::Clean(PT_NORMAL);
+ RebuildTownKdtree();
+
ResetPersistentNewGRFData();
InitializeSound();
diff --git a/src/saveload/afterload.cpp b/src/saveload/afterload.cpp
index 87e870056..07de26038 100644
--- a/src/saveload/afterload.cpp
+++ b/src/saveload/afterload.cpp
@@ -536,6 +536,8 @@ bool AfterLoadGame()
GamelogTestRevision();
GamelogTestMode();
+ RebuildTownKdtree();
+
if (IsSavegameVersionBefore(SLV_98)) GamelogGRFAddList(_grfconfig);
if (IsSavegameVersionBefore(SLV_119)) {
diff --git a/src/saveload/town_sl.cpp b/src/saveload/town_sl.cpp
index a31c886ec..bc2ed8be6 100644
--- a/src/saveload/town_sl.cpp
+++ b/src/saveload/town_sl.cpp
@@ -28,6 +28,7 @@ void RebuildTownCaches()
{
Town *town;
InitializeBuildingCounts();
+ RebuildTownKdtree();
/* Reset town population and num_houses */
FOR_ALL_TOWNS(town) {
diff --git a/src/town.h b/src/town.h
index 6cff5f761..76c3b770d 100644
--- a/src/town.h
+++ b/src/town.h
@@ -145,6 +145,9 @@ void UpdateAllTownVirtCoords();
void ShowTownViewWindow(TownID town);
void ExpandTown(Town *t);
+void RebuildTownKdtree();
+
+
/**
* Action types that a company must ask permission for to a town authority.
* @see CheckforTownRating
diff --git a/src/town_cmd.cpp b/src/town_cmd.cpp
index 4aad76f44..e56cfd417 100644
--- a/src/town_cmd.cpp
+++ b/src/town_cmd.cpp
@@ -38,6 +38,7 @@
#include "subsidy_func.h"
#include "core/pool_func.hpp"
#include "town.h"
+#include "town_kdtree.h"
#include "townname_func.h"
#include "core/random_func.hpp"
#include "core/backup_type.hpp"
@@ -59,6 +60,20 @@ CargoTypes _town_cargoes_accepted; ///< Bitmap of all cargoes accepted by houses
TownPool _town_pool("Town");
INSTANTIATE_POOL_METHODS(Town)
+
+TownKdtree _town_kdtree(&Kdtree_TownXYFunc);
+
+void RebuildTownKdtree()
+{
+ std::vector<TownID> townids;
+ Town *town;
+ FOR_ALL_TOWNS(town) {
+ townids.push_back(town->index);
+ }
+ _town_kdtree.Build(townids.begin(), townids.end());
+}
+
+
/**
* Check if a town 'owns' a bridge.
* Bridges to not directly have an owner, so we check the tiles adjacent to the bridge ends.
@@ -366,30 +381,9 @@ static void AnimateTile_Town(TileIndex tile)
*/
static bool IsCloseToTown(TileIndex tile, uint dist)
{
- /* On a large map with many towns, it may be faster to check the surroundings of the tile.
- * An iteration in TILE_AREA_LOOP() is generally 2 times faster than one in FOR_ALL_TOWNS(). */
- if (Town::GetNumItems() > (size_t) (dist * dist * 2)) {
- const int tx = TileX(tile);
- const int ty = TileY(tile);
- TileArea tile_area = TileArea(
- TileXY(max(0, tx - (int) dist), max(0, ty - (int) dist)),
- TileXY(min(MapMaxX(), tx + (int) dist), min(MapMaxY(), ty + (int) dist))
- );
- TILE_AREA_LOOP(atile, tile_area) {
- if (GetTileType(atile) == MP_HOUSE) {
- Town *t = Town::GetByTile(atile);
- if (DistanceManhattan(tile, t->xy) < dist) return true;
- }
- }
- return false;
- }
-
- const Town *t;
-
- FOR_ALL_TOWNS(t) {
- if (DistanceManhattan(tile, t->xy) < dist) return true;
- }
- return false;
+ if (_town_kdtree.Count() == 0) return false;
+ Town *t = Town::Get(_town_kdtree.FindNearest(TileX(tile), TileY(tile)));
+ return DistanceManhattan(tile, t->xy) < dist;
}
/**
@@ -1682,6 +1676,8 @@ static void DoCreateTown(Town *t, TileIndex tile, uint32 townnameparts, TownSize
t->grow_counter = t->index % TOWN_GROWTH_TICKS;
t->growth_rate = TownTicksToGameTicks(250);
+ _town_kdtree.Insert(t->index);
+
/* Set the default cargo requirement for town growth */
switch (_settings_game.game_creation.landscape) {
case LT_ARCTIC:
@@ -2092,6 +2088,9 @@ bool GenerateTowns(TownLayout layout)
town_names.clear();
+ /* Build the town k-d tree again to make sure it's well balanced */
+ RebuildTownKdtree();
+
if (current_number != 0) return true;
/* If current_number is still zero at this point, it means that not a single town has been created.
@@ -2867,7 +2866,10 @@ CommandCost CmdDeleteTown(TileIndex tile, DoCommandFlag flags, uint32 p1, uint32
}
/* The town destructor will delete the other things related to the town. */
- if (flags & DC_EXEC) delete t;
+ if (flags & DC_EXEC) {
+ _town_kdtree.Remove(t->index);
+ delete t;
+ }
return CommandCost();
}
@@ -3392,19 +3394,12 @@ CommandCost CheckIfAuthorityAllowsNewStation(TileIndex tile, DoCommandFlag flags
*/
Town *CalcClosestTownFromTile(TileIndex tile, uint threshold)
{
- Town *t;
- uint best = threshold;
- Town *best_town = NULL;
-
- FOR_ALL_TOWNS(t) {
- uint dist = DistanceManhattan(tile, t->xy);
- if (dist < best) {
- best = dist;
- best_town = t;
- }
- }
+ if (Town::GetNumItems() == 0) return NULL;
- return best_town;
+ TownID tid = _town_kdtree.FindNearest(TileX(tile), TileY(tile));
+ Town *town = Town::Get(tid);
+ if (DistanceManhattan(tile, town->xy) < threshold) return town;
+ return NULL;
}
/**
diff --git a/src/town_kdtree.h b/src/town_kdtree.h
new file mode 100644
index 000000000..ae6b9e4ea
--- /dev/null
+++ b/src/town_kdtree.h
@@ -0,0 +1,20 @@
+/*
+ * This file is part of OpenTTD.
+ * OpenTTD 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, version 2.
+ * OpenTTD 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 OpenTTD. If not, see <http://www.gnu.org/licenses/>.
+ */
+
+/** @file town_kdtree.h Declarations for accessing the k-d tree of towns */
+
+#ifndef TOWN_KDTREE_H
+#define TOWN_KDTREE_H
+
+#include "core/kdtree.hpp"
+#include "town.h"
+
+inline uint16 Kdtree_TownXYFunc(TownID tid, int dim) { return (dim == 0) ? TileX(Town::Get(tid)->xy) : TileY(Town::Get(tid)->xy); }
+typedef Kdtree<TownID, decltype(&Kdtree_TownXYFunc), uint16, int> TownKdtree;
+extern TownKdtree _town_kdtree;
+
+#endif