summaryrefslogtreecommitdiff
path: root/vehicle.h
diff options
context:
space:
mode:
authortron <tron@openttd.org>2005-12-29 12:42:59 +0000
committertron <tron@openttd.org>2005-12-29 12:42:59 +0000
commit246c126d250171bd69f66080dbc25fafef6a46d2 (patch)
tree471052da802f2cc20f631ca0291f7337c78cd45d /vehicle.h
parent1ffc70079787954dda1182de89eca25f36837490 (diff)
downloadopenttd-246c126d250171bd69f66080dbc25fafef6a46d2.tar.xz
(svn r3353) Simplify the automatic length adjustment algorithm for replacing trains: Use the length of the train before the replacement as reference length
Diffstat (limited to 'vehicle.h')
-rw-r--r--vehicle.h8
1 files changed, 0 insertions, 8 deletions
diff --git a/vehicle.h b/vehicle.h
index bb180bec5..6226348d1 100644
--- a/vehicle.h
+++ b/vehicle.h
@@ -78,14 +78,6 @@ typedef struct VehicleRail {
TileIndex pbs_end_tile;
Trackdir pbs_end_trackdir;
- /**
- * stuff to figure out how long a train should be. Used by autoreplace
- * first byte holds the length of the shortest station. Updated each time order 0 is reached
- * last byte is the shortest station reached this round though the orders. It can be invalidated by
- * skip station and alike by setting it to 0. That way we will ensure that a complete loop is used to find the shortest station
- */
- byte shortest_platform[2];
-
// Link between the two ends of a multiheaded engine
Vehicle *other_multiheaded_part;
} VehicleRail;