@seanhogg/builderforce-memory 2026.7.14 → 2026.9.28

package/dist/orchestration/patterns.js

@@ -0,0 +1,371 @@
+/**
+ * orchestration/patterns.ts — ReAct, self-reflection, hierarchical delegation.
+ *
+ * These are the three patterns enterprise agent work actually reduces to, and each
+ * is a small graph rather than a bespoke loop, so they compose: a supervisor's
+ * worker can be a ReAct agent, and a ReAct agent's answer can be routed through a
+ * reflection pass. That composability is why they are built on {@link AgentGraph}
+ * instead of as three independent classes.
+ *
+ * The bridge port is plain text in, text out, so tool use is expressed as a strict
+ * textual protocol the model is instructed to follow, and violations are handled
+ * as data (an observation telling the model what it got wrong) rather than as
+ * exceptions. A model that emits a malformed action must be able to recover on the
+ * next turn; throwing would end the run over a formatting slip.
+ */
+import { AgentGraph, appendReducer, sumReducer } from './AgentGraph.js';
+import { END, START } from './types.js';
+/** Renders a transcript for a text-completion bridge. */
+export function renderTranscript(turns) {
+    return turns
+        .map((turn) => {
+        if (turn.role === 'tool')
+            return `Observation (${turn.name ?? 'tool'}): ${turn.content}`;
+        if (turn.role === 'assistant')
+            return turn.content;
+        if (turn.role === 'system')
+            return turn.content;
+        return `Question: ${turn.content}`;
+    })
+        .join('\n');
+}
+export function renderToolCatalog(tools) {
+    return tools
+        .map((tool) => {
+        const params = tool.parameters
+            ? ` Input fields: ${Object.entries(tool.parameters).map(([k, v]) => `${k} (${v})`).join(', ')}.`
+            : '';
+        return `- ${tool.name}: ${tool.description}${params}`;
+    })
+        .join('\n');
+}
+/**
+ * Parses one ReAct turn.
+ *
+ * Tolerant on purpose: models drift on whitespace, casing and code fences far more
+ * often than they drift on intent, and a parser that rejects `**Action:**` burns a
+ * turn for no reason. Genuinely unparseable output returns `malformed` with a
+ * message that is fed back as an observation.
+ */
+export function parseReactTurn(text) {
+    const clean = text.replace(/\*\*/g, '').trim();
+    const finalMatch = /final\s*answer\s*:\s*([\s\S]*)$/i.exec(clean);
+    const actionMatch = /action\s*:\s*([^\n]+)/i.exec(clean);
+    const thoughtMatch = /thought\s*:\s*([^\n]+)/i.exec(clean);
+    const thought = thoughtMatch?.[1]?.trim();
+    // A turn containing both is a model hedging; the final answer wins only when it
+    // appears AFTER the action, matching the order the protocol asks for.
+    if (finalMatch && (!actionMatch || (finalMatch.index > actionMatch.index))) {
+        return {
+            kind: 'final',
+            ...(thought ? { thought } : {}),
+            answer: (finalMatch[1] ?? '').trim(),
+        };
+    }
+    if (!actionMatch) {
+        return {
+            kind: 'malformed',
+            ...(thought ? { thought } : {}),
+            problem: 'No "Action:" or "Final Answer:" line was present.',
+        };
+    }
+    const tool = actionMatch[1].trim().replace(/[.`]+$/, '');
+    const inputMatch = /action\s*input\s*:\s*([\s\S]*?)(?:\n\s*(?:thought|action|observation|final answer)\s*:|$)/i
+        .exec(clean);
+    const rawInput = (inputMatch?.[1] ?? '').trim().replace(/^```(?:json)?/i, '').replace(/```$/, '').trim();
+    let input = {};
+    if (rawInput) {
+        try {
+            const parsed = JSON.parse(rawInput);
+            input = parsed && typeof parsed === 'object' && !Array.isArray(parsed)
+                ? parsed
+                // A bare scalar is a common and reasonable shape for single-argument
+                // tools; wrapping it beats rejecting the turn.
+                : { input: parsed };
+        }
+        catch {
+            input = { input: rawInput };
+        }
+    }
+    return { kind: 'action', ...(thought ? { thought } : {}), tool, input };
+}
+export const REACT_PROTOCOL = 'Work in cycles. Each reply must be EITHER:\n' +
+    'Thought: <your reasoning>\nAction: <tool name>\nAction Input: <JSON object>\n' +
+    'OR, when you can answer:\nThought: <your reasoning>\nFinal Answer: <the answer>\n' +
+    'Use one action per reply and wait for the Observation before continuing.';
+/**
+ * ReAct: interleaved reasoning and tool use.
+ *
+ * Two nodes and a conditional edge — `reason` produces a thought plus either an
+ * action or a final answer; `act` executes the tool and appends an observation;
+ * the edge routes back to `reason` or to END. The iteration cap is enforced in the
+ * routing rather than trusted to the model, because "decide when to stop" is the
+ * one judgement an unconverged agent is worst at.
+ */
+export function createReactAgent(opts) {
+    const maxIterations = Math.max(1, opts.maxIterations ?? 6);
+    const toolsByName = new Map(opts.tools.map((t) => [t.name, t]));
+    const catalog = renderToolCatalog(opts.tools);
+    const systemPrompt = [
+        opts.systemPrompt ?? 'You are a careful analyst that uses tools to gather evidence before answering.',
+        `Available tools:\n${catalog}`,
+        REACT_PROTOCOL,
+    ].join('\n\n');
+    const graph = new AgentGraph({
+        name: 'react-agent',
+        channels: {
+            turns: { reducer: appendReducer, default: () => [] },
+            toolCalls: { reducer: sumReducer, default: () => 0 },
+            done: { default: () => false },
+            answer: { default: () => '' },
+            task: { default: () => '' },
+        },
+        recursionLimit: maxIterations * 2 + 2,
+        ...(opts.tracer ? { tracer: opts.tracer } : {}),
+        ...(opts.checkpointer ? { checkpointer: opts.checkpointer } : {}),
+    });
+    graph.addNode('reason', async (state, ctx) => {
+        const transcript = renderTranscript([
+            { role: 'user', content: state.task },
+            ...state.turns,
+        ]);
+        const remaining = maxIterations - state.toolCalls;
+        const pressure = remaining <= 1
+            ? '\n\nYou have no tool calls left. Reply with a Final Answer using what you already know.'
+            : '';
+        const reply = await opts.bridge.generate(`${transcript}${pressure}`, {
+            systemPrompt,
+            ...(opts.maxTokens !== undefined ? { maxTokens: opts.maxTokens } : {}),
+            ...(opts.model !== undefined ? { model: opts.model } : {}),
+        });
+        const parsed = parseReactTurn(reply);
+        ctx.span?.setAttributes({ 'react.turn_kind': parsed.kind, 'react.tool': parsed.tool ?? '' });
+        if (parsed.kind === 'final') {
+            return {
+                turns: [{ role: 'assistant', content: reply }],
+                answer: parsed.answer ?? '',
+                done: true,
+            };
+        }
+        return { turns: [{ role: 'assistant', content: reply }], done: false };
+    });
+    graph.addNode('act', async (state, ctx) => {
+        const lastAssistant = [...state.turns].reverse().find((t) => t.role === 'assistant');
+        const parsed = parseReactTurn(lastAssistant?.content ?? '');
+        if (parsed.kind === 'malformed') {
+            // Fed back as an observation, not thrown: the model gets one clear
+            // chance to correct its formatting rather than killing the run.
+            return {
+                turns: [{
+                        role: 'tool',
+                        name: 'protocol',
+                        content: `Your reply could not be parsed (${parsed.problem}). Reply using the exact format.`,
+                    }],
+                toolCalls: 1,
+            };
+        }
+        const tool = toolsByName.get(parsed.tool);
+        if (!tool) {
+            return {
+                turns: [{
+                        role: 'tool',
+                        name: 'protocol',
+                        content: `Unknown tool "${parsed.tool}". Choose one of: ${[...toolsByName.keys()].join(', ')}.`,
+                    }],
+                toolCalls: 1,
+            };
+        }
+        const span = ctx.span?.child(`tool.${tool.name}`, { kind: 'tool' });
+        try {
+            const observation = await tool.run(parsed.input ?? {});
+            span?.setAttribute('tool.result_chars', observation.length);
+            span?.end('ok');
+            return {
+                turns: [{ role: 'tool', name: tool.name, content: observation }],
+                toolCalls: 1,
+            };
+        }
+        catch (err) {
+            // A failing tool is an observation too. An agent that can read "the API
+            // returned 503" can retry or route around it; one that crashes cannot.
+            span?.fail(err);
+            const message = err instanceof Error ? err.message : String(err);
+            return {
+                turns: [{ role: 'tool', name: tool.name, content: `Tool failed: ${message}` }],
+                toolCalls: 1,
+            };
+        }
+    });
+    graph.addEdge(START, 'reason');
+    graph.addConditionalEdges('reason', (state) => {
+        if (state.done)
+            return END;
+        return state.toolCalls >= maxIterations ? END : 'act';
+    });
+    graph.addEdge('act', 'reason');
+    return graph.compile();
+}
+export const DEFAULT_CRITIC_PROMPT = 'You are a demanding reviewer. Judge the draft against the task on correctness, ' +
+    'completeness and evidence. List concrete, actionable defects. ' +
+    'End your reply with exactly one verdict line: "VERDICT: APPROVED" or "VERDICT: REVISE".';
+/**
+ * Generate → critique → revise, bounded.
+ *
+ * Reflection earns its cost only when the critic is allowed to be harsh and the
+ * loop is allowed to stop: an unbounded critic converges on nitpicking, and a
+ * critic that cannot say APPROVED doubles spend for no quality gain. Both limits
+ * are enforced here rather than requested in the prompt.
+ */
+export function createReflectionAgent(opts) {
+    const maxRevisions = Math.max(0, opts.maxRevisions ?? 2);
+    const isAcceptable = opts.isAcceptable ?? ((critique) => /verdict\s*:\s*approved/i.test(critique));
+    const graph = new AgentGraph({
+        name: 'reflection-agent',
+        channels: {
+            history: { reducer: appendReducer, default: () => [] },
+            revisions: { default: () => 0 },
+            accepted: { default: () => false },
+            draft: { default: () => '' },
+            critique: { default: () => '' },
+            task: { default: () => '' },
+        },
+        recursionLimit: (maxRevisions + 1) * 2 + 2,
+        ...(opts.tracer ? { tracer: opts.tracer } : {}),
+        ...(opts.checkpointer ? { checkpointer: opts.checkpointer } : {}),
+    });
+    const generate = async (state) => {
+        const prompt = state.draft
+            ? `Task: ${state.task}\n\nPrevious draft:\n${state.draft}\n\nReviewer feedback:\n${state.critique}\n\nProduce an improved draft that resolves every point.`
+            : `Task: ${state.task}\n\nProduce your best draft.`;
+        const draft = await opts.bridge.generate(prompt, {
+            systemPrompt: opts.generatorPrompt ?? 'You produce precise, well-evidenced work.',
+            ...(opts.maxTokens !== undefined ? { maxTokens: opts.maxTokens } : {}),
+            ...(opts.model !== undefined ? { model: opts.model } : {}),
+        });
+        return {
+            draft,
+            history: [draft],
+            ...(state.draft ? { revisions: state.revisions + 1 } : {}),
+        };
+    };
+    graph.addNode('generate', generate);
+    graph.addNode('critique', async (state, ctx) => {
+        const critique = await opts.bridge.generate(`Task: ${state.task}\n\nDraft:\n${state.draft}\n\nReview it.`, {
+            systemPrompt: opts.criticPrompt ?? DEFAULT_CRITIC_PROMPT,
+            ...(opts.maxTokens !== undefined ? { maxTokens: opts.maxTokens } : {}),
+            ...(opts.model !== undefined ? { model: opts.model } : {}),
+        });
+        const accepted = isAcceptable(critique);
+        ctx.span?.setAttribute('reflection.accepted', accepted);
+        return { critique, accepted };
+    });
+    graph.addEdge(START, 'generate');
+    graph.addEdge('generate', 'critique');
+    graph.addConditionalEdges('critique', (state) => {
+        if (state.accepted)
+            return END;
+        return state.revisions >= maxRevisions ? END : 'generate';
+    });
+    return graph.compile();
+}
+export const FINISH = 'FINISH';
+/**
+ * A supervisor that delegates to named workers and then composes the answer.
+ *
+ * Hierarchical delegation is worth its coordination overhead exactly when workers
+ * hold context the supervisor should not — a different tool set, a different
+ * corpus, a different tenant's data. Each worker returns a RESULT rather than its
+ * transcript, which is what keeps the supervisor's context from growing into the
+ * sum of everything its workers read.
+ */
+export function createSupervisor(opts) {
+    const maxHandoffs = Math.max(1, opts.maxHandoffs ?? 5);
+    const workersByName = new Map(opts.workers.map((w) => [w.name, w]));
+    const roster = opts.workers.map((w) => `- ${w.name}: ${w.description}`).join('\n');
+    const systemPrompt = [
+        opts.systemPrompt ?? 'You are a supervisor coordinating specialist workers.',
+        `Workers:\n${roster}`,
+        `Reply with exactly one line: "NEXT: <worker name>" to delegate, or "NEXT: ${FINISH}" ` +
+            'followed by a line "ANSWER: <the final answer>" when you have enough to answer.',
+    ].join('\n\n');
+    const graph = new AgentGraph({
+        name: 'supervisor',
+        channels: {
+            turns: { reducer: appendReducer, default: () => [] },
+            handoffs: { reducer: sumReducer, default: () => 0 },
+            next: { default: () => '' },
+            answer: { default: () => '' },
+            task: { default: () => '' },
+        },
+        recursionLimit: maxHandoffs * 2 + 2,
+        ...(opts.tracer ? { tracer: opts.tracer } : {}),
+        ...(opts.checkpointer ? { checkpointer: opts.checkpointer } : {}),
+    });
+    graph.addNode('supervisor', async (state, ctx) => {
+        const transcript = renderTranscript([{ role: 'user', content: state.task }, ...state.turns]);
+        const pressure = state.handoffs >= maxHandoffs
+            ? `\n\nYou have used all delegations. Reply with "NEXT: ${FINISH}" and your ANSWER.`
+            : '';
+        const reply = await opts.bridge.generate(`${transcript}${pressure}`, {
+            systemPrompt,
+            ...(opts.maxTokens !== undefined ? { maxTokens: opts.maxTokens } : {}),
+            ...(opts.model !== undefined ? { model: opts.model } : {}),
+        });
+        const nextMatch = /next\s*:\s*([^\n]+)/i.exec(reply.replace(/\*\*/g, ''));
+        const answerMatch = /answer\s*:\s*([\s\S]*)$/i.exec(reply.replace(/\*\*/g, ''));
+        const requested = nextMatch?.[1]?.trim().replace(/[.`]+$/, '') ?? FINISH;
+        // An unknown worker name resolves to FINISH rather than throwing: a
+        // supervisor that hallucinates a worker should degrade to answering, not
+        // crash a run that may already have useful worker results in state.
+        const next = workersByName.has(requested) ? requested : FINISH;
+        ctx.span?.setAttributes({ 'supervisor.requested': requested, 'supervisor.next': next });
+        return {
+            turns: [{ role: 'assistant', content: reply }],
+            next,
+            ...(next === FINISH ? { answer: (answerMatch?.[1] ?? reply).trim() } : {}),
+        };
+    });
+    graph.addNode('delegate', async (state, ctx) => {
+        const worker = workersByName.get(state.next);
+        if (!worker)
+            return { next: FINISH };
+        const span = ctx.span?.child(`worker.${worker.name}`, { kind: 'agent' });
+        try {
+            const result = await worker.run(state.task, { transcript: state.turns });
+            span?.setAttribute('worker.result_chars', result.length);
+            span?.end('ok');
+            return {
+                turns: [{ role: 'tool', name: worker.name, content: result }],
+                handoffs: 1,
+            };
+        }
+        catch (err) {
+            span?.fail(err);
+            const message = err instanceof Error ? err.message : String(err);
+            return {
+                turns: [{ role: 'tool', name: worker.name, content: `Worker failed: ${message}` }],
+                handoffs: 1,
+            };
+        }
+    });
+    graph.addEdge(START, 'supervisor');
+    graph.addConditionalEdges('supervisor', (state) => {
+        if (state.next === FINISH)
+            return END;
+        return state.handoffs >= maxHandoffs ? END : 'delegate';
+    });
+    graph.addEdge('delegate', 'supervisor');
+    return graph.compile();
+}
+/** Adapts a ReAct agent into a {@link Worker}, so hierarchies nest. */
+export function asWorker(name, description, graph) {
+    return {
+        name,
+        description,
+        run: async (task) => {
+            const result = await graph.invoke({ task });
+            return result.state.answer || 'The worker produced no answer.';
+        },
+    };
+}
+//# sourceMappingURL=patterns.js.map

package/dist/orchestration/patterns.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"patterns.js","sourceRoot":"","sources":["../../src/orchestration/patterns.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAExE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAaxC,yDAAyD;AACzD,MAAM,UAAU,gBAAgB,CAAC,KAA2B;IACxD,OAAO,KAAK;SACP,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACV,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,gBAAgB,IAAI,CAAC,IAAI,IAAI,MAAM,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACzF,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC;QACnD,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC;QAChD,OAAO,aAAa,IAAI,CAAC,OAAO,EAAE,CAAC;IACvC,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAC;AACpB,CAAC;AAYD,MAAM,UAAU,iBAAiB,CAAC,KAA2B;IACzD,OAAO,KAAK;SACP,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACV,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU;YAC1B,CAAC,CAAC,kBAAkB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;YAChG,CAAC,CAAC,EAAE,CAAC;QACT,OAAO,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,WAAW,GAAG,MAAM,EAAE,CAAC;IAC1D,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAC;AACpB,CAAC;AAWD;;;;;;;GAOG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAE/C,MAAM,UAAU,GAAG,kCAAkC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClE,MAAM,WAAW,GAAG,wBAAwB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzD,MAAM,YAAY,GAAG,yBAAyB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3D,MAAM,OAAO,GAAG,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC;IAE1C,gFAAgF;IAChF,sEAAsE;IACtE,IAAI,UAAU,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,UAAU,CAAC,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QACzE,OAAO;YACH,IAAI,EAAE,OAAO;YACb,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/B,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE;SACvC,CAAC;IACN,CAAC;IAED,IAAI,CAAC,WAAW,EAAE,CAAC;QACf,OAAO;YACH,IAAI,EAAE,WAAW;YACjB,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/B,OAAO,EAAE,mDAAmD;SAC/D,CAAC;IACN,CAAC;IAED,MAAM,IAAI,GAAI,WAAW,CAAC,CAAC,CAAY,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IACrE,MAAM,UAAU,GAAG,4FAA4F;SAC1G,IAAI,CAAC,KAAK,CAAC,CAAC;IAEjB,MAAM,QAAQ,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACzG,IAAI,KAAK,GAA4B,EAAE,CAAC;IACxC,IAAI,QAAQ,EAAE,CAAC;QACX,IAAI,CAAC;YACD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAY,CAAC;YAC/C,KAAK,GAAG,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;gBAClE,CAAC,CAAC,MAAiC;gBACnC,qEAAqE;gBACrE,+CAA+C;gBAC/C,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QAC5B,CAAC;QAAC,MAAM,CAAC;YACL,KAAK,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;QAChC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAC5E,CAAC;AA0BD,MAAM,CAAC,MAAM,cAAc,GACvB,8CAA8C;IAC9C,+EAA+E;IAC/E,mFAAmF;IACnF,0EAA0E,CAAC;AAE/E;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAuB;IACpD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC;IAC3D,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,MAAM,OAAO,GAAG,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAE9C,MAAM,YAAY,GAAG;QACjB,IAAI,CAAC,YAAY,IAAI,gFAAgF;QACrG,qBAAqB,OAAO,EAAE;QAC9B,cAAc;KACjB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEf,MAAM,KAAK,GAAG,IAAI,UAAU,CAAa;QACrC,IAAI,EAAE,aAAa;QACnB,QAAQ,EAAE;YACN,KAAK,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;YACpD,SAAS,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE;YACpD,IAAI,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE;YAC9B,MAAM,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;YAC7B,IAAI,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;SAC9B;QACD,cAAc,EAAE,aAAa,GAAG,CAAC,GAAG,CAAC;QACrC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/C,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpE,CAAC,CAAC;IAEH,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,GAA4B,EAAE,EAAE;QAClE,MAAM,UAAU,GAAG,gBAAgB,CAAC;YAChC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,IAAI,EAAE;YACrC,GAAG,KAAK,CAAC,KAAK;SACjB,CAAC,CAAC;QACH,MAAM,SAAS,GAAG,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC;QAClD,MAAM,QAAQ,GAAG,SAAS,IAAI,CAAC;YAC3B,CAAC,CAAC,yFAAyF;YAC3F,CAAC,CAAC,EAAE,CAAC;QAET,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,UAAU,GAAG,QAAQ,EAAE,EAAE;YACjE,YAAY;YACZ,GAAG,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACtE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC7D,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QACrC,GAAG,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,iBAAiB,EAAE,MAAM,CAAC,IAAI,EAAE,YAAY,EAAE,MAAM,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC;QAE7F,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC1B,OAAO;gBACH,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,CAAgB;gBAC7D,MAAM,EAAE,MAAM,CAAC,MAAM,IAAI,EAAE;gBAC3B,IAAI,EAAE,IAAI;aACb,CAAC;QACN,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,CAAgB,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IAC1F,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,GAA4B,EAAE,EAAE;QAC/D,MAAM,aAAa,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;QACrF,MAAM,MAAM,GAAG,cAAc,CAAC,aAAa,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC;QAE5D,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC9B,mEAAmE;YACnE,gEAAgE;YAChE,OAAO;gBACH,KAAK,EAAE,CAAC;wBACJ,IAAI,EAAE,MAAM;wBACZ,IAAI,EAAE,UAAU;wBAChB,OAAO,EAAE,mCAAmC,MAAM,CAAC,OAAO,kCAAkC;qBAC/F,CAAgB;gBACjB,SAAS,EAAE,CAAC;aACf,CAAC;QACN,CAAC;QAED,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAc,CAAC,CAAC;QACpD,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,OAAO;gBACH,KAAK,EAAE,CAAC;wBACJ,IAAI,EAAE,MAAM;wBACZ,IAAI,EAAE,UAAU;wBAChB,OAAO,EAAE,iBAAiB,MAAM,CAAC,IAAI,qBAAqB,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;qBAClG,CAAgB;gBACjB,SAAS,EAAE,CAAC;aACf,CAAC;QACN,CAAC;QAED,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QACpE,IAAI,CAAC;YACD,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;YACvD,IAAI,EAAE,YAAY,CAAC,mBAAmB,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;YAC5D,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO;gBACH,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,CAAgB;gBAC/E,SAAS,EAAE,CAAC;aACf,CAAC;QACN,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACX,wEAAwE;YACxE,uEAAuE;YACvE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjE,OAAO;gBACH,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,gBAAgB,OAAO,EAAE,EAAE,CAAgB;gBAC7F,SAAS,EAAE,CAAC;aACf,CAAC;QACN,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC/B,KAAK,CAAC,mBAAmB,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE;QAC1C,IAAI,KAAK,CAAC,IAAI;YAAE,OAAO,GAAG,CAAC;QAC3B,OAAO,KAAK,CAAC,SAAS,IAAI,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;IAC1D,CAAC,CAAC,CAAC;IACH,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAE/B,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AAC3B,CAAC;AA6BD,MAAM,CAAC,MAAM,qBAAqB,GAC9B,iFAAiF;IACjF,gEAAgE;IAChE,yFAAyF,CAAC;AAE9F;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAA4B;IAC9D,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC;IACzD,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,yBAAyB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IAEnG,MAAM,KAAK,GAAG,IAAI,UAAU,CAAkB;QAC1C,IAAI,EAAE,kBAAkB;QACxB,QAAQ,EAAE;YACN,OAAO,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;YACtD,SAAS,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE;YAC/B,QAAQ,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE;YAClC,KAAK,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;YAC5B,QAAQ,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;YAC/B,IAAI,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;SAC9B;QACD,cAAc,EAAE,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;QAC1C,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/C,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpE,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,KAAK,EAAE,KAAsB,EAAqC,EAAE;QACjF,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK;YACtB,CAAC,CAAC,SAAS,KAAK,CAAC,IAAI,wBAAwB,KAAK,CAAC,KAAK,2BAA2B,KAAK,CAAC,QAAQ,0DAA0D;YAC3J,CAAC,CAAC,SAAS,KAAK,CAAC,IAAI,8BAA8B,CAAC;QAExD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE;YAC7C,YAAY,EAAE,IAAI,CAAC,eAAe,IAAI,2CAA2C;YACjF,GAAG,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACtE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC7D,CAAC,CAAC;QAEH,OAAO;YACH,KAAK;YACL,OAAO,EAAE,CAAC,KAAK,CAAC;YAChB,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC7D,CAAC;IACN,CAAC,CAAC;IAEF,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAEpC,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;QAC3C,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,CACvC,SAAS,KAAK,CAAC,IAAI,eAAe,KAAK,CAAC,KAAK,gBAAgB,EAC7D;YACI,YAAY,EAAE,IAAI,CAAC,YAAY,IAAI,qBAAqB;YACxD,GAAG,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACtE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC7D,CACJ,CAAC;QACF,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QACxC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,qBAAqB,EAAE,QAAQ,CAAC,CAAC;QACxD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IACjC,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACtC,KAAK,CAAC,mBAAmB,CAAC,UAAU,EAAE,CAAC,KAAK,EAAE,EAAE;QAC5C,IAAI,KAAK,CAAC,QAAQ;YAAE,OAAO,GAAG,CAAC;QAC/B,OAAO,KAAK,CAAC,SAAS,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AAC3B,CAAC;AAiCD,MAAM,CAAC,MAAM,MAAM,GAAG,QAAQ,CAAC;AAE/B;;;;;;;;GAQG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAuB;IACpD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;IACvD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEnF,MAAM,YAAY,GAAG;QACjB,IAAI,CAAC,YAAY,IAAI,uDAAuD;QAC5E,aAAa,MAAM,EAAE;QACrB,6EAA6E,MAAM,IAAI;YACvF,iFAAiF;KACpF,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEf,MAAM,KAAK,GAAG,IAAI,UAAU,CAAkB;QAC1C,IAAI,EAAE,YAAY;QAClB,QAAQ,EAAE;YACN,KAAK,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;YACpD,QAAQ,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE;YACnD,IAAI,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;YAC3B,MAAM,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;YAC7B,IAAI,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;SAC9B;QACD,cAAc,EAAE,WAAW,GAAG,CAAC,GAAG,CAAC;QACnC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/C,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACpE,CAAC,CAAC;IAEH,KAAK,CAAC,OAAO,CAAC,YAAY,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;QAC7C,MAAM,UAAU,GAAG,gBAAgB,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7F,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,IAAI,WAAW;YAC1C,CAAC,CAAC,wDAAwD,MAAM,oBAAoB;YACpF,CAAC,CAAC,EAAE,CAAC;QAET,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,UAAU,GAAG,QAAQ,EAAE,EAAE;YACjE,YAAY;YACZ,GAAG,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACtE,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC7D,CAAC,CAAC;QAEH,MAAM,SAAS,GAAG,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;QAC1E,MAAM,WAAW,GAAG,0BAA0B,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;QAChF,MAAM,SAAS,GAAG,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC;QAEzE,oEAAoE;QACpE,yEAAyE;QACzE,oEAAoE;QACpE,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC;QAC/D,GAAG,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,sBAAsB,EAAE,SAAS,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC,CAAC;QAExF,OAAO;YACH,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,KAAK,EAAE,CAAgB;YAC7D,IAAI;YACJ,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC7E,CAAC;IACN,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE;QAC3C,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,CAAC,MAAM;YAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QAErC,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QACzE,IAAI,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,UAAU,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YACzE,IAAI,EAAE,YAAY,CAAC,qBAAqB,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;YACzD,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,OAAO;gBACH,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAgB;gBAC5E,QAAQ,EAAE,CAAC;aACd,CAAC;QACN,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACX,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACjE,OAAO;gBACH,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,kBAAkB,OAAO,EAAE,EAAE,CAAgB;gBACjG,QAAQ,EAAE,CAAC;aACd,CAAC;QACN,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IACnC,KAAK,CAAC,mBAAmB,CAAC,YAAY,EAAE,CAAC,KAAK,EAAE,EAAE;QAC9C,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,GAAG,CAAC;QACtC,OAAO,KAAK,CAAC,QAAQ,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC;IAC5D,CAAC,CAAC,CAAC;IACH,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;IAExC,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AAC3B,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,QAAQ,CACpB,IAAY,EACZ,WAAmB,EACnB,KAA6B;IAE7B,OAAO;QACH,IAAI;QACJ,WAAW;QACX,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;YAChB,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,EAAE,IAAI,EAAyB,CAAC,CAAC;YACnE,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,gCAAgC,CAAC;QACnE,CAAC;KACJ,CAAC;AACN,CAAC"}

package/dist/orchestration/types.d.ts

@@ -0,0 +1,146 @@
+/**
+ * orchestration/types.ts — the multi-agent vocabulary.
+ *
+ * Multi-agent systems fail in production for reasons that are all state problems,
+ * not prompting problems: two agents write the same key and one silently wins; a
+ * loop never terminates; a run dies at minute nine of a twelve-minute job with no
+ * way to resume; nobody can say which agent produced the claim in the final
+ * answer. So state is modelled explicitly here — as CHANNELS with declared merge
+ * semantics — rather than left as an object everyone mutates.
+ *
+ * The execution model is supersteps (Pregel): a frontier of nodes runs, their
+ * updates are merged through the channel reducers, and the next frontier is
+ * computed from the edges. Concurrent fan-out is therefore the default rather than
+ * a special case, and "two agents wrote the same channel" has a defined answer
+ * instead of a race.
+ */
+import type { Span } from '../telemetry/Tracer.js';
+/** Reserved node names: the graph's entry and terminal sentinels. */
+export declare const START = "__start__";
+export declare const END = "__end__";
+export type GraphState = Record<string, unknown>;
+/**
+ * Merges a channel's existing value with an update produced this superstep.
+ * Called once per writing node, in node-name order, so a fan-out merge is
+ * deterministic and reproducible from a checkpoint.
+ */
+export type ChannelReducer<V = unknown> = (current: V | undefined, update: V) => V;
+export interface ChannelSpec<V = unknown> {
+    /** Omit for last-write-wins. */
+    reducer?: ChannelReducer<V>;
+    /** Initial value factory, used when the channel is absent from the input. */
+    default?: () => V;
+}
+export type ChannelSpecs<S extends GraphState> = {
+    [K in keyof S]?: ChannelSpec<S[K]>;
+};
+export interface NodeContext<S extends GraphState> {
+    /** Superstep number, from 0. */
+    step: number;
+    /** The node's own span — pass it as `parent` so model calls nest correctly. */
+    span?: Span;
+    /** Emits a custom event into the run's stream (progress, intermediate output). */
+    emit(event: {
+        type: string;
+        data?: unknown;
+    }): void;
+    /** Cooperative cancellation — long nodes should check it between calls. */
+    signal?: AbortSignal;
+    /** Read-only view of the merged state at the start of this superstep. */
+    state: Readonly<S>;
+}
+/**
+ * A node returns a PARTIAL state update, never a whole state. Returning the whole
+ * object is how a fan-out silently discards a sibling's work.
+ */
+export type NodeFn<S extends GraphState> = (state: Readonly<S>, ctx: NodeContext<S>) => Promise<Partial<S> | void> | Partial<S> | void;
+/** Chooses the next node(s). Return {@link END} to finish this branch. */
+export type EdgeCondition<S extends GraphState> = (state: Readonly<S>, ctx: {
+    step: number;
+}) => string | string[] | Promise<string | string[]>;
+export type GraphEvent<S extends GraphState> = {
+    type: 'step-start';
+    step: number;
+    frontier: string[];
+} | {
+    type: 'node-start';
+    step: number;
+    node: string;
+} | {
+    type: 'node-end';
+    step: number;
+    node: string;
+    update: Partial<S>;
+} | {
+    type: 'node-error';
+    step: number;
+    node: string;
+    error: string;
+} | {
+    type: 'custom';
+    step: number;
+    node: string;
+    event: {
+        type: string;
+        data?: unknown;
+    };
+} | {
+    type: 'step-end';
+    step: number;
+    state: S;
+} | {
+    type: 'interrupt';
+    step: number;
+    before: string[];
+    state: S;
+} | {
+    type: 'end';
+    step: number;
+    state: S;
+    reason: GraphEndReason;
+};
+export type GraphEndReason = 
+/** Every branch reached END. */
+'complete'
+/** The recursion limit tripped — a cycle that did not converge. */
+ | 'recursion-limit'
+/** Paused at an `interruptBefore` node, awaiting a human. */
+ | 'interrupted'
+/** A node threw and the graph is configured to stop on error. */
+ | 'error';
+export interface GraphRunResult<S extends GraphState> {
+    state: S;
+    reason: GraphEndReason;
+    steps: number;
+    /** Node names executed, in order — the audit trail of a run. */
+    path: string[];
+    traceId?: string;
+    /** Present when `reason` is `'interrupted'`; resume by passing it back. */
+    checkpointId?: string;
+    error?: string;
+}
+/** One durable snapshot of a run between supersteps. */
+export interface Checkpoint<S extends GraphState> {
+    id: string;
+    threadId: string;
+    step: number;
+    state: S;
+    /** Nodes queued to run next — without this, resume cannot know where it was. */
+    frontier: string[];
+    path: string[];
+    createdAt: number;
+}
+/**
+ * Durable state between supersteps. An in-process implementation ships here; a
+ * production deployment points this at Durable Objects, Firestore or Postgres, at
+ * which point a twelve-minute multi-agent run survives a deploy.
+ */
+export interface Checkpointer<S extends GraphState = GraphState> {
+    save(checkpoint: Checkpoint<S>): Promise<void>;
+    /** Latest checkpoint for a thread, or a specific one by id. */
+    load(threadId: string, checkpointId?: string): Promise<Checkpoint<S> | undefined>;
+    /** History, newest first — the basis for time-travel debugging. */
+    list(threadId: string): Promise<Checkpoint<S>[]>;
+    clear(threadId: string): Promise<void>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/orchestration/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/orchestration/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,wBAAwB,CAAC;AAEnD,qEAAqE;AACrE,eAAO,MAAM,KAAK,cAAc,CAAC;AACjC,eAAO,MAAM,GAAG,YAAY,CAAC;AAE7B,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAEjD;;;;GAIG;AACH,MAAM,MAAM,cAAc,CAAC,CAAC,GAAG,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,SAAS,EAAE,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC;AAEnF,MAAM,WAAW,WAAW,CAAC,CAAC,GAAG,OAAO;IACpC,gCAAgC;IAChC,OAAO,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;IAC5B,6EAA6E;IAC7E,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC;CACrB;AAED,MAAM,MAAM,YAAY,CAAC,CAAC,SAAS,UAAU,IAAI;KAC5C,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CACrC,CAAC;AAEF,MAAM,WAAW,WAAW,CAAC,CAAC,SAAS,UAAU;IAC7C,gCAAgC;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,+EAA+E;IAC/E,IAAI,CAAC,EAAE,IAAI,CAAC;IACZ,kFAAkF;IAClF,IAAI,CAAC,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,IAAI,CAAC;IACpD,2EAA2E;IAC3E,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,yEAAyE;IACzE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;CACtB;AAED;;;GAGG;AACH,MAAM,MAAM,MAAM,CAAC,CAAC,SAAS,UAAU,IAAI,CACvC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAClB,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,KAClB,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;AAEpD,0EAA0E;AAC1E,MAAM,MAAM,aAAa,CAAC,CAAC,SAAS,UAAU,IAAI,CAC9C,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAClB,GAAG,EAAE;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,KACpB,MAAM,GAAG,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC,CAAC;AAEpD,MAAM,MAAM,UAAU,CAAC,CAAC,SAAS,UAAU,IACrC;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;CAAE,GACxD;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;CAAE,GACpE;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,GACjE;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,OAAO,CAAA;KAAE,CAAA;CAAE,GACvF;IAAE,IAAI,EAAE,UAAU,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,CAAC,CAAA;CAAE,GAC5C;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,CAAC,CAAA;CAAE,GAC/D;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,CAAC,CAAC;IAAC,MAAM,EAAE,cAAc,CAAA;CAAE,CAAC;AAEtE,MAAM,MAAM,cAAc;AACtB,gCAAgC;AAC9B,UAAU;AACZ,mEAAmE;GACjE,iBAAiB;AACnB,6DAA6D;GAC3D,aAAa;AACf,iEAAiE;GAC/D,OAAO,CAAC;AAEd,MAAM,WAAW,cAAc,CAAC,CAAC,SAAS,UAAU;IAChD,KAAK,EAAE,CAAC,CAAC;IACT,MAAM,EAAE,cAAc,CAAC;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,gEAAgE;IAChE,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,2EAA2E;IAC3E,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,KAAK,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,wDAAwD;AACxD,MAAM,WAAW,UAAU,CAAC,CAAC,SAAS,UAAU;IAC5C,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,CAAC,CAAC;IACT,gFAAgF;IAChF,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACrB;AAED;;;;GAIG;AACH,MAAM,WAAW,YAAY,CAAC,CAAC,SAAS,UAAU,GAAG,UAAU;IAC3D,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/C,+DAA+D;IAC/D,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;IAClF,mEAAmE;IACnE,IAAI,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACjD,KAAK,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CAC1C"}

package/dist/orchestration/types.js

@@ -0,0 +1,20 @@
+/**
+ * orchestration/types.ts — the multi-agent vocabulary.
+ *
+ * Multi-agent systems fail in production for reasons that are all state problems,
+ * not prompting problems: two agents write the same key and one silently wins; a
+ * loop never terminates; a run dies at minute nine of a twelve-minute job with no
+ * way to resume; nobody can say which agent produced the claim in the final
+ * answer. So state is modelled explicitly here — as CHANNELS with declared merge
+ * semantics — rather than left as an object everyone mutates.
+ *
+ * The execution model is supersteps (Pregel): a frontier of nodes runs, their
+ * updates are merged through the channel reducers, and the next frontier is
+ * computed from the edges. Concurrent fan-out is therefore the default rather than
+ * a special case, and "two agents wrote the same channel" has a defined answer
+ * instead of a race.
+ */
+/** Reserved node names: the graph's entry and terminal sentinels. */
+export const START = '__start__';
+export const END = '__end__';
+//# sourceMappingURL=types.js.map

package/dist/orchestration/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/orchestration/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAIH,qEAAqE;AACrE,MAAM,CAAC,MAAM,KAAK,GAAG,WAAW,CAAC;AACjC,MAAM,CAAC,MAAM,GAAG,GAAG,SAAS,CAAC"}