--- a/yapf/yapf_base.hpp Mon May 29 18:39:42 2006 +0000
+++ b/yapf/yapf_base.hpp Tue May 30 10:53:27 2006 +0000
@@ -57,7 +57,7 @@
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 @@
- 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 @@
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)