/srv/osrm/osrm-backend/features/testbot
NameSizeModeActions
64bit.feature8560644editdlrm
alternative.feature17340644editdlrm
alternative_loop.feature23280644editdlrm
annotations.feature38380644editdlrm
approaches.feature90110644editdlrm
bad.feature23350644editdlrm
basic.feature92620644editdlrm
bearing.feature82260644editdlrm
bearing_param.feature48810644editdlrm
compression.feature6370644editdlrm
continue_straight.feature25110644editdlrm
distance.feature69960644editdlrm
distance_matrix.feature235820644editdlrm
duration.feature13180644editdlrm
duration_matrix.feature231890644editdlrm
example.feature13000644editdlrm
exclude.feature38650644editdlrm
exclude_regressions.feature24070644editdlrm
fastest.feature11060644editdlrm
ferry.feature79350644editdlrm
fixed.feature51480644editdlrm
geometry.feature7120644editdlrm
graph.feature10380644editdlrm
impedance.feature33700644editdlrm
load.feature23630644editdlrm
loop.feature29130644editdlrm
matching.feature232250644editdlrm
maxspeed.feature13320644editdlrm
mode.feature110920644editdlrm
multi_level_routing.feature89160644editdlrm
nil.feature11000644editdlrm
oneway.feature10750644editdlrm
oneway_phantom.feature26480644editdlrm
opposite.feature5820644editdlrm
origin.feature26800644editdlrm
overlap.feature11000644editdlrm
penalty.feature51610644editdlrm
planetary.feature24740644editdlrm
projection.feature29830644editdlrm
routes.feature10740644editdlrm
snap.feature51310644editdlrm
snap_intersection.feature187840644editdlrm
speed.feature10050644editdlrm
status.feature38080644editdlrm
summary.feature23420644editdlrm
time.feature82400644editdlrm
traffic_speeds.feature68990644editdlrm
traffic_speeds_overflow.feature10600644editdlrm
traffic_turn_penalties.feature26330644editdlrm
trip.feature129810644editdlrm
turn_penalty.feature10310644editdlrm
utf.feature43030644editdlrm
via.feature122130644editdlrm
weight.feature136340644editdlrm
zero-speed-updates.feature49650644editdlrm
Edit: /srv/osrm/osrm-backend/features/testbot/snap.feature (5131B)
@routing @snap @testbot Feature: Snap start/end point to the nearest way Background: Given the profile "testbot" Scenario: Snap to nearest protruding oneway Given the node map """ 1 2 8 n 3 w c e 7 s 4 6 5 """ And the ways | nodes | | nc | | ec | | sc | | wc | When I route I should get | from | to | route | | 1 | c | nc,nc | | 2 | c | nc,nc | | 3 | c | ec,ec | | 4 | c | ec,ec | | 5 | c | sc,sc | | 6 | c | sc,sc | | 7 | c | wc,wc | | 8 | c | wc,wc | Scenario: Snap to nearest edge of a square Given the node map """ 4 5 6 7 3 a u 2 1 d b """ And the ways | nodes | | aub | | adb | When I route I should get | from | to | route | data_version | | 1 | b | adb,adb | | | 2 | b | adb,adb | | | 6 | b | aub,aub | | | 7 | b | aub,aub | | Scenario: Data_version check on nearest Given the node map """ 4 5 6 7 3 a u 2 1 d b """ And the extract extra arguments "--data_version cucumber_data_version" And the ways | nodes | | aub | | adb | When I route I should get | from | to | route | data_version | | 1 | b | adb,adb | cucumber_data_version | Scenario: Snap to edge right under start/end point Given the node map """ d e f g c h b i a l k j """ And the ways | nodes | | abcd | | defg | | ghij | | jkla | When I route I should get | from | to | route | | a | b | abcd,abcd | | a | c | abcd,abcd | | a | d | abcd,abcd | | a | e | abcd,defg,defg | | a | f | abcd,defg,defg | | a | h | jkla,ghij,ghij | | a | i | jkla,ghij,ghij | | a | j | jkla,jkla | | a | k | jkla,jkla | | a | l | jkla,jkla | Scenario: Snapping in viaroute Given the extract extra arguments "--small-component-size 4" Given the node map """ a c e b d f """ And the ways | nodes | | ab | | cd | | df | | fe | | ec | When I route I should get | from | to | route | | a | b | ab,ab | | a | d | cd,cd | | c | d | cd,cd | Scenario: Snap to correct way at large scales Given a grid size of 1000 meters Given the node map """ a x b c """ And the ways | nodes | | xa | | xb | | xc | When I route I should get | from | to | route | | x | a | xa,xa | | x | b | xb,xb | | x | c | xc,xc | | a | x | xa,xa | | b | x | xb,xb | | c | x | xc,xc | Scenario: Find edges within 100m, and the same from 1km Given a grid size of 100 meters Given the node map """ p i j 8 1 2 h a b o 7 g x c 3 k f e d 6 5 4 n m l """ Given the ways | nodes | | xa | | xb | | xc | | xd | | xe | | xf | | xg | | xh | When I route I should get | from | to | route | | x | 1 | xa,xa | | x | 2 | xb,xb | | x | 3 | xc,xc | | x | 4 | xd,xd | | x | 5 | xe,xe | | x | 6 | xf,xf | | x | 7 | xg,xg | | x | 8 | xh,xh | | x | i | xa,xa | | x | j | xb,xb | | x | k | xc,xc | | x | l | xd,xd | | x | m | xe,xe | | x | n | xf,xf | | x | o | xg,xg | | x | p | xh,xh |