agentfootprint 7.10.0 → 7.11.0

package/README.md

@@ -753,7 +753,7 @@ The flowchart, recorders, and tests don't change between dev and prod.
 
 **Core**
 - 2 primitives — `LLMCall`, `Agent` (the ReAct loop)
-- 4 control flows — `Sequence`, `Parallel`, `Conditional`, `Loop` (plus `workflow()`, the same sequence with every hand-off type-checked by the compiler)
+- 4 control flows — `Sequence`, `Parallel`, `Conditional`, `Loop` (plus `workflow()`, the same sequence with every hand-off type-checked by the compiler, and `graph()`, a fixed DAG whose independent nodes run concurrently)
 - 1 Injection primitive — `defineSkill` / `defineSteering` / `defineInstruction` / `defineFact`
 - 1 reliability gate — `.reliability({ preCheck, postDecide, providers, circuitBreaker, fallback })`
 - 1 tool dispatch primitive — `ToolProvider` (sync OR async) — `staticTools` · `gatedTools` · `skillScopedTools` · or a custom `ToolProvider` that discovers over hubs / MCP / per-tenant catalogs

package/dist/core-flow/Graph.js

@@ -0,0 +1,607 @@
+"use strict";
+/**
+ * graph() — a FIXED DAG of runners, levelized at build time.
+ *
+ * WHY this exists: `Sequence` and `workflow()` run steps in a line, and
+ * `Parallel` fans out ONCE and merges. Real pipelines are neither: an
+ * intake step feeds two independent lookups, and a writer waits for both.
+ * Expressing that with the existing compositions means nesting a Parallel
+ * inside a Sequence and threading values through by hand — and on this
+ * codebase that hand-off silently loses structured data (see "The trap"
+ * below). `graph()` states the shape once, as nodes and edges, and lets
+ * the engine work out what can run at the same time.
+ *
+ * What it gives you:
+ *   - **Concurrency you did not have to schedule.** Kahn levelization at
+ *     BUILD time groups nodes with no dependency between them; every node
+ *     in a level runs at the same time.
+ *   - **A shape checked before it runs.** A cycle, an edge pointing at a
+ *     node that does not exist, or a duplicate id is refused at BUILD
+ *     time, naming the offender. You cannot construct a broken graph.
+ *   - **No silent merges.** A node with two or more parents MUST declare
+ *     a `join` — a silent merge is a wrong merge, so the build refuses
+ *     and names the node.
+ *   - **Values, not text.** An edge's payload is the producer's OUTPUT
+ *     handed to the consumer, unchanged. There is no shared mutable scope
+ *     between nodes: a node reads exactly what its parents produced.
+ *
+ * Pattern: Adapter over footprintjs's subflow mounts — a level with
+ *          several nodes becomes stacked `addSubFlowChart` calls (a fork,
+ *          run concurrently); a level with one node is mounted
+ *          sequentially (`addSubFlowChartNext`, which resumes cleanly
+ *          across a pause). One join stage between levels.
+ * Role:    core-flow/ layer, alongside Sequence/Parallel/Conditional/
+ *          Loop/Workflow. Pure control flow — no LLM dependency.
+ * Emits:   agentfootprint.composition.enter / exit, reported as kind
+ *          `'Sequence'`. See "Why kind 'Sequence'" below.
+ *
+ * ## The trap this was built around (verified against footprintjs, not docs)
+ *
+ * The obvious sketch — `graph = Sequence(Parallel(level0), Parallel(level1), …)`
+ * — does NOT work on this codebase, for two independent reasons:
+ *
+ *   1. `Sequence`'s step contract is `{ message: string } -> string`, and
+ *      its step `outputMapper` coerces a non-string step output to `''`.
+ *      `workflow()` (v7.10.0) exists precisely because of this.
+ *   2. `Parallel` has the SAME limit one layer down: its branch type is
+ *      `Runner<{ message: string }, string>` and its branch `outputMapper`
+ *      coerces a non-string branch output to `''` (`Parallel.ts`, the
+ *      `typeof sfOutput === 'string' ? sfOutput : ''` mapper). So a
+ *      Parallel level cannot carry a structured value either.
+ *
+ * So `graph()` is built on the pass-through model `workflow()` established
+ * — its own composition, its own mappers, the same recorder wiring and the
+ * same `composition.enter` / `exit` events — rather than on top of
+ * Sequence/Parallel.
+ *
+ * ## Why kind 'Sequence'
+ *
+ * `CompositionKind` is a CLOSED public union (`'Sequence' | 'Parallel' |
+ * 'Conditional' | 'Loop'`). Widening it would break exhaustive switches in
+ * consumer code for no behavioural gain — the same call v7.10.0 made for
+ * `workflow()`. A graph's LEVELS are a sequence (level 0, then level 1, …),
+ * so `'Sequence'` is the honest member of that union: this composition runs
+ * its levels in order. The fan-out WITHIN a level is visible in the chart
+ * itself (a fork node per level), which is where a renderer reads it from.
+ *
+ * ## Honest limits (all verified against the engine, pinned in tests)
+ *
+ *   1. Only PLAIN DATA crosses a node boundary — the same limit
+ *      `workflow()` documents. A value with a prototype (Date, Map, class
+ *      instance) arrives as `{}`; `undefined` fields are dropped.
+ *   2. A node must RETURN its output: the value handed to its children is
+ *      the node chart's traversal result.
+ *   3. A node that THROWS is always reported as
+ *      `graph '<id>': node '<node>' failed: <reason>`, but it reaches that
+ *      sentence by two different routes. In a CONCURRENT level footprintjs
+ *      runs children under `Promise.allSettled`, so a failed child is
+ *      simply ABSENT from the results and the level join turns that
+ *      absence into the error. In a SEQUENTIAL (single-node) level the
+ *      error rejects the run raw, and `rethrowWithNodeAttribution` renames
+ *      it. Consumers see one shape either way.
+ *   4. A node that PAUSES surfaces as a pause — the engine halts the
+ *      traversal before the level's join runs, so `run()` returns a
+ *      `RunnerPauseOutcome`. `resume()` then carries on through the REST
+ *      of the graph only when the paused node was ALONE in its level (a
+ *      sequential mount). Resuming into a fork child completes that child
+ *      and stops: the remaining levels do not run. Give a node that asks a
+ *      human a level of its own. Both halves are pinned in tests.
+ *
+ * @example  a diamond: A feeds B and C, D waits for both
+ * ```ts
+ * const pipeline = graph({
+ *   nodes: [
+ *     { id: 'intake', runner: intake },
+ *     { id: 'orders', runner: lookupOrders },
+ *     { id: 'billing', runner: lookupBilling },
+ *     {
+ *       id: 'reply',
+ *       runner: writeReply,
+ *       // Two parents ⇒ a join is REQUIRED. `upstream` is keyed by node id.
+ *       join: (upstream) => ({
+ *         orders: upstream.orders as OrderInfo,
+ *         billing: upstream.billing as BillingInfo,
+ *       }),
+ *     },
+ *   ],
+ *   edges: [
+ *     { from: 'intake', to: 'orders' },
+ *     { from: 'intake', to: 'billing' },
+ *     { from: 'orders', to: 'reply' },
+ *     { from: 'billing', to: 'reply' },
+ *   ],
+ * });
+ *
+ * const out = await pipeline.run({ message: 'where is my refund?' });
+ * // out = { intake: …, orders: …, billing: …, reply: … } — keyed by node id
+ * ```
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.graph = exports.Graph = exports.levelize = void 0;
+const footprintjs_1 = require("footprintjs");
+const RunnerBase_js_1 = require("../core/RunnerBase.js");
+const AgentRecorder_js_1 = require("../recorders/core/AgentRecorder.js");
+const CompositionRecorder_js_1 = require("../recorders/core/CompositionRecorder.js");
+const ContextRecorder_js_1 = require("../recorders/core/ContextRecorder.js");
+const StreamRecorder_js_1 = require("../recorders/core/StreamRecorder.js");
+const typedEmit_js_1 = require("../recorders/core/typedEmit.js");
+/**
+ * The one sentence every node failure is reported with, whatever mount the
+ * level used. A graph has two mount paths — a fork for concurrent levels, a
+ * sequential mount for single-node ones — and footprintjs surfaces failures
+ * differently through each (a fork child's error is swallowed into absence;
+ * a sequential child's rejects the run raw). Consumers should not have to
+ * know which one they got, so both are reported like this.
+ */
+function nodeFailureMessage(graphId, nodeId, reason) {
+    return `graph '${graphId}': node '${nodeId}' failed: ${reason}`;
+}
+// ─── Build-time validation + levelization ────────────────────────────
+/**
+ * Kahn levelization: group nodes so that everything in level N depends
+ * only on levels < N. Nodes within a level are independent BY
+ * CONSTRUCTION, which is exactly the licence to run them concurrently.
+ *
+ * Declaration order is preserved inside each level so a graph's chart —
+ * and therefore its trace — is deterministic.
+ *
+ * Throws (naming the offender) on: an unknown edge endpoint, a duplicate
+ * node id, a cycle, or a fan-in > 1 with no `join`.
+ */
+function levelize(nodes, edges) {
+    if (nodes.length === 0) {
+        throw new Error('graph: needs at least one node');
+    }
+    const byId = new Map();
+    for (const node of nodes) {
+        if (byId.has(node.id)) {
+            throw new Error(`graph: duplicate node id '${node.id}' — every node id must be unique (it is the results key).`);
+        }
+        byId.set(node.id, node);
+    }
+    const parents = new Map();
+    const children = new Map();
+    for (const node of nodes) {
+        parents.set(node.id, []);
+        children.set(node.id, []);
+    }
+    for (const edge of edges) {
+        if (!byId.has(edge.from)) {
+            throw new Error(`graph: edge '${edge.from}' -> '${edge.to}' references unknown node '${edge.from}'.`);
+        }
+        if (!byId.has(edge.to)) {
+            throw new Error(`graph: edge '${edge.from}' -> '${edge.to}' references unknown node '${edge.to}'.`);
+        }
+        parents.get(edge.to)?.push(edge.from);
+        children.get(edge.from)?.push(edge.to);
+    }
+    // Fan-in > 1 demands an explicit join. Checked BEFORE the cycle walk so
+    // the more actionable error wins on a graph that has both problems.
+    for (const node of nodes) {
+        const up = parents.get(node.id) ?? [];
+        if (up.length > 1 && node.join === undefined) {
+            throw new Error(`graph: node '${node.id}' has ${up.length} parents (${up.join(', ')}) but no join — ` +
+                'a silent merge is a wrong merge. Give the node a join(upstream) that returns its input; ' +
+                'upstream is keyed by parent node id.');
+        }
+    }
+    // Kahn: repeatedly take every node whose parents have all been placed.
+    const remainingParents = new Map();
+    for (const node of nodes)
+        remainingParents.set(node.id, (parents.get(node.id) ?? []).length);
+    const levels = [];
+    let frontier = nodes.filter((n) => remainingParents.get(n.id) === 0);
+    let placed = 0;
+    while (frontier.length > 0) {
+        levels.push(frontier);
+        placed += frontier.length;
+        const next = [];
+        for (const node of frontier) {
+            for (const childId of children.get(node.id) ?? []) {
+                const left = (remainingParents.get(childId) ?? 0) - 1;
+                remainingParents.set(childId, left);
+                if (left === 0) {
+                    const child = byId.get(childId);
+                    if (child !== undefined)
+                        next.push(child);
+                }
+            }
+        }
+        // Restore declaration order — `next` is built in parent-visit order.
+        frontier = nodes.filter((n) => next.includes(n));
+    }
+    if (placed < nodes.length) {
+        const stuck = new Set(nodes.filter((n) => (remainingParents.get(n.id) ?? 0) > 0).map((n) => n.id));
+        throw new Error(`graph: cycle detected — edge '${findBackEdge(stuck, edges)}' closes a loop. A graph must be acyclic.`);
+    }
+    return levels;
+}
+exports.levelize = levelize;
+/**
+ * Name ONE edge that closes a cycle, so the error can point at something
+ * the author can delete. Depth-first over the nodes Kahn could not place;
+ * the first edge back onto the current stack is the one reported.
+ */
+function findBackEdge(stuck, edges) {
+    const out = new Map();
+    for (const edge of edges) {
+        if (stuck.has(edge.from) && stuck.has(edge.to)) {
+            const list = out.get(edge.from) ?? [];
+            list.push(edge.to);
+            out.set(edge.from, list);
+        }
+    }
+    const onStack = new Set();
+    const done = new Set();
+    let found;
+    const walk = (id) => {
+        if (found !== undefined)
+            return;
+        onStack.add(id);
+        for (const next of out.get(id) ?? []) {
+            if (found !== undefined)
+                return;
+            if (onStack.has(next)) {
+                found = `${id}' -> '${next}`;
+                return;
+            }
+            if (!done.has(next))
+                walk(next);
+        }
+        onStack.delete(id);
+        done.add(id);
+    };
+    for (const id of stuck) {
+        if (!done.has(id))
+            walk(id);
+        if (found !== undefined)
+            break;
+    }
+    // Every unplaced node is on a cycle, so a back edge always exists; the
+    // fallback keeps the error useful rather than throwing inside a thrower.
+    return found ?? [...stuck].join("' -> '");
+}
+/**
+ * Hand a producer's value to a consumer as its input args.
+ *
+ * `string` → `{ message }` (the house convention every LLM runner here
+ * speaks, identical to `workflow()`'s hand-off rule). Plain object →
+ * itself. Anything else is a broken hand-off and says so, naming both
+ * ends — the alternative is an empty input inside the consumer with
+ * nothing pointing back here.
+ */
+function toNodeArgs(value, nodeId, source) {
+    if (typeof value === 'string')
+        return { message: value };
+    if (typeof value === 'object' && value !== null && !Array.isArray(value)) {
+        return { ...value };
+    }
+    const got = value === null ? 'null' : Array.isArray(value) ? 'an array' : typeof value;
+    throw new Error(`graph: ${source} handed node '${nodeId}' ${got}, but a node needs an object ` +
+        '(or a string, which arrives as { message }). Make each node return its output.');
+}
+// ─── The composition ─────────────────────────────────────────────────
+/**
+ * A fixed DAG of runners. Build one with {@link graph}.
+ */
+class Graph extends RunnerBase_js_1.RunnerBase {
+    name;
+    id;
+    nodes;
+    levels;
+    parentsOf;
+    opts;
+    currentRunContext = {
+        runStartMs: 0,
+        runId: 'pending',
+        compositionPath: [],
+    };
+    /**
+     * Per-node first-error records for the current run. footprintjs's
+     * `SubflowExecutor` swallows a subflow error into the parent's debug
+     * bag and skips the `outputMapper`, so the message never reaches parent
+     * scope on its own. An internal recorder captures it here; the level
+     * join reads it to name what actually went wrong. Mirrors Parallel's
+     * `branchErrors`, epoch-guarded for the same reason.
+     */
+    nodeErrors = new Map();
+    /** Monotonic run token — see Parallel's `runEpoch`. */
+    runEpoch = 0;
+    constructor(opts) {
+        super();
+        this.opts = opts;
+        this.name = opts.name ?? 'Graph';
+        this.id = opts.id ?? 'graph';
+        this.nodes = opts.nodes;
+        // Levelization VALIDATES — a broken graph throws here, at construction.
+        this.levels = levelize(opts.nodes, opts.edges);
+        const parents = new Map();
+        for (const node of opts.nodes)
+            parents.set(node.id, []);
+        for (const edge of opts.edges)
+            parents.get(edge.to)?.push(edge.from);
+        this.parentsOf = parents;
+        // Eager chart construction — see `RunnerBase.initChart` JSDoc.
+        this.initChart(() => this.buildChart());
+    }
+    /** How the graph was levelized — level 0 first. Stable post-construction. */
+    getLevels() {
+        return this.levels.map((level) => level.map((n) => n.id));
+    }
+    async run(input, options) {
+        const executor = this.createExecutor();
+        this.lastExecutor = executor;
+        let result;
+        try {
+            result = await executor.run({ input: { ...input }, ...(options ?? {}) });
+        }
+        catch (err) {
+            this.rethrowWithNodeAttribution(err);
+        }
+        return this.finalizeResult(executor, result);
+    }
+    async resume(checkpoint, input, options) {
+        this.emitPauseResume(checkpoint, input);
+        const executor = this.createExecutor();
+        this.lastExecutor = executor;
+        let result;
+        try {
+            result = await executor.resume(checkpoint, input, options);
+        }
+        catch (err) {
+            this.rethrowWithNodeAttribution(err);
+        }
+        return this.finalizeResult(executor, result);
+    }
+    /**
+     * Give a RAW rejection the same node-naming shape the level join
+     * produces.
+     *
+     * A node in a SEQUENTIAL (single-node) level rejects the run with its
+     * own error — the level join never runs, so nothing has attributed it to
+     * a node yet. The error recorder did see it, so correlate (by identity
+     * first, then bare message) and rename. Anything that does not correlate
+     * — including the join's own already-attributed error — is rethrown
+     * untouched.
+     */
+    rethrowWithNodeAttribution(err) {
+        const message = err instanceof Error ? err.message : String(err);
+        for (const [nodeId, record] of this.nodeErrors) {
+            if (record.raw === err || record.message === message) {
+                throw new Error(nodeFailureMessage(this.id, nodeId, record.message), { cause: err });
+            }
+        }
+        throw err;
+    }
+    createExecutor() {
+        this.currentRunContext = {
+            runStartMs: Date.now(),
+            runId: (0, RunnerBase_js_1.makeRunId)(),
+            compositionPath: [`Graph:${this.id}`],
+        };
+        this.runEpoch += 1;
+        this.nodeErrors.clear();
+        const executor = new footprintjs_1.FlowChartExecutor(this.getSpec());
+        const dispatcher = this.getDispatcher();
+        const getRunCtx = () => this.currentRunContext;
+        executor.attachCombinedRecorder(new ContextRecorder_js_1.ContextRecorder({ dispatcher, getRunContext: getRunCtx }));
+        executor.attachCombinedRecorder((0, StreamRecorder_js_1.streamRecorder)({ dispatcher, getRunContext: getRunCtx }));
+        executor.attachCombinedRecorder((0, AgentRecorder_js_1.agentRecorder)({ dispatcher, getRunContext: getRunCtx }));
+        executor.attachCombinedRecorder((0, CompositionRecorder_js_1.compositionRecorder)({ dispatcher, getRunContext: getRunCtx }));
+        executor.attachCombinedRecorder(this.makeNodeErrorRecorder(this.runEpoch));
+        for (const r of this.attachedRecorders)
+            executor.attachCombinedRecorder(r);
+        return executor;
+    }
+    /**
+     * Capture the first error per node. The node id is the first segment of
+     * the engine-prefixed `stageId` (`orders/call-llm` → node `orders`) —
+     * the same correlation Parallel uses, and the only one that survives a
+     * node mounting subflows of its own.
+     */
+    makeNodeErrorRecorder(epoch) {
+        const nodeIds = new Set(this.nodes.map((n) => n.id));
+        return {
+            id: 'graph-node-errors',
+            onError: (event) => {
+                if (epoch !== this.runEpoch)
+                    return; // straggler from a dead run
+                if (!(0, footprintjs_1.isFlowEvent)(event))
+                    return;
+                const stageId = event.traversalContext?.stageId ?? '';
+                const slash = stageId.indexOf('/');
+                const nodeId = slash >= 0 ? stageId.slice(0, slash) : undefined;
+                if (nodeId === undefined || !nodeIds.has(nodeId))
+                    return;
+                if (this.nodeErrors.has(nodeId))
+                    return;
+                const structured = event.structuredError;
+                const message = structured?.message ??
+                    (event.message.startsWith('Error: ')
+                        ? event.message.slice('Error: '.length)
+                        : event.message);
+                this.nodeErrors.set(nodeId, { message, raw: structured?.raw });
+            },
+        };
+    }
+    finalizeResult(executor, result) {
+        const paused = this.detectPause(executor, result);
+        if (paused)
+            return paused;
+        if (result instanceof Error)
+            throw result;
+        return (result ?? {});
+    }
+    buildChart() {
+        const compositionId = this.id;
+        const compositionName = this.name;
+        const nodeCount = this.nodes.length;
+        const levels = this.levels;
+        const nodeErrors = this.nodeErrors;
+        const seed = (scope) => {
+            // The graph's own input is what every ROOT node receives.
+            scope.graphInput = scope.$getArgs();
+            scope.results = {};
+            (0, typedEmit_js_1.typedEmit)(scope, 'agentfootprint.composition.enter', {
+                kind: 'Sequence',
+                id: compositionId,
+                name: compositionName,
+                childCount: nodeCount,
+            });
+        };
+        // Root description prefix `Sequence:` is the taxonomy marker every
+        // consumer (Lens, FlowchartRecorder.mapTopologyToSteps) already reads.
+        let builder = (0, footprintjs_1.flowChart)('Seed', seed, 'seed', {
+            ...(this.opts.structureRecorders !== undefined && {
+                structureRecorders: [...this.opts.structureRecorders],
+            }),
+            description: `Sequence: ${nodeCount}-node DAG in ${levels.length} level(s)`,
+        });
+        levels.forEach((level, levelIndex) => {
+            // A level with SEVERAL nodes is mounted on the SAME builder cursor —
+            // stacked `addSubFlowChart` calls produce a fork node, which
+            // footprintjs's ChildrenExecutor runs concurrently. That is the whole
+            // reason to levelize.
+            //
+            // A level with ONE node is mounted SEQUENTIALLY instead
+            // (`addSubFlowChartNext`). There is nothing to run it alongside, and
+            // the sequential mount is strictly better across a pause: resuming
+            // into a fork child completes THAT child and stops, whereas a
+            // sequential mount resumes and carries on through the rest of the
+            // graph. Verified against footprintjs; see the class JSDoc's
+            // "Honest limits".
+            const concurrent = level.length > 1;
+            for (const node of level) {
+                const mount = concurrent
+                    ? builder.addSubFlowChart.bind(builder)
+                    : builder.addSubFlowChartNext.bind(builder);
+                builder = mount(node.id, node.runner.getSpec(), node.name ?? node.id, {
+                    // A THROW from an inputMapper (a broken hand-off, or a join that
+                    // rejects what it got) is caught by footprintjs's SubflowExecutor
+                    // and turned into a plain "this subflow did not run" — the reason
+                    // never reaches parent scope. Record it first, so the level join
+                    // can name what actually happened instead of 'unknown error'.
+                    inputMapper: (parent) => {
+                        try {
+                            return this.inputForNode(node, parent);
+                        }
+                        catch (err) {
+                            if (!nodeErrors.has(node.id)) {
+                                nodeErrors.set(node.id, {
+                                    message: err instanceof Error ? err.message : String(err),
+                                    raw: err,
+                                });
+                            }
+                            throw err;
+                        }
+                    },
+                    // Untouched: whatever the node's chart returned is what its
+                    // children (and the caller) receive. No string coercion — this
+                    // is exactly what Sequence and Parallel cannot do.
+                    outputMapper: (sfOutput) => ({ results: { [node.id]: sfOutput } }),
+                });
+            }
+            // The join stage does two jobs: it ADVANCES the builder cursor (so
+            // the next level forks from here instead of joining this level's
+            // fork), and it turns a failed node's ABSENCE into a loud error.
+            builder = builder.addFunction(`Level ${levelIndex} join`, (scope) => {
+                // Read through `$getValue`, never `scope.results`: values merged
+                // into parent state by a subflow outputMapper are present in
+                // shared state but do NOT enumerate through TypedScope's nested
+                // property proxy. Verified against footprintjs — the property
+                // read returns `{}` while `$getValue` returns the real record.
+                const results = scope.$getValue('results') ?? {};
+                const missing = level.map((n) => n.id).filter((id) => !(id in results));
+                if (missing.length > 0) {
+                    (0, typedEmit_js_1.typedEmit)(scope, 'agentfootprint.composition.exit', {
+                        kind: 'Sequence',
+                        id: compositionId,
+                        name: compositionName,
+                        status: 'err',
+                        durationMs: Date.now() - this.currentRunContext.runStartMs,
+                    });
+                    const reasonFor = (id) => nodeErrors.get(id)?.message ?? 'unknown error';
+                    const firstMissing = missing[0] ?? '';
+                    if (missing.length === 1) {
+                        throw new Error(nodeFailureMessage(compositionId, firstMissing, reasonFor(firstMissing)));
+                    }
+                    const details = missing.map((id) => `  ${id}: ${reasonFor(id)}`).join('\n');
+                    throw new Error(`graph '${compositionId}': ${missing.length} nodes failed in level ${levelIndex}:\n${details}`);
+                }
+                return undefined;
+            }, `level-${levelIndex}-join`, `Graph level ${levelIndex} join`);
+        });
+        builder = builder.addFunction('Finalize', (scope) => {
+            (0, typedEmit_js_1.typedEmit)(scope, 'agentfootprint.composition.exit', {
+                kind: 'Sequence',
+                id: compositionId,
+                name: compositionName,
+                status: 'ok',
+                durationMs: Date.now() - this.currentRunContext.runStartMs,
+            });
+            // `$getValue` for the same reason as the level join.
+            return scope.$getValue('results') ?? {};
+        }, 'finalize', 'Graph finalize');
+        return builder.build();
+    }
+    /**
+     * What one node receives. Roots get the graph's own input; a single
+     * parent is passed through; 2+ parents go through the node's `join`
+     * (which the build already guaranteed exists).
+     *
+     * `parent` here is the RAW parent state the engine hands an
+     * `inputMapper` — not a TypedScope — so structured upstream values read
+     * back intact.
+     */
+    inputForNode(node, parent) {
+        const results = parent.results ?? {};
+        const upstreamIds = this.parentsOf.get(node.id) ?? [];
+        if (upstreamIds.length === 0) {
+            return { ...(parent.graphInput ?? {}) };
+        }
+        if (node.join !== undefined) {
+            const upstream = {};
+            for (const id of upstreamIds)
+                upstream[id] = results[id];
+            return toNodeArgs(node.join(upstream), node.id, `join of node '${node.id}'`);
+        }
+        const only = upstreamIds[0] ?? '';
+        return toNodeArgs(results[only], node.id, `node '${only}'`);
+    }
+}
+exports.Graph = Graph;
+// ─── The factory ─────────────────────────────────────────────────────
+/**
+ * Build a fixed DAG of runners. Independent nodes run concurrently; the
+ * result is every node's output, keyed by node id.
+ *
+ * The shape is checked at BUILD time — a cycle, an edge pointing at an
+ * unknown node, a duplicate id, or a 2+-parent node with no `join` throws
+ * here, naming the offender, rather than misbehaving mid-run.
+ *
+ * @example  a fan-out with a merge
+ * ```ts
+ * const pipeline = graph({
+ *   nodes: [
+ *     { id: 'plan', runner: planner },
+ *     { id: 'search', runner: searcher },
+ *     { id: 'recall', runner: memory },
+ *     { id: 'answer', runner: writer, join: (u) => ({ ...u }) },
+ *   ],
+ *   edges: [
+ *     { from: 'plan', to: 'search' },
+ *     { from: 'plan', to: 'recall' },
+ *     { from: 'search', to: 'answer' },
+ *     { from: 'recall', to: 'answer' },
+ *   ],
+ * });
+ *
+ * const out = await pipeline.run({ message: 'what changed last week?' });
+ * console.log(out.answer);
+ * ```
+ */
+function graph(opts) {
+    return new Graph(opts);
+}
+exports.graph = graph;
+//# sourceMappingURL=Graph.js.map

package/dist/core-flow/Graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Graph.js","sourceRoot":"","sources":["../../src/core-flow/Graph.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoHG;;;AAEH,6CAUqB;AAIrB,yDAA8D;AAC9D,yEAAmE;AACnE,qFAA+E;AAC/E,6EAAuE;AACvE,2EAAqE;AACrE,iEAA2D;AA4E3D;;;;;;;GAOG;AACH,SAAS,kBAAkB,CAAC,OAAe,EAAE,MAAc,EAAE,MAAc;IACzE,OAAO,UAAU,OAAO,YAAY,MAAM,aAAa,MAAM,EAAE,CAAC;AAClE,CAAC;AAED,wEAAwE;AAExE;;;;;;;;;;GAUG;AACH,SAAgB,QAAQ,CACtB,KAAqC,EACrC,KAA2B;IAE3B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAA+B,CAAC;IACpD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CACb,6BAA6B,IAAI,CAAC,EAAE,2DAA2D,CAChG,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CACb,gBAAgB,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,EAAE,8BAA8B,IAAI,CAAC,IAAI,IAAI,CACrF,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CACb,gBAAgB,IAAI,CAAC,IAAI,SAAS,IAAI,CAAC,EAAE,8BAA8B,IAAI,CAAC,EAAE,IAAI,CACnF,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,wEAAwE;IACxE,oEAAoE;IACpE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACtC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC7C,MAAM,IAAI,KAAK,CACb,gBAAgB,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,MAAM,aAAa,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB;gBACnF,0FAA0F;gBAC1F,sCAAsC,CACzC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAE7F,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,IAAI,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IACrE,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtB,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC;QAC1B,MAAM,IAAI,GAA0B,EAAE,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,KAAK,MAAM,OAAO,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClD,MAAM,IAAI,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACtD,gBAAgB,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBACpC,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;oBACf,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBAChC,IAAI,KAAK,KAAK,SAAS;wBAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;QACD,qEAAqE;QACrE,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,GAAG,CACnB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAC5E,CAAC;QACF,MAAM,IAAI,KAAK,CACb,iCAAiC,YAAY,CAC3C,KAAK,EACL,KAAK,CACN,2CAA2C,CAC7C,CAAC;IACJ,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AA5FD,4BA4FC;AAED;;;;GAIG;AACH,SAAS,YAAY,CAAC,KAA0B,EAAE,KAA2B;IAC3E,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC/C,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,IAAI,KAAyB,CAAC;IAE9B,MAAM,IAAI,GAAG,CAAC,EAAU,EAAQ,EAAE;QAChC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO;QAChC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACrC,IAAI,KAAK,KAAK,SAAS;gBAAE,OAAO;YAChC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtB,KAAK,GAAG,GAAG,EAAE,SAAS,IAAI,EAAE,CAAC;gBAC7B,OAAO;YACT,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACf,CAAC,CAAC;IAEF,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAI,KAAK,KAAK,SAAS;YAAE,MAAM;IACjC,CAAC;IACD,uEAAuE;IACvE,yEAAyE;IACzE,OAAO,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC5C,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,UAAU,CAAC,KAAc,EAAE,MAAc,EAAE,MAAc;IAChE,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACzD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzE,OAAO,EAAE,GAAI,KAAiC,EAAE,CAAC;IACnD,CAAC;IACD,MAAM,GAAG,GAAG,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,KAAK,CAAC;IACvF,MAAM,IAAI,KAAK,CACb,UAAU,MAAM,iBAAiB,MAAM,KAAK,GAAG,+BAA+B;QAC5E,gFAAgF,CACnF,CAAC;AACJ,CAAC;AAED,wEAAwE;AAExE;;GAEG;AACH,MAAa,KAAM,SAAQ,0BAAmC;IACnD,IAAI,CAAS;IACb,EAAE,CAAS;IACH,KAAK,CAAiC;IACtC,MAAM,CAA8C;IACpD,SAAS,CAAyC;IAClD,IAAI,CAAe;IAE5B,iBAAiB,GAAe;QACtC,UAAU,EAAE,CAAC;QACb,KAAK,EAAE,SAAS;QAChB,eAAe,EAAE,EAAE;KACpB,CAAC;IAEF;;;;;;;OAOG;IACc,UAAU,GAAG,IAAI,GAAG,EAA2B,CAAC;IAEjE,uDAAuD;IAC/C,QAAQ,GAAG,CAAC,CAAC;IAErB,YAAY,IAAkB;QAC5B,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC;QACjC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,OAAO,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,wEAAwE;QACxE,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAE/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC;QAEzB,+DAA+D;QAC/D,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,6EAA6E;IAC7E,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,KAAiB,EAAE,OAAoB;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACvC,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;QAC7B,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,QAAQ,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3E,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK,CAAC,MAAM,CACV,UAA+B,EAC/B,KAAe,EACf,OAAoB;QAEpB,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACvC,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;QAC7B,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,QAAQ,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7D,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC/C,CAAC;IAED;;;;;;;;;;OAUG;IACK,0BAA0B,CAAC,GAAY;QAC7C,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjE,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC/C,IAAI,MAAM,CAAC,GAAG,KAAK,GAAG,IAAI,MAAM,CAAC,OAAO,KAAK,OAAO,EAAE,CAAC;gBACrD,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;QACD,MAAM,GAAG,CAAC;IACZ,CAAC;IAEO,cAAc;QACpB,IAAI,CAAC,iBAAiB,GAAG;YACvB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE;YACtB,KAAK,EAAE,IAAA,yBAAS,GAAE;YAClB,eAAe,EAAE,CAAC,SAAS,IAAI,CAAC,EAAE,EAAE,CAAC;SACtC,CAAC;QACF,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAExB,MAAM,QAAQ,GAAG,IAAI,+BAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACvD,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QACxC,MAAM,SAAS,GAAG,GAAe,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC;QAE3D,QAAQ,CAAC,sBAAsB,CAAC,IAAI,oCAAe,CAAC,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;QAC/F,QAAQ,CAAC,sBAAsB,CAAC,IAAA,kCAAc,EAAC,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;QAC1F,QAAQ,CAAC,sBAAsB,CAAC,IAAA,gCAAa,EAAC,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;QACzF,QAAQ,CAAC,sBAAsB,CAAC,IAAA,4CAAmB,EAAC,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;QAC/F,QAAQ,CAAC,sBAAsB,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC3E,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,iBAAiB;YAAE,QAAQ,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAC3E,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACK,qBAAqB,CAAC,KAAa;QACzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,OAAO;YACL,EAAE,EAAE,mBAAmB;YACvB,OAAO,EAAE,CAAC,KAAK,EAAE,EAAE;gBACjB,IAAI,KAAK,KAAK,IAAI,CAAC,QAAQ;oBAAE,OAAO,CAAC,4BAA4B;gBACjE,IAAI,CAAC,IAAA,yBAAW,EAAC,KAAK,CAAC;oBAAE,OAAO;gBAChC,MAAM,OAAO,GAAG,KAAK,CAAC,gBAAgB,EAAE,OAAO,IAAI,EAAE,CAAC;gBACtD,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBACnC,MAAM,MAAM,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBAChE,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,OAAO;gBACzD,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,OAAO;gBACxC,MAAM,UAAU,GAAG,KAAK,CAAC,eAAe,CAAC;gBACzC,MAAM,OAAO,GACX,UAAU,EAAE,OAAO;oBACnB,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,SAAS,CAAC;wBAClC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC;wBACvC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;gBACrB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;YACjE,CAAC;SACF,CAAC;IACJ,CAAC;IAEO,cAAc,CACpB,QAA2B,EAC3B,MAAe;QAEf,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAClD,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,IAAI,MAAM,YAAY,KAAK;YAAE,MAAM,MAAM,CAAC;QAC1C,OAAO,CAAC,MAAM,IAAI,EAAE,CAAgB,CAAC;IACvC,CAAC;IAEO,UAAU;QAChB,MAAM,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAEnC,MAAM,IAAI,GAAG,CAAC,KAA6B,EAAE,EAAE;YAC7C,0DAA0D;YAC1D,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,QAAQ,EAAc,CAAC;YAChD,KAAK,CAAC,OAAO,GAAG,EAAE,CAAC;YACnB,IAAA,wBAAS,EAAC,KAAK,EAAE,kCAAkC,EAAE;gBACnD,IAAI,EAAE,UAAU;gBAChB,EAAE,EAAE,aAAa;gBACjB,IAAI,EAAE,eAAe;gBACrB,UAAU,EAAE,SAAS;aACtB,CAAC,CAAC;QACL,CAAC,CAAC;QAEF,mEAAmE;QACnE,uEAAuE;QACvE,IAAI,OAAO,GAAG,IAAA,uBAAS,EAAa,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE;YACxD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,KAAK,SAAS,IAAI;gBAChD,kBAAkB,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC;aACtD,CAAC;YACF,WAAW,EAAE,aAAa,SAAS,gBAAgB,MAAM,CAAC,MAAM,WAAW;SAC5E,CAAC,CAAC;QAEH,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,UAAU,EAAE,EAAE;YACnC,qEAAqE;YACrE,6DAA6D;YAC7D,sEAAsE;YACtE,sBAAsB;YACtB,EAAE;YACF,wDAAwD;YACxD,qEAAqE;YACrE,mEAAmE;YACnE,8DAA8D;YAC9D,kEAAkE;YAClE,6DAA6D;YAC7D,mBAAmB;YACnB,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;YACpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAG,UAAU;oBACtB,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC;oBACvC,CAAC,CAAC,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC9C,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,EAAE;oBACpE,iEAAiE;oBACjE,kEAAkE;oBAClE,kEAAkE;oBAClE,iEAAiE;oBACjE,8DAA8D;oBAC9D,WAAW,EAAE,CAAC,MAAM,EAAE,EAAE;wBACtB,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,MAAiC,CAAC,CAAC;wBACpE,CAAC;wBAAC,OAAO,GAAG,EAAE,CAAC;4BACb,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gCAC7B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;oCACtB,OAAO,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;oCACzD,GAAG,EAAE,GAAG;iCACT,CAAC,CAAC;4BACL,CAAC;4BACD,MAAM,GAAG,CAAC;wBACZ,CAAC;oBACH,CAAC;oBACD,4DAA4D;oBAC5D,+DAA+D;oBAC/D,mDAAmD;oBACnD,YAAY,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC;iBACnE,CAAC,CAAC;YACL,CAAC;YAED,mEAAmE;YACnE,iEAAiE;YACjE,iEAAiE;YACjE,OAAO,GAAG,OAAO,CAAC,WAAW,CAC3B,SAAS,UAAU,OAAO,EAC1B,CAAC,KAA6B,EAAE,EAAE;gBAChC,iEAAiE;gBACjE,6DAA6D;gBAC7D,gEAAgE;gBAChE,8DAA8D;gBAC9D,+DAA+D;gBAC/D,MAAM,OAAO,GAAI,KAAK,CAAC,SAAS,CAAC,SAAS,CAA6B,IAAI,EAAE,CAAC;gBAC9E,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,OAAO,CAAC,CAAC,CAAC;gBACxE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACvB,IAAA,wBAAS,EAAC,KAAK,EAAE,iCAAiC,EAAE;wBAClD,IAAI,EAAE,UAAU;wBAChB,EAAE,EAAE,aAAa;wBACjB,IAAI,EAAE,eAAe;wBACrB,MAAM,EAAE,KAAK;wBACb,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU;qBAC3D,CAAC,CAAC;oBACH,MAAM,SAAS,GAAG,CAAC,EAAU,EAAU,EAAE,CACvC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,IAAI,eAAe,CAAC;oBACjD,MAAM,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;oBACtC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBACzB,MAAM,IAAI,KAAK,CACb,kBAAkB,CAAC,aAAa,EAAE,YAAY,EAAE,SAAS,CAAC,YAAY,CAAC,CAAC,CACzE,CAAC;oBACJ,CAAC;oBACD,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC5E,MAAM,IAAI,KAAK,CACb,UAAU,aAAa,MAAM,OAAO,CAAC,MAAM,0BAA0B,UAAU,MAAM,OAAO,EAAE,CAC/F,CAAC;gBACJ,CAAC;gBACD,OAAO,SAAS,CAAC;YACnB,CAAC,EACD,SAAS,UAAU,OAAO,EAC1B,eAAe,UAAU,OAAO,CACjC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,OAAO,GAAG,OAAO,CAAC,WAAW,CAC3B,UAAU,EACV,CAAC,KAA6B,EAAE,EAAE;YAChC,IAAA,wBAAS,EAAC,KAAK,EAAE,iCAAiC,EAAE;gBAClD,IAAI,EAAE,UAAU;gBAChB,EAAE,EAAE,aAAa;gBACjB,IAAI,EAAE,eAAe;gBACrB,MAAM,EAAE,IAAI;gBACZ,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU;aAC3D,CAAC,CAAC;YACH,qDAAqD;YACrD,OAAO,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QAC1C,CAAC,EACD,UAAU,EACV,gBAAgB,CACjB,CAAC;QAEF,OAAO,OAAO,CAAC,KAAK,EAAE,CAAC;IACzB,CAAC;IAED;;;;;;;;OAQG;IACK,YAAY,CAClB,IAAyB,EACzB,MAA+B;QAE/B,MAAM,OAAO,GAAI,MAAM,CAAC,OAAmC,IAAI,EAAE,CAAC;QAClE,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAEtD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO,EAAE,GAAG,CAAE,MAAM,CAAC,UAAsC,IAAI,EAAE,CAAC,EAAE,CAAC;QACvE,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAA4B,EAAE,CAAC;YAC7C,KAAK,MAAM,EAAE,IAAI,WAAW;gBAAE,QAAQ,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzD,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,iBAAiB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/E,CAAC;QAED,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAClC,OAAO,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,IAAI,GAAG,CAAC,CAAC;IAC9D,CAAC;CACF;AAnUD,sBAmUC;AAED,wEAAwE;AAExE;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,SAAgB,KAAK,CAAC,IAAkB;IACtC,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC;AACzB,CAAC;AAFD,sBAEC"}