equal
deleted
inserted
replaced
49 typedef typename Node::Key Key; ///< key to hash tables |
49 typedef typename Node::Key Key; ///< key to hash tables |
50 |
50 |
51 |
51 |
52 NodeList m_nodes; ///< node list multi-container |
52 NodeList m_nodes; ///< node list multi-container |
53 protected: |
53 protected: |
54 Node* m_pBestDestNode; ///< pointer to the destination node found at last round |
54 Node *m_pBestDestNode; ///< pointer to the destination node found at last round |
55 Node* m_pBestIntermediateNode; ///< here should be node closest to the destination if path not found |
55 Node *m_pBestIntermediateNode; ///< here should be node closest to the destination if path not found |
56 const YAPFSettings *m_settings; ///< current settings (_settings_game.yapf) |
56 const YAPFSettings *m_settings; ///< current settings (_settings_game.yapf) |
57 int m_max_search_nodes; ///< maximum number of nodes we are allowed to visit before we give up |
57 int m_max_search_nodes; ///< maximum number of nodes we are allowed to visit before we give up |
58 const Vehicle* m_veh; ///< vehicle that we are trying to drive |
58 const Vehicle *m_veh; ///< vehicle that we are trying to drive |
59 |
59 |
60 int m_stats_cost_calcs; ///< stats - how many node's costs were calculated |
60 int m_stats_cost_calcs; ///< stats - how many node's costs were calculated |
61 int m_stats_cache_hits; ///< stats - how many node's costs were reused from cache |
61 int m_stats_cache_hits; ///< stats - how many node's costs were reused from cache |
62 |
62 |
63 public: |
63 public: |
279 // the new node is really new |
279 // the new node is really new |
280 // add it to the open list |
280 // add it to the open list |
281 m_nodes.InsertOpenNode(n); |
281 m_nodes.InsertOpenNode(n); |
282 } |
282 } |
283 |
283 |
284 const Vehicle* GetVehicle() const {return m_veh;} |
284 const Vehicle * GetVehicle() const {return m_veh;} |
285 |
285 |
286 void DumpBase(DumpTarget &dmp) const |
286 void DumpBase(DumpTarget &dmp) const |
287 { |
287 { |
288 dmp.WriteStructT("m_nodes", &m_nodes); |
288 dmp.WriteStructT("m_nodes", &m_nodes); |
289 dmp.WriteLine("m_num_steps = %d", m_num_steps); |
289 dmp.WriteLine("m_num_steps = %d", m_num_steps); |