118 lines
4.1 KiB
C++
118 lines
4.1 KiB
C++
#ifndef OSRM_GUIDANCE_TURN_HANDLER_HPP_
|
|
#define OSRM_GUIDANCE_TURN_HANDLER_HPP_
|
|
|
|
#include "extractor/name_table.hpp"
|
|
#include "extractor/query_node.hpp"
|
|
|
|
#include "guidance/intersection.hpp"
|
|
#include "guidance/intersection_handler.hpp"
|
|
#include "guidance/is_through_street.hpp"
|
|
|
|
#include "util/attributes.hpp"
|
|
#include "util/node_based_graph.hpp"
|
|
|
|
#include <boost/optional.hpp>
|
|
|
|
#include <cstddef>
|
|
#include <utility>
|
|
#include <vector>
|
|
|
|
namespace osrm
|
|
{
|
|
namespace guidance
|
|
{
|
|
|
|
// Intersection handlers deal with all issues related to intersections.
|
|
class TurnHandler : public IntersectionHandler
|
|
{
|
|
public:
|
|
TurnHandler(const util::NodeBasedDynamicGraph &node_based_graph,
|
|
const extractor::EdgeBasedNodeDataContainer &node_data_container,
|
|
const std::vector<util::Coordinate> &coordinates,
|
|
const extractor::CompressedEdgeContainer &compressed_geometries,
|
|
const extractor::RestrictionMap &node_restriction_map,
|
|
const std::unordered_set<NodeID> &barrier_nodes,
|
|
const extractor::TurnLanesIndexedArray &turn_lanes_data,
|
|
const extractor::NameTable &name_table,
|
|
const extractor::SuffixTable &street_name_suffix_table);
|
|
|
|
~TurnHandler() override final = default;
|
|
|
|
// check whether the handler can actually handle the intersection
|
|
bool canProcess(const NodeID nid,
|
|
const EdgeID via_eid,
|
|
const Intersection &intersection) const override final;
|
|
|
|
// process the intersection
|
|
Intersection operator()(const NodeID nid,
|
|
const EdgeID via_eid,
|
|
Intersection intersection) const override final;
|
|
|
|
private:
|
|
struct Fork
|
|
{
|
|
const Intersection::iterator intersection_base;
|
|
const Intersection::iterator begin;
|
|
const Intersection::iterator end;
|
|
const std::size_t size;
|
|
Fork(const Intersection::iterator intersection_base,
|
|
const Intersection::iterator begin,
|
|
const Intersection::iterator end);
|
|
ConnectedRoad &getRight() const;
|
|
ConnectedRoad &getLeft() const;
|
|
ConnectedRoad &getMiddle() const;
|
|
ConnectedRoad &getRight();
|
|
ConnectedRoad &getLeft();
|
|
ConnectedRoad &getMiddle();
|
|
std::size_t getRightIndex() const;
|
|
std::size_t getLeftIndex() const;
|
|
};
|
|
|
|
bool isObviousOfTwo(const EdgeID via_edge,
|
|
const ConnectedRoad &road,
|
|
const ConnectedRoad &other) const;
|
|
|
|
bool hasObvious(const EdgeID &via_edge, const Fork &fork) const;
|
|
|
|
boost::optional<Fork> findForkCandidatesByGeometry(Intersection &intersection) const;
|
|
|
|
bool isCompatibleByRoadClass(const Intersection &intersection, const Fork fork) const;
|
|
|
|
// Dead end.
|
|
OSRM_ATTR_WARN_UNUSED
|
|
Intersection handleOneWayTurn(Intersection intersection) const;
|
|
|
|
// Mode Changes, new names...
|
|
OSRM_ATTR_WARN_UNUSED
|
|
Intersection handleTwoWayTurn(const EdgeID via_edge, Intersection intersection) const;
|
|
|
|
// Forks, T intersections and similar
|
|
OSRM_ATTR_WARN_UNUSED
|
|
Intersection handleThreeWayTurn(const EdgeID via_edge, Intersection intersection) const;
|
|
|
|
// Handling of turns larger then degree three
|
|
OSRM_ATTR_WARN_UNUSED
|
|
Intersection handleComplexTurn(const EdgeID via_edge, Intersection intersection) const;
|
|
|
|
void
|
|
handleDistinctConflict(const EdgeID via_edge, ConnectedRoad &left, ConnectedRoad &right) const;
|
|
|
|
// Classification
|
|
boost::optional<Fork> findFork(const EdgeID via_edge, Intersection &intersection) const;
|
|
|
|
OSRM_ATTR_WARN_UNUSED
|
|
Intersection assignLeftTurns(const EdgeID via_edge,
|
|
Intersection intersection,
|
|
const std::size_t starting_at) const;
|
|
|
|
OSRM_ATTR_WARN_UNUSED
|
|
Intersection assignRightTurns(const EdgeID via_edge,
|
|
Intersection intersection,
|
|
const std::size_t up_to) const;
|
|
};
|
|
|
|
} // namespace guidance
|
|
} // namespace osrm
|
|
|
|
#endif /*OSRM_GUIDANCE_TURN_HANDLER_HPP_*/
|