| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2021-01-08 | Codechange: Remove min/max functions in favour of STL variants (#8502) | Charles Pigott | |
| 2020-12-25 | Change: [Linkgraph] Allow job threads to be aborted early when clearing ↵ | Jonathan G Rennison | |
| schedule (#8416) When link graph jobs are cleared due to abandoning the game or exiting, flag the job as aborted. The link graph job running in a separate thread checks the aborted flag periodically and terminates processing early if set. This reduces the delay at game abandon or exit if a long-running job would otherwise still be running. | |||
| 2020-01-08 | Codechange: [Linkgraph] Skip MCF source node Dijkstra when all demand satisfied | Jonathan G Rennison | |
| MCF Dijkstra iterations are executed for all source nodes in a round-robin order. Source nodes typically require different numbers of MCF Dijkstra iterations to satisfy all of their demand. This change is to avoid performing MCF Dijkstra iterations on source nodes which have already been fully satisfied. | |||
| 2019-04-10 | Codechange: Use null pointer literal instead of the NULL macro | Henry Wilson | |
| 2018-10-31 | Doc: Lots and lots of doxymentation fixes | Charles Pigott | |
| 2016-07-10 | (svn r27613) -Codechange: Use a flat vector instead of a map in ↵ | fonsinchen | |
| FlowEdgeIterator. (JGR) | |||
| 2016-07-10 | (svn r27611) -Codechange: Cache the calculated value of CapacityAnnotation | fonsinchen | |
| 2015-03-07 | (svn r27178) -Fix [FS#5969]: Data race due to lazy initialisation of objects. | frosch | |
| 2014-10-15 | (svn r27020) -Cleanup: some coding style consistency improvements (mostly ↵ | rubidium | |
| spaces) | |||
| 2014-06-14 | (svn r26646) -Fix [FS#6041]: Save locations instead of distances in link ↵ | fonsinchen | |
| graphs to reduce size. | |||
| 2014-04-23 | (svn r26482) -Codechange: add an include that allows us to undefine/redefine ↵ | rubidium | |
| "unsafe" functions to prevent them from being used, and thus having to care about certain aspects of their return values | |||
| 2013-10-19 | (svn r25885) -Codechange: Keep paths sorted so that the ones with flow == 0 ↵ | fonsinchen | |
| are in the back and don't have to be iterated over so often. | |||
| 2013-06-09 | (svn r25356) -Add: Multi-Commodity-Flow solver for link graph | fonsinchen | |
 |
index : Erich/openttd | |
| Unnamed repository; edit this file 'description' to name the repository. |
| summaryrefslogtreecommitdiff |