diff options
| author | matthijs <matthijs@openttd.org> | 2005-09-09 23:14:38 +0000 |
|---|---|---|
| committer | matthijs <matthijs@openttd.org> | 2005-09-09 23:14:38 +0000 |
| commit | 6f45959d1e05a41f1fceb55c72a244942fa98270 (patch) | |
| tree | 2f3cffa2f8a0c0f0c06f6a3666f430e20d0c6957 /map.h | |
| parent | 6bf8644d290bdab23aed0ddc73e80de14301377a (diff) | |
| download | openttd-6f45959d1e05a41f1fceb55c72a244942fa98270.tar.xz | |
(svn r2929) * Move DistanceTrack from map.c to npf.c and rename to NPFDistanceTrack.
* Make NPFDistanceTrack return the distance multiplied by NPF_TILE_LENGTH to prevent rounding
This should make ship and train pathfinding more accurate and faster.
* Update IsEndOfLine to prevent trains from trying to go off a slope onto a tunnel entrance.
Diffstat (limited to 'map.h')
| -rw-r--r-- | map.h | 1 |
1 files changed, 0 insertions, 1 deletions
@@ -144,7 +144,6 @@ uint DistanceManhattan(TileIndex, TileIndex); // also known as L1-Norm. Is the s uint DistanceSquare(TileIndex, TileIndex); // euclidian- or L2-Norm squared uint DistanceMax(TileIndex, TileIndex); // also known as L-Infinity-Norm uint DistanceMaxPlusManhattan(TileIndex, TileIndex); // Max + Manhattan -uint DistanceTrack(TileIndex, TileIndex); // Returns the shortest distance one could go over tracks uint DistanceFromEdge(TileIndex); // shortest distance from any edge of the map |