@hazeljs/agent 0.2.0-beta.8 → 0.2.0-beta.81

package/dist/graph/agent-graph.d.ts

@@ -0,0 +1,131 @@
+/**
+ * AgentGraph — Multi-Agent Orchestration Graph
+ *
+ * Provides a LangGraph-inspired DAG runtime for orchestrating multiple agents.
+ * Supports sequential pipelines, conditional routing, and parallel fan-out/fan-in.
+ *
+ * @example Sequential pipeline
+ * ```ts
+ * const graph = runtime.createGraph('pipeline')
+ *   .addNode('researcher', { type: 'agent', agentName: 'ResearchAgent' })
+ *   .addNode('writer',     { type: 'agent', agentName: 'WriterAgent' })
+ *   .addEdge('researcher', 'writer')
+ *   .addEdge('writer', END)
+ *   .setEntryPoint('researcher')
+ *   .compile();
+ *
+ * const result = await graph.execute('Write a blog about LLMs');
+ * ```
+ *
+ * @example Conditional routing
+ * ```ts
+ * const graph = runtime.createGraph('router')
+ *   .addNode('classifier', { type: 'agent', agentName: 'ClassifierAgent' })
+ *   .addNode('coder',      { type: 'agent', agentName: 'CoderAgent' })
+ *   .addNode('writer',     { type: 'agent', agentName: 'WriterAgent' })
+ *   .setEntryPoint('classifier')
+ *   .addConditionalEdge('classifier', state => state.data.type === 'code' ? 'coder' : 'writer')
+ *   .addEdge('coder',  END)
+ *   .addEdge('writer', END)
+ *   .compile();
+ * ```
+ *
+ * @example Parallel fan-out / fan-in
+ * ```ts
+ * const graph = runtime.createGraph('parallel')
+ *   .addNode('splitter',    { type: 'function', fn: splitTask })
+ *   .addNode('parallel-1', { type: 'parallel', branches: ['agent-a', 'agent-b'] })
+ *   .addNode('agent-a',    { type: 'agent', agentName: 'AgentA' })
+ *   .addNode('agent-b',    { type: 'agent', agentName: 'AgentB' })
+ *   .addNode('combiner',   { type: 'function', fn: combineResults })
+ *   .addEdge('splitter',   'parallel-1')
+ *   .addEdge('parallel-1', 'combiner')
+ *   .addEdge('combiner',    END)
+ *   .setEntryPoint('splitter')
+ *   .compile();
+ * ```
+ */
+import { GraphNode, GraphNodeConfig, GraphEdge, RouterFunction, GraphExecutionOptions, GraphExecutionResult, GraphStreamChunk } from './agent-graph.types';
+import { AgentExecutionResult } from '../types/agent.types';
+interface RuntimeLike {
+    execute(agentName: string, input: string, options?: Record<string, unknown>): Promise<AgentExecutionResult>;
+    getAgentMetadata(agentName: string): {
+        description?: string;
+    } | undefined;
+}
+/**
+ * Fluent builder for constructing a multi-agent graph.
+ * Call `.compile()` to get an executable `CompiledGraph`.
+ */
+export declare class AgentGraph {
+    private readonly graphId;
+    private readonly runtime;
+    private readonly nodes;
+    private readonly edges;
+    private entryPoint?;
+    constructor(graphId: string, runtime: RuntimeLike);
+    /**
+     * Add a node to the graph.
+     *
+     * Node types:
+     * - `'agent'`    — runs a named agent via AgentRuntime
+     * - `'function'` — runs an arbitrary async function
+     * - `'parallel'` — fans-out to multiple child nodes concurrently
+     */
+    addNode(id: string, config: GraphNodeConfig): this;
+    /**
+     * Add an unconditional directed edge from `from` → `to`.
+     * Use `END` as the target to terminate the graph.
+     */
+    addEdge(from: string, to: string): this;
+    /**
+     * Add a conditional edge from `from`.
+     * The `routerFn` inspects the current `GraphState` and returns the ID of
+     * the next node (or `END` to stop).
+     *
+     * @param routeMap Optional mapping of routerFn return values to node IDs,
+     *                 so you can use short keys like `'code'` → `'CoderNode'`.
+     */
+    addConditionalEdge(from: string, routerFn: RouterFunction, routeMap?: Record<string, string>): this;
+    /** Set the node where graph execution begins */
+    setEntryPoint(nodeId: string): this;
+    /**
+     * Validate the graph and return an executable `CompiledGraph`.
+     * Throws if the graph is malformed (missing entry point, dangling edges, etc.)
+     */
+    compile(): CompiledGraph;
+}
+/**
+ * Executable graph produced by `AgentGraph.compile()`.
+ */
+export declare class CompiledGraph {
+    private readonly graphId;
+    private readonly nodes;
+    private readonly edges;
+    private readonly entryPoint;
+    private readonly runtime;
+    constructor(graphId: string, nodes: Map<string, GraphNode>, edges: GraphEdge[], entryPoint: string, runtime: RuntimeLike);
+    /**
+     * Execute the graph synchronously (collects all results before returning).
+     */
+    execute(input: string, options?: GraphExecutionOptions): Promise<GraphExecutionResult>;
+    /**
+     * Execute the graph and yield a `GraphStreamChunk` after each node completes.
+     * Useful for streaming progress updates to the client in real-time.
+     *
+     * @example
+     * ```ts
+     * for await (const chunk of graph.stream('Research LLMs')) {
+     *   console.log(`[${chunk.nodeId}]`, chunk.chunk);
+     * }
+     * ```
+     */
+    stream(input: string, options?: GraphExecutionOptions): AsyncGenerator<GraphStreamChunk>;
+    private executeNode;
+    private executeParallelBranches;
+    private defaultMerge;
+    private resolveNextNode;
+    private applyPatch;
+}
+export {};
+//# sourceMappingURL=agent-graph.d.ts.map

package/dist/graph/agent-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"agent-graph.d.ts","sourceRoot":"","sources":["../../src/graph/agent-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8CG;AAGH,OAAO,EAGL,SAAS,EACT,eAAe,EACf,SAAS,EACT,cAAc,EACd,qBAAqB,EACrB,oBAAoB,EAEpB,gBAAgB,EAGjB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AAI5D,UAAU,WAAW;IACnB,OAAO,CACL,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,EACb,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAChC,OAAO,CAAC,oBAAoB,CAAC,CAAC;IACjC,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG;QAAE,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,SAAS,CAAC;CAC3E;AAMD;;;GAGG;AACH,qBAAa,UAAU;IAMnB,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,OAAO;IAN1B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAqC;IAC3D,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAmB;IACzC,OAAO,CAAC,UAAU,CAAC,CAAS;gBAGT,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,WAAW;IAUvC;;;;;;;OAOG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,eAAe,GAAG,IAAI;IAelD;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI;IAKvC;;;;;;;OAOG;IACH,kBAAkB,CAChB,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,cAAc,EACxB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC,IAAI;IAYP,gDAAgD;IAChD,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IASnC;;;OAGG;IACH,OAAO,IAAI,aAAa;CAyCzB;AAMD;;GAEG;AACH,qBAAa,aAAa;IAEtB,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,OAAO;gBAJP,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,EAC7B,KAAK,EAAE,SAAS,EAAE,EAClB,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,WAAW;IAOvC;;OAEG;IACG,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,qBAA0B,GAAG,OAAO,CAAC,oBAAoB,CAAC;IAmGhG;;;;;;;;;;OAUG;IACI,MAAM,CACX,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,qBAA0B,GAClC,cAAc,CAAC,gBAAgB,CAAC;YA+ErB,WAAW;YAyEX,uBAAuB;IAqBrC,OAAO,CAAC,YAAY;IAmCpB,OAAO,CAAC,eAAe;IAevB,OAAO,CAAC,UAAU;CAUnB"}

package/dist/graph/agent-graph.js

@@ -0,0 +1,462 @@
+"use strict";
+/**
+ * AgentGraph — Multi-Agent Orchestration Graph
+ *
+ * Provides a LangGraph-inspired DAG runtime for orchestrating multiple agents.
+ * Supports sequential pipelines, conditional routing, and parallel fan-out/fan-in.
+ *
+ * @example Sequential pipeline
+ * ```ts
+ * const graph = runtime.createGraph('pipeline')
+ *   .addNode('researcher', { type: 'agent', agentName: 'ResearchAgent' })
+ *   .addNode('writer',     { type: 'agent', agentName: 'WriterAgent' })
+ *   .addEdge('researcher', 'writer')
+ *   .addEdge('writer', END)
+ *   .setEntryPoint('researcher')
+ *   .compile();
+ *
+ * const result = await graph.execute('Write a blog about LLMs');
+ * ```
+ *
+ * @example Conditional routing
+ * ```ts
+ * const graph = runtime.createGraph('router')
+ *   .addNode('classifier', { type: 'agent', agentName: 'ClassifierAgent' })
+ *   .addNode('coder',      { type: 'agent', agentName: 'CoderAgent' })
+ *   .addNode('writer',     { type: 'agent', agentName: 'WriterAgent' })
+ *   .setEntryPoint('classifier')
+ *   .addConditionalEdge('classifier', state => state.data.type === 'code' ? 'coder' : 'writer')
+ *   .addEdge('coder',  END)
+ *   .addEdge('writer', END)
+ *   .compile();
+ * ```
+ *
+ * @example Parallel fan-out / fan-in
+ * ```ts
+ * const graph = runtime.createGraph('parallel')
+ *   .addNode('splitter',    { type: 'function', fn: splitTask })
+ *   .addNode('parallel-1', { type: 'parallel', branches: ['agent-a', 'agent-b'] })
+ *   .addNode('agent-a',    { type: 'agent', agentName: 'AgentA' })
+ *   .addNode('agent-b',    { type: 'agent', agentName: 'AgentB' })
+ *   .addNode('combiner',   { type: 'function', fn: combineResults })
+ *   .addEdge('splitter',   'parallel-1')
+ *   .addEdge('parallel-1', 'combiner')
+ *   .addEdge('combiner',    END)
+ *   .setEntryPoint('splitter')
+ *   .compile();
+ * ```
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CompiledGraph = exports.AgentGraph = void 0;
+const crypto_1 = require("crypto");
+const agent_graph_types_1 = require("./agent-graph.types");
+// ---------------------------------------------------------------------------
+// AgentGraph (builder)
+// ---------------------------------------------------------------------------
+/**
+ * Fluent builder for constructing a multi-agent graph.
+ * Call `.compile()` to get an executable `CompiledGraph`.
+ */
+class AgentGraph {
+    constructor(graphId, runtime) {
+        this.graphId = graphId;
+        this.runtime = runtime;
+        this.nodes = new Map();
+        this.edges = [];
+        // Register the sentinel END node
+        this.nodes.set(agent_graph_types_1.END, { id: agent_graph_types_1.END, config: { type: 'function', fn: (s) => s } });
+    }
+    // -------------------------------------------------------------------------
+    // Nodes
+    // -------------------------------------------------------------------------
+    /**
+     * Add a node to the graph.
+     *
+     * Node types:
+     * - `'agent'`    — runs a named agent via AgentRuntime
+     * - `'function'` — runs an arbitrary async function
+     * - `'parallel'` — fans-out to multiple child nodes concurrently
+     */
+    addNode(id, config) {
+        if (id === agent_graph_types_1.END) {
+            throw new Error(`"${agent_graph_types_1.END}" is a reserved node ID`);
+        }
+        if (this.nodes.has(id)) {
+            throw new Error(`Node "${id}" is already registered in graph "${this.graphId}"`);
+        }
+        this.nodes.set(id, { id, config });
+        return this;
+    }
+    // -------------------------------------------------------------------------
+    // Edges
+    // -------------------------------------------------------------------------
+    /**
+     * Add an unconditional directed edge from `from` → `to`.
+     * Use `END` as the target to terminate the graph.
+     */
+    addEdge(from, to) {
+        this.edges.push({ from, to });
+        return this;
+    }
+    /**
+     * Add a conditional edge from `from`.
+     * The `routerFn` inspects the current `GraphState` and returns the ID of
+     * the next node (or `END` to stop).
+     *
+     * @param routeMap Optional mapping of routerFn return values to node IDs,
+     *                 so you can use short keys like `'code'` → `'CoderNode'`.
+     */
+    addConditionalEdge(from, routerFn, routeMap) {
+        const condition = routeMap
+            ? (state) => {
+                const key = routerFn(state);
+                return routeMap[key] ?? key;
+            }
+            : routerFn;
+        this.edges.push({ from, condition });
+        return this;
+    }
+    /** Set the node where graph execution begins */
+    setEntryPoint(nodeId) {
+        this.entryPoint = nodeId;
+        return this;
+    }
+    // -------------------------------------------------------------------------
+    // Compile
+    // -------------------------------------------------------------------------
+    /**
+     * Validate the graph and return an executable `CompiledGraph`.
+     * Throws if the graph is malformed (missing entry point, dangling edges, etc.)
+     */
+    compile() {
+        if (!this.entryPoint) {
+            throw new Error(`Graph "${this.graphId}" has no entry point. Call setEntryPoint() first.`);
+        }
+        if (!this.nodes.has(this.entryPoint)) {
+            throw new Error(`Entry point "${this.entryPoint}" is not a registered node in graph "${this.graphId}"`);
+        }
+        // Validate all edge references
+        for (const edge of this.edges) {
+            if (!this.nodes.has(edge.from)) {
+                throw new Error(`Edge references unknown source node: "${edge.from}"`);
+            }
+            if (edge.to && edge.to !== agent_graph_types_1.END && !this.nodes.has(edge.to)) {
+                throw new Error(`Edge references unknown target node: "${edge.to}"`);
+            }
+        }
+        // Validate parallel branch references
+        for (const [, node] of this.nodes) {
+            if (node.config.type === 'parallel') {
+                for (const branch of node.config.branches) {
+                    if (!this.nodes.has(branch)) {
+                        throw new Error(`Parallel node "${node.id}" references unknown branch node: "${branch}"`);
+                    }
+                }
+            }
+        }
+        return new CompiledGraph(this.graphId, new Map(this.nodes), [...this.edges], this.entryPoint, this.runtime);
+    }
+}
+exports.AgentGraph = AgentGraph;
+// ---------------------------------------------------------------------------
+// CompiledGraph (executor)
+// ---------------------------------------------------------------------------
+/**
+ * Executable graph produced by `AgentGraph.compile()`.
+ */
+class CompiledGraph {
+    constructor(graphId, nodes, edges, entryPoint, runtime) {
+        this.graphId = graphId;
+        this.nodes = nodes;
+        this.edges = edges;
+        this.entryPoint = entryPoint;
+        this.runtime = runtime;
+    }
+    // -------------------------------------------------------------------------
+    // execute()
+    // -------------------------------------------------------------------------
+    /**
+     * Execute the graph synchronously (collects all results before returning).
+     */
+    async execute(input, options = {}) {
+        const executionId = `graph_${(0, crypto_1.randomUUID)()}`;
+        const startTime = Date.now();
+        const steps = [];
+        const nodeExecutions = {};
+        let state = {
+            input,
+            messages: [{ role: 'user', content: input, timestamp: new Date() }],
+            data: { ...(options.initialData ?? {}) },
+            nodeResults: {},
+            metadata: { executionId, graphId: this.graphId, ...options },
+        };
+        const maxSteps = options.maxSteps ?? 50;
+        const timeout = options.timeout ?? 600000;
+        const deadline = Date.now() + timeout;
+        let currentNodeId = this.entryPoint;
+        let stepCount = 0;
+        try {
+            while (currentNodeId !== agent_graph_types_1.END) {
+                if (Date.now() > deadline) {
+                    throw new Error(`Graph "${this.graphId}" exceeded timeout of ${timeout}ms after ${stepCount} steps`);
+                }
+                if (stepCount >= maxSteps) {
+                    throw new Error(`Graph "${this.graphId}" exceeded maxSteps (${maxSteps}). Possible infinite loop.`);
+                }
+                stepCount++;
+                const node = this.nodes.get(currentNodeId);
+                if (!node) {
+                    throw new Error(`Node "${currentNodeId}" not found in graph "${this.graphId}"`);
+                }
+                state = { ...state, currentNode: currentNodeId };
+                const stepStart = Date.now();
+                const { nextState, agentResult, parallelBranches } = await this.executeNode(node, state, options);
+                state = nextState;
+                if (agentResult) {
+                    nodeExecutions[currentNodeId] = agentResult;
+                    state = { ...state, nodeResults: { ...state.nodeResults, [currentNodeId]: agentResult } };
+                }
+                steps.push({
+                    id: `step_${stepCount}`,
+                    nodeId: currentNodeId,
+                    nodeType: node.config.type,
+                    input: state.input,
+                    output: state.output,
+                    duration: Date.now() - stepStart,
+                    timestamp: new Date(),
+                    parallelBranches,
+                });
+                currentNodeId = this.resolveNextNode(currentNodeId, state);
+            }
+            return {
+                graphId: this.graphId,
+                executionId,
+                state,
+                response: state.output,
+                steps,
+                nodeExecutions,
+                duration: Date.now() - startTime,
+                completedAt: new Date(),
+                success: true,
+            };
+        }
+        catch (error) {
+            return {
+                graphId: this.graphId,
+                executionId,
+                state: { ...state, error: error },
+                steps,
+                nodeExecutions,
+                duration: Date.now() - startTime,
+                completedAt: new Date(),
+                success: false,
+                error: error,
+            };
+        }
+    }
+    // -------------------------------------------------------------------------
+    // stream()
+    // -------------------------------------------------------------------------
+    /**
+     * Execute the graph and yield a `GraphStreamChunk` after each node completes.
+     * Useful for streaming progress updates to the client in real-time.
+     *
+     * @example
+     * ```ts
+     * for await (const chunk of graph.stream('Research LLMs')) {
+     *   console.log(`[${chunk.nodeId}]`, chunk.chunk);
+     * }
+     * ```
+     */
+    async *stream(input, options = {}) {
+        const executionId = `graph_${(0, crypto_1.randomUUID)()}`;
+        const maxSteps = options.maxSteps ?? 50;
+        const timeout = options.timeout ?? 600000;
+        const deadline = Date.now() + timeout;
+        let state = {
+            input,
+            messages: [{ role: 'user', content: input, timestamp: new Date() }],
+            data: { ...(options.initialData ?? {}) },
+            nodeResults: {},
+            metadata: { executionId, graphId: this.graphId, ...options },
+        };
+        let currentNodeId = this.entryPoint;
+        let stepCount = 0;
+        while (currentNodeId !== agent_graph_types_1.END) {
+            if (Date.now() > deadline || stepCount >= maxSteps)
+                break;
+            stepCount++;
+            const node = this.nodes.get(currentNodeId);
+            if (!node)
+                break;
+            state = { ...state, currentNode: currentNodeId };
+            const { nextState, agentResult, parallelBranches } = await this.executeNode(node, state, options);
+            state = nextState;
+            if (agentResult) {
+                state = {
+                    ...state,
+                    nodeResults: { ...state.nodeResults, [currentNodeId]: agentResult },
+                };
+            }
+            yield {
+                executionId,
+                nodeId: currentNodeId,
+                nodeType: node.config.type,
+                chunk: state.output ?? '',
+                nodeOutput: state.output,
+                done: false,
+            };
+            if (parallelBranches) {
+                for (const branch of parallelBranches) {
+                    yield {
+                        executionId,
+                        nodeId: branch,
+                        nodeType: 'agent',
+                        chunk: state.nodeResults[branch]?.response ?? '',
+                        nodeOutput: state.nodeResults[branch]?.response,
+                        done: false,
+                    };
+                }
+            }
+            currentNodeId = this.resolveNextNode(currentNodeId, state);
+        }
+        yield {
+            executionId,
+            nodeId: currentNodeId === agent_graph_types_1.END ? agent_graph_types_1.END : currentNodeId,
+            nodeType: 'function',
+            chunk: state.output ?? '',
+            nodeOutput: state.output,
+            done: true,
+        };
+    }
+    // -------------------------------------------------------------------------
+    // Node execution
+    // -------------------------------------------------------------------------
+    async executeNode(node, state, options) {
+        const config = node.config;
+        // -- function node --
+        if (config.type === 'function') {
+            const patch = await config.fn(state);
+            return { nextState: this.applyPatch(state, patch) };
+        }
+        // -- agent node --
+        if (config.type === 'agent') {
+            const agentInput = config.inputMapper ? config.inputMapper(state) : state.input;
+            const result = await this.runtime.execute(config.agentName, agentInput, {
+                sessionId: options.sessionId,
+                userId: options.userId,
+            });
+            let patch;
+            if (config.outputMapper) {
+                patch = config.outputMapper(result, state);
+            }
+            else {
+                const newMessage = {
+                    role: 'assistant',
+                    content: result.response ?? '',
+                    nodeId: node.id,
+                    timestamp: new Date(),
+                };
+                patch = {
+                    output: result.response,
+                    messages: [...state.messages, newMessage],
+                };
+            }
+            return {
+                nextState: this.applyPatch(state, patch),
+                agentResult: result,
+            };
+        }
+        // -- parallel node --
+        if (config.type === 'parallel') {
+            const branchResults = await this.executeParallelBranches(config.branches, state, options);
+            // Apply custom merge or default
+            let patch;
+            if (config.mergeStrategy) {
+                patch = config.mergeStrategy(branchResults, state);
+            }
+            else {
+                patch = this.defaultMerge(branchResults, state);
+            }
+            return {
+                nextState: this.applyPatch(state, patch),
+                parallelBranches: config.branches,
+            };
+        }
+        return { nextState: state };
+    }
+    // -------------------------------------------------------------------------
+    // Parallel execution helpers
+    // -------------------------------------------------------------------------
+    async executeParallelBranches(branchIds, state, options) {
+        const tasks = branchIds.map(async (nodeId) => {
+            const node = this.nodes.get(nodeId);
+            if (!node) {
+                return { nodeId, state, error: new Error(`Branch node "${nodeId}" not found`) };
+            }
+            try {
+                const { nextState, agentResult } = await this.executeNode(node, state, options);
+                return { nodeId, state: nextState, agentResult };
+            }
+            catch (err) {
+                return { nodeId, state, error: err };
+            }
+        });
+        return Promise.all(tasks);
+    }
+    defaultMerge(results, base) {
+        const messages = [...base.messages];
+        const nodeResults = { ...base.nodeResults };
+        const data = { ...base.data };
+        const outputs = [];
+        for (const r of results) {
+            if (r.agentResult) {
+                nodeResults[r.nodeId] = r.agentResult;
+                if (r.agentResult.response) {
+                    outputs.push(`[${r.nodeId}]: ${r.agentResult.response}`);
+                    messages.push({
+                        role: 'assistant',
+                        content: r.agentResult.response,
+                        nodeId: r.nodeId,
+                        timestamp: new Date(),
+                    });
+                }
+            }
+            // Merge data from parallel states (last-write wins for conflicts)
+            Object.assign(data, r.state.data);
+        }
+        return {
+            output: outputs.join('\n\n---\n\n'),
+            messages,
+            nodeResults,
+            data,
+        };
+    }
+    // -------------------------------------------------------------------------
+    // Edge resolution
+    // -------------------------------------------------------------------------
+    resolveNextNode(fromNodeId, state) {
+        const edge = this.edges.find((e) => e.from === fromNodeId);
+        if (!edge)
+            return agent_graph_types_1.END;
+        if (edge.condition) {
+            return edge.condition(state);
+        }
+        return edge.to ?? agent_graph_types_1.END;
+    }
+    // -------------------------------------------------------------------------
+    // State helpers
+    // -------------------------------------------------------------------------
+    applyPatch(state, patch) {
+        return {
+            ...state,
+            ...patch,
+            // Always deep-merge these collections rather than replacing them
+            data: { ...state.data, ...(patch.data ?? {}) },
+            nodeResults: { ...state.nodeResults, ...(patch.nodeResults ?? {}) },
+            messages: patch.messages ?? state.messages,
+        };
+    }
+}
+exports.CompiledGraph = CompiledGraph;
+//# sourceMappingURL=agent-graph.js.map

package/dist/graph/agent-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"agent-graph.js","sourceRoot":"","sources":["../../src/graph/agent-graph.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8CG;;;AAEH,mCAAoC;AACpC,2DAa6B;AAc7B,8EAA8E;AAC9E,uBAAuB;AACvB,8EAA8E;AAE9E;;;GAGG;AACH,MAAa,UAAU;IAKrB,YACmB,OAAe,EACf,OAAoB;QADpB,YAAO,GAAP,OAAO,CAAQ;QACf,YAAO,GAAP,OAAO,CAAa;QANtB,UAAK,GAA2B,IAAI,GAAG,EAAE,CAAC;QAC1C,UAAK,GAAgB,EAAE,CAAC;QAOvC,iCAAiC;QACjC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,uBAAG,EAAE,EAAE,EAAE,EAAE,uBAAG,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAC/E,CAAC;IAED,4EAA4E;IAC5E,QAAQ;IACR,4EAA4E;IAE5E;;;;;;;OAOG;IACH,OAAO,CAAC,EAAU,EAAE,MAAuB;QACzC,IAAI,EAAE,KAAK,uBAAG,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,IAAI,uBAAG,yBAAyB,CAAC,CAAC;QACpD,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,SAAS,EAAE,qCAAqC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QACnF,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,4EAA4E;IAC5E,QAAQ;IACR,4EAA4E;IAE5E;;;OAGG;IACH,OAAO,CAAC,IAAY,EAAE,EAAU;QAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;OAOG;IACH,kBAAkB,CAChB,IAAY,EACZ,QAAwB,EACxB,QAAiC;QAEjC,MAAM,SAAS,GAAmB,QAAQ;YACxC,CAAC,CAAC,CAAC,KAAK,EAAU,EAAE;gBAChB,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAW,CAAC;gBACtC,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;YAC9B,CAAC;YACH,CAAC,CAAC,QAAQ,CAAC;QAEb,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gDAAgD;IAChD,aAAa,CAAC,MAAc;QAC1B,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,4EAA4E;IAC5E,UAAU;IACV,4EAA4E;IAE5E;;;OAGG;IACH,OAAO;QACL,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,UAAU,IAAI,CAAC,OAAO,mDAAmD,CAAC,CAAC;QAC7F,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CACb,gBAAgB,IAAI,CAAC,UAAU,wCAAwC,IAAI,CAAC,OAAO,GAAG,CACvF,CAAC;QACJ,CAAC;QAED,+BAA+B;QAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CAAC,yCAAyC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACzE,CAAC;YACD,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,uBAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC3D,MAAM,IAAI,KAAK,CAAC,yCAAyC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBACpC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;oBAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC5B,MAAM,IAAI,KAAK,CACb,kBAAkB,IAAI,CAAC,EAAE,sCAAsC,MAAM,GAAG,CACzE,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,aAAa,CACtB,IAAI,CAAC,OAAO,EACZ,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EACnB,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EACf,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,OAAO,CACb,CAAC;IACJ,CAAC;CACF;AAhID,gCAgIC;AAED,8EAA8E;AAC9E,2BAA2B;AAC3B,8EAA8E;AAE9E;;GAEG;AACH,MAAa,aAAa;IACxB,YACmB,OAAe,EACf,KAA6B,EAC7B,KAAkB,EAClB,UAAkB,EAClB,OAAoB;QAJpB,YAAO,GAAP,OAAO,CAAQ;QACf,UAAK,GAAL,KAAK,CAAwB;QAC7B,UAAK,GAAL,KAAK,CAAa;QAClB,eAAU,GAAV,UAAU,CAAQ;QAClB,YAAO,GAAP,OAAO,CAAa;IACpC,CAAC;IAEJ,4EAA4E;IAC5E,YAAY;IACZ,4EAA4E;IAE5E;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,KAAa,EAAE,UAAiC,EAAE;QAC9D,MAAM,WAAW,GAAG,SAAS,IAAA,mBAAU,GAAE,EAAE,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,MAAM,cAAc,GAAyC,EAAE,CAAC;QAEhE,IAAI,KAAK,GAAe;YACtB,KAAK;YACL,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,IAAI,EAAE,EAAE,CAAC;YACnE,IAAI,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC,EAAE;YACxC,WAAW,EAAE,EAAE;YACf,QAAQ,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,OAAO,EAAE;SAC7D,CAAC;QAEF,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,MAAO,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;QAEtC,IAAI,aAAa,GAAW,IAAI,CAAC,UAAU,CAAC;QAC5C,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,IAAI,CAAC;YACH,OAAO,aAAa,KAAK,uBAAG,EAAE,CAAC;gBAC7B,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,EAAE,CAAC;oBAC1B,MAAM,IAAI,KAAK,CACb,UAAU,IAAI,CAAC,OAAO,yBAAyB,OAAO,YAAY,SAAS,QAAQ,CACpF,CAAC;gBACJ,CAAC;gBACD,IAAI,SAAS,IAAI,QAAQ,EAAE,CAAC;oBAC1B,MAAM,IAAI,KAAK,CACb,UAAU,IAAI,CAAC,OAAO,wBAAwB,QAAQ,4BAA4B,CACnF,CAAC;gBACJ,CAAC;gBAED,SAAS,EAAE,CAAC;gBACZ,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBAC3C,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,MAAM,IAAI,KAAK,CAAC,SAAS,aAAa,yBAAyB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;gBAClF,CAAC;gBAED,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;gBACjD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBAE7B,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,gBAAgB,EAAE,GAAG,MAAM,IAAI,CAAC,WAAW,CACzE,IAAI,EACJ,KAAK,EACL,OAAO,CACR,CAAC;gBACF,KAAK,GAAG,SAAS,CAAC;gBAElB,IAAI,WAAW,EAAE,CAAC;oBAChB,cAAc,CAAC,aAAa,CAAC,GAAG,WAAW,CAAC;oBAC5C,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,aAAa,CAAC,EAAE,WAAW,EAAE,EAAE,CAAC;gBAC5F,CAAC;gBAED,KAAK,CAAC,IAAI,CAAC;oBACT,EAAE,EAAE,QAAQ,SAAS,EAAE;oBACvB,MAAM,EAAE,aAAa;oBACrB,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;oBAC1B,KAAK,EAAE,KAAK,CAAC,KAAK;oBAClB,MAAM,EAAE,KAAK,CAAC,MAAM;oBACpB,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;oBAChC,SAAS,EAAE,IAAI,IAAI,EAAE;oBACrB,gBAAgB;iBACjB,CAAC,CAAC;gBAEH,aAAa,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;YAC7D,CAAC;YAED,OAAO;gBACL,OAAO,EAAE,IAAI,CAAC,OAAO;gBACrB,WAAW;gBACX,KAAK;gBACL,QAAQ,EAAE,KAAK,CAAC,MAAM;gBACtB,KAAK;gBACL,cAAc;gBACd,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;gBAChC,WAAW,EAAE,IAAI,IAAI,EAAE;gBACvB,OAAO,EAAE,IAAI;aACd,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO;gBACL,OAAO,EAAE,IAAI,CAAC,OAAO;gBACrB,WAAW;gBACX,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAc,EAAE;gBAC1C,KAAK;gBACL,cAAc;gBACd,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;gBAChC,WAAW,EAAE,IAAI,IAAI,EAAE;gBACvB,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,KAAc;aACtB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,WAAW;IACX,4EAA4E;IAE5E;;;;;;;;;;OAUG;IACH,KAAK,CAAC,CAAC,MAAM,CACX,KAAa,EACb,UAAiC,EAAE;QAEnC,MAAM,WAAW,GAAG,SAAS,IAAA,mBAAU,GAAE,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,EAAE,CAAC;QACxC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,MAAO,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;QAEtC,IAAI,KAAK,GAAe;YACtB,KAAK;YACL,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,IAAI,EAAE,EAAE,CAAC;YACnE,IAAI,EAAE,EAAE,GAAG,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC,EAAE;YACxC,WAAW,EAAE,EAAE;YACf,QAAQ,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,OAAO,EAAE;SAC7D,CAAC;QAEF,IAAI,aAAa,GAAW,IAAI,CAAC,UAAU,CAAC;QAC5C,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,OAAO,aAAa,KAAK,uBAAG,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,IAAI,SAAS,IAAI,QAAQ;gBAAE,MAAM;YAE1D,SAAS,EAAE,CAAC;YACZ,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YAC3C,IAAI,CAAC,IAAI;gBAAE,MAAM;YAEjB,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,CAAC;YAEjD,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,gBAAgB,EAAE,GAAG,MAAM,IAAI,CAAC,WAAW,CACzE,IAAI,EACJ,KAAK,EACL,OAAO,CACR,CAAC;YACF,KAAK,GAAG,SAAS,CAAC;YAElB,IAAI,WAAW,EAAE,CAAC;gBAChB,KAAK,GAAG;oBACN,GAAG,KAAK;oBACR,WAAW,EAAE,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,aAAa,CAAC,EAAE,WAAW,EAAE;iBACpE,CAAC;YACJ,CAAC;YAED,MAAM;gBACJ,WAAW;gBACX,MAAM,EAAE,aAAa;gBACrB,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI;gBAC1B,KAAK,EAAE,KAAK,CAAC,MAAM,IAAI,EAAE;gBACzB,UAAU,EAAE,KAAK,CAAC,MAAM;gBACxB,IAAI,EAAE,KAAK;aACZ,CAAC;YAEF,IAAI,gBAAgB,EAAE,CAAC;gBACrB,KAAK,MAAM,MAAM,IAAI,gBAAgB,EAAE,CAAC;oBACtC,MAAM;wBACJ,WAAW;wBACX,MAAM,EAAE,MAAM;wBACd,QAAQ,EAAE,OAAO;wBACjB,KAAK,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,QAAQ,IAAI,EAAE;wBAChD,UAAU,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,QAAQ;wBAC/C,IAAI,EAAE,KAAK;qBACZ,CAAC;gBACJ,CAAC;YACH,CAAC;YAED,aAAa,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;QAC7D,CAAC;QAED,MAAM;YACJ,WAAW;YACX,MAAM,EAAE,aAAa,KAAK,uBAAG,CAAC,CAAC,CAAC,uBAAG,CAAC,CAAC,CAAC,aAAa;YACnD,QAAQ,EAAE,UAAU;YACpB,KAAK,EAAE,KAAK,CAAC,MAAM,IAAI,EAAE;YACzB,UAAU,EAAE,KAAK,CAAC,MAAM;YACxB,IAAI,EAAE,IAAI;SACX,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,iBAAiB;IACjB,4EAA4E;IAEpE,KAAK,CAAC,WAAW,CACvB,IAAe,EACf,KAAiB,EACjB,OAA8B;QAM9B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAE3B,sBAAsB;QACtB,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;YACrC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;QACtD,CAAC;QAED,mBAAmB;QACnB,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC5B,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;YAEhF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,EAAE,UAAU,EAAE;gBACtE,SAAS,EAAE,OAAO,CAAC,SAAS;gBAC5B,MAAM,EAAE,OAAO,CAAC,MAAM;aACvB,CAAC,CAAC;YAEH,IAAI,KAA0B,CAAC;YAC/B,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;gBACxB,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC7C,CAAC;iBAAM,CAAC;gBACN,MAAM,UAAU,GAAiB;oBAC/B,IAAI,EAAE,WAAW;oBACjB,OAAO,EAAE,MAAM,CAAC,QAAQ,IAAI,EAAE;oBAC9B,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,SAAS,EAAE,IAAI,IAAI,EAAE;iBACtB,CAAC;gBACF,KAAK,GAAG;oBACN,MAAM,EAAE,MAAM,CAAC,QAAQ;oBACvB,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,EAAE,UAAU,CAAC;iBAC1C,CAAC;YACJ,CAAC;YAED,OAAO;gBACL,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC;gBACxC,WAAW,EAAE,MAAM;aACpB,CAAC;QACJ,CAAC;QAED,sBAAsB;QACtB,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC/B,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAE1F,gCAAgC;YAChC,IAAI,KAA0B,CAAC;YAC/B,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;gBACzB,KAAK,GAAG,MAAM,CAAC,aAAa,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;YACrD,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;YAClD,CAAC;YAED,OAAO;gBACL,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC;gBACxC,gBAAgB,EAAE,MAAM,CAAC,QAAQ;aAClC,CAAC;QACJ,CAAC;QAED,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAC9B,CAAC;IAED,4EAA4E;IAC5E,6BAA6B;IAC7B,4EAA4E;IAEpE,KAAK,CAAC,uBAAuB,CACnC,SAAmB,EACnB,KAAiB,EACjB,OAA8B;QAE9B,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAiC,EAAE;YAC1E,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,gBAAgB,MAAM,aAAa,CAAC,EAAE,CAAC;YAClF,CAAC;YACD,IAAI,CAAC;gBACH,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;gBAChF,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC;YACnD,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAY,EAAE,CAAC;YAChD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAEO,YAAY,CAAC,OAA+B,EAAE,IAAgB;QACpE,MAAM,QAAQ,GAAmB,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpD,MAAM,WAAW,GAAyC,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAClF,MAAM,IAAI,GAA4B,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACvD,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;gBAClB,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC;gBACtC,IAAI,CAAC,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;oBAC3B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,MAAM,CAAC,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC,CAAC;oBACzD,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,WAAW;wBACjB,OAAO,EAAE,CAAC,CAAC,WAAW,CAAC,QAAQ;wBAC/B,MAAM,EAAE,CAAC,CAAC,MAAM;wBAChB,SAAS,EAAE,IAAI,IAAI,EAAE;qBACtB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YACD,kEAAkE;YAClE,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC;QAED,OAAO;YACL,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC;YACnC,QAAQ;YACR,WAAW;YACX,IAAI;SACL,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,kBAAkB;IAClB,4EAA4E;IAEpE,eAAe,CAAC,UAAkB,EAAE,KAAiB;QAC3D,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;QAC3D,IAAI,CAAC,IAAI;YAAE,OAAO,uBAAG,CAAC;QAEtB,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAW,CAAC;QACzC,CAAC;QAED,OAAQ,IAAI,CAAC,EAAa,IAAI,uBAAG,CAAC;IACpC,CAAC;IAED,4EAA4E;IAC5E,gBAAgB;IAChB,4EAA4E;IAEpE,UAAU,CAAC,KAAiB,EAAE,KAA0B;QAC9D,OAAO;YACL,GAAG,KAAK;YACR,GAAG,KAAK;YACR,iEAAiE;YACjE,IAAI,EAAE,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;YAC9C,WAAW,EAAE,EAAE,GAAG,KAAK,CAAC,WAAW,EAAE,GAAG,CAAC,KAAK,CAAC,WAAW,IAAI,EAAE,CAAC,EAAE;YACnE,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ;SAC3C,CAAC;IACJ,CAAC;CACF;AA1WD,sCA0WC"}