Add changes necessary to address clang tidy API breakages

moveit · Oct 27, 2023 · 6170e70 · 6170e70
1 parent 1834b79
commit 6170e70
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 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
@@ -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
@@ -36,10 +36,10 @@ getShortestSolution(const std::vector<planning_interface::MotionPlanResponse>& 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<planning_interface::MotionPlanResponse>& 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)