Uses Name Change Heuristic Instead of Comparing Name Ids

References:
- https://github.com/Project-OSRM/osrm-backend/issues/2857
- https://github.com/Project-OSRM/osrm-backend/pull/2900
- https://github.com/Project-OSRM/osrm-backend/issues/2909

include/extractor/guidance/intersection_generator.hpp

@@ -6,6 +6,7 @@
 #include "extractor/guidance/intersection.hpp"
 #include "extractor/query_node.hpp"
 #include "extractor/restriction_map.hpp"
+#include "extractor/suffix_table.hpp"
 #include "util/attributes.hpp"
 #include "util/name_table.hpp"
 #include "util/node_based_graph.hpp"
@@ -32,7 +33,9 @@ class IntersectionGenerator
                           const RestrictionMap &restriction_map,
                           const std::unordered_set<NodeID> &barrier_nodes,
                           const std::vector<QueryNode> &node_info_list,
-                          const CompressedEdgeContainer &compressed_edge_container);
+                          const CompressedEdgeContainer &compressed_edge_container,
+                          const util::NameTable &name_table,
+                          const SuffixTable &street_name_suffix_table);
 
     Intersection operator()(const NodeID nid, const EdgeID via_eid) const;
 
@@ -64,6 +67,8 @@ class IntersectionGenerator
     const std::unordered_set<NodeID> &barrier_nodes;
     const std::vector<QueryNode> &node_info_list;
     const CoordinateExtractor coordinate_extractor;
+    const util::NameTable &name_table;
+    const SuffixTable &street_name_suffix_table;
 
     // check if two indices in an intersection can be seen as a single road in the perceived
     // intersection representation. See below for an example. Utility function for