Fix formatting

src/partitioner/bisection_graph_view.cpp

@@ -50,4 +50,4 @@ const BisectionGraphView::EdgeT &BisectionGraphView::Edge(const EdgeID eid) cons
     return bisection_graph.Edge(eid);
 }
 
-} // namespace osrm
+} // namespace osrm::partitioner

src/partitioner/bisection_to_partition.cpp

@@ -138,4 +138,4 @@ bisectionToPartition(const std::vector<BisectionID> &node_to_bisection_id,
 
     return std::make_tuple(std::move(partitions), std::move(num_cells));
 }
-} // namespace osrm
+} // namespace osrm::partitioner

src/partitioner/dinic_max_flow.cpp

@@ -307,4 +307,4 @@ bool DinicMaxFlow::Validate(const BisectionGraphView &view,
     return separated && in_range_source && in_range_sink;
 }
 
-} // namespace osrm
+} // namespace osrm::partitioner

src/partitioner/inertial_flow.cpp

@@ -157,4 +157,4 @@ DinicMaxFlow::MinCut computeInertialFlowCut(const BisectionGraphView &view,
     return bestMinCut(view, num_slopes, source_sink_rate, balance);
 }
 
-} // namespace osrm
+} // namespace osrm::partitioner

src/partitioner/partitioner.cpp

@@ -198,4 +198,4 @@ int Partitioner::Run(const PartitionerConfig &config)
     return 0;
 }
 
-} // namespace osrm
+} // namespace osrm::partitioner

src/partitioner/recursive_bisection.cpp

@@ -105,4 +105,4 @@ const std::vector<BisectionID> &RecursiveBisection::BisectionIDs() const
 
 std::uint32_t RecursiveBisection::SCCDepth() const { return internal_state.SCCDepth(); }
 
-} // namespace osrm
+} // namespace osrm::partitioner

src/partitioner/recursive_bisection_state.cpp

@@ -179,4 +179,4 @@ const std::vector<BisectionID> &RecursiveBisectionState::BisectionIDs() const
 
 std::uint32_t RecursiveBisectionState::SCCDepth() const { return scc_levels; }
 
-} // namespace osrm
+} // namespace osrm::partitioner

src/partitioner/renumber.cpp

@@ -64,4 +64,4 @@ std::vector<std::uint32_t> makePermutation(const DynamicEdgeBasedGraph &graph,
 
     return util::orderingToPermutation(ordering);
 }
-} // namespace osrm
+} // namespace osrm::partitioner

src/partitioner/tarjan_graph_wrapper.cpp

@@ -20,4 +20,4 @@ NodeID TarjanGraphWrapper::GetTarget(const EdgeID eid) const
     return bisection_graph.Edge(eid).target;
 }
 
-} // namespace osrm
+} // namespace osrm::partitioner