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

package/dist/import/documentSvg.js

@@ -0,0 +1,49 @@
+import "polygon-clipping";
+import { barrierEnds as x, objectPosition as $, footprint as M } from "../model/geometry.js";
+import { isSpace as u } from "../model/types.js";
+const b = (o) => o.replace(/[&<>"']/g, (a) => ({ "&": "&amp;", "<": "&lt;", ">": "&gt;", '"': "&quot;", "'": "&apos;" })[a]);
+function S(o, a = 1600) {
+  var g;
+  const h = [];
+  for (const t of o.objects) for (const n of t.rings ?? []) h.push(...n);
+  for (const t of o.barriers) h.push(...x(o, t));
+  if (!h.length)
+    return '<svg xmlns="http://www.w3.org/2000/svg" width="200" height="60"><text x="10" y="30">empty document</text></svg>';
+  const f = h.reduce(
+    (t, n) => [Math.min(t[0], n[0]), Math.min(t[1], n[1]), Math.max(t[2], n[0]), Math.max(t[3], n[1])],
+    [1 / 0, 1 / 0, -1 / 0, -1 / 0]
+  ), [d, m, w, l] = [f[0] - 1, f[1] - 1, f[2] + 1, f[3] + 1], c = Math.min(a / (w - d), 2e3 / (l - m)), k = Math.max(60, Math.round((l - m) * c)), s = (t) => ((t - d) * c).toFixed(1), e = (t) => ((l - t) * c).toFixed(1), r = [];
+  for (const t of o.objects)
+    if (u(t.kind) && ((g = t.rings) != null && g.length)) {
+      const n = t.rings.map((y) => `M ${y.map((p) => `${s(p[0])} ${e(p[1])}`).join(" L ")} Z`).join(" ");
+      r.push(`<path d="${n}" fill="#dde6da" fill-rule="evenodd" stroke="#7a8577" stroke-width="1"/>`);
+      const i = $(o, t);
+      r.push(
+        `<text x="${s(i[0])}" y="${e(i[1])}" font-size="12" text-anchor="middle" fill="#3c4440">${b(t.name)}</text>`
+      );
+    }
+  for (const t of o.barriers) {
+    const [n, i] = x(o, t);
+    r.push(
+      `<line x1="${s(n[0])}" y1="${e(n[1])}" x2="${s(i[0])}" y2="${e(i[1])}" stroke="#2b2f2c" stroke-width="${Math.max(2, t.thickness * c)}" stroke-linecap="square"/>`
+    );
+  }
+  for (const t of o.objects)
+    if (t.kind === "door" || t.kind === "window" || t.kind === "gate") {
+      const n = $(o, t);
+      r.push(
+        `<circle cx="${s(n[0])}" cy="${e(n[1])}" r="4" fill="${t.kind === "window" ? "#4a90d9" : "#d97b4a"}"/>`
+      );
+    } else if (!u(t.kind)) {
+      const n = M(t)[0];
+      n != null && n.length && r.push(
+        `<path d="M ${n.map((i) => `${s(i[0])} ${e(i[1])}`).join(" L ")} Z" fill="none" stroke="#9a62c9" stroke-width="1"/>`
+      );
+    }
+  return `<svg xmlns="http://www.w3.org/2000/svg" width="${a}" height="${k}"><rect width="100%" height="100%" fill="white"/><g font-family="system-ui">${r.join(`
+`)}</g></svg>`;
+}
+export {
+  S as documentSvg
+};
+//# sourceMappingURL=documentSvg.js.map

package/dist/import/documentSvg.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"documentSvg.js","sources":["../../../../src/import/documentSvg.ts"],"sourcesContent":["// Render a Kerros ProjectDocument to a plain SVG plan view — spaces as filled plates with names,\n// barriers as strokes, openings as dots, other objects as outlines. This is the \"what the document\n// says\" side of a visual diff against a rendering of the source drawing; both the apply CLI and the\n// import agent use it, so a person and a vision model see the same picture.\nimport { barrierEnds, footprint, isSpace, objectPosition } from '../schema';\nimport type { ProjectDocument } from '../schema';\n\nconst escapeXml = (text: string) =>\n  text.replace(/[&<>\"']/g, c => ({ '&': '&amp;', '<': '&lt;', '>': '&gt;', '\"': '&quot;', \"'\": '&apos;' })[c]!);\n\nexport function documentSvg(doc: ProjectDocument, width = 1600): string {\n  const pts: [number, number][] = [];\n  for (const o of doc.objects) for (const ring of o.rings ?? []) pts.push(...(ring as [number, number][]));\n  for (const b of doc.barriers) pts.push(...barrierEnds(doc, b));\n  if (!pts.length)\n    return `<svg xmlns=\"http://www.w3.org/2000/svg\" width=\"200\" height=\"60\"><text x=\"10\" y=\"30\">empty document</text></svg>`;\n  const bounds = pts.reduce(\n    (b, p) => [Math.min(b[0], p[0]), Math.min(b[1], p[1]), Math.max(b[2], p[0]), Math.max(b[3], p[1])],\n    [Infinity, Infinity, -Infinity, -Infinity],\n  );\n  const [x0, y0, x1, y1] = [bounds[0] - 1, bounds[1] - 1, bounds[2] + 1, bounds[3] + 1];\n  const S = Math.min(width / (x1 - x0), 2000 / (y1 - y0)),\n    H = Math.max(60, Math.round((y1 - y0) * S));\n  const X = (v: number) => ((v - x0) * S).toFixed(1);\n  const Y = (v: number) => ((y1 - v) * S).toFixed(1);\n  const shapes: string[] = [];\n  for (const o of doc.objects) {\n    if (isSpace(o.kind) && o.rings?.length) {\n      const d = o.rings.map(r => `M ${r.map(p => `${X(p[0])} ${Y(p[1])}`).join(' L ')} Z`).join(' ');\n      shapes.push(`<path d=\"${d}\" fill=\"#dde6da\" fill-rule=\"evenodd\" stroke=\"#7a8577\" stroke-width=\"1\"/>`);\n      const at = objectPosition(doc, o);\n      shapes.push(\n        `<text x=\"${X(at[0])}\" y=\"${Y(at[1])}\" font-size=\"12\" text-anchor=\"middle\" fill=\"#3c4440\">${escapeXml(o.name)}</text>`,\n      );\n    }\n  }\n  for (const b of doc.barriers) {\n    const [a, z] = barrierEnds(doc, b);\n    // Square caps, not the default butt: two walls meeting at a shared corner junction each end at\n    // the corner POINT, so butt caps leave the outer half-thickness quadrant of the corner bare.\n    // A square cap extends each stroke by half its width — exactly filling that quadrant, the same\n    // job the map's 'line-cap: round' does in the editor.\n    shapes.push(\n      `<line x1=\"${X(a[0])}\" y1=\"${Y(a[1])}\" x2=\"${X(z[0])}\" y2=\"${Y(z[1])}\" stroke=\"#2b2f2c\" stroke-width=\"${Math.max(2, b.thickness * S)}\" stroke-linecap=\"square\"/>`,\n    );\n  }\n  for (const o of doc.objects) {\n    if (o.kind === 'door' || o.kind === 'window' || o.kind === 'gate') {\n      const at = objectPosition(doc, o);\n      shapes.push(\n        `<circle cx=\"${X(at[0])}\" cy=\"${Y(at[1])}\" r=\"4\" fill=\"${o.kind === 'window' ? '#4a90d9' : '#d97b4a'}\"/>`,\n      );\n    } else if (!isSpace(o.kind)) {\n      const b = footprint(o)[0];\n      if (b?.length)\n        shapes.push(\n          `<path d=\"M ${b.map(p => `${X(p[0])} ${Y(p[1])}`).join(' L ')} Z\" fill=\"none\" stroke=\"#9a62c9\" stroke-width=\"1\"/>`,\n        );\n    }\n  }\n  return `<svg xmlns=\"http://www.w3.org/2000/svg\" width=\"${width}\" height=\"${H}\"><rect width=\"100%\" height=\"100%\" fill=\"white\"/><g font-family=\"system-ui\">${shapes.join('\\n')}</g></svg>`;\n}\n"],"names":["escapeXml","text","c","documentSvg","doc","width","pts","o","ring","b","barrierEnds","bounds","p","x0","y0","x1","y1","S","H","X","v","Y","shapes","isSpace","_a","d","r","at","objectPosition","a","z","footprint"],"mappings":";;;AAOA,MAAMA,IAAY,CAACC,MACjBA,EAAK,QAAQ,YAAY,CAAAC,OAAM,EAAE,KAAK,SAAS,KAAK,QAAQ,KAAK,QAAQ,KAAK,UAAU,KAAK,YAAYA,CAAC,CAAE;AAEvG,SAASC,EAAYC,GAAsBC,IAAQ,MAAc;;AACtE,QAAMC,IAA0B,CAAA;AAChC,aAAWC,KAAKH,EAAI,QAAS,YAAWI,KAAQD,EAAE,SAAS,CAAA,EAAI,CAAAD,EAAI,KAAK,GAAIE,CAA2B;AACvG,aAAWC,KAAKL,EAAI,SAAU,CAAAE,EAAI,KAAK,GAAGI,EAAYN,GAAKK,CAAC,CAAC;AAC7D,MAAI,CAACH,EAAI;AACP,WAAO;AACT,QAAMK,IAASL,EAAI;AAAA,IACjB,CAACG,GAAGG,MAAM,CAAC,KAAK,IAAIH,EAAE,CAAC,GAAGG,EAAE,CAAC,CAAC,GAAG,KAAK,IAAIH,EAAE,CAAC,GAAGG,EAAE,CAAC,CAAC,GAAG,KAAK,IAAIH,EAAE,CAAC,GAAGG,EAAE,CAAC,CAAC,GAAG,KAAK,IAAIH,EAAE,CAAC,GAAGG,EAAE,CAAC,CAAC,CAAC;AAAA,IACjG,CAAC,OAAU,OAAU,QAAW,MAAS;AAAA,EAAA,GAErC,CAACC,GAAIC,GAAIC,GAAIC,CAAE,IAAI,CAACL,EAAO,CAAC,IAAI,GAAGA,EAAO,CAAC,IAAI,GAAGA,EAAO,CAAC,IAAI,GAAGA,EAAO,CAAC,IAAI,CAAC,GAC9EM,IAAI,KAAK,IAAIZ,KAASU,IAAKF,IAAK,OAAQG,IAAKF,EAAG,GACpDI,IAAI,KAAK,IAAI,IAAI,KAAK,OAAOF,IAAKF,KAAMG,CAAC,CAAC,GACtCE,IAAI,CAACC,QAAgBA,IAAIP,KAAMI,GAAG,QAAQ,CAAC,GAC3CI,IAAI,CAACD,QAAgBJ,IAAKI,KAAKH,GAAG,QAAQ,CAAC,GAC3CK,IAAmB,CAAA;AACzB,aAAWf,KAAKH,EAAI;AAClB,QAAImB,EAAQhB,EAAE,IAAI,OAAKiB,IAAAjB,EAAE,UAAF,QAAAiB,EAAS,SAAQ;AACtC,YAAMC,IAAIlB,EAAE,MAAM,IAAI,CAAAmB,MAAK,KAAKA,EAAE,IAAI,CAAA,MAAK,GAAGP,EAAE,EAAE,CAAC,CAAC,CAAC,IAAIE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,KAAK,CAAC,IAAI,EAAE,KAAK,GAAG;AAC7F,MAAAC,EAAO,KAAK,YAAYG,CAAC,0EAA0E;AACnG,YAAME,IAAKC,EAAexB,GAAKG,CAAC;AAChC,MAAAe,EAAO;AAAA,QACL,YAAYH,EAAEQ,EAAG,CAAC,CAAC,CAAC,QAAQN,EAAEM,EAAG,CAAC,CAAC,CAAC,wDAAwD3B,EAAUO,EAAE,IAAI,CAAC;AAAA,MAAA;AAAA,IAEjH;AAEF,aAAWE,KAAKL,EAAI,UAAU;AAC5B,UAAM,CAACyB,GAAGC,CAAC,IAAIpB,EAAYN,GAAKK,CAAC;AAKjC,IAAAa,EAAO;AAAA,MACL,aAAaH,EAAEU,EAAE,CAAC,CAAC,CAAC,SAASR,EAAEQ,EAAE,CAAC,CAAC,CAAC,SAASV,EAAEW,EAAE,CAAC,CAAC,CAAC,SAAST,EAAES,EAAE,CAAC,CAAC,CAAC,oCAAoC,KAAK,IAAI,GAAGrB,EAAE,YAAYQ,CAAC,CAAC;AAAA,IAAA;AAAA,EAExI;AACA,aAAWV,KAAKH,EAAI;AAClB,QAAIG,EAAE,SAAS,UAAUA,EAAE,SAAS,YAAYA,EAAE,SAAS,QAAQ;AACjE,YAAMoB,IAAKC,EAAexB,GAAKG,CAAC;AAChC,MAAAe,EAAO;AAAA,QACL,eAAeH,EAAEQ,EAAG,CAAC,CAAC,CAAC,SAASN,EAAEM,EAAG,CAAC,CAAC,CAAC,iBAAiBpB,EAAE,SAAS,WAAW,YAAY,SAAS;AAAA,MAAA;AAAA,IAExG,WAAW,CAACgB,EAAQhB,EAAE,IAAI,GAAG;AAC3B,YAAME,IAAIsB,EAAUxB,CAAC,EAAE,CAAC;AACxB,MAAIE,KAAA,QAAAA,EAAG,UACLa,EAAO;AAAA,QACL,cAAcb,EAAE,IAAI,CAAAG,MAAK,GAAGO,EAAEP,EAAE,CAAC,CAAC,CAAC,IAAIS,EAAET,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,KAAK,CAAC;AAAA,MAAA;AAAA,IAEnE;AAEF,SAAO,kDAAkDP,CAAK,aAAaa,CAAC,+EAA+EI,EAAO,KAAK;AAAA,CAAI,CAAC;AAC9K;"}

package/dist/import/instructions.js

@@ -0,0 +1,20 @@
+function r(e) {
+  const t = e;
+  if (!t || typeof t.id != "string" || !/^[a-zA-Z0-9_-]{1,100}$/.test(t.id) || typeof t.text != "string" || !t.text.trim() || t.text.length > 2e3)
+    throw new Error("Instructions must contain 1–2,000 characters and a valid message ID.");
+  return { id: t.id, text: t.text.trim() };
+}
+function i(...e) {
+  const t = [
+    ...new Map(
+      e.flat().map(r).map((n) => [n.id, n])
+    ).values()
+  ];
+  for (; t.length > 20 || JSON.stringify(t).length > 8e3; ) t.shift();
+  return t;
+}
+export {
+  i as mergeImportInstructions,
+  r as readImportInstruction
+};
+//# sourceMappingURL=instructions.js.map

package/dist/import/instructions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"instructions.js","sources":["../../../../src/import/instructions.ts"],"sourcesContent":["export interface ImportInstruction {\n  id: string;\n  text: string;\n}\nexport function readImportInstruction(value: unknown): ImportInstruction {\n  const m = value as ImportInstruction;\n  if (\n    !m ||\n    typeof m.id !== 'string' ||\n    !/^[a-zA-Z0-9_-]{1,100}$/.test(m.id) ||\n    typeof m.text !== 'string' ||\n    !m.text.trim() ||\n    m.text.length > 2000\n  )\n    throw new Error('Instructions must contain 1–2,000 characters and a valid message ID.');\n  return { id: m.id, text: m.text.trim() };\n}\n/** Keep the latest human steering separately from model-authored notes. */\nexport function mergeImportInstructions(...groups: ImportInstruction[][]): ImportInstruction[] {\n  const merged = [\n    ...new Map(\n      groups\n        .flat()\n        .map(readImportInstruction)\n        .map(m => [m.id, m]),\n    ).values(),\n  ];\n  while (merged.length > 20 || JSON.stringify(merged).length > 8000) merged.shift();\n  return merged;\n}\n"],"names":["readImportInstruction","value","m","mergeImportInstructions","groups","merged"],"mappings":"AAIO,SAASA,EAAsBC,GAAmC;AACvE,QAAMC,IAAID;AACV,MACE,CAACC,KACD,OAAOA,EAAE,MAAO,YAChB,CAAC,yBAAyB,KAAKA,EAAE,EAAE,KACnC,OAAOA,EAAE,QAAS,YAClB,CAACA,EAAE,KAAK,KAAA,KACRA,EAAE,KAAK,SAAS;AAEhB,UAAM,IAAI,MAAM,sEAAsE;AACxF,SAAO,EAAE,IAAIA,EAAE,IAAI,MAAMA,EAAE,KAAK,OAAK;AACvC;AAEO,SAASC,KAA2BC,GAAoD;AAC7F,QAAMC,IAAS;AAAA,IACb,GAAG,IAAI;AAAA,MACLD,EACG,KAAA,EACA,IAAIJ,CAAqB,EACzB,IAAI,CAAAE,MAAK,CAACA,EAAE,IAAIA,CAAC,CAAC;AAAA,IAAA,EACrB,OAAA;AAAA,EAAO;AAEX,SAAOG,EAAO,SAAS,MAAM,KAAK,UAAUA,CAAM,EAAE,SAAS,MAAM,CAAAA,EAAO,MAAA;AAC1E,SAAOA;AACT;"}

package/dist/import/openings.js

@@ -0,0 +1,61 @@
+import { along as f } from "./walls.js";
+const l = (i, o, r, e) => i.filter((t) => {
+  const n = o.axis === "h" ? t[0] : t[1], s = o.axis === "h" ? t[1] : t[0];
+  return n > r - 0.1 && n < e + 0.1 && Math.abs(s - o.c) < 0.9;
+}).map((t) => o.axis === "h" ? t[0] : t[1]);
+function m(i, o, r, e) {
+  const t = [...i].sort((a, h) => a - h), n = [];
+  let s = 0;
+  for (let a = 1; a <= t.length; a++)
+    if (a === t.length || t[a] - t[a - 1] > o) {
+      const h = a - s, c = t[a - 1] - t[s];
+      h >= r && c >= e && n.push([t[s], t[a - 1]]), s = a;
+    }
+  return n;
+}
+function x(i, o, r) {
+  const e = m(l(o, i, i.lo, i.hi), 0.4, 3, 0.5).map(
+    ([n, s]) => ({
+      kind: "door",
+      centre: (n + s) / 2,
+      width: Math.min(3, Math.max(0.8, s - n + 0.15))
+    })
+  ), t = M(l(r, i, i.lo, i.hi)).filter(
+    (n) => !e.some((s) => Math.abs(s.centre - n.centre) < (s.width + n.width) / 2 + 0.1)
+  );
+  return [...e, ...t];
+}
+function M(i) {
+  const o = m(i, 0.08, 1, 0), r = [];
+  for (let e = 0; e + 1 < o.length; ) {
+    const t = o[e + 1][0] - o[e][1];
+    if (t >= 0.25 && t <= 3) {
+      const n = o[e][0], s = o[e + 1][1];
+      r.push({ kind: "window", centre: (n + s) / 2, width: Math.max(0.4, s - n) }), e += 2;
+    } else e += 1;
+  }
+  return r;
+}
+function g(i, o, r, e) {
+  const [t, n] = o, s = l(r, i, t, n), a = l(e, i, t, n);
+  if (s.length >= 2) {
+    const h = Math.max(t, Math.min(...s)), c = Math.min(n, Math.max(...s)), d = Math.min(n - t, Math.max(0.8, c - h + 0.2)), u = Math.min(n - d / 2, Math.max(t + d / 2, (h + c) / 2));
+    return { gap: o, openings: [{ kind: "door", centre: u, width: d }] };
+  }
+  return a.length >= 2 ? { gap: o, openings: [{ kind: "window", centre: (t + n) / 2, width: Math.min(3, n - t) }] } : { gap: o, openings: [], passage: o };
+}
+function b(i, o) {
+  const r = [...o].sort((n, s) => n[0] - s[0]), e = [];
+  let t = i.lo;
+  for (const [n, s] of r)
+    n > t && e.push([t, n]), t = Math.max(t, s);
+  return i.hi > t && e.push([t, i.hi]), e;
+}
+const k = (i, o) => f(i, o.centre).map((r) => r.toFixed(1)).join(",");
+export {
+  b as barrierSpans,
+  k as openingLabel,
+  x as resolveEnvelopeOpenings,
+  g as resolvePartitionGap
+};
+//# sourceMappingURL=openings.js.map

package/dist/import/openings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"openings.js","sources":["../../../../src/import/openings.ts"],"sourcesContent":["// Opening resolution. Two different sources of truth, learned from the drawings themselves:\n//\n// ENVELOPE walls: the face layers alternate coverage along the wall (each layer's \"gaps\" are the\n// other's segments), so face breaks say nothing about openings there. What does is the SYMBOL\n// geometry — a door leaf and swing, a window's sill-and-frame block — which always stands in the\n// opening it fills. Envelope openings are therefore symbol clusters projected onto the wall.\n//\n// PARTITION walls: both faces genuinely break at every opening, so the paired gap IS the opening;\n// symbols only decide its kind. A partition gap with no symbol at all is a doorless passage —\n// modelled as NO wall (the barrier splits around it), not as a sealed one.\nimport type { Point } from '../schema';\nimport { along, type Wall } from './walls';\n\nexport interface ResolvedOpening {\n  kind: 'door' | 'window';\n  /** Along-axis centre and width, in the wall's own coordinate. */\n  centre: number;\n  width: number;\n}\nexport interface GapResolution {\n  gap: [number, number];\n  openings: ResolvedOpening[];\n  /** A stretch with no wall at all — the barrier must be split around it. */\n  passage?: [number, number];\n}\n\n/** Along-coordinates of the symbol points standing in this wall's band. */\nconst inBand = (pts: Point[], w: Wall, lo: number, hi: number): number[] =>\n  pts\n    .filter(p => {\n      const alongP = w.axis === 'h' ? p[0] : p[1];\n      const crossP = w.axis === 'h' ? p[1] : p[0];\n      return alongP > lo - 0.1 && alongP < hi + 0.1 && Math.abs(crossP - w.c) < 0.9;\n    })\n    .map(p => (w.axis === 'h' ? p[0] : p[1]));\n\n/** 1D clustering along the wall: sorted alongs split wherever consecutive points sit further apart\n *  than `split`. Small or short clusters are noise, not openings. */\nfunction clusters(alongs: number[], split: number, minPoints: number, minExtent: number): [number, number][] {\n  const sorted = [...alongs].sort((a, b) => a - b);\n  const out: [number, number][] = [];\n  let start = 0;\n  for (let i = 1; i <= sorted.length; i++) {\n    if (i === sorted.length || sorted[i] - sorted[i - 1] > split) {\n      const size = i - start;\n      const extent = sorted[i - 1] - sorted[start];\n      if (size >= minPoints && extent >= minExtent) out.push([sorted[start], sorted[i - 1]]);\n      start = i;\n    }\n  }\n  return out;\n}\n\n/** Envelope openings: door and window symbol clusters projected onto the wall. Door clusters win\n *  where the two overlap — a swing sweeps across the window symbols beside it. */\nexport function resolveEnvelopeOpenings(w: Wall, doorPts: Point[], windowPts: Point[]): ResolvedOpening[] {\n  const doors = clusters(inBand(doorPts, w, w.lo, w.hi), 0.4, 3, 0.5).map(\n    ([lo, hi]): ResolvedOpening => ({\n      kind: 'door',\n      centre: (lo + hi) / 2,\n      width: Math.min(3, Math.max(0.8, hi - lo + 0.15)),\n    }),\n  );\n  const windows = windowsFromJambs(inBand(windowPts, w, w.lo, w.hi)).filter(\n    win => !doors.some(d => Math.abs(d.centre - win.centre) < (d.width + win.width) / 2 + 0.1),\n  );\n  return [...doors, ...windows];\n}\n\n/** Read windows off their jambs.\n *\n *  A window symbol is not one blob of geometry: it is a dense little block at each jamb with the\n *  glass between them drawn as nothing at all. So the biggest gap in a window is INSIDE it — around\n *  0.7 m for an ordinary casement — while the gap between two windows in a bank is the mullion, a\n *  tenth of a metre. Clustering by gap size therefore cannot work and did not: splitting on anything\n *  wide enough to separate two windows split every window down its own middle, and the halves were\n *  then too short to count as openings and were dropped. A three-window bank imported as no windows\n *  at all.\n *\n *  Reading it as the drawing draws it: cluster tightly to find the jambs, then take each consecutive\n *  PAIR of jambs a plausible pane apart as one window. A gap too narrow to be glass is the mullion\n *  between two windows, and the walk simply steps over it to start the next pair. */\nfunction windowsFromJambs(alongs: number[]): ResolvedOpening[] {\n  // 80 mm: wider than the few centimetres a jamb block spans, narrower than any mullion.\n  const jambs = clusters(alongs, 0.08, 1, 0);\n  const out: ResolvedOpening[] = [];\n  for (let i = 0; i + 1 < jambs.length; ) {\n    const glass = jambs[i + 1][0] - jambs[i][1];\n    // A pane: too narrow and this is a mullion between two windows, too wide and the two jambs\n    // belong to different openings with a stretch of blank wall between them.\n    if (glass >= 0.25 && glass <= 3) {\n      const lo = jambs[i][0],\n        hi = jambs[i + 1][1];\n      out.push({ kind: 'window', centre: (lo + hi) / 2, width: Math.max(0.4, hi - lo) });\n      i += 2;\n    } else i += 1;\n  }\n  return out;\n}\n\n/** Partition gaps: the gap is the opening; symbols say the kind, and no symbol means a passage. */\nexport function resolvePartitionGap(\n  w: Wall,\n  gap: [number, number],\n  doorPts: Point[],\n  windowPts: Point[],\n): GapResolution {\n  const [glo, ghi] = gap;\n  const doors = inBand(doorPts, w, glo, ghi);\n  const windows = inBand(windowPts, w, glo, ghi);\n  if (doors.length >= 2) {\n    const lo = Math.max(glo, Math.min(...doors));\n    const hi = Math.min(ghi, Math.max(...doors));\n    const width = Math.min(ghi - glo, Math.max(0.8, hi - lo + 0.2));\n    const centre = Math.min(ghi - width / 2, Math.max(glo + width / 2, (lo + hi) / 2));\n    return { gap, openings: [{ kind: 'door', centre, width }] };\n  }\n  if (windows.length >= 2)\n    return { gap, openings: [{ kind: 'window', centre: (glo + ghi) / 2, width: Math.min(3, ghi - glo) }] };\n  return { gap, openings: [], passage: gap };\n}\n\n/** The barrier spans a wall keeps once its passages are cut out of it. */\nexport function barrierSpans(w: Wall, passages: [number, number][]): [number, number][] {\n  const sorted = [...passages].sort((x, y) => x[0] - y[0]);\n  const spans: [number, number][] = [];\n  let start = w.lo;\n  for (const [plo, phi] of sorted) {\n    if (plo > start) spans.push([start, plo]);\n    start = Math.max(start, phi);\n  }\n  if (w.hi > start) spans.push([start, w.hi]);\n  return spans;\n}\n\nexport const openingLabel = (w: Wall, o: ResolvedOpening) =>\n  along(w, o.centre)\n    .map(v => v.toFixed(1))\n    .join(',');\n"],"names":["inBand","pts","w","lo","hi","p","alongP","crossP","clusters","alongs","split","minPoints","minExtent","sorted","b","out","start","i","size","extent","resolveEnvelopeOpenings","doorPts","windowPts","doors","windows","windowsFromJambs","d","win","jambs","glass","resolvePartitionGap","gap","glo","ghi","width","centre","barrierSpans","passages","x","y","spans","plo","phi","openingLabel","along","v"],"mappings":";AA2BA,MAAMA,IAAS,CAACC,GAAcC,GAASC,GAAYC,MACjDH,EACG,OAAO,CAAAI,MAAK;AACX,QAAMC,IAASJ,EAAE,SAAS,MAAMG,EAAE,CAAC,IAAIA,EAAE,CAAC,GACpCE,IAASL,EAAE,SAAS,MAAMG,EAAE,CAAC,IAAIA,EAAE,CAAC;AAC1C,SAAOC,IAASH,IAAK,OAAOG,IAASF,IAAK,OAAO,KAAK,IAAIG,IAASL,EAAE,CAAC,IAAI;AAC5E,CAAC,EACA,IAAI,CAAAG,MAAMH,EAAE,SAAS,MAAMG,EAAE,CAAC,IAAIA,EAAE,CAAC,CAAE;AAI5C,SAASG,EAASC,GAAkBC,GAAeC,GAAmBC,GAAuC;AAC3G,QAAMC,IAAS,CAAC,GAAGJ,CAAM,EAAE,KAAK,CAAC,GAAGK,MAAM,IAAIA,CAAC,GACzCC,IAA0B,CAAA;AAChC,MAAIC,IAAQ;AACZ,WAASC,IAAI,GAAGA,KAAKJ,EAAO,QAAQI;AAClC,QAAIA,MAAMJ,EAAO,UAAUA,EAAOI,CAAC,IAAIJ,EAAOI,IAAI,CAAC,IAAIP,GAAO;AAC5D,YAAMQ,IAAOD,IAAID,GACXG,IAASN,EAAOI,IAAI,CAAC,IAAIJ,EAAOG,CAAK;AAC3C,MAAIE,KAAQP,KAAaQ,KAAUP,OAAe,KAAK,CAACC,EAAOG,CAAK,GAAGH,EAAOI,IAAI,CAAC,CAAC,CAAC,GACrFD,IAAQC;AAAA,IACV;AAEF,SAAOF;AACT;AAIO,SAASK,EAAwBlB,GAASmB,GAAkBC,GAAuC;AACxG,QAAMC,IAAQf,EAASR,EAAOqB,GAASnB,GAAGA,EAAE,IAAIA,EAAE,EAAE,GAAG,KAAK,GAAG,GAAG,EAAE;AAAA,IAClE,CAAC,CAACC,GAAIC,CAAE,OAAwB;AAAA,MAC9B,MAAM;AAAA,MACN,SAASD,IAAKC,KAAM;AAAA,MACpB,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,KAAKA,IAAKD,IAAK,IAAI,CAAC;AAAA,IAAA;AAAA,EAClD,GAEIqB,IAAUC,EAAiBzB,EAAOsB,GAAWpB,GAAGA,EAAE,IAAIA,EAAE,EAAE,CAAC,EAAE;AAAA,IACjE,OAAO,CAACqB,EAAM,KAAK,CAAAG,MAAK,KAAK,IAAIA,EAAE,SAASC,EAAI,MAAM,KAAKD,EAAE,QAAQC,EAAI,SAAS,IAAI,GAAG;AAAA,EAAA;AAE3F,SAAO,CAAC,GAAGJ,GAAO,GAAGC,CAAO;AAC9B;AAeA,SAASC,EAAiBhB,GAAqC;AAE7D,QAAMmB,IAAQpB,EAASC,GAAQ,MAAM,GAAG,CAAC,GACnCM,IAAyB,CAAA;AAC/B,WAASE,IAAI,GAAGA,IAAI,IAAIW,EAAM,UAAU;AACtC,UAAMC,IAAQD,EAAMX,IAAI,CAAC,EAAE,CAAC,IAAIW,EAAMX,CAAC,EAAE,CAAC;AAG1C,QAAIY,KAAS,QAAQA,KAAS,GAAG;AAC/B,YAAM1B,IAAKyB,EAAMX,CAAC,EAAE,CAAC,GACnBb,IAAKwB,EAAMX,IAAI,CAAC,EAAE,CAAC;AACrB,MAAAF,EAAI,KAAK,EAAE,MAAM,UAAU,SAASZ,IAAKC,KAAM,GAAG,OAAO,KAAK,IAAI,KAAKA,IAAKD,CAAE,GAAG,GACjFc,KAAK;AAAA,IACP,MAAO,CAAAA,KAAK;AAAA,EACd;AACA,SAAOF;AACT;AAGO,SAASe,EACd5B,GACA6B,GACAV,GACAC,GACe;AACf,QAAM,CAACU,GAAKC,CAAG,IAAIF,GACbR,IAAQvB,EAAOqB,GAASnB,GAAG8B,GAAKC,CAAG,GACnCT,IAAUxB,EAAOsB,GAAWpB,GAAG8B,GAAKC,CAAG;AAC7C,MAAIV,EAAM,UAAU,GAAG;AACrB,UAAMpB,IAAK,KAAK,IAAI6B,GAAK,KAAK,IAAI,GAAGT,CAAK,CAAC,GACrCnB,IAAK,KAAK,IAAI6B,GAAK,KAAK,IAAI,GAAGV,CAAK,CAAC,GACrCW,IAAQ,KAAK,IAAID,IAAMD,GAAK,KAAK,IAAI,KAAK5B,IAAKD,IAAK,GAAG,CAAC,GACxDgC,IAAS,KAAK,IAAIF,IAAMC,IAAQ,GAAG,KAAK,IAAIF,IAAME,IAAQ,IAAI/B,IAAKC,KAAM,CAAC,CAAC;AACjF,WAAO,EAAE,KAAA2B,GAAK,UAAU,CAAC,EAAE,MAAM,QAAQ,QAAAI,GAAQ,OAAAD,EAAA,CAAO,EAAA;AAAA,EAC1D;AACA,SAAIV,EAAQ,UAAU,IACb,EAAE,KAAAO,GAAK,UAAU,CAAC,EAAE,MAAM,UAAU,SAASC,IAAMC,KAAO,GAAG,OAAO,KAAK,IAAI,GAAGA,IAAMD,CAAG,EAAA,CAAG,EAAA,IAC9F,EAAE,KAAAD,GAAK,UAAU,CAAA,GAAI,SAASA,EAAA;AACvC;AAGO,SAASK,EAAalC,GAASmC,GAAkD;AACtF,QAAMxB,IAAS,CAAC,GAAGwB,CAAQ,EAAE,KAAK,CAACC,GAAGC,MAAMD,EAAE,CAAC,IAAIC,EAAE,CAAC,CAAC,GACjDC,IAA4B,CAAA;AAClC,MAAIxB,IAAQd,EAAE;AACd,aAAW,CAACuC,GAAKC,CAAG,KAAK7B;AACvB,IAAI4B,IAAMzB,KAAOwB,EAAM,KAAK,CAACxB,GAAOyB,CAAG,CAAC,GACxCzB,IAAQ,KAAK,IAAIA,GAAO0B,CAAG;AAE7B,SAAIxC,EAAE,KAAKc,KAAOwB,EAAM,KAAK,CAACxB,GAAOd,EAAE,EAAE,CAAC,GACnCsC;AACT;AAEO,MAAMG,IAAe,CAACzC,GAAS,MACpC0C,EAAM1C,GAAG,EAAE,MAAM,EACd,IAAI,OAAK2C,EAAE,QAAQ,CAAC,CAAC,EACrB,KAAK,GAAG;"}

package/dist/import/planImport.js

@@ -0,0 +1,233 @@
+import { enclosedRegions as N, spaceAt as L } from "../model/spaces.js";
+import { refreshPortals as O } from "../model/inference.js";
+import { MIN_SEGMENT as P, addBarrier as T, distance as F, barrierEnds as z, segmentProjection as v, centroid as B, OPENING_MIN_SEGMENT as _ } from "../model/geometry.js";
+import { createObject as I } from "../model/factory.js";
+import { addVirtualBoundary as D, normalizeBoundaries as V, boundaryRegions as W, bindSpaceToRegion as Y, boundaryEdges as A } from "../model/boundaries.js";
+import { VERTEX_LAYERS as X } from "./types.js";
+import { resolveEnvelopeOpenings as q, resolvePartitionGap as C, barrierSpans as H, openingLabel as J } from "./openings.js";
+import { symbolPoints as K, symbolVertices as Q, faceSegments as y, mergeRuns as S } from "./runs.js";
+import { pairWalls as G, closeCorners as U, addGap as Z, along as $, snapEnds as oo } from "./walls.js";
+function xo(n, i, u) {
+  const f = u.layers ?? X, { floorId: r } = u, s = {
+    walls: 0,
+    stairs: 0,
+    rooms: 0,
+    doors: 0,
+    windows: 0,
+    passages: 0,
+    named: 0,
+    skipped: []
+  }, o = to(i, f.interiorFace), { envelope: t, partitions: a } = no(o, f, s), c = K(o, f.doors), h = Q(o, f.windows), d = new Map(
+    t.map((e) => [e, q(e, c, h)])
+  ), m = /* @__PURE__ */ new Map();
+  for (const e of a) {
+    const p = e.gaps.map((l) => C(e, l, c, h));
+    d.set(
+      e,
+      p.flatMap((l) => l.openings)
+    ), m.set(
+      e,
+      p.flatMap((l) => l.passage ? [l.passage] : [])
+    );
+  }
+  return so(n, r, t, a, m, s), co(n, r, c, s), ro(n, r, o, f, s), io(n, r, a, m, s), ao(n, r, t, a, d, s), po(n, r, o, f, s), O(n), s;
+}
+function to(n, i) {
+  const u = y(n, i);
+  if (!u.length) throw new Error("Plan import: no interior wall faces found on the expected layer.");
+  const f = [
+    Math.min(...u.map((o) => o.axis === "h" ? o.lo : o.c)) - 1,
+    Math.max(...u.map((o) => o.axis === "h" ? o.hi : o.c)) + 1
+  ], r = [
+    Math.min(...u.map((o) => o.axis === "v" ? o.lo : o.c)) - 1,
+    Math.max(...u.map((o) => o.axis === "v" ? o.hi : o.c)) + 1
+  ], s = (o) => !!o && o[0] >= f[0] && o[0] <= f[1] && o[1] >= r[0] && o[1] <= r[1];
+  return n.filter((o) => {
+    var t;
+    return [o.a, o.b, o.at, o.center, (t = o.points) == null ? void 0 : t[0]].some(s);
+  });
+}
+function no(n, i, u) {
+  const f = [...y(n, i.exteriorFace), ...y(n, i.interiorFace)], r = S(f, 4.6, [0.6, 4.6]).filter((c) => c.hi - c.lo > 0.8), s = G(r, r, 0.2, 0.65, 0.8, "either");
+  U(s);
+  const o = [
+    ...S(y(n, i.exteriorFace), 4.6, [0.6, 4.6]),
+    ...S(y(n, i.interiorFace), 4.6, [0.6, 4.6])
+  ];
+  for (const c of s)
+    for (const h of o)
+      if (!(h.axis !== c.axis || Math.abs(h.c - c.c) > c.thickness / 2 + 0.05))
+        for (const d of h.gaps) Z(c, d);
+  const t = S(y(n, i.partitionFaces), 2.6, [0.6, 2.6]), a = G(t, t, 0.05, 0.35, 0.4, "both", "overlap").filter((c) => c.hi - c.lo >= P ? !0 : (u.skipped.push(`partition stub ${(c.hi - c.lo).toFixed(2)} m at ${$(c, c.lo).map((h) => h.toFixed(1))}`), !1));
+  return oo(a, [...s, ...a]), { envelope: s, partitions: a };
+}
+function so(n, i, u, f, r, s) {
+  var o;
+  for (const t of [...u, ...f]) {
+    for (const [a, c] of H(t, r.get(t) ?? [])) {
+      if (c - a < P) {
+        s.skipped.push(`wall piece under ${P} m at ${$(t, a).map((m) => m.toFixed(1))}`);
+        continue;
+      }
+      T(n, $(t, a), $(t, c), i, "wall");
+      const h = n.barriers.at(-1);
+      h.thickness = Math.max(0.05, t.thickness), h.name = u.includes(t) ? "Exterior wall" : "Partition";
+      const d = (o = n.floors.find((m) => m.id === i)) == null ? void 0 : o.height;
+      d && (h.height = d), s.walls++;
+    }
+    s.passages += (r.get(t) ?? []).length;
+  }
+  eo(n, i, s);
+}
+function eo(n, i, u) {
+  const f = new Map(n.junctions.map((o) => [o.id, o.position])), r = new Set(
+    n.barriers.filter((o) => {
+      if (o.floorId !== i) return !1;
+      const t = f.get(o.startId), a = f.get(o.endId);
+      return t && a && Math.hypot(a[0] - t[0], a[1] - t[1]) < P;
+    }).map((o) => o.id)
+  );
+  if (!r.size) return;
+  n.barriers = n.barriers.filter((o) => !r.has(o.id)), n.objects = n.objects.filter((o) => !o.barrierId || !r.has(o.barrierId));
+  const s = new Set(A(n).flatMap((o) => [o.startId, o.endId]));
+  n.junctions = n.junctions.filter((o) => s.has(o.id)), u.skipped.push(`${r.size} wall stub${r.size > 1 ? "s" : ""} under ${P} m`);
+}
+function io(n, i, u, f, r) {
+  for (const o of u)
+    for (const [t, a] of f.get(o) ?? []) D(n, i, $(o, t), $(o, a));
+  V(n, i);
+  const s = W(n, i);
+  if (!s.length) {
+    r.skipped.push("no enclosed regions: the walls do not close around anything");
+    return;
+  }
+  for (const o of s) {
+    const t = I("room", B(o.rings[0]), i, "Room");
+    try {
+      Y(n, t, o);
+    } catch (a) {
+      r.skipped.push(`room near ${t.position.map((c) => c.toFixed(2))}: ${a.message}`);
+      continue;
+    }
+    n.objects.push(t);
+  }
+  r.rooms = n.objects.filter((o) => o.kind === "room" && o.floorId === i).length;
+}
+function ao(n, i, u, f, r, s) {
+  for (const o of [...u, ...f])
+    for (const t of r.get(o) ?? []) {
+      const a = $(o, t.centre), c = J(o, t);
+      let h = null;
+      for (const e of n.barriers) {
+        if (e.floorId !== i) continue;
+        const [p, l] = z(n, e), g = Math.abs(p[1] - l[1]) < 0.01 ? "h" : Math.abs(p[0] - l[0]) < 0.01 ? "v" : null;
+        if (g !== o.axis) continue;
+        const [b, x] = g === "h" ? [0, 1] : [1, 0];
+        if (!(Math.abs(p[x] - a[x]) > 0.05) && !(a[b] < Math.min(p[b], l[b]) || a[b] > Math.max(p[b], l[b]))) {
+          h = { id: e.id, offset: Math.abs(a[b] - p[b]), length: Math.abs(l[b] - p[b]) };
+          break;
+        }
+      }
+      if (!h || h.length < _) {
+        s.skipped.push(`${t.kind} has no wall piece to sit in at ${c}`);
+        continue;
+      }
+      if (h.offset - t.width / 2 < 0.01 || h.offset + t.width / 2 > h.length - 0.01) {
+        s.skipped.push(`${t.kind} does not fit its wall at ${c}`);
+        continue;
+      }
+      if (n.objects.some(
+        (e) => e.barrierId === h.id && Math.abs((e.offset ?? 0) - h.offset) < (e.width + t.width) / 2 + 0.05
+      )) {
+        s.skipped.push(`${t.kind} overlapping another opening at ${c}`);
+        continue;
+      }
+      const m = I(t.kind, a, i, t.kind === "door" ? "Door" : "Window");
+      m.width = Math.round(t.width * 100) / 100, m.barrierId = h.id, m.offset = Math.round(h.offset * 1e3) / 1e3, m.rotation = o.axis === "h" ? 0 : 90, n.objects.push(m), t.kind === "door" ? s.doors++ : s.windows++;
+    }
+}
+function ro(n, i, u, f, r) {
+  if (!f.stairs) return;
+  const s = [];
+  for (const t of u)
+    if (f.stairs.test(t.layer) && (t.type === "LINE" && t.a && t.b && s.push([t.a, t.b]), t.type === "POLYLINE" && t.points))
+      for (let a = 1; a < t.points.length; a++) s.push([t.points[a - 1], t.points[a]]);
+  if (!s.length) return;
+  const o = [];
+  for (const t of s) {
+    const a = o.find((c) => c.some(([h, d]) => t.some((m) => F(m, h) < 1.5 || F(m, d) < 1.5)));
+    a ? a.push(t) : o.push([t]);
+  }
+  for (const t of o) {
+    const a = t.flat(), c = a.map((g) => g[0]), h = a.map((g) => g[1]), d = Math.max(...c) - Math.min(...c), m = Math.max(...h) - Math.min(...h);
+    if (Math.min(d, m) < 0.6 || Math.max(d, m) > 8) {
+      r.skipped.push(`stair symbol ${d.toFixed(1)} x ${m.toFixed(1)} m is not a flight`);
+      continue;
+    }
+    const e = [(Math.max(...c) + Math.min(...c)) / 2, (Math.max(...h) + Math.min(...h)) / 2], p = I("stairs", e, i, "Stairs"), l = m >= d;
+    p.width = l ? d : m, p.depth = l ? m : d, p.rotation = l ? 0 : 90, p.servedFloorIds = i ? [i] : [], n.objects.push(p), r.stairs++;
+  }
+}
+function co(n, i, u, f) {
+  var m;
+  const r = n.barriers.filter((e) => e.floorId === i), s = /* @__PURE__ */ new Map();
+  for (const e of r) for (const p of [e.startId, e.endId]) s.set(p, (s.get(p) ?? 0) + 1);
+  const o = (e) => n.junctions.find((p) => p.id === e).position, t = [...s].filter(([, e]) => e === 1).map(([e]) => e), a = N(n, i).length, c = [];
+  for (const e of t)
+    for (const p of s.keys()) {
+      if (e === p) continue;
+      const l = o(e), g = o(p), b = F(l, g);
+      if (b < 0.6 || b > 1.8) continue;
+      const x = Math.abs((Math.atan2(g[1] - l[1], g[0] - l[0]) * 180 / Math.PI % 90 + 90) % 90);
+      if (x < 8 || x > 82 || r.some((M) => {
+        const [E, j] = z(n, M);
+        return v(l, E, j).distance < 0.15 && v(g, E, j).distance < 0.15;
+      }))
+        continue;
+      const k = u.filter((M) => v(M, l, g).distance < 0.4).map((M) => v(M, l, g).t);
+      k.length < 6 || !k.some((M) => M < 0.2) || !k.some((M) => M > 0.8) || c.push({ from: e, to: p, span: b, score: k.length / b });
+    }
+  const h = /* @__PURE__ */ new Set();
+  let d = a;
+  for (const e of c.sort((p, l) => p.span - l.span || l.score - p.score)) {
+    if (h.has(e.from) || h.has(e.to) || (s.get(e.from) ?? 0) !== 1) continue;
+    const p = o(e.from), l = o(e.to), g = r.filter((w) => [e.from, e.to].includes(w.startId) || [e.from, e.to].includes(w.endId)), b = Math.max(0.05, Math.min(...g.map((w) => w.thickness), 0.2)), x = {
+      ...n,
+      junctions: [...n.junctions, { id: "probe-a", position: p, floorId: i }, { id: "probe-b", position: l, floorId: i }],
+      barriers: [
+        ...n.barriers,
+        { ...r[0], id: "probe", startId: "probe-a", endId: "probe-b", floorId: i, thickness: b }
+      ]
+    }, k = N(x, i).length;
+    if (k <= d) continue;
+    d = k, h.add(e.from), h.add(e.to), s.set(e.from, 2), T(n, p, l, i, "wall");
+    const M = n.barriers.at(-1);
+    M.thickness = b, M.name = "Partition";
+    const E = (m = n.floors.find((w) => w.id === i)) == null ? void 0 : m.height;
+    E && (M.height = E), f.walls++;
+    const j = F(p, l) - 2 * (b + 0.02);
+    if (j < 0.5) {
+      f.skipped.push(`bridged doorway too narrow to hold a door at ${p.map((w) => w.toFixed(1))}`);
+      continue;
+    }
+    const R = I("door", [(p[0] + l[0]) / 2, (p[1] + l[1]) / 2], i, "Door");
+    R.width = Math.round(j * 100) / 100, R.barrierId = M.id, R.offset = Math.round(F(p, l) / 2 * 1e3) / 1e3, n.objects.push(R), f.doors++;
+  }
+}
+function po(n, i, u, f, r) {
+  for (const s of u) {
+    if (s.type !== "TEXT" || !f.labels.test(s.layer) || !s.at || !s.text || /^[\d.,\s]+$/.test(s.text)) continue;
+    const o = L(n, i, s.at);
+    if (!o || o.floorId !== i) {
+      r.skipped.push(`label "${s.text}" stands in no room`);
+      continue;
+    }
+    o.name = s.text.trim(), r.named++;
+  }
+}
+export {
+  X as VERTEX_LAYERS,
+  co as bridgeDoorways,
+  xo as importPlanEntities
+};
+//# sourceMappingURL=planImport.js.map

package/dist/import/planImport.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"planImport.js","sources":["../../../../src/import/planImport.ts"],"sourcesContent":["// Deterministic import of measured CAD plan entities into a Kerros floor — the orchestrator.\n//\n// The input is the normalized, metre-unit entity JSON produced host-side from a DWG (see\n// scripts/plan-import/extract.mjs — `PlanEntity` in types.ts is the contract for its output). The\n// drawings this understands are the axis-aligned kind produced by Finnish prefab CAD: walls drawn\n// as parallel face-line pairs on semantic layers, openings as gaps in those faces, room labels as\n// text. runs.ts merges face fragments into runs; walls.ts pairs runs into walls and traces the\n// envelope ring; this file turns walls into a document.\n//\n// The method leans on machinery the editor already trusts rather than new geometry: walls become\n// barriers; doorless passages become virtual boundaries; rooms follow the bounded faces of that\n// shared network. Their usable polygons are generated from the walls, including wall thickness\n// and holes. Labels name whatever room they stand in via spaceAt. Runs inside a transact like every other authoring\n// operation, so a drawing this cannot digest refuses cleanly instead of importing garbage.\nimport {\n  MIN_SEGMENT,\n  OPENING_MIN_SEGMENT,\n  addBarrier,\n  addVirtualBoundary,\n  barrierEnds,\n  bindSpaceToRegion,\n  boundaryEdges,\n  boundaryRegions,\n  centroid,\n  createObject,\n  distance,\n  enclosedRegions,\n  normalizeBoundaries,\n  refreshPortals,\n  segmentProjection,\n  spaceAt,\n} from '../schema';\nimport type { Point, ProjectDocument } from '../schema';\nimport { VERTEX_LAYERS, type PlanEntity, type PlanImportOptions, type PlanImportReport } from './types';\nimport {\n  barrierSpans,\n  openingLabel,\n  resolveEnvelopeOpenings,\n  resolvePartitionGap,\n  type ResolvedOpening,\n} from './openings';\nimport { faceSegments, mergeRuns, symbolPoints, symbolVertices } from './runs';\nimport { addGap, along, closeCorners, pairWalls, snapEnds, type Wall } from './walls';\n\n/** Import a floor's worth of plan entities into `draft`. Call inside a transaction. */\nexport function importPlanEntities(\n  draft: ProjectDocument,\n  entities: PlanEntity[],\n  options: PlanImportOptions,\n): PlanImportReport {\n  const layers = options.layers ?? VERTEX_LAYERS;\n  const { floorId } = options;\n  const report: PlanImportReport = {\n    walls: 0,\n    stairs: 0,\n    rooms: 0,\n    doors: 0,\n    windows: 0,\n    passages: 0,\n    named: 0,\n    skipped: [],\n  };\n\n  const regional = planRegion(entities, layers.interiorFace);\n  const { envelope, partitions } = reconstructWalls(regional, layers, report);\n  const doorPts = symbolPoints(regional, layers.doors);\n  // Vertices, not samples: a window is read from where its jambs are, and sampling fills the glass\n  // between them. A door is read from the cloud its swing makes, and wants the samples.\n  const windowPts = symbolVertices(regional, layers.windows);\n  // Envelope openings come from symbol clusters; partition openings from the paired face gaps.\n  const openings = new Map<Wall, ResolvedOpening[]>(\n    envelope.map(w => [w, resolveEnvelopeOpenings(w, doorPts, windowPts)]),\n  );\n  const passages = new Map<Wall, [number, number][]>();\n  for (const w of partitions) {\n    const resolved = w.gaps.map(gap => resolvePartitionGap(w, gap, doorPts, windowPts));\n    openings.set(\n      w,\n      resolved.flatMap(r => r.openings),\n    );\n    passages.set(\n      w,\n      resolved.flatMap(r => (r.passage ? [r.passage] : [])),\n    );\n  }\n  emitBarriers(draft, floorId, envelope, partitions, passages, report);\n  // Before the rooms, because a bridged doorway is what closes the region they are read from.\n  bridgeDoorways(draft, floorId, doorPts, report);\n  emitStairs(draft, floorId, regional, layers, report);\n  emitRooms(draft, floorId, partitions, passages, report);\n  emitOpenings(draft, floorId, envelope, partitions, openings, report);\n  nameRooms(draft, floorId, regional, layers, report);\n  refreshPortals(draft);\n  return report;\n}\n\n/** The plan region is where the envelope's inner face lives; auxiliary views elsewhere in the\n *  drawing (sections, detail callouts) are outside it and ignored. */\nfunction planRegion(entities: PlanEntity[], interiorFace: RegExp): PlanEntity[] {\n  const inner = faceSegments(entities, interiorFace);\n  if (!inner.length) throw new Error('Plan import: no interior wall faces found on the expected layer.');\n  const rx = [\n    Math.min(...inner.map(s => (s.axis === 'h' ? s.lo : s.c))) - 1,\n    Math.max(...inner.map(s => (s.axis === 'h' ? s.hi : s.c))) + 1,\n  ];\n  const ry = [\n    Math.min(...inner.map(s => (s.axis === 'v' ? s.lo : s.c))) - 1,\n    Math.max(...inner.map(s => (s.axis === 'v' ? s.hi : s.c))) + 1,\n  ];\n  const inRegion = (p?: Point) => !!p && p[0] >= rx[0] && p[0] <= rx[1] && p[1] >= ry[0] && p[1] <= ry[1];\n  return entities.filter(e => [e.a, e.b, e.at, e.center, e.points?.[0]].some(inRegion));\n}\n\n/** Envelope and partition walls from the face layers. Prefab drawings put BOTH faces of the outer\n *  wall on the envelope layers (the silhouette continuous, the inner face broken at openings), so\n *  the wall pairs are found by self-pairing the pooled runs; opening gaps are then harvested from\n *  each face layer merged on its own, because an opening does not break every line of the wall. */\nfunction reconstructWalls(\n  regional: PlanEntity[],\n  layers: NonNullable<PlanImportOptions['layers']>,\n  report: PlanImportReport,\n): { envelope: Wall[]; partitions: Wall[] } {\n  const envelopePool = [...faceSegments(regional, layers.exteriorFace), ...faceSegments(regional, layers.interiorFace)];\n  const envelopeRuns = mergeRuns(envelopePool, 4.6, [0.6, 4.6]).filter(r => r.hi - r.lo > 0.8);\n  const envelope = pairWalls(envelopeRuns, envelopeRuns, 0.2, 0.65, 0.8, 'either');\n  closeCorners(envelope);\n  const faceGapRuns = [\n    ...mergeRuns(faceSegments(regional, layers.exteriorFace), 4.6, [0.6, 4.6]),\n    ...mergeRuns(faceSegments(regional, layers.interiorFace), 4.6, [0.6, 4.6]),\n  ];\n  for (const w of envelope)\n    for (const run of faceGapRuns) {\n      if (run.axis !== w.axis || Math.abs(run.c - w.c) > w.thickness / 2 + 0.05) continue;\n      for (const gap of run.gaps) addGap(w, gap);\n    }\n\n  // Doorless passages between rooms run wider than doorways — record breaks up to 2.6 m.\n  const partitionRuns = mergeRuns(faceSegments(regional, layers.partitionFaces), 2.6, [0.6, 2.6]);\n  const partitions = pairWalls(partitionRuns, partitionRuns, 0.05, 0.35, 0.4, 'both', 'overlap').filter(w => {\n    if (w.hi - w.lo >= MIN_SEGMENT) return true;\n    report.skipped.push(`partition stub ${(w.hi - w.lo).toFixed(2)} m at ${along(w, w.lo).map(v => v.toFixed(1))}`);\n    return false;\n  });\n  snapEnds(partitions, [...envelope, ...partitions]);\n  return { envelope, partitions };\n}\n\n/** Walls become barriers with their measured thickness. A doorless passage splits its wall into\n *  separate barrier pieces — the opening is the absence of wall, and sealing it with a continuous\n *  barrier would wall off two rooms the drawing says flow into each other. */\nfunction emitBarriers(\n  draft: ProjectDocument,\n  floorId: string | null,\n  envelope: Wall[],\n  partitions: Wall[],\n  passages: Map<Wall, [number, number][]>,\n  report: PlanImportReport,\n) {\n  for (const w of [...envelope, ...partitions]) {\n    for (const [lo, hi] of barrierSpans(w, passages.get(w) ?? [])) {\n      if (hi - lo < MIN_SEGMENT) {\n        report.skipped.push(`wall piece under ${MIN_SEGMENT} m at ${along(w, lo).map(v => v.toFixed(1))}`);\n        continue;\n      }\n      addBarrier(draft, along(w, lo), along(w, hi), floorId, 'wall');\n      const barrier = draft.barriers.at(-1)!;\n      barrier.thickness = Math.max(0.05, w.thickness);\n      barrier.name = envelope.includes(w) ? 'Exterior wall' : 'Partition';\n      // A plan is flat: the drawing says nothing about how tall its walls are, so take the storey\n      // the plan is being imported onto. Leaving addBarrier's generic default would stand 3.5 m\n      // walls on a 2.6 m floor — they punch through the storey above, and on a basement they rise\n      // out of the ground.\n      const storey = draft.floors.find(f => f.id === floorId)?.height;\n      if (storey) barrier.height = storey;\n      report.walls++;\n    }\n    report.passages += (passages.get(w) ?? []).length;\n  }\n  dropStubs(draft, floorId, report);\n}\n\n/** Adding a wall welds a junction wherever its end lands, which splits whatever already crossed\n *  there — so a wall ending close to another's end can leave behind a piece shorter than the plan is\n *  allowed to hold. The document is then refused, and the refusal names the rule rather than the\n *  drawing, which is no help at all to someone importing one. Drop the stubs instead, and the\n *  junctions they leave orphaned, and report how many. */\nfunction dropStubs(draft: ProjectDocument, floorId: string | null, report: PlanImportReport) {\n  const at = new Map(draft.junctions.map(j => [j.id, j.position]));\n  const stubs = new Set(\n    draft.barriers\n      .filter(b => {\n        if (b.floorId !== floorId) return false;\n        const p = at.get(b.startId),\n          q = at.get(b.endId);\n        return p && q && Math.hypot(q[0] - p[0], q[1] - p[1]) < MIN_SEGMENT;\n      })\n      .map(b => b.id),\n  );\n  if (!stubs.size) return;\n  draft.barriers = draft.barriers.filter(b => !stubs.has(b.id));\n  draft.objects = draft.objects.filter(o => !o.barrierId || !stubs.has(o.barrierId));\n  const used = new Set(boundaryEdges(draft).flatMap(b => [b.startId, b.endId]));\n  draft.junctions = draft.junctions.filter(j => used.has(j.id));\n  report.skipped.push(`${stubs.size} wall stub${stubs.size > 1 ? 's' : ''} under ${MIN_SEGMENT} m`);\n}\n\n/** Rooms share the measured wall network, including virtual edges across doorless passages. */\nfunction emitRooms(\n  draft: ProjectDocument,\n  floorId: string | null,\n  partitions: Wall[],\n  passages: Map<Wall, [number, number][]>,\n  report: PlanImportReport,\n) {\n  // A passage has no physical wall, but still divides two named rooms. Add only its missing\n  // centreline span; normalization joins it to both jambs and keeps the neighbouring wall IDs.\n  for (const w of partitions)\n    for (const [lo, hi] of passages.get(w) ?? []) addVirtualBoundary(draft, floorId, along(w, lo), along(w, hi));\n  normalizeBoundaries(draft, floorId);\n  const regions = boundaryRegions(draft, floorId);\n  if (!regions.length) {\n    report.skipped.push('no enclosed regions: the walls do not close around anything');\n    return;\n  }\n  for (const region of regions) {\n    const room = createObject('room', centroid(region.rings[0]), floorId, 'Room');\n    try {\n      bindSpaceToRegion(draft, room, region);\n    } catch (error) {\n      // Tiny or disconnected usable pieces cannot become labelled spaces. Keep their measured\n      // boundaries and report the unresolved region instead of exporting a stale polygon.\n      report.skipped.push(`room near ${room.position.map(v => v.toFixed(2))}: ${(error as Error).message}`);\n      continue;\n    }\n    draft.objects.push(room);\n  }\n  report.rooms = draft.objects.filter(o => o.kind === 'room' && o.floorId === floorId).length;\n}\n\n/** Resolved openings become wall-bound door/window objects on whichever barrier piece holds them.\n *  Doors sit where their symbols stand — not at the centre of the face break, which often spans a\n *  doorway AND the window beside it. The piece is looked up in the DOCUMENT, not remembered from\n *  emit: junction welds split barriers as later walls arrive, so only the document knows the\n *  pieces that actually exist. Unresolvable envelope gaps are reported, never guessed. */\nfunction emitOpenings(\n  draft: ProjectDocument,\n  floorId: string | null,\n  envelope: Wall[],\n  partitions: Wall[],\n  openings: Map<Wall, ResolvedOpening[]>,\n  report: PlanImportReport,\n) {\n  for (const w of [...envelope, ...partitions]) {\n    for (const o of openings.get(w) ?? []) {\n      const p = along(w, o.centre);\n      const label = openingLabel(w, o);\n      // The barrier piece under the opening: same floor, same axis, on the wall's line, containing\n      // the opening's centre.\n      let hit: { id: string; offset: number; length: number } | null = null;\n      for (const b of draft.barriers) {\n        if (b.floorId !== floorId) continue;\n        const [a, z] = barrierEnds(draft, b);\n        const axis = Math.abs(a[1] - z[1]) < 0.01 ? 'h' : Math.abs(a[0] - z[0]) < 0.01 ? 'v' : null;\n        if (axis !== w.axis) continue;\n        const [i, j] = axis === 'h' ? [0, 1] : [1, 0];\n        if (Math.abs(a[j] - p[j]) > 0.05) continue;\n        if (p[i] < Math.min(a[i], z[i]) || p[i] > Math.max(a[i], z[i])) continue;\n        hit = { id: b.id, offset: Math.abs(p[i] - a[i]), length: Math.abs(z[i] - a[i]) };\n        break;\n      }\n      if (!hit || hit.length < OPENING_MIN_SEGMENT) {\n        report.skipped.push(`${o.kind} has no wall piece to sit in at ${label}`);\n        continue;\n      }\n      if (hit.offset - o.width / 2 < 0.01 || hit.offset + o.width / 2 > hit.length - 0.01) {\n        report.skipped.push(`${o.kind} does not fit its wall at ${label}`);\n        continue;\n      }\n      const clash = draft.objects.some(\n        x => x.barrierId === hit!.id && Math.abs((x.offset ?? 0) - hit!.offset) < (x.width + o.width) / 2 + 0.05,\n      );\n      if (clash) {\n        report.skipped.push(`${o.kind} overlapping another opening at ${label}`);\n        continue;\n      }\n      const opening = createObject(o.kind, p, floorId, o.kind === 'door' ? 'Door' : 'Window');\n      opening.width = Math.round(o.width * 100) / 100;\n      opening.barrierId = hit.id;\n      opening.offset = Math.round(hit.offset * 1000) / 1000;\n      opening.rotation = w.axis === 'h' ? 0 : 90;\n      draft.objects.push(opening);\n      if (o.kind === 'door') report.doors++;\n      else report.windows++;\n    }\n  }\n}\n\n/** The flights of stairs the drawing shows, one object per stair.\n *\n *  A stair is drawn as its treads, on a layer of their own, and that block of parallel lines is the\n *  flight's footprint — where it stands, how wide it is, how far it runs and which way it climbs. All\n *  of which the importer had been throwing away: it read walls, openings, rooms and labels and no\n *  vertical circulation at all, so every stair and lift in an imported document was something a\n *  person added afterwards by hand.\n *\n *  A sheet only says what is on that storey, so each says its stair serves its own floor and no\n *  other. Where the same stair is drawn on the sheets above and below, importing them into one\n *  document puts the same flight in the same place on each — and `servedFloors` reads a shaft's\n *  reach across all of them, so the stair ends up connecting exactly the levels it is drawn on. A\n *  cellar with no stair drawn simply does not get one. */\nfunction emitStairs(\n  draft: ProjectDocument,\n  floorId: string | null,\n  regional: PlanEntity[],\n  layers: NonNullable<PlanImportOptions['layers']>,\n  report: PlanImportReport,\n) {\n  if (!layers.stairs) return;\n  const treads: [Point, Point][] = [];\n  for (const e of regional) {\n    if (!layers.stairs.test(e.layer)) continue;\n    if (e.type === 'LINE' && e.a && e.b) treads.push([e.a, e.b]);\n    if (e.type === 'POLYLINE' && e.points)\n      for (let i = 1; i < e.points.length; i++) treads.push([e.points[i - 1], e.points[i]]);\n  }\n  if (!treads.length) return;\n  // One stair, or several: a building can have a core at each end. Treads of the same flight touch\n  // or nearly touch; two cores are metres apart.\n  const flights: [Point, Point][][] = [];\n  for (const t of treads) {\n    const near = flights.find(g => g.some(([a, b]) => t.some(p => distance(p, a) < 1.5 || distance(p, b) < 1.5)));\n    if (near) near.push(t);\n    else flights.push([t]);\n  }\n  for (const group of flights) {\n    const pts = group.flat();\n    const xs = pts.map(p => p[0]),\n      ys = pts.map(p => p[1]);\n    const width = Math.max(...xs) - Math.min(...xs),\n      depth = Math.max(...ys) - Math.min(...ys);\n    // A flight is at least a stride wide and at least a stride long, and a staircase big enough to\n    // fill a room is something else drawn on the stair layer.\n    if (Math.min(width, depth) < 0.6 || Math.max(width, depth) > 8) {\n      report.skipped.push(`stair symbol ${width.toFixed(1)} x ${depth.toFixed(1)} m is not a flight`);\n      continue;\n    }\n    const centre: Point = [(Math.max(...xs) + Math.min(...xs)) / 2, (Math.max(...ys) + Math.min(...ys)) / 2];\n    const stair = createObject('stairs', centre, floorId, 'Stairs');\n    // A flight is longer the way you walk it than it is wide — treads are shallow and you need a lot\n    // of them — so the run lies along the LONGER side of the block the treads fill. Reading it off\n    // the tread lines instead does not work on the stair most buildings have: a switchback draws as\n    // many lines across the flights as along the stringers between them, and counting them just\n    // picks whichever the drawing happened to have more of.\n    const alongY = depth >= width;\n    stair.width = alongY ? width : depth;\n    stair.depth = alongY ? depth : width;\n    // The renderer runs a flight along the object's own depth axis, which points along -y unturned.\n    stair.rotation = alongY ? 0 : 90;\n    stair.servedFloorIds = floorId ? [floorId] : [];\n    draft.objects.push(stair);\n    report.stairs++;\n  }\n}\n\n/** Close an oblique doorway the Manhattan pass could not see.\n *\n *  The reconstruction reads axis-aligned faces, which is what a Finnish prefab drawing is made of —\n *  except where it is not. A room cut off at 45° leaves two wall ends dangling a metre or so apart\n *  with nothing between them but the door symbol drawn across the gap, and every axis-aligned pass\n *  drops all three: the faces because they are oblique, the wall because it has no faces, the door\n *  because it has no wall. The region then leaks and two rooms import as one.\n *\n *  What the drawing is actually saying there is legible without reading oblique geometry at all: two\n *  loose wall ends, a plausible door's distance apart, with door symbols standing on the line between\n *  them. That is a doorway, and this bridges it — a barrier on that line carrying the door.\n *\n *  Deliberately conservative. It fires only between ends that nothing else has claimed, only when the\n *  span is a door's width, and only when the drawing put a door symbol there: it can close a gap the\n *  drawing shows a door in, and it cannot invent a wall anywhere else. */\nexport function bridgeDoorways(\n  draft: ProjectDocument,\n  floorId: string | null,\n  doorPts: Point[],\n  report: PlanImportReport,\n) {\n  const mine = draft.barriers.filter(b => b.floorId === floorId);\n  // A loose end is a junction exactly one wall reaches: a wall that simply stops is the drawing\n  // admitting something is missing there.\n  const uses = new Map<string, number>();\n  for (const b of mine) for (const id of [b.startId, b.endId]) uses.set(id, (uses.get(id) ?? 0) + 1);\n  const at = (id: string) => draft.junctions.find(j => j.id === id)!.position;\n  const loose = [...uses].filter(([, n]) => n === 1).map(([id]) => id);\n  const before = enclosedRegions(draft, floorId).length;\n\n  type Candidate = { from: string; to: string; span: number; score: number };\n  const candidates: Candidate[] = [];\n  for (const from of loose)\n    for (const to of uses.keys()) {\n      if (from === to) continue;\n      const a = at(from),\n        b = at(to);\n      const span = distance(a, b);\n      // A door's worth of gap: a generous double door is 1.6 m, a single leaf 0.9. Shorter than\n      // 0.6 is a butt joint the snapping missed; wider than 1.8 is not a doorway, it is a room.\n      if (span < 0.6 || span > 1.8) continue;\n      // Axis-aligned gaps are the Manhattan pass's own business — a wall it broke, a passage it\n      // meant to leave. This is only for what it could not represent at all.\n      const angle = Math.abs(((((Math.atan2(b[1] - a[1], b[0] - a[0]) * 180) / Math.PI) % 90) + 90) % 90);\n      if (angle < 8 || angle > 82) continue;\n      // Nothing already runs along this line: a wall the Manhattan pass DID find is not a gap.\n      if (\n        mine.some(w => {\n          const [wa, wb] = barrierEnds(draft, w);\n          return segmentProjection(a, wa, wb).distance < 0.15 && segmentProjection(b, wa, wb).distance < 0.15;\n        })\n      )\n        continue;\n      // Door symbols standing ON the line and reaching BOTH ends of it. A swing sweeping past is\n      // not a door in the gap, and a symbol crowding one jamb is the door in the wall next to it.\n      const ts = doorPts.filter(q => segmentProjection(q, a, b).distance < 0.4).map(q => segmentProjection(q, a, b).t);\n      if (ts.length < 6) continue;\n      if (!ts.some(t => t < 0.2) || !ts.some(t => t > 0.8)) continue;\n      candidates.push({ from, to, span, score: ts.length / span });\n    }\n\n  // Strongest claim first. A junction takes part in one bridge and no more: a gap is one doorway,\n  // and without this the same gap is bridged twice — once from each end — and a corner sprouts a\n  // second doorway running off at another angle.\n  const claimed = new Set<string>();\n  let regions = before;\n  // Shortest first. Where two lines from one loose end both carry door symbols and both close a\n  // room, the doorway is the narrower: a door is the smallest gap that separates two places, and\n  // the longer line is the same doorway plus a diagonal across the room behind it.\n  for (const c of candidates.sort((x, y) => x.span - y.span || y.score - x.score)) {\n    if (claimed.has(c.from) || claimed.has(c.to) || (uses.get(c.from) ?? 0) !== 1) continue;\n    const a = at(c.from),\n      b = at(c.to);\n    const neighbours = mine.filter(w => [c.from, c.to].includes(w.startId) || [c.from, c.to].includes(w.endId));\n    const thickness = Math.max(0.05, Math.min(...neighbours.map(w => w.thickness), 0.2));\n    // The test that matters: does this actually close a room? A doorway is worth drawing where it\n    // separates two places and nowhere else, and a line that leaves the plan exactly as open as it\n    // was is a coincidence among the door symbols, not a wall. Probed on a copy, so a candidate that\n    // fails leaves nothing behind.\n    const probe: ProjectDocument = {\n      ...draft,\n      junctions: [...draft.junctions, { id: 'probe-a', position: a, floorId }, { id: 'probe-b', position: b, floorId }],\n      barriers: [\n        ...draft.barriers,\n        { ...mine[0], id: 'probe', startId: 'probe-a', endId: 'probe-b', floorId, thickness },\n      ],\n    };\n    const after = enclosedRegions(probe, floorId).length;\n    // Re-measured each time, not against the count this pass started with: a second bridge judged\n    // against a stale number is judged against a plan that no longer exists.\n    if (after <= regions) continue;\n    regions = after;\n    claimed.add(c.from);\n    claimed.add(c.to);\n    uses.set(c.from, 2);\n    addBarrier(draft, a, b, floorId, 'wall');\n    const wall = draft.barriers.at(-1)!;\n    wall.thickness = thickness;\n    wall.name = 'Partition';\n    const storey = draft.floors.find(f => f.id === floorId)?.height;\n    if (storey) wall.height = storey;\n    report.walls++;\n    // The doorway fills the span but for a jamb at each end — a door flush to a wall end is one the\n    // document will not hold.\n    const clear = distance(a, b) - 2 * (thickness + 0.02);\n    // Detection heuristic, not a schema limit: do not infer a doorway from a tiny gap.\n    if (clear < 0.5) {\n      report.skipped.push(`bridged doorway too narrow to hold a door at ${a.map(v => v.toFixed(1))}`);\n      continue;\n    }\n    const door = createObject('door', [(a[0] + b[0]) / 2, (a[1] + b[1]) / 2], floorId, 'Door');\n    door.width = Math.round(clear * 100) / 100;\n    door.barrierId = wall.id;\n    door.offset = Math.round((distance(a, b) / 2) * 1000) / 1000;\n    draft.objects.push(door);\n    report.doors++;\n  }\n}\n\n/** Each label christens the room it stands in. Pure numbers are the area figures — ignored. */\nfunction nameRooms(\n  draft: ProjectDocument,\n  floorId: string | null,\n  regional: PlanEntity[],\n  layers: NonNullable<PlanImportOptions['layers']>,\n  report: PlanImportReport,\n) {\n  for (const e of regional) {\n    if (e.type !== 'TEXT' || !layers.labels.test(e.layer) || !e.at || !e.text) continue;\n    if (/^[\\d.,\\s]+$/.test(e.text)) continue;\n    const room = spaceAt(draft, floorId, e.at);\n    if (!room || room.floorId !== floorId) {\n      report.skipped.push(`label \"${e.text}\" stands in no room`);\n      continue;\n    }\n    room.name = e.text.trim();\n    report.named++;\n  }\n}\n\nexport { VERTEX_LAYERS } from './types';\nexport type { PlanEntity, PlanImportOptions, PlanImportReport, PlanLayerMap } from './types';\n"],"names":["importPlanEntities","draft","entities","options","layers","VERTEX_LAYERS","floorId","report","regional","planRegion","envelope","partitions","reconstructWalls","doorPts","symbolPoints","windowPts","symbolVertices","openings","w","resolveEnvelopeOpenings","passages","resolved","gap","resolvePartitionGap","r","emitBarriers","bridgeDoorways","emitStairs","emitRooms","emitOpenings","nameRooms","refreshPortals","interiorFace","inner","faceSegments","rx","s","ry","inRegion","p","e","_a","envelopePool","envelopeRuns","mergeRuns","pairWalls","closeCorners","faceGapRuns","run","addGap","partitionRuns","MIN_SEGMENT","along","v","snapEnds","lo","hi","barrierSpans","addBarrier","barrier","storey","f","dropStubs","at","j","stubs","b","q","used","boundaryEdges","normalizeBoundaries","regions","boundaryRegions","region","room","createObject","centroid","bindSpaceToRegion","error","o","label","openingLabel","hit","a","z","barrierEnds","axis","i","OPENING_MIN_SEGMENT","x","opening","treads","flights","near","g","distance","group","pts","xs","ys","width","depth","centre","stair","alongY","mine","uses","id","loose","n","before","enclosedRegions","candidates","from","to","span","angle","wa","wb","segmentProjection","ts","t","claimed","c","y","neighbours","thickness","probe","after","wall","clear","door","spaceAt"],"mappings":";;;;;;;;;AA6CO,SAASA,GACdC,GACAC,GACAC,GACkB;AAClB,QAAMC,IAASD,EAAQ,UAAUE,GAC3B,EAAE,SAAAC,MAAYH,GACdI,IAA2B;AAAA,IAC/B,OAAO;AAAA,IACP,QAAQ;AAAA,IACR,OAAO;AAAA,IACP,OAAO;AAAA,IACP,SAAS;AAAA,IACT,UAAU;AAAA,IACV,OAAO;AAAA,IACP,SAAS,CAAA;AAAA,EAAC,GAGNC,IAAWC,GAAWP,GAAUE,EAAO,YAAY,GACnD,EAAE,UAAAM,GAAU,YAAAC,EAAA,IAAeC,GAAiBJ,GAAUJ,GAAQG,CAAM,GACpEM,IAAUC,EAAaN,GAAUJ,EAAO,KAAK,GAG7CW,IAAYC,EAAeR,GAAUJ,EAAO,OAAO,GAEnDa,IAAW,IAAI;AAAA,IACnBP,EAAS,IAAI,CAAAQ,MAAK,CAACA,GAAGC,EAAwBD,GAAGL,GAASE,CAAS,CAAC,CAAC;AAAA,EAAA,GAEjEK,wBAAe,IAAA;AACrB,aAAWF,KAAKP,GAAY;AAC1B,UAAMU,IAAWH,EAAE,KAAK,IAAI,CAAAI,MAAOC,EAAoBL,GAAGI,GAAKT,GAASE,CAAS,CAAC;AAClF,IAAAE,EAAS;AAAA,MACPC;AAAA,MACAG,EAAS,QAAQ,CAAAG,MAAKA,EAAE,QAAQ;AAAA,IAAA,GAElCJ,EAAS;AAAA,MACPF;AAAA,MACAG,EAAS,QAAQ,CAAAG,MAAMA,EAAE,UAAU,CAACA,EAAE,OAAO,IAAI,CAAA,CAAG;AAAA,IAAA;AAAA,EAExD;AACA,SAAAC,GAAaxB,GAAOK,GAASI,GAAUC,GAAYS,GAAUb,CAAM,GAEnEmB,GAAezB,GAAOK,GAASO,GAASN,CAAM,GAC9CoB,GAAW1B,GAAOK,GAASE,GAAUJ,GAAQG,CAAM,GACnDqB,GAAU3B,GAAOK,GAASK,GAAYS,GAAUb,CAAM,GACtDsB,GAAa5B,GAAOK,GAASI,GAAUC,GAAYM,GAAUV,CAAM,GACnEuB,GAAU7B,GAAOK,GAASE,GAAUJ,GAAQG,CAAM,GAClDwB,EAAe9B,CAAK,GACbM;AACT;AAIA,SAASE,GAAWP,GAAwB8B,GAAoC;AAC9E,QAAMC,IAAQC,EAAahC,GAAU8B,CAAY;AACjD,MAAI,CAACC,EAAM,OAAQ,OAAM,IAAI,MAAM,kEAAkE;AACrG,QAAME,IAAK;AAAA,IACT,KAAK,IAAI,GAAGF,EAAM,IAAI,CAAAG,MAAMA,EAAE,SAAS,MAAMA,EAAE,KAAKA,EAAE,CAAE,CAAC,IAAI;AAAA,IAC7D,KAAK,IAAI,GAAGH,EAAM,IAAI,CAAAG,MAAMA,EAAE,SAAS,MAAMA,EAAE,KAAKA,EAAE,CAAE,CAAC,IAAI;AAAA,EAAA,GAEzDC,IAAK;AAAA,IACT,KAAK,IAAI,GAAGJ,EAAM,IAAI,CAAAG,MAAMA,EAAE,SAAS,MAAMA,EAAE,KAAKA,EAAE,CAAE,CAAC,IAAI;AAAA,IAC7D,KAAK,IAAI,GAAGH,EAAM,IAAI,CAAAG,MAAMA,EAAE,SAAS,MAAMA,EAAE,KAAKA,EAAE,CAAE,CAAC,IAAI;AAAA,EAAA,GAEzDE,IAAW,CAACC,MAAc,CAAC,CAACA,KAAKA,EAAE,CAAC,KAAKJ,EAAG,CAAC,KAAKI,EAAE,CAAC,KAAKJ,EAAG,CAAC,KAAKI,EAAE,CAAC,KAAKF,EAAG,CAAC,KAAKE,EAAE,CAAC,KAAKF,EAAG,CAAC;AACtG,SAAOnC,EAAS,OAAO,CAAAsC,MAAA;;AAAK,YAACA,EAAE,GAAGA,EAAE,GAAGA,EAAE,IAAIA,EAAE,SAAQC,IAAAD,EAAE,WAAF,gBAAAC,EAAW,EAAE,EAAE,KAAKH,CAAQ;AAAA,GAAC;AACtF;AAMA,SAAS1B,GACPJ,GACAJ,GACAG,GAC0C;AAC1C,QAAMmC,IAAe,CAAC,GAAGR,EAAa1B,GAAUJ,EAAO,YAAY,GAAG,GAAG8B,EAAa1B,GAAUJ,EAAO,YAAY,CAAC,GAC9GuC,IAAeC,EAAUF,GAAc,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,OAAO,CAAAlB,MAAKA,EAAE,KAAKA,EAAE,KAAK,GAAG,GACrFd,IAAWmC,EAAUF,GAAcA,GAAc,KAAK,MAAM,KAAK,QAAQ;AAC/E,EAAAG,EAAapC,CAAQ;AACrB,QAAMqC,IAAc;AAAA,IAClB,GAAGH,EAAUV,EAAa1B,GAAUJ,EAAO,YAAY,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC;AAAA,IACzE,GAAGwC,EAAUV,EAAa1B,GAAUJ,EAAO,YAAY,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC;AAAA,EAAA;AAE3E,aAAWc,KAAKR;AACd,eAAWsC,KAAOD;AAChB,UAAI,EAAAC,EAAI,SAAS9B,EAAE,QAAQ,KAAK,IAAI8B,EAAI,IAAI9B,EAAE,CAAC,IAAIA,EAAE,YAAY,IAAI;AACrE,mBAAWI,KAAO0B,EAAI,KAAM,CAAAC,EAAO/B,GAAGI,CAAG;AAI7C,QAAM4B,IAAgBN,EAAUV,EAAa1B,GAAUJ,EAAO,cAAc,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,GACxFO,IAAakC,EAAUK,GAAeA,GAAe,MAAM,MAAM,KAAK,QAAQ,SAAS,EAAE,OAAO,CAAAhC,MAChGA,EAAE,KAAKA,EAAE,MAAMiC,IAAoB,MACvC5C,EAAO,QAAQ,KAAK,mBAAmBW,EAAE,KAAKA,EAAE,IAAI,QAAQ,CAAC,CAAC,SAASkC,EAAMlC,GAAGA,EAAE,EAAE,EAAE,IAAI,CAAAmC,MAAKA,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,GACvG,GACR;AACD,SAAAC,GAAS3C,GAAY,CAAC,GAAGD,GAAU,GAAGC,CAAU,CAAC,GAC1C,EAAE,UAAAD,GAAU,YAAAC,EAAA;AACrB;AAKA,SAASc,GACPxB,GACAK,GACAI,GACAC,GACAS,GACAb,GACA;;AACA,aAAWW,KAAK,CAAC,GAAGR,GAAU,GAAGC,CAAU,GAAG;AAC5C,eAAW,CAAC4C,GAAIC,CAAE,KAAKC,EAAavC,GAAGE,EAAS,IAAIF,CAAC,KAAK,CAAA,CAAE,GAAG;AAC7D,UAAIsC,IAAKD,IAAKJ,GAAa;AACzB,QAAA5C,EAAO,QAAQ,KAAK,oBAAoB4C,CAAW,SAASC,EAAMlC,GAAGqC,CAAE,EAAE,IAAI,OAAKF,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE;AACjG;AAAA,MACF;AACA,MAAAK,EAAWzD,GAAOmD,EAAMlC,GAAGqC,CAAE,GAAGH,EAAMlC,GAAGsC,CAAE,GAAGlD,GAAS,MAAM;AAC7D,YAAMqD,IAAU1D,EAAM,SAAS,GAAG,EAAE;AACpC,MAAA0D,EAAQ,YAAY,KAAK,IAAI,MAAMzC,EAAE,SAAS,GAC9CyC,EAAQ,OAAOjD,EAAS,SAASQ,CAAC,IAAI,kBAAkB;AAKxD,YAAM0C,KAASnB,IAAAxC,EAAM,OAAO,KAAK,OAAK4D,EAAE,OAAOvD,CAAO,MAAvC,gBAAAmC,EAA0C;AACzD,MAAImB,QAAgB,SAASA,IAC7BrD,EAAO;AAAA,IACT;AACA,IAAAA,EAAO,aAAaa,EAAS,IAAIF,CAAC,KAAK,CAAA,GAAI;AAAA,EAC7C;AACA,EAAA4C,GAAU7D,GAAOK,GAASC,CAAM;AAClC;AAOA,SAASuD,GAAU7D,GAAwBK,GAAwBC,GAA0B;AAC3F,QAAMwD,IAAK,IAAI,IAAI9D,EAAM,UAAU,IAAI,CAAA+D,MAAK,CAACA,EAAE,IAAIA,EAAE,QAAQ,CAAC,CAAC,GACzDC,IAAQ,IAAI;AAAA,IAChBhE,EAAM,SACH,OAAO,CAAAiE,MAAK;AACX,UAAIA,EAAE,YAAY5D,EAAS,QAAO;AAClC,YAAMiC,IAAIwB,EAAG,IAAIG,EAAE,OAAO,GACxBC,IAAIJ,EAAG,IAAIG,EAAE,KAAK;AACpB,aAAO3B,KAAK4B,KAAK,KAAK,MAAMA,EAAE,CAAC,IAAI5B,EAAE,CAAC,GAAG4B,EAAE,CAAC,IAAI5B,EAAE,CAAC,CAAC,IAAIY;AAAA,IAC1D,CAAC,EACA,IAAI,CAAAe,MAAKA,EAAE,EAAE;AAAA,EAAA;AAElB,MAAI,CAACD,EAAM,KAAM;AACjB,EAAAhE,EAAM,WAAWA,EAAM,SAAS,OAAO,CAAAiE,MAAK,CAACD,EAAM,IAAIC,EAAE,EAAE,CAAC,GAC5DjE,EAAM,UAAUA,EAAM,QAAQ,OAAO,CAAA,MAAK,CAAC,EAAE,aAAa,CAACgE,EAAM,IAAI,EAAE,SAAS,CAAC;AACjF,QAAMG,IAAO,IAAI,IAAIC,EAAcpE,CAAK,EAAE,QAAQ,CAAAiE,MAAK,CAACA,EAAE,SAASA,EAAE,KAAK,CAAC,CAAC;AAC5E,EAAAjE,EAAM,YAAYA,EAAM,UAAU,OAAO,OAAKmE,EAAK,IAAIJ,EAAE,EAAE,CAAC,GAC5DzD,EAAO,QAAQ,KAAK,GAAG0D,EAAM,IAAI,aAAaA,EAAM,OAAO,IAAI,MAAM,EAAE,UAAUd,CAAW,IAAI;AAClG;AAGA,SAASvB,GACP3B,GACAK,GACAK,GACAS,GACAb,GACA;AAGA,aAAWW,KAAKP;AACd,eAAW,CAAC4C,GAAIC,CAAE,KAAKpC,EAAS,IAAIF,CAAC,KAAK,MAAuBjB,GAAOK,GAAS8C,EAAMlC,GAAGqC,CAAE,GAAGH,EAAMlC,GAAGsC,CAAE,CAAC;AAC7G,EAAAc,EAAoBrE,GAAOK,CAAO;AAClC,QAAMiE,IAAUC,EAAgBvE,GAAOK,CAAO;AAC9C,MAAI,CAACiE,EAAQ,QAAQ;AACnB,IAAAhE,EAAO,QAAQ,KAAK,6DAA6D;AACjF;AAAA,EACF;AACA,aAAWkE,KAAUF,GAAS;AAC5B,UAAMG,IAAOC,EAAa,QAAQC,EAASH,EAAO,MAAM,CAAC,CAAC,GAAGnE,GAAS,MAAM;AAC5E,QAAI;AACF,MAAAuE,EAAkB5E,GAAOyE,GAAMD,CAAM;AAAA,IACvC,SAASK,GAAO;AAGd,MAAAvE,EAAO,QAAQ,KAAK,aAAamE,EAAK,SAAS,IAAI,CAAArB,MAAKA,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAMyB,EAAgB,OAAO,EAAE;AACpG;AAAA,IACF;AACA,IAAA7E,EAAM,QAAQ,KAAKyE,CAAI;AAAA,EACzB;AACA,EAAAnE,EAAO,QAAQN,EAAM,QAAQ,OAAO,CAAA,MAAK,EAAE,SAAS,UAAU,EAAE,YAAYK,CAAO,EAAE;AACvF;AAOA,SAASuB,GACP5B,GACAK,GACAI,GACAC,GACAM,GACAV,GACA;AACA,aAAWW,KAAK,CAAC,GAAGR,GAAU,GAAGC,CAAU;AACzC,eAAWoE,KAAK9D,EAAS,IAAIC,CAAC,KAAK,CAAA,GAAI;AACrC,YAAMqB,IAAIa,EAAMlC,GAAG6D,EAAE,MAAM,GACrBC,IAAQC,EAAa/D,GAAG6D,CAAC;AAG/B,UAAIG,IAA6D;AACjE,iBAAWhB,KAAKjE,EAAM,UAAU;AAC9B,YAAIiE,EAAE,YAAY5D,EAAS;AAC3B,cAAM,CAAC6E,GAAGC,CAAC,IAAIC,EAAYpF,GAAOiE,CAAC,GAC7BoB,IAAO,KAAK,IAAIH,EAAE,CAAC,IAAIC,EAAE,CAAC,CAAC,IAAI,OAAO,MAAM,KAAK,IAAID,EAAE,CAAC,IAAIC,EAAE,CAAC,CAAC,IAAI,OAAO,MAAM;AACvF,YAAIE,MAASpE,EAAE,KAAM;AACrB,cAAM,CAACqE,GAAGvB,CAAC,IAAIsB,MAAS,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AAC5C,YAAI,OAAK,IAAIH,EAAEnB,CAAC,IAAIzB,EAAEyB,CAAC,CAAC,IAAI,SACxB,EAAAzB,EAAEgD,CAAC,IAAI,KAAK,IAAIJ,EAAEI,CAAC,GAAGH,EAAEG,CAAC,CAAC,KAAKhD,EAAEgD,CAAC,IAAI,KAAK,IAAIJ,EAAEI,CAAC,GAAGH,EAAEG,CAAC,CAAC,IAC7D;AAAA,UAAAL,IAAM,EAAE,IAAIhB,EAAE,IAAI,QAAQ,KAAK,IAAI3B,EAAEgD,CAAC,IAAIJ,EAAEI,CAAC,CAAC,GAAG,QAAQ,KAAK,IAAIH,EAAEG,CAAC,IAAIJ,EAAEI,CAAC,CAAC,EAAA;AAC7E;AAAA;AAAA,MACF;AACA,UAAI,CAACL,KAAOA,EAAI,SAASM,GAAqB;AAC5C,QAAAjF,EAAO,QAAQ,KAAK,GAAGwE,EAAE,IAAI,mCAAmCC,CAAK,EAAE;AACvE;AAAA,MACF;AACA,UAAIE,EAAI,SAASH,EAAE,QAAQ,IAAI,QAAQG,EAAI,SAASH,EAAE,QAAQ,IAAIG,EAAI,SAAS,MAAM;AACnF,QAAA3E,EAAO,QAAQ,KAAK,GAAGwE,EAAE,IAAI,6BAA6BC,CAAK,EAAE;AACjE;AAAA,MACF;AAIA,UAHc/E,EAAM,QAAQ;AAAA,QAC1B,OAAKwF,EAAE,cAAcP,EAAK,MAAM,KAAK,KAAKO,EAAE,UAAU,KAAKP,EAAK,MAAM,KAAKO,EAAE,QAAQV,EAAE,SAAS,IAAI;AAAA,MAAA,GAE3F;AACT,QAAAxE,EAAO,QAAQ,KAAK,GAAGwE,EAAE,IAAI,mCAAmCC,CAAK,EAAE;AACvE;AAAA,MACF;AACA,YAAMU,IAAUf,EAAaI,EAAE,MAAMxC,GAAGjC,GAASyE,EAAE,SAAS,SAAS,SAAS,QAAQ;AACtF,MAAAW,EAAQ,QAAQ,KAAK,MAAMX,EAAE,QAAQ,GAAG,IAAI,KAC5CW,EAAQ,YAAYR,EAAI,IACxBQ,EAAQ,SAAS,KAAK,MAAMR,EAAI,SAAS,GAAI,IAAI,KACjDQ,EAAQ,WAAWxE,EAAE,SAAS,MAAM,IAAI,IACxCjB,EAAM,QAAQ,KAAKyF,CAAO,GACtBX,EAAE,SAAS,SAAQxE,EAAO,UACzBA,EAAO;AAAA,IACd;AAEJ;AAeA,SAASoB,GACP1B,GACAK,GACAE,GACAJ,GACAG,GACA;AACA,MAAI,CAACH,EAAO,OAAQ;AACpB,QAAMuF,IAA2B,CAAA;AACjC,aAAWnD,KAAKhC;AACd,QAAKJ,EAAO,OAAO,KAAKoC,EAAE,KAAK,MAC3BA,EAAE,SAAS,UAAUA,EAAE,KAAKA,EAAE,KAAGmD,EAAO,KAAK,CAACnD,EAAE,GAAGA,EAAE,CAAC,CAAC,GACvDA,EAAE,SAAS,cAAcA,EAAE;AAC7B,eAAS+C,IAAI,GAAGA,IAAI/C,EAAE,OAAO,QAAQ+C,IAAK,CAAAI,EAAO,KAAK,CAACnD,EAAE,OAAO+C,IAAI,CAAC,GAAG/C,EAAE,OAAO+C,CAAC,CAAC,CAAC;AAExF,MAAI,CAACI,EAAO,OAAQ;AAGpB,QAAMC,IAA8B,CAAA;AACpC,aAAW,KAAKD,GAAQ;AACtB,UAAME,IAAOD,EAAQ,KAAK,CAAAE,MAAKA,EAAE,KAAK,CAAC,CAACX,GAAGjB,CAAC,MAAM,EAAE,KAAK,CAAA3B,MAAKwD,EAASxD,GAAG4C,CAAC,IAAI,OAAOY,EAASxD,GAAG2B,CAAC,IAAI,GAAG,CAAC,CAAC;AAC5G,IAAI2B,IAAMA,EAAK,KAAK,CAAC,IAChBD,EAAQ,KAAK,CAAC,CAAC,CAAC;AAAA,EACvB;AACA,aAAWI,KAASJ,GAAS;AAC3B,UAAMK,IAAMD,EAAM,KAAA,GACZE,IAAKD,EAAI,IAAI,CAAA1D,MAAKA,EAAE,CAAC,CAAC,GAC1B4D,IAAKF,EAAI,IAAI,CAAA1D,MAAKA,EAAE,CAAC,CAAC,GAClB6D,IAAQ,KAAK,IAAI,GAAGF,CAAE,IAAI,KAAK,IAAI,GAAGA,CAAE,GAC5CG,IAAQ,KAAK,IAAI,GAAGF,CAAE,IAAI,KAAK,IAAI,GAAGA,CAAE;AAG1C,QAAI,KAAK,IAAIC,GAAOC,CAAK,IAAI,OAAO,KAAK,IAAID,GAAOC,CAAK,IAAI,GAAG;AAC9D,MAAA9F,EAAO,QAAQ,KAAK,gBAAgB6F,EAAM,QAAQ,CAAC,CAAC,MAAMC,EAAM,QAAQ,CAAC,CAAC,oBAAoB;AAC9F;AAAA,IACF;AACA,UAAMC,IAAgB,EAAE,KAAK,IAAI,GAAGJ,CAAE,IAAI,KAAK,IAAI,GAAGA,CAAE,KAAK,IAAI,KAAK,IAAI,GAAGC,CAAE,IAAI,KAAK,IAAI,GAAGA,CAAE,KAAK,CAAC,GACjGI,IAAQ5B,EAAa,UAAU2B,GAAQhG,GAAS,QAAQ,GAMxDkG,IAASH,KAASD;AACxB,IAAAG,EAAM,QAAQC,IAASJ,IAAQC,GAC/BE,EAAM,QAAQC,IAASH,IAAQD,GAE/BG,EAAM,WAAWC,IAAS,IAAI,IAC9BD,EAAM,iBAAiBjG,IAAU,CAACA,CAAO,IAAI,CAAA,GAC7CL,EAAM,QAAQ,KAAKsG,CAAK,GACxBhG,EAAO;AAAA,EACT;AACF;AAiBO,SAASmB,GACdzB,GACAK,GACAO,GACAN,GACA;;AACA,QAAMkG,IAAOxG,EAAM,SAAS,OAAO,CAAAiE,MAAKA,EAAE,YAAY5D,CAAO,GAGvDoG,wBAAW,IAAA;AACjB,aAAWxC,KAAKuC,EAAM,YAAWE,KAAM,CAACzC,EAAE,SAASA,EAAE,KAAK,EAAG,CAAAwC,EAAK,IAAIC,IAAKD,EAAK,IAAIC,CAAE,KAAK,KAAK,CAAC;AACjG,QAAM5C,IAAK,CAAC4C,MAAe1G,EAAM,UAAU,KAAK,CAAA+D,MAAKA,EAAE,OAAO2C,CAAE,EAAG,UAC7DC,IAAQ,CAAC,GAAGF,CAAI,EAAE,OAAO,CAAC,CAAA,EAAGG,CAAC,MAAMA,MAAM,CAAC,EAAE,IAAI,CAAC,CAACF,CAAE,MAAMA,CAAE,GAC7DG,IAASC,EAAgB9G,GAAOK,CAAO,EAAE,QAGzC0G,IAA0B,CAAA;AAChC,aAAWC,KAAQL;AACjB,eAAWM,KAAMR,EAAK,QAAQ;AAC5B,UAAIO,MAASC,EAAI;AACjB,YAAM/B,IAAIpB,EAAGkD,CAAI,GACf/C,IAAIH,EAAGmD,CAAE,GACLC,IAAOpB,EAASZ,GAAGjB,CAAC;AAG1B,UAAIiD,IAAO,OAAOA,IAAO,IAAK;AAG9B,YAAMC,IAAQ,KAAK,KAAQ,KAAK,MAAMlD,EAAE,CAAC,IAAIiB,EAAE,CAAC,GAAGjB,EAAE,CAAC,IAAIiB,EAAE,CAAC,CAAC,IAAI,MAAO,KAAK,KAAM,KAAM,MAAM,EAAE;AAGlG,UAFIiC,IAAQ,KAAKA,IAAQ,MAGvBX,EAAK,KAAK,CAAAvF,MAAK;AACb,cAAM,CAACmG,GAAIC,CAAE,IAAIjC,EAAYpF,GAAOiB,CAAC;AACrC,eAAOqG,EAAkBpC,GAAGkC,GAAIC,CAAE,EAAE,WAAW,QAAQC,EAAkBrD,GAAGmD,GAAIC,CAAE,EAAE,WAAW;AAAA,MACjG,CAAC;AAED;AAGF,YAAME,IAAK3G,EAAQ,OAAO,OAAK0G,EAAkBpD,GAAGgB,GAAGjB,CAAC,EAAE,WAAW,GAAG,EAAE,IAAI,CAAAC,MAAKoD,EAAkBpD,GAAGgB,GAAGjB,CAAC,EAAE,CAAC;AAC/G,MAAIsD,EAAG,SAAS,KACZ,CAACA,EAAG,KAAK,CAAAC,MAAKA,IAAI,GAAG,KAAK,CAACD,EAAG,KAAK,CAAAC,MAAKA,IAAI,GAAG,KACnDT,EAAW,KAAK,EAAE,MAAAC,GAAM,IAAAC,GAAI,MAAAC,GAAM,OAAOK,EAAG,SAASL,GAAM;AAAA,IAC7D;AAKF,QAAMO,wBAAc,IAAA;AACpB,MAAInD,IAAUuC;AAId,aAAWa,KAAKX,EAAW,KAAK,CAACvB,GAAGmC,MAAMnC,EAAE,OAAOmC,EAAE,QAAQA,EAAE,QAAQnC,EAAE,KAAK,GAAG;AAC/E,QAAIiC,EAAQ,IAAIC,EAAE,IAAI,KAAKD,EAAQ,IAAIC,EAAE,EAAE,MAAMjB,EAAK,IAAIiB,EAAE,IAAI,KAAK,OAAO,EAAG;AAC/E,UAAMxC,IAAIpB,EAAG4D,EAAE,IAAI,GACjBzD,IAAIH,EAAG4D,EAAE,EAAE,GACPE,IAAapB,EAAK,OAAO,CAAA,MAAK,CAACkB,EAAE,MAAMA,EAAE,EAAE,EAAE,SAAS,EAAE,OAAO,KAAK,CAACA,EAAE,MAAMA,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,GACpGG,IAAY,KAAK,IAAI,MAAM,KAAK,IAAI,GAAGD,EAAW,IAAI,CAAA,MAAK,EAAE,SAAS,GAAG,GAAG,CAAC,GAK7EE,IAAyB;AAAA,MAC7B,GAAG9H;AAAA,MACH,WAAW,CAAC,GAAGA,EAAM,WAAW,EAAE,IAAI,WAAW,UAAUkF,GAAG,SAAA7E,EAAA,GAAW,EAAE,IAAI,WAAW,UAAU4D,GAAG,SAAA5D,GAAS;AAAA,MAChH,UAAU;AAAA,QACR,GAAGL,EAAM;AAAA,QACT,EAAE,GAAGwG,EAAK,CAAC,GAAG,IAAI,SAAS,SAAS,WAAW,OAAO,WAAW,SAAAnG,GAAS,WAAAwH,EAAA;AAAA,MAAU;AAAA,IACtF,GAEIE,IAAQjB,EAAgBgB,GAAOzH,CAAO,EAAE;AAG9C,QAAI0H,KAASzD,EAAS;AACtB,IAAAA,IAAUyD,GACVN,EAAQ,IAAIC,EAAE,IAAI,GAClBD,EAAQ,IAAIC,EAAE,EAAE,GAChBjB,EAAK,IAAIiB,EAAE,MAAM,CAAC,GAClBjE,EAAWzD,GAAOkF,GAAGjB,GAAG5D,GAAS,MAAM;AACvC,UAAM2H,IAAOhI,EAAM,SAAS,GAAG,EAAE;AACjC,IAAAgI,EAAK,YAAYH,GACjBG,EAAK,OAAO;AACZ,UAAMrE,KAASnB,IAAAxC,EAAM,OAAO,KAAK,OAAK4D,EAAE,OAAOvD,CAAO,MAAvC,gBAAAmC,EAA0C;AACzD,IAAImB,QAAa,SAASA,IAC1BrD,EAAO;AAGP,UAAM2H,IAAQnC,EAASZ,GAAGjB,CAAC,IAAI,KAAK4D,IAAY;AAEhD,QAAII,IAAQ,KAAK;AACf,MAAA3H,EAAO,QAAQ,KAAK,gDAAgD4E,EAAE,IAAI,CAAA9B,MAAKA,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE;AAC9F;AAAA,IACF;AACA,UAAM8E,IAAOxD,EAAa,QAAQ,EAAEQ,EAAE,CAAC,IAAIjB,EAAE,CAAC,KAAK,IAAIiB,EAAE,CAAC,IAAIjB,EAAE,CAAC,KAAK,CAAC,GAAG5D,GAAS,MAAM;AACzF,IAAA6H,EAAK,QAAQ,KAAK,MAAMD,IAAQ,GAAG,IAAI,KACvCC,EAAK,YAAYF,EAAK,IACtBE,EAAK,SAAS,KAAK,MAAOpC,EAASZ,GAAGjB,CAAC,IAAI,IAAK,GAAI,IAAI,KACxDjE,EAAM,QAAQ,KAAKkI,CAAI,GACvB5H,EAAO;AAAA,EACT;AACF;AAGA,SAASuB,GACP7B,GACAK,GACAE,GACAJ,GACAG,GACA;AACA,aAAWiC,KAAKhC,GAAU;AAExB,QADIgC,EAAE,SAAS,UAAU,CAACpC,EAAO,OAAO,KAAKoC,EAAE,KAAK,KAAK,CAACA,EAAE,MAAM,CAACA,EAAE,QACjE,cAAc,KAAKA,EAAE,IAAI,EAAG;AAChC,UAAMkC,IAAO0D,EAAQnI,GAAOK,GAASkC,EAAE,EAAE;AACzC,QAAI,CAACkC,KAAQA,EAAK,YAAYpE,GAAS;AACrC,MAAAC,EAAO,QAAQ,KAAK,UAAUiC,EAAE,IAAI,qBAAqB;AACzD;AAAA,IACF;AACA,IAAAkC,EAAK,OAAOlC,EAAE,KAAK,KAAA,GACnBjC,EAAO;AAAA,EACT;AACF;"}

package/dist/import/register.js

@@ -0,0 +1,47 @@
+import "polygon-clipping";
+import { distance as u } from "../model/geometry.js";
+import { VERTEX_LAYERS as g } from "./types.js";
+function b(m, c, r) {
+  const o = (t) => t && [t[0] + c, t[1] + r];
+  return m.map((t) => {
+    var s;
+    return {
+      ...t,
+      a: o(t.a),
+      b: o(t.b),
+      at: o(t.at),
+      center: o(t.center),
+      points: (s = t.points) == null ? void 0 : s.map((i) => [i[0] + c, i[1] + r])
+    };
+  });
+}
+function l(m, c) {
+  const r = [];
+  for (const t of m)
+    if (c.test(t.layer) && (t.a && t.b && r.push([t.a, t.b]), t.points))
+      for (let s = 1; s < t.points.length; s++) r.push([t.points[s - 1], t.points[s]]);
+  const o = [];
+  for (const t of r) {
+    const s = o.find((i) => i.some(([h, f]) => t.some((a) => u(a, h) < 1.5 || u(a, f) < 1.5)));
+    s ? s.push(t) : o.push([t]);
+  }
+  return o.map((t) => {
+    const s = t.flat(), i = s.map((p) => p[0]), h = s.map((p) => p[1]), f = Math.min(...i), a = Math.max(...i), n = Math.min(...h), e = Math.max(...h);
+    return { centre: [(f + a) / 2, (n + e) / 2], width: a - f, height: e - n };
+  }).filter((t) => t.width > 0.5 && t.height > 0.5);
+}
+function w(m, c, r = g) {
+  if (!r.stairs) return null;
+  const o = l(m, r.stairs), t = l(c, r.stairs);
+  if (!o.length || !t.length) return null;
+  const s = (n, e) => Math.abs(n.width - e.width) < 0.06 && Math.abs(n.height - e.height) < 0.06, i = o.flatMap((n) => t.filter((e) => s(n, e)).map((e) => [n, e]));
+  if (!i.length) return null;
+  const h = i.map(([n, e]) => [n.centre[0] - e.centre[0], n.centre[1] - e.centre[1]]), f = h.map((n) => ({ o: n, n: h.filter((e) => u(e, n) <= 0.1).length })), a = f.reduce((n, e) => e.n > n.n ? e : n);
+  return f.some((n) => n.n === a.n && u(n.o, a.o) > 0.1) ? null : [Math.round(a.o[0] * 1e3) / 1e3, Math.round(a.o[1] * 1e3) / 1e3];
+}
+export {
+  l as landmarks,
+  w as sheetOffset,
+  b as shiftEntities
+};
+//# sourceMappingURL=register.js.map

package/dist/import/register.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"register.js","sources":["../../../../src/import/register.ts"],"sourcesContent":["// Putting several sheets of the same building into one frame.\n//\n// Floor plans are drawn one storey per sheet, and nothing says the sheets share an origin — they\n// rarely do. Imported as they come, the storeys of a building land metres apart, and the only fix\n// has been for a person to find something drawn on two sheets, measure the offset between them by\n// hand, and type the numbers into an import script. Those numbers are the most fragile thing in such\n// a script: they are correct for exactly one set of files, they cannot be checked by reading them,\n// and a redrawn sheet silently invalidates them.\n//\n// The building can say it instead. A stair core is drawn on every storey it passes, in the same place\n// on each, because that is what a stair is — so the offset between two sheets is the offset between\n// the stair they share.\nimport { distance } from '../schema';\nimport type { Point } from '../schema';\nimport type { PlanEntity } from './types';\nimport { VERTEX_LAYERS, type PlanLayerMap } from './types';\n\n/** Every entity moved by (dx, dy). Sheets are registered before import, not after: the reconstruction\n *  snaps and welds as it goes, and moving the result would mean re-deciding all of it. */\nexport function shiftEntities(entities: PlanEntity[], dx: number, dy: number): PlanEntity[] {\n  const move = (p: Point | undefined) => (p ? ([p[0] + dx, p[1] + dy] as Point) : p);\n  return entities.map(e => ({\n    ...e,\n    a: move(e.a),\n    b: move(e.b),\n    at: move(e.at),\n    center: move(e.center),\n    points: e.points?.map(p => [p[0] + dx, p[1] + dy] as Point),\n  }));\n}\n\nexport interface Landmark {\n  centre: Point;\n  width: number;\n  height: number;\n}\n\n/** The blocks a layer's geometry falls into — a stair core on a plan, and nothing else on that layer.\n *  Single-link clustering: strokes of one stair touch, and two cores are metres apart. */\nexport function landmarks(entities: PlanEntity[], layer: RegExp): Landmark[] {\n  const segments: [Point, Point][] = [];\n  for (const e of entities) {\n    if (!layer.test(e.layer)) continue;\n    if (e.a && e.b) segments.push([e.a, e.b]);\n    if (e.points) for (let i = 1; i < e.points.length; i++) segments.push([e.points[i - 1], e.points[i]]);\n  }\n  const groups: [Point, Point][][] = [];\n  for (const seg of segments) {\n    const near = groups.find(g => g.some(([a, b]) => seg.some(p => distance(p, a) < 1.5 || distance(p, b) < 1.5)));\n    if (near) near.push(seg);\n    else groups.push([seg]);\n  }\n  return groups\n    .map(g => {\n      const pts = g.flat();\n      const xs = pts.map(p => p[0]),\n        ys = pts.map(p => p[1]);\n      const x0 = Math.min(...xs),\n        x1 = Math.max(...xs),\n        y0 = Math.min(...ys),\n        y1 = Math.max(...ys);\n      return { centre: [(x0 + x1) / 2, (y0 + y1) / 2] as Point, width: x1 - x0, height: y1 - y0 };\n    })\n    .filter(l => l.width > 0.5 && l.height > 0.5);\n}\n\n/** The shift that puts `sheet` into `reference`'s frame, or null when they share no landmark.\n *\n *  Matching is by SIZE: a stair core is a particular 1.87 x 2.05 m block and the one on the storey\n *  above is the same block, while a second core at the other end of the building is a different one.\n *  Two sheets whose stairs are the same size but in genuinely different places would register\n *  wrongly, so the answer is only offered when exactly one pairing is plausible — a registration\n *  that might be wrong is worse than none, because nothing downstream can tell.\n *\n *  Returns null for a sheet with no stair drawn on it, which a cellar entered from outside will not\n *  have. There is nothing to match there and the caller must say where that storey goes. */\nexport function sheetOffset(\n  reference: PlanEntity[],\n  sheet: PlanEntity[],\n  layers: PlanLayerMap = VERTEX_LAYERS,\n): Point | null {\n  if (!layers.stairs) return null;\n  const here = landmarks(reference, layers.stairs),\n    there = landmarks(sheet, layers.stairs);\n  if (!here.length || !there.length) return null;\n  // 60 mm: two drawings of one stair differ by rounding, not by a step's worth.\n  const same = (a: Landmark, b: Landmark) => Math.abs(a.width - b.width) < 0.06 && Math.abs(a.height - b.height) < 0.06;\n  const pairs = here.flatMap(a => there.filter(b => same(a, b)).map(b => [a, b] as const));\n  if (!pairs.length) return null;\n  const offsets = pairs.map(([a, b]) => [a.centre[0] - b.centre[0], a.centre[1] - b.centre[1]] as Point);\n  // Every core is tried against every other, so a building with two cores produces the right shift\n  // twice — once per core, both agreeing — and the two cross-pairings once each, disagreeing. The\n  // shift the most pairings vote for is the one where the whole building lines up.\n  const votes = offsets.map(o => ({ o, n: offsets.filter(x => distance(x, o) <= 0.1).length }));\n  const best = votes.reduce((a, b) => (b.n > a.n ? b : a));\n  // A clear winner or nothing. Cores of the same size in genuinely different places give every\n  // pairing one vote, and a registration that might be wrong is worse than none: nothing downstream\n  // can tell the difference, and the storey lands metres out with no sign that it did.\n  if (votes.some(v => v.n === best.n && distance(v.o, best.o) > 0.1)) return null;\n  return [Math.round(best.o[0] * 1000) / 1000, Math.round(best.o[1] * 1000) / 1000];\n}\n"],"names":["shiftEntities","entities","dx","dy","move","p","e","_a","landmarks","layer","segments","i","groups","seg","near","g","a","b","distance","pts","xs","ys","x0","x1","y0","y1","l","sheetOffset","reference","sheet","layers","VERTEX_LAYERS","here","there","same","pairs","offsets","votes","o","x","best","v"],"mappings":";;;AAmBO,SAASA,EAAcC,GAAwBC,GAAYC,GAA0B;AAC1F,QAAMC,IAAO,CAACC,MAA0BA,KAAK,CAACA,EAAE,CAAC,IAAIH,GAAIG,EAAE,CAAC,IAAIF,CAAE;AAClE,SAAOF,EAAS,IAAI,CAAAK,MAAA;;AAAM;AAAA,MACxB,GAAGA;AAAA,MACH,GAAGF,EAAKE,EAAE,CAAC;AAAA,MACX,GAAGF,EAAKE,EAAE,CAAC;AAAA,MACX,IAAIF,EAAKE,EAAE,EAAE;AAAA,MACb,QAAQF,EAAKE,EAAE,MAAM;AAAA,MACrB,SAAQC,IAAAD,EAAE,WAAF,gBAAAC,EAAU,IAAI,OAAK,CAACF,EAAE,CAAC,IAAIH,GAAIG,EAAE,CAAC,IAAIF,CAAE;AAAA,IAAU;AAAA,GAC1D;AACJ;AAUO,SAASK,EAAUP,GAAwBQ,GAA2B;AAC3E,QAAMC,IAA6B,CAAA;AACnC,aAAWJ,KAAKL;AACd,QAAKQ,EAAM,KAAKH,EAAE,KAAK,MACnBA,EAAE,KAAKA,EAAE,KAAGI,EAAS,KAAK,CAACJ,EAAE,GAAGA,EAAE,CAAC,CAAC,GACpCA,EAAE;AAAQ,eAASK,IAAI,GAAGA,IAAIL,EAAE,OAAO,QAAQK,IAAK,CAAAD,EAAS,KAAK,CAACJ,EAAE,OAAOK,IAAI,CAAC,GAAGL,EAAE,OAAOK,CAAC,CAAC,CAAC;AAEtG,QAAMC,IAA6B,CAAA;AACnC,aAAWC,KAAOH,GAAU;AAC1B,UAAMI,IAAOF,EAAO,KAAK,CAAAG,MAAKA,EAAE,KAAK,CAAC,CAACC,GAAGC,CAAC,MAAMJ,EAAI,KAAK,CAAAR,MAAKa,EAASb,GAAGW,CAAC,IAAI,OAAOE,EAASb,GAAGY,CAAC,IAAI,GAAG,CAAC,CAAC;AAC7G,IAAIH,IAAMA,EAAK,KAAKD,CAAG,IAClBD,EAAO,KAAK,CAACC,CAAG,CAAC;AAAA,EACxB;AACA,SAAOD,EACJ,IAAI,CAAAG,MAAK;AACR,UAAMI,IAAMJ,EAAE,KAAA,GACRK,IAAKD,EAAI,IAAI,CAAA,MAAK,EAAE,CAAC,CAAC,GAC1BE,IAAKF,EAAI,IAAI,CAAA,MAAK,EAAE,CAAC,CAAC,GAClBG,IAAK,KAAK,IAAI,GAAGF,CAAE,GACvBG,IAAK,KAAK,IAAI,GAAGH,CAAE,GACnBI,IAAK,KAAK,IAAI,GAAGH,CAAE,GACnBI,IAAK,KAAK,IAAI,GAAGJ,CAAE;AACrB,WAAO,EAAE,QAAQ,EAAEC,IAAKC,KAAM,IAAIC,IAAKC,KAAM,CAAC,GAAY,OAAOF,IAAKD,GAAI,QAAQG,IAAKD,EAAA;AAAA,EACzF,CAAC,EACA,OAAO,CAAAE,MAAKA,EAAE,QAAQ,OAAOA,EAAE,SAAS,GAAG;AAChD;AAYO,SAASC,EACdC,GACAC,GACAC,IAAuBC,GACT;AACd,MAAI,CAACD,EAAO,OAAQ,QAAO;AAC3B,QAAME,IAAOxB,EAAUoB,GAAWE,EAAO,MAAM,GAC7CG,IAAQzB,EAAUqB,GAAOC,EAAO,MAAM;AACxC,MAAI,CAACE,EAAK,UAAU,CAACC,EAAM,OAAQ,QAAO;AAE1C,QAAMC,IAAO,CAAClB,GAAaC,MAAgB,KAAK,IAAID,EAAE,QAAQC,EAAE,KAAK,IAAI,QAAQ,KAAK,IAAID,EAAE,SAASC,EAAE,MAAM,IAAI,MAC3GkB,IAAQH,EAAK,QAAQ,OAAKC,EAAM,OAAO,OAAKC,EAAKlB,GAAGC,CAAC,CAAC,EAAE,IAAI,CAAAA,MAAK,CAACD,GAAGC,CAAC,CAAU,CAAC;AACvF,MAAI,CAACkB,EAAM,OAAQ,QAAO;AAC1B,QAAMC,IAAUD,EAAM,IAAI,CAAC,CAACnB,GAAGC,CAAC,MAAM,CAACD,EAAE,OAAO,CAAC,IAAIC,EAAE,OAAO,CAAC,GAAGD,EAAE,OAAO,CAAC,IAAIC,EAAE,OAAO,CAAC,CAAC,CAAU,GAI/FoB,IAAQD,EAAQ,IAAI,CAAAE,OAAM,EAAE,GAAAA,GAAG,GAAGF,EAAQ,OAAO,CAAAG,MAAKrB,EAASqB,GAAGD,CAAC,KAAK,GAAG,EAAE,SAAS,GACtFE,IAAOH,EAAM,OAAO,CAACrB,GAAGC,MAAOA,EAAE,IAAID,EAAE,IAAIC,IAAID,CAAE;AAIvD,SAAIqB,EAAM,KAAK,CAAAI,MAAKA,EAAE,MAAMD,EAAK,KAAKtB,EAASuB,EAAE,GAAGD,EAAK,CAAC,IAAI,GAAG,IAAU,OACpE,CAAC,KAAK,MAAMA,EAAK,EAAE,CAAC,IAAI,GAAI,IAAI,KAAM,KAAK,MAAMA,EAAK,EAAE,CAAC,IAAI,GAAI,IAAI,GAAI;AAClF;"}