9f704f1d4e
This will search for road segments within 5 meter radius of the input location and choose the best path from/to whichever segment gives the cheapest cost. It should be preferable in most scenarios compared to simply snapping to the closest segment. I'll do the same PR for our web app at https://github.com/gis-ops/valhalla-app.
118 lines
3.4 KiB
JavaScript
118 lines
3.4 KiB
JavaScript
function FOSSGISValhallaEngine(id, costing) {
|
|
var INSTR_MAP = [
|
|
0, // kNone = 0;
|
|
8, // kStart = 1;
|
|
8, // kStartRight = 2;
|
|
8, // kStartLeft = 3;
|
|
14, // kDestination = 4;
|
|
14, // kDestinationRight = 5;
|
|
14, // kDestinationLeft = 6;
|
|
0, // kBecomes = 7;
|
|
0, // kContinue = 8;
|
|
1, // kSlightRight = 9;
|
|
2, // kRight = 10;
|
|
3, // kSharpRight = 11;
|
|
4, // kUturnRight = 12;
|
|
4, // kUturnLeft = 13;
|
|
7, // kSharpLeft = 14;
|
|
6, // kLeft = 15;
|
|
5, // kSlightLeft = 16;
|
|
0, // kRampStraight = 17;
|
|
24, // kRampRight = 18;
|
|
25, // kRampLeft = 19;
|
|
24, // kExitRight = 20;
|
|
25, // kExitLeft = 21;
|
|
0, // kStayStraight = 22;
|
|
1, // kStayRight = 23;
|
|
5, // kStayLeft = 24;
|
|
20, // kMerge = 25;
|
|
10, // kRoundaboutEnter = 26;
|
|
11, // kRoundaboutExit = 27;
|
|
17, // kFerryEnter = 28;
|
|
0, // kFerryExit = 29;
|
|
null, // kTransit = 30;
|
|
null, // kTransitTransfer = 31;
|
|
null, // kTransitRemainOn = 32;
|
|
null, // kTransitConnectionStart = 33;
|
|
null, // kTransitConnectionTransfer = 34;
|
|
null, // kTransitConnectionDestination = 35;
|
|
null, // kPostTransitConnectionDestination = 36;
|
|
21, // kMergeRight = 37;
|
|
20 // kMergeLeft = 38;
|
|
];
|
|
|
|
return {
|
|
id: id,
|
|
creditline:
|
|
"<a href='https://gis-ops.com/global-open-valhalla-server-online/' target='_blank'>Valhalla (FOSSGIS)</a>",
|
|
draggable: false,
|
|
|
|
getRoute: function (points, callback) {
|
|
return $.ajax({
|
|
url: OSM.FOSSGIS_VALHALLA_URL,
|
|
data: {
|
|
json: JSON.stringify({
|
|
locations: points.map(function (p) {
|
|
return { lat: p.lat, lon: p.lng, radius: 5 };
|
|
}),
|
|
costing: costing,
|
|
directions_options: {
|
|
units: "km",
|
|
language: I18n.currentLocale()
|
|
}
|
|
})
|
|
},
|
|
dataType: "json",
|
|
success: function (data) {
|
|
var trip = data.trip;
|
|
|
|
if (trip.status === 0) {
|
|
var line = [];
|
|
var steps = [];
|
|
var distance = 0;
|
|
var time = 0;
|
|
|
|
trip.legs.forEach(function (leg) {
|
|
var legLine = L.PolylineUtil.decode(leg.shape, {
|
|
precision: 6
|
|
});
|
|
|
|
line = line.concat(legLine);
|
|
|
|
leg.maneuvers.forEach(function (manoeuvre, idx) {
|
|
var point = legLine[manoeuvre.begin_shape_index];
|
|
|
|
steps.push([
|
|
{ lat: point[0], lng: point[1] },
|
|
INSTR_MAP[manoeuvre.type],
|
|
"<b>" + (idx + 1) + ".</b> " + manoeuvre.instruction,
|
|
manoeuvre.length * 1000,
|
|
[]
|
|
]);
|
|
});
|
|
|
|
distance = distance + leg.summary.length;
|
|
time = time + leg.summary.time;
|
|
});
|
|
|
|
callback(false, {
|
|
line: line,
|
|
steps: steps,
|
|
distance: distance * 1000,
|
|
time: time
|
|
});
|
|
} else {
|
|
callback(true);
|
|
}
|
|
},
|
|
error: function () {
|
|
callback(true);
|
|
}
|
|
});
|
|
}
|
|
};
|
|
}
|
|
|
|
OSM.Directions.addEngine(new FOSSGISValhallaEngine("fossgis_valhalla_car", "auto"), true);
|
|
OSM.Directions.addEngine(new FOSSGISValhallaEngine("fossgis_valhalla_bicycle", "bicycle"), true);
|
|
OSM.Directions.addEngine(new FOSSGISValhallaEngine("fossgis_valhalla_foot", "pedestrian"), true);
|