Upgrade formatting to clang-format 10 (#5895)

* Update formatting tools to clang-format-10

* Reformat using clang-format-10.0.09

unit_tests/partitioner/bisection_to_partition.cpp

@@ -149,7 +149,18 @@ BOOST_AUTO_TEST_CASE(power_of_two_case)
      0   1   2   3   4   5   6   7   8   9   10   11
     */
     const std::vector<BisectionID> ids_1 = {
-        0b000, 0b000, 0b001, 0b001, 0b010, 0b010, 0b011, 0b011, 0b100, 0b100, 0b101, 0b101,
+        0b000,
+        0b000,
+        0b001,
+        0b001,
+        0b010,
+        0b010,
+        0b011,
+        0b011,
+        0b100,
+        0b100,
+        0b101,
+        0b101,
     };
 
     // If cell sizes are not a factor of two we will see sub-optimal results like below
@@ -276,7 +287,18 @@ BOOST_AUTO_TEST_CASE(non_factor_two_case)
      0   1   2   3   4   5   6   7   8   9   10   11
     */
     const std::vector<BisectionID> ids_1 = {
-        0b000, 0b000, 0b001, 0b001, 0b010, 0b010, 0b011, 0b011, 0b100, 0b100, 0b101, 0b101,
+        0b000,
+        0b000,
+        0b001,
+        0b001,
+        0b010,
+        0b010,
+        0b011,
+        0b011,
+        0b100,
+        0b100,
+        0b101,
+        0b101,
     };
 
     // If cell sizes are not a factor of two we will see sub-optimal results like below

unit_tests/partitioner/cell_storage.cpp

@@ -34,7 +34,7 @@ auto makeGraph(const std::vector<MockEdge> &mock_edges)
     std::sort(edges.begin(), edges.end());
     return util::StaticGraph<EdgeData>(max_id + 1, edges);
 }
-}
+} // namespace
 
 BOOST_AUTO_TEST_SUITE(cell_storage_tests)
 

unit_tests/partitioner/multi_level_graph.cpp

@@ -39,7 +39,7 @@ auto makeGraph(const MultiLevelPartition &mlp, const std::vector<MockEdge> &mock
     std::sort(edges.begin(), edges.end());
     return MultiLevelGraph<EdgeData, osrm::storage::Ownership::Container>(mlp, max_id + 1, edges);
 }
-}
+} // namespace
 
 BOOST_AUTO_TEST_SUITE(multi_level_graph)
 

unit_tests/partitioner/remove_unconnected.cpp

@@ -44,7 +44,7 @@ auto makeGraph(const std::vector<MockEdge> &mock_edges)
     std::sort(edges.begin(), edges.end());
     return util::StaticGraph<EdgeData>(max_id + 1, edges);
 }
-}
+} // namespace
 
 BOOST_AUTO_TEST_SUITE(remove_unconnected_tests)
 

unit_tests/partitioner/renumber.cpp

@@ -39,7 +39,7 @@ auto makeGraph(const std::vector<MockEdge> &mock_edges)
     std::sort(edges.begin(), edges.end());
     return DynamicEdgeBasedGraph(max_id + 1, edges);
 }
-}
+} // namespace
 
 BOOST_AUTO_TEST_SUITE(renumber_tests)