@framers/agentos 0.1.113 → 0.1.114

package/dist/api/strategies/graphCompiler.js

@@ -0,0 +1,617 @@
+/**
+ * @file graphCompiler.ts
+ * Compiles agency() strategy configurations into CompiledExecutionGraph IR.
+ *
+ * This bridge enables the high-level agency() API to leverage the full
+ * GraphRuntime DAG engine, gaining:
+ *  - Checkpointing / mid-run persistence
+ *  - Structured state passing (scratch/artifacts)
+ *  - Conditional edge routing
+ *  - Guardrail nodes
+ *  - Parallel node execution
+ *  - Serializable IR
+ *
+ * Each strategy maps to a different graph topology:
+ *  - sequential: A -> B -> C -> END
+ *  - parallel: START -> [A, B, C] -> synthesize -> END
+ *  - debate: round-based chains with a final synthesizer
+ *  - review-loop: producer -> reviewer -> conditional back-edge
+ *  - hierarchical: manager GMI node with delegation tool calls
+ *
+ * @see {@link compileAgencyToGraph} -- the main entry point.
+ * @see {@link GraphRuntime} -- the engine that executes the compiled graph.
+ */
+import { START, END } from '../../orchestration/ir/types.js';
+import { isAgent } from './shared.js';
+// ---------------------------------------------------------------------------
+// Internal helpers
+// ---------------------------------------------------------------------------
+/** Auto-incrementing counter for generating unique edge IDs within a compile pass. */
+let edgeCounter = 0;
+/**
+ * Creates a unique edge ID for a compile pass.
+ * Resets are not necessary because IDs only need to be unique within a single graph.
+ *
+ * @returns A string ID like `"edge_0"`, `"edge_1"`, etc.
+ */
+function nextEdgeId() {
+    return `edge_${edgeCounter++}`;
+}
+/**
+ * Resets the edge counter at the start of each compile pass.
+ * Ensures deterministic edge IDs across calls (useful for tests).
+ */
+function resetEdgeCounter() {
+    edgeCounter = 0;
+}
+/**
+ * Extracts the `instructions` string from an agent-or-config value.
+ * Falls back to a generic label when no instructions are available.
+ *
+ * @param agentOrConfig - Either a pre-built Agent or a raw BaseAgentConfig.
+ * @param name - The agent's roster name; used in the fallback label.
+ * @returns An instruction string suitable for a GMI node's system prompt.
+ */
+function extractInstructions(agentOrConfig, name) {
+    if (!isAgent(agentOrConfig)) {
+        return agentOrConfig.instructions ?? `Agent "${name}"`;
+    }
+    return `Agent "${name}"`;
+}
+/**
+ * Builds a GMI-type GraphNode representing a single agent in the compiled graph.
+ *
+ * Each agent becomes a "gmi" node whose instructions tell the LLM to:
+ *  1. Act as the named agent
+ *  2. Read relevant context from scratch (populated by previous nodes)
+ *  3. Write its output to scratch for downstream consumption
+ *
+ * @param nodeId - Unique node identifier within the graph.
+ * @param agentName - Human-readable agent name from the roster.
+ * @param instructions - System instructions for the GMI node.
+ * @param scratchReadKeys - Scratch keys to inject as context (e.g. previous output).
+ * @param scratchWriteKey - Scratch key where this node writes its output.
+ * @returns A fully configured GraphNode.
+ */
+function makeAgentNode(nodeId, agentName, instructions, scratchReadKeys, scratchWriteKey) {
+    // Build context injection instructions so the LLM knows where to find
+    // predecessor outputs in the scratch partition.
+    const contextLines = scratchReadKeys.length > 0
+        ? `\n\nRead the following from scratch for context: ${scratchReadKeys.join(', ')}.`
+        : '';
+    return {
+        id: nodeId,
+        type: 'gmi',
+        executorConfig: {
+            type: 'gmi',
+            instructions: `You are agent "${agentName}". ${instructions}${contextLines}\n\nWrite your output to scratch key "${scratchWriteKey}".`,
+        },
+        executionMode: 'single_turn',
+        // Agent nodes are pure from the graph's perspective -- side effects
+        // happen inside the LLM call, which the graph treats as a black box.
+        effectClass: 'pure',
+        checkpoint: 'after',
+    };
+}
+/**
+ * Builds a GMI-type GraphNode for synthesis (combining multiple agent outputs).
+ *
+ * @param nodeId - Unique node identifier.
+ * @param agentOutputKeys - Scratch keys holding the individual agent outputs.
+ * @param agencyInstructions - Optional agency-level instructions to append.
+ * @returns A GraphNode configured for synthesis.
+ */
+function makeSynthesizerNode(nodeId, agentOutputKeys, agencyInstructions) {
+    const extraInstructions = agencyInstructions
+        ? `\n\n${agencyInstructions}`
+        : '';
+    return {
+        id: nodeId,
+        type: 'gmi',
+        executorConfig: {
+            type: 'gmi',
+            instructions: `You are a synthesis agent. Multiple agents have produced outputs stored in scratch keys: ${agentOutputKeys.join(', ')}. ` +
+                `Read all of them and synthesize a single coherent response. ` +
+                `Write the final answer to scratch key "finalOutput".${extraInstructions}`,
+        },
+        executionMode: 'single_turn',
+        effectClass: 'pure',
+        checkpoint: 'after',
+    };
+}
+/**
+ * Creates a static edge between two nodes.
+ *
+ * @param source - Source node ID (or START sentinel).
+ * @param target - Target node ID (or END sentinel).
+ * @returns A static GraphEdge.
+ */
+function staticEdge(source, target) {
+    return {
+        id: nextEdgeId(),
+        source,
+        target,
+        type: 'static',
+    };
+}
+/**
+ * Creates a conditional edge with an expression-based condition.
+ *
+ * @param source - Source node ID.
+ * @param target - Target node ID.
+ * @param expr - Condition expression evaluated against GraphState.
+ * @returns A conditional GraphEdge.
+ */
+function conditionalEdge(source, target, expr) {
+    return {
+        id: nextEdgeId(),
+        source,
+        target,
+        type: 'conditional',
+        condition: { type: 'expression', expr },
+    };
+}
+// ---------------------------------------------------------------------------
+// Strategy compilers
+// ---------------------------------------------------------------------------
+/**
+ * Compiles a sequential strategy into a linear chain of GMI nodes.
+ *
+ * Topology: START -> agent_0 -> agent_1 -> ... -> agent_N -> END
+ *
+ * Each agent reads the previous agent's output from scratch and writes
+ * its own output. The final agent's output becomes the graph's artifact.
+ *
+ * @param agents - Named roster of agent configs or pre-built Agent instances.
+ * @param config - Agency-level configuration.
+ * @param prompt - The user's input prompt.
+ * @returns The compiled graph components (nodes, edges, reducers).
+ */
+function compileSequentialGraph(agents, config, prompt) {
+    const entries = Object.entries(agents);
+    const nodes = [];
+    const edges = [];
+    for (let i = 0; i < entries.length; i++) {
+        const [name, agentOrConfig] = entries[i];
+        const nodeId = `agent_${name}`;
+        const instructions = extractInstructions(agentOrConfig, name);
+        // Each agent reads from the previous agent's output scratch key.
+        // The first agent reads from the prompt (injected as scratch.prompt).
+        const readKeys = i === 0
+            ? ['prompt']
+            : [`output_${entries[i - 1][0]}`];
+        const writeKey = `output_${name}`;
+        nodes.push(makeAgentNode(nodeId, name, instructions, readKeys, writeKey));
+        // Wire edges: START -> first node, or previous node -> this node.
+        if (i === 0) {
+            edges.push(staticEdge(START, nodeId));
+        }
+        else {
+            edges.push(staticEdge(`agent_${entries[i - 1][0]}`, nodeId));
+        }
+    }
+    // Last node -> END
+    if (entries.length > 0) {
+        edges.push(staticEdge(`agent_${entries[entries.length - 1][0]}`, END));
+    }
+    // Use 'last' reducer for output keys so each agent overwrites cleanly.
+    const reducers = {};
+    for (const [name] of entries) {
+        reducers[`scratch.output_${name}`] = 'last';
+    }
+    return { nodes, edges, reducers };
+}
+/**
+ * Compiles a parallel strategy into a fan-out/fan-in graph.
+ *
+ * Topology: START -> [agent_0, agent_1, ...] -> synthesizer -> END
+ *
+ * All agent nodes connect from START (running in parallel via GraphRuntime).
+ * A synthesizer node connects from all agents to produce a merged result.
+ *
+ * @param agents - Named roster of agent configs or pre-built Agent instances.
+ * @param config - Agency-level configuration.
+ * @param prompt - The user's input prompt.
+ * @returns The compiled graph components.
+ */
+function compileParallelGraph(agents, config, prompt) {
+    const entries = Object.entries(agents);
+    const nodes = [];
+    const edges = [];
+    const outputKeys = [];
+    // Fan-out: each agent node connects directly from START.
+    for (const [name, agentOrConfig] of entries) {
+        const nodeId = `agent_${name}`;
+        const instructions = extractInstructions(agentOrConfig, name);
+        const writeKey = `output_${name}`;
+        outputKeys.push(writeKey);
+        nodes.push(makeAgentNode(nodeId, name, instructions, ['prompt'], writeKey));
+        edges.push(staticEdge(START, nodeId));
+    }
+    // Fan-in: synthesizer reads all agent outputs and produces finalOutput.
+    const synthId = 'synthesizer';
+    nodes.push(makeSynthesizerNode(synthId, outputKeys, config.instructions));
+    // All agents feed into the synthesizer.
+    for (const [name] of entries) {
+        edges.push(staticEdge(`agent_${name}`, synthId));
+    }
+    edges.push(staticEdge(synthId, END));
+    // Reducers: each output key uses 'last', outputs collection uses 'concat'
+    // so parallel branches can write independently without conflict.
+    const reducers = {};
+    for (const [name] of entries) {
+        reducers[`scratch.output_${name}`] = 'last';
+    }
+    reducers['scratch.agentOutputs'] = 'concat';
+    return { nodes, edges, reducers };
+}
+/**
+ * Compiles a debate strategy into a round-based graph.
+ *
+ * Topology: For R rounds and N agents:
+ *   START -> agent_0_r0 -> agent_1_r0 -> ... -> agent_0_r1 -> ... -> synthesizer -> END
+ *
+ * Each round, agents see all prior arguments. The debate history
+ * accumulates in scratch.debateHistory via a 'concat' reducer.
+ *
+ * @param agents - Named roster of agent configs or pre-built Agent instances.
+ * @param config - Agency-level configuration.
+ * @param prompt - The user's input prompt.
+ * @returns The compiled graph components.
+ */
+function compileDebateGraph(agents, config, prompt) {
+    const entries = Object.entries(agents);
+    const maxRounds = config.maxRounds ?? 3;
+    const nodes = [];
+    const edges = [];
+    let previousNodeId = null;
+    // Create nodes for each agent in each round, chained sequentially.
+    // Within each round, every agent sees the full debate history.
+    for (let round = 0; round < maxRounds; round++) {
+        for (let i = 0; i < entries.length; i++) {
+            const [name, agentOrConfig] = entries[i];
+            const nodeId = `agent_${name}_r${round}`;
+            const instructions = extractInstructions(agentOrConfig, name);
+            const node = {
+                id: nodeId,
+                type: 'gmi',
+                executorConfig: {
+                    type: 'gmi',
+                    instructions: `You are agent "${name}" in round ${round + 1}/${maxRounds} of a debate. ` +
+                        `${instructions}\n\n` +
+                        `Read scratch.debateHistory for all prior arguments. ` +
+                        `Present your perspective, then write your argument to scratch.debateHistory (it will be appended via concat reducer). ` +
+                        `Also write your argument to scratch.latestArgument.`,
+                },
+                executionMode: 'single_turn',
+                effectClass: 'pure',
+                checkpoint: 'none',
+            };
+            nodes.push(node);
+            // Wire edge from previous node or START.
+            if (previousNodeId === null) {
+                edges.push(staticEdge(START, nodeId));
+            }
+            else {
+                edges.push(staticEdge(previousNodeId, nodeId));
+            }
+            previousNodeId = nodeId;
+        }
+    }
+    // Synthesizer reads the full debate history and produces a final answer.
+    const synthId = 'synthesizer';
+    nodes.push(makeSynthesizerNode(synthId, ['debateHistory'], config.instructions));
+    if (previousNodeId) {
+        edges.push(staticEdge(previousNodeId, synthId));
+    }
+    edges.push(staticEdge(synthId, END));
+    // Debate history accumulates via concat; latest argument is last-write-wins.
+    const reducers = {
+        'scratch.debateHistory': 'concat',
+        'scratch.latestArgument': 'last',
+    };
+    return { nodes, edges, reducers };
+}
+/**
+ * Compiles a review-loop strategy with a conditional back-edge.
+ *
+ * Topology:
+ *   START -> producer -> reviewer -> (conditional)
+ *     approved=true  -> END
+ *     approved=false -> producer (back to revision, up to maxRounds)
+ *
+ * A router node after the reviewer checks scratch.reviewApproved.
+ * If not approved and rounds remain, execution loops back to the producer.
+ * A round counter in scratch prevents infinite loops.
+ *
+ * @param agents - Named roster; first agent = producer, second = reviewer.
+ * @param config - Agency-level configuration.
+ * @param prompt - The user's input prompt.
+ * @returns The compiled graph components.
+ */
+function compileReviewLoopGraph(agents, config, prompt) {
+    const entries = Object.entries(agents);
+    const maxRounds = config.maxRounds ?? 3;
+    const [producerName, producerConfig] = entries[0];
+    const [reviewerName, reviewerConfig] = entries[1];
+    const producerId = `agent_${producerName}`;
+    const reviewerId = `agent_${reviewerName}`;
+    const routerId = 'review_router';
+    const producerInstructions = extractInstructions(producerConfig, producerName);
+    const reviewerInstructions = extractInstructions(reviewerConfig, reviewerName);
+    const nodes = [
+        // Producer: reads prompt + any reviewer feedback from scratch.
+        {
+            id: producerId,
+            type: 'gmi',
+            executorConfig: {
+                type: 'gmi',
+                instructions: `You are the producer agent "${producerName}". ${producerInstructions}\n\n` +
+                    `Read scratch.prompt for the task. If scratch.reviewFeedback exists, incorporate that feedback to revise your work. ` +
+                    `Write your draft to scratch.draft.`,
+            },
+            executionMode: 'single_turn',
+            effectClass: 'pure',
+            checkpoint: 'after',
+        },
+        // Reviewer: reads the draft and decides approval.
+        {
+            id: reviewerId,
+            type: 'gmi',
+            executorConfig: {
+                type: 'gmi',
+                instructions: `You are the reviewer agent "${reviewerName}". ${reviewerInstructions}\n\n` +
+                    `Read scratch.draft for the current work. ` +
+                    `Evaluate it and respond with JSON: { "approved": true/false, "feedback": "..." }. ` +
+                    `Write the approval boolean to scratch.reviewApproved and your feedback to scratch.reviewFeedback. ` +
+                    `Also increment scratch.reviewRound by 1.`,
+            },
+            executionMode: 'single_turn',
+            effectClass: 'pure',
+            checkpoint: 'after',
+        },
+        // Router: checks approval status and round count.
+        // Routes to END if approved or rounds exhausted, back to producer otherwise.
+        {
+            id: routerId,
+            type: 'router',
+            executorConfig: {
+                type: 'router',
+                condition: {
+                    type: 'function',
+                    fn: (state) => {
+                        const scratch = state.scratch;
+                        const approved = scratch.reviewApproved === true;
+                        const round = scratch.reviewRound ?? 0;
+                        // Terminate if approved or max rounds exhausted.
+                        if (approved || round >= maxRounds) {
+                            return END;
+                        }
+                        // Loop back to producer for revision.
+                        return producerId;
+                    },
+                    description: `Route to END if approved or ${maxRounds} rounds exhausted, otherwise back to producer`,
+                },
+            },
+            executionMode: 'single_turn',
+            effectClass: 'pure',
+            checkpoint: 'none',
+        },
+    ];
+    const edges = [
+        staticEdge(START, producerId),
+        staticEdge(producerId, reviewerId),
+        staticEdge(reviewerId, routerId),
+        // Conditional edges from the router.
+        conditionalEdge(routerId, END, `state.scratch.reviewApproved === true || (state.scratch.reviewRound ?? 0) >= ${maxRounds}`),
+        conditionalEdge(routerId, producerId, `state.scratch.reviewApproved !== true && (state.scratch.reviewRound ?? 0) < ${maxRounds}`),
+    ];
+    const reducers = {
+        'scratch.draft': 'last',
+        'scratch.reviewApproved': 'last',
+        'scratch.reviewFeedback': 'last',
+        'scratch.reviewRound': 'sum',
+    };
+    return { nodes, edges, reducers };
+}
+/**
+ * Compiles a hierarchical strategy where a manager node delegates via tool calls.
+ *
+ * Topology: START -> manager -> END
+ *
+ * The manager is a GMI node with instructions that describe the team roster.
+ * Sub-agent delegation happens via the manager's tool-calling capability --
+ * each sub-agent is described in the manager's instructions as a delegate.
+ * Actual tool wiring happens at runtime via the NodeExecutor's providerCall.
+ *
+ * @param agents - Named roster of agent configs or pre-built Agent instances.
+ * @param config - Agency-level configuration.
+ * @param prompt - The user's input prompt.
+ * @returns The compiled graph components.
+ */
+function compileHierarchicalGraph(agents, config, prompt) {
+    const entries = Object.entries(agents);
+    // Build the team roster for the manager's system prompt.
+    const teamRoster = entries
+        .map(([name, agentOrConfig]) => {
+        const desc = extractInstructions(agentOrConfig, name);
+        return `- delegate_to_${name}: ${desc}`;
+    })
+        .join('\n');
+    const managerInstructions = `You are a manager agent. Your task is to accomplish the user's goal by delegating subtasks to your team members.\n\n` +
+        `Available team members (use tool calls to delegate):\n${teamRoster}\n\n` +
+        `Synthesize their outputs into a final answer. ` +
+        `Write the final answer to scratch.finalOutput.` +
+        (config.instructions ? `\n\n${config.instructions}` : '');
+    const managerId = 'manager';
+    const nodes = [
+        {
+            id: managerId,
+            type: 'gmi',
+            executorConfig: {
+                type: 'gmi',
+                instructions: managerInstructions,
+                // Higher iteration budget since the manager needs to make
+                // multiple tool calls for delegation.
+                maxInternalIterations: config.maxSteps ?? 10,
+            },
+            executionMode: 'react_bounded',
+            effectClass: 'pure',
+            checkpoint: 'after',
+        },
+    ];
+    const edges = [
+        staticEdge(START, managerId),
+        staticEdge(managerId, END),
+    ];
+    const reducers = {
+        'scratch.finalOutput': 'last',
+    };
+    return { nodes, edges, reducers };
+}
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Compiles an agency configuration into a CompiledExecutionGraph
+ * that can be executed by GraphRuntime.
+ *
+ * Each sub-agent becomes a GMI node in the graph. The strategy
+ * determines how nodes are connected:
+ * - sequential: A -> B -> C -> END
+ * - parallel: START -> [A, B, C] -> synthesize -> END
+ * - debate: round-based sequential chain -> synthesize -> END
+ * - review-loop: produce -> review -> (conditional) produce/END
+ * - hierarchical: manager GMI node -> END (delegation via tool calls)
+ *
+ * The compiled graph carries:
+ * - Proper state reducers for scratch field merging
+ * - Checkpoint policy for mid-run persistence
+ * - Schema declarations for input/scratch/artifacts
+ *
+ * @param config - The full AgencyOptions with agents, strategy, and settings.
+ * @param prompt - The user's input prompt to inject into the graph's initial state.
+ * @returns A CompiledExecutionGraph ready for GraphRuntime.invoke() or .stream().
+ *
+ * @example
+ * ```ts
+ * const graph = compileAgencyToGraph(agencyConfig, 'Summarise AI research.');
+ * const runtime = new GraphRuntime({ checkpointStore, nodeExecutor });
+ * const result = await runtime.invoke(graph, { prompt: 'Summarise AI research.' });
+ * ```
+ */
+export function compileAgencyToGraph(config, prompt) {
+    resetEdgeCounter();
+    const strategy = config.strategy ?? 'sequential';
+    const agents = config.agents;
+    let compiled;
+    switch (strategy) {
+        case 'sequential':
+            compiled = compileSequentialGraph(agents, config, prompt);
+            break;
+        case 'parallel':
+            compiled = compileParallelGraph(agents, config, prompt);
+            break;
+        case 'debate':
+            compiled = compileDebateGraph(agents, config, prompt);
+            break;
+        case 'review-loop':
+            compiled = compileReviewLoopGraph(agents, config, prompt);
+            break;
+        case 'hierarchical':
+            compiled = compileHierarchicalGraph(agents, config, prompt);
+            break;
+        case 'graph':
+            // The 'graph' strategy already uses DAG semantics in its own compiler.
+            // Delegate to the sequential compiler as a baseline; the agentGraphBuilder
+            // provides the full DAG experience for 'graph' strategy users.
+            compiled = compileSequentialGraph(agents, config, prompt);
+            break;
+        default:
+            throw new Error(`Cannot compile strategy "${strategy}" to graph IR`);
+    }
+    return {
+        id: `agency-${strategy}-${crypto.randomUUID().slice(0, 8)}`,
+        name: `Agency (${strategy})`,
+        nodes: compiled.nodes,
+        edges: compiled.edges,
+        stateSchema: {
+            input: { type: 'object', properties: { prompt: { type: 'string' } } },
+            scratch: { type: 'object' },
+            artifacts: { type: 'object' },
+        },
+        reducers: compiled.reducers,
+        // Persist after each node so interrupted runs can be resumed.
+        checkpointPolicy: 'explicit',
+        memoryConsistency: 'live',
+    };
+}
+/**
+ * Maps the final GraphState from a GraphRuntime run back to the shape
+ * expected by the agency API's GenerateTextResult.
+ *
+ * Extracts the final text output from artifacts/scratch and constructs
+ * the agentCalls array from the graph's diagnostic node timings.
+ *
+ * @param finalOutput - The artifacts payload returned by GraphRuntime.invoke().
+ * @param config - The original agency configuration (used for metadata).
+ * @returns An object compatible with the agency execute() return shape.
+ */
+export function mapGraphResultToAgencyResult(finalOutput, config) {
+    const output = finalOutput;
+    // Extract text from various possible locations in the output.
+    const text = output?.finalOutput ??
+        output?.draft ??
+        output?.text ??
+        '';
+    return {
+        text,
+        agentCalls: [],
+        usage: { promptTokens: 0, completionTokens: 0, totalTokens: 0 },
+    };
+}
+/**
+ * Maps a GraphEvent from the runtime's stream into an AgencyStreamPart.
+ *
+ * Translates the lower-level graph events (node_start, node_end, text_delta)
+ * into the agency-level event vocabulary (agent-start, agent-end, text).
+ *
+ * @param event - A GraphEvent from GraphRuntime.stream().
+ * @param config - The original agency configuration (used for metadata).
+ * @returns An AgencyStreamPart, or null if the event has no agency-level equivalent.
+ */
+export function mapGraphEventToAgencyEvent(event, config) {
+    switch (event.type) {
+        case 'node_start':
+            return {
+                type: 'agent-start',
+                agent: event.nodeId,
+                input: '',
+            };
+        case 'node_end':
+            return {
+                type: 'agent-end',
+                agent: event.nodeId,
+                output: event.output ?? '',
+                durationMs: event.durationMs ?? 0,
+            };
+        case 'text_delta':
+            return {
+                type: 'text',
+                text: event.content,
+                agent: event.nodeId,
+            };
+        case 'run_end':
+            return {
+                type: 'agent-end',
+                agent: '__agency__',
+                output: '',
+                durationMs: event.totalDurationMs ?? 0,
+            };
+        default:
+            // Many graph events (checkpoint_saved, edge_transition) have no
+            // agency-level equivalent -- silently ignore them.
+            return null;
+    }
+}
+//# sourceMappingURL=graphCompiler.js.map

package/dist/api/strategies/graphCompiler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphCompiler.js","sourceRoot":"","sources":["../../../src/api/strategies/graphCompiler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAQH,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,iCAAiC,CAAC;AAM7D,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEtC,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E,sFAAsF;AACtF,IAAI,WAAW,GAAG,CAAC,CAAC;AAEpB;;;;;GAKG;AACH,SAAS,UAAU;IACjB,OAAO,QAAQ,WAAW,EAAE,EAAE,CAAC;AACjC,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB;IACvB,WAAW,GAAG,CAAC,CAAC;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,mBAAmB,CAC1B,aAAsC,EACtC,IAAY;IAEZ,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;QAC5B,OAAQ,aAAiC,CAAC,YAAY,IAAI,UAAU,IAAI,GAAG,CAAC;IAC9E,CAAC;IACD,OAAO,UAAU,IAAI,GAAG,CAAC;AAC3B,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,aAAa,CACpB,MAAc,EACd,SAAiB,EACjB,YAAoB,EACpB,eAAyB,EACzB,eAAuB;IAEvB,sEAAsE;IACtE,gDAAgD;IAChD,MAAM,YAAY,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC;QAC7C,CAAC,CAAC,oDAAoD,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;QACnF,CAAC,CAAC,EAAE,CAAC;IAEP,OAAO;QACL,EAAE,EAAE,MAAM;QACV,IAAI,EAAE,KAAK;QACX,cAAc,EAAE;YACd,IAAI,EAAE,KAAK;YACX,YAAY,EAAE,kBAAkB,SAAS,MAAM,YAAY,GAAG,YAAY,yCAAyC,eAAe,IAAI;SACvI;QACD,aAAa,EAAE,aAAa;QAC5B,oEAAoE;QACpE,qEAAqE;QACrE,WAAW,EAAE,MAAM;QACnB,UAAU,EAAE,OAAO;KACpB,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,mBAAmB,CAC1B,MAAc,EACd,eAAyB,EACzB,kBAA2B;IAE3B,MAAM,iBAAiB,GAAG,kBAAkB;QAC1C,CAAC,CAAC,OAAO,kBAAkB,EAAE;QAC7B,CAAC,CAAC,EAAE,CAAC;IAEP,OAAO;QACL,EAAE,EAAE,MAAM;QACV,IAAI,EAAE,KAAK;QACX,cAAc,EAAE;YACd,IAAI,EAAE,KAAK;YACX,YAAY,EACV,4FAA4F,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;gBAC1H,8DAA8D;gBAC9D,uDAAuD,iBAAiB,EAAE;SAC7E;QACD,aAAa,EAAE,aAAa;QAC5B,WAAW,EAAE,MAAM;QACnB,UAAU,EAAE,OAAO;KACpB,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAS,UAAU,CAAC,MAAc,EAAE,MAAc;IAChD,OAAO;QACL,EAAE,EAAE,UAAU,EAAE;QAChB,MAAM;QACN,MAAM;QACN,IAAI,EAAE,QAAQ;KACf,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,eAAe,CACtB,MAAc,EACd,MAAc,EACd,IAAY;IAEZ,OAAO;QACL,EAAE,EAAE,UAAU,EAAE;QAChB,MAAM;QACN,MAAM;QACN,IAAI,EAAE,aAAa;QACnB,SAAS,EAAE,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE;KACxC,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,qBAAqB;AACrB,8EAA8E;AAE9E;;;;;;;;;;;;GAYG;AACH,SAAS,sBAAsB,CAC7B,MAA+C,EAC/C,MAAqB,EACrB,MAAc;IAEd,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAgB,EAAE,CAAC;IAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,IAAI,EAAE,aAAa,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,SAAS,IAAI,EAAE,CAAC;QAC/B,MAAM,YAAY,GAAG,mBAAmB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QAE9D,iEAAiE;QACjE,sEAAsE;QACtE,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC;YACtB,CAAC,CAAC,CAAC,QAAQ,CAAC;YACZ,CAAC,CAAC,CAAC,UAAU,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAEpC,MAAM,QAAQ,GAAG,UAAU,IAAI,EAAE,CAAC;QAElC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;QAE1E,kEAAkE;QAClE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;QACxC,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;IACzE,CAAC;IAED,uEAAuE;IACvE,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QAC7B,QAAQ,CAAC,kBAAkB,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC;IAC9C,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AACpC,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,oBAAoB,CAC3B,MAA+C,EAC/C,MAAqB,EACrB,MAAc;IAEd,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,yDAAyD;IACzD,KAAK,MAAM,CAAC,IAAI,EAAE,aAAa,CAAC,IAAI,OAAO,EAAE,CAAC;QAC5C,MAAM,MAAM,GAAG,SAAS,IAAI,EAAE,CAAC;QAC/B,MAAM,YAAY,GAAG,mBAAmB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,UAAU,IAAI,EAAE,CAAC;QAClC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAE1B,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC5E,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,wEAAwE;IACxE,MAAM,OAAO,GAAG,aAAa,CAAC;IAC9B,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,UAAU,EAAE,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;IAE1E,wCAAwC;IACxC,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,IAAI,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;IAErC,0EAA0E;IAC1E,iEAAiE;IACjE,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QAC7B,QAAQ,CAAC,kBAAkB,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC;IAC9C,CAAC;IACD,QAAQ,CAAC,sBAAsB,CAAC,GAAG,QAAQ,CAAC;IAE5C,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AACpC,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAS,kBAAkB,CACzB,MAA+C,EAC/C,MAAqB,EACrB,MAAc;IAEd,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;IACxC,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAgB,EAAE,CAAC;IAE9B,IAAI,cAAc,GAAkB,IAAI,CAAC;IAEzC,mEAAmE;IACnE,+DAA+D;IAC/D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,IAAI,EAAE,aAAa,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,SAAS,IAAI,KAAK,KAAK,EAAE,CAAC;YACzC,MAAM,YAAY,GAAG,mBAAmB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;YAE9D,MAAM,IAAI,GAAc;gBACtB,EAAE,EAAE,MAAM;gBACV,IAAI,EAAE,KAAK;gBACX,cAAc,EAAE;oBACd,IAAI,EAAE,KAAK;oBACX,YAAY,EACV,kBAAkB,IAAI,cAAc,KAAK,GAAG,CAAC,IAAI,SAAS,gBAAgB;wBAC1E,GAAG,YAAY,MAAM;wBACrB,sDAAsD;wBACtD,wHAAwH;wBACxH,qDAAqD;iBACxD;gBACD,aAAa,EAAE,aAAa;gBAC5B,WAAW,EAAE,MAAM;gBACnB,UAAU,EAAE,MAAM;aACnB,CAAC;YAEF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEjB,yCAAyC;YACzC,IAAI,cAAc,KAAK,IAAI,EAAE,CAAC;gBAC5B,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;YACxC,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC;YACjD,CAAC;YACD,cAAc,GAAG,MAAM,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,MAAM,OAAO,GAAG,aAAa,CAAC;IAC9B,KAAK,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;IAEjF,IAAI,cAAc,EAAE,CAAC;QACnB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC,CAAC;IAClD,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;IAErC,6EAA6E;IAC7E,MAAM,QAAQ,GAAkB;QAC9B,uBAAuB,EAAE,QAAQ;QACjC,wBAAwB,EAAE,MAAM;KACjC,CAAC;IAEF,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AACpC,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,sBAAsB,CAC7B,MAA+C,EAC/C,MAAqB,EACrB,MAAc;IAEd,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;IACxC,MAAM,CAAC,YAAY,EAAE,cAAc,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAClD,MAAM,CAAC,YAAY,EAAE,cAAc,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAElD,MAAM,UAAU,GAAG,SAAS,YAAY,EAAE,CAAC;IAC3C,MAAM,UAAU,GAAG,SAAS,YAAY,EAAE,CAAC;IAC3C,MAAM,QAAQ,GAAG,eAAe,CAAC;IAEjC,MAAM,oBAAoB,GAAG,mBAAmB,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IAC/E,MAAM,oBAAoB,GAAG,mBAAmB,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IAE/E,MAAM,KAAK,GAAgB;QACzB,+DAA+D;QAC/D;YACE,EAAE,EAAE,UAAU;YACd,IAAI,EAAE,KAAK;YACX,cAAc,EAAE;gBACd,IAAI,EAAE,KAAK;gBACX,YAAY,EACV,+BAA+B,YAAY,MAAM,oBAAoB,MAAM;oBAC3E,qHAAqH;oBACrH,oCAAoC;aACvC;YACD,aAAa,EAAE,aAAa;YAC5B,WAAW,EAAE,MAAM;YACnB,UAAU,EAAE,OAAO;SACpB;QAED,kDAAkD;QAClD;YACE,EAAE,EAAE,UAAU;YACd,IAAI,EAAE,KAAK;YACX,cAAc,EAAE;gBACd,IAAI,EAAE,KAAK;gBACX,YAAY,EACV,+BAA+B,YAAY,MAAM,oBAAoB,MAAM;oBAC3E,2CAA2C;oBAC3C,oFAAoF;oBACpF,oGAAoG;oBACpG,0CAA0C;aAC7C;YACD,aAAa,EAAE,aAAa;YAC5B,WAAW,EAAE,MAAM;YACnB,UAAU,EAAE,OAAO;SACpB;QAED,kDAAkD;QAClD,6EAA6E;QAC7E;YACE,EAAE,EAAE,QAAQ;YACZ,IAAI,EAAE,QAAQ;YACd,cAAc,EAAE;gBACd,IAAI,EAAE,QAAQ;gBACd,SAAS,EAAE;oBACT,IAAI,EAAE,UAAU;oBAChB,EAAE,EAAE,CAAC,KAAK,EAAE,EAAE;wBACZ,MAAM,OAAO,GAAG,KAAK,CAAC,OAAkC,CAAC;wBACzD,MAAM,QAAQ,GAAG,OAAO,CAAC,cAAc,KAAK,IAAI,CAAC;wBACjD,MAAM,KAAK,GAAI,OAAO,CAAC,WAAsB,IAAI,CAAC,CAAC;wBAEnD,iDAAiD;wBACjD,IAAI,QAAQ,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;4BACnC,OAAO,GAAG,CAAC;wBACb,CAAC;wBACD,sCAAsC;wBACtC,OAAO,UAAU,CAAC;oBACpB,CAAC;oBACD,WAAW,EAAE,+BAA+B,SAAS,+CAA+C;iBACrG;aACF;YACD,aAAa,EAAE,aAAa;YAC5B,WAAW,EAAE,MAAM;YACnB,UAAU,EAAE,MAAM;SACnB;KACF,CAAC;IAEF,MAAM,KAAK,GAAgB;QACzB,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC;QAC7B,UAAU,CAAC,UAAU,EAAE,UAAU,CAAC;QAClC,UAAU,CAAC,UAAU,EAAE,QAAQ,CAAC;QAChC,qCAAqC;QACrC,eAAe,CAAC,QAAQ,EAAE,GAAG,EAAE,gFAAgF,SAAS,EAAE,CAAC;QAC3H,eAAe,CAAC,QAAQ,EAAE,UAAU,EAAE,+EAA+E,SAAS,EAAE,CAAC;KAClI,CAAC;IAEF,MAAM,QAAQ,GAAkB;QAC9B,eAAe,EAAE,MAAM;QACvB,wBAAwB,EAAE,MAAM;QAChC,wBAAwB,EAAE,MAAM;QAChC,qBAAqB,EAAE,KAAK;KAC7B,CAAC;IAEF,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AACpC,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAS,wBAAwB,CAC/B,MAA+C,EAC/C,MAAqB,EACrB,MAAc;IAEd,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAEvC,yDAAyD;IACzD,MAAM,UAAU,GAAG,OAAO;SACvB,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,EAAE;QAC7B,MAAM,IAAI,GAAG,mBAAmB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QACtD,OAAO,iBAAiB,IAAI,KAAK,IAAI,EAAE,CAAC;IAC1C,CAAC,CAAC;SACD,IAAI,CAAC,IAAI,CAAC,CAAC;IAEd,MAAM,mBAAmB,GACvB,sHAAsH;QACtH,yDAAyD,UAAU,MAAM;QACzE,gDAAgD;QAChD,gDAAgD;QAChD,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAE5D,MAAM,SAAS,GAAG,SAAS,CAAC;IAE5B,MAAM,KAAK,GAAgB;QACzB;YACE,EAAE,EAAE,SAAS;YACb,IAAI,EAAE,KAAK;YACX,cAAc,EAAE;gBACd,IAAI,EAAE,KAAK;gBACX,YAAY,EAAE,mBAAmB;gBACjC,0DAA0D;gBAC1D,sCAAsC;gBACtC,qBAAqB,EAAE,MAAM,CAAC,QAAQ,IAAI,EAAE;aAC7C;YACD,aAAa,EAAE,eAAe;YAC9B,WAAW,EAAE,MAAM;YACnB,UAAU,EAAE,OAAO;SACpB;KACF,CAAC;IAEF,MAAM,KAAK,GAAgB;QACzB,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC;QAC5B,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC;KAC3B,CAAC;IAEF,MAAM,QAAQ,GAAkB;QAC9B,qBAAqB,EAAE,MAAM;KAC9B,CAAC;IAEF,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AACpC,CAAC;AAED,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAqB,EACrB,MAAc;IAEd,gBAAgB,EAAE,CAAC;IAEnB,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,YAAY,CAAC;IACjD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IAE7B,IAAI,QAA6E,CAAC;IAElF,QAAQ,QAAQ,EAAE,CAAC;QACjB,KAAK,YAAY;YACf,QAAQ,GAAG,sBAAsB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YAC1D,MAAM;QACR,KAAK,UAAU;YACb,QAAQ,GAAG,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACxD,MAAM;QACR,KAAK,QAAQ;YACX,QAAQ,GAAG,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACtD,MAAM;QACR,KAAK,aAAa;YAChB,QAAQ,GAAG,sBAAsB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YAC1D,MAAM;QACR,KAAK,cAAc;YACjB,QAAQ,GAAG,wBAAwB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YAC5D,MAAM;QACR,KAAK,OAAO;YACV,uEAAuE;YACvE,2EAA2E;YAC3E,+DAA+D;YAC/D,QAAQ,GAAG,sBAAsB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YAC1D,MAAM;QACR;YACE,MAAM,IAAI,KAAK,CAAC,4BAA4B,QAAQ,eAAe,CAAC,CAAC;IACzE,CAAC;IAED,OAAO;QACL,EAAE,EAAE,UAAU,QAAQ,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;QAC3D,IAAI,EAAE,WAAW,QAAQ,GAAG;QAC5B,KAAK,EAAE,QAAQ,CAAC,KAAK;QACrB,KAAK,EAAE,QAAQ,CAAC,KAAK;QACrB,WAAW,EAAE;YACX,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE;YACrE,OAAO,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;YAC3B,SAAS,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;SAC9B;QACD,QAAQ,EAAE,QAAQ,CAAC,QAAQ;QAC3B,8DAA8D;QAC9D,gBAAgB,EAAE,UAAU;QAC5B,iBAAiB,EAAE,MAAM;KAC1B,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,4BAA4B,CAC1C,WAAoB,EACpB,MAAqB;IAErB,MAAM,MAAM,GAAG,WAA6C,CAAC;IAE7D,8DAA8D;IAC9D,MAAM,IAAI,GACP,MAAM,EAAE,WAAsB;QAC9B,MAAM,EAAE,KAAgB;QACxB,MAAM,EAAE,IAAe;QACxB,EAAE,CAAC;IAEL,OAAO;QACL,IAAI;QACJ,UAAU,EAAE,EAAE;QACd,KAAK,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE;KAChE,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,0BAA0B,CACxC,KAA+C,EAC/C,MAAqB;IAErB,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,YAAY;YACf,OAAO;gBACL,IAAI,EAAE,aAAa;gBACnB,KAAK,EAAE,KAAK,CAAC,MAAgB;gBAC7B,KAAK,EAAE,EAAE;aACV,CAAC;QACJ,KAAK,UAAU;YACb,OAAO;gBACL,IAAI,EAAE,WAAW;gBACjB,KAAK,EAAE,KAAK,CAAC,MAAgB;gBAC7B,MAAM,EAAG,KAAK,CAAC,MAAiB,IAAI,EAAE;gBACtC,UAAU,EAAE,KAAK,CAAC,UAAU,IAAI,CAAC;aAClC,CAAC;QACJ,KAAK,YAAY;YACf,OAAO;gBACL,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,KAAK,CAAC,OAAiB;gBAC7B,KAAK,EAAE,KAAK,CAAC,MAAgB;aAC9B,CAAC;QACJ,KAAK,SAAS;YACZ,OAAO;gBACL,IAAI,EAAE,WAAW;gBACjB,KAAK,EAAE,YAAY;gBACnB,MAAM,EAAE,EAAE;gBACV,UAAU,EAAE,KAAK,CAAC,eAAe,IAAI,CAAC;aACvC,CAAC;QACJ;YACE,gEAAgE;YAChE,mDAAmD;YACnD,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC"}

package/dist/api/strategies/hierarchical.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hierarchical.d.ts","sourceRoot":"","sources":["../../../src/api/strategies/hierarchical.ts"],"names":[],"mappings":"AA8BA,OAAO,KAAK,EACV,aAAa,EACb,gBAAgB,EAChB,KAAK,EACL,eAAe,EAEhB,MAAM,aAAa,CAAC;AAqBrB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,eAAe,GAAG,KAAK,CAAC,EAC/C,YAAY,EAAE,aAAa,GAC1B,gBAAgB,CA0HlB"}
+{"version":3,"file":"hierarchical.d.ts","sourceRoot":"","sources":["../../../src/api/strategies/hierarchical.ts"],"names":[],"mappings":"AA+BA,OAAO,KAAK,EACV,aAAa,EACb,gBAAgB,EAChB,KAAK,EACL,eAAe,EAEhB,MAAM,aAAa,CAAC;AAqBrB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,eAAe,GAAG,KAAK,CAAC,EAC/C,YAAY,EAAE,aAAa,GAC1B,gBAAgB,CAqIlB"}

package/dist/api/strategies/hierarchical.js

@@ -28,6 +28,7 @@
  * @see {@link compileAdaptiveWrapper} -- wraps other strategies with a hierarchical manager.
  */
 import { agent as createAgent } from '../agent.js';
+import { mergeAdaptableTools } from '../toolAdapter.js';
 import { AgencyConfigError } from '../types.js';
 import { isAgent, resolveAgent, checkBeforeAgent } from './shared.js';
 /**
@@ -143,7 +144,7 @@ export function compileHierarchical(agents, agencyConfig) {
                 (agencyConfig.instructions ? `\n\n${agencyConfig.instructions}` : '');
             // Merge agency-level tools with the delegation tools. Agency tools
             // (e.g. shared search, calculator) are available alongside delegation.
-            const mergedTools = { ...(agencyConfig.tools ?? {}), ...agentTools };
+            const mergedTools = mergeAdaptableTools(agencyConfig.tools, agentTools);
             const manager = createAgent({
                 model: agencyConfig.model,
                 provider: agencyConfig.provider,