72 lines
2.5 KiB
C++
72 lines
2.5 KiB
C++
|
#ifndef OSRM_EXTRACTOR_GUIDANCE_INTERSECTION_HANDLER_HPP_
|
||
|
|
#define OSRM_EXTRACTOR_GUIDANCE_INTERSECTION_HANDLER_HPP_
|
||
|
|
|
||
|
|
#include "extractor/guidance/intersection.hpp"
|
||
|
|
#include "extractor/query_node.hpp"
|
||
|
|
|
||
|
|
#include "util/name_table.hpp"
|
||
|
|
#include "util/node_based_graph.hpp"
|
||
|
|
|
||
|
|
#include <cstddef>
|
||
|
|
#include <vector>
|
||
|
|
|
||
|
|
namespace osrm
|
||
|
|
{
|
||
|
|
namespace extractor
|
||
|
|
{
|
||
|
|
namespace guidance
|
||
|
|
{
|
||
|
|
|
||
|
|
// Intersection handlers deal with all issues related to intersections.
|
||
|
|
// They assign appropriate turn operations to the TurnOperations.
|
||
|
|
// This base class provides both the interface and implementations for
|
||
|
|
// common functions.
|
||
|
|
class IntersectionHandler
|
||
|
|
{
|
||
|
|
public:
|
||
|
|
IntersectionHandler(const util::NodeBasedDynamicGraph &node_based_graph,
|
||
|
|
const std::vector<QueryNode> &node_info_list,
|
||
|
|
const util::NameTable &name_table);
|
||
|
|
virtual ~IntersectionHandler();
|
||
|
|
|
||
|
|
// check whether the handler can actually handle the intersection
|
||
|
|
virtual bool
|
||
|
|
canProcess(const NodeID nid, const EdgeID via_eid, const Intersection &intersection) const = 0;
|
||
|
|
|
||
|
|
// process the intersection
|
||
|
|
virtual Intersection
|
||
|
|
operator()(const NodeID nid, const EdgeID via_eid, Intersection intersection) const = 0;
|
||
|
|
|
||
|
|
protected:
|
||
|
|
const util::NodeBasedDynamicGraph &node_based_graph;
|
||
|
|
const std::vector<QueryNode> &node_info_list;
|
||
|
|
const util::NameTable &name_table;
|
||
|
|
|
||
|
|
// counts the number on allowed entry roads
|
||
|
|
std::size_t countValid(const Intersection &intersection) const;
|
||
|
|
|
||
|
|
// Decide on a basic turn types
|
||
|
|
TurnType findBasicTurnType(const EdgeID via_edge, const ConnectedRoad &candidate) const;
|
||
|
|
|
||
|
|
// Get the Instruction for an obvious turn
|
||
|
|
TurnInstruction getInstructionForObvious(const std::size_t number_of_candidates,
|
||
|
|
const EdgeID via_edge,
|
||
|
|
const bool through_street,
|
||
|
|
const ConnectedRoad &candidate) const;
|
||
|
|
|
||
|
|
// Treating potential forks
|
||
|
|
void assignFork(const EdgeID via_edge, ConnectedRoad &left, ConnectedRoad &right) const;
|
||
|
|
void assignFork(const EdgeID via_edge,
|
||
|
|
ConnectedRoad &left,
|
||
|
|
ConnectedRoad ¢er,
|
||
|
|
ConnectedRoad &right) const;
|
||
|
|
|
||
|
|
bool isThroughStreet(const std::size_t index, const Intersection &intersection) const;
|
||
|
|
};
|
||
|
|
|
||
|
|
} // namespace guidance
|
||
|
|
} // namespace extractor
|
||
|
|
} // namespace osrm
|
||
|
|
|
||
|
|
#endif /*OSRM_EXTRACTOR_GUIDANCE_INTERSECTION_HANDLER_HPP_*/
|