| Age | Commit message (Collapse) | Author |
|---|
|
|
|
|
|
|
|
GetElement() method.
|
|
|
|
|
|
|
|
|
|
|
|
temporary THISBIN_HEAP_ARR macro.
|
|
around the binary heap data.
|
|
|
|
some headers
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
consisted of unrelated values use static const (u)int
|
|
consisted of unrelated values use static const (u)int
|
|
|
|
passed bit variable, i.e. allow expressions as parameter
|
|
|
|
|
|
finding the closest depot
|
|
|
|
if a header require a header make it include that header
|
|
|
|
entering a signal block via a 'block' signal. This way you won't get double penalties, both red signals and reservation costs, for the block signalled tracks
|
|
|
|
tile won't make a dent, 3 tiles might be a bit too much
-Feature-ish: make maximum pathfinder penalties for finding depots customisable, also increase it slightly to 20 tiles worth of penalties.
|
|
reachable waypoint tile if the closest one is free but there is no safe waiting point directly after it. Now check for a free safe waiting point beyond the waypoint unless there are junctions before the first safe waiting point.
|
|
-Feature: make penalty for road stop occupancy user configurable
-Fix [FS#1944]: road vehicles would not pick an empty drive through stop. Now they will *if* the penalty for driving around is less than the occupancy penalty
-Fix [FS#1495]: long (articulated) road vehicles could block loading of others when the following road vehicle already got 'permission' to go to the next bay even when it could not reach it
-Change: improve the throughput of the drive through road stops by letting them stop closer together
|
|
functions
|
|
|
|
'around' stations and use pathfinder penalties to determine to which 'part' to go. Note that the pathfinder penalties for drive through stops are currently only looking at the occupation of the first in a row, but this is to change later on.
|
|
pathfinder_type.h
|
|
CalcClosestStationTile
|
|
|
|
|
|
|
|
pathfinders
|
|
|
|
|
|
a separate directory
|
