Fix formating

src/extractor/edge_based_graph_factory.cpp

@@ -519,9 +519,10 @@ void EdgeBasedGraphFactory::GenerateEdgeExpandedEdges(
                                     &scripting_environment,
                                     weight_multiplier,
                                     &conditional_restriction_map](
-            // what nodes will be used? In most cases this will be the id stored in the edge_data.
-            // In case of duplicated nodes (e.g. due to via-way restrictions), one/both of these
-            // might refer to a newly added edge based node
+            // what nodes will be used? In most cases this will be the id
+            // stored in the edge_data. In case of duplicated nodes (e.g.
+            // due to via-way restrictions), one/both of these might
+            // refer to a newly added edge based node
             const auto edge_based_node_from,
             const auto edge_based_node_to,
             // the situation of the turn

src/extractor/graph_compressor.cpp

@@ -186,9 +186,9 @@ void GraphCompressor::Compress(
                 const auto selectAnnotation = [&node_data_container](
                     const AnnotationID front_annotation, const AnnotationID back_annotation) {
                     // A lane has tags: u - (front) - v - (back) - w
-                    // During contraction, we keep only one of the tags. Usually the one closer to
-                    // the intersection is preferred. If its empty, however, we keep the non-empty
-                    // one
+                    // During contraction, we keep only one of the tags. Usually the one closer
+                    // to the intersection is preferred. If its empty, however, we keep the
+                    // non-empty one
                     if (node_data_container[back_annotation].lane_description_id ==
                         INVALID_LANE_DESCRIPTIONID)
                         return front_annotation;

src/extractor/intersection/intersection_analysis.cpp

@@ -115,8 +115,8 @@ std::pair<bool, double> findMergedBearing(const util::NodeBasedDynamicGraph &gra
     // Function returns a pair with a flag and a value of bearing for merged roads
     // If the flag is false the bearing must not be used as a merged value at neighbor intersections
 
-    using util::bearing::angleBetween;
     using util::angularDeviation;
+    using util::bearing::angleBetween;
 
     const auto &lhs = edge_geometries[lhs_index];
     const auto &rhs = edge_geometries[rhs_index];