@eyeon/map 2.0.15 → 2.0.19

package/dist/chunks/wheelZoom.js

@@ -1,170 +1,170 @@
-import { bb as M, aM as b, aL as _, aG as L, aO as $, bp as N, d as x, i as O, a$ as S, ad as y, bg as k, be as T } from "./stacking.js";
-function H(e, u, r) {
-  var o, i, a, l;
-  const s = M(e), t = [];
-  for (const n of s.elements) {
-    if (!n.d || n.interactive || u != null && u.has(n.id) || /^parking[-_]?lines?(?:[-_]|$)/i.test(n.id) || n.id.toLowerCase().startsWith("route-path") || b(n.id) || _(n.id) || L(n.id) || $(n.id)) continue;
-    const d = N(n.id, r), m = (d == null ? void 0 : d.fill) ?? ((o = n.style) == null ? void 0 : o.fill), I = (d == null ? void 0 : d.stroke) ?? ((i = n.style) == null ? void 0 : i.stroke), h = (d == null ? void 0 : d.strokeWidth) ?? ((a = n.style) == null ? void 0 : a.strokeWidth);
+import { bB as S, b4 as w, b2 as M, aZ as _, b6 as L, bP as O, aQ as $, B as F, c6 as N, d as y, bn as E, aq as k, bG as x, bE as T, k as W } from "./responsive.js";
+function V(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 = O(n.id, r), I = (f == null ? void 0 : f.fill) ?? ($(n.id) ? F(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: m && m !== "none" ? m : void 0,
-      stroke: I && I !== "none" ? I : void 0,
-      strokeWidth: h,
-      opacity: (l = n.style) == null ? void 0 : l.opacity
+      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
     });
   }
-  return t;
+  return N(t, (n) => n.id);
 }
-function W(e, u, r, s = x) {
+function P(e, d, r, c = y) {
   const t = e.filter((n) => r.includes(n.id));
   if (t.length < 2) return null;
-  const o = t.reduce((n, d) => d.id < n.id ? d : n), i = [];
+  const i = t.reduce((n, f) => f.id < n.id ? f : n), o = [];
   for (const n of t)
-    n.id !== o.id && y(n, o) <= s && i.push(n.id);
-  if (i.length === 0) return null;
-  const a = new Set(i), l = [];
-  for (const n of u) {
-    let d = !1;
-    if (a.has(n.fromAnchorId) && (n.fromAnchorId = o.id, d = !0), a.has(n.toAnchorId) && (n.toAnchorId = o.id, d = !0), n.fromAnchorId === n.toAnchorId) {
-      l.push(n.id);
+    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);
       continue;
     }
-    d && l.push(n.id);
+    f && a.push(n.id);
   }
   return {
-    survivingAnchorId: o.id,
-    removedAnchorIds: i,
-    rewiredEdgeIds: l
+    survivingAnchorId: i.id,
+    removedAnchorIds: o,
+    rewiredEdgeIds: a
   };
 }
-function F(e, u = x) {
-  const r = [], s = /* @__PURE__ */ new Set();
+function D(e, d = y) {
+  const r = [], c = /* @__PURE__ */ new Set();
   for (let t = 0; t < e.length; t++) {
-    if (s.has(e[t].id)) continue;
-    const o = [e[t].id];
-    for (let i = t + 1; i < e.length; i++)
-      s.has(e[i].id) || e[t].levelId === e[i].levelId && y(e[t], e[i]) <= u && (o.push(e[i].id), s.add(e[i].id));
-    o.length > 1 && (s.add(e[t].id), r.push(o));
+    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));
   }
   return r;
 }
-function D(e, u, r = x) {
-  const s = e.slice(), t = u.map((n) => ({ ...n })), o = /* @__PURE__ */ new Set();
-  for (const n of F(s, r)) {
-    const d = W(s, t, n, r);
-    if (d)
-      for (const m of d.removedAnchorIds) o.add(m);
+function R(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);
   }
-  const i = s.filter((n) => !o.has(n.id)), a = /* @__PURE__ */ new Set(), l = [];
+  const o = c.filter((n) => !i.has(n.id)), u = /* @__PURE__ */ new Set(), a = [];
   for (const n of t) {
-    if (o.has(n.fromAnchorId) || o.has(n.toAnchorId) || n.fromAnchorId === n.toAnchorId) continue;
-    const d = Math.min(n.fromAnchorId, n.toAnchorId), m = Math.max(n.fromAnchorId, n.toAnchorId), I = `${d}|${m}`;
-    a.has(I) || (a.add(I), l.push(n));
+    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));
   }
-  return { anchors: i, edges: l };
+  return { anchors: o, edges: a };
 }
-function V(e, u, r, s = x) {
+function Y(e, d, r, c = y) {
   let t = null;
-  for (const i of u) {
-    const a = S(e, i);
-    a && (!t || a.distance < t.distance) && (t = { point: a.point, distance: a.distance });
+  for (const o of d) {
+    const u = E(e, o);
+    u && (!t || u.distance < t.distance) && (t = { point: u.point, distance: u.distance });
   }
   if (!t) return null;
-  const o = r.find(
-    (i) => i.levelId === e.levelId && y(i, t.point) <= s
+  const i = r.find(
+    (o) => o.levelId === e.levelId && k(o, t.point) <= c
   );
   return {
     unitAnchorId: e.id,
-    junctionAnchor: o ? { x: o.x, y: o.y, existingId: o.id } : { x: t.point.x, y: t.point.y },
+    junctionAnchor: i ? { x: i.x, y: i.y, existingId: i.id } : { x: t.point.x, y: t.point.y },
     edge: {
       fromAnchorId: e.id,
-      toAnchorId: o == null ? void 0 : o.id
+      toAnchorId: i == null ? void 0 : i.id
     }
   };
 }
-function Y(e, u, r, s) {
+function q(e, d, r, c) {
   if (r.length === 0) return null;
   const t = r.flat();
   if (t.length === 0) return null;
-  let o = 0, i = 0;
+  let i = 0, o = 0;
   for (const n of t)
-    o += n.x, i += n.y;
-  const a = { x: o / t.length, y: i / t.length }, l = k(a, r) ? a : t[0];
+    i += n.x, o += n.y;
+  const u = { x: i / t.length, y: o / t.length }, a = x(u, r) ? u : t[0];
   return {
-    id: s,
-    levelId: u,
+    id: c,
+    levelId: d,
     shapeId: e,
     kind: "unit",
-    x: l.x,
-    y: l.y,
+    x: a.x,
+    y: a.y,
     connectorId: null
   };
 }
-function U(e, u, r = 20) {
+function X(e, d, r = 20) {
   if (e.length === 0)
     return { anchors: [], edges: [] };
-  let s = 1 / 0, t = 1 / 0, o = -1 / 0, i = -1 / 0;
-  for (const f of e)
-    for (const c of f)
-      s = Math.min(s, c.x), t = Math.min(t, c.y), o = Math.max(o, c.x), i = Math.max(i, c.y);
-  const a = Math.max(1, Math.ceil((o - s) / r)), l = Math.max(1, Math.ceil((i - t) / r)), n = [];
-  for (let f = 0; f < l; f++)
-    for (let c = 0; c < a; c++) {
-      const g = s + (c + 0.5) * r, p = t + (f + 0.5) * r, A = { x: g, y: p };
-      k(A, e) && (u.length > 0 && k(A, u) || n.push({ key: `${c},${f}`, x: g, y: p, col: c, row: f }));
+  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 }));
     }
-  const d = new Map(n.map((f) => [f.key, f])), m = n.map((f) => ({
-    tempId: f.key,
-    x: f.x,
-    y: f.y,
+  const f = new Map(n.map((s) => [s.key, s])), I = n.map((s) => ({
+    tempId: s.key,
+    x: s.x,
+    y: s.y,
     kind: "junction"
-  })), I = [], h = /* @__PURE__ */ new Set();
-  for (const f of n) {
-    const c = [
-      [f.col + 1, f.row],
-      [f.col, f.row + 1]
+  })), l = [], m = /* @__PURE__ */ new Set();
+  for (const s of n) {
+    const h = [
+      [s.col + 1, s.row],
+      [s.col, s.row + 1]
     ];
-    for (const [g, p] of c) {
-      const A = `${g},${p}`;
-      if (!d.has(A)) continue;
-      const v = f.key < A ? `${f.key}|${A}` : `${A}|${f.key}`;
-      h.has(v) || (h.add(v), I.push({ fromTempId: f.key, toTempId: A }));
+    for (const [p, g] of h) {
+      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 }));
     }
   }
-  return { anchors: m, edges: I };
+  return { anchors: I, edges: l };
 }
-function X(e, u, r, s, t = x) {
-  const o = [], i = [];
-  let a = s;
-  const l = (d, m) => {
-    const I = o.find(
-      (f) => y(f, { x: d, y: m }) <= t
+function Z(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
     );
-    if (I) return I.id;
-    const h = a++;
-    return o.push({
-      id: h,
-      levelId: u,
+    if (l) return l.id;
+    const m = u++;
+    return i.push({
+      id: m,
+      levelId: d,
       shapeId: null,
       kind: "junction",
-      x: d,
-      y: m,
+      x: f,
+      y: I,
       connectorId: null
-    }), h;
+    }), m;
   };
-  for (const d of e) {
-    const m = T(d);
-    for (const I of m)
-      for (let h = 0; h < I.length - 1; h++) {
-        const f = l(I[h].x, I[h].y), c = l(I[h + 1].x, I[h + 1].y);
-        f === c || i.some(
-          (p) => p.fromAnchorId === f && p.toAnchorId === c || p.fromAnchorId === c && p.toAnchorId === f
-        ) || i.push({
-          id: a++,
+  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({
+          id: u++,
           mapId: r,
-          fromAnchorId: f,
-          toAnchorId: c,
+          fromAnchorId: s,
+          toAnchorId: h,
           weight: null,
           directed: !1,
           accessible: !0,
@@ -172,88 +172,74 @@ function X(e, u, r, s, t = x) {
         });
       }
   }
-  const n = D(o, i, t);
-  return { anchors: n.anchors, edges: n.edges, nextId: a };
+  const n = R(i, o, t);
+  return { anchors: n.anchors, edges: n.edges, nextId: u };
 }
-function P(e) {
+function C(e) {
   return e === "entrance" ? "entrance" : e === "connector" ? "connector" : "unit";
 }
-function R(e) {
+function K(e) {
   return e === "entrance" ? "entrance_link" : "unit_link";
 }
-function C(e, u, r) {
-  if (k(e, u)) return "inside";
-  for (const s of u) {
-    if (s.length < 2) continue;
-    const t = [...s, s[0]], o = S(e, t);
-    if (o && o.distance <= r) return "near";
+function B(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 = E(e, t);
+    if (i && i.distance <= r) return "near";
   }
   return null;
 }
-function E(e, u, r) {
-  if (e.length === 0) return null;
-  const s = e.filter((o) => (u.get(o.id) ?? 0) <= 1);
-  return [...s.length > 0 ? s : e].sort((o, i) => y(o, r) - y(i, r))[0] ?? null;
+function G(e, d, r) {
+  let c = null;
+  for (const t of d) {
+    if (!W.includes(t.kind)) continue;
+    const i = t.geometry.polygons ?? [];
+    if (i.length === 0) continue;
+    const o = B(e, i, r);
+    if (o === "inside") return t;
+    o === "near" && c == null && (c = t);
+  }
+  return c;
 }
-function q(e, u, r, s = x * 3) {
+function Q(e, d, r, c = y * 3) {
   const t = /* @__PURE__ */ new Map();
-  for (const l of u)
-    t.set(l.fromAnchorId, (t.get(l.fromAnchorId) ?? 0) + 1), t.set(l.toAnchorId, (t.get(l.toAnchorId) ?? 0) + 1);
-  const o = e.filter((l) => l.shapeId == null), i = /* @__PURE__ */ new Set();
-  let a = 0;
-  for (const l of r) {
-    if (!O.includes(l.kind)) continue;
-    const n = l.geometry.polygons ?? [];
-    if (n.length === 0) continue;
-    const d = o.filter((c) => !i.has(c.id)).map((c) => ({
-      anchor: c,
-      hit: C(c, n, s)
-    })).filter(
-      (c) => c.hit != null
-    );
-    if (d.length === 0) continue;
-    const m = n.flat(), I = {
-      x: m.reduce((c, g) => c + g.x, 0) / m.length,
-      y: m.reduce((c, g) => c + g.y, 0) / m.length
-    }, h = E(
-      d.filter((c) => c.hit === "inside").map((c) => c.anchor),
-      t,
-      I
-    ) ?? E(
-      d.filter((c) => c.hit === "near").map((c) => c.anchor),
-      t,
-      I
-    );
-    if (!h || (h.shapeId = l.id, h.kind = P(l.kind), i.add(h.id), a += 1, (t.get(h.id) ?? 0) > 1)) continue;
-    const f = R(h.kind);
-    for (const c of u)
-      (c.fromAnchorId === h.id || c.toAnchorId === h.id) && (c.kind = f);
+  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);
+  let i = 0;
+  for (const o of e) {
+    if (o.shapeId != null) continue;
+    const u = G(o, r, c);
+    if (!u || (o.shapeId = u.id, o.kind = C(u.kind), i += 1, (t.get(o.id) ?? 0) > 1)) continue;
+    const a = K(o.kind);
+    for (const n of d)
+      (n.fromAnchorId === o.id || n.toAnchorId === o.id) && (n.kind = a);
   }
-  return a;
+  return i;
 }
-const K = 0.95, w = 1;
-function G(e = w) {
-  return Math.pow(K, e);
+const H = 0.95, b = 1;
+function j(e = b) {
+  return Math.pow(H, e);
 }
-function B(e, u, r) {
-  if (u === 0) return e;
-  const s = G((r == null ? void 0 : r.zoomSpeed) ?? w), t = u < 0 ? e / s : e * s, o = (r == null ? void 0 : r.min) ?? Number.NEGATIVE_INFINITY, i = (r == null ? void 0 : r.max) ?? Number.POSITIVE_INFINITY;
-  return Math.min(i, Math.max(o, t));
+function J(e, d, r) {
+  if (d === 0) return e;
+  const c = j((r == null ? void 0 : r.zoomSpeed) ?? b), 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));
 }
 export {
-  K as W,
-  w as a,
-  q as b,
-  V as c,
-  U as d,
-  D as e,
-  F as f,
-  G as g,
-  X as i,
-  B as n,
-  H as o,
-  P as r,
-  Y as u,
-  W as w
+  H as W,
+  b as a,
+  Q as b,
+  Y as c,
+  X as d,
+  R as e,
+  D as f,
+  j as g,
+  Z as i,
+  J as n,
+  V as o,
+  C as r,
+  q as u,
+  P as w
 };
 //# sourceMappingURL=wheelZoom.js.map

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 { resolveLayerStyle, type StaticLayerTheme } 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 = layer?.fill ?? 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  return out;\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 route-path 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\nfunction pickImportedShapeAnchor(\n  candidates: CmAnchor[],\n  degree: Map<number, number>,\n  center: Vec2,\n): CmAnchor | null {\n  if (candidates.length === 0) return null;\n  const leaves = candidates.filter((anchor) => (degree.get(anchor.id) ?? 0) <= 1);\n  const pool = leaves.length > 0 ? leaves : candidates;\n  return [...pool].sort((a, b) => distance(a, center) - distance(b, center))[0] ?? null;\n}\n\nexport interface AttachableImportShape {\n  id: number;\n  kind: ShapeKind;\n  geometry: Pick<ShapeGeometry, 'polygons'>;\n}\n\n/**\n * Same rule as v1 `assign_route_nodes_to_stores`: a route vertex that sits\n * inside (or on) an interactive shape is that store / amenity / entrance's\n * destination. Prefer a dedicated spur leaf; otherwise take the closest\n * vertex. Corridor through-points keep `walk` edges so the path stays joined.\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  const free = anchors.filter((anchor) => anchor.shapeId == null);\n  const used = new Set<number>();\n  let attached = 0;\n\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 hits = free\n      .filter((anchor) => !used.has(anchor.id))\n      .map((anchor) => ({\n        anchor,\n        hit: pointOnPolygons(anchor, polys, insideTolerance),\n      }))\n      .filter((row): row is { anchor: CmAnchor; hit: 'inside' | 'near' } =>\n        row.hit != null,\n      );\n    if (hits.length === 0) continue;\n    const verts = polys.flat();\n    const center = {\n      x: verts.reduce((s, p) => s + p.x, 0) / verts.length,\n      y: verts.reduce((s, p) => s + p.y, 0) / verts.length,\n    };\n    const pick =\n      pickImportedShapeAnchor(\n        hits.filter((row) => row.hit === 'inside').map((row) => row.anchor),\n        degree,\n        center,\n      ) ??\n      pickImportedShapeAnchor(\n        hits.filter((row) => row.hit === 'near').map((row) => row.anchor),\n        degree,\n        center,\n      );\n    if (!pick) continue;\n    pick.shapeId = shape.id;\n    pick.kind = routeAnchorKindForShape(shape.kind);\n    used.add(pick.id);\n    attached += 1;\n    if ((degree.get(pick.id) ?? 0) > 1) continue;\n    const linkKind = routeLinkKind(pick.kind);\n    for (const edge of edges) {\n      if (edge.fromAnchorId === pick.id || edge.toAnchorId === pick.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","_a","stroke","_b","strokeWidth","_c","_d","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","polys","pathToPolygons","b","e","collapsed","routeAnchorKindForShape","kind","routeLinkKind","pointOnPolygons","closed","pickImportedShapeAnchor","degree","center","leaves","attachImportedRouteAnchors","shapes","insideTolerance","attached","shape","INTERACTIVE_SHAPE_KINDS","hits","verts","s","pick","linkKind","WHEEL_ZOOM_BASE","WHEEL_ZOOM_SPEED","wheelDollyScale","zoomSpeed","nextZoomFromWheel","currentZoom","deltaY","options","scale","next","max"],"mappings":";AAwBO,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,KAAOF,KAAA,gBAAAA,EAAO,WAAQG,IAAAR,EAAG,UAAH,gBAAAQ,EAAU,OAChCC,KAASJ,KAAA,gBAAAA,EAAO,aAAUK,IAAAV,EAAG,UAAH,gBAAAU,EAAU,SACpCC,KAAcN,KAAA,gBAAAA,EAAO,kBAAeO,IAAAZ,EAAG,UAAH,gBAAAY,EAAU;AACpD,IAAAb,EAAI,KAAK;AAAA,MACP,IAAIC,EAAG;AAAA,MACP,GAAGA,EAAG;AAAA,MACN,MAAMO,KAAQA,MAAS,SAASA,IAAO;AAAA,MACvC,QAAQE,KAAUA,MAAW,SAASA,IAAS;AAAA,MAC/C,aAAAE;AAAA,MACA,UAASE,IAAAb,EAAG,UAAH,gBAAAa,EAAU;AAAA,IAAA,CACpB;AAAA,EACH;AACA,SAAOd;AACT;AChBO,SAASe,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,aAAW,KAAKuD,GAAQ;AACtB,UAAMK,IAAQC,EAAe,CAAC;AAC9B,eAAWvB,KAAQsB;AACjB,eAASnE,IAAI,GAAGA,IAAI6C,EAAK,SAAS,GAAG7C,KAAK;AACxC,cAAMZ,IAAI8E,EAAarB,EAAK7C,CAAC,EAAE,GAAG6C,EAAK7C,CAAC,EAAE,CAAC,GACrCqE,IAAIH,EAAarB,EAAK7C,IAAI,CAAC,EAAE,GAAG6C,EAAK7C,IAAI,CAAC,EAAE,CAAC;AAQnD,QAPIZ,MAAMiF,KAEEtF,EAAM;AAAA,UAChB,CAACuF,MACEA,EAAE,iBAAiBlF,KAAKkF,EAAE,eAAeD,KACzCC,EAAE,iBAAiBD,KAAKC,EAAE,eAAelF;AAAA,QAAA,KAG9CL,EAAM,KAAK;AAAA,UACT,IAAIkF;AAAA,UACJ,OAAAF;AAAA,UACA,cAAc3E;AAAA,UACd,YAAYiF;AAAA,UACZ,QAAQ;AAAA,UACR,UAAU;AAAA,UACV,YAAY;AAAA,UACZ,MAAM;AAAA,QAAA,CACP;AAAA,MACH;AAAA,EAEJ;AAEA,QAAME,IAAYpE,EAA4BrB,GAASC,GAAOoC,CAAa;AAC3E,SAAO,EAAE,SAASoD,EAAU,SAAS,OAAOA,EAAU,OAAO,QAAAN,EAAA;AAC/D;AAEO,SAASO,EAAwBC,GAA6B;AACnE,SAAIA,MAAS,aAAmB,aAC5BA,MAAS,cAAoB,cAC1B;AACT;AAEA,SAASC,EAAcD,GAAuC;AAC5D,SAAOA,MAAS,aAAa,kBAAkB;AACjD;AAGA,SAASE,EACPxC,GACAP,GACA3C,GAC0B;AAC1B,MAAImD,EAAgBD,GAAOP,CAAQ,EAAG,QAAO;AAC7C,aAAWiB,KAAQjB,GAAU;AAC3B,QAAIiB,EAAK,SAAS,EAAG;AACrB,UAAM+B,IAAS,CAAC,GAAG/B,GAAMA,EAAK,CAAC,CAAC,GAC1BvB,IAAMC,EAAuBY,GAAOyC,CAAM;AAChD,QAAItD,KAAOA,EAAI,YAAYrC,EAAW,QAAO;AAAA,EAC/C;AACA,SAAO;AACT;AAEA,SAAS4F,EACP1F,GACA2F,GACAC,GACiB;AACjB,MAAI5F,EAAW,WAAW,EAAG,QAAO;AACpC,QAAM6F,IAAS7F,EAAW,OAAO,CAACsB,OAAYqE,EAAO,IAAIrE,EAAO,EAAE,KAAK,MAAM,CAAC;AAE9E,SAAO,CAAC,GADKuE,EAAO,SAAS,IAAIA,IAAS7F,CAC3B,EAAE,KAAK,CAACC,GAAGiF,MAAM7E,EAASJ,GAAG2F,CAAM,IAAIvF,EAAS6E,GAAGU,CAAM,CAAC,EAAE,CAAC,KAAK;AACnF;AAcO,SAASE,EACdnG,GACAC,GACAmG,GACAC,IAAkBjG,IAAyB,GACnC;AACR,QAAM4F,wBAAa,IAAA;AACnB,aAAWnF,KAAQZ;AACjB,IAAA+F,EAAO,IAAInF,EAAK,eAAemF,EAAO,IAAInF,EAAK,YAAY,KAAK,KAAK,CAAC,GACtEmF,EAAO,IAAInF,EAAK,aAAamF,EAAO,IAAInF,EAAK,UAAU,KAAK,KAAK,CAAC;AAGpE,QAAMqD,IAAOlE,EAAQ,OAAO,CAAC2B,MAAWA,EAAO,WAAW,IAAI,GACxDV,wBAAW,IAAA;AACjB,MAAIqF,IAAW;AAEf,aAAWC,KAASH,GAAQ;AAC1B,QAAI,CAACI,EAAwB,SAASD,EAAM,IAAI,EAAG;AACnD,UAAMlB,IAAQkB,EAAM,SAAS,YAAY,CAAA;AACzC,QAAIlB,EAAM,WAAW,EAAG;AACxB,UAAMoB,IAAOvC,EACV,OAAO,CAACvC,MAAW,CAACV,EAAK,IAAIU,EAAO,EAAE,CAAC,EACvC,IAAI,CAACA,OAAY;AAAA,MAChB,QAAAA;AAAA,MACA,KAAKkE,EAAgBlE,GAAQ0D,GAAOgB,CAAe;AAAA,IAAA,EACnD,EACD;AAAA,MAAO,CAAClC,MACPA,EAAI,OAAO;AAAA,IAAA;AAEf,QAAIsC,EAAK,WAAW,EAAG;AACvB,UAAMC,IAAQrB,EAAM,KAAA,GACdY,IAAS;AAAA,MACb,GAAGS,EAAM,OAAO,CAACC,GAAGxD,MAAMwD,IAAIxD,EAAE,GAAG,CAAC,IAAIuD,EAAM;AAAA,MAC9C,GAAGA,EAAM,OAAO,CAACC,GAAGxD,MAAMwD,IAAIxD,EAAE,GAAG,CAAC,IAAIuD,EAAM;AAAA,IAAA,GAE1CE,IACJb;AAAA,MACEU,EAAK,OAAO,CAACtC,MAAQA,EAAI,QAAQ,QAAQ,EAAE,IAAI,CAACA,MAAQA,EAAI,MAAM;AAAA,MAClE6B;AAAA,MACAC;AAAA,IAAA,KAEFF;AAAA,MACEU,EAAK,OAAO,CAACtC,MAAQA,EAAI,QAAQ,MAAM,EAAE,IAAI,CAACA,MAAQA,EAAI,MAAM;AAAA,MAChE6B;AAAA,MACAC;AAAA,IAAA;AAOJ,QALI,CAACW,MACLA,EAAK,UAAUL,EAAM,IACrBK,EAAK,OAAOlB,EAAwBa,EAAM,IAAI,GAC9CtF,EAAK,IAAI2F,EAAK,EAAE,GAChBN,KAAY,IACPN,EAAO,IAAIY,EAAK,EAAE,KAAK,KAAK,GAAG;AACpC,UAAMC,IAAWjB,EAAcgB,EAAK,IAAI;AACxC,eAAW/F,KAAQZ;AACjB,OAAIY,EAAK,iBAAiB+F,EAAK,MAAM/F,EAAK,eAAe+F,EAAK,QAC5D/F,EAAK,OAAOgG;AAAA,EAGlB;AAEA,SAAOP;AACT;ACndO,MAAMQ,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,GACxD9G,KAAM6G,KAAA,gBAAAA,EAAS,QAAO,OAAO,mBAC7BG,KAAMH,KAAA,gBAAAA,EAAS,QAAO,OAAO;AACnC,SAAO,KAAK,IAAIG,GAAK,KAAK,IAAIhH,GAAK+G,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.\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  // Green areas last among house fills so they stay above parking lanes.\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;"}

package/dist/core/assignment.d.ts

@@ -1,4 +1,4 @@
-import { AssignmentLayerType, AssignmentTargetType, CmShape, CmShapeAssignment, MapAssignRetailer, ShapeKind, ShapeLabel, ShapeStyle } from './types';
+import { AssignmentLayerType, AssignmentTargetType, CmShape, CmShapeAssignment, MapAssignRetailer, ShapeKind, ShapeLabel, ShapeStyle, ThemeDefaults } from './types';
 export declare const DEFAULT_ASSIGNMENT_SIZE = 12;
 /** Escalator / elevator icons use the same Size default as store names. */
 export declare const CONNECTOR_ICON_SIZE = 12;
@@ -28,10 +28,27 @@ export declare function retailerOptionLabel(retailer: MapAssignRetailer, duplica
 export declare function resolvedAssignmentBgColor(assignment: {
     bgColor?: string | null;
 } | null | undefined, storeColor: string): string;
+/** Amenity / kiosk / connection pads stay clear unless staff set a BG Color. */
+export declare function isTransparentPadKind(kind?: ShapeKind): boolean;
+/** Color-box fallback for BG Color — transparent on icon pads, else the store fill. */
+export declare function assignmentPadFillFallback(kind: ShapeKind | undefined, storeColor: string): string;
 /** Per-store text override, or the theme store text color when none is set. */
 export declare function resolvedAssignmentTextColor(assignment: {
     textColor?: string | null;
 } | null | undefined, textColor: string): string;
+export type AssignmentIconTheme = Pick<ThemeDefaults, 'AMENITY_ICON_COLOR' | 'KIOSK_ICON_COLOR' | 'CONNECTOR_ICON_COLOR' | 'STORE_TEXT_COLOR'>;
+/** House color for an amenity / kiosk / connection icon, or store text otherwise. */
+export declare function assignmentIconThemeFallback(assignment: {
+    layerType?: AssignmentLayerType;
+} | null | undefined, theme: AssignmentIconTheme, shapeKind?: ShapeKind): string;
+/**
+ * Per-item Icon Color / label color, or the amenity / kiosk / connection /
+ * store-text house default when none is set.
+ */
+export declare function resolvedAssignmentIconColor(assignment: {
+    textColor?: string | null;
+    layerType?: AssignmentLayerType;
+} | null | undefined, theme: AssignmentIconTheme, labelColor?: string | null, shapeKind?: ShapeKind): string;
 /** Kiosk app ID typed in Map options — not chosen from a device list. */
 export declare function parseKioskIdInput(raw: string): number | null;
 type AssignmentTargetFields = Pick<CmShapeAssignment, 'targetType' | 'retailerId' | 'amenityId' | 'kioskId'> & {
@@ -49,7 +66,7 @@ export declare function kioskAssignedName(assignment: {
 } | null | undefined, catalogName?: string | null): string | null;
 export declare function assignmentHasTarget(assignment: AssignmentTargetFields | null | undefined): boolean;
 /** Drop leftover retailer/custom text when the polygon is not assigned. */
-export declare function publishedShapeLabel(shape: Pick<CmShape, 'kind' | 'label' | 'style'>, assignment: CmShapeAssignment | null | undefined, retailer?: MapAssignRetailer | null): ShapeLabel;
+export declare function publishedShapeLabel(shape: Pick<CmShape, 'kind' | 'label' | 'style'> & Partial<Pick<CmShape, 'origin' | 'sourceSvgId'>>, assignment: CmShapeAssignment | null | undefined, retailer?: MapAssignRetailer | null): ShapeLabel;
 export declare function assignmentDisplayText(assignment: CmShapeAssignment, retailer?: MapAssignRetailer | null): string | undefined;
 /**
  * Logo reference for retail_logo / custom_image — prefer the stable retailer