@flanksource/clicky-ui 0.3.44 → 0.3.46

package/dist/data/graph-columns-layout.cjs

@@ -1,11 +1,16 @@
 "use strict";
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const graphEdgeRouting = require("./graph-edge-routing.cjs");
+const GROUP_MEMBER_WINDOW = 10;
+const GROUP_WINDOW_FOOTER_HEIGHT = 18;
 const DEFAULT_NODE_WIDTH = 168;
 const DEFAULT_NODE_HEIGHT = 60;
 const DEFAULT_COLUMN_GAP = 96;
 const DEFAULT_ROW_GAP = 20;
 const DEFAULT_GROUP_PADDING = 12;
+const DEFAULT_COMPACT_NODE_HEIGHT = 24;
+const DEFAULT_COMPACT_ROW_GAP = 4;
+const DEFAULT_COMPACT_GROUP_PADDING = 8;
 const DEFAULT_PADDING = 24;
 const DEFAULT_SWEEPS = 4;
 function mustGet(map, key, what) {
@@ -17,11 +22,17 @@ function mustGet(map, key, what) {
 }
 function columnMetrics(options) {
   return {
+    records: options.records ?? [],
+    collapsed: options.collapsed ?? [],
+    recordHeaderHeight: options.recordHeaderHeight ?? 24,
     nodeWidth: options.nodeWidth ?? DEFAULT_NODE_WIDTH,
     nodeHeight: options.nodeHeight ?? DEFAULT_NODE_HEIGHT,
     columnGap: options.columnGap ?? DEFAULT_COLUMN_GAP,
     rowGap: options.rowGap ?? DEFAULT_ROW_GAP,
     groupPadding: options.groupPadding ?? DEFAULT_GROUP_PADDING,
+    compactNodeHeight: options.compactNodeHeight ?? DEFAULT_COMPACT_NODE_HEIGHT,
+    compactRowGap: options.compactRowGap ?? DEFAULT_COMPACT_ROW_GAP,
+    compactGroupPadding: options.compactGroupPadding ?? DEFAULT_COMPACT_GROUP_PADDING,
     padding: options.padding ?? DEFAULT_PADDING,
     sweeps: options.sweeps ?? DEFAULT_SWEEPS
   };
@@ -57,10 +68,35 @@ function indexNeighbours(nodes, edges) {
   }
   return neighbours;
 }
+function collapsedRun(group, nodes, m) {
+  if (nodes.length !== 1) throw new Error(`columnsLayout: collapsed group "${group}" holds ${nodes.length} nodes in a column; it draws one stand-in`);
+  return { pad: 0, gap: 0, heightOf: () => m.recordHeaderHeight, header: 0, height: m.recordHeaderHeight, collapsed: true };
+}
+function runMetrics(group, nodes, m, record) {
+  if (group !== void 0 && m.collapsed.includes(group)) return collapsedRun(group, nodes, m);
+  let stack;
+  if (record) {
+    const regular = nodes.find((node) => !node.compact);
+    if (regular) throw new Error(`columnsLayout: record group "${group}" holds non-compact node "${regular.id}"`);
+    stack = { pad: 0, gap: 0, heightOf: () => m.compactNodeHeight, header: m.recordHeaderHeight };
+  } else {
+    const compact = group !== void 0 && nodes.every((node) => node.compact === true);
+    const heightOf = (node) => node.compact ? m.compactNodeHeight : m.nodeHeight;
+    stack = { pad: group === void 0 ? 0 : compact ? m.compactGroupPadding : m.groupPadding, gap: compact ? m.compactRowGap : m.rowGap, heightOf, header: 0 };
+  }
+  const chrome = stack.header + 2 * stack.pad;
+  if (group === void 0 || nodes.length <= GROUP_MEMBER_WINDOW) {
+    const stacked = nodes.reduce((sum, node) => sum + stack.heightOf(node), 0) + (nodes.length - 1) * stack.gap;
+    return { ...stack, height: chrome + stacked, collapsed: false };
+  }
+  const view = GROUP_MEMBER_WINDOW * Math.max(...nodes.map(stack.heightOf)) + (GROUP_MEMBER_WINDOW - 1) * stack.gap;
+  return { ...stack, view, height: chrome + view + GROUP_WINDOW_FOOTER_HEIGHT, collapsed: false };
+}
 function columnHeight(column, m) {
-  const groups = new Set(column.map((node) => node.group));
-  groups.delete(void 0);
-  return column.length * m.nodeHeight + (column.length - 1) * m.rowGap + 2 * m.groupPadding * groups.size;
+  const runs = /* @__PURE__ */ new Map();
+  for (const node of column) runs.set(node.group, [...runs.get(node.group) ?? [], node]);
+  const stacked = [...runs].reduce((sum, [group, nodes]) => sum + runMetrics(group, nodes, m, group !== void 0 && m.records.includes(group)).height, 0);
+  return stacked + (runs.size - 1) * m.rowGap;
 }
 function orderColumn(column, groupRank, weight) {
   const runs = /* @__PURE__ */ new Map();
@@ -84,24 +120,33 @@ function stackColumn(runs, origin, m, placed) {
   const boxes = [];
   let cursor = origin.top;
   for (const { group, nodes } of runs) {
-    const pad = group === void 0 ? 0 : m.groupPadding;
-    const height = nodes.length * m.nodeHeight + (nodes.length - 1) * m.rowGap + 2 * pad;
-    nodes.forEach((node, index) => {
-      const top = cursor + pad + index * (m.nodeHeight + m.rowGap);
-      placed.set(node.id, { x: origin.x, y: top + m.nodeHeight / 2 });
-    });
+    const record = group !== void 0 && m.records.includes(group);
+    const run = runMetrics(group, nodes, m, record);
+    const first = cursor + run.pad + run.header;
+    const tops = [];
+    let top = first;
+    for (const node of nodes) {
+      tops.push(top - first);
+      placed.set(node.id, { x: origin.x, y: top + run.heightOf(node) / 2 });
+      top += run.heightOf(node) + run.gap;
+    }
     if (group !== void 0) {
+      const memberWindow = run.view === void 0 ? void 0 : { members: nodes.map((node) => node.id), tops, rows: GROUP_MEMBER_WINDOW, top: first, height: run.view, footerHeight: GROUP_WINDOW_FOOTER_HEIGHT };
       boxes.push({
         id: `${origin.level}:${group}`,
         group,
         level: origin.level,
-        x: origin.x - m.nodeWidth / 2 - pad,
+        x: origin.x - m.nodeWidth / 2 - run.pad,
         y: cursor,
-        width: m.nodeWidth + 2 * pad,
-        height
+        width: m.nodeWidth + 2 * run.pad,
+        height: run.height,
+        record,
+        headerHeight: run.collapsed ? m.recordHeaderHeight : run.header,
+        ...memberWindow ? { window: memberWindow } : {},
+        ...run.collapsed ? { collapsed: true } : {}
       });
     }
-    cursor += height + m.rowGap;
+    cursor += run.height + m.rowGap;
   }
   return boxes;
 }
@@ -203,7 +248,8 @@ function columnsLayout(nodes, edges, options = {}) {
       level
     })
   });
-  const room = graphEdgeRouting.loopOverhang(edges, Object.fromEntries(placed), m);
+  const nodeHeights = Object.fromEntries(nodes.filter((node) => node.compact).map((node) => [node.id, m.compactNodeHeight]));
+  const room = graphEdgeRouting.loopOverhang(edges, Object.fromEntries(placed), { ...m, nodeHeights });
   const span = (Math.max(...levels) - minLevel) * (m.nodeWidth + m.columnGap) + m.nodeWidth;
   return {
     width: room.left + 2 * inset + span + room.right,
@@ -212,5 +258,6 @@ function columnsLayout(nodes, edges, options = {}) {
     groups: [...boxes.values()].flat().map((box) => ({ ...box, x: box.x + room.left })).sort((a, b) => a.level - b.level || a.y - b.y)
   };
 }
+exports.GROUP_MEMBER_WINDOW = GROUP_MEMBER_WINDOW;
 exports.columnsLayout = columnsLayout;
 //# sourceMappingURL=graph-columns-layout.cjs.map

package/dist/data/graph-columns-layout.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"graph-columns-layout.cjs","sources":["../../src/data/graph-columns-layout.ts"],"sourcesContent":["// Level-column layout for GraphDiagram: pure math, no React. Split from\n// graph-layout.ts, which owns the shared types and `ringLayout`.\n\nimport { loopOverhang } from \"./graph-edge-routing\";\nimport type { GraphLayoutEdge, GraphLayoutNode, GraphLayoutPosition, GraphLayoutResult } from \"./graph-layout\";\n\nexport interface ColumnsLayoutNode extends GraphLayoutNode {\n  /** Column of the node. May be negative: the lowest level is the first column. */\n  level: number;\n  /** Nodes sharing a group stay contiguous within their column and are boxed together. */\n  group?: string;\n}\n\nexport interface ColumnsLayoutOptions {\n  /** Node bounding-box width in px. Defaults to 168. */\n  nodeWidth?: number;\n  /** Node bounding-box height in px. Defaults to 60. */\n  nodeHeight?: number;\n  /** Horizontal gap between the node boxes of adjacent columns in px. Defaults to 96. */\n  columnGap?: number;\n  /** Vertical gap between stacked nodes, and between group rectangles, in px. Defaults to 20. */\n  rowGap?: number;\n  /** Space between a group's nodes and its rectangle in px. Defaults to 12. */\n  groupPadding?: number;\n  /** Space reserved around the columns before the viewport edge. Defaults to 24. */\n  padding?: number;\n  /**\n   * Re-ordering passes over all columns after the first placement, alternating direction; a pass\n   * is kept only if it leaves fewer crossings. Defaults to 4. 0 keeps the first placement.\n   */\n  sweeps?: number;\n}\n\nexport interface GraphLayoutGroupBox {\n  /** `${level}:${group}` — a group spanning several columns gets one rectangle per column. */\n  id: string;\n  group: string;\n  level: number;\n  /** Top-left corner, in the same coordinate space as the layout's `width`/`height`. */\n  x: number;\n  y: number;\n  width: number;\n  height: number;\n}\n\nexport interface ColumnsLayoutResult extends GraphLayoutResult {\n  groups: GraphLayoutGroupBox[];\n}\n\ntype ColumnMetrics = Required<ColumnsLayoutOptions>;\n\ninterface GroupRun {\n  group: string | undefined;\n  nodes: ColumnsLayoutNode[];\n}\n\n/** One ordering of every column, stacked: the node centres and group rectangles it gives. */\ninterface Arrangement {\n  order: Map<number, ColumnsLayoutNode[]>;\n  placed: Map<string, GraphLayoutPosition>;\n  boxes: Map<number, GraphLayoutGroupBox[]>;\n}\n\n/** What stays fixed while columns are re-ordered. */\ninterface ColumnsContext {\n  m: ColumnMetrics;\n  levels: number[];\n  levelOf: Map<string, number>;\n  groupRank: Map<string | undefined, number>;\n  neighbours: Map<string, string[]>;\n  edges: readonly GraphLayoutEdge[];\n  /** Centre x and top y of a level's column. */\n  origin: (level: number) => { x: number; top: number; level: number };\n}\n\nconst DEFAULT_NODE_WIDTH = 168;\nconst DEFAULT_NODE_HEIGHT = 60;\nconst DEFAULT_COLUMN_GAP = 96;\nconst DEFAULT_ROW_GAP = 20;\nconst DEFAULT_GROUP_PADDING = 12;\nconst DEFAULT_PADDING = 24;\nconst DEFAULT_SWEEPS = 4;\n\nfunction mustGet<K, V>(map: ReadonlyMap<K, V>, key: K, what: string): V {\n  const value = map.get(key);\n  if (value === undefined) {\n    throw new Error(`columnsLayout: no ${what} for \"${String(key)}\"`);\n  }\n  return value;\n}\n\nfunction columnMetrics(options: ColumnsLayoutOptions): ColumnMetrics {\n  return {\n    nodeWidth: options.nodeWidth ?? DEFAULT_NODE_WIDTH,\n    nodeHeight: options.nodeHeight ?? DEFAULT_NODE_HEIGHT,\n    columnGap: options.columnGap ?? DEFAULT_COLUMN_GAP,\n    rowGap: options.rowGap ?? DEFAULT_ROW_GAP,\n    groupPadding: options.groupPadding ?? DEFAULT_GROUP_PADDING,\n    padding: options.padding ?? DEFAULT_PADDING,\n    sweeps: options.sweeps ?? DEFAULT_SWEEPS,\n  };\n}\n\nfunction indexColumns(nodes: readonly ColumnsLayoutNode[]) {\n  const columns = new Map<number, ColumnsLayoutNode[]>();\n  const groupRank = new Map<string | undefined, number>();\n  for (const node of nodes) {\n    if (!Number.isFinite(node.level)) {\n      throw new Error(`columnsLayout: node \"${node.id}\" has no finite level (got ${node.level})`);\n    }\n    if (!groupRank.has(node.group)) groupRank.set(node.group, groupRank.size);\n    const column = columns.get(node.level);\n    if (column) {\n      column.push(node);\n    } else {\n      columns.set(node.level, [node]);\n    }\n  }\n  return { columns, groupRank };\n}\n\nfunction indexNeighbours(\n  nodes: readonly ColumnsLayoutNode[],\n  edges: readonly GraphLayoutEdge[],\n): Map<string, string[]> {\n  const neighbours = new Map<string, string[]>(nodes.map((node) => [node.id, []]));\n  for (const edge of edges) {\n    const from = neighbours.get(edge.from);\n    const to = neighbours.get(edge.to);\n    if (!from || !to) {\n      const missing = from ? edge.to : edge.from;\n      throw new Error(`columnsLayout: edge \"${edge.id}\" references unknown node \"${missing}\"`);\n    }\n    from.push(edge.to);\n    to.push(edge.from);\n  }\n  return neighbours;\n}\n\nfunction columnHeight(column: readonly ColumnsLayoutNode[], m: ColumnMetrics): number {\n  const groups = new Set(column.map((node) => node.group));\n  groups.delete(undefined);\n  return column.length * m.nodeHeight + (column.length - 1) * m.rowGap + 2 * m.groupPadding * groups.size;\n}\n\n/** Groups in order of first appearance; within a group by ascending weight, the column's order on ties. */\nfunction orderColumn(\n  column: readonly ColumnsLayoutNode[],\n  groupRank: ReadonlyMap<string | undefined, number>,\n  weight: (node: ColumnsLayoutNode) => number,\n): GroupRun[] {\n  const runs = new Map<number, { node: ColumnsLayoutNode; index: number; weight: number }[]>();\n  column.forEach((node, index) => {\n    const rank = mustGet(groupRank, node.group, \"group rank\");\n    const entry = { node, index, weight: weight(node) };\n    const run = runs.get(rank);\n    if (run) {\n      run.push(entry);\n    } else {\n      runs.set(rank, [entry]);\n    }\n  });\n  return [...runs.entries()]\n    .sort(([a], [b]) => a - b)\n    .map(([, run]) => {\n      // Infinity - Infinity is NaN, which falls through to the column-order tiebreak.\n      const nodes = run.sort((a, b) => a.weight - b.weight || a.index - b.index).map((entry) => entry.node);\n      return { group: nodes[0]?.group, nodes };\n    });\n}\n\nfunction stackColumn(\n  runs: readonly GroupRun[],\n  origin: { x: number; top: number; level: number },\n  m: ColumnMetrics,\n  placed: Map<string, GraphLayoutPosition>,\n): GraphLayoutGroupBox[] {\n  const boxes: GraphLayoutGroupBox[] = [];\n  let cursor = origin.top;\n  for (const { group, nodes } of runs) {\n    const pad = group === undefined ? 0 : m.groupPadding;\n    const height = nodes.length * m.nodeHeight + (nodes.length - 1) * m.rowGap + 2 * pad;\n    nodes.forEach((node, index) => {\n      const top = cursor + pad + index * (m.nodeHeight + m.rowGap);\n      placed.set(node.id, { x: origin.x, y: top + m.nodeHeight / 2 });\n    });\n    if (group !== undefined) {\n      boxes.push({\n        id: `${origin.level}:${group}`,\n        group,\n        level: origin.level,\n        x: origin.x - m.nodeWidth / 2 - pad,\n        y: cursor,\n        width: m.nodeWidth + 2 * pad,\n        height,\n      });\n    }\n    cursor += height + m.rowGap;\n  }\n  return boxes;\n}\n\nfunction meanY(ids: readonly string[], placed: ReadonlyMap<string, GraphLayoutPosition>): number {\n  if (ids.length === 0) return Number.POSITIVE_INFINITY;\n  return ids.reduce((sum, id) => sum + mustGet(placed, id, \"position\").y, 0) / ids.length;\n}\n\n/**\n * Levels in the order they are first laid out — the one nearest 0, then\n * outward on each side — each paired with the already-placed adjacent level\n * its nodes are ordered against.\n */\nfunction placementOrder(levels: readonly number[]): [level: number, reference: number | undefined][] {\n  const anchor = levels.reduce((best, level) => (Math.abs(level) < Math.abs(best) ? level : best));\n  const outward = (side: readonly number[]) =>\n    side.map((level, index): [number, number] => [level, side[index - 1] ?? anchor]);\n  return [\n    [anchor, undefined],\n    ...outward(levels.filter((level) => level > anchor)),\n    ...outward(levels.filter((level) => level < anchor).reverse()),\n  ];\n}\n\n/** Orders one column by the mean y of its nodes' neighbours in the `references` levels, and stacks it. */\nfunction placeColumn(level: number, references: readonly number[], ctx: ColumnsContext, into: Arrangement): void {\n  const runs = orderColumn(mustGet(into.order, level, \"column\"), ctx.groupRank, (node) =>\n    meanY(\n      mustGet(ctx.neighbours, node.id, \"neighbours\").filter((id) =>\n        references.includes(mustGet(ctx.levelOf, id, \"level\")),\n      ),\n      into.placed,\n    ),\n  );\n  into.order.set(\n    level,\n    runs.flatMap((run) => run.nodes),\n  );\n  into.boxes.set(level, stackColumn(runs, ctx.origin(level), ctx.m, into.placed));\n}\n\n/** Pairs of edges between adjacent columns that cross, taking each edge as a straight line. */\nfunction countCrossings(ctx: ColumnsContext, placed: ReadonlyMap<string, GraphLayoutPosition>): number {\n  const spans = new Map<number, [lower: number, upper: number][]>();\n  for (const edge of ctx.edges) {\n    const levels = [mustGet(ctx.levelOf, edge.from, \"level\"), mustGet(ctx.levelOf, edge.to, \"level\")] as const;\n    const [lower, upper] = levels[0] < levels[1] ? [edge.from, edge.to] : [edge.to, edge.from];\n    const index = ctx.levels.indexOf(Math.min(...levels));\n    if (levels[0] === levels[1] || ctx.levels[index + 1] !== Math.max(...levels)) continue;\n    const span: [number, number] = [mustGet(placed, lower, \"position\").y, mustGet(placed, upper, \"position\").y];\n    spans.set(index, [...(spans.get(index) ?? []), span]);\n  }\n  let crossings = 0;\n  for (const gap of spans.values()) {\n    gap.forEach((a, index) => {\n      crossings += gap.slice(index + 1).filter((b) => (a[0] - b[0]) * (a[1] - b[1]) < 0).length;\n    });\n  }\n  return crossings;\n}\n\n/** A copy of `from` with every column re-ordered against both its neighbours, in the order given. */\nfunction sweep(from: Arrangement, sequence: readonly number[], ctx: ColumnsContext): Arrangement {\n  const next: Arrangement = { order: new Map(from.order), placed: new Map(from.placed), boxes: new Map(from.boxes) };\n  for (const level of sequence) {\n    const index = ctx.levels.indexOf(level);\n    const adjacent = [ctx.levels[index - 1], ctx.levels[index + 1]].filter((other): other is number => other !== undefined);\n    placeColumn(level, adjacent, ctx, next);\n  }\n  return next;\n}\n\n/**\n * Orders the columns. The first pass places the level nearest 0 and works\n * outward, ordering each column against the one just placed. Then up to\n * `sweeps` passes re-order every column against both its neighbours, inward\n * then outward, and the arrangement with the fewest crossings is kept: the\n * first pass's unless a later one strictly beats it.\n */\nfunction arrange(columns: ReadonlyMap<number, ColumnsLayoutNode[]>, ctx: ColumnsContext): Arrangement {\n  let current: Arrangement = { order: new Map(columns), placed: new Map(), boxes: new Map() };\n  for (const [level, reference] of placementOrder(ctx.levels)) {\n    placeColumn(level, reference === undefined ? [] : [reference], ctx, current);\n  }\n  let best = current;\n  let fewest = countCrossings(ctx, best.placed);\n  for (let pass = 0; pass < ctx.m.sweeps && fewest > 0; pass++) {\n    current = sweep(current, pass % 2 === 0 ? [...ctx.levels].reverse() : ctx.levels, ctx);\n    const crossings = countCrossings(ctx, current.placed);\n    if (crossings < fewest) {\n      best = current;\n      fewest = crossings;\n    }\n  }\n  return best;\n}\n\n/**\n * Places nodes in left-to-right columns by `level` (the lowest level first),\n * stacking each column top to bottom and centring it against the tallest one.\n *\n * Within a column, nodes of one group are contiguous, groups appearing in the\n * order they first occur in `nodes`. Inside a group nodes are ordered by the\n * mean y of their neighbours in the adjacent columns, so edges between columns\n * cross less (see `arrange`); nodes with no neighbour there go last, and ties\n * keep input order.\n *\n * Returns node centres plus one rectangle per (column, group). Extra width is\n * reserved on each side for the loops `routeEdges` draws outside the first and\n * last columns.\n */\nexport function columnsLayout(\n  nodes: readonly ColumnsLayoutNode[],\n  edges: readonly GraphLayoutEdge[],\n  options: ColumnsLayoutOptions = {},\n): ColumnsLayoutResult {\n  const m = columnMetrics(options);\n  const { columns, groupRank } = indexColumns(nodes);\n  const neighbours = indexNeighbours(nodes, edges);\n  const levels = [...columns.keys()].sort((a, b) => a - b);\n  if (levels.length === 0) {\n    return { width: 2 * m.padding, height: 2 * m.padding, positions: {}, groups: [] };\n  }\n\n  const minLevel = Math.min(...levels);\n  const tallest = Math.max(...[...columns.values()].map((column) => columnHeight(column, m)));\n  const inset = m.padding + (nodes.some((node) => node.group !== undefined) ? m.groupPadding : 0);\n  const { placed, boxes } = arrange(columns, {\n    m,\n    levels,\n    levelOf: new Map(nodes.map((node) => [node.id, node.level])),\n    groupRank,\n    neighbours,\n    edges,\n    origin: (level) => ({\n      x: inset + m.nodeWidth / 2 + (level - minLevel) * (m.nodeWidth + m.columnGap),\n      top: m.padding + (tallest - columnHeight(mustGet(columns, level, \"column\"), m)) / 2,\n      level,\n    }),\n  });\n\n  const room = loopOverhang(edges, Object.fromEntries(placed), m);\n  const span = (Math.max(...levels) - minLevel) * (m.nodeWidth + m.columnGap) + m.nodeWidth;\n  return {\n    width: room.left + 2 * inset + span + room.right,\n    height: tallest + 2 * m.padding,\n    positions: Object.fromEntries([...placed].map(([id, { x, y }]) => [id, { x: x + room.left, y }])),\n    groups: [...boxes.values()]\n      .flat()\n      .map((box) => ({ ...box, x: box.x + room.left }))\n      .sort((a, b) => a.level - b.level || a.y - b.y),\n  };\n}\n"],"names":["loopOverhang"],"mappings":";;;AA2EA,MAAM,qBAAqB;AAC3B,MAAM,sBAAsB;AAC5B,MAAM,qBAAqB;AAC3B,MAAM,kBAAkB;AACxB,MAAM,wBAAwB;AAC9B,MAAM,kBAAkB;AACxB,MAAM,iBAAiB;AAEvB,SAAS,QAAc,KAAwB,KAAQ,MAAiB;AACtE,QAAM,QAAQ,IAAI,IAAI,GAAG;AACzB,MAAI,UAAU,QAAW;AACvB,UAAM,IAAI,MAAM,qBAAqB,IAAI,SAAS,OAAO,GAAG,CAAC,GAAG;AAAA,EAClE;AACA,SAAO;AACT;AAEA,SAAS,cAAc,SAA8C;AACnE,SAAO;AAAA,IACL,WAAW,QAAQ,aAAa;AAAA,IAChC,YAAY,QAAQ,cAAc;AAAA,IAClC,WAAW,QAAQ,aAAa;AAAA,IAChC,QAAQ,QAAQ,UAAU;AAAA,IAC1B,cAAc,QAAQ,gBAAgB;AAAA,IACtC,SAAS,QAAQ,WAAW;AAAA,IAC5B,QAAQ,QAAQ,UAAU;AAAA,EAAA;AAE9B;AAEA,SAAS,aAAa,OAAqC;AACzD,QAAM,8BAAc,IAAA;AACpB,QAAM,gCAAgB,IAAA;AACtB,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,OAAO,SAAS,KAAK,KAAK,GAAG;AAChC,YAAM,IAAI,MAAM,wBAAwB,KAAK,EAAE,8BAA8B,KAAK,KAAK,GAAG;AAAA,IAC5F;AACA,QAAI,CAAC,UAAU,IAAI,KAAK,KAAK,EAAG,WAAU,IAAI,KAAK,OAAO,UAAU,IAAI;AACxE,UAAM,SAAS,QAAQ,IAAI,KAAK,KAAK;AACrC,QAAI,QAAQ;AACV,aAAO,KAAK,IAAI;AAAA,IAClB,OAAO;AACL,cAAQ,IAAI,KAAK,OAAO,CAAC,IAAI,CAAC;AAAA,IAChC;AAAA,EACF;AACA,SAAO,EAAE,SAAS,UAAA;AACpB;AAEA,SAAS,gBACP,OACA,OACuB;AACvB,QAAM,aAAa,IAAI,IAAsB,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,CAAA,CAAE,CAAC,CAAC;AAC/E,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,WAAW,IAAI,KAAK,IAAI;AACrC,UAAM,KAAK,WAAW,IAAI,KAAK,EAAE;AACjC,QAAI,CAAC,QAAQ,CAAC,IAAI;AAChB,YAAM,UAAU,OAAO,KAAK,KAAK,KAAK;AACtC,YAAM,IAAI,MAAM,wBAAwB,KAAK,EAAE,8BAA8B,OAAO,GAAG;AAAA,IACzF;AACA,SAAK,KAAK,KAAK,EAAE;AACjB,OAAG,KAAK,KAAK,IAAI;AAAA,EACnB;AACA,SAAO;AACT;AAEA,SAAS,aAAa,QAAsC,GAA0B;AACpF,QAAM,SAAS,IAAI,IAAI,OAAO,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC;AACvD,SAAO,OAAO,MAAS;AACvB,SAAO,OAAO,SAAS,EAAE,cAAc,OAAO,SAAS,KAAK,EAAE,SAAS,IAAI,EAAE,eAAe,OAAO;AACrG;AAGA,SAAS,YACP,QACA,WACA,QACY;AACZ,QAAM,2BAAW,IAAA;AACjB,SAAO,QAAQ,CAAC,MAAM,UAAU;AAC9B,UAAM,OAAO,QAAQ,WAAW,KAAK,OAAO,YAAY;AACxD,UAAM,QAAQ,EAAE,MAAM,OAAO,QAAQ,OAAO,IAAI,EAAA;AAChD,UAAM,MAAM,KAAK,IAAI,IAAI;AACzB,QAAI,KAAK;AACP,UAAI,KAAK,KAAK;AAAA,IAChB,OAAO;AACL,WAAK,IAAI,MAAM,CAAC,KAAK,CAAC;AAAA,IACxB;AAAA,EACF,CAAC;AACD,SAAO,CAAC,GAAG,KAAK,QAAA,CAAS,EACtB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,EACxB,IAAI,CAAC,CAAA,EAAG,GAAG,MAAM;;AAEhB,UAAM,QAAQ,IAAI,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI;AACpG,WAAO,EAAE,QAAO,WAAM,CAAC,MAAP,mBAAU,OAAO,MAAA;AAAA,EACnC,CAAC;AACL;AAEA,SAAS,YACP,MACA,QACA,GACA,QACuB;AACvB,QAAM,QAA+B,CAAA;AACrC,MAAI,SAAS,OAAO;AACpB,aAAW,EAAE,OAAO,MAAA,KAAW,MAAM;AACnC,UAAM,MAAM,UAAU,SAAY,IAAI,EAAE;AACxC,UAAM,SAAS,MAAM,SAAS,EAAE,cAAc,MAAM,SAAS,KAAK,EAAE,SAAS,IAAI;AACjF,UAAM,QAAQ,CAAC,MAAM,UAAU;AAC7B,YAAM,MAAM,SAAS,MAAM,SAAS,EAAE,aAAa,EAAE;AACrD,aAAO,IAAI,KAAK,IAAI,EAAE,GAAG,OAAO,GAAG,GAAG,MAAM,EAAE,aAAa,EAAA,CAAG;AAAA,IAChE,CAAC;AACD,QAAI,UAAU,QAAW;AACvB,YAAM,KAAK;AAAA,QACT,IAAI,GAAG,OAAO,KAAK,IAAI,KAAK;AAAA,QAC5B;AAAA,QACA,OAAO,OAAO;AAAA,QACd,GAAG,OAAO,IAAI,EAAE,YAAY,IAAI;AAAA,QAChC,GAAG;AAAA,QACH,OAAO,EAAE,YAAY,IAAI;AAAA,QACzB;AAAA,MAAA,CACD;AAAA,IACH;AACA,cAAU,SAAS,EAAE;AAAA,EACvB;AACA,SAAO;AACT;AAEA,SAAS,MAAM,KAAwB,QAA0D;AAC/F,MAAI,IAAI,WAAW,EAAG,QAAO,OAAO;AACpC,SAAO,IAAI,OAAO,CAAC,KAAK,OAAO,MAAM,QAAQ,QAAQ,IAAI,UAAU,EAAE,GAAG,CAAC,IAAI,IAAI;AACnF;AAOA,SAAS,eAAe,QAA6E;AACnG,QAAM,SAAS,OAAO,OAAO,CAAC,MAAM,UAAW,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,IAAI,QAAQ,IAAK;AAC/F,QAAM,UAAU,CAAC,SACf,KAAK,IAAI,CAAC,OAAO,UAA4B,CAAC,OAAO,KAAK,QAAQ,CAAC,KAAK,MAAM,CAAC;AACjF,SAAO;AAAA,IACL,CAAC,QAAQ,MAAS;AAAA,IAClB,GAAG,QAAQ,OAAO,OAAO,CAAC,UAAU,QAAQ,MAAM,CAAC;AAAA,IACnD,GAAG,QAAQ,OAAO,OAAO,CAAC,UAAU,QAAQ,MAAM,EAAE,QAAA,CAAS;AAAA,EAAA;AAEjE;AAGA,SAAS,YAAY,OAAe,YAA+B,KAAqB,MAAyB;AAC/G,QAAM,OAAO;AAAA,IAAY,QAAQ,KAAK,OAAO,OAAO,QAAQ;AAAA,IAAG,IAAI;AAAA,IAAW,CAAC,SAC7E;AAAA,MACE,QAAQ,IAAI,YAAY,KAAK,IAAI,YAAY,EAAE;AAAA,QAAO,CAAC,OACrD,WAAW,SAAS,QAAQ,IAAI,SAAS,IAAI,OAAO,CAAC;AAAA,MAAA;AAAA,MAEvD,KAAK;AAAA,IAAA;AAAA,EACP;AAEF,OAAK,MAAM;AAAA,IACT;AAAA,IACA,KAAK,QAAQ,CAAC,QAAQ,IAAI,KAAK;AAAA,EAAA;AAEjC,OAAK,MAAM,IAAI,OAAO,YAAY,MAAM,IAAI,OAAO,KAAK,GAAG,IAAI,GAAG,KAAK,MAAM,CAAC;AAChF;AAGA,SAAS,eAAe,KAAqB,QAA0D;AACrG,QAAM,4BAAY,IAAA;AAClB,aAAW,QAAQ,IAAI,OAAO;AAC5B,UAAM,SAAS,CAAC,QAAQ,IAAI,SAAS,KAAK,MAAM,OAAO,GAAG,QAAQ,IAAI,SAAS,KAAK,IAAI,OAAO,CAAC;AAChG,UAAM,CAAC,OAAO,KAAK,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,MAAM,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI;AACzF,UAAM,QAAQ,IAAI,OAAO,QAAQ,KAAK,IAAI,GAAG,MAAM,CAAC;AACpD,QAAI,OAAO,CAAC,MAAM,OAAO,CAAC,KAAK,IAAI,OAAO,QAAQ,CAAC,MAAM,KAAK,IAAI,GAAG,MAAM,EAAG;AAC9E,UAAM,OAAyB,CAAC,QAAQ,QAAQ,OAAO,UAAU,EAAE,GAAG,QAAQ,QAAQ,OAAO,UAAU,EAAE,CAAC;AAC1G,UAAM,IAAI,OAAO,CAAC,GAAI,MAAM,IAAI,KAAK,KAAK,IAAK,IAAI,CAAC;AAAA,EACtD;AACA,MAAI,YAAY;AAChB,aAAW,OAAO,MAAM,UAAU;AAChC,QAAI,QAAQ,CAAC,GAAG,UAAU;AACxB,mBAAa,IAAI,MAAM,QAAQ,CAAC,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;AAAA,IACrF,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAGA,SAAS,MAAM,MAAmB,UAA6B,KAAkC;AAC/F,QAAM,OAAoB,EAAE,OAAO,IAAI,IAAI,KAAK,KAAK,GAAG,QAAQ,IAAI,IAAI,KAAK,MAAM,GAAG,OAAO,IAAI,IAAI,KAAK,KAAK,EAAA;AAC/G,aAAW,SAAS,UAAU;AAC5B,UAAM,QAAQ,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,WAAW,CAAC,IAAI,OAAO,QAAQ,CAAC,GAAG,IAAI,OAAO,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,UAA2B,UAAU,MAAS;AACtH,gBAAY,OAAO,UAAU,KAAK,IAAI;AAAA,EACxC;AACA,SAAO;AACT;AASA,SAAS,QAAQ,SAAmD,KAAkC;AACpG,MAAI,UAAuB,EAAE,OAAO,IAAI,IAAI,OAAO,GAAG,QAAQ,oBAAI,IAAA,GAAO,OAAO,oBAAI,MAAI;AACxF,aAAW,CAAC,OAAO,SAAS,KAAK,eAAe,IAAI,MAAM,GAAG;AAC3D,gBAAY,OAAO,cAAc,SAAY,CAAA,IAAK,CAAC,SAAS,GAAG,KAAK,OAAO;AAAA,EAC7E;AACA,MAAI,OAAO;AACX,MAAI,SAAS,eAAe,KAAK,KAAK,MAAM;AAC5C,WAAS,OAAO,GAAG,OAAO,IAAI,EAAE,UAAU,SAAS,GAAG,QAAQ;AAC5D,cAAU,MAAM,SAAS,OAAO,MAAM,IAAI,CAAC,GAAG,IAAI,MAAM,EAAE,QAAA,IAAY,IAAI,QAAQ,GAAG;AACrF,UAAM,YAAY,eAAe,KAAK,QAAQ,MAAM;AACpD,QAAI,YAAY,QAAQ;AACtB,aAAO;AACP,eAAS;AAAA,IACX;AAAA,EACF;AACA,SAAO;AACT;AAgBO,SAAS,cACd,OACA,OACA,UAAgC,CAAA,GACX;AACrB,QAAM,IAAI,cAAc,OAAO;AAC/B,QAAM,EAAE,SAAS,cAAc,aAAa,KAAK;AACjD,QAAM,aAAa,gBAAgB,OAAO,KAAK;AAC/C,QAAM,SAAS,CAAC,GAAG,QAAQ,KAAA,CAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACvD,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,OAAO,IAAI,EAAE,SAAS,QAAQ,IAAI,EAAE,SAAS,WAAW,CAAA,GAAI,QAAQ,CAAA,EAAC;AAAA,EAChF;AAEA,QAAM,WAAW,KAAK,IAAI,GAAG,MAAM;AACnC,QAAM,UAAU,KAAK,IAAI,GAAG,CAAC,GAAG,QAAQ,OAAA,CAAQ,EAAE,IAAI,CAAC,WAAW,aAAa,QAAQ,CAAC,CAAC,CAAC;AAC1F,QAAM,QAAQ,EAAE,WAAW,MAAM,KAAK,CAAC,SAAS,KAAK,UAAU,MAAS,IAAI,EAAE,eAAe;AAC7F,QAAM,EAAE,QAAQ,UAAU,QAAQ,SAAS;AAAA,IACzC;AAAA,IACA;AAAA,IACA,SAAS,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC;AAAA,IAC3D;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,CAAC,WAAW;AAAA,MAClB,GAAG,QAAQ,EAAE,YAAY,KAAK,QAAQ,aAAa,EAAE,YAAY,EAAE;AAAA,MACnE,KAAK,EAAE,WAAW,UAAU,aAAa,QAAQ,SAAS,OAAO,QAAQ,GAAG,CAAC,KAAK;AAAA,MAClF;AAAA,IAAA;AAAA,EACF,CACD;AAED,QAAM,OAAOA,iBAAAA,aAAa,OAAO,OAAO,YAAY,MAAM,GAAG,CAAC;AAC9D,QAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,IAAI,aAAa,EAAE,YAAY,EAAE,aAAa,EAAE;AAChF,SAAO;AAAA,IACL,OAAO,KAAK,OAAO,IAAI,QAAQ,OAAO,KAAK;AAAA,IAC3C,QAAQ,UAAU,IAAI,EAAE;AAAA,IACxB,WAAW,OAAO,YAAY,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,KAAK,MAAM,EAAA,CAAG,CAAC,CAAC;AAAA,IAChG,QAAQ,CAAC,GAAG,MAAM,QAAQ,EACvB,KAAA,EACA,IAAI,CAAC,SAAS,EAAE,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK,KAAA,EAAO,EAC/C,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AAAA,EAAA;AAEpD;;"}
+{"version":3,"file":"graph-columns-layout.cjs","sources":["../../src/data/graph-columns-layout.ts"],"sourcesContent":["// Level-column layout for GraphDiagram: pure math, no React. Split from\n// graph-layout.ts, which owns the shared types and `ringLayout`.\n\nimport { loopOverhang } from \"./graph-edge-routing\";\nimport type { GraphLayoutEdge, GraphLayoutNode, GraphLayoutPosition, GraphLayoutResult } from \"./graph-layout\";\n\nexport interface ColumnsLayoutNode extends GraphLayoutNode {\n  /** Column of the node. May be negative: the lowest level is the first column. */\n  level: number;\n  /** Nodes sharing a group stay contiguous within their column and are boxed together. */\n  group?: string;\n  /** Drawn at `compactNodeHeight`; a group of only compact nodes stacks them at the compact gap and padding. */\n  compact?: boolean;\n}\n\n/** The most members a group shows at once in a column; a group with more scrolls them in a window this many rows tall. */\nexport const GROUP_MEMBER_WINDOW = 10;\n/** Height of the \"rows a–b of n\" footer under a windowed group's rows. */\nconst GROUP_WINDOW_FOOTER_HEIGHT = 18;\n\nexport interface ColumnsLayoutOptions {\n  /** Group ids drawn as records with a header and flush compact rows. */\n  records?: readonly string[];\n  /**\n   * Group ids drawn as their header alone, `recordHeaderHeight` tall. Each holds one node per column it\n   * is drawn in, the stand-in its edges attach to, placed at the header's middle.\n   */\n  collapsed?: readonly string[];\n  /** Height of a record's header in px. Defaults to 24. */\n  recordHeaderHeight?: number;\n  /** Node bounding-box width in px. Defaults to 168. */\n  nodeWidth?: number;\n  /** Node bounding-box height in px. Defaults to 60. */\n  nodeHeight?: number;\n  /** Horizontal gap between the node boxes of adjacent columns in px. Defaults to 96. */\n  columnGap?: number;\n  /** Vertical gap between stacked nodes, and between group rectangles, in px. Defaults to 20. */\n  rowGap?: number;\n  /** Space between a group's nodes and its rectangle in px. Defaults to 12. */\n  groupPadding?: number;\n  /** Height of a compact node in px. Defaults to 24. */\n  compactNodeHeight?: number;\n  /** Vertical gap between the nodes of a group of only compact nodes in px. Defaults to 4. */\n  compactRowGap?: number;\n  /** Space between a group of only compact nodes and its rectangle in px. Defaults to 8. */\n  compactGroupPadding?: number;\n  /** Space reserved around the columns before the viewport edge. Defaults to 24. */\n  padding?: number;\n  /**\n   * Re-ordering passes over all columns after the first placement, alternating direction; a pass\n   * is kept only if it leaves fewer crossings. Defaults to 4. 0 keeps the first placement.\n   */\n  sweeps?: number;\n}\n\nexport interface GraphLayoutGroupBox {\n  /** `${level}:${group}` — a group spanning several columns gets one rectangle per column. */\n  id: string;\n  group: string;\n  level: number;\n  /** Top-left corner, in the same coordinate space as the layout's `width`/`height`. */\n  x: number;\n  y: number;\n  width: number;\n  height: number;\n  record: boolean;\n  headerHeight: number;\n  /** Set when the group holds more members in this column than `GROUP_MEMBER_WINDOW`: they scroll in a window. */\n  window?: GroupMemberWindow;\n  /** Drawn as its header alone: see `ColumnsLayoutOptions.collapsed`. */\n  collapsed?: true;\n}\n\n/**\n * The rows a group with more members than `GROUP_MEMBER_WINDOW` shows at once. The layout places every\n * member as if the group were drawn whole; a member shown from row `start` is drawn `tops[start]` higher.\n */\nexport interface GroupMemberWindow {\n  /** The members in this column, top to bottom. */\n  members: string[];\n  /** Each member's top, from the first member's top. */\n  tops: number[];\n  /** How many rows show at once. */\n  rows: number;\n  /** Top of the area members are drawn in, and its height. */\n  top: number;\n  height: number;\n  /** Height of the footer below that area, inside the group's rectangle. */\n  footerHeight: number;\n}\n\nexport interface ColumnsLayoutResult extends GraphLayoutResult {\n  groups: GraphLayoutGroupBox[];\n}\n\ntype ColumnMetrics = Required<ColumnsLayoutOptions>;\n\ninterface GroupRun {\n  group: string | undefined;\n  nodes: ColumnsLayoutNode[];\n}\n\n/** One ordering of every column, stacked: the node centres and group rectangles it gives. */\ninterface Arrangement {\n  order: Map<number, ColumnsLayoutNode[]>;\n  placed: Map<string, GraphLayoutPosition>;\n  boxes: Map<number, GraphLayoutGroupBox[]>;\n}\n\n/** What stays fixed while columns are re-ordered. */\ninterface ColumnsContext {\n  m: ColumnMetrics;\n  levels: number[];\n  levelOf: Map<string, number>;\n  groupRank: Map<string | undefined, number>;\n  neighbours: Map<string, string[]>;\n  edges: readonly GraphLayoutEdge[];\n  /** Centre x and top y of a level's column. */\n  origin: (level: number) => { x: number; top: number; level: number };\n}\n\nconst DEFAULT_NODE_WIDTH = 168;\nconst DEFAULT_NODE_HEIGHT = 60;\nconst DEFAULT_COLUMN_GAP = 96;\nconst DEFAULT_ROW_GAP = 20;\nconst DEFAULT_GROUP_PADDING = 12;\nconst DEFAULT_COMPACT_NODE_HEIGHT = 24;\nconst DEFAULT_COMPACT_ROW_GAP = 4;\nconst DEFAULT_COMPACT_GROUP_PADDING = 8;\nconst DEFAULT_PADDING = 24;\nconst DEFAULT_SWEEPS = 4;\n\nfunction mustGet<K, V>(map: ReadonlyMap<K, V>, key: K, what: string): V {\n  const value = map.get(key);\n  if (value === undefined) {\n    throw new Error(`columnsLayout: no ${what} for \"${String(key)}\"`);\n  }\n  return value;\n}\n\nfunction columnMetrics(options: ColumnsLayoutOptions): ColumnMetrics {\n  return {\n    records: options.records ?? [],\n    collapsed: options.collapsed ?? [],\n    recordHeaderHeight: options.recordHeaderHeight ?? 24,\n    nodeWidth: options.nodeWidth ?? DEFAULT_NODE_WIDTH,\n    nodeHeight: options.nodeHeight ?? DEFAULT_NODE_HEIGHT,\n    columnGap: options.columnGap ?? DEFAULT_COLUMN_GAP,\n    rowGap: options.rowGap ?? DEFAULT_ROW_GAP,\n    groupPadding: options.groupPadding ?? DEFAULT_GROUP_PADDING,\n    compactNodeHeight: options.compactNodeHeight ?? DEFAULT_COMPACT_NODE_HEIGHT,\n    compactRowGap: options.compactRowGap ?? DEFAULT_COMPACT_ROW_GAP,\n    compactGroupPadding: options.compactGroupPadding ?? DEFAULT_COMPACT_GROUP_PADDING,\n    padding: options.padding ?? DEFAULT_PADDING,\n    sweeps: options.sweeps ?? DEFAULT_SWEEPS,\n  };\n}\n\nfunction indexColumns(nodes: readonly ColumnsLayoutNode[]) {\n  const columns = new Map<number, ColumnsLayoutNode[]>();\n  const groupRank = new Map<string | undefined, number>();\n  for (const node of nodes) {\n    if (!Number.isFinite(node.level)) {\n      throw new Error(`columnsLayout: node \"${node.id}\" has no finite level (got ${node.level})`);\n    }\n    if (!groupRank.has(node.group)) groupRank.set(node.group, groupRank.size);\n    const column = columns.get(node.level);\n    if (column) {\n      column.push(node);\n    } else {\n      columns.set(node.level, [node]);\n    }\n  }\n  return { columns, groupRank };\n}\n\nfunction indexNeighbours(\n  nodes: readonly ColumnsLayoutNode[],\n  edges: readonly GraphLayoutEdge[],\n): Map<string, string[]> {\n  const neighbours = new Map<string, string[]>(nodes.map((node) => [node.id, []]));\n  for (const edge of edges) {\n    const from = neighbours.get(edge.from);\n    const to = neighbours.get(edge.to);\n    if (!from || !to) {\n      const missing = from ? edge.to : edge.from;\n      throw new Error(`columnsLayout: edge \"${edge.id}\" references unknown node \"${missing}\"`);\n    }\n    from.push(edge.to);\n    to.push(edge.from);\n  }\n  return neighbours;\n}\n\ninterface RunMetrics {\n  pad: number;\n  gap: number;\n  heightOf: (node: ColumnsLayoutNode) => number;\n  /** Room above the first node inside the run's rectangle: a record's header. */\n  header: number;\n  height: number;\n  /** The height members are drawn in, when there are more of them than the window holds. */\n  view?: number;\n  collapsed: boolean;\n}\n\nfunction collapsedRun(group: string, nodes: readonly ColumnsLayoutNode[], m: ColumnMetrics): RunMetrics {\n  if (nodes.length !== 1) throw new Error(`columnsLayout: collapsed group \"${group}\" holds ${nodes.length} nodes in a column; it draws one stand-in`);\n  return { pad: 0, gap: 0, heightOf: () => m.recordHeaderHeight, header: 0, height: m.recordHeaderHeight, collapsed: true };\n}\n\n/**\n * How a run of nodes stacks: each node's height, the gap between them and the padding inside the run's\n * rectangle. A grouped run of only compact nodes takes the compact gap and padding; any other run the\n * regular ones, whatever its order, so a column's height does not depend on how it is ordered. A group\n * of more than `GROUP_MEMBER_WINDOW` members is only as tall as that many of its tallest rows, over a footer.\n */\nfunction runMetrics(group: string | undefined, nodes: readonly ColumnsLayoutNode[], m: ColumnMetrics, record: boolean): RunMetrics {\n  if (group !== undefined && m.collapsed.includes(group)) return collapsedRun(group, nodes, m);\n  let stack: Omit<RunMetrics, \"height\" | \"collapsed\">;\n  if (record) {\n    const regular = nodes.find((node) => !node.compact);\n    if (regular) throw new Error(`columnsLayout: record group \"${group}\" holds non-compact node \"${regular.id}\"`);\n    stack = { pad: 0, gap: 0, heightOf: () => m.compactNodeHeight, header: m.recordHeaderHeight };\n  } else {\n    const compact = group !== undefined && nodes.every((node) => node.compact === true);\n    const heightOf = (node: ColumnsLayoutNode) => (node.compact ? m.compactNodeHeight : m.nodeHeight);\n    stack = { pad: group === undefined ? 0 : compact ? m.compactGroupPadding : m.groupPadding, gap: compact ? m.compactRowGap : m.rowGap, heightOf, header: 0 };\n  }\n  const chrome = stack.header + 2 * stack.pad;\n  if (group === undefined || nodes.length <= GROUP_MEMBER_WINDOW) {\n    const stacked = nodes.reduce((sum, node) => sum + stack.heightOf(node), 0) + (nodes.length - 1) * stack.gap;\n    return { ...stack, height: chrome + stacked, collapsed: false };\n  }\n  const view = GROUP_MEMBER_WINDOW * Math.max(...nodes.map(stack.heightOf)) + (GROUP_MEMBER_WINDOW - 1) * stack.gap;\n  return { ...stack, view, height: chrome + view + GROUP_WINDOW_FOOTER_HEIGHT, collapsed: false };\n}\n\nfunction columnHeight(column: readonly ColumnsLayoutNode[], m: ColumnMetrics): number {\n  const runs = new Map<string | undefined, ColumnsLayoutNode[]>();\n  for (const node of column) runs.set(node.group, [...(runs.get(node.group) ?? []), node]);\n  const stacked = [...runs].reduce((sum, [group, nodes]) => sum + runMetrics(group, nodes, m, group !== undefined && m.records.includes(group)).height, 0);\n  return stacked + (runs.size - 1) * m.rowGap;\n}\n\n/** Groups in order of first appearance; within a group by ascending weight, the column's order on ties. */\nfunction orderColumn(\n  column: readonly ColumnsLayoutNode[],\n  groupRank: ReadonlyMap<string | undefined, number>,\n  weight: (node: ColumnsLayoutNode) => number,\n): GroupRun[] {\n  const runs = new Map<number, { node: ColumnsLayoutNode; index: number; weight: number }[]>();\n  column.forEach((node, index) => {\n    const rank = mustGet(groupRank, node.group, \"group rank\");\n    const entry = { node, index, weight: weight(node) };\n    const run = runs.get(rank);\n    if (run) {\n      run.push(entry);\n    } else {\n      runs.set(rank, [entry]);\n    }\n  });\n  return [...runs.entries()]\n    .sort(([a], [b]) => a - b)\n    .map(([, run]) => {\n      // Infinity - Infinity is NaN, which falls through to the column-order tiebreak.\n      const nodes = run.sort((a, b) => a.weight - b.weight || a.index - b.index).map((entry) => entry.node);\n      return { group: nodes[0]?.group, nodes };\n    });\n}\n\nfunction stackColumn(\n  runs: readonly GroupRun[],\n  origin: { x: number; top: number; level: number },\n  m: ColumnMetrics,\n  placed: Map<string, GraphLayoutPosition>,\n): GraphLayoutGroupBox[] {\n  const boxes: GraphLayoutGroupBox[] = [];\n  let cursor = origin.top;\n  for (const { group, nodes } of runs) {\n    const record = group !== undefined && m.records.includes(group);\n    const run = runMetrics(group, nodes, m, record);\n    const first = cursor + run.pad + run.header;\n    const tops: number[] = [];\n    let top = first;\n    for (const node of nodes) {\n      tops.push(top - first);\n      placed.set(node.id, { x: origin.x, y: top + run.heightOf(node) / 2 });\n      top += run.heightOf(node) + run.gap;\n    }\n    if (group !== undefined) {\n      const memberWindow: GroupMemberWindow | undefined = run.view === undefined ? undefined\n        : { members: nodes.map((node) => node.id), tops, rows: GROUP_MEMBER_WINDOW, top: first, height: run.view, footerHeight: GROUP_WINDOW_FOOTER_HEIGHT };\n      boxes.push({\n        id: `${origin.level}:${group}`,\n        group,\n        level: origin.level,\n        x: origin.x - m.nodeWidth / 2 - run.pad,\n        y: cursor,\n        width: m.nodeWidth + 2 * run.pad,\n        height: run.height,\n        record,\n        headerHeight: run.collapsed ? m.recordHeaderHeight : run.header,\n        ...(memberWindow ? { window: memberWindow } : {}),\n        ...(run.collapsed ? { collapsed: true as const } : {}),\n      });\n    }\n    cursor += run.height + m.rowGap;\n  }\n  return boxes;\n}\n\nfunction meanY(ids: readonly string[], placed: ReadonlyMap<string, GraphLayoutPosition>): number {\n  if (ids.length === 0) return Number.POSITIVE_INFINITY;\n  return ids.reduce((sum, id) => sum + mustGet(placed, id, \"position\").y, 0) / ids.length;\n}\n\n/**\n * Levels in the order they are first laid out — the one nearest 0, then\n * outward on each side — each paired with the already-placed adjacent level\n * its nodes are ordered against.\n */\nfunction placementOrder(levels: readonly number[]): [level: number, reference: number | undefined][] {\n  const anchor = levels.reduce((best, level) => (Math.abs(level) < Math.abs(best) ? level : best));\n  const outward = (side: readonly number[]) =>\n    side.map((level, index): [number, number] => [level, side[index - 1] ?? anchor]);\n  return [\n    [anchor, undefined],\n    ...outward(levels.filter((level) => level > anchor)),\n    ...outward(levels.filter((level) => level < anchor).reverse()),\n  ];\n}\n\n/** Orders one column by the mean y of its nodes' neighbours in the `references` levels, and stacks it. */\nfunction placeColumn(level: number, references: readonly number[], ctx: ColumnsContext, into: Arrangement): void {\n  const runs = orderColumn(mustGet(into.order, level, \"column\"), ctx.groupRank, (node) =>\n    meanY(\n      mustGet(ctx.neighbours, node.id, \"neighbours\").filter((id) =>\n        references.includes(mustGet(ctx.levelOf, id, \"level\")),\n      ),\n      into.placed,\n    ),\n  );\n  into.order.set(\n    level,\n    runs.flatMap((run) => run.nodes),\n  );\n  into.boxes.set(level, stackColumn(runs, ctx.origin(level), ctx.m, into.placed));\n}\n\n/** Pairs of edges between adjacent columns that cross, taking each edge as a straight line. */\nfunction countCrossings(ctx: ColumnsContext, placed: ReadonlyMap<string, GraphLayoutPosition>): number {\n  const spans = new Map<number, [lower: number, upper: number][]>();\n  for (const edge of ctx.edges) {\n    const levels = [mustGet(ctx.levelOf, edge.from, \"level\"), mustGet(ctx.levelOf, edge.to, \"level\")] as const;\n    const [lower, upper] = levels[0] < levels[1] ? [edge.from, edge.to] : [edge.to, edge.from];\n    const index = ctx.levels.indexOf(Math.min(...levels));\n    if (levels[0] === levels[1] || ctx.levels[index + 1] !== Math.max(...levels)) continue;\n    const span: [number, number] = [mustGet(placed, lower, \"position\").y, mustGet(placed, upper, \"position\").y];\n    spans.set(index, [...(spans.get(index) ?? []), span]);\n  }\n  let crossings = 0;\n  for (const gap of spans.values()) {\n    gap.forEach((a, index) => {\n      crossings += gap.slice(index + 1).filter((b) => (a[0] - b[0]) * (a[1] - b[1]) < 0).length;\n    });\n  }\n  return crossings;\n}\n\n/** A copy of `from` with every column re-ordered against both its neighbours, in the order given. */\nfunction sweep(from: Arrangement, sequence: readonly number[], ctx: ColumnsContext): Arrangement {\n  const next: Arrangement = { order: new Map(from.order), placed: new Map(from.placed), boxes: new Map(from.boxes) };\n  for (const level of sequence) {\n    const index = ctx.levels.indexOf(level);\n    const adjacent = [ctx.levels[index - 1], ctx.levels[index + 1]].filter((other): other is number => other !== undefined);\n    placeColumn(level, adjacent, ctx, next);\n  }\n  return next;\n}\n\n/**\n * Orders the columns. The first pass places the level nearest 0 and works\n * outward, ordering each column against the one just placed. Then up to\n * `sweeps` passes re-order every column against both its neighbours, inward\n * then outward, and the arrangement with the fewest crossings is kept: the\n * first pass's unless a later one strictly beats it.\n */\nfunction arrange(columns: ReadonlyMap<number, ColumnsLayoutNode[]>, ctx: ColumnsContext): Arrangement {\n  let current: Arrangement = { order: new Map(columns), placed: new Map(), boxes: new Map() };\n  for (const [level, reference] of placementOrder(ctx.levels)) {\n    placeColumn(level, reference === undefined ? [] : [reference], ctx, current);\n  }\n  let best = current;\n  let fewest = countCrossings(ctx, best.placed);\n  for (let pass = 0; pass < ctx.m.sweeps && fewest > 0; pass++) {\n    current = sweep(current, pass % 2 === 0 ? [...ctx.levels].reverse() : ctx.levels, ctx);\n    const crossings = countCrossings(ctx, current.placed);\n    if (crossings < fewest) {\n      best = current;\n      fewest = crossings;\n    }\n  }\n  return best;\n}\n\n/**\n * Places nodes in left-to-right columns by `level` (the lowest level first),\n * stacking each column top to bottom and centring it against the tallest one.\n *\n * Within a column, nodes of one group are contiguous, groups appearing in the\n * order they first occur in `nodes`. Inside a group nodes are ordered by the\n * mean y of their neighbours in the adjacent columns, so edges between columns\n * cross less (see `arrange`); nodes with no neighbour there go last, and ties\n * keep input order.\n *\n * Returns node centres plus one rectangle per (column, group). Extra width is\n * reserved on each side for the loops `routeEdges` draws outside the first and\n * last columns.\n */\nexport function columnsLayout(\n  nodes: readonly ColumnsLayoutNode[],\n  edges: readonly GraphLayoutEdge[],\n  options: ColumnsLayoutOptions = {},\n): ColumnsLayoutResult {\n  const m = columnMetrics(options);\n  const { columns, groupRank } = indexColumns(nodes);\n  const neighbours = indexNeighbours(nodes, edges);\n  const levels = [...columns.keys()].sort((a, b) => a - b);\n  if (levels.length === 0) {\n    return { width: 2 * m.padding, height: 2 * m.padding, positions: {}, groups: [] };\n  }\n\n  const minLevel = Math.min(...levels);\n  const tallest = Math.max(...[...columns.values()].map((column) => columnHeight(column, m)));\n  const inset = m.padding + (nodes.some((node) => node.group !== undefined) ? m.groupPadding : 0);\n  const { placed, boxes } = arrange(columns, {\n    m,\n    levels,\n    levelOf: new Map(nodes.map((node) => [node.id, node.level])),\n    groupRank,\n    neighbours,\n    edges,\n    origin: (level) => ({\n      x: inset + m.nodeWidth / 2 + (level - minLevel) * (m.nodeWidth + m.columnGap),\n      top: m.padding + (tallest - columnHeight(mustGet(columns, level, \"column\"), m)) / 2,\n      level,\n    }),\n  });\n\n  const nodeHeights = Object.fromEntries(nodes.filter((node) => node.compact).map((node) => [node.id, m.compactNodeHeight]));\n  const room = loopOverhang(edges, Object.fromEntries(placed), { ...m, nodeHeights });\n  const span = (Math.max(...levels) - minLevel) * (m.nodeWidth + m.columnGap) + m.nodeWidth;\n  return {\n    width: room.left + 2 * inset + span + room.right,\n    height: tallest + 2 * m.padding,\n    positions: Object.fromEntries([...placed].map(([id, { x, y }]) => [id, { x: x + room.left, y }])),\n    groups: [...boxes.values()]\n      .flat()\n      .map((box) => ({ ...box, x: box.x + room.left }))\n      .sort((a, b) => a.level - b.level || a.y - b.y),\n  };\n}\n"],"names":["loopOverhang"],"mappings":";;;AAgBO,MAAM,sBAAsB;AAEnC,MAAM,6BAA6B;AAuGnC,MAAM,qBAAqB;AAC3B,MAAM,sBAAsB;AAC5B,MAAM,qBAAqB;AAC3B,MAAM,kBAAkB;AACxB,MAAM,wBAAwB;AAC9B,MAAM,8BAA8B;AACpC,MAAM,0BAA0B;AAChC,MAAM,gCAAgC;AACtC,MAAM,kBAAkB;AACxB,MAAM,iBAAiB;AAEvB,SAAS,QAAc,KAAwB,KAAQ,MAAiB;AACtE,QAAM,QAAQ,IAAI,IAAI,GAAG;AACzB,MAAI,UAAU,QAAW;AACvB,UAAM,IAAI,MAAM,qBAAqB,IAAI,SAAS,OAAO,GAAG,CAAC,GAAG;AAAA,EAClE;AACA,SAAO;AACT;AAEA,SAAS,cAAc,SAA8C;AACnE,SAAO;AAAA,IACL,SAAS,QAAQ,WAAW,CAAA;AAAA,IAC5B,WAAW,QAAQ,aAAa,CAAA;AAAA,IAChC,oBAAoB,QAAQ,sBAAsB;AAAA,IAClD,WAAW,QAAQ,aAAa;AAAA,IAChC,YAAY,QAAQ,cAAc;AAAA,IAClC,WAAW,QAAQ,aAAa;AAAA,IAChC,QAAQ,QAAQ,UAAU;AAAA,IAC1B,cAAc,QAAQ,gBAAgB;AAAA,IACtC,mBAAmB,QAAQ,qBAAqB;AAAA,IAChD,eAAe,QAAQ,iBAAiB;AAAA,IACxC,qBAAqB,QAAQ,uBAAuB;AAAA,IACpD,SAAS,QAAQ,WAAW;AAAA,IAC5B,QAAQ,QAAQ,UAAU;AAAA,EAAA;AAE9B;AAEA,SAAS,aAAa,OAAqC;AACzD,QAAM,8BAAc,IAAA;AACpB,QAAM,gCAAgB,IAAA;AACtB,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,OAAO,SAAS,KAAK,KAAK,GAAG;AAChC,YAAM,IAAI,MAAM,wBAAwB,KAAK,EAAE,8BAA8B,KAAK,KAAK,GAAG;AAAA,IAC5F;AACA,QAAI,CAAC,UAAU,IAAI,KAAK,KAAK,EAAG,WAAU,IAAI,KAAK,OAAO,UAAU,IAAI;AACxE,UAAM,SAAS,QAAQ,IAAI,KAAK,KAAK;AACrC,QAAI,QAAQ;AACV,aAAO,KAAK,IAAI;AAAA,IAClB,OAAO;AACL,cAAQ,IAAI,KAAK,OAAO,CAAC,IAAI,CAAC;AAAA,IAChC;AAAA,EACF;AACA,SAAO,EAAE,SAAS,UAAA;AACpB;AAEA,SAAS,gBACP,OACA,OACuB;AACvB,QAAM,aAAa,IAAI,IAAsB,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,CAAA,CAAE,CAAC,CAAC;AAC/E,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,WAAW,IAAI,KAAK,IAAI;AACrC,UAAM,KAAK,WAAW,IAAI,KAAK,EAAE;AACjC,QAAI,CAAC,QAAQ,CAAC,IAAI;AAChB,YAAM,UAAU,OAAO,KAAK,KAAK,KAAK;AACtC,YAAM,IAAI,MAAM,wBAAwB,KAAK,EAAE,8BAA8B,OAAO,GAAG;AAAA,IACzF;AACA,SAAK,KAAK,KAAK,EAAE;AACjB,OAAG,KAAK,KAAK,IAAI;AAAA,EACnB;AACA,SAAO;AACT;AAcA,SAAS,aAAa,OAAe,OAAqC,GAA8B;AACtG,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,MAAM,mCAAmC,KAAK,WAAW,MAAM,MAAM,2CAA2C;AAClJ,SAAO,EAAE,KAAK,GAAG,KAAK,GAAG,UAAU,MAAM,EAAE,oBAAoB,QAAQ,GAAG,QAAQ,EAAE,oBAAoB,WAAW,KAAA;AACrH;AAQA,SAAS,WAAW,OAA2B,OAAqC,GAAkB,QAA6B;AACjI,MAAI,UAAU,UAAa,EAAE,UAAU,SAAS,KAAK,EAAG,QAAO,aAAa,OAAO,OAAO,CAAC;AAC3F,MAAI;AACJ,MAAI,QAAQ;AACV,UAAM,UAAU,MAAM,KAAK,CAAC,SAAS,CAAC,KAAK,OAAO;AAClD,QAAI,eAAe,IAAI,MAAM,gCAAgC,KAAK,6BAA6B,QAAQ,EAAE,GAAG;AAC5G,YAAQ,EAAE,KAAK,GAAG,KAAK,GAAG,UAAU,MAAM,EAAE,mBAAmB,QAAQ,EAAE,mBAAA;AAAA,EAC3E,OAAO;AACL,UAAM,UAAU,UAAU,UAAa,MAAM,MAAM,CAAC,SAAS,KAAK,YAAY,IAAI;AAClF,UAAM,WAAW,CAAC,SAA6B,KAAK,UAAU,EAAE,oBAAoB,EAAE;AACtF,YAAQ,EAAE,KAAK,UAAU,SAAY,IAAI,UAAU,EAAE,sBAAsB,EAAE,cAAc,KAAK,UAAU,EAAE,gBAAgB,EAAE,QAAQ,UAAU,QAAQ,EAAA;AAAA,EAC1J;AACA,QAAM,SAAS,MAAM,SAAS,IAAI,MAAM;AACxC,MAAI,UAAU,UAAa,MAAM,UAAU,qBAAqB;AAC9D,UAAM,UAAU,MAAM,OAAO,CAAC,KAAK,SAAS,MAAM,MAAM,SAAS,IAAI,GAAG,CAAC,KAAK,MAAM,SAAS,KAAK,MAAM;AACxG,WAAO,EAAE,GAAG,OAAO,QAAQ,SAAS,SAAS,WAAW,MAAA;AAAA,EAC1D;AACA,QAAM,OAAO,sBAAsB,KAAK,IAAI,GAAG,MAAM,IAAI,MAAM,QAAQ,CAAC,KAAK,sBAAsB,KAAK,MAAM;AAC9G,SAAO,EAAE,GAAG,OAAO,MAAM,QAAQ,SAAS,OAAO,4BAA4B,WAAW,MAAA;AAC1F;AAEA,SAAS,aAAa,QAAsC,GAA0B;AACpF,QAAM,2BAAW,IAAA;AACjB,aAAW,QAAQ,OAAQ,MAAK,IAAI,KAAK,OAAO,CAAC,GAAI,KAAK,IAAI,KAAK,KAAK,KAAK,CAAA,GAAK,IAAI,CAAC;AACvF,QAAM,UAAU,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,OAAO,KAAK,MAAM,MAAM,WAAW,OAAO,OAAO,GAAG,UAAU,UAAa,EAAE,QAAQ,SAAS,KAAK,CAAC,EAAE,QAAQ,CAAC;AACvJ,SAAO,WAAW,KAAK,OAAO,KAAK,EAAE;AACvC;AAGA,SAAS,YACP,QACA,WACA,QACY;AACZ,QAAM,2BAAW,IAAA;AACjB,SAAO,QAAQ,CAAC,MAAM,UAAU;AAC9B,UAAM,OAAO,QAAQ,WAAW,KAAK,OAAO,YAAY;AACxD,UAAM,QAAQ,EAAE,MAAM,OAAO,QAAQ,OAAO,IAAI,EAAA;AAChD,UAAM,MAAM,KAAK,IAAI,IAAI;AACzB,QAAI,KAAK;AACP,UAAI,KAAK,KAAK;AAAA,IAChB,OAAO;AACL,WAAK,IAAI,MAAM,CAAC,KAAK,CAAC;AAAA,IACxB;AAAA,EACF,CAAC;AACD,SAAO,CAAC,GAAG,KAAK,QAAA,CAAS,EACtB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,EACxB,IAAI,CAAC,CAAA,EAAG,GAAG,MAAM;;AAEhB,UAAM,QAAQ,IAAI,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI;AACpG,WAAO,EAAE,QAAO,WAAM,CAAC,MAAP,mBAAU,OAAO,MAAA;AAAA,EACnC,CAAC;AACL;AAEA,SAAS,YACP,MACA,QACA,GACA,QACuB;AACvB,QAAM,QAA+B,CAAA;AACrC,MAAI,SAAS,OAAO;AACpB,aAAW,EAAE,OAAO,MAAA,KAAW,MAAM;AACnC,UAAM,SAAS,UAAU,UAAa,EAAE,QAAQ,SAAS,KAAK;AAC9D,UAAM,MAAM,WAAW,OAAO,OAAO,GAAG,MAAM;AAC9C,UAAM,QAAQ,SAAS,IAAI,MAAM,IAAI;AACrC,UAAM,OAAiB,CAAA;AACvB,QAAI,MAAM;AACV,eAAW,QAAQ,OAAO;AACxB,WAAK,KAAK,MAAM,KAAK;AACrB,aAAO,IAAI,KAAK,IAAI,EAAE,GAAG,OAAO,GAAG,GAAG,MAAM,IAAI,SAAS,IAAI,IAAI,GAAG;AACpE,aAAO,IAAI,SAAS,IAAI,IAAI,IAAI;AAAA,IAClC;AACA,QAAI,UAAU,QAAW;AACvB,YAAM,eAA8C,IAAI,SAAS,SAAY,SACzE,EAAE,SAAS,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE,GAAG,MAAM,MAAM,qBAAqB,KAAK,OAAO,QAAQ,IAAI,MAAM,cAAc,2BAAA;AAC1H,YAAM,KAAK;AAAA,QACT,IAAI,GAAG,OAAO,KAAK,IAAI,KAAK;AAAA,QAC5B;AAAA,QACA,OAAO,OAAO;AAAA,QACd,GAAG,OAAO,IAAI,EAAE,YAAY,IAAI,IAAI;AAAA,QACpC,GAAG;AAAA,QACH,OAAO,EAAE,YAAY,IAAI,IAAI;AAAA,QAC7B,QAAQ,IAAI;AAAA,QACZ;AAAA,QACA,cAAc,IAAI,YAAY,EAAE,qBAAqB,IAAI;AAAA,QACzD,GAAI,eAAe,EAAE,QAAQ,aAAA,IAAiB,CAAA;AAAA,QAC9C,GAAI,IAAI,YAAY,EAAE,WAAW,KAAA,IAAkB,CAAA;AAAA,MAAC,CACrD;AAAA,IACH;AACA,cAAU,IAAI,SAAS,EAAE;AAAA,EAC3B;AACA,SAAO;AACT;AAEA,SAAS,MAAM,KAAwB,QAA0D;AAC/F,MAAI,IAAI,WAAW,EAAG,QAAO,OAAO;AACpC,SAAO,IAAI,OAAO,CAAC,KAAK,OAAO,MAAM,QAAQ,QAAQ,IAAI,UAAU,EAAE,GAAG,CAAC,IAAI,IAAI;AACnF;AAOA,SAAS,eAAe,QAA6E;AACnG,QAAM,SAAS,OAAO,OAAO,CAAC,MAAM,UAAW,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,IAAI,QAAQ,IAAK;AAC/F,QAAM,UAAU,CAAC,SACf,KAAK,IAAI,CAAC,OAAO,UAA4B,CAAC,OAAO,KAAK,QAAQ,CAAC,KAAK,MAAM,CAAC;AACjF,SAAO;AAAA,IACL,CAAC,QAAQ,MAAS;AAAA,IAClB,GAAG,QAAQ,OAAO,OAAO,CAAC,UAAU,QAAQ,MAAM,CAAC;AAAA,IACnD,GAAG,QAAQ,OAAO,OAAO,CAAC,UAAU,QAAQ,MAAM,EAAE,QAAA,CAAS;AAAA,EAAA;AAEjE;AAGA,SAAS,YAAY,OAAe,YAA+B,KAAqB,MAAyB;AAC/G,QAAM,OAAO;AAAA,IAAY,QAAQ,KAAK,OAAO,OAAO,QAAQ;AAAA,IAAG,IAAI;AAAA,IAAW,CAAC,SAC7E;AAAA,MACE,QAAQ,IAAI,YAAY,KAAK,IAAI,YAAY,EAAE;AAAA,QAAO,CAAC,OACrD,WAAW,SAAS,QAAQ,IAAI,SAAS,IAAI,OAAO,CAAC;AAAA,MAAA;AAAA,MAEvD,KAAK;AAAA,IAAA;AAAA,EACP;AAEF,OAAK,MAAM;AAAA,IACT;AAAA,IACA,KAAK,QAAQ,CAAC,QAAQ,IAAI,KAAK;AAAA,EAAA;AAEjC,OAAK,MAAM,IAAI,OAAO,YAAY,MAAM,IAAI,OAAO,KAAK,GAAG,IAAI,GAAG,KAAK,MAAM,CAAC;AAChF;AAGA,SAAS,eAAe,KAAqB,QAA0D;AACrG,QAAM,4BAAY,IAAA;AAClB,aAAW,QAAQ,IAAI,OAAO;AAC5B,UAAM,SAAS,CAAC,QAAQ,IAAI,SAAS,KAAK,MAAM,OAAO,GAAG,QAAQ,IAAI,SAAS,KAAK,IAAI,OAAO,CAAC;AAChG,UAAM,CAAC,OAAO,KAAK,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,MAAM,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI;AACzF,UAAM,QAAQ,IAAI,OAAO,QAAQ,KAAK,IAAI,GAAG,MAAM,CAAC;AACpD,QAAI,OAAO,CAAC,MAAM,OAAO,CAAC,KAAK,IAAI,OAAO,QAAQ,CAAC,MAAM,KAAK,IAAI,GAAG,MAAM,EAAG;AAC9E,UAAM,OAAyB,CAAC,QAAQ,QAAQ,OAAO,UAAU,EAAE,GAAG,QAAQ,QAAQ,OAAO,UAAU,EAAE,CAAC;AAC1G,UAAM,IAAI,OAAO,CAAC,GAAI,MAAM,IAAI,KAAK,KAAK,IAAK,IAAI,CAAC;AAAA,EACtD;AACA,MAAI,YAAY;AAChB,aAAW,OAAO,MAAM,UAAU;AAChC,QAAI,QAAQ,CAAC,GAAG,UAAU;AACxB,mBAAa,IAAI,MAAM,QAAQ,CAAC,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;AAAA,IACrF,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAGA,SAAS,MAAM,MAAmB,UAA6B,KAAkC;AAC/F,QAAM,OAAoB,EAAE,OAAO,IAAI,IAAI,KAAK,KAAK,GAAG,QAAQ,IAAI,IAAI,KAAK,MAAM,GAAG,OAAO,IAAI,IAAI,KAAK,KAAK,EAAA;AAC/G,aAAW,SAAS,UAAU;AAC5B,UAAM,QAAQ,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,WAAW,CAAC,IAAI,OAAO,QAAQ,CAAC,GAAG,IAAI,OAAO,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,UAA2B,UAAU,MAAS;AACtH,gBAAY,OAAO,UAAU,KAAK,IAAI;AAAA,EACxC;AACA,SAAO;AACT;AASA,SAAS,QAAQ,SAAmD,KAAkC;AACpG,MAAI,UAAuB,EAAE,OAAO,IAAI,IAAI,OAAO,GAAG,QAAQ,oBAAI,IAAA,GAAO,OAAO,oBAAI,MAAI;AACxF,aAAW,CAAC,OAAO,SAAS,KAAK,eAAe,IAAI,MAAM,GAAG;AAC3D,gBAAY,OAAO,cAAc,SAAY,CAAA,IAAK,CAAC,SAAS,GAAG,KAAK,OAAO;AAAA,EAC7E;AACA,MAAI,OAAO;AACX,MAAI,SAAS,eAAe,KAAK,KAAK,MAAM;AAC5C,WAAS,OAAO,GAAG,OAAO,IAAI,EAAE,UAAU,SAAS,GAAG,QAAQ;AAC5D,cAAU,MAAM,SAAS,OAAO,MAAM,IAAI,CAAC,GAAG,IAAI,MAAM,EAAE,QAAA,IAAY,IAAI,QAAQ,GAAG;AACrF,UAAM,YAAY,eAAe,KAAK,QAAQ,MAAM;AACpD,QAAI,YAAY,QAAQ;AACtB,aAAO;AACP,eAAS;AAAA,IACX;AAAA,EACF;AACA,SAAO;AACT;AAgBO,SAAS,cACd,OACA,OACA,UAAgC,CAAA,GACX;AACrB,QAAM,IAAI,cAAc,OAAO;AAC/B,QAAM,EAAE,SAAS,cAAc,aAAa,KAAK;AACjD,QAAM,aAAa,gBAAgB,OAAO,KAAK;AAC/C,QAAM,SAAS,CAAC,GAAG,QAAQ,KAAA,CAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACvD,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,OAAO,IAAI,EAAE,SAAS,QAAQ,IAAI,EAAE,SAAS,WAAW,CAAA,GAAI,QAAQ,CAAA,EAAC;AAAA,EAChF;AAEA,QAAM,WAAW,KAAK,IAAI,GAAG,MAAM;AACnC,QAAM,UAAU,KAAK,IAAI,GAAG,CAAC,GAAG,QAAQ,OAAA,CAAQ,EAAE,IAAI,CAAC,WAAW,aAAa,QAAQ,CAAC,CAAC,CAAC;AAC1F,QAAM,QAAQ,EAAE,WAAW,MAAM,KAAK,CAAC,SAAS,KAAK,UAAU,MAAS,IAAI,EAAE,eAAe;AAC7F,QAAM,EAAE,QAAQ,UAAU,QAAQ,SAAS;AAAA,IACzC;AAAA,IACA;AAAA,IACA,SAAS,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC;AAAA,IAC3D;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,CAAC,WAAW;AAAA,MAClB,GAAG,QAAQ,EAAE,YAAY,KAAK,QAAQ,aAAa,EAAE,YAAY,EAAE;AAAA,MACnE,KAAK,EAAE,WAAW,UAAU,aAAa,QAAQ,SAAS,OAAO,QAAQ,GAAG,CAAC,KAAK;AAAA,MAClF;AAAA,IAAA;AAAA,EACF,CACD;AAED,QAAM,cAAc,OAAO,YAAY,MAAM,OAAO,CAAC,SAAS,KAAK,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,EAAE,iBAAiB,CAAC,CAAC;AACzH,QAAM,OAAOA,iBAAAA,aAAa,OAAO,OAAO,YAAY,MAAM,GAAG,EAAE,GAAG,GAAG,aAAa;AAClF,QAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,IAAI,aAAa,EAAE,YAAY,EAAE,aAAa,EAAE;AAChF,SAAO;AAAA,IACL,OAAO,KAAK,OAAO,IAAI,QAAQ,OAAO,KAAK;AAAA,IAC3C,QAAQ,UAAU,IAAI,EAAE;AAAA,IACxB,WAAW,OAAO,YAAY,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,KAAK,MAAM,EAAA,CAAG,CAAC,CAAC;AAAA,IAChG,QAAQ,CAAC,GAAG,MAAM,QAAQ,EACvB,KAAA,EACA,IAAI,CAAC,SAAS,EAAE,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK,KAAA,EAAO,EAC/C,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AAAA,EAAA;AAEpD;;;"}

package/dist/data/graph-columns-layout.d.ts

@@ -4,8 +4,21 @@ export interface ColumnsLayoutNode extends GraphLayoutNode {
     level: number;
     /** Nodes sharing a group stay contiguous within their column and are boxed together. */
     group?: string;
+    /** Drawn at `compactNodeHeight`; a group of only compact nodes stacks them at the compact gap and padding. */
+    compact?: boolean;
 }
+/** The most members a group shows at once in a column; a group with more scrolls them in a window this many rows tall. */
+export declare const GROUP_MEMBER_WINDOW = 10;
 export interface ColumnsLayoutOptions {
+    /** Group ids drawn as records with a header and flush compact rows. */
+    records?: readonly string[];
+    /**
+     * Group ids drawn as their header alone, `recordHeaderHeight` tall. Each holds one node per column it
+     * is drawn in, the stand-in its edges attach to, placed at the header's middle.
+     */
+    collapsed?: readonly string[];
+    /** Height of a record's header in px. Defaults to 24. */
+    recordHeaderHeight?: number;
     /** Node bounding-box width in px. Defaults to 168. */
     nodeWidth?: number;
     /** Node bounding-box height in px. Defaults to 60. */
@@ -16,6 +29,12 @@ export interface ColumnsLayoutOptions {
     rowGap?: number;
     /** Space between a group's nodes and its rectangle in px. Defaults to 12. */
     groupPadding?: number;
+    /** Height of a compact node in px. Defaults to 24. */
+    compactNodeHeight?: number;
+    /** Vertical gap between the nodes of a group of only compact nodes in px. Defaults to 4. */
+    compactRowGap?: number;
+    /** Space between a group of only compact nodes and its rectangle in px. Defaults to 8. */
+    compactGroupPadding?: number;
     /** Space reserved around the columns before the viewport edge. Defaults to 24. */
     padding?: number;
     /**
@@ -34,6 +53,29 @@ export interface GraphLayoutGroupBox {
     y: number;
     width: number;
     height: number;
+    record: boolean;
+    headerHeight: number;
+    /** Set when the group holds more members in this column than `GROUP_MEMBER_WINDOW`: they scroll in a window. */
+    window?: GroupMemberWindow;
+    /** Drawn as its header alone: see `ColumnsLayoutOptions.collapsed`. */
+    collapsed?: true;
+}
+/**
+ * The rows a group with more members than `GROUP_MEMBER_WINDOW` shows at once. The layout places every
+ * member as if the group were drawn whole; a member shown from row `start` is drawn `tops[start]` higher.
+ */
+export interface GroupMemberWindow {
+    /** The members in this column, top to bottom. */
+    members: string[];
+    /** Each member's top, from the first member's top. */
+    tops: number[];
+    /** How many rows show at once. */
+    rows: number;
+    /** Top of the area members are drawn in, and its height. */
+    top: number;
+    height: number;
+    /** Height of the footer below that area, inside the group's rectangle. */
+    footerHeight: number;
 }
 export interface ColumnsLayoutResult extends GraphLayoutResult {
     groups: GraphLayoutGroupBox[];

package/dist/data/graph-columns-layout.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph-columns-layout.d.ts","sourceRoot":"","sources":["../../src/data/graph-columns-layout.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,eAAe,EAAE,eAAe,EAAuB,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAE/G,MAAM,WAAW,iBAAkB,SAAQ,eAAe;IACxD,iFAAiF;IACjF,KAAK,EAAE,MAAM,CAAC;IACd,wFAAwF;IACxF,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,oBAAoB;IACnC,sDAAsD;IACtD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sDAAsD;IACtD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,uFAAuF;IACvF,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,+FAA+F;IAC/F,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,6EAA6E;IAC7E,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,kFAAkF;IAClF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,mBAAmB;IAClC,4FAA4F;IAC5F,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,sFAAsF;IACtF,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,mBAAoB,SAAQ,iBAAiB;IAC5D,MAAM,EAAE,mBAAmB,EAAE,CAAC;CAC/B;AAyPD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,iBAAiB,EAAE,EACnC,KAAK,EAAE,SAAS,eAAe,EAAE,EACjC,OAAO,GAAE,oBAAyB,GACjC,mBAAmB,CAqCrB"}
+{"version":3,"file":"graph-columns-layout.d.ts","sourceRoot":"","sources":["../../src/data/graph-columns-layout.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,eAAe,EAAE,eAAe,EAAuB,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AAE/G,MAAM,WAAW,iBAAkB,SAAQ,eAAe;IACxD,iFAAiF;IACjF,KAAK,EAAE,MAAM,CAAC;IACd,wFAAwF;IACxF,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,8GAA8G;IAC9G,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,0HAA0H;AAC1H,eAAO,MAAM,mBAAmB,KAAK,CAAC;AAItC,MAAM,WAAW,oBAAoB;IACnC,uEAAuE;IACvE,OAAO,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC5B;;;OAGG;IACH,SAAS,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAC9B,yDAAyD;IACzD,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,sDAAsD;IACtD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sDAAsD;IACtD,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,uFAAuF;IACvF,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,+FAA+F;IAC/F,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,6EAA6E;IAC7E,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,sDAAsD;IACtD,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,4FAA4F;IAC5F,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,0FAA0F;IAC1F,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,kFAAkF;IAClF,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,mBAAmB;IAClC,4FAA4F;IAC5F,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,sFAAsF;IACtF,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,OAAO,CAAC;IAChB,YAAY,EAAE,MAAM,CAAC;IACrB,gHAAgH;IAChH,MAAM,CAAC,EAAE,iBAAiB,CAAC;IAC3B,uEAAuE;IACvE,SAAS,CAAC,EAAE,IAAI,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC,iDAAiD;IACjD,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,sDAAsD;IACtD,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,kCAAkC;IAClC,IAAI,EAAE,MAAM,CAAC;IACb,4DAA4D;IAC5D,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,0EAA0E;IAC1E,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,mBAAoB,SAAQ,iBAAiB;IAC5D,MAAM,EAAE,mBAAmB,EAAE,CAAC;CAC/B;AAyTD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,aAAa,CAC3B,KAAK,EAAE,SAAS,iBAAiB,EAAE,EACnC,KAAK,EAAE,SAAS,eAAe,EAAE,EACjC,OAAO,GAAE,oBAAyB,GACjC,mBAAmB,CAsCrB"}

package/dist/data/graph-columns-layout.js

@@ -1,9 +1,14 @@
 import { loopOverhang } from "./graph-edge-routing.js";
+const GROUP_MEMBER_WINDOW = 10;
+const GROUP_WINDOW_FOOTER_HEIGHT = 18;
 const DEFAULT_NODE_WIDTH = 168;
 const DEFAULT_NODE_HEIGHT = 60;
 const DEFAULT_COLUMN_GAP = 96;
 const DEFAULT_ROW_GAP = 20;
 const DEFAULT_GROUP_PADDING = 12;
+const DEFAULT_COMPACT_NODE_HEIGHT = 24;
+const DEFAULT_COMPACT_ROW_GAP = 4;
+const DEFAULT_COMPACT_GROUP_PADDING = 8;
 const DEFAULT_PADDING = 24;
 const DEFAULT_SWEEPS = 4;
 function mustGet(map, key, what) {
@@ -15,11 +20,17 @@ function mustGet(map, key, what) {
 }
 function columnMetrics(options) {
   return {
+    records: options.records ?? [],
+    collapsed: options.collapsed ?? [],
+    recordHeaderHeight: options.recordHeaderHeight ?? 24,
     nodeWidth: options.nodeWidth ?? DEFAULT_NODE_WIDTH,
     nodeHeight: options.nodeHeight ?? DEFAULT_NODE_HEIGHT,
     columnGap: options.columnGap ?? DEFAULT_COLUMN_GAP,
     rowGap: options.rowGap ?? DEFAULT_ROW_GAP,
     groupPadding: options.groupPadding ?? DEFAULT_GROUP_PADDING,
+    compactNodeHeight: options.compactNodeHeight ?? DEFAULT_COMPACT_NODE_HEIGHT,
+    compactRowGap: options.compactRowGap ?? DEFAULT_COMPACT_ROW_GAP,
+    compactGroupPadding: options.compactGroupPadding ?? DEFAULT_COMPACT_GROUP_PADDING,
     padding: options.padding ?? DEFAULT_PADDING,
     sweeps: options.sweeps ?? DEFAULT_SWEEPS
   };
@@ -55,10 +66,35 @@ function indexNeighbours(nodes, edges) {
   }
   return neighbours;
 }
+function collapsedRun(group, nodes, m) {
+  if (nodes.length !== 1) throw new Error(`columnsLayout: collapsed group "${group}" holds ${nodes.length} nodes in a column; it draws one stand-in`);
+  return { pad: 0, gap: 0, heightOf: () => m.recordHeaderHeight, header: 0, height: m.recordHeaderHeight, collapsed: true };
+}
+function runMetrics(group, nodes, m, record) {
+  if (group !== void 0 && m.collapsed.includes(group)) return collapsedRun(group, nodes, m);
+  let stack;
+  if (record) {
+    const regular = nodes.find((node) => !node.compact);
+    if (regular) throw new Error(`columnsLayout: record group "${group}" holds non-compact node "${regular.id}"`);
+    stack = { pad: 0, gap: 0, heightOf: () => m.compactNodeHeight, header: m.recordHeaderHeight };
+  } else {
+    const compact = group !== void 0 && nodes.every((node) => node.compact === true);
+    const heightOf = (node) => node.compact ? m.compactNodeHeight : m.nodeHeight;
+    stack = { pad: group === void 0 ? 0 : compact ? m.compactGroupPadding : m.groupPadding, gap: compact ? m.compactRowGap : m.rowGap, heightOf, header: 0 };
+  }
+  const chrome = stack.header + 2 * stack.pad;
+  if (group === void 0 || nodes.length <= GROUP_MEMBER_WINDOW) {
+    const stacked = nodes.reduce((sum, node) => sum + stack.heightOf(node), 0) + (nodes.length - 1) * stack.gap;
+    return { ...stack, height: chrome + stacked, collapsed: false };
+  }
+  const view = GROUP_MEMBER_WINDOW * Math.max(...nodes.map(stack.heightOf)) + (GROUP_MEMBER_WINDOW - 1) * stack.gap;
+  return { ...stack, view, height: chrome + view + GROUP_WINDOW_FOOTER_HEIGHT, collapsed: false };
+}
 function columnHeight(column, m) {
-  const groups = new Set(column.map((node) => node.group));
-  groups.delete(void 0);
-  return column.length * m.nodeHeight + (column.length - 1) * m.rowGap + 2 * m.groupPadding * groups.size;
+  const runs = /* @__PURE__ */ new Map();
+  for (const node of column) runs.set(node.group, [...runs.get(node.group) ?? [], node]);
+  const stacked = [...runs].reduce((sum, [group, nodes]) => sum + runMetrics(group, nodes, m, group !== void 0 && m.records.includes(group)).height, 0);
+  return stacked + (runs.size - 1) * m.rowGap;
 }
 function orderColumn(column, groupRank, weight) {
   const runs = /* @__PURE__ */ new Map();
@@ -82,24 +118,33 @@ function stackColumn(runs, origin, m, placed) {
   const boxes = [];
   let cursor = origin.top;
   for (const { group, nodes } of runs) {
-    const pad = group === void 0 ? 0 : m.groupPadding;
-    const height = nodes.length * m.nodeHeight + (nodes.length - 1) * m.rowGap + 2 * pad;
-    nodes.forEach((node, index) => {
-      const top = cursor + pad + index * (m.nodeHeight + m.rowGap);
-      placed.set(node.id, { x: origin.x, y: top + m.nodeHeight / 2 });
-    });
+    const record = group !== void 0 && m.records.includes(group);
+    const run = runMetrics(group, nodes, m, record);
+    const first = cursor + run.pad + run.header;
+    const tops = [];
+    let top = first;
+    for (const node of nodes) {
+      tops.push(top - first);
+      placed.set(node.id, { x: origin.x, y: top + run.heightOf(node) / 2 });
+      top += run.heightOf(node) + run.gap;
+    }
     if (group !== void 0) {
+      const memberWindow = run.view === void 0 ? void 0 : { members: nodes.map((node) => node.id), tops, rows: GROUP_MEMBER_WINDOW, top: first, height: run.view, footerHeight: GROUP_WINDOW_FOOTER_HEIGHT };
       boxes.push({
         id: `${origin.level}:${group}`,
         group,
         level: origin.level,
-        x: origin.x - m.nodeWidth / 2 - pad,
+        x: origin.x - m.nodeWidth / 2 - run.pad,
         y: cursor,
-        width: m.nodeWidth + 2 * pad,
-        height
+        width: m.nodeWidth + 2 * run.pad,
+        height: run.height,
+        record,
+        headerHeight: run.collapsed ? m.recordHeaderHeight : run.header,
+        ...memberWindow ? { window: memberWindow } : {},
+        ...run.collapsed ? { collapsed: true } : {}
       });
     }
-    cursor += height + m.rowGap;
+    cursor += run.height + m.rowGap;
   }
   return boxes;
 }
@@ -201,7 +246,8 @@ function columnsLayout(nodes, edges, options = {}) {
       level
     })
   });
-  const room = loopOverhang(edges, Object.fromEntries(placed), m);
+  const nodeHeights = Object.fromEntries(nodes.filter((node) => node.compact).map((node) => [node.id, m.compactNodeHeight]));
+  const room = loopOverhang(edges, Object.fromEntries(placed), { ...m, nodeHeights });
   const span = (Math.max(...levels) - minLevel) * (m.nodeWidth + m.columnGap) + m.nodeWidth;
   return {
     width: room.left + 2 * inset + span + room.right,
@@ -211,6 +257,7 @@ function columnsLayout(nodes, edges, options = {}) {
   };
 }
 export {
+  GROUP_MEMBER_WINDOW,
   columnsLayout
 };
 //# sourceMappingURL=graph-columns-layout.js.map

package/dist/data/graph-columns-layout.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph-columns-layout.js","sources":["../../src/data/graph-columns-layout.ts"],"sourcesContent":["// Level-column layout for GraphDiagram: pure math, no React. Split from\n// graph-layout.ts, which owns the shared types and `ringLayout`.\n\nimport { loopOverhang } from \"./graph-edge-routing\";\nimport type { GraphLayoutEdge, GraphLayoutNode, GraphLayoutPosition, GraphLayoutResult } from \"./graph-layout\";\n\nexport interface ColumnsLayoutNode extends GraphLayoutNode {\n  /** Column of the node. May be negative: the lowest level is the first column. */\n  level: number;\n  /** Nodes sharing a group stay contiguous within their column and are boxed together. */\n  group?: string;\n}\n\nexport interface ColumnsLayoutOptions {\n  /** Node bounding-box width in px. Defaults to 168. */\n  nodeWidth?: number;\n  /** Node bounding-box height in px. Defaults to 60. */\n  nodeHeight?: number;\n  /** Horizontal gap between the node boxes of adjacent columns in px. Defaults to 96. */\n  columnGap?: number;\n  /** Vertical gap between stacked nodes, and between group rectangles, in px. Defaults to 20. */\n  rowGap?: number;\n  /** Space between a group's nodes and its rectangle in px. Defaults to 12. */\n  groupPadding?: number;\n  /** Space reserved around the columns before the viewport edge. Defaults to 24. */\n  padding?: number;\n  /**\n   * Re-ordering passes over all columns after the first placement, alternating direction; a pass\n   * is kept only if it leaves fewer crossings. Defaults to 4. 0 keeps the first placement.\n   */\n  sweeps?: number;\n}\n\nexport interface GraphLayoutGroupBox {\n  /** `${level}:${group}` — a group spanning several columns gets one rectangle per column. */\n  id: string;\n  group: string;\n  level: number;\n  /** Top-left corner, in the same coordinate space as the layout's `width`/`height`. */\n  x: number;\n  y: number;\n  width: number;\n  height: number;\n}\n\nexport interface ColumnsLayoutResult extends GraphLayoutResult {\n  groups: GraphLayoutGroupBox[];\n}\n\ntype ColumnMetrics = Required<ColumnsLayoutOptions>;\n\ninterface GroupRun {\n  group: string | undefined;\n  nodes: ColumnsLayoutNode[];\n}\n\n/** One ordering of every column, stacked: the node centres and group rectangles it gives. */\ninterface Arrangement {\n  order: Map<number, ColumnsLayoutNode[]>;\n  placed: Map<string, GraphLayoutPosition>;\n  boxes: Map<number, GraphLayoutGroupBox[]>;\n}\n\n/** What stays fixed while columns are re-ordered. */\ninterface ColumnsContext {\n  m: ColumnMetrics;\n  levels: number[];\n  levelOf: Map<string, number>;\n  groupRank: Map<string | undefined, number>;\n  neighbours: Map<string, string[]>;\n  edges: readonly GraphLayoutEdge[];\n  /** Centre x and top y of a level's column. */\n  origin: (level: number) => { x: number; top: number; level: number };\n}\n\nconst DEFAULT_NODE_WIDTH = 168;\nconst DEFAULT_NODE_HEIGHT = 60;\nconst DEFAULT_COLUMN_GAP = 96;\nconst DEFAULT_ROW_GAP = 20;\nconst DEFAULT_GROUP_PADDING = 12;\nconst DEFAULT_PADDING = 24;\nconst DEFAULT_SWEEPS = 4;\n\nfunction mustGet<K, V>(map: ReadonlyMap<K, V>, key: K, what: string): V {\n  const value = map.get(key);\n  if (value === undefined) {\n    throw new Error(`columnsLayout: no ${what} for \"${String(key)}\"`);\n  }\n  return value;\n}\n\nfunction columnMetrics(options: ColumnsLayoutOptions): ColumnMetrics {\n  return {\n    nodeWidth: options.nodeWidth ?? DEFAULT_NODE_WIDTH,\n    nodeHeight: options.nodeHeight ?? DEFAULT_NODE_HEIGHT,\n    columnGap: options.columnGap ?? DEFAULT_COLUMN_GAP,\n    rowGap: options.rowGap ?? DEFAULT_ROW_GAP,\n    groupPadding: options.groupPadding ?? DEFAULT_GROUP_PADDING,\n    padding: options.padding ?? DEFAULT_PADDING,\n    sweeps: options.sweeps ?? DEFAULT_SWEEPS,\n  };\n}\n\nfunction indexColumns(nodes: readonly ColumnsLayoutNode[]) {\n  const columns = new Map<number, ColumnsLayoutNode[]>();\n  const groupRank = new Map<string | undefined, number>();\n  for (const node of nodes) {\n    if (!Number.isFinite(node.level)) {\n      throw new Error(`columnsLayout: node \"${node.id}\" has no finite level (got ${node.level})`);\n    }\n    if (!groupRank.has(node.group)) groupRank.set(node.group, groupRank.size);\n    const column = columns.get(node.level);\n    if (column) {\n      column.push(node);\n    } else {\n      columns.set(node.level, [node]);\n    }\n  }\n  return { columns, groupRank };\n}\n\nfunction indexNeighbours(\n  nodes: readonly ColumnsLayoutNode[],\n  edges: readonly GraphLayoutEdge[],\n): Map<string, string[]> {\n  const neighbours = new Map<string, string[]>(nodes.map((node) => [node.id, []]));\n  for (const edge of edges) {\n    const from = neighbours.get(edge.from);\n    const to = neighbours.get(edge.to);\n    if (!from || !to) {\n      const missing = from ? edge.to : edge.from;\n      throw new Error(`columnsLayout: edge \"${edge.id}\" references unknown node \"${missing}\"`);\n    }\n    from.push(edge.to);\n    to.push(edge.from);\n  }\n  return neighbours;\n}\n\nfunction columnHeight(column: readonly ColumnsLayoutNode[], m: ColumnMetrics): number {\n  const groups = new Set(column.map((node) => node.group));\n  groups.delete(undefined);\n  return column.length * m.nodeHeight + (column.length - 1) * m.rowGap + 2 * m.groupPadding * groups.size;\n}\n\n/** Groups in order of first appearance; within a group by ascending weight, the column's order on ties. */\nfunction orderColumn(\n  column: readonly ColumnsLayoutNode[],\n  groupRank: ReadonlyMap<string | undefined, number>,\n  weight: (node: ColumnsLayoutNode) => number,\n): GroupRun[] {\n  const runs = new Map<number, { node: ColumnsLayoutNode; index: number; weight: number }[]>();\n  column.forEach((node, index) => {\n    const rank = mustGet(groupRank, node.group, \"group rank\");\n    const entry = { node, index, weight: weight(node) };\n    const run = runs.get(rank);\n    if (run) {\n      run.push(entry);\n    } else {\n      runs.set(rank, [entry]);\n    }\n  });\n  return [...runs.entries()]\n    .sort(([a], [b]) => a - b)\n    .map(([, run]) => {\n      // Infinity - Infinity is NaN, which falls through to the column-order tiebreak.\n      const nodes = run.sort((a, b) => a.weight - b.weight || a.index - b.index).map((entry) => entry.node);\n      return { group: nodes[0]?.group, nodes };\n    });\n}\n\nfunction stackColumn(\n  runs: readonly GroupRun[],\n  origin: { x: number; top: number; level: number },\n  m: ColumnMetrics,\n  placed: Map<string, GraphLayoutPosition>,\n): GraphLayoutGroupBox[] {\n  const boxes: GraphLayoutGroupBox[] = [];\n  let cursor = origin.top;\n  for (const { group, nodes } of runs) {\n    const pad = group === undefined ? 0 : m.groupPadding;\n    const height = nodes.length * m.nodeHeight + (nodes.length - 1) * m.rowGap + 2 * pad;\n    nodes.forEach((node, index) => {\n      const top = cursor + pad + index * (m.nodeHeight + m.rowGap);\n      placed.set(node.id, { x: origin.x, y: top + m.nodeHeight / 2 });\n    });\n    if (group !== undefined) {\n      boxes.push({\n        id: `${origin.level}:${group}`,\n        group,\n        level: origin.level,\n        x: origin.x - m.nodeWidth / 2 - pad,\n        y: cursor,\n        width: m.nodeWidth + 2 * pad,\n        height,\n      });\n    }\n    cursor += height + m.rowGap;\n  }\n  return boxes;\n}\n\nfunction meanY(ids: readonly string[], placed: ReadonlyMap<string, GraphLayoutPosition>): number {\n  if (ids.length === 0) return Number.POSITIVE_INFINITY;\n  return ids.reduce((sum, id) => sum + mustGet(placed, id, \"position\").y, 0) / ids.length;\n}\n\n/**\n * Levels in the order they are first laid out — the one nearest 0, then\n * outward on each side — each paired with the already-placed adjacent level\n * its nodes are ordered against.\n */\nfunction placementOrder(levels: readonly number[]): [level: number, reference: number | undefined][] {\n  const anchor = levels.reduce((best, level) => (Math.abs(level) < Math.abs(best) ? level : best));\n  const outward = (side: readonly number[]) =>\n    side.map((level, index): [number, number] => [level, side[index - 1] ?? anchor]);\n  return [\n    [anchor, undefined],\n    ...outward(levels.filter((level) => level > anchor)),\n    ...outward(levels.filter((level) => level < anchor).reverse()),\n  ];\n}\n\n/** Orders one column by the mean y of its nodes' neighbours in the `references` levels, and stacks it. */\nfunction placeColumn(level: number, references: readonly number[], ctx: ColumnsContext, into: Arrangement): void {\n  const runs = orderColumn(mustGet(into.order, level, \"column\"), ctx.groupRank, (node) =>\n    meanY(\n      mustGet(ctx.neighbours, node.id, \"neighbours\").filter((id) =>\n        references.includes(mustGet(ctx.levelOf, id, \"level\")),\n      ),\n      into.placed,\n    ),\n  );\n  into.order.set(\n    level,\n    runs.flatMap((run) => run.nodes),\n  );\n  into.boxes.set(level, stackColumn(runs, ctx.origin(level), ctx.m, into.placed));\n}\n\n/** Pairs of edges between adjacent columns that cross, taking each edge as a straight line. */\nfunction countCrossings(ctx: ColumnsContext, placed: ReadonlyMap<string, GraphLayoutPosition>): number {\n  const spans = new Map<number, [lower: number, upper: number][]>();\n  for (const edge of ctx.edges) {\n    const levels = [mustGet(ctx.levelOf, edge.from, \"level\"), mustGet(ctx.levelOf, edge.to, \"level\")] as const;\n    const [lower, upper] = levels[0] < levels[1] ? [edge.from, edge.to] : [edge.to, edge.from];\n    const index = ctx.levels.indexOf(Math.min(...levels));\n    if (levels[0] === levels[1] || ctx.levels[index + 1] !== Math.max(...levels)) continue;\n    const span: [number, number] = [mustGet(placed, lower, \"position\").y, mustGet(placed, upper, \"position\").y];\n    spans.set(index, [...(spans.get(index) ?? []), span]);\n  }\n  let crossings = 0;\n  for (const gap of spans.values()) {\n    gap.forEach((a, index) => {\n      crossings += gap.slice(index + 1).filter((b) => (a[0] - b[0]) * (a[1] - b[1]) < 0).length;\n    });\n  }\n  return crossings;\n}\n\n/** A copy of `from` with every column re-ordered against both its neighbours, in the order given. */\nfunction sweep(from: Arrangement, sequence: readonly number[], ctx: ColumnsContext): Arrangement {\n  const next: Arrangement = { order: new Map(from.order), placed: new Map(from.placed), boxes: new Map(from.boxes) };\n  for (const level of sequence) {\n    const index = ctx.levels.indexOf(level);\n    const adjacent = [ctx.levels[index - 1], ctx.levels[index + 1]].filter((other): other is number => other !== undefined);\n    placeColumn(level, adjacent, ctx, next);\n  }\n  return next;\n}\n\n/**\n * Orders the columns. The first pass places the level nearest 0 and works\n * outward, ordering each column against the one just placed. Then up to\n * `sweeps` passes re-order every column against both its neighbours, inward\n * then outward, and the arrangement with the fewest crossings is kept: the\n * first pass's unless a later one strictly beats it.\n */\nfunction arrange(columns: ReadonlyMap<number, ColumnsLayoutNode[]>, ctx: ColumnsContext): Arrangement {\n  let current: Arrangement = { order: new Map(columns), placed: new Map(), boxes: new Map() };\n  for (const [level, reference] of placementOrder(ctx.levels)) {\n    placeColumn(level, reference === undefined ? [] : [reference], ctx, current);\n  }\n  let best = current;\n  let fewest = countCrossings(ctx, best.placed);\n  for (let pass = 0; pass < ctx.m.sweeps && fewest > 0; pass++) {\n    current = sweep(current, pass % 2 === 0 ? [...ctx.levels].reverse() : ctx.levels, ctx);\n    const crossings = countCrossings(ctx, current.placed);\n    if (crossings < fewest) {\n      best = current;\n      fewest = crossings;\n    }\n  }\n  return best;\n}\n\n/**\n * Places nodes in left-to-right columns by `level` (the lowest level first),\n * stacking each column top to bottom and centring it against the tallest one.\n *\n * Within a column, nodes of one group are contiguous, groups appearing in the\n * order they first occur in `nodes`. Inside a group nodes are ordered by the\n * mean y of their neighbours in the adjacent columns, so edges between columns\n * cross less (see `arrange`); nodes with no neighbour there go last, and ties\n * keep input order.\n *\n * Returns node centres plus one rectangle per (column, group). Extra width is\n * reserved on each side for the loops `routeEdges` draws outside the first and\n * last columns.\n */\nexport function columnsLayout(\n  nodes: readonly ColumnsLayoutNode[],\n  edges: readonly GraphLayoutEdge[],\n  options: ColumnsLayoutOptions = {},\n): ColumnsLayoutResult {\n  const m = columnMetrics(options);\n  const { columns, groupRank } = indexColumns(nodes);\n  const neighbours = indexNeighbours(nodes, edges);\n  const levels = [...columns.keys()].sort((a, b) => a - b);\n  if (levels.length === 0) {\n    return { width: 2 * m.padding, height: 2 * m.padding, positions: {}, groups: [] };\n  }\n\n  const minLevel = Math.min(...levels);\n  const tallest = Math.max(...[...columns.values()].map((column) => columnHeight(column, m)));\n  const inset = m.padding + (nodes.some((node) => node.group !== undefined) ? m.groupPadding : 0);\n  const { placed, boxes } = arrange(columns, {\n    m,\n    levels,\n    levelOf: new Map(nodes.map((node) => [node.id, node.level])),\n    groupRank,\n    neighbours,\n    edges,\n    origin: (level) => ({\n      x: inset + m.nodeWidth / 2 + (level - minLevel) * (m.nodeWidth + m.columnGap),\n      top: m.padding + (tallest - columnHeight(mustGet(columns, level, \"column\"), m)) / 2,\n      level,\n    }),\n  });\n\n  const room = loopOverhang(edges, Object.fromEntries(placed), m);\n  const span = (Math.max(...levels) - minLevel) * (m.nodeWidth + m.columnGap) + m.nodeWidth;\n  return {\n    width: room.left + 2 * inset + span + room.right,\n    height: tallest + 2 * m.padding,\n    positions: Object.fromEntries([...placed].map(([id, { x, y }]) => [id, { x: x + room.left, y }])),\n    groups: [...boxes.values()]\n      .flat()\n      .map((box) => ({ ...box, x: box.x + room.left }))\n      .sort((a, b) => a.level - b.level || a.y - b.y),\n  };\n}\n"],"names":[],"mappings":";AA2EA,MAAM,qBAAqB;AAC3B,MAAM,sBAAsB;AAC5B,MAAM,qBAAqB;AAC3B,MAAM,kBAAkB;AACxB,MAAM,wBAAwB;AAC9B,MAAM,kBAAkB;AACxB,MAAM,iBAAiB;AAEvB,SAAS,QAAc,KAAwB,KAAQ,MAAiB;AACtE,QAAM,QAAQ,IAAI,IAAI,GAAG;AACzB,MAAI,UAAU,QAAW;AACvB,UAAM,IAAI,MAAM,qBAAqB,IAAI,SAAS,OAAO,GAAG,CAAC,GAAG;AAAA,EAClE;AACA,SAAO;AACT;AAEA,SAAS,cAAc,SAA8C;AACnE,SAAO;AAAA,IACL,WAAW,QAAQ,aAAa;AAAA,IAChC,YAAY,QAAQ,cAAc;AAAA,IAClC,WAAW,QAAQ,aAAa;AAAA,IAChC,QAAQ,QAAQ,UAAU;AAAA,IAC1B,cAAc,QAAQ,gBAAgB;AAAA,IACtC,SAAS,QAAQ,WAAW;AAAA,IAC5B,QAAQ,QAAQ,UAAU;AAAA,EAAA;AAE9B;AAEA,SAAS,aAAa,OAAqC;AACzD,QAAM,8BAAc,IAAA;AACpB,QAAM,gCAAgB,IAAA;AACtB,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,OAAO,SAAS,KAAK,KAAK,GAAG;AAChC,YAAM,IAAI,MAAM,wBAAwB,KAAK,EAAE,8BAA8B,KAAK,KAAK,GAAG;AAAA,IAC5F;AACA,QAAI,CAAC,UAAU,IAAI,KAAK,KAAK,EAAG,WAAU,IAAI,KAAK,OAAO,UAAU,IAAI;AACxE,UAAM,SAAS,QAAQ,IAAI,KAAK,KAAK;AACrC,QAAI,QAAQ;AACV,aAAO,KAAK,IAAI;AAAA,IAClB,OAAO;AACL,cAAQ,IAAI,KAAK,OAAO,CAAC,IAAI,CAAC;AAAA,IAChC;AAAA,EACF;AACA,SAAO,EAAE,SAAS,UAAA;AACpB;AAEA,SAAS,gBACP,OACA,OACuB;AACvB,QAAM,aAAa,IAAI,IAAsB,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,CAAA,CAAE,CAAC,CAAC;AAC/E,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,WAAW,IAAI,KAAK,IAAI;AACrC,UAAM,KAAK,WAAW,IAAI,KAAK,EAAE;AACjC,QAAI,CAAC,QAAQ,CAAC,IAAI;AAChB,YAAM,UAAU,OAAO,KAAK,KAAK,KAAK;AACtC,YAAM,IAAI,MAAM,wBAAwB,KAAK,EAAE,8BAA8B,OAAO,GAAG;AAAA,IACzF;AACA,SAAK,KAAK,KAAK,EAAE;AACjB,OAAG,KAAK,KAAK,IAAI;AAAA,EACnB;AACA,SAAO;AACT;AAEA,SAAS,aAAa,QAAsC,GAA0B;AACpF,QAAM,SAAS,IAAI,IAAI,OAAO,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC;AACvD,SAAO,OAAO,MAAS;AACvB,SAAO,OAAO,SAAS,EAAE,cAAc,OAAO,SAAS,KAAK,EAAE,SAAS,IAAI,EAAE,eAAe,OAAO;AACrG;AAGA,SAAS,YACP,QACA,WACA,QACY;AACZ,QAAM,2BAAW,IAAA;AACjB,SAAO,QAAQ,CAAC,MAAM,UAAU;AAC9B,UAAM,OAAO,QAAQ,WAAW,KAAK,OAAO,YAAY;AACxD,UAAM,QAAQ,EAAE,MAAM,OAAO,QAAQ,OAAO,IAAI,EAAA;AAChD,UAAM,MAAM,KAAK,IAAI,IAAI;AACzB,QAAI,KAAK;AACP,UAAI,KAAK,KAAK;AAAA,IAChB,OAAO;AACL,WAAK,IAAI,MAAM,CAAC,KAAK,CAAC;AAAA,IACxB;AAAA,EACF,CAAC;AACD,SAAO,CAAC,GAAG,KAAK,QAAA,CAAS,EACtB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,EACxB,IAAI,CAAC,CAAA,EAAG,GAAG,MAAM;;AAEhB,UAAM,QAAQ,IAAI,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI;AACpG,WAAO,EAAE,QAAO,WAAM,CAAC,MAAP,mBAAU,OAAO,MAAA;AAAA,EACnC,CAAC;AACL;AAEA,SAAS,YACP,MACA,QACA,GACA,QACuB;AACvB,QAAM,QAA+B,CAAA;AACrC,MAAI,SAAS,OAAO;AACpB,aAAW,EAAE,OAAO,MAAA,KAAW,MAAM;AACnC,UAAM,MAAM,UAAU,SAAY,IAAI,EAAE;AACxC,UAAM,SAAS,MAAM,SAAS,EAAE,cAAc,MAAM,SAAS,KAAK,EAAE,SAAS,IAAI;AACjF,UAAM,QAAQ,CAAC,MAAM,UAAU;AAC7B,YAAM,MAAM,SAAS,MAAM,SAAS,EAAE,aAAa,EAAE;AACrD,aAAO,IAAI,KAAK,IAAI,EAAE,GAAG,OAAO,GAAG,GAAG,MAAM,EAAE,aAAa,EAAA,CAAG;AAAA,IAChE,CAAC;AACD,QAAI,UAAU,QAAW;AACvB,YAAM,KAAK;AAAA,QACT,IAAI,GAAG,OAAO,KAAK,IAAI,KAAK;AAAA,QAC5B;AAAA,QACA,OAAO,OAAO;AAAA,QACd,GAAG,OAAO,IAAI,EAAE,YAAY,IAAI;AAAA,QAChC,GAAG;AAAA,QACH,OAAO,EAAE,YAAY,IAAI;AAAA,QACzB;AAAA,MAAA,CACD;AAAA,IACH;AACA,cAAU,SAAS,EAAE;AAAA,EACvB;AACA,SAAO;AACT;AAEA,SAAS,MAAM,KAAwB,QAA0D;AAC/F,MAAI,IAAI,WAAW,EAAG,QAAO,OAAO;AACpC,SAAO,IAAI,OAAO,CAAC,KAAK,OAAO,MAAM,QAAQ,QAAQ,IAAI,UAAU,EAAE,GAAG,CAAC,IAAI,IAAI;AACnF;AAOA,SAAS,eAAe,QAA6E;AACnG,QAAM,SAAS,OAAO,OAAO,CAAC,MAAM,UAAW,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,IAAI,QAAQ,IAAK;AAC/F,QAAM,UAAU,CAAC,SACf,KAAK,IAAI,CAAC,OAAO,UAA4B,CAAC,OAAO,KAAK,QAAQ,CAAC,KAAK,MAAM,CAAC;AACjF,SAAO;AAAA,IACL,CAAC,QAAQ,MAAS;AAAA,IAClB,GAAG,QAAQ,OAAO,OAAO,CAAC,UAAU,QAAQ,MAAM,CAAC;AAAA,IACnD,GAAG,QAAQ,OAAO,OAAO,CAAC,UAAU,QAAQ,MAAM,EAAE,QAAA,CAAS;AAAA,EAAA;AAEjE;AAGA,SAAS,YAAY,OAAe,YAA+B,KAAqB,MAAyB;AAC/G,QAAM,OAAO;AAAA,IAAY,QAAQ,KAAK,OAAO,OAAO,QAAQ;AAAA,IAAG,IAAI;AAAA,IAAW,CAAC,SAC7E;AAAA,MACE,QAAQ,IAAI,YAAY,KAAK,IAAI,YAAY,EAAE;AAAA,QAAO,CAAC,OACrD,WAAW,SAAS,QAAQ,IAAI,SAAS,IAAI,OAAO,CAAC;AAAA,MAAA;AAAA,MAEvD,KAAK;AAAA,IAAA;AAAA,EACP;AAEF,OAAK,MAAM;AAAA,IACT;AAAA,IACA,KAAK,QAAQ,CAAC,QAAQ,IAAI,KAAK;AAAA,EAAA;AAEjC,OAAK,MAAM,IAAI,OAAO,YAAY,MAAM,IAAI,OAAO,KAAK,GAAG,IAAI,GAAG,KAAK,MAAM,CAAC;AAChF;AAGA,SAAS,eAAe,KAAqB,QAA0D;AACrG,QAAM,4BAAY,IAAA;AAClB,aAAW,QAAQ,IAAI,OAAO;AAC5B,UAAM,SAAS,CAAC,QAAQ,IAAI,SAAS,KAAK,MAAM,OAAO,GAAG,QAAQ,IAAI,SAAS,KAAK,IAAI,OAAO,CAAC;AAChG,UAAM,CAAC,OAAO,KAAK,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,MAAM,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI;AACzF,UAAM,QAAQ,IAAI,OAAO,QAAQ,KAAK,IAAI,GAAG,MAAM,CAAC;AACpD,QAAI,OAAO,CAAC,MAAM,OAAO,CAAC,KAAK,IAAI,OAAO,QAAQ,CAAC,MAAM,KAAK,IAAI,GAAG,MAAM,EAAG;AAC9E,UAAM,OAAyB,CAAC,QAAQ,QAAQ,OAAO,UAAU,EAAE,GAAG,QAAQ,QAAQ,OAAO,UAAU,EAAE,CAAC;AAC1G,UAAM,IAAI,OAAO,CAAC,GAAI,MAAM,IAAI,KAAK,KAAK,IAAK,IAAI,CAAC;AAAA,EACtD;AACA,MAAI,YAAY;AAChB,aAAW,OAAO,MAAM,UAAU;AAChC,QAAI,QAAQ,CAAC,GAAG,UAAU;AACxB,mBAAa,IAAI,MAAM,QAAQ,CAAC,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;AAAA,IACrF,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAGA,SAAS,MAAM,MAAmB,UAA6B,KAAkC;AAC/F,QAAM,OAAoB,EAAE,OAAO,IAAI,IAAI,KAAK,KAAK,GAAG,QAAQ,IAAI,IAAI,KAAK,MAAM,GAAG,OAAO,IAAI,IAAI,KAAK,KAAK,EAAA;AAC/G,aAAW,SAAS,UAAU;AAC5B,UAAM,QAAQ,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,WAAW,CAAC,IAAI,OAAO,QAAQ,CAAC,GAAG,IAAI,OAAO,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,UAA2B,UAAU,MAAS;AACtH,gBAAY,OAAO,UAAU,KAAK,IAAI;AAAA,EACxC;AACA,SAAO;AACT;AASA,SAAS,QAAQ,SAAmD,KAAkC;AACpG,MAAI,UAAuB,EAAE,OAAO,IAAI,IAAI,OAAO,GAAG,QAAQ,oBAAI,IAAA,GAAO,OAAO,oBAAI,MAAI;AACxF,aAAW,CAAC,OAAO,SAAS,KAAK,eAAe,IAAI,MAAM,GAAG;AAC3D,gBAAY,OAAO,cAAc,SAAY,CAAA,IAAK,CAAC,SAAS,GAAG,KAAK,OAAO;AAAA,EAC7E;AACA,MAAI,OAAO;AACX,MAAI,SAAS,eAAe,KAAK,KAAK,MAAM;AAC5C,WAAS,OAAO,GAAG,OAAO,IAAI,EAAE,UAAU,SAAS,GAAG,QAAQ;AAC5D,cAAU,MAAM,SAAS,OAAO,MAAM,IAAI,CAAC,GAAG,IAAI,MAAM,EAAE,QAAA,IAAY,IAAI,QAAQ,GAAG;AACrF,UAAM,YAAY,eAAe,KAAK,QAAQ,MAAM;AACpD,QAAI,YAAY,QAAQ;AACtB,aAAO;AACP,eAAS;AAAA,IACX;AAAA,EACF;AACA,SAAO;AACT;AAgBO,SAAS,cACd,OACA,OACA,UAAgC,CAAA,GACX;AACrB,QAAM,IAAI,cAAc,OAAO;AAC/B,QAAM,EAAE,SAAS,cAAc,aAAa,KAAK;AACjD,QAAM,aAAa,gBAAgB,OAAO,KAAK;AAC/C,QAAM,SAAS,CAAC,GAAG,QAAQ,KAAA,CAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACvD,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,OAAO,IAAI,EAAE,SAAS,QAAQ,IAAI,EAAE,SAAS,WAAW,CAAA,GAAI,QAAQ,CAAA,EAAC;AAAA,EAChF;AAEA,QAAM,WAAW,KAAK,IAAI,GAAG,MAAM;AACnC,QAAM,UAAU,KAAK,IAAI,GAAG,CAAC,GAAG,QAAQ,OAAA,CAAQ,EAAE,IAAI,CAAC,WAAW,aAAa,QAAQ,CAAC,CAAC,CAAC;AAC1F,QAAM,QAAQ,EAAE,WAAW,MAAM,KAAK,CAAC,SAAS,KAAK,UAAU,MAAS,IAAI,EAAE,eAAe;AAC7F,QAAM,EAAE,QAAQ,UAAU,QAAQ,SAAS;AAAA,IACzC;AAAA,IACA;AAAA,IACA,SAAS,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC;AAAA,IAC3D;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,CAAC,WAAW;AAAA,MAClB,GAAG,QAAQ,EAAE,YAAY,KAAK,QAAQ,aAAa,EAAE,YAAY,EAAE;AAAA,MACnE,KAAK,EAAE,WAAW,UAAU,aAAa,QAAQ,SAAS,OAAO,QAAQ,GAAG,CAAC,KAAK;AAAA,MAClF;AAAA,IAAA;AAAA,EACF,CACD;AAED,QAAM,OAAO,aAAa,OAAO,OAAO,YAAY,MAAM,GAAG,CAAC;AAC9D,QAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,IAAI,aAAa,EAAE,YAAY,EAAE,aAAa,EAAE;AAChF,SAAO;AAAA,IACL,OAAO,KAAK,OAAO,IAAI,QAAQ,OAAO,KAAK;AAAA,IAC3C,QAAQ,UAAU,IAAI,EAAE;AAAA,IACxB,WAAW,OAAO,YAAY,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,KAAK,MAAM,EAAA,CAAG,CAAC,CAAC;AAAA,IAChG,QAAQ,CAAC,GAAG,MAAM,QAAQ,EACvB,KAAA,EACA,IAAI,CAAC,SAAS,EAAE,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK,KAAA,EAAO,EAC/C,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AAAA,EAAA;AAEpD;"}
+{"version":3,"file":"graph-columns-layout.js","sources":["../../src/data/graph-columns-layout.ts"],"sourcesContent":["// Level-column layout for GraphDiagram: pure math, no React. Split from\n// graph-layout.ts, which owns the shared types and `ringLayout`.\n\nimport { loopOverhang } from \"./graph-edge-routing\";\nimport type { GraphLayoutEdge, GraphLayoutNode, GraphLayoutPosition, GraphLayoutResult } from \"./graph-layout\";\n\nexport interface ColumnsLayoutNode extends GraphLayoutNode {\n  /** Column of the node. May be negative: the lowest level is the first column. */\n  level: number;\n  /** Nodes sharing a group stay contiguous within their column and are boxed together. */\n  group?: string;\n  /** Drawn at `compactNodeHeight`; a group of only compact nodes stacks them at the compact gap and padding. */\n  compact?: boolean;\n}\n\n/** The most members a group shows at once in a column; a group with more scrolls them in a window this many rows tall. */\nexport const GROUP_MEMBER_WINDOW = 10;\n/** Height of the \"rows a–b of n\" footer under a windowed group's rows. */\nconst GROUP_WINDOW_FOOTER_HEIGHT = 18;\n\nexport interface ColumnsLayoutOptions {\n  /** Group ids drawn as records with a header and flush compact rows. */\n  records?: readonly string[];\n  /**\n   * Group ids drawn as their header alone, `recordHeaderHeight` tall. Each holds one node per column it\n   * is drawn in, the stand-in its edges attach to, placed at the header's middle.\n   */\n  collapsed?: readonly string[];\n  /** Height of a record's header in px. Defaults to 24. */\n  recordHeaderHeight?: number;\n  /** Node bounding-box width in px. Defaults to 168. */\n  nodeWidth?: number;\n  /** Node bounding-box height in px. Defaults to 60. */\n  nodeHeight?: number;\n  /** Horizontal gap between the node boxes of adjacent columns in px. Defaults to 96. */\n  columnGap?: number;\n  /** Vertical gap between stacked nodes, and between group rectangles, in px. Defaults to 20. */\n  rowGap?: number;\n  /** Space between a group's nodes and its rectangle in px. Defaults to 12. */\n  groupPadding?: number;\n  /** Height of a compact node in px. Defaults to 24. */\n  compactNodeHeight?: number;\n  /** Vertical gap between the nodes of a group of only compact nodes in px. Defaults to 4. */\n  compactRowGap?: number;\n  /** Space between a group of only compact nodes and its rectangle in px. Defaults to 8. */\n  compactGroupPadding?: number;\n  /** Space reserved around the columns before the viewport edge. Defaults to 24. */\n  padding?: number;\n  /**\n   * Re-ordering passes over all columns after the first placement, alternating direction; a pass\n   * is kept only if it leaves fewer crossings. Defaults to 4. 0 keeps the first placement.\n   */\n  sweeps?: number;\n}\n\nexport interface GraphLayoutGroupBox {\n  /** `${level}:${group}` — a group spanning several columns gets one rectangle per column. */\n  id: string;\n  group: string;\n  level: number;\n  /** Top-left corner, in the same coordinate space as the layout's `width`/`height`. */\n  x: number;\n  y: number;\n  width: number;\n  height: number;\n  record: boolean;\n  headerHeight: number;\n  /** Set when the group holds more members in this column than `GROUP_MEMBER_WINDOW`: they scroll in a window. */\n  window?: GroupMemberWindow;\n  /** Drawn as its header alone: see `ColumnsLayoutOptions.collapsed`. */\n  collapsed?: true;\n}\n\n/**\n * The rows a group with more members than `GROUP_MEMBER_WINDOW` shows at once. The layout places every\n * member as if the group were drawn whole; a member shown from row `start` is drawn `tops[start]` higher.\n */\nexport interface GroupMemberWindow {\n  /** The members in this column, top to bottom. */\n  members: string[];\n  /** Each member's top, from the first member's top. */\n  tops: number[];\n  /** How many rows show at once. */\n  rows: number;\n  /** Top of the area members are drawn in, and its height. */\n  top: number;\n  height: number;\n  /** Height of the footer below that area, inside the group's rectangle. */\n  footerHeight: number;\n}\n\nexport interface ColumnsLayoutResult extends GraphLayoutResult {\n  groups: GraphLayoutGroupBox[];\n}\n\ntype ColumnMetrics = Required<ColumnsLayoutOptions>;\n\ninterface GroupRun {\n  group: string | undefined;\n  nodes: ColumnsLayoutNode[];\n}\n\n/** One ordering of every column, stacked: the node centres and group rectangles it gives. */\ninterface Arrangement {\n  order: Map<number, ColumnsLayoutNode[]>;\n  placed: Map<string, GraphLayoutPosition>;\n  boxes: Map<number, GraphLayoutGroupBox[]>;\n}\n\n/** What stays fixed while columns are re-ordered. */\ninterface ColumnsContext {\n  m: ColumnMetrics;\n  levels: number[];\n  levelOf: Map<string, number>;\n  groupRank: Map<string | undefined, number>;\n  neighbours: Map<string, string[]>;\n  edges: readonly GraphLayoutEdge[];\n  /** Centre x and top y of a level's column. */\n  origin: (level: number) => { x: number; top: number; level: number };\n}\n\nconst DEFAULT_NODE_WIDTH = 168;\nconst DEFAULT_NODE_HEIGHT = 60;\nconst DEFAULT_COLUMN_GAP = 96;\nconst DEFAULT_ROW_GAP = 20;\nconst DEFAULT_GROUP_PADDING = 12;\nconst DEFAULT_COMPACT_NODE_HEIGHT = 24;\nconst DEFAULT_COMPACT_ROW_GAP = 4;\nconst DEFAULT_COMPACT_GROUP_PADDING = 8;\nconst DEFAULT_PADDING = 24;\nconst DEFAULT_SWEEPS = 4;\n\nfunction mustGet<K, V>(map: ReadonlyMap<K, V>, key: K, what: string): V {\n  const value = map.get(key);\n  if (value === undefined) {\n    throw new Error(`columnsLayout: no ${what} for \"${String(key)}\"`);\n  }\n  return value;\n}\n\nfunction columnMetrics(options: ColumnsLayoutOptions): ColumnMetrics {\n  return {\n    records: options.records ?? [],\n    collapsed: options.collapsed ?? [],\n    recordHeaderHeight: options.recordHeaderHeight ?? 24,\n    nodeWidth: options.nodeWidth ?? DEFAULT_NODE_WIDTH,\n    nodeHeight: options.nodeHeight ?? DEFAULT_NODE_HEIGHT,\n    columnGap: options.columnGap ?? DEFAULT_COLUMN_GAP,\n    rowGap: options.rowGap ?? DEFAULT_ROW_GAP,\n    groupPadding: options.groupPadding ?? DEFAULT_GROUP_PADDING,\n    compactNodeHeight: options.compactNodeHeight ?? DEFAULT_COMPACT_NODE_HEIGHT,\n    compactRowGap: options.compactRowGap ?? DEFAULT_COMPACT_ROW_GAP,\n    compactGroupPadding: options.compactGroupPadding ?? DEFAULT_COMPACT_GROUP_PADDING,\n    padding: options.padding ?? DEFAULT_PADDING,\n    sweeps: options.sweeps ?? DEFAULT_SWEEPS,\n  };\n}\n\nfunction indexColumns(nodes: readonly ColumnsLayoutNode[]) {\n  const columns = new Map<number, ColumnsLayoutNode[]>();\n  const groupRank = new Map<string | undefined, number>();\n  for (const node of nodes) {\n    if (!Number.isFinite(node.level)) {\n      throw new Error(`columnsLayout: node \"${node.id}\" has no finite level (got ${node.level})`);\n    }\n    if (!groupRank.has(node.group)) groupRank.set(node.group, groupRank.size);\n    const column = columns.get(node.level);\n    if (column) {\n      column.push(node);\n    } else {\n      columns.set(node.level, [node]);\n    }\n  }\n  return { columns, groupRank };\n}\n\nfunction indexNeighbours(\n  nodes: readonly ColumnsLayoutNode[],\n  edges: readonly GraphLayoutEdge[],\n): Map<string, string[]> {\n  const neighbours = new Map<string, string[]>(nodes.map((node) => [node.id, []]));\n  for (const edge of edges) {\n    const from = neighbours.get(edge.from);\n    const to = neighbours.get(edge.to);\n    if (!from || !to) {\n      const missing = from ? edge.to : edge.from;\n      throw new Error(`columnsLayout: edge \"${edge.id}\" references unknown node \"${missing}\"`);\n    }\n    from.push(edge.to);\n    to.push(edge.from);\n  }\n  return neighbours;\n}\n\ninterface RunMetrics {\n  pad: number;\n  gap: number;\n  heightOf: (node: ColumnsLayoutNode) => number;\n  /** Room above the first node inside the run's rectangle: a record's header. */\n  header: number;\n  height: number;\n  /** The height members are drawn in, when there are more of them than the window holds. */\n  view?: number;\n  collapsed: boolean;\n}\n\nfunction collapsedRun(group: string, nodes: readonly ColumnsLayoutNode[], m: ColumnMetrics): RunMetrics {\n  if (nodes.length !== 1) throw new Error(`columnsLayout: collapsed group \"${group}\" holds ${nodes.length} nodes in a column; it draws one stand-in`);\n  return { pad: 0, gap: 0, heightOf: () => m.recordHeaderHeight, header: 0, height: m.recordHeaderHeight, collapsed: true };\n}\n\n/**\n * How a run of nodes stacks: each node's height, the gap between them and the padding inside the run's\n * rectangle. A grouped run of only compact nodes takes the compact gap and padding; any other run the\n * regular ones, whatever its order, so a column's height does not depend on how it is ordered. A group\n * of more than `GROUP_MEMBER_WINDOW` members is only as tall as that many of its tallest rows, over a footer.\n */\nfunction runMetrics(group: string | undefined, nodes: readonly ColumnsLayoutNode[], m: ColumnMetrics, record: boolean): RunMetrics {\n  if (group !== undefined && m.collapsed.includes(group)) return collapsedRun(group, nodes, m);\n  let stack: Omit<RunMetrics, \"height\" | \"collapsed\">;\n  if (record) {\n    const regular = nodes.find((node) => !node.compact);\n    if (regular) throw new Error(`columnsLayout: record group \"${group}\" holds non-compact node \"${regular.id}\"`);\n    stack = { pad: 0, gap: 0, heightOf: () => m.compactNodeHeight, header: m.recordHeaderHeight };\n  } else {\n    const compact = group !== undefined && nodes.every((node) => node.compact === true);\n    const heightOf = (node: ColumnsLayoutNode) => (node.compact ? m.compactNodeHeight : m.nodeHeight);\n    stack = { pad: group === undefined ? 0 : compact ? m.compactGroupPadding : m.groupPadding, gap: compact ? m.compactRowGap : m.rowGap, heightOf, header: 0 };\n  }\n  const chrome = stack.header + 2 * stack.pad;\n  if (group === undefined || nodes.length <= GROUP_MEMBER_WINDOW) {\n    const stacked = nodes.reduce((sum, node) => sum + stack.heightOf(node), 0) + (nodes.length - 1) * stack.gap;\n    return { ...stack, height: chrome + stacked, collapsed: false };\n  }\n  const view = GROUP_MEMBER_WINDOW * Math.max(...nodes.map(stack.heightOf)) + (GROUP_MEMBER_WINDOW - 1) * stack.gap;\n  return { ...stack, view, height: chrome + view + GROUP_WINDOW_FOOTER_HEIGHT, collapsed: false };\n}\n\nfunction columnHeight(column: readonly ColumnsLayoutNode[], m: ColumnMetrics): number {\n  const runs = new Map<string | undefined, ColumnsLayoutNode[]>();\n  for (const node of column) runs.set(node.group, [...(runs.get(node.group) ?? []), node]);\n  const stacked = [...runs].reduce((sum, [group, nodes]) => sum + runMetrics(group, nodes, m, group !== undefined && m.records.includes(group)).height, 0);\n  return stacked + (runs.size - 1) * m.rowGap;\n}\n\n/** Groups in order of first appearance; within a group by ascending weight, the column's order on ties. */\nfunction orderColumn(\n  column: readonly ColumnsLayoutNode[],\n  groupRank: ReadonlyMap<string | undefined, number>,\n  weight: (node: ColumnsLayoutNode) => number,\n): GroupRun[] {\n  const runs = new Map<number, { node: ColumnsLayoutNode; index: number; weight: number }[]>();\n  column.forEach((node, index) => {\n    const rank = mustGet(groupRank, node.group, \"group rank\");\n    const entry = { node, index, weight: weight(node) };\n    const run = runs.get(rank);\n    if (run) {\n      run.push(entry);\n    } else {\n      runs.set(rank, [entry]);\n    }\n  });\n  return [...runs.entries()]\n    .sort(([a], [b]) => a - b)\n    .map(([, run]) => {\n      // Infinity - Infinity is NaN, which falls through to the column-order tiebreak.\n      const nodes = run.sort((a, b) => a.weight - b.weight || a.index - b.index).map((entry) => entry.node);\n      return { group: nodes[0]?.group, nodes };\n    });\n}\n\nfunction stackColumn(\n  runs: readonly GroupRun[],\n  origin: { x: number; top: number; level: number },\n  m: ColumnMetrics,\n  placed: Map<string, GraphLayoutPosition>,\n): GraphLayoutGroupBox[] {\n  const boxes: GraphLayoutGroupBox[] = [];\n  let cursor = origin.top;\n  for (const { group, nodes } of runs) {\n    const record = group !== undefined && m.records.includes(group);\n    const run = runMetrics(group, nodes, m, record);\n    const first = cursor + run.pad + run.header;\n    const tops: number[] = [];\n    let top = first;\n    for (const node of nodes) {\n      tops.push(top - first);\n      placed.set(node.id, { x: origin.x, y: top + run.heightOf(node) / 2 });\n      top += run.heightOf(node) + run.gap;\n    }\n    if (group !== undefined) {\n      const memberWindow: GroupMemberWindow | undefined = run.view === undefined ? undefined\n        : { members: nodes.map((node) => node.id), tops, rows: GROUP_MEMBER_WINDOW, top: first, height: run.view, footerHeight: GROUP_WINDOW_FOOTER_HEIGHT };\n      boxes.push({\n        id: `${origin.level}:${group}`,\n        group,\n        level: origin.level,\n        x: origin.x - m.nodeWidth / 2 - run.pad,\n        y: cursor,\n        width: m.nodeWidth + 2 * run.pad,\n        height: run.height,\n        record,\n        headerHeight: run.collapsed ? m.recordHeaderHeight : run.header,\n        ...(memberWindow ? { window: memberWindow } : {}),\n        ...(run.collapsed ? { collapsed: true as const } : {}),\n      });\n    }\n    cursor += run.height + m.rowGap;\n  }\n  return boxes;\n}\n\nfunction meanY(ids: readonly string[], placed: ReadonlyMap<string, GraphLayoutPosition>): number {\n  if (ids.length === 0) return Number.POSITIVE_INFINITY;\n  return ids.reduce((sum, id) => sum + mustGet(placed, id, \"position\").y, 0) / ids.length;\n}\n\n/**\n * Levels in the order they are first laid out — the one nearest 0, then\n * outward on each side — each paired with the already-placed adjacent level\n * its nodes are ordered against.\n */\nfunction placementOrder(levels: readonly number[]): [level: number, reference: number | undefined][] {\n  const anchor = levels.reduce((best, level) => (Math.abs(level) < Math.abs(best) ? level : best));\n  const outward = (side: readonly number[]) =>\n    side.map((level, index): [number, number] => [level, side[index - 1] ?? anchor]);\n  return [\n    [anchor, undefined],\n    ...outward(levels.filter((level) => level > anchor)),\n    ...outward(levels.filter((level) => level < anchor).reverse()),\n  ];\n}\n\n/** Orders one column by the mean y of its nodes' neighbours in the `references` levels, and stacks it. */\nfunction placeColumn(level: number, references: readonly number[], ctx: ColumnsContext, into: Arrangement): void {\n  const runs = orderColumn(mustGet(into.order, level, \"column\"), ctx.groupRank, (node) =>\n    meanY(\n      mustGet(ctx.neighbours, node.id, \"neighbours\").filter((id) =>\n        references.includes(mustGet(ctx.levelOf, id, \"level\")),\n      ),\n      into.placed,\n    ),\n  );\n  into.order.set(\n    level,\n    runs.flatMap((run) => run.nodes),\n  );\n  into.boxes.set(level, stackColumn(runs, ctx.origin(level), ctx.m, into.placed));\n}\n\n/** Pairs of edges between adjacent columns that cross, taking each edge as a straight line. */\nfunction countCrossings(ctx: ColumnsContext, placed: ReadonlyMap<string, GraphLayoutPosition>): number {\n  const spans = new Map<number, [lower: number, upper: number][]>();\n  for (const edge of ctx.edges) {\n    const levels = [mustGet(ctx.levelOf, edge.from, \"level\"), mustGet(ctx.levelOf, edge.to, \"level\")] as const;\n    const [lower, upper] = levels[0] < levels[1] ? [edge.from, edge.to] : [edge.to, edge.from];\n    const index = ctx.levels.indexOf(Math.min(...levels));\n    if (levels[0] === levels[1] || ctx.levels[index + 1] !== Math.max(...levels)) continue;\n    const span: [number, number] = [mustGet(placed, lower, \"position\").y, mustGet(placed, upper, \"position\").y];\n    spans.set(index, [...(spans.get(index) ?? []), span]);\n  }\n  let crossings = 0;\n  for (const gap of spans.values()) {\n    gap.forEach((a, index) => {\n      crossings += gap.slice(index + 1).filter((b) => (a[0] - b[0]) * (a[1] - b[1]) < 0).length;\n    });\n  }\n  return crossings;\n}\n\n/** A copy of `from` with every column re-ordered against both its neighbours, in the order given. */\nfunction sweep(from: Arrangement, sequence: readonly number[], ctx: ColumnsContext): Arrangement {\n  const next: Arrangement = { order: new Map(from.order), placed: new Map(from.placed), boxes: new Map(from.boxes) };\n  for (const level of sequence) {\n    const index = ctx.levels.indexOf(level);\n    const adjacent = [ctx.levels[index - 1], ctx.levels[index + 1]].filter((other): other is number => other !== undefined);\n    placeColumn(level, adjacent, ctx, next);\n  }\n  return next;\n}\n\n/**\n * Orders the columns. The first pass places the level nearest 0 and works\n * outward, ordering each column against the one just placed. Then up to\n * `sweeps` passes re-order every column against both its neighbours, inward\n * then outward, and the arrangement with the fewest crossings is kept: the\n * first pass's unless a later one strictly beats it.\n */\nfunction arrange(columns: ReadonlyMap<number, ColumnsLayoutNode[]>, ctx: ColumnsContext): Arrangement {\n  let current: Arrangement = { order: new Map(columns), placed: new Map(), boxes: new Map() };\n  for (const [level, reference] of placementOrder(ctx.levels)) {\n    placeColumn(level, reference === undefined ? [] : [reference], ctx, current);\n  }\n  let best = current;\n  let fewest = countCrossings(ctx, best.placed);\n  for (let pass = 0; pass < ctx.m.sweeps && fewest > 0; pass++) {\n    current = sweep(current, pass % 2 === 0 ? [...ctx.levels].reverse() : ctx.levels, ctx);\n    const crossings = countCrossings(ctx, current.placed);\n    if (crossings < fewest) {\n      best = current;\n      fewest = crossings;\n    }\n  }\n  return best;\n}\n\n/**\n * Places nodes in left-to-right columns by `level` (the lowest level first),\n * stacking each column top to bottom and centring it against the tallest one.\n *\n * Within a column, nodes of one group are contiguous, groups appearing in the\n * order they first occur in `nodes`. Inside a group nodes are ordered by the\n * mean y of their neighbours in the adjacent columns, so edges between columns\n * cross less (see `arrange`); nodes with no neighbour there go last, and ties\n * keep input order.\n *\n * Returns node centres plus one rectangle per (column, group). Extra width is\n * reserved on each side for the loops `routeEdges` draws outside the first and\n * last columns.\n */\nexport function columnsLayout(\n  nodes: readonly ColumnsLayoutNode[],\n  edges: readonly GraphLayoutEdge[],\n  options: ColumnsLayoutOptions = {},\n): ColumnsLayoutResult {\n  const m = columnMetrics(options);\n  const { columns, groupRank } = indexColumns(nodes);\n  const neighbours = indexNeighbours(nodes, edges);\n  const levels = [...columns.keys()].sort((a, b) => a - b);\n  if (levels.length === 0) {\n    return { width: 2 * m.padding, height: 2 * m.padding, positions: {}, groups: [] };\n  }\n\n  const minLevel = Math.min(...levels);\n  const tallest = Math.max(...[...columns.values()].map((column) => columnHeight(column, m)));\n  const inset = m.padding + (nodes.some((node) => node.group !== undefined) ? m.groupPadding : 0);\n  const { placed, boxes } = arrange(columns, {\n    m,\n    levels,\n    levelOf: new Map(nodes.map((node) => [node.id, node.level])),\n    groupRank,\n    neighbours,\n    edges,\n    origin: (level) => ({\n      x: inset + m.nodeWidth / 2 + (level - minLevel) * (m.nodeWidth + m.columnGap),\n      top: m.padding + (tallest - columnHeight(mustGet(columns, level, \"column\"), m)) / 2,\n      level,\n    }),\n  });\n\n  const nodeHeights = Object.fromEntries(nodes.filter((node) => node.compact).map((node) => [node.id, m.compactNodeHeight]));\n  const room = loopOverhang(edges, Object.fromEntries(placed), { ...m, nodeHeights });\n  const span = (Math.max(...levels) - minLevel) * (m.nodeWidth + m.columnGap) + m.nodeWidth;\n  return {\n    width: room.left + 2 * inset + span + room.right,\n    height: tallest + 2 * m.padding,\n    positions: Object.fromEntries([...placed].map(([id, { x, y }]) => [id, { x: x + room.left, y }])),\n    groups: [...boxes.values()]\n      .flat()\n      .map((box) => ({ ...box, x: box.x + room.left }))\n      .sort((a, b) => a.level - b.level || a.y - b.y),\n  };\n}\n"],"names":[],"mappings":";AAgBO,MAAM,sBAAsB;AAEnC,MAAM,6BAA6B;AAuGnC,MAAM,qBAAqB;AAC3B,MAAM,sBAAsB;AAC5B,MAAM,qBAAqB;AAC3B,MAAM,kBAAkB;AACxB,MAAM,wBAAwB;AAC9B,MAAM,8BAA8B;AACpC,MAAM,0BAA0B;AAChC,MAAM,gCAAgC;AACtC,MAAM,kBAAkB;AACxB,MAAM,iBAAiB;AAEvB,SAAS,QAAc,KAAwB,KAAQ,MAAiB;AACtE,QAAM,QAAQ,IAAI,IAAI,GAAG;AACzB,MAAI,UAAU,QAAW;AACvB,UAAM,IAAI,MAAM,qBAAqB,IAAI,SAAS,OAAO,GAAG,CAAC,GAAG;AAAA,EAClE;AACA,SAAO;AACT;AAEA,SAAS,cAAc,SAA8C;AACnE,SAAO;AAAA,IACL,SAAS,QAAQ,WAAW,CAAA;AAAA,IAC5B,WAAW,QAAQ,aAAa,CAAA;AAAA,IAChC,oBAAoB,QAAQ,sBAAsB;AAAA,IAClD,WAAW,QAAQ,aAAa;AAAA,IAChC,YAAY,QAAQ,cAAc;AAAA,IAClC,WAAW,QAAQ,aAAa;AAAA,IAChC,QAAQ,QAAQ,UAAU;AAAA,IAC1B,cAAc,QAAQ,gBAAgB;AAAA,IACtC,mBAAmB,QAAQ,qBAAqB;AAAA,IAChD,eAAe,QAAQ,iBAAiB;AAAA,IACxC,qBAAqB,QAAQ,uBAAuB;AAAA,IACpD,SAAS,QAAQ,WAAW;AAAA,IAC5B,QAAQ,QAAQ,UAAU;AAAA,EAAA;AAE9B;AAEA,SAAS,aAAa,OAAqC;AACzD,QAAM,8BAAc,IAAA;AACpB,QAAM,gCAAgB,IAAA;AACtB,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,OAAO,SAAS,KAAK,KAAK,GAAG;AAChC,YAAM,IAAI,MAAM,wBAAwB,KAAK,EAAE,8BAA8B,KAAK,KAAK,GAAG;AAAA,IAC5F;AACA,QAAI,CAAC,UAAU,IAAI,KAAK,KAAK,EAAG,WAAU,IAAI,KAAK,OAAO,UAAU,IAAI;AACxE,UAAM,SAAS,QAAQ,IAAI,KAAK,KAAK;AACrC,QAAI,QAAQ;AACV,aAAO,KAAK,IAAI;AAAA,IAClB,OAAO;AACL,cAAQ,IAAI,KAAK,OAAO,CAAC,IAAI,CAAC;AAAA,IAChC;AAAA,EACF;AACA,SAAO,EAAE,SAAS,UAAA;AACpB;AAEA,SAAS,gBACP,OACA,OACuB;AACvB,QAAM,aAAa,IAAI,IAAsB,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,CAAA,CAAE,CAAC,CAAC;AAC/E,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,WAAW,IAAI,KAAK,IAAI;AACrC,UAAM,KAAK,WAAW,IAAI,KAAK,EAAE;AACjC,QAAI,CAAC,QAAQ,CAAC,IAAI;AAChB,YAAM,UAAU,OAAO,KAAK,KAAK,KAAK;AACtC,YAAM,IAAI,MAAM,wBAAwB,KAAK,EAAE,8BAA8B,OAAO,GAAG;AAAA,IACzF;AACA,SAAK,KAAK,KAAK,EAAE;AACjB,OAAG,KAAK,KAAK,IAAI;AAAA,EACnB;AACA,SAAO;AACT;AAcA,SAAS,aAAa,OAAe,OAAqC,GAA8B;AACtG,MAAI,MAAM,WAAW,EAAG,OAAM,IAAI,MAAM,mCAAmC,KAAK,WAAW,MAAM,MAAM,2CAA2C;AAClJ,SAAO,EAAE,KAAK,GAAG,KAAK,GAAG,UAAU,MAAM,EAAE,oBAAoB,QAAQ,GAAG,QAAQ,EAAE,oBAAoB,WAAW,KAAA;AACrH;AAQA,SAAS,WAAW,OAA2B,OAAqC,GAAkB,QAA6B;AACjI,MAAI,UAAU,UAAa,EAAE,UAAU,SAAS,KAAK,EAAG,QAAO,aAAa,OAAO,OAAO,CAAC;AAC3F,MAAI;AACJ,MAAI,QAAQ;AACV,UAAM,UAAU,MAAM,KAAK,CAAC,SAAS,CAAC,KAAK,OAAO;AAClD,QAAI,eAAe,IAAI,MAAM,gCAAgC,KAAK,6BAA6B,QAAQ,EAAE,GAAG;AAC5G,YAAQ,EAAE,KAAK,GAAG,KAAK,GAAG,UAAU,MAAM,EAAE,mBAAmB,QAAQ,EAAE,mBAAA;AAAA,EAC3E,OAAO;AACL,UAAM,UAAU,UAAU,UAAa,MAAM,MAAM,CAAC,SAAS,KAAK,YAAY,IAAI;AAClF,UAAM,WAAW,CAAC,SAA6B,KAAK,UAAU,EAAE,oBAAoB,EAAE;AACtF,YAAQ,EAAE,KAAK,UAAU,SAAY,IAAI,UAAU,EAAE,sBAAsB,EAAE,cAAc,KAAK,UAAU,EAAE,gBAAgB,EAAE,QAAQ,UAAU,QAAQ,EAAA;AAAA,EAC1J;AACA,QAAM,SAAS,MAAM,SAAS,IAAI,MAAM;AACxC,MAAI,UAAU,UAAa,MAAM,UAAU,qBAAqB;AAC9D,UAAM,UAAU,MAAM,OAAO,CAAC,KAAK,SAAS,MAAM,MAAM,SAAS,IAAI,GAAG,CAAC,KAAK,MAAM,SAAS,KAAK,MAAM;AACxG,WAAO,EAAE,GAAG,OAAO,QAAQ,SAAS,SAAS,WAAW,MAAA;AAAA,EAC1D;AACA,QAAM,OAAO,sBAAsB,KAAK,IAAI,GAAG,MAAM,IAAI,MAAM,QAAQ,CAAC,KAAK,sBAAsB,KAAK,MAAM;AAC9G,SAAO,EAAE,GAAG,OAAO,MAAM,QAAQ,SAAS,OAAO,4BAA4B,WAAW,MAAA;AAC1F;AAEA,SAAS,aAAa,QAAsC,GAA0B;AACpF,QAAM,2BAAW,IAAA;AACjB,aAAW,QAAQ,OAAQ,MAAK,IAAI,KAAK,OAAO,CAAC,GAAI,KAAK,IAAI,KAAK,KAAK,KAAK,CAAA,GAAK,IAAI,CAAC;AACvF,QAAM,UAAU,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,OAAO,KAAK,MAAM,MAAM,WAAW,OAAO,OAAO,GAAG,UAAU,UAAa,EAAE,QAAQ,SAAS,KAAK,CAAC,EAAE,QAAQ,CAAC;AACvJ,SAAO,WAAW,KAAK,OAAO,KAAK,EAAE;AACvC;AAGA,SAAS,YACP,QACA,WACA,QACY;AACZ,QAAM,2BAAW,IAAA;AACjB,SAAO,QAAQ,CAAC,MAAM,UAAU;AAC9B,UAAM,OAAO,QAAQ,WAAW,KAAK,OAAO,YAAY;AACxD,UAAM,QAAQ,EAAE,MAAM,OAAO,QAAQ,OAAO,IAAI,EAAA;AAChD,UAAM,MAAM,KAAK,IAAI,IAAI;AACzB,QAAI,KAAK;AACP,UAAI,KAAK,KAAK;AAAA,IAChB,OAAO;AACL,WAAK,IAAI,MAAM,CAAC,KAAK,CAAC;AAAA,IACxB;AAAA,EACF,CAAC;AACD,SAAO,CAAC,GAAG,KAAK,QAAA,CAAS,EACtB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,EACxB,IAAI,CAAC,CAAA,EAAG,GAAG,MAAM;;AAEhB,UAAM,QAAQ,IAAI,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,MAAM,IAAI;AACpG,WAAO,EAAE,QAAO,WAAM,CAAC,MAAP,mBAAU,OAAO,MAAA;AAAA,EACnC,CAAC;AACL;AAEA,SAAS,YACP,MACA,QACA,GACA,QACuB;AACvB,QAAM,QAA+B,CAAA;AACrC,MAAI,SAAS,OAAO;AACpB,aAAW,EAAE,OAAO,MAAA,KAAW,MAAM;AACnC,UAAM,SAAS,UAAU,UAAa,EAAE,QAAQ,SAAS,KAAK;AAC9D,UAAM,MAAM,WAAW,OAAO,OAAO,GAAG,MAAM;AAC9C,UAAM,QAAQ,SAAS,IAAI,MAAM,IAAI;AACrC,UAAM,OAAiB,CAAA;AACvB,QAAI,MAAM;AACV,eAAW,QAAQ,OAAO;AACxB,WAAK,KAAK,MAAM,KAAK;AACrB,aAAO,IAAI,KAAK,IAAI,EAAE,GAAG,OAAO,GAAG,GAAG,MAAM,IAAI,SAAS,IAAI,IAAI,GAAG;AACpE,aAAO,IAAI,SAAS,IAAI,IAAI,IAAI;AAAA,IAClC;AACA,QAAI,UAAU,QAAW;AACvB,YAAM,eAA8C,IAAI,SAAS,SAAY,SACzE,EAAE,SAAS,MAAM,IAAI,CAAC,SAAS,KAAK,EAAE,GAAG,MAAM,MAAM,qBAAqB,KAAK,OAAO,QAAQ,IAAI,MAAM,cAAc,2BAAA;AAC1H,YAAM,KAAK;AAAA,QACT,IAAI,GAAG,OAAO,KAAK,IAAI,KAAK;AAAA,QAC5B;AAAA,QACA,OAAO,OAAO;AAAA,QACd,GAAG,OAAO,IAAI,EAAE,YAAY,IAAI,IAAI;AAAA,QACpC,GAAG;AAAA,QACH,OAAO,EAAE,YAAY,IAAI,IAAI;AAAA,QAC7B,QAAQ,IAAI;AAAA,QACZ;AAAA,QACA,cAAc,IAAI,YAAY,EAAE,qBAAqB,IAAI;AAAA,QACzD,GAAI,eAAe,EAAE,QAAQ,aAAA,IAAiB,CAAA;AAAA,QAC9C,GAAI,IAAI,YAAY,EAAE,WAAW,KAAA,IAAkB,CAAA;AAAA,MAAC,CACrD;AAAA,IACH;AACA,cAAU,IAAI,SAAS,EAAE;AAAA,EAC3B;AACA,SAAO;AACT;AAEA,SAAS,MAAM,KAAwB,QAA0D;AAC/F,MAAI,IAAI,WAAW,EAAG,QAAO,OAAO;AACpC,SAAO,IAAI,OAAO,CAAC,KAAK,OAAO,MAAM,QAAQ,QAAQ,IAAI,UAAU,EAAE,GAAG,CAAC,IAAI,IAAI;AACnF;AAOA,SAAS,eAAe,QAA6E;AACnG,QAAM,SAAS,OAAO,OAAO,CAAC,MAAM,UAAW,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,IAAI,IAAI,QAAQ,IAAK;AAC/F,QAAM,UAAU,CAAC,SACf,KAAK,IAAI,CAAC,OAAO,UAA4B,CAAC,OAAO,KAAK,QAAQ,CAAC,KAAK,MAAM,CAAC;AACjF,SAAO;AAAA,IACL,CAAC,QAAQ,MAAS;AAAA,IAClB,GAAG,QAAQ,OAAO,OAAO,CAAC,UAAU,QAAQ,MAAM,CAAC;AAAA,IACnD,GAAG,QAAQ,OAAO,OAAO,CAAC,UAAU,QAAQ,MAAM,EAAE,QAAA,CAAS;AAAA,EAAA;AAEjE;AAGA,SAAS,YAAY,OAAe,YAA+B,KAAqB,MAAyB;AAC/G,QAAM,OAAO;AAAA,IAAY,QAAQ,KAAK,OAAO,OAAO,QAAQ;AAAA,IAAG,IAAI;AAAA,IAAW,CAAC,SAC7E;AAAA,MACE,QAAQ,IAAI,YAAY,KAAK,IAAI,YAAY,EAAE;AAAA,QAAO,CAAC,OACrD,WAAW,SAAS,QAAQ,IAAI,SAAS,IAAI,OAAO,CAAC;AAAA,MAAA;AAAA,MAEvD,KAAK;AAAA,IAAA;AAAA,EACP;AAEF,OAAK,MAAM;AAAA,IACT;AAAA,IACA,KAAK,QAAQ,CAAC,QAAQ,IAAI,KAAK;AAAA,EAAA;AAEjC,OAAK,MAAM,IAAI,OAAO,YAAY,MAAM,IAAI,OAAO,KAAK,GAAG,IAAI,GAAG,KAAK,MAAM,CAAC;AAChF;AAGA,SAAS,eAAe,KAAqB,QAA0D;AACrG,QAAM,4BAAY,IAAA;AAClB,aAAW,QAAQ,IAAI,OAAO;AAC5B,UAAM,SAAS,CAAC,QAAQ,IAAI,SAAS,KAAK,MAAM,OAAO,GAAG,QAAQ,IAAI,SAAS,KAAK,IAAI,OAAO,CAAC;AAChG,UAAM,CAAC,OAAO,KAAK,IAAI,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,MAAM,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,KAAK,IAAI;AACzF,UAAM,QAAQ,IAAI,OAAO,QAAQ,KAAK,IAAI,GAAG,MAAM,CAAC;AACpD,QAAI,OAAO,CAAC,MAAM,OAAO,CAAC,KAAK,IAAI,OAAO,QAAQ,CAAC,MAAM,KAAK,IAAI,GAAG,MAAM,EAAG;AAC9E,UAAM,OAAyB,CAAC,QAAQ,QAAQ,OAAO,UAAU,EAAE,GAAG,QAAQ,QAAQ,OAAO,UAAU,EAAE,CAAC;AAC1G,UAAM,IAAI,OAAO,CAAC,GAAI,MAAM,IAAI,KAAK,KAAK,IAAK,IAAI,CAAC;AAAA,EACtD;AACA,MAAI,YAAY;AAChB,aAAW,OAAO,MAAM,UAAU;AAChC,QAAI,QAAQ,CAAC,GAAG,UAAU;AACxB,mBAAa,IAAI,MAAM,QAAQ,CAAC,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE;AAAA,IACrF,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAGA,SAAS,MAAM,MAAmB,UAA6B,KAAkC;AAC/F,QAAM,OAAoB,EAAE,OAAO,IAAI,IAAI,KAAK,KAAK,GAAG,QAAQ,IAAI,IAAI,KAAK,MAAM,GAAG,OAAO,IAAI,IAAI,KAAK,KAAK,EAAA;AAC/G,aAAW,SAAS,UAAU;AAC5B,UAAM,QAAQ,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,WAAW,CAAC,IAAI,OAAO,QAAQ,CAAC,GAAG,IAAI,OAAO,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,UAA2B,UAAU,MAAS;AACtH,gBAAY,OAAO,UAAU,KAAK,IAAI;AAAA,EACxC;AACA,SAAO;AACT;AASA,SAAS,QAAQ,SAAmD,KAAkC;AACpG,MAAI,UAAuB,EAAE,OAAO,IAAI,IAAI,OAAO,GAAG,QAAQ,oBAAI,IAAA,GAAO,OAAO,oBAAI,MAAI;AACxF,aAAW,CAAC,OAAO,SAAS,KAAK,eAAe,IAAI,MAAM,GAAG;AAC3D,gBAAY,OAAO,cAAc,SAAY,CAAA,IAAK,CAAC,SAAS,GAAG,KAAK,OAAO;AAAA,EAC7E;AACA,MAAI,OAAO;AACX,MAAI,SAAS,eAAe,KAAK,KAAK,MAAM;AAC5C,WAAS,OAAO,GAAG,OAAO,IAAI,EAAE,UAAU,SAAS,GAAG,QAAQ;AAC5D,cAAU,MAAM,SAAS,OAAO,MAAM,IAAI,CAAC,GAAG,IAAI,MAAM,EAAE,QAAA,IAAY,IAAI,QAAQ,GAAG;AACrF,UAAM,YAAY,eAAe,KAAK,QAAQ,MAAM;AACpD,QAAI,YAAY,QAAQ;AACtB,aAAO;AACP,eAAS;AAAA,IACX;AAAA,EACF;AACA,SAAO;AACT;AAgBO,SAAS,cACd,OACA,OACA,UAAgC,CAAA,GACX;AACrB,QAAM,IAAI,cAAc,OAAO;AAC/B,QAAM,EAAE,SAAS,cAAc,aAAa,KAAK;AACjD,QAAM,aAAa,gBAAgB,OAAO,KAAK;AAC/C,QAAM,SAAS,CAAC,GAAG,QAAQ,KAAA,CAAM,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AACvD,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO,EAAE,OAAO,IAAI,EAAE,SAAS,QAAQ,IAAI,EAAE,SAAS,WAAW,CAAA,GAAI,QAAQ,CAAA,EAAC;AAAA,EAChF;AAEA,QAAM,WAAW,KAAK,IAAI,GAAG,MAAM;AACnC,QAAM,UAAU,KAAK,IAAI,GAAG,CAAC,GAAG,QAAQ,OAAA,CAAQ,EAAE,IAAI,CAAC,WAAW,aAAa,QAAQ,CAAC,CAAC,CAAC;AAC1F,QAAM,QAAQ,EAAE,WAAW,MAAM,KAAK,CAAC,SAAS,KAAK,UAAU,MAAS,IAAI,EAAE,eAAe;AAC7F,QAAM,EAAE,QAAQ,UAAU,QAAQ,SAAS;AAAA,IACzC;AAAA,IACA;AAAA,IACA,SAAS,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC;AAAA,IAC3D;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ,CAAC,WAAW;AAAA,MAClB,GAAG,QAAQ,EAAE,YAAY,KAAK,QAAQ,aAAa,EAAE,YAAY,EAAE;AAAA,MACnE,KAAK,EAAE,WAAW,UAAU,aAAa,QAAQ,SAAS,OAAO,QAAQ,GAAG,CAAC,KAAK;AAAA,MAClF;AAAA,IAAA;AAAA,EACF,CACD;AAED,QAAM,cAAc,OAAO,YAAY,MAAM,OAAO,CAAC,SAAS,KAAK,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,EAAE,iBAAiB,CAAC,CAAC;AACzH,QAAM,OAAO,aAAa,OAAO,OAAO,YAAY,MAAM,GAAG,EAAE,GAAG,GAAG,aAAa;AAClF,QAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,IAAI,aAAa,EAAE,YAAY,EAAE,aAAa,EAAE;AAChF,SAAO;AAAA,IACL,OAAO,KAAK,OAAO,IAAI,QAAQ,OAAO,KAAK;AAAA,IAC3C,QAAQ,UAAU,IAAI,EAAE;AAAA,IACxB,WAAW,OAAO,YAAY,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,KAAK,MAAM,EAAA,CAAG,CAAC,CAAC;AAAA,IAChG,QAAQ,CAAC,GAAG,MAAM,QAAQ,EACvB,KAAA,EACA,IAAI,CAAC,SAAS,EAAE,GAAG,KAAK,GAAG,IAAI,IAAI,KAAK,KAAA,EAAO,EAC/C,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AAAA,EAAA;AAEpD;"}

package/dist/data/graph-diagram-model.cjs

@@ -1,5 +1,9 @@
 "use strict";
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function groupName(group, id) {
+  if ((group == null ? void 0 : group.title) !== void 0) return group.title;
+  return typeof (group == null ? void 0 : group.label) === "string" ? group.label : id;
+}
 const DENSE_EDGE_COUNT = 32;
 function edgeFocusOn(mode, edgeCount) {
   return mode === "on" || mode === "auto" && edgeCount > DENSE_EDGE_COUNT;
@@ -67,6 +71,7 @@ exports.edgeFocusOn = edgeFocusOn;
 exports.edgeLabelWidth = edgeLabelWidth;
 exports.edgeName = edgeName;
 exports.focusedEdgeIds = focusedEdgeIds;
+exports.groupName = groupName;
 exports.hoverHandlers = hoverHandlers;
 exports.nodeName = nodeName;
 exports.requireEntry = requireEntry;