diff options
| author | fonsinchen <fonsinchen@openttd.org> | 2014-01-19 09:27:44 +0000 |
|---|---|---|
| committer | fonsinchen <fonsinchen@openttd.org> | 2014-01-19 09:27:44 +0000 |
| commit | 7e91f96b92da84b7152e22d50bd5324e65cfccb3 (patch) | |
| tree | d05494ec3940ec21ef1c18e6e04ff8b59cd73795 /src/order_base.h | |
| parent | b158c7d0fa0bec2ccf885d06a9f1855ca8b3c698 (diff) | |
| download | openttd-7e91f96b92da84b7152e22d50bd5324e65cfccb3.tar.xz | |
(svn r26267) -Fix [FS#5865]: Really fix the infinite recursion problem and always consider all branches of conditional orders as possible next stopping stations.
Diffstat (limited to 'src/order_base.h')
| -rw-r--r-- | src/order_base.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/order_base.h b/src/order_base.h index 85d8a05a7..ff0813613 100644 --- a/src/order_base.h +++ b/src/order_base.h @@ -263,7 +263,7 @@ public: */ inline VehicleOrderID GetNumManualOrders() const { return this->num_manual_orders; } - StationIDStack GetNextStoppingStation(const Vehicle *v, const Order *first = NULL) const; + StationIDStack GetNextStoppingStation(const Vehicle *v, const Order *first = NULL, uint hops = 0) const; const Order *GetNextDecisionNode(const Order *next, uint hops) const; void InsertOrderAt(Order *new_order, int index); |