@contraagent/ui 0.0.0-stage → 0.2.0

package/dist/adapters/graph/layer.js

@@ -0,0 +1,94 @@
+import { arrange } from '@contraagent/elements/graph';
+import { indexOf, instanceOf, placeOf, shortName, startsWith } from './flow-index.js';
+import { arranged, project, shapeOf } from './project.js';
+import { LOOP_SEGMENT } from './types.js';
+/**
+ * The layer `path` of the plan's flow. Pass the `order` of the last graph of this layer as
+ * `prev` to keep its nodes in place; `down` lays out the edge paths for a drawing top to bottom
+ * (a box's label is then on the side its edges come in).
+ */
+export function layerGraph(plan, path = [], prev, down = false) {
+    const { model } = project(plan, path);
+    return arranged(model, arrange(shapeOf(model), prev, down));
+}
+/**
+ * The layer the graph opens on: from the top, down while a layer has a single
+ * node and it is a function's. It stops at a single function node whose flow call
+ * raised or was closed, so a run that failed inside a flow opens on the node that
+ * shows it, not inside it. A failed or not started task does not stop it: the layer
+ * below shows that task's own mark. A static flow lands on its kinds.
+ */
+export function autoLayer(plan) {
+    const ix = indexOf(plan);
+    const path = [];
+    // The failure sites: flow calls that raised or were closed with no raised descendant.
+    // The graph stops on the node that shows one, not inside it. A plan with no flow calls
+    // cannot tell its failure sites, so it descends as if there were none.
+    const raised = new Set();
+    if (ix.calls)
+        for (const c of ix.calls.values())
+            if (c.state === 'raised' || c.state === 'closed')
+                raised.add(c.id);
+    const isSite = (id) => raised.has(id) && ![...raised].some((r) => r !== id && r.startsWith(`${id}.`));
+    for (;;) {
+        let only = null;
+        let one = true;
+        const mine = [];
+        for (const t of ix.tasks) {
+            if (!startsWith(t.path, path))
+                continue;
+            const p = placeOf(t, path.length);
+            if (p.type === 'kind' || (only && only.id !== p.id)) {
+                one = false;
+                break;
+            }
+            only = p;
+            mine.push(t);
+        }
+        // Stop before entering a single function node that is itself a failure site.
+        const atSite = mine.some((t) => isSite(instanceOf(t, path.length, ix.calls).id));
+        if (!one || !only || atSite)
+            return path;
+        path.push(only.name);
+    }
+}
+/** A layer's segments: its path, and the loop box entered at its end (null when none). */
+export function splitLayer(segments) {
+    const last = segments[segments.length - 1];
+    return last?.startsWith(LOOP_SEGMENT) ? { path: segments.slice(0, -1), loop: last } : { path: [...segments], loop: null };
+}
+/**
+ * The layer `segments` names, as the plan has it: the segments themselves when the
+ * plan has that layer (a prefix of a task's flow path, and the loop box after it);
+ * else, when the last function is named by its `module.qualname` (or, failing that,
+ * its name) and the plan reaches it by one flow path only, that flow path, with the
+ * loop box when the layer there has it. Null when the plan has no such layer.
+ */
+export function resolveLayer(plan, segments) {
+    const { path, loop } = splitLayer(segments);
+    const ix = indexOf(plan);
+    const hasLoop = (p) => !loop || project(plan, p).model.boxes.some((b) => b.id === loop);
+    if (ix.tasks.some((t) => startsWith(t.path, path)))
+        return hasLoop(path) ? [...segments] : null;
+    const name = path[path.length - 1];
+    if (name === undefined)
+        return null;
+    const found = (match) => {
+        const by = new Map();
+        for (const t of ix.tasks)
+            t.path.forEach((fn, i) => match(fn) && by.set(t.path.slice(0, i + 1).join('/'), t.path.slice(0, i + 1)));
+        return [...by.values()];
+    };
+    const exact = found((fn) => fn === name);
+    const named = exact.length ? exact : found((fn) => shortName(fn) === name);
+    const only = named.length === 1 ? named[0] : null;
+    return only && hasLoop(only) ? (loop ? [...only, loop] : only) : null;
+}
+/** One level up from `segments`: null at the top (the layer the graph opens on, `auto`), [] for that layer. */
+export function parentLayer(segments, auto) {
+    if (segments.length <= auto.length)
+        return null;
+    const up = segments.slice(0, -1);
+    return up.length <= auto.length ? [] : up;
+}
+//# sourceMappingURL=layer.js.map

package/dist/adapters/graph/layer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layer.js","sourceRoot":"","sources":["../../../src/adapters/graph/layer.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,OAAO,EAAmB,MAAM,6BAA6B,CAAC;AACvE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAiB,MAAM,iBAAiB,CAAC;AACrG,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAmB,MAAM,YAAY,CAAC;AAE3D;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,IAAU,EAAE,OAA0B,EAAE,EAAE,IAAiB,EAAE,IAAI,GAAG,KAAK;IAClG,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACtC,OAAO,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,SAAS,CAAC,IAAU;IAClC,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACzB,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,sFAAsF;IACtF,uFAAuF;IACvF,uEAAuE;IACvE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,IAAI,EAAE,CAAC,KAAK;QAAE,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,MAAM,EAAE;YAAE,IAAI,CAAC,CAAC,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,QAAQ;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpH,MAAM,MAAM,GAAG,CAAC,EAAU,EAAW,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACvH,SAAS,CAAC;QACR,IAAI,IAAI,GAAwC,IAAI,CAAC;QACrD,IAAI,GAAG,GAAG,IAAI,CAAC;QACf,MAAM,IAAI,GAAe,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC;gBAAE,SAAS;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpD,GAAG,GAAG,KAAK,CAAC;gBACZ,MAAM;YACR,CAAC;YACD,IAAI,GAAG,CAAC,CAAC;YACT,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACf,CAAC;QACD,6EAA6E;QAC7E,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjF,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,MAAM;YAAE,OAAO,IAAI,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;AACH,CAAC;AAED,0FAA0F;AAC1F,MAAM,UAAU,UAAU,CAAC,QAA2B;IACpD,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC3C,OAAO,IAAI,EAAE,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,QAAQ,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC5H,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,IAAU,EAAE,QAA2B;IAClE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC5C,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACzB,MAAM,OAAO,GAAG,CAAC,CAAoB,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;IAC3G,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAAE,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAChG,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACnC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,KAAK,GAAG,CAAC,KAA8B,EAAc,EAAE;QAC3D,MAAM,EAAE,GAAG,IAAI,GAAG,EAAoB,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK;YAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnI,OAAO,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1B,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC;IAC3E,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAE,KAAK,CAAC,CAAC,CAAc,CAAC,CAAC,CAAC,IAAI,CAAC;IAChE,OAAO,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACxE,CAAC;AAED,+GAA+G;AAC/G,MAAM,UAAU,WAAW,CAAC,QAA2B,EAAE,IAAuB;IAC9E,IAAI,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAChD,MAAM,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACjC,OAAO,EAAE,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;AAC5C,CAAC"}

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

@@ -0,0 +1,62 @@
+import type { Plan, TaskState } from '@contraagent/api';
+import { type GraphOrder } from '@contraagent/elements/graph';
+import { type Projection } from './project.js';
+import { type LayerMark, type GraphNode, type LoopBox } from './types.js';
+/** A column of a loop's passes: one node, in one pass of each loop from the unrolled box down to the node's own box. */
+export interface MatrixColumn {
+    node: GraphNode;
+    /** The passes, the unrolled box's loop first. */
+    passes: number[];
+}
+/** A header cell over the columns: a pass of a loop, a nested loop, or a node. */
+export type MatrixHead = {
+    type: 'pass';
+    box: LoopBox;
+    pass: number;
+    span: number;
+    rows: number;
+} | {
+    type: 'loop';
+    box: LoopBox;
+    span: number;
+    rows: number;
+} | {
+    type: 'node';
+    node: GraphNode;
+    passes: number[];
+    span: number;
+    rows: number;
+};
+export interface MatrixRow {
+    /** The unit, or '' for the tasks without one. */
+    unit: string;
+    /** How many passes of the unrolled loop it ran (in every run of the loop). */
+    passes: number;
+    /** The most severe state of its marks. */
+    state: TaskState;
+    /** One per column: its mark, or null where it has none. */
+    cells: (LayerMark | null)[];
+}
+/** A loop box with its passes unrolled: a row per unit, a column per (node, pass), nested loops as nested column groups. */
+export interface PassMatrix {
+    box: LoopBox;
+    columns: MatrixColumn[];
+    /** The header rows, outermost first; a node's cell spans down to the last. */
+    head: MatrixHead[][];
+    /** The units that have a task in the box, in the layer's order; the tasks without a unit last. */
+    rows: MatrixRow[];
+}
+/**
+ * The loop box `box` of layer `path` with its passes unrolled; null when the layer has
+ * no such box. Each task is in the column of its node and of its passes of the box's
+ * loop and of every loop nested in it, so an inner loop's passes are counted within
+ * each pass of the outer one. A column no task reached is left out. The columns
+ * follow the order of the layer drawn left to right with `prev` (its graph's order);
+ * `proj` is the layer's projection when the caller has it.
+ */
+export declare function passMatrix(plan: Plan, path: readonly string[], box: string, prev?: GraphOrder, proj?: Projection): PassMatrix | null;
+/** How a loop's units are sorted: as scheduled, most passes first, or the most severe state first. */
+export type MatrixSort = 'order' | 'passes' | 'state';
+/** `rows` sorted by `by`; a tie keeps the scheduled order. */
+export declare function sortRows(rows: readonly MatrixRow[], by: MatrixSort): MatrixRow[];
+//# sourceMappingURL=matrix.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"matrix.d.ts","sourceRoot":"","sources":["../../../src/adapters/graph/matrix.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACxD,OAAO,EAAW,KAAK,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAEvE,OAAO,EAA+D,KAAK,UAAU,EAAE,MAAM,cAAc,CAAC;AAE5G,OAAO,EAAgB,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,KAAK,OAAO,EAAE,MAAM,YAAY,CAAC;AAExF,wHAAwH;AACxH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,SAAS,CAAC;IAChB,iDAAiD;IACjD,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,kFAAkF;AAClF,MAAM,MAAM,UAAU,GAClB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GACxE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC1D;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,EAAE,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAEpF,MAAM,WAAW,SAAS;IACxB,iDAAiD;IACjD,IAAI,EAAE,MAAM,CAAC;IACb,8EAA8E;IAC9E,MAAM,EAAE,MAAM,CAAC;IACf,0CAA0C;IAC1C,KAAK,EAAE,SAAS,CAAC;IACjB,2DAA2D;IAC3D,KAAK,EAAE,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC;CAC7B;AAED,4HAA4H;AAC5H,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,OAAO,CAAC;IACb,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,8EAA8E;IAC9E,IAAI,EAAE,UAAU,EAAE,EAAE,CAAC;IACrB,kGAAkG;IAClG,IAAI,EAAE,SAAS,EAAE,CAAC;CACnB;AAID;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,UAAU,EAAE,IAAI,GAAE,UAAgC,GAAG,UAAU,GAAG,IAAI,CAsEzJ;AAED,sGAAsG;AACtG,MAAM,MAAM,UAAU,GAAG,OAAO,GAAG,QAAQ,GAAG,OAAO,CAAC;AAEtD,8DAA8D;AAC9D,wBAAgB,QAAQ,CAAC,IAAI,EAAE,SAAS,SAAS,EAAE,EAAE,EAAE,EAAE,UAAU,GAAG,SAAS,EAAE,CAIhF"}

package/dist/adapters/graph/matrix.js

@@ -0,0 +1,96 @@
+import { arrange } from '@contraagent/elements/graph';
+import { cmpPasses, passesAt, push } from './flow-index.js';
+import { arranged, flowMarks, project, shapeOf, taskMark } from './project.js';
+import { SEVERITY, worstOf } from './states.js';
+import { LOOP_SEGMENT } from './types.js';
+/**
+ * The loop box `box` of layer `path` with its passes unrolled; null when the layer has
+ * no such box. Each task is in the column of its node and of its passes of the box's
+ * loop and of every loop nested in it, so an inner loop's passes are counted within
+ * each pass of the outer one. A column no task reached is left out. The columns
+ * follow the order of the layer drawn left to right with `prev` (its graph's order);
+ * `proj` is the layer's projection when the caller has it.
+ */
+export function passMatrix(plan, path, box, prev, proj = project(plan, path)) {
+    const { drafts, ix } = proj;
+    const graph = arranged(proj.model, arrange(shapeOf(proj.model), prev, false));
+    const b = graph.boxes.find((x) => x.id === box);
+    if (!b)
+        return null;
+    const d = path.length;
+    const i0 = b.id.slice(LOOP_SEGMENT.length).split('.').length - 1;
+    const byBox = new Map(graph.boxes.map((x) => [x.id, x]));
+    const byNode = new Map(graph.nodes.map((n) => [n.id, n]));
+    const rel = (t) => passesAt(t, d).slice(i0);
+    const leaves = (x) => x.layers.flat().flatMap((id) => (byBox.has(id) ? leaves(byBox.get(id)) : [id]));
+    const tasksOf = (x) => leaves(x).flatMap((id) => drafts.get(id)?.tasks ?? []);
+    const same = (a, p) => a.length === p.length && cmpPasses(a, p) === 0;
+    const build = (x, prefix) => {
+        const k = prefix.length;
+        const passes = [...new Set(tasksOf(x).map(rel).filter((v) => v.length > k && cmpPasses(v.slice(0, k), prefix) === 0).map((v) => v[k]))].sort((a, c) => a - c);
+        return passes.flatMap((p) => {
+            const at = [...prefix, p];
+            const kids = x.layers.flat().flatMap((id) => {
+                const inner = byBox.get(id);
+                if (inner) {
+                    const sub = build(inner, at);
+                    return sub.length ? [{ type: 'loop', box: inner, kids: sub }] : [];
+                }
+                const node = byNode.get(id);
+                return node && drafts.get(id)?.tasks.some((t) => same(rel(t), at)) ? [{ type: 'node', node, passes: at }] : [];
+            });
+            return kids.length ? [{ type: 'pass', box: x, pass: p, kids }] : [];
+        });
+    };
+    const tree = build(b, []);
+    const columns = [];
+    const width = (t) => (t.type === 'node' ? 1 : t.kids.reduce((a, k) => a + width(k), 0));
+    const depthOf = (t) => (t.type === 'node' ? 1 : 1 + Math.max(0, ...t.kids.map(depthOf)));
+    const rowsN = Math.max(1, ...tree.map(depthOf));
+    const head = Array.from({ length: rowsN }, () => []);
+    const walk = (t, level) => {
+        const row = head[level];
+        if (t.type === 'node') {
+            row.push({ type: 'node', node: t.node, passes: t.passes, span: 1, rows: rowsN - level });
+            columns.push({ node: t.node, passes: t.passes });
+            return;
+        }
+        row.push(t.type === 'pass' ? { type: 'pass', box: t.box, pass: t.pass, span: width(t), rows: 1 } : { type: 'loop', box: t.box, span: width(t), rows: 1 });
+        for (const k of t.kids)
+            walk(k, level + 1);
+    };
+    for (const t of tree)
+        walk(t, 0);
+    const mine = tasksOf(b);
+    const unitsIn = new Set(mine.map((t) => t.n.unit || ''));
+    const rowUnits = [...graph.units.filter((u) => unitsIn.has(u)), ...(unitsIn.has('') ? [''] : [])];
+    const cellTasks = new Map(); // `${column}\0${unit}`
+    columns.forEach((c, ci) => {
+        for (const t of drafts.get(c.node.id)?.tasks ?? [])
+            if (same(rel(t), c.passes))
+                push(cellTasks, `${ci}\u0000${t.n.unit || ''}`, t);
+    });
+    const markOf = (c, ts, unit) => {
+        const x = drafts.get(c.node.id);
+        if (x.type === 'kind')
+            return taskMark(ts, unit);
+        const m = flowMarks(ts, d, x.name, ix.calls);
+        return unit ? (m.byUnit.get(unit) ?? m.single[0] ?? null) : (m.single[0] ?? null);
+    };
+    const rows = rowUnits.map((unit) => {
+        const cells = columns.map((c, ci) => {
+            const ts = cellTasks.get(`${ci}\u0000${unit}`);
+            return ts?.length ? markOf(c, ts, unit) : null;
+        });
+        const passes = new Set(mine.filter((t) => (t.n.unit || '') === unit).map((t) => passesAt(t, d).slice(0, i0 + 1).join('.'))).size;
+        return { unit, passes, state: worstOf(cells.filter((m) => m !== null).map((m) => m.state)), cells };
+    });
+    return { box: b, columns, head, rows };
+}
+/** `rows` sorted by `by`; a tie keeps the scheduled order. */
+export function sortRows(rows, by) {
+    const ix = new Map(rows.map((r, i) => [r, i]));
+    const key = (r) => (by === 'passes' ? -r.passes : by === 'state' ? -SEVERITY[r.state] : 0);
+    return [...rows].sort((a, b) => key(a) - key(b) || (ix.get(a) ?? 0) - (ix.get(b) ?? 0));
+}
+//# sourceMappingURL=matrix.js.map

package/dist/adapters/graph/matrix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../../../src/adapters/graph/matrix.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,OAAO,EAAmB,MAAM,6BAA6B,CAAC;AACvE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,IAAI,EAAiB,MAAM,iBAAiB,CAAC;AAC3E,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAA+B,MAAM,cAAc,CAAC;AAC5G,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,YAAY,EAAgD,MAAM,YAAY,CAAC;AAsCxF;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CAAC,IAAU,EAAE,IAAuB,EAAE,GAAW,EAAE,IAAiB,EAAE,OAAmB,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC;IACpI,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC;IAC5B,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;IAC9E,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;IAChD,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACpB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IACjE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1D,MAAM,GAAG,GAAG,CAAC,CAAW,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG,CAAC,CAAU,EAAY,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpI,MAAM,OAAO,GAAG,CAAC,CAAU,EAAc,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC;IACnG,MAAM,IAAI,GAAG,CAAC,CAAoB,EAAE,CAAoB,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC5G,MAAM,KAAK,GAAG,CAAC,CAAU,EAAE,MAAgB,EAAa,EAAE;QACxD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxK,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAa,EAAE;YACrC,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,EAAa,EAAE;gBACrD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC5B,IAAI,KAAK,EAAE,CAAC;oBACV,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;oBAC7B,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrE,CAAC;gBACD,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC5B,OAAO,IAAI,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjH,CAAC,CAAC,CAAC;YACH,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC1B,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,MAAM,KAAK,GAAG,CAAC,CAAU,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACzG,MAAM,OAAO,GAAG,CAAC,CAAU,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1G,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAChD,MAAM,IAAI,GAAmB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IACrE,MAAM,IAAI,GAAG,CAAC,CAAU,EAAE,KAAa,EAAQ,EAAE;QAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAiB,CAAC;QACxC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACtB,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,GAAG,KAAK,EAAE,CAAC,CAAC;YACzF,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YACjD,OAAO;QACT,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1J,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;YAAE,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC;IACzD,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClG,MAAM,SAAS,GAAG,IAAI,GAAG,EAAsB,CAAC,CAAC,uBAAuB;IACxE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE;QACxB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,EAAE;YAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;gBAAE,IAAI,CAAC,SAAS,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACrI,CAAC,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,CAAC,CAAe,EAAE,EAAuB,EAAE,IAAY,EAAoB,EAAE;QAC1F,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAU,CAAC;QACzC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;IACpF,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAa,EAAE;QAC5C,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE;YAClC,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,IAAI,EAAE,CAAC,CAAC;YAC/C,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACjD,CAAC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACjI,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAkB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC;IACtH,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACzC,CAAC;AAKD,8DAA8D;AAC9D,MAAM,UAAU,QAAQ,CAAC,IAA0B,EAAE,EAAc;IACjE,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,GAAG,GAAG,CAAC,CAAY,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtG,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAC1F,CAAC"}

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

@@ -0,0 +1,49 @@
+import { type FlowCallNode, type Plan, type TimeBoxRecord } from '@contraagent/api';
+import type { Arrangement, EdgeStyle, GraphShape } from '@contraagent/elements/graph';
+import { type FlowIndex, type FlowTask } from './flow-index.js';
+import { type LayerGraph, type LayerMark, type LayerModel } from './types.js';
+export declare function taskMark(ts: readonly FlowTask[], unit: string): LayerMark;
+export interface Marks {
+    byUnit: Map<string, LayerMark>;
+    single: LayerMark[];
+    /** A function node's flow calls, and those that raised or were closed. */
+    calls?: number;
+    errors?: number;
+    /** A function node's first own flow call with a deadline of its own (`time_box`), else null. */
+    timeBox?: TimeBoxRecord | null;
+}
+/**
+ * A function node's marks: its flow calls, one mark per unit when a call's tasks share one unit, else one per call.
+ * A call's state is the most severe of its own (raised or closed: failed) and its tasks' (those of the calls it
+ * started included), so a call that caught a task's failure and returned still shows it.
+ */
+export declare function flowMarks(ts: readonly FlowTask[], d: number, name: string, calls: Map<string, FlowCallNode> | null): Marks;
+/** When a flow call's own deadline falls: its start plus `deadline_s` (UTC ISO 8601); '' when its start is not known. */
+export declare function deadlineOf(box: TimeBoxRecord): string;
+export interface Draft {
+    id: string;
+    type: 'kind' | 'flow';
+    name: string;
+    loops: number[];
+    tasks: FlowTask[];
+}
+export interface Projection {
+    model: LayerModel;
+    drafts: Map<string, Draft>;
+    ix: FlowIndex;
+}
+/** The layer `path` of the plan, as the plan has it: its nodes, loop boxes, edges and stubs, not yet arranged. */
+export declare function project(plan: Plan, path: readonly string[]): Projection;
+/**
+ * The layer `path` of the tasks `inside` (each with that prefix): its nodes, loop boxes,
+ * edges and stubs, as `project` has them. A function drawn open (`compound.ts`) is the
+ * layer of the tasks of its node alone.
+ */
+export declare function projectTasks(ix: FlowIndex, path: readonly string[], inside: readonly FlowTask[]): Projection;
+/** How an edge of the layer is drawn: an `after` edge solid, a `created` one dashed. */
+export declare const edgeStyle: (type: "after" | "created") => EdgeStyle;
+/** What `arrange` reads of a layer: its nodes in their loop boxes, the boxes (each a loop: it cycles), and the links. */
+export declare function shapeOf(m: LayerModel): GraphShape;
+/** The layer arranged: its nodes in drawing order, each loop box with its layers, the edges that go back marked. */
+export declare function arranged(m: LayerModel, a: Arrangement): LayerGraph;
+//# sourceMappingURL=project.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"project.d.ts","sourceRoot":"","sources":["../../../src/adapters/graph/project.ts"],"names":[],"mappings":"AAiBA,OAAO,EAAY,KAAK,YAAY,EAAE,KAAK,IAAI,EAAiC,KAAK,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAC7H,OAAO,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACtF,OAAO,EAAqG,KAAK,SAAS,EAAE,KAAK,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAEnK,OAAO,EAAgC,KAAK,UAAU,EAAE,KAAK,SAAS,EAAE,KAAK,UAAU,EAAiC,MAAM,YAAY,CAAC;AAa3I,wBAAgB,QAAQ,CAAC,EAAE,EAAE,SAAS,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,SAAS,CAIzE;AAED,MAAM,WAAW,KAAK;IACpB,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC/B,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB,0EAA0E;IAC1E,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,gGAAgG;IAChG,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI,CAAC;CAChC;AAmCD;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,SAAS,QAAQ,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,GAAG,IAAI,GAAG,KAAK,CA4B1H;AAED,yHAAyH;AACzH,wBAAgB,UAAU,CAAC,GAAG,EAAE,aAAa,GAAG,MAAM,CAGrD;AAiCD,MAAM,WAAW,KAAK;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,QAAQ,EAAE,CAAC;CACnB;AAED,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,UAAU,CAAC;IAClB,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC3B,EAAE,EAAE,SAAS,CAAC;CACf;AAED,kHAAkH;AAClH,wBAAgB,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,UAAU,CAGvE;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,EAAE,SAAS,QAAQ,EAAE,GAAG,UAAU,CAiJ5G;AAED,wFAAwF;AACxF,eAAO,MAAM,SAAS,GAAI,MAAM,OAAO,GAAG,SAAS,KAAG,SAAoD,CAAC;AAE3G,yHAAyH;AACzH,wBAAgB,OAAO,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU,CAUjD;AAED,oHAAoH;AACpH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,WAAW,GAAG,UAAU,CAalE"}