@contraagent/ui 0.1.0 → 0.2.0

package/dist/elements/overview/graph/flow-index.js

@@ -1,121 +0,0 @@
-// The plan as the graph reads it: each task's flow path, its loops and passes, its
-// flow call, and where it is shown at a depth of the flow path.
-// A plan node's origin (`flow`, `created_from`, `flow_call`) is optional on the
-// wire (absent for a task no flow created), so the readers here check it before use.
-import {} from '@contraagent/api';
-import { LOOP_SEGMENT } from './types.js';
-const isStr = (x) => typeof x === 'string';
-function readFrames(n) {
-    const f = n.flow;
-    if (!Array.isArray(f))
-        return [];
-    const out = [];
-    for (const x of f) {
-        const r = x;
-        if (!r || typeof r !== 'object' || !isStr(r.function))
-            break;
-        const read = (Array.isArray(r.loops) ? r.loops : []).filter((l) => !!l && typeof l.line === 'number');
-        out.push({
-            function: r.function,
-            file: isStr(r.file) ? r.file : '',
-            line: typeof r.line === 'number' ? r.line : 0,
-            loops: read.map((l) => l.line),
-            // A pass not counted (null) reads as the first.
-            passes: read.map((l) => (typeof l.pass === 'number' && l.pass >= 1 ? l.pass : 1)),
-        });
-    }
-    return out;
-}
-function readCalls(plan) {
-    const cs = plan.flow_calls;
-    if (!Array.isArray(cs) || cs.length === 0)
-        return null; // no flow call recorded
-    return new Map(cs.filter((c) => c && isStr(c.id) && isStr(c.function)).map((c) => [c.id, c]));
-}
-const indexes = new WeakMap();
-export function indexOf(plan) {
-    const had = indexes.get(plan);
-    if (had)
-        return had;
-    const tasks = plan.nodes.map((n) => {
-        const frames = readFrames(n);
-        const from = n.created_from;
-        return {
-            n,
-            frames,
-            path: frames.map((f) => f.function),
-            from: Array.isArray(from) ? from.filter(isStr) : [],
-            call: isStr(n.flow_call) ? n.flow_call : '',
-        };
-    });
-    const unitRank = new Map();
-    for (const n of plan.nodes)
-        if (n.unit && !unitRank.has(n.unit))
-            unitRank.set(n.unit, unitRank.size);
-    const ix = {
-        tasks,
-        byKey: new Map(tasks.map((t) => [t.n.key, t])),
-        calls: readCalls(plan),
-        unitRank,
-        labels: new Map(plan.groups.map((g) => [g.id, g.label])),
-    };
-    indexes.set(plan, ix);
-    return ix;
-}
-export const startsWith = (path, prefix) => prefix.every((p, i) => path[i] === p);
-/** A function's name without its module. */
-export const shortName = (fn) => fn.slice(fn.lastIndexOf('.') + 1) || fn;
-/** The loops around a task's call site at depth `d`, outermost first ([] outside any). */
-export const loopsAt = (t, d) => (d > 0 ? (t.frames[d - 1]?.loops ?? []) : []);
-/** The pass of each of those loops, outermost first: the task's place in them. */
-export const passesAt = (t, d) => (d > 0 ? (t.frames[d - 1]?.passes ?? []) : []);
-/** Two pass lists in the order the passes ran: the outer loop's first. */
-export function cmpPasses(a, b) {
-    for (let i = 0; i < Math.max(a.length, b.length); i++) {
-        const d = (a[i] ?? 0) - (b[i] ?? 0);
-        if (d)
-            return d;
-    }
-    return 0;
-}
-/** The loop box ids for a loop chain, outermost first: `loop:7`, then `loop:7.9`, ... */
-export const boxChain = (loops) => loops.map((_, i) => `${LOOP_SEGMENT}${loops.slice(0, i + 1).join('.')}`);
-/** Where a task is shown at depth `d`: its kind node, or the node of the function it was created under. */
-export function placeOf(t, d) {
-    const loops = loopsAt(t, d);
-    const at = loops.length ? `@${loops.join('.')}` : '';
-    if (t.path.length <= d)
-        return { id: `kind:${t.n.group}${at}`, type: 'kind', name: t.n.group, loops };
-    const name = t.path[d];
-    return { id: `flow:${name}${at}`, type: 'flow', name, loops };
-}
-/**
- * The flow call a function node stands for, for a task at depth `d`: the call that
- * started at frame `d` (`own`), else the call the frame runs in (`yield from`). With
- * no flow calls in the plan, each frame of the task's call chain is taken to start one.
- */
-export function instanceOf(t, d, calls) {
-    if (!t.call)
-        return { id: `>${d}`, own: false };
-    const parts = t.call.split('.');
-    const chain = parts.map((_, i) => parts.slice(0, i + 1).join('.'));
-    let owner = 0;
-    let start = 0;
-    if (calls) {
-        for (let j = 1; j < chain.length; j++) {
-            const fn = calls.get(chain[j])?.function;
-            const idx = fn === undefined ? -1 : t.frames.findIndex((f, i) => i > start && f.function === fn);
-            if (idx < 0 || idx > d)
-                break;
-            owner = j;
-            start = idx;
-        }
-    }
-    else {
-        owner = Math.min(d, chain.length - 1);
-        start = owner;
-    }
-    const id = chain[owner];
-    return start === d ? { id, own: true } : { id: `${id}>${d}`, own: false };
-}
-//# sourceMappingURL=flow-index.js.map

package/dist/elements/overview/graph/flow-index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"flow-index.js","sourceRoot":"","sources":["../../../../src/elements/overview/graph/flow-index.ts"],"names":[],"mappings":"AAAA,mFAAmF;AACnF,gEAAgE;AAChE,gFAAgF;AAChF,qFAAqF;AACrF,OAAO,EAA8E,MAAM,kBAAkB,CAAC;AAC9G,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AA2B1C,MAAM,KAAK,GAAG,CAAC,CAAU,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC;AAEjE,SAAS,UAAU,CAAC,CAAW;IAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,IAAe,CAAC;IAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IACjC,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,IAAI,CAAc,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,CAA8B,CAAC;QACzC,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC;YAAE,MAAM;QAC7D,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAiB,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;QACrH,GAAG,CAAC,IAAI,CAAC;YACP,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;YACjC,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC7C,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAC9B,gDAAgD;YAChD,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClF,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAAC,IAAU;IAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,UAAqB,CAAC;IACtC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,wBAAwB;IAChF,OAAO,IAAI,GAAG,CAAE,EAA8B,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAY,EAAE,CAAiB,CAAC,CAAC,CAAC,CAAC;AACvJ,CAAC;AAED,MAAM,OAAO,GAAG,IAAI,OAAO,EAAmB,CAAC;AAE/C,MAAM,UAAU,OAAO,CAAC,IAAU;IAChC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,GAAG;QAAE,OAAO,GAAG,CAAC;IACpB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAY,EAAE;QAC3C,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,CAAC,CAAC,YAAuB,CAAC;QACvC,OAAO;YACL,CAAC;YACD,MAAM;YACN,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;YACnC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,IAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;YAClE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;SAC5C,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK;QAAE,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IACrG,MAAM,EAAE,GAAc;QACpB,KAAK;QACL,KAAK,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9C,KAAK,EAAE,SAAS,CAAC,IAAI,CAAC;QACtB,QAAQ;QACR,MAAM,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;KACzD,CAAC;IACF,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACtB,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,IAAuB,EAAE,MAAyB,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AAExH,4CAA4C;AAC5C,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,EAAU,EAAU,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AAEzF,0FAA0F;AAC1F,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,CAAW,EAAE,CAAS,EAAY,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAE3G,kFAAkF;AAClF,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAW,EAAE,CAAS,EAAY,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAE7G,0EAA0E;AAC1E,MAAM,UAAU,SAAS,CAAC,CAAoB,EAAE,CAAoB;IAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACtD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACpC,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,yFAAyF;AACzF,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,KAAwB,EAAY,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAEzI,2GAA2G;AAC3G,MAAM,UAAU,OAAO,CAAC,CAAW,EAAE,CAAS;IAC5C,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACrD,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC;IACtG,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAW,CAAC;IACjC,OAAO,EAAE,EAAE,EAAE,QAAQ,IAAI,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAChE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,CAAW,EAAE,CAAS,EAAE,KAAuC;IACxF,IAAI,CAAC,CAAC,CAAC,IAAI;QAAE,OAAO,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;IAChD,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAChC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACnE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,EAAE,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAW,CAAC,EAAE,QAAQ,CAAC;YACnD,MAAM,GAAG,GAAG,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,CAAC;YACjG,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC;gBAAE,MAAM;YAC9B,KAAK,GAAG,CAAC,CAAC;YACV,KAAK,GAAG,GAAG,CAAC;QACd,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtC,KAAK,GAAG,KAAK,CAAC;IAChB,CAAC;IACD,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAW,CAAC;IAClC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;AAC5E,CAAC"}

package/dist/elements/overview/graph/highlight.d.ts

@@ -1,14 +0,0 @@
-import type { PlanNode } from '@contraagent/api';
-/** The plan's tasks by key, and the tasks that wait for each task. */
-export interface TaskLinks {
-    byKey: ReadonlyMap<string, PlanNode>;
-    waiters: ReadonlyMap<string, readonly string[]>;
-}
-export declare function taskLinks(nodes: readonly PlanNode[]): TaskLinks;
-/**
- * The tasks to highlight for `hl` (a unit, or the key of a task without one): the
- * unit's own, and every task joined to them upstream or downstream (a task without a
- * unit, another unit's).
- */
-export declare function related(nodes: readonly PlanNode[], links: TaskLinks, hl: string): Set<string>;
-//# sourceMappingURL=highlight.d.ts.map

package/dist/elements/overview/graph/highlight.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"highlight.d.ts","sourceRoot":"","sources":["../../../../src/elements/overview/graph/highlight.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAEjD,sEAAsE;AACtE,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IACrC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;CACjD;AAED,wBAAgB,SAAS,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,GAAG,SAAS,CAI/D;AAED;;;;GAIG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAkB7F"}

package/dist/elements/overview/graph/highlight.js

@@ -1,33 +0,0 @@
-export function taskLinks(nodes) {
-    const waiters = new Map();
-    for (const n of nodes)
-        for (const d of n.after ?? [])
-            (waiters.get(d) ?? waiters.set(d, []).get(d))?.push(n.key);
-    return { byKey: new Map(nodes.map((n) => [n.key, n])), waiters };
-}
-/**
- * The tasks to highlight for `hl` (a unit, or the key of a task without one): the
- * unit's own, and every task joined to them upstream or downstream (a task without a
- * unit, another unit's).
- */
-export function related(nodes, links, hl) {
-    const seeds = nodes.filter((n) => (n.unit ? n.unit === hl : n.key === hl)).map((n) => n.key);
-    const on = new Set(seeds);
-    const walk = (next) => {
-        const seen = new Set(seeds);
-        const queue = [...seeds];
-        for (let k = queue.pop(); k !== undefined; k = queue.pop()) {
-            for (const x of next(k)) {
-                if (seen.has(x))
-                    continue;
-                seen.add(x);
-                on.add(x);
-                queue.push(x);
-            }
-        }
-    };
-    walk((k) => links.waiters.get(k) ?? []);
-    walk((k) => links.byKey.get(k)?.after ?? []);
-    return on;
-}
-//# sourceMappingURL=highlight.js.map

package/dist/elements/overview/graph/highlight.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"highlight.js","sourceRoot":"","sources":["../../../../src/elements/overview/graph/highlight.ts"],"names":[],"mappings":"AAUA,MAAM,UAAU,SAAS,CAAC,KAA0B;IAClD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE;YAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjH,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;AACnE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,OAAO,CAAC,KAA0B,EAAE,KAAgB,EAAE,EAAU;IAC9E,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7F,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAC1B,MAAM,IAAI,GAAG,CAAC,IAAwC,EAAE,EAAE;QACxD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC;YAC3D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC1B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACZ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACV,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IACF,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACxC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC;IAC7C,OAAO,EAAE,CAAC;AACZ,CAAC"}

package/dist/elements/overview/graph/layer.d.ts

@@ -1,32 +0,0 @@
-import type { Plan } from '@contraagent/api';
-import { type LayerGraph, type LayerOrder } 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` routes the edges for a drawing top to bottom
- * (a box's label is then on the side its edges come in).
- */
-export declare function layerGraph(plan: Plan, path?: readonly string[], prev?: LayerOrder, down?: boolean): LayerGraph;
-/**
- * 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 declare function autoLayer(plan: Plan): string[];
-/** A layer's segments: its path, and the loop box entered at its end (null when none). */
-export declare function splitLayer(segments: readonly string[]): {
-    path: string[];
-    loop: string | 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 declare function resolveLayer(plan: Plan, segments: readonly string[]): string[] | null;
-/** One level up from `segments`: null at the top (the layer the graph opens on, `auto`), [] for that layer. */
-export declare function parentLayer(segments: readonly string[], auto: readonly string[]): string[] | null;
-//# sourceMappingURL=layer.d.ts.map

package/dist/elements/overview/graph/layer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"layer.d.ts","sourceRoot":"","sources":["../../../../src/elements/overview/graph/layer.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAG7C,OAAO,EAAgB,KAAK,UAAU,EAAE,KAAK,UAAU,EAAE,MAAM,YAAY,CAAC;AAE5E;;;;GAIG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,GAAE,SAAS,MAAM,EAAO,EAAE,IAAI,CAAC,EAAE,UAAU,EAAE,IAAI,UAAQ,GAAG,UAAU,CAEhH;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,EAAE,CA4B9C;AAED,0FAA0F;AAC1F,wBAAgB,UAAU,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG;IAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAA;CAAE,CAG/F;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CAgBrF;AAED,+GAA+G;AAC/G,wBAAgB,WAAW,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,CAIjG"}

package/dist/elements/overview/graph/layer.js

@@ -1,92 +0,0 @@
-import { indexOf, instanceOf, placeOf, shortName, startsWith } from './flow-index.js';
-import { project } 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` routes the edges 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) {
-    return project(plan, path, prev, down).graph;
-}
-/**
- * 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 || layerGraph(plan, p).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/elements/overview/graph/layer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"layer.js","sourceRoot":"","sources":["../../../../src/elements/overview/graph/layer.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAiB,MAAM,iBAAiB,CAAC;AACrG,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,YAAY,EAAoC,MAAM,YAAY,CAAC;AAE5E;;;;GAIG;AACH,MAAM,UAAU,UAAU,CAAC,IAAU,EAAE,OAA0B,EAAE,EAAE,IAAiB,EAAE,IAAI,GAAG,KAAK;IAClG,OAAO,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC;AAC/C,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,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;IACxG,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/elements/overview/graph/layout.d.ts

@@ -1,80 +0,0 @@
-import type { LayerGraph } from './types.js';
-export interface Size {
-    w: number;
-    h: number;
-}
-/** A rectangle in the drawing. */
-export interface Rect {
-    x: number;
-    y: number;
-    w: number;
-    h: number;
-}
-/** A straight stretch of an edge along the flow, from `a` to `b`, `at` across it; an edge bends between two. */
-export interface Run {
-    a: number;
-    b: number;
-    at: number;
-}
-export interface GraphLayout {
-    /** The drawing's size, its margin included. */
-    w: number;
-    h: number;
-    /** Every node, stub and loop box, by id. */
-    at: Record<string, Rect>;
-    /** Every route, with its runs. */
-    edges: {
-        from: string;
-        to: string;
-        type: 'after' | 'created';
-        runs: Run[];
-    }[];
-    /** Each loop box's return to its next pass. */
-    returns: LoopReturn[];
-    down: boolean;
-}
-/**
- * A loop box's return to its next pass, along the flow (`u`) and across it (`v`): from
- * the far side of its last layer's outermost item (`from`, at `v0`) out to a band
- * past its content (`band`), back along the band, and in to its first layer's
- * outermost item (`to`, at `v1`). Left to right the band is under the nodes; top to
- * bottom, on their right.
- */
-export interface LoopReturn {
-    box: string;
-    from: number;
-    v0: number;
-    to: number;
-    v1: number;
-    band: number;
-}
-/** The spaces of a drawing; left to right unless `down`. */
-export interface LayoutSpace {
-    /** Between two layers, at the top level and in a loop box. */
-    gap: number;
-    boxGap: number;
-    /** Between two items of a layer, and next to a point an edge passes. */
-    sep: number;
-    pointSep: number;
-    /** A loop box's padding, and the space under its label. */
-    pad: number;
-    /** The space after a box's content, across the flow: the band its return to the next pass runs in. */
-    padEnd: number;
-    margin: number;
-}
-/** The band past a loop box's content that its return to the next pass runs in, and the return's corner radius. */
-export declare const RETURN_BAND = 24;
-export declare const RETURN_R = 6;
-export declare const SPACE: Record<'across' | 'down', LayoutSpace>;
-/**
- * Where everything of a layer's graph is drawn, from the sizes of its nodes, its stubs
- * and its loop boxes' labels (`lbl:<box id>`): left to right, or top to bottom when
- * `down`. Each container is laid out inside out, a box being one item of its parent:
- * its layers side by side, an item at the start of its layer; across the flow, each
- * item as near as its order allows to the items it is joined to (sweeps of weighted
- * isotonic regression), so chains run straight. An edge runs along its points and
- * bends only in the gap between two layers; it enters and leaves a box where its
- * point inside is, and never passes a node or a box's label.
- */
-export declare function layoutGraph(g: LayerGraph, sizes: ReadonlyMap<string, Size>, down?: boolean): GraphLayout;
-//# sourceMappingURL=layout.d.ts.map

package/dist/elements/overview/graph/layout.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"layout.d.ts","sourceRoot":"","sources":["../../../../src/elements/overview/graph/layout.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAa,MAAM,YAAY,CAAC;AAExD,MAAM,WAAW,IAAI;IACnB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,kCAAkC;AAClC,MAAM,WAAW,IAAI;IACnB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,gHAAgH;AAChH,MAAM,WAAW,GAAG;IAClB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,WAAW;IAC1B,+CAA+C;IAC/C,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,4CAA4C;IAC5C,EAAE,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACzB,kCAAkC;IAClC,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,GAAG,SAAS,CAAC;QAAC,IAAI,EAAE,GAAG,EAAE,CAAA;KAAE,EAAE,CAAC;IAC9E,+CAA+C;IAC/C,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,IAAI,EAAE,OAAO,CAAC;CACf;AAED;;;;;;GAMG;AACH,MAAM,WAAW,UAAU;IACzB,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;CACd;AAED,4DAA4D;AAC5D,MAAM,WAAW,WAAW;IAC1B,8DAA8D;IAC9D,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,wEAAwE;IACxE,GAAG,EAAE,MAAM,CAAC;IACZ,QAAQ,EAAE,MAAM,CAAC;IACjB,2DAA2D;IAC3D,GAAG,EAAE,MAAM,CAAC;IACZ,sGAAsG;IACtG,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,mHAAmH;AACnH,eAAO,MAAM,WAAW,KAAK,CAAC;AAC9B,eAAO,MAAM,QAAQ,IAAI,CAAC;AAE1B,eAAO,MAAM,KAAK,EAAE,MAAM,CAAC,QAAQ,GAAG,MAAM,EAAE,WAAW,CAGxD,CAAC;AAsBF;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,IAAI,UAAQ,GAAG,WAAW,CA4NtG"}