flowfig 0.8.0 → 0.8.1

package/dist/geometry.js

@@ -1,4 +1,8 @@
 import { STUB } from './model.js';
+export const avoidOf = (boxes, extra, lanes) => [
+    ...extra,
+    ...boxes.map((r) => (lanes ? r : { ...r, box: true })),
+];
 const LABEL_CLEAR = 4;
 const cx = (r) => r.x + r.w / 2;
 const cy = (r) => r.y + r.h / 2;
@@ -7,63 +11,153 @@ const bezier = ([p0, p1, p2, p3], t) => {
     const [a, b, c, d] = [u * u * u, 3 * u * u * t, 3 * u * t * t, t * t * t];
     return { x: a * p0.x + b * p1.x + c * p2.x + d * p3.x, y: a * p0.y + b * p1.y + c * p2.y + d * p3.y };
 };
+const same = (r, q) => r.x === q.x && r.y === q.y && r.w === q.w && r.h === q.h;
+const sideMid = (r, side) => side === 'l'
+    ? { x: r.x, y: cy(r) }
+    : side === 'r'
+        ? { x: r.x + r.w, y: cy(r) }
+        : side === 't'
+            ? { x: cx(r), y: r.y }
+            : { x: cx(r), y: r.y + r.h };
+const sideAt = (r, side, f) => side === 'l' || side === 'r'
+    ? { x: r.x + (side === 'r' ? r.w : 0), y: r.y + r.h * f }
+    : { x: r.x + r.w * f, y: r.y + (side === 'b' ? r.h : 0) };
+const bend = (s, e, sa) => {
+    const horiz = sa === 'l' || sa === 'r';
+    const k = (horiz ? Math.abs(e.x - s.x) : Math.abs(e.y - s.y)) / 2;
+    const sign = sa === 'r' || sa === 'b' ? 1 : -1;
+    const c1 = horiz ? { x: s.x + sign * k, y: s.y } : { x: s.x, y: s.y + sign * k };
+    const c2 = horiz ? { x: e.x - sign * k, y: e.y } : { x: e.x, y: e.y - sign * k };
+    return [s, c1, c2, e];
+};
+const arcLine = (s, e, around, at) => around === 'above' || around === 'below' ? [s, { x: s.x, y: at }, { x: e.x, y: at }, e] : [s, { x: at, y: s.y }, { x: at, y: e.y }, e];
+const ARC = 50;
+const ARC_STEP = 16;
+const ARC_STEPS = 24;
+const upright = (around) => around === 'left' || around === 'right';
+const arcAt = (a, b, around, past, labelW = 0) => {
+    const rs = [a, b, ...past];
+    // A cubic arc reaches 0.75 of its control offset at t = 0.5.
+    const gap = upright(around) ? Math.max(ARC, (labelW / 2 + 12) / 0.75) : ARC;
+    if (around === 'above')
+        return Math.min(...rs.map((r) => r.y)) - gap;
+    if (around === 'below')
+        return Math.max(...rs.map((r) => r.y + r.h)) + gap;
+    if (around === 'left')
+        return Math.min(...rs.map((r) => r.x)) - gap;
+    return Math.max(...rs.map((r) => r.x + r.w)) + gap;
+};
+const spanOf = (a, b, around) => {
+    const [p, q] = upright(around) ? [cy(a), cy(b)] : [cx(a), cx(b)];
+    return [Math.min(p, q), Math.max(p, q)];
+};
+const SIDES = { above: ['t', 't'], below: ['b', 'b'], left: ['l', 'l'], right: ['r', 'r'] };
+export const hit = (curve, boxes, m) => {
+    const pts = Array.from({ length: 33 }, (_, i) => bezier(curve, i / 32));
+    return boxes.filter((r) => pts.some((q) => q.x > r.x - m && q.x < r.x + r.w + m && q.y > r.y - m && q.y < r.y + r.h + m));
+};
 /** Routes edges between measured boxes as curved SVG paths. `elbow` draws right-angle paths; `stub` splits a cross-lane edge in two. */
-export function route(edges, rects, tips = new Set(), avoid = [], area, lanes) {
+export function route(edges, rects, tips = new Set(), avoid = [], area, lanes, pad = 24) {
     const picks = [];
+    const arcs = [];
     for (const e of edges) {
         const a = rects[e.from], b = rects[e.to];
         if (!a || !b)
             continue;
         const stacked = a.x < b.x + b.w && b.x < a.x + a.w;
-        const [sa, sb] = e.sides
-            ? e.sides
-            : e.stub
-                ? ['r', 'l']
-                : e.around
-                    ? e.around === 'above'
-                        ? ['t', 't']
-                        : ['b', 'b']
-                    : stacked
-                        ? a.y < b.y
-                            ? ['b', 't']
-                            : ['t', 'b']
-                        : a.x < b.x
-                            ? ['r', 'l']
-                            : ['l', 'r'];
-        picks.push({ ...e, a, b, sa, sb });
-    }
-    const ends = new Map();
-    for (const pick of picks) {
-        for (const start of [true, false]) {
-            const key = (start ? pick.from : pick.to) + ':' + (start ? pick.sa : pick.sb);
-            if (!ends.has(key))
-                ends.set(key, []);
-            ends.get(key).push({ pick, start });
+        const others = avoid.filter((r) => r.box && !same(r, a) && !same(r, b));
+        const plain = stacked ? (a.y < b.y ? ['b', 't'] : ['t', 'b']) : a.x < b.x ? ['r', 'l'] : ['l', 'r'];
+        const past = hit(bend(sideMid(a, plain[0]), sideMid(b, plain[1]), plain[0]), others, -2);
+        const misses = (way, at) => [0.2, 0.5, 0.8].filter((f) => hit(arcLine(sideAt(a, SIDES[way][0], f), sideAt(b, SIDES[way][1], f), way, at), others, -2).length > 0)
+            .length;
+        const blocked = (way, at) => misses(way, at) === 3;
+        let around = e.around;
+        let elbow = e.elbow;
+        let arc = around && arcAt(a, b, around, past, e.labelW);
+        const outward = (way, k) => arcAt(a, b, way, past) + (way === 'above' || way === 'left' ? -1 : 1) * k * ARC_STEP;
+        if (around && blocked(around, arc)) {
+            const fits = Array.from({ length: ARC_STEPS + 1 }, (_, k) => [around, outward(around, k)]);
+            arc = fits.find(([way, at]) => !blocked(way, at))?.[1] ?? arc;
+        }
+        if (!around && !e.sides && !e.stub && !e.elbow && past.length) {
+            const ways = stacked ? ['left', 'right'] : ['above', 'below'];
+            const tries = [];
+            for (const share of [false, true])
+                for (const way of ways) {
+                    const [lo, hi] = spanOf(a, b, way);
+                    const near = arcs.filter((q) => q.way === way && q.lo < hi && lo < q.hi).map((q) => q.at);
+                    if (near.length && !share)
+                        continue;
+                    const out = way === 'above' || way === 'left' ? -1 : 1;
+                    tries.push([way, out * Math.max(out * arcAt(a, b, way, past, e.labelW), ...near.map((n) => out * n + ARC_STEP))]);
+                }
+            for (let k = 0; k <= ARC_STEPS; k++)
+                for (const way of ways)
+                    tries.push([way, outward(way, k)]);
+            const best = tries.reduce((m, t) => {
+                const n = misses(...t);
+                return n < m[0] ? [n, t] : m;
+            }, [3, undefined])[1];
+            [around, arc] = best ?? [];
+            elbow = e.elbow || !around;
         }
+        if (around) {
+            const [lo, hi] = spanOf(a, b, around);
+            arcs.push({ way: around, lo, hi, at: arc });
+        }
+        const [sa, sb] = e.sides ?? (e.stub ? ['r', 'l'] : around ? SIDES[around] : plain);
+        picks.push({ ...e, plain, a, b, sa, sb, around, arc, elbow });
     }
-    const anchor = new Map();
-    for (const [key, list] of ends) {
-        const tip = tips.has(key.slice(0, key.lastIndexOf(':')));
-        const side = list[0].start ? list[0].pick.sa : list[0].pick.sb;
-        const horiz = side === 't' || side === 'b';
-        const other = (x) => {
-            const r = x.start ? x.pick.b : x.pick.a;
-            return horiz ? cx(r) : cy(r);
-        };
-        list.sort((p, q) => other(p) - other(q));
-        list.forEach((x, i) => {
-            const r = x.start ? x.pick.a : x.pick.b;
-            const f = tip ? 0.5 : (i + 1) / (list.length + 1);
-            const pt = side === 'l'
-                ? { x: r.x, y: r.y + r.h * f }
-                : side === 'r'
-                    ? { x: r.x + r.w, y: r.y + r.h * f }
-                    : side === 't'
-                        ? { x: r.x + r.w * f, y: r.y }
-                        : { x: r.x + r.w * f, y: r.y + r.h };
-            anchor.set(x.pick.id + (x.start ? ':s' : ':e'), pt);
-        });
+    let anchor = new Map();
+    const place = () => {
+        anchor = new Map();
+        const ends = new Map();
+        for (const pick of picks) {
+            for (const start of [true, false]) {
+                const key = (start ? pick.from : pick.to) + ':' + (start ? pick.sa : pick.sb);
+                if (!ends.has(key))
+                    ends.set(key, []);
+                ends.get(key).push({ pick, start });
+            }
+        }
+        for (const [key, list] of ends) {
+            const tip = tips.has(key.slice(0, key.lastIndexOf(':')));
+            const side = list[0].start ? list[0].pick.sa : list[0].pick.sb;
+            const horiz = side === 't' || side === 'b';
+            const other = (x) => {
+                const r = x.start ? x.pick.b : x.pick.a;
+                return horiz ? cx(r) : cy(r);
+            };
+            list.sort((p, q) => other(p) - other(q));
+            list.forEach((x, i) => {
+                const r = x.start ? x.pick.a : x.pick.b;
+                const f = tip ? 0.5 : (i + 1) / (list.length + 1);
+                const pt = side === 'l'
+                    ? { x: r.x, y: r.y + r.h * f }
+                    : side === 'r'
+                        ? { x: r.x + r.w, y: r.y + r.h * f }
+                        : side === 't'
+                            ? { x: r.x + r.w * f, y: r.y }
+                            : { x: r.x + r.w * f, y: r.y + r.h };
+                anchor.set(x.pick.id + (x.start ? ':s' : ':e'), pt);
+            });
+        }
+    };
+    place();
+    let moved = false;
+    for (const p of picks) {
+        const [s, e] = [anchor.get(p.id + ':s'), anchor.get(p.id + ':e')];
+        if (!p.around || !s || !e)
+            continue;
+        const others = avoid.filter((r) => r.box && !same(r, p.a) && !same(r, p.b));
+        if (!hit(arcLine(s, e, p.around, p.arc), others, -2).length)
+            continue;
+        const [pa, pb] = p.plain;
+        const straight = hit(bend(sideMid(p.a, pa), sideMid(p.b, pb), pa), others, -2).length > 0;
+        [p.sa, p.sb, p.around, p.arc, p.elbow, moved] = [pa, pb, undefined, undefined, p.elbow || straight, true];
     }
+    if (moved)
+        place();
     const drawn = (id, curve, mid) => {
         const [s, c1, c2, e] = curve;
         return { id, d: `M ${s.x} ${s.y} C ${c1.x} ${c1.y}, ${c2.x} ${c2.y}, ${e.x} ${e.y}`, mid, curve };
@@ -80,6 +174,11 @@ export function route(edges, rects, tips = new Set(), avoid = [], area, lanes) {
         (!area || (r.x >= area.x && r.x + r.w <= area.x + area.w && r.y >= area.y && r.y + r.h <= area.y + area.h)) &&
         ![...avoid, ...pills].some((q) => r.x < q.x + q.w + 2 && q.x < r.x + r.w + 2 && r.y < q.y + q.h + 2 && q.y < r.y + r.h + 2) &&
         !paths.some((q) => q.x > r.x - 2 && q.x < r.x + r.w + 2 && q.y > r.y - 2 && q.y < r.y + r.h + 2);
+    const all = Object.values(rects);
+    const [x0, y0] = [Math.min(...all.map((r) => r.x)), Math.min(...all.map((r) => r.y))];
+    const [x1, y1] = [Math.max(...all.map((r) => r.x + r.w)), Math.max(...all.map((r) => r.y + r.h))];
+    const outside = (way, { x, y }) => (way === 'above' ? y0 - y : way === 'below' ? y - y1 : way === 'left' ? x0 - x : x - x1);
+    const roomOf = (way, at, curve, labelW) => Math.max(ARC - 6, lanes || !labelW ? outside(way, { x: at, y: at }) - 6 : outside(way, bezier(curve, 0.5)) + (upright(way) ? labelW / 2 : 9));
     const one = (p) => {
         const s = anchor.get(p.id + ':s'), e = anchor.get(p.id + ':e');
         if (p.stub) {
@@ -246,7 +345,7 @@ export function route(edges, rects, tips = new Set(), avoid = [], area, lanes) {
                     elbow: [s, { x: mx, y: s.y }, { x: mx, y: my }, { x: ex, y: my }, { x: ex, y: e.y }, e],
                 };
             }
-            const own = (r) => [p.a, p.b].some((q) => q.x === r.x && q.y === r.y && q.w === r.w && q.h === r.h);
+            const own = (r) => [p.a, p.b].some((q) => same(q, r));
             const all = avoid.filter((r) => !own(r));
             const boxes = all.filter((r) => r.box);
             const vClear = (x, ya, yb, m = 2) => !all.some((r) => x > r.x - m && x < r.x + r.w + m && Math.max(ya, yb) > r.y && Math.min(ya, yb) < r.y + r.h);
@@ -284,6 +383,12 @@ export function route(edges, rects, tips = new Set(), avoid = [], area, lanes) {
                         mid: { x: (x + ex) / 2, y },
                         curve: [s, { x, y }, { x: ex, y }, e],
                         elbow: [s, { x, y: s.y }, { x, y }, { x: ex, y }, { x: ex, y: e.y }, e],
+                        bleed: {
+                            left: Math.max(0, x0 - Math.min(x, ex)),
+                            right: Math.max(0, Math.max(x, ex) - x1),
+                            above: Math.max(0, y0 - y),
+                            below: Math.max(0, y - y1),
+                        },
                     };
                 }
             }
@@ -298,27 +403,55 @@ export function route(edges, rects, tips = new Set(), avoid = [], area, lanes) {
             };
         }
         if (p.around) {
-            // ponytail: arcs 50 px past the box ends; a taller box between can be crossed.
-            const y = p.around === 'above' ? Math.min(p.a.y, p.b.y) - 50 : Math.max(p.a.y + p.a.h, p.b.y + p.b.h) + 50;
-            return drawn(p.id, [s, { x: s.x, y }, { x: e.x, y }, e], { x: (s.x + e.x) / 2, y: (s.y + 6 * y + e.y) / 8 });
+            const curve = arcLine(s, e, p.around, p.arc);
+            return { ...drawn(p.id, curve, bezier(curve, 0.5)), around: p.around, room: roomOf(p.around, p.arc, curve, p.labelW) };
         }
-        const horiz = p.sa === 'l' || p.sa === 'r';
-        const k = (horiz ? Math.abs(e.x - s.x) : Math.abs(e.y - s.y)) / 2;
-        const sign = p.sa === 'r' || p.sa === 'b' ? 1 : -1;
-        const c1 = horiz ? { x: s.x + sign * k, y: s.y } : { x: s.x, y: s.y + sign * k };
-        const c2 = horiz ? { x: e.x - sign * k, y: e.y } : { x: e.x, y: e.y - sign * k };
-        return drawn(p.id, [s, c1, c2, e], { x: (s.x + e.x) / 2, y: (s.y + e.y) / 2 });
+        return drawn(p.id, bend(s, e, p.sa), { x: (s.x + e.x) / 2, y: (s.y + e.y) / 2 });
     };
     const done = new Map();
-    for (const p of picks) {
-        if (p.stub)
-            continue;
-        const r = one(p);
-        done.set(p, r);
-        if (p.labelW && lanes)
-            r.mid = labelInBand(r, p.labelW, lanes, pills);
+    for (const p of picks)
+        if (!p.stub)
+            done.set(p, one(p));
+    const routed = [...done.values()];
+    const areaOf = (m) => {
+        const side = (way) => Math.max(m, arcRoom(routed, way));
+        const [l, t] = [side('left'), side('above')];
+        return { x: x0 - l, y: y0 - t, w: x1 - x0 + l + side('right'), h: y1 - y0 + t + side('below') };
+    };
+    const [fig, drawnArea] = [areaOf(Math.min(pad, PLAYER_PAD)), areaOf(pad)];
+    const lineOf = (r) => r.elbow
+        ? r.elbow.slice(1).flatMap((q, k) => Array.from({ length: 17 }, (_, i) => lerp(r.elbow[k], q, i / 16)))
+        : Array.from({ length: 33 }, (_, i) => bezier(r.curve, i / 32));
+    const boxes = avoid.filter((q) => q.box);
+    const pillAt = (at, w) => ({ x: at.x - w / 2, y: at.y - 9, w, h: 18 });
+    const placeAll = (fresh) => {
+        const out = [];
+        const mids = [];
+        let bad = 0;
+        for (const [p, r] of done) {
+            if (!p.labelW)
+                continue;
+            const at = lanes
+                ? labelInBand(r, p.labelW, lanes, out)
+                : fresh
+                    ? labelAlong(r, p.labelW, boxes, out, fig, routed.filter((o) => o !== r).flatMap(lineOf))
+                    : labelAlong(r, p.labelW, boxes, out);
+            const pill = pillAt(at, p.labelW);
+            if (!inside(pill, drawnArea) || [...boxes, ...out].some((q) => overlaps(pill, q, 1)))
+                bad++;
+            out.push(pill);
+            mids.push(at);
+        }
+        return { out, mids, bad };
+    };
+    const fresh = placeAll(true);
+    const old = fresh.bad && !lanes ? placeAll(false) : fresh;
+    const use = old.bad < fresh.bad ? old : fresh;
+    pills.push(...use.out);
+    let k = 0;
+    for (const [p, r] of done) {
         if (p.labelW)
-            pills.push({ x: r.mid.x - p.labelW / 2, y: r.mid.y - 9, w: p.labelW, h: 18 });
+            r.mid = use.mids[k++];
         track(Array.from({ length: 33 }, (_, i) => bezier(r.curve, i / 32)));
     }
     for (const p of picks)
@@ -326,11 +459,66 @@ export function route(edges, rects, tips = new Set(), avoid = [], area, lanes) {
             done.set(p, one(p));
     return picks.map((p) => done.get(p));
 }
+export const arcRoom = (routed, way) => Math.max(0, ...routed.map((r) => (r.around === way ? r.room : (r.bleed?.[way] ?? 0))));
+// The player pads its root by 4 px on a side with no detour.
+const PLAYER_PAD = 4;
+const inside = (r, q) => r.x >= q.x - 0.5 && r.x + r.w <= q.x + q.w + 0.5 && r.y >= q.y - 0.5 && r.y + r.h <= q.y + q.h + 0.5;
+const overlaps = (a, b, m) => a.x < b.x + b.w + m && b.x < a.x + a.w + m && a.y < b.y + b.h + m && b.y < a.y + a.h + m;
+const lerp = (a, b, t) => ({ x: a.x + (b.x - a.x) * t, y: a.y + (b.y - a.y) * t });
+export function labelAlong(r, w, boxes, placed, fig, lines = []) {
+    const [p0, p1, p2, p3] = r.curve;
+    const spots = [];
+    const line = r.elbow;
+    const lens = line?.slice(1).map((q, k) => Math.hypot(q.x - line[k].x, q.y - line[k].y));
+    const total = lens?.reduce((m, l) => m + l, 0) ?? 0;
+    for (const t of [0.5, 0.45, 0.55, 0.4, 0.6, 0.35, 0.65, 0.3, 0.7, 0.25, 0.75, 0.2, 0.8]) {
+        let q, dx, dy;
+        if (line && lens && total > 0) {
+            let k = 0;
+            let rest = t * total;
+            while (k < lens.length - 1 && rest > lens[k])
+                rest -= lens[k++];
+            const f = lens[k] ? rest / lens[k] : 0;
+            q = lerp(line[k], line[k + 1], f);
+            [dx, dy] = [line[k + 1].x - line[k].x, line[k + 1].y - line[k].y];
+        }
+        else {
+            const u = 1 - t;
+            dx = 3 * (u * u * (p1.x - p0.x) + 2 * u * t * (p2.x - p1.x) + t * t * (p3.x - p2.x));
+            dy = 3 * (u * u * (p1.y - p0.y) + 2 * u * t * (p2.y - p1.y) + t * t * (p3.y - p2.y));
+            q = t === 0.5 ? r.mid : bezier(r.curve, t);
+        }
+        const len = Math.hypot(dx, dy) || 1;
+        for (const k of [0, 11, -11])
+            spots.push({ x: q.x - (dy / len) * k, y: q.y + (dx / len) * k });
+    }
+    const inFig = (at) => !fig || inside({ x: at.x - w / 2, y: at.y - 9, w, h: 18 }, fig);
+    const clamp = (at) => fig
+        ? {
+            x: Math.max(fig.x + w / 2, Math.min(at.x, fig.x + fig.w - w / 2)),
+            y: Math.max(fig.y + 9, Math.min(at.y, fig.y + fig.h - 9)),
+        }
+        : at;
+    const free = (at, strict) => {
+        const pill = { x: at.x - w / 2, y: at.y - 9, w, h: 18 };
+        return (inFig(at) &&
+            !boxes.some((b) => overlaps(pill, b, 1)) &&
+            !placed.some((b) => overlaps(pill, b, 1)) &&
+            (!strict || !lines.some((q) => q.x > pill.x - 2 && q.x < pill.x + w + 2 && q.y > pill.y - 2 && q.y < pill.y + 20)));
+    };
+    for (const strict of [true, false])
+        for (const at of spots)
+            if (free(at, strict))
+                return at;
+    for (const at of spots.map(clamp))
+        if (free(at, false))
+            return at;
+    return fig ? labelAlong(r, w, boxes, placed) : r.mid;
+}
 function labelInBand(r, w, { bands, boxes }, pills) {
-    const hit = (a, b, m) => a.x < b.x + b.w + m && b.x < a.x + a.w + m && a.y < b.y + b.h + m && b.y < a.y + a.h + m;
     const ts = Array.from({ length: 65 }, (_, i) => i / 64).sort((a, b) => Math.abs(a - 0.5) - Math.abs(b - 0.5));
     const path = ts.map((t) => bezier(r.curve, t));
-    const clear = (pill) => !boxes.some((b) => hit(pill, b, 1)) && !pills.some((b) => hit(pill, b, 1));
+    const clear = (pill) => !boxes.some((b) => overlaps(pill, b, 1)) && !pills.some((b) => overlaps(pill, b, 1));
     const room = (x, b) => x - w / 2 >= b.x + LABEL_CLEAR && x + w / 2 <= b.x + b.w - LABEL_CLEAR;
     for (const q of path) {
         const pill = { x: q.x - w / 2, y: q.y - 9, w, h: 18 };

package/dist/guide.d.ts

@@ -1,3 +1,23 @@
-export declare const GUIDE = "# flowfig guide\n\nflowfig draws animated flow figures. A figure has boxes, the edges between the boxes, and steps. In each step, a packet moves along\nthe edges. The output is one animated SVG with no script. The SVG plays in a GitHub README, in PR and issue comments, and in blog\nposts. A figure is about 5 to 50 kB.\n\nYou write a JSON spec. You never write SVG by hand. The command `npx flowfig` checks the spec and renders it.\n\n## What flowfig draws\n\nA spec has three forms.\n\n- The map (the default). The map shows the boxes and the edges. A packet moves along an edge in each beat.\n- The map with a rail (`\"rail\": true`). The rail is a lifeline diagram under the map. It has one row for each message.\n- The rail alone (`\"rail\": \"only\"`). Use it when the reader needs only the order of the messages, for example when the map is already in the same document.\n\nUse the rail for a sequence of messages: a request lifecycle, an API call chain, or a Mermaid `sequenceDiagram`. Put each message on\nan edge. Put each phase in a step. Put messages that run at the same time in one beat. Mark a message that does not wait for an\nanswer with `\"async\": true`: every send to a queue or a topic, every emitted event, and every call the caller does not await.\n\n## Scope: what flowfig draws and what it does not\n\nflowfig draws how something works: parts, the messages between them, and the order of the messages.\n\n| The user asks for                          | Draw                                                                                       |\n| ------------------------------------------ | ------------------------------------------------------------------------------------------ |\n| An architecture, a data flow, a pipeline   | The map. Group parts by service, network or trust boundary. `store` for data at rest.       |\n| A request lifecycle, a call chain          | The map with `\"rail\": true`. One message per hop, with its real payload in `data`.          |\n| A sequence diagram only                    | `\"rail\": \"only\"`.                                                                           |\n| A state lifecycle, a state machine         | One box per state, one edge per transition, labeled with its event. One step per path. Mark the first state with `mark: \"start\"` and each final state with `mark: \"end\"`. |\n| A flowchart with branches                  | `shape: \"decision\"` for each branch. One step per path.                                     |\n| A roadmap or a timeline | `timeline: true`. One labeled group per track, in a `column` group. Items with `from` and `to` (dates), a milestone with `from` only, an edge for a dependency, `today` for the line. A dependent item starts after its source ends. |\n| A process across roles (a ticket, an order, a refund) | `lanes: true`. One labeled group per role, in a `column` group. Put each step in the lane of the role that does it. Link each step with `source` to the SOP heading. If the steps do not fit the width, flowfig wraps the time columns into blocks and links the blocks with labeled stubs, so keep the whole process in one figure. Give the outcomes of one decision the same `at`. |\n\nflowfig draws a roadmap or a timeline with dates (`timeline: true`), and converts a Mermaid `gantt` to it. flowfig does not\ndraw class or ER diagrams (fields, types, cardinality), charts of numbers or mind maps. If the user asks for one of these, say that\nflowfig does not draw it, suggest Mermaid (`classDiagram`, `erDiagram`), and draw nothing with flowfig.\n\n## Workflow\n\n### 1. Pick the scope\n\nIf the code has more than one flow, name each flow in the reply. Then draw one flow, or draw one structure view and call it a\nstructure view. If the user asks for the whole system, draw one top view with groups, or a set of figures that together cover\nevery part. Keep each figure to 12 boxes or fewer.\n\n### 2. Write the fact list\n\nBefore the spec, write a list of the facts that the figure must show. Take each fact from the code and from its wiring: config\nfiles, compose files, route tables and queue bindings (or from the pasted Mermaid). Give each fact its `file:line`:\n\n- every part (service, function, store, queue, external system);\n- every call, in order, written as `caller \u2192 callee: payload (file:line of the call)`. The edge in the spec goes from that caller\n  to that callee;\n- every call that does not wait for an answer (fire and forget, a queue, a webhook, a callback), and every consumer of each queue\n  or topic;\n- every branch and every error path (a rejected input, a retry, a dead-letter path);\n- every end state;\n- for a process document (an SOP): every deadline, every message to a person (an email, a notice), every choice that a person\n  makes, and every wait for a reply. Put each one in a box `sub`, a step `say` or a `data` card. A small fact still counts.\n  Draw each path to its end: after a rejection, also draw the next step that the document gives. Give each path its own step.\n\nIf the code does not show a fact, leave the fact out. Do not guess a part, a name or an order.\n\n### 3. Write the spec\n\nEach fact becomes a box, an edge, a beat, a `data` card or a `show` row. Use the real names from the code as labels, and\nreal example data from the code or its tests. Keep each fact that you leave out, with the reason, for the reply.\nGive each box and edge that draws code a `source`, from the fact list: `\"src/auth/login.ts#verifyPassword\"`. A method uses `Owner.name`: `\"src/auth/session.ts#Session.refresh\"`. An edge `source` names the function that makes the call. An edge needs no `source` when the code of its `from` box makes the call. An edge across a process (HTTP, a queue, a topic, a table) gets `via`: the route, queue, topic or table name that both sides use in the code, for example `\"via\": \"order-paid\"`. A store box may have no `source`, but an edge to it still needs `via`.\nFor an HTTP edge, `via` is the path that both sides use: `\"via\": \"/internal/users\"`. An edge to a store box (a table, a file, a folder, a cache key) uses `via` with the name that the caller code uses: `\"via\": \"sales_facts\"`. A route handler with no name keeps a file `source`, and an edge into it uses `via` with the route path. An edge out of it in the same process uses no `via`.\nA box that draws a step from a document links to that document: `\"docs/sop/refunds.md#step-3-approve-the-refund\"`, the heading as a GitHub anchor. `verify` checks it the same way.\n\nMermaid mapping:\n\n| Mermaid                                  | flowfig                                                            |\n| ---------------------------------------- | ------------------------------------------------------------------ |\n| `participant`                            | a box                                                              |\n| `A->>B: text`                            | an edge from A to B, and a hop with `data: \"text\"`                 |\n| `B-->>A: text` (a reply)                 | a hop on the same edge with `back: true`                           |\n| `A-)B: text` (async)                     | a hop with `async: true`                                           |\n| `par ... and ... end`                    | the hops of all branches in one beat                               |\n| `alt` / `opt`                            | one step per path                                                  |\n| `stateDiagram` states and transitions    | boxes, and edges labeled with the event                            |\n\nA pasted design wins over the async rule: keep each arrow as the Mermaid draws it. `A->>B` stays a plain hop, also for a\nsend to a queue. Mark a hop async only for `-)`. If you think the design is wrong, say so in the reply.\n\n### 4. Render, then fix\n\n```bash\nnpx flowfig - out.svg <<'SPEC'\n{ \"props\": { \"layout\": ..., \"edges\": [...], \"steps\": [...] } }\nSPEC\n```\n\nThe quoted `<<'SPEC'` heredoc passes the JSON with no change. The command checks the spec first. If the check finds an error, the\ncommand writes no SVG and lists the faults. Fix each fault and render again.\n\n- Fix a layout fault by changing the layout first: put parts in rows or columns, route an edge `around`, or change a gap.\n  Never remove a fact from the fact list to pass the check. If you must remove one, name it in the reply.\n- If `small-text` appears, the figure is too wide. Put the parts in two rows, move a detail from `label` to `sub`, or split\n  the figure. Use more steps in one figure before you make a second figure. Keep the real name from the code in the label:\n  `ReportsController` stays `ReportsController`, not `Controller`. Do not change `--width` to pass the check: the\n  reader sees the figure at the real page width.\n- If `text-overflow` appears, a text is wider than its box. Give the box a larger `width`, move a detail from `label` to\n  `sub`, or put the detail in the step `say`. Never cut a fact, a number or a unit to make a text fit: \"within 30 days of\n  delivery\" does not become \"within 30 days\". If you must shorten a text, keep every fact and name the change in the reply.\n- Fix every other warning, or tell the user why it stays.\n- Do not use `--no-check` to hide a fault.\n\n### 5. Read the figure back\n\nRun `npx flowfig --spec out.svg`. Compare the spec with the fact list. Check that each edge goes from the caller to the callee\nthat its fact names. Add each fact that is missing, fix each wrong edge, and render again.\n\nRun `npx flowfig verify out.svg` from the repo root. Fix each `missing-file` and `missing-symbol`. For each `edge-not-found`, the code does not make that call: remove the edge, or point its `source` at the function that makes the call. An `unsure` edge is allowed, but if a function with a typed receiver makes the call, point the edge `source` at it. A `not checked` edge has no code to check: give it a `source` or a `via` if one exists. Do not invent an edge to make verify pass.\n\n### 6. Look at the SVG\n\nThe check estimates the text width, so it cannot see everything. If you can open a browser, open the SVG and take a\nscreenshot. Wait a few seconds and take a second screenshot to see a later beat. If you cannot open a browser, write \"not\nlooked at\" in the reply. Never report a look that you did not do. A browser tool can block `file://` URLs. If it does, serve the folder\nwith `python3 -m http.server`.\n\n### 7. Write the reply\n\nThe reply has these parts, in this order:\n\n1. the path of each SVG;\n2. what each figure shows: the parts and the steps. Copy the counts from the `figure:` line of the check output. Copy every name\n   from the read-back spec. Never count from memory;\n3. the scope: the flow you drew, why, and the other flows that exist;\n4. what the figure leaves out, and why;\n5. the two check lines that the render printed, `0 errors, 0 warnings` and `figure: ...`, copied as printed, and whether\n   you looked at the SVG;\n6. the `verify` edge counts from its count line, for example \"edges: 5 found, 0 not found, 1 unsure, 0 not checked\";\n7. one line `npx flowfig open <path>` for each SVG, at the end of the reply. Do not run that command yourself.\n\nTo change an SVG later, print its spec with `--spec`, change the spec, and render again.\n\n## Spec reference\n\n`props` has these fields.\n\n| Field      | Type                    | Meaning                                                                                        |\n| ---------- | ----------------------- | ---------------------------------------------------------------------------------------------- |\n| `layout`   | group                   | The boxes and how they line up. Required.                                                      |\n| `edges`    | edge[]                  | The arrows between the boxes. Required.                                                        |\n| `steps`    | step[]                  | The stories the figure tells. With no steps, the figure is a still map.                        |\n| `lanes`    | `true`                | Draw the layout as swimlanes: a `column` group of labeled groups, one per role. The boxes run left to right in step order. |\n| `timeline` | `true`               | Draw the layout as a timeline: one labeled group per track, with the boxes placed by their `from` and `to` dates. |\n| `today`    | `YYYY-MM-DD`          | In a `timeline` figure: the date where the today line stops. Default: the last date of the items. |\n| `rail`     | `true` or `\"only\"`      | Draw the steps as a lifeline rail under the map. `\"only\"` draws the rail without the map.      |\n| `speed`    | number                  | Milliseconds a packet takes to cross one edge. Default: 900.                                   |\n| `theme`    | object                  | Colors: `accent`, `fg`, `muted`, `bg`, `surface`, `border`, `font`. Each color you omit keeps its built-in value. |\n\n### layout\n\nThe layout is a tree. A group has `children` and these optional fields.\n\n- `id`: a name that an edge can use to reach the group as a whole.\n- `label`: the title on the frame. Only a group with a `label` gets a frame.\n- `direction`: `\"row\"` (the default) or `\"column\"`.\n- `gap`: the space between children in px. Default: 28 for a column. For a row, the gap fits the widest edge label between two children (at least 56).\n- `align`: `\"start\"`, `\"center\"` or `\"end\"`. This sets where the children line up across the direction.\n\nEvery other item is a box.\n\n| Box field | Meaning                                                                                                   |\n| --------- | --------------------------------------------------------------------------------------------------------- |\n| `id`      | Required. The name that edges and steps use. It must be unique in the figure.                             |\n| `label`   | Required. The title in the box.                                                                           |\n| `sub`     | A smaller line under the label.                                                                           |\n| `shape`   | `\"box\"` (default), `\"decision\"` (a diamond) or `\"store\"` (a database cylinder for data at rest).          |\n| `at`      | In a `lanes` figure: the time column of the box, 0 first. Default: the order in which the steps first reach the box. |\n| `from`    | In a `timeline` figure: the start of the item, or the date of a milestone, as YYYY-MM-DD. |\n| `to`      | In a `timeline` figure: the last day of the item, as YYYY-MM-DD. Without it the box is a milestone. |\n| `width`   | Width in px. This overrides the width that the layout picks.                                              |\n| `source`  | The code this draws: `path` or `path#Owner.name`, relative to the repo root. `flowfig verify` checks it.  |\n| `lines`   | The least number of text lines that a content card keeps. The card still grows to fit its content.        |\n| `tone`    | The state color of the box: a 1 px border and a light tint. Use `blue`, `purple`, `green`, `orange`, `red` or `gray`.                  |\n| `mark`    | `\"start\"` or `\"end\"` | A lifecycle mark: a filled dot before a start state, a ringed dot after an end state. |\n\n### edges\n\nAn edge has these fields.\n\n- `id`: the name that steps use. Default: `from->to`.\n- `from` and `to`: the `id` of a box or a group.\n- `label`: text on the edge, drawn as a small pill.\n- `around`: `\"above\"` or `\"below\"`. This routes the edge over or under the boxes in between (loops, skip-ahead edges).\n- `quiet`: if `true`, the SVG draws the edge only while a step uses it.\n- `source`: the code this edge draws, as `path` or `path#Owner.name`. `flowfig verify` checks it.\n- `via`: the route, queue, topic or table name that both sides of a cross-process edge use in the code.\n\n### steps\n\nA step has `label` and `flow`. It can also have `caption` (the line under the figure while no beat has a `say`) and `nodes` (ids of\nboxes to highlight for the whole step).\n\n`flow` is a list of beats. A beat is one of these:\n\n- an edge id (a string);\n- an array of edge ids, which run at the same time;\n- an object `{ edges?, say?, show?, light?, ms? }`. A beat with no `edges` is a pause.\n\nThe beat fields:\n\n- `edges`: an edge id, a hop object, or an array of these. A hop object is `{ edge, back?, data?, tone?, async?, source?, via? }`.\n  - `back: true` runs the packet from the `to` box to the `from` box.\n  - `data` is a small card that moves with the packet.\n  - `async: true` marks a message that does not wait for an answer. The rail draws it dashed, with an `async` tag.\n  - `tone`: the color of this hop for its beat. The packet, the data card, the edge, the label pill and the arrival box take the color. The trail after the beat stays the accent.\n    - `green`: a success or a cache hit. `orange`: a warning, a miss or a retry. `red`: an error or a rejected input.\n    - `gray`: idle or skipped. `purple`: async or background. `blue`: the default row color.\n    - If the hop has no `tone`, the arrival box uses its box `tone`, then the accent. A hop `tone` wins over a box `tone`.\n- `say`: the caption for the beat.\n- `show`: `{ boxId: [row, ...] }`. This fills the content card of each named box. The card keeps the rows until the step ends.\n- `light`: ids of boxes to highlight for this beat.\n- `ms`: how long the beat lasts. Default: the time one packet needs to cross an edge.\n\nA row of a content card is `{ tag?, tone?, text, meta?, mark?, mono? }`.\n\n- `tag`: a short colored label at the start of the line.\n- `tone`: the color of the tag: `blue` (default), `purple`, `green`, `orange`, `red` or `gray`.\n- `text`: the main text.\n- `meta`: muted text after the main text.\n- `mark`: a mark at the right end of the line, such as a check or \"new\".\n- `mono`: if `true`, the text uses a monospace font.\n\n## Content rules\n\n- Give every box a stable `id`.\n- Use `shape: \"store\"` for data at rest (a database, a cache, a file, a queue). Use a plain box for a part that does work. Use `shape: \"decision\"` for a branch.\n- Keep one clear main path, left to right. Put side parts in a `column` group.\n- Use `quiet: true` on a long edge that crosses the picture. A quiet edge needs a beat that uses it, or the check reports\n  `hidden-edge`.\n- In a rail, draw an error reply as a hop back on the same edge, with the error in `data` (`{ \"edge\": \"login\", \"back\": true,\n  \"data\": \"401 CREDENTIALS_INVALID\" }`). A call that stays inside one part (a hash check, a guard) is not a message: put it in\n  `say` or in a `show` row of that part.\n- Keep an SVG to one or two steps. The SVG plays every step in a loop, with no controls.\n- Use the React player, `<Flow {...props} />` from `flowfig`, for a page that needs tabs, pause or hover.\n\n## Example\n\n```json\n{\n  \"props\": {\n    \"layout\": {\n      \"children\": [\n        { \"id\": \"client\", \"label\": \"Browser\" },\n        { \"id\": \"api\", \"label\": \"API Server\" },\n        { \"id\": \"db\", \"label\": \"Database\", \"shape\": \"store\" }\n      ]\n    },\n    \"edges\": [\n      { \"id\": \"req\", \"from\": \"client\", \"to\": \"api\", \"label\": \"GET /users/42\" },\n      { \"id\": \"q\", \"from\": \"api\", \"to\": \"db\", \"label\": \"SELECT\" }\n    ],\n    \"steps\": [\n      {\n        \"label\": \"read\",\n        \"flow\": [\n          { \"edges\": { \"edge\": \"req\", \"data\": \"GET /users/42\" }, \"say\": \"The browser asks for user 42.\" },\n          { \"edges\": \"q\", \"show\": { \"db\": [{ \"tag\": \"row\", \"tone\": \"gray\", \"text\": \"Ada Lovelace\" }] }, \"say\": \"The API server reads the row.\" },\n          { \"edges\": { \"edge\": \"req\", \"back\": true, \"data\": \"200 OK\" }, \"say\": \"The API server sends the user.\" }\n        ]\n      }\n    ]\n  }\n}\n```\n\n## Commands\n\n```bash\nnpx flowfig - out.svg < spec.json      # render a spec from stdin\nnpx flowfig spec.json out.svg          # render a spec file\nnpx flowfig figure.ts out.svg          # render a module whose default export is a spec\nnpx flowfig check <input> [--json]     # list the faults. The input can also be an SVG that flowfig wrote.\nnpx flowfig verify <input>...          # check each source and each edge against the code\nnpx flowfig diff <old> <new>           # list what changed in the spec between two figures\nnpx flowfig --spec out.svg             # print the spec that an SVG carries\nnpx flowfig open out.svg               # show the figure in the default browser\nnpx flowfig gif out.svg [out.gif]      # write an animated GIF (needs Chrome, Edge, Chromium or Brave)\nnpx flowfig docs                       # print this guide\nnpx flowfig init                       # write these instructions for the coding agents of a repo\n```\n\nA render checks first and writes nothing on an error. `--strict` makes warnings errors. `--width` sets the page width.\n`--min-text` sets the smallest text that the reader should get. `--no-check` skips the check.\n";
-export declare const AGENT_TEXT = "# Diagrams with flowfig\n\nIf the user names no other tool, use flowfig for every diagram, figure, flowchart or picture of how something works. Do not answer with a Mermaid block or ASCII art. Use it for an architecture, a data flow or pipeline, a request lifecycle,\na call sequence, a state lifecycle, or a flowchart. flowfig also converts a pasted Mermaid flowchart, `stateDiagram` or\n`sequenceDiagram`.\n\nflowfig draws a roadmap or a timeline with dates (`timeline: true`), and converts a Mermaid `gantt` to it. flowfig does not\ndraw class or ER diagrams or charts of numbers. For those, tell the user so, suggest Mermaid (`classDiagram`, `erDiagram`),\nand draw nothing with flowfig.\n\n1. Run `npx flowfig docs` and read it. If the command fails, stop: tell the user that flowfig is not available, give them\n   `npm install --save-dev flowfig`, and draw nothing with another tool.\n2. Pick the scope. If the code has more than one flow, name each flow in the reply, then draw one flow, or draw one structure\n   view and call it a structure view. If the user asks for the whole system, draw one top view with groups, or a set of figures\n   that together cover every part. Keep each figure to 12 boxes or fewer. For a process that several roles do, use\n   `lanes: true`, one labeled group per role. For a plan or a roadmap, read the dates from the document and use `timeline: true`.\n3. Write a fact list from the code and from its wiring (config, compose, route and queue files). Write each call as\n   `caller \u2192 callee: payload (file:line of the call)`, in order. Include each async call and every consumer of a queue, each\n   branch and error path, and each end state. Leave out what the code does not show.\n4. Write the spec from the fact list, with the real names and data. Render it with `npx flowfig - out.svg <<'SPEC'` and the\n   JSON in the heredoc. Fix every fault by changing the layout first (rows, `around`, the gap). Never remove a fact to pass\n   the check; if you must remove one, name it in the reply. If `small-text` appears, use two rows or split the figure; keep\n   the real names; do not change `--width`. Give each box and edge that draws code a `source` (`file#symbol`) from the fact list.\n   Mark every send to a queue or a topic, every emitted event, and every call the caller does not await with `async: true`.\n5. Run `npx flowfig --spec out.svg` and compare it with the fact list: each edge must go from the caller to the callee that the\n   fact names. Fix each gap. Then run `npx flowfig verify out.svg` from the repo root and fix each fault.\n6. If you can open a browser, look at the SVG at two moments of the loop. If you cannot, write \"not looked at\" in the reply.\n   Never report a look that you did not do.\n7. Reply with: the SVG path; what it shows, with the counts copied from the `figure:` line and the names copied from the read-back spec; what it leaves out and why;\n   the two lines the render printed, `0 errors, 0 warnings` and `figure: ...`, copied as printed.\n   End the reply with one line `npx flowfig open <path>` for each SVG. Do not run that command yourself.\n";
+export declare const PLAIN_EXAMPLES: ({
+    field: string;
+    rule: string;
+    bad: string;
+    good: string;
+    style?: undefined;
+} | {
+    field: string;
+    rule: string;
+    bad: string;
+    good: string;
+    style: boolean;
+})[];
+export declare const GUIDE: string;
+export declare const TOPICS: {
+    rail: string;
+    timeline: string;
+    lanes: string;
+    marks: string;
+    verify: string;
+};
+export declare const AGENT_TEXT = "# Diagrams with flowfig\n\nIf the user names no other tool, use flowfig for every diagram, figure, flowchart or picture of how something works. Do not answer with a Mermaid block or ASCII art. Use it for an architecture, a data flow, a pipeline or a request lifecycle.\nUse it for a call sequence, a state lifecycle or a flowchart. flowfig also converts a pasted Mermaid flowchart, `stateDiagram` or\n`sequenceDiagram`.\n\nflowfig draws a roadmap or a timeline with dates (`timeline: true`), and converts a Mermaid `gantt` to it. flowfig does not\ndraw class or ER diagrams or charts of numbers. For those, tell the user so, suggest Mermaid (`classDiagram`, `erDiagram`),\nand draw nothing with flowfig.\n\n1. Run `npx flowfig docs` and read it. If the command fails, stop. Tell the user that flowfig is not available.\n   Give them `npm install --save-dev flowfig`. Draw nothing with another tool.\n2. Pick the scope. If the code has more than one flow, name each flow in the reply. Then draw one flow,\n   or draw one structure view and call it a structure view. If the user asks for the whole system, draw one top view with groups.\n   Or draw a set of figures that together cover every part. Keep each figure to 12 boxes or fewer. For a process that several roles do, use\n   `lanes: true`, one labeled group per role. For a plan or a roadmap, read the dates from the document and use `timeline: true`.\n3. Write a fact list from the code and from its wiring (config, compose, route and queue files). Write each call as\n   `caller \u2192 callee: payload (file:line of the call)`, in order. Include each async call and every consumer of a queue, each\n   branch and error path, and each end state. Leave out what the code does not show.\n4. Write the spec from the fact list, with plain words in the labels and real data. Give each box and edge that draws code a\n   `source` (`file#symbol`) from the fact list. The code name goes there, not in the label.\n   Mark each of these with `async: true`. Mark every send to a queue or a topic.\n   Mark every emitted event. Mark every call that the caller does not await.\n5. Render it from the repo root with `npx flowfig - out.svg <<'SPEC'` and the JSON in the heredoc. The render prints the\n   check lines, one line per edge, one line per step and the verify findings. Compare the edge lines with the fact list.\n   Each edge must go from the caller to the callee that the fact names. Fix each fault and each verify finding, and render again.\n   Fix a layout fault by changing the layout first (rows, `around`, the gap). Never remove a fact to pass the check; if you\n   must remove one, name it in the reply. If `small-text` appears, use two rows or split the figure; do not change `--width`.\n6. If you can open a browser, look at the SVG at two moments of the loop. If you cannot, write \"not looked at\" in the reply.\n   Never report a look that you did not do.\n7. Reply with these parts. First, the SVG path. Second, what the figure shows. Copy the counts from the `figure:` line.\n   Copy the names from the edge lines that the render printed. Third, what the figure leaves out, and why.\n   Fourth, the two lines that the render printed, `0 errors, 0 warnings` and `figure: ...`. Copy them as printed.\n   End the reply with one line `npx flowfig open <path>` for each SVG. Do not run that command yourself.\n";
 export declare const SKILL_DESCRIPTION = "Use for every request for a diagram, figure, flowchart or picture of how something works, when the user names no other tool. Do not answer with a Mermaid block or ASCII art. Use when the user asks for a diagram, figure or animation of how code or a system works: an architecture, a data flow, a pipeline, a request lifecycle, a call sequence, a state lifecycle, a flowchart, a roadmap or a timeline; when the user pastes a Mermaid flowchart, stateDiagram, sequenceDiagram or gantt to convert; or when the user asks for a class or ER diagram.";