@zukhruf/diagram 0.3.32 → 0.3.34

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

@@ -0,0 +1,276 @@
+import { attachConnections } from "./attach.js";
+import { graphConnections } from "./connections.js";
+import { tagPosition } from "./labels.js";
+import { measureEdgeTags } from "./measure.js";
+import { simplifyPath } from "./path.js";
+import { searchRoute } from "./route-search.js";
+import { OPPOSITE, OUTWARD } from "./sides.js";
+import { LAYOUT_TOKENS } from "./tokens.js";
+
+/** How far around the content a route may detour. */
+const ROUTING_MARGIN = 64;
+/** How far a route keeps from a node that it does not connect. */
+const NODE_CLEARANCE = 8;
+
+/** The routes, before the layout rounds them and draws their paths. */
+
+/**
+ * Routes every edge and note leader orthogonally, nearest cells first, and
+ * places each edge's label and badge before the next edge routes around
+ * them. A connection with no route takes its next choice of sides, and
+ * everything routes again. It throws when a connection has no choice left,
+ * or a label has no room; it never draws a diagonal or straight line
+ * through what is in the way.
+ */
+export function routeGraph(ir, nodes, groups, areas, /** How far beyond the bounding box of its two shapes a route first searches. */
+searchMargin) {
+  const candidates = graphConnections(ir, nodes, groups, areas);
+  const choices = candidates.map(() => 0);
+  for (;;) {
+    const routed = routeConnections(ir, candidates.map((options, index) => options[choices[index]]), nodes, groups, searchMargin);
+    if (!('unrouted' in routed)) return routed;
+    const options = candidates[routed.unrouted];
+    const next = choices[routed.unrouted] + 1;
+    if (next === options.length) throw noRoute(options[0]);
+    choices[routed.unrouted] = next;
+  }
+}
+
+/**
+ * Routes one choice of sides for every connection, or names the first
+ * connection, in routing order, that has no route.
+ */
+function routeConnections(ir, connections, nodes, groups, searchMargin) {
+  if (connections.length === 0) return {
+    edges: [],
+    leaders: []
+  };
+  const groupLabels = groups.flatMap(({
+    group,
+    label
+  }) => label.map(run => ({
+    group: group.id,
+    box: inflate(run.bounds, LAYOUT_TOKENS.LABEL_GAP)
+  })));
+  const attachments = attachConnections(connections, groupLabels);
+  const content = union([...nodes.map(nodeLayout => nodeLayout.visual), ...groups.map(groupLayout => groupLayout.rect)]);
+  const bounds = inflate(content, ROUTING_MARGIN);
+  const solid = nodes.filter(({
+    box
+  }) => box.w > 0 && box.h > 0);
+  const routed = [];
+  const tags = [];
+  const paths = new Map();
+  const labels = new Map();
+  const order = connections.map((connection, index) => ({
+    connection,
+    index
+  })).sort((a, b) => Number(a.connection.edge === undefined) - Number(b.connection.edge === undefined) || a.connection.cellDistance - b.connection.cellDistance || a.index - b.index);
+  for (const {
+    connection,
+    index
+  } of order) {
+    const {
+      from,
+      to
+    } = connection;
+    const ends = new Set([from.shape.id, to.shape.id]);
+    const junctions = new Set([from, to].filter(end => end.shape.kind === 'junction').map(end => end.shape.id));
+    const walls = [...solid.flatMap(({
+      node,
+      box,
+      visual,
+      frames,
+      caption
+    }) => {
+      if (!ends.has(node.id)) return [inflate(visual, NODE_CLEARANCE)];
+      if (node.kind === 'junction') return [];
+      // Its own parts, not their bounding box: a caption wider than the frame leaves room beside the frame.
+      return [box, ...frames, ...(caption ? [caption.box] : [])];
+    }), ...groupLabels.flatMap(({
+      group,
+      box
+    }) => ends.has(group) ? [] : [box]), ...tags.map(tag => inflate(tag, LAYOUT_TOKENS.LABEL_GAP))];
+    const runs = routed.filter(route => !overlaps(route.junctions, junctions)).flatMap(route => segments(route.points));
+    const {
+      start,
+      startStub,
+      end,
+      endStub
+    } = attachments[index];
+    const stubs = [[start, startStub], [endStub, end]];
+    const stubsClear = stubs.every(([a, b]) => walls.every(wall => !crosses(a, b, wall)));
+    const search = window => searchRoute({
+      window,
+      lines: {
+        x: [startStub.x, endStub.x],
+        y: [startStub.y, endStub.y]
+      },
+      walls,
+      runs,
+      borders: groups.flatMap(({
+        rect,
+        band
+      }) => band ? [rect, band] : [rect]),
+      start: startStub,
+      startHeading: OUTWARD[from.side],
+      goal: endStub,
+      goalHeading: OUTWARD[OPPOSITE[to.side]]
+    });
+    const near = intersection(inflate(union([from.shape.box, to.shape.box, spanOf(startStub, endStub)]), searchMargin), bounds);
+    const found = stubsClear ? search(near) ?? search(bounds) : undefined;
+    if (!found) return {
+      unrouted: index
+    };
+    const points = simplifyPath([start, ...found, end]);
+    paths.set(connection, points);
+    if (connection.edge !== undefined) {
+      const edge = ir.edges[connection.edge];
+      const isFree = (box, ownSegments) => solid.every(({
+        visual
+      }) => !intersects(box, visual)) && groups.every(({
+        rect,
+        band,
+        label
+      }) => !(band && intersects(box, band)) && label.every(run => !intersects(box, run.bounds)) && !(intersects(box, rect) && !contains(rect, box))) && tags.every(tag => !intersects(box, tag)) && [...routed.flatMap(route => segments(route.points)), ...(ownSegments ? segments(points) : [])].every(([a, b]) => !crosses(a, b, box));
+      const measured = measureEdgeTags(edge);
+      const {
+        label,
+        badge
+      } = measured;
+      const placed = {};
+      if (label || badge) {
+        const boxes = tagPosition(measured, points, (candidate, kind) => isFree(candidate, kind === 'label'));
+        if (!boxes) {
+          const named = [];
+          if (label) {
+            named.push(`label "${edge.label.join(' / ')}" (${Math.ceil(label.w)}×${Math.ceil(label.h)})`);
+          }
+          if (badge) {
+            named.push(`badge "${(edge.badgeLabel ?? []).join(' / ')}" (${Math.ceil(badge.w)}×${Math.ceil(badge.h)})`);
+          }
+          throw new Error(`Diagram ${connection.name}: ${named.join(' and ')} ${named.length > 1 ? 'have' : 'has'} no free position ${badge ? 'on' : 'beside'} its route.`);
+        }
+        if (label && boxes.label) {
+          placed.label = {
+            box: boxes.label,
+            text: label.place(boxes.label)
+          };
+          tags.push(boxes.label);
+        }
+        if (badge && boxes.badge) {
+          placed.badge = {
+            box: boxes.badge,
+            ...badge.place(boxes.badge)
+          };
+          tags.push(boxes.badge);
+        }
+      }
+      labels.set(connection, placed);
+    }
+    routed.push({
+      points,
+      junctions
+    });
+  }
+  const edges = [];
+  const leaders = [];
+  for (const connection of connections) {
+    const points = paths.get(connection);
+    if (connection.edge === undefined) {
+      leaders.push({
+        note: connection.from.shape.id,
+        target: connection.to.shape.id,
+        points
+      });
+      continue;
+    }
+    edges.push({
+      edge: ir.edges[connection.edge],
+      exitSide: connection.from.side,
+      entrySide: connection.to.side,
+      points,
+      ...labels.get(connection)
+    });
+  }
+  return {
+    edges,
+    leaders
+  };
+}
+function noRoute({
+  name,
+  edge,
+  from,
+  to
+}) {
+  const advice = edge === undefined ? 'Move the note or its target.' : 'Change exitSide/entrySide or move a node.';
+  return new Error(`Diagram ${name}: no orthogonal route from ${endName(from)} to ${endName(to)} avoids the nodes and labels. ${advice}`);
+}
+function endName({
+  shape,
+  side,
+  port
+}) {
+  if (port) return `port "${shape.id}:${port.id}"`;
+  if (shape.kind === 'junction') return `the centre of "${shape.id}"`;
+  return `${side} of "${shape.id}"`;
+}
+function segments(points) {
+  return points.slice(1).map((point, index) => [points[index], point]);
+}
+function overlaps(a, b) {
+  for (const id of a) if (b.has(id)) return true;
+  return false;
+}
+function spanOf(a, b) {
+  return {
+    x: Math.min(a.x, b.x),
+    y: Math.min(a.y, b.y),
+    w: Math.abs(a.x - b.x),
+    h: Math.abs(a.y - b.y)
+  };
+}
+
+/** Whether the segment enters the box's interior, not only its border. */
+function crosses(a, b, box) {
+  const span = spanOf(a, b);
+  return span.x + span.w > box.x && span.x < box.x + box.w && span.y + span.h > box.y && span.y < box.y + box.h;
+}
+function intersects(a, b) {
+  return a.x < b.x + b.w && b.x < a.x + a.w && a.y < b.y + b.h && b.y < a.y + a.h;
+}
+function contains(outer, inner) {
+  return inner.x >= outer.x && inner.y >= outer.y && inner.x + inner.w <= outer.x + outer.w && inner.y + inner.h <= outer.y + outer.h;
+}
+function inflate(box, by) {
+  return {
+    x: box.x - by,
+    y: box.y - by,
+    w: box.w + 2 * by,
+    h: box.h + 2 * by
+  };
+}
+function intersection(a, b) {
+  const x = Math.max(a.x, b.x);
+  const y = Math.max(a.y, b.y);
+  return {
+    x,
+    y,
+    w: Math.min(a.x + a.w, b.x + b.w) - x,
+    h: Math.min(a.y + a.h, b.y + b.h) - y
+  };
+}
+function union(boxes) {
+  const left = Math.min(...boxes.map(box => box.x));
+  const top = Math.min(...boxes.map(box => box.y));
+  const right = Math.max(...boxes.map(box => box.x + box.w));
+  const bottom = Math.max(...boxes.map(box => box.y + box.h));
+  return {
+    x: left,
+    y: top,
+    w: right - left,
+    h: bottom - top
+  };
+}
+//# sourceMappingURL=route.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"route.js","names":["attachConnections","graphConnections","tagPosition","measureEdgeTags","simplifyPath","searchRoute","OPPOSITE","OUTWARD","LAYOUT_TOKENS","ROUTING_MARGIN","NODE_CLEARANCE","routeGraph","ir","nodes","groups","areas","searchMargin","candidates","choices","map","routed","routeConnections","options","index","unrouted","next","length","noRoute","connections","edges","leaders","groupLabels","flatMap","group","label","run","id","box","inflate","bounds","LABEL_GAP","attachments","content","union","nodeLayout","visual","groupLayout","rect","solid","filter","w","h","tags","paths","Map","labels","order","connection","sort","a","b","Number","edge","undefined","cellDistance","from","to","ends","Set","shape","junctions","end","kind","walls","node","frames","caption","has","tag","runs","route","overlaps","segments","points","start","startStub","endStub","stubs","stubsClear","every","wall","crosses","search","window","lines","x","y","borders","band","startHeading","side","goal","goalHeading","near","intersection","spanOf","found","set","isFree","ownSegments","intersects","contains","measured","badge","placed","boxes","candidate","named","push","join","Math","ceil","badgeLabel","Error","name","text","place","get","note","target","exitSide","entrySide","advice","endName","port","slice","point","min","abs","span","outer","inner","by","max","left","top","right","bottom"],"sources":["../../../../src/lib/layouts/graph/route.ts"],"sourcesContent":["import type { Box, DiagramGraphIR, Point } from '../../model/diagram-ir.ts';\nimport type { GridAreas } from './areas.ts';\nimport { attachConnections } from './attach.ts';\nimport {\n  type Connection,\n  type ConnectionEnd,\n  graphConnections,\n} from './connections.ts';\nimport type {\n  EdgeLayout,\n  GroupLayout,\n  LeaderLayout,\n  NodeLayout,\n} from './graph-layout-result.ts';\nimport { tagPosition } from './labels.ts';\nimport { measureEdgeTags } from './measure.ts';\nimport { simplifyPath } from './path.ts';\nimport { searchRoute } from './route-search.ts';\nimport { OPPOSITE, OUTWARD } from './sides.ts';\nimport { LAYOUT_TOKENS } from './tokens.ts';\n\n/** How far around the content a route may detour. */\nconst ROUTING_MARGIN = 64;\n/** How far a route keeps from a node that it does not connect. */\nconst NODE_CLEARANCE = 8;\n\n/** The routes, before the layout rounds them and draws their paths. */\nexport type RoutedGraph = {\n  edges: Omit<EdgeLayout, 'd'>[];\n  leaders: Omit<LeaderLayout, 'd'>[];\n};\n\ntype Routed = {\n  points: Point[];\n  /** The junctions the route ends at: routes that share one may run together into it. */\n  junctions: Set<string>;\n};\n\n/**\n * Routes every edge and note leader orthogonally, nearest cells first, and\n * places each edge's label and badge before the next edge routes around\n * them. A connection with no route takes its next choice of sides, and\n * everything routes again. It throws when a connection has no choice left,\n * or a label has no room; it never draws a diagonal or straight line\n * through what is in the way.\n */\nexport function routeGraph(\n  ir: DiagramGraphIR,\n  nodes: NodeLayout[],\n  groups: GroupLayout[],\n  areas: GridAreas,\n  /** How far beyond the bounding box of its two shapes a route first searches. */\n  searchMargin: number,\n): RoutedGraph {\n  const candidates = graphConnections(ir, nodes, groups, areas);\n  const choices = candidates.map(() => 0);\n  for (;;) {\n    const routed = routeConnections(\n      ir,\n      candidates.map((options, index) => options[choices[index]!]!),\n      nodes,\n      groups,\n      searchMargin,\n    );\n    if (!('unrouted' in routed)) return routed;\n    const options = candidates[routed.unrouted]!;\n    const next = choices[routed.unrouted]! + 1;\n    if (next === options.length) throw noRoute(options[0]!);\n    choices[routed.unrouted] = next;\n  }\n}\n\n/**\n * Routes one choice of sides for every connection, or names the first\n * connection, in routing order, that has no route.\n */\nfunction routeConnections(\n  ir: DiagramGraphIR,\n  connections: Connection[],\n  nodes: NodeLayout[],\n  groups: GroupLayout[],\n  searchMargin: number,\n): RoutedGraph | { unrouted: number } {\n  if (connections.length === 0) return { edges: [], leaders: [] };\n  const groupLabels = groups.flatMap(({ group, label }) =>\n    label.map((run) => ({\n      group: group.id,\n      box: inflate(run.bounds, LAYOUT_TOKENS.LABEL_GAP),\n    })),\n  );\n  const attachments = attachConnections(connections, groupLabels);\n  const content = union([\n    ...nodes.map((nodeLayout) => nodeLayout.visual),\n    ...groups.map((groupLayout) => groupLayout.rect),\n  ]);\n  const bounds = inflate(content, ROUTING_MARGIN);\n  const solid = nodes.filter(({ box }) => box.w > 0 && box.h > 0);\n\n  const routed: Routed[] = [];\n  const tags: Box[] = [];\n  const paths = new Map<Connection, Point[]>();\n  const labels = new Map<Connection, Pick<EdgeLayout, 'label' | 'badge'>>();\n\n  const order = connections\n    .map((connection, index) => ({ connection, index }))\n    .sort(\n      (a, b) =>\n        Number(a.connection.edge === undefined) -\n          Number(b.connection.edge === undefined) ||\n        a.connection.cellDistance - b.connection.cellDistance ||\n        a.index - b.index,\n    );\n\n  for (const { connection, index } of order) {\n    const { from, to } = connection;\n    const ends = new Set([from.shape.id, to.shape.id]);\n    const junctions = new Set(\n      [from, to]\n        .filter((end) => end.shape.kind === 'junction')\n        .map((end) => end.shape.id),\n    );\n    const walls = [\n      ...solid.flatMap(({ node, box, visual, frames, caption }) => {\n        if (!ends.has(node.id)) return [inflate(visual, NODE_CLEARANCE)];\n        if (node.kind === 'junction') return [];\n        // Its own parts, not their bounding box: a caption wider than the frame leaves room beside the frame.\n        return [box, ...frames, ...(caption ? [caption.box] : [])];\n      }),\n      ...groupLabels.flatMap(({ group, box }) =>\n        ends.has(group) ? [] : [box],\n      ),\n      ...tags.map((tag) => inflate(tag, LAYOUT_TOKENS.LABEL_GAP)),\n    ];\n    const runs = routed\n      .filter((route) => !overlaps(route.junctions, junctions))\n      .flatMap((route) => segments(route.points));\n    const { start, startStub, end, endStub } = attachments[index]!;\n    const stubs: [Point, Point][] = [\n      [start, startStub],\n      [endStub, end],\n    ];\n    const stubsClear = stubs.every(([a, b]) =>\n      walls.every((wall) => !crosses(a, b, wall)),\n    );\n\n    const search = (window: Box): Point[] | undefined =>\n      searchRoute({\n        window,\n        lines: {\n          x: [startStub.x, endStub.x],\n          y: [startStub.y, endStub.y],\n        },\n        walls,\n        runs,\n        borders: groups.flatMap(({ rect, band }) =>\n          band ? [rect, band] : [rect],\n        ),\n        start: startStub,\n        startHeading: OUTWARD[from.side],\n        goal: endStub,\n        goalHeading: OUTWARD[OPPOSITE[to.side]],\n      });\n    const near = intersection(\n      inflate(\n        union([from.shape.box, to.shape.box, spanOf(startStub, endStub)]),\n        searchMargin,\n      ),\n      bounds,\n    );\n    const found = stubsClear ? (search(near) ?? search(bounds)) : undefined;\n    if (!found) return { unrouted: index };\n    const points = simplifyPath([start, ...found, end]);\n    paths.set(connection, points);\n\n    if (connection.edge !== undefined) {\n      const edge = ir.edges[connection.edge]!;\n      const isFree = (box: Box, ownSegments: boolean) =>\n        solid.every(({ visual }) => !intersects(box, visual)) &&\n        groups.every(\n          ({ rect, band, label }) =>\n            !(band && intersects(box, band)) &&\n            label.every((run) => !intersects(box, run.bounds)) &&\n            !(intersects(box, rect) && !contains(rect, box)),\n        ) &&\n        tags.every((tag) => !intersects(box, tag)) &&\n        [\n          ...routed.flatMap((route) => segments(route.points)),\n          ...(ownSegments ? segments(points) : []),\n        ].every(([a, b]) => !crosses(a, b, box));\n      const measured = measureEdgeTags(edge);\n      const { label, badge } = measured;\n      const placed: Pick<EdgeLayout, 'label' | 'badge'> = {};\n      if (label || badge) {\n        const boxes = tagPosition(measured, points, (candidate, kind) =>\n          isFree(candidate, kind === 'label'),\n        );\n        if (!boxes) {\n          const named: string[] = [];\n          if (label) {\n            named.push(\n              `label \"${edge.label!.join(' / ')}\" (${Math.ceil(label.w)}×${Math.ceil(label.h)})`,\n            );\n          }\n          if (badge) {\n            named.push(\n              `badge \"${(edge.badgeLabel ?? []).join(' / ')}\" (${Math.ceil(badge.w)}×${Math.ceil(badge.h)})`,\n            );\n          }\n          throw new Error(\n            `Diagram ${connection.name}: ${named.join(' and ')} ${named.length > 1 ? 'have' : 'has'} no free position ${badge ? 'on' : 'beside'} its route.`,\n          );\n        }\n        if (label && boxes.label) {\n          placed.label = { box: boxes.label, text: label.place(boxes.label) };\n          tags.push(boxes.label);\n        }\n        if (badge && boxes.badge) {\n          placed.badge = { box: boxes.badge, ...badge.place(boxes.badge) };\n          tags.push(boxes.badge);\n        }\n      }\n      labels.set(connection, placed);\n    }\n    routed.push({ points, junctions });\n  }\n\n  const edges: RoutedGraph['edges'] = [];\n  const leaders: RoutedGraph['leaders'] = [];\n  for (const connection of connections) {\n    const points = paths.get(connection)!;\n    if (connection.edge === undefined) {\n      leaders.push({\n        note: connection.from.shape.id,\n        target: connection.to.shape.id,\n        points,\n      });\n      continue;\n    }\n    edges.push({\n      edge: ir.edges[connection.edge]!,\n      exitSide: connection.from.side,\n      entrySide: connection.to.side,\n      points,\n      ...labels.get(connection),\n    });\n  }\n  return { edges, leaders };\n}\n\nfunction noRoute({ name, edge, from, to }: Connection): Error {\n  const advice =\n    edge === undefined\n      ? 'Move the note or its target.'\n      : 'Change exitSide/entrySide or move a node.';\n  return new Error(\n    `Diagram ${name}: no orthogonal route from ${endName(from)} to ${endName(to)} avoids the nodes and labels. ${advice}`,\n  );\n}\n\nfunction endName({ shape, side, port }: ConnectionEnd): string {\n  if (port) return `port \"${shape.id}:${port.id}\"`;\n  if (shape.kind === 'junction') return `the centre of \"${shape.id}\"`;\n  return `${side} of \"${shape.id}\"`;\n}\n\nfunction segments(points: Point[]): [Point, Point][] {\n  return points.slice(1).map((point, index) => [points[index]!, point]);\n}\n\nfunction overlaps(a: Set<string>, b: Set<string>): boolean {\n  for (const id of a) if (b.has(id)) return true;\n  return false;\n}\n\nfunction spanOf(a: Point, b: Point): Box {\n  return {\n    x: Math.min(a.x, b.x),\n    y: Math.min(a.y, b.y),\n    w: Math.abs(a.x - b.x),\n    h: Math.abs(a.y - b.y),\n  };\n}\n\n/** Whether the segment enters the box's interior, not only its border. */\nfunction crosses(a: Point, b: Point, box: Box): boolean {\n  const span = spanOf(a, b);\n  return (\n    span.x + span.w > box.x &&\n    span.x < box.x + box.w &&\n    span.y + span.h > box.y &&\n    span.y < box.y + box.h\n  );\n}\n\nfunction intersects(a: Box, b: Box): boolean {\n  return (\n    a.x < b.x + b.w && b.x < a.x + a.w && a.y < b.y + b.h && b.y < a.y + a.h\n  );\n}\n\nfunction contains(outer: Box, inner: Box): boolean {\n  return (\n    inner.x >= outer.x &&\n    inner.y >= outer.y &&\n    inner.x + inner.w <= outer.x + outer.w &&\n    inner.y + inner.h <= outer.y + outer.h\n  );\n}\n\nfunction inflate(box: Box, by: number): Box {\n  return { x: box.x - by, y: box.y - by, w: box.w + 2 * by, h: box.h + 2 * by };\n}\n\nfunction intersection(a: Box, b: Box): Box {\n  const x = Math.max(a.x, b.x);\n  const y = Math.max(a.y, b.y);\n  return {\n    x,\n    y,\n    w: Math.min(a.x + a.w, b.x + b.w) - x,\n    h: Math.min(a.y + a.h, b.y + b.h) - y,\n  };\n}\n\nfunction union(boxes: Box[]): Box {\n  const left = Math.min(...boxes.map((box) => box.x));\n  const top = Math.min(...boxes.map((box) => box.y));\n  const right = Math.max(...boxes.map((box) => box.x + box.w));\n  const bottom = Math.max(...boxes.map((box) => box.y + box.h));\n  return { x: left, y: top, w: right - left, h: bottom - top };\n}\n"],"mappings":"AAEA,SAASA,iBAAiB,QAAQ,aAAa;AAC/C,SAGEC,gBAAgB,QACX,kBAAkB;AAOzB,SAASC,WAAW,QAAQ,aAAa;AACzC,SAASC,eAAe,QAAQ,cAAc;AAC9C,SAASC,YAAY,QAAQ,WAAW;AACxC,SAASC,WAAW,QAAQ,mBAAmB;AAC/C,SAASC,QAAQ,EAAEC,OAAO,QAAQ,YAAY;AAC9C,SAASC,aAAa,QAAQ,aAAa;;AAE3C;AACA,MAAMC,cAAc,GAAG,EAAE;AACzB;AACA,MAAMC,cAAc,GAAG,CAAC;;AAExB;;AAYA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,UAAUA,CACxBC,EAAkB,EAClBC,KAAmB,EACnBC,MAAqB,EACrBC,KAAgB,EAChB;AACAC,YAAoB,EACP;EACb,MAAMC,UAAU,GAAGhB,gBAAgB,CAACW,EAAE,EAAEC,KAAK,EAAEC,MAAM,EAAEC,KAAK,CAAC;EAC7D,MAAMG,OAAO,GAAGD,UAAU,CAACE,GAAG,CAAC,MAAM,CAAC,CAAC;EACvC,SAAS;IACP,MAAMC,MAAM,GAAGC,gBAAgB,CAC7BT,EAAE,EACFK,UAAU,CAACE,GAAG,CAAC,CAACG,OAAO,EAAEC,KAAK,KAAKD,OAAO,CAACJ,OAAO,CAACK,KAAK,CAAC,CAAG,CAAC,EAC7DV,KAAK,EACLC,MAAM,EACNE,YACF,CAAC;IACD,IAAI,EAAE,UAAU,IAAII,MAAM,CAAC,EAAE,OAAOA,MAAM;IAC1C,MAAME,OAAO,GAAGL,UAAU,CAACG,MAAM,CAACI,QAAQ,CAAE;IAC5C,MAAMC,IAAI,GAAGP,OAAO,CAACE,MAAM,CAACI,QAAQ,CAAC,GAAI,CAAC;IAC1C,IAAIC,IAAI,KAAKH,OAAO,CAACI,MAAM,EAAE,MAAMC,OAAO,CAACL,OAAO,CAAC,CAAC,CAAE,CAAC;IACvDJ,OAAO,CAACE,MAAM,CAACI,QAAQ,CAAC,GAAGC,IAAI;EACjC;AACF;;AAEA;AACA;AACA;AACA;AACA,SAASJ,gBAAgBA,CACvBT,EAAkB,EAClBgB,WAAyB,EACzBf,KAAmB,EACnBC,MAAqB,EACrBE,YAAoB,EACgB;EACpC,IAAIY,WAAW,CAACF,MAAM,KAAK,CAAC,EAAE,OAAO;IAAEG,KAAK,EAAE,EAAE;IAAEC,OAAO,EAAE;EAAG,CAAC;EAC/D,MAAMC,WAAW,GAAGjB,MAAM,CAACkB,OAAO,CAAC,CAAC;IAAEC,KAAK;IAAEC;EAAM,CAAC,KAClDA,KAAK,CAACf,GAAG,CAAEgB,GAAG,KAAM;IAClBF,KAAK,EAAEA,KAAK,CAACG,EAAE;IACfC,GAAG,EAAEC,OAAO,CAACH,GAAG,CAACI,MAAM,EAAE/B,aAAa,CAACgC,SAAS;EAClD,CAAC,CAAC,CACJ,CAAC;EACD,MAAMC,WAAW,GAAGzC,iBAAiB,CAAC4B,WAAW,EAAEG,WAAW,CAAC;EAC/D,MAAMW,OAAO,GAAGC,KAAK,CAAC,CACpB,GAAG9B,KAAK,CAACM,GAAG,CAAEyB,UAAU,IAAKA,UAAU,CAACC,MAAM,CAAC,EAC/C,GAAG/B,MAAM,CAACK,GAAG,CAAE2B,WAAW,IAAKA,WAAW,CAACC,IAAI,CAAC,CACjD,CAAC;EACF,MAAMR,MAAM,GAAGD,OAAO,CAACI,OAAO,EAAEjC,cAAc,CAAC;EAC/C,MAAMuC,KAAK,GAAGnC,KAAK,CAACoC,MAAM,CAAC,CAAC;IAAEZ;EAAI,CAAC,KAAKA,GAAG,CAACa,CAAC,GAAG,CAAC,IAAIb,GAAG,CAACc,CAAC,GAAG,CAAC,CAAC;EAE/D,MAAM/B,MAAgB,GAAG,EAAE;EAC3B,MAAMgC,IAAW,GAAG,EAAE;EACtB,MAAMC,KAAK,GAAG,IAAIC,GAAG,CAAsB,CAAC;EAC5C,MAAMC,MAAM,GAAG,IAAID,GAAG,CAAkD,CAAC;EAEzE,MAAME,KAAK,GAAG5B,WAAW,CACtBT,GAAG,CAAC,CAACsC,UAAU,EAAElC,KAAK,MAAM;IAAEkC,UAAU;IAAElC;EAAM,CAAC,CAAC,CAAC,CACnDmC,IAAI,CACH,CAACC,CAAC,EAAEC,CAAC,KACHC,MAAM,CAACF,CAAC,CAACF,UAAU,CAACK,IAAI,KAAKC,SAAS,CAAC,GACrCF,MAAM,CAACD,CAAC,CAACH,UAAU,CAACK,IAAI,KAAKC,SAAS,CAAC,IACzCJ,CAAC,CAACF,UAAU,CAACO,YAAY,GAAGJ,CAAC,CAACH,UAAU,CAACO,YAAY,IACrDL,CAAC,CAACpC,KAAK,GAAGqC,CAAC,CAACrC,KAChB,CAAC;EAEH,KAAK,MAAM;IAAEkC,UAAU;IAAElC;EAAM,CAAC,IAAIiC,KAAK,EAAE;IACzC,MAAM;MAAES,IAAI;MAAEC;IAAG,CAAC,GAAGT,UAAU;IAC/B,MAAMU,IAAI,GAAG,IAAIC,GAAG,CAAC,CAACH,IAAI,CAACI,KAAK,CAACjC,EAAE,EAAE8B,EAAE,CAACG,KAAK,CAACjC,EAAE,CAAC,CAAC;IAClD,MAAMkC,SAAS,GAAG,IAAIF,GAAG,CACvB,CAACH,IAAI,EAAEC,EAAE,CAAC,CACPjB,MAAM,CAAEsB,GAAG,IAAKA,GAAG,CAACF,KAAK,CAACG,IAAI,KAAK,UAAU,CAAC,CAC9CrD,GAAG,CAAEoD,GAAG,IAAKA,GAAG,CAACF,KAAK,CAACjC,EAAE,CAC9B,CAAC;IACD,MAAMqC,KAAK,GAAG,CACZ,GAAGzB,KAAK,CAAChB,OAAO,CAAC,CAAC;MAAE0C,IAAI;MAAErC,GAAG;MAAEQ,MAAM;MAAE8B,MAAM;MAAEC;IAAQ,CAAC,KAAK;MAC3D,IAAI,CAACT,IAAI,CAACU,GAAG,CAACH,IAAI,CAACtC,EAAE,CAAC,EAAE,OAAO,CAACE,OAAO,CAACO,MAAM,EAAEnC,cAAc,CAAC,CAAC;MAChE,IAAIgE,IAAI,CAACF,IAAI,KAAK,UAAU,EAAE,OAAO,EAAE;MACvC;MACA,OAAO,CAACnC,GAAG,EAAE,GAAGsC,MAAM,EAAE,IAAIC,OAAO,GAAG,CAACA,OAAO,CAACvC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;IAC5D,CAAC,CAAC,EACF,GAAGN,WAAW,CAACC,OAAO,CAAC,CAAC;MAAEC,KAAK;MAAEI;IAAI,CAAC,KACpC8B,IAAI,CAACU,GAAG,CAAC5C,KAAK,CAAC,GAAG,EAAE,GAAG,CAACI,GAAG,CAC7B,CAAC,EACD,GAAGe,IAAI,CAACjC,GAAG,CAAE2D,GAAG,IAAKxC,OAAO,CAACwC,GAAG,EAAEtE,aAAa,CAACgC,SAAS,CAAC,CAAC,CAC5D;IACD,MAAMuC,IAAI,GAAG3D,MAAM,CAChB6B,MAAM,CAAE+B,KAAK,IAAK,CAACC,QAAQ,CAACD,KAAK,CAACV,SAAS,EAAEA,SAAS,CAAC,CAAC,CACxDtC,OAAO,CAAEgD,KAAK,IAAKE,QAAQ,CAACF,KAAK,CAACG,MAAM,CAAC,CAAC;IAC7C,MAAM;MAAEC,KAAK;MAAEC,SAAS;MAAEd,GAAG;MAAEe;IAAQ,CAAC,GAAG7C,WAAW,CAAClB,KAAK,CAAE;IAC9D,MAAMgE,KAAuB,GAAG,CAC9B,CAACH,KAAK,EAAEC,SAAS,CAAC,EAClB,CAACC,OAAO,EAAEf,GAAG,CAAC,CACf;IACD,MAAMiB,UAAU,GAAGD,KAAK,CAACE,KAAK,CAAC,CAAC,CAAC9B,CAAC,EAAEC,CAAC,CAAC,KACpCa,KAAK,CAACgB,KAAK,CAAEC,IAAI,IAAK,CAACC,OAAO,CAAChC,CAAC,EAAEC,CAAC,EAAE8B,IAAI,CAAC,CAC5C,CAAC;IAED,MAAME,MAAM,GAAIC,MAAW,IACzBxF,WAAW,CAAC;MACVwF,MAAM;MACNC,KAAK,EAAE;QACLC,CAAC,EAAE,CAACV,SAAS,CAACU,CAAC,EAAET,OAAO,CAACS,CAAC,CAAC;QAC3BC,CAAC,EAAE,CAACX,SAAS,CAACW,CAAC,EAAEV,OAAO,CAACU,CAAC;MAC5B,CAAC;MACDvB,KAAK;MACLM,IAAI;MACJkB,OAAO,EAAEnF,MAAM,CAACkB,OAAO,CAAC,CAAC;QAAEe,IAAI;QAAEmD;MAAK,CAAC,KACrCA,IAAI,GAAG,CAACnD,IAAI,EAAEmD,IAAI,CAAC,GAAG,CAACnD,IAAI,CAC7B,CAAC;MACDqC,KAAK,EAAEC,SAAS;MAChBc,YAAY,EAAE5F,OAAO,CAAC0D,IAAI,CAACmC,IAAI,CAAC;MAChCC,IAAI,EAAEf,OAAO;MACbgB,WAAW,EAAE/F,OAAO,CAACD,QAAQ,CAAC4D,EAAE,CAACkC,IAAI,CAAC;IACxC,CAAC,CAAC;IACJ,MAAMG,IAAI,GAAGC,YAAY,CACvBlE,OAAO,CACLK,KAAK,CAAC,CAACsB,IAAI,CAACI,KAAK,CAAChC,GAAG,EAAE6B,EAAE,CAACG,KAAK,CAAChC,GAAG,EAAEoE,MAAM,CAACpB,SAAS,EAAEC,OAAO,CAAC,CAAC,CAAC,EACjEtE,YACF,CAAC,EACDuB,MACF,CAAC;IACD,MAAMmE,KAAK,GAAGlB,UAAU,GAAII,MAAM,CAACW,IAAI,CAAC,IAAIX,MAAM,CAACrD,MAAM,CAAC,GAAIwB,SAAS;IACvE,IAAI,CAAC2C,KAAK,EAAE,OAAO;MAAElF,QAAQ,EAAED;IAAM,CAAC;IACtC,MAAM4D,MAAM,GAAG/E,YAAY,CAAC,CAACgF,KAAK,EAAE,GAAGsB,KAAK,EAAEnC,GAAG,CAAC,CAAC;IACnDlB,KAAK,CAACsD,GAAG,CAAClD,UAAU,EAAE0B,MAAM,CAAC;IAE7B,IAAI1B,UAAU,CAACK,IAAI,KAAKC,SAAS,EAAE;MACjC,MAAMD,IAAI,GAAGlD,EAAE,CAACiB,KAAK,CAAC4B,UAAU,CAACK,IAAI,CAAE;MACvC,MAAM8C,MAAM,GAAGA,CAACvE,GAAQ,EAAEwE,WAAoB,KAC5C7D,KAAK,CAACyC,KAAK,CAAC,CAAC;QAAE5C;MAAO,CAAC,KAAK,CAACiE,UAAU,CAACzE,GAAG,EAAEQ,MAAM,CAAC,CAAC,IACrD/B,MAAM,CAAC2E,KAAK,CACV,CAAC;QAAE1C,IAAI;QAAEmD,IAAI;QAAEhE;MAAM,CAAC,KACpB,EAAEgE,IAAI,IAAIY,UAAU,CAACzE,GAAG,EAAE6D,IAAI,CAAC,CAAC,IAChChE,KAAK,CAACuD,KAAK,CAAEtD,GAAG,IAAK,CAAC2E,UAAU,CAACzE,GAAG,EAAEF,GAAG,CAACI,MAAM,CAAC,CAAC,IAClD,EAAEuE,UAAU,CAACzE,GAAG,EAAEU,IAAI,CAAC,IAAI,CAACgE,QAAQ,CAAChE,IAAI,EAAEV,GAAG,CAAC,CACnD,CAAC,IACDe,IAAI,CAACqC,KAAK,CAAEX,GAAG,IAAK,CAACgC,UAAU,CAACzE,GAAG,EAAEyC,GAAG,CAAC,CAAC,IAC1C,CACE,GAAG1D,MAAM,CAACY,OAAO,CAAEgD,KAAK,IAAKE,QAAQ,CAACF,KAAK,CAACG,MAAM,CAAC,CAAC,EACpD,IAAI0B,WAAW,GAAG3B,QAAQ,CAACC,MAAM,CAAC,GAAG,EAAE,CAAC,CACzC,CAACM,KAAK,CAAC,CAAC,CAAC9B,CAAC,EAAEC,CAAC,CAAC,KAAK,CAAC+B,OAAO,CAAChC,CAAC,EAAEC,CAAC,EAAEvB,GAAG,CAAC,CAAC;MAC1C,MAAM2E,QAAQ,GAAG7G,eAAe,CAAC2D,IAAI,CAAC;MACtC,MAAM;QAAE5B,KAAK;QAAE+E;MAAM,CAAC,GAAGD,QAAQ;MACjC,MAAME,MAA2C,GAAG,CAAC,CAAC;MACtD,IAAIhF,KAAK,IAAI+E,KAAK,EAAE;QAClB,MAAME,KAAK,GAAGjH,WAAW,CAAC8G,QAAQ,EAAE7B,MAAM,EAAE,CAACiC,SAAS,EAAE5C,IAAI,KAC1DoC,MAAM,CAACQ,SAAS,EAAE5C,IAAI,KAAK,OAAO,CACpC,CAAC;QACD,IAAI,CAAC2C,KAAK,EAAE;UACV,MAAME,KAAe,GAAG,EAAE;UAC1B,IAAInF,KAAK,EAAE;YACTmF,KAAK,CAACC,IAAI,CACR,UAAUxD,IAAI,CAAC5B,KAAK,CAAEqF,IAAI,CAAC,KAAK,CAAC,MAAMC,IAAI,CAACC,IAAI,CAACvF,KAAK,CAACgB,CAAC,CAAC,IAAIsE,IAAI,CAACC,IAAI,CAACvF,KAAK,CAACiB,CAAC,CAAC,GACjF,CAAC;UACH;UACA,IAAI8D,KAAK,EAAE;YACTI,KAAK,CAACC,IAAI,CACR,UAAU,CAACxD,IAAI,CAAC4D,UAAU,IAAI,EAAE,EAAEH,IAAI,CAAC,KAAK,CAAC,MAAMC,IAAI,CAACC,IAAI,CAACR,KAAK,CAAC/D,CAAC,CAAC,IAAIsE,IAAI,CAACC,IAAI,CAACR,KAAK,CAAC9D,CAAC,CAAC,GAC7F,CAAC;UACH;UACA,MAAM,IAAIwE,KAAK,CACb,WAAWlE,UAAU,CAACmE,IAAI,KAAKP,KAAK,CAACE,IAAI,CAAC,OAAO,CAAC,IAAIF,KAAK,CAAC3F,MAAM,GAAG,CAAC,GAAG,MAAM,GAAG,KAAK,qBAAqBuF,KAAK,GAAG,IAAI,GAAG,QAAQ,aACrI,CAAC;QACH;QACA,IAAI/E,KAAK,IAAIiF,KAAK,CAACjF,KAAK,EAAE;UACxBgF,MAAM,CAAChF,KAAK,GAAG;YAAEG,GAAG,EAAE8E,KAAK,CAACjF,KAAK;YAAE2F,IAAI,EAAE3F,KAAK,CAAC4F,KAAK,CAACX,KAAK,CAACjF,KAAK;UAAE,CAAC;UACnEkB,IAAI,CAACkE,IAAI,CAACH,KAAK,CAACjF,KAAK,CAAC;QACxB;QACA,IAAI+E,KAAK,IAAIE,KAAK,CAACF,KAAK,EAAE;UACxBC,MAAM,CAACD,KAAK,GAAG;YAAE5E,GAAG,EAAE8E,KAAK,CAACF,KAAK;YAAE,GAAGA,KAAK,CAACa,KAAK,CAACX,KAAK,CAACF,KAAK;UAAE,CAAC;UAChE7D,IAAI,CAACkE,IAAI,CAACH,KAAK,CAACF,KAAK,CAAC;QACxB;MACF;MACA1D,MAAM,CAACoD,GAAG,CAAClD,UAAU,EAAEyD,MAAM,CAAC;IAChC;IACA9F,MAAM,CAACkG,IAAI,CAAC;MAAEnC,MAAM;MAAEb;IAAU,CAAC,CAAC;EACpC;EAEA,MAAMzC,KAA2B,GAAG,EAAE;EACtC,MAAMC,OAA+B,GAAG,EAAE;EAC1C,KAAK,MAAM2B,UAAU,IAAI7B,WAAW,EAAE;IACpC,MAAMuD,MAAM,GAAG9B,KAAK,CAAC0E,GAAG,CAACtE,UAAU,CAAE;IACrC,IAAIA,UAAU,CAACK,IAAI,KAAKC,SAAS,EAAE;MACjCjC,OAAO,CAACwF,IAAI,CAAC;QACXU,IAAI,EAAEvE,UAAU,CAACQ,IAAI,CAACI,KAAK,CAACjC,EAAE;QAC9B6F,MAAM,EAAExE,UAAU,CAACS,EAAE,CAACG,KAAK,CAACjC,EAAE;QAC9B+C;MACF,CAAC,CAAC;MACF;IACF;IACAtD,KAAK,CAACyF,IAAI,CAAC;MACTxD,IAAI,EAAElD,EAAE,CAACiB,KAAK,CAAC4B,UAAU,CAACK,IAAI,CAAE;MAChCoE,QAAQ,EAAEzE,UAAU,CAACQ,IAAI,CAACmC,IAAI;MAC9B+B,SAAS,EAAE1E,UAAU,CAACS,EAAE,CAACkC,IAAI;MAC7BjB,MAAM;MACN,GAAG5B,MAAM,CAACwE,GAAG,CAACtE,UAAU;IAC1B,CAAC,CAAC;EACJ;EACA,OAAO;IAAE5B,KAAK;IAAEC;EAAQ,CAAC;AAC3B;AAEA,SAASH,OAAOA,CAAC;EAAEiG,IAAI;EAAE9D,IAAI;EAAEG,IAAI;EAAEC;AAAe,CAAC,EAAS;EAC5D,MAAMkE,MAAM,GACVtE,IAAI,KAAKC,SAAS,GACd,8BAA8B,GAC9B,2CAA2C;EACjD,OAAO,IAAI4D,KAAK,CACd,WAAWC,IAAI,8BAA8BS,OAAO,CAACpE,IAAI,CAAC,OAAOoE,OAAO,CAACnE,EAAE,CAAC,iCAAiCkE,MAAM,EACrH,CAAC;AACH;AAEA,SAASC,OAAOA,CAAC;EAAEhE,KAAK;EAAE+B,IAAI;EAAEkC;AAAoB,CAAC,EAAU;EAC7D,IAAIA,IAAI,EAAE,OAAO,SAASjE,KAAK,CAACjC,EAAE,IAAIkG,IAAI,CAAClG,EAAE,GAAG;EAChD,IAAIiC,KAAK,CAACG,IAAI,KAAK,UAAU,EAAE,OAAO,kBAAkBH,KAAK,CAACjC,EAAE,GAAG;EACnE,OAAO,GAAGgE,IAAI,QAAQ/B,KAAK,CAACjC,EAAE,GAAG;AACnC;AAEA,SAAS8C,QAAQA,CAACC,MAAe,EAAoB;EACnD,OAAOA,MAAM,CAACoD,KAAK,CAAC,CAAC,CAAC,CAACpH,GAAG,CAAC,CAACqH,KAAK,EAAEjH,KAAK,KAAK,CAAC4D,MAAM,CAAC5D,KAAK,CAAC,EAAGiH,KAAK,CAAC,CAAC;AACvE;AAEA,SAASvD,QAAQA,CAACtB,CAAc,EAAEC,CAAc,EAAW;EACzD,KAAK,MAAMxB,EAAE,IAAIuB,CAAC,EAAE,IAAIC,CAAC,CAACiB,GAAG,CAACzC,EAAE,CAAC,EAAE,OAAO,IAAI;EAC9C,OAAO,KAAK;AACd;AAEA,SAASqE,MAAMA,CAAC9C,CAAQ,EAAEC,CAAQ,EAAO;EACvC,OAAO;IACLmC,CAAC,EAAEyB,IAAI,CAACiB,GAAG,CAAC9E,CAAC,CAACoC,CAAC,EAAEnC,CAAC,CAACmC,CAAC,CAAC;IACrBC,CAAC,EAAEwB,IAAI,CAACiB,GAAG,CAAC9E,CAAC,CAACqC,CAAC,EAAEpC,CAAC,CAACoC,CAAC,CAAC;IACrB9C,CAAC,EAAEsE,IAAI,CAACkB,GAAG,CAAC/E,CAAC,CAACoC,CAAC,GAAGnC,CAAC,CAACmC,CAAC,CAAC;IACtB5C,CAAC,EAAEqE,IAAI,CAACkB,GAAG,CAAC/E,CAAC,CAACqC,CAAC,GAAGpC,CAAC,CAACoC,CAAC;EACvB,CAAC;AACH;;AAEA;AACA,SAASL,OAAOA,CAAChC,CAAQ,EAAEC,CAAQ,EAAEvB,GAAQ,EAAW;EACtD,MAAMsG,IAAI,GAAGlC,MAAM,CAAC9C,CAAC,EAAEC,CAAC,CAAC;EACzB,OACE+E,IAAI,CAAC5C,CAAC,GAAG4C,IAAI,CAACzF,CAAC,GAAGb,GAAG,CAAC0D,CAAC,IACvB4C,IAAI,CAAC5C,CAAC,GAAG1D,GAAG,CAAC0D,CAAC,GAAG1D,GAAG,CAACa,CAAC,IACtByF,IAAI,CAAC3C,CAAC,GAAG2C,IAAI,CAACxF,CAAC,GAAGd,GAAG,CAAC2D,CAAC,IACvB2C,IAAI,CAAC3C,CAAC,GAAG3D,GAAG,CAAC2D,CAAC,GAAG3D,GAAG,CAACc,CAAC;AAE1B;AAEA,SAAS2D,UAAUA,CAACnD,CAAM,EAAEC,CAAM,EAAW;EAC3C,OACED,CAAC,CAACoC,CAAC,GAAGnC,CAAC,CAACmC,CAAC,GAAGnC,CAAC,CAACV,CAAC,IAAIU,CAAC,CAACmC,CAAC,GAAGpC,CAAC,CAACoC,CAAC,GAAGpC,CAAC,CAACT,CAAC,IAAIS,CAAC,CAACqC,CAAC,GAAGpC,CAAC,CAACoC,CAAC,GAAGpC,CAAC,CAACT,CAAC,IAAIS,CAAC,CAACoC,CAAC,GAAGrC,CAAC,CAACqC,CAAC,GAAGrC,CAAC,CAACR,CAAC;AAE5E;AAEA,SAAS4D,QAAQA,CAAC6B,KAAU,EAAEC,KAAU,EAAW;EACjD,OACEA,KAAK,CAAC9C,CAAC,IAAI6C,KAAK,CAAC7C,CAAC,IAClB8C,KAAK,CAAC7C,CAAC,IAAI4C,KAAK,CAAC5C,CAAC,IAClB6C,KAAK,CAAC9C,CAAC,GAAG8C,KAAK,CAAC3F,CAAC,IAAI0F,KAAK,CAAC7C,CAAC,GAAG6C,KAAK,CAAC1F,CAAC,IACtC2F,KAAK,CAAC7C,CAAC,GAAG6C,KAAK,CAAC1F,CAAC,IAAIyF,KAAK,CAAC5C,CAAC,GAAG4C,KAAK,CAACzF,CAAC;AAE1C;AAEA,SAASb,OAAOA,CAACD,GAAQ,EAAEyG,EAAU,EAAO;EAC1C,OAAO;IAAE/C,CAAC,EAAE1D,GAAG,CAAC0D,CAAC,GAAG+C,EAAE;IAAE9C,CAAC,EAAE3D,GAAG,CAAC2D,CAAC,GAAG8C,EAAE;IAAE5F,CAAC,EAAEb,GAAG,CAACa,CAAC,GAAG,CAAC,GAAG4F,EAAE;IAAE3F,CAAC,EAAEd,GAAG,CAACc,CAAC,GAAG,CAAC,GAAG2F;EAAG,CAAC;AAC/E;AAEA,SAAStC,YAAYA,CAAC7C,CAAM,EAAEC,CAAM,EAAO;EACzC,MAAMmC,CAAC,GAAGyB,IAAI,CAACuB,GAAG,CAACpF,CAAC,CAACoC,CAAC,EAAEnC,CAAC,CAACmC,CAAC,CAAC;EAC5B,MAAMC,CAAC,GAAGwB,IAAI,CAACuB,GAAG,CAACpF,CAAC,CAACqC,CAAC,EAAEpC,CAAC,CAACoC,CAAC,CAAC;EAC5B,OAAO;IACLD,CAAC;IACDC,CAAC;IACD9C,CAAC,EAAEsE,IAAI,CAACiB,GAAG,CAAC9E,CAAC,CAACoC,CAAC,GAAGpC,CAAC,CAACT,CAAC,EAAEU,CAAC,CAACmC,CAAC,GAAGnC,CAAC,CAACV,CAAC,CAAC,GAAG6C,CAAC;IACrC5C,CAAC,EAAEqE,IAAI,CAACiB,GAAG,CAAC9E,CAAC,CAACqC,CAAC,GAAGrC,CAAC,CAACR,CAAC,EAAES,CAAC,CAACoC,CAAC,GAAGpC,CAAC,CAACT,CAAC,CAAC,GAAG6C;EACtC,CAAC;AACH;AAEA,SAASrD,KAAKA,CAACwE,KAAY,EAAO;EAChC,MAAM6B,IAAI,GAAGxB,IAAI,CAACiB,GAAG,CAAC,GAAGtB,KAAK,CAAChG,GAAG,CAAEkB,GAAG,IAAKA,GAAG,CAAC0D,CAAC,CAAC,CAAC;EACnD,MAAMkD,GAAG,GAAGzB,IAAI,CAACiB,GAAG,CAAC,GAAGtB,KAAK,CAAChG,GAAG,CAAEkB,GAAG,IAAKA,GAAG,CAAC2D,CAAC,CAAC,CAAC;EAClD,MAAMkD,KAAK,GAAG1B,IAAI,CAACuB,GAAG,CAAC,GAAG5B,KAAK,CAAChG,GAAG,CAAEkB,GAAG,IAAKA,GAAG,CAAC0D,CAAC,GAAG1D,GAAG,CAACa,CAAC,CAAC,CAAC;EAC5D,MAAMiG,MAAM,GAAG3B,IAAI,CAACuB,GAAG,CAAC,GAAG5B,KAAK,CAAChG,GAAG,CAAEkB,GAAG,IAAKA,GAAG,CAAC2D,CAAC,GAAG3D,GAAG,CAACc,CAAC,CAAC,CAAC;EAC7D,OAAO;IAAE4C,CAAC,EAAEiD,IAAI;IAAEhD,CAAC,EAAEiD,GAAG;IAAE/F,CAAC,EAAEgG,KAAK,GAAGF,IAAI;IAAE7F,CAAC,EAAEgG,MAAM,GAAGF;EAAI,CAAC;AAC9D","ignoreList":[]}

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

@@ -0,0 +1,28 @@
+import type { Box, DiagramSide, Point } from '../../model/diagram-ir.ts';
+import type { CellArea } from './areas.ts';
+import type { Heading } from './route-search.ts';
+export declare const OPPOSITE: Record<DiagramSide, DiagramSide>;
+/** The heading of a line that leaves a box through `side`. */
+export declare const OUTWARD: Record<DiagramSide, Heading>;
+export declare function isVertical(side: DiagramSide): boolean;
+/** The side a connection leaves by, and the side it enters by. */
+export type SidePair = [DiagramSide, DiagramSide];
+/**
+ * The pairs of sides a connection may leave and enter by, read from the
+ * cells, in order of preference. First the facing pair: areas that share
+ * rows face left and right, areas that share columns face top and bottom,
+ * and otherwise the axis with the larger cell delta wins, the vertical one
+ * on a tie. Then the facing pair on the other axis, then the first pair's
+ * exit with the other pair's entry, then the other pair's exit with the
+ * first pair's entry.
+ */
+export declare function sidePairs(from: CellArea, to: CellArea): [SidePair, ...SidePair[]];
+/** The coordinate of the side's line: x for left and right, y for top and bottom. */
+export declare function sideLine(box: Box, side: DiagramSide): number;
+/** Where the side runs along its line: [start, end] in x for top and bottom, in y for left and right. */
+export declare function sideSpan(box: Box, side: DiagramSide): [number, number];
+/** The point on `side` of `box` at `along` on the side's span. */
+export declare function pointOnSide(box: Box, side: DiagramSide, along: number): Point;
+/** The point `distance` beyond `point` out of `side`. */
+export declare function beyond(point: Point, side: DiagramSide, distance: number): Point;
+//# sourceMappingURL=sides.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sides.d.ts","sourceRoot":"","sources":["../../../../src/lib/layouts/graph/sides.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,2BAA2B,CAAC;AACzE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAC3C,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAEjD,eAAO,MAAM,QAAQ,EAAE,MAAM,CAAC,WAAW,EAAE,WAAW,CAKrD,CAAC;AAEF,8DAA8D;AAC9D,eAAO,MAAM,OAAO,EAAE,MAAM,CAAC,WAAW,EAAE,OAAO,CAKhD,CAAC;AAEF,wBAAgB,UAAU,CAAC,IAAI,EAAE,WAAW,GAAG,OAAO,CAErD;AAED,kEAAkE;AAClE,MAAM,MAAM,QAAQ,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;AAElD;;;;;;;;GAQG;AACH,wBAAgB,SAAS,CACvB,IAAI,EAAE,QAAQ,EACd,EAAE,EAAE,QAAQ,GACX,CAAC,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAAC,CAe3B;AAED,qFAAqF;AACrF,wBAAgB,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,GAAG,MAAM,CAW5D;AAED,yGAAyG;AACzG,wBAAgB,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAEtE;AAED,kEAAkE;AAClE,wBAAgB,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,GAAG,KAAK,CAG7E;AAED,yDAAyD;AACzD,wBAAgB,MAAM,CACpB,KAAK,EAAE,KAAK,EACZ,IAAI,EAAE,WAAW,EACjB,QAAQ,EAAE,MAAM,GACf,KAAK,CAWP"}

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

@@ -0,0 +1,98 @@
+export const OPPOSITE = {
+  top: 'bottom',
+  bottom: 'top',
+  left: 'right',
+  right: 'left'
+};
+
+/** The heading of a line that leaves a box through `side`. */
+export const OUTWARD = {
+  right: 0,
+  left: 1,
+  bottom: 2,
+  top: 3
+};
+export function isVertical(side) {
+  return side === 'top' || side === 'bottom';
+}
+
+/** The side a connection leaves by, and the side it enters by. */
+
+/**
+ * The pairs of sides a connection may leave and enter by, read from the
+ * cells, in order of preference. First the facing pair: areas that share
+ * rows face left and right, areas that share columns face top and bottom,
+ * and otherwise the axis with the larger cell delta wins, the vertical one
+ * on a tie. Then the facing pair on the other axis, then the first pair's
+ * exit with the other pair's entry, then the other pair's exit with the
+ * first pair's entry.
+ */
+export function sidePairs(from, to) {
+  const shareRows = Math.max(from.row, to.row) < Math.min(from.row + from.rowSpan, to.row + to.rowSpan);
+  const shareCols = Math.max(from.col, to.col) < Math.min(from.col + from.colSpan, to.col + to.colSpan);
+  const dr = to.row + to.rowSpan / 2 - (from.row + from.rowSpan / 2);
+  const dc = to.col + to.colSpan / 2 - (from.col + from.colSpan / 2);
+  const across = dc > 0 ? ['right', 'left'] : ['left', 'right'];
+  const down = dr >= 0 ? ['bottom', 'top'] : ['top', 'bottom'];
+  const horizontal = shareRows !== shareCols ? shareRows : Math.abs(dc) > Math.abs(dr);
+  const [first, other] = horizontal ? [across, down] : [down, across];
+  return [first, other, [first[0], other[1]], [other[0], first[1]]];
+}
+
+/** The coordinate of the side's line: x for left and right, y for top and bottom. */
+export function sideLine(box, side) {
+  switch (side) {
+    case 'top':
+      return box.y;
+    case 'bottom':
+      return box.y + box.h;
+    case 'left':
+      return box.x;
+    case 'right':
+      return box.x + box.w;
+  }
+}
+
+/** Where the side runs along its line: [start, end] in x for top and bottom, in y for left and right. */
+export function sideSpan(box, side) {
+  return isVertical(side) ? [box.x, box.x + box.w] : [box.y, box.y + box.h];
+}
+
+/** The point on `side` of `box` at `along` on the side's span. */
+export function pointOnSide(box, side, along) {
+  const line = sideLine(box, side);
+  return isVertical(side) ? {
+    x: along,
+    y: line
+  } : {
+    x: line,
+    y: along
+  };
+}
+
+/** The point `distance` beyond `point` out of `side`. */
+export function beyond(point, side, distance) {
+  switch (side) {
+    case 'top':
+      return {
+        x: point.x,
+        y: point.y - distance
+      };
+    case 'bottom':
+      return {
+        x: point.x,
+        y: point.y + distance
+      };
+    case 'left':
+      return {
+        x: point.x - distance,
+        y: point.y
+      };
+    case 'right':
+      return {
+        x: point.x + distance,
+        y: point.y
+      };
+  }
+}
+//# sourceMappingURL=sides.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sides.js","names":["OPPOSITE","top","bottom","left","right","OUTWARD","isVertical","side","sidePairs","from","to","shareRows","Math","max","row","min","rowSpan","shareCols","col","colSpan","dr","dc","across","down","horizontal","abs","first","other","sideLine","box","y","h","x","w","sideSpan","pointOnSide","along","line","beyond","point","distance"],"sources":["../../../../src/lib/layouts/graph/sides.ts"],"sourcesContent":["import type { Box, DiagramSide, Point } from '../../model/diagram-ir.ts';\nimport type { CellArea } from './areas.ts';\nimport type { Heading } from './route-search.ts';\n\nexport const OPPOSITE: Record<DiagramSide, DiagramSide> = {\n  top: 'bottom',\n  bottom: 'top',\n  left: 'right',\n  right: 'left',\n};\n\n/** The heading of a line that leaves a box through `side`. */\nexport const OUTWARD: Record<DiagramSide, Heading> = {\n  right: 0,\n  left: 1,\n  bottom: 2,\n  top: 3,\n};\n\nexport function isVertical(side: DiagramSide): boolean {\n  return side === 'top' || side === 'bottom';\n}\n\n/** The side a connection leaves by, and the side it enters by. */\nexport type SidePair = [DiagramSide, DiagramSide];\n\n/**\n * The pairs of sides a connection may leave and enter by, read from the\n * cells, in order of preference. First the facing pair: areas that share\n * rows face left and right, areas that share columns face top and bottom,\n * and otherwise the axis with the larger cell delta wins, the vertical one\n * on a tie. Then the facing pair on the other axis, then the first pair's\n * exit with the other pair's entry, then the other pair's exit with the\n * first pair's entry.\n */\nexport function sidePairs(\n  from: CellArea,\n  to: CellArea,\n): [SidePair, ...SidePair[]] {\n  const shareRows =\n    Math.max(from.row, to.row) <\n    Math.min(from.row + from.rowSpan, to.row + to.rowSpan);\n  const shareCols =\n    Math.max(from.col, to.col) <\n    Math.min(from.col + from.colSpan, to.col + to.colSpan);\n  const dr = to.row + to.rowSpan / 2 - (from.row + from.rowSpan / 2);\n  const dc = to.col + to.colSpan / 2 - (from.col + from.colSpan / 2);\n  const across: SidePair = dc > 0 ? ['right', 'left'] : ['left', 'right'];\n  const down: SidePair = dr >= 0 ? ['bottom', 'top'] : ['top', 'bottom'];\n  const horizontal =\n    shareRows !== shareCols ? shareRows : Math.abs(dc) > Math.abs(dr);\n  const [first, other] = horizontal ? [across, down] : [down, across];\n  return [first, other, [first[0], other[1]], [other[0], first[1]]];\n}\n\n/** The coordinate of the side's line: x for left and right, y for top and bottom. */\nexport function sideLine(box: Box, side: DiagramSide): number {\n  switch (side) {\n    case 'top':\n      return box.y;\n    case 'bottom':\n      return box.y + box.h;\n    case 'left':\n      return box.x;\n    case 'right':\n      return box.x + box.w;\n  }\n}\n\n/** Where the side runs along its line: [start, end] in x for top and bottom, in y for left and right. */\nexport function sideSpan(box: Box, side: DiagramSide): [number, number] {\n  return isVertical(side) ? [box.x, box.x + box.w] : [box.y, box.y + box.h];\n}\n\n/** The point on `side` of `box` at `along` on the side's span. */\nexport function pointOnSide(box: Box, side: DiagramSide, along: number): Point {\n  const line = sideLine(box, side);\n  return isVertical(side) ? { x: along, y: line } : { x: line, y: along };\n}\n\n/** The point `distance` beyond `point` out of `side`. */\nexport function beyond(\n  point: Point,\n  side: DiagramSide,\n  distance: number,\n): Point {\n  switch (side) {\n    case 'top':\n      return { x: point.x, y: point.y - distance };\n    case 'bottom':\n      return { x: point.x, y: point.y + distance };\n    case 'left':\n      return { x: point.x - distance, y: point.y };\n    case 'right':\n      return { x: point.x + distance, y: point.y };\n  }\n}\n"],"mappings":"AAIA,OAAO,MAAMA,QAA0C,GAAG;EACxDC,GAAG,EAAE,QAAQ;EACbC,MAAM,EAAE,KAAK;EACbC,IAAI,EAAE,OAAO;EACbC,KAAK,EAAE;AACT,CAAC;;AAED;AACA,OAAO,MAAMC,OAAqC,GAAG;EACnDD,KAAK,EAAE,CAAC;EACRD,IAAI,EAAE,CAAC;EACPD,MAAM,EAAE,CAAC;EACTD,GAAG,EAAE;AACP,CAAC;AAED,OAAO,SAASK,UAAUA,CAACC,IAAiB,EAAW;EACrD,OAAOA,IAAI,KAAK,KAAK,IAAIA,IAAI,KAAK,QAAQ;AAC5C;;AAEA;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,SAASA,CACvBC,IAAc,EACdC,EAAY,EACe;EAC3B,MAAMC,SAAS,GACbC,IAAI,CAACC,GAAG,CAACJ,IAAI,CAACK,GAAG,EAAEJ,EAAE,CAACI,GAAG,CAAC,GAC1BF,IAAI,CAACG,GAAG,CAACN,IAAI,CAACK,GAAG,GAAGL,IAAI,CAACO,OAAO,EAAEN,EAAE,CAACI,GAAG,GAAGJ,EAAE,CAACM,OAAO,CAAC;EACxD,MAAMC,SAAS,GACbL,IAAI,CAACC,GAAG,CAACJ,IAAI,CAACS,GAAG,EAAER,EAAE,CAACQ,GAAG,CAAC,GAC1BN,IAAI,CAACG,GAAG,CAACN,IAAI,CAACS,GAAG,GAAGT,IAAI,CAACU,OAAO,EAAET,EAAE,CAACQ,GAAG,GAAGR,EAAE,CAACS,OAAO,CAAC;EACxD,MAAMC,EAAE,GAAGV,EAAE,CAACI,GAAG,GAAGJ,EAAE,CAACM,OAAO,GAAG,CAAC,IAAIP,IAAI,CAACK,GAAG,GAAGL,IAAI,CAACO,OAAO,GAAG,CAAC,CAAC;EAClE,MAAMK,EAAE,GAAGX,EAAE,CAACQ,GAAG,GAAGR,EAAE,CAACS,OAAO,GAAG,CAAC,IAAIV,IAAI,CAACS,GAAG,GAAGT,IAAI,CAACU,OAAO,GAAG,CAAC,CAAC;EAClE,MAAMG,MAAgB,GAAGD,EAAE,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC;EACvE,MAAME,IAAc,GAAGH,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC;EACtE,MAAMI,UAAU,GACdb,SAAS,KAAKM,SAAS,GAAGN,SAAS,GAAGC,IAAI,CAACa,GAAG,CAACJ,EAAE,CAAC,GAAGT,IAAI,CAACa,GAAG,CAACL,EAAE,CAAC;EACnE,MAAM,CAACM,KAAK,EAAEC,KAAK,CAAC,GAAGH,UAAU,GAAG,CAACF,MAAM,EAAEC,IAAI,CAAC,GAAG,CAACA,IAAI,EAAED,MAAM,CAAC;EACnE,OAAO,CAACI,KAAK,EAAEC,KAAK,EAAE,CAACD,KAAK,CAAC,CAAC,CAAC,EAAEC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAACA,KAAK,CAAC,CAAC,CAAC,EAAED,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE;;AAEA;AACA,OAAO,SAASE,QAAQA,CAACC,GAAQ,EAAEtB,IAAiB,EAAU;EAC5D,QAAQA,IAAI;IACV,KAAK,KAAK;MACR,OAAOsB,GAAG,CAACC,CAAC;IACd,KAAK,QAAQ;MACX,OAAOD,GAAG,CAACC,CAAC,GAAGD,GAAG,CAACE,CAAC;IACtB,KAAK,MAAM;MACT,OAAOF,GAAG,CAACG,CAAC;IACd,KAAK,OAAO;MACV,OAAOH,GAAG,CAACG,CAAC,GAAGH,GAAG,CAACI,CAAC;EACxB;AACF;;AAEA;AACA,OAAO,SAASC,QAAQA,CAACL,GAAQ,EAAEtB,IAAiB,EAAoB;EACtE,OAAOD,UAAU,CAACC,IAAI,CAAC,GAAG,CAACsB,GAAG,CAACG,CAAC,EAAEH,GAAG,CAACG,CAAC,GAAGH,GAAG,CAACI,CAAC,CAAC,GAAG,CAACJ,GAAG,CAACC,CAAC,EAAED,GAAG,CAACC,CAAC,GAAGD,GAAG,CAACE,CAAC,CAAC;AAC3E;;AAEA;AACA,OAAO,SAASI,WAAWA,CAACN,GAAQ,EAAEtB,IAAiB,EAAE6B,KAAa,EAAS;EAC7E,MAAMC,IAAI,GAAGT,QAAQ,CAACC,GAAG,EAAEtB,IAAI,CAAC;EAChC,OAAOD,UAAU,CAACC,IAAI,CAAC,GAAG;IAAEyB,CAAC,EAAEI,KAAK;IAAEN,CAAC,EAAEO;EAAK,CAAC,GAAG;IAAEL,CAAC,EAAEK,IAAI;IAAEP,CAAC,EAAEM;EAAM,CAAC;AACzE;;AAEA;AACA,OAAO,SAASE,MAAMA,CACpBC,KAAY,EACZhC,IAAiB,EACjBiC,QAAgB,EACT;EACP,QAAQjC,IAAI;IACV,KAAK,KAAK;MACR,OAAO;QAAEyB,CAAC,EAAEO,KAAK,CAACP,CAAC;QAAEF,CAAC,EAAES,KAAK,CAACT,CAAC,GAAGU;MAAS,CAAC;IAC9C,KAAK,QAAQ;MACX,OAAO;QAAER,CAAC,EAAEO,KAAK,CAACP,CAAC;QAAEF,CAAC,EAAES,KAAK,CAACT,CAAC,GAAGU;MAAS,CAAC;IAC9C,KAAK,MAAM;MACT,OAAO;QAAER,CAAC,EAAEO,KAAK,CAACP,CAAC,GAAGQ,QAAQ;QAAEV,CAAC,EAAES,KAAK,CAACT;MAAE,CAAC;IAC9C,KAAK,OAAO;MACV,OAAO;QAAEE,CAAC,EAAEO,KAAK,CAACP,CAAC,GAAGQ,QAAQ;QAAEV,CAAC,EAAES,KAAK,CAACT;MAAE,CAAC;EAChD;AACF","ignoreList":[]}

package/dist/lib/layouts/timeline/timeline-layout.d.ts

@@ -1,4 +1,5 @@
 import type { DiagramSignal, DiagramSignalBox, DiagramTimelineSpec } from '../../model/diagram-ir.ts';
+import type { Font } from '../text/font.ts';
 export type { DiagramFrameElement, DiagramLane, DiagramSignal, DiagramSignalBox, } from '../../model/diagram-ir.ts';
 export type TimelineLayoutSpec = DiagramTimelineSpec & {
     title?: string[];
@@ -16,7 +17,7 @@ export declare const FRAME_HEADER_H = 22;
 export declare const FRAME_PAD = 12;
 export declare const BOTTOM_ACTOR_GAP = 50;
 export declare const DEFAULT_BOXED_STUB = 12;
-export declare const SIGNAL_LABEL_FONT_SIZE = 12;
+export declare const SIGNAL_LABEL_FONT: Font;
 export declare const SIGNAL_LABEL_PAD_X = 14;
 export declare const SIGNAL_LABEL_PAD_Y = 10;
 export declare const SIGNAL_LABEL_LINE_H = 18;

package/dist/lib/layouts/timeline/timeline-layout.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"timeline-layout.d.ts","sourceRoot":"","sources":["../../../../src/lib/layouts/timeline/timeline-layout.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,aAAa,EACb,gBAAgB,EAChB,mBAAmB,EACpB,MAAM,2BAA2B,CAAC;AAGnC,YAAY,EACV,mBAAmB,EACnB,WAAW,EACX,aAAa,EACb,gBAAgB,GACjB,MAAM,2BAA2B,CAAC;AAEnC,MAAM,MAAM,kBAAkB,GAAG,mBAAmB,GAAG;IAAE,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC;AAE5E,eAAO,MAAM,KAAK,OAAO,CAAC;AAC1B,eAAO,MAAM,OAAO,MAAM,CAAC;AAC3B,eAAO,MAAM,OAAO,KAAK,CAAC;AAC1B,eAAO,MAAM,QAAQ,KAAK,CAAC;AAC3B,eAAO,MAAM,WAAW,KAAK,CAAC;AAC9B,eAAO,MAAM,KAAK,KAAK,CAAC;AACxB,eAAO,MAAM,WAAW,MAAM,CAAC;AAC/B,eAAO,MAAM,YAAY,KAAK,CAAC;AAC/B,eAAO,MAAM,UAAU,KAAK,CAAC;AAC7B,eAAO,MAAM,cAAc,KAAK,CAAC;AACjC,eAAO,MAAM,SAAS,KAAK,CAAC;AAC5B,eAAO,MAAM,gBAAgB,KAAK,CAAC;AACnC,eAAO,MAAM,kBAAkB,KAAK,CAAC;AACrC,eAAO,MAAM,sBAAsB,KAAK,CAAC;AACzC,eAAO,MAAM,kBAAkB,KAAK,CAAC;AACrC,eAAO,MAAM,kBAAkB,KAAK,CAAC;AACrC,eAAO,MAAM,mBAAmB,KAAK,CAAC;AACtC,eAAO,MAAM,yBAAyB,KAAK,CAAC;AAC5C,eAAO,MAAM,sBAAsB,KAAK,CAAC;AAEzC,MAAM,MAAM,WAAW,GACrB,WAAW,GAAG,KAAK,GAAG,aAAa,GAAG,WAAW,GAAG,cAAc,CAAC;AAErE,MAAM,MAAM,aAAa,GAAG;IAC1B,IAAI,EAAE,WAAW,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;CACb,CAAC;AAEF,wBAAgB,qBAAqB,CACnC,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,OAAO,EAChB,SAAS,EAAE,MAAM,GAChB,aAAa,EAAE,CAqCjB;AAED,MAAM,MAAM,YAAY,GAAG;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC;IAClC,KAAK,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC;CACnC,CAAC;AAEF,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG;IACnD,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd,CAOA;AAED,4EAA4E;AAC5E,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,IAAI,CAAC,aAAa,EAAE,OAAO,GAAG,OAAO,CAAC,GAC7C,MAAM,CAOR;AAED,wEAAwE;AACxE,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,IAAI,CAAC,aAAa,EAAE,OAAO,GAAG,OAAO,CAAC,GAC7C,MAAM,CAER;AAED,wBAAgB,kBAAkB,CAAC,IAAI,EAAE;IACvC,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,SAAS,EAAE,MAAM,CAAC;CACnB,GAAG,YAAY,CAyCf;AAED,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAGhE;AAED,MAAM,MAAM,aAAa,GAAG;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,OAAO,CAAC;CACjB,CAAC;AAEF,MAAM,MAAM,eAAe,GAAG;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,eAAe,EAAE,CAAC;CAC5B,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,eAAe,EAAE,CAAC;IAC3B,KAAK,EAAE,cAAc,GAAG,IAAI,CAAC;IAC7B,eAAe,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IAChD,kBAAkB,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;CACpD,CAAC;AAEF,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,kBAAkB,GACvB,cAAc,CAuGhB"}
+{"version":3,"file":"timeline-layout.d.ts","sourceRoot":"","sources":["../../../../src/lib/layouts/timeline/timeline-layout.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,aAAa,EACb,gBAAgB,EAChB,mBAAmB,EACpB,MAAM,2BAA2B,CAAC;AACnC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAG5C,YAAY,EACV,mBAAmB,EACnB,WAAW,EACX,aAAa,EACb,gBAAgB,GACjB,MAAM,2BAA2B,CAAC;AAEnC,MAAM,MAAM,kBAAkB,GAAG,mBAAmB,GAAG;IAAE,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;CAAE,CAAC;AAE5E,eAAO,MAAM,KAAK,OAAO,CAAC;AAC1B,eAAO,MAAM,OAAO,MAAM,CAAC;AAC3B,eAAO,MAAM,OAAO,KAAK,CAAC;AAC1B,eAAO,MAAM,QAAQ,KAAK,CAAC;AAC3B,eAAO,MAAM,WAAW,KAAK,CAAC;AAC9B,eAAO,MAAM,KAAK,KAAK,CAAC;AACxB,eAAO,MAAM,WAAW,MAAM,CAAC;AAC/B,eAAO,MAAM,YAAY,KAAK,CAAC;AAC/B,eAAO,MAAM,UAAU,KAAK,CAAC;AAC7B,eAAO,MAAM,cAAc,KAAK,CAAC;AACjC,eAAO,MAAM,SAAS,KAAK,CAAC;AAC5B,eAAO,MAAM,gBAAgB,KAAK,CAAC;AACnC,eAAO,MAAM,kBAAkB,KAAK,CAAC;AACrC,eAAO,MAAM,iBAAiB,EAAE,IAA8C,CAAC;AAC/E,eAAO,MAAM,kBAAkB,KAAK,CAAC;AACrC,eAAO,MAAM,kBAAkB,KAAK,CAAC;AACrC,eAAO,MAAM,mBAAmB,KAAK,CAAC;AACtC,eAAO,MAAM,yBAAyB,KAAK,CAAC;AAC5C,eAAO,MAAM,sBAAsB,KAAK,CAAC;AAEzC,MAAM,MAAM,WAAW,GACrB,WAAW,GAAG,KAAK,GAAG,aAAa,GAAG,WAAW,GAAG,cAAc,CAAC;AAErE,MAAM,MAAM,aAAa,GAAG;IAC1B,IAAI,EAAE,WAAW,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;CACb,CAAC;AAEF,wBAAgB,qBAAqB,CACnC,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,OAAO,EAChB,SAAS,EAAE,MAAM,GAChB,aAAa,EAAE,CAqCjB;AAED,MAAM,MAAM,YAAY,GAAG;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC;IAClC,KAAK,EAAE;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC;CACnC,CAAC;AAEF,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG;IACnD,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd,CASA;AAED,4EAA4E;AAC5E,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,IAAI,CAAC,aAAa,EAAE,OAAO,GAAG,OAAO,CAAC,GAC7C,MAAM,CAOR;AAED,wEAAwE;AACxE,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,IAAI,CAAC,aAAa,EAAE,OAAO,GAAG,OAAO,CAAC,GAC7C,MAAM,CAER;AAED,wBAAgB,kBAAkB,CAAC,IAAI,EAAE;IACvC,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,gBAAgB,CAAC;IAC3B,SAAS,EAAE,MAAM,CAAC;CACnB,GAAG,YAAY,CAyCf;AAED,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAGhE;AAED,MAAM,MAAM,aAAa,GAAG;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,OAAO,CAAC;CACjB,CAAC;AAEF,MAAM,MAAM,eAAe,GAAG;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,eAAe,EAAE,CAAC;CAC5B,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,aAAa,EAAE,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,eAAe,EAAE,CAAC;IAC3B,KAAK,EAAE,cAAc,GAAG,IAAI,CAAC;IAC7B,eAAe,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IAChD,kBAAkB,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;CACpD,CAAC;AAEF,wBAAgB,qBAAqB,CACnC,IAAI,EAAE,kBAAkB,GACvB,cAAc,CAuGhB"}

package/dist/lib/layouts/timeline/timeline-layout.js

@@ -1,4 +1,4 @@
-import { textAscent, widestLine } from "../text-metrics.js";
+import { fontAscent, measureText } from "../text/measure-text.js";
 export const SEQ_W = 1000;
 export const ACTOR_W = 190;
 export const ACTOR_H = 72;
@@ -12,7 +12,11 @@ export const FRAME_HEADER_H = 22;
 export const FRAME_PAD = 12;
 export const BOTTOM_ACTOR_GAP = 50;
 export const DEFAULT_BOXED_STUB = 12;
-export const SIGNAL_LABEL_FONT_SIZE = 12;
+export const SIGNAL_LABEL_FONT = {
+  face: 'mono',
+  size: 12,
+  weight: 400
+};
 export const SIGNAL_LABEL_PAD_X = 14;
 export const SIGNAL_LABEL_PAD_Y = 10;
 export const SIGNAL_LABEL_LINE_H = 18;
@@ -62,8 +66,9 @@ export function buildTimelineSegments(totalSignals, hasLoop, frameMsgs) {
   return segments;
 }
 export function measureSignalLabel(label) {
+  const widestLineW = Math.max(0, ...label.map(line => measureText(line, SIGNAL_LABEL_FONT)));
   return {
-    boxW: Math.ceil(widestLine(label, SIGNAL_LABEL_FONT_SIZE, 'mono')) + SIGNAL_LABEL_PAD_X * 2,
+    boxW: Math.ceil(widestLineW) + SIGNAL_LABEL_PAD_X * 2,
     boxH: label.length * SIGNAL_LABEL_LINE_H + SIGNAL_LABEL_PAD_Y * 2
   };
 }
@@ -71,7 +76,7 @@ export function measureSignalLabel(label) {
 /** Distance from a signal's row up to the top of its label or label box. */
 export function signalLabelHeadroom(signal) {
   if (signal.boxed) return measureSignalLabel(signal.label).boxH / 2;
-  return SIGNAL_LABEL_BASELINE_GAP + (signal.label.length - 1) * SIGNAL_LABEL_LINE_STEP + textAscent(SIGNAL_LABEL_FONT_SIZE, 'mono');
+  return SIGNAL_LABEL_BASELINE_GAP + (signal.label.length - 1) * SIGNAL_LABEL_LINE_STEP + fontAscent(SIGNAL_LABEL_FONT);
 }
 
 /** Distance from a signal's row down to the bottom of its label box. */