// This class constructs the edge-expanded routing graph #ifndef EDGE_BASED_GRAPH_FACTORY_HPP_ #define EDGE_BASED_GRAPH_FACTORY_HPP_ #include "extractor/compressed_edge_container.hpp" #include "extractor/edge_based_edge.hpp" #include "extractor/edge_based_node.hpp" #include "extractor/extraction_turn.hpp" #include "extractor/guidance/turn_analysis.hpp" #include "extractor/guidance/turn_instruction.hpp" #include "extractor/guidance/turn_lane_types.hpp" #include "extractor/nbg_to_ebg.hpp" #include "extractor/original_edge_data.hpp" #include "extractor/packed_osm_ids.hpp" #include "extractor/profile_properties.hpp" #include "extractor/query_node.hpp" #include "extractor/restriction_map.hpp" #include "util/deallocating_vector.hpp" #include "util/guidance/bearing_class.hpp" #include "util/guidance/entry_class.hpp" #include "util/name_table.hpp" #include "util/node_based_graph.hpp" #include "util/packed_vector.hpp" #include "util/typedefs.hpp" #include "storage/io.hpp" #include #include #include #include #include #include #include #include #include #include #include namespace osrm { namespace extractor { class ScriptingEnvironment; namespace lookup { #pragma pack(push, 1) struct TurnIndexBlock { OSMNodeID from_id; OSMNodeID via_id; OSMNodeID to_id; }; #pragma pack(pop) static_assert(std::is_trivial::value, "TurnIndexBlock is not trivial"); static_assert(sizeof(TurnIndexBlock) == 24, "TurnIndexBlock is not packed correctly"); } // ns lookup struct NodeBasedGraphToEdgeBasedGraphMappingWriter; // fwd. decl class EdgeBasedGraphFactory { public: EdgeBasedGraphFactory(const EdgeBasedGraphFactory &) = delete; EdgeBasedGraphFactory &operator=(const EdgeBasedGraphFactory &) = delete; explicit EdgeBasedGraphFactory(std::shared_ptr node_based_graph, CompressedEdgeContainer &compressed_edge_container, const std::unordered_set &barrier_nodes, const std::unordered_set &traffic_lights, std::shared_ptr restriction_map, const std::vector &coordinates, const extractor::PackedOSMIDs &osm_node_ids, ProfileProperties profile_properties, const util::NameTable &name_table, std::vector &turn_lane_offsets, std::vector &turn_lane_masks, guidance::LaneDescriptionMap &lane_description_map); void Run(ScriptingEnvironment &scripting_environment, const std::string &nodes_data_filename, const std::string &turn_data_filename, const std::string &turn_lane_data_filename, const std::string &turn_weight_penalties_filename, const std::string &turn_duration_penalties_filename, const std::string &turn_penalties_index_filename, const std::string &cnbg_ebg_mapping_path); // The following get access functions destroy the content in the factory void GetEdgeBasedEdges(util::DeallocatingVector &edges); void GetEdgeBasedNodes(std::vector &nodes); void GetStartPointMarkers(std::vector &node_is_startpoint); void GetEdgeBasedNodeWeights(std::vector &output_node_weights); // These access functions don't destroy the content const std::vector &GetBearingClassIds() const; std::vector &GetBearingClassIds(); std::vector GetBearingClasses() const; std::vector GetEntryClasses() const; unsigned GetHighestEdgeID(); // Basic analysis of a turn (u --(e1)-- v --(e2)-- w) // with known angle. // Handles special cases like u-turns and roundabouts // For basic turns, the turn based on the angle-classification is returned guidance::TurnInstruction AnalyzeTurn(const NodeID u, const EdgeID e1, const NodeID v, const EdgeID e2, const NodeID w, const double angle) const; private: using EdgeData = util::NodeBasedDynamicGraph::EdgeData; //! maps index from m_edge_based_node_list to ture/false if the node is an entry point to the //! graph std::vector m_edge_based_node_is_startpoint; //! node weights that indicate the length of the segment (node based) represented by the //! edge-based node std::vector m_edge_based_node_weights; //! list of edge based nodes (compressed segments) std::vector m_edge_based_node_list; util::DeallocatingVector m_edge_based_edge_list; EdgeID m_max_edge_id; const std::vector &m_coordinates; const extractor::PackedOSMIDs &m_osm_node_ids; std::shared_ptr m_node_based_graph; std::shared_ptr m_restriction_map; const std::unordered_set &m_barrier_nodes; const std::unordered_set &m_traffic_lights; CompressedEdgeContainer &m_compressed_edge_container; ProfileProperties profile_properties; const util::NameTable &name_table; std::vector &turn_lane_offsets; std::vector &turn_lane_masks; guidance::LaneDescriptionMap &lane_description_map; unsigned RenumberEdges(); std::vector GenerateEdgeExpandedNodes(const std::string &node_data_filename); void GenerateEdgeExpandedEdges(ScriptingEnvironment &scripting_environment, const std::string &original_edge_data_filename, const std::string &turn_lane_data_filename, const std::string &turn_weight_penalties_filename, const std::string &turn_duration_penalties_filename, const std::string &turn_penalties_index_filename); NBGToEBG InsertEdgeBasedNode(const NodeID u, const NodeID v); std::size_t restricted_turns_counter; std::size_t skipped_uturns_counter; std::size_t skipped_barrier_turns_counter; std::unordered_map bearing_class_hash; std::vector bearing_class_by_node_based_node; std::unordered_map entry_class_hash; }; } // namespace extractor } // namespace osrm #endif /* EDGE_BASED_GRAPH_FACTORY_HPP_ */