From 6170e70693644baf3eb92cff89022270b4dc4f0d Mon Sep 17 00:00:00 2001 From: Sebastian Jahr Date: Fri, 27 Oct 2023 09:32:44 +0200 Subject: [PATCH] Add changes necessary to address clang tidy API breakages --- .../parallel_planning/parallel_planning_tutorial.rst | 4 ++-- .../parallel_planning/src/parallel_planning_main.cpp | 8 ++++---- 2 files changed, 6 insertions(+), 6 deletions(-) diff --git a/doc/how_to_guides/parallel_planning/parallel_planning_tutorial.rst b/doc/how_to_guides/parallel_planning/parallel_planning_tutorial.rst index c80119dbd8..b81663e77e 100644 --- a/doc/how_to_guides/parallel_planning/parallel_planning_tutorial.rst +++ b/doc/how_to_guides/parallel_planning/parallel_planning_tutorial.rst @@ -123,8 +123,8 @@ For this example, we're using the default stopping criterion and a solution sele // If both solutions were successful, check which path is shorter if (solution_a && solution_b) { - return robot_trajectory::path_length(*solution_a.trajectory_) < - robot_trajectory::path_length(*solution_b.trajectory_); + return robot_trajectory::pathLength(*solution_a.trajectory_) < + robot_trajectory::pathLength(*solution_b.trajectory_); } // If only solution a is successful, return a else if (solution_a) diff --git a/doc/how_to_guides/parallel_planning/src/parallel_planning_main.cpp b/doc/how_to_guides/parallel_planning/src/parallel_planning_main.cpp index a61cc43799..57d22aa6b0 100644 --- a/doc/how_to_guides/parallel_planning/src/parallel_planning_main.cpp +++ b/doc/how_to_guides/parallel_planning/src/parallel_planning_main.cpp @@ -36,10 +36,10 @@ getShortestSolution(const std::vector& s for (auto const& solution : solutions) { RCLCPP_INFO(LOGGER, "Planner '%s' returned '%s'", solution.planner_id.c_str(), - moveit::core::error_code_to_string(solution.error_code).c_str()); + moveit::core::errorCodeToString(solution.error_code).c_str()); if (solution.trajectory) { - RCLCPP_INFO(LOGGER, "Path length: '%f', Planning time: '%f'", robot_trajectory::path_length(*solution.trajectory), + RCLCPP_INFO(LOGGER, "Path length: '%f', Planning time: '%f'", robot_trajectory::pathLength(*solution.trajectory), solution.planning_time); } } @@ -50,8 +50,8 @@ getShortestSolution(const std::vector& s // If both solutions were successful, check which path is shorter if (solution_a && solution_b) { - return robot_trajectory::path_length(*solution_a.trajectory) < - robot_trajectory::path_length(*solution_b.trajectory); + return robot_trajectory::pathLength(*solution_a.trajectory) < + robot_trajectory::pathLength(*solution_b.trajectory); } // If only solution a is successful, return a else if (solution_a)