compute the minimum distance in degree between two angles/bearings

convert a string representation of time to a tm structure

clang-format off * Returns the fastest route between two or more coordinates while visiting the waypoints in order. * * @name route * @memberof OSR

get all obstacles at node 'to' when coming from node 'from' pass SPECIAL_NODEID as 'from' to get all obstacles at 'to' 'type' can be a bitwise-or comb

* Converts a typed latitude from fixed to floating representation. * * \param fixed typed latitude in fixed representation. * \return typed latitud

check if a step is completely without turn type

check whether a match of a given tag and a turn instruction can be seen as valid

clang-format off * Computes duration table for the given locations. Allows for both symmetric and asymmetric tables. * Optionally returns distance ta

Insert an obstacle using the OSM node id. This function is thread-safe.

clang-format off * Map matching matches given GPS points to the road network in the most plausible way. * Please note the request might result multip

Helper to create a TurnInstruction with given type and direction modifier.

Compute the angle between two bearings on a normal turn circle Bearings Angles 0 180 315 45

clang-format off * The trip plugin solves the Traveling Salesman Problem using a greedy heuristic * (farthest-insertion algorithm) for 10 or * more w

* Converts a typed latitude from floating to fixed representation. * * \param floating typed latitude in floating representation. * \return typed l

creates a default edge of unit weight

This code assumes that we are operating in euclidean space! That means if you just put unprojected lat/lon in here you will get invalid results.

Build an Intersection from a list of road specs. Each spec: {entry_allowed, angle, TurnInstruction}

Returns the number of nodes currently in the heap. */