remove inline keywords

RoutingAlgorithms/AlternativePathRouting.h

@@ -370,7 +370,7 @@ template <class DataFacadeT> class AlternativeRouting final : private BasicRouti
 
   private:
     // unpack alternate <s,..,v,..,t> by exploring search spaces from v
-    inline void RetrievePackedAlternatePath(const QueryHeap &forward_heap1,
+    void RetrievePackedAlternatePath(const QueryHeap &forward_heap1,
                                             const QueryHeap &reverse_heap1,
                                             const QueryHeap &forward_heap2,
                                             const QueryHeap &reverse_heap2,
@@ -394,7 +394,7 @@ template <class DataFacadeT> class AlternativeRouting final : private BasicRouti
     // compute and unpack <s,..,v> and <v,..,t> by exploring search spaces
     // from v and intersecting against queues. only half-searches have to be
     // done at this stage
-    inline void ComputeLengthAndSharingOfViaPath(const NodeID via_node,
+    void ComputeLengthAndSharingOfViaPath(const NodeID via_node,
                                                  int *real_length_of_via_path,
                                                  int *sharing_of_via_path,
                                                  const std::vector<NodeID> &packed_shortest_path,
@@ -551,7 +551,7 @@ template <class DataFacadeT> class AlternativeRouting final : private BasicRouti
         // variable
     }
 
-    // inline int approximateAmountOfSharing(
+    // int approximateAmountOfSharing(
     //     const NodeID alternate_path_middle_node_id,
     //     QueryHeap & forward_heap,
     //     QueryHeap & reverse_heap,
@@ -598,7 +598,7 @@ template <class DataFacadeT> class AlternativeRouting final : private BasicRouti
 
     // todo: reorder parameters
     template <bool is_forward_directed>
-    inline void AlternativeRoutingStep(QueryHeap &forward_heap,
+    void AlternativeRoutingStep(QueryHeap &forward_heap,
                                        QueryHeap &reverse_heap,
                                        NodeID *middle_node,
                                        int *upper_bound_to_shortest_path_distance,
@@ -674,7 +674,7 @@ template <class DataFacadeT> class AlternativeRouting final : private BasicRouti
     }
 
     // conduct T-Test
-    inline bool ViaNodeCandidatePassesTTest(QueryHeap &existing_forward_heap,
+    bool ViaNodeCandidatePassesTTest(QueryHeap &existing_forward_heap,
                                             QueryHeap &existing_reverse_heap,
                                             QueryHeap &new_forward_heap,
                                             QueryHeap &new_reverse_heap,

RoutingAlgorithms/BasicRoutingInterface.h

@@ -58,7 +58,7 @@ template <class DataFacadeT> class BasicRoutingInterface
     explicit BasicRoutingInterface(DataFacadeT *facade) : facade(facade) {}
     virtual ~BasicRoutingInterface() {};
 
-    inline void RoutingStep(SearchEngineData::QueryHeap &forward_heap,
+    void RoutingStep(SearchEngineData::QueryHeap &forward_heap,
                             SearchEngineData::QueryHeap &reverse_heap,
                             NodeID *middle_node_id,
                             int *upper_bound,
@@ -145,7 +145,7 @@ template <class DataFacadeT> class BasicRoutingInterface
         }
     }
 
-    inline void UnpackPath(const std::vector<NodeID> &packed_path,
+    void UnpackPath(const std::vector<NodeID> &packed_path,
                            const PhantomNodes &phantom_node_pair,
                            std::vector<PathData> &unpacked_path) const
     {
@@ -330,7 +330,7 @@ template <class DataFacadeT> class BasicRoutingInterface
         }
     }
 
-    inline void UnpackEdge(const NodeID s, const NodeID t, std::vector<NodeID> &unpacked_path) const
+    void UnpackEdge(const NodeID s, const NodeID t, std::vector<NodeID> &unpacked_path) const
     {
         std::stack<std::pair<NodeID, NodeID>> recursion_stack;
         recursion_stack.emplace(s, t);
@@ -386,7 +386,7 @@ template <class DataFacadeT> class BasicRoutingInterface
         unpacked_path.emplace_back(t);
     }
 
-    inline void RetrievePackedPathFromHeap(const SearchEngineData::QueryHeap &forward_heap,
+    void RetrievePackedPathFromHeap(const SearchEngineData::QueryHeap &forward_heap,
                                            const SearchEngineData::QueryHeap &reverse_heap,
                                            const NodeID middle_node_id,
                                            std::vector<NodeID> &packed_path) const
@@ -397,7 +397,7 @@ template <class DataFacadeT> class BasicRoutingInterface
         RetrievePackedPathFromSingleHeap(reverse_heap, middle_node_id, packed_path);
     }
 
-    inline void RetrievePackedPathFromSingleHeap(const SearchEngineData::QueryHeap &search_heap,
+    void RetrievePackedPathFromSingleHeap(const SearchEngineData::QueryHeap &search_heap,
                                                  const NodeID middle_node_id,
                                                  std::vector<NodeID> &packed_path) const
     {

RoutingAlgorithms/ManyToManyRouting.h

@@ -204,7 +204,7 @@ template <class DataFacadeT> class ManyToManyRouting final : public BasicRouting
     }
 
     template <bool forward_direction>
-    inline void
+    void
     RelaxOutgoingEdges(const NodeID node, const EdgeWeight distance, QueryHeap &query_heap) const
     {
         for (auto edge : super::facade->GetAdjacentEdgeRange(node))
@@ -237,7 +237,7 @@ template <class DataFacadeT> class ManyToManyRouting final : public BasicRouting
 
     // Stalling
     template <bool forward_direction>
-    inline bool StallAtNode(const NodeID node, const EdgeWeight distance, QueryHeap &query_heap)
+    bool StallAtNode(const NodeID node, const EdgeWeight distance, QueryHeap &query_heap)
         const
     {
         for (auto edge : super::facade->GetAdjacentEdgeRange(node))