dsh-model-everything 0.5.0 → 0.5.2

package/src/render/paint.ts

@@ -1,290 +1,1570 @@
-/**
- * Geometry: what a diagram turns into, in coordinates.
- *
- * A drawing has to survive three containers - inline in a conversation, full-screen, and a persistent
- * sidebar tab - so nothing here knows about pixel size. It emits a content-sized canvas and lets the
- * container scale it: the same numbers serve a 360px card and a 1200px whiteboard.
- *
- * Two placements, chosen by the source:
- *
- * - **layered** (no groups): breadth-first rows, forward edges dropping straight down, back edges on a side
- *   channel clear of every box, self loops as small loops. The shape a state machine wants.
- * - **tree** (groups present): a group is a block, its members stack inside it, a nested group is a block
- *   inside its parent, and the top level stacks. The shape an architecture diagram wants, because a package
- *   whose members float somewhere else on the page is not showing containment at all.
- *
- * Edges are placed from where the boxes ended up, so neither placement needs to tell the edge code which one
- * ran: "below" is a straight line, "beside" is horizontal, "above" routes around.
- *
- * Pure: a diagram in, shapes out, every decision assertable.
- */
-
-import { MARGIN, place, type Box } from './place.js'
-import { palette, roleForVerdict, type ColourRole, type Palette, type PaletteOptions } from './palette.js'
-import { labelOf, type Diagram, type DiagramGroup, type DiagramNode } from './model.js'
-
-export interface Point {
-  x: number
-  y: number
-}
-
-export interface BoxShape {
-  kind: 'box'
-  x: number
-  y: number
-  width: number
-  height: number
-  label: string
-  colour: ColourRole
-  initial: boolean
-}
-
-export interface LinkShape {
-  kind: 'link'
-  x1: number
-  y1: number
-  x2: number
-  y2: number
-  label: string
-  labelX: number
-  labelY: number
-  colour: ColourRole
-}
-
-export interface PathShape {
-  kind: 'path'
-  points: Point[]
-  label: string
-  labelX: number
-  labelY: number
-  colour: ColourRole
-}
-
-/** A boundary around several states: a package, a layer, a subgraph. */
-export interface GroupShape {
-  kind: 'group'
-  /** The group's own id, so a container can fold it without guessing from the label. */
-  id: string
-  x: number
-  y: number
-  width: number
-  height: number
-  label: string
-  colour: ColourRole
-}
-
-export interface CaptionShape {
-  kind: 'caption'
-  x: number
-  y: number
-  lines: string[]
-  colour: ColourRole
-}
-
-export interface TitleShape {
-  kind: 'title'
-  x: number
-  y: number
-  text: string
-  colour: ColourRole
-}
-
-export type Shape = GroupShape | BoxShape | LinkShape | PathShape | CaptionShape | TitleShape
-
-export interface Canvas {
-  width: number
-  height: number
-  shapes: Shape[]
-}
-
-/** Geometry constants in one place: a container with different proportions changes these, not the rules. */
-const MIN_NODE_WIDTH = 88
-const MAX_NODE_WIDTH = 220
-const CHAR_WIDTH = 7.2
-
-const nodeWidth = (label: string): number => Math.min(MAX_NODE_WIDTH, Math.max(MIN_NODE_WIDTH, label.length * CHAR_WIDTH + 26))
-
-const TITLE_HEIGHT = 26
-const NODE_HEIGHT = 34
-const CHANNEL_GAP = 16
-const CAPTION_CHARS = 78
-const CAPTION_LINE = 15
-const CAPTION_GAP = 16
-const CAPTION_CHAR_WIDTH = 6.2
-
-/** Which colour a box earns from its role. One mapping, used by every container. */
-export function roleOfNode(node: DiagramNode): ColourRole {
-  if (node.role === 'error') return 'fail'
-  if (node.role === 'warning') return 'findings'
-  if (node.role === 'muted') return 'muted'
-  return 'edge'
-}
-
-/** Wrap on spaces; break a token longer than the line rather than let it overflow the canvas. */
-function wrap(text: string, limit: number): string[] {
-  const lines: string[] = []
-  let line = ''
-  for (const word of text.split(/\s+/).filter((part) => part !== '')) {
-    const candidate = line === '' ? word : line + ' ' + word
-    if (candidate.length <= limit) {
-      line = candidate
-      continue
-    }
-    if (line !== '') lines.push(line)
-    line = ''
-    let rest = word
-    while (rest.length > limit) {
-      lines.push(rest.slice(0, limit))
-      rest = rest.slice(limit)
-    }
-    line = rest
-  }
-  if (line !== '') lines.push(line)
-  return lines.length === 0 ? [''] : lines
-}
-
-/** The colour a caption earns, read from the verdict it quotes. */
-function captionRole(caption: string): ColourRole {
-  return roleForVerdict(caption.split(' — ')[0] as string)
-}
-
-export function paintWith(diagram: Diagram, overrides: Partial<Palette> = {}, options: PaletteOptions = {}): { canvas: Canvas; colours: Palette } {
-  const colours = palette(overrides, options)
-  const shapes: Shape[] = []
-
-  const groups = diagram.groups ?? []
-  const topOffset = MARGIN + TITLE_HEIGHT
-  const placement = place(diagram, topOffset)
-  const { boxes, groupRects } = placement
-
-  // Boundaries first, so everything else is painted on top of them.
-  for (const group of groups) {
-    const rect = groupRects.get(group.id)
-    if (rect === undefined) continue
-    shapes.push({ kind: 'group', id: group.id, x: rect.x, y: rect.y, width: rect.width, height: rect.height, label: group.label, colour: 'muted' })
-  }
-
-  const drawn = new Set<string>()
-  for (const node of diagram.nodes) {
-    // A state id may repeat in a malformed model: the first placement wins and the repeat is skipped.
-    if (drawn.has(node.id)) continue
-    const box = boxes.get(node.id) as Box
-    drawn.add(node.id)
-    shapes.push({
-      kind: 'box',
-      x: box.x,
-      y: box.y,
-      width: box.width,
-      height: box.height,
-      label: labelOf(node),
-      colour: roleOfNode(node),
-      initial: diagram.init === node.id,
-    })
-  }
-
-  const roleById = new Map(diagram.nodes.map((node) => [node.id, roleOfNode(node)] as const))
-  let channel = Math.max(placement.width, ...Array.from(boxes.values(), (box) => box.x + box.width)) + CHANNEL_GAP
-  let channelUses = 0
-
-  for (const edge of diagram.edges) {
-    const source = boxes.get(edge.from)
-    const target = boxes.get(edge.to)
-    if (source === undefined || target === undefined) continue
-    const colour = roleById.get(edge.from) as ColourRole
-    // Placement decided where things are; "below", "beside" and "above" are read from the result.
-    const sameRow = Math.abs(target.y - source.y) < NODE_HEIGHT / 2
-
-    if (edge.from === edge.to) {
-      const x = source.x + source.width
-      const y = source.y + source.height / 2
-      shapes.push({
-        kind: 'path',
-        points: [
-          { x, y: y - 9 },
-          { x: x + 14, y: y - 9 },
-          { x: x + 14, y: y + 9 },
-          { x, y: y + 9 },
-        ],
-        label: edge.label,
-        labelX: x + 20,
-        labelY: y,
-        colour,
-      })
-      continue
-    }
-
-    if (target.y > source.y && !sameRow) {
-      const x1 = source.x + source.width / 2
-      const y1 = source.y + source.height
-      const x2 = target.x + target.width / 2
-      const y2 = target.y
-      shapes.push({ kind: 'link', x1, y1, x2, y2, label: edge.label, labelX: (x1 + x2) / 2 + 7, labelY: (y1 + y2) / 2, colour })
-      continue
-    }
-
-    if (sameRow) {
-      const right = source.x + source.width
-      const left = target.x
-      const y = source.y + source.height / 2
-      const forward = right <= left
-      shapes.push({
-        kind: 'link',
-        x1: forward ? right : source.x,
-        y1: y,
-        x2: forward ? left : target.x + target.width,
-        y2: y,
-        label: edge.label,
-        labelX: (right + left) / 2,
-        labelY: y - 7,
-        colour,
-      })
-      continue
-    }
-
-    // Backward: leave right, run down a lane clear of every box, come back in from the right.
-    const lane = channel + (channelUses % 3) * 8
-    channelUses += 1
-    channel = Math.max(channel, lane)
-    const startY = source.y + source.height / 2
-    const endY = target.y + target.height / 2
-    shapes.push({
-      kind: 'path',
-      points: [
-        { x: source.x + source.width, y: startY },
-        { x: lane, y: startY },
-        { x: lane, y: endY },
-        { x: target.x + target.width, y: endY },
-      ],
-      label: edge.label,
-      labelX: lane + 6,
-      labelY: (startY + endY) / 2,
-      colour,
-    })
-  }
-
-  shapes.push({ kind: 'title', x: MARGIN, y: MARGIN + 12, text: diagram.title, colour: 'text' })
-
-  const contentRight = Math.max(
-    MARGIN,
-    ...Array.from(boxes.values(), (box) => box.x + box.width),
-    ...Array.from(groupRects.values(), (rect) => rect.x + rect.width),
-  )
-  const captionLines = wrap(diagram.caption, CAPTION_CHARS)
-  const captionWidth = Math.max(...captionLines.map((line) => line.length * CAPTION_CHAR_WIDTH)) + MARGIN * 2
-  const width = Math.max(contentRight + MARGIN + (channelUses > 0 ? CHANNEL_GAP * 3 : 0), captionWidth, 240)
-
-  const contentBottom = Math.max(
-    topOffset,
-    ...Array.from(boxes.values(), (box) => box.y + box.height),
-    ...Array.from(groupRects.values(), (rect) => rect.y + rect.height),
-  )
-  const captionTop = contentBottom + CAPTION_GAP
-  shapes.push({ kind: 'caption', x: MARGIN, y: captionTop, lines: captionLines, colour: captionRole(diagram.caption) })
-  const height = captionTop + captionLines.length * CAPTION_LINE + MARGIN / 2
-
-  return { canvas: { width: Math.round(width), height: Math.round(height), shapes }, colours }
-}
-
-export function paint(diagram: Diagram, overrides: Partial<Palette> = {}): Canvas {
-  return paintWith(diagram, overrides).canvas
-}
+/**
+ * Geometry: what a diagram turns into, in coordinates.
+ *
+ * A drawing has to survive three containers - inline in a conversation, full-screen, and a persistent
+ * sidebar tab - so nothing here knows about pixel size. It emits a content-sized canvas and lets the
+ * container scale it: the same numbers serve a 360px card and a 1200px whiteboard.
+ *
+ * The drawing is placed by the layered pipeline (`place.ts`), which also says which lane a long edge reserved.
+ * Edges are drawn from where the boxes ended up, in two ways only: a long edge follows its lane as one polyline,
+ * and everything else goes through the orthogonal router. Which side of a box an edge leaves by is read off the
+ * route, not picked by comparing the boxes' centres: a route between two rows arrives vertically, so the endpoint
+ * is snapped onto the top or bottom perimeter in the direction the route approaches. Where along that side it sits
+ * follows the symbol: a rectangle spreads its ports along the side, a cylinder's top port sits on its cap curve, and a
+ * diamond or a circle has four legal points and no side to spread along at all. A side that carries one port is
+ * centred on it, and a side that carries several spreads them symmetrically about the middle; the bend budget comes
+ * first, so a port that is the end of a straight run or of a lane keeps the coordinate its route asked for.
+ *
+ * A symbol with discrete points gives each of its edges a point of its own: the point whose outward normal faces the
+ * box at the other end is the one that edge takes, and an edge only shares a point when all four are spoken for. A
+ * node with a run on its side keeps doing what it always did, because there the ports are places on the run and not
+ * points at all. Sharing is the fallback, not the rule: two labelled branches of a decision leave by two vertices.
+ *
+ * An edge's name is drawn on the edge, not beside it: it is anchored at the midpoint of one of the edge's own straight
+ * runs, over a rectangle in the page colour that masks the line behind the text, and it slides along that run when
+ * something is in the way. It tries every run - the longest first - because on a dense drawing the longest one can be
+ * crowded for its whole length while a shorter run of the same edge is clear. A label that can clear nothing still
+ * stays on its edge, takes the place with the fewest collisions, and records what it could not avoid. Labels are
+ * placed after every edge is drawn, because what a label has to avoid is the whole picture.
+ *
+ * Every route is checked before it is drawn, and the assembled drawing is checked once more: a segment may touch no
+ * box except the two the edge terminates at. A route is a proposal - a channel run, a lane, a trunk branch, a wrapped
+ * column's sideways read - and any proposal that would cross a box is handed to the router instead. When even the
+ * router cannot clear a box, the failure is reported on the canvas rather than hidden: a drawing that says which edge
+ * could not be routed is worth more than one that quietly draws it through a box.
+ *
+ * Pure: a diagram in, shapes out, every decision assertable.
+ */
+
+import { MARGIN, place, textOf, type Box } from './place.js'
+import { PORT_INSET } from './channels.js'
+import { anchor, approachSides, crossesBox, normalOf, ROUTE_STUB, routeEdge, simplify, type Ports, type Side } from './route.js'
+import { planTrunks, type TrunkEnd, type TrunkGroup, type TrunkPlan } from './trunk.js'
+import { cylinderApex, cylinderCaps, hasDiscretePorts, hexagonCut, stadiumRadius } from './symbol.js'
+import { textWidth } from './text.js'
+import { palette, roleForVerdict, type ColourRole, type Palette, type PaletteOptions } from './palette.js'
+import { labelOf, type Diagram, type DiagramEdge, type DiagramGroup, type DiagramNode, type EdgeArrow, type NodeShape } from './model.js'
+
+export interface Point {
+  x: number
+  y: number
+}
+
+export interface BoxShape {
+  kind: 'box'
+  x: number
+  y: number
+  width: number
+  height: number
+  /** The lines to draw, already wrapped; `label` keeps the whole text for anything that reads the shape. */
+  label: string
+  lines: string[]
+  /** The symbol to draw. Undefined means a rectangle. */
+  shape?: NodeShape
+  colour: ColourRole
+  initial: boolean
+}
+
+/**
+ * Why a label sits where it does.
+ *
+ * A clear label records `collisions: 0` and the run it chose. A label that could clear nothing records the collisions
+ * it could not avoid, so a reader of the drawing (or a test) can tell a crowded drawing from a placement bug. The
+ * label never leaves its own edge to earn any of these numbers.
+ */
+export interface LabelPlacement {
+  /** The straight run it sits on, 0 being the edge's longest. */
+  run: number
+  /** Everything its mask overlaps: the other labels, boxes and edges it would have had to move off its line to clear. */
+  collisions: number
+  boxes: number
+  labels: number
+  edges: number
+}
+
+export interface LinkShape {
+  kind: 'link'
+  x1: number
+  y1: number
+  x2: number
+  y2: number
+  label: string
+  /** The centre the label is drawn on, and therefore a point on the edge itself. */
+  labelX: number
+  labelY: number
+  colour: ColourRole
+  /** A dashed line, when the notation distinguished one. */
+  dashed?: boolean
+  /** The arrow the source edge stated. Undefined means the plain arrow every edge has been drawn with. */
+  arrow?: EdgeArrow
+  /** Why the label sits where it does. Undefined on an edge with no label. */
+  labelPlacement?: LabelPlacement
+}
+
+export interface PathShape {
+  kind: 'path'
+  points: Point[]
+  label: string
+  /** The centre the label is drawn on, and therefore a point on the edge itself. */
+  labelX: number
+  labelY: number
+  colour: ColourRole
+  dashed?: boolean
+  arrow?: EdgeArrow
+  /** Why the label sits where it does. Undefined on an edge with no label. */
+  labelPlacement?: LabelPlacement
+}
+
+/**
+ * A junction dot: the place one branch of a merged bundle meets the bundle's trunk.
+ *
+ * The dot is not decoration. Two lines that meet at a right angle read as a crossing unless one of them is marked as
+ * joining the other, and a bundle whose branches are not marked reads as a set of broken lines rather than a merge.
+ */
+export interface JunctionShape {
+  kind: 'junction'
+  x: number
+  y: number
+  colour: ColourRole
+  /** The trunk the dot belongs to: one dot per branch, one trunk id per bundle. */
+  trunk: number
+}
+
+/** A boundary around several states: a package, a layer, a subgraph. */
+export interface GroupShape {
+  kind: 'group'
+  /** The group's own id, so a container can fold it without guessing from the label. */
+  id: string
+  x: number
+  y: number
+  width: number
+  height: number
+  label: string
+  colour: ColourRole
+}
+
+export interface CaptionShape {
+  kind: 'caption'
+  x: number
+  y: number
+  lines: string[]
+  colour: ColourRole
+}
+
+export interface TitleShape {
+  kind: 'title'
+  x: number
+  y: number
+  text: string
+  colour: ColourRole
+}
+
+export type Shape = GroupShape | BoxShape | LinkShape | PathShape | JunctionShape | CaptionShape | TitleShape
+
+/** Which side of each box an edge leaves by and arrives at, and, for a long edge, the lane x it meets there. */
+interface Facing {
+  exit: Side
+  entry: Side
+  at?: number
+}
+
+/** One segment of a drawn route that could not be kept out of a box it does not terminate at. */
+export interface RoutingFailure {
+  /** The edge's index in the diagram. */
+  edge: number
+  from: string
+  to: string
+  /** The box the segment passes through. */
+  box: string
+  x1: number
+  y1: number
+  x2: number
+  y2: number
+}
+
+export interface Canvas {
+  width: number
+  height: number
+  shapes: Shape[]
+  /**
+   * Every place a drawn segment still passes through a box it does not terminate at, after every route was checked.
+   *
+   * A drawing should carry none. The field exists for the case where no stage and no router could find a way around:
+   * a route that cannot be drawn honestly is reported here rather than silently drawn through a box.
+   */
+  routingFailures: RoutingFailure[]
+  /** How many edge labels could not be placed clear of every box, label and other edge. */
+  labelCollisions: number
+}
+
+/** Geometry constants in one place: a container with different proportions changes these, not the rules. */
+const TITLE_HEIGHT = 26
+const CAPTION_CHARS = 78
+const CAPTION_LINE = 15
+const CAPTION_GAP = 16
+const CAPTION_CHAR_WIDTH = 6.2
+
+/** The closest two ports on one side may sit, so two edges never leave from the same pixel. */
+const PORT_SEPARATION = 14
+
+/**
+ * The sides of a box, in the order a symbol's own points are drawn: a diamond's top, right, bottom and left vertices.
+ *
+ * A shape with discrete ports has exactly one legal point per side, so this is also the order its points are offered
+ * to the edges that want one, and the order a tie between two equally good sides falls back to.
+ */
+const PORT_SIDES: Side[] = ['top', 'right', 'bottom', 'left']
+
+/** Is this one of the two sides a vertical run leaves by? A run is vertical in its own axis, not in the page. */
+const isVerticalSide = (side: Side): boolean => side === 'top' || side === 'bottom'
+
+/**
+ * How far apart two edges that join the same pair are drawn.
+ *
+ * Wider than the least two ports may sit: two statements about one pair have to read as two lines, and a gap the
+ * port packer would allow is a gap a reader sees as one thick line. Exported so a test can name the pattern.
+ */
+export const MULTI_EDGE_SPACING = 20
+
+/**
+ * Spread the ports of one side along it: each stays as close to the point it asked for as the gap to its neighbours
+ * allows, and the whole row is kept on the box.
+ *
+ * This is the same monotone fit coordinate assignment uses on x, applied to one side of one box: a forward pass that
+ * keeps every port at least `PORT_SEPARATION` to the right of the one before it, then a backward pass that pulls the
+ * row back onto the box without closing those gaps.
+ */
+function packPorts(wanted: number[], low: number, high: number): number[] {
+  const placed: number[] = []
+  let previous = low - PORT_SEPARATION
+  for (const value of wanted) {
+    previous = Math.min(high, Math.max(value, previous + PORT_SEPARATION))
+    placed.push(previous)
+  }
+  let next = high + PORT_SEPARATION
+  for (let index = placed.length - 1; index >= 0; index -= 1) {
+    next = Math.max(low, Math.min(placed[index], next - PORT_SEPARATION))
+    placed[index] = next
+  }
+  return placed
+}
+
+/**
+ * Centre a row of ports on the side it sits on.
+ *
+ * The row keeps its order, its gaps and its separation, and is translated as a whole so its outer two ports sit
+ * symmetrically about the middle of the span: two ports become the middle less and plus half their gap, and a longer
+ * row is the same run of places the routing asked for, moved to where the side has room for it. A row that cannot
+ * travel the whole way stops where its last port reaches the end of the span - the alternative is a port off the box.
+ */
+function centreRun(placed: number[], low: number, high: number): number[] {
+  if (placed.length === 0) return placed
+  const first = placed[0] as number
+  const last = placed[placed.length - 1] as number
+  const middle = (low + high) / 2
+  const shift = Math.min(high - last, Math.max(low - first, middle - (first + last) / 2))
+  return shift === 0 ? placed : placed.map((value) => value + shift)
+}
+
+/** Which colour a box earns from its role. One mapping, used by every container. */
+export function roleOfNode(node: DiagramNode): ColourRole {
+  if (node.role === 'error') return 'fail'
+  if (node.role === 'warning') return 'findings'
+  if (node.role === 'muted') return 'muted'
+  return 'edge'
+}
+
+/** Wrap on spaces; break a token longer than the line rather than let it overflow the canvas. */
+function wrap(text: string, limit: number): string[] {
+  const lines: string[] = []
+  let line = ''
+  for (const word of text.split(/\s+/).filter((part) => part !== '')) {
+    const candidate = line === '' ? word : line + ' ' + word
+    if (candidate.length <= limit) {
+      line = candidate
+      continue
+    }
+    if (line !== '') lines.push(line)
+    line = ''
+    let rest = word
+    while (rest.length > limit) {
+      lines.push(rest.slice(0, limit))
+      rest = rest.slice(limit)
+    }
+    line = rest
+  }
+  if (line !== '') lines.push(line)
+  return lines.length === 0 ? [''] : lines
+}
+
+/** The colour a caption earns, read from the verdict it quotes. */
+function captionRole(caption: string): ColourRole {
+  return roleForVerdict(caption.split(' — ')[0] as string)
+}
+
+
+/**
+ * How tall the mask an edge label is drawn over is.
+ *
+ * Exported because two modules must agree on it: the painter reserves the rectangle when it looks for a clear
+ * place, and the writer draws the rectangle that was reserved. A label with two sizes is a label half masked.
+ */
+export const LABEL_HEIGHT = 12
+
+/** The room a label's mask keeps from anything it may not cover, so two rectangles never read as one. */
+const LABEL_PAD = 2
+
+/** How far a label steps along its own run while it looks for a clear place to sit. */
+const LABEL_STEP = 3
+
+/** A straight piece of an edge, as the collision test needs it. */
+interface Segment {
+  x1: number
+  y1: number
+  x2: number
+  y2: number
+}
+
+/** Where a label sits: the point it is centred on, and the rectangle its mask covers. */
+interface LabelSpot {
+  x: number
+  y: number
+  width: number
+  height: number
+}
+
+/** A straight run of an edge: one of the pieces a label may sit on. */
+interface Run {
+  from: Point
+  to: Point
+  /** The run is axis-aligned, so its Manhattan length is its length. */
+  length: number
+  /** Where the run sits in the route, so two equal runs keep the order they are drawn in. */
+  index: number
+}
+
+/** The runs of one edge, longest first. A label prefers the run with the most room. */
+function runsOf(points: Point[]): Run[] {
+  const runs: Run[] = []
+  for (let index = 0; index + 1 < points.length; index += 1) {
+    const from = points[index]
+    const to = points[index + 1]
+    const length = Math.abs(to.x - from.x) + Math.abs(to.y - from.y)
+    if (length < 1) continue
+    runs.push({ from, to, length, index })
+  }
+  return runs.sort((left, right) => right.length - left.length || left.index - right.index)
+}
+
+/**
+ * The point an edge's label is drawn at.
+ *
+ * A label is not furniture parked beside the line: it names the transition, so it sits on the line - anchored on one
+ * of its own straight runs - and the writer masks the stretch of line it covers. Text beside a line can be read as
+ * belonging to whatever it happens to sit next to; text that interrupts its own line reads as part of it.
+ *
+ * The anchor then has to be earned. A mask over a box hides a border, over another label it makes both unreadable,
+ * and over a third edge's line it hides that line. So the label walks along a run in small steps, in both directions
+ * and bounded so its rectangle stays on that run, and takes the first place that is clear. It tries the longest run
+ * first and then the shorter ones: on a dense drawing the longest run can be crowded for its whole length while a
+ * shorter run of the same edge is empty, and a label that gives up after one run leaves the drawing with a collision
+ * it did not have to accept.
+ *
+ * When no run offers a clear place, the label takes the place with the fewest collisions - boxes and other labels
+ * first, because text over a border hides the border and text over text is unreadable, then other edges, which a mask
+ * merely interrupts. It never leaves its own edge: a label moved onto a neighbouring edge is a label that names the
+ * wrong thing. The choice is returned with the label, so a crowded drawing can be told from a placement bug.
+ *
+ * Exported because the choice is pure and worth asserting without a layout: a test can hand it one polyline, one box
+ * and one other route, and read which run it took and what it could not clear.
+ */
+export function placeLabel(
+  label: string,
+  points: Point[],
+  boxes: Iterable<Box>,
+  placed: LabelSpot[],
+  otherRoutes: Segment[][],
+): LabelPlacement & LabelSpot {
+  const width = textWidth(label)
+  const height = LABEL_HEIGHT
+  const spotAt = (x: number, y: number): LabelSpot => ({ x, y, width, height })
+  const hitsBox = (spot: LabelSpot, box: Box): boolean =>
+    spot.x - spot.width / 2 < box.x + box.width + LABEL_PAD &&
+    spot.x + spot.width / 2 > box.x - LABEL_PAD &&
+    spot.y - spot.height / 2 < box.y + box.height + LABEL_PAD &&
+    spot.y + spot.height / 2 > box.y - LABEL_PAD
+  const hitsSpot = (spot: LabelSpot, other: LabelSpot): boolean =>
+    spot.x - spot.width / 2 < other.x + other.width / 2 + LABEL_PAD &&
+    spot.x + spot.width / 2 > other.x - other.width / 2 - LABEL_PAD &&
+    spot.y - spot.height / 2 < other.y + other.height / 2 + LABEL_PAD &&
+    spot.y + spot.height / 2 > other.y - other.height / 2 - LABEL_PAD
+  // A label on top of a line is as unreadable as one on top of a box: the mask hides the stretch of line it
+  // covers, which on its own edge is the point of the mask and on any other edge is a line that goes missing.
+  const hitsSegment = (spot: LabelSpot, segment: Segment): boolean =>
+    spot.x + spot.width / 2 > Math.min(segment.x1, segment.x2) - LABEL_PAD &&
+    spot.x - spot.width / 2 < Math.max(segment.x1, segment.x2) + LABEL_PAD &&
+    spot.y + spot.height / 2 > Math.min(segment.y1, segment.y2) - LABEL_PAD &&
+    spot.y - spot.height / 2 < Math.max(segment.y1, segment.y2) + LABEL_PAD
+  /** Everything one candidate place overlaps, counted by the thing it covers rather than by the segment that draws it. */
+  const collisionsAt = (spot: LabelSpot, run: number): LabelPlacement => {
+    let boxHits = 0
+    let labelHits = 0
+    let edgeHits = 0
+    for (const box of boxes) if (hitsBox(spot, box)) boxHits += 1
+    for (const earlier of placed) if (hitsSpot(spot, earlier)) labelHits += 1
+    for (const route of otherRoutes) {
+      for (const segment of route) {
+        if (!hitsSegment(spot, segment)) continue
+        edgeHits += 1
+        break
+      }
+    }
+    return { run, collisions: boxHits + labelHits + edgeHits, boxes: boxHits, labels: labelHits, edges: edgeHits }
+  }
+
+  const runs = runsOf(points)
+  if (runs.length === 0) {
+    // A route with no straight piece has no line to sit on: keep the label at the route's own point rather than move
+    // it into the air. Only a degenerate route reaches this, and the writer still draws its mask.
+    const point = points[0] ?? { x: 0, y: 0 }
+    return { ...spotAt(point.x, point.y), run: -1, collisions: 0, boxes: 0, labels: 0, edges: 0 }
+  }
+
+  let best: (LabelPlacement & LabelSpot) | undefined
+  for (const [runIndex, run] of runs.entries()) {
+    const dx = run.to.x - run.from.x
+    const dy = run.to.y - run.from.y
+    const ux = dx / run.length
+    const uy = dy / run.length
+    const middle = { x: (run.from.x + run.to.x) / 2, y: (run.from.y + run.to.y) / 2 }
+    // The walk is bounded so the label's own rectangle stays on the run that names it: a mask that hangs off the
+    // end of its segment would be half over the next thing and would not read as sitting on this edge.
+    const along = (Math.abs(ux) * width) / 2 + (Math.abs(uy) * height) / 2
+    const bound = Math.max(0, run.length / 2 - along)
+    const walk: number[] = [0]
+    for (let step = LABEL_STEP; step <= bound + 0.001; step += LABEL_STEP) walk.push(step, -step)
+    for (const offset of walk) {
+      const spot = spotAt(middle.x + ux * offset, middle.y + uy * offset)
+      const placement = collisionsAt(spot, runIndex)
+      // A clear place is the answer, and the first one is the preferred one: the search order is already the
+      // drawing's preference - longest run, own midpoint, then either side.
+      if (placement.collisions === 0) return { ...spot, ...placement }
+      if (
+        best === undefined ||
+        placement.collisions < best.collisions ||
+        (placement.collisions === best.collisions && placement.boxes + placement.labels < best.boxes + best.labels)
+      ) {
+        best = { ...spot, ...placement }
+      }
+    }
+  }
+  return best as LabelPlacement & LabelSpot
+}
+
+
+/** The furthest right and bottom point any shape reaches. */
+function drawnExtent(shapes: Shape[]): { width: number; height: number } {
+  let width = 0
+  let height = 0
+  const consider = (x: number, y: number): void => {
+    if (x > width) width = x
+    if (y > height) height = y
+  }
+  for (const shape of shapes) {
+    switch (shape.kind) {
+      case 'box':
+      case 'group':
+        consider(shape.x + shape.width, shape.y + shape.height)
+        break
+      case 'link':
+        consider(Math.max(shape.x1, shape.x2), Math.max(shape.y1, shape.y2))
+        if (shape.label !== '') consider(shape.labelX + textWidth(shape.label) / 2, shape.labelY + LABEL_HEIGHT / 2)
+        break
+      case 'path': {
+        for (const point of shape.points) consider(point.x, point.y)
+        if (shape.label !== '') consider(shape.labelX + textWidth(shape.label) / 2, shape.labelY + LABEL_HEIGHT / 2)
+        break
+      }
+      case 'caption':
+      case 'title':
+        consider(textWidth((shape as { lines?: string[]; text?: string }).lines?.[0] ?? '') + shape.x, shape.y + 12)
+        break
+      case 'junction':
+        // A dot sits on a line that already reaches further than it does: counting it would never widen the canvas.
+        break
+    }
+  }
+  return { width, height }
+}
+
+/**
+ * The boxes a polyline passes through other than the two it terminates at.
+ *
+ * This is the drawing's one clearance rule, and it is deliberately written once: a channel run, a lane, a trunk
+ * branch, a wrapped column's sideways step and the router's fallback all have to obey the same test. A box is skipped
+ * only when it is one of the edge's own two ends, so a port that sits inside its own symbol (a cylinder's cap apex)
+ * is allowed and a segment that ends inside somebody else's box is not.
+ */
+export function boxesCrossedBy(points: Point[], from: Box, to: Box, boxes: Iterable<Box>): Box[] {
+  const crossed: Box[] = []
+  for (let index = 0; index + 1 < points.length; index += 1) {
+    const a = points[index]
+    const b = points[index + 1]
+    for (const box of boxes) {
+      if (box === from || box === to) continue
+      if (crossesBox(a.x, a.y, b.x, b.y, box)) crossed.push(box)
+    }
+  }
+  return crossed
+}
+
+export function paintWith(diagram: Diagram, overrides: Partial<Palette> = {}, options: PaletteOptions = {}): { canvas: Canvas; colours: Palette } {
+  const colours = palette(overrides, options)
+  const shapes: Shape[] = []
+
+  const groups = diagram.groups ?? []
+  const topOffset = MARGIN + TITLE_HEIGHT
+  const placement = place(diagram, topOffset)
+  const { boxes, groupRects } = placement
+
+  // An edge may end on a boundary instead of a box: the boundary's rectangle is then the port surface, and
+  // the arrow head lands on its border. A group is not a member box, so every lookup that used to ask only
+  // `boxes` asks this instead.
+  const endBox = (id: string): Box | undefined => boxes.get(id) ?? groupRects.get(id)
+
+  // The symbol a box is drawn as, which decides which points on its sides an edge may meet. A boundary, and a node
+  // the source gave no shape, is a rectangle.
+  const shapeById = new Map<string, NodeShape>()
+  for (const node of diagram.nodes) if (node.shape !== undefined && !shapeById.has(node.id)) shapeById.set(node.id, node.shape)
+  const shapeOf = (id: string): NodeShape => shapeById.get(id) ?? 'rect'
+
+  // Boundaries first, so everything else is painted on top of them.
+  for (const group of groups) {
+    const rect = groupRects.get(group.id)
+    if (rect === undefined) continue
+    shapes.push({ kind: 'group', id: group.id, x: rect.x, y: rect.y, width: rect.width, height: rect.height, label: group.label, colour: 'muted' })
+  }
+
+  const drawn = new Set<string>()
+  // A Map iterator is consumed by the first pass: collision checks need a list.
+  const boxList = Array.from(boxes.values())
+  /** One drawn edge: the shape, its index in the diagram, and whether its label was fixed rather than placed. */
+  interface DrawnRoute {
+    shape: LinkShape | PathShape
+    edge: number
+    /** A self loop's label is drawn beside the loop by design; the placement pass leaves it alone. */
+    fixed: boolean
+  }
+  /** The edges drawn as lines, in paint order: their labels are placed once every one of them is known. */
+  const routes: DrawnRoute[] = []
+  for (const node of diagram.nodes) {
+    // A state id may repeat in a malformed model: the first placement wins and the repeat is skipped.
+    if (drawn.has(node.id)) continue
+    const box = boxes.get(node.id) as Box
+    drawn.add(node.id)
+    const text = textOf(node)
+    shapes.push({
+      kind: 'box',
+      x: box.x,
+      y: box.y,
+      width: box.width,
+      height: box.height,
+      label: labelOf(node),
+      lines: text.lines,
+      ...(node.shape === undefined ? {} : { shape: node.shape }),
+      colour: roleOfNode(node),
+      initial: diagram.init === node.id,
+    })
+  }
+
+  const roleById = new Map(diagram.nodes.map((node) => [node.id, roleOfNode(node)] as const))
+
+  // One pair may carry two statements - an association and a composition, or the same arrow written twice. They are
+  // two relations, not one, and one bend path between them reads as a thick line or as a mistake. So every edge of
+  // such a set is a line of its own: the first keeps the place the drawing gave it, and the rest take an offset
+  // perpendicular to the direction they run, alternating sign and growing - 0, +1, -1, +2, -2 spacings - so the set
+  // fans out from the pair instead of doubling it. A self loop is left out: it has no main direction to be
+  // perpendicular to, and its own shape is already not a line between two sides.
+  const multiEdgeSets = new Map<string, number[]>()
+  diagram.edges.forEach((edge, index) => {
+    if (edge.from === edge.to) return
+    if (endBox(edge.from) === undefined || endBox(edge.to) === undefined) return
+    const key = edge.from < edge.to ? edge.from + '\u0000' + edge.to : edge.to + '\u0000' + edge.from
+    const list = multiEdgeSets.get(key)
+    if (list === undefined) multiEdgeSets.set(key, [index])
+    else list.push(index)
+  })
+  const fanOf = new Map<number, number>()
+  for (const list of multiEdgeSets.values()) {
+    if (list.length < 2) continue
+    list.forEach((index, position) => {
+      if (position === 0) return
+      fanOf.set(index, (position % 2 === 1 ? 1 : -1) * Math.ceil(position / 2) * MULTI_EDGE_SPACING)
+    })
+  }
+
+  // Ports. The side comes from the route, not from comparing the two boxes' centres: a layered drawing runs
+  // downwards, so an edge between two rows leaves the bottom and arrives at the top, and a back edge does the
+  // opposite - unless the symbol has four legal points, and then the side is the point the edge was given. Where along
+  // the side the port sits follows the drawing: a long edge takes the point its lane meets, so the lane leaves and
+  // arrives square on, and a short edge points at the box it joins. Two edges that want the same place are spaced
+  // apart, so two ports never share a pixel.
+  const endKey = (index: number, end: 'exit' | 'entry'): string => String(index) + ':' + end
+  const endsAt = new Map<string, number>()
+  for (const edge of diagram.edges) {
+    if (edge.from === edge.to) continue
+    if (endBox(edge.from) === undefined || endBox(edge.to) === undefined) continue
+    endsAt.set(edge.from, (endsAt.get(edge.from) ?? 0) + 1)
+    endsAt.set(edge.to, (endsAt.get(edge.to) ?? 0) + 1)
+  }
+
+  /**
+   * Where a port may sit on one side of one node, as the interval its coordinate may take.
+   *
+   * This is the per-symbol rule, and it is why the rule lives here: a port slot is chosen in this module, so this is
+   * where the symbol has to be known. A rectangle spreads a port along the side, and a subroutine does the same. A
+   * diamond's side meets its outline at exactly one point - the vertex - so its interval is that point, and a circle's
+   * is its cardinal point; a point is all that side has to give, so two edges on one side share it rather than take
+   * two points in the air. A hexagon's top and bottom are the flat run between the cut corners, and its left and right
+   * are the vertices. A stadium's flat run stops at the end caps, and a cylinder's flat sides are the two vertical
+   * runs, never the caps.
+   *
+   * A zero-width interval is not a failure: the packer keeps every port on it, so a symbol that offers one point on a
+   * side hands that point to every edge that wants it. Which is why a symbol with four points is given one edge per
+   * side first - the point is only shared when the four are taken.
+   */
+  const spanOf = (boxId: string, side: Side, corner: boolean): { low: number; high: number } => {
+    const box = endBox(boxId) as Box
+    const vertical = side === 'top' || side === 'bottom'
+    const middle = vertical ? box.x + box.width / 2 : box.y + box.height / 2
+    const within = (low: number, high: number): { low: number; high: number } => ({ low, high: Math.max(low, high) })
+    switch (shapeOf(boxId)) {
+      // The four vertices of a diamond, and the four cardinal points of an ellipse, are the middles of its sides.
+      case 'diamond':
+      case 'circle':
+        return within(middle, middle)
+      case 'hexagon':
+        return vertical ? within(box.x + hexagonCut(box.width), box.x + box.width - hexagonCut(box.width)) : within(middle, middle)
+      case 'stadium': {
+        const radius = stadiumRadius(box)
+        return vertical ? within(box.x + radius, box.x + box.width - radius) : within(middle, middle)
+      }
+      case 'cylinder': {
+        if (vertical) return within(middle, middle)
+        const cap = cylinderCaps(box).cap
+        return within(box.y + cap, box.y + box.height - cap)
+      }
+      default: {
+        // A rectangle, and a subroutine's doubled side, keep the margins they have always had; `corner` relaxes them
+        // because a side that is crowded uses its corners.
+        const inset = corner ? 2 : vertical ? PORT_INSET : 8
+        return vertical ? within(box.x + inset, box.x + box.width - inset) : within(box.y + inset, box.y + box.height - inset)
+      }
+    }
+  }
+  const clampTo = (boxId: string, side: Side, value: number, corner: boolean): number => {
+    const span = spanOf(boxId, side, corner)
+    return Math.min(span.high, Math.max(span.low, value))
+  }
+  /**
+   * The boundary point a coordinate along one side takes.
+   *
+   * The box's rectangle is the point for every symbol whose side is the box's side. A cylinder's top and bottom are
+   * arcs, so a port there sits on the cap curve's apex - `cap / 4` inside the box, not on the box's own edge.
+   */
+  const pointOn = (boxId: string, side: Side, along: number): Point => {
+    const box = endBox(boxId) as Box
+    if (side === 'left') return { x: box.x, y: along }
+    if (side === 'right') return { x: box.x + box.width, y: along }
+    if (side === 'top') return { x: along, y: shapeOf(boxId) === 'cylinder' ? cylinderApex(box, 'top').y : box.y }
+    return { x: along, y: shapeOf(boxId) === 'cylinder' ? cylinderApex(box, 'bottom').y : box.y + box.height }
+  }
+  /** The side each edge end's port is on, where the port is a point rather than a place along a run. */
+  const claimed = new Map<string, Side>()
+  const claimedAt = new Map<string, Array<{ index: number; side: Side }>>()
+  const claim = (id: string, index: number, end: 'exit' | 'entry', side: Side): void => {
+    claimed.set(endKey(index, end), side)
+    claimedAt.set(id, [...(claimedAt.get(id) ?? []), { index, side }])
+  }
+  /** The sides of one node another edge already holds. An edge is not crowded by its own other end. */
+  const takenSides = (id: string, except: number): Side[] =>
+    (claimedAt.get(id) ?? []).filter((entry) => entry.index !== except).map((entry) => entry.side)
+
+  /** The middle of one side: the coordinate that side's point sits at when nothing has moved it. */
+  const sideMiddle = (box: Box, side: Side): number => (isVerticalSide(side) ? box.x + box.width / 2 : box.y + box.height / 2)
+
+  /** The point a side offers at its middle: a symbol's own point, or the middle of the run it spreads along. */
+  const sidePoint = (boxId: string, side: Side): Point => pointOn(boxId, side, sideMiddle(endBox(boxId) as Box, side))
+
+  /** Does this side face away from the box at the other end? A route leaving it has to come back round its own box. */
+  const facesAway = (box: Box, other: Box, side: Side): boolean => {
+    const out = normalOf(side)
+    const dx = other.x + other.width / 2 - (box.x + box.width / 2)
+    const dy = other.y + other.height / 2 - (box.y + box.height / 2)
+    return out.x * dx + out.y * dy < 0
+  }
+
+  /** The coordinate a free side takes when the other end is pinned: the pinned port's stub, read on the free axis. */
+  const stubAlong = (pinnedId: string, pinnedSide: Side, freeSide: Side): number => {
+    const point = sidePoint(pinnedId, pinnedSide)
+    const out = normalOf(pinnedSide)
+    return isVerticalSide(freeSide) ? point.x + out.x * ROUTE_STUB : point.y + out.y * ROUTE_STUB
+  }
+
+  /** Can this side put a port at `value`? A point-side offers exactly one coordinate; a run offers an interval. */
+  const offers = (boxId: string, side: Side, value: number): boolean => {
+    const span = spanOf(boxId, side, true)
+    return value >= span.low - 0.01 && value <= span.high + 0.01
+  }
+
+  /**
+   * The bend budget a candidate (exit side, entry side) pair spends on the orthogonal route it implies, before a lane
+   * or a router is consulted. The numbers, and what each one is:
+   *
+   *   0  the two stubs share a line: both on vertical sides whose x can be the same, or both on horizontal sides
+   *      whose y can be the same, with each stub pointing the way the edge travels. One straight run, no corner.
+   *   1  an L: the two sides are perpendicular and the one that can still move can be placed exactly where the pinned
+   *      side's stub ends, so the route turns once. It is the rung between the straight run and the Z: an L never
+   *      beats a run that shares a line, and always beats a Z.
+   *   2  a Z: the stubs are perpendicular but cannot meet at one corner, or they are parallel and offset. Out, across,
+   *      in: two corners.
+   *   4  a U: a side faces away from the box at the other end, so the route has to wrap a box - out, round, back
+   *      in. The canonical U has both sides facing away; one is already enough to force the wrap, and a pair that
+   *      has to come back the way it went is never worth a pair that does not.
+   *
+   * "Can be the same" is the symbol's own answer (`spanOf`): a rectangle offers its whole side, a diamond one point, a
+   * cylinder's top the apex of its cap. Two rectangles facing each other therefore share a line wherever they sit; two
+   * diamonds only when their vertices line up. This is a budget, not the final polyline: the router still adds the
+   * length an obstacle demands, and the channel stage still decides which lanes exist.
+   *
+   * A side another edge already holds is charged for the L it costs: the packer has to move this pair's port at least
+   * a port separation along the side, which turns the one corner the pair counted on into a jog. A Z is not charged -
+   * it was already off the line, and a port that moves along its side does not add a corner to it.
+   */
+  const bendBudget = (fromId: string, toId: string, exit: Side, entry: Side, index: number): number => {
+    const from = endBox(fromId) as Box
+    const to = endBox(toId) as Box
+    if (facesAway(from, to, exit) || facesAway(to, from, entry)) return 4
+    if (isVerticalSide(exit) === isVerticalSide(entry)) {
+      // Parallel: a straight run only when the two stubs travel the same way and the sides can meet on one line.
+      const out = normalOf(exit)
+      const into = normalOf(entry)
+      const sameWay = out.x === -into.x && out.y === -into.y
+      const fromSpan = spanOf(fromId, exit, true)
+      const toSpan = spanOf(toId, entry, true)
+      const meet = fromSpan.low <= toSpan.high + 0.01 && toSpan.low <= fromSpan.high + 0.01
+      return sameWay && meet ? 0 : 2
+    }
+    // Perpendicular: one corner when the vertical side can be placed at the horizontal side's stub end.
+    const horizontalId = isVerticalSide(exit) ? toId : fromId
+    const horizontalSide = isVerticalSide(exit) ? entry : exit
+    const verticalId = isVerticalSide(exit) ? fromId : toId
+    const verticalSide = isVerticalSide(exit) ? exit : entry
+    if (!offers(verticalId, verticalSide, stubAlong(horizontalId, horizontalSide, verticalSide))) return 2
+    const crowded = takenSides(fromId, index).includes(exit) || takenSides(toId, index).includes(entry)
+    return crowded ? 2 : 1
+  }
+
+  /**
+   * The side a discrete port takes: the point whose pair with the edge's other end bends least.
+   *
+   * `partner` is the side the other end holds - the side it was claimed, or, until it is claimed, the side the route
+   * approaches by. The bend budget comes first. Equal budgets fall back to the rule that was here before: the cosine
+   * of the outward normal against the direction to the other box, then the point nearest that box, then the ground
+   * between the two points - the small length term. So a case that already read well does not move, and a point that
+   * costs an extra corner loses even when it faces the target more squarely.
+   */
+  const bestSide = (id: string, otherId: string, end: 'exit' | 'entry', partner: Side, index: number): Side | undefined => {
+    const box = endBox(id) as Box
+    const other = endBox(otherId) as Box
+    const centre = { x: box.x + box.width / 2, y: box.y + box.height / 2 }
+    const toward = { x: other.x + other.width / 2 - centre.x, y: other.y + other.height / 2 - centre.y }
+    const reach = Math.hypot(toward.x, toward.y)
+    const taken = takenSides(id, index)
+    let best: { side: Side; bends: number; score: number; near: number; ground: number } | undefined
+    for (const side of PORT_SIDES) {
+      if (taken.includes(side)) continue
+      const bends = end === 'exit' ? bendBudget(id, otherId, side, partner, index) : bendBudget(otherId, id, partner, side, index)
+      const normal = normalOf(side)
+      const score = reach === 0 ? 0 : (normal.x * toward.x + normal.y * toward.y) / reach
+      // How far the point is from the other box's rectangle: the nearest port is the one the edge reaches first.
+      const point = anchor(box, side)
+      const near = Math.hypot(
+        Math.max(other.x - point.x, 0, point.x - (other.x + other.width)),
+        Math.max(other.y - point.y, 0, point.y - (other.y + other.height)),
+      )
+      const partnerPoint = anchor(other, partner)
+      const ground = Math.abs(point.x - partnerPoint.x) + Math.abs(point.y - partnerPoint.y)
+      const better =
+        best === undefined ||
+        bends < best.bends ||
+        (bends === best.bends &&
+          (score > best.score + 1e-9 ||
+            (Math.abs(score - best.score) <= 1e-9 &&
+              (near < best.near - 1e-9 || (Math.abs(near - best.near) <= 1e-9 && ground < best.ground - 1e-9)))))
+      if (better) best = { side, bends, score, near, ground }
+    }
+    return best?.side
+  }
+
+  /**
+   * The sides an edge leaves and enters by when no claimed point decides either end: the pair the budget likes best.
+   *
+   * Only the two same-kind pairs are offered. Both ends here spread their ports along a side, so the choice is which
+   * side of the box the edge travels on; a pair that turns the corner one side further is the case `bestEnd` decides,
+   * where a claimed point has already fixed the near end. A pair strictly cheaper than the one the route approaches by
+   * wins; an equal pair keeps the approach, which leaves a drawing that was already right exactly as it was.
+   */
+  const bestPair = (fromId: string, toId: string, index: number): { exit: Side; entry: Side } => {
+    const approach = approachSides(endBox(fromId) as Box, endBox(toId) as Box)
+    const pairs: Array<{ exit: Side; entry: Side }> = [
+      { exit: 'bottom', entry: 'top' },
+      { exit: 'top', entry: 'bottom' },
+      { exit: 'right', entry: 'left' },
+      { exit: 'left', entry: 'right' },
+    ]
+    let best = approach
+    let bestBends = bendBudget(fromId, toId, approach.exit, approach.entry, index)
+    for (const pair of pairs) {
+      const bends = bendBudget(fromId, toId, pair.exit, pair.entry, index)
+      if (bends >= bestBends) continue
+      best = pair
+      bestBends = bends
+    }
+    return best
+  }
+
+  /**
+   * The side one end takes when the other end has already been decided: the cheapest of the four.
+   *
+   * The side the route approaches by wins a tie, for the same reason as `bestPair` - a drawing that already read well
+   * does not move for a pair the budget cannot tell apart.
+   */
+  const bestEnd = (id: string, otherId: string, end: 'exit' | 'entry', partner: Side, index: number): Side => {
+    const approach =
+      end === 'exit'
+        ? approachSides(endBox(id) as Box, endBox(otherId) as Box).exit
+        : approachSides(endBox(otherId) as Box, endBox(id) as Box).entry
+    let best = approach
+    let bestBends = end === 'exit' ? bendBudget(id, otherId, approach, partner, index) : bendBudget(otherId, id, partner, approach, index)
+    for (const side of PORT_SIDES) {
+      const bends = end === 'exit' ? bendBudget(id, otherId, side, partner, index) : bendBudget(otherId, id, partner, side, index)
+      if (bends >= bestBends) continue
+      best = side
+      bestBends = bends
+    }
+    return best
+  }
+
+  // A side the drawing has already decided is claimed first, because a point there would point the route away from
+  // the corridor it has to run in: a long edge leaves by the side its lane starts from, and an edge read across two
+  // wrapped columns leaves and arrives on the sides the reading order turns at.
+  diagram.edges.forEach((edge, index) => {
+    if (edge.from === edge.to) return
+    const source = endBox(edge.from)
+    const target = endBox(edge.to)
+    if (source === undefined || target === undefined) return
+    if (placement.across.has(index)) {
+      claim(edge.from, index, 'exit', 'right')
+      claim(edge.to, index, 'entry', 'left')
+      return
+    }
+    const lane = placement.lanes.get(index)
+    if (lane === undefined || lane.points.length === 0) return
+    const down = target.y > source.y
+    claim(edge.from, index, 'exit', down ? 'bottom' : 'top')
+    claim(edge.to, index, 'entry', down ? 'top' : 'bottom')
+  })
+
+  // Then a symbol with four legal points gives every edge end a point of its own, in source order, until the four are
+  // gone. Only a node that needs one port, or one whose points are all spoken for, keeps the old answer - the side the
+  // route approaches by - and then two edges share that side's single point and fan apart later. That is the fallback,
+  // and it is why a decision with two labelled branches no longer draws both of them from one vertex.
+  diagram.edges.forEach((edge, index) => {
+    if (edge.from === edge.to) return
+    const source = endBox(edge.from)
+    const target = endBox(edge.to)
+    if (source === undefined || target === undefined) return
+    for (const end of ['exit', 'entry'] as const) {
+      if (claimed.has(endKey(index, end))) continue
+      const id = end === 'exit' ? edge.from : edge.to
+      if ((endsAt.get(id) ?? 0) < 2) continue
+      if (!hasDiscretePorts(shapeOf(id))) continue
+      // The side the other end holds, or will hold if nothing claims it first.
+      const approached = approachSides(source, target)
+      const partner =
+        claimed.get(endKey(index, end === 'exit' ? 'entry' : 'exit')) ??
+        (end === 'exit' ? approached.entry : approached.exit)
+      const side = bestSide(id, end === 'exit' ? edge.to : edge.from, end, partner, index)
+      if (side === undefined) continue
+      claim(id, index, end, side)
+    }
+  })
+
+  const facing = diagram.edges.map((edge, index): Facing | undefined => {
+    const source = endBox(edge.from)
+    const target = endBox(edge.to)
+    if (source === undefined || target === undefined || edge.from === edge.to) return undefined
+    // A wrapped drawing is read in columns: the edge from one column to the next leaves and arrives at the side,
+    // which is the direction that reading order travels. A column is always to the right of the one before it.
+    if (placement.across.has(index)) return { exit: 'right', entry: 'left' }
+    const lane = placement.lanes.get(index)
+    // A lane runs down the page, so its ends face the rows above and below wherever the box centres are.
+    const down = target.y > source.y
+    if (lane !== undefined && lane.points.length > 0) {
+      return {
+        exit: claimed.get(endKey(index, 'exit')) ?? (down ? 'bottom' : 'top'),
+        entry: claimed.get(endKey(index, 'entry')) ?? (down ? 'top' : 'bottom'),
+        at: lane.points[0].x,
+      }
+    }
+    // No claimed point and no lane: an end that was claimed keeps its point, the other one takes the side the budget
+    // likes best against it; with neither claimed, the pair is chosen together.
+    const exit = claimed.get(endKey(index, 'exit'))
+    const entry = claimed.get(endKey(index, 'entry'))
+    if (exit !== undefined && entry !== undefined) return { exit, entry }
+    if (exit !== undefined) return { exit, entry: bestEnd(edge.to, edge.from, 'entry', exit, index) }
+    if (entry !== undefined) return { exit: bestEnd(edge.from, edge.to, 'exit', entry, index), entry }
+    return bestPair(edge.from, edge.to, index)
+  })
+  // A long edge's lane is where the whole edge runs, so a fan moves the lane instead of bending the edge twice at its
+  // ends. It tries the place that keeps the set evenly spaced first, then its own place moved by the same offset; a
+  // move that would cross a box is refused, because an edge through a box is the worse defect. Refused, the edge keeps
+  // its lane - the two ports still differ, because every long edge already has a lane of its own.
+  const laneClear = (points: Point[], x: number, from: Box, to: Box): boolean => {
+    for (let at = 0; at + 1 < points.length; at += 1) {
+      for (const box of boxList) {
+        if (box === from || box === to) continue
+        if (crossesBox(x, points[at].y, x, points[at + 1].y, box)) return false
+      }
+    }
+    return true
+  }
+  const laneShift = new Map<number, number>()
+  for (const list of multiEdgeSets.values()) {
+    if (list.length < 2) continue
+    const lead = placement.lanes.get(list[0] as number)
+    if (lead === undefined || lead.points.length === 0) continue
+    const base = (lead.points[0] as Point).x
+    const taken = new Set<number>()
+    for (const index of list) {
+      const lane = placement.lanes.get(index) as { points: Point[] }
+      const own = lane.points[0].x
+      const offset = fanOf.get(index) ?? 0
+      const edge = diagram.edges[index] as DiagramEdge
+      const from = endBox(edge.from) as Box
+      const to = endBox(edge.to) as Box
+      let target = own
+      if (offset !== 0) {
+        for (const candidate of [base + offset, own + offset]) {
+          if (taken.has(candidate) || !laneClear(lane.points, candidate, from, to)) continue
+          target = candidate
+          break
+        }
+      }
+      taken.add(target)
+      if (target !== own) laneShift.set(index, target - own)
+    }
+  }
+
+  const wanted = new Map<string, number>()
+  const slotKey = (boxId: string, side: Side, index: number): string => boxId + ':' + side + ':' + String(index)
+  for (const [index, entry] of facing.entries()) {
+    if (entry === undefined) continue
+    const edge = diagram.edges[index]
+    const from = endBox(edge.from) as Box
+    const to = endBox(edge.to) as Box
+    const middle = (box: Box, side: Side): number => (isVerticalSide(side) ? box.x + box.width / 2 : box.y + box.height / 2)
+    const fromMiddle = middle(from, entry.exit)
+    const toMiddle = middle(to, entry.entry)
+    // Both ports sit on one line - and the edge is a straight run - when the source's middle falls on the target's
+    // side; otherwise the line is the target's middle clamped into the source's side, which is as close to a straight
+    // run as a box that does not overlap the other allows. A long edge asks for the point its own lane meets instead,
+    // and takes the corner nearest it when the lane runs outside the box: that edge turns anyway, and a straight edge
+    // made to give up its port would gain two bends for nothing.
+    const corner = entry.at !== undefined
+    // The k-th edge of a multi-edge set runs on a line of its own, perpendicular to the direction it runs: the fan's
+    // offset is added to the side's own coordinate, which is x for a vertical run and y for a horizontal one. A long
+    // edge carries the offset in its lane instead, so the whole edge moves rather than gaining two bends.
+    const offset = fanOf.get(index) ?? 0
+    let exitWanted: number
+    let entryWanted: number
+    if (entry.at !== undefined) {
+      const chosen = entry.at + (laneShift.get(index) ?? 0)
+      exitWanted = clampTo(edge.from, entry.exit, chosen, corner)
+      entryWanted = clampTo(edge.to, entry.entry, chosen, corner)
+    } else if (isVerticalSide(entry.exit) === isVerticalSide(entry.entry)) {
+      // Two ports on sides of the same kind: one coordinate serves both, as it always has.
+      const target = spanOf(edge.to, entry.entry, false)
+      const chosen = (fromMiddle >= target.low && fromMiddle <= target.high ? fromMiddle : clampTo(edge.from, entry.exit, toMiddle, false)) + offset
+      exitWanted = clampTo(edge.from, entry.exit, chosen, corner)
+      entryWanted = clampTo(edge.to, entry.entry, chosen, corner)
+    } else {
+      // The two ports sit on sides of different kinds, which a discrete point causes. The end that is fixed on its
+      // symbol's point keeps that point's coordinate; the other one sits where the route actually arrives - one step
+      // out of the fixed port along that port's own normal, read on the free side's axis - so the two legs of the
+      // route meet in one corner instead of jogging sideways to reach a middle the route never passes.
+      exitWanted = hasDiscretePorts(shapeOf(edge.from))
+        ? fromMiddle
+        : clampTo(edge.from, entry.exit, stubAlong(edge.to, entry.entry, entry.exit), false) + offset
+      entryWanted = hasDiscretePorts(shapeOf(edge.to))
+        ? toMiddle
+        : clampTo(edge.to, entry.entry, stubAlong(edge.from, entry.exit, entry.entry), false) + offset
+    }
+    wanted.set(slotKey(edge.from, entry.exit, index), exitWanted)
+    wanted.set(slotKey(edge.to, entry.entry, index), entryWanted)
+  }
+  const sides = new Map<string, Array<{ index: number; wanted: number }>>()
+  for (const [index, entry] of facing.entries()) {
+    if (entry === undefined) continue
+    const edge = diagram.edges[index]
+    sides.set(edge.from + ':' + entry.exit, [
+      ...(sides.get(edge.from + ':' + entry.exit) ?? []),
+      { index, wanted: wanted.get(slotKey(edge.from, entry.exit, index)) as number },
+    ])
+    sides.set(edge.to + ':' + entry.entry, [
+      ...(sides.get(edge.to + ':' + entry.entry) ?? []),
+      { index, wanted: wanted.get(slotKey(edge.to, entry.entry, index)) as number },
+    ])
+  }
+  // Pack every side, then hand each entry the position its exit was given: a pair that faced each other sat on one x
+  // before packing, and an edge the packing had to move should keep its straight run rather than gain two bends.
+  let placedPort = new Map<string, number>()
+  for (let round = 0; round < 3; round += 1) {
+    placedPort = new Map<string, number>()
+    for (const [key, list] of sides) {
+      const [boxId, side] = key.split(':') as [string, Side]
+      const span = spanOf(boxId, side, true)
+      const order = [...list].sort((left, right) => left.wanted - right.wanted || left.index - right.index)
+      const packed = packPorts(
+        order.map((entry) => clampTo(boxId, side, entry.wanted, true)),
+        span.low,
+        span.high,
+      )
+      order.forEach((entry, at) => placedPort.set(slotKey(boxId, side, entry.index), packed[at]))
+    }
+    let moved = false
+    for (const [index, entry] of facing.entries()) {
+      if (entry === undefined) continue
+      const edge = diagram.edges[index]
+      const vertical = entry.exit === 'bottom' || entry.exit === 'top'
+      if (!vertical) continue
+      const exit = placedPort.get(slotKey(edge.from, entry.exit, index)) as number
+      if (Math.abs(exit - (placedPort.get(slotKey(edge.to, entry.entry, index)) as number)) < 0.01) continue
+      // Only an entry that can reach the exit's x asks for it: a box that does not span it keeps its own point.
+      if (Math.abs(clampTo(edge.to, entry.entry, exit, true) - exit) > 0.01) continue
+      for (const slot of sides.get(edge.to + ':' + entry.entry) as Array<{ index: number; wanted: number }>) {
+        if (slot.index !== index) continue
+        slot.wanted = exit
+        moved = true
+      }
+    }
+    if (!moved) break
+  }
+
+  /**
+   * A batch of arrows into one box from one side is one bundle, not a comb: which ends may merge is the planner's
+   * answer (`trunk.ts` carries the rules), and this module supplies what only it knows - which edges have a run of
+   * their own, and where each port landed.
+   *
+   * The plan is made twice. The first pass, from the ports the packing gave, says which ends merge; the centring rule
+   * below reads it, because a merged branch is drawn into the bundle's one port and that - not its own entry port -
+   * is the coordinate its exit either shares a line with or does not. The second pass is made from the centred ports
+   * and is the plan the drawing uses: the run it lays out is the run of the ports that are actually drawn.
+   */
+  const trunkEnds: TrunkEnd[] = []
+  diagram.edges.forEach((edge, index) => {
+    const entry = facing[index]
+    if (entry === undefined) return
+    const runY = placement.runs.get(index)
+    trunkEnds.push({
+      index,
+      from: edge.from,
+      to: edge.to,
+      exit: entry.exit,
+      entry: entry.entry,
+      ...(edge.arrow === undefined ? {} : { arrow: edge.arrow }),
+      ...(runY === undefined ? {} : { runY }),
+    })
+  })
+  const planFor = (exitPortOf: (index: number) => Point | undefined): TrunkPlan =>
+    planTrunks({
+      ends: trunkEnds,
+      // Only a node's own box is a trunk target: an arrow into a boundary points past it, not at it.
+      boxOf: (id) => boxes.get(id),
+      boxes: boxList,
+      exitPortOf,
+    })
+  /** Where an edge's exit port sits before the centring rule has had its say. */
+  const packedExit = (index: number): Point | undefined => {
+    const entry = facing[index]
+    if (entry === undefined) return undefined
+    const edge = diagram.edges[index] as DiagramEdge
+    const coordinate = placedPort.get(slotKey(edge.from, entry.exit, index))
+    return coordinate === undefined ? undefined : pointOn(edge.from, entry.exit, coordinate)
+  }
+  const planned = planFor(packedExit)
+
+  /**
+   * Does the channel stage's lane pin this port to its own coordinate? A port off its lane is a jog added to the run.
+   * A merged branch has a lane the painter never follows - the branch is drawn from its exit to the trunk - so it is
+   * not pinned by it.
+   */
+  const onLane = (index: number, coordinate: number): boolean => {
+    if (planned.groupOf.has(index)) return false
+    const lane = placement.lanes.get(index)
+    if (lane === undefined || lane.points.length === 0) return false
+    return Math.abs((lane.points[0] as Point).x - coordinate) <= 0.5
+  }
+
+  /**
+   * A side's ports as the centring rule reads them: where they are now, and how far the whole row would move to be
+   * centred. The row is the side, so its ports move together and not one by one.
+   */
+  interface PortRow {
+    boxId: string
+    side: Side
+    /** The edge indexes in the row, in the row's own order, and the coordinate each one sits at. */
+    indexes: number[]
+    at: number[]
+    /** Where each index sits in `at`, so a partner port can be read without searching. */
+    position: Map<number, number>
+    /** How far the whole row travels to be centred. Zero when it already is. */
+    shift: number
+    /** Whether it may travel at all: the fixpoint below only ever takes this away. */
+    allowed: boolean
+  }
+
+  const rows: PortRow[] = []
+  const rowOf = new Map<string, PortRow>()
+  for (const [key, list] of sides) {
+    const [boxId, side] = key.split(':') as [string, Side]
+    const span = spanOf(boxId, side, true)
+    const slots = [...list]
+      .map((entry) => ({ index: entry.index, at: placedPort.get(slotKey(boxId, side, entry.index)) as number }))
+      .sort((left, right) => left.at - right.at || left.index - right.index)
+    const centred = centreRun(
+      slots.map((slot) => slot.at),
+      span.low,
+      span.high,
+    )
+    const first = slots[0] as { index: number; at: number }
+    const row: PortRow = {
+      boxId,
+      side,
+      indexes: slots.map((slot) => slot.index),
+      at: slots.map((slot) => slot.at),
+      position: new Map(slots.map((slot, at) => [slot.index, at] as const)),
+      shift: (centred[0] as number) - first.at,
+      allowed: true,
+    }
+    rows.push(row)
+    rowOf.set(key, row)
+  }
+
+  /** Where a port of a row will sit once the rows that may move have moved. */
+  const movedAt = (row: PortRow, at: number): number => (row.at[at] as number) + (row.allowed ? row.shift : 0)
+
+  /**
+   * The coordinate the port at the other end of this edge sits at, and the row that port belongs to.
+   *
+   * Three ends are not a drawn port of a row: the entry of a merged branch (the bundle has one port), the shared
+   * entry itself (the planner's `entryAlong`), and a partner on a side of the other kind (a discrete symbol's point,
+   * on a different axis). Each is a fixed coordinate or nothing, which is all the pin test needs.
+   */
+  const partnerOf = (boxId: string, side: Side, index: number): { coordinate: number; row?: PortRow; at?: number } | undefined => {
+    const entry = facing[index]
+    if (entry === undefined) return undefined
+    const edge = diagram.edges[index] as DiagramEdge
+    const isExit = edge.from === boxId && entry.exit === side
+    const groupId = planned.groupOf.get(index)
+    if (groupId !== undefined) {
+      // A merged branch ends at the bundle's one port, so its own entry port is not drawn and pins nothing. Its exit
+      // is drawn, and the line it may share is the one to that shared port.
+      if (!isExit) return undefined
+      const group = planned.groups[groupId] as TrunkGroup
+      if (isVerticalSide(side) !== isVerticalSide(group.side)) return undefined
+      return { coordinate: group.entryAlong }
+    }
+    const partnerId = isExit ? edge.to : edge.from
+    const partnerSide = isExit ? entry.entry : entry.exit
+    if (isVerticalSide(side) !== isVerticalSide(partnerSide)) return undefined
+    const coordinate = placedPort.get(slotKey(partnerId, partnerSide, index))
+    if (coordinate === undefined) return undefined
+    const row = rowOf.get(partnerId + ':' + partnerSide)
+    return { coordinate, ...(row === undefined ? {} : { row, at: row.position.get(index) as number }) }
+  }
+
+  /**
+   * A side that carries one port is centred on it; a side that carries several keeps its spread, translated as a
+   * whole so its outer ports sit symmetrically about the middle.
+   *
+   * A port is put where the route wants it, and a side that carries one relation has no spread to fit: the only
+   * reason its port is not in the middle is that the route asked for a coordinate near one end - the far end of the
+   * span, the point a lane runs at. That request is real, and the bend budget decides whether it may be overruled.
+   * A port that shares a line with the port at the other end of its edge is the middle of a straight run, and a port
+   * on a lane is the end of a channel: moving either adds two corners. Every other port moves to where its side has
+   * room, which costs nothing.
+   *
+   * So the bend budget is a fixpoint over rows, not a test per port: a row may move unless that breaks a line it
+   * shares with a port that is staying. Two ends of one straight line may both move when they move by the same
+   * amount - which is what centring both sides of one pair does - so the rows are resolved together, and a row that
+   * is refused takes the lines it shares with it.
+   */
+  for (let pass = 0; pass < rows.length; pass += 1) {
+    let refused = false
+    for (const row of rows) {
+      if (!row.allowed || row.shift === 0) continue
+      const pinned = row.indexes.some((index, at) => {
+        if (onLane(index, row.at[at] as number)) return true
+        const partner = partnerOf(row.boxId, row.side, index)
+        if (partner === undefined) return false
+        // Only a line that exists now can be broken: two ports that already differ are a Z, and moving one end of a Z
+        // along its own side changes where its corners are, not how many.
+        if (Math.abs((row.at[at] as number) - partner.coordinate) > 0.5) return false
+        const partnerAt = partner.row === undefined ? partner.coordinate : movedAt(partner.row, partner.at as number)
+        return Math.abs(movedAt(row, at) - partnerAt) > 0.5
+      })
+      if (!pinned) continue
+      row.allowed = false
+      refused = true
+    }
+    if (!refused) break
+  }
+  for (const row of rows) {
+    if (!row.allowed || row.shift === 0) continue
+    row.indexes.forEach((index, at) => placedPort.set(slotKey(row.boxId, row.side, index), movedAt(row, at)))
+  }
+
+  const portOf = (boxId: string, side: Side, edgeIndex: number): Point => {
+    const coordinate = placedPort.get(slotKey(boxId, side, edgeIndex)) as number
+    return pointOn(boxId, side, coordinate)
+  }
+  const anchorsFor = new Map<number, Ports>()
+  for (const [index, entry] of facing.entries()) {
+    if (entry === undefined) continue
+    const edge = diagram.edges[index]
+    anchorsFor.set(index, {
+      exit: portOf(edge.from, entry.exit, index),
+      entry: portOf(edge.to, entry.entry, index),
+      exitSide: entry.exit,
+      entrySide: entry.entry,
+    })
+  }
+
+  const trunks = planFor((index) => anchorsFor.get(index)?.exit)
+  // The one port each accepted bundle enters by: the middle of the target's side, which is the port the planner
+  // centred on `entryAlong`. A merged entry is one port, so the rule for a side with one port applies to it, and the
+  // target carries one relation's worth of ports however many arrows point at it.
+  const sharedEntry = new Map<number, Point>()
+  for (const group of trunks.groups) sharedEntry.set(group.id, pointOn(group.target, group.side, group.entryAlong))
+
+  /** The points a drawn edge passes through, whichever of the two shapes carries it. */
+  const pointsOfRoute = (shape: LinkShape | PathShape): Point[] =>
+    shape.kind === 'path' ? shape.points : [{ x: shape.x1, y: shape.y1 }, { x: shape.x2, y: shape.y2 }]
+
+  /** The straight pieces an edge draws, so a label can tell its own line from every other one. */
+  const segmentsOfRoute = (shape: LinkShape | PathShape): Segment[] => {
+    const points = pointsOfRoute(shape)
+    const out: Segment[] = []
+    for (let index = 0; index + 1 < points.length; index += 1) {
+      const from = points[index]
+      const to = points[index + 1]
+      out.push({ x1: from.x, y1: from.y, x2: to.x, y2: to.y })
+    }
+    return out
+  }
+
+  /** Paint one edge as a polyline. Its label is placed once every edge is drawn; see the pass after the loop. */
+  const paintPath = (edgeIndex: number, edge: DiagramEdge, points: Point[], colour: ColourRole): void => {
+    const shape: PathShape = {
+      kind: 'path',
+      points,
+      label: edge.label,
+      labelX: 0,
+      labelY: 0,
+      colour,
+      ...(edge.dashed === undefined ? {} : { dashed: edge.dashed }),
+      ...(edge.arrow === undefined ? {} : { arrow: edge.arrow }),
+    }
+    shapes.push(shape)
+    routes.push({ shape, edge: edgeIndex, fixed: false })
+  }
+
+  /** Two points are a line and more of them are a polyline; both are an edge carrying a label. */
+  const paintRoute = (edgeIndex: number, edge: DiagramEdge, points: Point[], colour: ColourRole): void => {
+    if (points.length > 2) {
+      paintPath(edgeIndex, edge, points, colour)
+      return
+    }
+    const exit = points[0]
+    const entry = points[points.length - 1]
+    const shape: LinkShape = {
+      kind: 'link',
+      x1: exit.x,
+      y1: exit.y,
+      x2: entry.x,
+      y2: entry.y,
+      label: edge.label,
+      labelX: 0,
+      labelY: 0,
+      colour,
+      ...(edge.dashed === undefined ? {} : { dashed: edge.dashed }),
+      ...(edge.arrow === undefined ? {} : { arrow: edge.arrow }),
+    }
+    shapes.push(shape)
+    routes.push({ shape, edge: edgeIndex, fixed: false })
+  }
+
+  /**
+   * Is this route clear of every box it does not terminate at?
+   *
+   * One test, used by every stage. A run, a lane and a trunk branch are proposals made from the layout; when the
+   * proposal meets a box - which happens when the layout reserved a run between two boundaries while the painter
+   * draws the boxes inside them - the proposal is refused and the router gets the edge.
+   */
+  const clearOfBoxes = (points: Point[], from: Box, to: Box): boolean => boxesCrossedBy(points, from, to, boxList).length === 0
+
+  /**
+   * The polyline through a run: out of one port, across the strip between two rows, and into the other, square to
+   * whatever side each port belongs to.
+   *
+   * Two ports on top and bottom sides come out as the polyline the run always drew. A port on a left or right side
+   * cannot be entered by a vertical drop, so the route steps out of it by one stub first and the strip meets the port
+   * at a right angle: the edge leaves - or arrives - by the side its point belongs to, which is the side the router is
+   * told about too.
+   */
+  const runRoute = (ports: Ports, runY: number): Point[] => {
+    const out = isVerticalSide(ports.exitSide) ? 0 : normalOf(ports.exitSide).x * ROUTE_STUB
+    const into = isVerticalSide(ports.entrySide) ? 0 : normalOf(ports.entrySide).x * ROUTE_STUB
+    // A sideways port and a vertical one meet where the other port already is, if that is the way the stub points: the
+    // stub is the straight run out of the port, and it is worth more than a stub to avoid the point-wide jog that
+    // meeting at the nominal length leaves behind - a jog the edge would be charged a bend for and a reader for
+    // nothing. Only when the other port is on the far side does the stub have to overshoot.
+    const exitRun = out !== 0 && into === 0 && Math.sign(ports.entry.x - ports.exit.x) === Math.sign(out) ? ports.entry.x : ports.exit.x + out
+    const entryRun = into !== 0 && out === 0 && Math.sign(ports.exit.x - ports.entry.x) === Math.sign(into) ? ports.exit.x : ports.entry.x + into
+    const points: Point[] = [ports.exit]
+    if (out !== 0) points.push({ x: exitRun, y: ports.exit.y })
+    points.push({ x: exitRun, y: runY }, { x: entryRun, y: runY })
+    if (into !== 0) points.push({ x: entryRun, y: ports.entry.y })
+    points.push(ports.entry)
+    return simplify(points)
+  }
+
+  /**
+   * Can the run draw this edge at all?
+   *
+   * A port on a top or bottom side faces along the vertical run, and the strip has to be on the side the port faces. A
+   * point that faces away - the last of a diamond's four, when the others are taken - would have the route leave the
+   * port and come straight back through its own box. Such an edge is the router's to draw: going round a box is what
+   * the router does, and it knows the box is there.
+   */
+  const runFits = (ports: Ports, runY: number): boolean => {
+    if (isVerticalSide(ports.exitSide) && Math.abs(runY - ports.exit.y) > 0.5) {
+      if (Math.sign(runY - ports.exit.y) !== Math.sign(normalOf(ports.exitSide).y)) return false
+    }
+    if (isVerticalSide(ports.entrySide) && Math.abs(ports.entry.y - runY) > 0.5) {
+      if (Math.sign(ports.entry.y - runY) !== -Math.sign(normalOf(ports.entrySide).y)) return false
+    }
+    return true
+  }
+
+  /** Where a branch meets its trunk, one per merged edge. They are drawn after every line, so no line covers one. */
+  const junctions: JunctionShape[] = []
+  for (const [edgeIndex, edge] of diagram.edges.entries()) {
+    const source = endBox(edge.from)
+    const target = endBox(edge.to)
+    if (source === undefined || target === undefined) continue
+    const colour = roleById.get(edge.from) ?? 'muted'
+
+    if (edge.from === edge.to) {
+      const x = source.x + source.width
+      const y = source.y + source.height / 2
+      const shape: PathShape = {
+        kind: 'path',
+        points: [
+          { x, y: y - 9 },
+          { x: x + 14, y: y - 9 },
+          { x: x + 14, y: y + 9 },
+          { x, y: y + 9 },
+        ],
+        label: edge.label,
+        // The one label that is not on its own edge: a self loop's longest run is eighteen points, and its name
+        // does not fit on that. It sits beside the loop, where it belongs to the edge and touches nothing.
+        labelX: x + 20 + textWidth(edge.label) / 2,
+        labelY: y,
+        colour,
+        ...(edge.dashed === undefined ? {} : { dashed: edge.dashed }),
+        ...(edge.arrow === undefined ? {} : { arrow: edge.arrow }),
+      }
+      shapes.push(shape)
+      routes.push({ shape, edge: edgeIndex, fixed: true })
+      continue
+    }
+
+    const anchors = anchorsFor.get(edgeIndex)
+
+    // A branch of an accepted bundle: out of its own port, square onto the trunk, along the trunk to the bundle's one
+    // port, and in. The last leg is shared with every other branch of the group, so the target is entered once; the
+    // branch still draws its own head and its own label. The junction is recorded where the branch meets the trunk,
+    // because a reader who is not shown the join reads the two lines as one line that was broken. A branch that would
+    // cross a box is refused here as well: the planner checked it, but the painter is the last stage that knows every
+    // box the drawing actually carries.
+    const groupId = trunks.groupOf.get(edgeIndex)
+    if (groupId !== undefined && anchors !== undefined) {
+      const group = trunks.groups[groupId] as TrunkGroup
+      const entry = sharedEntry.get(groupId) as Point
+      const branch: Point[] = isVerticalSide(group.side)
+        ? [anchors.exit, { x: anchors.exit.x, y: group.at }, { x: entry.x, y: group.at }, entry]
+        : [anchors.exit, { x: group.at, y: anchors.exit.y }, { x: group.at, y: entry.y }, entry]
+      const points = simplify(branch)
+      if (clearOfBoxes(points, source, target)) {
+        paintRoute(edgeIndex, edge, points, colour)
+        // The join itself, read off the two ports rather than off the emitted points: a branch that drops straight
+        // into the shared port is drawn as one segment, and its junction is still where the trunk crosses it.
+        const meet = isVerticalSide(group.side) ? { x: anchors.exit.x, y: group.at } : { x: group.at, y: anchors.exit.y }
+        junctions.push({ kind: 'junction', x: meet.x, y: meet.y, colour, trunk: group.id })
+        continue
+      }
+    }
+
+    // A long edge follows the lane the channel stage gave it: down the exit stub, across to the lane's x on the run
+    // the gap was assigned, down the lane, and across to the entry stub. The spine carries one point per gap, so the
+    // two runs are the places where a port and the lane disagree, and everything between them is one straight drop.
+    const lane = placement.lanes.get(edgeIndex)
+    if (lane !== undefined && lane.points.length > 0 && anchors !== undefined) {
+      const shift = laneShift.get(edgeIndex) ?? 0
+      const ordered = lane.reversed ? [...lane.points].reverse() : lane.points
+      const waypoints = shift === 0 ? ordered : ordered.map((point) => ({ x: point.x + shift, y: point.y }))
+      const points: Point[] = [anchors.exit]
+      let previous = anchors.exit
+      for (const waypoint of waypoints) {
+        if (Math.abs(previous.x - waypoint.x) > 0.5 && Math.abs(previous.y - waypoint.y) > 0.5) points.push({ x: previous.x, y: waypoint.y })
+        points.push(waypoint)
+        previous = waypoint
+      }
+      if (Math.abs(previous.x - anchors.entry.x) > 0.5 && Math.abs(previous.y - anchors.entry.y) > 0.5) points.push({ x: anchors.entry.x, y: previous.y })
+      points.push(anchors.entry)
+      const simplified = simplify(points)
+      if (clearOfBoxes(simplified, source, target)) {
+        paintPath(edgeIndex, edge, simplified, colour)
+        continue
+      }
+    }
+
+    // Two rows with nothing between them: the edge is the two-bend run the channel stage stacked. The run's height is
+    // an empty strip only when the two rows it was measured between are the boxes actually drawn: a run reserved
+    // between two boundaries is a strip outside them, while the painter's ports belong to boxes inside them. So the
+    // proposal is checked, not trusted, and an edge whose legs would cross a box is the router's.
+    const runY = placement.runs.get(edgeIndex)
+    if (runY !== undefined && anchors !== undefined && runFits(anchors, runY)) {
+      const points = runRoute(anchors, runY)
+      if (clearOfBoxes(points, source, target)) {
+        paintRoute(edgeIndex, edge, points, colour)
+        continue
+      }
+    }
+
+    // The router is the last stage. Its own straight-line shortcut is already refused when a box is in the way; a
+    // search that cannot finish still returns a line, and the final pass over the assembled drawing reports it.
+    paintRoute(edgeIndex, edge, routeEdge(source, target, boxList, anchors).points, colour)
+  }
+
+  // The dots last of the lines: a dot marks a join, so no line of the drawing may be drawn over it.
+  for (const dot of junctions) shapes.push(dot)
+
+  // The assembled drawing, checked once: every segment of every drawn edge against every box it does not terminate
+  // at. Each candidate route was checked before it was emitted, so this pass is the assertion that no stage slipped a
+  // segment through a box - and the place a router that found no way round is reported rather than hidden.
+  const boxEntries = Array.from(boxes.entries())
+  const routingFailures: RoutingFailure[] = []
+  for (const { shape, edge } of routes) {
+    const diagramEdge = diagram.edges[edge] as DiagramEdge
+    const source = endBox(diagramEdge.from)
+    const target = endBox(diagramEdge.to)
+    if (source === undefined || target === undefined) continue
+    for (const segment of segmentsOfRoute(shape)) {
+      for (const [id, box] of boxEntries) {
+        if (box === source || box === target) continue
+        if (!crossesBox(segment.x1, segment.y1, segment.x2, segment.y2, box)) continue
+        routingFailures.push({
+          edge,
+          from: diagramEdge.from,
+          to: diagramEdge.to,
+          box: id,
+          x1: segment.x1,
+          y1: segment.y1,
+          x2: segment.x2,
+          y2: segment.y2,
+        })
+      }
+    }
+  }
+
+  // Labels last. A label has to clear every other edge, and until the last edge is drawn the painter does not know
+  // where those are: this is why the whole pass exists rather than a decision made edge by edge.
+  const routeSegments = routes.map(({ shape }) => segmentsOfRoute(shape))
+  const placedLabels: LabelSpot[] = []
+  routes.forEach(({ shape, fixed }, at) => {
+    if (fixed) {
+      if (shape.label !== '') {
+        placedLabels.push({ x: shape.labelX, y: shape.labelY, width: textWidth(shape.label), height: LABEL_HEIGHT })
+      }
+      return
+    }
+    if (shape.label === '') return
+    const placement = placeLabel(
+      shape.label,
+      pointsOfRoute(shape),
+      boxList,
+      placedLabels,
+      routeSegments.filter((_, other) => other !== at),
+    )
+    shape.labelX = placement.x
+    shape.labelY = placement.y
+    shape.labelPlacement = {
+      run: placement.run,
+      collisions: placement.collisions,
+      boxes: placement.boxes,
+      labels: placement.labels,
+      edges: placement.edges,
+    }
+    placedLabels.push({ x: placement.x, y: placement.y, width: placement.width, height: placement.height })
+  })
+  const labelCollisions = routes.reduce((total, { shape }) => total + ((shape.labelPlacement?.collisions ?? 0) > 0 ? 1 : 0), 0)
+
+  shapes.push({ kind: 'title', x: MARGIN, y: MARGIN + 12, text: diagram.title, colour: 'text' })
+
+  const contentRight = Math.max(
+    MARGIN,
+    ...Array.from(boxes.values(), (box) => box.x + box.width),
+    ...Array.from(groupRects.values(), (rect) => rect.x + rect.width),
+  )
+  const captionLines = wrap(diagram.caption, CAPTION_CHARS)
+  const captionWidth = Math.max(...captionLines.map((line) => line.length * CAPTION_CHAR_WIDTH)) + MARGIN * 2
+  const width = Math.max(contentRight + MARGIN, captionWidth, 240)
+
+  const contentBottom = Math.max(
+    topOffset,
+    ...Array.from(boxes.values(), (box) => box.y + box.height),
+    ...Array.from(groupRects.values(), (rect) => rect.y + rect.height),
+  )
+  const captionTop = contentBottom + CAPTION_GAP
+  shapes.push({ kind: 'caption', x: MARGIN, y: captionTop, lines: captionLines, colour: captionRole(diagram.caption) })
+  const height = captionTop + captionLines.length * CAPTION_LINE + MARGIN / 2
+
+  // Everything drawn counts, including the parts that leave the box grid: an edge routed beside the drawing and a
+  // label wider than the gap between two boxes were both cut off at the right edge.
+  const extent = drawnExtent(shapes)
+  const canvasWidth = Math.max(width, extent.width + MARGIN)
+  const canvasHeight = Math.max(height, extent.height + MARGIN)
+
+  return {
+    canvas: { width: Math.round(canvasWidth), height: Math.round(canvasHeight), shapes, routingFailures, labelCollisions },
+    colours,
+  }
+}
+
+export function paint(diagram: Diagram, overrides: Partial<Palette> = {}): Canvas {
+  return paintWith(diagram, overrides).canvas
+}