#include <mpp/data/ProgressCallbackData.h>
◆ ProgressCallbackData()
| mpp::ProgressCallbackData::ProgressCallbackData |
( |
| ) |
|
|
default |
◆ ~ProgressCallbackData()
| mpp::ProgressCallbackData::~ProgressCallbackData |
( |
| ) |
|
|
default |
◆ bestCostFromStart
| cost_t mpp::ProgressCallbackData::bestCostFromStart = std::numeric_limits<cost_t>::max() |
◆ bestCostToGoal
| cost_t mpp::ProgressCallbackData::bestCostToGoal = std::numeric_limits<cost_t>::max() |
◆ bestFinalNode
| std::optional<TNodeID> mpp::ProgressCallbackData::bestFinalNode |
◆ bestPath
◆ costEvaluators
| const std::vector<CostEvaluator::Ptr>* mpp::ProgressCallbackData::costEvaluators = nullptr |
◆ originalPlanInput
| const PlannerInput* mpp::ProgressCallbackData::originalPlanInput = nullptr |
◆ tree
The documentation for this struct was generated from the following file:
- /home/docs/checkouts/readthedocs.org/user_builds/selfdriving/checkouts/latest/mrpt_path_planning/include/mpp/data/ProgressCallbackData.h