| Old revision #phnkvt9ud | New revision #pslvkynrl | ||
|---|---|---|---|
| 45 | 45 | ||
| 46 | /* Functions to calculate distances */ | 46 | /* Functions to calculate distances */ |
| 47 | uint DistanceManhattan(TileIndex, TileIndex); ///< also known as L1-Norm. Is the shortest distance one could go over diagonal tracks (or roads) | 47 | uint DistanceManhattan(TileIndex, TileIndex); ///< also known as L1-Norm. Is the shortest distance one could go over diagonal tracks (or roads) |
| 48 | +uint DistanceManhattan_dp_(TileIndex | 48 | +uint DistanceManhattan_dp_(TileIndex, TileIndex); ///< _dp_ |
| 49 | uint DistanceSquare(TileIndex, TileIndex); ///< euclidian- or L2-Norm squared | 49 | uint DistanceSquare(TileIndex, TileIndex); ///< euclidian- or L2-Norm squared |
| 50 | uint DistanceMax(TileIndex, TileIndex); ///< also known as L-Infinity-Norm | 50 | uint DistanceMax(TileIndex, TileIndex); ///< also known as L-Infinity-Norm |
| 51 | uint DistanceMaxPlusManhattan(TileIndex, TileIndex); ///< Max + Manhattan | 51 | uint DistanceMaxPlusManhattan(TileIndex, TileIndex); ///< Max + Manhattan |