npf.c
changeset 1339 40e00c692996
parent 1338 82951b57204a
child 1452 a978fdcbca3e
--- a/npf.c	Mon Feb 07 18:51:46 2005 +0000
+++ b/npf.c	Mon Feb 07 19:01:56 2005 +0000
@@ -596,7 +596,6 @@
 	 * for ships, since the heuristic will not be to far off then. I hope.
 	 */
 	Queue depots;
-	TileType tiletype = 0;
 	int r;
 	NPFFoundTargetData best_result;
 	NPFFoundTargetData result;
@@ -605,17 +604,6 @@
 	Depot* current;
 	Depot *depot;
 
-
-	/* This is a little ugly, but it works :-S */
-	if (type == TRANSPORT_ROAD)
-		tiletype = MP_STREET;
-	else if (type == TRANSPORT_RAIL)
-		tiletype = MP_RAILWAY;
-	else if (type == TRANSPORT_WATER)
-		tiletype = MP_WATER;
-	else
-		assert(0);
-
 	init_InsSort(&depots);
 	/* Okay, let's find all depots that we can use first */
 	FOR_ALL_DEPOTS(depot) {