equal
deleted
inserted
replaced
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.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 |
72 public: |
72 public: |
73 /// default constructor |
73 /// default constructor |
74 FORCEINLINE CYapfBaseT() |
74 FORCEINLINE CYapfBaseT() |
75 : m_pBestDestNode(NULL) |
75 : m_pBestDestNode(NULL) |
76 , m_pBestIntermediateNode(NULL) |
76 , m_pBestIntermediateNode(NULL) |
77 , m_settings(&_settings.pf.yapf) |
77 , m_settings(&_settings_game.pf.yapf) |
78 , m_max_search_nodes(PfGetSettings().max_search_nodes) |
78 , m_max_search_nodes(PfGetSettings().max_search_nodes) |
79 , m_veh(NULL) |
79 , m_veh(NULL) |
80 , m_stats_cost_calcs(0) |
80 , m_stats_cost_calcs(0) |
81 , m_stats_cache_hits(0) |
81 , m_stats_cache_hits(0) |
82 , m_num_steps(0) |
82 , m_num_steps(0) |