@kerros/editor 0.0.0-stage → 0.1.0-rc.2

package/dist/model/navigation.js

@@ -0,0 +1,275 @@
+var z = Object.defineProperty;
+var J = (o, t, n) => t in o ? z(o, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : o[t] = n;
+var j = (o, t, n) => J(o, typeof t != "symbol" ? t + "" : t, n);
+import { uid as B } from "./types.js";
+import { distance as w, objectPosition as D, pointInRing as L } from "./geometry.js";
+import { topology as G } from "./topology.js";
+import { servedFloors as U, shaftKey as P } from "./vertical.js";
+import { spaceAt as X, inSpace as Y } from "./spaces.js";
+import { routeClearance as Z } from "./routeClearance.js";
+const oo = 25, to = 1, eo = 5, io = 1.5, no = 0.25, R = (o) => o.navNodes ?? G(o).nodes, so = (o) => o.navEdges ?? G(o).edges, q = (o, t) => t === null ? null : o.floors.find((n) => n.id === t) ?? null, E = (o, t) => {
+  var n;
+  return ((n = q(o, t)) == null ? void 0 : n.elevation) ?? 0;
+};
+function H(o, t, n, s) {
+  o.navNodes ?? (o.navNodes = []);
+  const e = o.navNodes.find((f) => f.floorId === t && w(f.position, n) < no);
+  if (e)
+    return s && !e.objectId && (e.objectId = s), e;
+  const l = { id: B(), floorId: t, position: [n[0], n[1]] };
+  return s && (l.objectId = s), o.navNodes.push(l), l;
+}
+function K(o, t, n, s, e) {
+  o.navEdges ?? (o.navEdges = []);
+  const l = o.navEdges.find(
+    (i) => i.kind === t && (i.aId === n.id && i.bId === s.id || i.aId === s.id && i.bId === n.id)
+  );
+  if (l)
+    return e && !l.objectId && (l.objectId = e), l;
+  const f = { id: B(), kind: t, aId: n.id, bId: s.id };
+  return e && (f.objectId = e), o.navEdges.push(f), f;
+}
+function po(o, t, n) {
+  const s = n.map((e) => H(o, t, e));
+  for (let e = 1; e < s.length; e++) s[e - 1].id !== s[e].id && K(o, "walk", s[e - 1], s[e]);
+  return s;
+}
+function ko(o, t) {
+  const n = t.kind === "elevator" ? "elevator" : "stairs", s = t.stairModel === "escalator" ? t.travel ?? "up" : null, e = U(o, t), l = P(t), f = /* @__PURE__ */ new Map();
+  for (const r of o.objects)
+    r.kind === t.kind && P(r) === l && !f.has(r.floorId) && f.set(r.floorId, r);
+  const i = (r) => f.get(r) ?? t, c = e.map((r) => {
+    const u = i(r.id);
+    return H(o, r.id, D(o, u), u.id);
+  });
+  for (let r = 1; r < c.length; r++)
+    for (let u = n === "elevator" ? 0 : r - 1; u < r; u++) {
+      if (c[u].id === c[r].id) continue;
+      const [p, h] = s === "down" ? [c[r], c[u]] : [c[u], c[r]], k = K(o, n, p, h, i(c[r].floorId).id);
+      s && (k.directed = !0);
+    }
+  return c;
+}
+const vo = "@here";
+function V(o, t, n, s) {
+  if (t.weight !== void 0) return t.weight;
+  const e = w(n.position, s.position), l = Math.abs(E(o, n.floorId) - E(o, s.floorId));
+  return t.kind === "elevator" ? oo + l * to : t.kind === "stairs" ? e + l * eo : e + (t.kind === "door" ? io : 0);
+}
+function y(o, t, n, s) {
+  const e = t.kind === "stairs" || t.kind === "elevator" ? Math.abs(E(o, n.floorId) - E(o, s.floorId)) : 0;
+  return w(n.position, s.position) + e;
+}
+function ro(o, t) {
+  const n = R(o).filter((i) => i.objectId === t.id);
+  if (n.length) return n.map((i) => ({ node: i, cost: 0 }));
+  const s = D(o, t), e = R(o).filter((i) => i.floorId === t.floorId), l = t.rings ? e.filter(
+    (i) => L(i.position, t.rings[0]) && !t.rings.slice(1).some((c) => L(i.position, c))
+  ) : [];
+  if (l.length) return l.map((i) => ({ node: i, cost: w(s, i.position) }));
+  const f = e.map((i) => ({ node: i, cost: w(s, i.position) })).sort((i, c) => i.cost - c.cost)[0];
+  return f ? [f] : [];
+}
+function W(o, t, n) {
+  if (typeof t == "string") {
+    const r = o.objects.find((u) => u.id === t);
+    return r ? { place: r, anchors: ro(o, r), extraNodes: [], extraEdges: [] } : null;
+  }
+  const s = { id: `@${n}`, floorId: t.floorId, position: t.position }, e = R(o).filter((r) => r.floorId === t.floorId), l = X(o, t.floorId, t.position), f = Z(o)(t.floorId);
+  let i = l ? e.filter((r) => Y(l, r.position) && f(t.position, r.position)) : [];
+  if (!l) {
+    const r = e.filter((u) => f(t.position, u.position)).sort((u, p) => w(u.position, t.position) - w(p.position, t.position))[0];
+    i = r ? [r] : [];
+  }
+  const c = i.map(
+    (r, u) => ({
+      id: `@${n}-${u}`,
+      kind: "walk",
+      aId: s.id,
+      bId: r.id,
+      weight: w(t.position, r.position)
+    })
+  );
+  return {
+    place: {
+      id: `@${n}`,
+      kind: "poi",
+      name: t.name ?? "Where you are",
+      floorId: t.floorId,
+      position: t.position
+    },
+    anchors: [{ node: s, cost: 0 }],
+    extraNodes: [s],
+    extraEdges: c
+  };
+}
+function wo(o, t, n, s = {}) {
+  var F;
+  const e = W(o, t, "from"), l = W(o, n, "to");
+  if (!e || !l) return null;
+  const f = e.place, i = l.place, c = e.anchors, r = l.anchors;
+  if (!c.length || !r.length) return null;
+  const u = [...R(o), ...e.extraNodes, ...l.extraNodes], p = new Map(u.map((d) => [d.id, d])), h = /* @__PURE__ */ new Map();
+  for (const d of [...so(o), ...e.extraEdges, ...l.extraEdges]) {
+    const a = p.get(d.aId), I = p.get(d.bId);
+    if (!a || !I) continue;
+    const v = d.kind === "stairs" && d.objectId ? o.objects.find((m) => m.id === d.objectId && m.stairModel === "escalator") : void 0, g = v != null && v.feedId ? (F = s.statuses) == null ? void 0 : F.get(v.feedId) : void 0;
+    if (v && (g != null && g.travel || (g == null ? void 0 : g.running) === !1)) {
+      const m = E(o, I.floorId) > E(o, a.floorId), x = (g.travel ?? v.travel ?? "up") === (m ? "up" : "down");
+      (g.running === !1 || x) && (h.get(a.id) ?? h.set(a.id, []).get(a.id)).push({ edge: d, other: I }), (g.running === !1 || !x) && (h.get(I.id) ?? h.set(I.id, []).get(I.id)).push({ edge: d, other: a });
+      continue;
+    }
+    (h.get(a.id) ?? h.set(a.id, []).get(a.id)).push({ edge: d, other: I }), d.directed || (h.get(I.id) ?? h.set(I.id, []).get(I.id)).push({ edge: d, other: a });
+  }
+  const k = new fo(), b = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), T = /* @__PURE__ */ new Set();
+  for (const d of c)
+    d.cost < (b.get(d.node.id) ?? 1 / 0) && (b.set(d.node.id, d.cost), k.push(d.node.id, d.cost));
+  const _ = new Map(r.map((d) => [d.node.id, d.cost]));
+  let A = 1 / 0;
+  for (; ; ) {
+    const d = k.pop();
+    if (!d || d.cost > A) break;
+    const { id: a, cost: I } = d;
+    if (T.has(a)) continue;
+    T.add(a), _.has(a) && (A = Math.min(A, I + _.get(a)));
+    const v = p.get(a);
+    for (const { edge: g, other: m } of h.get(a) ?? []) {
+      const x = I + V(o, g, v, m);
+      x < (b.get(m.id) ?? 1 / 0) && (b.set(m.id, x), N.set(m.id, { node: v, edge: g }), k.push(m.id, x));
+    }
+  }
+  const M = r.map((d) => ({ ...d, total: (b.get(d.node.id) ?? 1 / 0) + d.cost })).sort((d, a) => d.total - a.total)[0];
+  if (!M || !Number.isFinite(M.total)) return null;
+  const $ = [];
+  for (let d = M.node; ; ) {
+    const a = N.get(d.id);
+    if (!a) break;
+    $.unshift({ edge: a.edge, from: a.node, to: d, cost: V(o, a.edge, a.node, d) }), d = a.node;
+  }
+  const C = [$.length ? $[0].from : M.node, ...$.map((d) => d.to)], Q = $.reduce((d, a) => d + y(o, a.edge, a.from, a.to), 0);
+  return {
+    from: f,
+    to: i,
+    nodes: C,
+    legs: $,
+    steps: lo(o, f, i, C, $),
+    distance: Q,
+    cost: M.total
+  };
+}
+class fo {
+  constructor() {
+    j(this, "items", []);
+    j(this, "order", 0);
+  }
+  before(t, n) {
+    return t.cost < n.cost || t.cost === n.cost && t.order < n.order;
+  }
+  push(t, n) {
+    const s = { id: t, cost: n, order: this.order++ };
+    let e = this.items.length;
+    for (this.items.push(s); e > 0; ) {
+      const l = e - 1 >> 1;
+      if (!this.before(s, this.items[l])) break;
+      this.items[e] = this.items[l], e = l;
+    }
+    this.items[e] = s;
+  }
+  pop() {
+    const t = this.items[0], n = this.items.pop();
+    if (this.items.length && n) {
+      let s = 0;
+      for (; s * 2 + 1 < this.items.length; ) {
+        let e = s * 2 + 1;
+        if (e + 1 < this.items.length && this.before(this.items[e + 1], this.items[e]) && e++, !this.before(this.items[e], n)) break;
+        this.items[s] = this.items[e], s = e;
+      }
+      this.items[s] = n;
+    }
+    return t;
+  }
+}
+function O(o, t) {
+  const n = q(o, t);
+  return n ? n.code ? `${n.name} (level ${n.code})` : n.name : "outside";
+}
+const S = (o, t, n) => {
+  var s;
+  return ((s = o.objects.find((e) => e.id === t.edge.objectId)) == null ? void 0 : s.name) ?? n;
+};
+function lo(o, t, n, s, e) {
+  const l = [
+    {
+      kind: "depart",
+      text: `Start at ${t.name}${t.floorId !== null ? ` on ${O(o, t.floorId)}` : ""}`,
+      floorId: t.floorId,
+      nodeIds: s.length ? [s[0].id] : []
+    }
+  ];
+  for (let f = 0; f < e.length; f++) {
+    const i = e[f];
+    if (i.edge.kind === "walk") {
+      let c = y(o, i.edge, i.from, i.to);
+      const r = [i.from.id, i.to.id];
+      for (; f + 1 < e.length && e[f + 1].edge.kind === "walk"; )
+        f++, c += y(o, e[f].edge, e[f].from, e[f].to), r.push(e[f].to.id);
+      l.push({
+        kind: "walk",
+        text: `Walk ${Math.max(1, Math.round(c))} m ${e[f].to.floorId === null ? "outside" : `along ${O(o, i.from.floorId)}`}`,
+        floorId: i.from.floorId,
+        nodeIds: r,
+        distance: c
+      });
+    } else if (i.edge.kind === "door") {
+      const c = S(o, i, "the door"), r = i.to.floorId === null && i.from.floorId !== null ? `Exit through ${c}` : i.from.floorId === null && i.to.floorId !== null ? `Enter through ${c}` : `Go through ${c}`;
+      l.push({
+        kind: "door",
+        text: r,
+        floorId: i.to.floorId,
+        nodeIds: [i.from.id, i.to.id],
+        objectId: i.edge.objectId,
+        distance: y(o, i.edge, i.from, i.to)
+      });
+    } else {
+      const c = i.edge.kind, r = S(o, i, c === "elevator" ? "the lift" : "the stairs"), u = [i.from.id, i.to.id], p = i.from;
+      let h = i.to, k = i.edge.objectId;
+      for (; f + 1 < e.length && e[f + 1].edge.kind === c && S(o, e[f + 1], r) === r; )
+        f++, h = e[f].to, u.push(h.id), k = e[f].edge.objectId ?? k;
+      const b = E(o, h.floorId) - E(o, p.floorId), N = c === "stairs" && !/\b(up|down)\b/i.test(r) ? `${b > 0 ? "up " : "down "}` : "";
+      l.push({
+        kind: c,
+        text: `Take ${r} ${N}to ${O(o, h.floorId)}`,
+        floorId: h.floorId,
+        nodeIds: u,
+        objectId: k
+      });
+    }
+  }
+  return l.push({
+    kind: "arrive",
+    text: `Arrive at ${n.name}`,
+    floorId: n.floorId,
+    nodeIds: s.length ? [s[s.length - 1].id] : []
+  }), l;
+}
+export {
+  io as DOOR_COST,
+  oo as ELEVATOR_BASE,
+  to as ELEVATOR_PER_METRE,
+  vo as HERE,
+  no as NAV_WELD,
+  eo as STAIR_CLIMB_FACTOR,
+  K as addNavEdge,
+  H as addNavNode,
+  ko as chainVertical,
+  V as edgeCost,
+  y as edgeLength,
+  wo as findRoute,
+  O as floorPhrase,
+  so as navEdges,
+  R as navNodes,
+  po as navPath,
+  ro as routeAnchors,
+  lo as routeSteps
+};
+//# sourceMappingURL=navigation.js.map

package/dist/model/navigation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"navigation.js","sources":["../../../../src/model/navigation.ts"],"sourcesContent":["// Indoor-navigation graph: authoring helpers, A-to-B routing (Dijkstra) and human step\n// instructions (graph validation lives in validate.ts). Pure model code — no React, no MapLibre; all geometry stays in the\n// local metric frame, and floor elevations are the real model values (presentation compression of\n// buried floors is a map concern, see src/map/underground.ts).\nimport type { Floor, NavEdge, NavEdgeKind, NavNode, Point, ProjectDocument, SiteObject } from './types';\nimport { uid } from './types';\nimport { distance, objectPosition, pointInRing } from './geometry';\nimport { topology } from './topology';\nimport { servedFloors, shaftKey } from './vertical';\nimport { inSpace, spaceAt } from './spaces';\nimport { routeClearance } from './routeClearance';\nimport type { StatusReading } from './live';\n\n// Cost model in metres-equivalent, exported so editors and play mode price edges identically: a\n// lift ride costs a flat call-and-wait plus a little per metre of rise, stairs cost their run plus\n// a climb penalty — so one storey favours the stairs and a tower ride favours the lift.\nexport const ELEVATOR_BASE = 25,\n  ELEVATOR_PER_METRE = 1,\n  STAIR_CLIMB_FACTOR = 5,\n  DOOR_COST = 1.5;\n/** addNavNode welds onto any existing node within this range (mirrors joinAt's junction reuse). */\nexport const NAV_WELD = 0.25;\n\n// Authored graph wins where a document has one; otherwise the graph is derived from spaces and\n// portals. Routing, the journey player and the route overlay all read through these two accessors,\n// so they need no knowledge of which kind of document they are looking at.\nexport const navNodes = (p: ProjectDocument): NavNode[] => p.navNodes ?? topology(p).nodes;\nexport const navEdges = (p: ProjectDocument): NavEdge[] => p.navEdges ?? topology(p).edges;\nconst floorOf = (p: ProjectDocument, id: string | null): Floor | null =>\n  id === null ? null : (p.floors.find(f => f.id === id) ?? null);\nconst elevation = (p: ProjectDocument, id: string | null) => floorOf(p, id)?.elevation ?? 0;\n// Graph validation moved to validate.ts — the validity layer stands on its own.\n\n// ——— Authoring helpers (used by the editor tool and the demo generators).\n/** Find-or-create a route node at a point on a floor, welding onto any node within NAV_WELD. */\nexport function addNavNode(p: ProjectDocument, floorId: string | null, position: Point, objectId?: string): NavNode {\n  p.navNodes ??= [];\n  const existing = p.navNodes.find(n => n.floorId === floorId && distance(n.position, position) < NAV_WELD);\n  if (existing) {\n    if (objectId && !existing.objectId) existing.objectId = objectId;\n    return existing;\n  }\n  const node: NavNode = { id: uid(), floorId, position: [position[0], position[1]] };\n  if (objectId) node.objectId = objectId;\n  p.navNodes.push(node);\n  return node;\n}\n/** Connect two nodes, reusing an existing edge of the same kind between the same pair. */\nexport function addNavEdge(p: ProjectDocument, kind: NavEdgeKind, a: NavNode, b: NavNode, objectId?: string): NavEdge {\n  p.navEdges ??= [];\n  const existing = p.navEdges.find(\n    e => e.kind === kind && ((e.aId === a.id && e.bId === b.id) || (e.aId === b.id && e.bId === a.id)),\n  );\n  if (existing) {\n    if (objectId && !existing.objectId) existing.objectId = objectId;\n    return existing;\n  }\n  const edge: NavEdge = { id: uid(), kind, aId: a.id, bId: b.id };\n  if (objectId) edge.objectId = objectId;\n  p.navEdges.push(edge);\n  return edge;\n}\n/** Draw a chain of walk edges through the given points, welding onto existing nodes en route. */\nexport function navPath(p: ProjectDocument, floorId: string | null, points: Point[]): NavNode[] {\n  const out = points.map(pt => addNavNode(p, floorId, pt));\n  for (let i = 1; i < out.length; i++) if (out[i - 1].id !== out[i].id) addNavEdge(p, 'walk', out[i - 1], out[i]);\n  return out;\n}\n/** Thread a vertical connection through an elevator/stairs object: one node per served floor at the object's position. Stairs chain adjacent served floors (you pass every level); an elevator gets an edge per floor pair (a ride is direct, so ELEVATOR_BASE is paid once). Per-floor twin objects share a name (see the demo lifts); pass any one of them and each edge binds the twin on its upper floor. */\nexport function chainVertical(p: ProjectDocument, object: SiteObject): NavNode[] {\n  const kind: NavEdgeKind = object.kind === 'elevator' ? 'elevator' : 'stairs';\n  // An escalator carries you one way, so the edges it threads are one-way: a route may ride it in\n  // the direction it runs and must walk round to come back. A stair has no direction to run in.\n  const travel = object.stairModel === 'escalator' ? (object.travel ?? 'up') : null;\n  const floors = servedFloors(p, object);\n  const key = shaftKey(object);\n  const twins = new Map<string | null, SiteObject>();\n  for (const o of p.objects)\n    if (o.kind === object.kind && shaftKey(o) === key && !twins.has(o.floorId)) twins.set(o.floorId, o);\n  const twin = (floorId: string) => twins.get(floorId) ?? object;\n  const out = floors.map(f => {\n    const t = twin(f.id);\n    return addNavNode(p, f.id, objectPosition(p, t), t.id);\n  });\n  for (let i = 1; i < out.length; i++)\n    for (let j = kind === 'elevator' ? 0 : i - 1; j < i; j++) {\n      if (out[j].id === out[i].id) continue;\n      // Nodes come sorted upwards, so `out[j]` is the lower landing. An escalator running down is\n      // the same pair the other way about.\n      const [from, to] = travel === 'down' ? [out[i], out[j]] : [out[j], out[i]];\n      const edge = addNavEdge(p, kind, from, to, twin(out[i].floorId!).id);\n      if (travel) edge.directed = true;\n    }\n  return out;\n}\n\n// ——— Routing.\nexport interface RouteLeg {\n  edge: NavEdge;\n  from: NavNode;\n  to: NavNode;\n  cost: number;\n}\nexport interface RouteStep {\n  kind: 'depart' | 'walk' | 'door' | 'stairs' | 'elevator' | 'arrive';\n  text: string;\n  floorId: string | null;\n  nodeIds: string[];\n  objectId?: string;\n  distance?: number;\n}\n/** Either end of a route: an object in the document by id, or a point on a floor — where the\n *  walker is standing, which is the start most people want and no object describes. */\nexport type RouteEnd = string | { name?: string; floorId: string | null; position: Point };\n/** What a route knows about its ends: enough to name them and place them, whether they came from\n *  an object or a point. */\nexport type RoutePlace = Pick<SiteObject, 'id' | 'kind' | 'name' | 'floorId' | 'position'>;\n/** The id a host uses for \"where the walker is\" in a picker; findRoute() never sees it. */\nexport const HERE = '@here';\nexport interface Route {\n  from: RoutePlace;\n  to: RoutePlace;\n  nodes: NavNode[];\n  legs: RouteLeg[];\n  steps: RouteStep[];\n  distance: number;\n  cost: number;\n}\n\n/** Metres-equivalent cost of traversing an edge; authored weight wins over the derived cost. */\nexport function edgeCost(p: ProjectDocument, edge: NavEdge, a: NavNode, b: NavNode): number {\n  if (edge.weight !== undefined) return edge.weight;\n  const run = distance(a.position, b.position),\n    rise = Math.abs(elevation(p, a.floorId) - elevation(p, b.floorId));\n  if (edge.kind === 'elevator') return ELEVATOR_BASE + rise * ELEVATOR_PER_METRE;\n  if (edge.kind === 'stairs') return run + rise * STAIR_CLIMB_FACTOR;\n  return run + (edge.kind === 'door' ? DOOR_COST : 0);\n}\n/** Walking metres of an edge (horizontal run, plus the rise on vertical edges) — for display, not costing. */\nexport function edgeLength(p: ProjectDocument, edge: NavEdge, a: NavNode, b: NavNode): number {\n  const rise =\n    edge.kind === 'stairs' || edge.kind === 'elevator'\n      ? Math.abs(elevation(p, a.floorId) - elevation(p, b.floorId))\n      : 0;\n  return distance(a.position, b.position) + rise;\n}\n\n/** Candidate graph entry points for a room/door/poi: nodes bound to the object at cost 0, else nodes inside an area's outer ring, else the nearest node on the object's floor. Cost is the straight-line approach in metres. */\nexport function routeAnchors(p: ProjectDocument, object: SiteObject): { node: NavNode; cost: number }[] {\n  const bound = navNodes(p).filter(n => n.objectId === object.id);\n  if (bound.length) return bound.map(node => ({ node, cost: 0 }));\n  const anchor = objectPosition(p, object);\n  const sameFloor = navNodes(p).filter(n => n.floorId === object.floorId);\n  const inside = object.rings\n    ? sameFloor.filter(\n        n => pointInRing(n.position, object.rings![0]) && !object.rings!.slice(1).some(h => pointInRing(n.position, h)),\n      )\n    : [];\n  if (inside.length) return inside.map(node => ({ node, cost: distance(anchor, node.position) }));\n  const nearest = sameFloor\n    .map(node => ({ node, cost: distance(anchor, node.position) }))\n    .sort((a, b) => a.cost - b.cost)[0];\n  return nearest ? [nearest] : [];\n}\n\n/** A route's end resolved against the graph: the place it names, the nodes it can join the graph\n *  at and what joining costs, and — for a point — the node and edges that stand in for it. A point\n *  is not in the graph, so it is given a node of its own, joined by walk edges to the nodes inside\n *  the space it stands in (or the nearest node on its floor, standing in a corridor nobody drew as\n *  a space). The route then genuinely starts where the walker is, and the first leg is the walk\n *  from there to the drawn network. */\nfunction routeEnd(\n  p: ProjectDocument,\n  end: RouteEnd,\n  tag: string,\n): {\n  place: RoutePlace;\n  anchors: { node: NavNode; cost: number }[];\n  extraNodes: NavNode[];\n  extraEdges: NavEdge[];\n} | null {\n  if (typeof end === 'string') {\n    const object = p.objects.find(o => o.id === end);\n    return object ? { place: object, anchors: routeAnchors(p, object), extraNodes: [], extraEdges: [] } : null;\n  }\n  const here: NavNode = { id: `@${tag}`, floorId: end.floorId, position: end.position };\n  const sameFloor = navNodes(p).filter(n => n.floorId === end.floorId);\n  const space = spaceAt(p, end.floorId, end.position);\n  const clear = routeClearance(p)(end.floorId);\n  let joins = space ? sameFloor.filter(n => inSpace(space, n.position) && clear(end.position, n.position)) : [];\n  if (!space) {\n    const nearest = sameFloor\n      .filter(n => clear(end.position, n.position))\n      .sort((a, b) => distance(a.position, end.position) - distance(b.position, end.position))[0];\n    joins = nearest ? [nearest] : [];\n  }\n  const extraEdges = joins.map(\n    (n, i): NavEdge => ({\n      id: `@${tag}-${i}`,\n      kind: 'walk',\n      aId: here.id,\n      bId: n.id,\n      weight: distance(end.position, n.position),\n    }),\n  );\n  return {\n    place: {\n      id: `@${tag}`,\n      kind: 'poi',\n      name: end.name ?? 'Where you are',\n      floorId: end.floorId,\n      position: end.position,\n    },\n    anchors: [{ node: here, cost: 0 }],\n    extraNodes: [here],\n    extraEdges,\n  };\n}\n\n/** Shortest route between two ends — objects (rooms, doors, POIs, …) or points on a floor — over\n *  the authored graph, with human step instructions. Returns null when either end has no anchor or\n *  no path exists. */\nexport interface RouteOptions {\n  statuses?: ReadonlyMap<string, StatusReading>;\n}\nexport function findRoute(\n  p: ProjectDocument,\n  fromEnd: RouteEnd,\n  toEnd: RouteEnd,\n  options: RouteOptions = {},\n): Route | null {\n  const start = routeEnd(p, fromEnd, 'from'),\n    end = routeEnd(p, toEnd, 'to');\n  if (!start || !end) return null;\n  const from = start.place,\n    to = end.place;\n  const starts = start.anchors,\n    goals = end.anchors;\n  if (!starts.length || !goals.length) return null;\n  const nodes = [...navNodes(p), ...start.extraNodes, ...end.extraNodes],\n    byId = new Map(nodes.map(n => [n.id, n]));\n  const adjacency = new Map<string, { edge: NavEdge; other: NavNode }[]>();\n  for (const e of [...navEdges(p), ...start.extraEdges, ...end.extraEdges]) {\n    const a = byId.get(e.aId),\n      b = byId.get(e.bId);\n    if (!a || !b) continue;\n    const machine =\n      e.kind === 'stairs' && e.objectId\n        ? p.objects.find(o => o.id === e.objectId && o.stairModel === 'escalator')\n        : undefined;\n    const reading = machine?.feedId ? options.statuses?.get(machine.feedId) : undefined;\n    if (machine && (reading?.travel || reading?.running === false)) {\n      const up = elevation(p, b.floorId) > elevation(p, a.floorId);\n      const forward = (reading.travel ?? machine.travel ?? 'up') === (up ? 'up' : 'down');\n      if (reading.running === false || forward)\n        (adjacency.get(a.id) ?? adjacency.set(a.id, []).get(a.id)!).push({ edge: e, other: b });\n      if (reading.running === false || !forward)\n        (adjacency.get(b.id) ?? adjacency.set(b.id, []).get(b.id)!).push({ edge: e, other: a });\n      continue;\n    }\n    (adjacency.get(a.id) ?? adjacency.set(a.id, []).get(a.id)!).push({ edge: e, other: b });\n    // A directed edge is passable one way only — an escalator, or a door you cannot come back\n    // through. Adding the return leg anyway is how a one-way route quietly becomes a round trip.\n    if (!e.directed) (adjacency.get(b.id) ?? adjacency.set(b.id, []).get(b.id)!).push({ edge: e, other: a });\n  }\n  const queue = new RouteQueue();\n  const dist = new Map<string, number>(),\n    prev = new Map<string, { node: NavNode; edge: NavEdge }>(),\n    done = new Set<string>();\n  for (const s of starts)\n    if (s.cost < (dist.get(s.node.id) ?? Infinity)) {\n      dist.set(s.node.id, s.cost);\n      queue.push(s.node.id, s.cost);\n    }\n  const goalCosts = new Map(goals.map(g => [g.node.id, g.cost]));\n  let bestGoal = Infinity;\n  for (;;) {\n    // A visibility graph can have thousands of nodes. A heap and an admissible goal bound avoid\n    // rescanning every reached node and searching the rest of the building after arrival is known.\n    const entry = queue.pop();\n    if (!entry || entry.cost > bestGoal) break;\n    const { id: current, cost: best } = entry;\n    if (done.has(current)) continue;\n    done.add(current);\n    if (goalCosts.has(current)) bestGoal = Math.min(bestGoal, best + goalCosts.get(current)!);\n    const node = byId.get(current)!;\n    for (const { edge, other } of adjacency.get(current) ?? []) {\n      const next = best + edgeCost(p, edge, node, other);\n      if (next < (dist.get(other.id) ?? Infinity)) {\n        dist.set(other.id, next);\n        prev.set(other.id, { node, edge });\n        queue.push(other.id, next);\n      }\n    }\n  }\n  const goal = goals\n    .map(g => ({ ...g, total: (dist.get(g.node.id) ?? Infinity) + g.cost }))\n    .sort((a, b) => a.total - b.total)[0];\n  if (!goal || !Number.isFinite(goal.total)) return null;\n  const legs: RouteLeg[] = [];\n  for (let at = goal.node; ; ) {\n    const back = prev.get(at.id);\n    if (!back) break;\n    legs.unshift({ edge: back.edge, from: back.node, to: at, cost: edgeCost(p, back.edge, back.node, at) });\n    at = back.node;\n  }\n  const path = [legs.length ? legs[0].from : goal.node, ...legs.map(l => l.to)];\n  const walked = legs.reduce((sum, l) => sum + edgeLength(p, l.edge, l.from, l.to), 0);\n  return {\n    from,\n    to,\n    nodes: path,\n    legs,\n    steps: routeSteps(p, from, to, path, legs),\n    distance: walked,\n    cost: goal.total,\n  };\n}\n\n/** Stable min-heap: equal-cost paths keep insertion order, so a regenerated plan routes identically. */\nclass RouteQueue {\n  private items: { id: string; cost: number; order: number }[] = [];\n  private order = 0;\n  private before(a: (typeof this.items)[number], b: (typeof this.items)[number]) {\n    return a.cost < b.cost || (a.cost === b.cost && a.order < b.order);\n  }\n  push(id: string, cost: number) {\n    const item = { id, cost, order: this.order++ };\n    let i = this.items.length;\n    this.items.push(item);\n    while (i > 0) {\n      const parent = (i - 1) >> 1;\n      if (!this.before(item, this.items[parent])) break;\n      this.items[i] = this.items[parent];\n      i = parent;\n    }\n    this.items[i] = item;\n  }\n  pop() {\n    const first = this.items[0],\n      last = this.items.pop();\n    if (this.items.length && last) {\n      let i = 0;\n      while (i * 2 + 1 < this.items.length) {\n        let child = i * 2 + 1;\n        if (child + 1 < this.items.length && this.before(this.items[child + 1], this.items[child])) child++;\n        if (!this.before(this.items[child], last)) break;\n        this.items[i] = this.items[child];\n        i = child;\n      }\n      this.items[i] = last;\n    }\n    return first;\n  }\n}\n\n// ——— Step instructions.\n/** Human name of a level: \"Menswear & denim (level 3)\" via Floor.code, \"outside\" for the site level. */\nexport function floorPhrase(p: ProjectDocument, floorId: string | null): string {\n  const floor = floorOf(p, floorId);\n  return !floor ? 'outside' : floor.code ? `${floor.name} (level ${floor.code})` : floor.name;\n}\nconst legName = (p: ProjectDocument, leg: RouteLeg, fallback: string) =>\n  p.objects.find(o => o.id === leg.edge.objectId)?.name ?? fallback;\n/** Build the human step list: walking grouped per floor, vertical rides merged per lift/stair name, doors called out — \"Exit through Aleksanterinkatu entrance\", \"Take Lift A to Offices · buying & admin (level 8)\". */\nexport function routeSteps(\n  p: ProjectDocument,\n  from: RoutePlace,\n  to: RoutePlace,\n  path: NavNode[],\n  legs: RouteLeg[],\n): RouteStep[] {\n  const steps: RouteStep[] = [\n    {\n      kind: 'depart',\n      text: `Start at ${from.name}${from.floorId !== null ? ` on ${floorPhrase(p, from.floorId)}` : ''}`,\n      floorId: from.floorId,\n      nodeIds: path.length ? [path[0].id] : [],\n    },\n  ];\n  for (let i = 0; i < legs.length; i++) {\n    const leg = legs[i];\n    if (leg.edge.kind === 'walk') {\n      // Fold consecutive walk legs on one floor into a single stride.\n      let d = edgeLength(p, leg.edge, leg.from, leg.to);\n      const nodeIds = [leg.from.id, leg.to.id];\n      while (i + 1 < legs.length && legs[i + 1].edge.kind === 'walk') {\n        i++;\n        d += edgeLength(p, legs[i].edge, legs[i].from, legs[i].to);\n        nodeIds.push(legs[i].to.id);\n      }\n      steps.push({\n        kind: 'walk',\n        text: `Walk ${Math.max(1, Math.round(d))} m ${legs[i].to.floorId === null ? 'outside' : `along ${floorPhrase(p, leg.from.floorId)}`}`,\n        floorId: leg.from.floorId,\n        nodeIds,\n        distance: d,\n      });\n    } else if (leg.edge.kind === 'door') {\n      const name = legName(p, leg, 'the door');\n      const text =\n        leg.to.floorId === null && leg.from.floorId !== null\n          ? `Exit through ${name}`\n          : leg.from.floorId === null && leg.to.floorId !== null\n            ? `Enter through ${name}`\n            : `Go through ${name}`;\n      steps.push({\n        kind: 'door',\n        text,\n        floorId: leg.to.floorId,\n        nodeIds: [leg.from.id, leg.to.id],\n        objectId: leg.edge.objectId,\n        distance: edgeLength(p, leg.edge, leg.from, leg.to),\n      });\n    } else {\n      // Merge a consecutive vertical ride on the same lift/stair name into one instruction.\n      const kind = leg.edge.kind,\n        name = legName(p, leg, kind === 'elevator' ? 'the lift' : 'the stairs');\n      const nodeIds = [leg.from.id, leg.to.id];\n      const start = leg.from;\n      let end = leg.to;\n      let objectId = leg.edge.objectId;\n      while (i + 1 < legs.length && legs[i + 1].edge.kind === kind && legName(p, legs[i + 1], name) === name) {\n        i++;\n        end = legs[i].to;\n        nodeIds.push(end.id);\n        objectId = legs[i].edge.objectId ?? objectId;\n      }\n      const rise = elevation(p, end.floorId) - elevation(p, start.floorId);\n      const direction = kind === 'stairs' && !/\\b(up|down)\\b/i.test(name) ? `${rise > 0 ? 'up ' : 'down '}` : '';\n      steps.push({\n        kind,\n        text: `Take ${name} ${direction}to ${floorPhrase(p, end.floorId)}`,\n        floorId: end.floorId,\n        nodeIds,\n        objectId,\n      });\n    }\n  }\n  steps.push({\n    kind: 'arrive',\n    text: `Arrive at ${to.name}`,\n    floorId: to.floorId,\n    nodeIds: path.length ? [path[path.length - 1].id] : [],\n  });\n  return steps;\n}\n"],"names":["ELEVATOR_BASE","ELEVATOR_PER_METRE","STAIR_CLIMB_FACTOR","DOOR_COST","NAV_WELD","navNodes","p","topology","navEdges","floorOf","id","f","elevation","_a","addNavNode","floorId","position","objectId","existing","n","distance","node","uid","addNavEdge","kind","a","b","e","edge","navPath","points","out","pt","i","chainVertical","object","travel","floors","servedFloors","key","shaftKey","twins","o","twin","t","objectPosition","j","from","to","HERE","edgeCost","run","rise","edgeLength","routeAnchors","bound","anchor","sameFloor","inside","pointInRing","h","nearest","routeEnd","end","tag","here","space","spaceAt","clear","routeClearance","joins","inSpace","extraEdges","findRoute","fromEnd","toEnd","options","start","starts","goals","nodes","byId","adjacency","machine","reading","up","forward","queue","RouteQueue","dist","prev","done","s","goalCosts","g","bestGoal","entry","current","best","other","next","goal","legs","at","back","path","l","walked","sum","routeSteps","__publicField","cost","item","parent","first","last","child","floorPhrase","floor","legName","leg","fallback","steps","d","nodeIds","name","text","direction"],"mappings":";;;;;;;;;AAgBO,MAAMA,KAAgB,IAC3BC,KAAqB,GACrBC,KAAqB,GACrBC,KAAY,KAEDC,KAAW,MAKXC,IAAW,CAACC,MAAkCA,EAAE,YAAYC,EAASD,CAAC,EAAE,OACxEE,KAAW,CAACF,MAAkCA,EAAE,YAAYC,EAASD,CAAC,EAAE,OAC/EG,IAAU,CAACH,GAAoBI,MACnCA,MAAO,OAAO,OAAQJ,EAAE,OAAO,KAAK,CAAAK,MAAKA,EAAE,OAAOD,CAAE,KAAK,MACrDE,IAAY,CAACN,GAAoBI,MAAA;;AAAsB,WAAAG,IAAAJ,EAAQH,GAAGI,CAAE,MAAb,gBAAAG,EAAgB,cAAa;AAAA;AAKnF,SAASC,EAAWR,GAAoBS,GAAwBC,GAAiBC,GAA4B;AAClH,EAAAX,EAAE,aAAFA,EAAE,WAAa,CAAA;AACf,QAAMY,IAAWZ,EAAE,SAAS,KAAK,CAAAa,MAAKA,EAAE,YAAYJ,KAAWK,EAASD,EAAE,UAAUH,CAAQ,IAAIZ,EAAQ;AACxG,MAAIc;AACF,WAAID,KAAY,CAACC,EAAS,eAAmB,WAAWD,IACjDC;AAET,QAAMG,IAAgB,EAAE,IAAIC,EAAA,GAAO,SAAAP,GAAS,UAAU,CAACC,EAAS,CAAC,GAAGA,EAAS,CAAC,CAAC,EAAA;AAC/E,SAAIC,QAAe,WAAWA,IAC9BX,EAAE,SAAS,KAAKe,CAAI,GACbA;AACT;AAEO,SAASE,EAAWjB,GAAoBkB,GAAmBC,GAAYC,GAAYT,GAA4B;AACpH,EAAAX,EAAE,aAAFA,EAAE,WAAa,CAAA;AACf,QAAMY,IAAWZ,EAAE,SAAS;AAAA,IAC1B,OAAKqB,EAAE,SAASH,MAAUG,EAAE,QAAQF,EAAE,MAAME,EAAE,QAAQD,EAAE,MAAQC,EAAE,QAAQD,EAAE,MAAMC,EAAE,QAAQF,EAAE;AAAA,EAAA;AAEhG,MAAIP;AACF,WAAID,KAAY,CAACC,EAAS,eAAmB,WAAWD,IACjDC;AAET,QAAMU,IAAgB,EAAE,IAAIN,EAAA,GAAO,MAAAE,GAAM,KAAKC,EAAE,IAAI,KAAKC,EAAE,GAAA;AAC3D,SAAIT,QAAe,WAAWA,IAC9BX,EAAE,SAAS,KAAKsB,CAAI,GACbA;AACT;AAEO,SAASC,GAAQvB,GAAoBS,GAAwBe,GAA4B;AAC9F,QAAMC,IAAMD,EAAO,IAAI,CAAAE,MAAMlB,EAAWR,GAAGS,GAASiB,CAAE,CAAC;AACvD,WAASC,IAAI,GAAGA,IAAIF,EAAI,QAAQE,IAAK,CAAIF,EAAIE,IAAI,CAAC,EAAE,OAAOF,EAAIE,CAAC,EAAE,MAAIV,EAAWjB,GAAG,QAAQyB,EAAIE,IAAI,CAAC,GAAGF,EAAIE,CAAC,CAAC;AAC9G,SAAOF;AACT;AAEO,SAASG,GAAc5B,GAAoB6B,GAA+B;AAC/E,QAAMX,IAAoBW,EAAO,SAAS,aAAa,aAAa,UAG9DC,IAASD,EAAO,eAAe,cAAeA,EAAO,UAAU,OAAQ,MACvEE,IAASC,EAAahC,GAAG6B,CAAM,GAC/BI,IAAMC,EAASL,CAAM,GACrBM,wBAAY,IAAA;AAClB,aAAWC,KAAKpC,EAAE;AAChB,IAAIoC,EAAE,SAASP,EAAO,QAAQK,EAASE,CAAC,MAAMH,KAAO,CAACE,EAAM,IAAIC,EAAE,OAAO,OAAS,IAAIA,EAAE,SAASA,CAAC;AACpG,QAAMC,IAAO,CAAC5B,MAAoB0B,EAAM,IAAI1B,CAAO,KAAKoB,GAClDJ,IAAMM,EAAO,IAAI,CAAA1B,MAAK;AAC1B,UAAMiC,IAAID,EAAKhC,EAAE,EAAE;AACnB,WAAOG,EAAWR,GAAGK,EAAE,IAAIkC,EAAevC,GAAGsC,CAAC,GAAGA,EAAE,EAAE;AAAA,EACvD,CAAC;AACD,WAASX,IAAI,GAAGA,IAAIF,EAAI,QAAQE;AAC9B,aAASa,IAAItB,MAAS,aAAa,IAAIS,IAAI,GAAGa,IAAIb,GAAGa,KAAK;AACxD,UAAIf,EAAIe,CAAC,EAAE,OAAOf,EAAIE,CAAC,EAAE,GAAI;AAG7B,YAAM,CAACc,GAAMC,CAAE,IAAIZ,MAAW,SAAS,CAACL,EAAIE,CAAC,GAAGF,EAAIe,CAAC,CAAC,IAAI,CAACf,EAAIe,CAAC,GAAGf,EAAIE,CAAC,CAAC,GACnEL,IAAOL,EAAWjB,GAAGkB,GAAMuB,GAAMC,GAAIL,EAAKZ,EAAIE,CAAC,EAAE,OAAQ,EAAE,EAAE;AACnE,MAAIG,QAAa,WAAW;AAAA,IAC9B;AACF,SAAOL;AACT;AAwBO,MAAMkB,KAAO;AAYb,SAASC,EAAS5C,GAAoBsB,GAAeH,GAAYC,GAAoB;AAC1F,MAAIE,EAAK,WAAW,OAAW,QAAOA,EAAK;AAC3C,QAAMuB,IAAM/B,EAASK,EAAE,UAAUC,EAAE,QAAQ,GACzC0B,IAAO,KAAK,IAAIxC,EAAUN,GAAGmB,EAAE,OAAO,IAAIb,EAAUN,GAAGoB,EAAE,OAAO,CAAC;AACnE,SAAIE,EAAK,SAAS,aAAmB5B,KAAgBoD,IAAOnD,KACxD2B,EAAK,SAAS,WAAiBuB,IAAMC,IAAOlD,KACzCiD,KAAOvB,EAAK,SAAS,SAASzB,KAAY;AACnD;AAEO,SAASkD,EAAW/C,GAAoBsB,GAAeH,GAAYC,GAAoB;AAC5F,QAAM0B,IACJxB,EAAK,SAAS,YAAYA,EAAK,SAAS,aACpC,KAAK,IAAIhB,EAAUN,GAAGmB,EAAE,OAAO,IAAIb,EAAUN,GAAGoB,EAAE,OAAO,CAAC,IAC1D;AACN,SAAON,EAASK,EAAE,UAAUC,EAAE,QAAQ,IAAI0B;AAC5C;AAGO,SAASE,GAAahD,GAAoB6B,GAAuD;AACtG,QAAMoB,IAAQlD,EAASC,CAAC,EAAE,OAAO,CAAAa,MAAKA,EAAE,aAAagB,EAAO,EAAE;AAC9D,MAAIoB,EAAM,OAAQ,QAAOA,EAAM,IAAI,QAAS,EAAE,MAAAlC,GAAM,MAAM,EAAA,EAAI;AAC9D,QAAMmC,IAASX,EAAevC,GAAG6B,CAAM,GACjCsB,IAAYpD,EAASC,CAAC,EAAE,OAAO,CAAAa,MAAKA,EAAE,YAAYgB,EAAO,OAAO,GAChEuB,IAASvB,EAAO,QAClBsB,EAAU;AAAA,IACR,CAAAtC,MAAKwC,EAAYxC,EAAE,UAAUgB,EAAO,MAAO,CAAC,CAAC,KAAK,CAACA,EAAO,MAAO,MAAM,CAAC,EAAE,KAAK,OAAKwB,EAAYxC,EAAE,UAAUyC,CAAC,CAAC;AAAA,EAAA,IAEhH,CAAA;AACJ,MAAIF,EAAO,OAAQ,QAAOA,EAAO,IAAI,CAAArC,OAAS,EAAE,MAAAA,GAAM,MAAMD,EAASoC,GAAQnC,EAAK,QAAQ,IAAI;AAC9F,QAAMwC,IAAUJ,EACb,IAAI,CAAApC,OAAS,EAAE,MAAAA,GAAM,MAAMD,EAASoC,GAAQnC,EAAK,QAAQ,IAAI,EAC7D,KAAK,CAACI,GAAGC,MAAMD,EAAE,OAAOC,EAAE,IAAI,EAAE,CAAC;AACpC,SAAOmC,IAAU,CAACA,CAAO,IAAI,CAAA;AAC/B;AAQA,SAASC,EACPxD,GACAyD,GACAC,GAMO;AACP,MAAI,OAAOD,KAAQ,UAAU;AAC3B,UAAM5B,IAAS7B,EAAE,QAAQ,KAAK,CAAAoC,MAAKA,EAAE,OAAOqB,CAAG;AAC/C,WAAO5B,IAAS,EAAE,OAAOA,GAAQ,SAASmB,GAAahD,GAAG6B,CAAM,GAAG,YAAY,CAAA,GAAI,YAAY,CAAA,MAAO;AAAA,EACxG;AACA,QAAM8B,IAAgB,EAAE,IAAI,IAAID,CAAG,IAAI,SAASD,EAAI,SAAS,UAAUA,EAAI,SAAA,GACrEN,IAAYpD,EAASC,CAAC,EAAE,OAAO,CAAAa,MAAKA,EAAE,YAAY4C,EAAI,OAAO,GAC7DG,IAAQC,EAAQ7D,GAAGyD,EAAI,SAASA,EAAI,QAAQ,GAC5CK,IAAQC,EAAe/D,CAAC,EAAEyD,EAAI,OAAO;AAC3C,MAAIO,IAAQJ,IAAQT,EAAU,OAAO,CAAAtC,MAAKoD,EAAQL,GAAO/C,EAAE,QAAQ,KAAKiD,EAAML,EAAI,UAAU5C,EAAE,QAAQ,CAAC,IAAI,CAAA;AAC3G,MAAI,CAAC+C,GAAO;AACV,UAAML,IAAUJ,EACb,OAAO,CAAAtC,MAAKiD,EAAML,EAAI,UAAU5C,EAAE,QAAQ,CAAC,EAC3C,KAAK,CAACM,GAAGC,MAAMN,EAASK,EAAE,UAAUsC,EAAI,QAAQ,IAAI3C,EAASM,EAAE,UAAUqC,EAAI,QAAQ,CAAC,EAAE,CAAC;AAC5F,IAAAO,IAAQT,IAAU,CAACA,CAAO,IAAI,CAAA;AAAA,EAChC;AACA,QAAMW,IAAaF,EAAM;AAAA,IACvB,CAACnD,GAAGc,OAAgB;AAAA,MAClB,IAAI,IAAI+B,CAAG,IAAI/B,CAAC;AAAA,MAChB,MAAM;AAAA,MACN,KAAKgC,EAAK;AAAA,MACV,KAAK9C,EAAE;AAAA,MACP,QAAQC,EAAS2C,EAAI,UAAU5C,EAAE,QAAQ;AAAA,IAAA;AAAA,EAC3C;AAEF,SAAO;AAAA,IACL,OAAO;AAAA,MACL,IAAI,IAAI6C,CAAG;AAAA,MACX,MAAM;AAAA,MACN,MAAMD,EAAI,QAAQ;AAAA,MAClB,SAASA,EAAI;AAAA,MACb,UAAUA,EAAI;AAAA,IAAA;AAAA,IAEhB,SAAS,CAAC,EAAE,MAAME,GAAM,MAAM,GAAG;AAAA,IACjC,YAAY,CAACA,CAAI;AAAA,IACjB,YAAAO;AAAA,EAAA;AAEJ;AAQO,SAASC,GACdnE,GACAoE,GACAC,GACAC,IAAwB,CAAA,GACV;;AACd,QAAMC,IAAQf,EAASxD,GAAGoE,GAAS,MAAM,GACvCX,IAAMD,EAASxD,GAAGqE,GAAO,IAAI;AAC/B,MAAI,CAACE,KAAS,CAACd,EAAK,QAAO;AAC3B,QAAMhB,IAAO8B,EAAM,OACjB7B,IAAKe,EAAI,OACLe,IAASD,EAAM,SACnBE,IAAQhB,EAAI;AACd,MAAI,CAACe,EAAO,UAAU,CAACC,EAAM,OAAQ,QAAO;AAC5C,QAAMC,IAAQ,CAAC,GAAG3E,EAASC,CAAC,GAAG,GAAGuE,EAAM,YAAY,GAAGd,EAAI,UAAU,GACnEkB,IAAO,IAAI,IAAID,EAAM,IAAI,CAAA7D,MAAK,CAACA,EAAE,IAAIA,CAAC,CAAC,CAAC,GACpC+D,wBAAgB,IAAA;AACtB,aAAWvD,KAAK,CAAC,GAAGnB,GAASF,CAAC,GAAG,GAAGuE,EAAM,YAAY,GAAGd,EAAI,UAAU,GAAG;AACxE,UAAM,IAAIkB,EAAK,IAAItD,EAAE,GAAG,GACtBD,IAAIuD,EAAK,IAAItD,EAAE,GAAG;AACpB,QAAI,CAAC,KAAK,CAACD,EAAG;AACd,UAAMyD,IACJxD,EAAE,SAAS,YAAYA,EAAE,WACrBrB,EAAE,QAAQ,KAAK,CAAAoC,MAAKA,EAAE,OAAOf,EAAE,YAAYe,EAAE,eAAe,WAAW,IACvE,QACA0C,IAAUD,KAAA,QAAAA,EAAS,UAAStE,IAAA+D,EAAQ,aAAR,gBAAA/D,EAAkB,IAAIsE,EAAQ,UAAU;AAC1E,QAAIA,MAAYC,KAAA,QAAAA,EAAS,WAAUA,KAAA,gBAAAA,EAAS,aAAY,KAAQ;AAC9D,YAAMC,IAAKzE,EAAUN,GAAGoB,EAAE,OAAO,IAAId,EAAUN,GAAG,EAAE,OAAO,GACrDgF,KAAWF,EAAQ,UAAUD,EAAQ,UAAU,WAAWE,IAAK,OAAO;AAC5E,OAAID,EAAQ,YAAY,MAASE,OAC9BJ,EAAU,IAAI,EAAE,EAAE,KAAKA,EAAU,IAAI,EAAE,IAAI,CAAA,CAAE,EAAE,IAAI,EAAE,EAAE,GAAI,KAAK,EAAE,MAAMvD,GAAG,OAAOD,GAAG,IACpF0D,EAAQ,YAAY,MAAS,CAACE,OAC/BJ,EAAU,IAAIxD,EAAE,EAAE,KAAKwD,EAAU,IAAIxD,EAAE,IAAI,CAAA,CAAE,EAAE,IAAIA,EAAE,EAAE,GAAI,KAAK,EAAE,MAAMC,GAAG,OAAO,GAAG;AACxF;AAAA,IACF;AACA,KAACuD,EAAU,IAAI,EAAE,EAAE,KAAKA,EAAU,IAAI,EAAE,IAAI,CAAA,CAAE,EAAE,IAAI,EAAE,EAAE,GAAI,KAAK,EAAE,MAAMvD,GAAG,OAAOD,GAAG,GAGjFC,EAAE,aAAWuD,EAAU,IAAIxD,EAAE,EAAE,KAAKwD,EAAU,IAAIxD,EAAE,IAAI,CAAA,CAAE,EAAE,IAAIA,EAAE,EAAE,GAAI,KAAK,EAAE,MAAMC,GAAG,OAAO,EAAA,CAAG;AAAA,EACzG;AACA,QAAM4D,IAAQ,IAAIC,GAAA,GACZC,IAAO,oBAAI,OACfC,wBAAW,IAAA,GACXC,IAAO,oBAAI,IAAA;AACb,aAAWC,KAAKd;AACd,IAAIc,EAAE,QAAQH,EAAK,IAAIG,EAAE,KAAK,EAAE,KAAK,WACnCH,EAAK,IAAIG,EAAE,KAAK,IAAIA,EAAE,IAAI,GAC1BL,EAAM,KAAKK,EAAE,KAAK,IAAIA,EAAE,IAAI;AAEhC,QAAMC,IAAY,IAAI,IAAId,EAAM,IAAI,CAAAe,MAAK,CAACA,EAAE,KAAK,IAAIA,EAAE,IAAI,CAAC,CAAC;AAC7D,MAAIC,IAAW;AACf,aAAS;AAGP,UAAMC,IAAQT,EAAM,IAAA;AACpB,QAAI,CAACS,KAASA,EAAM,OAAOD,EAAU;AACrC,UAAM,EAAE,IAAIE,GAAS,MAAMC,MAASF;AACpC,QAAIL,EAAK,IAAIM,CAAO,EAAG;AACvB,IAAAN,EAAK,IAAIM,CAAO,GACZJ,EAAU,IAAII,CAAO,MAAGF,IAAW,KAAK,IAAIA,GAAUG,IAAOL,EAAU,IAAII,CAAO,CAAE;AACxF,UAAM5E,IAAO4D,EAAK,IAAIgB,CAAO;AAC7B,eAAW,EAAE,MAAArE,GAAM,OAAAuE,EAAA,KAAWjB,EAAU,IAAIe,CAAO,KAAK,IAAI;AAC1D,YAAMG,IAAOF,IAAOhD,EAAS5C,GAAGsB,GAAMP,GAAM8E,CAAK;AACjD,MAAIC,KAAQX,EAAK,IAAIU,EAAM,EAAE,KAAK,WAChCV,EAAK,IAAIU,EAAM,IAAIC,CAAI,GACvBV,EAAK,IAAIS,EAAM,IAAI,EAAE,MAAA9E,GAAM,MAAAO,GAAM,GACjC2D,EAAM,KAAKY,EAAM,IAAIC,CAAI;AAAA,IAE7B;AAAA,EACF;AACA,QAAMC,IAAOtB,EACV,IAAI,CAAAe,OAAM,EAAE,GAAGA,GAAG,QAAQL,EAAK,IAAIK,EAAE,KAAK,EAAE,KAAK,SAAYA,EAAE,KAAA,EAAO,EACtE,KAAK,CAACrE,GAAGC,MAAMD,EAAE,QAAQC,EAAE,KAAK,EAAE,CAAC;AACtC,MAAI,CAAC2E,KAAQ,CAAC,OAAO,SAASA,EAAK,KAAK,EAAG,QAAO;AAClD,QAAMC,IAAmB,CAAA;AACzB,WAASC,IAAKF,EAAK,UAAU;AAC3B,UAAMG,IAAOd,EAAK,IAAIa,EAAG,EAAE;AAC3B,QAAI,CAACC,EAAM;AACX,IAAAF,EAAK,QAAQ,EAAE,MAAME,EAAK,MAAM,MAAMA,EAAK,MAAM,IAAID,GAAI,MAAMrD,EAAS5C,GAAGkG,EAAK,MAAMA,EAAK,MAAMD,CAAE,GAAG,GACtGA,IAAKC,EAAK;AAAA,EACZ;AACA,QAAMC,IAAO,CAACH,EAAK,SAASA,EAAK,CAAC,EAAE,OAAOD,EAAK,MAAM,GAAGC,EAAK,IAAI,CAAAI,MAAKA,EAAE,EAAE,CAAC,GACtEC,IAASL,EAAK,OAAO,CAACM,GAAKF,MAAME,IAAMvD,EAAW/C,GAAGoG,EAAE,MAAMA,EAAE,MAAMA,EAAE,EAAE,GAAG,CAAC;AACnF,SAAO;AAAA,IACL,MAAA3D;AAAA,IACA,IAAAC;AAAA,IACA,OAAOyD;AAAA,IACP,MAAAH;AAAA,IACA,OAAOO,GAAWvG,GAAGyC,GAAMC,GAAIyD,GAAMH,CAAI;AAAA,IACzC,UAAUK;AAAA,IACV,MAAMN,EAAK;AAAA,EAAA;AAEf;AAGA,MAAMb,GAAW;AAAA,EAAjB;AACU,IAAAsB,EAAA,eAAuD,CAAA;AACvD,IAAAA,EAAA,eAAQ;AAAA;AAAA,EACR,OAAOrF,GAAgCC,GAAgC;AAC7E,WAAOD,EAAE,OAAOC,EAAE,QAASD,EAAE,SAASC,EAAE,QAAQD,EAAE,QAAQC,EAAE;AAAA,EAC9D;AAAA,EACA,KAAKhB,GAAYqG,GAAc;AAC7B,UAAMC,IAAO,EAAE,IAAAtG,GAAI,MAAAqG,GAAM,OAAO,KAAK,QAAA;AACrC,QAAI9E,IAAI,KAAK,MAAM;AAEnB,SADA,KAAK,MAAM,KAAK+E,CAAI,GACb/E,IAAI,KAAG;AACZ,YAAMgF,IAAUhF,IAAI,KAAM;AAC1B,UAAI,CAAC,KAAK,OAAO+E,GAAM,KAAK,MAAMC,CAAM,CAAC,EAAG;AAC5C,WAAK,MAAMhF,CAAC,IAAI,KAAK,MAAMgF,CAAM,GACjChF,IAAIgF;AAAA,IACN;AACA,SAAK,MAAMhF,CAAC,IAAI+E;AAAA,EAClB;AAAA,EACA,MAAM;AACJ,UAAME,IAAQ,KAAK,MAAM,CAAC,GACxBC,IAAO,KAAK,MAAM,IAAA;AACpB,QAAI,KAAK,MAAM,UAAUA,GAAM;AAC7B,UAAIlF,IAAI;AACR,aAAOA,IAAI,IAAI,IAAI,KAAK,MAAM,UAAQ;AACpC,YAAImF,IAAQnF,IAAI,IAAI;AAEpB,YADImF,IAAQ,IAAI,KAAK,MAAM,UAAU,KAAK,OAAO,KAAK,MAAMA,IAAQ,CAAC,GAAG,KAAK,MAAMA,CAAK,CAAC,KAAGA,KACxF,CAAC,KAAK,OAAO,KAAK,MAAMA,CAAK,GAAGD,CAAI,EAAG;AAC3C,aAAK,MAAMlF,CAAC,IAAI,KAAK,MAAMmF,CAAK,GAChCnF,IAAImF;AAAA,MACN;AACA,WAAK,MAAMnF,CAAC,IAAIkF;AAAA,IAClB;AACA,WAAOD;AAAA,EACT;AACF;AAIO,SAASG,EAAY/G,GAAoBS,GAAgC;AAC9E,QAAMuG,IAAQ7G,EAAQH,GAAGS,CAAO;AAChC,SAAQuG,IAAoBA,EAAM,OAAO,GAAGA,EAAM,IAAI,WAAWA,EAAM,IAAI,MAAMA,EAAM,OAAvE;AAClB;AACA,MAAMC,IAAU,CAACjH,GAAoBkH,GAAeC;;AAClD,WAAA5G,IAAAP,EAAE,QAAQ,KAAK,CAAAoC,MAAKA,EAAE,OAAO8E,EAAI,KAAK,QAAQ,MAA9C,gBAAA3G,EAAiD,SAAQ4G;AAAA;AAEpD,SAASZ,GACdvG,GACAyC,GACAC,GACAyD,GACAH,GACa;AACb,QAAMoB,IAAqB;AAAA,IACzB;AAAA,MACE,MAAM;AAAA,MACN,MAAM,YAAY3E,EAAK,IAAI,GAAGA,EAAK,YAAY,OAAO,OAAOsE,EAAY/G,GAAGyC,EAAK,OAAO,CAAC,KAAK,EAAE;AAAA,MAChG,SAASA,EAAK;AAAA,MACd,SAAS0D,EAAK,SAAS,CAACA,EAAK,CAAC,EAAE,EAAE,IAAI,CAAA;AAAA,IAAC;AAAA,EACzC;AAEF,WAASxE,IAAI,GAAGA,IAAIqE,EAAK,QAAQrE,KAAK;AACpC,UAAMuF,IAAMlB,EAAKrE,CAAC;AAClB,QAAIuF,EAAI,KAAK,SAAS,QAAQ;AAE5B,UAAIG,IAAItE,EAAW/C,GAAGkH,EAAI,MAAMA,EAAI,MAAMA,EAAI,EAAE;AAChD,YAAMI,IAAU,CAACJ,EAAI,KAAK,IAAIA,EAAI,GAAG,EAAE;AACvC,aAAOvF,IAAI,IAAIqE,EAAK,UAAUA,EAAKrE,IAAI,CAAC,EAAE,KAAK,SAAS;AACtD,QAAAA,KACA0F,KAAKtE,EAAW/C,GAAGgG,EAAKrE,CAAC,EAAE,MAAMqE,EAAKrE,CAAC,EAAE,MAAMqE,EAAKrE,CAAC,EAAE,EAAE,GACzD2F,EAAQ,KAAKtB,EAAKrE,CAAC,EAAE,GAAG,EAAE;AAE5B,MAAAyF,EAAM,KAAK;AAAA,QACT,MAAM;AAAA,QACN,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAMC,CAAC,CAAC,CAAC,MAAMrB,EAAKrE,CAAC,EAAE,GAAG,YAAY,OAAO,YAAY,SAASoF,EAAY/G,GAAGkH,EAAI,KAAK,OAAO,CAAC,EAAE;AAAA,QACnI,SAASA,EAAI,KAAK;AAAA,QAClB,SAAAI;AAAA,QACA,UAAUD;AAAA,MAAA,CACX;AAAA,IACH,WAAWH,EAAI,KAAK,SAAS,QAAQ;AACnC,YAAMK,IAAON,EAAQjH,GAAGkH,GAAK,UAAU,GACjCM,IACJN,EAAI,GAAG,YAAY,QAAQA,EAAI,KAAK,YAAY,OAC5C,gBAAgBK,CAAI,KACpBL,EAAI,KAAK,YAAY,QAAQA,EAAI,GAAG,YAAY,OAC9C,iBAAiBK,CAAI,KACrB,cAAcA,CAAI;AAC1B,MAAAH,EAAM,KAAK;AAAA,QACT,MAAM;AAAA,QACN,MAAAI;AAAA,QACA,SAASN,EAAI,GAAG;AAAA,QAChB,SAAS,CAACA,EAAI,KAAK,IAAIA,EAAI,GAAG,EAAE;AAAA,QAChC,UAAUA,EAAI,KAAK;AAAA,QACnB,UAAUnE,EAAW/C,GAAGkH,EAAI,MAAMA,EAAI,MAAMA,EAAI,EAAE;AAAA,MAAA,CACnD;AAAA,IACH,OAAO;AAEL,YAAMhG,IAAOgG,EAAI,KAAK,MACpBK,IAAON,EAAQjH,GAAGkH,GAAKhG,MAAS,aAAa,aAAa,YAAY,GAClEoG,IAAU,CAACJ,EAAI,KAAK,IAAIA,EAAI,GAAG,EAAE,GACjC3C,IAAQ2C,EAAI;AAClB,UAAIzD,IAAMyD,EAAI,IACVvG,IAAWuG,EAAI,KAAK;AACxB,aAAOvF,IAAI,IAAIqE,EAAK,UAAUA,EAAKrE,IAAI,CAAC,EAAE,KAAK,SAAST,KAAQ+F,EAAQjH,GAAGgG,EAAKrE,IAAI,CAAC,GAAG4F,CAAI,MAAMA;AAChG,QAAA5F,KACA8B,IAAMuC,EAAKrE,CAAC,EAAE,IACd2F,EAAQ,KAAK7D,EAAI,EAAE,GACnB9C,IAAWqF,EAAKrE,CAAC,EAAE,KAAK,YAAYhB;AAEtC,YAAMmC,IAAOxC,EAAUN,GAAGyD,EAAI,OAAO,IAAInD,EAAUN,GAAGuE,EAAM,OAAO,GAC7DkD,IAAYvG,MAAS,YAAY,CAAC,iBAAiB,KAAKqG,CAAI,IAAI,GAAGzE,IAAO,IAAI,QAAQ,OAAO,KAAK;AACxG,MAAAsE,EAAM,KAAK;AAAA,QACT,MAAAlG;AAAA,QACA,MAAM,QAAQqG,CAAI,IAAIE,CAAS,MAAMV,EAAY/G,GAAGyD,EAAI,OAAO,CAAC;AAAA,QAChE,SAASA,EAAI;AAAA,QACb,SAAA6D;AAAA,QACA,UAAA3G;AAAA,MAAA,CACD;AAAA,IACH;AAAA,EACF;AACA,SAAAyG,EAAM,KAAK;AAAA,IACT,MAAM;AAAA,IACN,MAAM,aAAa1E,EAAG,IAAI;AAAA,IAC1B,SAASA,EAAG;AAAA,IACZ,SAASyD,EAAK,SAAS,CAACA,EAAKA,EAAK,SAAS,CAAC,EAAE,EAAE,IAAI,CAAA;AAAA,EAAC,CACtD,GACMiB;AACT;"}

package/dist/model/ontology.js

@@ -0,0 +1,109 @@
+import { uid as m, isSpace as h } from "./types.js";
+import { effectivePortals as l } from "./portals.js";
+function Z(n, i) {
+  const e = n.passage ?? "both";
+  return e === "none" ? null : n.b === i && e !== "b-to-a" ? "a-to-b" : n.a === i && e !== "a-to-b" ? "b-to-a" : null;
+}
+const u = (n, i, e = /* @__PURE__ */ new Set()) => {
+  var s;
+  if (e.has(i.id)) return /* @__PURE__ */ new Set();
+  e.add(i.id);
+  const o = new Set(i.spaceIds);
+  for (const t of i.childZoneIds ?? []) {
+    const d = (s = n.zones) == null ? void 0 : s.find((a) => a.id === t);
+    if (d) for (const a of u(n, d, e)) o.add(a);
+  }
+  return o;
+}, w = (n, i) => [...u(n, i)];
+function z(n, i) {
+  const e = u(n, i);
+  return l(n).filter((o) => e.has(o.a) !== e.has(o.b));
+}
+function g(n, i) {
+  const e = u(n, i);
+  return l(n).filter((o) => e.has(o.a) && e.has(o.b));
+}
+function G(n, i, e, o) {
+  const s = {
+    id: m(),
+    name: i,
+    spaceIds: [...new Set(e)].filter((t) => n.objects.some((d) => d.id === t && h(d.kind)))
+  };
+  return o && (s.purpose = o), (n.zones ?? (n.zones = [])).push(s), s;
+}
+function v(n, i) {
+  var e;
+  n.zones = (n.zones ?? []).filter((o) => o.id !== i);
+  for (const o of n.zones)
+    (e = o.childZoneIds) != null && e.includes(i) && (o.childZoneIds = o.childZoneIds.filter((s) => s !== i));
+}
+function P(n, i, e, o) {
+  var a;
+  const s = (a = n.zones) == null ? void 0 : a.find((r) => r.id === i);
+  if (!s) return;
+  const t = e.filter((r) => n.objects.some((f) => f.id === r && h(f.kind))), d = new Set(s.spaceIds);
+  for (const r of t)
+    o ? d.add(r) : d.delete(r);
+  s.spaceIds = [...d];
+}
+function k(n, i, e) {
+  var t, d;
+  const o = (t = n.zones) == null ? void 0 : t.find((a) => a.id === i);
+  if (!o || i === e || !((d = n.zones) != null && d.some((a) => a.id === e))) return !1;
+  const s = (a, r, f = /* @__PURE__ */ new Set()) => {
+    var I, b;
+    return a === r ? !0 : f.has(a) ? !1 : (f.add(a), (((b = (I = n.zones) == null ? void 0 : I.find((c) => c.id === a)) == null ? void 0 : b.childZoneIds) ?? []).some((c) => s(c, r, f)));
+  };
+  return s(e, i) ? !1 : (o.childZoneIds = [.../* @__PURE__ */ new Set([...o.childZoneIds ?? [], e])], !0);
+}
+function x(n, i, e) {
+  n.portals = l(n);
+  const o = {
+    id: m(),
+    name: i,
+    portalIds: [...new Set(e)].filter((s) => (n.portals ?? []).some((t) => t.id === s))
+  };
+  return (n.portalGroups ?? (n.portalGroups = [])).push(o), o;
+}
+function y(n, i) {
+  n.portalGroups = (n.portalGroups ?? []).filter((e) => e.id !== i);
+}
+function M(n, i, e, o) {
+  var a;
+  const s = (a = n.portalGroups) == null ? void 0 : a.find((r) => r.id === i);
+  if (!s) return;
+  n.portals = l(n);
+  const t = e.filter((r) => (n.portals ?? []).some((f) => f.id === r)), d = new Set(s.portalIds);
+  for (const r of t)
+    o ? d.add(r) : d.delete(r);
+  s.portalIds = [...d];
+}
+function O(n) {
+  const i = new Set(n.objects.map((s) => s.id)), e = new Set(n.objects.filter((s) => h(s.kind)).map((s) => s.id));
+  n.portals && (n.portals = n.portals.filter(
+    (s) => e.has(s.a) && e.has(s.b) && (!s.openingId || i.has(s.openingId))
+  ));
+  const o = new Set((n.portals ?? []).map((s) => s.id));
+  if (n.zones) {
+    const s = new Set(n.zones.map((t) => t.id));
+    for (const t of n.zones)
+      t.spaceIds = t.spaceIds.filter((d) => e.has(d)), t.childZoneIds && (t.childZoneIds = t.childZoneIds.filter((d) => s.has(d)));
+  }
+  if (n.portalGroups)
+    for (const s of n.portalGroups) s.portalIds = s.portalIds.filter((t) => o.has(t));
+}
+export {
+  x as addPortalGroup,
+  G as addZone,
+  g as captive,
+  Z as entryInto,
+  k as nestZone,
+  z as perimeter,
+  O as pruneOntology,
+  y as removePortalGroup,
+  v as removeZone,
+  M as setPortalGroupMembers,
+  P as setZoneMembers,
+  w as zoneSpaces
+};
+//# sourceMappingURL=ontology.js.map

package/dist/model/ontology.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ontology.js","sources":["../../../../src/model/ontology.ts"],"sourcesContent":["// The described layer: zones, portals and portal groups — what groups with what, what connects to\n// what, in which direction, and how far a crossing can be trusted. Everything here is semantics over\n// ids; no geometry is read. Reading the plan itself (inferring portals, dividing spaces) lives in\n// inference.ts, and turning this description into a routing graph lives in topology.ts.\nimport { isSpace, uid, type Portal, type PortalGroup, type ProjectDocument, type Zone } from './types';\nimport { effectivePortals } from './portals';\n\n/** Which way you must cross `portal` to arrive in `spaceId`, or null if you cannot get there that way.\n *  Direction is asked, never stored: a door's entry side is relative to the area you mean. */\nexport function entryInto(portal: Portal, spaceId: string): 'a-to-b' | 'b-to-a' | null {\n  const passage = portal.passage ?? 'both';\n  if (passage === 'none') return null;\n  if (portal.b === spaceId && passage !== 'b-to-a') return 'a-to-b';\n  if (portal.a === spaceId && passage !== 'a-to-b') return 'b-to-a';\n  return null;\n}\n\nconst memberSet = (project: ProjectDocument, zone: Zone, seen = new Set<string>()): Set<string> => {\n  if (seen.has(zone.id)) return new Set(); // zones nest as a DAG; a cycle is a bug, not a hang\n  seen.add(zone.id);\n  const out = new Set(zone.spaceIds);\n  for (const childId of zone.childZoneIds ?? []) {\n    const child = project.zones?.find(z => z.id === childId);\n    if (child) for (const id of memberSet(project, child, seen)) out.add(id);\n  }\n  return out;\n};\n/** Every space in `zone`, including those reached through nested zones. */\nexport const zoneSpaces = (project: ProjectDocument, zone: Zone): string[] => [...memberSet(project, zone)];\n\n/** Portals on the boundary of `zone` — one side in, one side out. These are the ways in, and the\n *  thing software without a floor plan to ask makes you enumerate by hand. Derived, so it cannot go\n *  stale when the building is redrawn. */\nexport function perimeter(project: ProjectDocument, zone: Zone): Portal[] {\n  const inside = memberSet(project, zone);\n  return effectivePortals(project).filter(p => inside.has(p.a) !== inside.has(p.b));\n}\n/** Portals wholly inside `zone`. Not decorative: anything tracking where somebody ended up needs to\n *  know that crossing one of these does not change which zone you are in. */\nexport function captive(project: ProjectDocument, zone: Zone): Portal[] {\n  const inside = memberSet(project, zone);\n  return effectivePortals(project).filter(p => inside.has(p.a) && inside.has(p.b));\n}\n\n// ——— Authoring. Zones are the part a person actually writes: portals are read off the plan, but\n// what counts as \"Finance\" or \"the secure floor\" is a decision nobody can derive.\n\n/** Create a zone over the given spaces. Ids that are not spaces are dropped rather than rejected —\n *  a selection usually contains a door or a fixture alongside the rooms, and losing the whole gesture\n *  over that would be tiresome. */\nexport function addZone(project: ProjectDocument, name: string, spaceIds: string[], purpose?: string): Zone {\n  const zone: Zone = {\n    id: uid(),\n    name,\n    spaceIds: [...new Set(spaceIds)].filter(id => project.objects.some(o => o.id === id && isSpace(o.kind))),\n  };\n  if (purpose) zone.purpose = purpose;\n  (project.zones ??= []).push(zone);\n  return zone;\n}\n/** Remove a zone, and any nesting reference to it. A dangling childZoneIds entry fails validation. */\nexport function removeZone(project: ProjectDocument, zoneId: string) {\n  project.zones = (project.zones ?? []).filter(z => z.id !== zoneId);\n  for (const z of project.zones)\n    if (z.childZoneIds?.includes(zoneId)) z.childZoneIds = z.childZoneIds.filter(id => id !== zoneId);\n}\n/** Add or remove spaces on a zone. Membership is a set: adding twice is not an error, and neither is\n *  removing something that was never there. */\nexport function setZoneMembers(project: ProjectDocument, zoneId: string, spaceIds: string[], member: boolean) {\n  const zone = project.zones?.find(z => z.id === zoneId);\n  if (!zone) return;\n  const eligible = spaceIds.filter(id => project.objects.some(o => o.id === id && isSpace(o.kind)));\n  const next = new Set(zone.spaceIds);\n  for (const id of eligible)\n    if (member) next.add(id);\n    else next.delete(id);\n  zone.spaceIds = [...next];\n}\n/** Nest one zone inside another, refusing anything that would make a cycle. Zones form a DAG, and a\n *  cycle is the one shape the validator will not accept. */\nexport function nestZone(project: ProjectDocument, parentId: string, childId: string): boolean {\n  const parent = project.zones?.find(z => z.id === parentId);\n  if (!parent || parentId === childId || !project.zones?.some(z => z.id === childId)) return false;\n  const reaches = (from: string, target: string, seen = new Set<string>()): boolean => {\n    if (from === target) return true;\n    if (seen.has(from)) return false;\n    seen.add(from);\n    return (project.zones?.find(z => z.id === from)?.childZoneIds ?? []).some(id => reaches(id, target, seen));\n  };\n  if (reaches(childId, parentId)) return false; // the child already contains us\n  parent.childZoneIds = [...new Set([...(parent.childZoneIds ?? []), childId])];\n  return true;\n}\n\n/** Create a portal group over the given portals. The escape hatch for sets that are not a zone\n *  boundary — \"all loading-bay shutters\", \"every door on the night circuit\". Where a set *is* a zone\n *  boundary, derive it with `perimeter` instead; a derived list cannot go stale. Ids that are not\n *  portals are dropped rather than rejected, mirroring addZone. */\nexport function addPortalGroup(project: ProjectDocument, name: string, portalIds: string[]): PortalGroup {\n  project.portals = effectivePortals(project);\n  const group: PortalGroup = {\n    id: uid(),\n    name,\n    portalIds: [...new Set(portalIds)].filter(id => (project.portals ?? []).some(p => p.id === id)),\n  };\n  (project.portalGroups ??= []).push(group);\n  return group;\n}\n/** Remove a portal group. Nothing references groups, so nothing needs cleaning up after one. */\nexport function removePortalGroup(project: ProjectDocument, groupId: string) {\n  project.portalGroups = (project.portalGroups ?? []).filter(g => g.id !== groupId);\n}\n/** Add or remove portals on a group. Membership is a set, exactly as setZoneMembers. */\nexport function setPortalGroupMembers(project: ProjectDocument, groupId: string, portalIds: string[], member: boolean) {\n  const group = project.portalGroups?.find(g => g.id === groupId);\n  if (!group) return;\n  project.portals = effectivePortals(project);\n  const eligible = portalIds.filter(id => (project.portals ?? []).some(p => p.id === id));\n  const next = new Set(group.portalIds);\n  for (const id of eligible)\n    if (member) next.add(id);\n    else next.delete(id);\n  group.portalIds = [...next];\n}\n\n/** Drop ontology references to things that no longer exist.\n *\n *  Every reference here is validated, so a delete that skips this step produces an invalid document\n *  and gets refused — from the outside that looks like the delete silently doing nothing, which is\n *  the worst way for a bug to present. Call it after removing objects, from every path that can.\n *\n *  A portal whose opening is gone goes with it: the door was the way through, and keeping a portal\n *  that no longer has one would quietly turn a closed doorway into an open boundary. */\nexport function pruneOntology(project: ProjectDocument) {\n  const alive = new Set(project.objects.map(o => o.id));\n  const spaceIds = new Set(project.objects.filter(o => isSpace(o.kind)).map(o => o.id));\n  if (project.portals)\n    project.portals = project.portals.filter(\n      p => spaceIds.has(p.a) && spaceIds.has(p.b) && (!p.openingId || alive.has(p.openingId)),\n    );\n  const portalIds = new Set((project.portals ?? []).map(p => p.id));\n  if (project.zones) {\n    const zoneIds = new Set(project.zones.map(z => z.id));\n    for (const zone of project.zones) {\n      zone.spaceIds = zone.spaceIds.filter(id => spaceIds.has(id));\n      if (zone.childZoneIds) zone.childZoneIds = zone.childZoneIds.filter(id => zoneIds.has(id));\n    }\n  }\n  if (project.portalGroups)\n    for (const group of project.portalGroups) group.portalIds = group.portalIds.filter(id => portalIds.has(id));\n}\n"],"names":["entryInto","portal","spaceId","passage","memberSet","project","zone","seen","out","childId","child","_a","z","id","zoneSpaces","perimeter","inside","effectivePortals","p","captive","addZone","name","spaceIds","purpose","uid","o","isSpace","removeZone","zoneId","setZoneMembers","member","eligible","next","nestZone","parentId","parent","_b","reaches","from","target","addPortalGroup","portalIds","group","removePortalGroup","groupId","g","setPortalGroupMembers","pruneOntology","alive","zoneIds"],"mappings":";;AASO,SAASA,EAAUC,GAAgBC,GAA6C;AACrF,QAAMC,IAAUF,EAAO,WAAW;AAClC,SAAIE,MAAY,SAAe,OAC3BF,EAAO,MAAMC,KAAWC,MAAY,WAAiB,WACrDF,EAAO,MAAMC,KAAWC,MAAY,WAAiB,WAClD;AACT;AAEA,MAAMC,IAAY,CAACC,GAA0BC,GAAYC,IAAO,oBAAI,UAA+B;;AACjG,MAAIA,EAAK,IAAID,EAAK,EAAE,EAAG,4BAAW,IAAA;AAClC,EAAAC,EAAK,IAAID,EAAK,EAAE;AAChB,QAAME,IAAM,IAAI,IAAIF,EAAK,QAAQ;AACjC,aAAWG,KAAWH,EAAK,gBAAgB,CAAA,GAAI;AAC7C,UAAMI,KAAQC,IAAAN,EAAQ,UAAR,gBAAAM,EAAe,KAAK,CAAAC,MAAKA,EAAE,OAAOH;AAChD,QAAIC,EAAO,YAAWG,KAAMT,EAAUC,GAASK,GAAOH,CAAI,EAAG,CAAAC,EAAI,IAAIK,CAAE;AAAA,EACzE;AACA,SAAOL;AACT,GAEaM,IAAa,CAACT,GAA0BC,MAAyB,CAAC,GAAGF,EAAUC,GAASC,CAAI,CAAC;AAKnG,SAASS,EAAUV,GAA0BC,GAAsB;AACxE,QAAMU,IAASZ,EAAUC,GAASC,CAAI;AACtC,SAAOW,EAAiBZ,CAAO,EAAE,OAAO,OAAKW,EAAO,IAAIE,EAAE,CAAC,MAAMF,EAAO,IAAIE,EAAE,CAAC,CAAC;AAClF;AAGO,SAASC,EAAQd,GAA0BC,GAAsB;AACtE,QAAMU,IAASZ,EAAUC,GAASC,CAAI;AACtC,SAAOW,EAAiBZ,CAAO,EAAE,OAAO,OAAKW,EAAO,IAAIE,EAAE,CAAC,KAAKF,EAAO,IAAIE,EAAE,CAAC,CAAC;AACjF;AAQO,SAASE,EAAQf,GAA0BgB,GAAcC,GAAoBC,GAAwB;AAC1G,QAAMjB,IAAa;AAAA,IACjB,IAAIkB,EAAA;AAAA,IACJ,MAAAH;AAAA,IACA,UAAU,CAAC,GAAG,IAAI,IAAIC,CAAQ,CAAC,EAAE,OAAO,CAAAT,MAAMR,EAAQ,QAAQ,KAAK,OAAKoB,EAAE,OAAOZ,KAAMa,EAAQD,EAAE,IAAI,CAAC,CAAC;AAAA,EAAA;AAEzG,SAAIF,QAAc,UAAUA,KAC3BlB,EAAQ,UAARA,EAAQ,QAAU,KAAI,KAAKC,CAAI,GACzBA;AACT;AAEO,SAASqB,EAAWtB,GAA0BuB,GAAgB;;AACnE,EAAAvB,EAAQ,SAASA,EAAQ,SAAS,CAAA,GAAI,OAAO,CAAAO,MAAKA,EAAE,OAAOgB,CAAM;AACjE,aAAWhB,KAAKP,EAAQ;AACtB,KAAIM,IAAAC,EAAE,iBAAF,QAAAD,EAAgB,SAASiB,OAAShB,EAAE,eAAeA,EAAE,aAAa,OAAO,CAAAC,MAAMA,MAAOe,CAAM;AACpG;AAGO,SAASC,EAAexB,GAA0BuB,GAAgBN,GAAoBQ,GAAiB;;AAC5G,QAAMxB,KAAOK,IAAAN,EAAQ,UAAR,gBAAAM,EAAe,KAAK,CAAAC,MAAKA,EAAE,OAAOgB;AAC/C,MAAI,CAACtB,EAAM;AACX,QAAMyB,IAAWT,EAAS,OAAO,CAAAT,MAAMR,EAAQ,QAAQ,KAAK,CAAAoB,MAAKA,EAAE,OAAOZ,KAAMa,EAAQD,EAAE,IAAI,CAAC,CAAC,GAC1FO,IAAO,IAAI,IAAI1B,EAAK,QAAQ;AAClC,aAAWO,KAAMkB;AACf,IAAID,IAAQE,EAAK,IAAInB,CAAE,IAClBmB,EAAK,OAAOnB,CAAE;AACrB,EAAAP,EAAK,WAAW,CAAC,GAAG0B,CAAI;AAC1B;AAGO,SAASC,EAAS5B,GAA0B6B,GAAkBzB,GAA0B;;AAC7F,QAAM0B,KAASxB,IAAAN,EAAQ,UAAR,gBAAAM,EAAe,KAAK,CAAAC,MAAKA,EAAE,OAAOsB;AACjD,MAAI,CAACC,KAAUD,MAAazB,KAAW,GAAC2B,IAAA/B,EAAQ,UAAR,QAAA+B,EAAe,KAAK,CAAAxB,MAAKA,EAAE,OAAOH,IAAU,QAAO;AAC3F,QAAM4B,IAAU,CAACC,GAAcC,GAAgBhC,IAAO,oBAAI,UAA2B;;AACnF,WAAI+B,MAASC,IAAe,KACxBhC,EAAK,IAAI+B,CAAI,IAAU,MAC3B/B,EAAK,IAAI+B,CAAI,MACLF,KAAAzB,IAAAN,EAAQ,UAAR,gBAAAM,EAAe,KAAK,CAAAC,MAAKA,EAAE,OAAO0B,OAAlC,gBAAAF,EAAyC,iBAAgB,CAAA,GAAI,KAAK,CAAAvB,MAAMwB,EAAQxB,GAAI0B,GAAQhC,CAAI,CAAC;AAAA,EAC3G;AACA,SAAI8B,EAAQ5B,GAASyB,CAAQ,IAAU,MACvCC,EAAO,eAAe,CAAC,GAAG,oBAAI,IAAI,CAAC,GAAIA,EAAO,gBAAgB,CAAA,GAAK1B,CAAO,CAAC,CAAC,GACrE;AACT;AAMO,SAAS+B,EAAenC,GAA0BgB,GAAcoB,GAAkC;AACvG,EAAApC,EAAQ,UAAUY,EAAiBZ,CAAO;AAC1C,QAAMqC,IAAqB;AAAA,IACzB,IAAIlB,EAAA;AAAA,IACJ,MAAAH;AAAA,IACA,WAAW,CAAC,GAAG,IAAI,IAAIoB,CAAS,CAAC,EAAE,OAAO,QAAOpC,EAAQ,WAAW,CAAA,GAAI,KAAK,OAAKa,EAAE,OAAOL,CAAE,CAAC;AAAA,EAAA;AAEhG,UAACR,EAAQ,iBAARA,EAAQ,eAAiB,KAAI,KAAKqC,CAAK,GACjCA;AACT;AAEO,SAASC,EAAkBtC,GAA0BuC,GAAiB;AAC3E,EAAAvC,EAAQ,gBAAgBA,EAAQ,gBAAgB,CAAA,GAAI,OAAO,CAAAwC,MAAKA,EAAE,OAAOD,CAAO;AAClF;AAEO,SAASE,EAAsBzC,GAA0BuC,GAAiBH,GAAqBX,GAAiB;;AACrH,QAAMY,KAAQ/B,IAAAN,EAAQ,iBAAR,gBAAAM,EAAsB,KAAK,CAAAkC,MAAKA,EAAE,OAAOD;AACvD,MAAI,CAACF,EAAO;AACZ,EAAArC,EAAQ,UAAUY,EAAiBZ,CAAO;AAC1C,QAAM0B,IAAWU,EAAU,OAAO,CAAA5B,OAAOR,EAAQ,WAAW,CAAA,GAAI,KAAK,CAAAa,MAAKA,EAAE,OAAOL,CAAE,CAAC,GAChFmB,IAAO,IAAI,IAAIU,EAAM,SAAS;AACpC,aAAW7B,KAAMkB;AACf,IAAID,IAAQE,EAAK,IAAInB,CAAE,IAClBmB,EAAK,OAAOnB,CAAE;AACrB,EAAA6B,EAAM,YAAY,CAAC,GAAGV,CAAI;AAC5B;AAUO,SAASe,EAAc1C,GAA0B;AACtD,QAAM2C,IAAQ,IAAI,IAAI3C,EAAQ,QAAQ,IAAI,CAAAoB,MAAKA,EAAE,EAAE,CAAC,GAC9CH,IAAW,IAAI,IAAIjB,EAAQ,QAAQ,OAAO,CAAAoB,MAAKC,EAAQD,EAAE,IAAI,CAAC,EAAE,IAAI,CAAAA,MAAKA,EAAE,EAAE,CAAC;AACpF,EAAIpB,EAAQ,YACVA,EAAQ,UAAUA,EAAQ,QAAQ;AAAA,IAChC,OAAKiB,EAAS,IAAIJ,EAAE,CAAC,KAAKI,EAAS,IAAIJ,EAAE,CAAC,MAAM,CAACA,EAAE,aAAa8B,EAAM,IAAI9B,EAAE,SAAS;AAAA,EAAA;AAEzF,QAAMuB,IAAY,IAAI,KAAKpC,EAAQ,WAAW,IAAI,IAAI,CAAAa,MAAKA,EAAE,EAAE,CAAC;AAChE,MAAIb,EAAQ,OAAO;AACjB,UAAM4C,IAAU,IAAI,IAAI5C,EAAQ,MAAM,IAAI,CAAAO,MAAKA,EAAE,EAAE,CAAC;AACpD,eAAWN,KAAQD,EAAQ;AACzB,MAAAC,EAAK,WAAWA,EAAK,SAAS,OAAO,OAAMgB,EAAS,IAAIT,CAAE,CAAC,GACvDP,EAAK,iBAAcA,EAAK,eAAeA,EAAK,aAAa,OAAO,CAAAO,MAAMoC,EAAQ,IAAIpC,CAAE,CAAC;AAAA,EAE7F;AACA,MAAIR,EAAQ;AACV,eAAWqC,KAASrC,EAAQ,aAAc,CAAAqC,EAAM,YAAYA,EAAM,UAAU,OAAO,CAAA7B,MAAM4B,EAAU,IAAI5B,CAAE,CAAC;AAC9G;"}

package/dist/model/passages.js

@@ -0,0 +1,5 @@
+const t = /* @__PURE__ */ new Set(["door", "gate", "turnstile"]);
+export {
+  t as TRAVERSABLE
+};
+//# sourceMappingURL=passages.js.map

package/dist/model/passages.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"passages.js","sources":["../../../../src/model/passages.ts"],"sourcesContent":["/** Openings a person can cross. Windows are openings, but never walkable portals. */\nexport const TRAVERSABLE = new Set<string>(['door', 'gate', 'turnstile']);\n"],"names":["TRAVERSABLE"],"mappings":"AACO,MAAMA,IAAc,oBAAI,IAAY,CAAC,QAAQ,QAAQ,WAAW,CAAC;"}

package/dist/model/portals.js

@@ -0,0 +1,42 @@
+import { isSpace as u } from "./types.js";
+const a = (r, i) => JSON.stringify([r, i].sort());
+function h(r) {
+  var c;
+  const i = new Map((r.virtualBoundaries ?? []).map((t) => [t.id, t]));
+  if (!i.size) return [];
+  const d = /* @__PURE__ */ new Map();
+  for (const t of r.objects)
+    if (!(!u(t.kind) || ((c = t.geometry) == null ? void 0 : c.mode) !== "boundaries"))
+      for (const o of t.geometry.loops)
+        for (const n of o) {
+          const e = i.get(n.edgeId);
+          if (!e || e.floorId !== t.floorId) continue;
+          const s = d.get(e.id) ?? [];
+          s.some((l) => l.id === t.id) || s.push({ id: t.id, reversed: !!n.reversed }), d.set(e.id, s);
+        }
+  const f = /* @__PURE__ */ new Map();
+  for (const t of d.values())
+    for (let o = 0; o < t.length; o++)
+      for (let n = o + 1; n < t.length; n++) {
+        if (t[o].reversed === t[n].reversed) continue;
+        const [e, s] = [t[o].id, t[n].id].sort();
+        f.set(a(e, s), { id: `open:${e}:${s}`, a: e, b: s, attests: "none" });
+      }
+  return [...f.values()];
+}
+function m(r) {
+  const i = h(r), d = new Set(i.map((e) => a(e.a, e.b))), f = new Set(r.objects.filter((e) => {
+    var s;
+    return ((s = e.geometry) == null ? void 0 : s.mode) === "boundaries";
+  }).map((e) => e.id)), c = (r.portals ?? []).filter(
+    (e) => !e.id.startsWith("open:") || !f.has(e.a) || !f.has(e.b) || d.has(a(e.a, e.b))
+  ), t = new Set(
+    c.filter((e) => !e.id.startsWith("open:") && !e.id.startsWith("inferred:")).map((e) => a(e.a, e.b))
+  ), o = c.filter((e) => !e.id.startsWith("open:") || !t.has(a(e.a, e.b))), n = new Set(o.map((e) => a(e.a, e.b)));
+  return [...o, ...i.filter((e) => !n.has(a(e.a, e.b)))];
+}
+export {
+  m as effectivePortals,
+  h as sharedBoundaryPortals
+};
+//# sourceMappingURL=portals.js.map

package/dist/model/portals.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"portals.js","sources":["../../../../src/model/portals.ts"],"sourcesContent":["import { isSpace, type Portal, type ProjectDocument } from './types';\n\nconst pairKey = (a: string, b: string) => JSON.stringify([a, b].sort());\n\n/** A shared virtual edge explicitly declares an unwalled connection. Read its two sides directly;\n * sampling inset room outlines loses narrow openings near the ends of adjoining walls. */\nexport function sharedBoundaryPortals(project: ProjectDocument): Portal[] {\n  const edges = new Map((project.virtualBoundaries ?? []).map(edge => [edge.id, edge]));\n  if (!edges.size) return [];\n  const sides = new Map<string, { id: string; reversed: boolean }[]>();\n  for (const space of project.objects) {\n    if (!isSpace(space.kind) || space.geometry?.mode !== 'boundaries') continue;\n    for (const loop of space.geometry.loops)\n      for (const use of loop) {\n        const edge = edges.get(use.edgeId);\n        if (!edge || edge.floorId !== space.floorId) continue;\n        const owners = sides.get(edge.id) ?? [];\n        if (!owners.some(owner => owner.id === space.id)) owners.push({ id: space.id, reversed: !!use.reversed });\n        sides.set(edge.id, owners);\n      }\n  }\n  const out = new Map<string, Portal>();\n  for (const owners of sides.values())\n    for (let i = 0; i < owners.length; i++)\n      for (let j = i + 1; j < owners.length; j++) {\n        if (owners[i].reversed === owners[j].reversed) continue;\n        const [a, b] = [owners[i].id, owners[j].id].sort();\n        out.set(pairKey(a, b), { id: `open:${a}:${b}`, a, b, attests: 'none' });\n      }\n  return [...out.values()];\n}\n\n/** The readable portal layer, including explicit shared openings in older saved plans. A stored\n * portal takes precedence, including sealed and one-way passage. No document mutation is needed.\n * Once both spaces use shared boundaries, an inferred open connection also disappears when its\n * virtual edge is replaced by a wall. Legacy independent outlines retain their inferred portals. */\nexport function effectivePortals(project: ProjectDocument): Portal[] {\n  const shared = sharedBoundaryPortals(project);\n  const pairs = new Set(shared.map(p => pairKey(p.a, p.b)));\n  const bound = new Set(project.objects.filter(o => o.geometry?.mode === 'boundaries').map(o => o.id));\n  const stored = (project.portals ?? []).filter(\n    p => !p.id.startsWith('open:') || !bound.has(p.a) || !bound.has(p.b) || pairs.has(pairKey(p.a, p.b)),\n  );\n  const authoredPairs = new Set(\n    stored.filter(p => !p.id.startsWith('open:') && !p.id.startsWith('inferred:')).map(p => pairKey(p.a, p.b)),\n  );\n  const retained = stored.filter(p => !p.id.startsWith('open:') || !authoredPairs.has(pairKey(p.a, p.b)));\n  const held = new Set(retained.map(p => pairKey(p.a, p.b)));\n  return [...retained, ...shared.filter(p => !held.has(pairKey(p.a, p.b)))];\n}\n"],"names":["pairKey","a","b","sharedBoundaryPortals","project","edges","edge","sides","space","isSpace","_a","loop","use","owners","owner","out","i","j","effectivePortals","shared","pairs","p","bound","o","stored","authoredPairs","retained","held"],"mappings":";AAEA,MAAMA,IAAU,CAACC,GAAWC,MAAc,KAAK,UAAU,CAACD,GAAGC,CAAC,EAAE,MAAM;AAI/D,SAASC,EAAsBC,GAAoC;;AACxE,QAAMC,IAAQ,IAAI,KAAKD,EAAQ,qBAAqB,CAAA,GAAI,IAAI,CAAAE,MAAQ,CAACA,EAAK,IAAIA,CAAI,CAAC,CAAC;AACpF,MAAI,CAACD,EAAM,KAAM,QAAO,CAAA;AACxB,QAAME,wBAAY,IAAA;AAClB,aAAWC,KAASJ,EAAQ;AAC1B,QAAI,GAACK,EAAQD,EAAM,IAAI,OAAKE,IAAAF,EAAM,aAAN,gBAAAE,EAAgB,UAAS;AACrD,iBAAWC,KAAQH,EAAM,SAAS;AAChC,mBAAWI,KAAOD,GAAM;AACtB,gBAAML,IAAOD,EAAM,IAAIO,EAAI,MAAM;AACjC,cAAI,CAACN,KAAQA,EAAK,YAAYE,EAAM,QAAS;AAC7C,gBAAMK,IAASN,EAAM,IAAID,EAAK,EAAE,KAAK,CAAA;AACrC,UAAKO,EAAO,KAAK,CAAAC,MAASA,EAAM,OAAON,EAAM,EAAE,KAAGK,EAAO,KAAK,EAAE,IAAIL,EAAM,IAAI,UAAU,CAAC,CAACI,EAAI,UAAU,GACxGL,EAAM,IAAID,EAAK,IAAIO,CAAM;AAAA,QAC3B;AAEJ,QAAME,wBAAU,IAAA;AAChB,aAAWF,KAAUN,EAAM,OAAA;AACzB,aAASS,IAAI,GAAGA,IAAIH,EAAO,QAAQG;AACjC,eAASC,IAAID,IAAI,GAAGC,IAAIJ,EAAO,QAAQI,KAAK;AAC1C,YAAIJ,EAAOG,CAAC,EAAE,aAAaH,EAAOI,CAAC,EAAE,SAAU;AAC/C,cAAM,CAAChB,GAAGC,CAAC,IAAI,CAACW,EAAOG,CAAC,EAAE,IAAIH,EAAOI,CAAC,EAAE,EAAE,EAAE,KAAA;AAC5C,QAAAF,EAAI,IAAIf,EAAQC,GAAGC,CAAC,GAAG,EAAE,IAAI,QAAQD,CAAC,IAAIC,CAAC,IAAI,GAAAD,GAAG,GAAAC,GAAG,SAAS,QAAQ;AAAA,MACxE;AACJ,SAAO,CAAC,GAAGa,EAAI,QAAQ;AACzB;AAMO,SAASG,EAAiBd,GAAoC;AACnE,QAAMe,IAAShB,EAAsBC,CAAO,GACtCgB,IAAQ,IAAI,IAAID,EAAO,IAAI,CAAAE,MAAKrB,EAAQqB,EAAE,GAAGA,EAAE,CAAC,CAAC,CAAC,GAClDC,IAAQ,IAAI,IAAIlB,EAAQ,QAAQ,OAAO,CAAAmB,MAAA;;AAAK,aAAAb,IAAAa,EAAE,aAAF,gBAAAb,EAAY,UAAS;AAAA,GAAY,EAAE,IAAI,CAAAa,MAAKA,EAAE,EAAE,CAAC,GAC7FC,KAAUpB,EAAQ,WAAW,CAAA,GAAI;AAAA,IACrC,CAAAiB,MAAK,CAACA,EAAE,GAAG,WAAW,OAAO,KAAK,CAACC,EAAM,IAAID,EAAE,CAAC,KAAK,CAACC,EAAM,IAAID,EAAE,CAAC,KAAKD,EAAM,IAAIpB,EAAQqB,EAAE,GAAGA,EAAE,CAAC,CAAC;AAAA,EAAA,GAE/FI,IAAgB,IAAI;AAAA,IACxBD,EAAO,OAAO,CAAAH,MAAK,CAACA,EAAE,GAAG,WAAW,OAAO,KAAK,CAACA,EAAE,GAAG,WAAW,WAAW,CAAC,EAAE,IAAI,CAAAA,MAAKrB,EAAQqB,EAAE,GAAGA,EAAE,CAAC,CAAC;AAAA,EAAA,GAErGK,IAAWF,EAAO,OAAO,OAAK,CAACH,EAAE,GAAG,WAAW,OAAO,KAAK,CAACI,EAAc,IAAIzB,EAAQqB,EAAE,GAAGA,EAAE,CAAC,CAAC,CAAC,GAChGM,IAAO,IAAI,IAAID,EAAS,IAAI,CAAAL,MAAKrB,EAAQqB,EAAE,GAAGA,EAAE,CAAC,CAAC,CAAC;AACzD,SAAO,CAAC,GAAGK,GAAU,GAAGP,EAAO,OAAO,CAAAE,MAAK,CAACM,EAAK,IAAI3B,EAAQqB,EAAE,GAAGA,EAAE,CAAC,CAAC,CAAC,CAAC;AAC1E;"}

package/dist/model/precision.js

@@ -0,0 +1,11 @@
+const E = 1e-6, _ = 1e-3, o = 0.01, t = 1e-3, A = 1, c = 1e-8, n = 1e4;
+export {
+  n as CLIP_SCALE,
+  E as GEOMETRY_EPS,
+  _ as JOIN_EPS,
+  c as MIN_FACE_AREA,
+  t as MIN_RING_EDGE,
+  A as MIN_SPACE_AREA,
+  o as MIN_WALL_LENGTH
+};
+//# sourceMappingURL=precision.js.map

package/dist/model/precision.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"precision.js","sources":["../../../../src/model/precision.ts"],"sourcesContent":["/** Numerical tolerances are independent of the user's positioning grid. All values are metres. */\nexport const GEOMETRY_EPS = 1e-6;\nexport const JOIN_EPS = 0.001;\nexport const MIN_WALL_LENGTH = 0.01;\nexport const MIN_RING_EDGE = 0.001;\n/** Usable floor area, after subtracting holes and physical walls, in square metres. */\nexport const MIN_SPACE_AREA = 1;\n/** Topological faces and holes may be smaller than a labelled space. Square metres. */\nexport const MIN_FACE_AREA = 1e-8;\n/** Only derived polygon-clipping inputs use this precision; junctions retain their coordinates. */\nexport const CLIP_SCALE = 1e4;\n"],"names":["GEOMETRY_EPS","JOIN_EPS","MIN_WALL_LENGTH","MIN_RING_EDGE","MIN_SPACE_AREA","MIN_FACE_AREA","CLIP_SCALE"],"mappings":"AACO,MAAMA,IAAe,MACfC,IAAW,MACXC,IAAkB,MAClBC,IAAgB,MAEhBC,IAAiB,GAEjBC,IAAgB,MAEhBC,IAAa;"}

package/dist/model/project.js

@@ -0,0 +1,31 @@
+import { rotate as e, add as f } from "./geometry.js";
+function m(n) {
+  const o = structuredClone(n);
+  return o.id = crypto.randomUUID(), o.name = `${n.name} copy`, o.updatedAt = (/* @__PURE__ */ new Date()).toISOString(), o.objects.forEach((i) => {
+    delete i.feedId;
+  }), o;
+}
+function p(n, o) {
+  const i = n.rotation, t = o.position ?? n.position;
+  if (n.rings) {
+    const r = (o.width ?? n.width) / n.width, l = (o.depth ?? n.depth) / n.depth;
+    n.rings = n.rings.map(
+      (a) => a.map((d) => {
+        const s = e([d[0] - n.position[0], d[1] - n.position[1]], -i);
+        return f(t, e([s[0] * r, s[1] * l], o.rotation ?? i));
+      })
+    );
+  }
+  Object.assign(n, o);
+}
+function g(n) {
+  var i, t;
+  const o = n.initialFloorId;
+  return o === null ? null : o !== void 0 && n.floors.some((r) => r.id === o) ? o : ((i = n.floors.find((r) => r.elevation === 0)) == null ? void 0 : i.id) ?? ((t = n.floors[0]) == null ? void 0 : t.id) ?? null;
+}
+export {
+  m as copyProject,
+  g as openingFloorId,
+  p as transformObject
+};
+//# sourceMappingURL=project.js.map

package/dist/model/project.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"project.js","sources":["../../../../src/model/project.ts"],"sourcesContent":["import type { ProjectDocument, SiteObject } from './types';\nimport { add, rotate } from './geometry';\n\nexport function copyProject(project: ProjectDocument): ProjectDocument {\n  const copy = structuredClone(project);\n  copy.id = crypto.randomUUID();\n  copy.name = `${project.name} copy`;\n  copy.updatedAt = new Date().toISOString();\n  copy.objects.forEach(object => {\n    delete object.feedId;\n  });\n  return copy;\n}\n\n/** Apply dimensions in the object's own axes, then rotate and translate its polygon. */\nexport function transformObject(object: SiteObject, patch: Partial<SiteObject>) {\n  const oldRotation = object.rotation;\n  const target = patch.position ?? object.position;\n  if (object.rings) {\n    const sx = (patch.width ?? object.width) / object.width;\n    const sy = (patch.depth ?? object.depth) / object.depth;\n    object.rings = object.rings.map(ring =>\n      ring.map(point => {\n        const local = rotate([point[0] - object.position[0], point[1] - object.position[1]], -oldRotation);\n        return add(target, rotate([local[0] * sx, local[1] * sy], patch.rotation ?? oldRotation));\n      }),\n    );\n  }\n  Object.assign(object, patch);\n}\n\n/** The floor a viewer should open on: the document's own `initialFloorId` when it names a floor that\n *  still exists, otherwise the ground floor, otherwise the lowest one. An explicit `null` is a real\n *  answer — it means the outdoor site — so it is distinguished from the field being absent. */\nexport function openingFloorId(project: ProjectDocument): string | null {\n  const preferred = project.initialFloorId;\n  if (preferred === null) return null;\n  if (preferred !== undefined && project.floors.some(f => f.id === preferred)) return preferred;\n  return project.floors.find(f => f.elevation === 0)?.id ?? project.floors[0]?.id ?? null;\n}\n"],"names":["copyProject","project","copy","object","transformObject","patch","oldRotation","target","sx","sy","ring","point","local","rotate","add","openingFloorId","preferred","f","_a","_b"],"mappings":";AAGO,SAASA,EAAYC,GAA2C;AACrE,QAAMC,IAAO,gBAAgBD,CAAO;AACpC,SAAAC,EAAK,KAAK,OAAO,WAAA,GACjBA,EAAK,OAAO,GAAGD,EAAQ,IAAI,SAC3BC,EAAK,aAAY,oBAAI,KAAA,GAAO,YAAA,GAC5BA,EAAK,QAAQ,QAAQ,CAAAC,MAAU;AAC7B,WAAOA,EAAO;AAAA,EAChB,CAAC,GACMD;AACT;AAGO,SAASE,EAAgBD,GAAoBE,GAA4B;AAC9E,QAAMC,IAAcH,EAAO,UACrBI,IAASF,EAAM,YAAYF,EAAO;AACxC,MAAIA,EAAO,OAAO;AAChB,UAAMK,KAAMH,EAAM,SAASF,EAAO,SAASA,EAAO,OAC5CM,KAAMJ,EAAM,SAASF,EAAO,SAASA,EAAO;AAClD,IAAAA,EAAO,QAAQA,EAAO,MAAM;AAAA,MAAI,CAAAO,MAC9BA,EAAK,IAAI,CAAAC,MAAS;AAChB,cAAMC,IAAQC,EAAO,CAACF,EAAM,CAAC,IAAIR,EAAO,SAAS,CAAC,GAAGQ,EAAM,CAAC,IAAIR,EAAO,SAAS,CAAC,CAAC,GAAG,CAACG,CAAW;AACjG,eAAOQ,EAAIP,GAAQM,EAAO,CAACD,EAAM,CAAC,IAAIJ,GAAII,EAAM,CAAC,IAAIH,CAAE,GAAGJ,EAAM,YAAYC,CAAW,CAAC;AAAA,MAC1F,CAAC;AAAA,IAAA;AAAA,EAEL;AACA,SAAO,OAAOH,GAAQE,CAAK;AAC7B;AAKO,SAASU,EAAed,GAAyC;;AACtE,QAAMe,IAAYf,EAAQ;AAC1B,SAAIe,MAAc,OAAa,OAC3BA,MAAc,UAAaf,EAAQ,OAAO,KAAK,OAAKgB,EAAE,OAAOD,CAAS,IAAUA,MAC7EE,IAAAjB,EAAQ,OAAO,KAAK,CAAAgB,MAAKA,EAAE,cAAc,CAAC,MAA1C,gBAAAC,EAA6C,SAAMC,IAAAlB,EAAQ,OAAO,CAAC,MAAhB,gBAAAkB,EAAmB,OAAM;AACrF;"}

package/dist/model/ramps.js

@@ -0,0 +1,10 @@
+const d = (l, o) => !!l.slope && [l.slope.low, l.slope.high].some((s) => Math.abs(s - o) < 0.01);
+function p(l, o) {
+  const s = l.floors.find((i) => i.id === o.floorId), e = (i) => l.floors.find((n) => n.buildingId === (s == null ? void 0 : s.buildingId) && Math.abs(n.elevation - i) < 0.01);
+  return { low: o.slope && e(o.slope.low), high: o.slope && e(o.slope.high) };
+}
+export {
+  p as rampFloors,
+  d as rampJoins
+};
+//# sourceMappingURL=ramps.js.map

package/dist/model/ramps.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ramps.js","sources":["../../../../src/model/ramps.ts"],"sourcesContent":["import type { ProjectDocument, SiteObject } from './types';\n\nexport const rampJoins = (o: SiteObject, elevation: number) =>\n  !!o.slope && [o.slope.low, o.slope.high].some(end => Math.abs(end - elevation) < 0.01);\n\n/** Only the end levels in the ramp's building are connected, never a storey it passes through. */\nexport function rampFloors(project: ProjectDocument, o: SiteObject) {\n  const own = project.floors.find(f => f.id === o.floorId);\n  const end = (height: number) =>\n    project.floors.find(f => f.buildingId === own?.buildingId && Math.abs(f.elevation - height) < 0.01);\n  return { low: o.slope && end(o.slope.low), high: o.slope && end(o.slope.high) };\n}\n"],"names":["rampJoins","o","elevation","end","rampFloors","project","own","f","height"],"mappings":"AAEO,MAAMA,IAAY,CAACC,GAAeC,MACvC,CAAC,CAACD,EAAE,SAAS,CAACA,EAAE,MAAM,KAAKA,EAAE,MAAM,IAAI,EAAE,KAAK,CAAAE,MAAO,KAAK,IAAIA,IAAMD,CAAS,IAAI,IAAI;AAGhF,SAASE,EAAWC,GAA0B,GAAe;AAClE,QAAMC,IAAMD,EAAQ,OAAO,KAAK,OAAKE,EAAE,OAAO,EAAE,OAAO,GACjDJ,IAAM,CAACK,MACXH,EAAQ,OAAO,KAAK,CAAAE,MAAKA,EAAE,gBAAeD,KAAA,gBAAAA,EAAK,eAAc,KAAK,IAAIC,EAAE,YAAYC,CAAM,IAAI,IAAI;AACpG,SAAO,EAAE,KAAK,EAAE,SAASL,EAAI,EAAE,MAAM,GAAG,GAAG,MAAM,EAAE,SAASA,EAAI,EAAE,MAAM,IAAI,EAAA;AAC9E;"}