diff options
| author | KUDr <kudr@openttd.org> | 2006-05-30 10:53:27 +0000 |
|---|---|---|
| committer | KUDr <kudr@openttd.org> | 2006-05-30 10:53:27 +0000 |
| commit | d72ebf6ca3299cb525e2ba48b34e64be262a5d7c (patch) | |
| tree | 79602ee8d10bb3df5130a5bcc264510562f3bf6e /yapf/yapf_base.hpp | |
| parent | ed48b38619492a4018ac014d203718db689f69b2 (diff) | |
| download | openttd-d72ebf6ca3299cb525e2ba48b34e64be262a5d7c.tar.xz | |
(svn r5033) -CodeChange: [YAPF] RoadFindPathToStop() can now use YAPF for multistop handling.
Diffstat (limited to 'yapf/yapf_base.hpp')
| -rw-r--r-- | yapf/yapf_base.hpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/yapf/yapf_base.hpp b/yapf/yapf_base.hpp index 04eefb885..55d2d81ec 100644 --- a/yapf/yapf_base.hpp +++ b/yapf/yapf_base.hpp @@ -57,7 +57,7 @@ protected: Node* m_pBestIntermediateNode; ///< here should be node closest to the destination if path not found const YapfSettings *m_settings; ///< current settings (_patches.yapf) int m_max_search_nodes; ///< maximum number of nodes we are allowed to visit before we give up - Vehicle* m_veh; ///< vehicle that we are trying to drive + const Vehicle* m_veh; ///< vehicle that we are trying to drive int m_stats_cost_calcs; ///< stats - how many node's costs were calculated int m_stats_cache_hits; ///< stats - how many node's costs were reused from cache @@ -111,7 +111,7 @@ public: - or the open list is empty (no route to destination). - or the maximum amount of loops reached - m_max_search_nodes (default = 10000) @return true if the path was found */ - inline bool FindPath(Vehicle* v) + inline bool FindPath(const Vehicle* v) { m_veh = v; @@ -271,7 +271,7 @@ public: m_nodes.InsertOpenNode(n); } - Vehicle* GetVehicle() const {return m_veh;} + const Vehicle* GetVehicle() const {return m_veh;} // methods that should be implemented at derived class Types::Tpf (derived from CYapfBaseT) |