Upgrade formatting to clang-format 10 (#5895)

* Update formatting tools to clang-format-10

* Reformat using clang-format-10.0.09

src/partitioner/bisection_to_partition.cpp

@@ -109,7 +109,7 @@ void partitionLevel(const std::vector<BisectionID> &node_to_bisection_id,
         }
     }
 }
-}
+} // namespace
 
 // Implements a greedy algorithm that split cells using the bisection until a target cell size is
 // reached
@@ -140,5 +140,5 @@ bisectionToPartition(const std::vector<BisectionID> &node_to_bisection_id,
 
     return std::make_tuple(std::move(partitions), std::move(num_cells));
 }
-}
-}
+} // namespace partitioner
+} // namespace osrm

src/partitioner/dinic_max_flow.cpp

@@ -183,7 +183,6 @@ std::size_t DinicMaxFlow::BlockingFlow(FlowEdges &flow,
 
     // augment the flow along a path in the level graph
     const auto augment_flow = [&flow](const std::vector<NodeID> &path) {
-
         // add/remove flow edges from the current residual graph
         const auto augment_one = [&flow](const NodeID from, const NodeID to) {
             // check if there is flow in the opposite direction

src/partitioner/inertial_flow.cpp

@@ -149,7 +149,7 @@ DinicMaxFlow::MinCut bestMinCut(const BisectionGraphView &view,
 
     return best;
 }
-}
+} // namespace
 
 DinicMaxFlow::MinCut computeInertialFlowCut(const BisectionGraphView &view,
                                             const std::size_t num_slopes,

src/partitioner/renumber.cpp

@@ -36,7 +36,7 @@ std::vector<LevelID> getHighestBorderLevel(const DynamicEdgeBasedGraph &graph,
 
     return border_level;
 }
-}
+} // namespace
 
 std::vector<std::uint32_t> makePermutation(const DynamicEdgeBasedGraph &graph,
                                            const std::vector<Partition> &partitions)
@@ -66,5 +66,5 @@ std::vector<std::uint32_t> makePermutation(const DynamicEdgeBasedGraph &graph,
 
     return util::orderingToPermutation(ordering);
 }
-}
-}
+} // namespace partitioner
+} // namespace osrm