mirror of
https://codeberg.org/comaps/comaps
synced 2025-12-20 13:23:59 +00:00
Organic Maps sources as of 02.04.2025 (fad26bbf22ac3da75e01e62aa01e5c8e11861005)
To expand with full Organic Maps and Maps.ME commits history run: git remote add om-historic [om-historic.git repo url] git fetch --tags om-historic git replace squashed-history historic-commits
This commit is contained in:
503
routing/routing_tests/turns_generator_test.cpp
Normal file
503
routing/routing_tests/turns_generator_test.cpp
Normal file
@@ -0,0 +1,503 @@
|
||||
#include "testing/testing.hpp"
|
||||
|
||||
#include "routing/routing_tests/tools.hpp"
|
||||
|
||||
#include "routing/loaded_path_segment.hpp"
|
||||
#include "routing/route.hpp"
|
||||
#include "routing/routing_result_graph.hpp"
|
||||
#include "routing/turns.hpp"
|
||||
#include "routing/turns_generator_utils.hpp"
|
||||
#include "routing/turns_generator.hpp"
|
||||
#include "routing/car_directions.hpp"
|
||||
|
||||
#include "indexer/ftypes_matcher.hpp"
|
||||
|
||||
#include "geometry/mercator.hpp"
|
||||
#include "geometry/point2d.hpp"
|
||||
#include "geometry/point_with_altitude.hpp"
|
||||
|
||||
#include "base/macros.hpp"
|
||||
|
||||
#include <cmath>
|
||||
#include <string>
|
||||
#include <vector>
|
||||
|
||||
namespace turn_generator_test
|
||||
{
|
||||
using namespace routing;
|
||||
using namespace std;
|
||||
using namespace turns;
|
||||
|
||||
// It's a dummy class to wrap |segments| for tests.
|
||||
class RoutingResultTest : public IRoutingResult
|
||||
{
|
||||
public:
|
||||
explicit RoutingResultTest(TUnpackedPathSegments const & segments) : m_segments(segments) {}
|
||||
|
||||
TUnpackedPathSegments const & GetSegments() const override { return m_segments; }
|
||||
|
||||
void GetPossibleTurns(SegmentRange const & segmentRange, m2::PointD const & junctionPoint,
|
||||
size_t & ingoingCount, TurnCandidates & outgoingTurns) const override
|
||||
{
|
||||
outgoingTurns.candidates.emplace_back(0.0, Segment(), ftypes::HighwayClass::Tertiary, false);
|
||||
outgoingTurns.isCandidatesAngleValid = false;
|
||||
}
|
||||
|
||||
double GetPathLength() const override
|
||||
{
|
||||
NOTIMPLEMENTED();
|
||||
return 0.0;
|
||||
}
|
||||
|
||||
geometry::PointWithAltitude GetStartPoint() const override
|
||||
{
|
||||
NOTIMPLEMENTED();
|
||||
return geometry::PointWithAltitude();
|
||||
}
|
||||
|
||||
geometry::PointWithAltitude GetEndPoint() const override
|
||||
{
|
||||
NOTIMPLEMENTED();
|
||||
return geometry::PointWithAltitude();
|
||||
}
|
||||
|
||||
private:
|
||||
TUnpackedPathSegments m_segments;
|
||||
};
|
||||
|
||||
UNIT_TEST(TestSplitLanes)
|
||||
{
|
||||
vector<string> result;
|
||||
SplitLanes("through|through|through|through;right", '|', result);
|
||||
vector<string> const expected1 = {"through", "through", "through", "through;right"};
|
||||
TEST_EQUAL(result, expected1, ());
|
||||
|
||||
SplitLanes("adsjkddfasui8747&sxdsdlad8\"\'", '|', result);
|
||||
TEST_EQUAL(result, vector<string>({"adsjkddfasui8747&sxdsdlad8\"\'"}), ());
|
||||
|
||||
SplitLanes("|||||||", '|', result);
|
||||
vector<string> expected2 = {"", "", "", "", "", "", ""};
|
||||
TEST_EQUAL(result, expected2, ());
|
||||
}
|
||||
|
||||
UNIT_TEST(TestParseSingleLane)
|
||||
{
|
||||
TSingleLane result;
|
||||
TEST(ParseSingleLane("through;right", ';', result), ());
|
||||
TSingleLane const expected1 = {LaneWay::Through, LaneWay::Right};
|
||||
TEST_EQUAL(result, expected1, ());
|
||||
|
||||
TEST(!ParseSingleLane("through;Right", ';', result), ());
|
||||
|
||||
TEST(!ParseSingleLane("through ;right", ';', result), ());
|
||||
TEST_EQUAL(result.size(), 0, ());
|
||||
|
||||
TEST(!ParseSingleLane("SD32kk*887;;", ';', result), ());
|
||||
TEST_EQUAL(result.size(), 0, ());
|
||||
|
||||
TEST(!ParseSingleLane("Что-то на кириллице", ';', result), ());
|
||||
TEST_EQUAL(result.size(), 0, ());
|
||||
|
||||
TEST(!ParseSingleLane("משהו בעברית", ';', result), ());
|
||||
TEST_EQUAL(result.size(), 0, ());
|
||||
|
||||
TEST(ParseSingleLane("left;through", ';', result), ());
|
||||
TSingleLane expected2 = {LaneWay::Left, LaneWay::Through};
|
||||
TEST_EQUAL(result, expected2, ());
|
||||
|
||||
TEST(ParseSingleLane("left", ';', result), ());
|
||||
TEST_EQUAL(result.size(), 1, ());
|
||||
TEST_EQUAL(result[0], LaneWay::Left, ());
|
||||
|
||||
TEST(ParseSingleLane("left;", ';', result), ());
|
||||
TSingleLane expected3 = {LaneWay::Left, LaneWay::None};
|
||||
TEST_EQUAL(result, expected3, ());
|
||||
|
||||
TEST(ParseSingleLane(";", ';', result), ());
|
||||
TSingleLane expected4 = {LaneWay::None, LaneWay::None};
|
||||
TEST_EQUAL(result, expected4, ());
|
||||
|
||||
TEST(ParseSingleLane("", ';', result), ());
|
||||
TSingleLane expected5 = {LaneWay::None};
|
||||
TEST_EQUAL(result, expected5, ());
|
||||
}
|
||||
|
||||
UNIT_TEST(TestParseLanes)
|
||||
{
|
||||
vector<SingleLaneInfo> result;
|
||||
TEST(ParseLanes("through|through|through|through;right", result), ());
|
||||
vector<SingleLaneInfo> const expected1 = {{LaneWay::Through},
|
||||
{LaneWay::Through},
|
||||
{LaneWay::Through},
|
||||
{LaneWay::Through, LaneWay::Right}};
|
||||
TEST_EQUAL(result, expected1, ());
|
||||
|
||||
TEST(ParseLanes("left|left;through|through|through", result), ());
|
||||
vector<SingleLaneInfo> const expected2 = {
|
||||
{LaneWay::Left}, {LaneWay::Left, LaneWay::Through}, {LaneWay::Through}, {LaneWay::Through}};
|
||||
TEST_EQUAL(result, expected2, ());
|
||||
|
||||
TEST(ParseLanes("left|through|through", result), ());
|
||||
vector<SingleLaneInfo> const expected3 = {
|
||||
{LaneWay::Left}, {LaneWay::Through}, {LaneWay::Through}};
|
||||
TEST_EQUAL(result, expected3, ());
|
||||
|
||||
TEST(ParseLanes("left|le ft| through|through | right", result), ());
|
||||
vector<SingleLaneInfo> const expected4 = {
|
||||
{LaneWay::Left}, {LaneWay::Left}, {LaneWay::Through}, {LaneWay::Through}, {LaneWay::Right}};
|
||||
TEST_EQUAL(result, expected4, ());
|
||||
|
||||
TEST(ParseLanes("left|Left|through|througH|right", result), ());
|
||||
vector<SingleLaneInfo> const expected5 = {
|
||||
{LaneWay::Left}, {LaneWay::Left}, {LaneWay::Through}, {LaneWay::Through}, {LaneWay::Right}};
|
||||
TEST_EQUAL(result, expected5, ());
|
||||
|
||||
TEST(ParseLanes("left|Left|through|througH|through;right;sharp_rIght", result), ());
|
||||
vector<SingleLaneInfo> const expected6 = {
|
||||
{LaneWay::Left},
|
||||
{LaneWay::Left},
|
||||
{LaneWay::Through},
|
||||
{LaneWay::Through},
|
||||
{LaneWay::Through, LaneWay::Right, LaneWay::SharpRight}};
|
||||
TEST_EQUAL(result, expected6, ());
|
||||
|
||||
TEST(!ParseLanes("left|Leftt|through|througH|right", result), ());
|
||||
TEST_EQUAL(result.size(), 0, ());
|
||||
|
||||
TEST(!ParseLanes("Что-то на кириллице", result), ());
|
||||
TEST_EQUAL(result.size(), 0, ());
|
||||
|
||||
TEST(!ParseLanes("משהו בעברית", result), ());
|
||||
TEST_EQUAL(result.size(), 0, ());
|
||||
|
||||
TEST(ParseLanes("left |Left|through|througH|right", result), ());
|
||||
vector<SingleLaneInfo> const expected7 = {
|
||||
{LaneWay::Left}, {LaneWay::Left}, {LaneWay::Through}, {LaneWay::Through}, {LaneWay::Right}};
|
||||
TEST_EQUAL(result, expected7, ());
|
||||
|
||||
TEST(ParseLanes("|||||slight_right", result), ());
|
||||
vector<SingleLaneInfo> const expected8 = {
|
||||
{LaneWay::None},
|
||||
{LaneWay::None},
|
||||
{LaneWay::None},
|
||||
{LaneWay::None},
|
||||
{LaneWay::None},
|
||||
{LaneWay::SlightRight}
|
||||
};
|
||||
TEST_EQUAL(result, expected8, ());
|
||||
}
|
||||
|
||||
UNIT_TEST(TestFixupTurns)
|
||||
{
|
||||
double const kHalfSquareSideMeters = 10.;
|
||||
m2::PointD const kSquareCenterLonLat = {0., 0.};
|
||||
m2::RectD const kSquareNearZero =
|
||||
mercator::MetersToXY(kSquareCenterLonLat.x, kSquareCenterLonLat.y, kHalfSquareSideMeters);
|
||||
{
|
||||
// Removing a turn in case staying on a roundabout.
|
||||
vector<m2::PointD> const pointsMerc1 =
|
||||
{{kSquareNearZero.minX(), kSquareNearZero.minY()},
|
||||
{kSquareNearZero.minX(), kSquareNearZero.minY()},
|
||||
{kSquareNearZero.maxX(), kSquareNearZero.maxY()},
|
||||
{kSquareNearZero.maxX(), kSquareNearZero.minY()}};
|
||||
// The constructor TurnItem(uint32_t idx, CarDirection t, uint32_t exitNum = 0)
|
||||
// is used for initialization of vector<TurnItem> below.
|
||||
vector<turns::TurnItem> turnsDir1 =
|
||||
{{1, CarDirection::EnterRoundAbout},
|
||||
{2, CarDirection::StayOnRoundAbout},
|
||||
{3, CarDirection::LeaveRoundAbout}};
|
||||
vector<RouteSegment> routeSegments;
|
||||
RouteSegmentsFrom({}, pointsMerc1, turnsDir1, {}, routeSegments);
|
||||
FixupCarTurns(routeSegments);
|
||||
vector<turns::TurnItem> const expectedTurnDir1 =
|
||||
{{1, CarDirection::EnterRoundAbout, 2},
|
||||
{2, CarDirection::None, 0},
|
||||
{3, CarDirection::LeaveRoundAbout, 2}};
|
||||
TEST_EQUAL(routeSegments[0].GetTurn(), expectedTurnDir1[0], ());
|
||||
TEST_EQUAL(routeSegments[1].GetTurn(), expectedTurnDir1[1], ());
|
||||
TEST_EQUAL(routeSegments[2].GetTurn(), expectedTurnDir1[2], ());
|
||||
}
|
||||
{
|
||||
// Merging turns which are close to each other.
|
||||
vector<m2::PointD> const pointsMerc2 =
|
||||
{{kSquareNearZero.minX(), kSquareNearZero.minY()},
|
||||
{kSquareNearZero.minX(), kSquareNearZero.minY()},
|
||||
{kSquareCenterLonLat.x, kSquareCenterLonLat.y},
|
||||
{kSquareNearZero.maxX(), kSquareNearZero.maxY()}};
|
||||
vector<turns::TurnItem> turnsDir2 =
|
||||
{{1, CarDirection::None},
|
||||
{2, CarDirection::GoStraight},
|
||||
{3, CarDirection::TurnLeft}};
|
||||
vector<RouteSegment> routeSegments2;
|
||||
RouteSegmentsFrom({}, pointsMerc2, turnsDir2, {}, routeSegments2);
|
||||
FixupCarTurns(routeSegments2);
|
||||
vector<turns::TurnItem> const expectedTurnDir2 =
|
||||
{{1, CarDirection::None},
|
||||
{2, CarDirection::None},
|
||||
{3, CarDirection::TurnLeft}};
|
||||
TEST_EQUAL(routeSegments2[0].GetTurn(), expectedTurnDir2[0], ());
|
||||
TEST_EQUAL(routeSegments2[1].GetTurn(), expectedTurnDir2[1], ());
|
||||
TEST_EQUAL(routeSegments2[2].GetTurn(), expectedTurnDir2[2], ());
|
||||
}
|
||||
{
|
||||
// No turn is removed.
|
||||
vector<m2::PointD> const pointsMerc3 = {
|
||||
{kSquareNearZero.minX(), kSquareNearZero.minY()},
|
||||
{kSquareNearZero.minX(), kSquareNearZero.maxY()},
|
||||
{kSquareNearZero.maxX(), kSquareNearZero.maxY()},
|
||||
};
|
||||
vector<turns::TurnItem> turnsDir3 = {{1, CarDirection::None},
|
||||
{2, CarDirection::TurnRight}};
|
||||
|
||||
vector<RouteSegment> routeSegments3;
|
||||
RouteSegmentsFrom({}, {}, turnsDir3, {}, routeSegments3);
|
||||
FixupCarTurns(routeSegments3);
|
||||
vector<turns::TurnItem> const expectedTurnDir3 = {{1, CarDirection::None},
|
||||
{2, CarDirection::TurnRight}};
|
||||
|
||||
TEST_EQUAL(routeSegments3[0].GetTurn(), expectedTurnDir3[0], ());
|
||||
TEST_EQUAL(routeSegments3[1].GetTurn(), expectedTurnDir3[1], ());
|
||||
}
|
||||
}
|
||||
|
||||
UNIT_TEST(TestIsLaneWayConformedTurnDirection)
|
||||
{
|
||||
TEST(IsLaneWayConformedTurnDirection(LaneWay::Left, CarDirection::TurnLeft), ());
|
||||
TEST(IsLaneWayConformedTurnDirection(LaneWay::Right, CarDirection::TurnRight), ());
|
||||
TEST(IsLaneWayConformedTurnDirection(LaneWay::SlightLeft, CarDirection::TurnSlightLeft), ());
|
||||
TEST(IsLaneWayConformedTurnDirection(LaneWay::SharpRight, CarDirection::TurnSharpRight), ());
|
||||
TEST(IsLaneWayConformedTurnDirection(LaneWay::Reverse, CarDirection::UTurnLeft), ());
|
||||
TEST(IsLaneWayConformedTurnDirection(LaneWay::Reverse, CarDirection::UTurnRight), ());
|
||||
TEST(IsLaneWayConformedTurnDirection(LaneWay::Through, CarDirection::GoStraight), ());
|
||||
|
||||
TEST(!IsLaneWayConformedTurnDirection(LaneWay::Left, CarDirection::TurnSlightLeft), ());
|
||||
TEST(!IsLaneWayConformedTurnDirection(LaneWay::Right, CarDirection::TurnSharpRight), ());
|
||||
TEST(!IsLaneWayConformedTurnDirection(LaneWay::SlightLeft, CarDirection::GoStraight), ());
|
||||
TEST(!IsLaneWayConformedTurnDirection(LaneWay::SharpRight, CarDirection::None), ());
|
||||
TEST(!IsLaneWayConformedTurnDirection(LaneWay::Reverse, CarDirection::TurnLeft), ());
|
||||
TEST(!IsLaneWayConformedTurnDirection(LaneWay::None, CarDirection::ReachedYourDestination), ());
|
||||
}
|
||||
|
||||
UNIT_TEST(TestIsLaneWayConformedTurnDirectionApproximately)
|
||||
{
|
||||
TEST(IsLaneWayConformedTurnDirectionApproximately(LaneWay::Left, CarDirection::TurnSharpLeft), ());
|
||||
TEST(IsLaneWayConformedTurnDirectionApproximately(LaneWay::Left, CarDirection::TurnSlightLeft), ());
|
||||
TEST(IsLaneWayConformedTurnDirectionApproximately(LaneWay::Right, CarDirection::TurnSharpRight), ());
|
||||
TEST(IsLaneWayConformedTurnDirectionApproximately(LaneWay::Right, CarDirection::TurnRight), ());
|
||||
TEST(IsLaneWayConformedTurnDirectionApproximately(LaneWay::Reverse, CarDirection::UTurnLeft), ());
|
||||
TEST(IsLaneWayConformedTurnDirectionApproximately(LaneWay::Reverse, CarDirection::UTurnRight), ());
|
||||
TEST(IsLaneWayConformedTurnDirectionApproximately(LaneWay::SlightLeft, CarDirection::GoStraight), ());
|
||||
TEST(IsLaneWayConformedTurnDirectionApproximately(LaneWay::SlightRight, CarDirection::GoStraight), ());
|
||||
|
||||
TEST(!IsLaneWayConformedTurnDirectionApproximately(LaneWay::SharpLeft, CarDirection::UTurnLeft), ());
|
||||
TEST(!IsLaneWayConformedTurnDirectionApproximately(LaneWay::SharpLeft, CarDirection::UTurnRight), ());
|
||||
TEST(!IsLaneWayConformedTurnDirectionApproximately(LaneWay::SharpRight, CarDirection::UTurnLeft), ());
|
||||
TEST(!IsLaneWayConformedTurnDirectionApproximately(LaneWay::SharpRight, CarDirection::UTurnRight), ());
|
||||
TEST(!IsLaneWayConformedTurnDirection(LaneWay::Through, CarDirection::ReachedYourDestination), ());
|
||||
TEST(!IsLaneWayConformedTurnDirectionApproximately(LaneWay::Through, CarDirection::TurnRight), ());
|
||||
TEST(!IsLaneWayConformedTurnDirectionApproximately(LaneWay::SlightRight,
|
||||
CarDirection::TurnSharpLeft), ());
|
||||
}
|
||||
|
||||
UNIT_TEST(TestAddingActiveLaneInformation)
|
||||
{
|
||||
vector<turns::TurnItem> turns =
|
||||
{{1, CarDirection::GoStraight},
|
||||
{2, CarDirection::TurnLeft},
|
||||
{3, CarDirection::TurnRight},
|
||||
{4, CarDirection::ReachedYourDestination}};
|
||||
|
||||
turns[0].m_lanes.push_back({LaneWay::Left, LaneWay::Through});
|
||||
turns[0].m_lanes.push_back({LaneWay::Right});
|
||||
|
||||
turns[1].m_lanes.push_back({LaneWay::SlightLeft});
|
||||
turns[1].m_lanes.push_back({LaneWay::Through});
|
||||
turns[1].m_lanes.push_back({LaneWay::None});
|
||||
|
||||
turns[2].m_lanes.push_back({LaneWay::Left, LaneWay::SharpLeft});
|
||||
turns[2].m_lanes.push_back({LaneWay::None});
|
||||
|
||||
vector<RouteSegment> routeSegments;
|
||||
RouteSegmentsFrom({}, {}, turns, {}, routeSegments);
|
||||
SelectRecommendedLanes(routeSegments);
|
||||
|
||||
TEST(routeSegments[0].GetTurn().m_lanes[0].m_isRecommended, ());
|
||||
TEST(!routeSegments[0].GetTurn().m_lanes[1].m_isRecommended, ());
|
||||
|
||||
TEST(routeSegments[1].GetTurn().m_lanes[0].m_isRecommended, ());
|
||||
TEST(!routeSegments[1].GetTurn().m_lanes[1].m_isRecommended, ());
|
||||
TEST(!routeSegments[1].GetTurn().m_lanes[2].m_isRecommended, ());
|
||||
|
||||
TEST(!routeSegments[2].GetTurn().m_lanes[0].m_isRecommended, ());
|
||||
TEST(routeSegments[2].GetTurn().m_lanes[1].m_isRecommended, ());
|
||||
}
|
||||
|
||||
UNIT_TEST(TestGetRoundaboutDirection)
|
||||
{
|
||||
// The signature of GetRoundaboutDirection function is
|
||||
// GetRoundaboutDirection(bool isIngoingEdgeRoundabout, bool isOutgoingEdgeRoundabout,
|
||||
// bool isMultiTurnJunction, bool keepTurnByHighwayClass)
|
||||
TEST_EQUAL(GetRoundaboutDirectionBasic(true, true, true, true), CarDirection::StayOnRoundAbout, ());
|
||||
TEST_EQUAL(GetRoundaboutDirectionBasic(true, true, true, false), CarDirection::None, ());
|
||||
TEST_EQUAL(GetRoundaboutDirectionBasic(true, true, false, true), CarDirection::None, ());
|
||||
TEST_EQUAL(GetRoundaboutDirectionBasic(true, true, false, false), CarDirection::None, ());
|
||||
TEST_EQUAL(GetRoundaboutDirectionBasic(false, true, false, true), CarDirection::EnterRoundAbout, ());
|
||||
TEST_EQUAL(GetRoundaboutDirectionBasic(true, false, false, false), CarDirection::LeaveRoundAbout, ());
|
||||
}
|
||||
|
||||
UNIT_TEST(TestInvertDirection)
|
||||
{
|
||||
TEST_EQUAL(InvertDirection(CarDirection::TurnSlightRight), CarDirection::TurnSlightLeft, ());
|
||||
TEST_EQUAL(InvertDirection(CarDirection::TurnRight), CarDirection::TurnLeft, ());
|
||||
TEST_EQUAL(InvertDirection(CarDirection::TurnSharpRight), CarDirection::TurnSharpLeft, ());
|
||||
TEST_EQUAL(InvertDirection(CarDirection::TurnSlightLeft), CarDirection::TurnSlightRight, ());
|
||||
TEST_EQUAL(InvertDirection(CarDirection::TurnSlightRight), CarDirection::TurnSlightLeft, ());
|
||||
TEST_EQUAL(InvertDirection(CarDirection::TurnLeft), CarDirection::TurnRight, ());
|
||||
TEST_EQUAL(InvertDirection(CarDirection::TurnSharpLeft), CarDirection::TurnSharpRight, ());
|
||||
}
|
||||
|
||||
UNIT_TEST(TestRightmostDirection)
|
||||
{
|
||||
TEST_EQUAL(RightmostDirection(180.), CarDirection::TurnSharpRight, ());
|
||||
TEST_EQUAL(RightmostDirection(170.), CarDirection::TurnSharpRight, ());
|
||||
TEST_EQUAL(RightmostDirection(90.), CarDirection::TurnRight, ());
|
||||
TEST_EQUAL(RightmostDirection(45.), CarDirection::TurnSlightRight, ());
|
||||
TEST_EQUAL(RightmostDirection(0.), CarDirection::GoStraight, ());
|
||||
TEST_EQUAL(RightmostDirection(-20.), CarDirection::GoStraight, ());
|
||||
TEST_EQUAL(RightmostDirection(-90.), CarDirection::GoStraight, ());
|
||||
TEST_EQUAL(RightmostDirection(-170.), CarDirection::GoStraight, ());
|
||||
}
|
||||
|
||||
UNIT_TEST(TestLeftmostDirection)
|
||||
{
|
||||
TEST_EQUAL(LeftmostDirection(180.), CarDirection::GoStraight, ());
|
||||
TEST_EQUAL(LeftmostDirection(170.), CarDirection::GoStraight, ());
|
||||
TEST_EQUAL(LeftmostDirection(90.), CarDirection::GoStraight, ());
|
||||
TEST_EQUAL(LeftmostDirection(45.), CarDirection::GoStraight, ());
|
||||
TEST_EQUAL(LeftmostDirection(0.), CarDirection::GoStraight, ());
|
||||
TEST_EQUAL(LeftmostDirection(-20.), CarDirection::TurnSlightLeft, ());
|
||||
TEST_EQUAL(LeftmostDirection(-90.), CarDirection::TurnLeft, ());
|
||||
TEST_EQUAL(LeftmostDirection(-170.), CarDirection::TurnSharpLeft, ());
|
||||
}
|
||||
|
||||
UNIT_TEST(TestIntermediateDirection)
|
||||
{
|
||||
TEST_EQUAL(IntermediateDirection(180.), CarDirection::TurnSharpRight, ());
|
||||
TEST_EQUAL(IntermediateDirection(170.), CarDirection::TurnSharpRight, ());
|
||||
TEST_EQUAL(IntermediateDirection(90.), CarDirection::TurnRight, ());
|
||||
TEST_EQUAL(IntermediateDirection(45.), CarDirection::TurnSlightRight, ());
|
||||
TEST_EQUAL(IntermediateDirection(0.), CarDirection::GoStraight, ());
|
||||
TEST_EQUAL(IntermediateDirection(-20.), CarDirection::TurnSlightLeft, ());
|
||||
TEST_EQUAL(IntermediateDirection(-90.), CarDirection::TurnLeft, ());
|
||||
TEST_EQUAL(IntermediateDirection(-170.), CarDirection::TurnSharpLeft, ());
|
||||
}
|
||||
|
||||
UNIT_TEST(TestCheckUTurnOnRoute)
|
||||
{
|
||||
TUnpackedPathSegments pathSegments(4, LoadedPathSegment());
|
||||
pathSegments[0].m_roadNameInfo = {"A road", "", "", "", "", false};
|
||||
pathSegments[0].m_highwayClass = ftypes::HighwayClass::Trunk;
|
||||
pathSegments[0].m_onRoundabout = false;
|
||||
pathSegments[0].m_isLink = false;
|
||||
pathSegments[0].m_path = {{{0, 0}, 0}, {{0, 1}, 0}};
|
||||
pathSegments[0].m_segmentRange = SegmentRange(FeatureID(), 0 /* start seg id */, 1 /* end seg id */,
|
||||
true /* forward */,
|
||||
pathSegments[0].m_path.front().GetPoint(),
|
||||
pathSegments[0].m_path.back().GetPoint());
|
||||
|
||||
pathSegments[1] = pathSegments[0];
|
||||
pathSegments[1].m_segmentRange = SegmentRange(FeatureID(), 1 /* start seg id */, 2 /* end seg id */,
|
||||
true /* forward */,
|
||||
pathSegments[1].m_path.front().GetPoint(),
|
||||
pathSegments[1].m_path.back().GetPoint());
|
||||
pathSegments[1].m_path = {{{0, 1}, 0}, {{0, 0}, 0}};
|
||||
|
||||
pathSegments[2] = pathSegments[0];
|
||||
pathSegments[2].m_segmentRange = SegmentRange(FeatureID(), 2 /* start seg id */, 3 /* end seg id */,
|
||||
true /* forward */,
|
||||
pathSegments[2].m_path.front().GetPoint(),
|
||||
pathSegments[2].m_path.back().GetPoint());
|
||||
pathSegments[2].m_path = {{{0, 0}, 0}, {{0, 1}, 0}};
|
||||
|
||||
pathSegments[3] = pathSegments[0];
|
||||
pathSegments[3].m_segmentRange = SegmentRange(FeatureID(), 3 /* start seg id */, 4 /* end seg id */,
|
||||
true /* forward */,
|
||||
pathSegments[3].m_path.front().GetPoint(),
|
||||
pathSegments[3].m_path.back().GetPoint());
|
||||
pathSegments[3].m_path.clear();
|
||||
|
||||
RoutingResultTest resultTest(pathSegments);
|
||||
RoutingSettings const vehicleSettings = GetRoutingSettings(VehicleType::Car);
|
||||
// Zigzag test.
|
||||
TurnItem turn1;
|
||||
TEST_EQUAL(CheckUTurnOnRoute(resultTest, 1 /* outgoingSegmentIndex */, NumMwmIds(),
|
||||
vehicleSettings, turn1),
|
||||
1, ());
|
||||
TEST_EQUAL(turn1.m_turn, CarDirection::UTurnLeft, ());
|
||||
TurnItem turn2;
|
||||
TEST_EQUAL(CheckUTurnOnRoute(resultTest, 2 /* outgoingSegmentIndex */, NumMwmIds(),
|
||||
vehicleSettings, turn2),
|
||||
1, ());
|
||||
TEST_EQUAL(turn2.m_turn, CarDirection::UTurnLeft, ());
|
||||
|
||||
// Empty path test.
|
||||
TurnItem turn3;
|
||||
TEST_EQUAL(CheckUTurnOnRoute(resultTest, 3 /* outgoingSegmentIndex */, NumMwmIds(),
|
||||
vehicleSettings, turn3),
|
||||
0, ());
|
||||
}
|
||||
|
||||
UNIT_TEST(GetNextRoutePointIndex)
|
||||
{
|
||||
TUnpackedPathSegments pathSegments(2, LoadedPathSegment());
|
||||
pathSegments[0].m_path = {{{0, 0}, 0}, {{0, 1}, 0}, {{0, 2}, 0}};
|
||||
pathSegments[1].m_path = {{{0, 2}, 0}, {{1, 2}, 0}};
|
||||
|
||||
RoutingResultTest resultTest(pathSegments);
|
||||
RoutePointIndex nextIndex;
|
||||
|
||||
// Forward direction.
|
||||
TEST(GetNextRoutePointIndex(resultTest,
|
||||
RoutePointIndex({0 /* m_segmentIndex */, 0 /* m_pathIndex */}),
|
||||
NumMwmIds(), true /* forward */, nextIndex), ());
|
||||
TEST_EQUAL(nextIndex, RoutePointIndex({0 /* m_segmentIndex */, 1 /* m_pathIndex */}), ());
|
||||
|
||||
TEST(GetNextRoutePointIndex(resultTest,
|
||||
RoutePointIndex({0 /* m_segmentIndex */, 1 /* m_pathIndex */}),
|
||||
NumMwmIds(), true /* forward */, nextIndex), ());
|
||||
TEST_EQUAL(nextIndex, RoutePointIndex({0 /* m_segmentIndex */, 2 /* m_pathIndex */}), ());
|
||||
|
||||
// Trying to get next item after the last item of the first segment.
|
||||
// False because of too sharp turn angle.
|
||||
TEST(!GetNextRoutePointIndex(resultTest,
|
||||
RoutePointIndex({0 /* m_segmentIndex */, 2 /* m_pathIndex */}),
|
||||
NumMwmIds(), true /* forward */, nextIndex), ());
|
||||
|
||||
// Trying to get point about the end of the route.
|
||||
TEST(!GetNextRoutePointIndex(resultTest,
|
||||
RoutePointIndex({1 /* m_segmentIndex */, 1 /* m_pathIndex */}),
|
||||
NumMwmIds(), true /* forward */, nextIndex), ());
|
||||
|
||||
// Backward direction.
|
||||
// Moving in backward direction it's possible to get index of the first item of a segment.
|
||||
TEST(GetNextRoutePointIndex(resultTest,
|
||||
RoutePointIndex({1 /* m_segmentIndex */, 1 /* m_pathIndex */}),
|
||||
NumMwmIds(), false /* forward */, nextIndex), ());
|
||||
TEST_EQUAL(nextIndex, RoutePointIndex({1 /* m_segmentIndex */, 0 /* m_pathIndex */}), ());
|
||||
|
||||
TEST(GetNextRoutePointIndex(resultTest,
|
||||
RoutePointIndex({0 /* m_segmentIndex */, 2 /* m_pathIndex */}),
|
||||
NumMwmIds(), false /* forward */, nextIndex), ());
|
||||
TEST_EQUAL(nextIndex, RoutePointIndex({0 /* m_segmentIndex */, 1 /* m_pathIndex */}), ());
|
||||
|
||||
TEST(GetNextRoutePointIndex(resultTest,
|
||||
RoutePointIndex({0 /* m_segmentIndex */, 1 /* m_pathIndex */}),
|
||||
NumMwmIds(), false /* forward */, nextIndex), ());
|
||||
TEST_EQUAL(nextIndex, RoutePointIndex({0 /* m_segmentIndex */, 0 /* m_pathIndex */}), ());
|
||||
|
||||
// Trying to get point before the beginning.
|
||||
TEST(!GetNextRoutePointIndex(resultTest,
|
||||
RoutePointIndex({0 /* m_segmentIndex */, 0 /* m_pathIndex */}),
|
||||
NumMwmIds(), false /* forward */, nextIndex), ());
|
||||
}
|
||||
} // namespace turn_generator_test
|
||||
Reference in New Issue
Block a user