@zukhruf/diagram 0.3.32 → 0.3.34

package/dist/lib/layouts/graph/path.js

@@ -0,0 +1,53 @@
+import { round } from "./round.js";
+
+/** The radius of the rounded corner the SVG path draws at each bend. */
+const CORNER_RADIUS = 8;
+
+/** Drops every point that lies on the straight line through its neighbours. */
+export function simplifyPath(path) {
+  if (path.length < 3) return path;
+  const result = [path[0]];
+  for (const [index, current] of path.slice(1, -1).entries()) {
+    const previous = result.at(-1);
+    const next = path[index + 2];
+    const cross = (current.x - previous.x) * (next.y - current.y) - (current.y - previous.y) * (next.x - current.x);
+    if (cross !== 0) result.push(current);
+  }
+  result.push(path.at(-1));
+  return result;
+}
+
+/** An SVG path through the points, with each bend rounded, and each number to the layout's precision. */
+export function pathToSvg(points) {
+  const [first, ...rest] = points;
+  if (!first) return '';
+  const at = ({
+    x,
+    y
+  }) => `${round(x)} ${round(y)}`;
+  const parts = [`M ${at(first)}`];
+  for (const [index, current] of rest.slice(0, -1).entries()) {
+    const previous = points[index];
+    const next = points[index + 2];
+    const dpx = current.x - previous.x;
+    const dpy = current.y - previous.y;
+    const dnx = next.x - current.x;
+    const dny = next.y - current.y;
+    const lp = Math.hypot(dpx, dpy);
+    const ln = Math.hypot(dnx, dny);
+    const r = Math.min(CORNER_RADIUS, lp / 2, ln / 2);
+    const cs = {
+      x: current.x - dpx / lp * r,
+      y: current.y - dpy / lp * r
+    };
+    const ce = {
+      x: current.x + dnx / ln * r,
+      y: current.y + dny / ln * r
+    };
+    parts.push(`L ${at(cs)}`, `Q ${at(current)} ${at(ce)}`);
+  }
+  const last = rest.at(-1);
+  if (last) parts.push(`L ${at(last)}`);
+  return parts.join(' ');
+}
+//# sourceMappingURL=path.js.map

package/dist/lib/layouts/graph/path.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path.js","names":["round","CORNER_RADIUS","simplifyPath","path","length","result","index","current","slice","entries","previous","at","next","cross","x","y","push","pathToSvg","points","first","rest","parts","dpx","dpy","dnx","dny","lp","Math","hypot","ln","r","min","cs","ce","last","join"],"sources":["../../../../src/lib/layouts/graph/path.ts"],"sourcesContent":["import type { Point } from '../../model/diagram-ir.ts';\nimport { round } from './round.ts';\n\n/** The radius of the rounded corner the SVG path draws at each bend. */\nconst CORNER_RADIUS = 8;\n\n/** Drops every point that lies on the straight line through its neighbours. */\nexport function simplifyPath(path: Point[]): Point[] {\n  if (path.length < 3) return path;\n  const result: Point[] = [path[0]!];\n  for (const [index, current] of path.slice(1, -1).entries()) {\n    const previous = result.at(-1)!;\n    const next = path[index + 2]!;\n    const cross =\n      (current.x - previous.x) * (next.y - current.y) -\n      (current.y - previous.y) * (next.x - current.x);\n    if (cross !== 0) result.push(current);\n  }\n  result.push(path.at(-1)!);\n  return result;\n}\n\n/** An SVG path through the points, with each bend rounded, and each number to the layout's precision. */\nexport function pathToSvg(points: Point[]): string {\n  const [first, ...rest] = points;\n  if (!first) return '';\n  const at = ({ x, y }: Point) => `${round(x)} ${round(y)}`;\n  const parts = [`M ${at(first)}`];\n  for (const [index, current] of rest.slice(0, -1).entries()) {\n    const previous = points[index]!;\n    const next = points[index + 2]!;\n    const dpx = current.x - previous.x;\n    const dpy = current.y - previous.y;\n    const dnx = next.x - current.x;\n    const dny = next.y - current.y;\n    const lp = Math.hypot(dpx, dpy);\n    const ln = Math.hypot(dnx, dny);\n    const r = Math.min(CORNER_RADIUS, lp / 2, ln / 2);\n    const cs = { x: current.x - (dpx / lp) * r, y: current.y - (dpy / lp) * r };\n    const ce = { x: current.x + (dnx / ln) * r, y: current.y + (dny / ln) * r };\n    parts.push(`L ${at(cs)}`, `Q ${at(current)} ${at(ce)}`);\n  }\n  const last = rest.at(-1);\n  if (last) parts.push(`L ${at(last)}`);\n  return parts.join(' ');\n}\n"],"mappings":"AACA,SAASA,KAAK,QAAQ,YAAY;;AAElC;AACA,MAAMC,aAAa,GAAG,CAAC;;AAEvB;AACA,OAAO,SAASC,YAAYA,CAACC,IAAa,EAAW;EACnD,IAAIA,IAAI,CAACC,MAAM,GAAG,CAAC,EAAE,OAAOD,IAAI;EAChC,MAAME,MAAe,GAAG,CAACF,IAAI,CAAC,CAAC,CAAC,CAAE;EAClC,KAAK,MAAM,CAACG,KAAK,EAAEC,OAAO,CAAC,IAAIJ,IAAI,CAACK,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAACC,OAAO,CAAC,CAAC,EAAE;IAC1D,MAAMC,QAAQ,GAAGL,MAAM,CAACM,EAAE,CAAC,CAAC,CAAC,CAAE;IAC/B,MAAMC,IAAI,GAAGT,IAAI,CAACG,KAAK,GAAG,CAAC,CAAE;IAC7B,MAAMO,KAAK,GACT,CAACN,OAAO,CAACO,CAAC,GAAGJ,QAAQ,CAACI,CAAC,KAAKF,IAAI,CAACG,CAAC,GAAGR,OAAO,CAACQ,CAAC,CAAC,GAC/C,CAACR,OAAO,CAACQ,CAAC,GAAGL,QAAQ,CAACK,CAAC,KAAKH,IAAI,CAACE,CAAC,GAAGP,OAAO,CAACO,CAAC,CAAC;IACjD,IAAID,KAAK,KAAK,CAAC,EAAER,MAAM,CAACW,IAAI,CAACT,OAAO,CAAC;EACvC;EACAF,MAAM,CAACW,IAAI,CAACb,IAAI,CAACQ,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;EACzB,OAAON,MAAM;AACf;;AAEA;AACA,OAAO,SAASY,SAASA,CAACC,MAAe,EAAU;EACjD,MAAM,CAACC,KAAK,EAAE,GAAGC,IAAI,CAAC,GAAGF,MAAM;EAC/B,IAAI,CAACC,KAAK,EAAE,OAAO,EAAE;EACrB,MAAMR,EAAE,GAAGA,CAAC;IAAEG,CAAC;IAAEC;EAAS,CAAC,KAAK,GAAGf,KAAK,CAACc,CAAC,CAAC,IAAId,KAAK,CAACe,CAAC,CAAC,EAAE;EACzD,MAAMM,KAAK,GAAG,CAAC,KAAKV,EAAE,CAACQ,KAAK,CAAC,EAAE,CAAC;EAChC,KAAK,MAAM,CAACb,KAAK,EAAEC,OAAO,CAAC,IAAIa,IAAI,CAACZ,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAACC,OAAO,CAAC,CAAC,EAAE;IAC1D,MAAMC,QAAQ,GAAGQ,MAAM,CAACZ,KAAK,CAAE;IAC/B,MAAMM,IAAI,GAAGM,MAAM,CAACZ,KAAK,GAAG,CAAC,CAAE;IAC/B,MAAMgB,GAAG,GAAGf,OAAO,CAACO,CAAC,GAAGJ,QAAQ,CAACI,CAAC;IAClC,MAAMS,GAAG,GAAGhB,OAAO,CAACQ,CAAC,GAAGL,QAAQ,CAACK,CAAC;IAClC,MAAMS,GAAG,GAAGZ,IAAI,CAACE,CAAC,GAAGP,OAAO,CAACO,CAAC;IAC9B,MAAMW,GAAG,GAAGb,IAAI,CAACG,CAAC,GAAGR,OAAO,CAACQ,CAAC;IAC9B,MAAMW,EAAE,GAAGC,IAAI,CAACC,KAAK,CAACN,GAAG,EAAEC,GAAG,CAAC;IAC/B,MAAMM,EAAE,GAAGF,IAAI,CAACC,KAAK,CAACJ,GAAG,EAAEC,GAAG,CAAC;IAC/B,MAAMK,CAAC,GAAGH,IAAI,CAACI,GAAG,CAAC9B,aAAa,EAAEyB,EAAE,GAAG,CAAC,EAAEG,EAAE,GAAG,CAAC,CAAC;IACjD,MAAMG,EAAE,GAAG;MAAElB,CAAC,EAAEP,OAAO,CAACO,CAAC,GAAIQ,GAAG,GAAGI,EAAE,GAAII,CAAC;MAAEf,CAAC,EAAER,OAAO,CAACQ,CAAC,GAAIQ,GAAG,GAAGG,EAAE,GAAII;IAAE,CAAC;IAC3E,MAAMG,EAAE,GAAG;MAAEnB,CAAC,EAAEP,OAAO,CAACO,CAAC,GAAIU,GAAG,GAAGK,EAAE,GAAIC,CAAC;MAAEf,CAAC,EAAER,OAAO,CAACQ,CAAC,GAAIU,GAAG,GAAGI,EAAE,GAAIC;IAAE,CAAC;IAC3ET,KAAK,CAACL,IAAI,CAAC,KAAKL,EAAE,CAACqB,EAAE,CAAC,EAAE,EAAE,KAAKrB,EAAE,CAACJ,OAAO,CAAC,IAAII,EAAE,CAACsB,EAAE,CAAC,EAAE,CAAC;EACzD;EACA,MAAMC,IAAI,GAAGd,IAAI,CAACT,EAAE,CAAC,CAAC,CAAC,CAAC;EACxB,IAAIuB,IAAI,EAAEb,KAAK,CAACL,IAAI,CAAC,KAAKL,EAAE,CAACuB,IAAI,CAAC,EAAE,CAAC;EACrC,OAAOb,KAAK,CAACc,IAAI,CAAC,GAAG,CAAC;AACxB","ignoreList":[]}

package/dist/lib/layouts/graph/round.d.ts

@@ -0,0 +1,11 @@
+import type { GraphLayout } from './graph-layout-result.ts';
+import type { RoutedGraph } from './route.ts';
+/** The value to DECIMALS decimals; `+ 0` turns a rounded -0 into 0. */
+export declare function round(value: number): number;
+/**
+ * The layout with every coordinate rounded to DECIMALS decimals, and each
+ * path drawn through the rounded points. The geometry before it keeps full
+ * precision, so the rounding happens once and does not drift.
+ */
+export declare function roundLayout(layout: Omit<GraphLayout, keyof RoutedGraph> & RoutedGraph): GraphLayout;
+//# sourceMappingURL=round.d.ts.map

package/dist/lib/layouts/graph/round.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"round.d.ts","sourceRoot":"","sources":["../../../../src/lib/layouts/graph/round.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAEV,WAAW,EAMZ,MAAM,0BAA0B,CAAC;AAElC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAM9C,uEAAuE;AACvE,wBAAgB,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE3C;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,IAAI,CAAC,WAAW,EAAE,MAAM,WAAW,CAAC,GAAG,WAAW,GACzD,WAAW,CAQb"}

package/dist/lib/layouts/graph/round.js

@@ -0,0 +1,181 @@
+import { pathToSvg } from "./path.js";
+/** How many decimals every coordinate the layout returns keeps. */
+const DECIMALS = 2;
+const SCALE = 10 ** DECIMALS;
+
+/** The value to DECIMALS decimals; `+ 0` turns a rounded -0 into 0. */
+export function round(value) {
+  return Math.round(value * SCALE) / SCALE + 0;
+}
+
+/**
+ * The layout with every coordinate rounded to DECIMALS decimals, and each
+ * path drawn through the rounded points. The geometry before it keeps full
+ * precision, so the rounding happens once and does not drift.
+ */
+export function roundLayout(layout) {
+  return {
+    nodes: layout.nodes.map(roundNode),
+    groups: layout.groups.map(roundGroup),
+    edges: layout.edges.map(roundEdge),
+    leaders: layout.leaders.map(roundLeader),
+    viewBox: roundBox(layout.viewBox)
+  };
+}
+function roundEdge({
+  points,
+  label,
+  badge,
+  ...edge
+}) {
+  const rounded = points.map(roundPoint);
+  return {
+    ...edge,
+    points: rounded,
+    d: pathToSvg(rounded),
+    ...(label && {
+      label: {
+        box: roundBox(label.box),
+        text: label.text.map(roundRun)
+      }
+    }),
+    ...(badge && {
+      badge: {
+        box: roundBox(badge.box),
+        ...(badge.icon && {
+          icon: roundBox(badge.icon)
+        }),
+        text: badge.text.map(roundRun)
+      }
+    })
+  };
+}
+function roundLeader({
+  points,
+  ...leader
+}) {
+  const rounded = points.map(roundPoint);
+  return {
+    ...leader,
+    points: rounded,
+    d: pathToSvg(rounded)
+  };
+}
+function roundNode({
+  box,
+  visual,
+  frames,
+  icon,
+  text,
+  bullets,
+  contentBox,
+  caption,
+  ports,
+  appliance,
+  ...node
+}) {
+  return {
+    ...node,
+    box: roundBox(box),
+    visual: roundBox(visual),
+    frames: frames.map(roundBox),
+    ...(icon && {
+      icon: {
+        x: round(icon.x),
+        y: round(icon.y),
+        size: round(icon.size)
+      }
+    }),
+    text: text.map(roundRun),
+    bullets: bullets.map(roundPoint),
+    ...(contentBox && {
+      contentBox: roundBox(contentBox)
+    }),
+    ...(caption && {
+      caption: {
+        box: roundBox(caption.box),
+        framed: caption.framed,
+        text: caption.text.map(roundRun)
+      }
+    }),
+    ports: ports.map(roundPort),
+    ...(appliance && {
+      appliance: {
+        body: appliance.body.map(roundPoint),
+        face: roundLine(appliance.face),
+        antenna: appliance.antenna.map(roundLine),
+        jacks: appliance.jacks.map(roundBox)
+      }
+    })
+  };
+}
+function roundGroup({
+  rect,
+  band,
+  separator,
+  label,
+  dividers,
+  ports,
+  ...group
+}) {
+  return {
+    ...group,
+    rect: roundBox(rect),
+    ...(band && {
+      band: roundBox(band)
+    }),
+    ...(separator && {
+      separator: roundLine(separator)
+    }),
+    label: label.map(roundRun),
+    dividers: dividers.map(roundLine),
+    ports: ports.map(roundPort)
+  };
+}
+function roundPort({
+  point,
+  label,
+  ...port
+}) {
+  return {
+    ...port,
+    point: roundPoint(point),
+    ...(label && {
+      label: roundRun(label)
+    })
+  };
+}
+function roundRun(run) {
+  return {
+    ...run,
+    x: round(run.x),
+    y: round(run.y),
+    bounds: roundBox(run.bounds)
+  };
+}
+function roundLine([a, b]) {
+  return [roundPoint(a), roundPoint(b)];
+}
+function roundPoint({
+  x,
+  y
+}) {
+  return {
+    x: round(x),
+    y: round(y)
+  };
+}
+function roundBox({
+  x,
+  y,
+  w,
+  h
+}) {
+  return {
+    x: round(x),
+    y: round(y),
+    w: round(w),
+    h: round(h)
+  };
+}
+//# sourceMappingURL=round.js.map

package/dist/lib/layouts/graph/round.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"round.js","names":["pathToSvg","DECIMALS","SCALE","round","value","Math","roundLayout","layout","nodes","map","roundNode","groups","roundGroup","edges","roundEdge","leaders","roundLeader","viewBox","roundBox","points","label","badge","edge","rounded","roundPoint","d","box","text","roundRun","icon","leader","visual","frames","bullets","contentBox","caption","ports","appliance","node","x","y","size","framed","roundPort","body","face","roundLine","antenna","jacks","rect","band","separator","dividers","group","point","port","run","bounds","a","b","w","h"],"sources":["../../../../src/lib/layouts/graph/round.ts"],"sourcesContent":["import type { Box, Point } from '../../model/diagram-ir.ts';\nimport type {\n  EdgeLayout,\n  GraphLayout,\n  GroupLayout,\n  LeaderLayout,\n  NodeLayout,\n  PortLayout,\n  TextRun,\n} from './graph-layout-result.ts';\nimport { pathToSvg } from './path.ts';\nimport type { RoutedGraph } from './route.ts';\n\n/** How many decimals every coordinate the layout returns keeps. */\nconst DECIMALS = 2;\nconst SCALE = 10 ** DECIMALS;\n\n/** The value to DECIMALS decimals; `+ 0` turns a rounded -0 into 0. */\nexport function round(value: number): number {\n  return Math.round(value * SCALE) / SCALE + 0;\n}\n\n/**\n * The layout with every coordinate rounded to DECIMALS decimals, and each\n * path drawn through the rounded points. The geometry before it keeps full\n * precision, so the rounding happens once and does not drift.\n */\nexport function roundLayout(\n  layout: Omit<GraphLayout, keyof RoutedGraph> & RoutedGraph,\n): GraphLayout {\n  return {\n    nodes: layout.nodes.map(roundNode),\n    groups: layout.groups.map(roundGroup),\n    edges: layout.edges.map(roundEdge),\n    leaders: layout.leaders.map(roundLeader),\n    viewBox: roundBox(layout.viewBox),\n  };\n}\n\nfunction roundEdge({\n  points,\n  label,\n  badge,\n  ...edge\n}: RoutedGraph['edges'][number]): EdgeLayout {\n  const rounded = points.map(roundPoint);\n  return {\n    ...edge,\n    points: rounded,\n    d: pathToSvg(rounded),\n    ...(label && {\n      label: { box: roundBox(label.box), text: label.text.map(roundRun) },\n    }),\n    ...(badge && {\n      badge: {\n        box: roundBox(badge.box),\n        ...(badge.icon && { icon: roundBox(badge.icon) }),\n        text: badge.text.map(roundRun),\n      },\n    }),\n  };\n}\n\nfunction roundLeader({\n  points,\n  ...leader\n}: RoutedGraph['leaders'][number]): LeaderLayout {\n  const rounded = points.map(roundPoint);\n  return { ...leader, points: rounded, d: pathToSvg(rounded) };\n}\n\nfunction roundNode({\n  box,\n  visual,\n  frames,\n  icon,\n  text,\n  bullets,\n  contentBox,\n  caption,\n  ports,\n  appliance,\n  ...node\n}: NodeLayout): NodeLayout {\n  return {\n    ...node,\n    box: roundBox(box),\n    visual: roundBox(visual),\n    frames: frames.map(roundBox),\n    ...(icon && {\n      icon: { x: round(icon.x), y: round(icon.y), size: round(icon.size) },\n    }),\n    text: text.map(roundRun),\n    bullets: bullets.map(roundPoint),\n    ...(contentBox && { contentBox: roundBox(contentBox) }),\n    ...(caption && {\n      caption: {\n        box: roundBox(caption.box),\n        framed: caption.framed,\n        text: caption.text.map(roundRun),\n      },\n    }),\n    ports: ports.map(roundPort),\n    ...(appliance && {\n      appliance: {\n        body: appliance.body.map(roundPoint),\n        face: roundLine(appliance.face),\n        antenna: appliance.antenna.map(roundLine),\n        jacks: appliance.jacks.map(roundBox),\n      },\n    }),\n  };\n}\n\nfunction roundGroup({\n  rect,\n  band,\n  separator,\n  label,\n  dividers,\n  ports,\n  ...group\n}: GroupLayout): GroupLayout {\n  return {\n    ...group,\n    rect: roundBox(rect),\n    ...(band && { band: roundBox(band) }),\n    ...(separator && { separator: roundLine(separator) }),\n    label: label.map(roundRun),\n    dividers: dividers.map(roundLine),\n    ports: ports.map(roundPort),\n  };\n}\n\nfunction roundPort({ point, label, ...port }: PortLayout): PortLayout {\n  return {\n    ...port,\n    point: roundPoint(point),\n    ...(label && { label: roundRun(label) }),\n  };\n}\n\nfunction roundRun(run: TextRun): TextRun {\n  return {\n    ...run,\n    x: round(run.x),\n    y: round(run.y),\n    bounds: roundBox(run.bounds),\n  };\n}\n\nfunction roundLine([a, b]: [Point, Point]): [Point, Point] {\n  return [roundPoint(a), roundPoint(b)];\n}\n\nfunction roundPoint({ x, y }: Point): Point {\n  return { x: round(x), y: round(y) };\n}\n\nfunction roundBox({ x, y, w, h }: Box): Box {\n  return { x: round(x), y: round(y), w: round(w), h: round(h) };\n}\n"],"mappings":"AAUA,SAASA,SAAS,QAAQ,WAAW;AAGrC;AACA,MAAMC,QAAQ,GAAG,CAAC;AAClB,MAAMC,KAAK,GAAG,EAAE,IAAID,QAAQ;;AAE5B;AACA,OAAO,SAASE,KAAKA,CAACC,KAAa,EAAU;EAC3C,OAAOC,IAAI,CAACF,KAAK,CAACC,KAAK,GAAGF,KAAK,CAAC,GAAGA,KAAK,GAAG,CAAC;AAC9C;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASI,WAAWA,CACzBC,MAA0D,EAC7C;EACb,OAAO;IACLC,KAAK,EAAED,MAAM,CAACC,KAAK,CAACC,GAAG,CAACC,SAAS,CAAC;IAClCC,MAAM,EAAEJ,MAAM,CAACI,MAAM,CAACF,GAAG,CAACG,UAAU,CAAC;IACrCC,KAAK,EAAEN,MAAM,CAACM,KAAK,CAACJ,GAAG,CAACK,SAAS,CAAC;IAClCC,OAAO,EAAER,MAAM,CAACQ,OAAO,CAACN,GAAG,CAACO,WAAW,CAAC;IACxCC,OAAO,EAAEC,QAAQ,CAACX,MAAM,CAACU,OAAO;EAClC,CAAC;AACH;AAEA,SAASH,SAASA,CAAC;EACjBK,MAAM;EACNC,KAAK;EACLC,KAAK;EACL,GAAGC;AACyB,CAAC,EAAc;EAC3C,MAAMC,OAAO,GAAGJ,MAAM,CAACV,GAAG,CAACe,UAAU,CAAC;EACtC,OAAO;IACL,GAAGF,IAAI;IACPH,MAAM,EAAEI,OAAO;IACfE,CAAC,EAAEzB,SAAS,CAACuB,OAAO,CAAC;IACrB,IAAIH,KAAK,IAAI;MACXA,KAAK,EAAE;QAAEM,GAAG,EAAER,QAAQ,CAACE,KAAK,CAACM,GAAG,CAAC;QAAEC,IAAI,EAAEP,KAAK,CAACO,IAAI,CAAClB,GAAG,CAACmB,QAAQ;MAAE;IACpE,CAAC,CAAC;IACF,IAAIP,KAAK,IAAI;MACXA,KAAK,EAAE;QACLK,GAAG,EAAER,QAAQ,CAACG,KAAK,CAACK,GAAG,CAAC;QACxB,IAAIL,KAAK,CAACQ,IAAI,IAAI;UAAEA,IAAI,EAAEX,QAAQ,CAACG,KAAK,CAACQ,IAAI;QAAE,CAAC,CAAC;QACjDF,IAAI,EAAEN,KAAK,CAACM,IAAI,CAAClB,GAAG,CAACmB,QAAQ;MAC/B;IACF,CAAC;EACH,CAAC;AACH;AAEA,SAASZ,WAAWA,CAAC;EACnBG,MAAM;EACN,GAAGW;AAC2B,CAAC,EAAgB;EAC/C,MAAMP,OAAO,GAAGJ,MAAM,CAACV,GAAG,CAACe,UAAU,CAAC;EACtC,OAAO;IAAE,GAAGM,MAAM;IAAEX,MAAM,EAAEI,OAAO;IAAEE,CAAC,EAAEzB,SAAS,CAACuB,OAAO;EAAE,CAAC;AAC9D;AAEA,SAASb,SAASA,CAAC;EACjBgB,GAAG;EACHK,MAAM;EACNC,MAAM;EACNH,IAAI;EACJF,IAAI;EACJM,OAAO;EACPC,UAAU;EACVC,OAAO;EACPC,KAAK;EACLC,SAAS;EACT,GAAGC;AACO,CAAC,EAAc;EACzB,OAAO;IACL,GAAGA,IAAI;IACPZ,GAAG,EAAER,QAAQ,CAACQ,GAAG,CAAC;IAClBK,MAAM,EAAEb,QAAQ,CAACa,MAAM,CAAC;IACxBC,MAAM,EAAEA,MAAM,CAACvB,GAAG,CAACS,QAAQ,CAAC;IAC5B,IAAIW,IAAI,IAAI;MACVA,IAAI,EAAE;QAAEU,CAAC,EAAEpC,KAAK,CAAC0B,IAAI,CAACU,CAAC,CAAC;QAAEC,CAAC,EAAErC,KAAK,CAAC0B,IAAI,CAACW,CAAC,CAAC;QAAEC,IAAI,EAAEtC,KAAK,CAAC0B,IAAI,CAACY,IAAI;MAAE;IACrE,CAAC,CAAC;IACFd,IAAI,EAAEA,IAAI,CAAClB,GAAG,CAACmB,QAAQ,CAAC;IACxBK,OAAO,EAAEA,OAAO,CAACxB,GAAG,CAACe,UAAU,CAAC;IAChC,IAAIU,UAAU,IAAI;MAAEA,UAAU,EAAEhB,QAAQ,CAACgB,UAAU;IAAE,CAAC,CAAC;IACvD,IAAIC,OAAO,IAAI;MACbA,OAAO,EAAE;QACPT,GAAG,EAAER,QAAQ,CAACiB,OAAO,CAACT,GAAG,CAAC;QAC1BgB,MAAM,EAAEP,OAAO,CAACO,MAAM;QACtBf,IAAI,EAAEQ,OAAO,CAACR,IAAI,CAAClB,GAAG,CAACmB,QAAQ;MACjC;IACF,CAAC,CAAC;IACFQ,KAAK,EAAEA,KAAK,CAAC3B,GAAG,CAACkC,SAAS,CAAC;IAC3B,IAAIN,SAAS,IAAI;MACfA,SAAS,EAAE;QACTO,IAAI,EAAEP,SAAS,CAACO,IAAI,CAACnC,GAAG,CAACe,UAAU,CAAC;QACpCqB,IAAI,EAAEC,SAAS,CAACT,SAAS,CAACQ,IAAI,CAAC;QAC/BE,OAAO,EAAEV,SAAS,CAACU,OAAO,CAACtC,GAAG,CAACqC,SAAS,CAAC;QACzCE,KAAK,EAAEX,SAAS,CAACW,KAAK,CAACvC,GAAG,CAACS,QAAQ;MACrC;IACF,CAAC;EACH,CAAC;AACH;AAEA,SAASN,UAAUA,CAAC;EAClBqC,IAAI;EACJC,IAAI;EACJC,SAAS;EACT/B,KAAK;EACLgC,QAAQ;EACRhB,KAAK;EACL,GAAGiB;AACQ,CAAC,EAAe;EAC3B,OAAO;IACL,GAAGA,KAAK;IACRJ,IAAI,EAAE/B,QAAQ,CAAC+B,IAAI,CAAC;IACpB,IAAIC,IAAI,IAAI;MAAEA,IAAI,EAAEhC,QAAQ,CAACgC,IAAI;IAAE,CAAC,CAAC;IACrC,IAAIC,SAAS,IAAI;MAAEA,SAAS,EAAEL,SAAS,CAACK,SAAS;IAAE,CAAC,CAAC;IACrD/B,KAAK,EAAEA,KAAK,CAACX,GAAG,CAACmB,QAAQ,CAAC;IAC1BwB,QAAQ,EAAEA,QAAQ,CAAC3C,GAAG,CAACqC,SAAS,CAAC;IACjCV,KAAK,EAAEA,KAAK,CAAC3B,GAAG,CAACkC,SAAS;EAC5B,CAAC;AACH;AAEA,SAASA,SAASA,CAAC;EAAEW,KAAK;EAAElC,KAAK;EAAE,GAAGmC;AAAiB,CAAC,EAAc;EACpE,OAAO;IACL,GAAGA,IAAI;IACPD,KAAK,EAAE9B,UAAU,CAAC8B,KAAK,CAAC;IACxB,IAAIlC,KAAK,IAAI;MAAEA,KAAK,EAAEQ,QAAQ,CAACR,KAAK;IAAE,CAAC;EACzC,CAAC;AACH;AAEA,SAASQ,QAAQA,CAAC4B,GAAY,EAAW;EACvC,OAAO;IACL,GAAGA,GAAG;IACNjB,CAAC,EAAEpC,KAAK,CAACqD,GAAG,CAACjB,CAAC,CAAC;IACfC,CAAC,EAAErC,KAAK,CAACqD,GAAG,CAAChB,CAAC,CAAC;IACfiB,MAAM,EAAEvC,QAAQ,CAACsC,GAAG,CAACC,MAAM;EAC7B,CAAC;AACH;AAEA,SAASX,SAASA,CAAC,CAACY,CAAC,EAAEC,CAAC,CAAiB,EAAkB;EACzD,OAAO,CAACnC,UAAU,CAACkC,CAAC,CAAC,EAAElC,UAAU,CAACmC,CAAC,CAAC,CAAC;AACvC;AAEA,SAASnC,UAAUA,CAAC;EAAEe,CAAC;EAAEC;AAAS,CAAC,EAAS;EAC1C,OAAO;IAAED,CAAC,EAAEpC,KAAK,CAACoC,CAAC,CAAC;IAAEC,CAAC,EAAErC,KAAK,CAACqC,CAAC;EAAE,CAAC;AACrC;AAEA,SAAStB,QAAQA,CAAC;EAAEqB,CAAC;EAAEC,CAAC;EAAEoB,CAAC;EAAEC;AAAO,CAAC,EAAO;EAC1C,OAAO;IAAEtB,CAAC,EAAEpC,KAAK,CAACoC,CAAC,CAAC;IAAEC,CAAC,EAAErC,KAAK,CAACqC,CAAC,CAAC;IAAEoB,CAAC,EAAEzD,KAAK,CAACyD,CAAC,CAAC;IAAEC,CAAC,EAAE1D,KAAK,CAAC0D,CAAC;EAAE,CAAC;AAC/D","ignoreList":[]}

package/dist/lib/layouts/graph/route-search.d.ts

@@ -0,0 +1,34 @@
+import type { Box, Point } from '../../model/diagram-ir.ts';
+/** A direction of travel: right, left, down, up. */
+export type Heading = 0 | 1 | 2 | 3;
+/** The routing grid's pitch. */
+export declare const GRID = 4;
+export type RouteSearch = {
+    /** Only grid points inside this box are searched. */
+    window: Box;
+    /** Coordinates the grid holds besides every multiple of GRID: the route's own ends, slots and stubs. */
+    lines: {
+        x: number[];
+        y: number[];
+    };
+    /** No route passes a grid point strictly inside one of these. */
+    walls: Box[];
+    /** Segments of routes already drawn: a route may cross them at a cost, never run along them. */
+    runs: [Point, Point][];
+    /** Group rects and title bands: crossing or hugging their borders costs extra. */
+    borders: Box[];
+    start: Point;
+    /** The heading of the stub that reaches `start`. */
+    startHeading: Heading;
+    goal: Point;
+    /** The heading of the stub that leaves `goal` for the entry side. */
+    goalHeading: Heading;
+};
+/**
+ * The cheapest orthogonal path from `start` to `goal` on a grid of GRID
+ * pitch, or undefined when the walls leave none. The search state is a grid
+ * point together with the heading that reached it, so a turn costs the same
+ * whichever way a point was reached.
+ */
+export declare function searchRoute(search: RouteSearch): Point[] | undefined;
+//# sourceMappingURL=route-search.d.ts.map

package/dist/lib/layouts/graph/route-search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"route-search.d.ts","sourceRoot":"","sources":["../../../../src/lib/layouts/graph/route-search.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,2BAA2B,CAAC;AAG5D,oDAAoD;AACpD,MAAM,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAEpC,gCAAgC;AAChC,eAAO,MAAM,IAAI,IAAI,CAAC;AA4BtB,MAAM,MAAM,WAAW,GAAG;IACxB,qDAAqD;IACrD,MAAM,EAAE,GAAG,CAAC;IACZ,wGAAwG;IACxG,KAAK,EAAE;QAAE,CAAC,EAAE,MAAM,EAAE,CAAC;QAAC,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IACpC,iEAAiE;IACjE,KAAK,EAAE,GAAG,EAAE,CAAC;IACb,gGAAgG;IAChG,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;IACvB,kFAAkF;IAClF,OAAO,EAAE,GAAG,EAAE,CAAC;IACf,KAAK,EAAE,KAAK,CAAC;IACb,oDAAoD;IACpD,YAAY,EAAE,OAAO,CAAC;IACtB,IAAI,EAAE,KAAK,CAAC;IACZ,qEAAqE;IACrE,WAAW,EAAE,OAAO,CAAC;CACtB,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,WAAW,GAAG,KAAK,EAAE,GAAG,SAAS,CA6CpE"}

package/dist/lib/layouts/graph/route-search.js

@@ -0,0 +1,208 @@
+import { MinHeap } from "./min-heap.js";
+
+/** A direction of travel: right, left, down, up. */
+
+/** The routing grid's pitch. */
+export const GRID = 4;
+const TURN_COST = 14;
+const EDGE_CROSSING_COST = 20;
+const BORDER_CROSSING_COST = 6;
+/** Charged for every grid step that runs parallel to a group border within HUG_DISTANCE of it. */
+const BORDER_HUG_COST = 10;
+const HUG_DISTANCE = 4;
+/** A run of another edge closer than this to a grid line lies on that line. */
+const RUN_TOLERANCE = GRID / 2;
+const STEPS = {
+  0: [1, 0],
+  1: [-1, 0],
+  2: [0, 1],
+  3: [0, -1]
+};
+const HEADINGS = [0, 1, 2, 3];
+const REVERSE = {
+  0: 1,
+  1: 0,
+  2: 3,
+  3: 2
+};
+function reverse(heading) {
+  return REVERSE[heading];
+}
+function isHorizontal(heading) {
+  return heading < 2;
+}
+/**
+ * The cheapest orthogonal path from `start` to `goal` on a grid of GRID
+ * pitch, or undefined when the walls leave none. The search state is a grid
+ * point together with the heading that reached it, so a turn costs the same
+ * whichever way a point was reached.
+ */
+export function searchRoute(search) {
+  const grid = new SearchGrid(search);
+  const start = grid.indexOf(search.start);
+  const goal = grid.indexOf(search.goal);
+  if (start === undefined || goal === undefined) return undefined;
+  if (grid.blocked[start] || grid.blocked[goal]) return undefined;
+  const states = grid.cells * 4;
+  const virtualGoal = states;
+  const cost = new Float64Array(states + 1).fill(Infinity);
+  const cameFrom = new Int32Array(states + 1).fill(-1);
+  const open = new MinHeap();
+  const startState = start * 4 + search.startHeading;
+  cost[startState] = 0;
+  open.push(startState, grid.estimate(start, goal));
+  while (open.size > 0) {
+    const state = open.pop();
+    if (state === virtualGoal) return grid.trace(cameFrom, cameFrom[state]);
+    const cell = state >> 2;
+    const heading = HEADINGS[state & 3];
+    const reached = cost[state];
+    if (cell === goal) {
+      if (heading === reverse(search.goalHeading)) continue;
+      const total = reached + (heading === search.goalHeading ? 0 : TURN_COST);
+      if (total < cost[virtualGoal]) {
+        cost[virtualGoal] = total;
+        cameFrom[virtualGoal] = state;
+        open.push(virtualGoal, total);
+      }
+      continue;
+    }
+    for (const next of HEADINGS) {
+      if (next === reverse(heading)) continue;
+      const step = grid.step(cell, next);
+      if (step === undefined) continue;
+      const nextState = step.cell * 4 + next;
+      const total = reached + step.cost + (next === heading ? 0 : TURN_COST);
+      if (total >= cost[nextState]) continue;
+      cost[nextState] = total;
+      cameFrom[nextState] = state;
+      open.push(nextState, total + grid.estimate(step.cell, goal));
+    }
+  }
+  return undefined;
+}
+
+/** The grid points of one search, with what each one costs to enter. */
+class SearchGrid {
+  #alongRunH;
+  #alongRunV;
+  /** Group borders between grid column i − 1 and column i, at each row. */
+  #bordersBeforeX;
+  #bordersBeforeY;
+  #hugH;
+  #hugV;
+  constructor(search) {
+    const {
+      window
+    } = search;
+    this.xs = axis(window.x, window.x + window.w, search.lines.x);
+    this.ys = axis(window.y, window.y + window.h, search.lines.y);
+    this.cells = this.xs.length * this.ys.length;
+    this.blocked = new Uint8Array(this.cells);
+    this.#alongRunH = new Uint8Array(this.cells);
+    this.#alongRunV = new Uint8Array(this.cells);
+    this.#bordersBeforeX = new Uint8Array(this.cells);
+    this.#bordersBeforeY = new Uint8Array(this.cells);
+    this.#hugH = new Uint8Array(this.cells);
+    this.#hugV = new Uint8Array(this.cells);
+    for (const wall of search.walls) {
+      this.#fill(this.blocked, strictlyInside(this.xs, wall.x, wall.x + wall.w), strictlyInside(this.ys, wall.y, wall.y + wall.h));
+    }
+    for (const [a, b] of search.runs) {
+      if (a.y === b.y) {
+        this.#fill(this.#alongRunH, within(this.xs, Math.min(a.x, b.x), Math.max(a.x, b.x)), near(this.ys, a.y, RUN_TOLERANCE));
+      } else {
+        this.#fill(this.#alongRunV, near(this.xs, a.x, RUN_TOLERANCE), within(this.ys, Math.min(a.y, b.y), Math.max(a.y, b.y)));
+      }
+    }
+    for (const rect of search.borders) {
+      const rows = within(this.ys, rect.y, rect.y + rect.h);
+      const cols = within(this.xs, rect.x, rect.x + rect.w);
+      for (const x of [rect.x, rect.x + rect.w]) {
+        this.#fill(this.#bordersBeforeX, crossedBefore(this.xs, x), rows);
+        this.#fill(this.#hugV, near(this.xs, x, HUG_DISTANCE + 1e-6), rows);
+      }
+      for (const y of [rect.y, rect.y + rect.h]) {
+        this.#fill(this.#bordersBeforeY, cols, crossedBefore(this.ys, y));
+        this.#fill(this.#hugH, cols, near(this.ys, y, HUG_DISTANCE + 1e-6));
+      }
+    }
+  }
+  indexOf(point) {
+    const i = this.xs.indexOf(point.x);
+    const j = this.ys.indexOf(point.y);
+    return i === -1 || j === -1 ? undefined : j * this.xs.length + i;
+  }
+
+  /** A lower bound on the cost from `cell` to `goal`: one unit per GRID of distance. */
+  estimate(cell, goal) {
+    const width = this.xs.length;
+    return (Math.abs(this.xs[cell % width] - this.xs[goal % width]) + Math.abs(this.ys[Math.floor(cell / width)] - this.ys[Math.floor(goal / width)])) / GRID;
+  }
+  step(cell, heading) {
+    const width = this.xs.length;
+    const i = cell % width;
+    const j = Math.floor(cell / width);
+    const [di, dj] = STEPS[heading];
+    const ni = i + di;
+    const nj = j + dj;
+    if (ni < 0 || nj < 0 || ni >= width || nj >= this.ys.length) return undefined;
+    const next = nj * width + ni;
+    if (this.blocked[next]) return undefined;
+    const horizontal = isHorizontal(heading);
+    if ((horizontal ? this.#alongRunH : this.#alongRunV)[next]) return undefined;
+    const length = horizontal ? Math.abs(this.xs[ni] - this.xs[i]) : Math.abs(this.ys[nj] - this.ys[j]);
+    const crossed = horizontal ? this.#bordersBeforeX[j * width + Math.max(i, ni)] : this.#bordersBeforeY[Math.max(j, nj) * width + i];
+    const hugs = (horizontal ? this.#hugH : this.#hugV)[next] > 0;
+    const crossesRun = (horizontal ? this.#alongRunV : this.#alongRunH)[next] > 0;
+    return {
+      cell: next,
+      cost: length / GRID + crossed * BORDER_CROSSING_COST + (hugs ? BORDER_HUG_COST * length / GRID : 0) + (crossesRun ? EDGE_CROSSING_COST : 0)
+    };
+  }
+  trace(cameFrom, last) {
+    const width = this.xs.length;
+    const points = [];
+    for (let state = last; state !== -1; state = cameFrom[state]) {
+      const cell = state >> 2;
+      points.push({
+        x: this.xs[cell % width],
+        y: this.ys[Math.floor(cell / width)]
+      });
+    }
+    return points.reverse();
+  }
+  #fill(target, cols, rows) {
+    const width = this.xs.length;
+    for (const j of rows) for (const i of cols) target[j * width + i] += 1;
+  }
+}
+
+/** Every multiple of GRID in [from, to], with the extra lines inside it, sorted and distinct. */
+function axis(from, to, extra) {
+  const values = new Set();
+  for (let v = Math.ceil(from / GRID) * GRID; v <= to; v += GRID) values.add(v);
+  for (const v of extra) if (v >= from && v <= to) values.add(v);
+  return [...values].sort((a, b) => a - b);
+}
+function indicesWhere(values, keep) {
+  const indices = [];
+  for (const [index, value] of values.entries()) if (keep(value)) indices.push(index);
+  return indices;
+}
+function strictlyInside(values, from, to) {
+  return indicesWhere(values, v => v > from && v < to);
+}
+function within(values, from, to) {
+  return indicesWhere(values, v => v >= from && v <= to);
+}
+function near(values, at, distance) {
+  return indicesWhere(values, v => Math.abs(v - at) < distance);
+}
+
+/** The index i whose step from i − 1 crosses `at`. */
+function crossedBefore(values, at) {
+  const i = values.findIndex(v => v >= at);
+  return i > 0 && values[i - 1] < at ? [i] : [];
+}
+//# sourceMappingURL=route-search.js.map

package/dist/lib/layouts/graph/route-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"route-search.js","names":["MinHeap","GRID","TURN_COST","EDGE_CROSSING_COST","BORDER_CROSSING_COST","BORDER_HUG_COST","HUG_DISTANCE","RUN_TOLERANCE","STEPS","HEADINGS","REVERSE","reverse","heading","isHorizontal","searchRoute","search","grid","SearchGrid","start","indexOf","goal","undefined","blocked","states","cells","virtualGoal","cost","Float64Array","fill","Infinity","cameFrom","Int32Array","open","startState","startHeading","push","estimate","size","state","pop","trace","cell","reached","goalHeading","total","next","step","nextState","alongRunH","alongRunV","bordersBeforeX","bordersBeforeY","hugH","hugV","constructor","window","xs","axis","x","w","lines","ys","y","h","length","Uint8Array","wall","walls","strictlyInside","a","b","runs","within","Math","min","max","near","rect","borders","rows","cols","crossedBefore","point","i","j","width","abs","floor","di","dj","ni","nj","horizontal","crossed","hugs","crossesRun","last","points","#fill","target","from","to","extra","values","Set","v","ceil","add","sort","indicesWhere","keep","indices","index","value","entries","at","distance","findIndex"],"sources":["../../../../src/lib/layouts/graph/route-search.ts"],"sourcesContent":["import type { Box, Point } from '../../model/diagram-ir.ts';\nimport { MinHeap } from './min-heap.ts';\n\n/** A direction of travel: right, left, down, up. */\nexport type Heading = 0 | 1 | 2 | 3;\n\n/** The routing grid's pitch. */\nexport const GRID = 4;\nconst TURN_COST = 14;\nconst EDGE_CROSSING_COST = 20;\nconst BORDER_CROSSING_COST = 6;\n/** Charged for every grid step that runs parallel to a group border within HUG_DISTANCE of it. */\nconst BORDER_HUG_COST = 10;\nconst HUG_DISTANCE = 4;\n/** A run of another edge closer than this to a grid line lies on that line. */\nconst RUN_TOLERANCE = GRID / 2;\n\nconst STEPS: Record<Heading, [number, number]> = {\n  0: [1, 0],\n  1: [-1, 0],\n  2: [0, 1],\n  3: [0, -1],\n};\nconst HEADINGS: Heading[] = [0, 1, 2, 3];\n\nconst REVERSE: Record<Heading, Heading> = { 0: 1, 1: 0, 2: 3, 3: 2 };\n\nfunction reverse(heading: Heading): Heading {\n  return REVERSE[heading];\n}\n\nfunction isHorizontal(heading: Heading): boolean {\n  return heading < 2;\n}\n\nexport type RouteSearch = {\n  /** Only grid points inside this box are searched. */\n  window: Box;\n  /** Coordinates the grid holds besides every multiple of GRID: the route's own ends, slots and stubs. */\n  lines: { x: number[]; y: number[] };\n  /** No route passes a grid point strictly inside one of these. */\n  walls: Box[];\n  /** Segments of routes already drawn: a route may cross them at a cost, never run along them. */\n  runs: [Point, Point][];\n  /** Group rects and title bands: crossing or hugging their borders costs extra. */\n  borders: Box[];\n  start: Point;\n  /** The heading of the stub that reaches `start`. */\n  startHeading: Heading;\n  goal: Point;\n  /** The heading of the stub that leaves `goal` for the entry side. */\n  goalHeading: Heading;\n};\n\n/**\n * The cheapest orthogonal path from `start` to `goal` on a grid of GRID\n * pitch, or undefined when the walls leave none. The search state is a grid\n * point together with the heading that reached it, so a turn costs the same\n * whichever way a point was reached.\n */\nexport function searchRoute(search: RouteSearch): Point[] | undefined {\n  const grid = new SearchGrid(search);\n  const start = grid.indexOf(search.start);\n  const goal = grid.indexOf(search.goal);\n  if (start === undefined || goal === undefined) return undefined;\n  if (grid.blocked[start] || grid.blocked[goal]) return undefined;\n\n  const states = grid.cells * 4;\n  const virtualGoal = states;\n  const cost = new Float64Array(states + 1).fill(Infinity);\n  const cameFrom = new Int32Array(states + 1).fill(-1);\n  const open = new MinHeap<number>();\n  const startState = start * 4 + search.startHeading;\n  cost[startState] = 0;\n  open.push(startState, grid.estimate(start, goal));\n\n  while (open.size > 0) {\n    const state = open.pop()!;\n    if (state === virtualGoal) return grid.trace(cameFrom, cameFrom[state]!);\n    const cell = state >> 2;\n    const heading = HEADINGS[state & 3]!;\n    const reached = cost[state]!;\n    if (cell === goal) {\n      if (heading === reverse(search.goalHeading)) continue;\n      const total = reached + (heading === search.goalHeading ? 0 : TURN_COST);\n      if (total < cost[virtualGoal]!) {\n        cost[virtualGoal] = total;\n        cameFrom[virtualGoal] = state;\n        open.push(virtualGoal, total);\n      }\n      continue;\n    }\n    for (const next of HEADINGS) {\n      if (next === reverse(heading)) continue;\n      const step = grid.step(cell, next);\n      if (step === undefined) continue;\n      const nextState = step.cell * 4 + next;\n      const total = reached + step.cost + (next === heading ? 0 : TURN_COST);\n      if (total >= cost[nextState]!) continue;\n      cost[nextState] = total;\n      cameFrom[nextState] = state;\n      open.push(nextState, total + grid.estimate(step.cell, goal));\n    }\n  }\n  return undefined;\n}\n\n/** The grid points of one search, with what each one costs to enter. */\nclass SearchGrid {\n  readonly xs: number[];\n  readonly ys: number[];\n  readonly cells: number;\n  readonly blocked: Uint8Array;\n  readonly #alongRunH: Uint8Array;\n  readonly #alongRunV: Uint8Array;\n  /** Group borders between grid column i − 1 and column i, at each row. */\n  readonly #bordersBeforeX: Uint8Array;\n  readonly #bordersBeforeY: Uint8Array;\n  readonly #hugH: Uint8Array;\n  readonly #hugV: Uint8Array;\n\n  constructor(search: RouteSearch) {\n    const { window } = search;\n    this.xs = axis(window.x, window.x + window.w, search.lines.x);\n    this.ys = axis(window.y, window.y + window.h, search.lines.y);\n    this.cells = this.xs.length * this.ys.length;\n    this.blocked = new Uint8Array(this.cells);\n    this.#alongRunH = new Uint8Array(this.cells);\n    this.#alongRunV = new Uint8Array(this.cells);\n    this.#bordersBeforeX = new Uint8Array(this.cells);\n    this.#bordersBeforeY = new Uint8Array(this.cells);\n    this.#hugH = new Uint8Array(this.cells);\n    this.#hugV = new Uint8Array(this.cells);\n\n    for (const wall of search.walls) {\n      this.#fill(\n        this.blocked,\n        strictlyInside(this.xs, wall.x, wall.x + wall.w),\n        strictlyInside(this.ys, wall.y, wall.y + wall.h),\n      );\n    }\n    for (const [a, b] of search.runs) {\n      if (a.y === b.y) {\n        this.#fill(\n          this.#alongRunH,\n          within(this.xs, Math.min(a.x, b.x), Math.max(a.x, b.x)),\n          near(this.ys, a.y, RUN_TOLERANCE),\n        );\n      } else {\n        this.#fill(\n          this.#alongRunV,\n          near(this.xs, a.x, RUN_TOLERANCE),\n          within(this.ys, Math.min(a.y, b.y), Math.max(a.y, b.y)),\n        );\n      }\n    }\n    for (const rect of search.borders) {\n      const rows = within(this.ys, rect.y, rect.y + rect.h);\n      const cols = within(this.xs, rect.x, rect.x + rect.w);\n      for (const x of [rect.x, rect.x + rect.w]) {\n        this.#fill(this.#bordersBeforeX, crossedBefore(this.xs, x), rows);\n        this.#fill(this.#hugV, near(this.xs, x, HUG_DISTANCE + 1e-6), rows);\n      }\n      for (const y of [rect.y, rect.y + rect.h]) {\n        this.#fill(this.#bordersBeforeY, cols, crossedBefore(this.ys, y));\n        this.#fill(this.#hugH, cols, near(this.ys, y, HUG_DISTANCE + 1e-6));\n      }\n    }\n  }\n\n  indexOf(point: Point): number | undefined {\n    const i = this.xs.indexOf(point.x);\n    const j = this.ys.indexOf(point.y);\n    return i === -1 || j === -1 ? undefined : j * this.xs.length + i;\n  }\n\n  /** A lower bound on the cost from `cell` to `goal`: one unit per GRID of distance. */\n  estimate(cell: number, goal: number): number {\n    const width = this.xs.length;\n    return (\n      (Math.abs(this.xs[cell % width]! - this.xs[goal % width]!) +\n        Math.abs(\n          this.ys[Math.floor(cell / width)]! -\n            this.ys[Math.floor(goal / width)]!,\n        )) /\n      GRID\n    );\n  }\n\n  step(\n    cell: number,\n    heading: Heading,\n  ): { cell: number; cost: number } | undefined {\n    const width = this.xs.length;\n    const i = cell % width;\n    const j = Math.floor(cell / width);\n    const [di, dj] = STEPS[heading];\n    const ni = i + di;\n    const nj = j + dj;\n    if (ni < 0 || nj < 0 || ni >= width || nj >= this.ys.length)\n      return undefined;\n    const next = nj * width + ni;\n    if (this.blocked[next]) return undefined;\n    const horizontal = isHorizontal(heading);\n    if ((horizontal ? this.#alongRunH : this.#alongRunV)[next])\n      return undefined;\n    const length = horizontal\n      ? Math.abs(this.xs[ni]! - this.xs[i]!)\n      : Math.abs(this.ys[nj]! - this.ys[j]!);\n    const crossed = horizontal\n      ? this.#bordersBeforeX[j * width + Math.max(i, ni)]!\n      : this.#bordersBeforeY[Math.max(j, nj) * width + i]!;\n    const hugs = (horizontal ? this.#hugH : this.#hugV)[next]! > 0;\n    const crossesRun =\n      (horizontal ? this.#alongRunV : this.#alongRunH)[next]! > 0;\n    return {\n      cell: next,\n      cost:\n        length / GRID +\n        crossed * BORDER_CROSSING_COST +\n        (hugs ? (BORDER_HUG_COST * length) / GRID : 0) +\n        (crossesRun ? EDGE_CROSSING_COST : 0),\n    };\n  }\n\n  trace(cameFrom: Int32Array, last: number): Point[] {\n    const width = this.xs.length;\n    const points: Point[] = [];\n    for (let state = last; state !== -1; state = cameFrom[state]!) {\n      const cell = state >> 2;\n      points.push({\n        x: this.xs[cell % width]!,\n        y: this.ys[Math.floor(cell / width)]!,\n      });\n    }\n    return points.reverse();\n  }\n\n  #fill(target: Uint8Array, cols: number[], rows: number[]): void {\n    const width = this.xs.length;\n    for (const j of rows) for (const i of cols) target[j * width + i]! += 1;\n  }\n}\n\n/** Every multiple of GRID in [from, to], with the extra lines inside it, sorted and distinct. */\nfunction axis(from: number, to: number, extra: number[]): number[] {\n  const values = new Set<number>();\n  for (let v = Math.ceil(from / GRID) * GRID; v <= to; v += GRID) values.add(v);\n  for (const v of extra) if (v >= from && v <= to) values.add(v);\n  return [...values].sort((a, b) => a - b);\n}\n\nfunction indicesWhere(\n  values: number[],\n  keep: (value: number) => boolean,\n): number[] {\n  const indices: number[] = [];\n  for (const [index, value] of values.entries())\n    if (keep(value)) indices.push(index);\n  return indices;\n}\n\nfunction strictlyInside(values: number[], from: number, to: number): number[] {\n  return indicesWhere(values, (v) => v > from && v < to);\n}\n\nfunction within(values: number[], from: number, to: number): number[] {\n  return indicesWhere(values, (v) => v >= from && v <= to);\n}\n\nfunction near(values: number[], at: number, distance: number): number[] {\n  return indicesWhere(values, (v) => Math.abs(v - at) < distance);\n}\n\n/** The index i whose step from i − 1 crosses `at`. */\nfunction crossedBefore(values: number[], at: number): number[] {\n  const i = values.findIndex((v) => v >= at);\n  return i > 0 && values[i - 1]! < at ? [i] : [];\n}\n"],"mappings":"AACA,SAASA,OAAO,QAAQ,eAAe;;AAEvC;;AAGA;AACA,OAAO,MAAMC,IAAI,GAAG,CAAC;AACrB,MAAMC,SAAS,GAAG,EAAE;AACpB,MAAMC,kBAAkB,GAAG,EAAE;AAC7B,MAAMC,oBAAoB,GAAG,CAAC;AAC9B;AACA,MAAMC,eAAe,GAAG,EAAE;AAC1B,MAAMC,YAAY,GAAG,CAAC;AACtB;AACA,MAAMC,aAAa,GAAGN,IAAI,GAAG,CAAC;AAE9B,MAAMO,KAAwC,GAAG;EAC/C,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;EACT,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;EACV,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;EACT,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;AACX,CAAC;AACD,MAAMC,QAAmB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAExC,MAAMC,OAAiC,GAAG;EAAE,CAAC,EAAE,CAAC;EAAE,CAAC,EAAE,CAAC;EAAE,CAAC,EAAE,CAAC;EAAE,CAAC,EAAE;AAAE,CAAC;AAEpE,SAASC,OAAOA,CAACC,OAAgB,EAAW;EAC1C,OAAOF,OAAO,CAACE,OAAO,CAAC;AACzB;AAEA,SAASC,YAAYA,CAACD,OAAgB,EAAW;EAC/C,OAAOA,OAAO,GAAG,CAAC;AACpB;AAqBA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASE,WAAWA,CAACC,MAAmB,EAAuB;EACpE,MAAMC,IAAI,GAAG,IAAIC,UAAU,CAACF,MAAM,CAAC;EACnC,MAAMG,KAAK,GAAGF,IAAI,CAACG,OAAO,CAACJ,MAAM,CAACG,KAAK,CAAC;EACxC,MAAME,IAAI,GAAGJ,IAAI,CAACG,OAAO,CAACJ,MAAM,CAACK,IAAI,CAAC;EACtC,IAAIF,KAAK,KAAKG,SAAS,IAAID,IAAI,KAAKC,SAAS,EAAE,OAAOA,SAAS;EAC/D,IAAIL,IAAI,CAACM,OAAO,CAACJ,KAAK,CAAC,IAAIF,IAAI,CAACM,OAAO,CAACF,IAAI,CAAC,EAAE,OAAOC,SAAS;EAE/D,MAAME,MAAM,GAAGP,IAAI,CAACQ,KAAK,GAAG,CAAC;EAC7B,MAAMC,WAAW,GAAGF,MAAM;EAC1B,MAAMG,IAAI,GAAG,IAAIC,YAAY,CAACJ,MAAM,GAAG,CAAC,CAAC,CAACK,IAAI,CAACC,QAAQ,CAAC;EACxD,MAAMC,QAAQ,GAAG,IAAIC,UAAU,CAACR,MAAM,GAAG,CAAC,CAAC,CAACK,IAAI,CAAC,CAAC,CAAC,CAAC;EACpD,MAAMI,IAAI,GAAG,IAAIhC,OAAO,CAAS,CAAC;EAClC,MAAMiC,UAAU,GAAGf,KAAK,GAAG,CAAC,GAAGH,MAAM,CAACmB,YAAY;EAClDR,IAAI,CAACO,UAAU,CAAC,GAAG,CAAC;EACpBD,IAAI,CAACG,IAAI,CAACF,UAAU,EAAEjB,IAAI,CAACoB,QAAQ,CAAClB,KAAK,EAAEE,IAAI,CAAC,CAAC;EAEjD,OAAOY,IAAI,CAACK,IAAI,GAAG,CAAC,EAAE;IACpB,MAAMC,KAAK,GAAGN,IAAI,CAACO,GAAG,CAAC,CAAE;IACzB,IAAID,KAAK,KAAKb,WAAW,EAAE,OAAOT,IAAI,CAACwB,KAAK,CAACV,QAAQ,EAAEA,QAAQ,CAACQ,KAAK,CAAE,CAAC;IACxE,MAAMG,IAAI,GAAGH,KAAK,IAAI,CAAC;IACvB,MAAM1B,OAAO,GAAGH,QAAQ,CAAC6B,KAAK,GAAG,CAAC,CAAE;IACpC,MAAMI,OAAO,GAAGhB,IAAI,CAACY,KAAK,CAAE;IAC5B,IAAIG,IAAI,KAAKrB,IAAI,EAAE;MACjB,IAAIR,OAAO,KAAKD,OAAO,CAACI,MAAM,CAAC4B,WAAW,CAAC,EAAE;MAC7C,MAAMC,KAAK,GAAGF,OAAO,IAAI9B,OAAO,KAAKG,MAAM,CAAC4B,WAAW,GAAG,CAAC,GAAGzC,SAAS,CAAC;MACxE,IAAI0C,KAAK,GAAGlB,IAAI,CAACD,WAAW,CAAE,EAAE;QAC9BC,IAAI,CAACD,WAAW,CAAC,GAAGmB,KAAK;QACzBd,QAAQ,CAACL,WAAW,CAAC,GAAGa,KAAK;QAC7BN,IAAI,CAACG,IAAI,CAACV,WAAW,EAAEmB,KAAK,CAAC;MAC/B;MACA;IACF;IACA,KAAK,MAAMC,IAAI,IAAIpC,QAAQ,EAAE;MAC3B,IAAIoC,IAAI,KAAKlC,OAAO,CAACC,OAAO,CAAC,EAAE;MAC/B,MAAMkC,IAAI,GAAG9B,IAAI,CAAC8B,IAAI,CAACL,IAAI,EAAEI,IAAI,CAAC;MAClC,IAAIC,IAAI,KAAKzB,SAAS,EAAE;MACxB,MAAM0B,SAAS,GAAGD,IAAI,CAACL,IAAI,GAAG,CAAC,GAAGI,IAAI;MACtC,MAAMD,KAAK,GAAGF,OAAO,GAAGI,IAAI,CAACpB,IAAI,IAAImB,IAAI,KAAKjC,OAAO,GAAG,CAAC,GAAGV,SAAS,CAAC;MACtE,IAAI0C,KAAK,IAAIlB,IAAI,CAACqB,SAAS,CAAE,EAAE;MAC/BrB,IAAI,CAACqB,SAAS,CAAC,GAAGH,KAAK;MACvBd,QAAQ,CAACiB,SAAS,CAAC,GAAGT,KAAK;MAC3BN,IAAI,CAACG,IAAI,CAACY,SAAS,EAAEH,KAAK,GAAG5B,IAAI,CAACoB,QAAQ,CAACU,IAAI,CAACL,IAAI,EAAErB,IAAI,CAAC,CAAC;IAC9D;EACF;EACA,OAAOC,SAAS;AAClB;;AAEA;AACA,MAAMJ,UAAU,CAAC;EAKN,CAAC+B,SAAS;EACV,CAACC,SAAS;EACnB;EACS,CAACC,cAAc;EACf,CAACC,cAAc;EACf,CAACC,IAAI;EACL,CAACC,IAAI;EAEdC,WAAWA,CAACvC,MAAmB,EAAE;IAC/B,MAAM;MAAEwC;IAAO,CAAC,GAAGxC,MAAM;IACzB,IAAI,CAACyC,EAAE,GAAGC,IAAI,CAACF,MAAM,CAACG,CAAC,EAAEH,MAAM,CAACG,CAAC,GAAGH,MAAM,CAACI,CAAC,EAAE5C,MAAM,CAAC6C,KAAK,CAACF,CAAC,CAAC;IAC7D,IAAI,CAACG,EAAE,GAAGJ,IAAI,CAACF,MAAM,CAACO,CAAC,EAAEP,MAAM,CAACO,CAAC,GAAGP,MAAM,CAACQ,CAAC,EAAEhD,MAAM,CAAC6C,KAAK,CAACE,CAAC,CAAC;IAC7D,IAAI,CAACtC,KAAK,GAAG,IAAI,CAACgC,EAAE,CAACQ,MAAM,GAAG,IAAI,CAACH,EAAE,CAACG,MAAM;IAC5C,IAAI,CAAC1C,OAAO,GAAG,IAAI2C,UAAU,CAAC,IAAI,CAACzC,KAAK,CAAC;IACzC,IAAI,CAAC,CAACwB,SAAS,GAAG,IAAIiB,UAAU,CAAC,IAAI,CAACzC,KAAK,CAAC;IAC5C,IAAI,CAAC,CAACyB,SAAS,GAAG,IAAIgB,UAAU,CAAC,IAAI,CAACzC,KAAK,CAAC;IAC5C,IAAI,CAAC,CAAC0B,cAAc,GAAG,IAAIe,UAAU,CAAC,IAAI,CAACzC,KAAK,CAAC;IACjD,IAAI,CAAC,CAAC2B,cAAc,GAAG,IAAIc,UAAU,CAAC,IAAI,CAACzC,KAAK,CAAC;IACjD,IAAI,CAAC,CAAC4B,IAAI,GAAG,IAAIa,UAAU,CAAC,IAAI,CAACzC,KAAK,CAAC;IACvC,IAAI,CAAC,CAAC6B,IAAI,GAAG,IAAIY,UAAU,CAAC,IAAI,CAACzC,KAAK,CAAC;IAEvC,KAAK,MAAM0C,IAAI,IAAInD,MAAM,CAACoD,KAAK,EAAE;MAC/B,IAAI,CAAC,CAACvC,IAAI,CACR,IAAI,CAACN,OAAO,EACZ8C,cAAc,CAAC,IAAI,CAACZ,EAAE,EAAEU,IAAI,CAACR,CAAC,EAAEQ,IAAI,CAACR,CAAC,GAAGQ,IAAI,CAACP,CAAC,CAAC,EAChDS,cAAc,CAAC,IAAI,CAACP,EAAE,EAAEK,IAAI,CAACJ,CAAC,EAAEI,IAAI,CAACJ,CAAC,GAAGI,IAAI,CAACH,CAAC,CACjD,CAAC;IACH;IACA,KAAK,MAAM,CAACM,CAAC,EAAEC,CAAC,CAAC,IAAIvD,MAAM,CAACwD,IAAI,EAAE;MAChC,IAAIF,CAAC,CAACP,CAAC,KAAKQ,CAAC,CAACR,CAAC,EAAE;QACf,IAAI,CAAC,CAAClC,IAAI,CACR,IAAI,CAAC,CAACoB,SAAS,EACfwB,MAAM,CAAC,IAAI,CAAChB,EAAE,EAAEiB,IAAI,CAACC,GAAG,CAACL,CAAC,CAACX,CAAC,EAAEY,CAAC,CAACZ,CAAC,CAAC,EAAEe,IAAI,CAACE,GAAG,CAACN,CAAC,CAACX,CAAC,EAAEY,CAAC,CAACZ,CAAC,CAAC,CAAC,EACvDkB,IAAI,CAAC,IAAI,CAACf,EAAE,EAAEQ,CAAC,CAACP,CAAC,EAAEvD,aAAa,CAClC,CAAC;MACH,CAAC,MAAM;QACL,IAAI,CAAC,CAACqB,IAAI,CACR,IAAI,CAAC,CAACqB,SAAS,EACf2B,IAAI,CAAC,IAAI,CAACpB,EAAE,EAAEa,CAAC,CAACX,CAAC,EAAEnD,aAAa,CAAC,EACjCiE,MAAM,CAAC,IAAI,CAACX,EAAE,EAAEY,IAAI,CAACC,GAAG,CAACL,CAAC,CAACP,CAAC,EAAEQ,CAAC,CAACR,CAAC,CAAC,EAAEW,IAAI,CAACE,GAAG,CAACN,CAAC,CAACP,CAAC,EAAEQ,CAAC,CAACR,CAAC,CAAC,CACxD,CAAC;MACH;IACF;IACA,KAAK,MAAMe,IAAI,IAAI9D,MAAM,CAAC+D,OAAO,EAAE;MACjC,MAAMC,IAAI,GAAGP,MAAM,CAAC,IAAI,CAACX,EAAE,EAAEgB,IAAI,CAACf,CAAC,EAAEe,IAAI,CAACf,CAAC,GAAGe,IAAI,CAACd,CAAC,CAAC;MACrD,MAAMiB,IAAI,GAAGR,MAAM,CAAC,IAAI,CAAChB,EAAE,EAAEqB,IAAI,CAACnB,CAAC,EAAEmB,IAAI,CAACnB,CAAC,GAAGmB,IAAI,CAAClB,CAAC,CAAC;MACrD,KAAK,MAAMD,CAAC,IAAI,CAACmB,IAAI,CAACnB,CAAC,EAAEmB,IAAI,CAACnB,CAAC,GAAGmB,IAAI,CAAClB,CAAC,CAAC,EAAE;QACzC,IAAI,CAAC,CAAC/B,IAAI,CAAC,IAAI,CAAC,CAACsB,cAAc,EAAE+B,aAAa,CAAC,IAAI,CAACzB,EAAE,EAAEE,CAAC,CAAC,EAAEqB,IAAI,CAAC;QACjE,IAAI,CAAC,CAACnD,IAAI,CAAC,IAAI,CAAC,CAACyB,IAAI,EAAEuB,IAAI,CAAC,IAAI,CAACpB,EAAE,EAAEE,CAAC,EAAEpD,YAAY,GAAG,IAAI,CAAC,EAAEyE,IAAI,CAAC;MACrE;MACA,KAAK,MAAMjB,CAAC,IAAI,CAACe,IAAI,CAACf,CAAC,EAAEe,IAAI,CAACf,CAAC,GAAGe,IAAI,CAACd,CAAC,CAAC,EAAE;QACzC,IAAI,CAAC,CAACnC,IAAI,CAAC,IAAI,CAAC,CAACuB,cAAc,EAAE6B,IAAI,EAAEC,aAAa,CAAC,IAAI,CAACpB,EAAE,EAAEC,CAAC,CAAC,CAAC;QACjE,IAAI,CAAC,CAAClC,IAAI,CAAC,IAAI,CAAC,CAACwB,IAAI,EAAE4B,IAAI,EAAEJ,IAAI,CAAC,IAAI,CAACf,EAAE,EAAEC,CAAC,EAAExD,YAAY,GAAG,IAAI,CAAC,CAAC;MACrE;IACF;EACF;EAEAa,OAAOA,CAAC+D,KAAY,EAAsB;IACxC,MAAMC,CAAC,GAAG,IAAI,CAAC3B,EAAE,CAACrC,OAAO,CAAC+D,KAAK,CAACxB,CAAC,CAAC;IAClC,MAAM0B,CAAC,GAAG,IAAI,CAACvB,EAAE,CAAC1C,OAAO,CAAC+D,KAAK,CAACpB,CAAC,CAAC;IAClC,OAAOqB,CAAC,KAAK,CAAC,CAAC,IAAIC,CAAC,KAAK,CAAC,CAAC,GAAG/D,SAAS,GAAG+D,CAAC,GAAG,IAAI,CAAC5B,EAAE,CAACQ,MAAM,GAAGmB,CAAC;EAClE;;EAEA;EACA/C,QAAQA,CAACK,IAAY,EAAErB,IAAY,EAAU;IAC3C,MAAMiE,KAAK,GAAG,IAAI,CAAC7B,EAAE,CAACQ,MAAM;IAC5B,OACE,CAACS,IAAI,CAACa,GAAG,CAAC,IAAI,CAAC9B,EAAE,CAACf,IAAI,GAAG4C,KAAK,CAAC,GAAI,IAAI,CAAC7B,EAAE,CAACpC,IAAI,GAAGiE,KAAK,CAAE,CAAC,GACxDZ,IAAI,CAACa,GAAG,CACN,IAAI,CAACzB,EAAE,CAACY,IAAI,CAACc,KAAK,CAAC9C,IAAI,GAAG4C,KAAK,CAAC,CAAC,GAC/B,IAAI,CAACxB,EAAE,CAACY,IAAI,CAACc,KAAK,CAACnE,IAAI,GAAGiE,KAAK,CAAC,CACpC,CAAC,IACHpF,IAAI;EAER;EAEA6C,IAAIA,CACFL,IAAY,EACZ7B,OAAgB,EAC4B;IAC5C,MAAMyE,KAAK,GAAG,IAAI,CAAC7B,EAAE,CAACQ,MAAM;IAC5B,MAAMmB,CAAC,GAAG1C,IAAI,GAAG4C,KAAK;IACtB,MAAMD,CAAC,GAAGX,IAAI,CAACc,KAAK,CAAC9C,IAAI,GAAG4C,KAAK,CAAC;IAClC,MAAM,CAACG,EAAE,EAAEC,EAAE,CAAC,GAAGjF,KAAK,CAACI,OAAO,CAAC;IAC/B,MAAM8E,EAAE,GAAGP,CAAC,GAAGK,EAAE;IACjB,MAAMG,EAAE,GAAGP,CAAC,GAAGK,EAAE;IACjB,IAAIC,EAAE,GAAG,CAAC,IAAIC,EAAE,GAAG,CAAC,IAAID,EAAE,IAAIL,KAAK,IAAIM,EAAE,IAAI,IAAI,CAAC9B,EAAE,CAACG,MAAM,EACzD,OAAO3C,SAAS;IAClB,MAAMwB,IAAI,GAAG8C,EAAE,GAAGN,KAAK,GAAGK,EAAE;IAC5B,IAAI,IAAI,CAACpE,OAAO,CAACuB,IAAI,CAAC,EAAE,OAAOxB,SAAS;IACxC,MAAMuE,UAAU,GAAG/E,YAAY,CAACD,OAAO,CAAC;IACxC,IAAI,CAACgF,UAAU,GAAG,IAAI,CAAC,CAAC5C,SAAS,GAAG,IAAI,CAAC,CAACC,SAAS,EAAEJ,IAAI,CAAC,EACxD,OAAOxB,SAAS;IAClB,MAAM2C,MAAM,GAAG4B,UAAU,GACrBnB,IAAI,CAACa,GAAG,CAAC,IAAI,CAAC9B,EAAE,CAACkC,EAAE,CAAC,GAAI,IAAI,CAAClC,EAAE,CAAC2B,CAAC,CAAE,CAAC,GACpCV,IAAI,CAACa,GAAG,CAAC,IAAI,CAACzB,EAAE,CAAC8B,EAAE,CAAC,GAAI,IAAI,CAAC9B,EAAE,CAACuB,CAAC,CAAE,CAAC;IACxC,MAAMS,OAAO,GAAGD,UAAU,GACtB,IAAI,CAAC,CAAC1C,cAAc,CAACkC,CAAC,GAAGC,KAAK,GAAGZ,IAAI,CAACE,GAAG,CAACQ,CAAC,EAAEO,EAAE,CAAC,CAAC,GACjD,IAAI,CAAC,CAACvC,cAAc,CAACsB,IAAI,CAACE,GAAG,CAACS,CAAC,EAAEO,EAAE,CAAC,GAAGN,KAAK,GAAGF,CAAC,CAAE;IACtD,MAAMW,IAAI,GAAG,CAACF,UAAU,GAAG,IAAI,CAAC,CAACxC,IAAI,GAAG,IAAI,CAAC,CAACC,IAAI,EAAER,IAAI,CAAC,GAAI,CAAC;IAC9D,MAAMkD,UAAU,GACd,CAACH,UAAU,GAAG,IAAI,CAAC,CAAC3C,SAAS,GAAG,IAAI,CAAC,CAACD,SAAS,EAAEH,IAAI,CAAC,GAAI,CAAC;IAC7D,OAAO;MACLJ,IAAI,EAAEI,IAAI;MACVnB,IAAI,EACFsC,MAAM,GAAG/D,IAAI,GACb4F,OAAO,GAAGzF,oBAAoB,IAC7B0F,IAAI,GAAIzF,eAAe,GAAG2D,MAAM,GAAI/D,IAAI,GAAG,CAAC,CAAC,IAC7C8F,UAAU,GAAG5F,kBAAkB,GAAG,CAAC;IACxC,CAAC;EACH;EAEAqC,KAAKA,CAACV,QAAoB,EAAEkE,IAAY,EAAW;IACjD,MAAMX,KAAK,GAAG,IAAI,CAAC7B,EAAE,CAACQ,MAAM;IAC5B,MAAMiC,MAAe,GAAG,EAAE;IAC1B,KAAK,IAAI3D,KAAK,GAAG0D,IAAI,EAAE1D,KAAK,KAAK,CAAC,CAAC,EAAEA,KAAK,GAAGR,QAAQ,CAACQ,KAAK,CAAE,EAAE;MAC7D,MAAMG,IAAI,GAAGH,KAAK,IAAI,CAAC;MACvB2D,MAAM,CAAC9D,IAAI,CAAC;QACVuB,CAAC,EAAE,IAAI,CAACF,EAAE,CAACf,IAAI,GAAG4C,KAAK,CAAE;QACzBvB,CAAC,EAAE,IAAI,CAACD,EAAE,CAACY,IAAI,CAACc,KAAK,CAAC9C,IAAI,GAAG4C,KAAK,CAAC;MACrC,CAAC,CAAC;IACJ;IACA,OAAOY,MAAM,CAACtF,OAAO,CAAC,CAAC;EACzB;EAEA,CAACiB,IAAIsE,CAACC,MAAkB,EAAEnB,IAAc,EAAED,IAAc,EAAQ;IAC9D,MAAMM,KAAK,GAAG,IAAI,CAAC7B,EAAE,CAACQ,MAAM;IAC5B,KAAK,MAAMoB,CAAC,IAAIL,IAAI,EAAE,KAAK,MAAMI,CAAC,IAAIH,IAAI,EAAEmB,MAAM,CAACf,CAAC,GAAGC,KAAK,GAAGF,CAAC,CAAC,IAAK,CAAC;EACzE;AACF;;AAEA;AACA,SAAS1B,IAAIA,CAAC2C,IAAY,EAAEC,EAAU,EAAEC,KAAe,EAAY;EACjE,MAAMC,MAAM,GAAG,IAAIC,GAAG,CAAS,CAAC;EAChC,KAAK,IAAIC,CAAC,GAAGhC,IAAI,CAACiC,IAAI,CAACN,IAAI,GAAGnG,IAAI,CAAC,GAAGA,IAAI,EAAEwG,CAAC,IAAIJ,EAAE,EAAEI,CAAC,IAAIxG,IAAI,EAAEsG,MAAM,CAACI,GAAG,CAACF,CAAC,CAAC;EAC7E,KAAK,MAAMA,CAAC,IAAIH,KAAK,EAAE,IAAIG,CAAC,IAAIL,IAAI,IAAIK,CAAC,IAAIJ,EAAE,EAAEE,MAAM,CAACI,GAAG,CAACF,CAAC,CAAC;EAC9D,OAAO,CAAC,GAAGF,MAAM,CAAC,CAACK,IAAI,CAAC,CAACvC,CAAC,EAAEC,CAAC,KAAKD,CAAC,GAAGC,CAAC,CAAC;AAC1C;AAEA,SAASuC,YAAYA,CACnBN,MAAgB,EAChBO,IAAgC,EACtB;EACV,MAAMC,OAAiB,GAAG,EAAE;EAC5B,KAAK,MAAM,CAACC,KAAK,EAAEC,KAAK,CAAC,IAAIV,MAAM,CAACW,OAAO,CAAC,CAAC,EAC3C,IAAIJ,IAAI,CAACG,KAAK,CAAC,EAAEF,OAAO,CAAC5E,IAAI,CAAC6E,KAAK,CAAC;EACtC,OAAOD,OAAO;AAChB;AAEA,SAAS3C,cAAcA,CAACmC,MAAgB,EAAEH,IAAY,EAAEC,EAAU,EAAY;EAC5E,OAAOQ,YAAY,CAACN,MAAM,EAAGE,CAAC,IAAKA,CAAC,GAAGL,IAAI,IAAIK,CAAC,GAAGJ,EAAE,CAAC;AACxD;AAEA,SAAS7B,MAAMA,CAAC+B,MAAgB,EAAEH,IAAY,EAAEC,EAAU,EAAY;EACpE,OAAOQ,YAAY,CAACN,MAAM,EAAGE,CAAC,IAAKA,CAAC,IAAIL,IAAI,IAAIK,CAAC,IAAIJ,EAAE,CAAC;AAC1D;AAEA,SAASzB,IAAIA,CAAC2B,MAAgB,EAAEY,EAAU,EAAEC,QAAgB,EAAY;EACtE,OAAOP,YAAY,CAACN,MAAM,EAAGE,CAAC,IAAKhC,IAAI,CAACa,GAAG,CAACmB,CAAC,GAAGU,EAAE,CAAC,GAAGC,QAAQ,CAAC;AACjE;;AAEA;AACA,SAASnC,aAAaA,CAACsB,MAAgB,EAAEY,EAAU,EAAY;EAC7D,MAAMhC,CAAC,GAAGoB,MAAM,CAACc,SAAS,CAAEZ,CAAC,IAAKA,CAAC,IAAIU,EAAE,CAAC;EAC1C,OAAOhC,CAAC,GAAG,CAAC,IAAIoB,MAAM,CAACpB,CAAC,GAAG,CAAC,CAAC,GAAIgC,EAAE,GAAG,CAAChC,CAAC,CAAC,GAAG,EAAE;AAChD","ignoreList":[]}

package/dist/lib/layouts/graph/route.d.ts

@@ -0,0 +1,20 @@
+import type { DiagramGraphIR } from '../../model/diagram-ir.ts';
+import type { GridAreas } from './areas.ts';
+import type { EdgeLayout, GroupLayout, LeaderLayout, NodeLayout } from './graph-layout-result.ts';
+/** The routes, before the layout rounds them and draws their paths. */
+export type RoutedGraph = {
+    edges: Omit<EdgeLayout, 'd'>[];
+    leaders: Omit<LeaderLayout, 'd'>[];
+};
+/**
+ * Routes every edge and note leader orthogonally, nearest cells first, and
+ * places each edge's label and badge before the next edge routes around
+ * them. A connection with no route takes its next choice of sides, and
+ * everything routes again. It throws when a connection has no choice left,
+ * or a label has no room; it never draws a diagonal or straight line
+ * through what is in the way.
+ */
+export declare function routeGraph(ir: DiagramGraphIR, nodes: NodeLayout[], groups: GroupLayout[], areas: GridAreas, 
+/** How far beyond the bounding box of its two shapes a route first searches. */
+searchMargin: number): RoutedGraph;
+//# sourceMappingURL=route.d.ts.map

package/dist/lib/layouts/graph/route.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"route.d.ts","sourceRoot":"","sources":["../../../../src/lib/layouts/graph/route.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAO,cAAc,EAAS,MAAM,2BAA2B,CAAC;AAC5E,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAO5C,OAAO,KAAK,EACV,UAAU,EACV,WAAW,EACX,YAAY,EACZ,UAAU,EACX,MAAM,0BAA0B,CAAC;AAalC,uEAAuE;AACvE,MAAM,MAAM,WAAW,GAAG;IACxB,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,EAAE,CAAC;IAC/B,OAAO,EAAE,IAAI,CAAC,YAAY,EAAE,GAAG,CAAC,EAAE,CAAC;CACpC,CAAC;AAQF;;;;;;;GAOG;AACH,wBAAgB,UAAU,CACxB,EAAE,EAAE,cAAc,EAClB,KAAK,EAAE,UAAU,EAAE,EACnB,MAAM,EAAE,WAAW,EAAE,EACrB,KAAK,EAAE,SAAS;AAChB,gFAAgF;AAChF,YAAY,EAAE,MAAM,GACnB,WAAW,CAiBb"}