linter fixes

Signed-off-by: stevedan <[email protected]>

nav2_smac_planner/src/a_star.cpp

@@ -261,8 +261,8 @@ void AStarAlgorithm<NodeT>::setGoal(
 
   // we just have to check whether the x and y are the same because the dim3 is not used
   // in the computation of the obstacle heuristic
-  if (!_search_info.cache_obstacle_heuristic || 
-      goals_coordinates != _goals_coordinates)
+  if (!_search_info.cache_obstacle_heuristic ||
+    goals_coordinates != _goals_coordinates)
   {
     if (!_start) {
       throw std::runtime_error("Start must be set before goal.");
@@ -291,7 +291,7 @@ bool AStarAlgorithm<NodeT>::areInputsValid()
   if (!_start || _goalsSet.empty()) {
     throw std::runtime_error("Failed to compute path, no valid start or goal given.");
   }
-  
+
   // Check if ending point is valid
   if (getToleranceHeuristic() < 0.001) {
     // if a node is not valid, prune it from the goals set

nav2_smac_planner/src/analytic_expansion.cpp

@@ -74,18 +74,17 @@ typename AnalyticExpansion<NodeT>::NodePtr AnalyticExpansion<NodeT>::tryAnalytic
     int desired_iterations = std::max(
       static_cast<int>(closest_distance / _search_info.analytic_expansion_ratio),
       static_cast<int>(std::ceil(_search_info.analytic_expansion_ratio)));
-    
+
     // If we are closer now, we should update the target number of iterations to go
     analytic_iterations =
       std::min(analytic_iterations, desired_iterations);
 
     // Always run the expansion on the first run in case there is a
     // trivial path to be found
     if (analytic_iterations <= 0) {
-
       // Reset the counter and try the analytic path expansion
       analytic_iterations = desired_iterations;
-      
+
       for (auto goal_node : goals_node) {
         AnalyticExpansionNodes analytic_nodes =
           getAnalyticPath(