pathNetwork.lanes

The directed lane graph of a path network and the questions asked of it, as pure functions over the built network's tables: the lanes each edge carries (which way each runs, its offset across the surface), how lanes join through each node (index kept where the next edge has that many lanes, U-turns at a dead end), the stop line where a lane meets a junction, the connector curve between two lanes through a node, a cell index of the network for the nearest point to a position, and a Dijkstra route by distance or by time.

Function
forEdge(edge, drive)	The lanes of one built edge.
connect(lanes, degree)	Join lanes through every node and mark stop lines.
point(lane, d)	Position and direction a distance along a lane.
connector(from, to)	The curve from one lane's end to the next lane's start.
index(edges) / nearestSegment(index, x, z, maxDistance?)	The nearest centreline segment to a point.
laneDistanceAt(lane, s)	The lane distance at an edge distance.
route(lanes, start, goal, by)	The lanes from one place to another, and the cost.