@eyeon/map 2.0.20 → 2.0.26

package/dist/chunks/wheelZoom.js

@@ -1,10 +1,10 @@
-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";
+import { bD as S, b6 as w, b4 as M, a$ as _, b8 as L, bR as $, aR as O, B as F, c8 as N, d as p, bp as E, ar as k, bI as x, bG 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);
+    const f = $(n.id, r), I = (f == null ? void 0 : f.fill) ?? (O(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,
@@ -16,7 +16,7 @@ function V(e, d, r) {
   }
   return N(t, (n) => n.id);
 }
-function P(e, d, r, c = y) {
+function R(e, d, r, c = p) {
   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 = [];
@@ -38,7 +38,7 @@ function P(e, d, r, c = y) {
     rewiredEdgeIds: a
   };
 }
-function D(e, d = y) {
+function D(e, d = p) {
   const r = [], c = /* @__PURE__ */ new Set();
   for (let t = 0; t < e.length; t++) {
     if (c.has(e[t].id)) continue;
@@ -49,10 +49,10 @@ function D(e, d = y) {
   }
   return r;
 }
-function R(e, d, r = y) {
+function P(e, d, r = p) {
   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);
+    const f = R(c, t, n, r);
     if (f)
       for (const I of f.removedAnchorIds) i.add(I);
   }
@@ -64,7 +64,7 @@ function R(e, d, r = y) {
   }
   return { anchors: o, edges: a };
 }
-function Y(e, d, r, c = y) {
+function Y(e, d, r, c = p) {
   let t = null;
   for (const o of d) {
     const u = E(e, o);
@@ -83,7 +83,7 @@ function Y(e, d, r, c = y) {
     }
   };
 }
-function q(e, d, r, c) {
+function X(e, d, r, c) {
   if (r.length === 0) return null;
   const t = r.flat();
   if (t.length === 0) return null;
@@ -101,7 +101,7 @@ function q(e, d, r, c) {
     connectorId: null
   };
 }
-function X(e, d, r = 20) {
+function q(e, d, r = 20) {
   if (e.length === 0)
     return { anchors: [], edges: [] };
   let c = 1 / 0, t = 1 / 0, i = -1 / 0, o = -1 / 0;
@@ -111,8 +111,8 @@ function X(e, d, r = 20) {
   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 y = c + (h + 0.5) * r, g = t + (s + 0.5) * r, A = { x: y, y: g };
+      x(A, e) && (d.length > 0 && x(A, d) || n.push({ key: `${h},${s}`, x: y, y: g, col: h, row: s }));
     }
   const f = new Map(n.map((s) => [s.key, s])), I = n.map((s) => ({
     tempId: s.key,
@@ -125,8 +125,8 @@ function X(e, d, r = 20) {
       [s.col + 1, s.row],
       [s.col, s.row + 1]
     ];
-    for (const [p, g] of h) {
-      const A = `${p},${g}`;
+    for (const [y, g] of h) {
+      const A = `${y},${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 }));
@@ -134,7 +134,7 @@ function X(e, d, r = 20) {
   }
   return { anchors: I, edges: l };
 }
-function Z(e, d, r, c, t = y) {
+function Z(e, d, r, c, t = p) {
   const i = [], o = [];
   let u = c;
   const a = (f, I) => {
@@ -172,7 +172,7 @@ function Z(e, d, r, c, t = y) {
         });
       }
   }
-  const n = R(i, o, t);
+  const n = P(i, o, t);
   return { anchors: n.anchors, edges: n.edges, nextId: u };
 }
 function C(e) {
@@ -181,7 +181,7 @@ function C(e) {
 function K(e) {
   return e === "entrance" ? "entrance_link" : "unit_link";
 }
-function B(e, d, r) {
+function G(e, d, r) {
   if (x(e, d)) return "inside";
   for (const c of d) {
     if (c.length < 2) continue;
@@ -190,26 +190,26 @@ function B(e, d, r) {
   }
   return null;
 }
-function G(e, d, r) {
+function H(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);
+    const o = G(e, i, r);
     if (o === "inside") return t;
     o === "near" && c == null && (c = t);
   }
   return c;
 }
-function Q(e, d, r, c = y * 3) {
+function J(e, d, r, c = p * 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);
   let i = 0;
   for (const o of e) {
     if (o.shapeId != null) continue;
-    const u = G(o, r, c);
+    const u = H(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)
@@ -217,29 +217,29 @@ function Q(e, d, r, c = y * 3) {
   }
   return i;
 }
-const H = 0.95, b = 1;
-function j(e = b) {
-  return Math.pow(H, e);
+const j = 0.95, b = 1;
+function B(e = b) {
+  return Math.pow(j, e);
 }
-function J(e, d, r) {
+function Q(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;
+  const c = B((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 {
-  H as W,
+  j as W,
   b as a,
-  Q as b,
+  J as b,
   Y as c,
-  X as d,
-  R as e,
+  q as d,
+  P as e,
   D as f,
-  j as g,
+  B as g,
   Z as i,
-  J as n,
+  Q as n,
   V as o,
   C as r,
-  q as u,
-  P as w
+  X as u,
+  R 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 { 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;"}
+{"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;"}

package/dist/core/assignment.d.ts

@@ -2,7 +2,7 @@ import { AssignmentLayerType, AssignmentTargetType, CmShape, CmShapeAssignment,
 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;
-/** Retail logos read the same Size as retail names, then draw this many times larger. */
+/** Retail logos and custom images read the same Size as text, then draw this many times larger. */
 export declare const RETAIL_LOGO_RENDER_SCALE = 4;
 export declare const ASSIGNMENT_LAYER_TYPES: AssignmentLayerType[];
 /**
@@ -19,6 +19,8 @@ export declare function commitAssignNumberDraft(raw: string): {
 };
 export declare function isAssignmentLayerType(value: unknown): value is AssignmentLayerType;
 export declare function defaultLayerTypeForKind(kind: ShapeKind): AssignmentLayerType;
+/** External image pasted onto a Custom shape. Relative and S3 keys are not accepted. */
+export declare function isHttpImageUrl(value: string | null | undefined): boolean;
 export declare function defaultTargetTypeForKind(kind: ShapeKind): AssignmentTargetType;
 export declare function emptyShapeAssignment(shapeId: number, kind: ShapeKind): CmShapeAssignment;
 /** Normalize a draft / API assignment row (camelCase or snake_case). */
@@ -53,6 +55,8 @@ export declare function resolvedAssignmentIconColor(assignment: {
 export declare function parseKioskIdInput(raw: string): number | null;
 type AssignmentTargetFields = Pick<CmShapeAssignment, 'targetType' | 'retailerId' | 'amenityId' | 'kioskId'> & {
     customLabel?: string | null;
+    layerType?: AssignmentLayerType | null;
+    customImageKey?: string | null;
 };
 /** Staff-facing amenity name: catalog title, then the v1 type code. */
 export declare function amenityAssignedName(assignment: {
@@ -79,7 +83,7 @@ export declare function assignmentSpecialIconId(assignment?: CmShapeAssignment |
     id: number;
     code: string;
 }> | null): 'kiosk' | string | undefined;
-/** Stored Size is shared; retail logos render larger than names. */
+/** Stored Size is shared; retail logos and custom images render larger than text. */
 export declare function assignmentOverlayRenderSize(size: number, assignment?: {
     layerType?: AssignmentLayerType;
 } | null): number;

package/dist/core/assignment.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"assignment.d.ts","sourceRoot":"","sources":["../../src/core/assignment.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,mBAAmB,EACnB,oBAAoB,EACpB,OAAO,EACP,iBAAiB,EAEjB,iBAAiB,EACjB,SAAS,EACT,UAAU,EACV,UAAU,EACV,aAAa,EAEd,MAAM,SAAS,CAAC;AAIjB,eAAO,MAAM,uBAAuB,KAAK,CAAC;AAC1C,2EAA2E;AAC3E,eAAO,MAAM,mBAAmB,KAA0B,CAAC;AAC3D,yFAAyF;AACzF,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAE1C,eAAO,MAAM,sBAAsB,EAAE,mBAAmB,EASvD,CAAC;AAWF;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,MAAM,GAAG;IAClD,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,OAAO,CAAC;CACnB,CAQA;AAED,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,MAAM,GAAG;IACpD,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB,CAIA;AAqBD,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,mBAAmB,CAElF;AAED,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,SAAS,GAAG,mBAAmB,CAK5E;AAED,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,SAAS,GAAG,oBAAoB,CAK9E;AAED,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,SAAS,GACd,iBAAiB,CAmBnB;AAED,wEAAwE;AACxE,wBAAgB,oBAAoB,CAClC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,iBAAiB,EAChD,IAAI,GAAE,SAAkB,GACvB,iBAAiB,CAsDnB;AAOD,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,iBAAiB,EAC3B,aAAa,EAAE,OAAO,GACrB,MAAM,CAMR;AAED,wEAAwE;AACxE,wBAAgB,yBAAyB,CACvC,UAAU,EAAE;IAAE,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,GAAG,IAAI,GAAG,SAAS,EAC1D,UAAU,EAAE,MAAM,GACjB,MAAM,CAIR;AAED,gFAAgF;AAChF,wBAAgB,oBAAoB,CAAC,IAAI,CAAC,EAAE,SAAS,GAAG,OAAO,CAE9D;AAED,uFAAuF;AACvF,wBAAgB,yBAAyB,CACvC,IAAI,EAAE,SAAS,GAAG,SAAS,EAC3B,UAAU,EAAE,MAAM,GACjB,MAAM,CAGR;AAED,+EAA+E;AAC/E,wBAAgB,2BAA2B,CACzC,UAAU,EAAE;IAAE,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,GAAG,IAAI,GAAG,SAAS,EAC5D,SAAS,EAAE,MAAM,GAChB,MAAM,CAIR;AAED,MAAM,MAAM,mBAAmB,GAAG,IAAI,CACpC,aAAa,EACX,oBAAoB,GACpB,kBAAkB,GAClB,sBAAsB,GACtB,kBAAkB,CACrB,CAAC;AAEF,qFAAqF;AACrF,wBAAgB,2BAA2B,CACzC,UAAU,EAAE;IAAE,SAAS,CAAC,EAAE,mBAAmB,CAAA;CAAE,GAAG,IAAI,GAAG,SAAS,EAClE,KAAK,EAAE,mBAAmB,EAC1B,SAAS,CAAC,EAAE,SAAS,GACpB,MAAM,CAQR;AAED;;;GAGG;AACH,wBAAgB,2BAA2B,CACzC,UAAU,EACN;IAAE,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,SAAS,CAAC,EAAE,mBAAmB,CAAA;CAAE,GAC9D,IAAI,GACJ,SAAS,EACb,KAAK,EAAE,mBAAmB,EAC1B,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,EAC1B,SAAS,CAAC,EAAE,SAAS,GACpB,MAAM,CAKR;AAED,yEAAyE;AACzE,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAK5D;AAED,KAAK,sBAAsB,GAAG,IAAI,CAChC,iBAAiB,EACjB,YAAY,GAAG,YAAY,GAAG,WAAW,GAAG,SAAS,CACtD,GAAG;IACF,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC7B,CAAC;AAEF,uEAAuE;AACvE,wBAAgB,mBAAmB,CACjC,UAAU,EACN;IAAE,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,GAC1D,IAAI,GACJ,SAAS,EACb,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,GAC1B,MAAM,GAAG,IAAI,CAOf;AAED,iFAAiF;AACjF,wBAAgB,iBAAiB,CAC/B,UAAU,EACN;IAAE,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,GACxD,IAAI,GACJ,SAAS,EACb,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,GAC1B,MAAM,GAAG,IAAI,CAOf;AAED,wBAAgB,mBAAmB,CACjC,UAAU,EAAE,sBAAsB,GAAG,IAAI,GAAG,SAAS,GACpD,OAAO,CAcT;AASD,2EAA2E;AAC3E,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC,GAC9C,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,GAAG,aAAa,CAAC,CAAC,EAClD,UAAU,EAAE,iBAAiB,GAAG,IAAI,GAAG,SAAS,EAChD,QAAQ,CAAC,EAAE,iBAAiB,GAAG,IAAI,GAClC,UAAU,CA8BZ;AAED,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,iBAAiB,EAC7B,QAAQ,CAAC,EAAE,iBAAiB,GAAG,IAAI,GAClC,MAAM,GAAG,SAAS,CAYpB;AAED;;;;GAIG;AACH,wBAAgB,yBAAyB,CACvC,UAAU,CAAC,EAAE,iBAAiB,GAAG,IAAI,EACrC,QAAQ,CAAC,EAAE,iBAAiB,GAAG,IAAI,EACnC,KAAK,CAAC,EAAE,UAAU,GAAG,IAAI,GACxB,MAAM,GAAG,SAAS,CAapB;AAED,sEAAsE;AACtE,wBAAgB,uBAAuB,CACrC,UAAU,CAAC,EAAE,iBAAiB,GAAG,IAAI,EACrC,SAAS,CAAC,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,IAAI,GACrD,OAAO,GAAG,MAAM,GAAG,SAAS,CAW9B;AAED,oEAAoE;AACpE,wBAAgB,2BAA2B,CACzC,IAAI,EAAE,MAAM,EACZ,UAAU,CAAC,EAAE;IAAE,SAAS,CAAC,EAAE,mBAAmB,CAAA;CAAE,GAAG,IAAI,GACtD,MAAM,CAIR;AAED,8EAA8E;AAC9E,wBAAgB,mBAAmB,CACjC,KAAK,EAAE;IACL,UAAU,CAAC,EAAE,IAAI,CACf,iBAAiB,EACjB,MAAM,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,WAAW,CACtE,GAAG,IAAI,CAAC;IACT,KAAK,CAAC,EAAE;QACN,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,OAAO,CAAC,EAAE,MAAM,CAAC;QACjB,OAAO,CAAC,EAAE,MAAM,CAAC;QACjB,KAAK,CAAC,EAAE,MAAM,CAAC;KAChB,CAAC;CACH,GACA;IACD,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1B,CAYA;AAED,0FAA0F;AAC1F,wBAAgB,wBAAwB,CACtC,UAAU,EAAE,iBAAiB,GAAG,IAAI,GAAG,SAAS,EAChD,KAAK,CAAC,EAAE,UAAU,GAAG,IAAI,GACxB,OAAO,CAUT;AAqBD,+EAA+E;AAC/E,MAAM,MAAM,eAAe,GAAG;IAC5B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3B,CAAC;AAEF,MAAM,MAAM,mBAAmB,GAAG;IAChC,IAAI,EAAE,MAAM,GAAG,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,OAAO,CAAC;IACtB,cAAc,EAAE,OAAO,CAAC;CACzB,CAAC;AAcF,6EAA6E;AAC7E,wBAAgB,mBAAmB,CACjC,WAAW,EAAE,iBAAiB,EAAE,GAC/B,mBAAmB,CAUrB;AAED,wBAAgB,oBAAoB,CAClC,UAAU,EAAE,iBAAiB,EAC7B,KAAK,EAAE,eAAe,GACrB,iBAAiB,CAOnB;AAED,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,EACvC,UAAU,EAAE,iBAAiB,EAC7B,QAAQ,CAAC,EAAE,iBAAiB,GAAG,IAAI,GAClC;IAAE,KAAK,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,CAwB1C"}
+{"version":3,"file":"assignment.d.ts","sourceRoot":"","sources":["../../src/core/assignment.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,mBAAmB,EACnB,oBAAoB,EACpB,OAAO,EACP,iBAAiB,EAEjB,iBAAiB,EACjB,SAAS,EACT,UAAU,EACV,UAAU,EACV,aAAa,EAEd,MAAM,SAAS,CAAC;AAIjB,eAAO,MAAM,uBAAuB,KAAK,CAAC;AAC1C,2EAA2E;AAC3E,eAAO,MAAM,mBAAmB,KAA0B,CAAC;AAC3D,mGAAmG;AACnG,eAAO,MAAM,wBAAwB,IAAI,CAAC;AAE1C,eAAO,MAAM,sBAAsB,EAAE,mBAAmB,EASvD,CAAC;AAWF;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,MAAM,GAAG;IAClD,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,OAAO,CAAC;CACnB,CAQA;AAED,wBAAgB,uBAAuB,CAAC,GAAG,EAAE,MAAM,GAAG;IACpD,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB,CAIA;AAqBD,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,mBAAmB,CAElF;AAED,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,SAAS,GAAG,mBAAmB,CAM5E;AAED,wFAAwF;AACxF,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,OAAO,CASxE;AAED,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,SAAS,GAAG,oBAAoB,CAK9E;AAED,wBAAgB,oBAAoB,CAClC,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,SAAS,GACd,iBAAiB,CAmBnB;AAED,wEAAwE;AACxE,wBAAgB,oBAAoB,CAClC,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,iBAAiB,EAChD,IAAI,GAAE,SAAkB,GACvB,iBAAiB,CAsDnB;AAOD,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,iBAAiB,EAC3B,aAAa,EAAE,OAAO,GACrB,MAAM,CAMR;AAED,wEAAwE;AACxE,wBAAgB,yBAAyB,CACvC,UAAU,EAAE;IAAE,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,GAAG,IAAI,GAAG,SAAS,EAC1D,UAAU,EAAE,MAAM,GACjB,MAAM,CAIR;AAED,gFAAgF;AAChF,wBAAgB,oBAAoB,CAAC,IAAI,CAAC,EAAE,SAAS,GAAG,OAAO,CAE9D;AAED,uFAAuF;AACvF,wBAAgB,yBAAyB,CACvC,IAAI,EAAE,SAAS,GAAG,SAAS,EAC3B,UAAU,EAAE,MAAM,GACjB,MAAM,CAGR;AAED,+EAA+E;AAC/E,wBAAgB,2BAA2B,CACzC,UAAU,EAAE;IAAE,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,GAAG,IAAI,GAAG,SAAS,EAC5D,SAAS,EAAE,MAAM,GAChB,MAAM,CAIR;AAED,MAAM,MAAM,mBAAmB,GAAG,IAAI,CACpC,aAAa,EACX,oBAAoB,GACpB,kBAAkB,GAClB,sBAAsB,GACtB,kBAAkB,CACrB,CAAC;AAEF,qFAAqF;AACrF,wBAAgB,2BAA2B,CACzC,UAAU,EAAE;IAAE,SAAS,CAAC,EAAE,mBAAmB,CAAA;CAAE,GAAG,IAAI,GAAG,SAAS,EAClE,KAAK,EAAE,mBAAmB,EAC1B,SAAS,CAAC,EAAE,SAAS,GACpB,MAAM,CAQR;AAED;;;GAGG;AACH,wBAAgB,2BAA2B,CACzC,UAAU,EACN;IAAE,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,SAAS,CAAC,EAAE,mBAAmB,CAAA;CAAE,GAC9D,IAAI,GACJ,SAAS,EACb,KAAK,EAAE,mBAAmB,EAC1B,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,EAC1B,SAAS,CAAC,EAAE,SAAS,GACpB,MAAM,CAKR;AAED,yEAAyE;AACzE,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAK5D;AAED,KAAK,sBAAsB,GAAG,IAAI,CAChC,iBAAiB,EACjB,YAAY,GAAG,YAAY,GAAG,WAAW,GAAG,SAAS,CACtD,GAAG;IACF,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,SAAS,CAAC,EAAE,mBAAmB,GAAG,IAAI,CAAC;IACvC,cAAc,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC,CAAC;AAEF,uEAAuE;AACvE,wBAAgB,mBAAmB,CACjC,UAAU,EACN;IAAE,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,GAC1D,IAAI,GACJ,SAAS,EACb,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,GAC1B,MAAM,GAAG,IAAI,CAOf;AAED,iFAAiF;AACjF,wBAAgB,iBAAiB,CAC/B,UAAU,EACN;IAAE,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,GACxD,IAAI,GACJ,SAAS,EACb,WAAW,CAAC,EAAE,MAAM,GAAG,IAAI,GAC1B,MAAM,GAAG,IAAI,CAOf;AAED,wBAAgB,mBAAmB,CACjC,UAAU,EAAE,sBAAsB,GAAG,IAAI,GAAG,SAAS,GACpD,OAAO,CAoBT;AAUD,2EAA2E;AAC3E,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,GAAG,OAAO,CAAC,GAC9C,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,GAAG,aAAa,CAAC,CAAC,EAClD,UAAU,EAAE,iBAAiB,GAAG,IAAI,GAAG,SAAS,EAChD,QAAQ,CAAC,EAAE,iBAAiB,GAAG,IAAI,GAClC,UAAU,CA8BZ;AAED,wBAAgB,qBAAqB,CACnC,UAAU,EAAE,iBAAiB,EAC7B,QAAQ,CAAC,EAAE,iBAAiB,GAAG,IAAI,GAClC,MAAM,GAAG,SAAS,CAYpB;AAED;;;;GAIG;AACH,wBAAgB,yBAAyB,CACvC,UAAU,CAAC,EAAE,iBAAiB,GAAG,IAAI,EACrC,QAAQ,CAAC,EAAE,iBAAiB,GAAG,IAAI,EACnC,KAAK,CAAC,EAAE,UAAU,GAAG,IAAI,GACxB,MAAM,GAAG,SAAS,CAapB;AAED,sEAAsE;AACtE,wBAAgB,uBAAuB,CACrC,UAAU,CAAC,EAAE,iBAAiB,GAAG,IAAI,EACrC,SAAS,CAAC,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAAG,IAAI,GACrD,OAAO,GAAG,MAAM,GAAG,SAAS,CAW9B;AAED,qFAAqF;AACrF,wBAAgB,2BAA2B,CACzC,IAAI,EAAE,MAAM,EACZ,UAAU,CAAC,EAAE;IAAE,SAAS,CAAC,EAAE,mBAAmB,CAAA;CAAE,GAAG,IAAI,GACtD,MAAM,CASR;AAED,8EAA8E;AAC9E,wBAAgB,mBAAmB,CACjC,KAAK,EAAE;IACL,UAAU,CAAC,EAAE,IAAI,CACf,iBAAiB,EACjB,MAAM,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,WAAW,GAAG,WAAW,CACtE,GAAG,IAAI,CAAC;IACT,KAAK,CAAC,EAAE;QACN,IAAI,CAAC,EAAE,MAAM,CAAC;QACd,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,OAAO,CAAC,EAAE,MAAM,CAAC;QACjB,OAAO,CAAC,EAAE,MAAM,CAAC;QACjB,KAAK,CAAC,EAAE,MAAM,CAAC;KAChB,CAAC;CACH,GACA;IACD,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;CAC1B,CAYA;AAED,0FAA0F;AAC1F,wBAAgB,wBAAwB,CACtC,UAAU,EAAE,iBAAiB,GAAG,IAAI,GAAG,SAAS,EAChD,KAAK,CAAC,EAAE,UAAU,GAAG,IAAI,GACxB,OAAO,CAUT;AAqBD,+EAA+E;AAC/E,MAAM,MAAM,eAAe,GAAG;IAC5B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAC3B,CAAC;AAEF,MAAM,MAAM,mBAAmB,GAAG;IAChC,IAAI,EAAE,MAAM,GAAG,EAAE,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,OAAO,CAAC;IACtB,cAAc,EAAE,OAAO,CAAC;CACzB,CAAC;AAcF,6EAA6E;AAC7E,wBAAgB,mBAAmB,CACjC,WAAW,EAAE,iBAAiB,EAAE,GAC/B,mBAAmB,CAUrB;AAED,wBAAgB,oBAAoB,CAClC,UAAU,EAAE,iBAAiB,EAC7B,KAAK,EAAE,eAAe,GACrB,iBAAiB,CAOnB;AAED,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,EACvC,UAAU,EAAE,iBAAiB,EAC7B,QAAQ,CAAC,EAAE,iBAAiB,GAAG,IAAI,GAClC;IAAE,KAAK,EAAE,UAAU,CAAC;IAAC,KAAK,EAAE,UAAU,CAAA;CAAE,CAwB1C"}