@contraagent/ui 0.0.0-stage → 0.2.0

package/dist/adapters/check-rows.d.ts

@@ -0,0 +1,20 @@
+import type { ContractSpec } from '@contraagent/api';
+import type { CheckRow, CheckTableStrings } from '@contraagent/elements/check-table';
+/** Whether a value has a schema's type; true for a type this check cannot judge (the model's own check judges it). */
+export declare function typeOk(t: string, v: unknown): boolean;
+/** A `RootModel[str]`-style schema: the model wraps one value of the given type. */
+export declare const rootOf: (name: string) => string | null;
+/** A rows schema (`Rows[Finding]`): the model of one line. */
+export declare const rowOf: (name: string) => string | null;
+/** The file as a JSON object, or null (no file, not JSON, or another JSON value). */
+export declare function contentObject(o: ContractSpec): Record<string, unknown> | null;
+/**
+ * A row per field of the schema, then a row per field the file has that the
+ * schema does not name. Without a file, the fields with no values or verdicts;
+ * with a file that is not a JSON object, the fields with no verdicts. Null for
+ * a text result (a text file, or one JSON value), which has no fields to check.
+ */
+export declare function checkRowsFromContract(o: ContractSpec): CheckRow[] | null;
+/** The check table's words. */
+export declare function checkTableStrings(): CheckTableStrings;
+//# sourceMappingURL=check-rows.d.ts.map

package/dist/adapters/check-rows.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"check-rows.d.ts","sourceRoot":"","sources":["../../src/adapters/check-rows.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,KAAK,EAAE,QAAQ,EAAE,iBAAiB,EAAE,MAAM,mCAAmC,CAAC;AAGrF,sHAAsH;AACtH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,GAAG,OAAO,CAQrD;AAED,oFAAoF;AACpF,eAAO,MAAM,MAAM,GAAI,MAAM,MAAM,KAAG,MAAM,GAAG,IAAqD,CAAC;AAErG,8DAA8D;AAC9D,eAAO,MAAM,KAAK,GAAI,MAAM,MAAM,KAAG,MAAM,GAAG,IAAgD,CAAC;AAE/F,qFAAqF;AACrF,wBAAgB,aAAa,CAAC,CAAC,EAAE,YAAY,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAG7E;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,YAAY,GAAG,QAAQ,EAAE,GAAG,IAAI,CA+BxE;AAED,+BAA+B;AAC/B,wBAAgB,iBAAiB,IAAI,iBAAiB,CAUrD"}

package/dist/adapters/check-rows.js

@@ -0,0 +1,77 @@
+import { msg, str } from '@lit/localize';
+/** Whether a value has a schema's type; true for a type this check cannot judge (the model's own check judges it). */
+export function typeOk(t, v) {
+    if (t.startsWith('list[') || t === 'array')
+        return Array.isArray(v);
+    if (t === 'string')
+        return typeof v === 'string';
+    if (t === 'integer')
+        return Number.isInteger(v);
+    if (t === 'number')
+        return typeof v === 'number';
+    if (t === 'boolean')
+        return typeof v === 'boolean';
+    if (t === 'object')
+        return v !== null && typeof v === 'object' && !Array.isArray(v);
+    return true;
+}
+/** A `RootModel[str]`-style schema: the model wraps one value of the given type. */
+export const rootOf = (name) => /^RootModel\[(.+)\]$/.exec(name)?.[1] ?? null;
+/** A rows schema (`Rows[Finding]`): the model of one line. */
+export const rowOf = (name) => /^Rows\[(.+)\]$/.exec(name)?.[1] ?? null;
+/** The file as a JSON object, or null (no file, not JSON, or another JSON value). */
+export function contentObject(o) {
+    const c = o.file.content;
+    return o.file.exists && c !== null && typeof c === 'object' && !Array.isArray(c) ? c : null;
+}
+/**
+ * A row per field of the schema, then a row per field the file has that the
+ * schema does not name. Without a file, the fields with no values or verdicts;
+ * with a file that is not a JSON object, the fields with no verdicts. Null for
+ * a text result (a text file, or one JSON value), which has no fields to check.
+ */
+export function checkRowsFromContract(o) {
+    if (!o.fields.length && (o.schema_name === 'text' || rootOf(o.schema_name) !== null))
+        return null;
+    const obj = contentObject(o);
+    const rows = o.fields.map((x) => {
+        const base = { name: x.name, expected: x.type, optional: !x.required };
+        if (!obj)
+            return { ...base, hasValue: false, verdict: 'none', verdictLabel: '' };
+        if (!(x.name in obj))
+            return x.required
+                ? { ...base, hasValue: false, verdict: 'fail', verdictLabel: msg('missing'), tip: msg('A required field that is not in the file') }
+                : { ...base, hasValue: false, verdict: 'none', verdictLabel: msg('absent (optional)') };
+        const value = obj[x.name];
+        return typeOk(x.type, value)
+            ? { ...base, hasValue: true, value, verdict: 'pass', verdictLabel: msg('passed') }
+            : { ...base, hasValue: true, value, verdict: 'fail', verdictLabel: msg('wrong type'), tip: msg(str `Expected ${x.type}`) };
+    });
+    const extra = obj ? Object.keys(obj).filter((k) => !o.fields.some((x) => x.name === k)) : [];
+    return [
+        ...rows,
+        ...extra.map((k) => ({
+            name: k,
+            expected: msg('not in the schema'),
+            extra: true,
+            hasValue: true,
+            value: obj?.[k],
+            verdict: 'warn',
+            verdictLabel: msg('extra field'),
+            tip: msg('Not in the schema'),
+        })),
+    ];
+}
+/** The check table's words. */
+export function checkTableStrings() {
+    return {
+        name: msg('Field'),
+        expected: msg('Expected'),
+        actual: msg('In the file'),
+        verdict: msg('Check'),
+        optional: msg('optional'),
+        items: (n) => (n === 1 ? msg('1 item') : msg(str `${n} items`)),
+        object: msg('object'),
+    };
+}
+//# sourceMappingURL=check-rows.js.map

package/dist/adapters/check-rows.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"check-rows.js","sourceRoot":"","sources":["../../src/adapters/check-rows.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,eAAe,CAAC;AAEzC,sHAAsH;AACtH,MAAM,UAAU,MAAM,CAAC,CAAS,EAAE,CAAU;IAC1C,IAAI,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,OAAO;QAAE,OAAO,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACpE,IAAI,CAAC,KAAK,QAAQ;QAAE,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC;IACjD,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAChD,IAAI,CAAC,KAAK,QAAQ;QAAE,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC;IACjD,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,OAAO,CAAC,KAAK,SAAS,CAAC;IACnD,IAAI,CAAC,KAAK,QAAQ;QAAE,OAAO,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACpF,OAAO,IAAI,CAAC;AACd,CAAC;AAED,oFAAoF;AACpF,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,IAAY,EAAiB,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AAErG,8DAA8D;AAC9D,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,IAAY,EAAiB,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AAE/F,qFAAqF;AACrF,MAAM,UAAU,aAAa,CAAC,CAAe;IAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;IACzB,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAA6B,CAAC,CAAC,CAAC,IAAI,CAAC;AAC3H,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CAAC,CAAe;IACnD,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,WAAW,KAAK,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAClG,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IAC7B,MAAM,IAAI,GAAe,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1C,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QACvE,IAAI,CAAC,GAAG;YAAE,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;QACjF,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC;YAClB,OAAO,CAAC,CAAC,QAAQ;gBACf,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,0CAA0C,CAAC,EAAE;gBACnI,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,CAAC,mBAAmB,CAAC,EAAE,CAAC;QAC5F,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1B,OAAO,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC;YAC1B,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;YAClF,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,CAAC,YAAY,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,CAAA,YAAY,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;IAC9H,CAAC,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7F,OAAO;QACL,GAAG,IAAI;QACP,GAAG,KAAK,CAAC,GAAG,CACV,CAAC,CAAC,EAAY,EAAE,CAAC,CAAC;YAChB,IAAI,EAAE,CAAC;YACP,QAAQ,EAAE,GAAG,CAAC,mBAAmB,CAAC;YAClC,KAAK,EAAE,IAAI;YACX,QAAQ,EAAE,IAAI;YACd,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YACf,OAAO,EAAE,MAAM;YACf,YAAY,EAAE,GAAG,CAAC,aAAa,CAAC;YAChC,GAAG,EAAE,GAAG,CAAC,mBAAmB,CAAC;SAC9B,CAAC,CACH;KACF,CAAC;AACJ,CAAC;AAED,+BAA+B;AAC/B,MAAM,UAAU,iBAAiB;IAC/B,OAAO;QACL,IAAI,EAAE,GAAG,CAAC,OAAO,CAAC;QAClB,QAAQ,EAAE,GAAG,CAAC,UAAU,CAAC;QACzB,MAAM,EAAE,GAAG,CAAC,aAAa,CAAC;QAC1B,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC;QACrB,QAAQ,EAAE,GAAG,CAAC,UAAU,CAAC;QACzB,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAA,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC9D,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC;KACtB,CAAC;AACJ,CAAC"}

package/dist/adapters/filters.d.ts

@@ -0,0 +1,29 @@
+import { type JournalRow, type TaskRow } from '@contraagent/api';
+/** Tasks of `kind` (all when ''), whose kind, unit, claims, key or last stop contains `q`. */
+export declare function filterTasks(tasks: readonly TaskRow[], kind: string, q: string): TaskRow[];
+/** The tasks list's order: by `RANK`, then the latest journal row first, then plan order. */
+export declare function sortTasks(tasks: readonly TaskRow[]): TaskRow[];
+/** Keys of tasks that were retried: a try ran after one that ran and failed (`retries`). */
+export declare const retriedKeys: (rows: readonly JournalRow[]) => Set<string>;
+/** A row whose output was sent back to the agent at least once (a fix-up in the same session). */
+export declare const hadFixup: (r: JournalRow) => boolean;
+/**
+ * Journal rows of `kind` with `stop` that contain `q`. Besides a stop value,
+ * `stop` takes 'bad' (every attempt that did not complete), 'fixup' (attempts
+ * whose output was sent back for a fix-up), 'retried' (every row of a task
+ * retried after a failed try, `retries`) and 'replayed' (attempts played from
+ * their recordings, `JournalRow.replayed`).
+ */
+export declare function filterJournal(rows: readonly JournalRow[], kind: string, stop: string, q: string): JournalRow[];
+/** Rows per stop, most frequent first. */
+export declare function journalTally(rows: readonly JournalRow[]): [string, number][];
+/**
+ * Per task key: how many tries ran (refusals are not tries), and the row index
+ * and try number of its last successful try.
+ */
+export declare function attemptFacts(rows: readonly JournalRow[]): Map<string, {
+    count: number;
+    lastOk: number;
+    lastOkTry: number;
+}>;
+//# sourceMappingURL=filters.d.ts.map

package/dist/adapters/filters.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filters.d.ts","sourceRoot":"","sources":["../../src/adapters/filters.ts"],"names":[],"mappings":"AAEA,OAAO,EAA8B,KAAK,UAAU,EAAgB,KAAK,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAE3G,8FAA8F;AAC9F,wBAAgB,WAAW,CAAC,KAAK,EAAE,SAAS,OAAO,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,EAAE,CAKzF;AAKD,6FAA6F;AAC7F,wBAAgB,SAAS,CAAC,KAAK,EAAE,SAAS,OAAO,EAAE,GAAG,OAAO,EAAE,CAK9D;AAID,4FAA4F;AAC5F,eAAO,MAAM,WAAW,GAAI,MAAM,SAAS,UAAU,EAAE,KAAG,GAAG,CAAC,MAAM,CAA6C,CAAC;AAElH,kGAAkG;AAClG,eAAO,MAAM,QAAQ,GAAI,GAAG,UAAU,KAAG,OAA8B,CAAC;AAExE;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,SAAS,UAAU,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,UAAU,EAAE,CAY9G;AAED,0CAA0C;AAC1C,wBAAgB,YAAY,CAAC,IAAI,EAAE,SAAS,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAI5E;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,SAAS,UAAU,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC,CAY3H"}

package/dist/adapters/filters.js

@@ -0,0 +1,74 @@
+// The list filters and row facts, pure: what the tasks and journal tabs show
+// for a kind, a stop and a text.
+import { isBad, isLaunched, retries } from '@contraagent/api';
+/** Tasks of `kind` (all when ''), whose kind, unit, claims, key or last stop contains `q`. */
+export function filterTasks(tasks, kind, q) {
+    const needle = q.toLowerCase();
+    return tasks.filter((t) => (!kind || t.kind === kind) && (!needle || `${t.kind} ${t.unit} ${(t.claims ?? []).join(' ')} ${t.key} ${t.last_stop}`.toLowerCase().includes(needle)));
+}
+/** Failed first, then not started, partly done, running and waiting; the rest after them. */
+const RANK = { failed: 0, not_started: 1, partial: 2, running: 3, waiting: 4 };
+/** The tasks list's order: by `RANK`, then the latest journal row first, then plan order. */
+export function sortTasks(tasks) {
+    return tasks
+        .map((t, i) => ({ t, i }))
+        .sort((a, b) => (RANK[a.t.outcome] ?? 9) - (RANK[b.t.outcome] ?? 9) || b.t.last_ts.localeCompare(a.t.last_ts) || a.i - b.i)
+        .map((x) => x.t);
+}
+const JOURNAL_TEXT = ['key', 'unit', 'stop', 'kind', 'route', 'reason'];
+/** Keys of tasks that were retried: a try ran after one that ran and failed (`retries`). */
+export const retriedKeys = (rows) => new Set(retries(rows).map((r) => r.key));
+/** A row whose output was sent back to the agent at least once (a fix-up in the same session). */
+export const hadFixup = (r) => (r.rounds ?? 1) > 1;
+/**
+ * Journal rows of `kind` with `stop` that contain `q`. Besides a stop value,
+ * `stop` takes 'bad' (every attempt that did not complete), 'fixup' (attempts
+ * whose output was sent back for a fix-up), 'retried' (every row of a task
+ * retried after a failed try, `retries`) and 'replayed' (attempts played from
+ * their recordings, `JournalRow.replayed`).
+ */
+export function filterJournal(rows, kind, stop, q) {
+    const needle = q.toLowerCase();
+    const retried = stop === 'retried' ? retriedKeys(rows) : null;
+    return rows.filter((e) => {
+        if (stop === 'bad' && !isBad(e))
+            return false;
+        if (stop === 'fixup' && !hadFixup(e))
+            return false;
+        if (retried && !retried.has(e.key))
+            return false;
+        if (stop === 'replayed' && !e.replayed)
+            return false;
+        if (stop && !['bad', 'fixup', 'retried', 'replayed'].includes(stop) && e.stop !== stop)
+            return false;
+        if (kind && e.kind !== kind)
+            return false;
+        return !needle || JOURNAL_TEXT.some((k) => String(e[k] ?? '').toLowerCase().includes(needle));
+    });
+}
+/** Rows per stop, most frequent first. */
+export function journalTally(rows) {
+    const tally = new Map();
+    for (const e of rows)
+        tally.set(e.stop || '?', (tally.get(e.stop || '?') ?? 0) + 1);
+    return [...tally.entries()].sort((a, b) => b[1] - a[1]);
+}
+/**
+ * Per task key: how many tries ran (refusals are not tries), and the row index
+ * and try number of its last successful try.
+ */
+export function attemptFacts(rows) {
+    const facts = new Map();
+    rows.forEach((r, i) => {
+        const f = facts.get(r.key) ?? { count: 0, lastOk: -1, lastOkTry: 0 };
+        if (isLaunched(r))
+            f.count++;
+        if (r.ok) {
+            f.lastOk = i;
+            f.lastOkTry = (r.attempt ?? 0) + 1;
+        }
+        facts.set(r.key, f);
+    });
+    return facts;
+}
+//# sourceMappingURL=filters.js.map

package/dist/adapters/filters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filters.js","sourceRoot":"","sources":["../../src/adapters/filters.ts"],"names":[],"mappings":"AAAA,6EAA6E;AAC7E,iCAAiC;AACjC,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,EAA+C,MAAM,kBAAkB,CAAC;AAE3G,8FAA8F;AAC9F,MAAM,UAAU,WAAW,CAAC,KAAyB,EAAE,IAAY,EAAE,CAAS;IAC5E,MAAM,MAAM,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAC/B,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAC7J,CAAC;AACJ,CAAC;AAED,6FAA6F;AAC7F,MAAM,IAAI,GAAqC,EAAE,MAAM,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;AAEjH,6FAA6F;AAC7F,MAAM,UAAU,SAAS,CAAC,KAAyB;IACjD,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC1H,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACrB,CAAC;AAED,MAAM,YAAY,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAU,CAAC;AAEjF,4FAA4F;AAC5F,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,IAA2B,EAAe,EAAE,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAElH,kGAAkG;AAClG,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAa,EAAW,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AAExE;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,IAA2B,EAAE,IAAY,EAAE,IAAY,EAAE,CAAS;IAC9F,MAAM,MAAM,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC9D,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACvB,IAAI,IAAI,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC9C,IAAI,IAAI,KAAK,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACnD,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACjD,IAAI,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QACrD,IAAI,IAAI,IAAI,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QACrG,IAAI,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAC1C,OAAO,CAAC,MAAM,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IAChG,CAAC,CAAC,CAAC;AACL,CAAC;AAED,0CAA0C;AAC1C,MAAM,UAAU,YAAY,CAAC,IAA2B;IACtD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpF,OAAO,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,IAA2B;IACtD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgE,CAAC;IACtF,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;QACrE,IAAI,UAAU,CAAC,CAAC,CAAC;YAAE,CAAC,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;YACT,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;YACb,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACrC,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,CAAC;IACH,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/adapters/graph/compound.d.ts

@@ -0,0 +1,93 @@
+import { type Plan } from '@contraagent/api';
+import { type FlowIndex } from './flow-index.js';
+import type { LayerModel, NodeCounts } from './types.js';
+/** Between a function's place and the id of an item drawn inside it. */
+export declare const IN_SEP = "::";
+/** The prefix of a function drawn open: `fx::<place>`. */
+export declare const FLOW_BOX = "fx::";
+/** Where a function node is, across every layer: its layer and its id there (`<layer>/<id>`). */
+export declare const placeKey: (layer: readonly string[], id: string) => string;
+/** What a function's place holds, for choosing what to open. */
+export interface PlaceStats {
+    key: string;
+    /** The layer it is in, and its node's id there. */
+    layer: string[];
+    id: string;
+    name: string;
+    /** Levels below the layer shown (0: a node of that layer). */
+    depth: number;
+    /** The loops of its layer's function around it, outermost first, and that function's file. */
+    loops: number[];
+    file: string;
+    /** Its tasks by state. */
+    counts: NodeCounts;
+    tasks: number;
+    /** Its agent tasks. */
+    agent: number;
+    failed: number;
+    running: number;
+    /** Tasks not done that will not run on their own: not started, and (once the run is over) pending. */
+    stuck: number;
+    /** A flow call in it stopped with an error. */
+    errors: boolean;
+    /** The ids of the nodes its own layer would draw. */
+    kids: Set<string>;
+    /** The places of the functions in its layer. */
+    fns: Set<string>;
+    /** The place it is in (null: a node of the layer shown). */
+    parent: string | null;
+}
+export interface OpenChoice {
+    /** Places the reader opened and closed: they outrank the choice. */
+    open?: ReadonlySet<string>;
+    closed?: ReadonlySet<string>;
+    /** Open every function (bar `closed`). */
+    all?: boolean;
+    /** The most nodes the drawing holds before it stops opening functions on its own. */
+    budget: number;
+    /** Places of interest: the selection's, and those around it (`towardOf`); with `sel`, those of that selection. */
+    toward?: ReadonlySet<string>;
+    sel?: string;
+    /** The run is live: a pending task is waiting, not stuck. */
+    live?: boolean;
+    /** The most layers the drawing may span (left to right, or top to bottom) before it closes again what it opened on its own. */
+    maxSpan?: number;
+}
+/** Every function place under the layer `focus`, with what it holds. */
+export declare function placeStats(ix: FlowIndex, focus: readonly string[], live?: boolean): Map<string, PlaceStats>;
+/** A place's interest, before its distance: more tasks, and a failure, running work or a selection in it, more. */
+export declare function interest(s: PlaceStats, toward?: ReadonlySet<string>): number;
+/**
+ * Whether a place is worth opening on its own: it holds agent tasks, a failure, running
+ * work, work that will not run, or the selection. A place of finished Python steps says
+ * all it has in its node's count. (Furnas's threshold: only what is interesting enough is shown.)
+ */
+export declare const notable: (s: PlaceStats, toward?: ReadonlySet<string>) => boolean;
+/** Its degree of interest: its interest less its distance from the layer shown. */
+export declare const doi: (s: PlaceStats, toward?: ReadonlySet<string>) => number;
+/**
+ * The places to draw open: the reader's own, then, while the drawing stays within
+ * `budget` nodes, the rest in order of their degree of interest (a place's own
+ * functions become candidates once it is open), those `notable` only. A place opens only
+ * inside open places.
+ */
+export declare function chooseOpen(stats: ReadonlyMap<string, PlaceStats>, rootIds: number, c: OpenChoice): {
+    open: Set<string>;
+    auto: string[];
+};
+/** The places of interest for a selection: the place it is in or names, and every place around it. */
+export declare function towardOf(sel: string, stats: ReadonlyMap<string, PlaceStats>): Set<string>;
+export interface Compound {
+    model: LayerModel;
+    /** The places drawn open. */
+    open: Set<string>;
+    stats: Map<string, PlaceStats>;
+}
+/**
+ * The layer `focus` of the plan with the places `chooseOpen` picks drawn open: a node
+ * per kind and per closed function, a cluster per open function (or one per chain of
+ * single functions), the loop boxes of every layer drawn, and the edges between the
+ * nodes the tasks are drawn in, whatever layer they are in.
+ */
+export declare function compound(plan: Plan, focus: readonly string[], choice: OpenChoice): Compound;
+//# sourceMappingURL=compound.d.ts.map

package/dist/adapters/graph/compound.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compound.d.ts","sourceRoot":"","sources":["../../../src/adapters/graph/compound.ts"],"names":[],"mappings":"AAeA,OAAO,EAA+B,KAAK,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAC1E,OAAO,EAA+E,KAAK,SAAS,EAAiB,MAAM,iBAAiB,CAAC;AAG7I,OAAO,KAAK,EAA4C,UAAU,EAAW,UAAU,EAAE,MAAM,YAAY,CAAC;AAE5G,wEAAwE;AACxE,eAAO,MAAM,MAAM,OAAO,CAAC;AAC3B,0DAA0D;AAC1D,eAAO,MAAM,QAAQ,SAAS,CAAC;AAE/B,iGAAiG;AACjG,eAAO,MAAM,QAAQ,GAAI,OAAO,SAAS,MAAM,EAAE,EAAE,IAAI,MAAM,KAAG,MAAoC,CAAC;AAErG,gEAAgE;AAChE,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,mDAAmD;IACnD,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,8DAA8D;IAC9D,KAAK,EAAE,MAAM,CAAC;IACd,8FAA8F;IAC9F,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,0BAA0B;IAC1B,MAAM,EAAE,UAAU,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,uBAAuB;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,sGAAsG;IACtG,KAAK,EAAE,MAAM,CAAC;IACd,+CAA+C;IAC/C,MAAM,EAAE,OAAO,CAAC;IAChB,qDAAqD;IACrD,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAClB,gDAAgD;IAChD,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACjB,4DAA4D;IAC5D,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;CACvB;AAED,MAAM,WAAW,UAAU;IACzB,oEAAoE;IACpE,IAAI,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC3B,MAAM,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC7B,0CAA0C;IAC1C,GAAG,CAAC,EAAE,OAAO,CAAC;IACd,qFAAqF;IACrF,MAAM,EAAE,MAAM,CAAC;IACf,kHAAkH;IAClH,MAAM,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC7B,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,6DAA6D;IAC7D,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,+HAA+H;IAC/H,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAKD,wEAAwE;AACxE,wBAAgB,UAAU,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,IAAI,UAAQ,GAAG,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAoCzG;AAED,mHAAmH;AACnH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,GAAE,WAAW,CAAC,MAAM,CAAa,GAAG,MAAM,CAEvF;AAED;;;;GAIG;AACH,eAAO,MAAM,OAAO,GAAI,GAAG,UAAU,EAAE,SAAQ,WAAW,CAAC,MAAM,CAAa,KAAG,OACa,CAAC;AAE/F,mFAAmF;AACnF,eAAO,MAAM,GAAG,GAAI,GAAG,UAAU,EAAE,SAAS,WAAW,CAAC,MAAM,CAAC,KAAG,MAA6C,CAAC;AAEhH;;;;;GAKG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,GAAG;IAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAAC,IAAI,EAAE,MAAM,EAAE,CAAA;CAAE,CA6BxI;AAED,sGAAsG;AACtG,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAOzF;AAED,MAAM,WAAW,QAAQ;IACvB,KAAK,EAAE,UAAU,CAAC;IAClB,6BAA6B;IAC7B,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAClB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;CAChC;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,EAAE,UAAU,GAAG,QAAQ,CAmB3F"}

package/dist/adapters/graph/compound.js

@@ -0,0 +1,322 @@
+// The pipeline graph as one drawing of several layers: the layer shown, with some of
+// its functions drawn open, each a cluster that holds its own layer, recursively (a
+// compound graph, laid out by `arrange` as a layered drawing of nested clusters).
+//
+// Which functions are open is a degree-of-interest choice (Furnas 1986, "Generalized
+// fisheye views"; Card & Nation 2002, "Degree-of-interest trees"): each function node
+// has an a-priori interest (its tasks, and whether any failed, runs or did not run,
+// and whether the selection is in it) less its distance from the layer shown, and the
+// most interesting open first while the drawing stays within a budget of nodes. The
+// reader's own opens and closes outrank it.
+//
+// A function whose layer holds only it as a function (and kinds beside it) opens into
+// the cluster of the function around it rather than into a cluster of its own, which
+// is then named by the path of both ("topic_work › write_batches"): a chain of single
+// calls is one box, as an editor's compact folders show a chain of single folders.
+import { isPython } from '@contraagent/api';
+import { cmpPasses, indexOf, loopsAt, passesAt, placeOf, push, shortName, startsWith } from './flow-index.js';
+import { arrange, extentOf } from '@contraagent/elements/graph';
+import { projectTasks, shapeOf } from './project.js';
+/** Between a function's place and the id of an item drawn inside it. */
+export const IN_SEP = '::';
+/** The prefix of a function drawn open: `fx::<place>`. */
+export const FLOW_BOX = 'fx::';
+/** Where a function node is, across every layer: its layer and its id there (`<layer>/<id>`). */
+export const placeKey = (layer, id) => `${layer.join('/')}/${id}`;
+/** A failed or closed flow call (`raised`, `closed`). */
+const stopped = (c) => c?.state === 'raised' || c?.state === 'closed';
+/** Every function place under the layer `focus`, with what it holds. */
+export function placeStats(ix, focus, live = false) {
+    const d0 = focus.length;
+    const out = new Map();
+    const raised = new Set();
+    if (ix.calls)
+        for (const c of ix.calls.values())
+            if (stopped(c))
+                raised.add(c.id);
+    for (const t of ix.tasks) {
+        if (!startsWith(t.path, focus))
+            continue;
+        const st = t.n.state;
+        const callErr = !!t.call && [...raised].some((r) => t.call === r || t.call.startsWith(`${r}.`));
+        let parent = null;
+        for (let d = d0; d < t.path.length; d++) {
+            const p = placeOf(t, d);
+            const layer = t.path.slice(0, d);
+            const key = placeKey(layer, p.id);
+            let s = out.get(key);
+            if (!s) {
+                const counts = { total: 0, done: 0, partial: 0, failed: 0, running: 0, pending: 0, skipped: 0, blocked: 0 };
+                const file = d > 0 ? (t.frames[d - 1]?.file ?? '') : '';
+                s = { key, layer, id: p.id, name: p.name, depth: d - d0, loops: p.loops, file, counts, tasks: 0, agent: 0, failed: 0, running: 0, stuck: 0, errors: false, kids: new Set(), fns: new Set(), parent };
+                out.set(key, s);
+            }
+            s.tasks += 1;
+            s.counts.total += 1;
+            s.counts[st] += 1;
+            if (!isPython(t.n))
+                s.agent += 1;
+            if (st === 'failed')
+                s.failed += 1;
+            else if (st === 'running')
+                s.running += 1;
+            else if (st === 'blocked' || (st === 'pending' && !live))
+                s.stuck += 1;
+            if (callErr)
+                s.errors = true;
+            const next = placeOf(t, d + 1);
+            s.kids.add(next.id);
+            if (next.type === 'flow')
+                s.fns.add(placeKey(t.path.slice(0, d + 1), next.id));
+            parent = key;
+        }
+    }
+    return out;
+}
+/** A place's interest, before its distance: more tasks, and a failure, running work or a selection in it, more. */
+export function interest(s, toward = new Set()) {
+    return Math.log2(1 + s.tasks) + (s.failed || s.errors ? 4 : 0) + (s.running ? 3 : 0) + (s.stuck ? 1.5 : 0) + (toward.has(s.key) ? 6 : 0);
+}
+/**
+ * Whether a place is worth opening on its own: it holds agent tasks, a failure, running
+ * work, work that will not run, or the selection. A place of finished Python steps says
+ * all it has in its node's count. (Furnas's threshold: only what is interesting enough is shown.)
+ */
+export const notable = (s, toward = new Set()) => s.agent > 0 || s.failed > 0 || s.errors || s.running > 0 || s.stuck > 0 || toward.has(s.key);
+/** Its degree of interest: its interest less its distance from the layer shown. */
+export const doi = (s, toward) => interest(s, toward) - 1.5 * s.depth;
+/**
+ * The places to draw open: the reader's own, then, while the drawing stays within
+ * `budget` nodes, the rest in order of their degree of interest (a place's own
+ * functions become candidates once it is open), those `notable` only. A place opens only
+ * inside open places.
+ */
+export function chooseOpen(stats, rootIds, c) {
+    const open = new Set();
+    const auto = [];
+    const closed = c.closed ?? new Set();
+    const forced = c.open ?? new Set();
+    let visible = rootIds;
+    const cands = new Set([...stats.values()].filter((s) => s.parent === null).map((s) => s.key));
+    while (cands.size) {
+        let best = null;
+        let bestScore = -Infinity;
+        for (const k of cands) {
+            const s = stats.get(k);
+            const score = forced.has(k) ? Infinity : doi(s, c.toward);
+            if (score > bestScore) {
+                best = s;
+                bestScore = score;
+            }
+        }
+        if (!best)
+            break;
+        cands.delete(best.key);
+        if (closed.has(best.key))
+            continue;
+        const cost = best.kids.size - 1;
+        if (!forced.has(best.key) && !c.all && (visible + cost > c.budget || !notable(best, c.toward)))
+            continue;
+        open.add(best.key);
+        if (!forced.has(best.key))
+            auto.push(best.key);
+        visible += cost;
+        for (const f of best.fns)
+            cands.add(f);
+    }
+    return { open, auto };
+}
+/** The places of interest for a selection: the place it is in or names, and every place around it. */
+export function towardOf(sel, stats) {
+    const out = new Set();
+    let key = null;
+    if (sel.startsWith(FLOW_BOX))
+        key = sel.slice(FLOW_BOX.length).split('#')[0] ?? null;
+    else if (sel.includes(IN_SEP))
+        key = sel.slice(0, sel.lastIndexOf(IN_SEP));
+    for (let k = key; k !== null && stats.has(k); k = stats.get(k)?.parent ?? null)
+        out.add(k);
+    return out;
+}
+/**
+ * The layer `focus` of the plan with the places `chooseOpen` picks drawn open: a node
+ * per kind and per closed function, a cluster per open function (or one per chain of
+ * single functions), the loop boxes of every layer drawn, and the edges between the
+ * nodes the tasks are drawn in, whatever layer they are in.
+ */
+export function compound(plan, focus, choice) {
+    const ix = indexOf(plan);
+    const d0 = focus.length;
+    const inside = ix.tasks.filter((t) => startsWith(t.path, focus));
+    const stats = placeStats(ix, focus, choice.live);
+    const rootIds = new Set(inside.map((t) => placeOf(t, d0).id)).size;
+    const toward = choice.sel ? towardOf(choice.sel, stats) : choice.toward;
+    const { open, auto } = chooseOpen(stats, rootIds, { ...choice, toward });
+    let model = assemble(ix, focus, inside, stats, open);
+    // Too long a drawing: close again what was opened last on its own (the least interesting,
+    // and inside what was opened before it), until it spans `maxSpan` layers.
+    const span = (m) => extentOf(arrange(shapeOf(m))).span;
+    if (choice.maxSpan && !choice.all) {
+        while (auto.length && span(model) > choice.maxSpan) {
+            open.delete(auto.pop());
+            model = assemble(ix, focus, inside, stats, open);
+        }
+    }
+    return { model, open, stats };
+}
+/** The layer `focus` with the places `open` drawn open (`compound`). */
+function assemble(ix, focus, inside, stats, open) {
+    const d0 = focus.length;
+    // Each task's container (the open place it is drawn in, '' for the layer shown) and its
+    // depth; and each container's tasks: every task under it, those of the places open in it too.
+    const containerOf = new Map();
+    const byContainer = new Map([['', []]]);
+    for (const t of inside) {
+        let d = d0;
+        let key = '';
+        byContainer.get('')?.push(t);
+        while (d < t.path.length) {
+            const k = placeKey(t.path.slice(0, d), placeOf(t, d).id);
+            if (!open.has(k))
+                break;
+            key = k;
+            push(byContainer, k, t);
+            d++;
+        }
+        containerOf.set(t.n.key, { key, depth: d });
+    }
+    // Each container's layer, projected from its tasks.
+    const proj = new Map();
+    const layerOfC = new Map();
+    for (const [k, ts] of byContainer) {
+        const s = stats.get(k);
+        const layer = s ? [...s.layer, s.name] : [...focus];
+        layerOfC.set(k, layer);
+        proj.set(k, projectTasks(ix, layer, ts));
+    }
+    const prefix = (k, id) => (k === '' ? id : `${k}${IN_SEP}${id}`);
+    // Where an open place's content goes: into the cluster of the place around it when that place's
+    // layer holds it as its only function, outside any loop box; else into a cluster of its own.
+    const ownNode = (k) => {
+        const s = stats.get(k);
+        const p = s ? proj.get(s.parent ?? '') : undefined;
+        return p?.model.nodes.find((n) => n.id === s?.id);
+    };
+    const merges = (k) => {
+        const s = stats.get(k);
+        if (!s || s.parent === null)
+            return false;
+        const p = proj.get(s.parent);
+        if (!p)
+            return false;
+        const fns = p.model.nodes.filter((n) => n.type === 'flow');
+        return fns.length === 1 && fns[0]?.id === s.id && !fns[0]?.box;
+    };
+    const clusterOf = (k) => (merges(k) ? clusterOf(stats.get(k).parent) : `${FLOW_BOX}${k}`);
+    const nodes = [];
+    const boxes = [];
+    const fns = new Map();
+    const unitsSeen = new Set();
+    for (const k of [...proj.keys()].sort((a, b) => (a === '' ? -1 : b === '' ? 1 : (stats.get(a)?.depth ?? 0) - (stats.get(b)?.depth ?? 0)))) {
+        const p = proj.get(k);
+        const layer = layerOfC.get(k);
+        const home = k === '' ? null : clusterOf(k);
+        if (k !== '') {
+            const own = ownNode(k);
+            const s = stats.get(k);
+            const node = own ? { ...own, id: prefix(s.parent ?? '', own.id) } : undefined;
+            const part = { id: `${FLOW_BOX}${k}`, key: k, node: node };
+            if (home === `${FLOW_BOX}${k}`) {
+                const parentBox = own?.box ? prefix(s.parent ?? '', own.box) : s.parent !== null ? clusterOf(s.parent) : null;
+                fns.set(home, { id: home, parent: parentBox, parts: [part] });
+            }
+            else
+                fns.get(home)?.parts.push(part);
+        }
+        for (const b of p.model.boxes) {
+            boxes.push({ ...b, id: prefix(k, b.id), parent: b.parent ? prefix(k, b.parent) : home, layer });
+        }
+        for (const n of p.model.nodes) {
+            if (n.type === 'flow' && open.has(placeKey(layer, n.id)))
+                continue;
+            nodes.push({ ...n, id: prefix(k, n.id), box: n.box ? prefix(k, n.box) : home, layer });
+        }
+        for (const u of p.model.units)
+            unitsSeen.add(u);
+    }
+    // Every node's marks in one unit order, the run's.
+    const units = [...unitsSeen].sort((a, b) => (ix.unitRank.get(a) ?? 0) - (ix.unitRank.get(b) ?? 0));
+    const unitsOf = new Map([...proj].map(([k, p]) => [k, p.model.units]));
+    for (const n of nodes) {
+        const k = n.id.includes(IN_SEP) ? n.id.slice(0, n.id.lastIndexOf(IN_SEP)) : '';
+        const local = unitsOf.get(k) ?? [];
+        if (!n.units.length)
+            continue;
+        const by = new Map(local.map((u, i) => [u, n.units[i] ?? null]));
+        n.units = units.map((u) => by.get(u) ?? null);
+    }
+    // Edges between the nodes the tasks are drawn in; from outside the layer shown, stubs.
+    const drawnOf = (t) => {
+        const c = containerOf.get(t.n.key);
+        return prefix(c.key, placeOf(t, c.depth).id);
+    };
+    const layerAt = (t) => t.path.slice(0, containerOf.get(t.n.key).depth);
+    const inOrder = new Set();
+    const pairs = new Map();
+    const stubs = new Map();
+    for (const t of inside) {
+        const to = drawnOf(t);
+        const link = (dep, type) => {
+            const o = ix.byKey.get(dep);
+            if (!o)
+                return;
+            if (startsWith(o.path, focus)) {
+                const from = drawnOf(o);
+                if (from === to) {
+                    if (type === 'after')
+                        inOrder.add(to);
+                    return;
+                }
+                // The loops that matter are those of the deepest layer both are drawn in.
+                const la = layerAt(o);
+                const lb = layerAt(t);
+                let d = 0;
+                while (d < la.length && d < lb.length && la[d] === lb[d])
+                    d++;
+                const a = loopsAt(o, d);
+                const b = loopsAt(t, d);
+                let k = 0;
+                while (k < a.length && a[k] === b[k])
+                    k++;
+                const same = cmpPasses(passesAt(o, d).slice(0, k), passesAt(t, d).slice(0, k)) === 0;
+                const key = `${from}\u0000${to}\u0000${type}`;
+                const e = pairs.get(key) ?? pairs.set(key, { from, to, type, tasks: new Set(), samePass: false }).get(key);
+                e?.tasks.add(t.n.key);
+                if (e && same)
+                    e.samePass = true;
+                return;
+            }
+            let c = 0;
+            while (c < d0 && o.path[c] === focus[c])
+                c++;
+            const p = placeOf(o, c);
+            const s = { id: `stub:${c}:${p.id}`, label: p.type === 'kind' ? (ix.labels.get(p.name) ?? p.name) : shortName(p.name) };
+            const sk = `${s.id}\u0000${to}\u0000${type}`;
+            (stubs.get(sk) ?? stubs.set(sk, { ...s, to, type, tasks: new Set() }).get(sk))?.tasks.add(t.n.key);
+        };
+        for (const dep of t.n.after ?? [])
+            link(dep, 'after');
+        for (const dep of t.from)
+            link(dep, 'created');
+    }
+    for (const n of nodes)
+        n.inOrder = inOrder.has(n.id);
+    const edges = [...pairs.values()]
+        .filter((e) => e.type === 'after' || !pairs.has(`${e.from}\u0000${e.to}\u0000after`))
+        .map((e) => ({ from: e.from, to: e.to, tasks: e.tasks.size, type: e.type, samePass: e.samePass, back: false }));
+    const stubList = [...stubs.values()]
+        .filter((s) => s.type === 'after' || !stubs.has(`${s.id}\u0000${s.to}\u0000after`))
+        .map((s) => ({ id: s.id, label: s.label, to: s.to, tasks: s.tasks.size, type: s.type }));
+    return { path: [...focus], nodes, boxes, fns: [...fns.values()], edges, stubs: stubList, units };
+}
+//# sourceMappingURL=compound.js.map