@wemap/routers 14.5.4 → 14.5.6

package/dist/index.js

@@ -852,27 +852,25 @@ var Logger = _Logger, SKIP_STEP_ANGLE_MAX = deg2rad(20), StepsBuilder = class {
 		for (let n = 0; n < e.vertices.length - 1; n++) {
 			let i = e.vertices[n], l = i.coords, u = e.vertices[n + 1], d = u.coords, f = e.edges[n], p = i.bearingTo(u), m = diffAngle(s, p + Math.PI), h = t.length ? t[t.length - 1] : null, g = n > 0 ? e.edges[n - 1] : null, _ = OsmTagsUtils.isGate(i.rawTags), v = OsmTagsUtils.isTurnstile(i.rawTags), y = OsmTagsUtils.isTactilePaving(f.rawTags), b = g ? OsmTagsUtils.isTactilePaving(g.rawTags) : !1, x = y && !b ? "entrance" : !y && b ? "exit" : void 0, S = OsmTagsUtils.isFunicular(f.rawTags), C = g ? OsmTagsUtils.isFunicular(g.rawTags) : !1, w = S && !C ? "entrance" : !S && C ? "exit" : void 0, { isElevator: T, areEscalators: E, areStairs: D, isMovingWalkway: O, incline: k } = f.properties, A;
 			(D || T) && k && (h?.levelDifference === null || h?.levelDifference === void 0) && (A = k);
-			let ee = g?.properties || {};
-			ee.incline && ee.areStairs;
-			let j = OsmTagsUtils.isSubwayEntrance(i.rawTags), N = OsmTagsUtils.isEntrance(i.rawTags), P = N || j, F;
-			if (N) {
+			let ee = g?.properties || {}, j = !!(ee.incline && ee.areStairs && (!k || !D)), N = OsmTagsUtils.isSubwayEntrance(i.rawTags), P = OsmTagsUtils.isEntrance(i.rawTags), F = P || N, I;
+			if (P) {
 				if (n > 0) {
 					let t = e.vertices[n - 1].coords.level, r = d.level;
-					t === null && r !== null ? F = "entrance" : t !== null && r === null && (F = "exit");
+					t === null && r !== null ? I = "entrance" : t !== null && r === null && (I = "exit");
 				}
-				F ||= a.level === null ? "exit" : "entrance";
+				I ||= a.level === null ? "exit" : "entrance";
 			}
-			let I = f.properties.name || i.properties.name || OsmTagsUtils.getRef(i.rawTags), L = e.edgesWeights[n], te = Math.abs(diffAngle(Math.PI, m)) >= SKIP_STEP_ANGLE_MAX, R = Level.isRange(f.level) && !Level.isRange(l.level) || A;
-			te &&= !(l.level && Level.isRange(l.level));
-			let B = !!(R || P || w || v || _), V = B || x || te && g?.length !== 0;
-			if (!o || V) {
+			let L = f.properties.name || i.properties.name || OsmTagsUtils.getRef(i.rawTags), te = e.edgesWeights[n], R = Math.abs(diffAngle(Math.PI, m)) >= SKIP_STEP_ANGLE_MAX, B = Level.isRange(f.level) && !Level.isRange(l.level) || A;
+			R &&= !(l.level && Level.isRange(l.level));
+			let V = isStepLevelChange(h) && !Level.isRange(l.level) || j, H = !!(B || V || F || w || v || _), ne = H || x || R && g?.length !== 0;
+			if (!o || ne) {
 				let e = null, i = null, a = null;
-				T ? a = "elevator" : E ? a = "escalator" : D ? a = "stairs" : j ? a = "subway-entrance" : _ ? a = "gate" : v ? a = "turnstile" : O ? a = "moving-walkway" : R ? a = "incline-plane" : F ? a = F : n > 0 && (a = "turn");
+				T ? a = "elevator" : E ? a = "escalator" : D ? a = "stairs" : N ? a = "subway-entrance" : _ ? a = "gate" : v ? a = "turnstile" : O ? a = "moving-walkway" : B ? a = "incline-plane" : I ? a = I : n > 0 && (a = "turn");
 				let s = getDirectionFromAngle(m);
-				R && (e = Level.diff(l.level, d.level) || 0, i = l.level + e, s = e > 0 ? "up" : "down", A && (s = A)), o = {
+				B && (e = Level.diff(l.level, d.level) || 0, i = l.level + e, s = e > 0 ? "up" : "down", A && (s = A)), o = {
 					coords: l,
-					...I && { name: I },
-					important: B,
+					...L && { name: L },
+					important: H,
 					type: a,
 					direction: s,
 					levelDifference: e,
@@ -883,7 +881,7 @@ var Logger = _Logger, SKIP_STEP_ANGLE_MAX = deg2rad(20), StepsBuilder = class {
 					duration: 0
 				}, t.push(o);
 			}
-			o.distance += l.distanceTo(d), o.duration += L, s = p;
+			o.distance += l.distanceTo(d), o.duration += te, s = p;
 		}
 		let l = e.vertices[e.vertices.length - 1].coords;
 		return Coordinates.equals(l, a) || t.push({
@@ -2763,7 +2761,10 @@ var default_rules_default = { rules: [{
 			value: .5
 		}
 	]
-}] }, matchAll = (e, t) => t.every(({ path: t, value: n }) => t.split(".").reduce((e, t) => {
+}] }, pathSegmentsCache = /* @__PURE__ */ new Map(), getPathSegments = (e) => {
+	let t = pathSegmentsCache.get(e);
+	return t || (t = e.split("."), pathSegmentsCache.set(e, t)), t;
+}, matchAll = (e, t) => t.every(({ path: t, value: n }) => getPathSegments(t).reduce((e, t) => {
 	if (e != null) return e[t];
 }, e) === n), createEdgeScope = (e) => ({
 	tags: e.rawTags,
@@ -2806,11 +2807,12 @@ var default_rules_default = { rules: [{
 		return this.edgeAcceptOnlyRules.length > 0 ? this.edgeAcceptOnlyRules.some((e) => matchAll(t, e.match)) : this.evaluateAcceptRules(t, this.edgeAcceptRules);
 	};
 	weightEdgeFn = (e) => {
-		let t = getDurationFromLength(e.length, this.baseSpeedKmh), n = createEdgeScope(e);
-		for (let e of this.edgeWeightRules) if (matchAll(n, e.match) && e.action === "set") return e.value;
-		let r = t;
-		for (let e of this.edgeWeightRules) matchAll(n, e.match) && e.action === "multiply" && (r *= e.value);
-		return r;
+		let t = createEdgeScope(e), n = getDurationFromLength(e.length, this.baseSpeedKmh);
+		for (let e of this.edgeWeightRules) if (matchAll(t, e.match)) {
+			if (e.action === "set") return e.value;
+			e.action === "multiply" && (n *= e.value);
+		}
+		return n;
 	};
 	weightVertexFn = (e) => {
 		let t = createVertexScope(e);
@@ -2916,7 +2918,39 @@ var RoutingError = class e extends Error {
 	}
 };
 const DefaultGraphRouterRules = new GraphRouterRulesBuilder().build();
-var GraphRouterEngineResults = class {
+var MinHeap = class {
+	dists = [];
+	verts = [];
+	get size() {
+		return this.dists.length;
+	}
+	push(e, t) {
+		this.dists.push(e), this.verts.push(t);
+		let n = this.dists.length - 1;
+		for (; n > 0;) {
+			let e = n - 1 >> 1;
+			if (this.dists[e] <= this.dists[n]) break;
+			this.swap(e, n), n = e;
+		}
+	}
+	pop() {
+		let e = this.verts[0], t = this.dists.length - 1;
+		this.dists[0] = this.dists[t], this.verts[0] = this.verts[t], this.dists.pop(), this.verts.pop();
+		let n = 0, r = this.dists.length;
+		for (;;) {
+			let e = n, t = 2 * n + 1, i = 2 * n + 2;
+			if (t < r && this.dists[t] < this.dists[e] && (e = t), i < r && this.dists[i] < this.dists[e] && (e = i), e === n) break;
+			this.swap(e, n), n = e;
+		}
+		return e;
+	}
+	swap(e, t) {
+		let n = this.dists[e];
+		this.dists[e] = this.dists[t], this.dists[t] = n;
+		let r = this.verts[e];
+		this.verts[e] = this.verts[t], this.verts[t] = r;
+	}
+}, GraphRouterEngineResults = class {
 	prev;
 	dist;
 	source;
@@ -2988,20 +3022,26 @@ var GraphRouterEngineResults = class {
 		e.vertices.forEach((e) => e.id = t++);
 	}
 	calculateShortestPathToMultipleDestinationsByVertex(e, t, n = DefaultGraphRouterRules, r = this.graph.vertices, i = this.graph.edges) {
-		let a = new Set(r), o = Array(a.size).fill(Number.MAX_VALUE), s = Array(a.size).fill(null), c = i.filter((e) => (n.acceptEdgeFn?.(e) ?? DefaultGraphRouterRules.acceptEdgeFn?.(e)) && !this.disabledEdges.has(e)), l = n.weightEdgeFn ?? DefaultGraphRouterRules.weightEdgeFn, u = n.weightVertexFn ?? DefaultGraphRouterRules.weightVertexFn, d = (e) => {
-			let t = Number.MAX_VALUE, n = null;
-			return e.forEach((e) => {
-				let r = o[e.id];
-				r <= t && (t = r, n = e);
-			}), n;
-		}, f = new Set(t);
-		for (o[e.id] = 0; a.size > 0;) {
-			let e = d(a);
-			if (a.delete(e), t.includes(e) && (f.delete(e), f.size === 0)) break;
-			c.filter((t) => t.vertex1 == e || !t.properties.isOneway && t.vertex2 == e).forEach((t) => {
-				let n = e === t.vertex1 ? t.vertex2 : t.vertex1, r = l(t) + u(n), i = o[e.id] + r;
-				i < o[n.id] && (o[n.id] = i, s[n.id] = e);
-			});
+		let a = r.length, o = Array(a).fill(Number.MAX_VALUE), s = Array(a).fill(null), c = i.filter((e) => (n.acceptEdgeFn?.(e) ?? DefaultGraphRouterRules.acceptEdgeFn?.(e)) && !this.disabledEdges.has(e)), l = n.weightEdgeFn ?? DefaultGraphRouterRules.weightEdgeFn, u = n.weightVertexFn ?? DefaultGraphRouterRules.weightVertexFn, d = Array.from({ length: a }, () => []);
+		for (let e of c) d[e.vertex1.id].push({
+			edge: e,
+			neighbor: e.vertex2
+		}), e.properties.isOneway || d[e.vertex2.id].push({
+			edge: e,
+			neighbor: e.vertex1
+		});
+		let f = Array(a).fill(!1), p = new Set(t);
+		o[e.id] = 0;
+		let m = new MinHeap();
+		for (m.push(0, e); m.size > 0;) {
+			let e = m.pop();
+			if (!f[e.id]) {
+				if (f[e.id] = !0, p.has(e) && (p.delete(e), p.size === 0)) break;
+				for (let { edge: t, neighbor: n } of d[e.id]) {
+					let r = l(t) + u(n), i = o[e.id] + r;
+					i < o[n.id] && (o[n.id] = i, s[n.id] = e, m.push(i, n));
+				}
+			}
 		}
 		return new GraphRouterEngineResults(s, o, e, t, c);
 	}

package/dist/src/graph/GraphRouterEngine.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GraphRouterEngine.d.ts","sourceRoot":"","sources":["../../../src/graph/GraphRouterEngine.ts"],"names":[],"mappings":"AAEA,OAAO,IAAI,MAAM,QAAQ,CAAC;AAC1B,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,UAAU,MAAM,cAAc,CAAC;AACtC,OAAO,MAAM,MAAM,UAAU,CAAC;AAE9B,OAAO,gBAAgB,MAAM,oBAAoB,CAAC;AAElD,qBAAa,wBAAwB;IAC1B,IAAI,EAAE,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IAC3B,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,EAAE,IAAI,EAAE,CAAC;gBAGjB,IAAI,EAAE,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,EAC1B,IAAI,EAAE,MAAM,EAAE,EACd,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,EAAE,IAAI,EAAE;IASjB,aAAa,CAAC,EAAE,SAAkB,EAAE,IAAI,GAAE,MAAM,EAAO,GAAG,MAAM,EAAE;IAMlE,gBAAgB,CAAC,EAAE,SAAkB;IAKrC,KAAK,CAAC,EAAE,SAAkB;IAqB1B,SAAS,CAAC,KAAK,EAAE,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAgDzB;AAED,MAAM,CAAC,OAAO,OAAO,iBAAiB;IAElC,aAAa,EAAE,GAAG,CAAC,IAAI,CAAC,CAAa;IACrC,SAAgB,KAAK,EAAE,KAAK,CAAC;gBAEjB,KAAK,EAAE,KAAK;IAMxB,mDAAmD,CAC/C,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,GAAE,gBAA+B,EACtC,aAAa,WAAsB,EACnC,UAAU,SAAmB,GAC9B,wBAAwB;IAsD3B,6BAA6B,CACzB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,KAAK,GAAE,gBAA+B,EACtC,aAAa,WAAsB,EACnC,UAAU,SAAmB,GAC9B,wBAAwB;IAK3B,mBAAmB;IAuCnB,SAAS;;;;;;;;;;;;;CA0BZ"}
+{"version":3,"file":"GraphRouterEngine.d.ts","sourceRoot":"","sources":["../../../src/graph/GraphRouterEngine.ts"],"names":[],"mappings":"AAEA,OAAO,IAAI,MAAM,QAAQ,CAAC;AAC1B,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,UAAU,MAAM,cAAc,CAAC;AACtC,OAAO,MAAM,MAAM,UAAU,CAAC;AAE9B,OAAO,gBAAgB,MAAM,oBAAoB,CAAC;AAqDlD,qBAAa,wBAAwB;IAC1B,IAAI,EAAE,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IAC3B,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,EAAE,IAAI,EAAE,CAAC;gBAGjB,IAAI,EAAE,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,EAC1B,IAAI,EAAE,MAAM,EAAE,EACd,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,EAAE,IAAI,EAAE;IASjB,aAAa,CAAC,EAAE,SAAkB,EAAE,IAAI,GAAE,MAAM,EAAO,GAAG,MAAM,EAAE;IAMlE,gBAAgB,CAAC,EAAE,SAAkB;IAKrC,KAAK,CAAC,EAAE,SAAkB;IAqB1B,SAAS,CAAC,KAAK,EAAE,KAAK;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAgDzB;AAED,MAAM,CAAC,OAAO,OAAO,iBAAiB;IAElC,aAAa,EAAE,GAAG,CAAC,IAAI,CAAC,CAAa;IACrC,SAAgB,KAAK,EAAE,KAAK,CAAC;gBAEjB,KAAK,EAAE,KAAK;IAMxB,mDAAmD,CAC/C,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,GAAE,gBAA+B,EACtC,aAAa,WAAsB,EACnC,UAAU,SAAmB,GAC9B,wBAAwB;IA2D3B,6BAA6B,CACzB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,KAAK,GAAE,gBAA+B,EACtC,aAAa,WAAsB,EACnC,UAAU,SAAmB,GAC9B,wBAAwB;IAK3B,mBAAmB;IAuCnB,SAAS;;;;;;;;;;;;;CA0BZ"}

package/dist/src/graph/GraphRouterRules.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GraphRouterRules.d.ts","sourceRoot":"","sources":["../../../src/graph/GraphRouterRules.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,MAAM,MAAM,aAAa,CAAC;AAEjC,OAAO,KAAK,EAAE,UAAU,EAAE,kBAAkB,EAAE,cAAc,EAAE,sBAAsB,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAElK,MAAM,MAAM,wBAAwB,GAAG,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;AAsBxE,MAAM,CAAC,OAAO,OAAO,gBAAgB;IACjC,SAAgB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtC,SAAgB,eAAe,EAAE,UAAU,EAAE,CAAC;IAC9C,SAAgB,mBAAmB,EAAE,kBAAkB,EAAE,CAAC;IAC1D,SAAgB,eAAe,EAAE,cAAc,EAAE,CAAC;IAClD,SAAgB,iBAAiB,EAAE,UAAU,EAAE,CAAC;IAChD,SAAgB,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;IACtD,SAAgB,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/C,SAAgB,qBAAqB,CAAC,EAAE,OAAO,CAAC;gBAG5C,YAAY,CAAC,EAAE,MAAM,EACrB,eAAe,GAAE,UAAU,EAAO,EAClC,mBAAmB,GAAE,kBAAkB,EAAO,EAC9C,eAAe,GAAE,cAAc,EAAO,EACtC,iBAAiB,GAAE,UAAU,EAAO,EACpC,iBAAiB,GAAE,gBAAgB,EAAO,EAC1C,qBAAqB,CAAC,EAAE,MAAM,EAC9B,qBAAqB,CAAC,EAAE,OAAO;IAYnC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAKhC;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAwB3B,OAAO,CAAC,YAAY,CAGlB;IAEF,SAAgB,YAAY,GAAI,MAAM,IAAI,aAYxC;IAEF,SAAgB,YAAY,GAAI,MAAM,IAAI,YAcxC;IAEF,SAAgB,cAAc,GAAI,QAAQ,MAAM,YAO9C;IAEF,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,oBAAoB,GAAG,gBAAgB;IAa7D,MAAM,IAAI,oBAAoB;IAa9B,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,sBAAsB,GAAG,wBAAwB;CAK9E"}
+{"version":3,"file":"GraphRouterRules.d.ts","sourceRoot":"","sources":["../../../src/graph/GraphRouterRules.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,MAAM,MAAM,aAAa,CAAC;AAEjC,OAAO,KAAK,EAAE,UAAU,EAAE,kBAAkB,EAAE,cAAc,EAAE,sBAAsB,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAElK,MAAM,MAAM,wBAAwB,GAAG,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;AA+BxE,MAAM,CAAC,OAAO,OAAO,gBAAgB;IACjC,SAAgB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtC,SAAgB,eAAe,EAAE,UAAU,EAAE,CAAC;IAC9C,SAAgB,mBAAmB,EAAE,kBAAkB,EAAE,CAAC;IAC1D,SAAgB,eAAe,EAAE,cAAc,EAAE,CAAC;IAClD,SAAgB,iBAAiB,EAAE,UAAU,EAAE,CAAC;IAChD,SAAgB,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;IACtD,SAAgB,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/C,SAAgB,qBAAqB,CAAC,EAAE,OAAO,CAAC;gBAG5C,YAAY,CAAC,EAAE,MAAM,EACrB,eAAe,GAAE,UAAU,EAAO,EAClC,mBAAmB,GAAE,kBAAkB,EAAO,EAC9C,eAAe,GAAE,cAAc,EAAO,EACtC,iBAAiB,GAAE,UAAU,EAAO,EACpC,iBAAiB,GAAE,gBAAgB,EAAO,EAC1C,qBAAqB,CAAC,EAAE,MAAM,EAC9B,qBAAqB,CAAC,EAAE,OAAO;IAYnC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAKhC;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAwB3B,OAAO,CAAC,YAAY,CAGlB;IAEF,SAAgB,YAAY,GAAI,MAAM,IAAI,aAYxC;IAEF,SAAgB,YAAY,GAAI,MAAM,IAAI,YAaxC;IAEF,SAAgB,cAAc,GAAI,QAAQ,MAAM,YAO9C;IAEF,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,oBAAoB,GAAG,gBAAgB;IAa7D,MAAM,IAAI,oBAAoB;IAa9B,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,sBAAsB,GAAG,wBAAwB;CAK9E"}

package/dist/src/model/StepsBuilder.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"StepsBuilder.d.ts","sourceRoot":"","sources":["../../../src/model/StepsBuilder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAuB,MAAM,YAAY,CAAC;AAK9D,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAY,MAAM,QAAQ,CAAC;AAG1D,OAAO,UAAU,MAAM,qBAAqB,CAAC;AAI7C,MAAM,CAAC,OAAO,OAAO,YAAY;IAE7B,OAAO,CAAC,KAAK,CAA4B;IACzC,OAAO,CAAC,GAAG,CAA4B;IACvC,OAAO,CAAC,UAAU,CAA8B;IAChD,OAAO,CAAC,SAAS,CAAqB;IAEtC,QAAQ,CAAC,KAAK,EAAE,WAAW;IAK3B,MAAM,CAAC,GAAG,EAAE,WAAW;IAKvB,aAAa,CAAC,UAAU,EAAE,WAAW,EAAE;IAKvC,YAAY,CAAC,SAAS,EAAE,WAAW,EAAE;IAKrC,WAAW,CAAC,QAAQ,EAAE,WAAW;IAKjC,aAAa,CAAC,UAAU,EAAE,UAAU;IAuKpC,KAAK,IAAI,IAAI,EAAE;CA6GlB"}
+{"version":3,"file":"StepsBuilder.d.ts","sourceRoot":"","sources":["../../../src/model/StepsBuilder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAuB,MAAM,YAAY,CAAC;AAK9D,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAA2B,MAAM,QAAQ,CAAC;AAGzE,OAAO,UAAU,MAAM,qBAAqB,CAAC;AAI7C,MAAM,CAAC,OAAO,OAAO,YAAY;IAE7B,OAAO,CAAC,KAAK,CAA4B;IACzC,OAAO,CAAC,GAAG,CAA4B;IACvC,OAAO,CAAC,UAAU,CAA8B;IAChD,OAAO,CAAC,SAAS,CAAqB;IAEtC,QAAQ,CAAC,KAAK,EAAE,WAAW;IAK3B,MAAM,CAAC,GAAG,EAAE,WAAW;IAKvB,aAAa,CAAC,UAAU,EAAE,WAAW,EAAE;IAKvC,YAAY,CAAC,SAAS,EAAE,WAAW,EAAE;IAKrC,WAAW,CAAC,QAAQ,EAAE,WAAW;IAKjC,aAAa,CAAC,UAAU,EAAE,UAAU;IAuKpC,KAAK,IAAI,IAAI,EAAE;CA6GlB"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@wemap/routers",
-  "version": "14.5.4",
+  "version": "14.5.6",
   "type": "module",
   "private": false,
   "publishConfig": {
@@ -23,9 +23,9 @@
     "@turf/convex": "^6.5.0",
     "@turf/helpers": "^6.5.0",
     "@types/mapbox__polyline": "^1.0.2",
-    "@wemap/core": "14.5.4",
-    "@wemap/geo": "14.5.4",
-    "@wemap/osm": "14.5.4",
+    "@wemap/core": "14.5.6",
+    "@wemap/geo": "14.5.6",
+    "@wemap/osm": "14.5.6",
     "@wemap/salesman.js": "^2.1.0"
   },
   "devDependencies": {