@tileflow/routing 0.0.0-bootstrap.0 → 0.1.0-alpha.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +335 -4
- package/dist/chunk-ECBK2QPL.js +450 -0
- package/dist/chunk-MCATD4FU.js +256 -0
- package/dist/client.d.ts +53 -0
- package/dist/client.js +17 -0
- package/dist/contract.d.ts +708 -0
- package/dist/contract.js +72 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +86 -0
- package/package.json +51 -7
package/README.md
CHANGED
|
@@ -1,7 +1,338 @@
|
|
|
1
1
|
# @tileflow/routing
|
|
2
2
|
|
|
3
|
-
|
|
4
|
-
|
|
3
|
+
Routes, isochrones, travel-time matrices, map matching and nearest-road lookups for driving,
|
|
4
|
+
walking, cycling and trucks, computed by Tileflow on a routable network built from the same
|
|
5
|
+
OpenStreetMap data as Tileflow World. Routes follow the streets the map draws and use the names it
|
|
6
|
+
shows. The client uses `fetch` and has no renderer or global state.
|
|
5
7
|
|
|
6
|
-
|
|
7
|
-
|
|
8
|
+
> Related packages and guides: [documentation index](https://raw.githubusercontent.com/tileflow/tileflow-sdk/main/llms.txt).
|
|
9
|
+
|
|
10
|
+
## Install
|
|
11
|
+
|
|
12
|
+
```sh
|
|
13
|
+
npm install @tileflow/routing@alpha
|
|
14
|
+
```
|
|
15
|
+
|
|
16
|
+
Use Node.js 22, a browser or another runtime with `fetch`.
|
|
17
|
+
|
|
18
|
+
Live requests require Tileflow Routing to be enabled for your Team and a credential with the
|
|
19
|
+
Routing permission. Installing this package does not enable the service or grant access.
|
|
20
|
+
|
|
21
|
+
## Calculate a route
|
|
22
|
+
|
|
23
|
+
<!-- docs:check -->
|
|
24
|
+
|
|
25
|
+
```ts
|
|
26
|
+
import {route} from '@tileflow/routing';
|
|
27
|
+
|
|
28
|
+
const apiKey = process.env.TILEFLOW_API_KEY;
|
|
29
|
+
if (!apiKey) throw new Error('Set TILEFLOW_API_KEY on the server.');
|
|
30
|
+
|
|
31
|
+
const answer = await route(
|
|
32
|
+
{
|
|
33
|
+
locations: [
|
|
34
|
+
[-80.2195, 25.7655],
|
|
35
|
+
[-80.1312, 25.7795],
|
|
36
|
+
],
|
|
37
|
+
mode: 'driving',
|
|
38
|
+
alternatives: 1,
|
|
39
|
+
},
|
|
40
|
+
{apiKey},
|
|
41
|
+
);
|
|
42
|
+
|
|
43
|
+
const [fastest] = answer.routes;
|
|
44
|
+
console.log(fastest?.distance, fastest?.duration, answer.usage.units);
|
|
45
|
+
for (const step of fastest?.legs[0]?.steps ?? []) console.log(step.instruction);
|
|
46
|
+
```
|
|
47
|
+
|
|
48
|
+
**Request:**
|
|
49
|
+
|
|
50
|
+
- `locations`: two to five `[longitude, latitude]` positions: an origin, optional stops and a
|
|
51
|
+
destination. Each stretch between consecutive positions is a leg.
|
|
52
|
+
- `mode`: `driving`, `walking`, `cycling` or `truck`.
|
|
53
|
+
- `alternatives` (optional, 0–2): only between two positions. Fewer come back when no distinct
|
|
54
|
+
alternative exists.
|
|
55
|
+
- `language` (optional): writes the instructions in one of `routingLanguages`.
|
|
56
|
+
- `vehicle`, `avoid` and `traffic` (optional): see
|
|
57
|
+
[Route a truck around tolls](#route-a-truck-around-tolls).
|
|
58
|
+
|
|
59
|
+
**Answer:** routes, fastest first. Each route has:
|
|
60
|
+
|
|
61
|
+
- `distance` in metres and `duration` in seconds;
|
|
62
|
+
- `hasTolls`, `hasHighways` and `hasFerries`: whether the route uses a toll road, a highway or a
|
|
63
|
+
ferry;
|
|
64
|
+
- a GeoJSON `LineString` `geometry`;
|
|
65
|
+
- `legs` of `steps`. Each step has a `maneuver`, an `instruction`, the street `names` and, on
|
|
66
|
+
highways, the `exit` number and the destinations it is signed `toward`.
|
|
67
|
+
|
|
68
|
+
Durations are estimates without traffic; see [Travel times and traffic](#travel-times-and-traffic).
|
|
69
|
+
|
|
70
|
+
## Route a truck around tolls
|
|
71
|
+
|
|
72
|
+
<!-- docs:check -->
|
|
73
|
+
|
|
74
|
+
```ts
|
|
75
|
+
import {route} from '@tileflow/routing';
|
|
76
|
+
|
|
77
|
+
const apiKey = process.env.TILEFLOW_API_KEY;
|
|
78
|
+
if (!apiKey) throw new Error('Set TILEFLOW_API_KEY on the server.');
|
|
79
|
+
|
|
80
|
+
const answer = await route(
|
|
81
|
+
{
|
|
82
|
+
locations: [
|
|
83
|
+
[-80.2878, 25.8195],
|
|
84
|
+
[-80.1918, 26.1224],
|
|
85
|
+
],
|
|
86
|
+
mode: 'truck',
|
|
87
|
+
vehicle: {heightMeters: 4.1, weightTonnes: 18, axleCount: 3, hazardousMaterials: false},
|
|
88
|
+
avoid: ['tolls'],
|
|
89
|
+
},
|
|
90
|
+
{apiKey},
|
|
91
|
+
);
|
|
92
|
+
|
|
93
|
+
const [fastest] = answer.routes;
|
|
94
|
+
if (fastest?.hasTolls) console.log('No reasonable route avoids every toll road.');
|
|
95
|
+
```
|
|
96
|
+
|
|
97
|
+
`vehicle` describes the truck. It is accepted only with `mode: 'truck'`, and every field is
|
|
98
|
+
optional:
|
|
99
|
+
|
|
100
|
+
| Field | Unit and range |
|
|
101
|
+
| -------------------- | -------------- |
|
|
102
|
+
| `heightMeters` | 1–10 metres |
|
|
103
|
+
| `widthMeters` | 1–5 metres |
|
|
104
|
+
| `lengthMeters` | 1–40 metres |
|
|
105
|
+
| `weightTonnes` | 0.5–100 tonnes |
|
|
106
|
+
| `axleLoadTonnes` | 0.5–40 tonnes |
|
|
107
|
+
| `axleCount` | whole, 2–20 |
|
|
108
|
+
| `hazardousMaterials` | `true`/`false` |
|
|
109
|
+
|
|
110
|
+
The route respects these dimensions where OpenStreetMap records a limit. A road without a recorded
|
|
111
|
+
height, weight or hazardous-materials restriction is treated as unrestricted, so check clearances
|
|
112
|
+
that matter on the ground.
|
|
113
|
+
|
|
114
|
+
`avoid` lists `tolls`, `highways` and `ferries`, each at most once, in any mode. **Avoidance is a
|
|
115
|
+
strong preference, not an exclusion:** when no reasonable route avoids a road kind, the answer
|
|
116
|
+
still uses it. Check `hasTolls`, `hasHighways` and `hasFerries` on each route rather than assuming
|
|
117
|
+
the avoidance held.
|
|
118
|
+
|
|
119
|
+
Isochrones and matrices take the same `vehicle`, `avoid` and `traffic` options. Map matching takes
|
|
120
|
+
`vehicle` only.
|
|
121
|
+
|
|
122
|
+
## Calculate an isochrone
|
|
123
|
+
|
|
124
|
+
<!-- docs:check -->
|
|
125
|
+
|
|
126
|
+
```ts
|
|
127
|
+
import {isochrone} from '@tileflow/routing';
|
|
128
|
+
|
|
129
|
+
const apiKey = process.env.TILEFLOW_API_KEY;
|
|
130
|
+
if (!apiKey) throw new Error('Set TILEFLOW_API_KEY on the server.');
|
|
131
|
+
|
|
132
|
+
const answer = await isochrone(
|
|
133
|
+
{location: [-80.1918, 25.7617], mode: 'walking', minutes: [5, 10, 15]},
|
|
134
|
+
{apiKey},
|
|
135
|
+
);
|
|
136
|
+
|
|
137
|
+
for (const area of answer.isochrones.features)
|
|
138
|
+
console.log(area.properties.minutes, area.geometry.type);
|
|
139
|
+
```
|
|
140
|
+
|
|
141
|
+
`minutes` holds one to four whole minutes from 1 to 60, rising. The answer is a GeoJSON
|
|
142
|
+
`FeatureCollection` with one `Polygon` or `MultiPolygon` per time, in the same order.
|
|
143
|
+
|
|
144
|
+
## Calculate a travel-time matrix
|
|
145
|
+
|
|
146
|
+
A matrix gives the duration and distance from every source to every target, for example to find
|
|
147
|
+
the nearest of several depots or to feed your own route optimizer.
|
|
148
|
+
|
|
149
|
+
<!-- docs:check -->
|
|
150
|
+
|
|
151
|
+
```ts
|
|
152
|
+
import {matrix} from '@tileflow/routing';
|
|
153
|
+
|
|
154
|
+
const apiKey = process.env.TILEFLOW_API_KEY;
|
|
155
|
+
if (!apiKey) throw new Error('Set TILEFLOW_API_KEY on the server.');
|
|
156
|
+
|
|
157
|
+
const depots: [number, number][] = [
|
|
158
|
+
[-80.2878, 25.8195],
|
|
159
|
+
[-80.3698, 25.6866],
|
|
160
|
+
];
|
|
161
|
+
const stops: [number, number][] = [
|
|
162
|
+
[-80.1312, 25.7795],
|
|
163
|
+
[-80.1918, 25.7617],
|
|
164
|
+
[-80.2683, 25.942],
|
|
165
|
+
];
|
|
166
|
+
|
|
167
|
+
const answer = await matrix({sources: depots, targets: stops, mode: 'driving'}, {apiKey});
|
|
168
|
+
|
|
169
|
+
answer.durations.forEach((row, depot) => {
|
|
170
|
+
row.forEach((seconds, stop) => {
|
|
171
|
+
const minutes = seconds === null ? 'no route' : `${Math.round(seconds / 60)} min`;
|
|
172
|
+
console.log(`depot ${depot} → stop ${stop}: ${minutes}`);
|
|
173
|
+
});
|
|
174
|
+
});
|
|
175
|
+
```
|
|
176
|
+
|
|
177
|
+
**Request:** one to 25 `sources` and one to 25 `targets`, a `mode`, and optionally `vehicle`,
|
|
178
|
+
`avoid` and `traffic`. The straight-line distance between every source and every target must be
|
|
179
|
+
within the mode's limit: 200 km for `driving` and `truck`, and 10 km for `cycling` and `walking`
|
|
180
|
+
(`routingLimits.maximumMatrixDistanceMeters`).
|
|
181
|
+
|
|
182
|
+
**Answer:** `durations` in seconds and `distances` in metres, with one row per source and one
|
|
183
|
+
column per target, in request order: `durations[source][target]`. A cell is `null` when no route
|
|
184
|
+
was found for that pair: none exists, or the service could not find one in time. Request a single
|
|
185
|
+
route for a pair you still need. The client rejects an answer whose rows or columns do not match the
|
|
186
|
+
request.
|
|
187
|
+
|
|
188
|
+
## Match a GPS trace to roads
|
|
189
|
+
|
|
190
|
+
Map matching snaps a recorded trace to the roads it most likely followed and describes each road,
|
|
191
|
+
including its speed limit where OpenStreetMap records one.
|
|
192
|
+
|
|
193
|
+
<!-- docs:check -->
|
|
194
|
+
|
|
195
|
+
```ts
|
|
196
|
+
import {match} from '@tileflow/routing';
|
|
197
|
+
|
|
198
|
+
const apiKey = process.env.TILEFLOW_API_KEY;
|
|
199
|
+
if (!apiKey) throw new Error('Set TILEFLOW_API_KEY on the server.');
|
|
200
|
+
|
|
201
|
+
const answer = await match(
|
|
202
|
+
{
|
|
203
|
+
trace: [
|
|
204
|
+
[-80.1327, 25.7808],
|
|
205
|
+
[-80.1324, 25.784],
|
|
206
|
+
[-80.1318, 25.7922],
|
|
207
|
+
],
|
|
208
|
+
timestamps: [1760000000, 1760000012, 1760000031],
|
|
209
|
+
accuracy: 10,
|
|
210
|
+
mode: 'driving',
|
|
211
|
+
},
|
|
212
|
+
{apiKey},
|
|
213
|
+
);
|
|
214
|
+
|
|
215
|
+
for (const road of answer.roads) {
|
|
216
|
+
const name = road.names[0] ?? road.class;
|
|
217
|
+
const limit = road.speedLimit ? `${road.speedLimit.kmh} km/h` : 'no tagged speed limit';
|
|
218
|
+
console.log(`${name}: ${Math.round(road.length)} m, ${limit}`);
|
|
219
|
+
}
|
|
220
|
+
```
|
|
221
|
+
|
|
222
|
+
**Request:**
|
|
223
|
+
|
|
224
|
+
- `trace`: 2 to 100 positions in the order they were recorded. Consecutive positions must be within
|
|
225
|
+
2 km of each other, and the straight-line distance through them may not exceed 200 km.
|
|
226
|
+
- `timestamps` (optional): seconds since the Unix epoch, one per position, never decreasing.
|
|
227
|
+
- `accuracy` (optional): GPS accuracy in metres, 1–100. The default suits a phone outdoors.
|
|
228
|
+
- `mode` and, for `truck`, an optional `vehicle`.
|
|
229
|
+
|
|
230
|
+
**Answer:**
|
|
231
|
+
|
|
232
|
+
- `distance`, `duration` and the matched `geometry`;
|
|
233
|
+
- `points`: one entry per trace position, in order, with the matched `location` and its `distance`
|
|
234
|
+
in metres from the recorded position, or `null` when that position was not matched;
|
|
235
|
+
- `roads`: the roads of the matched path, in order, with consecutive pieces of one road merged.
|
|
236
|
+
|
|
237
|
+
Each road has its `names`, OpenStreetMap `wayId`, `class` (from `routingRoadClasses`), `surface`,
|
|
238
|
+
`lanes`, `toll`, `bridge`, `tunnel`, `roundabout`, `length` in metres and `speedLimit`.
|
|
239
|
+
|
|
240
|
+
**Speed limits are the values tagged in OpenStreetMap, or `null`.** A limit is
|
|
241
|
+
`{kmh, source: 'tagged'}` only where OpenStreetMap records one; otherwise it is `null`. The service
|
|
242
|
+
does not infer limits from the road class or the country's defaults. A tagged value can be missing,
|
|
243
|
+
outdated or different from the signs on the ground.
|
|
244
|
+
|
|
245
|
+
## Find the nearest road
|
|
246
|
+
|
|
247
|
+
<!-- docs:check -->
|
|
248
|
+
|
|
249
|
+
```ts
|
|
250
|
+
import {nearest} from '@tileflow/routing';
|
|
251
|
+
|
|
252
|
+
const apiKey = process.env.TILEFLOW_API_KEY;
|
|
253
|
+
if (!apiKey) throw new Error('Set TILEFLOW_API_KEY on the server.');
|
|
254
|
+
|
|
255
|
+
const answer = await nearest({location: [-80.1312, 25.7795], mode: 'driving'}, {apiKey});
|
|
256
|
+
|
|
257
|
+
console.log(answer.road.names[0] ?? answer.road.class, answer.distance, answer.location);
|
|
258
|
+
console.log(answer.road.speedLimit?.kmh ?? 'no tagged speed limit');
|
|
259
|
+
```
|
|
260
|
+
|
|
261
|
+
The request takes one `location` and a `mode`. The answer has the nearest point of a road that
|
|
262
|
+
mode can use as `location`, its `distance` in metres from the requested position, and the `road`
|
|
263
|
+
with the same attributes as map matching, including the tagged `speedLimit` or `null`.
|
|
264
|
+
|
|
265
|
+
## Travel times and traffic
|
|
266
|
+
|
|
267
|
+
**Durations and ETAs do not include traffic.** They are estimated from the road network alone, so
|
|
268
|
+
they do not reflect congestion, incidents or the time of day.
|
|
269
|
+
|
|
270
|
+
Every answer states this in `traffic: 'none'`. Route, isochrone and matrix requests accept an
|
|
271
|
+
optional `traffic` field, and `'none'` is its only accepted value (`routingTrafficKinds`).
|
|
272
|
+
|
|
273
|
+
## Draw a route on a map
|
|
274
|
+
|
|
275
|
+
Routes and isochrones are plain GeoJSON, so any map can draw them. With MapLibre:
|
|
276
|
+
|
|
277
|
+
<!-- docs:check -->
|
|
278
|
+
|
|
279
|
+
```ts
|
|
280
|
+
import type {RoutingRouteResponse} from '@tileflow/routing';
|
|
281
|
+
|
|
282
|
+
// The two MapLibre map methods this example uses; pass your maplibregl.Map.
|
|
283
|
+
type RouteMap = {
|
|
284
|
+
addSource(id: string, source: object): unknown;
|
|
285
|
+
addLayer(layer: object): unknown;
|
|
286
|
+
};
|
|
287
|
+
|
|
288
|
+
export function showRoute(map: RouteMap, answer: RoutingRouteResponse) {
|
|
289
|
+
const fastest = answer.routes[0];
|
|
290
|
+
if (!fastest) return;
|
|
291
|
+
map.addSource('route', {
|
|
292
|
+
type: 'geojson',
|
|
293
|
+
data: {type: 'Feature', properties: {}, geometry: fastest.geometry},
|
|
294
|
+
lineMetrics: true,
|
|
295
|
+
});
|
|
296
|
+
map.addLayer({
|
|
297
|
+
id: 'route',
|
|
298
|
+
type: 'line',
|
|
299
|
+
source: 'route',
|
|
300
|
+
layout: {'line-cap': 'round', 'line-join': 'round'},
|
|
301
|
+
paint: {'line-color': '#2563eb', 'line-width': 6},
|
|
302
|
+
});
|
|
303
|
+
}
|
|
304
|
+
```
|
|
305
|
+
|
|
306
|
+
To colour the route with the map's theme and draw it on progressively, use Core's route inks and
|
|
307
|
+
line progress; see the
|
|
308
|
+
[route drawing guide](https://github.com/tileflow/tileflow-sdk/blob/main/packages/core/docs/route-drawing.md).
|
|
309
|
+
Keep the answer's `attribution` visible with the route. Like the map, routes come from
|
|
310
|
+
OpenStreetMap data.
|
|
311
|
+
|
|
312
|
+
## Errors
|
|
313
|
+
|
|
314
|
+
Failures throw `RoutingError` with:
|
|
315
|
+
|
|
316
|
+
- `code`, from `routingErrorCodes`, when the service sent one with its documented status;
|
|
317
|
+
- `status`;
|
|
318
|
+
- `requestId`;
|
|
319
|
+
- `retryAfterSeconds` on rate limits.
|
|
320
|
+
|
|
321
|
+
`ROUTING_NO_ROUTE` means that no road the mode can use is near a position, or that no route
|
|
322
|
+
connects the positions in that mode. In a matrix answer, a pair that no route connects is a `null`
|
|
323
|
+
cell. The client never retries; repeat an operation only after an explicit user action.
|
|
324
|
+
|
|
325
|
+
Invalid requests are rejected before any network call. Each answer must match its request: the
|
|
326
|
+
requested number of legs, isochrone times, matrix rows and columns, and matched trace points.
|
|
327
|
+
|
|
328
|
+
## Browser and app credentials
|
|
329
|
+
|
|
330
|
+
A publishable credential is restricted to your origins or app identifiers and can be used in client
|
|
331
|
+
code. Native apps pass `app: {id, certificateSha256}` so a publishable credential can admit them.
|
|
332
|
+
Server credentials must stay on your server.
|
|
333
|
+
|
|
334
|
+
## Contract
|
|
335
|
+
|
|
336
|
+
`@tileflow/routing/contract` exports the request and answer schemas, limits, modes, avoidances,
|
|
337
|
+
traffic kinds, road classes and surfaces, maneuvers, languages and error codes. Use them to validate
|
|
338
|
+
data that crosses your own boundaries.
|