@eyeon/map 2.0.43 → 2.0.44

package/dist/chunks/wheelZoom.js

@@ -1,170 +1,170 @@
-import { bK as S, bb as w, b9 as M, b4 as _, bd as L, bZ as N, aV as O, G as $, cn as F, d as y, bv as b, av as k, bP as x, bN as T, k as W } from "./responsive.js";
-function Y(e, d, r) {
-  var i, o, u, a;
-  const c = S(e), t = [];
-  for (const n of c.elements) {
-    if (!n.d || n.interactive || d != null && d.has(n.id) || /^parking[-_]?lines?(?:[-_]|$)/i.test(n.id) || n.id.toLowerCase().startsWith("route-path") || w(n.id) || M(n.id) || _(n.id) || L(n.id)) continue;
-    const f = N(n.id, r), I = (f == null ? void 0 : f.fill) ?? (O(n.id) ? $(r) : (i = n.style) == null ? void 0 : i.fill), l = (f == null ? void 0 : f.stroke) ?? ((o = n.style) == null ? void 0 : o.stroke), m = (f == null ? void 0 : f.strokeWidth) ?? ((u = n.style) == null ? void 0 : u.strokeWidth);
-    t.push({
-      id: n.id,
-      d: n.d,
-      fill: I && I !== "none" ? I : void 0,
-      stroke: l && l !== "none" ? l : void 0,
-      strokeWidth: m,
-      opacity: (a = n.style) == null ? void 0 : a.opacity
+import { bL as S, bc as w, ba as M, b5 as _, be as L, b_ as O, aV as $, G as F, co as N, d as y, bw as b, av as k, bQ as x, bO as T, k as W } from "./responsive.js";
+function U(e, f, c, s = !1) {
+  var t, u, l, o;
+  const n = S(e), i = [];
+  for (const r of n.elements) {
+    if (!r.d || r.interactive || r.inBackground && !s || f != null && f.has(r.id) || /^parking[-_]?lines?(?:[-_]|$)/i.test(r.id) || r.id.toLowerCase().startsWith("route-path") || w(r.id) || M(r.id) || _(r.id) || L(r.id)) continue;
+    const a = O(r.id, c), h = (a == null ? void 0 : a.fill) ?? ($(r.id) ? F(c) : (t = r.style) == null ? void 0 : t.fill), m = (a == null ? void 0 : a.stroke) ?? ((u = r.style) == null ? void 0 : u.stroke), d = (a == null ? void 0 : a.strokeWidth) ?? ((l = r.style) == null ? void 0 : l.strokeWidth);
+    i.push({
+      id: r.id,
+      d: r.d,
+      fill: h && h !== "none" ? h : void 0,
+      stroke: m && m !== "none" ? m : void 0,
+      strokeWidth: d,
+      opacity: (o = r.style) == null ? void 0 : o.opacity
     });
   }
-  return F(t, (n) => n.id);
+  return N(i, (r) => r.id);
 }
-function P(e, d, r, c = y) {
-  const t = e.filter((n) => r.includes(n.id));
-  if (t.length < 2) return null;
-  const i = t.reduce((n, f) => f.id < n.id ? f : n), o = [];
-  for (const n of t)
-    n.id !== i.id && k(n, i) <= c && o.push(n.id);
-  if (o.length === 0) return null;
-  const u = new Set(o), a = [];
-  for (const n of d) {
-    let f = !1;
-    if (u.has(n.fromAnchorId) && (n.fromAnchorId = i.id, f = !0), u.has(n.toAnchorId) && (n.toAnchorId = i.id, f = !0), n.fromAnchorId === n.toAnchorId) {
-      a.push(n.id);
+function P(e, f, c, s = y) {
+  const n = e.filter((o) => c.includes(o.id));
+  if (n.length < 2) return null;
+  const i = n.reduce((o, r) => r.id < o.id ? r : o), t = [];
+  for (const o of n)
+    o.id !== i.id && k(o, i) <= s && t.push(o.id);
+  if (t.length === 0) return null;
+  const u = new Set(t), l = [];
+  for (const o of f) {
+    let r = !1;
+    if (u.has(o.fromAnchorId) && (o.fromAnchorId = i.id, r = !0), u.has(o.toAnchorId) && (o.toAnchorId = i.id, r = !0), o.fromAnchorId === o.toAnchorId) {
+      l.push(o.id);
       continue;
     }
-    f && a.push(n.id);
+    r && l.push(o.id);
   }
   return {
     survivingAnchorId: i.id,
-    removedAnchorIds: o,
-    rewiredEdgeIds: a
+    removedAnchorIds: t,
+    rewiredEdgeIds: l
   };
 }
-function D(e, d = y) {
-  const r = [], c = /* @__PURE__ */ new Set();
-  for (let t = 0; t < e.length; t++) {
-    if (c.has(e[t].id)) continue;
-    const i = [e[t].id];
-    for (let o = t + 1; o < e.length; o++)
-      c.has(e[o].id) || e[t].levelId === e[o].levelId && k(e[t], e[o]) <= d && (i.push(e[o].id), c.add(e[o].id));
-    i.length > 1 && (c.add(e[t].id), r.push(i));
+function D(e, f = y) {
+  const c = [], s = /* @__PURE__ */ new Set();
+  for (let n = 0; n < e.length; n++) {
+    if (s.has(e[n].id)) continue;
+    const i = [e[n].id];
+    for (let t = n + 1; t < e.length; t++)
+      s.has(e[t].id) || e[n].levelId === e[t].levelId && k(e[n], e[t]) <= f && (i.push(e[t].id), s.add(e[t].id));
+    i.length > 1 && (s.add(e[n].id), c.push(i));
   }
-  return r;
+  return c;
 }
-function K(e, d, r = y) {
-  const c = e.slice(), t = d.map((n) => ({ ...n })), i = /* @__PURE__ */ new Set();
-  for (const n of D(c, r)) {
-    const f = P(c, t, n, r);
-    if (f)
-      for (const I of f.removedAnchorIds) i.add(I);
+function R(e, f, c = y) {
+  const s = e.slice(), n = f.map((o) => ({ ...o })), i = /* @__PURE__ */ new Set();
+  for (const o of D(s, c)) {
+    const r = P(s, n, o, c);
+    if (r)
+      for (const a of r.removedAnchorIds) i.add(a);
   }
-  const o = c.filter((n) => !i.has(n.id)), u = /* @__PURE__ */ new Set(), a = [];
-  for (const n of t) {
-    if (i.has(n.fromAnchorId) || i.has(n.toAnchorId) || n.fromAnchorId === n.toAnchorId) continue;
-    const f = Math.min(n.fromAnchorId, n.toAnchorId), I = Math.max(n.fromAnchorId, n.toAnchorId), l = `${f}|${I}`;
-    u.has(l) || (u.add(l), a.push(n));
+  const t = s.filter((o) => !i.has(o.id)), u = /* @__PURE__ */ new Set(), l = [];
+  for (const o of n) {
+    if (i.has(o.fromAnchorId) || i.has(o.toAnchorId) || o.fromAnchorId === o.toAnchorId) continue;
+    const r = Math.min(o.fromAnchorId, o.toAnchorId), a = Math.max(o.fromAnchorId, o.toAnchorId), h = `${r}|${a}`;
+    u.has(h) || (u.add(h), l.push(o));
   }
-  return { anchors: o, edges: a };
+  return { anchors: t, edges: l };
 }
-function B(e, d, r, c = y) {
-  let t = null;
-  for (const o of d) {
-    const u = b(e, o);
-    u && (!t || u.distance < t.distance) && (t = { point: u.point, distance: u.distance });
+function Y(e, f, c, s = y) {
+  let n = null;
+  for (const t of f) {
+    const u = b(e, t);
+    u && (!n || u.distance < n.distance) && (n = { point: u.point, distance: u.distance });
   }
-  if (!t) return null;
-  const i = r.find(
-    (o) => o.levelId === e.levelId && k(o, t.point) <= c
+  if (!n) return null;
+  const i = c.find(
+    (t) => t.levelId === e.levelId && k(t, n.point) <= s
   );
   return {
     unitAnchorId: e.id,
-    junctionAnchor: i ? { x: i.x, y: i.y, existingId: i.id } : { x: t.point.x, y: t.point.y },
+    junctionAnchor: i ? { x: i.x, y: i.y, existingId: i.id } : { x: n.point.x, y: n.point.y },
     edge: {
       fromAnchorId: e.id,
       toAnchorId: i == null ? void 0 : i.id
     }
   };
 }
-function X(e, d, r, c) {
-  if (r.length === 0) return null;
-  const t = r.flat();
-  if (t.length === 0) return null;
-  let i = 0, o = 0;
-  for (const n of t)
-    i += n.x, o += n.y;
-  const u = { x: i / t.length, y: o / t.length }, a = x(u, r) ? u : t[0];
+function X(e, f, c, s) {
+  if (c.length === 0) return null;
+  const n = c.flat();
+  if (n.length === 0) return null;
+  let i = 0, t = 0;
+  for (const o of n)
+    i += o.x, t += o.y;
+  const u = { x: i / n.length, y: t / n.length }, l = x(u, c) ? u : n[0];
   return {
-    id: c,
-    levelId: d,
+    id: s,
+    levelId: f,
     shapeId: e,
     kind: "unit",
-    x: a.x,
-    y: a.y,
+    x: l.x,
+    y: l.y,
     connectorId: null
   };
 }
-function Z(e, d, r = 20) {
+function q(e, f, c = 20) {
   if (e.length === 0)
     return { anchors: [], edges: [] };
-  let c = 1 / 0, t = 1 / 0, i = -1 / 0, o = -1 / 0;
-  for (const s of e)
-    for (const h of s)
-      c = Math.min(c, h.x), t = Math.min(t, h.y), i = Math.max(i, h.x), o = Math.max(o, h.y);
-  const u = Math.max(1, Math.ceil((i - c) / r)), a = Math.max(1, Math.ceil((o - t) / r)), n = [];
-  for (let s = 0; s < a; s++)
-    for (let h = 0; h < u; h++) {
-      const p = c + (h + 0.5) * r, g = t + (s + 0.5) * r, A = { x: p, y: g };
-      x(A, e) && (d.length > 0 && x(A, d) || n.push({ key: `${h},${s}`, x: p, y: g, col: h, row: s }));
+  let s = 1 / 0, n = 1 / 0, i = -1 / 0, t = -1 / 0;
+  for (const d of e)
+    for (const I of d)
+      s = Math.min(s, I.x), n = Math.min(n, I.y), i = Math.max(i, I.x), t = Math.max(t, I.y);
+  const u = Math.max(1, Math.ceil((i - s) / c)), l = Math.max(1, Math.ceil((t - n) / c)), o = [];
+  for (let d = 0; d < l; d++)
+    for (let I = 0; I < u; I++) {
+      const p = s + (I + 0.5) * c, g = n + (d + 0.5) * c, A = { x: p, y: g };
+      x(A, e) && (f.length > 0 && x(A, f) || o.push({ key: `${I},${d}`, x: p, y: g, col: I, row: d }));
     }
-  const f = new Map(n.map((s) => [s.key, s])), I = n.map((s) => ({
-    tempId: s.key,
-    x: s.x,
-    y: s.y,
+  const r = new Map(o.map((d) => [d.key, d])), a = o.map((d) => ({
+    tempId: d.key,
+    x: d.x,
+    y: d.y,
     kind: "junction"
-  })), l = [], m = /* @__PURE__ */ new Set();
-  for (const s of n) {
-    const h = [
-      [s.col + 1, s.row],
-      [s.col, s.row + 1]
+  })), h = [], m = /* @__PURE__ */ new Set();
+  for (const d of o) {
+    const I = [
+      [d.col + 1, d.row],
+      [d.col, d.row + 1]
     ];
-    for (const [p, g] of h) {
+    for (const [p, g] of I) {
       const A = `${p},${g}`;
-      if (!f.has(A)) continue;
-      const v = s.key < A ? `${s.key}|${A}` : `${A}|${s.key}`;
-      m.has(v) || (m.add(v), l.push({ fromTempId: s.key, toTempId: A }));
+      if (!r.has(A)) continue;
+      const v = d.key < A ? `${d.key}|${A}` : `${A}|${d.key}`;
+      m.has(v) || (m.add(v), h.push({ fromTempId: d.key, toTempId: A }));
     }
   }
-  return { anchors: I, edges: l };
+  return { anchors: a, edges: h };
 }
-function q(e, d, r, c, t = y) {
-  const i = [], o = [];
-  let u = c;
-  const a = (f, I) => {
-    const l = i.find(
-      (s) => k(s, { x: f, y: I }) <= t
+function Q(e, f, c, s, n = y) {
+  const i = [], t = [];
+  let u = s;
+  const l = (r, a) => {
+    const h = i.find(
+      (d) => k(d, { x: r, y: a }) <= n
     );
-    if (l) return l.id;
+    if (h) return h.id;
     const m = u++;
     return i.push({
       id: m,
-      levelId: d,
+      levelId: f,
       shapeId: null,
       kind: "junction",
-      x: f,
-      y: I,
+      x: r,
+      y: a,
       connectorId: null
     }), m;
   };
-  for (const f of e) {
-    const I = T(f);
-    for (const l of I)
-      for (let m = 0; m < l.length - 1; m++) {
-        const s = a(l[m].x, l[m].y), h = a(l[m + 1].x, l[m + 1].y);
-        s === h || o.some(
-          (g) => g.fromAnchorId === s && g.toAnchorId === h || g.fromAnchorId === h && g.toAnchorId === s
-        ) || o.push({
+  for (const r of e) {
+    const a = T(r);
+    for (const h of a)
+      for (let m = 0; m < h.length - 1; m++) {
+        const d = l(h[m].x, h[m].y), I = l(h[m + 1].x, h[m + 1].y);
+        d === I || t.some(
+          (g) => g.fromAnchorId === d && g.toAnchorId === I || g.fromAnchorId === I && g.toAnchorId === d
+        ) || t.push({
           id: u++,
-          mapId: r,
-          fromAnchorId: s,
-          toAnchorId: h,
+          mapId: c,
+          fromAnchorId: d,
+          toAnchorId: I,
           weight: null,
           directed: !1,
           accessible: !0,
@@ -172,48 +172,48 @@ function q(e, d, r, c, t = y) {
         });
       }
   }
-  const n = K(i, o, t);
-  return { anchors: n.anchors, edges: n.edges, nextId: u };
+  const o = R(i, t, n);
+  return { anchors: o.anchors, edges: o.edges, nextId: u };
 }
-function R(e) {
+function C(e) {
   return e === "entrance" ? "entrance" : e === "connector" ? "connector" : "unit";
 }
-function C(e) {
+function K(e) {
   return e === "entrance" ? "entrance_link" : "unit_link";
 }
-function G(e, d, r) {
-  if (x(e, d)) return "inside";
-  for (const c of d) {
-    if (c.length < 2) continue;
-    const t = [...c, c[0]], i = b(e, t);
-    if (i && i.distance <= r) return "near";
+function G(e, f, c) {
+  if (x(e, f)) return "inside";
+  for (const s of f) {
+    if (s.length < 2) continue;
+    const n = [...s, s[0]], i = b(e, n);
+    if (i && i.distance <= c) return "near";
   }
   return null;
 }
-function H(e, d, r) {
-  let c = null;
-  for (const t of d) {
-    if (!W.includes(t.kind)) continue;
-    const i = t.geometry.polygons ?? [];
+function H(e, f, c) {
+  let s = null;
+  for (const n of f) {
+    if (!W.includes(n.kind)) continue;
+    const i = n.geometry.polygons ?? [];
     if (i.length === 0) continue;
-    const o = G(e, i, r);
-    if (o === "inside") return t;
-    o === "near" && c == null && (c = t);
+    const t = G(e, i, c);
+    if (t === "inside") return n;
+    t === "near" && s == null && (s = n);
   }
-  return c;
+  return s;
 }
-function J(e, d, r, c = y * 3) {
-  const t = /* @__PURE__ */ new Map();
-  for (const o of d)
-    t.set(o.fromAnchorId, (t.get(o.fromAnchorId) ?? 0) + 1), t.set(o.toAnchorId, (t.get(o.toAnchorId) ?? 0) + 1);
+function Z(e, f, c, s = y * 3) {
+  const n = /* @__PURE__ */ new Map();
+  for (const t of f)
+    n.set(t.fromAnchorId, (n.get(t.fromAnchorId) ?? 0) + 1), n.set(t.toAnchorId, (n.get(t.toAnchorId) ?? 0) + 1);
   let i = 0;
-  for (const o of e) {
-    if (o.shapeId != null) continue;
-    const u = H(o, r, c);
-    if (!u || (o.shapeId = u.id, o.kind = R(u.kind), i += 1, (t.get(o.id) ?? 0) > 1)) continue;
-    const a = C(o.kind);
-    for (const n of d)
-      (n.fromAnchorId === o.id || n.toAnchorId === o.id) && (n.kind = a);
+  for (const t of e) {
+    if (t.shapeId != null) continue;
+    const u = H(t, c, s);
+    if (!u || (t.shapeId = u.id, t.kind = C(u.kind), i += 1, (n.get(t.id) ?? 0) > 1)) continue;
+    const l = K(t.kind);
+    for (const o of f)
+      (o.fromAnchorId === t.id || o.toAnchorId === t.id) && (o.kind = l);
   }
   return i;
 }
@@ -221,24 +221,24 @@ const V = 0.95, E = 1;
 function j(e = E) {
   return Math.pow(V, e);
 }
-function Q(e, d, r) {
-  if (d === 0) return e;
-  const c = j((r == null ? void 0 : r.zoomSpeed) ?? E), t = d < 0 ? e / c : e * c, i = (r == null ? void 0 : r.min) ?? Number.NEGATIVE_INFINITY, o = (r == null ? void 0 : r.max) ?? Number.POSITIVE_INFINITY;
-  return Math.min(o, Math.max(i, t));
+function J(e, f, c) {
+  if (f === 0) return e;
+  const s = j((c == null ? void 0 : c.zoomSpeed) ?? E), n = f < 0 ? e / s : e * s, i = (c == null ? void 0 : c.min) ?? Number.NEGATIVE_INFINITY, t = (c == null ? void 0 : c.max) ?? Number.POSITIVE_INFINITY;
+  return Math.min(t, Math.max(i, n));
 }
 export {
   V as W,
   E as a,
-  J as b,
-  B as c,
-  Z as d,
-  K as e,
+  Z as b,
+  Y as c,
+  q as d,
+  R as e,
   D as f,
   j as g,
-  q as i,
-  Q as n,
-  Y as o,
-  R as r,
+  Q as i,
+  J as n,
+  U as o,
+  C as r,
   X as u,
   P as w
 };

package/dist/chunks/wheelZoom.js.map

@@ -1 +1 @@
-{"version":3,"file":"wheelZoom.js","sources":["../../src/core/outdoorDecoration.ts","../../src/core/routing/graph-tools.ts","../../src/core/wheelZoom.ts"],"sourcesContent":["import {\n  parseSvgString,\n  isInteractiveGroupLabel,\n  isRouteFolderLabel,\n  isRoutePathLabel,\n  isStoreFolderLabel,\n} from './import';\nimport { amenityHouseFill, isAmenityLayerId } from './shapeFill';\nimport {\n  resolveLayerStyle,\n  sortByOutdoorSvgPaintOrder,\n  type StaticLayerTheme,\n} from './layerStyles';\n\nexport interface OutdoorDecorationPath {\n  id: string;\n  d: string;\n  fill?: string;\n  stroke?: string;\n  strokeWidth?: number;\n  opacity?: number;\n}\n\n/**\n * Paths the assign viewer draws from the live outdoor SVG: house-style\n * decoration (green area, parking lanes, icons) and any other\n * non-interactive art. Interactive / store folders stay out — those are\n * `cm_shapes` rows.\n */\nexport function outdoorDecorationFromSvg(\n  svgText: string,\n  suppressIds?: ReadonlySet<string>,\n  theme?: StaticLayerTheme | null,\n): OutdoorDecorationPath[] {\n  const parsed = parseSvgString(svgText);\n  const out: OutdoorDecorationPath[] = [];\n  for (const el of parsed.elements) {\n    if (!el.d) continue;\n    if (el.interactive) continue;\n    if (suppressIds?.has(el.id)) continue;\n    if (/^parking[-_]?lines?(?:[-_]|$)/i.test(el.id)) continue;\n    if (el.id.toLowerCase().startsWith('route-path')) continue;\n    if (isRoutePathLabel(el.id) || isRouteFolderLabel(el.id)) continue;\n    if (isInteractiveGroupLabel(el.id) || isStoreFolderLabel(el.id)) continue;\n\n    const layer = resolveLayerStyle(el.id, theme);\n    const fill =\n      layer?.fill ??\n      (isAmenityLayerId(el.id) ? amenityHouseFill(theme) : el.style?.fill);\n    const stroke = layer?.stroke ?? el.style?.stroke;\n    const strokeWidth = layer?.strokeWidth ?? el.style?.strokeWidth;\n    out.push({\n      id: el.id,\n      d: el.d,\n      fill: fill && fill !== 'none' ? fill : undefined,\n      stroke: stroke && stroke !== 'none' ? stroke : undefined,\n      strokeWidth,\n      opacity: el.style?.opacity,\n    });\n  }\n  // Parking lanes move under green areas. Later special shapes stay on top.\n  return sortByOutdoorSvgPaintOrder(out, (item) => item.id);\n}\n","import type {\n  AnchorKind,\n  AutoConnectResult,\n  CmAnchor,\n  CmRouteEdge,\n  ShapeGeometry,\n  ShapeKind,\n  SkeletonSuggestion,\n  Vec2,\n  WeldResult,\n} from '../types';\nimport { DEFAULT_WELD_TOLERANCE, INTERACTIVE_SHAPE_KINDS } from '../types';\nimport {\n  distance,\n  nearestPointOnPolyline,\n  pathToPolygons,\n  pointInPolygons,\n} from '../geometry';\n\nexport interface AnchorLike {\n  id: number;\n  x: number;\n  y: number;\n  levelId: number;\n  shapeId?: number | null;\n  kind?: string;\n}\n\nexport interface EdgeLike {\n  id: number;\n  fromAnchorId: number;\n  toAnchorId: number;\n}\n\n/**\n * Weld anchors within tolerance into the surviving (lowest id) anchor.\n * Rewires edges that referenced removed anchors.\n */\nexport function weldAnchors(\n  anchors: AnchorLike[],\n  edges: EdgeLike[],\n  candidateIds: number[],\n  tolerance = DEFAULT_WELD_TOLERANCE,\n): WeldResult | null {\n  const candidates = anchors.filter((a) => candidateIds.includes(a.id));\n  if (candidates.length < 2) return null;\n\n  // Cluster by proximity from the first candidate's position centroid of group\n  const surviving = candidates.reduce((min, a) => (a.id < min.id ? a : min));\n  const removed: number[] = [];\n\n  for (const a of candidates) {\n    if (a.id === surviving.id) continue;\n    if (distance(a, surviving) <= tolerance) {\n      removed.push(a.id);\n    }\n  }\n\n  if (removed.length === 0) return null;\n\n  const removedSet = new Set(removed);\n  const rewired: number[] = [];\n\n  for (const edge of edges) {\n    let changed = false;\n    if (removedSet.has(edge.fromAnchorId)) {\n      edge.fromAnchorId = surviving.id;\n      changed = true;\n    }\n    if (removedSet.has(edge.toAnchorId)) {\n      edge.toAnchorId = surviving.id;\n      changed = true;\n    }\n    // Drop self-loops\n    if (edge.fromAnchorId === edge.toAnchorId) {\n      rewired.push(edge.id);\n      continue;\n    }\n    if (changed) rewired.push(edge.id);\n  }\n\n  return {\n    survivingAnchorId: surviving.id,\n    removedAnchorIds: removed,\n    rewiredEdgeIds: rewired,\n  };\n}\n\n/**\n * Find all pairs of anchors within tolerance that should be welded.\n */\nexport function findWeldCandidates(\n  anchors: AnchorLike[],\n  tolerance = DEFAULT_WELD_TOLERANCE,\n): number[][] {\n  const groups: number[][] = [];\n  const used = new Set<number>();\n\n  for (let i = 0; i < anchors.length; i++) {\n    if (used.has(anchors[i].id)) continue;\n    const group = [anchors[i].id];\n    for (let j = i + 1; j < anchors.length; j++) {\n      if (used.has(anchors[j].id)) continue;\n      if (\n        anchors[i].levelId === anchors[j].levelId &&\n        distance(anchors[i], anchors[j]) <= tolerance\n      ) {\n        group.push(anchors[j].id);\n        used.add(anchors[j].id);\n      }\n    }\n    if (group.length > 1) {\n      used.add(anchors[i].id);\n      groups.push(group);\n    }\n  }\n  return groups;\n}\n\n/**\n * Merge coincident anchors and drop overlapping undirected edges.\n * Two SVG imports of the same ROUTES layer stack a second copy on top of\n * the first — dragging one junction then leaves the twin behind.\n */\nexport function collapseDuplicateRouteGraph<\n  A extends AnchorLike,\n  E extends EdgeLike,\n>(\n  anchors: A[],\n  edges: E[],\n  tolerance = DEFAULT_WELD_TOLERANCE,\n): { anchors: A[]; edges: E[] } {\n  const nextAnchors = anchors.slice();\n  const nextEdges = edges.map((edge) => ({ ...edge }));\n  const removed = new Set<number>();\n  for (const group of findWeldCandidates(nextAnchors, tolerance)) {\n    const result = weldAnchors(nextAnchors, nextEdges, group, tolerance);\n    if (!result) continue;\n    for (const id of result.removedAnchorIds) removed.add(id);\n  }\n  const alive = nextAnchors.filter((anchor) => !removed.has(anchor.id));\n  const seen = new Set<string>();\n  const uniqueEdges: E[] = [];\n  for (const edge of nextEdges) {\n    if (removed.has(edge.fromAnchorId) || removed.has(edge.toAnchorId)) continue;\n    if (edge.fromAnchorId === edge.toAnchorId) continue;\n    const lo = Math.min(edge.fromAnchorId, edge.toAnchorId);\n    const hi = Math.max(edge.fromAnchorId, edge.toAnchorId);\n    const key = `${lo}|${hi}`;\n    if (seen.has(key)) continue;\n    seen.add(key);\n    uniqueEdges.push(edge);\n  }\n  return { anchors: alive, edges: uniqueEdges };\n}\n\n/**\n * Auto-connect a unit anchor to the nearest walkable segment via perpendicular projection.\n */\nexport function autoConnectUnitAnchor(\n  unitAnchor: AnchorLike,\n  walkablePolylines: Vec2[][],\n  existingJunctions: AnchorLike[],\n  weldTolerance = DEFAULT_WELD_TOLERANCE,\n): AutoConnectResult | null {\n  let best: { point: Vec2; distance: number } | null = null;\n\n  for (const line of walkablePolylines) {\n    const hit = nearestPointOnPolyline(unitAnchor, line);\n    if (hit && (!best || hit.distance < best.distance)) {\n      best = { point: hit.point, distance: hit.distance };\n    }\n  }\n\n  if (!best) return null;\n\n  // Reuse existing junction if within weld tolerance\n  const existing = existingJunctions.find(\n    (j) =>\n      j.levelId === unitAnchor.levelId &&\n      distance(j, best!.point) <= weldTolerance,\n  );\n\n  return {\n    unitAnchorId: unitAnchor.id,\n    junctionAnchor: existing\n      ? { x: existing.x, y: existing.y, existingId: existing.id }\n      : { x: best.point.x, y: best.point.y },\n    edge: {\n      fromAnchorId: unitAnchor.id,\n      toAnchorId: existing?.id,\n    },\n  };\n}\n\n/**\n * Place a unit anchor at the centroid of a shape's polygons, if the point lies inside.\n */\nexport function unitAnchorFromShape(\n  shapeId: number,\n  levelId: number,\n  polygons: Vec2[][],\n  tempId: number,\n): CmAnchor | null {\n  if (polygons.length === 0) return null;\n  const flat = polygons.flat();\n  if (flat.length === 0) return null;\n\n  let sx = 0;\n  let sy = 0;\n  for (const p of flat) {\n    sx += p.x;\n    sy += p.y;\n  }\n  const c = { x: sx / flat.length, y: sy / flat.length };\n\n  // Prefer centroid if inside; otherwise use first polygon's average of extremes\n  const point = pointInPolygons(c, polygons) ? c : flat[0];\n\n  return {\n    id: tempId,\n    levelId,\n    shapeId,\n    kind: 'unit',\n    x: point.x,\n    y: point.y,\n    connectorId: null,\n  };\n}\n\n/**\n * Build a simple medial-axis-ish skeleton from walkable polygons minus voids.\n * This is a pragmatic approximation: sample a grid inside walkable, reject void cells,\n * connect adjacent free cells into a sparse graph, then prune to a polyline network.\n */\nexport function buildAutoSkeleton(\n  walkablePolygons: Vec2[][],\n  voidPolygons: Vec2[][],\n  cellSize = 20,\n): SkeletonSuggestion {\n  if (walkablePolygons.length === 0) {\n    return { anchors: [], edges: [] };\n  }\n\n  let minX = Infinity;\n  let minY = Infinity;\n  let maxX = -Infinity;\n  let maxY = -Infinity;\n  for (const poly of walkablePolygons) {\n    for (const p of poly) {\n      minX = Math.min(minX, p.x);\n      minY = Math.min(minY, p.y);\n      maxX = Math.max(maxX, p.x);\n      maxY = Math.max(maxY, p.y);\n    }\n  }\n\n  const cols = Math.max(1, Math.ceil((maxX - minX) / cellSize));\n  const rows = Math.max(1, Math.ceil((maxY - minY) / cellSize));\n  const free: Array<{ key: string; x: number; y: number; col: number; row: number }> = [];\n\n  for (let row = 0; row < rows; row++) {\n    for (let col = 0; col < cols; col++) {\n      const x = minX + (col + 0.5) * cellSize;\n      const y = minY + (row + 0.5) * cellSize;\n      const pt = { x, y };\n      if (!pointInPolygons(pt, walkablePolygons)) continue;\n      if (voidPolygons.length > 0 && pointInPolygons(pt, voidPolygons)) continue;\n      free.push({ key: `${col},${row}`, x, y, col, row });\n    }\n  }\n\n  const byKey = new Map(free.map((c) => [c.key, c]));\n  const anchors = free.map((c) => ({\n    tempId: c.key,\n    x: c.x,\n    y: c.y,\n    kind: 'junction' as const,\n  }));\n\n  const edges: Array<{ fromTempId: string; toTempId: string }> = [];\n  const seen = new Set<string>();\n\n  for (const cell of free) {\n    const neighbors = [\n      [cell.col + 1, cell.row],\n      [cell.col, cell.row + 1],\n    ];\n    for (const [nc, nr] of neighbors) {\n      const nk = `${nc},${nr}`;\n      if (!byKey.has(nk)) continue;\n      const edgeKey = cell.key < nk ? `${cell.key}|${nk}` : `${nk}|${cell.key}`;\n      if (seen.has(edgeKey)) continue;\n      seen.add(edgeKey);\n      edges.push({ fromTempId: cell.key, toTempId: nk });\n    }\n  }\n\n  return { anchors, edges };\n}\n\n/**\n * Convert ROUTES-group SVG line endpoints into welded anchors + edges.\n * This is the key converter step that repairs coincident-but-disconnected joins.\n *\n * Anchors land in raw SVG user space (Y down), the same space as shape\n * geometry. There is intentionally no viewbox-height flip here — mirroring\n * routes without mirroring shapes would silently desynchronise the two.\n */\nexport function importRoutePaths(\n  pathDs: string[],\n  levelId: number,\n  mapId: number,\n  startId: number,\n  weldTolerance = DEFAULT_WELD_TOLERANCE,\n): { anchors: CmAnchor[]; edges: CmRouteEdge[]; nextId: number } {\n  const anchors: CmAnchor[] = [];\n  const edges: CmRouteEdge[] = [];\n  let nextId = startId;\n\n  const findOrCreate = (x: number, y: number): number => {\n    const existing = anchors.find(\n      (a) => distance(a, { x, y }) <= weldTolerance,\n    );\n    if (existing) return existing.id;\n    const id = nextId++;\n    anchors.push({\n      id,\n      levelId,\n      shapeId: null,\n      kind: 'junction',\n      x,\n      y,\n      connectorId: null,\n    });\n    return id;\n  };\n\n  for (const d of pathDs) {\n    const polys = pathToPolygons(d);\n    for (const poly of polys) {\n      for (let i = 0; i < poly.length - 1; i++) {\n        const a = findOrCreate(poly[i].x, poly[i].y);\n        const b = findOrCreate(poly[i + 1].x, poly[i + 1].y);\n        if (a === b) continue;\n        // Avoid duplicate edges\n        const dup = edges.some(\n          (e) =>\n            (e.fromAnchorId === a && e.toAnchorId === b) ||\n            (e.fromAnchorId === b && e.toAnchorId === a),\n        );\n        if (dup) continue;\n        edges.push({\n          id: nextId++,\n          mapId,\n          fromAnchorId: a,\n          toAnchorId: b,\n          weight: null,\n          directed: false,\n          accessible: true,\n          kind: 'walk',\n        });\n      }\n    }\n  }\n\n  const collapsed = collapseDuplicateRouteGraph(anchors, edges, weldTolerance);\n  return { anchors: collapsed.anchors, edges: collapsed.edges, nextId };\n}\n\nexport function routeAnchorKindForShape(kind: ShapeKind): AnchorKind {\n  if (kind === 'entrance') return 'entrance';\n  if (kind === 'connector') return 'connector';\n  return 'unit';\n}\n\nfunction routeLinkKind(kind: AnchorKind): CmRouteEdge['kind'] {\n  return kind === 'entrance' ? 'entrance_link' : 'unit_link';\n}\n\n/** `inside` matches v1's store-mesh hit; `near` is a door-step fallback. */\nfunction pointOnPolygons(\n  point: Vec2,\n  polygons: Vec2[][],\n  tolerance: number,\n): 'inside' | 'near' | null {\n  if (pointInPolygons(point, polygons)) return 'inside';\n  for (const poly of polygons) {\n    if (poly.length < 2) continue;\n    const closed = [...poly, poly[0]];\n    const hit = nearestPointOnPolyline(point, closed);\n    if (hit && hit.distance <= tolerance) return 'near';\n  }\n  return null;\n}\n\nexport interface AttachableImportShape {\n  id: number;\n  kind: ShapeKind;\n  geometry: Pick<ShapeGeometry, 'polygons'>;\n}\n\nfunction shapeUnderImportedAnchor(\n  point: Vec2,\n  shapes: AttachableImportShape[],\n  insideTolerance: number,\n): AttachableImportShape | null {\n  let near: AttachableImportShape | null = null;\n  for (const shape of shapes) {\n    if (!INTERACTIVE_SHAPE_KINDS.includes(shape.kind)) continue;\n    const polys = shape.geometry.polygons ?? [];\n    if (polys.length === 0) continue;\n    const hit = pointOnPolygons(point, polys, insideTolerance);\n    if (hit === 'inside') return shape;\n    if (hit === 'near' && near == null) near = shape;\n  }\n  return near;\n}\n\n/**\n * Check every imported route vertex. If it falls inside (or on) a store /\n * amenity / kiosk / connector, it becomes that shape's orange destination.\n * A shape may own any number of those points so pathfinding can leave from\n * the nearest door. Corridor through-points keep `walk` edges; leaf stubs\n * become `unit_link`.\n */\nexport function attachImportedRouteAnchors(\n  anchors: CmAnchor[],\n  edges: CmRouteEdge[],\n  shapes: AttachableImportShape[],\n  insideTolerance = DEFAULT_WELD_TOLERANCE * 3,\n): number {\n  const degree = new Map<number, number>();\n  for (const edge of edges) {\n    degree.set(edge.fromAnchorId, (degree.get(edge.fromAnchorId) ?? 0) + 1);\n    degree.set(edge.toAnchorId, (degree.get(edge.toAnchorId) ?? 0) + 1);\n  }\n\n  let attached = 0;\n  for (const anchor of anchors) {\n    if (anchor.shapeId != null) continue;\n    const shape = shapeUnderImportedAnchor(anchor, shapes, insideTolerance);\n    if (!shape) continue;\n    anchor.shapeId = shape.id;\n    anchor.kind = routeAnchorKindForShape(shape.kind);\n    attached += 1;\n    if ((degree.get(anchor.id) ?? 0) > 1) continue;\n    const linkKind = routeLinkKind(anchor.kind);\n    for (const edge of edges) {\n      if (edge.fromAnchorId === anchor.id || edge.toAnchorId === anchor.id) {\n        edge.kind = linkKind;\n      }\n    }\n  }\n\n  return attached;\n}\n","/**\n * Wheel / trackpad zoom curve for every map surface.\n *\n * PORTAL default MapViewer uses drei → three-stdlib OrbitControls, whose\n * `getZoomScale()` is `Math.pow(0.95, zoomSpeed)` **per wheel event** (not\n * scaled by `deltaY`). Edit Map / Wayfinding must use the same step or they\n * feel slower than the assign map.\n *\n * Scroll up zooms in; the caller keeps the pointer over the same map point\n * (`panAfterZoom` on the SVG canvas, `zoomToCursor` on OrbitControls).\n */\n\n/** three-stdlib OrbitControls `Math.pow(0.95, zoomSpeed)` base. */\nexport const WHEEL_ZOOM_BASE = 0.95;\n/** drei / three-stdlib default `zoomSpeed`. */\nexport const WHEEL_ZOOM_SPEED = 1;\n\n/**\n * OrbitControls dolly scale for one wheel event: `0.95 ** zoomSpeed`.\n * Sign of `deltaY` is ignored here; `nextZoomFromWheel` applies in vs out.\n */\nexport function wheelDollyScale(zoomSpeed = WHEEL_ZOOM_SPEED): number {\n  return Math.pow(WHEEL_ZOOM_BASE, zoomSpeed);\n}\n\n/**\n * Next SVG / orthographic zoom from a wheel event.\n * `deltaY < 0` zooms in. Pan separately so the cursor stays on the same point.\n */\nexport function nextZoomFromWheel(\n  currentZoom: number,\n  deltaY: number,\n  options?: {\n    zoomSpeed?: number;\n    min?: number;\n    max?: number;\n  },\n): number {\n  if (deltaY === 0) return currentZoom;\n  const scale = wheelDollyScale(options?.zoomSpeed ?? WHEEL_ZOOM_SPEED);\n  const next = deltaY < 0 ? currentZoom / scale : currentZoom * scale;\n  const min = options?.min ?? Number.NEGATIVE_INFINITY;\n  const max = options?.max ?? Number.POSITIVE_INFINITY;\n  return Math.min(max, Math.max(min, next));\n}\n"],"names":["outdoorDecorationFromSvg","svgText","suppressIds","theme","parsed","parseSvgString","out","el","isRoutePathLabel","isRouteFolderLabel","isInteractiveGroupLabel","isStoreFolderLabel","layer","resolveLayerStyle","fill","isAmenityLayerId","amenityHouseFill","_a","stroke","_b","strokeWidth","_c","_d","sortByOutdoorSvgPaintOrder","item","weldAnchors","anchors","edges","candidateIds","tolerance","DEFAULT_WELD_TOLERANCE","candidates","a","surviving","min","removed","distance","removedSet","rewired","edge","changed","findWeldCandidates","groups","used","i","group","j","collapseDuplicateRouteGraph","nextAnchors","nextEdges","result","id","alive","anchor","seen","uniqueEdges","lo","hi","key","autoConnectUnitAnchor","unitAnchor","walkablePolylines","existingJunctions","weldTolerance","best","line","hit","nearestPointOnPolyline","existing","unitAnchorFromShape","shapeId","levelId","polygons","tempId","flat","sx","sy","p","c","point","pointInPolygons","buildAutoSkeleton","walkablePolygons","voidPolygons","cellSize","minX","minY","maxX","maxY","poly","cols","rows","free","row","col","x","y","pt","byKey","cell","neighbors","nc","nr","nk","edgeKey","importRoutePaths","pathDs","mapId","startId","nextId","findOrCreate","d","polys","pathToPolygons","b","e","collapsed","routeAnchorKindForShape","kind","routeLinkKind","pointOnPolygons","closed","shapeUnderImportedAnchor","shapes","insideTolerance","near","shape","INTERACTIVE_SHAPE_KINDS","attachImportedRouteAnchors","degree","attached","linkKind","WHEEL_ZOOM_BASE","WHEEL_ZOOM_SPEED","wheelDollyScale","zoomSpeed","nextZoomFromWheel","currentZoom","deltaY","options","scale","next","max"],"mappings":";AA6BO,SAASA,EACdC,GACAC,GACAC,GACyB;;AACzB,QAAMC,IAASC,EAAeJ,CAAO,GAC/BK,IAA+B,CAAA;AACrC,aAAWC,KAAMH,EAAO,UAAU;AAOhC,QANI,CAACG,EAAG,KACJA,EAAG,eACHL,KAAA,QAAAA,EAAa,IAAIK,EAAG,OACpB,iCAAiC,KAAKA,EAAG,EAAE,KAC3CA,EAAG,GAAG,YAAA,EAAc,WAAW,YAAY,KAC3CC,EAAiBD,EAAG,EAAE,KAAKE,EAAmBF,EAAG,EAAE,KACnDG,EAAwBH,EAAG,EAAE,KAAKI,EAAmBJ,EAAG,EAAE,EAAG;AAEjE,UAAMK,IAAQC,EAAkBN,EAAG,IAAIJ,CAAK,GACtCW,KACJF,KAAA,gBAAAA,EAAO,UACNG,EAAiBR,EAAG,EAAE,IAAIS,EAAiBb,CAAK,KAAIc,IAAAV,EAAG,UAAH,gBAAAU,EAAU,OAC3DC,KAASN,KAAA,gBAAAA,EAAO,aAAUO,IAAAZ,EAAG,UAAH,gBAAAY,EAAU,SACpCC,KAAcR,KAAA,gBAAAA,EAAO,kBAAeS,IAAAd,EAAG,UAAH,gBAAAc,EAAU;AACpD,IAAAf,EAAI,KAAK;AAAA,MACP,IAAIC,EAAG;AAAA,MACP,GAAGA,EAAG;AAAA,MACN,MAAMO,KAAQA,MAAS,SAASA,IAAO;AAAA,MACvC,QAAQI,KAAUA,MAAW,SAASA,IAAS;AAAA,MAC/C,aAAAE;AAAA,MACA,UAASE,IAAAf,EAAG,UAAH,gBAAAe,EAAU;AAAA,IAAA,CACpB;AAAA,EACH;AAEA,SAAOC,EAA2BjB,GAAK,CAACkB,MAASA,EAAK,EAAE;AAC1D;ACxBO,SAASC,EACdC,GACAC,GACAC,GACAC,IAAYC,GACO;AACnB,QAAMC,IAAaL,EAAQ,OAAO,CAACM,MAAMJ,EAAa,SAASI,EAAE,EAAE,CAAC;AACpE,MAAID,EAAW,SAAS,EAAG,QAAO;AAGlC,QAAME,IAAYF,EAAW,OAAO,CAACG,GAAKF,MAAOA,EAAE,KAAKE,EAAI,KAAKF,IAAIE,CAAI,GACnEC,IAAoB,CAAA;AAE1B,aAAWH,KAAKD;AACd,IAAIC,EAAE,OAAOC,EAAU,MACnBG,EAASJ,GAAGC,CAAS,KAAKJ,KAC5BM,EAAQ,KAAKH,EAAE,EAAE;AAIrB,MAAIG,EAAQ,WAAW,EAAG,QAAO;AAEjC,QAAME,IAAa,IAAI,IAAIF,CAAO,GAC5BG,IAAoB,CAAA;AAE1B,aAAWC,KAAQZ,GAAO;AACxB,QAAIa,IAAU;AAUd,QATIH,EAAW,IAAIE,EAAK,YAAY,MAClCA,EAAK,eAAeN,EAAU,IAC9BO,IAAU,KAERH,EAAW,IAAIE,EAAK,UAAU,MAChCA,EAAK,aAAaN,EAAU,IAC5BO,IAAU,KAGRD,EAAK,iBAAiBA,EAAK,YAAY;AACzC,MAAAD,EAAQ,KAAKC,EAAK,EAAE;AACpB;AAAA,IACF;AACA,IAAIC,KAASF,EAAQ,KAAKC,EAAK,EAAE;AAAA,EACnC;AAEA,SAAO;AAAA,IACL,mBAAmBN,EAAU;AAAA,IAC7B,kBAAkBE;AAAA,IAClB,gBAAgBG;AAAA,EAAA;AAEpB;AAKO,SAASG,EACdf,GACAG,IAAYC,GACA;AACZ,QAAMY,IAAqB,CAAA,GACrBC,wBAAW,IAAA;AAEjB,WAASC,IAAI,GAAGA,IAAIlB,EAAQ,QAAQkB,KAAK;AACvC,QAAID,EAAK,IAAIjB,EAAQkB,CAAC,EAAE,EAAE,EAAG;AAC7B,UAAMC,IAAQ,CAACnB,EAAQkB,CAAC,EAAE,EAAE;AAC5B,aAASE,IAAIF,IAAI,GAAGE,IAAIpB,EAAQ,QAAQoB;AACtC,MAAIH,EAAK,IAAIjB,EAAQoB,CAAC,EAAE,EAAE,KAExBpB,EAAQkB,CAAC,EAAE,YAAYlB,EAAQoB,CAAC,EAAE,WAClCV,EAASV,EAAQkB,CAAC,GAAGlB,EAAQoB,CAAC,CAAC,KAAKjB,MAEpCgB,EAAM,KAAKnB,EAAQoB,CAAC,EAAE,EAAE,GACxBH,EAAK,IAAIjB,EAAQoB,CAAC,EAAE,EAAE;AAG1B,IAAID,EAAM,SAAS,MACjBF,EAAK,IAAIjB,EAAQkB,CAAC,EAAE,EAAE,GACtBF,EAAO,KAAKG,CAAK;AAAA,EAErB;AACA,SAAOH;AACT;AAOO,SAASK,EAIdrB,GACAC,GACAE,IAAYC,GACkB;AAC9B,QAAMkB,IAActB,EAAQ,MAAA,GACtBuB,IAAYtB,EAAM,IAAI,CAACY,OAAU,EAAE,GAAGA,IAAO,GAC7CJ,wBAAc,IAAA;AACpB,aAAWU,KAASJ,EAAmBO,GAAanB,CAAS,GAAG;AAC9D,UAAMqB,IAASzB,EAAYuB,GAAaC,GAAWJ,GAAOhB,CAAS;AACnE,QAAKqB;AACL,iBAAWC,KAAMD,EAAO,iBAAkB,CAAAf,EAAQ,IAAIgB,CAAE;AAAA,EAC1D;AACA,QAAMC,IAAQJ,EAAY,OAAO,CAACK,MAAW,CAAClB,EAAQ,IAAIkB,EAAO,EAAE,CAAC,GAC9DC,wBAAW,IAAA,GACXC,IAAmB,CAAA;AACzB,aAAWhB,KAAQU,GAAW;AAE5B,QADId,EAAQ,IAAII,EAAK,YAAY,KAAKJ,EAAQ,IAAII,EAAK,UAAU,KAC7DA,EAAK,iBAAiBA,EAAK,WAAY;AAC3C,UAAMiB,IAAK,KAAK,IAAIjB,EAAK,cAAcA,EAAK,UAAU,GAChDkB,IAAK,KAAK,IAAIlB,EAAK,cAAcA,EAAK,UAAU,GAChDmB,IAAM,GAAGF,CAAE,IAAIC,CAAE;AACvB,IAAIH,EAAK,IAAII,CAAG,MAChBJ,EAAK,IAAII,CAAG,GACZH,EAAY,KAAKhB,CAAI;AAAA,EACvB;AACA,SAAO,EAAE,SAASa,GAAO,OAAOG,EAAA;AAClC;AAKO,SAASI,EACdC,GACAC,GACAC,GACAC,IAAgBjC,GACU;AAC1B,MAAIkC,IAAiD;AAErD,aAAWC,KAAQJ,GAAmB;AACpC,UAAMK,IAAMC,EAAuBP,GAAYK,CAAI;AACnD,IAAIC,MAAQ,CAACF,KAAQE,EAAI,WAAWF,EAAK,cACvCA,IAAO,EAAE,OAAOE,EAAI,OAAO,UAAUA,EAAI,SAAA;AAAA,EAE7C;AAEA,MAAI,CAACF,EAAM,QAAO;AAGlB,QAAMI,IAAWN,EAAkB;AAAA,IACjC,CAAChB,MACCA,EAAE,YAAYc,EAAW,WACzBxB,EAASU,GAAGkB,EAAM,KAAK,KAAKD;AAAA,EAAA;AAGhC,SAAO;AAAA,IACL,cAAcH,EAAW;AAAA,IACzB,gBAAgBQ,IACZ,EAAE,GAAGA,EAAS,GAAG,GAAGA,EAAS,GAAG,YAAYA,EAAS,OACrD,EAAE,GAAGJ,EAAK,MAAM,GAAG,GAAGA,EAAK,MAAM,EAAA;AAAA,IACrC,MAAM;AAAA,MACJ,cAAcJ,EAAW;AAAA,MACzB,YAAYQ,KAAA,gBAAAA,EAAU;AAAA,IAAA;AAAA,EACxB;AAEJ;AAKO,SAASC,EACdC,GACAC,GACAC,GACAC,GACiB;AACjB,MAAID,EAAS,WAAW,EAAG,QAAO;AAClC,QAAME,IAAOF,EAAS,KAAA;AACtB,MAAIE,EAAK,WAAW,EAAG,QAAO;AAE9B,MAAIC,IAAK,GACLC,IAAK;AACT,aAAWC,KAAKH;AACd,IAAAC,KAAME,EAAE,GACRD,KAAMC,EAAE;AAEV,QAAMC,IAAI,EAAE,GAAGH,IAAKD,EAAK,QAAQ,GAAGE,IAAKF,EAAK,OAAA,GAGxCK,IAAQC,EAAgBF,GAAGN,CAAQ,IAAIM,IAAIJ,EAAK,CAAC;AAEvD,SAAO;AAAA,IACL,IAAID;AAAA,IACJ,SAAAF;AAAA,IACA,SAAAD;AAAA,IACA,MAAM;AAAA,IACN,GAAGS,EAAM;AAAA,IACT,GAAGA,EAAM;AAAA,IACT,aAAa;AAAA,EAAA;AAEjB;AAOO,SAASE,EACdC,GACAC,GACAC,IAAW,IACS;AACpB,MAAIF,EAAiB,WAAW;AAC9B,WAAO,EAAE,SAAS,IAAI,OAAO,CAAA,EAAC;AAGhC,MAAIG,IAAO,OACPC,IAAO,OACPC,IAAO,QACPC,IAAO;AACX,aAAWC,KAAQP;AACjB,eAAWL,KAAKY;AACd,MAAAJ,IAAO,KAAK,IAAIA,GAAMR,EAAE,CAAC,GACzBS,IAAO,KAAK,IAAIA,GAAMT,EAAE,CAAC,GACzBU,IAAO,KAAK,IAAIA,GAAMV,EAAE,CAAC,GACzBW,IAAO,KAAK,IAAIA,GAAMX,EAAE,CAAC;AAI7B,QAAMa,IAAO,KAAK,IAAI,GAAG,KAAK,MAAMH,IAAOF,KAAQD,CAAQ,CAAC,GACtDO,IAAO,KAAK,IAAI,GAAG,KAAK,MAAMH,IAAOF,KAAQF,CAAQ,CAAC,GACtDQ,IAA+E,CAAA;AAErF,WAASC,IAAM,GAAGA,IAAMF,GAAME;AAC5B,aAASC,IAAM,GAAGA,IAAMJ,GAAMI,KAAO;AACnC,YAAMC,IAAIV,KAAQS,IAAM,OAAOV,GACzBY,IAAIV,KAAQO,IAAM,OAAOT,GACzBa,IAAK,EAAE,GAAAF,GAAG,GAAAC,EAAA;AAChB,MAAKhB,EAAgBiB,GAAIf,CAAgB,MACrCC,EAAa,SAAS,KAAKH,EAAgBiB,GAAId,CAAY,KAC/DS,EAAK,KAAK,EAAE,KAAK,GAAGE,CAAG,IAAID,CAAG,IAAI,GAAAE,GAAG,GAAAC,GAAG,KAAAF,GAAK,KAAAD,EAAA,CAAK;AAAA,IACpD;AAGF,QAAMK,IAAQ,IAAI,IAAIN,EAAK,IAAI,CAACd,MAAM,CAACA,EAAE,KAAKA,CAAC,CAAC,CAAC,GAC3CpD,IAAUkE,EAAK,IAAI,CAACd,OAAO;AAAA,IAC/B,QAAQA,EAAE;AAAA,IACV,GAAGA,EAAE;AAAA,IACL,GAAGA,EAAE;AAAA,IACL,MAAM;AAAA,EAAA,EACN,GAEInD,IAAyD,CAAA,GACzD2B,wBAAW,IAAA;AAEjB,aAAW6C,KAAQP,GAAM;AACvB,UAAMQ,IAAY;AAAA,MAChB,CAACD,EAAK,MAAM,GAAGA,EAAK,GAAG;AAAA,MACvB,CAACA,EAAK,KAAKA,EAAK,MAAM,CAAC;AAAA,IAAA;AAEzB,eAAW,CAACE,GAAIC,CAAE,KAAKF,GAAW;AAChC,YAAMG,IAAK,GAAGF,CAAE,IAAIC,CAAE;AACtB,UAAI,CAACJ,EAAM,IAAIK,CAAE,EAAG;AACpB,YAAMC,IAAUL,EAAK,MAAMI,IAAK,GAAGJ,EAAK,GAAG,IAAII,CAAE,KAAK,GAAGA,CAAE,IAAIJ,EAAK,GAAG;AACvE,MAAI7C,EAAK,IAAIkD,CAAO,MACpBlD,EAAK,IAAIkD,CAAO,GAChB7E,EAAM,KAAK,EAAE,YAAYwE,EAAK,KAAK,UAAUI,GAAI;AAAA,IACnD;AAAA,EACF;AAEA,SAAO,EAAE,SAAA7E,GAAS,OAAAC,EAAA;AACpB;AAUO,SAAS8E,EACdC,GACAnC,GACAoC,GACAC,GACA7C,IAAgBjC,GAC+C;AAC/D,QAAMJ,IAAsB,CAAA,GACtBC,IAAuB,CAAA;AAC7B,MAAIkF,IAASD;AAEb,QAAME,IAAe,CAACf,GAAWC,MAAsB;AACrD,UAAM5B,IAAW1C,EAAQ;AAAA,MACvB,CAACM,MAAMI,EAASJ,GAAG,EAAE,GAAA+D,GAAG,GAAAC,EAAA,CAAG,KAAKjC;AAAA,IAAA;AAElC,QAAIK,UAAiBA,EAAS;AAC9B,UAAMjB,IAAK0D;AACX,WAAAnF,EAAQ,KAAK;AAAA,MACX,IAAAyB;AAAA,MACA,SAAAoB;AAAA,MACA,SAAS;AAAA,MACT,MAAM;AAAA,MACN,GAAAwB;AAAA,MACA,GAAAC;AAAA,MACA,aAAa;AAAA,IAAA,CACd,GACM7C;AAAA,EACT;AAEA,aAAW4D,KAAKL,GAAQ;AACtB,UAAMM,IAAQC,EAAeF,CAAC;AAC9B,eAAWtB,KAAQuB;AACjB,eAASpE,IAAI,GAAGA,IAAI6C,EAAK,SAAS,GAAG7C,KAAK;AACxC,cAAMZ,IAAI8E,EAAarB,EAAK7C,CAAC,EAAE,GAAG6C,EAAK7C,CAAC,EAAE,CAAC,GACrCsE,IAAIJ,EAAarB,EAAK7C,IAAI,CAAC,EAAE,GAAG6C,EAAK7C,IAAI,CAAC,EAAE,CAAC;AAQnD,QAPIZ,MAAMkF,KAEEvF,EAAM;AAAA,UAChB,CAACwF,MACEA,EAAE,iBAAiBnF,KAAKmF,EAAE,eAAeD,KACzCC,EAAE,iBAAiBD,KAAKC,EAAE,eAAenF;AAAA,QAAA,KAG9CL,EAAM,KAAK;AAAA,UACT,IAAIkF;AAAA,UACJ,OAAAF;AAAA,UACA,cAAc3E;AAAA,UACd,YAAYkF;AAAA,UACZ,QAAQ;AAAA,UACR,UAAU;AAAA,UACV,YAAY;AAAA,UACZ,MAAM;AAAA,QAAA,CACP;AAAA,MACH;AAAA,EAEJ;AAEA,QAAME,IAAYrE,EAA4BrB,GAASC,GAAOoC,CAAa;AAC3E,SAAO,EAAE,SAASqD,EAAU,SAAS,OAAOA,EAAU,OAAO,QAAAP,EAAA;AAC/D;AAEO,SAASQ,EAAwBC,GAA6B;AACnE,SAAIA,MAAS,aAAmB,aAC5BA,MAAS,cAAoB,cAC1B;AACT;AAEA,SAASC,EAAcD,GAAuC;AAC5D,SAAOA,MAAS,aAAa,kBAAkB;AACjD;AAGA,SAASE,EACPzC,GACAP,GACA3C,GAC0B;AAC1B,MAAImD,EAAgBD,GAAOP,CAAQ,EAAG,QAAO;AAC7C,aAAWiB,KAAQjB,GAAU;AAC3B,QAAIiB,EAAK,SAAS,EAAG;AACrB,UAAMgC,IAAS,CAAC,GAAGhC,GAAMA,EAAK,CAAC,CAAC,GAC1BvB,IAAMC,EAAuBY,GAAO0C,CAAM;AAChD,QAAIvD,KAAOA,EAAI,YAAYrC,EAAW,QAAO;AAAA,EAC/C;AACA,SAAO;AACT;AAQA,SAAS6F,EACP3C,GACA4C,GACAC,GAC8B;AAC9B,MAAIC,IAAqC;AACzC,aAAWC,KAASH,GAAQ;AAC1B,QAAI,CAACI,EAAwB,SAASD,EAAM,IAAI,EAAG;AACnD,UAAMd,IAAQc,EAAM,SAAS,YAAY,CAAA;AACzC,QAAId,EAAM,WAAW,EAAG;AACxB,UAAM9C,IAAMsD,EAAgBzC,GAAOiC,GAAOY,CAAe;AACzD,QAAI1D,MAAQ,SAAU,QAAO4D;AAC7B,IAAI5D,MAAQ,UAAU2D,KAAQ,SAAMA,IAAOC;AAAA,EAC7C;AACA,SAAOD;AACT;AASO,SAASG,EACdtG,GACAC,GACAgG,GACAC,IAAkB9F,IAAyB,GACnC;AACR,QAAMmG,wBAAa,IAAA;AACnB,aAAW1F,KAAQZ;AACjB,IAAAsG,EAAO,IAAI1F,EAAK,eAAe0F,EAAO,IAAI1F,EAAK,YAAY,KAAK,KAAK,CAAC,GACtE0F,EAAO,IAAI1F,EAAK,aAAa0F,EAAO,IAAI1F,EAAK,UAAU,KAAK,KAAK,CAAC;AAGpE,MAAI2F,IAAW;AACf,aAAW7E,KAAU3B,GAAS;AAC5B,QAAI2B,EAAO,WAAW,KAAM;AAC5B,UAAMyE,IAAQJ,EAAyBrE,GAAQsE,GAAQC,CAAe;AAKtE,QAJI,CAACE,MACLzE,EAAO,UAAUyE,EAAM,IACvBzE,EAAO,OAAOgE,EAAwBS,EAAM,IAAI,GAChDI,KAAY,IACPD,EAAO,IAAI5E,EAAO,EAAE,KAAK,KAAK,GAAG;AACtC,UAAM8E,IAAWZ,EAAclE,EAAO,IAAI;AAC1C,eAAWd,KAAQZ;AACjB,OAAIY,EAAK,iBAAiBc,EAAO,MAAMd,EAAK,eAAec,EAAO,QAChEd,EAAK,OAAO4F;AAAA,EAGlB;AAEA,SAAOD;AACT;AC3bO,MAAME,IAAkB,MAElBC,IAAmB;AAMzB,SAASC,EAAgBC,IAAYF,GAA0B;AACpE,SAAO,KAAK,IAAID,GAAiBG,CAAS;AAC5C;AAMO,SAASC,EACdC,GACAC,GACAC,GAKQ;AACR,MAAID,MAAW,EAAG,QAAOD;AACzB,QAAMG,IAAQN,GAAgBK,KAAA,gBAAAA,EAAS,cAAaN,CAAgB,GAC9DQ,IAAOH,IAAS,IAAID,IAAcG,IAAQH,IAAcG,GACxD1G,KAAMyG,KAAA,gBAAAA,EAAS,QAAO,OAAO,mBAC7BG,KAAMH,KAAA,gBAAAA,EAAS,QAAO,OAAO;AACnC,SAAO,KAAK,IAAIG,GAAK,KAAK,IAAI5G,GAAK2G,CAAI,CAAC;AAC1C;"}
+{"version":3,"file":"wheelZoom.js","sources":["../../src/core/outdoorDecoration.ts","../../src/core/routing/graph-tools.ts","../../src/core/wheelZoom.ts"],"sourcesContent":["import {\n  parseSvgString,\n  isInteractiveGroupLabel,\n  isRouteFolderLabel,\n  isRoutePathLabel,\n  isStoreFolderLabel,\n} from './import';\nimport { amenityHouseFill, isAmenityLayerId } from './shapeFill';\nimport {\n  resolveLayerStyle,\n  sortByOutdoorSvgPaintOrder,\n  type StaticLayerTheme,\n} from './layerStyles';\n\nexport interface OutdoorDecorationPath {\n  id: string;\n  d: string;\n  fill?: string;\n  stroke?: string;\n  strokeWidth?: number;\n  opacity?: number;\n}\n\n/**\n * Paths the assign viewer draws from the live outdoor SVG: house-style\n * decoration (green area, parking lanes, icons) and any other\n * non-interactive art. Interactive / store folders stay out — those are\n * `cm_shapes` rows. The BACKGROUND group is Google Map artwork: omit it\n * unless `includeBackground` is set.\n */\nexport function outdoorDecorationFromSvg(\n  svgText: string,\n  suppressIds?: ReadonlySet<string>,\n  theme?: StaticLayerTheme | null,\n  includeBackground = false,\n): OutdoorDecorationPath[] {\n  const parsed = parseSvgString(svgText);\n  const out: OutdoorDecorationPath[] = [];\n  for (const el of parsed.elements) {\n    if (!el.d) continue;\n    if (el.interactive) continue;\n    if (el.inBackground && !includeBackground) continue;\n    if (suppressIds?.has(el.id)) continue;\n    if (/^parking[-_]?lines?(?:[-_]|$)/i.test(el.id)) continue;\n    if (el.id.toLowerCase().startsWith('route-path')) continue;\n    if (isRoutePathLabel(el.id) || isRouteFolderLabel(el.id)) continue;\n    if (isInteractiveGroupLabel(el.id) || isStoreFolderLabel(el.id)) continue;\n\n    const layer = resolveLayerStyle(el.id, theme);\n    const fill =\n      layer?.fill ??\n      (isAmenityLayerId(el.id) ? amenityHouseFill(theme) : el.style?.fill);\n    const stroke = layer?.stroke ?? el.style?.stroke;\n    const strokeWidth = layer?.strokeWidth ?? el.style?.strokeWidth;\n    out.push({\n      id: el.id,\n      d: el.d,\n      fill: fill && fill !== 'none' ? fill : undefined,\n      stroke: stroke && stroke !== 'none' ? stroke : undefined,\n      strokeWidth,\n      opacity: el.style?.opacity,\n    });\n  }\n  // Parking lanes move under green areas. Later special shapes stay on top.\n  return sortByOutdoorSvgPaintOrder(out, (item) => item.id);\n}\n","import type {\n  AnchorKind,\n  AutoConnectResult,\n  CmAnchor,\n  CmRouteEdge,\n  ShapeGeometry,\n  ShapeKind,\n  SkeletonSuggestion,\n  Vec2,\n  WeldResult,\n} from '../types';\nimport { DEFAULT_WELD_TOLERANCE, INTERACTIVE_SHAPE_KINDS } from '../types';\nimport {\n  distance,\n  nearestPointOnPolyline,\n  pathToPolygons,\n  pointInPolygons,\n} from '../geometry';\n\nexport interface AnchorLike {\n  id: number;\n  x: number;\n  y: number;\n  levelId: number;\n  shapeId?: number | null;\n  kind?: string;\n}\n\nexport interface EdgeLike {\n  id: number;\n  fromAnchorId: number;\n  toAnchorId: number;\n}\n\n/**\n * Weld anchors within tolerance into the surviving (lowest id) anchor.\n * Rewires edges that referenced removed anchors.\n */\nexport function weldAnchors(\n  anchors: AnchorLike[],\n  edges: EdgeLike[],\n  candidateIds: number[],\n  tolerance = DEFAULT_WELD_TOLERANCE,\n): WeldResult | null {\n  const candidates = anchors.filter((a) => candidateIds.includes(a.id));\n  if (candidates.length < 2) return null;\n\n  // Cluster by proximity from the first candidate's position centroid of group\n  const surviving = candidates.reduce((min, a) => (a.id < min.id ? a : min));\n  const removed: number[] = [];\n\n  for (const a of candidates) {\n    if (a.id === surviving.id) continue;\n    if (distance(a, surviving) <= tolerance) {\n      removed.push(a.id);\n    }\n  }\n\n  if (removed.length === 0) return null;\n\n  const removedSet = new Set(removed);\n  const rewired: number[] = [];\n\n  for (const edge of edges) {\n    let changed = false;\n    if (removedSet.has(edge.fromAnchorId)) {\n      edge.fromAnchorId = surviving.id;\n      changed = true;\n    }\n    if (removedSet.has(edge.toAnchorId)) {\n      edge.toAnchorId = surviving.id;\n      changed = true;\n    }\n    // Drop self-loops\n    if (edge.fromAnchorId === edge.toAnchorId) {\n      rewired.push(edge.id);\n      continue;\n    }\n    if (changed) rewired.push(edge.id);\n  }\n\n  return {\n    survivingAnchorId: surviving.id,\n    removedAnchorIds: removed,\n    rewiredEdgeIds: rewired,\n  };\n}\n\n/**\n * Find all pairs of anchors within tolerance that should be welded.\n */\nexport function findWeldCandidates(\n  anchors: AnchorLike[],\n  tolerance = DEFAULT_WELD_TOLERANCE,\n): number[][] {\n  const groups: number[][] = [];\n  const used = new Set<number>();\n\n  for (let i = 0; i < anchors.length; i++) {\n    if (used.has(anchors[i].id)) continue;\n    const group = [anchors[i].id];\n    for (let j = i + 1; j < anchors.length; j++) {\n      if (used.has(anchors[j].id)) continue;\n      if (\n        anchors[i].levelId === anchors[j].levelId &&\n        distance(anchors[i], anchors[j]) <= tolerance\n      ) {\n        group.push(anchors[j].id);\n        used.add(anchors[j].id);\n      }\n    }\n    if (group.length > 1) {\n      used.add(anchors[i].id);\n      groups.push(group);\n    }\n  }\n  return groups;\n}\n\n/**\n * Merge coincident anchors and drop overlapping undirected edges.\n * Two SVG imports of the same ROUTES layer stack a second copy on top of\n * the first — dragging one junction then leaves the twin behind.\n */\nexport function collapseDuplicateRouteGraph<\n  A extends AnchorLike,\n  E extends EdgeLike,\n>(\n  anchors: A[],\n  edges: E[],\n  tolerance = DEFAULT_WELD_TOLERANCE,\n): { anchors: A[]; edges: E[] } {\n  const nextAnchors = anchors.slice();\n  const nextEdges = edges.map((edge) => ({ ...edge }));\n  const removed = new Set<number>();\n  for (const group of findWeldCandidates(nextAnchors, tolerance)) {\n    const result = weldAnchors(nextAnchors, nextEdges, group, tolerance);\n    if (!result) continue;\n    for (const id of result.removedAnchorIds) removed.add(id);\n  }\n  const alive = nextAnchors.filter((anchor) => !removed.has(anchor.id));\n  const seen = new Set<string>();\n  const uniqueEdges: E[] = [];\n  for (const edge of nextEdges) {\n    if (removed.has(edge.fromAnchorId) || removed.has(edge.toAnchorId)) continue;\n    if (edge.fromAnchorId === edge.toAnchorId) continue;\n    const lo = Math.min(edge.fromAnchorId, edge.toAnchorId);\n    const hi = Math.max(edge.fromAnchorId, edge.toAnchorId);\n    const key = `${lo}|${hi}`;\n    if (seen.has(key)) continue;\n    seen.add(key);\n    uniqueEdges.push(edge);\n  }\n  return { anchors: alive, edges: uniqueEdges };\n}\n\n/**\n * Auto-connect a unit anchor to the nearest walkable segment via perpendicular projection.\n */\nexport function autoConnectUnitAnchor(\n  unitAnchor: AnchorLike,\n  walkablePolylines: Vec2[][],\n  existingJunctions: AnchorLike[],\n  weldTolerance = DEFAULT_WELD_TOLERANCE,\n): AutoConnectResult | null {\n  let best: { point: Vec2; distance: number } | null = null;\n\n  for (const line of walkablePolylines) {\n    const hit = nearestPointOnPolyline(unitAnchor, line);\n    if (hit && (!best || hit.distance < best.distance)) {\n      best = { point: hit.point, distance: hit.distance };\n    }\n  }\n\n  if (!best) return null;\n\n  // Reuse existing junction if within weld tolerance\n  const existing = existingJunctions.find(\n    (j) =>\n      j.levelId === unitAnchor.levelId &&\n      distance(j, best!.point) <= weldTolerance,\n  );\n\n  return {\n    unitAnchorId: unitAnchor.id,\n    junctionAnchor: existing\n      ? { x: existing.x, y: existing.y, existingId: existing.id }\n      : { x: best.point.x, y: best.point.y },\n    edge: {\n      fromAnchorId: unitAnchor.id,\n      toAnchorId: existing?.id,\n    },\n  };\n}\n\n/**\n * Place a unit anchor at the centroid of a shape's polygons, if the point lies inside.\n */\nexport function unitAnchorFromShape(\n  shapeId: number,\n  levelId: number,\n  polygons: Vec2[][],\n  tempId: number,\n): CmAnchor | null {\n  if (polygons.length === 0) return null;\n  const flat = polygons.flat();\n  if (flat.length === 0) return null;\n\n  let sx = 0;\n  let sy = 0;\n  for (const p of flat) {\n    sx += p.x;\n    sy += p.y;\n  }\n  const c = { x: sx / flat.length, y: sy / flat.length };\n\n  // Prefer centroid if inside; otherwise use first polygon's average of extremes\n  const point = pointInPolygons(c, polygons) ? c : flat[0];\n\n  return {\n    id: tempId,\n    levelId,\n    shapeId,\n    kind: 'unit',\n    x: point.x,\n    y: point.y,\n    connectorId: null,\n  };\n}\n\n/**\n * Build a simple medial-axis-ish skeleton from walkable polygons minus voids.\n * This is a pragmatic approximation: sample a grid inside walkable, reject void cells,\n * connect adjacent free cells into a sparse graph, then prune to a polyline network.\n */\nexport function buildAutoSkeleton(\n  walkablePolygons: Vec2[][],\n  voidPolygons: Vec2[][],\n  cellSize = 20,\n): SkeletonSuggestion {\n  if (walkablePolygons.length === 0) {\n    return { anchors: [], edges: [] };\n  }\n\n  let minX = Infinity;\n  let minY = Infinity;\n  let maxX = -Infinity;\n  let maxY = -Infinity;\n  for (const poly of walkablePolygons) {\n    for (const p of poly) {\n      minX = Math.min(minX, p.x);\n      minY = Math.min(minY, p.y);\n      maxX = Math.max(maxX, p.x);\n      maxY = Math.max(maxY, p.y);\n    }\n  }\n\n  const cols = Math.max(1, Math.ceil((maxX - minX) / cellSize));\n  const rows = Math.max(1, Math.ceil((maxY - minY) / cellSize));\n  const free: Array<{ key: string; x: number; y: number; col: number; row: number }> = [];\n\n  for (let row = 0; row < rows; row++) {\n    for (let col = 0; col < cols; col++) {\n      const x = minX + (col + 0.5) * cellSize;\n      const y = minY + (row + 0.5) * cellSize;\n      const pt = { x, y };\n      if (!pointInPolygons(pt, walkablePolygons)) continue;\n      if (voidPolygons.length > 0 && pointInPolygons(pt, voidPolygons)) continue;\n      free.push({ key: `${col},${row}`, x, y, col, row });\n    }\n  }\n\n  const byKey = new Map(free.map((c) => [c.key, c]));\n  const anchors = free.map((c) => ({\n    tempId: c.key,\n    x: c.x,\n    y: c.y,\n    kind: 'junction' as const,\n  }));\n\n  const edges: Array<{ fromTempId: string; toTempId: string }> = [];\n  const seen = new Set<string>();\n\n  for (const cell of free) {\n    const neighbors = [\n      [cell.col + 1, cell.row],\n      [cell.col, cell.row + 1],\n    ];\n    for (const [nc, nr] of neighbors) {\n      const nk = `${nc},${nr}`;\n      if (!byKey.has(nk)) continue;\n      const edgeKey = cell.key < nk ? `${cell.key}|${nk}` : `${nk}|${cell.key}`;\n      if (seen.has(edgeKey)) continue;\n      seen.add(edgeKey);\n      edges.push({ fromTempId: cell.key, toTempId: nk });\n    }\n  }\n\n  return { anchors, edges };\n}\n\n/**\n * Convert ROUTES-group SVG line endpoints into welded anchors + edges.\n * This is the key converter step that repairs coincident-but-disconnected joins.\n *\n * Anchors land in raw SVG user space (Y down), the same space as shape\n * geometry. There is intentionally no viewbox-height flip here — mirroring\n * routes without mirroring shapes would silently desynchronise the two.\n */\nexport function importRoutePaths(\n  pathDs: string[],\n  levelId: number,\n  mapId: number,\n  startId: number,\n  weldTolerance = DEFAULT_WELD_TOLERANCE,\n): { anchors: CmAnchor[]; edges: CmRouteEdge[]; nextId: number } {\n  const anchors: CmAnchor[] = [];\n  const edges: CmRouteEdge[] = [];\n  let nextId = startId;\n\n  const findOrCreate = (x: number, y: number): number => {\n    const existing = anchors.find(\n      (a) => distance(a, { x, y }) <= weldTolerance,\n    );\n    if (existing) return existing.id;\n    const id = nextId++;\n    anchors.push({\n      id,\n      levelId,\n      shapeId: null,\n      kind: 'junction',\n      x,\n      y,\n      connectorId: null,\n    });\n    return id;\n  };\n\n  for (const d of pathDs) {\n    const polys = pathToPolygons(d);\n    for (const poly of polys) {\n      for (let i = 0; i < poly.length - 1; i++) {\n        const a = findOrCreate(poly[i].x, poly[i].y);\n        const b = findOrCreate(poly[i + 1].x, poly[i + 1].y);\n        if (a === b) continue;\n        // Avoid duplicate edges\n        const dup = edges.some(\n          (e) =>\n            (e.fromAnchorId === a && e.toAnchorId === b) ||\n            (e.fromAnchorId === b && e.toAnchorId === a),\n        );\n        if (dup) continue;\n        edges.push({\n          id: nextId++,\n          mapId,\n          fromAnchorId: a,\n          toAnchorId: b,\n          weight: null,\n          directed: false,\n          accessible: true,\n          kind: 'walk',\n        });\n      }\n    }\n  }\n\n  const collapsed = collapseDuplicateRouteGraph(anchors, edges, weldTolerance);\n  return { anchors: collapsed.anchors, edges: collapsed.edges, nextId };\n}\n\nexport function routeAnchorKindForShape(kind: ShapeKind): AnchorKind {\n  if (kind === 'entrance') return 'entrance';\n  if (kind === 'connector') return 'connector';\n  return 'unit';\n}\n\nfunction routeLinkKind(kind: AnchorKind): CmRouteEdge['kind'] {\n  return kind === 'entrance' ? 'entrance_link' : 'unit_link';\n}\n\n/** `inside` matches v1's store-mesh hit; `near` is a door-step fallback. */\nfunction pointOnPolygons(\n  point: Vec2,\n  polygons: Vec2[][],\n  tolerance: number,\n): 'inside' | 'near' | null {\n  if (pointInPolygons(point, polygons)) return 'inside';\n  for (const poly of polygons) {\n    if (poly.length < 2) continue;\n    const closed = [...poly, poly[0]];\n    const hit = nearestPointOnPolyline(point, closed);\n    if (hit && hit.distance <= tolerance) return 'near';\n  }\n  return null;\n}\n\nexport interface AttachableImportShape {\n  id: number;\n  kind: ShapeKind;\n  geometry: Pick<ShapeGeometry, 'polygons'>;\n}\n\nfunction shapeUnderImportedAnchor(\n  point: Vec2,\n  shapes: AttachableImportShape[],\n  insideTolerance: number,\n): AttachableImportShape | null {\n  let near: AttachableImportShape | null = null;\n  for (const shape of shapes) {\n    if (!INTERACTIVE_SHAPE_KINDS.includes(shape.kind)) continue;\n    const polys = shape.geometry.polygons ?? [];\n    if (polys.length === 0) continue;\n    const hit = pointOnPolygons(point, polys, insideTolerance);\n    if (hit === 'inside') return shape;\n    if (hit === 'near' && near == null) near = shape;\n  }\n  return near;\n}\n\n/**\n * Check every imported route vertex. If it falls inside (or on) a store /\n * amenity / kiosk / connector, it becomes that shape's orange destination.\n * A shape may own any number of those points so pathfinding can leave from\n * the nearest door. Corridor through-points keep `walk` edges; leaf stubs\n * become `unit_link`.\n */\nexport function attachImportedRouteAnchors(\n  anchors: CmAnchor[],\n  edges: CmRouteEdge[],\n  shapes: AttachableImportShape[],\n  insideTolerance = DEFAULT_WELD_TOLERANCE * 3,\n): number {\n  const degree = new Map<number, number>();\n  for (const edge of edges) {\n    degree.set(edge.fromAnchorId, (degree.get(edge.fromAnchorId) ?? 0) + 1);\n    degree.set(edge.toAnchorId, (degree.get(edge.toAnchorId) ?? 0) + 1);\n  }\n\n  let attached = 0;\n  for (const anchor of anchors) {\n    if (anchor.shapeId != null) continue;\n    const shape = shapeUnderImportedAnchor(anchor, shapes, insideTolerance);\n    if (!shape) continue;\n    anchor.shapeId = shape.id;\n    anchor.kind = routeAnchorKindForShape(shape.kind);\n    attached += 1;\n    if ((degree.get(anchor.id) ?? 0) > 1) continue;\n    const linkKind = routeLinkKind(anchor.kind);\n    for (const edge of edges) {\n      if (edge.fromAnchorId === anchor.id || edge.toAnchorId === anchor.id) {\n        edge.kind = linkKind;\n      }\n    }\n  }\n\n  return attached;\n}\n","/**\n * Wheel / trackpad zoom curve for every map surface.\n *\n * PORTAL default MapViewer uses drei → three-stdlib OrbitControls, whose\n * `getZoomScale()` is `Math.pow(0.95, zoomSpeed)` **per wheel event** (not\n * scaled by `deltaY`). Edit Map / Wayfinding must use the same step or they\n * feel slower than the assign map.\n *\n * Scroll up zooms in; the caller keeps the pointer over the same map point\n * (`panAfterZoom` on the SVG canvas, `zoomToCursor` on OrbitControls).\n */\n\n/** three-stdlib OrbitControls `Math.pow(0.95, zoomSpeed)` base. */\nexport const WHEEL_ZOOM_BASE = 0.95;\n/** drei / three-stdlib default `zoomSpeed`. */\nexport const WHEEL_ZOOM_SPEED = 1;\n\n/**\n * OrbitControls dolly scale for one wheel event: `0.95 ** zoomSpeed`.\n * Sign of `deltaY` is ignored here; `nextZoomFromWheel` applies in vs out.\n */\nexport function wheelDollyScale(zoomSpeed = WHEEL_ZOOM_SPEED): number {\n  return Math.pow(WHEEL_ZOOM_BASE, zoomSpeed);\n}\n\n/**\n * Next SVG / orthographic zoom from a wheel event.\n * `deltaY < 0` zooms in. Pan separately so the cursor stays on the same point.\n */\nexport function nextZoomFromWheel(\n  currentZoom: number,\n  deltaY: number,\n  options?: {\n    zoomSpeed?: number;\n    min?: number;\n    max?: number;\n  },\n): number {\n  if (deltaY === 0) return currentZoom;\n  const scale = wheelDollyScale(options?.zoomSpeed ?? WHEEL_ZOOM_SPEED);\n  const next = deltaY < 0 ? currentZoom / scale : currentZoom * scale;\n  const min = options?.min ?? Number.NEGATIVE_INFINITY;\n  const max = options?.max ?? Number.POSITIVE_INFINITY;\n  return Math.min(max, Math.max(min, next));\n}\n"],"names":["outdoorDecorationFromSvg","svgText","suppressIds","theme","includeBackground","parsed","parseSvgString","out","el","isRoutePathLabel","isRouteFolderLabel","isInteractiveGroupLabel","isStoreFolderLabel","layer","resolveLayerStyle","fill","isAmenityLayerId","amenityHouseFill","_a","stroke","_b","strokeWidth","_c","_d","sortByOutdoorSvgPaintOrder","item","weldAnchors","anchors","edges","candidateIds","tolerance","DEFAULT_WELD_TOLERANCE","candidates","a","surviving","min","removed","distance","removedSet","rewired","edge","changed","findWeldCandidates","groups","used","i","group","j","collapseDuplicateRouteGraph","nextAnchors","nextEdges","result","id","alive","anchor","seen","uniqueEdges","lo","hi","key","autoConnectUnitAnchor","unitAnchor","walkablePolylines","existingJunctions","weldTolerance","best","line","hit","nearestPointOnPolyline","existing","unitAnchorFromShape","shapeId","levelId","polygons","tempId","flat","sx","sy","p","c","point","pointInPolygons","buildAutoSkeleton","walkablePolygons","voidPolygons","cellSize","minX","minY","maxX","maxY","poly","cols","rows","free","row","col","x","y","pt","byKey","cell","neighbors","nc","nr","nk","edgeKey","importRoutePaths","pathDs","mapId","startId","nextId","findOrCreate","d","polys","pathToPolygons","b","e","collapsed","routeAnchorKindForShape","kind","routeLinkKind","pointOnPolygons","closed","shapeUnderImportedAnchor","shapes","insideTolerance","near","shape","INTERACTIVE_SHAPE_KINDS","attachImportedRouteAnchors","degree","attached","linkKind","WHEEL_ZOOM_BASE","WHEEL_ZOOM_SPEED","wheelDollyScale","zoomSpeed","nextZoomFromWheel","currentZoom","deltaY","options","scale","next","max"],"mappings":";AA8BO,SAASA,EACdC,GACAC,GACAC,GACAC,IAAoB,IACK;;AACzB,QAAMC,IAASC,EAAeL,CAAO,GAC/BM,IAA+B,CAAA;AACrC,aAAWC,KAAMH,EAAO,UAAU;AAQhC,QAPI,CAACG,EAAG,KACJA,EAAG,eACHA,EAAG,gBAAgB,CAACJ,KACpBF,KAAA,QAAAA,EAAa,IAAIM,EAAG,OACpB,iCAAiC,KAAKA,EAAG,EAAE,KAC3CA,EAAG,GAAG,YAAA,EAAc,WAAW,YAAY,KAC3CC,EAAiBD,EAAG,EAAE,KAAKE,EAAmBF,EAAG,EAAE,KACnDG,EAAwBH,EAAG,EAAE,KAAKI,EAAmBJ,EAAG,EAAE,EAAG;AAEjE,UAAMK,IAAQC,EAAkBN,EAAG,IAAIL,CAAK,GACtCY,KACJF,KAAA,gBAAAA,EAAO,UACNG,EAAiBR,EAAG,EAAE,IAAIS,EAAiBd,CAAK,KAAIe,IAAAV,EAAG,UAAH,gBAAAU,EAAU,OAC3DC,KAASN,KAAA,gBAAAA,EAAO,aAAUO,IAAAZ,EAAG,UAAH,gBAAAY,EAAU,SACpCC,KAAcR,KAAA,gBAAAA,EAAO,kBAAeS,IAAAd,EAAG,UAAH,gBAAAc,EAAU;AACpD,IAAAf,EAAI,KAAK;AAAA,MACP,IAAIC,EAAG;AAAA,MACP,GAAGA,EAAG;AAAA,MACN,MAAMO,KAAQA,MAAS,SAASA,IAAO;AAAA,MACvC,QAAQI,KAAUA,MAAW,SAASA,IAAS;AAAA,MAC/C,aAAAE;AAAA,MACA,UAASE,IAAAf,EAAG,UAAH,gBAAAe,EAAU;AAAA,IAAA,CACpB;AAAA,EACH;AAEA,SAAOC,EAA2BjB,GAAK,CAACkB,MAASA,EAAK,EAAE;AAC1D;AC3BO,SAASC,EACdC,GACAC,GACAC,GACAC,IAAYC,GACO;AACnB,QAAMC,IAAaL,EAAQ,OAAO,CAACM,MAAMJ,EAAa,SAASI,EAAE,EAAE,CAAC;AACpE,MAAID,EAAW,SAAS,EAAG,QAAO;AAGlC,QAAME,IAAYF,EAAW,OAAO,CAACG,GAAKF,MAAOA,EAAE,KAAKE,EAAI,KAAKF,IAAIE,CAAI,GACnEC,IAAoB,CAAA;AAE1B,aAAWH,KAAKD;AACd,IAAIC,EAAE,OAAOC,EAAU,MACnBG,EAASJ,GAAGC,CAAS,KAAKJ,KAC5BM,EAAQ,KAAKH,EAAE,EAAE;AAIrB,MAAIG,EAAQ,WAAW,EAAG,QAAO;AAEjC,QAAME,IAAa,IAAI,IAAIF,CAAO,GAC5BG,IAAoB,CAAA;AAE1B,aAAWC,KAAQZ,GAAO;AACxB,QAAIa,IAAU;AAUd,QATIH,EAAW,IAAIE,EAAK,YAAY,MAClCA,EAAK,eAAeN,EAAU,IAC9BO,IAAU,KAERH,EAAW,IAAIE,EAAK,UAAU,MAChCA,EAAK,aAAaN,EAAU,IAC5BO,IAAU,KAGRD,EAAK,iBAAiBA,EAAK,YAAY;AACzC,MAAAD,EAAQ,KAAKC,EAAK,EAAE;AACpB;AAAA,IACF;AACA,IAAIC,KAASF,EAAQ,KAAKC,EAAK,EAAE;AAAA,EACnC;AAEA,SAAO;AAAA,IACL,mBAAmBN,EAAU;AAAA,IAC7B,kBAAkBE;AAAA,IAClB,gBAAgBG;AAAA,EAAA;AAEpB;AAKO,SAASG,EACdf,GACAG,IAAYC,GACA;AACZ,QAAMY,IAAqB,CAAA,GACrBC,wBAAW,IAAA;AAEjB,WAASC,IAAI,GAAGA,IAAIlB,EAAQ,QAAQkB,KAAK;AACvC,QAAID,EAAK,IAAIjB,EAAQkB,CAAC,EAAE,EAAE,EAAG;AAC7B,UAAMC,IAAQ,CAACnB,EAAQkB,CAAC,EAAE,EAAE;AAC5B,aAASE,IAAIF,IAAI,GAAGE,IAAIpB,EAAQ,QAAQoB;AACtC,MAAIH,EAAK,IAAIjB,EAAQoB,CAAC,EAAE,EAAE,KAExBpB,EAAQkB,CAAC,EAAE,YAAYlB,EAAQoB,CAAC,EAAE,WAClCV,EAASV,EAAQkB,CAAC,GAAGlB,EAAQoB,CAAC,CAAC,KAAKjB,MAEpCgB,EAAM,KAAKnB,EAAQoB,CAAC,EAAE,EAAE,GACxBH,EAAK,IAAIjB,EAAQoB,CAAC,EAAE,EAAE;AAG1B,IAAID,EAAM,SAAS,MACjBF,EAAK,IAAIjB,EAAQkB,CAAC,EAAE,EAAE,GACtBF,EAAO,KAAKG,CAAK;AAAA,EAErB;AACA,SAAOH;AACT;AAOO,SAASK,EAIdrB,GACAC,GACAE,IAAYC,GACkB;AAC9B,QAAMkB,IAActB,EAAQ,MAAA,GACtBuB,IAAYtB,EAAM,IAAI,CAACY,OAAU,EAAE,GAAGA,IAAO,GAC7CJ,wBAAc,IAAA;AACpB,aAAWU,KAASJ,EAAmBO,GAAanB,CAAS,GAAG;AAC9D,UAAMqB,IAASzB,EAAYuB,GAAaC,GAAWJ,GAAOhB,CAAS;AACnE,QAAKqB;AACL,iBAAWC,KAAMD,EAAO,iBAAkB,CAAAf,EAAQ,IAAIgB,CAAE;AAAA,EAC1D;AACA,QAAMC,IAAQJ,EAAY,OAAO,CAACK,MAAW,CAAClB,EAAQ,IAAIkB,EAAO,EAAE,CAAC,GAC9DC,wBAAW,IAAA,GACXC,IAAmB,CAAA;AACzB,aAAWhB,KAAQU,GAAW;AAE5B,QADId,EAAQ,IAAII,EAAK,YAAY,KAAKJ,EAAQ,IAAII,EAAK,UAAU,KAC7DA,EAAK,iBAAiBA,EAAK,WAAY;AAC3C,UAAMiB,IAAK,KAAK,IAAIjB,EAAK,cAAcA,EAAK,UAAU,GAChDkB,IAAK,KAAK,IAAIlB,EAAK,cAAcA,EAAK,UAAU,GAChDmB,IAAM,GAAGF,CAAE,IAAIC,CAAE;AACvB,IAAIH,EAAK,IAAII,CAAG,MAChBJ,EAAK,IAAII,CAAG,GACZH,EAAY,KAAKhB,CAAI;AAAA,EACvB;AACA,SAAO,EAAE,SAASa,GAAO,OAAOG,EAAA;AAClC;AAKO,SAASI,EACdC,GACAC,GACAC,GACAC,IAAgBjC,GACU;AAC1B,MAAIkC,IAAiD;AAErD,aAAWC,KAAQJ,GAAmB;AACpC,UAAMK,IAAMC,EAAuBP,GAAYK,CAAI;AACnD,IAAIC,MAAQ,CAACF,KAAQE,EAAI,WAAWF,EAAK,cACvCA,IAAO,EAAE,OAAOE,EAAI,OAAO,UAAUA,EAAI,SAAA;AAAA,EAE7C;AAEA,MAAI,CAACF,EAAM,QAAO;AAGlB,QAAMI,IAAWN,EAAkB;AAAA,IACjC,CAAChB,MACCA,EAAE,YAAYc,EAAW,WACzBxB,EAASU,GAAGkB,EAAM,KAAK,KAAKD;AAAA,EAAA;AAGhC,SAAO;AAAA,IACL,cAAcH,EAAW;AAAA,IACzB,gBAAgBQ,IACZ,EAAE,GAAGA,EAAS,GAAG,GAAGA,EAAS,GAAG,YAAYA,EAAS,OACrD,EAAE,GAAGJ,EAAK,MAAM,GAAG,GAAGA,EAAK,MAAM,EAAA;AAAA,IACrC,MAAM;AAAA,MACJ,cAAcJ,EAAW;AAAA,MACzB,YAAYQ,KAAA,gBAAAA,EAAU;AAAA,IAAA;AAAA,EACxB;AAEJ;AAKO,SAASC,EACdC,GACAC,GACAC,GACAC,GACiB;AACjB,MAAID,EAAS,WAAW,EAAG,QAAO;AAClC,QAAME,IAAOF,EAAS,KAAA;AACtB,MAAIE,EAAK,WAAW,EAAG,QAAO;AAE9B,MAAIC,IAAK,GACLC,IAAK;AACT,aAAWC,KAAKH;AACd,IAAAC,KAAME,EAAE,GACRD,KAAMC,EAAE;AAEV,QAAMC,IAAI,EAAE,GAAGH,IAAKD,EAAK,QAAQ,GAAGE,IAAKF,EAAK,OAAA,GAGxCK,IAAQC,EAAgBF,GAAGN,CAAQ,IAAIM,IAAIJ,EAAK,CAAC;AAEvD,SAAO;AAAA,IACL,IAAID;AAAA,IACJ,SAAAF;AAAA,IACA,SAAAD;AAAA,IACA,MAAM;AAAA,IACN,GAAGS,EAAM;AAAA,IACT,GAAGA,EAAM;AAAA,IACT,aAAa;AAAA,EAAA;AAEjB;AAOO,SAASE,EACdC,GACAC,GACAC,IAAW,IACS;AACpB,MAAIF,EAAiB,WAAW;AAC9B,WAAO,EAAE,SAAS,IAAI,OAAO,CAAA,EAAC;AAGhC,MAAIG,IAAO,OACPC,IAAO,OACPC,IAAO,QACPC,IAAO;AACX,aAAWC,KAAQP;AACjB,eAAWL,KAAKY;AACd,MAAAJ,IAAO,KAAK,IAAIA,GAAMR,EAAE,CAAC,GACzBS,IAAO,KAAK,IAAIA,GAAMT,EAAE,CAAC,GACzBU,IAAO,KAAK,IAAIA,GAAMV,EAAE,CAAC,GACzBW,IAAO,KAAK,IAAIA,GAAMX,EAAE,CAAC;AAI7B,QAAMa,IAAO,KAAK,IAAI,GAAG,KAAK,MAAMH,IAAOF,KAAQD,CAAQ,CAAC,GACtDO,IAAO,KAAK,IAAI,GAAG,KAAK,MAAMH,IAAOF,KAAQF,CAAQ,CAAC,GACtDQ,IAA+E,CAAA;AAErF,WAASC,IAAM,GAAGA,IAAMF,GAAME;AAC5B,aAASC,IAAM,GAAGA,IAAMJ,GAAMI,KAAO;AACnC,YAAMC,IAAIV,KAAQS,IAAM,OAAOV,GACzBY,IAAIV,KAAQO,IAAM,OAAOT,GACzBa,IAAK,EAAE,GAAAF,GAAG,GAAAC,EAAA;AAChB,MAAKhB,EAAgBiB,GAAIf,CAAgB,MACrCC,EAAa,SAAS,KAAKH,EAAgBiB,GAAId,CAAY,KAC/DS,EAAK,KAAK,EAAE,KAAK,GAAGE,CAAG,IAAID,CAAG,IAAI,GAAAE,GAAG,GAAAC,GAAG,KAAAF,GAAK,KAAAD,EAAA,CAAK;AAAA,IACpD;AAGF,QAAMK,IAAQ,IAAI,IAAIN,EAAK,IAAI,CAACd,MAAM,CAACA,EAAE,KAAKA,CAAC,CAAC,CAAC,GAC3CpD,IAAUkE,EAAK,IAAI,CAACd,OAAO;AAAA,IAC/B,QAAQA,EAAE;AAAA,IACV,GAAGA,EAAE;AAAA,IACL,GAAGA,EAAE;AAAA,IACL,MAAM;AAAA,EAAA,EACN,GAEInD,IAAyD,CAAA,GACzD2B,wBAAW,IAAA;AAEjB,aAAW6C,KAAQP,GAAM;AACvB,UAAMQ,IAAY;AAAA,MAChB,CAACD,EAAK,MAAM,GAAGA,EAAK,GAAG;AAAA,MACvB,CAACA,EAAK,KAAKA,EAAK,MAAM,CAAC;AAAA,IAAA;AAEzB,eAAW,CAACE,GAAIC,CAAE,KAAKF,GAAW;AAChC,YAAMG,IAAK,GAAGF,CAAE,IAAIC,CAAE;AACtB,UAAI,CAACJ,EAAM,IAAIK,CAAE,EAAG;AACpB,YAAMC,IAAUL,EAAK,MAAMI,IAAK,GAAGJ,EAAK,GAAG,IAAII,CAAE,KAAK,GAAGA,CAAE,IAAIJ,EAAK,GAAG;AACvE,MAAI7C,EAAK,IAAIkD,CAAO,MACpBlD,EAAK,IAAIkD,CAAO,GAChB7E,EAAM,KAAK,EAAE,YAAYwE,EAAK,KAAK,UAAUI,GAAI;AAAA,IACnD;AAAA,EACF;AAEA,SAAO,EAAE,SAAA7E,GAAS,OAAAC,EAAA;AACpB;AAUO,SAAS8E,EACdC,GACAnC,GACAoC,GACAC,GACA7C,IAAgBjC,GAC+C;AAC/D,QAAMJ,IAAsB,CAAA,GACtBC,IAAuB,CAAA;AAC7B,MAAIkF,IAASD;AAEb,QAAME,IAAe,CAACf,GAAWC,MAAsB;AACrD,UAAM5B,IAAW1C,EAAQ;AAAA,MACvB,CAACM,MAAMI,EAASJ,GAAG,EAAE,GAAA+D,GAAG,GAAAC,EAAA,CAAG,KAAKjC;AAAA,IAAA;AAElC,QAAIK,UAAiBA,EAAS;AAC9B,UAAMjB,IAAK0D;AACX,WAAAnF,EAAQ,KAAK;AAAA,MACX,IAAAyB;AAAA,MACA,SAAAoB;AAAA,MACA,SAAS;AAAA,MACT,MAAM;AAAA,MACN,GAAAwB;AAAA,MACA,GAAAC;AAAA,MACA,aAAa;AAAA,IAAA,CACd,GACM7C;AAAA,EACT;AAEA,aAAW4D,KAAKL,GAAQ;AACtB,UAAMM,IAAQC,EAAeF,CAAC;AAC9B,eAAWtB,KAAQuB;AACjB,eAASpE,IAAI,GAAGA,IAAI6C,EAAK,SAAS,GAAG7C,KAAK;AACxC,cAAMZ,IAAI8E,EAAarB,EAAK7C,CAAC,EAAE,GAAG6C,EAAK7C,CAAC,EAAE,CAAC,GACrCsE,IAAIJ,EAAarB,EAAK7C,IAAI,CAAC,EAAE,GAAG6C,EAAK7C,IAAI,CAAC,EAAE,CAAC;AAQnD,QAPIZ,MAAMkF,KAEEvF,EAAM;AAAA,UAChB,CAACwF,MACEA,EAAE,iBAAiBnF,KAAKmF,EAAE,eAAeD,KACzCC,EAAE,iBAAiBD,KAAKC,EAAE,eAAenF;AAAA,QAAA,KAG9CL,EAAM,KAAK;AAAA,UACT,IAAIkF;AAAA,UACJ,OAAAF;AAAA,UACA,cAAc3E;AAAA,UACd,YAAYkF;AAAA,UACZ,QAAQ;AAAA,UACR,UAAU;AAAA,UACV,YAAY;AAAA,UACZ,MAAM;AAAA,QAAA,CACP;AAAA,MACH;AAAA,EAEJ;AAEA,QAAME,IAAYrE,EAA4BrB,GAASC,GAAOoC,CAAa;AAC3E,SAAO,EAAE,SAASqD,EAAU,SAAS,OAAOA,EAAU,OAAO,QAAAP,EAAA;AAC/D;AAEO,SAASQ,EAAwBC,GAA6B;AACnE,SAAIA,MAAS,aAAmB,aAC5BA,MAAS,cAAoB,cAC1B;AACT;AAEA,SAASC,EAAcD,GAAuC;AAC5D,SAAOA,MAAS,aAAa,kBAAkB;AACjD;AAGA,SAASE,EACPzC,GACAP,GACA3C,GAC0B;AAC1B,MAAImD,EAAgBD,GAAOP,CAAQ,EAAG,QAAO;AAC7C,aAAWiB,KAAQjB,GAAU;AAC3B,QAAIiB,EAAK,SAAS,EAAG;AACrB,UAAMgC,IAAS,CAAC,GAAGhC,GAAMA,EAAK,CAAC,CAAC,GAC1BvB,IAAMC,EAAuBY,GAAO0C,CAAM;AAChD,QAAIvD,KAAOA,EAAI,YAAYrC,EAAW,QAAO;AAAA,EAC/C;AACA,SAAO;AACT;AAQA,SAAS6F,EACP3C,GACA4C,GACAC,GAC8B;AAC9B,MAAIC,IAAqC;AACzC,aAAWC,KAASH,GAAQ;AAC1B,QAAI,CAACI,EAAwB,SAASD,EAAM,IAAI,EAAG;AACnD,UAAMd,IAAQc,EAAM,SAAS,YAAY,CAAA;AACzC,QAAId,EAAM,WAAW,EAAG;AACxB,UAAM9C,IAAMsD,EAAgBzC,GAAOiC,GAAOY,CAAe;AACzD,QAAI1D,MAAQ,SAAU,QAAO4D;AAC7B,IAAI5D,MAAQ,UAAU2D,KAAQ,SAAMA,IAAOC;AAAA,EAC7C;AACA,SAAOD;AACT;AASO,SAASG,EACdtG,GACAC,GACAgG,GACAC,IAAkB9F,IAAyB,GACnC;AACR,QAAMmG,wBAAa,IAAA;AACnB,aAAW1F,KAAQZ;AACjB,IAAAsG,EAAO,IAAI1F,EAAK,eAAe0F,EAAO,IAAI1F,EAAK,YAAY,KAAK,KAAK,CAAC,GACtE0F,EAAO,IAAI1F,EAAK,aAAa0F,EAAO,IAAI1F,EAAK,UAAU,KAAK,KAAK,CAAC;AAGpE,MAAI2F,IAAW;AACf,aAAW7E,KAAU3B,GAAS;AAC5B,QAAI2B,EAAO,WAAW,KAAM;AAC5B,UAAMyE,IAAQJ,EAAyBrE,GAAQsE,GAAQC,CAAe;AAKtE,QAJI,CAACE,MACLzE,EAAO,UAAUyE,EAAM,IACvBzE,EAAO,OAAOgE,EAAwBS,EAAM,IAAI,GAChDI,KAAY,IACPD,EAAO,IAAI5E,EAAO,EAAE,KAAK,KAAK,GAAG;AACtC,UAAM8E,IAAWZ,EAAclE,EAAO,IAAI;AAC1C,eAAWd,KAAQZ;AACjB,OAAIY,EAAK,iBAAiBc,EAAO,MAAMd,EAAK,eAAec,EAAO,QAChEd,EAAK,OAAO4F;AAAA,EAGlB;AAEA,SAAOD;AACT;AC3bO,MAAME,IAAkB,MAElBC,IAAmB;AAMzB,SAASC,EAAgBC,IAAYF,GAA0B;AACpE,SAAO,KAAK,IAAID,GAAiBG,CAAS;AAC5C;AAMO,SAASC,EACdC,GACAC,GACAC,GAKQ;AACR,MAAID,MAAW,EAAG,QAAOD;AACzB,QAAMG,IAAQN,GAAgBK,KAAA,gBAAAA,EAAS,cAAaN,CAAgB,GAC9DQ,IAAOH,IAAS,IAAID,IAAcG,IAAQH,IAAcG,GACxD1G,KAAMyG,KAAA,gBAAAA,EAAS,QAAO,OAAO,mBAC7BG,KAAMH,KAAA,gBAAAA,EAAS,QAAO,OAAO;AACnC,SAAO,KAAK,IAAIG,GAAK,KAAK,IAAI5G,GAAK2G,CAAI,CAAC;AAC1C;"}

package/dist/core/import/index.d.ts

@@ -7,6 +7,11 @@ export declare function isRoutePathLabel(label: string): boolean;
  * Child layer names are ignored — same idea as the INTERACTIVE group.
  */
 export declare function isRouteFolderLabel(label: string): boolean;
+/**
+ * Outdoor artwork drawn only when Settings background is Google Map.
+ * `BACKGROUND`, `BACKGROUND-2`, data-name="BACKGROUND".
+ */
+export declare function isBackgroundGroupLabel(label: string): boolean;
 /**
  * Geometry that becomes a walking-path edge. `<line>` / `<polyline>` always
  * count; an open `<path>` of straight M/L/H/V commands counts as line
@@ -33,6 +38,8 @@ export interface RawSvgElement {
     interactive?: boolean;
     /** Resolved fill/stroke after group inheritance + CSS class inlining. */
     style?: SvgPresentationStyle;
+    /** Inside an outdoor `BACKGROUND` group. Shown only with a Google Map background. */
+    inBackground?: boolean;
 }
 export interface ParsedSvg {
     viewbox: ViewBox | null;

package/dist/core/import/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/import/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,IAAI,EAEJ,UAAU,EAEV,YAAY,EACZ,aAAa,EACb,SAAS,EACT,UAAU,EACV,OAAO,EACR,MAAM,UAAU,CAAC;AASlB,OAAO,EAIL,KAAK,oBAAoB,EAC1B,MAAM,YAAY,CAAC;AA6DpB,yEAAyE;AACzE,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAGvD;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAEzD;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAOnE;AAED;;;GAGG;AACH,eAAO,MAAM,sBAAsB,EAAE,SAAS,SAAS,EAItD,CAAC;AAEF,mFAAmF;AACnF,eAAO,MAAM,sBAAsB,IAAI,CAAC;AAExC,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,GAAG,EAAE,MAAM,CAAC;IACZ,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,uFAAuF;IACvF,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,yEAAyE;IACzE,KAAK,CAAC,EAAE,oBAAoB,CAAC;CAC9B;AAsBD,MAAM,WAAW,SAAS;IACxB,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC;IACxB,QAAQ,EAAE,aAAa,EAAE,CAAC;IAC1B,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,gEAAgE;IAChE,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,wBAAgB,UAAU,CACxB,EAAE,EAAE,MAAM,EACV,IAAI,GAAE,OAAO,GAAG,MAAgB,GAC/B;IAAE,IAAI,EAAE,SAAS,GAAG,IAAI,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CAiB9C;AAED,kFAAkF;AAClF,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAMzD;AAED,wFAAwF;AACxF,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAEjE;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAG9D;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAGzD;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAO5D;AAyFD;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,CAqMrD;AAED,MAAM,WAAW,kBAAkB;IACjC,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,SAAS,CAAC;IAChB,QAAQ,EAAE,aAAa,CAAC;IACxB,IAAI,EAAE,IAAI,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,UAAU,CAAC;CACnB;AAsCD,MAAM,WAAW,gBAAgB;IAC/B,6EAA6E;IAC7E,eAAe,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC;CAClC;AAED,wBAAgB,SAAS,CACvB,GAAG,EAAE,MAAM,EACX,IAAI,GAAE,OAAO,GAAG,MAAgB,EAChC,OAAO,GAAE,gBAAqB,GAC7B;IACD,MAAM,EAAE,YAAY,CAAC;IACrB,MAAM,EAAE,kBAAkB,EAAE,CAAC;IAC7B,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC;IACxB,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,cAAc,EAAE,OAAO,CAAC;CACzB,CAuHA;AAED,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,IAAI,EAAE,SAAS,CAAC;IAChB,GAAG,EAAE,MAAM,CAAC;IACZ,kEAAkE;IAClE,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC;IACnB,cAAc,CAAC,EAAE,OAAO,CAAC;CAC1B;AAED;;;GAGG;AACH,wBAAgB,UAAU,CACxB,QAAQ,EAAE,kBAAkB,EAAE,EAC9B,QAAQ,EAAE,gBAAgB,EAAE,EAC5B,OAAO,EAAE,OAAO,GAAG,IAAI,EACvB,OAAO,GAAE;IAAE,cAAc,CAAC,EAAE,MAAM,CAAA;CAAO,GACxC,UAAU,CAmEZ;AAED,OAAO,EACL,eAAe,EACf,qBAAqB,EACrB,sBAAsB,GACvB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,cAAc,EACd,cAAc,EACd,cAAc,EACd,KAAK,QAAQ,GACd,MAAM,gBAAgB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/import/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,IAAI,EAEJ,UAAU,EAEV,YAAY,EACZ,aAAa,EACb,SAAS,EACT,UAAU,EACV,OAAO,EACR,MAAM,UAAU,CAAC;AASlB,OAAO,EAIL,KAAK,oBAAoB,EAC1B,MAAM,YAAY,CAAC;AA6DpB,yEAAyE;AACzE,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAGvD;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAEzD;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAE7D;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAOnE;AAED;;;GAGG;AACH,eAAO,MAAM,sBAAsB,EAAE,SAAS,SAAS,EAItD,CAAC;AAEF,mFAAmF;AACnF,eAAO,MAAM,sBAAsB,IAAI,CAAC;AAExC,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,GAAG,EAAE,MAAM,CAAC;IACZ,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,uFAAuF;IACvF,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,yEAAyE;IACzE,KAAK,CAAC,EAAE,oBAAoB,CAAC;IAC7B,qFAAqF;IACrF,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AAwBD,MAAM,WAAW,SAAS;IACxB,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC;IACxB,QAAQ,EAAE,aAAa,EAAE,CAAC;IAC1B,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,gEAAgE;IAChE,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,wBAAgB,UAAU,CACxB,EAAE,EAAE,MAAM,EACV,IAAI,GAAE,OAAO,GAAG,MAAgB,GAC/B;IAAE,IAAI,EAAE,SAAS,GAAG,IAAI,CAAC;IAAC,OAAO,EAAE,OAAO,CAAA;CAAE,CAiB9C;AAED,kFAAkF;AAClF,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAMzD;AAED,wFAAwF;AACxF,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAEjE;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAG9D;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAGzD;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAO5D;AAyFD;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,CA0MrD;AAED,MAAM,WAAW,kBAAkB;IACjC,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,SAAS,CAAC;IAChB,QAAQ,EAAE,aAAa,CAAC;IACxB,IAAI,EAAE,IAAI,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,UAAU,CAAC;CACnB;AAsCD,MAAM,WAAW,gBAAgB;IAC/B,6EAA6E;IAC7E,eAAe,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC;CAClC;AAED,wBAAgB,SAAS,CACvB,GAAG,EAAE,MAAM,EACX,IAAI,GAAE,OAAO,GAAG,MAAgB,EAChC,OAAO,GAAE,gBAAqB,GAC7B;IACD,MAAM,EAAE,YAAY,CAAC;IACrB,MAAM,EAAE,kBAAkB,EAAE,CAAC;IAC7B,OAAO,EAAE,OAAO,GAAG,IAAI,CAAC;IACxB,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,cAAc,EAAE,OAAO,CAAC;CACzB,CAuHA;AAED,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,IAAI,EAAE,SAAS,CAAC;IAChB,GAAG,EAAE,MAAM,CAAC;IACZ,kEAAkE;IAClE,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC;IACnB,cAAc,CAAC,EAAE,OAAO,CAAC;CAC1B;AAED;;;GAGG;AACH,wBAAgB,UAAU,CACxB,QAAQ,EAAE,kBAAkB,EAAE,EAC9B,QAAQ,EAAE,gBAAgB,EAAE,EAC5B,OAAO,EAAE,OAAO,GAAG,IAAI,EACvB,OAAO,GAAE;IAAE,cAAc,CAAC,EAAE,MAAM,CAAA;CAAO,GACxC,UAAU,CAmEZ;AAED,OAAO,EACL,eAAe,EACf,qBAAqB,EACrB,sBAAsB,GACvB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,cAAc,EACd,cAAc,EACd,cAAc,EACd,KAAK,QAAQ,GACd,MAAM,gBAAgB,CAAC"}