df3c39cef5
removes duplicated includes removes unused includes eliminates dedicated toolkits that resulted in circular dependencies moves functionality close to data, where possible
126 lines
3.3 KiB
C++
126 lines
3.3 KiB
C++
#ifndef ROUTE_STEP_HPP
|
|
#define ROUTE_STEP_HPP
|
|
|
|
#include "extractor/travel_mode.hpp"
|
|
#include "engine/guidance/step_maneuver.hpp"
|
|
#include "util/coordinate.hpp"
|
|
#include "util/guidance/bearing_class.hpp"
|
|
#include "util/guidance/entry_class.hpp"
|
|
|
|
#include "extractor/guidance/turn_lane_types.hpp"
|
|
#include "util/guidance/turn_lanes.hpp"
|
|
|
|
#include <cstddef>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
#include <boost/range/iterator_range.hpp>
|
|
|
|
namespace osrm
|
|
{
|
|
namespace engine
|
|
{
|
|
namespace guidance
|
|
{
|
|
// Given the following turn from a,b to b,c over b:
|
|
// a --> b --> c
|
|
// this struct saves the information of the segment b,c.
|
|
// Notable exceptions are Departure and Arrival steps.
|
|
// Departure: s --> a --> b. Represents the segment s,a with location being s.
|
|
// Arrive: a --> b --> t. The segment (b,t) is already covered by the previous segment.
|
|
|
|
// A representation of intermediate intersections
|
|
struct Intersection
|
|
{
|
|
static const constexpr std::size_t NO_INDEX = std::numeric_limits<std::size_t>::max();
|
|
util::Coordinate location;
|
|
std::vector<short> bearings;
|
|
std::vector<bool> entry;
|
|
std::size_t in;
|
|
std::size_t out;
|
|
|
|
// turn lane information
|
|
util::guidance::LaneTuple lanes;
|
|
extractor::guidance::TurnLaneDescription lane_description;
|
|
};
|
|
|
|
inline Intersection getInvalidIntersection()
|
|
{
|
|
return {util::Coordinate{util::FloatLongitude{0.0}, util::FloatLatitude{0.0}},
|
|
{},
|
|
{},
|
|
Intersection::NO_INDEX,
|
|
Intersection::NO_INDEX,
|
|
util::guidance::LaneTuple(),
|
|
{}};
|
|
}
|
|
|
|
struct RouteStep
|
|
{
|
|
unsigned name_id;
|
|
std::string name;
|
|
std::string ref;
|
|
std::string pronunciation;
|
|
std::string destinations;
|
|
std::string rotary_name;
|
|
std::string rotary_pronunciation;
|
|
double duration;
|
|
double distance;
|
|
extractor::TravelMode mode;
|
|
StepManeuver maneuver;
|
|
// indices into the locations array stored the LegGeometry
|
|
std::size_t geometry_begin;
|
|
std::size_t geometry_end;
|
|
std::vector<Intersection> intersections;
|
|
|
|
LaneID numLanesToTheRight() const
|
|
{
|
|
return intersections.front().lanes.first_lane_from_the_right;
|
|
}
|
|
|
|
LaneID numLanesToTheLeft() const
|
|
{
|
|
LaneID const total = intersections.front().lane_description.size();
|
|
return total - (intersections.front().lanes.lanes_in_turn +
|
|
intersections.front().lanes.first_lane_from_the_right);
|
|
}
|
|
|
|
auto lanesToTheLeft() const
|
|
{
|
|
const auto &description = intersections.front().lane_description;
|
|
LaneID num_lanes_left = numLanesToTheLeft();
|
|
return boost::make_iterator_range(description.begin(),
|
|
description.begin() + num_lanes_left);
|
|
}
|
|
|
|
auto lanesToTheRight() const
|
|
{
|
|
const auto &description = intersections.front().lane_description;
|
|
LaneID num_lanes_right = numLanesToTheRight();
|
|
return boost::make_iterator_range(description.end() - num_lanes_right, description.end());
|
|
}
|
|
};
|
|
|
|
inline RouteStep getInvalidRouteStep()
|
|
{
|
|
return {0,
|
|
"",
|
|
"",
|
|
"",
|
|
"",
|
|
"",
|
|
"",
|
|
0,
|
|
0,
|
|
TRAVEL_MODE_INACCESSIBLE,
|
|
getInvalidStepManeuver(),
|
|
0,
|
|
0,
|
|
{getInvalidIntersection()}};
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#endif
|