/* 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 "contractor_options.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(const ContractorConfig& contractor_config) : config(contractor_config) {} Prepare(const Prepare &) = delete; ~Prepare(); int Run(); protected: void SetupScriptingEnvironment(lua_State *myLuaState, EdgeBasedGraphFactory::SpeedProfileProperties &speed_profile); std::shared_ptr LoadRestrictionMap(); 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::size_t WriteContractedGraph(unsigned number_of_edge_based_nodes, std::unique_ptr> node_based_edge_list, std::unique_ptr> contracted_edge_list); std::shared_ptr LoadNodeBasedGraph(std::vector &barrier_node_list, std::vector &traffic_light_list, 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: ContractorConfig config; }; #endif // PROCESSING_CHAIN_HPP