/
srv
/
osrm
/
osrm-backend
/
include
/
extractor
/
/srv/osrm/osrm-backend/include/extractor
mkdir
upload
Name
Size
Mode
Actions
intersection/
-
0755
rm
class_data.hpp
981
0644
edit
dl
rm
compressed_edge_container.hpp
3336
0644
edit
dl
rm
compressed_node_based_graph_edge.hpp
418
0644
edit
dl
rm
conditional_turn_penalty.hpp
589
0644
edit
dl
rm
datasources.hpp
1207
0644
edit
dl
rm
edge_based_edge.hpp
3467
0644
edit
dl
rm
edge_based_graph_factory.hpp
7787
0644
edit
dl
rm
edge_based_node.hpp
383
0644
edit
dl
rm
edge_based_node_segment.hpp
2050
0644
edit
dl
rm
extraction_containers.hpp
3679
0644
edit
dl
rm
extraction_helper_functions.hpp
4827
0644
edit
dl
rm
extraction_node.hpp
459
0644
edit
dl
rm
extraction_relation.hpp
5949
0644
edit
dl
rm
extraction_segment.hpp
715
0644
edit
dl
rm
extraction_turn.hpp
4983
0644
edit
dl
rm
extraction_way.hpp
4268
0644
edit
dl
rm
extractor.hpp
5267
0644
edit
dl
rm
extractor_callbacks.hpp
3249
0644
edit
dl
rm
extractor_config.hpp
3040
0644
edit
dl
rm
files.hpp
24372
0644
edit
dl
rm
graph_compressor.hpp
1271
0644
edit
dl
rm
internal_extractor_edge.hpp
2642
0644
edit
dl
rm
intersection_bearings_container.hpp
4487
0644
edit
dl
rm
location_dependent_data.hpp
1797
0644
edit
dl
rm
maneuver_override.hpp
5456
0644
edit
dl
rm
maneuver_override_relation_parser.hpp
1785
0644
edit
dl
rm
name_table.hpp
3596
0644
edit
dl
rm
nbg_to_ebg.hpp
450
0644
edit
dl
rm
nodes_of_way.hpp
1411
0644
edit
dl
rm
node_based_edge.hpp
8024
0644
edit
dl
rm
node_based_graph_factory.hpp
5155
0644
edit
dl
rm
node_data_container.hpp
4558
0644
edit
dl
rm
node_restriction_map.hpp
2292
0644
edit
dl
rm
packed_osm_ids.hpp
520
0644
edit
dl
rm
profile_properties.hpp
5029
0644
edit
dl
rm
query_node.hpp
1411
0644
edit
dl
rm
raster_source.hpp
5002
0644
edit
dl
rm
restriction.hpp
1750
0644
edit
dl
rm
restriction_graph.hpp
4500
0644
edit
dl
rm
restriction_parser.hpp
1768
0644
edit
dl
rm
road_classification.hpp
8390
0644
edit
dl
rm
scripting_environment.hpp
2426
0644
edit
dl
rm
scripting_environment_lua.hpp
4253
0644
edit
dl
rm
segment_data_container.hpp
8032
0644
edit
dl
rm
serialization.hpp
8834
0644
edit
dl
rm
suffix_table.hpp
1407
0644
edit
dl
rm
traffic_lights.hpp
514
0644
edit
dl
rm
traffic_signals.hpp
656
0644
edit
dl
rm
travel_mode.hpp
3666
0644
edit
dl
rm
turn_lane_types.hpp
3754
0644
edit
dl
rm
turn_path.hpp
7483
0644
edit
dl
rm
turn_path_compressor.hpp
2220
0644
edit
dl
rm
turn_path_filter.hpp
669
0644
edit
dl
rm
way_restriction_map.hpp
3114
0644
edit
dl
rm
Edit:
/srv/osrm/osrm-backend/include/extractor/edge_based_graph_factory.hpp
(7787B)
// 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/conditional_turn_penalty.hpp" #include "extractor/edge_based_edge.hpp" #include "extractor/edge_based_node_segment.hpp" #include "extractor/extraction_turn.hpp" #include "extractor/maneuver_override.hpp" #include "extractor/name_table.hpp" #include "extractor/nbg_to_ebg.hpp" #include "extractor/node_data_container.hpp" #include "extractor/node_restriction_map.hpp" #include "extractor/query_node.hpp" #include "extractor/turn_lane_types.hpp" #include "extractor/way_restriction_map.hpp" #include "util/concurrent_id_map.hpp" #include "util/deallocating_vector.hpp" #include "util/node_based_graph.hpp" #include "util/typedefs.hpp" #include "storage/io.hpp" #include "traffic_signals.hpp" #include <algorithm> #include <cstddef> #include <cstdint> #include <iosfwd> #include <memory> #include <queue> #include <string> #include <unordered_map> #include <unordered_set> #include <vector> namespace osrm::extractor { class ScriptingEnvironment; namespace lookup { #pragma pack(push, 1) struct TurnIndexBlock { NodeID from_id; NodeID via_id; NodeID to_id; }; #pragma pack(pop) static_assert(std::is_trivial<TurnIndexBlock>::value, "TurnIndexBlock is not trivial"); static_assert(sizeof(TurnIndexBlock) == 12, "TurnIndexBlock is not packed correctly"); } // namespace lookup struct NodeBasedGraphToEdgeBasedGraphMappingWriter; // fwd. decl class EdgeBasedGraphFactory { public: EdgeBasedGraphFactory(const EdgeBasedGraphFactory &) = delete; EdgeBasedGraphFactory &operator=(const EdgeBasedGraphFactory &) = delete; explicit EdgeBasedGraphFactory(const util::NodeBasedDynamicGraph &node_based_graph, EdgeBasedNodeDataContainer &node_data_container, const CompressedEdgeContainer &compressed_edge_container, const std::unordered_set<NodeID> &barrier_nodes, const TrafficSignals &traffic_signals, const std::vector<util::Coordinate> &coordinates, const NameTable &name_table, const std::unordered_set<EdgeID> &segregated_edges, const LaneDescriptionMap &lane_description_map); void Run(ScriptingEnvironment &scripting_environment, 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, const std::string &conditional_penalties_filename, const std::string &maneuver_overrides_filename, const RestrictionMap &node_restriction_map, const ConditionalRestrictionMap &conditional_restriction_map, const WayRestrictionMap &way_restriction_map, const std::vector<UnresolvedManeuverOverride> &maneuver_overrides); // The following get access functions destroy the content in the factory void GetEdgeBasedEdges(util::DeallocatingVector<EdgeBasedEdge> &edges); void GetEdgeBasedNodeSegments(std::vector<EdgeBasedNodeSegment> &nodes); void GetEdgeBasedNodeWeights(std::vector<EdgeWeight> &output_node_weights); void GetEdgeBasedNodeDurations(std::vector<EdgeDuration> &output_node_durations); void GetEdgeBasedNodeDistances(std::vector<EdgeDistance> &output_node_distances); std::uint32_t GetConnectivityChecksum() const; std::uint64_t GetNumberOfEdgeBasedNodes() const; private: using EdgeData = util::NodeBasedDynamicGraph::EdgeData; struct Conditional { // the edge based nodes allow for a unique identification of conditionals NodeID from_node; NodeID to_node; ConditionalTurnPenalty penalty; }; // assign the correct index to the penalty value stored in the conditional std::vector<ConditionalTurnPenalty> IndexConditionals(std::vector<Conditional> &&conditionals) const; //! node weights that indicate the length of the segment (node based) represented by the //! edge-based node std::vector<EdgeWeight> m_edge_based_node_weights; std::vector<EdgeDuration> m_edge_based_node_durations; std::vector<EdgeDistance> m_edge_based_node_distances; //! list of edge based nodes (compressed segments) std::vector<EdgeBasedNodeSegment> m_edge_based_node_segments; EdgeBasedNodeDataContainer &m_edge_based_node_container; util::DeallocatingVector<EdgeBasedEdge> m_edge_based_edge_list; std::uint32_t m_connectivity_checksum; // The number of edge-based nodes is mostly made up out of the edges in the node-based graph. // Any edge in the node-based graph represents a node in the edge-based graph. In addition, we // add a set of artificial edge-based nodes into the mix to model via-way turn restrictions. // See https://github.com/Project-OSRM/osrm-backend/issues/2681#issuecomment-313080353 for // reference std::uint64_t m_number_of_edge_based_nodes; const std::vector<util::Coordinate> &m_coordinates; const util::NodeBasedDynamicGraph &m_node_based_graph; const std::unordered_set<NodeID> &m_barrier_nodes; const TrafficSignals &m_traffic_signals; const CompressedEdgeContainer &m_compressed_edge_container; const NameTable &name_table; const std::unordered_set<EdgeID> &segregated_edges; const LaneDescriptionMap &lane_description_map; // In the edge based graph, any traversable (non reversed) edge of the node-based graph forms a // node of the edge-based graph. To be able to name these nodes, we loop over the node-based // graph and create a mapping from edges (node-based) to nodes (edge-based). The mapping is // essentially a prefix-sum over all previous non-reversed edges of the node-based graph. unsigned LabelEdgeBasedNodes(); // During the generation of the edge-expanded nodes, we need to also generate duplicates that // represent state during via-way restrictions (see // https://github.com/Project-OSRM/osrm-backend/issues/2681#issuecomment-313080353). Access to // the information on what to duplicate and how is provided via the way_restriction_map std::vector<NBGToEBG> GenerateEdgeExpandedNodes(const WayRestrictionMap &way_restriction_map); // Edge-expanded edges are generate for all valid turns. The validity can be checked via the // restriction maps void GenerateEdgeExpandedEdges(ScriptingEnvironment &scripting_environment, const std::string &turn_weight_penalties_filename, const std::string &turn_duration_penalties_filename, const std::string &turn_penalties_index_filename, const std::string &conditional_turn_penalties_filename, const std::string &maneuver_overrides_filename, const RestrictionMap &node_restriction_map, const ConditionalRestrictionMap &conditional_restriction_map, const WayRestrictionMap &way_restriction_map, const std::vector<UnresolvedManeuverOverride> &maneuver_overrides); NBGToEBG InsertEdgeBasedNode(const NodeID u, const NodeID v); // mapping of node-based edges to edge-based nodes std::vector<NodeID> nbe_to_ebn_mapping; }; } // namespace osrm::extractor #endif /* EDGE_BASED_GRAPH_FACTORY_HPP_ */
Save
cmd:
run