Fix formatting

include/partitioner/bisection_graph.hpp

@@ -109,6 +109,6 @@ std::vector<BisectionInputEdge> adaptToBisectionEdge(std::vector<InputEdge> edge
     return result;
 }
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif // OSRM_PARTITIONER_BISECTION_GRAPH_HPP_

include/partitioner/bisection_graph_view.hpp

@@ -62,6 +62,6 @@ class BisectionGraphView
     const BisectionGraph::ConstNodeIterator end;
 };
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif // OSRM_PARTITIONER_GRAPHVIEW_HPP_

include/partitioner/bisection_to_partition.hpp

@@ -15,6 +15,6 @@ using Partition = std::vector<CellID>;
 std::tuple<std::vector<Partition>, std::vector<std::uint32_t>>
 bisectionToPartition(const std::vector<BisectionID> &node_to_bisection_id,
                      const std::vector<std::size_t> &max_cell_sizes);
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif

include/partitioner/cell_statistics.hpp

@@ -46,6 +46,6 @@ void printCellStatistics(const Partition &partition, const CellStorage &storage)
                     << (2 * entries * sizeof(EdgeWeight)) << " bytes)";
     }
 }
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif

include/partitioner/cell_storage.hpp

@@ -446,6 +446,6 @@ template <storage::Ownership Ownership> class CellStorageImpl
     Vector<std::uint64_t> level_to_cell_offset;
 };
 } // namespace detail
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif // OSRM_PARTITIONER_CUSTOMIZE_CELL_STORAGE_HPP

include/partitioner/dinic_max_flow.hpp

@@ -86,7 +86,7 @@ class DinicMaxFlow
                    const std::size_t flow_value) const;
 };
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 // Implementation of Dinics [1] algorithm for max-flow/min-cut.
 // [1] https://www.cs.bgu.ac.il/~dinitz/D70.pdf

include/partitioner/edge_based_graph.hpp

@@ -51,6 +51,6 @@ struct DynamicEdgeBasedGraphEdge : DynamicEdgeBasedGraph::InputEdge
     using Base = DynamicEdgeBasedGraph::InputEdge;
     using Base::Base;
 };
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif

include/partitioner/edge_based_graph_reader.hpp

@@ -196,6 +196,6 @@ inline DynamicEdgeBasedGraph LoadEdgeBasedGraph(const boost::filesystem::path &p
     return DynamicEdgeBasedGraph(number_of_edge_based_nodes, tidied, checksum);
 }
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif

include/partitioner/files.hpp

@@ -92,6 +92,6 @@ inline void writeGraph(const boost::filesystem::path &path,
     writer.WriteFrom("/mld/connectivity_checksum", connectivity_checksum);
     serialization::write(writer, "/mld/multilevelgraph", graph);
 }
-} // namespace osrm
+} // namespace osrm::partitioner::files
 
 #endif

include/partitioner/inertial_flow.hpp

@@ -12,6 +12,6 @@ DinicMaxFlow::MinCut computeInertialFlowCut(const BisectionGraphView &view,
                                             const double balance,
                                             const double source_sink_rate);
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif // OSRM_PARTITIONER_INERTIAL_FLOW_HPP_

include/partitioner/multi_level_graph.hpp

@@ -233,6 +233,6 @@ class MultiLevelGraph : public util::StaticGraph<EdgeDataT, Ownership>
 
 using MultiLevelEdgeBasedGraph =
     MultiLevelGraph<EdgeBasedGraphEdgeData, storage::Ownership::Container>;
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif

include/partitioner/multi_level_partition.hpp

@@ -342,6 +342,6 @@ inline MultiLevelPartitionImpl<storage::Ownership::View>::MultiLevelPartitionImp
 {
 }
 } // namespace detail
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif

include/partitioner/partition_graph.hpp

@@ -154,6 +154,6 @@ template <typename NodeEntryT, typename EdgeEntryT> class RemappableGraph
     std::vector<EdgeT> edges;
 };
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif // OSRM_PARTITIONER_GRAPH_HPP_

include/partitioner/partitioner.hpp

@@ -13,6 +13,6 @@ class Partitioner
     int Run(const PartitionerConfig &config);
 };
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif // OSRM_PARTITIONER_PARTITIONER_HPP_

include/partitioner/partitioner_config.hpp

@@ -42,6 +42,6 @@ struct PartitionerConfig final : storage::IOConfig
     std::size_t small_component_size;
     std::vector<std::size_t> max_cell_sizes;
 };
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif // OSRM_PARTITIONER_CONFIG_HPP

include/partitioner/recursive_bisection.hpp

@@ -30,6 +30,6 @@ class RecursiveBisection
     RecursiveBisectionState internal_state;
 };
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif // OSRM_PARTITIONER_RECURSIVE_BISECTION_HPP_

include/partitioner/recursive_bisection_state.hpp

@@ -48,6 +48,6 @@ class RecursiveBisectionState
     std::vector<BisectionID> bisection_ids;
 };
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif // OSRM_PARTITIONER_RECURSIVE_BISECTION_STATE_HPP_

include/partitioner/remove_unconnected.hpp

@@ -107,6 +107,6 @@ std::size_t removeUnconnectedBoundaryNodes(const GraphT &edge_based_graph,
 
     return num_unconnected;
 }
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif

include/partitioner/renumber.hpp

@@ -91,6 +91,6 @@ inline void renumber(std::vector<extractor::StorageManeuverOverride> &maneuver_o
     }
 }
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif

include/partitioner/reorder_first_last.hpp

@@ -47,6 +47,6 @@ void reorderFirstLast(RandomAccessRange &rng, std::size_t n, Compare comp)
     return reorderFirstLast(begin(rng), end(rng), n, comp);
 }
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif

include/partitioner/serialization.hpp

@@ -61,6 +61,6 @@ inline void write(storage::tar::FileWriter &writer,
     storage::serialization::write(
         writer, name + "/level_to_cell_offset", storage.level_to_cell_offset);
 }
-} // namespace osrm
+} // namespace osrm::partitioner::serialization
 
 #endif

include/partitioner/tarjan_graph_wrapper.hpp

@@ -21,6 +21,6 @@ class TarjanGraphWrapper
     const BisectionGraph &bisection_graph;
 };
 
-} // namespace osrm
+} // namespace osrm::partitioner
 
 #endif // OSRM_PARTITIONER_TARJAN_GRAPH_WRAPPER_HPP_