[lint] Fix code checker warnings

krashish8 · krashish8 · commit b1dcb28516e3 · 2020-12-15T19:20:47.000+05:30
diff --git a/include/astar/pgr_astar.hpp b/include/astar/pgr_astar.hpp
@@ -41,6 +41,7 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 #include <algorithm>
 #include <vector>
 #include <set>
+#include <map>
 
 #include "cpp_common/basePath_SSEC.hpp"
 #include "cpp_common/pgr_base_graph.hpp"
diff --git a/include/bellman_ford/pgr_bellman_ford.hpp b/include/bellman_ford/pgr_bellman_ford.hpp
@@ -39,6 +39,7 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 #include <string>
 #include <functional>
 #include <limits>
+#include <map>
 #include "cpp_common/pgr_messages.h"
 #include "cpp_common/basePath_SSEC.hpp"
 #include "cpp_common/pgr_base_graph.hpp"
diff --git a/include/bellman_ford/pgr_edwardMoore.hpp b/include/bellman_ford/pgr_edwardMoore.hpp
@@ -22,10 +22,11 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 #define INCLUDE_BELLMAN_FORD_PGR_EDWARDMOORE_HPP_
 #pragma once
 
-#include<limits>
-#include<algorithm>
-#include<vector>
+#include <limits>
+#include <algorithm>
+#include <vector>
 #include <deque>
+#include <map>
 
 
 #include "cpp_common/basePath_SSEC.hpp"
diff --git a/include/breadthFirstSearch/pgr_binaryBreadthFirstSearch.hpp b/include/breadthFirstSearch/pgr_binaryBreadthFirstSearch.hpp
@@ -30,6 +30,7 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 #include <cmath>
 #include <limits>
 #include <vector>
+#include <map>
 
 #include "cpp_common/basePath_SSEC.hpp"
 #include "cpp_common/pgr_base_graph.hpp"
diff --git a/include/chinese/pgr_chinesePostman.hpp b/include/chinese/pgr_chinesePostman.hpp
@@ -112,8 +112,7 @@ PgrDirectedChPPGraph::PgrDirectedChPPGraph(
     edgeToIdx(), originalEdges(),
     resultGraph(), VToVecid(), edgeVisited(),
     pathStack(), resultPath(),
-    edges(), sources(), targets()
-{
+    edges(), sources(), targets() {
     pgassert(totalEdges > 0);
     pgassert(pathStack.empty());
 
diff --git a/include/cpp_common/basic_vertex.h b/include/cpp_common/basic_vertex.h
@@ -47,7 +47,7 @@ class Basic_vertex {
      explicit Basic_vertex(const int64_t _id) :
          id(_id) {}
 
-     Basic_vertex& operator=(const Basic_vertex&)=default;
+     Basic_vertex& operator=(const Basic_vertex&) = default;
 
      Basic_vertex(const pgr_edge_t &other, bool is_source) :
          id(is_source? other.source : other.target) {}
diff --git a/include/dagShortestPath/pgr_dagShortestPath.hpp b/include/dagShortestPath/pgr_dagShortestPath.hpp
@@ -43,6 +43,7 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 #include <sstream>
 #include <functional>
 #include <limits>
+#include <map>
 
 #include "cpp_common/basePath_SSEC.hpp"
 #include "cpp_common/pgr_base_graph.hpp"
diff --git a/include/dijkstra/pgr_dijkstra.hpp b/include/dijkstra/pgr_dijkstra.hpp
@@ -691,7 +691,7 @@ class Pgr_dijkstra {
                      .distance_inf(std::numeric_limits<double>::infinity())
                      .visitor(dijkstra_many_goal_visitor(goals, n_goals, goals_found)));
          } catch(found_goals &) {
-             for(const auto &g : goals) {
+             for (const auto &g : goals) {
                  if (goals_found.find(g) == goals_found.end()) {
                      /* goal was not found */
                      predecessors[g] = g;
diff --git a/include/max_flow/pgr_maximumcardinalitymatching.hpp b/include/max_flow/pgr_maximumcardinalitymatching.hpp
@@ -108,7 +108,6 @@ class PgrCardinalityGraph {
 
   std::vector<pgr_basic_edge_t>
   get_matched_vertices() {
-
       std::vector<V> mate_map(boost::num_vertices(boost_graph));
       std::vector<pgr_basic_edge_t> matched_vertices;
       maximum_cardinality_matching(mate_map);
diff --git a/include/tsp/tour.h b/include/tsp/tour.h
@@ -41,6 +41,7 @@ namespace tsp {
 
 class Tour {
     using difference_type = std::vector<size_t>::difference_type;
+
  public:
      Tour(const Tour &) = default;
 
diff --git a/include/vrp/pd_problem.h b/include/vrp/pd_problem.h
@@ -50,7 +50,7 @@ class PD_problem {
 
  protected:
      static Pgr_pickDeliver* problem;
-     PD_problem& operator=(const PD_problem &) {return *this;};
+     PD_problem& operator=(const PD_problem &) {return *this;}
 };
 
 }  //  namespace vrp
diff --git a/src/astar/astar.c b/src/astar/astar.c
@@ -225,7 +225,6 @@ _pgr_astar(PG_FUNCTION_ARGS) {
                 true,
                 &result_tuples,
                 &result_count);
-
         }
 
 
diff --git a/src/bdAstar/bdAstar.c b/src/bdAstar/bdAstar.c
@@ -192,7 +192,6 @@ _pgr_bdastar(PG_FUNCTION_ARGS) {
                 PG_GETARG_BOOL(6),
                 &result_tuples,
                 &result_count);
-
         }
 
 
diff --git a/src/bdAstar/bdAstar_driver.cpp b/src/bdAstar/bdAstar_driver.cpp
@@ -129,7 +129,6 @@ pgr_bdAstar(
 
             previousCombination = comb;
         }
-
     }
 
     log << fn_bdAstar.log();
diff --git a/src/dagShortestPath/dagShortestPath.c b/src/dagShortestPath/dagShortestPath.c
@@ -243,7 +243,6 @@ PGDLLEXPORT Datum _pgr_dagshortestpath(PG_FUNCTION_ARGS) {
         result = HeapTupleGetDatum(tuple);
         SRF_RETURN_NEXT(funcctx, result);
     } else {
-
         PGR_DBG("Clean up code");
         SRF_RETURN_DONE(funcctx);
     }
diff --git a/src/dijkstra/dijkstra.c b/src/dijkstra/dijkstra.c
@@ -122,14 +122,14 @@ process(
             time_msg("processing pgr_dijkstraNearCost", start_t, clock());
         } else {
             time_msg("processing pgr_dijkstraCost", start_t, clock());
-        };
+        }
     } else {
         if (n_goals > 0) {
             time_msg("processing pgr_dijkstraNear", start_t, clock());
         } else {
             time_msg("processing pgr_dijkstra", start_t, clock());
-        };
-    };
+        }
+    }
 
 
     if (err_msg && (*result_tuples)) {
@@ -175,7 +175,7 @@ process_combinations(
     if (total_edges == 0) {
         pgr_SPI_finish();
         return;
-    };
+    }
     pgr_get_combinations(combinations_sql, &combinations, &total_combinations);
     if (total_combinations == 0) {
         if (edges) pfree(edges);
@@ -208,14 +208,14 @@ process_combinations(
             time_msg("Processing pgr_dijkstraNearCost", start_t, clock());
         } else {
             time_msg("Processing pgr_dijkstraCost", start_t, clock());
-        };
+        }
     } else {
         if (n_goals > 0) {
             time_msg("Processing pgr_dijkstraNear", start_t, clock());
         } else {
             time_msg("Processing pgr_dijkstra", start_t, clock());
-        };
-    };
+        }
+    }
 
     if (err_msg && (*result_tuples)) {
         pfree(*result_tuples);
diff --git a/src/dijkstra/dijkstra_driver.cpp b/src/dijkstra/dijkstra_driver.cpp
@@ -50,9 +50,10 @@ namespace detail {
 void
 post_process(std::deque<Path> &paths, bool only_cost, bool normal, size_t n_goals, bool global) {
     paths.erase(std::remove_if(paths.begin(), paths.end(),
-                [](const Path &p){
-                    return p.size()==0;}),
-            paths.end());
+                [](const Path &p) {
+                    return p.size() == 0;
+                }),
+                paths.end());
     using difference_type = std::deque<double>::difference_type;
 
     if (!normal) {
diff --git a/src/trsp/pgr_trspHandler.cpp b/src/trsp/pgr_trspHandler.cpp
@@ -113,7 +113,8 @@ double Pgr_trspHandler::construct_path(int64_t ed_id, Position pos) {
         return pelement.cost;
     }
 
-    double ret = construct_path(static_cast<int64_t>(m_parent[static_cast<size_t>(ed_id)].e_idx[static_cast<size_t>(pos)]),
+    double ret = construct_path(
+        static_cast<int64_t>(m_parent[static_cast<size_t>(ed_id)].e_idx[static_cast<size_t>(pos)]),
         static_cast<Position>(m_parent[static_cast<size_t>(ed_id)].v_pos[static_cast<size_t>(pos)]));
     Path_t pelement;
     auto cur_edge = &m_edges[static_cast<size_t>(ed_id)];
diff --git a/src/tsp/tour.cpp b/src/tsp/tour.cpp
@@ -92,7 +92,10 @@ void Tour::swap(
         size_t c2 ) {
     pgassert(c1 < c2);
 
-    std::iter_swap(cities.begin() + static_cast<difference_type>(c1), cities.begin() + static_cast<difference_type>(c2));
+    std::iter_swap(
+        cities.begin() +
+        static_cast<difference_type>(c1), cities.begin() +
+        static_cast<difference_type>(c2));
 }
 
 
diff --git a/src/withPoints/withPoints_driver.cpp b/src/withPoints/withPoints_driver.cpp
@@ -34,6 +34,7 @@ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 #include <deque>
 #include <vector>
 #include <cassert>
+#include <limits>
 
 
 #include "dijkstra/pgr_dijkstra.hpp"
