/* Copyright (c) 2014, Project OSRM, Dennis Luxen, others All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #ifndef PROCESSING_CHAIN_HPP #define PROCESSING_CHAIN_HPP #include "edge_based_graph_factory.hpp" #include "../data_structures/query_edge.hpp" #include "../data_structures/static_graph.hpp" class FingerPrint; struct EdgeBasedNode; struct lua_State; #include #include /** \brief class of 'prepare' utility. */ class Prepare { public: using EdgeData = QueryEdge::EdgeData; using InputEdge = DynamicGraph::InputEdge; using StaticEdge = StaticGraph::InputEdge; explicit Prepare(); Prepare(const Prepare &) = delete; ~Prepare(); int Process(int argc, char *argv[]); protected: bool ParseArguments(int argc, char *argv[]); void SetupScriptingEnvironment(lua_State *myLuaState, EdgeBasedGraphFactory::SpeedProfileProperties &speed_profile); void LoadRestrictionMap(const std::unordered_map &external_to_internal_node_map, RestrictionMap &restriction_map); unsigned CalculateEdgeChecksum(std::unique_ptr> node_based_edge_list); void ContractGraph(const std::size_t number_of_edge_based_nodes, DeallocatingVector& edge_based_edge_list, DeallocatingVector& contracted_edge_list); std::shared_ptr LoadNodeBasedGraph(std::vector &barrier_node_list, std::vector &traffic_light_list, RestrictionMap &restriction_map, std::vector& internal_to_external_node_map); std::pair BuildEdgeExpandedGraph(std::vector &internal_to_external_node_map, std::vector &node_based_edge_list, DeallocatingVector &edge_based_edge_list); void WriteNodeMapping(std::unique_ptr> internal_to_external_node_map); void BuildRTree(const std::vector &node_based_edge_list, const std::vector &internal_to_external_node_map); private: unsigned requested_num_threads; boost::filesystem::path config_file_path; boost::filesystem::path osrm_input_path; boost::filesystem::path restrictions_path; boost::filesystem::path preinfo_path; boost::filesystem::path profile_path; std::string node_output_path; std::string edge_output_path; std::string geometry_output_path; std::string graph_output_path; std::string rtree_nodes_output_path; std::string rtree_leafs_output_path; }; #endif // PROCESSING_CHAIN_HPP