@illuma-ai/agents 1.5.1 → 2.1.1

package/dist/cjs/graphs/MultiAgentGraph.cjs

@@ -830,7 +830,7 @@ class MultiAgentGraph extends Graph.StandardGraph {
         }
         /**
          * Add approval-gate nodes for sequence edges that declare an approvalGate
-         * config (consumer extension, not part of the standard interface). Gates fire
+         * config (Ranger-only feature, not present upstream). Gates fire
          * regardless of ExecutionContext and sit between source and destination.
          */
         const gatedEdges = new Set();

package/dist/cjs/graphs/MultiAgentGraph.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"MultiAgentGraph.cjs","sources":["../../../src/graphs/MultiAgentGraph.ts"],"sourcesContent":["import { tool } from '@langchain/core/tools';\nimport { PromptTemplate } from '@langchain/core/prompts';\nimport {\n  AIMessage,\n  ToolMessage,\n  HumanMessage,\n  getBufferString,\n} from '@langchain/core/messages';\nimport {\n  END,\n  START,\n  Command,\n  StateGraph,\n  Annotation,\n  getCurrentTaskInput,\n  messagesStateReducer,\n} from '@langchain/langgraph';\nimport type { LangGraphRunnableConfig } from '@langchain/langgraph';\nimport type { BaseMessage, AIMessageChunk } from '@langchain/core/messages';\nimport type { ToolRunnableConfig } from '@langchain/core/tools';\nimport type * as t from '@/types';\nimport { StandardGraph } from './Graph';\nimport { Constants, EdgeType } from '@/common';\nimport {\n  createApprovalGateNode,\n  getApprovalGateNodeId,\n} from '@/nodes/ApprovalGateNode';\n\n/** Pattern to extract instructions from transfer ToolMessage content */\nconst HANDOFF_INSTRUCTIONS_PATTERN = /(?:Instructions?|Context):\\s*(.+)/is;\n\n/**\n * MultiAgentGraph extends StandardGraph to support dynamic multi-agent workflows\n * with handoffs, fan-in/fan-out, and other composable patterns.\n *\n * Key behavior:\n * - Agents with ONLY handoff edges: Can dynamically route to any handoff destination\n * - Agents with ONLY direct edges: Always follow their direct edges\n * - Agents with BOTH: Use Command for exclusive routing (handoff OR direct, not both)\n *   - If handoff occurs: Only the handoff destination executes\n *   - If no handoff: Direct edges execute (potentially in parallel)\n *\n * This enables the common pattern where an agent either delegates (handoff)\n * OR continues its workflow (direct edges), but not both simultaneously.\n */\nexport class MultiAgentGraph extends StandardGraph {\n  private edges: t.GraphEdge[];\n  private startingNodes: Set<string> = new Set();\n  private directEdges: t.GraphEdge[] = [];\n  private handoffEdges: t.GraphEdge[] = [];\n  /**\n   * Map of agentId to parallel group info.\n   * Contains groupId (incrementing number reflecting execution order) for agents in parallel groups.\n   * Sequential agents (not in any parallel group) have undefined entry.\n   *\n   * Example for: researcher -> [analyst1, analyst2, analyst3] -> summarizer\n   * - researcher: undefined (sequential, order 0)\n   * - analyst1, analyst2, analyst3: { groupId: 1 } (parallel group, order 1)\n   * - summarizer: undefined (sequential, order 2)\n   */\n  private agentParallelGroups: Map<string, number> = new Map();\n\n  constructor(input: t.MultiAgentGraphInput) {\n    super(input);\n    this.edges = input.edges;\n    this.validateEdgeAgents();\n    this.categorizeEdges();\n    this.analyzeGraph();\n    this.createHandoffTools();\n  }\n\n  /**\n   * Fails fast when an edge references an agent that is not in\n   * `agentContexts`. Without this check, the underlying LangGraph\n   * `StateGraph.compile()` would throw the opaque\n   * `Found edge ending at unknown node \"<id>\"` error after graph\n   * construction — far from the true root cause.\n   *\n   * This catches the common misuse of passing `edges` into a multi-agent\n   * config without also passing the corresponding sub-agent configs in\n   * `agents` (e.g. a host that forgot to pre-load handoff targets).\n   */\n  private validateEdgeAgents(): void {\n    const known = new Set(this.agentContexts.keys());\n    const unknown = new Set<string>();\n    for (const edge of this.edges) {\n      const participants = [\n        ...(Array.isArray(edge.from) ? edge.from : [edge.from]),\n        ...(Array.isArray(edge.to) ? edge.to : [edge.to]),\n      ];\n      for (const id of participants) {\n        if (typeof id === 'string' && !known.has(id)) {\n          unknown.add(id);\n        }\n      }\n    }\n    if (unknown.size === 0) {\n      return;\n    }\n    const missing = Array.from(unknown)\n      .map((id) => `\"${id}\"`)\n      .join(', ');\n    throw new Error(\n      `MultiAgentGraph: edges reference agent(s) not present in agents: [${missing}]. ` +\n        'Ensure every agent referenced by an edge is also included in the `agents` array, ' +\n        'or filter orphaned edges before constructing the graph.'\n    );\n  }\n\n  /**\n   * Categorize edges into handoff and direct types\n   */\n  private categorizeEdges(): void {\n    for (const edge of this.edges) {\n      // Default behavior: edges with conditions or explicit 'handoff' type are handoff edges\n      // Edges with explicit 'direct' type or multi-destination without conditions are direct edges\n      if (edge.edgeType === EdgeType.DIRECT) {\n        this.directEdges.push(edge);\n      } else if (edge.edgeType === EdgeType.HANDOFF || edge.condition != null) {\n        this.handoffEdges.push(edge);\n      } else {\n        // Default: single-to-single edges are handoff, single-to-multiple are direct\n        const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n        const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n\n        if (sources.length === 1 && destinations.length > 1) {\n          // Fan-out pattern defaults to direct\n          this.directEdges.push(edge);\n        } else {\n          // Everything else defaults to handoff\n          this.handoffEdges.push(edge);\n        }\n      }\n    }\n  }\n\n  /**\n   * Analyze graph structure to determine starting nodes and connections\n   */\n  private analyzeGraph(): void {\n    const hasIncomingEdge = new Set<string>();\n\n    // Track all nodes that have incoming edges\n    for (const edge of this.edges) {\n      const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n      destinations.forEach((dest) => hasIncomingEdge.add(dest));\n    }\n\n    // Starting nodes are those without incoming edges\n    for (const agentId of this.agentContexts.keys()) {\n      if (!hasIncomingEdge.has(agentId)) {\n        this.startingNodes.add(agentId);\n      }\n    }\n\n    // If no starting nodes found, use the first agent\n    if (this.startingNodes.size === 0 && this.agentContexts.size > 0) {\n      this.startingNodes.add(this.agentContexts.keys().next().value!);\n    }\n\n    // Determine if graph has parallel execution capability\n    this.computeParallelCapability();\n  }\n\n  /**\n   * Compute parallel groups by traversing the graph in execution order.\n   * Assigns incrementing group IDs that reflect the sequential order of execution.\n   *\n   * For: researcher -> [analyst1, analyst2, analyst3] -> summarizer\n   * - researcher: no group (first sequential node)\n   * - analyst1, analyst2, analyst3: groupId 1 (first parallel group)\n   * - summarizer: no group (next sequential node)\n   *\n   * This allows frontend to render in order:\n   * Row 0: researcher\n   * Row 1: [analyst1, analyst2, analyst3] (grouped)\n   * Row 2: summarizer\n   */\n  private computeParallelCapability(): void {\n    let groupCounter = 1; // Start at 1, 0 reserved for \"no group\"\n\n    // Check 1: Multiple starting nodes means parallel from the start (group 1)\n    if (this.startingNodes.size > 1) {\n      for (const agentId of this.startingNodes) {\n        this.agentParallelGroups.set(agentId, groupCounter);\n      }\n      groupCounter++;\n    }\n\n    // Check 2: Traverse direct edges in order to find fan-out patterns\n    // Build a simple execution order by following edges from starting nodes\n    const visited = new Set<string>();\n    const queue: string[] = [...this.startingNodes];\n\n    while (queue.length > 0) {\n      const current = queue.shift()!;\n      if (visited.has(current)) continue;\n      visited.add(current);\n\n      // Find direct edges from this node\n      for (const edge of this.directEdges) {\n        const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n        if (!sources.includes(current)) continue;\n\n        const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n\n        // Fan-out: multiple destinations = parallel group\n        if (destinations.length > 1) {\n          for (const dest of destinations) {\n            // Only set if not already in a group (first group wins)\n            if (!this.agentParallelGroups.has(dest)) {\n              this.agentParallelGroups.set(dest, groupCounter);\n            }\n            if (!visited.has(dest)) {\n              queue.push(dest);\n            }\n          }\n          groupCounter++;\n        } else {\n          // Single destination - add to queue for traversal\n          for (const dest of destinations) {\n            if (!visited.has(dest)) {\n              queue.push(dest);\n            }\n          }\n        }\n      }\n\n      // Also follow handoff edges for traversal (but they don't create parallel groups)\n      for (const edge of this.handoffEdges) {\n        const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n        if (!sources.includes(current)) continue;\n\n        const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n        for (const dest of destinations) {\n          if (!visited.has(dest)) {\n            queue.push(dest);\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Get the parallel group ID for an agent, if any.\n   * Returns undefined if the agent is not part of a parallel group.\n   * Group IDs are incrementing numbers reflecting execution order.\n   */\n  getParallelGroupId(agentId: string): number | undefined {\n    return this.agentParallelGroups.get(agentId);\n  }\n\n  /**\n   * Override to indicate this is a multi-agent graph.\n   * Enables agentId to be included in RunStep for frontend agent labeling.\n   */\n  protected override isMultiAgentGraph(): boolean {\n    return true;\n  }\n\n  /**\n   * Override base class method to provide parallel group IDs for run steps.\n   */\n  protected override getParallelGroupIdForAgent(\n    agentId: string\n  ): number | undefined {\n    return this.agentParallelGroups.get(agentId);\n  }\n\n  /**\n   * Create handoff tools for agents based on handoff edges only\n   */\n  private createHandoffTools(): void {\n    // Group handoff edges by source agent(s)\n    const handoffsByAgent = new Map<string, t.GraphEdge[]>();\n\n    // Only process handoff edges for tool creation\n    for (const edge of this.handoffEdges) {\n      const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n      sources.forEach((source) => {\n        if (!handoffsByAgent.has(source)) {\n          handoffsByAgent.set(source, []);\n        }\n        handoffsByAgent.get(source)!.push(edge);\n      });\n    }\n\n    // Create handoff tools for each agent\n    for (const [agentId, edges] of handoffsByAgent) {\n      const agentContext = this.agentContexts.get(agentId);\n      if (!agentContext) continue;\n\n      // Create handoff tools for this agent's outgoing edges\n      const handoffTools: t.GenericTool[] = [];\n      const sourceAgentName = agentContext.name ?? agentId;\n      for (const edge of edges) {\n        handoffTools.push(\n          ...this.createHandoffToolsForEdge(edge, agentId, sourceAgentName)\n        );\n      }\n\n      if (!agentContext.graphTools) {\n        agentContext.graphTools = [];\n      }\n      agentContext.graphTools.push(...handoffTools);\n    }\n  }\n\n  /**\n   * Create handoff tools for an edge (handles multiple destinations)\n   * @param edge - The graph edge defining the handoff\n   * @param sourceAgentId - The ID of the agent that will perform the handoff\n   * @param sourceAgentName - The human-readable name of the source agent\n   */\n  private createHandoffToolsForEdge(\n    edge: t.GraphEdge,\n    sourceAgentId: string,\n    sourceAgentName: string\n  ): t.GenericTool[] {\n    const tools: t.GenericTool[] = [];\n    const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n\n    /** If there's a condition, create a single conditional handoff tool */\n    if (edge.condition != null) {\n      const toolName = 'conditional_transfer';\n      const toolDescription =\n        edge.description ?? 'Conditionally transfer control based on state';\n\n      /** Check if we have a prompt for handoff input */\n      const hasHandoffInput =\n        edge.prompt != null && typeof edge.prompt === 'string';\n      const handoffInputDescription = hasHandoffInput ? edge.prompt : undefined;\n      const promptKey = edge.promptKey ?? 'instructions';\n\n      tools.push(\n        tool(\n          async (rawInput, config) => {\n            const input = rawInput as Record<string, unknown>;\n            const state = getCurrentTaskInput() as t.BaseGraphState;\n            const toolCallId =\n              (config as ToolRunnableConfig | undefined)?.toolCall?.id ??\n              'unknown';\n\n            /** Evaluated condition */\n            const result = edge.condition!(state);\n            let destination: string;\n\n            if (typeof result === 'boolean') {\n              /** If true, use first destination; if false, don't transfer */\n              if (!result) return null;\n              destination = destinations[0];\n            } else if (typeof result === 'string') {\n              destination = result;\n            } else {\n              /** Array of destinations - for now, use the first */\n              destination = Array.isArray(result) ? result[0] : destinations[0];\n            }\n\n            let content = `Conditionally transferred to ${destination}`;\n            if (\n              hasHandoffInput &&\n              promptKey in input &&\n              input[promptKey] != null\n            ) {\n              content += `\\n\\n${promptKey.charAt(0).toUpperCase() + promptKey.slice(1)}: ${input[promptKey]}`;\n            }\n\n            const toolMessage = new ToolMessage({\n              content,\n              name: toolName,\n              tool_call_id: toolCallId,\n              additional_kwargs: {\n                /** Store destination for programmatic access in handoff detection */\n                handoff_destination: destination,\n                /** Store source agent name for receiving agent to know who handed off */\n                handoff_source_name: sourceAgentName,\n              },\n            });\n\n            return new Command({\n              goto: destination,\n              update: { messages: state.messages.concat(toolMessage) },\n              graph: Command.PARENT,\n            });\n          },\n          {\n            name: toolName,\n            schema: hasHandoffInput\n              ? {\n                  type: 'object',\n                  properties: {\n                    [promptKey]: {\n                      type: 'string',\n                      description: handoffInputDescription as string,\n                    },\n                  },\n                  required: [],\n                }\n              : { type: 'object', properties: {}, required: [] },\n            description: toolDescription,\n          }\n        )\n      );\n    } else {\n      /** Create individual tools for each destination */\n      for (const destination of destinations) {\n        const toolName = `${Constants.LC_TRANSFER_TO_}${destination}`;\n        const toolDescription =\n          edge.description ?? `Transfer control to agent '${destination}'`;\n\n        /** Check if we have a prompt for handoff input */\n        const hasHandoffInput =\n          edge.prompt != null && typeof edge.prompt === 'string';\n        const handoffInputDescription = hasHandoffInput\n          ? edge.prompt\n          : undefined;\n        const promptKey = edge.promptKey ?? 'instructions';\n\n        tools.push(\n          tool(\n            async (rawInput, config) => {\n              const input = rawInput as Record<string, unknown>;\n              const toolCallId =\n                (config as ToolRunnableConfig | undefined)?.toolCall?.id ??\n                'unknown';\n\n              let content = `Successfully transferred to ${destination}`;\n              if (\n                hasHandoffInput &&\n                promptKey in input &&\n                input[promptKey] != null\n              ) {\n                content += `\\n\\n${promptKey.charAt(0).toUpperCase() + promptKey.slice(1)}: ${input[promptKey]}`;\n              }\n\n              const toolMessage = new ToolMessage({\n                content,\n                name: toolName,\n                tool_call_id: toolCallId,\n                additional_kwargs: {\n                  /** Store source agent name for receiving agent to know who handed off */\n                  handoff_source_name: sourceAgentName,\n                },\n              });\n\n              const state = getCurrentTaskInput() as t.BaseGraphState;\n\n              /**\n               * For parallel handoff support:\n               * Build messages that include ONLY this tool call's context.\n               * This prevents errors when LLM calls multiple transfers simultaneously -\n               * each destination gets a valid AIMessage with matching tool_call and tool_result.\n               *\n               * Strategy:\n               * 1. Find the AIMessage containing this tool call\n               * 2. Create a filtered AIMessage with ONLY this tool_call\n               * 3. Include all messages before the AIMessage plus the filtered pair\n               */\n              const messages = state.messages;\n              let filteredMessages = messages;\n              let aiMessageIndex = -1;\n\n              /** Find the AIMessage containing this tool call */\n              for (let i = messages.length - 1; i >= 0; i--) {\n                const msg = messages[i];\n                if (msg.getType() === 'ai') {\n                  const aiMsg = msg as AIMessage;\n                  const hasThisCall = aiMsg.tool_calls?.some(\n                    (tc) => tc.id === toolCallId\n                  );\n                  if (hasThisCall === true) {\n                    aiMessageIndex = i;\n                    break;\n                  }\n                }\n              }\n\n              if (aiMessageIndex >= 0) {\n                const originalAiMsg = messages[aiMessageIndex] as AIMessage;\n                const thisToolCall = originalAiMsg.tool_calls?.find(\n                  (tc) => tc.id === toolCallId\n                );\n\n                if (\n                  thisToolCall != null &&\n                  (originalAiMsg.tool_calls?.length ?? 0) > 1\n                ) {\n                  /**\n                   * Multiple tool calls - create filtered AIMessage with ONLY this call.\n                   * This ensures valid message structure for parallel handoffs.\n                   */\n                  const filteredAiMsg = new AIMessage({\n                    content: originalAiMsg.content,\n                    tool_calls: [thisToolCall],\n                    id: originalAiMsg.id,\n                  });\n\n                  filteredMessages = [\n                    ...messages.slice(0, aiMessageIndex),\n                    filteredAiMsg,\n                    toolMessage,\n                  ];\n                } else {\n                  /** Single tool call - use messages as-is */\n                  filteredMessages = messages.concat(toolMessage);\n                }\n              } else {\n                /** Fallback - append tool message */\n                filteredMessages = messages.concat(toolMessage);\n              }\n\n              return new Command({\n                goto: destination,\n                update: { messages: filteredMessages },\n                graph: Command.PARENT,\n              });\n            },\n            {\n              name: toolName,\n              schema: hasHandoffInput\n                ? {\n                    type: 'object',\n                    properties: {\n                      [promptKey]: {\n                        type: 'string',\n                        description: handoffInputDescription as string,\n                      },\n                    },\n                    required: [],\n                  }\n                : { type: 'object', properties: {}, required: [] },\n              description: toolDescription,\n            }\n          )\n        );\n      }\n    }\n\n    return tools;\n  }\n\n  /**\n   * Create a complete agent subgraph (similar to createReactAgent)\n   */\n  private createAgentSubgraph(agentId: string): t.CompiledAgentWorfklow {\n    /** This is essentially the same as `createAgentNode` from `StandardGraph` */\n    return this.createAgentNode(agentId);\n  }\n\n  /**\n   * Detects if the current agent is receiving a handoff and processes the messages accordingly.\n   * Returns filtered messages with the transfer tool call/message removed, plus any instructions,\n   * source agent, and parallel sibling information extracted from the transfer.\n   *\n   * Supports both single handoffs (last message is the transfer) and parallel handoffs\n   * (multiple transfer ToolMessages, need to find the one targeting this agent).\n   *\n   * @param messages - Current state messages\n   * @param agentId - The agent ID to check for handoff reception\n   * @returns Object with filtered messages, extracted instructions, source agent, and parallel siblings\n   */\n  private processHandoffReception(\n    messages: BaseMessage[],\n    agentId: string\n  ): {\n    filteredMessages: BaseMessage[];\n    instructions: string | null;\n    sourceAgentName: string | null;\n    parallelSiblings: string[];\n  } | null {\n    if (messages.length === 0) return null;\n\n    /**\n     * Search for a transfer ToolMessage targeting this agent.\n     * For parallel handoffs, multiple transfer messages may exist - find ours.\n     * Search backwards from the end to find the most recent transfer to this agent.\n     */\n    let toolMessage: ToolMessage | null = null;\n    let toolMessageIndex = -1;\n\n    for (let i = messages.length - 1; i >= 0; i--) {\n      const msg = messages[i];\n      if (msg.getType() !== 'tool') continue;\n\n      const candidateMsg = msg as ToolMessage;\n      const toolName = candidateMsg.name;\n\n      if (typeof toolName !== 'string') continue;\n\n      /** Check for standard transfer pattern */\n      const isTransferMessage = toolName.startsWith(Constants.LC_TRANSFER_TO_);\n      const isConditionalTransfer = toolName === 'conditional_transfer';\n\n      if (!isTransferMessage && !isConditionalTransfer) continue;\n\n      /** Extract destination from tool name or additional_kwargs */\n      let destinationAgent: string | null = null;\n\n      if (isTransferMessage) {\n        destinationAgent = toolName.replace(Constants.LC_TRANSFER_TO_, '');\n      } else if (isConditionalTransfer) {\n        const handoffDest = candidateMsg.additional_kwargs.handoff_destination;\n        destinationAgent = typeof handoffDest === 'string' ? handoffDest : null;\n      }\n\n      /** Check if this transfer targets our agent */\n      if (destinationAgent === agentId) {\n        toolMessage = candidateMsg;\n        toolMessageIndex = i;\n        break;\n      }\n    }\n\n    /** No transfer targeting this agent found */\n    if (toolMessage === null || toolMessageIndex < 0) return null;\n\n    /** Extract instructions from the ToolMessage content */\n    const contentStr =\n      typeof toolMessage.content === 'string'\n        ? toolMessage.content\n        : JSON.stringify(toolMessage.content);\n\n    const instructionsMatch = contentStr.match(HANDOFF_INSTRUCTIONS_PATTERN);\n    const instructions = instructionsMatch?.[1]?.trim() ?? null;\n\n    /** Extract source agent name from additional_kwargs */\n    const handoffSourceName = toolMessage.additional_kwargs.handoff_source_name;\n    const sourceAgentName =\n      typeof handoffSourceName === 'string' ? handoffSourceName : null;\n\n    /** Extract parallel siblings (set by ToolNode for parallel handoffs) */\n    const rawSiblings = toolMessage.additional_kwargs.handoff_parallel_siblings;\n    const siblingIds: string[] = Array.isArray(rawSiblings)\n      ? rawSiblings.filter((s): s is string => typeof s === 'string')\n      : [];\n    /** Convert IDs to display names */\n    const parallelSiblings = siblingIds.map((id) => {\n      const ctx = this.agentContexts.get(id);\n      return ctx?.name ?? id;\n    });\n\n    /** Get the tool_call_id to find and filter the AI message's tool call */\n    const toolCallId = toolMessage.tool_call_id;\n\n    /**\n     * Collect all transfer tool_call_ids to filter out.\n     * For parallel handoffs, we filter ALL transfer messages (not just ours)\n     * to give the receiving agent a clean context without handoff noise.\n     */\n    const transferToolCallIds = new Set<string>([toolCallId]);\n    for (const msg of messages) {\n      if (msg.getType() !== 'tool') continue;\n      const tm = msg as ToolMessage;\n      const tName = tm.name;\n      if (typeof tName !== 'string') continue;\n      if (\n        tName.startsWith(Constants.LC_TRANSFER_TO_) ||\n        tName === 'conditional_transfer'\n      ) {\n        transferToolCallIds.add(tm.tool_call_id);\n      }\n    }\n\n    /** Filter out all transfer messages */\n    const filteredMessages: BaseMessage[] = [];\n\n    for (let i = 0; i < messages.length; i++) {\n      const msg = messages[i];\n      const msgType = msg.getType();\n\n      /** Skip transfer ToolMessages */\n      if (msgType === 'tool') {\n        const tm = msg as ToolMessage;\n        if (transferToolCallIds.has(tm.tool_call_id)) {\n          continue;\n        }\n      }\n\n      if (msgType === 'ai') {\n        /** Check if this AI message contains any transfer tool calls */\n        const aiMsg = msg as AIMessage | AIMessageChunk;\n        const toolCalls = aiMsg.tool_calls;\n\n        if (toolCalls && toolCalls.length > 0) {\n          /** Filter out all transfer tool calls */\n          const remainingToolCalls = toolCalls.filter(\n            (tc) => tc.id == null || !transferToolCallIds.has(tc.id)\n          );\n\n          const hasTransferCalls = remainingToolCalls.length < toolCalls.length;\n\n          if (hasTransferCalls) {\n            if (\n              remainingToolCalls.length > 0 ||\n              (typeof aiMsg.content === 'string' && aiMsg.content.trim())\n            ) {\n              /** Keep the message but without transfer tool calls */\n              const filteredAiMsg = new AIMessage({\n                content: aiMsg.content,\n                tool_calls: remainingToolCalls,\n                id: aiMsg.id,\n              });\n              filteredMessages.push(filteredAiMsg);\n            }\n            /** If no remaining content or tool calls, skip this message entirely */\n            continue;\n          }\n        }\n      }\n\n      /** Keep all other messages */\n      filteredMessages.push(msg);\n    }\n\n    return {\n      filteredMessages,\n      instructions,\n      sourceAgentName,\n      parallelSiblings,\n    };\n  }\n\n  /**\n   * Create the multi-agent workflow with dynamic handoffs\n   */\n  override createWorkflow(): t.CompiledMultiAgentWorkflow {\n    const StateAnnotation = Annotation.Root({\n      messages: Annotation<BaseMessage[]>({\n        reducer: (a, b) => {\n          if (!a.length) {\n            this.startIndex = a.length + b.length;\n          }\n          const result = messagesStateReducer(a, b);\n          this.messages = result;\n          return result;\n        },\n        default: () => [],\n      }),\n      /** Channel for passing filtered messages to agents when excludeResults is true */\n      agentMessages: Annotation<BaseMessage[]>({\n        /** Replaces state entirely */\n        reducer: (a, b) => b,\n        default: () => [],\n      }),\n    });\n\n    const builder = new StateGraph(StateAnnotation);\n\n    // Add all agents as complete subgraphs\n    for (const [agentId] of this.agentContexts) {\n      // Get all possible destinations for this agent\n      const handoffDestinations = new Set<string>();\n      const directDestinations = new Set<string>();\n\n      // Check handoff edges for destinations\n      for (const edge of this.handoffEdges) {\n        const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n        if (sources.includes(agentId) === true) {\n          const dests = Array.isArray(edge.to) ? edge.to : [edge.to];\n          dests.forEach((dest) => handoffDestinations.add(dest));\n        }\n      }\n\n      // Check direct edges for destinations\n      for (const edge of this.directEdges) {\n        const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n        if (sources.includes(agentId) === true) {\n          const dests = Array.isArray(edge.to) ? edge.to : [edge.to];\n          dests.forEach((dest) => directDestinations.add(dest));\n        }\n      }\n\n      /** Check if this agent has BOTH handoff and direct edges */\n      const hasHandoffEdges = handoffDestinations.size > 0;\n      const hasDirectEdges = directDestinations.size > 0;\n      const needsCommandRouting = hasHandoffEdges && hasDirectEdges;\n\n      /** Collect all possible destinations for this agent */\n      const allDestinations = new Set([\n        ...handoffDestinations,\n        ...directDestinations,\n      ]);\n      if (handoffDestinations.size > 0 || directDestinations.size === 0) {\n        allDestinations.add(END);\n      }\n\n      /** Agent subgraph (includes agent + tools) */\n      const agentSubgraph = this.createAgentSubgraph(agentId);\n\n      /** Wrapper function that handles agentMessages channel, handoff reception, and conditional routing */\n      const agentWrapper = async (\n        state: t.MultiAgentGraphState,\n        config?: LangGraphRunnableConfig\n      ): Promise<t.MultiAgentGraphState | Command> => {\n        let result: t.MultiAgentGraphState;\n\n        /**\n         * Check if this agent is receiving a handoff.\n         * If so, filter out the transfer messages and inject instructions as preamble.\n         * This prevents the receiving agent from seeing the transfer as \"completed work\"\n         * and prematurely producing an end token.\n         */\n        const handoffContext = this.processHandoffReception(\n          state.messages,\n          agentId\n        );\n\n        if (handoffContext !== null) {\n          const {\n            filteredMessages,\n            instructions,\n            sourceAgentName,\n            parallelSiblings,\n          } = handoffContext;\n\n          /**\n           * Set handoff context on the receiving agent.\n           * Uses pre-computed graph position for depth and parallel info.\n           */\n          const agentContext = this.agentContexts.get(agentId);\n          if (\n            agentContext &&\n            sourceAgentName != null &&\n            sourceAgentName !== ''\n          ) {\n            agentContext.setHandoffContext(sourceAgentName, parallelSiblings);\n          }\n\n          /** Build messages for the receiving agent */\n          let messagesForAgent = filteredMessages;\n\n          /**\n           * If there are instructions, inject them as a HumanMessage to\n           * ground the receiving agent.\n           *\n           * When the last filtered message is a ToolMessage (e.g. from a\n           * non-handoff tool the router called before handing off), a\n           * synthetic AIMessage is inserted first to satisfy the\n           * tool → assistant role ordering required by chat APIs.  Without\n           * this bridge, appending a HumanMessage directly after a\n           * ToolMessage causes \"400 Unexpected role 'user' after role\n           * 'tool'\" errors (see issue #54).\n           */\n          const hasInstructions = instructions !== null && instructions !== '';\n          if (hasInstructions) {\n            const lastMsg =\n              filteredMessages.length > 0\n                ? filteredMessages[filteredMessages.length - 1]\n                : null;\n\n            if (lastMsg != null && lastMsg.getType() === 'tool') {\n              messagesForAgent = [\n                ...filteredMessages,\n                new AIMessage(\n                  `[Processed tool result and transferring to ${agentId}]`\n                ),\n                new HumanMessage(instructions),\n              ];\n            } else {\n              messagesForAgent = [\n                ...filteredMessages,\n                new HumanMessage(instructions),\n              ];\n            }\n          }\n\n          /** Update token map if we have a token counter */\n          if (agentContext?.tokenCounter && hasInstructions) {\n            const freshTokenMap: Record<string, number> = {};\n            for (\n              let i = 0;\n              i < Math.min(filteredMessages.length, this.startIndex);\n              i++\n            ) {\n              const tokenCount = agentContext.indexTokenCountMap[i];\n              if (tokenCount !== undefined) {\n                freshTokenMap[i] = tokenCount;\n              }\n            }\n            /** Add tokens for the bridge AIMessage + instructions HumanMessage */\n            for (\n              let i = filteredMessages.length;\n              i < messagesForAgent.length;\n              i++\n            ) {\n              freshTokenMap[i] = agentContext.tokenCounter(messagesForAgent[i]);\n            }\n            agentContext.updateTokenMapWithInstructions(freshTokenMap);\n          }\n\n          const transformedState: t.MultiAgentGraphState = {\n            ...state,\n            messages: messagesForAgent,\n          };\n          result = await agentSubgraph.invoke(transformedState, config);\n          result = {\n            ...result,\n            agentMessages: [],\n          };\n        } else if (\n          state.agentMessages != null &&\n          state.agentMessages.length > 0\n        ) {\n          /**\n           * When using agentMessages (excludeResults=true), we need to update\n           * the token map to account for the new prompt message\n           */\n          const agentContext = this.agentContexts.get(agentId);\n          if (agentContext && agentContext.tokenCounter) {\n            /** The agentMessages contains:\n             * 1. Filtered messages (0 to startIndex) - already have token counts\n             * 2. New prompt message - needs token counting\n             */\n            const freshTokenMap: Record<string, number> = {};\n\n            /** Copy existing token counts for filtered messages (0 to startIndex) */\n            for (let i = 0; i < this.startIndex; i++) {\n              const tokenCount = agentContext.indexTokenCountMap[i];\n              if (tokenCount !== undefined) {\n                freshTokenMap[i] = tokenCount;\n              }\n            }\n\n            /** Calculate tokens only for the new prompt message (last message) */\n            const promptMessageIndex = state.agentMessages.length - 1;\n            if (promptMessageIndex >= this.startIndex) {\n              const promptMessage = state.agentMessages[promptMessageIndex];\n              freshTokenMap[promptMessageIndex] =\n                agentContext.tokenCounter(promptMessage);\n            }\n\n            /** Update the agent's token map with instructions added */\n            agentContext.updateTokenMapWithInstructions(freshTokenMap);\n          }\n\n          /** Temporary state with messages replaced by `agentMessages` */\n          const transformedState: t.MultiAgentGraphState = {\n            ...state,\n            messages: state.agentMessages,\n          };\n          result = await agentSubgraph.invoke(transformedState, config);\n          result = {\n            ...result,\n            /** Clear agentMessages for next agent */\n            agentMessages: [],\n          };\n        } else {\n          result = await agentSubgraph.invoke(state, config);\n        }\n\n        /** If agent has both handoff and direct edges, use Command for exclusive routing */\n        if (needsCommandRouting) {\n          /** Check if a handoff occurred */\n          const lastMessage = result.messages[\n            result.messages.length - 1\n          ] as BaseMessage | null;\n          if (\n            lastMessage != null &&\n            lastMessage.getType() === 'tool' &&\n            typeof lastMessage.name === 'string' &&\n            lastMessage.name.startsWith(Constants.LC_TRANSFER_TO_)\n          ) {\n            /** Handoff occurred - extract destination and navigate there exclusively */\n            const handoffDest = lastMessage.name.replace(\n              Constants.LC_TRANSFER_TO_,\n              ''\n            );\n            return new Command({\n              update: result,\n              goto: handoffDest,\n            });\n          } else {\n            /** No handoff - proceed with direct edges */\n            const directDests = Array.from(directDestinations);\n            if (directDests.length === 1) {\n              return new Command({\n                update: result,\n                goto: directDests[0],\n              });\n            } else if (directDests.length > 1) {\n              /** Multiple direct destinations - they'll run in parallel */\n              return new Command({\n                update: result,\n                goto: directDests,\n              });\n            }\n          }\n        }\n\n        /** No special routing needed - return state normally */\n        return result;\n      };\n\n      /** Wrapped agent as a node with its possible destinations */\n      builder.addNode(agentId, agentWrapper, {\n        ends: Array.from(allDestinations),\n      });\n    }\n\n    // Add starting edges for all starting nodes\n    for (const startNode of this.startingNodes) {\n      // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n      /** @ts-ignore */\n      builder.addEdge(START, startNode);\n    }\n\n    /**\n     * Add approval-gate nodes for sequence edges that declare an approvalGate\n     * config (consumer extension, not part of the standard interface). Gates fire\n     * regardless of ExecutionContext and sit between source and destination.\n     */\n    const gatedEdges = new Set<t.GraphEdge>();\n    for (const edge of this.directEdges) {\n      if (!edge.approvalGate) continue;\n\n      const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n      const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n\n      for (const source of sources) {\n        for (const dest of destinations) {\n          const gateNodeId = getApprovalGateNodeId(edge.approvalGate.gateId);\n          const gateNode = createApprovalGateNode(\n            edge.approvalGate,\n            source,\n            dest\n          );\n\n          // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n          /** @ts-ignore */\n          builder.addNode(gateNodeId, gateNode);\n          // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n          /** @ts-ignore */\n          builder.addEdge(source, gateNodeId);\n          // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n          /** @ts-ignore */\n          builder.addEdge(gateNodeId, dest);\n        }\n      }\n      gatedEdges.add(edge);\n    }\n\n    /**\n     * Add sequence edges for automatic transitions\n     * Group edges by destination to handle fan-in scenarios\n     * (Skip edges that already have an approval gate above.)\n     */\n    const edgesByDestination = new Map<string, t.GraphEdge[]>();\n\n    for (const edge of this.directEdges) {\n      if (gatedEdges.has(edge)) continue;\n      const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n      for (const destination of destinations) {\n        if (!edgesByDestination.has(destination)) {\n          edgesByDestination.set(destination, []);\n        }\n        edgesByDestination.get(destination)!.push(edge);\n      }\n    }\n\n    for (const [destination, edges] of edgesByDestination) {\n      /** Checks if this is a fan-in scenario with prompt instructions */\n      const edgesWithPrompt = edges.filter(\n        (edge) => edge.prompt != null && edge.prompt !== ''\n      );\n\n      if (edgesWithPrompt.length > 0) {\n        /**\n         * Single wrapper node for destination (Fan-in with prompt)\n         */\n        const wrapperNodeId = `fan_in_${destination}_prompt`;\n        /**\n         * First edge's `prompt`\n         * (they should all be the same for fan-in)\n         */\n        const prompt = edgesWithPrompt[0].prompt;\n        /**\n         * First edge's `excludeResults` flag\n         * (they should all be the same for fan-in)\n         */\n        const excludeResults = edgesWithPrompt[0].excludeResults;\n\n        builder.addNode(wrapperNodeId, async (state: t.BaseGraphState) => {\n          let promptText: string | undefined;\n          let effectiveExcludeResults = excludeResults;\n\n          if (typeof prompt === 'function') {\n            promptText = await prompt(state.messages, this.startIndex);\n          } else if (prompt != null) {\n            if (prompt.includes('{results}')) {\n              const resultsMessages = state.messages.slice(this.startIndex);\n              const resultsString = getBufferString(resultsMessages);\n              const promptTemplate = PromptTemplate.fromTemplate(prompt);\n              const result = await promptTemplate.invoke({\n                results: resultsString,\n              });\n              promptText = result.value;\n              effectiveExcludeResults =\n                excludeResults !== false && promptText !== '';\n            } else {\n              promptText = prompt;\n            }\n          }\n\n          if (promptText != null && promptText !== '') {\n            if (\n              effectiveExcludeResults == null ||\n              effectiveExcludeResults === false\n            ) {\n              return {\n                messages: [new HumanMessage(promptText)],\n              };\n            }\n\n            /** When `excludeResults` is true, use agentMessages channel\n             * to pass filtered messages + prompt to the destination agent\n             */\n            const filteredMessages = state.messages.slice(0, this.startIndex);\n            return {\n              messages: [new HumanMessage(promptText)],\n              agentMessages: messagesStateReducer(filteredMessages, [\n                new HumanMessage(promptText),\n              ]),\n            };\n          }\n\n          /** No prompt needed, return empty update */\n          return {};\n        });\n\n        /** Add edges from all sources to the wrapper, then wrapper to destination */\n        for (const edge of edges) {\n          const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n          for (const source of sources) {\n            // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n            /** @ts-ignore */\n            builder.addEdge(source, wrapperNodeId);\n          }\n        }\n\n        /** Single edge from wrapper to destination */\n        // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        /** @ts-ignore */\n        builder.addEdge(wrapperNodeId, destination);\n      } else {\n        /** No prompt instructions, add direct edges (skip if source uses Command routing) */\n        for (const edge of edges) {\n          const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n          for (const source of sources) {\n            /** Check if this source node has both handoff and direct edges */\n            const sourceHandoffEdges = this.handoffEdges.filter((e) => {\n              const eSources = Array.isArray(e.from) ? e.from : [e.from];\n              return eSources.includes(source);\n            });\n            const sourceDirectEdges = this.directEdges.filter((e) => {\n              const eSources = Array.isArray(e.from) ? e.from : [e.from];\n              return eSources.includes(source);\n            });\n\n            /** Skip adding edge if source uses Command routing (has both types) */\n            if (sourceHandoffEdges.length > 0 && sourceDirectEdges.length > 0) {\n              continue;\n            }\n\n            // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n            /** @ts-ignore */\n            builder.addEdge(source, destination);\n          }\n        }\n      }\n    }\n\n    return builder.compile(this.compileOptions as unknown as never);\n  }\n}\n"],"names":["StandardGraph","EdgeType","tools","tool","getCurrentTaskInput","ToolMessage","Command","Constants","messages","AIMessage","Annotation","messagesStateReducer","StateGraph","END","HumanMessage","START","getApprovalGateNodeId","createApprovalGateNode","getBufferString","PromptTemplate"],"mappings":";;;;;;;;;;;AA4BA;AACA,MAAM,4BAA4B,GAAG,qCAAqC;AAE1E;;;;;;;;;;;;;AAaG;AACG,MAAO,eAAgB,SAAQA,mBAAa,CAAA;AACxC,IAAA,KAAK;AACL,IAAA,aAAa,GAAgB,IAAI,GAAG,EAAE;IACtC,WAAW,GAAkB,EAAE;IAC/B,YAAY,GAAkB,EAAE;AACxC;;;;;;;;;AASG;AACK,IAAA,mBAAmB,GAAwB,IAAI,GAAG,EAAE;AAE5D,IAAA,WAAA,CAAY,KAA6B,EAAA;QACvC,KAAK,CAAC,KAAK,CAAC;AACZ,QAAA,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK;QACxB,IAAI,CAAC,kBAAkB,EAAE;QACzB,IAAI,CAAC,eAAe,EAAE;QACtB,IAAI,CAAC,YAAY,EAAE;QACnB,IAAI,CAAC,kBAAkB,EAAE;IAC3B;AAEA;;;;;;;;;;AAUG;IACK,kBAAkB,GAAA;AACxB,QAAA,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;AAChD,QAAA,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU;AACjC,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;AAC7B,YAAA,MAAM,YAAY,GAAG;gBACnB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAClD;AACD,YAAA,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE;AAC7B,gBAAA,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;AAC5C,oBAAA,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACjB;YACF;QACF;AACA,QAAA,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE;YACtB;QACF;AACA,QAAA,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO;aAC/B,GAAG,CAAC,CAAC,EAAE,KAAK,CAAA,CAAA,EAAI,EAAE,CAAA,CAAA,CAAG;aACrB,IAAI,CAAC,IAAI,CAAC;AACb,QAAA,MAAM,IAAI,KAAK,CACb,CAAA,kEAAA,EAAqE,OAAO,CAAA,GAAA,CAAK;YAC/E,mFAAmF;AACnF,YAAA,yDAAyD,CAC5D;IACH;AAEA;;AAEG;IACK,eAAe,GAAA;AACrB,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;;;YAG7B,IAAI,IAAI,CAAC,QAAQ,KAAKC,cAAQ,CAAC,MAAM,EAAE;AACrC,gBAAA,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;YAC7B;AAAO,iBAAA,IAAI,IAAI,CAAC,QAAQ,KAAKA,cAAQ,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,EAAE;AACvE,gBAAA,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAC9B;iBAAO;;gBAEL,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjE,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAElE,gBAAA,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;;AAEnD,oBAAA,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC7B;qBAAO;;AAEL,oBAAA,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC9B;YACF;QACF;IACF;AAEA;;AAEG;IACK,YAAY,GAAA;AAClB,QAAA,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU;;AAGzC,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;YAC7B,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AACjE,YAAA,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3D;;QAGA,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE;YAC/C,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;AACjC,gBAAA,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC;YACjC;QACF;;AAGA,QAAA,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE;AAChE,YAAA,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAM,CAAC;QACjE;;QAGA,IAAI,CAAC,yBAAyB,EAAE;IAClC;AAEA;;;;;;;;;;;;;AAaG;IACK,yBAAyB,GAAA;AAC/B,QAAA,IAAI,YAAY,GAAG,CAAC,CAAC;;QAGrB,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE;AAC/B,YAAA,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,aAAa,EAAE;gBACxC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC;YACrD;AACA,YAAA,YAAY,EAAE;QAChB;;;AAIA,QAAA,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU;QACjC,MAAM,KAAK,GAAa,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;AAE/C,QAAA,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACvB,YAAA,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG;AAC9B,YAAA,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE;AAC1B,YAAA,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;;AAGpB,YAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE;gBACnC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAClE,gBAAA,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAAE;gBAEhC,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;;AAGjE,gBAAA,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;AAC3B,oBAAA,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE;;wBAE/B,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;4BACvC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC;wBAClD;wBACA,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AACtB,4BAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;wBAClB;oBACF;AACA,oBAAA,YAAY,EAAE;gBAChB;qBAAO;;AAEL,oBAAA,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE;wBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AACtB,4BAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;wBAClB;oBACF;gBACF;YACF;;AAGA,YAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE;gBACpC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAClE,gBAAA,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAAE;gBAEhC,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AACjE,gBAAA,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE;oBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AACtB,wBAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;oBAClB;gBACF;YACF;QACF;IACF;AAEA;;;;AAIG;AACH,IAAA,kBAAkB,CAAC,OAAe,EAAA;QAChC,OAAO,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC;IAC9C;AAEA;;;AAGG;IACgB,iBAAiB,GAAA;AAClC,QAAA,OAAO,IAAI;IACb;AAEA;;AAEG;AACgB,IAAA,0BAA0B,CAC3C,OAAe,EAAA;QAEf,OAAO,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC;IAC9C;AAEA;;AAEG;IACK,kBAAkB,GAAA;;AAExB,QAAA,MAAM,eAAe,GAAG,IAAI,GAAG,EAAyB;;AAGxD,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE;YACpC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAClE,YAAA,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,KAAI;gBACzB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;AAChC,oBAAA,eAAe,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;gBACjC;gBACA,eAAe,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC;AACzC,YAAA,CAAC,CAAC;QACJ;;QAGA,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,eAAe,EAAE;YAC9C,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC;AACpD,YAAA,IAAI,CAAC,YAAY;gBAAE;;YAGnB,MAAM,YAAY,GAAoB,EAAE;AACxC,YAAA,MAAM,eAAe,GAAG,YAAY,CAAC,IAAI,IAAI,OAAO;AACpD,YAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AACxB,gBAAA,YAAY,CAAC,IAAI,CACf,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,OAAO,EAAE,eAAe,CAAC,CAClE;YACH;AAEA,YAAA,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE;AAC5B,gBAAA,YAAY,CAAC,UAAU,GAAG,EAAE;YAC9B;YACA,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC;QAC/C;IACF;AAEA;;;;;AAKG;AACK,IAAA,yBAAyB,CAC/B,IAAiB,EACjB,aAAqB,EACrB,eAAuB,EAAA;QAEvB,MAAMC,OAAK,GAAoB,EAAE;QACjC,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;;AAGjE,QAAA,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,EAAE;YAC1B,MAAM,QAAQ,GAAG,sBAAsB;AACvC,YAAA,MAAM,eAAe,GACnB,IAAI,CAAC,WAAW,IAAI,+CAA+C;;AAGrE,YAAA,MAAM,eAAe,GACnB,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ;AACxD,YAAA,MAAM,uBAAuB,GAAG,eAAe,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS;AACzE,YAAA,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,cAAc;YAElDA,OAAK,CAAC,IAAI,CACRC,UAAI,CACF,OAAO,QAAQ,EAAE,MAAM,KAAI;gBACzB,MAAM,KAAK,GAAG,QAAmC;AACjD,gBAAA,MAAM,KAAK,GAAGC,6BAAmB,EAAsB;AACvD,gBAAA,MAAM,UAAU,GACb,MAAyC,EAAE,QAAQ,EAAE,EAAE;AACxD,oBAAA,SAAS;;gBAGX,MAAM,MAAM,GAAG,IAAI,CAAC,SAAU,CAAC,KAAK,CAAC;AACrC,gBAAA,IAAI,WAAmB;AAEvB,gBAAA,IAAI,OAAO,MAAM,KAAK,SAAS,EAAE;;AAE/B,oBAAA,IAAI,CAAC,MAAM;AAAE,wBAAA,OAAO,IAAI;AACxB,oBAAA,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC;gBAC/B;AAAO,qBAAA,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;oBACrC,WAAW,GAAG,MAAM;gBACtB;qBAAO;;oBAEL,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;gBACnE;AAEA,gBAAA,IAAI,OAAO,GAAG,CAAA,6BAAA,EAAgC,WAAW,EAAE;AAC3D,gBAAA,IACE,eAAe;AACf,oBAAA,SAAS,IAAI,KAAK;AAClB,oBAAA,KAAK,CAAC,SAAS,CAAC,IAAI,IAAI,EACxB;oBACA,OAAO,IAAI,CAAA,IAAA,EAAO,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA,EAAA,EAAK,KAAK,CAAC,SAAS,CAAC,CAAA,CAAE;gBACjG;AAEA,gBAAA,MAAM,WAAW,GAAG,IAAIC,oBAAW,CAAC;oBAClC,OAAO;AACP,oBAAA,IAAI,EAAE,QAAQ;AACd,oBAAA,YAAY,EAAE,UAAU;AACxB,oBAAA,iBAAiB,EAAE;;AAEjB,wBAAA,mBAAmB,EAAE,WAAW;;AAEhC,wBAAA,mBAAmB,EAAE,eAAe;AACrC,qBAAA;AACF,iBAAA,CAAC;gBAEF,OAAO,IAAIC,iBAAO,CAAC;AACjB,oBAAA,IAAI,EAAE,WAAW;AACjB,oBAAA,MAAM,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE;oBACxD,KAAK,EAAEA,iBAAO,CAAC,MAAM;AACtB,iBAAA,CAAC;AACJ,YAAA,CAAC,EACD;AACE,gBAAA,IAAI,EAAE,QAAQ;AACd,gBAAA,MAAM,EAAE;AACN,sBAAE;AACE,wBAAA,IAAI,EAAE,QAAQ;AACd,wBAAA,UAAU,EAAE;4BACV,CAAC,SAAS,GAAG;AACX,gCAAA,IAAI,EAAE,QAAQ;AACd,gCAAA,WAAW,EAAE,uBAAiC;AAC/C,6BAAA;AACF,yBAAA;AACD,wBAAA,QAAQ,EAAE,EAAE;AACb;AACH,sBAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE;AACpD,gBAAA,WAAW,EAAE,eAAe;AAC7B,aAAA,CACF,CACF;QACH;aAAO;;AAEL,YAAA,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE;gBACtC,MAAM,QAAQ,GAAG,CAAA,EAAGC,eAAS,CAAC,eAAe,CAAA,EAAG,WAAW,CAAA,CAAE;gBAC7D,MAAM,eAAe,GACnB,IAAI,CAAC,WAAW,IAAI,CAAA,2BAAA,EAA8B,WAAW,CAAA,CAAA,CAAG;;AAGlE,gBAAA,MAAM,eAAe,GACnB,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ;gBACxD,MAAM,uBAAuB,GAAG;sBAC5B,IAAI,CAAC;sBACL,SAAS;AACb,gBAAA,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,cAAc;gBAElDL,OAAK,CAAC,IAAI,CACRC,UAAI,CACF,OAAO,QAAQ,EAAE,MAAM,KAAI;oBACzB,MAAM,KAAK,GAAG,QAAmC;AACjD,oBAAA,MAAM,UAAU,GACb,MAAyC,EAAE,QAAQ,EAAE,EAAE;AACxD,wBAAA,SAAS;AAEX,oBAAA,IAAI,OAAO,GAAG,CAAA,4BAAA,EAA+B,WAAW,EAAE;AAC1D,oBAAA,IACE,eAAe;AACf,wBAAA,SAAS,IAAI,KAAK;AAClB,wBAAA,KAAK,CAAC,SAAS,CAAC,IAAI,IAAI,EACxB;wBACA,OAAO,IAAI,CAAA,IAAA,EAAO,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA,EAAA,EAAK,KAAK,CAAC,SAAS,CAAC,CAAA,CAAE;oBACjG;AAEA,oBAAA,MAAM,WAAW,GAAG,IAAIE,oBAAW,CAAC;wBAClC,OAAO;AACP,wBAAA,IAAI,EAAE,QAAQ;AACd,wBAAA,YAAY,EAAE,UAAU;AACxB,wBAAA,iBAAiB,EAAE;;AAEjB,4BAAA,mBAAmB,EAAE,eAAe;AACrC,yBAAA;AACF,qBAAA,CAAC;AAEF,oBAAA,MAAM,KAAK,GAAGD,6BAAmB,EAAsB;AAEvD;;;;;;;;;;AAUG;AACH,oBAAA,MAAMI,UAAQ,GAAG,KAAK,CAAC,QAAQ;oBAC/B,IAAI,gBAAgB,GAAGA,UAAQ;AAC/B,oBAAA,IAAI,cAAc,GAAG,EAAE;;AAGvB,oBAAA,KAAK,IAAI,CAAC,GAAGA,UAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC7C,wBAAA,MAAM,GAAG,GAAGA,UAAQ,CAAC,CAAC,CAAC;AACvB,wBAAA,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE;4BAC1B,MAAM,KAAK,GAAG,GAAgB;AAC9B,4BAAA,MAAM,WAAW,GAAG,KAAK,CAAC,UAAU,EAAE,IAAI,CACxC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,UAAU,CAC7B;AACD,4BAAA,IAAI,WAAW,KAAK,IAAI,EAAE;gCACxB,cAAc,GAAG,CAAC;gCAClB;4BACF;wBACF;oBACF;AAEA,oBAAA,IAAI,cAAc,IAAI,CAAC,EAAE;AACvB,wBAAA,MAAM,aAAa,GAAGA,UAAQ,CAAC,cAAc,CAAc;AAC3D,wBAAA,MAAM,YAAY,GAAG,aAAa,CAAC,UAAU,EAAE,IAAI,CACjD,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,UAAU,CAC7B;wBAED,IACE,YAAY,IAAI,IAAI;4BACpB,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,IAAI,CAAC,EAC3C;AACA;;;AAGG;AACH,4BAAA,MAAM,aAAa,GAAG,IAAIC,kBAAS,CAAC;gCAClC,OAAO,EAAE,aAAa,CAAC,OAAO;gCAC9B,UAAU,EAAE,CAAC,YAAY,CAAC;gCAC1B,EAAE,EAAE,aAAa,CAAC,EAAE;AACrB,6BAAA,CAAC;AAEF,4BAAA,gBAAgB,GAAG;AACjB,gCAAA,GAAGD,UAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;gCACpC,aAAa;gCACb,WAAW;6BACZ;wBACH;6BAAO;;AAEL,4BAAA,gBAAgB,GAAGA,UAAQ,CAAC,MAAM,CAAC,WAAW,CAAC;wBACjD;oBACF;yBAAO;;AAEL,wBAAA,gBAAgB,GAAGA,UAAQ,CAAC,MAAM,CAAC,WAAW,CAAC;oBACjD;oBAEA,OAAO,IAAIF,iBAAO,CAAC;AACjB,wBAAA,IAAI,EAAE,WAAW;AACjB,wBAAA,MAAM,EAAE,EAAE,QAAQ,EAAE,gBAAgB,EAAE;wBACtC,KAAK,EAAEA,iBAAO,CAAC,MAAM;AACtB,qBAAA,CAAC;AACJ,gBAAA,CAAC,EACD;AACE,oBAAA,IAAI,EAAE,QAAQ;AACd,oBAAA,MAAM,EAAE;AACN,0BAAE;AACE,4BAAA,IAAI,EAAE,QAAQ;AACd,4BAAA,UAAU,EAAE;gCACV,CAAC,SAAS,GAAG;AACX,oCAAA,IAAI,EAAE,QAAQ;AACd,oCAAA,WAAW,EAAE,uBAAiC;AAC/C,iCAAA;AACF,6BAAA;AACD,4BAAA,QAAQ,EAAE,EAAE;AACb;AACH,0BAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE;AACpD,oBAAA,WAAW,EAAE,eAAe;AAC7B,iBAAA,CACF,CACF;YACH;QACF;AAEA,QAAA,OAAOJ,OAAK;IACd;AAEA;;AAEG;AACK,IAAA,mBAAmB,CAAC,OAAe,EAAA;;AAEzC,QAAA,OAAO,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC;IACtC;AAEA;;;;;;;;;;;AAWG;IACK,uBAAuB,CAC7BM,UAAuB,EACvB,OAAe,EAAA;AAOf,QAAA,IAAIA,UAAQ,CAAC,MAAM,KAAK,CAAC;AAAE,YAAA,OAAO,IAAI;AAEtC;;;;AAIG;QACH,IAAI,WAAW,GAAuB,IAAI;AAC1C,QAAA,IAAI,gBAAgB,GAAG,EAAE;AAEzB,QAAA,KAAK,IAAI,CAAC,GAAGA,UAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC7C,YAAA,MAAM,GAAG,GAAGA,UAAQ,CAAC,CAAC,CAAC;AACvB,YAAA,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,MAAM;gBAAE;YAE9B,MAAM,YAAY,GAAG,GAAkB;AACvC,YAAA,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI;YAElC,IAAI,OAAO,QAAQ,KAAK,QAAQ;gBAAE;;YAGlC,MAAM,iBAAiB,GAAG,QAAQ,CAAC,UAAU,CAACD,eAAS,CAAC,eAAe,CAAC;AACxE,YAAA,MAAM,qBAAqB,GAAG,QAAQ,KAAK,sBAAsB;AAEjE,YAAA,IAAI,CAAC,iBAAiB,IAAI,CAAC,qBAAqB;gBAAE;;YAGlD,IAAI,gBAAgB,GAAkB,IAAI;YAE1C,IAAI,iBAAiB,EAAE;gBACrB,gBAAgB,GAAG,QAAQ,CAAC,OAAO,CAACA,eAAS,CAAC,eAAe,EAAE,EAAE,CAAC;YACpE;iBAAO,IAAI,qBAAqB,EAAE;AAChC,gBAAA,MAAM,WAAW,GAAG,YAAY,CAAC,iBAAiB,CAAC,mBAAmB;AACtE,gBAAA,gBAAgB,GAAG,OAAO,WAAW,KAAK,QAAQ,GAAG,WAAW,GAAG,IAAI;YACzE;;AAGA,YAAA,IAAI,gBAAgB,KAAK,OAAO,EAAE;gBAChC,WAAW,GAAG,YAAY;gBAC1B,gBAAgB,GAAG,CAAC;gBACpB;YACF;QACF;;AAGA,QAAA,IAAI,WAAW,KAAK,IAAI,IAAI,gBAAgB,GAAG,CAAC;AAAE,YAAA,OAAO,IAAI;;AAG7D,QAAA,MAAM,UAAU,GACd,OAAO,WAAW,CAAC,OAAO,KAAK;cAC3B,WAAW,CAAC;cACZ,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,OAAO,CAAC;QAEzC,MAAM,iBAAiB,GAAG,UAAU,CAAC,KAAK,CAAC,4BAA4B,CAAC;AACxE,QAAA,MAAM,YAAY,GAAG,iBAAiB,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI;;AAG3D,QAAA,MAAM,iBAAiB,GAAG,WAAW,CAAC,iBAAiB,CAAC,mBAAmB;AAC3E,QAAA,MAAM,eAAe,GACnB,OAAO,iBAAiB,KAAK,QAAQ,GAAG,iBAAiB,GAAG,IAAI;;AAGlE,QAAA,MAAM,WAAW,GAAG,WAAW,CAAC,iBAAiB,CAAC,yBAAyB;AAC3E,QAAA,MAAM,UAAU,GAAa,KAAK,CAAC,OAAO,CAAC,WAAW;AACpD,cAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,KAAkB,OAAO,CAAC,KAAK,QAAQ;cAC5D,EAAE;;QAEN,MAAM,gBAAgB,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,KAAI;YAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;AACtC,YAAA,OAAO,GAAG,EAAE,IAAI,IAAI,EAAE;AACxB,QAAA,CAAC,CAAC;;AAGF,QAAA,MAAM,UAAU,GAAG,WAAW,CAAC,YAAY;AAE3C;;;;AAIG;QACH,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAS,CAAC,UAAU,CAAC,CAAC;AACzD,QAAA,KAAK,MAAM,GAAG,IAAIC,UAAQ,EAAE;AAC1B,YAAA,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,MAAM;gBAAE;YAC9B,MAAM,EAAE,GAAG,GAAkB;AAC7B,YAAA,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI;YACrB,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE;AAC/B,YAAA,IACE,KAAK,CAAC,UAAU,CAACD,eAAS,CAAC,eAAe,CAAC;gBAC3C,KAAK,KAAK,sBAAsB,EAChC;AACA,gBAAA,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC;YAC1C;QACF;;QAGA,MAAM,gBAAgB,GAAkB,EAAE;AAE1C,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAGC,UAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACxC,YAAA,MAAM,GAAG,GAAGA,UAAQ,CAAC,CAAC,CAAC;AACvB,YAAA,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,EAAE;;AAG7B,YAAA,IAAI,OAAO,KAAK,MAAM,EAAE;gBACtB,MAAM,EAAE,GAAG,GAAkB;gBAC7B,IAAI,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,EAAE;oBAC5C;gBACF;YACF;AAEA,YAAA,IAAI,OAAO,KAAK,IAAI,EAAE;;gBAEpB,MAAM,KAAK,GAAG,GAAiC;AAC/C,gBAAA,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU;gBAElC,IAAI,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;;oBAErC,MAAM,kBAAkB,GAAG,SAAS,CAAC,MAAM,CACzC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CACzD;oBAED,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM;oBAErE,IAAI,gBAAgB,EAAE;AACpB,wBAAA,IACE,kBAAkB,CAAC,MAAM,GAAG,CAAC;AAC7B,6BAAC,OAAO,KAAK,CAAC,OAAO,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAC3D;;AAEA,4BAAA,MAAM,aAAa,GAAG,IAAIC,kBAAS,CAAC;gCAClC,OAAO,EAAE,KAAK,CAAC,OAAO;AACtB,gCAAA,UAAU,EAAE,kBAAkB;gCAC9B,EAAE,EAAE,KAAK,CAAC,EAAE;AACb,6BAAA,CAAC;AACF,4BAAA,gBAAgB,CAAC,IAAI,CAAC,aAAa,CAAC;wBACtC;;wBAEA;oBACF;gBACF;YACF;;AAGA,YAAA,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC;QAC5B;QAEA,OAAO;YACL,gBAAgB;YAChB,YAAY;YACZ,eAAe;YACf,gBAAgB;SACjB;IACH;AAEA;;AAEG;IACM,cAAc,GAAA;AACrB,QAAA,MAAM,eAAe,GAAGC,oBAAU,CAAC,IAAI,CAAC;YACtC,QAAQ,EAAEA,oBAAU,CAAgB;AAClC,gBAAA,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,KAAI;AAChB,oBAAA,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE;wBACb,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM;oBACvC;oBACA,MAAM,MAAM,GAAGC,8BAAoB,CAAC,CAAC,EAAE,CAAC,CAAC;AACzC,oBAAA,IAAI,CAAC,QAAQ,GAAG,MAAM;AACtB,oBAAA,OAAO,MAAM;gBACf,CAAC;AACD,gBAAA,OAAO,EAAE,MAAM,EAAE;aAClB,CAAC;;YAEF,aAAa,EAAED,oBAAU,CAAgB;;gBAEvC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC;AACpB,gBAAA,OAAO,EAAE,MAAM,EAAE;aAClB,CAAC;AACH,SAAA,CAAC;AAEF,QAAA,MAAM,OAAO,GAAG,IAAIE,oBAAU,CAAC,eAAe,CAAC;;QAG/C,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE;;AAE1C,YAAA,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAU;AAC7C,YAAA,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAU;;AAG5C,YAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE;gBACpC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAClE,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE;oBACtC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC1D,oBAAA,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACxD;YACF;;AAGA,YAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE;gBACnC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAClE,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE;oBACtC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC1D,oBAAA,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACvD;YACF;;AAGA,YAAA,MAAM,eAAe,GAAG,mBAAmB,CAAC,IAAI,GAAG,CAAC;AACpD,YAAA,MAAM,cAAc,GAAG,kBAAkB,CAAC,IAAI,GAAG,CAAC;AAClD,YAAA,MAAM,mBAAmB,GAAG,eAAe,IAAI,cAAc;;AAG7D,YAAA,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;AAC9B,gBAAA,GAAG,mBAAmB;AACtB,gBAAA,GAAG,kBAAkB;AACtB,aAAA,CAAC;AACF,YAAA,IAAI,mBAAmB,CAAC,IAAI,GAAG,CAAC,IAAI,kBAAkB,CAAC,IAAI,KAAK,CAAC,EAAE;AACjE,gBAAA,eAAe,CAAC,GAAG,CAACC,aAAG,CAAC;YAC1B;;YAGA,MAAM,aAAa,GAAG,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC;;YAGvD,MAAM,YAAY,GAAG,OACnB,KAA6B,EAC7B,MAAgC,KACa;AAC7C,gBAAA,IAAI,MAA8B;AAElC;;;;;AAKG;AACH,gBAAA,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,CACjD,KAAK,CAAC,QAAQ,EACd,OAAO,CACR;AAED,gBAAA,IAAI,cAAc,KAAK,IAAI,EAAE;oBAC3B,MAAM,EACJ,gBAAgB,EAChB,YAAY,EACZ,eAAe,EACf,gBAAgB,GACjB,GAAG,cAAc;AAElB;;;AAGG;oBACH,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC;AACpD,oBAAA,IACE,YAAY;AACZ,wBAAA,eAAe,IAAI,IAAI;wBACvB,eAAe,KAAK,EAAE,EACtB;AACA,wBAAA,YAAY,CAAC,iBAAiB,CAAC,eAAe,EAAE,gBAAgB,CAAC;oBACnE;;oBAGA,IAAI,gBAAgB,GAAG,gBAAgB;AAEvC;;;;;;;;;;;AAWG;oBACH,MAAM,eAAe,GAAG,YAAY,KAAK,IAAI,IAAI,YAAY,KAAK,EAAE;oBACpE,IAAI,eAAe,EAAE;AACnB,wBAAA,MAAM,OAAO,GACX,gBAAgB,CAAC,MAAM,GAAG;8BACtB,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC;8BAC5C,IAAI;wBAEV,IAAI,OAAO,IAAI,IAAI,IAAI,OAAO,CAAC,OAAO,EAAE,KAAK,MAAM,EAAE;AACnD,4BAAA,gBAAgB,GAAG;AACjB,gCAAA,GAAG,gBAAgB;AACnB,gCAAA,IAAIJ,kBAAS,CACX,CAAA,2CAAA,EAA8C,OAAO,GAAG,CACzD;gCACD,IAAIK,qBAAY,CAAC,YAAY,CAAC;6BAC/B;wBACH;6BAAO;AACL,4BAAA,gBAAgB,GAAG;AACjB,gCAAA,GAAG,gBAAgB;gCACnB,IAAIA,qBAAY,CAAC,YAAY,CAAC;6BAC/B;wBACH;oBACF;;AAGA,oBAAA,IAAI,YAAY,EAAE,YAAY,IAAI,eAAe,EAAE;wBACjD,MAAM,aAAa,GAA2B,EAAE;wBAChD,KACE,IAAI,CAAC,GAAG,CAAC,EACT,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,EACtD,CAAC,EAAE,EACH;4BACA,MAAM,UAAU,GAAG,YAAY,CAAC,kBAAkB,CAAC,CAAC,CAAC;AACrD,4BAAA,IAAI,UAAU,KAAK,SAAS,EAAE;AAC5B,gCAAA,aAAa,CAAC,CAAC,CAAC,GAAG,UAAU;4BAC/B;wBACF;;AAEA,wBAAA,KACE,IAAI,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAC/B,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAC3B,CAAC,EAAE,EACH;AACA,4BAAA,aAAa,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;wBACnE;AACA,wBAAA,YAAY,CAAC,8BAA8B,CAAC,aAAa,CAAC;oBAC5D;AAEA,oBAAA,MAAM,gBAAgB,GAA2B;AAC/C,wBAAA,GAAG,KAAK;AACR,wBAAA,QAAQ,EAAE,gBAAgB;qBAC3B;oBACD,MAAM,GAAG,MAAM,aAAa,CAAC,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC;AAC7D,oBAAA,MAAM,GAAG;AACP,wBAAA,GAAG,MAAM;AACT,wBAAA,aAAa,EAAE,EAAE;qBAClB;gBACH;AAAO,qBAAA,IACL,KAAK,CAAC,aAAa,IAAI,IAAI;AAC3B,oBAAA,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAC9B;AACA;;;AAGG;oBACH,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC;AACpD,oBAAA,IAAI,YAAY,IAAI,YAAY,CAAC,YAAY,EAAE;AAC7C;;;AAGG;wBACH,MAAM,aAAa,GAA2B,EAAE;;AAGhD,wBAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;4BACxC,MAAM,UAAU,GAAG,YAAY,CAAC,kBAAkB,CAAC,CAAC,CAAC;AACrD,4BAAA,IAAI,UAAU,KAAK,SAAS,EAAE;AAC5B,gCAAA,aAAa,CAAC,CAAC,CAAC,GAAG,UAAU;4BAC/B;wBACF;;wBAGA,MAAM,kBAAkB,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC;AACzD,wBAAA,IAAI,kBAAkB,IAAI,IAAI,CAAC,UAAU,EAAE;4BACzC,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,kBAAkB,CAAC;4BAC7D,aAAa,CAAC,kBAAkB,CAAC;AAC/B,gCAAA,YAAY,CAAC,YAAY,CAAC,aAAa,CAAC;wBAC5C;;AAGA,wBAAA,YAAY,CAAC,8BAA8B,CAAC,aAAa,CAAC;oBAC5D;;AAGA,oBAAA,MAAM,gBAAgB,GAA2B;AAC/C,wBAAA,GAAG,KAAK;wBACR,QAAQ,EAAE,KAAK,CAAC,aAAa;qBAC9B;oBACD,MAAM,GAAG,MAAM,aAAa,CAAC,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC;AAC7D,oBAAA,MAAM,GAAG;AACP,wBAAA,GAAG,MAAM;;AAET,wBAAA,aAAa,EAAE,EAAE;qBAClB;gBACH;qBAAO;oBACL,MAAM,GAAG,MAAM,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC;gBACpD;;gBAGA,IAAI,mBAAmB,EAAE;;AAEvB,oBAAA,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CACjC,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CACL;oBACvB,IACE,WAAW,IAAI,IAAI;AACnB,wBAAA,WAAW,CAAC,OAAO,EAAE,KAAK,MAAM;AAChC,wBAAA,OAAO,WAAW,CAAC,IAAI,KAAK,QAAQ;wBACpC,WAAW,CAAC,IAAI,CAAC,UAAU,CAACP,eAAS,CAAC,eAAe,CAAC,EACtD;;AAEA,wBAAA,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAC1CA,eAAS,CAAC,eAAe,EACzB,EAAE,CACH;wBACD,OAAO,IAAID,iBAAO,CAAC;AACjB,4BAAA,MAAM,EAAE,MAAM;AACd,4BAAA,IAAI,EAAE,WAAW;AAClB,yBAAA,CAAC;oBACJ;yBAAO;;wBAEL,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC;AAClD,wBAAA,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE;4BAC5B,OAAO,IAAIA,iBAAO,CAAC;AACjB,gCAAA,MAAM,EAAE,MAAM;AACd,gCAAA,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;AACrB,6BAAA,CAAC;wBACJ;AAAO,6BAAA,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;;4BAEjC,OAAO,IAAIA,iBAAO,CAAC;AACjB,gCAAA,MAAM,EAAE,MAAM;AACd,gCAAA,IAAI,EAAE,WAAW;AAClB,6BAAA,CAAC;wBACJ;oBACF;gBACF;;AAGA,gBAAA,OAAO,MAAM;AACf,YAAA,CAAC;;AAGD,YAAA,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,YAAY,EAAE;AACrC,gBAAA,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC;AAClC,aAAA,CAAC;QACJ;;AAGA,QAAA,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE;;;AAG1C,YAAA,OAAO,CAAC,OAAO,CAACS,eAAK,EAAE,SAAS,CAAC;QACnC;AAEA;;;;AAIG;AACH,QAAA,MAAM,UAAU,GAAG,IAAI,GAAG,EAAe;AACzC,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE;YACnC,IAAI,CAAC,IAAI,CAAC,YAAY;gBAAE;YAExB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAClE,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAEjE,YAAA,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;AAC5B,gBAAA,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE;oBAC/B,MAAM,UAAU,GAAGC,sCAAqB,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;AAClE,oBAAA,MAAM,QAAQ,GAAGC,uCAAsB,CACrC,IAAI,CAAC,YAAY,EACjB,MAAM,EACN,IAAI,CACL;;;AAID,oBAAA,OAAO,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC;;;AAGrC,oBAAA,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC;;;AAGnC,oBAAA,OAAO,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC;gBACnC;YACF;AACA,YAAA,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;QACtB;AAEA;;;;AAIG;AACH,QAAA,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAyB;AAE3D,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE;AACnC,YAAA,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE;YAC1B,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AACjE,YAAA,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE;gBACtC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE;AACxC,oBAAA,kBAAkB,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,CAAC;gBACzC;gBACA,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC;YACjD;QACF;QAEA,KAAK,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,kBAAkB,EAAE;;YAErD,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAClC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE,CACpD;AAED,YAAA,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE;AAC9B;;AAEG;AACH,gBAAA,MAAM,aAAa,GAAG,CAAA,OAAA,EAAU,WAAW,SAAS;AACpD;;;AAGG;gBACH,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,MAAM;AACxC;;;AAGG;gBACH,MAAM,cAAc,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,cAAc;gBAExD,OAAO,CAAC,OAAO,CAAC,aAAa,EAAE,OAAO,KAAuB,KAAI;AAC/D,oBAAA,IAAI,UAA8B;oBAClC,IAAI,uBAAuB,GAAG,cAAc;AAE5C,oBAAA,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE;AAChC,wBAAA,UAAU,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC;oBAC5D;AAAO,yBAAA,IAAI,MAAM,IAAI,IAAI,EAAE;AACzB,wBAAA,IAAI,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE;AAChC,4BAAA,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;AAC7D,4BAAA,MAAM,aAAa,GAAGC,wBAAe,CAAC,eAAe,CAAC;4BACtD,MAAM,cAAc,GAAGC,sBAAc,CAAC,YAAY,CAAC,MAAM,CAAC;AAC1D,4BAAA,MAAM,MAAM,GAAG,MAAM,cAAc,CAAC,MAAM,CAAC;AACzC,gCAAA,OAAO,EAAE,aAAa;AACvB,6BAAA,CAAC;AACF,4BAAA,UAAU,GAAG,MAAM,CAAC,KAAK;4BACzB,uBAAuB;AACrB,gCAAA,cAAc,KAAK,KAAK,IAAI,UAAU,KAAK,EAAE;wBACjD;6BAAO;4BACL,UAAU,GAAG,MAAM;wBACrB;oBACF;oBAEA,IAAI,UAAU,IAAI,IAAI,IAAI,UAAU,KAAK,EAAE,EAAE;wBAC3C,IACE,uBAAuB,IAAI,IAAI;4BAC/B,uBAAuB,KAAK,KAAK,EACjC;4BACA,OAAO;AACL,gCAAA,QAAQ,EAAE,CAAC,IAAIL,qBAAY,CAAC,UAAU,CAAC,CAAC;6BACzC;wBACH;AAEA;;AAEG;AACH,wBAAA,MAAM,gBAAgB,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC;wBACjE,OAAO;AACL,4BAAA,QAAQ,EAAE,CAAC,IAAIA,qBAAY,CAAC,UAAU,CAAC,CAAC;AACxC,4BAAA,aAAa,EAAEH,8BAAoB,CAAC,gBAAgB,EAAE;gCACpD,IAAIG,qBAAY,CAAC,UAAU,CAAC;6BAC7B,CAAC;yBACH;oBACH;;AAGA,oBAAA,OAAO,EAAE;AACX,gBAAA,CAAC,CAAC;;AAGF,gBAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;oBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAClE,oBAAA,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;;;AAG5B,wBAAA,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC;oBACxC;gBACF;;;;AAKA,gBAAA,OAAO,CAAC,OAAO,CAAC,aAAa,EAAE,WAAW,CAAC;YAC7C;iBAAO;;AAEL,gBAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;oBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAClE,oBAAA,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;;wBAE5B,MAAM,kBAAkB,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,KAAI;4BACxD,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1D,4BAAA,OAAO,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;AAClC,wBAAA,CAAC,CAAC;wBACF,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,KAAI;4BACtD,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1D,4BAAA,OAAO,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;AAClC,wBAAA,CAAC,CAAC;;AAGF,wBAAA,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;4BACjE;wBACF;;;AAIA,wBAAA,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC;oBACtC;gBACF;YACF;QACF;QAEA,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,cAAkC,CAAC;IACjE;AACD;;;;"}
+{"version":3,"file":"MultiAgentGraph.cjs","sources":["../../../src/graphs/MultiAgentGraph.ts"],"sourcesContent":["import { tool } from '@langchain/core/tools';\nimport { PromptTemplate } from '@langchain/core/prompts';\nimport {\n  AIMessage,\n  ToolMessage,\n  HumanMessage,\n  getBufferString,\n} from '@langchain/core/messages';\nimport {\n  END,\n  START,\n  Command,\n  StateGraph,\n  Annotation,\n  getCurrentTaskInput,\n  messagesStateReducer,\n} from '@langchain/langgraph';\nimport type { LangGraphRunnableConfig } from '@langchain/langgraph';\nimport type { BaseMessage, AIMessageChunk } from '@langchain/core/messages';\nimport type { ToolRunnableConfig } from '@langchain/core/tools';\nimport type * as t from '@/types';\nimport { StandardGraph } from './Graph';\nimport { Constants, EdgeType } from '@/common';\nimport {\n  createApprovalGateNode,\n  getApprovalGateNodeId,\n} from '@/nodes/ApprovalGateNode';\n\n/** Pattern to extract instructions from transfer ToolMessage content */\nconst HANDOFF_INSTRUCTIONS_PATTERN = /(?:Instructions?|Context):\\s*(.+)/is;\n\n/**\n * MultiAgentGraph extends StandardGraph to support dynamic multi-agent workflows\n * with handoffs, fan-in/fan-out, and other composable patterns.\n *\n * Key behavior:\n * - Agents with ONLY handoff edges: Can dynamically route to any handoff destination\n * - Agents with ONLY direct edges: Always follow their direct edges\n * - Agents with BOTH: Use Command for exclusive routing (handoff OR direct, not both)\n *   - If handoff occurs: Only the handoff destination executes\n *   - If no handoff: Direct edges execute (potentially in parallel)\n *\n * This enables the common pattern where an agent either delegates (handoff)\n * OR continues its workflow (direct edges), but not both simultaneously.\n */\nexport class MultiAgentGraph extends StandardGraph {\n  private edges: t.GraphEdge[];\n  private startingNodes: Set<string> = new Set();\n  private directEdges: t.GraphEdge[] = [];\n  private handoffEdges: t.GraphEdge[] = [];\n  /**\n   * Map of agentId to parallel group info.\n   * Contains groupId (incrementing number reflecting execution order) for agents in parallel groups.\n   * Sequential agents (not in any parallel group) have undefined entry.\n   *\n   * Example for: researcher -> [analyst1, analyst2, analyst3] -> summarizer\n   * - researcher: undefined (sequential, order 0)\n   * - analyst1, analyst2, analyst3: { groupId: 1 } (parallel group, order 1)\n   * - summarizer: undefined (sequential, order 2)\n   */\n  private agentParallelGroups: Map<string, number> = new Map();\n\n  constructor(input: t.MultiAgentGraphInput) {\n    super(input);\n    this.edges = input.edges;\n    this.validateEdgeAgents();\n    this.categorizeEdges();\n    this.analyzeGraph();\n    this.createHandoffTools();\n  }\n\n  /**\n   * Fails fast when an edge references an agent that is not in\n   * `agentContexts`. Without this check, the underlying LangGraph\n   * `StateGraph.compile()` would throw the opaque\n   * `Found edge ending at unknown node \"<id>\"` error after graph\n   * construction — far from the true root cause.\n   *\n   * This catches the common misuse of passing `edges` into a multi-agent\n   * config without also passing the corresponding sub-agent configs in\n   * `agents` (e.g. a host that forgot to pre-load handoff targets).\n   */\n  private validateEdgeAgents(): void {\n    const known = new Set(this.agentContexts.keys());\n    const unknown = new Set<string>();\n    for (const edge of this.edges) {\n      const participants = [\n        ...(Array.isArray(edge.from) ? edge.from : [edge.from]),\n        ...(Array.isArray(edge.to) ? edge.to : [edge.to]),\n      ];\n      for (const id of participants) {\n        if (typeof id === 'string' && !known.has(id)) {\n          unknown.add(id);\n        }\n      }\n    }\n    if (unknown.size === 0) {\n      return;\n    }\n    const missing = Array.from(unknown)\n      .map((id) => `\"${id}\"`)\n      .join(', ');\n    throw new Error(\n      `MultiAgentGraph: edges reference agent(s) not present in agents: [${missing}]. ` +\n        'Ensure every agent referenced by an edge is also included in the `agents` array, ' +\n        'or filter orphaned edges before constructing the graph.'\n    );\n  }\n\n  /**\n   * Categorize edges into handoff and direct types\n   */\n  private categorizeEdges(): void {\n    for (const edge of this.edges) {\n      // Default behavior: edges with conditions or explicit 'handoff' type are handoff edges\n      // Edges with explicit 'direct' type or multi-destination without conditions are direct edges\n      if (edge.edgeType === EdgeType.DIRECT) {\n        this.directEdges.push(edge);\n      } else if (edge.edgeType === EdgeType.HANDOFF || edge.condition != null) {\n        this.handoffEdges.push(edge);\n      } else {\n        // Default: single-to-single edges are handoff, single-to-multiple are direct\n        const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n        const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n\n        if (sources.length === 1 && destinations.length > 1) {\n          // Fan-out pattern defaults to direct\n          this.directEdges.push(edge);\n        } else {\n          // Everything else defaults to handoff\n          this.handoffEdges.push(edge);\n        }\n      }\n    }\n  }\n\n  /**\n   * Analyze graph structure to determine starting nodes and connections\n   */\n  private analyzeGraph(): void {\n    const hasIncomingEdge = new Set<string>();\n\n    // Track all nodes that have incoming edges\n    for (const edge of this.edges) {\n      const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n      destinations.forEach((dest) => hasIncomingEdge.add(dest));\n    }\n\n    // Starting nodes are those without incoming edges\n    for (const agentId of this.agentContexts.keys()) {\n      if (!hasIncomingEdge.has(agentId)) {\n        this.startingNodes.add(agentId);\n      }\n    }\n\n    // If no starting nodes found, use the first agent\n    if (this.startingNodes.size === 0 && this.agentContexts.size > 0) {\n      this.startingNodes.add(this.agentContexts.keys().next().value!);\n    }\n\n    // Determine if graph has parallel execution capability\n    this.computeParallelCapability();\n  }\n\n  /**\n   * Compute parallel groups by traversing the graph in execution order.\n   * Assigns incrementing group IDs that reflect the sequential order of execution.\n   *\n   * For: researcher -> [analyst1, analyst2, analyst3] -> summarizer\n   * - researcher: no group (first sequential node)\n   * - analyst1, analyst2, analyst3: groupId 1 (first parallel group)\n   * - summarizer: no group (next sequential node)\n   *\n   * This allows frontend to render in order:\n   * Row 0: researcher\n   * Row 1: [analyst1, analyst2, analyst3] (grouped)\n   * Row 2: summarizer\n   */\n  private computeParallelCapability(): void {\n    let groupCounter = 1; // Start at 1, 0 reserved for \"no group\"\n\n    // Check 1: Multiple starting nodes means parallel from the start (group 1)\n    if (this.startingNodes.size > 1) {\n      for (const agentId of this.startingNodes) {\n        this.agentParallelGroups.set(agentId, groupCounter);\n      }\n      groupCounter++;\n    }\n\n    // Check 2: Traverse direct edges in order to find fan-out patterns\n    // Build a simple execution order by following edges from starting nodes\n    const visited = new Set<string>();\n    const queue: string[] = [...this.startingNodes];\n\n    while (queue.length > 0) {\n      const current = queue.shift()!;\n      if (visited.has(current)) continue;\n      visited.add(current);\n\n      // Find direct edges from this node\n      for (const edge of this.directEdges) {\n        const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n        if (!sources.includes(current)) continue;\n\n        const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n\n        // Fan-out: multiple destinations = parallel group\n        if (destinations.length > 1) {\n          for (const dest of destinations) {\n            // Only set if not already in a group (first group wins)\n            if (!this.agentParallelGroups.has(dest)) {\n              this.agentParallelGroups.set(dest, groupCounter);\n            }\n            if (!visited.has(dest)) {\n              queue.push(dest);\n            }\n          }\n          groupCounter++;\n        } else {\n          // Single destination - add to queue for traversal\n          for (const dest of destinations) {\n            if (!visited.has(dest)) {\n              queue.push(dest);\n            }\n          }\n        }\n      }\n\n      // Also follow handoff edges for traversal (but they don't create parallel groups)\n      for (const edge of this.handoffEdges) {\n        const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n        if (!sources.includes(current)) continue;\n\n        const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n        for (const dest of destinations) {\n          if (!visited.has(dest)) {\n            queue.push(dest);\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Get the parallel group ID for an agent, if any.\n   * Returns undefined if the agent is not part of a parallel group.\n   * Group IDs are incrementing numbers reflecting execution order.\n   */\n  getParallelGroupId(agentId: string): number | undefined {\n    return this.agentParallelGroups.get(agentId);\n  }\n\n  /**\n   * Override to indicate this is a multi-agent graph.\n   * Enables agentId to be included in RunStep for frontend agent labeling.\n   */\n  protected override isMultiAgentGraph(): boolean {\n    return true;\n  }\n\n  /**\n   * Override base class method to provide parallel group IDs for run steps.\n   */\n  protected override getParallelGroupIdForAgent(\n    agentId: string\n  ): number | undefined {\n    return this.agentParallelGroups.get(agentId);\n  }\n\n  /**\n   * Create handoff tools for agents based on handoff edges only\n   */\n  private createHandoffTools(): void {\n    // Group handoff edges by source agent(s)\n    const handoffsByAgent = new Map<string, t.GraphEdge[]>();\n\n    // Only process handoff edges for tool creation\n    for (const edge of this.handoffEdges) {\n      const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n      sources.forEach((source) => {\n        if (!handoffsByAgent.has(source)) {\n          handoffsByAgent.set(source, []);\n        }\n        handoffsByAgent.get(source)!.push(edge);\n      });\n    }\n\n    // Create handoff tools for each agent\n    for (const [agentId, edges] of handoffsByAgent) {\n      const agentContext = this.agentContexts.get(agentId);\n      if (!agentContext) continue;\n\n      // Create handoff tools for this agent's outgoing edges\n      const handoffTools: t.GenericTool[] = [];\n      const sourceAgentName = agentContext.name ?? agentId;\n      for (const edge of edges) {\n        handoffTools.push(\n          ...this.createHandoffToolsForEdge(edge, agentId, sourceAgentName)\n        );\n      }\n\n      if (!agentContext.graphTools) {\n        agentContext.graphTools = [];\n      }\n      agentContext.graphTools.push(...handoffTools);\n    }\n  }\n\n  /**\n   * Create handoff tools for an edge (handles multiple destinations)\n   * @param edge - The graph edge defining the handoff\n   * @param sourceAgentId - The ID of the agent that will perform the handoff\n   * @param sourceAgentName - The human-readable name of the source agent\n   */\n  private createHandoffToolsForEdge(\n    edge: t.GraphEdge,\n    sourceAgentId: string,\n    sourceAgentName: string\n  ): t.GenericTool[] {\n    const tools: t.GenericTool[] = [];\n    const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n\n    /** If there's a condition, create a single conditional handoff tool */\n    if (edge.condition != null) {\n      const toolName = 'conditional_transfer';\n      const toolDescription =\n        edge.description ?? 'Conditionally transfer control based on state';\n\n      /** Check if we have a prompt for handoff input */\n      const hasHandoffInput =\n        edge.prompt != null && typeof edge.prompt === 'string';\n      const handoffInputDescription = hasHandoffInput ? edge.prompt : undefined;\n      const promptKey = edge.promptKey ?? 'instructions';\n\n      tools.push(\n        tool(\n          async (rawInput, config) => {\n            const input = rawInput as Record<string, unknown>;\n            const state = getCurrentTaskInput() as t.BaseGraphState;\n            const toolCallId =\n              (config as ToolRunnableConfig | undefined)?.toolCall?.id ??\n              'unknown';\n\n            /** Evaluated condition */\n            const result = edge.condition!(state);\n            let destination: string;\n\n            if (typeof result === 'boolean') {\n              /** If true, use first destination; if false, don't transfer */\n              if (!result) return null;\n              destination = destinations[0];\n            } else if (typeof result === 'string') {\n              destination = result;\n            } else {\n              /** Array of destinations - for now, use the first */\n              destination = Array.isArray(result) ? result[0] : destinations[0];\n            }\n\n            let content = `Conditionally transferred to ${destination}`;\n            if (\n              hasHandoffInput &&\n              promptKey in input &&\n              input[promptKey] != null\n            ) {\n              content += `\\n\\n${promptKey.charAt(0).toUpperCase() + promptKey.slice(1)}: ${input[promptKey]}`;\n            }\n\n            const toolMessage = new ToolMessage({\n              content,\n              name: toolName,\n              tool_call_id: toolCallId,\n              additional_kwargs: {\n                /** Store destination for programmatic access in handoff detection */\n                handoff_destination: destination,\n                /** Store source agent name for receiving agent to know who handed off */\n                handoff_source_name: sourceAgentName,\n              },\n            });\n\n            return new Command({\n              goto: destination,\n              update: { messages: state.messages.concat(toolMessage) },\n              graph: Command.PARENT,\n            });\n          },\n          {\n            name: toolName,\n            schema: hasHandoffInput\n              ? {\n                  type: 'object',\n                  properties: {\n                    [promptKey]: {\n                      type: 'string',\n                      description: handoffInputDescription as string,\n                    },\n                  },\n                  required: [],\n                }\n              : { type: 'object', properties: {}, required: [] },\n            description: toolDescription,\n          }\n        )\n      );\n    } else {\n      /** Create individual tools for each destination */\n      for (const destination of destinations) {\n        const toolName = `${Constants.LC_TRANSFER_TO_}${destination}`;\n        const toolDescription =\n          edge.description ?? `Transfer control to agent '${destination}'`;\n\n        /** Check if we have a prompt for handoff input */\n        const hasHandoffInput =\n          edge.prompt != null && typeof edge.prompt === 'string';\n        const handoffInputDescription = hasHandoffInput\n          ? edge.prompt\n          : undefined;\n        const promptKey = edge.promptKey ?? 'instructions';\n\n        tools.push(\n          tool(\n            async (rawInput, config) => {\n              const input = rawInput as Record<string, unknown>;\n              const toolCallId =\n                (config as ToolRunnableConfig | undefined)?.toolCall?.id ??\n                'unknown';\n\n              let content = `Successfully transferred to ${destination}`;\n              if (\n                hasHandoffInput &&\n                promptKey in input &&\n                input[promptKey] != null\n              ) {\n                content += `\\n\\n${promptKey.charAt(0).toUpperCase() + promptKey.slice(1)}: ${input[promptKey]}`;\n              }\n\n              const toolMessage = new ToolMessage({\n                content,\n                name: toolName,\n                tool_call_id: toolCallId,\n                additional_kwargs: {\n                  /** Store source agent name for receiving agent to know who handed off */\n                  handoff_source_name: sourceAgentName,\n                },\n              });\n\n              const state = getCurrentTaskInput() as t.BaseGraphState;\n\n              /**\n               * For parallel handoff support:\n               * Build messages that include ONLY this tool call's context.\n               * This prevents errors when LLM calls multiple transfers simultaneously -\n               * each destination gets a valid AIMessage with matching tool_call and tool_result.\n               *\n               * Strategy:\n               * 1. Find the AIMessage containing this tool call\n               * 2. Create a filtered AIMessage with ONLY this tool_call\n               * 3. Include all messages before the AIMessage plus the filtered pair\n               */\n              const messages = state.messages;\n              let filteredMessages = messages;\n              let aiMessageIndex = -1;\n\n              /** Find the AIMessage containing this tool call */\n              for (let i = messages.length - 1; i >= 0; i--) {\n                const msg = messages[i];\n                if (msg.getType() === 'ai') {\n                  const aiMsg = msg as AIMessage;\n                  const hasThisCall = aiMsg.tool_calls?.some(\n                    (tc) => tc.id === toolCallId\n                  );\n                  if (hasThisCall === true) {\n                    aiMessageIndex = i;\n                    break;\n                  }\n                }\n              }\n\n              if (aiMessageIndex >= 0) {\n                const originalAiMsg = messages[aiMessageIndex] as AIMessage;\n                const thisToolCall = originalAiMsg.tool_calls?.find(\n                  (tc) => tc.id === toolCallId\n                );\n\n                if (\n                  thisToolCall != null &&\n                  (originalAiMsg.tool_calls?.length ?? 0) > 1\n                ) {\n                  /**\n                   * Multiple tool calls - create filtered AIMessage with ONLY this call.\n                   * This ensures valid message structure for parallel handoffs.\n                   */\n                  const filteredAiMsg = new AIMessage({\n                    content: originalAiMsg.content,\n                    tool_calls: [thisToolCall],\n                    id: originalAiMsg.id,\n                  });\n\n                  filteredMessages = [\n                    ...messages.slice(0, aiMessageIndex),\n                    filteredAiMsg,\n                    toolMessage,\n                  ];\n                } else {\n                  /** Single tool call - use messages as-is */\n                  filteredMessages = messages.concat(toolMessage);\n                }\n              } else {\n                /** Fallback - append tool message */\n                filteredMessages = messages.concat(toolMessage);\n              }\n\n              return new Command({\n                goto: destination,\n                update: { messages: filteredMessages },\n                graph: Command.PARENT,\n              });\n            },\n            {\n              name: toolName,\n              schema: hasHandoffInput\n                ? {\n                    type: 'object',\n                    properties: {\n                      [promptKey]: {\n                        type: 'string',\n                        description: handoffInputDescription as string,\n                      },\n                    },\n                    required: [],\n                  }\n                : { type: 'object', properties: {}, required: [] },\n              description: toolDescription,\n            }\n          )\n        );\n      }\n    }\n\n    return tools;\n  }\n\n  /**\n   * Create a complete agent subgraph (similar to createReactAgent)\n   */\n  private createAgentSubgraph(agentId: string): t.CompiledAgentWorfklow {\n    /** This is essentially the same as `createAgentNode` from `StandardGraph` */\n    return this.createAgentNode(agentId);\n  }\n\n  /**\n   * Detects if the current agent is receiving a handoff and processes the messages accordingly.\n   * Returns filtered messages with the transfer tool call/message removed, plus any instructions,\n   * source agent, and parallel sibling information extracted from the transfer.\n   *\n   * Supports both single handoffs (last message is the transfer) and parallel handoffs\n   * (multiple transfer ToolMessages, need to find the one targeting this agent).\n   *\n   * @param messages - Current state messages\n   * @param agentId - The agent ID to check for handoff reception\n   * @returns Object with filtered messages, extracted instructions, source agent, and parallel siblings\n   */\n  private processHandoffReception(\n    messages: BaseMessage[],\n    agentId: string\n  ): {\n    filteredMessages: BaseMessage[];\n    instructions: string | null;\n    sourceAgentName: string | null;\n    parallelSiblings: string[];\n  } | null {\n    if (messages.length === 0) return null;\n\n    /**\n     * Search for a transfer ToolMessage targeting this agent.\n     * For parallel handoffs, multiple transfer messages may exist - find ours.\n     * Search backwards from the end to find the most recent transfer to this agent.\n     */\n    let toolMessage: ToolMessage | null = null;\n    let toolMessageIndex = -1;\n\n    for (let i = messages.length - 1; i >= 0; i--) {\n      const msg = messages[i];\n      if (msg.getType() !== 'tool') continue;\n\n      const candidateMsg = msg as ToolMessage;\n      const toolName = candidateMsg.name;\n\n      if (typeof toolName !== 'string') continue;\n\n      /** Check for standard transfer pattern */\n      const isTransferMessage = toolName.startsWith(Constants.LC_TRANSFER_TO_);\n      const isConditionalTransfer = toolName === 'conditional_transfer';\n\n      if (!isTransferMessage && !isConditionalTransfer) continue;\n\n      /** Extract destination from tool name or additional_kwargs */\n      let destinationAgent: string | null = null;\n\n      if (isTransferMessage) {\n        destinationAgent = toolName.replace(Constants.LC_TRANSFER_TO_, '');\n      } else if (isConditionalTransfer) {\n        const handoffDest = candidateMsg.additional_kwargs.handoff_destination;\n        destinationAgent = typeof handoffDest === 'string' ? handoffDest : null;\n      }\n\n      /** Check if this transfer targets our agent */\n      if (destinationAgent === agentId) {\n        toolMessage = candidateMsg;\n        toolMessageIndex = i;\n        break;\n      }\n    }\n\n    /** No transfer targeting this agent found */\n    if (toolMessage === null || toolMessageIndex < 0) return null;\n\n    /** Extract instructions from the ToolMessage content */\n    const contentStr =\n      typeof toolMessage.content === 'string'\n        ? toolMessage.content\n        : JSON.stringify(toolMessage.content);\n\n    const instructionsMatch = contentStr.match(HANDOFF_INSTRUCTIONS_PATTERN);\n    const instructions = instructionsMatch?.[1]?.trim() ?? null;\n\n    /** Extract source agent name from additional_kwargs */\n    const handoffSourceName = toolMessage.additional_kwargs.handoff_source_name;\n    const sourceAgentName =\n      typeof handoffSourceName === 'string' ? handoffSourceName : null;\n\n    /** Extract parallel siblings (set by ToolNode for parallel handoffs) */\n    const rawSiblings = toolMessage.additional_kwargs.handoff_parallel_siblings;\n    const siblingIds: string[] = Array.isArray(rawSiblings)\n      ? rawSiblings.filter((s): s is string => typeof s === 'string')\n      : [];\n    /** Convert IDs to display names */\n    const parallelSiblings = siblingIds.map((id) => {\n      const ctx = this.agentContexts.get(id);\n      return ctx?.name ?? id;\n    });\n\n    /** Get the tool_call_id to find and filter the AI message's tool call */\n    const toolCallId = toolMessage.tool_call_id;\n\n    /**\n     * Collect all transfer tool_call_ids to filter out.\n     * For parallel handoffs, we filter ALL transfer messages (not just ours)\n     * to give the receiving agent a clean context without handoff noise.\n     */\n    const transferToolCallIds = new Set<string>([toolCallId]);\n    for (const msg of messages) {\n      if (msg.getType() !== 'tool') continue;\n      const tm = msg as ToolMessage;\n      const tName = tm.name;\n      if (typeof tName !== 'string') continue;\n      if (\n        tName.startsWith(Constants.LC_TRANSFER_TO_) ||\n        tName === 'conditional_transfer'\n      ) {\n        transferToolCallIds.add(tm.tool_call_id);\n      }\n    }\n\n    /** Filter out all transfer messages */\n    const filteredMessages: BaseMessage[] = [];\n\n    for (let i = 0; i < messages.length; i++) {\n      const msg = messages[i];\n      const msgType = msg.getType();\n\n      /** Skip transfer ToolMessages */\n      if (msgType === 'tool') {\n        const tm = msg as ToolMessage;\n        if (transferToolCallIds.has(tm.tool_call_id)) {\n          continue;\n        }\n      }\n\n      if (msgType === 'ai') {\n        /** Check if this AI message contains any transfer tool calls */\n        const aiMsg = msg as AIMessage | AIMessageChunk;\n        const toolCalls = aiMsg.tool_calls;\n\n        if (toolCalls && toolCalls.length > 0) {\n          /** Filter out all transfer tool calls */\n          const remainingToolCalls = toolCalls.filter(\n            (tc) => tc.id == null || !transferToolCallIds.has(tc.id)\n          );\n\n          const hasTransferCalls = remainingToolCalls.length < toolCalls.length;\n\n          if (hasTransferCalls) {\n            if (\n              remainingToolCalls.length > 0 ||\n              (typeof aiMsg.content === 'string' && aiMsg.content.trim())\n            ) {\n              /** Keep the message but without transfer tool calls */\n              const filteredAiMsg = new AIMessage({\n                content: aiMsg.content,\n                tool_calls: remainingToolCalls,\n                id: aiMsg.id,\n              });\n              filteredMessages.push(filteredAiMsg);\n            }\n            /** If no remaining content or tool calls, skip this message entirely */\n            continue;\n          }\n        }\n      }\n\n      /** Keep all other messages */\n      filteredMessages.push(msg);\n    }\n\n    return {\n      filteredMessages,\n      instructions,\n      sourceAgentName,\n      parallelSiblings,\n    };\n  }\n\n  /**\n   * Create the multi-agent workflow with dynamic handoffs\n   */\n  override createWorkflow(): t.CompiledMultiAgentWorkflow {\n    const StateAnnotation = Annotation.Root({\n      messages: Annotation<BaseMessage[]>({\n        reducer: (a, b) => {\n          if (!a.length) {\n            this.startIndex = a.length + b.length;\n          }\n          const result = messagesStateReducer(a, b);\n          this.messages = result;\n          return result;\n        },\n        default: () => [],\n      }),\n      /** Channel for passing filtered messages to agents when excludeResults is true */\n      agentMessages: Annotation<BaseMessage[]>({\n        /** Replaces state entirely */\n        reducer: (a, b) => b,\n        default: () => [],\n      }),\n    });\n\n    const builder = new StateGraph(StateAnnotation);\n\n    // Add all agents as complete subgraphs\n    for (const [agentId] of this.agentContexts) {\n      // Get all possible destinations for this agent\n      const handoffDestinations = new Set<string>();\n      const directDestinations = new Set<string>();\n\n      // Check handoff edges for destinations\n      for (const edge of this.handoffEdges) {\n        const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n        if (sources.includes(agentId) === true) {\n          const dests = Array.isArray(edge.to) ? edge.to : [edge.to];\n          dests.forEach((dest) => handoffDestinations.add(dest));\n        }\n      }\n\n      // Check direct edges for destinations\n      for (const edge of this.directEdges) {\n        const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n        if (sources.includes(agentId) === true) {\n          const dests = Array.isArray(edge.to) ? edge.to : [edge.to];\n          dests.forEach((dest) => directDestinations.add(dest));\n        }\n      }\n\n      /** Check if this agent has BOTH handoff and direct edges */\n      const hasHandoffEdges = handoffDestinations.size > 0;\n      const hasDirectEdges = directDestinations.size > 0;\n      const needsCommandRouting = hasHandoffEdges && hasDirectEdges;\n\n      /** Collect all possible destinations for this agent */\n      const allDestinations = new Set([\n        ...handoffDestinations,\n        ...directDestinations,\n      ]);\n      if (handoffDestinations.size > 0 || directDestinations.size === 0) {\n        allDestinations.add(END);\n      }\n\n      /** Agent subgraph (includes agent + tools) */\n      const agentSubgraph = this.createAgentSubgraph(agentId);\n\n      /** Wrapper function that handles agentMessages channel, handoff reception, and conditional routing */\n      const agentWrapper = async (\n        state: t.MultiAgentGraphState,\n        config?: LangGraphRunnableConfig\n      ): Promise<t.MultiAgentGraphState | Command> => {\n        let result: t.MultiAgentGraphState;\n\n        /**\n         * Check if this agent is receiving a handoff.\n         * If so, filter out the transfer messages and inject instructions as preamble.\n         * This prevents the receiving agent from seeing the transfer as \"completed work\"\n         * and prematurely producing an end token.\n         */\n        const handoffContext = this.processHandoffReception(\n          state.messages,\n          agentId\n        );\n\n        if (handoffContext !== null) {\n          const {\n            filteredMessages,\n            instructions,\n            sourceAgentName,\n            parallelSiblings,\n          } = handoffContext;\n\n          /**\n           * Set handoff context on the receiving agent.\n           * Uses pre-computed graph position for depth and parallel info.\n           */\n          const agentContext = this.agentContexts.get(agentId);\n          if (\n            agentContext &&\n            sourceAgentName != null &&\n            sourceAgentName !== ''\n          ) {\n            agentContext.setHandoffContext(sourceAgentName, parallelSiblings);\n          }\n\n          /** Build messages for the receiving agent */\n          let messagesForAgent = filteredMessages;\n\n          /**\n           * If there are instructions, inject them as a HumanMessage to\n           * ground the receiving agent.\n           *\n           * When the last filtered message is a ToolMessage (e.g. from a\n           * non-handoff tool the router called before handing off), a\n           * synthetic AIMessage is inserted first to satisfy the\n           * tool → assistant role ordering required by chat APIs.  Without\n           * this bridge, appending a HumanMessage directly after a\n           * ToolMessage causes \"400 Unexpected role 'user' after role\n           * 'tool'\" errors (see issue #54).\n           */\n          const hasInstructions = instructions !== null && instructions !== '';\n          if (hasInstructions) {\n            const lastMsg =\n              filteredMessages.length > 0\n                ? filteredMessages[filteredMessages.length - 1]\n                : null;\n\n            if (lastMsg != null && lastMsg.getType() === 'tool') {\n              messagesForAgent = [\n                ...filteredMessages,\n                new AIMessage(\n                  `[Processed tool result and transferring to ${agentId}]`\n                ),\n                new HumanMessage(instructions),\n              ];\n            } else {\n              messagesForAgent = [\n                ...filteredMessages,\n                new HumanMessage(instructions),\n              ];\n            }\n          }\n\n          /** Update token map if we have a token counter */\n          if (agentContext?.tokenCounter && hasInstructions) {\n            const freshTokenMap: Record<string, number> = {};\n            for (\n              let i = 0;\n              i < Math.min(filteredMessages.length, this.startIndex);\n              i++\n            ) {\n              const tokenCount = agentContext.indexTokenCountMap[i];\n              if (tokenCount !== undefined) {\n                freshTokenMap[i] = tokenCount;\n              }\n            }\n            /** Add tokens for the bridge AIMessage + instructions HumanMessage */\n            for (\n              let i = filteredMessages.length;\n              i < messagesForAgent.length;\n              i++\n            ) {\n              freshTokenMap[i] = agentContext.tokenCounter(messagesForAgent[i]);\n            }\n            agentContext.updateTokenMapWithInstructions(freshTokenMap);\n          }\n\n          const transformedState: t.MultiAgentGraphState = {\n            ...state,\n            messages: messagesForAgent,\n          };\n          result = await agentSubgraph.invoke(transformedState, config);\n          result = {\n            ...result,\n            agentMessages: [],\n          };\n        } else if (\n          state.agentMessages != null &&\n          state.agentMessages.length > 0\n        ) {\n          /**\n           * When using agentMessages (excludeResults=true), we need to update\n           * the token map to account for the new prompt message\n           */\n          const agentContext = this.agentContexts.get(agentId);\n          if (agentContext && agentContext.tokenCounter) {\n            /** The agentMessages contains:\n             * 1. Filtered messages (0 to startIndex) - already have token counts\n             * 2. New prompt message - needs token counting\n             */\n            const freshTokenMap: Record<string, number> = {};\n\n            /** Copy existing token counts for filtered messages (0 to startIndex) */\n            for (let i = 0; i < this.startIndex; i++) {\n              const tokenCount = agentContext.indexTokenCountMap[i];\n              if (tokenCount !== undefined) {\n                freshTokenMap[i] = tokenCount;\n              }\n            }\n\n            /** Calculate tokens only for the new prompt message (last message) */\n            const promptMessageIndex = state.agentMessages.length - 1;\n            if (promptMessageIndex >= this.startIndex) {\n              const promptMessage = state.agentMessages[promptMessageIndex];\n              freshTokenMap[promptMessageIndex] =\n                agentContext.tokenCounter(promptMessage);\n            }\n\n            /** Update the agent's token map with instructions added */\n            agentContext.updateTokenMapWithInstructions(freshTokenMap);\n          }\n\n          /** Temporary state with messages replaced by `agentMessages` */\n          const transformedState: t.MultiAgentGraphState = {\n            ...state,\n            messages: state.agentMessages,\n          };\n          result = await agentSubgraph.invoke(transformedState, config);\n          result = {\n            ...result,\n            /** Clear agentMessages for next agent */\n            agentMessages: [],\n          };\n        } else {\n          result = await agentSubgraph.invoke(state, config);\n        }\n\n        /** If agent has both handoff and direct edges, use Command for exclusive routing */\n        if (needsCommandRouting) {\n          /** Check if a handoff occurred */\n          const lastMessage = result.messages[\n            result.messages.length - 1\n          ] as BaseMessage | null;\n          if (\n            lastMessage != null &&\n            lastMessage.getType() === 'tool' &&\n            typeof lastMessage.name === 'string' &&\n            lastMessage.name.startsWith(Constants.LC_TRANSFER_TO_)\n          ) {\n            /** Handoff occurred - extract destination and navigate there exclusively */\n            const handoffDest = lastMessage.name.replace(\n              Constants.LC_TRANSFER_TO_,\n              ''\n            );\n            return new Command({\n              update: result,\n              goto: handoffDest,\n            });\n          } else {\n            /** No handoff - proceed with direct edges */\n            const directDests = Array.from(directDestinations);\n            if (directDests.length === 1) {\n              return new Command({\n                update: result,\n                goto: directDests[0],\n              });\n            } else if (directDests.length > 1) {\n              /** Multiple direct destinations - they'll run in parallel */\n              return new Command({\n                update: result,\n                goto: directDests,\n              });\n            }\n          }\n        }\n\n        /** No special routing needed - return state normally */\n        return result;\n      };\n\n      /** Wrapped agent as a node with its possible destinations */\n      builder.addNode(agentId, agentWrapper, {\n        ends: Array.from(allDestinations),\n      });\n    }\n\n    // Add starting edges for all starting nodes\n    for (const startNode of this.startingNodes) {\n      // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n      /** @ts-ignore */\n      builder.addEdge(START, startNode);\n    }\n\n    /**\n     * Add approval-gate nodes for sequence edges that declare an approvalGate\n     * config (Ranger-only feature, not present upstream). Gates fire\n     * regardless of ExecutionContext and sit between source and destination.\n     */\n    const gatedEdges = new Set<t.GraphEdge>();\n    for (const edge of this.directEdges) {\n      if (!edge.approvalGate) continue;\n\n      const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n      const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n\n      for (const source of sources) {\n        for (const dest of destinations) {\n          const gateNodeId = getApprovalGateNodeId(edge.approvalGate.gateId);\n          const gateNode = createApprovalGateNode(\n            edge.approvalGate,\n            source,\n            dest\n          );\n\n          // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n          /** @ts-ignore */\n          builder.addNode(gateNodeId, gateNode);\n          // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n          /** @ts-ignore */\n          builder.addEdge(source, gateNodeId);\n          // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n          /** @ts-ignore */\n          builder.addEdge(gateNodeId, dest);\n        }\n      }\n      gatedEdges.add(edge);\n    }\n\n    /**\n     * Add sequence edges for automatic transitions\n     * Group edges by destination to handle fan-in scenarios\n     * (Skip edges that already have an approval gate above.)\n     */\n    const edgesByDestination = new Map<string, t.GraphEdge[]>();\n\n    for (const edge of this.directEdges) {\n      if (gatedEdges.has(edge)) continue;\n      const destinations = Array.isArray(edge.to) ? edge.to : [edge.to];\n      for (const destination of destinations) {\n        if (!edgesByDestination.has(destination)) {\n          edgesByDestination.set(destination, []);\n        }\n        edgesByDestination.get(destination)!.push(edge);\n      }\n    }\n\n    for (const [destination, edges] of edgesByDestination) {\n      /** Checks if this is a fan-in scenario with prompt instructions */\n      const edgesWithPrompt = edges.filter(\n        (edge) => edge.prompt != null && edge.prompt !== ''\n      );\n\n      if (edgesWithPrompt.length > 0) {\n        /**\n         * Single wrapper node for destination (Fan-in with prompt)\n         */\n        const wrapperNodeId = `fan_in_${destination}_prompt`;\n        /**\n         * First edge's `prompt`\n         * (they should all be the same for fan-in)\n         */\n        const prompt = edgesWithPrompt[0].prompt;\n        /**\n         * First edge's `excludeResults` flag\n         * (they should all be the same for fan-in)\n         */\n        const excludeResults = edgesWithPrompt[0].excludeResults;\n\n        builder.addNode(wrapperNodeId, async (state: t.BaseGraphState) => {\n          let promptText: string | undefined;\n          let effectiveExcludeResults = excludeResults;\n\n          if (typeof prompt === 'function') {\n            promptText = await prompt(state.messages, this.startIndex);\n          } else if (prompt != null) {\n            if (prompt.includes('{results}')) {\n              const resultsMessages = state.messages.slice(this.startIndex);\n              const resultsString = getBufferString(resultsMessages);\n              const promptTemplate = PromptTemplate.fromTemplate(prompt);\n              const result = await promptTemplate.invoke({\n                results: resultsString,\n              });\n              promptText = result.value;\n              effectiveExcludeResults =\n                excludeResults !== false && promptText !== '';\n            } else {\n              promptText = prompt;\n            }\n          }\n\n          if (promptText != null && promptText !== '') {\n            if (\n              effectiveExcludeResults == null ||\n              effectiveExcludeResults === false\n            ) {\n              return {\n                messages: [new HumanMessage(promptText)],\n              };\n            }\n\n            /** When `excludeResults` is true, use agentMessages channel\n             * to pass filtered messages + prompt to the destination agent\n             */\n            const filteredMessages = state.messages.slice(0, this.startIndex);\n            return {\n              messages: [new HumanMessage(promptText)],\n              agentMessages: messagesStateReducer(filteredMessages, [\n                new HumanMessage(promptText),\n              ]),\n            };\n          }\n\n          /** No prompt needed, return empty update */\n          return {};\n        });\n\n        /** Add edges from all sources to the wrapper, then wrapper to destination */\n        for (const edge of edges) {\n          const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n          for (const source of sources) {\n            // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n            /** @ts-ignore */\n            builder.addEdge(source, wrapperNodeId);\n          }\n        }\n\n        /** Single edge from wrapper to destination */\n        // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n        /** @ts-ignore */\n        builder.addEdge(wrapperNodeId, destination);\n      } else {\n        /** No prompt instructions, add direct edges (skip if source uses Command routing) */\n        for (const edge of edges) {\n          const sources = Array.isArray(edge.from) ? edge.from : [edge.from];\n          for (const source of sources) {\n            /** Check if this source node has both handoff and direct edges */\n            const sourceHandoffEdges = this.handoffEdges.filter((e) => {\n              const eSources = Array.isArray(e.from) ? e.from : [e.from];\n              return eSources.includes(source);\n            });\n            const sourceDirectEdges = this.directEdges.filter((e) => {\n              const eSources = Array.isArray(e.from) ? e.from : [e.from];\n              return eSources.includes(source);\n            });\n\n            /** Skip adding edge if source uses Command routing (has both types) */\n            if (sourceHandoffEdges.length > 0 && sourceDirectEdges.length > 0) {\n              continue;\n            }\n\n            // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n            /** @ts-ignore */\n            builder.addEdge(source, destination);\n          }\n        }\n      }\n    }\n\n    return builder.compile(this.compileOptions as unknown as never);\n  }\n}\n"],"names":["StandardGraph","EdgeType","tools","tool","getCurrentTaskInput","ToolMessage","Command","Constants","messages","AIMessage","Annotation","messagesStateReducer","StateGraph","END","HumanMessage","START","getApprovalGateNodeId","createApprovalGateNode","getBufferString","PromptTemplate"],"mappings":";;;;;;;;;;;AA4BA;AACA,MAAM,4BAA4B,GAAG,qCAAqC;AAE1E;;;;;;;;;;;;;AAaG;AACG,MAAO,eAAgB,SAAQA,mBAAa,CAAA;AACxC,IAAA,KAAK;AACL,IAAA,aAAa,GAAgB,IAAI,GAAG,EAAE;IACtC,WAAW,GAAkB,EAAE;IAC/B,YAAY,GAAkB,EAAE;AACxC;;;;;;;;;AASG;AACK,IAAA,mBAAmB,GAAwB,IAAI,GAAG,EAAE;AAE5D,IAAA,WAAA,CAAY,KAA6B,EAAA;QACvC,KAAK,CAAC,KAAK,CAAC;AACZ,QAAA,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK;QACxB,IAAI,CAAC,kBAAkB,EAAE;QACzB,IAAI,CAAC,eAAe,EAAE;QACtB,IAAI,CAAC,YAAY,EAAE;QACnB,IAAI,CAAC,kBAAkB,EAAE;IAC3B;AAEA;;;;;;;;;;AAUG;IACK,kBAAkB,GAAA;AACxB,QAAA,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;AAChD,QAAA,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU;AACjC,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;AAC7B,YAAA,MAAM,YAAY,GAAG;gBACnB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAClD;AACD,YAAA,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE;AAC7B,gBAAA,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;AAC5C,oBAAA,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACjB;YACF;QACF;AACA,QAAA,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE;YACtB;QACF;AACA,QAAA,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO;aAC/B,GAAG,CAAC,CAAC,EAAE,KAAK,CAAA,CAAA,EAAI,EAAE,CAAA,CAAA,CAAG;aACrB,IAAI,CAAC,IAAI,CAAC;AACb,QAAA,MAAM,IAAI,KAAK,CACb,CAAA,kEAAA,EAAqE,OAAO,CAAA,GAAA,CAAK;YAC/E,mFAAmF;AACnF,YAAA,yDAAyD,CAC5D;IACH;AAEA;;AAEG;IACK,eAAe,GAAA;AACrB,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;;;YAG7B,IAAI,IAAI,CAAC,QAAQ,KAAKC,cAAQ,CAAC,MAAM,EAAE;AACrC,gBAAA,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;YAC7B;AAAO,iBAAA,IAAI,IAAI,CAAC,QAAQ,KAAKA,cAAQ,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,EAAE;AACvE,gBAAA,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAC9B;iBAAO;;gBAEL,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjE,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAElE,gBAAA,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;;AAEnD,oBAAA,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC7B;qBAAO;;AAEL,oBAAA,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC9B;YACF;QACF;IACF;AAEA;;AAEG;IACK,YAAY,GAAA;AAClB,QAAA,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU;;AAGzC,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;YAC7B,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AACjE,YAAA,YAAY,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3D;;QAGA,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE;YAC/C,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;AACjC,gBAAA,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC;YACjC;QACF;;AAGA,QAAA,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE;AAChE,YAAA,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAM,CAAC;QACjE;;QAGA,IAAI,CAAC,yBAAyB,EAAE;IAClC;AAEA;;;;;;;;;;;;;AAaG;IACK,yBAAyB,GAAA;AAC/B,QAAA,IAAI,YAAY,GAAG,CAAC,CAAC;;QAGrB,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE;AAC/B,YAAA,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,aAAa,EAAE;gBACxC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,CAAC;YACrD;AACA,YAAA,YAAY,EAAE;QAChB;;;AAIA,QAAA,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU;QACjC,MAAM,KAAK,GAAa,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;AAE/C,QAAA,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACvB,YAAA,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG;AAC9B,YAAA,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE;AAC1B,YAAA,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;;AAGpB,YAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE;gBACnC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAClE,gBAAA,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAAE;gBAEhC,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;;AAGjE,gBAAA,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;AAC3B,oBAAA,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE;;wBAE/B,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;4BACvC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC;wBAClD;wBACA,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AACtB,4BAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;wBAClB;oBACF;AACA,oBAAA,YAAY,EAAE;gBAChB;qBAAO;;AAEL,oBAAA,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE;wBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AACtB,4BAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;wBAClB;oBACF;gBACF;YACF;;AAGA,YAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE;gBACpC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAClE,gBAAA,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;oBAAE;gBAEhC,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AACjE,gBAAA,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE;oBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AACtB,wBAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;oBAClB;gBACF;YACF;QACF;IACF;AAEA;;;;AAIG;AACH,IAAA,kBAAkB,CAAC,OAAe,EAAA;QAChC,OAAO,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC;IAC9C;AAEA;;;AAGG;IACgB,iBAAiB,GAAA;AAClC,QAAA,OAAO,IAAI;IACb;AAEA;;AAEG;AACgB,IAAA,0BAA0B,CAC3C,OAAe,EAAA;QAEf,OAAO,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC;IAC9C;AAEA;;AAEG;IACK,kBAAkB,GAAA;;AAExB,QAAA,MAAM,eAAe,GAAG,IAAI,GAAG,EAAyB;;AAGxD,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE;YACpC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAClE,YAAA,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,KAAI;gBACzB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;AAChC,oBAAA,eAAe,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;gBACjC;gBACA,eAAe,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC;AACzC,YAAA,CAAC,CAAC;QACJ;;QAGA,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,eAAe,EAAE;YAC9C,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC;AACpD,YAAA,IAAI,CAAC,YAAY;gBAAE;;YAGnB,MAAM,YAAY,GAAoB,EAAE;AACxC,YAAA,MAAM,eAAe,GAAG,YAAY,CAAC,IAAI,IAAI,OAAO;AACpD,YAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AACxB,gBAAA,YAAY,CAAC,IAAI,CACf,GAAG,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,OAAO,EAAE,eAAe,CAAC,CAClE;YACH;AAEA,YAAA,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE;AAC5B,gBAAA,YAAY,CAAC,UAAU,GAAG,EAAE;YAC9B;YACA,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC;QAC/C;IACF;AAEA;;;;;AAKG;AACK,IAAA,yBAAyB,CAC/B,IAAiB,EACjB,aAAqB,EACrB,eAAuB,EAAA;QAEvB,MAAMC,OAAK,GAAoB,EAAE;QACjC,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;;AAGjE,QAAA,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,EAAE;YAC1B,MAAM,QAAQ,GAAG,sBAAsB;AACvC,YAAA,MAAM,eAAe,GACnB,IAAI,CAAC,WAAW,IAAI,+CAA+C;;AAGrE,YAAA,MAAM,eAAe,GACnB,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ;AACxD,YAAA,MAAM,uBAAuB,GAAG,eAAe,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS;AACzE,YAAA,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,cAAc;YAElDA,OAAK,CAAC,IAAI,CACRC,UAAI,CACF,OAAO,QAAQ,EAAE,MAAM,KAAI;gBACzB,MAAM,KAAK,GAAG,QAAmC;AACjD,gBAAA,MAAM,KAAK,GAAGC,6BAAmB,EAAsB;AACvD,gBAAA,MAAM,UAAU,GACb,MAAyC,EAAE,QAAQ,EAAE,EAAE;AACxD,oBAAA,SAAS;;gBAGX,MAAM,MAAM,GAAG,IAAI,CAAC,SAAU,CAAC,KAAK,CAAC;AACrC,gBAAA,IAAI,WAAmB;AAEvB,gBAAA,IAAI,OAAO,MAAM,KAAK,SAAS,EAAE;;AAE/B,oBAAA,IAAI,CAAC,MAAM;AAAE,wBAAA,OAAO,IAAI;AACxB,oBAAA,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC;gBAC/B;AAAO,qBAAA,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;oBACrC,WAAW,GAAG,MAAM;gBACtB;qBAAO;;oBAEL,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;gBACnE;AAEA,gBAAA,IAAI,OAAO,GAAG,CAAA,6BAAA,EAAgC,WAAW,EAAE;AAC3D,gBAAA,IACE,eAAe;AACf,oBAAA,SAAS,IAAI,KAAK;AAClB,oBAAA,KAAK,CAAC,SAAS,CAAC,IAAI,IAAI,EACxB;oBACA,OAAO,IAAI,CAAA,IAAA,EAAO,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA,EAAA,EAAK,KAAK,CAAC,SAAS,CAAC,CAAA,CAAE;gBACjG;AAEA,gBAAA,MAAM,WAAW,GAAG,IAAIC,oBAAW,CAAC;oBAClC,OAAO;AACP,oBAAA,IAAI,EAAE,QAAQ;AACd,oBAAA,YAAY,EAAE,UAAU;AACxB,oBAAA,iBAAiB,EAAE;;AAEjB,wBAAA,mBAAmB,EAAE,WAAW;;AAEhC,wBAAA,mBAAmB,EAAE,eAAe;AACrC,qBAAA;AACF,iBAAA,CAAC;gBAEF,OAAO,IAAIC,iBAAO,CAAC;AACjB,oBAAA,IAAI,EAAE,WAAW;AACjB,oBAAA,MAAM,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE;oBACxD,KAAK,EAAEA,iBAAO,CAAC,MAAM;AACtB,iBAAA,CAAC;AACJ,YAAA,CAAC,EACD;AACE,gBAAA,IAAI,EAAE,QAAQ;AACd,gBAAA,MAAM,EAAE;AACN,sBAAE;AACE,wBAAA,IAAI,EAAE,QAAQ;AACd,wBAAA,UAAU,EAAE;4BACV,CAAC,SAAS,GAAG;AACX,gCAAA,IAAI,EAAE,QAAQ;AACd,gCAAA,WAAW,EAAE,uBAAiC;AAC/C,6BAAA;AACF,yBAAA;AACD,wBAAA,QAAQ,EAAE,EAAE;AACb;AACH,sBAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE;AACpD,gBAAA,WAAW,EAAE,eAAe;AAC7B,aAAA,CACF,CACF;QACH;aAAO;;AAEL,YAAA,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE;gBACtC,MAAM,QAAQ,GAAG,CAAA,EAAGC,eAAS,CAAC,eAAe,CAAA,EAAG,WAAW,CAAA,CAAE;gBAC7D,MAAM,eAAe,GACnB,IAAI,CAAC,WAAW,IAAI,CAAA,2BAAA,EAA8B,WAAW,CAAA,CAAA,CAAG;;AAGlE,gBAAA,MAAM,eAAe,GACnB,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ;gBACxD,MAAM,uBAAuB,GAAG;sBAC5B,IAAI,CAAC;sBACL,SAAS;AACb,gBAAA,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,cAAc;gBAElDL,OAAK,CAAC,IAAI,CACRC,UAAI,CACF,OAAO,QAAQ,EAAE,MAAM,KAAI;oBACzB,MAAM,KAAK,GAAG,QAAmC;AACjD,oBAAA,MAAM,UAAU,GACb,MAAyC,EAAE,QAAQ,EAAE,EAAE;AACxD,wBAAA,SAAS;AAEX,oBAAA,IAAI,OAAO,GAAG,CAAA,4BAAA,EAA+B,WAAW,EAAE;AAC1D,oBAAA,IACE,eAAe;AACf,wBAAA,SAAS,IAAI,KAAK;AAClB,wBAAA,KAAK,CAAC,SAAS,CAAC,IAAI,IAAI,EACxB;wBACA,OAAO,IAAI,CAAA,IAAA,EAAO,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA,EAAA,EAAK,KAAK,CAAC,SAAS,CAAC,CAAA,CAAE;oBACjG;AAEA,oBAAA,MAAM,WAAW,GAAG,IAAIE,oBAAW,CAAC;wBAClC,OAAO;AACP,wBAAA,IAAI,EAAE,QAAQ;AACd,wBAAA,YAAY,EAAE,UAAU;AACxB,wBAAA,iBAAiB,EAAE;;AAEjB,4BAAA,mBAAmB,EAAE,eAAe;AACrC,yBAAA;AACF,qBAAA,CAAC;AAEF,oBAAA,MAAM,KAAK,GAAGD,6BAAmB,EAAsB;AAEvD;;;;;;;;;;AAUG;AACH,oBAAA,MAAMI,UAAQ,GAAG,KAAK,CAAC,QAAQ;oBAC/B,IAAI,gBAAgB,GAAGA,UAAQ;AAC/B,oBAAA,IAAI,cAAc,GAAG,EAAE;;AAGvB,oBAAA,KAAK,IAAI,CAAC,GAAGA,UAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC7C,wBAAA,MAAM,GAAG,GAAGA,UAAQ,CAAC,CAAC,CAAC;AACvB,wBAAA,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE;4BAC1B,MAAM,KAAK,GAAG,GAAgB;AAC9B,4BAAA,MAAM,WAAW,GAAG,KAAK,CAAC,UAAU,EAAE,IAAI,CACxC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,UAAU,CAC7B;AACD,4BAAA,IAAI,WAAW,KAAK,IAAI,EAAE;gCACxB,cAAc,GAAG,CAAC;gCAClB;4BACF;wBACF;oBACF;AAEA,oBAAA,IAAI,cAAc,IAAI,CAAC,EAAE;AACvB,wBAAA,MAAM,aAAa,GAAGA,UAAQ,CAAC,cAAc,CAAc;AAC3D,wBAAA,MAAM,YAAY,GAAG,aAAa,CAAC,UAAU,EAAE,IAAI,CACjD,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,UAAU,CAC7B;wBAED,IACE,YAAY,IAAI,IAAI;4BACpB,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,IAAI,CAAC,EAC3C;AACA;;;AAGG;AACH,4BAAA,MAAM,aAAa,GAAG,IAAIC,kBAAS,CAAC;gCAClC,OAAO,EAAE,aAAa,CAAC,OAAO;gCAC9B,UAAU,EAAE,CAAC,YAAY,CAAC;gCAC1B,EAAE,EAAE,aAAa,CAAC,EAAE;AACrB,6BAAA,CAAC;AAEF,4BAAA,gBAAgB,GAAG;AACjB,gCAAA,GAAGD,UAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;gCACpC,aAAa;gCACb,WAAW;6BACZ;wBACH;6BAAO;;AAEL,4BAAA,gBAAgB,GAAGA,UAAQ,CAAC,MAAM,CAAC,WAAW,CAAC;wBACjD;oBACF;yBAAO;;AAEL,wBAAA,gBAAgB,GAAGA,UAAQ,CAAC,MAAM,CAAC,WAAW,CAAC;oBACjD;oBAEA,OAAO,IAAIF,iBAAO,CAAC;AACjB,wBAAA,IAAI,EAAE,WAAW;AACjB,wBAAA,MAAM,EAAE,EAAE,QAAQ,EAAE,gBAAgB,EAAE;wBACtC,KAAK,EAAEA,iBAAO,CAAC,MAAM;AACtB,qBAAA,CAAC;AACJ,gBAAA,CAAC,EACD;AACE,oBAAA,IAAI,EAAE,QAAQ;AACd,oBAAA,MAAM,EAAE;AACN,0BAAE;AACE,4BAAA,IAAI,EAAE,QAAQ;AACd,4BAAA,UAAU,EAAE;gCACV,CAAC,SAAS,GAAG;AACX,oCAAA,IAAI,EAAE,QAAQ;AACd,oCAAA,WAAW,EAAE,uBAAiC;AAC/C,iCAAA;AACF,6BAAA;AACD,4BAAA,QAAQ,EAAE,EAAE;AACb;AACH,0BAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE;AACpD,oBAAA,WAAW,EAAE,eAAe;AAC7B,iBAAA,CACF,CACF;YACH;QACF;AAEA,QAAA,OAAOJ,OAAK;IACd;AAEA;;AAEG;AACK,IAAA,mBAAmB,CAAC,OAAe,EAAA;;AAEzC,QAAA,OAAO,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC;IACtC;AAEA;;;;;;;;;;;AAWG;IACK,uBAAuB,CAC7BM,UAAuB,EACvB,OAAe,EAAA;AAOf,QAAA,IAAIA,UAAQ,CAAC,MAAM,KAAK,CAAC;AAAE,YAAA,OAAO,IAAI;AAEtC;;;;AAIG;QACH,IAAI,WAAW,GAAuB,IAAI;AAC1C,QAAA,IAAI,gBAAgB,GAAG,EAAE;AAEzB,QAAA,KAAK,IAAI,CAAC,GAAGA,UAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC7C,YAAA,MAAM,GAAG,GAAGA,UAAQ,CAAC,CAAC,CAAC;AACvB,YAAA,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,MAAM;gBAAE;YAE9B,MAAM,YAAY,GAAG,GAAkB;AACvC,YAAA,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI;YAElC,IAAI,OAAO,QAAQ,KAAK,QAAQ;gBAAE;;YAGlC,MAAM,iBAAiB,GAAG,QAAQ,CAAC,UAAU,CAACD,eAAS,CAAC,eAAe,CAAC;AACxE,YAAA,MAAM,qBAAqB,GAAG,QAAQ,KAAK,sBAAsB;AAEjE,YAAA,IAAI,CAAC,iBAAiB,IAAI,CAAC,qBAAqB;gBAAE;;YAGlD,IAAI,gBAAgB,GAAkB,IAAI;YAE1C,IAAI,iBAAiB,EAAE;gBACrB,gBAAgB,GAAG,QAAQ,CAAC,OAAO,CAACA,eAAS,CAAC,eAAe,EAAE,EAAE,CAAC;YACpE;iBAAO,IAAI,qBAAqB,EAAE;AAChC,gBAAA,MAAM,WAAW,GAAG,YAAY,CAAC,iBAAiB,CAAC,mBAAmB;AACtE,gBAAA,gBAAgB,GAAG,OAAO,WAAW,KAAK,QAAQ,GAAG,WAAW,GAAG,IAAI;YACzE;;AAGA,YAAA,IAAI,gBAAgB,KAAK,OAAO,EAAE;gBAChC,WAAW,GAAG,YAAY;gBAC1B,gBAAgB,GAAG,CAAC;gBACpB;YACF;QACF;;AAGA,QAAA,IAAI,WAAW,KAAK,IAAI,IAAI,gBAAgB,GAAG,CAAC;AAAE,YAAA,OAAO,IAAI;;AAG7D,QAAA,MAAM,UAAU,GACd,OAAO,WAAW,CAAC,OAAO,KAAK;cAC3B,WAAW,CAAC;cACZ,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,OAAO,CAAC;QAEzC,MAAM,iBAAiB,GAAG,UAAU,CAAC,KAAK,CAAC,4BAA4B,CAAC;AACxE,QAAA,MAAM,YAAY,GAAG,iBAAiB,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI;;AAG3D,QAAA,MAAM,iBAAiB,GAAG,WAAW,CAAC,iBAAiB,CAAC,mBAAmB;AAC3E,QAAA,MAAM,eAAe,GACnB,OAAO,iBAAiB,KAAK,QAAQ,GAAG,iBAAiB,GAAG,IAAI;;AAGlE,QAAA,MAAM,WAAW,GAAG,WAAW,CAAC,iBAAiB,CAAC,yBAAyB;AAC3E,QAAA,MAAM,UAAU,GAAa,KAAK,CAAC,OAAO,CAAC,WAAW;AACpD,cAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,KAAkB,OAAO,CAAC,KAAK,QAAQ;cAC5D,EAAE;;QAEN,MAAM,gBAAgB,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,KAAI;YAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;AACtC,YAAA,OAAO,GAAG,EAAE,IAAI,IAAI,EAAE;AACxB,QAAA,CAAC,CAAC;;AAGF,QAAA,MAAM,UAAU,GAAG,WAAW,CAAC,YAAY;AAE3C;;;;AAIG;QACH,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAS,CAAC,UAAU,CAAC,CAAC;AACzD,QAAA,KAAK,MAAM,GAAG,IAAIC,UAAQ,EAAE;AAC1B,YAAA,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,MAAM;gBAAE;YAC9B,MAAM,EAAE,GAAG,GAAkB;AAC7B,YAAA,MAAM,KAAK,GAAG,EAAE,CAAC,IAAI;YACrB,IAAI,OAAO,KAAK,KAAK,QAAQ;gBAAE;AAC/B,YAAA,IACE,KAAK,CAAC,UAAU,CAACD,eAAS,CAAC,eAAe,CAAC;gBAC3C,KAAK,KAAK,sBAAsB,EAChC;AACA,gBAAA,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC;YAC1C;QACF;;QAGA,MAAM,gBAAgB,GAAkB,EAAE;AAE1C,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAGC,UAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACxC,YAAA,MAAM,GAAG,GAAGA,UAAQ,CAAC,CAAC,CAAC;AACvB,YAAA,MAAM,OAAO,GAAG,GAAG,CAAC,OAAO,EAAE;;AAG7B,YAAA,IAAI,OAAO,KAAK,MAAM,EAAE;gBACtB,MAAM,EAAE,GAAG,GAAkB;gBAC7B,IAAI,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,EAAE;oBAC5C;gBACF;YACF;AAEA,YAAA,IAAI,OAAO,KAAK,IAAI,EAAE;;gBAEpB,MAAM,KAAK,GAAG,GAAiC;AAC/C,gBAAA,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU;gBAElC,IAAI,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;;oBAErC,MAAM,kBAAkB,GAAG,SAAS,CAAC,MAAM,CACzC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CACzD;oBAED,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM;oBAErE,IAAI,gBAAgB,EAAE;AACpB,wBAAA,IACE,kBAAkB,CAAC,MAAM,GAAG,CAAC;AAC7B,6BAAC,OAAO,KAAK,CAAC,OAAO,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAC3D;;AAEA,4BAAA,MAAM,aAAa,GAAG,IAAIC,kBAAS,CAAC;gCAClC,OAAO,EAAE,KAAK,CAAC,OAAO;AACtB,gCAAA,UAAU,EAAE,kBAAkB;gCAC9B,EAAE,EAAE,KAAK,CAAC,EAAE;AACb,6BAAA,CAAC;AACF,4BAAA,gBAAgB,CAAC,IAAI,CAAC,aAAa,CAAC;wBACtC;;wBAEA;oBACF;gBACF;YACF;;AAGA,YAAA,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC;QAC5B;QAEA,OAAO;YACL,gBAAgB;YAChB,YAAY;YACZ,eAAe;YACf,gBAAgB;SACjB;IACH;AAEA;;AAEG;IACM,cAAc,GAAA;AACrB,QAAA,MAAM,eAAe,GAAGC,oBAAU,CAAC,IAAI,CAAC;YACtC,QAAQ,EAAEA,oBAAU,CAAgB;AAClC,gBAAA,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,KAAI;AAChB,oBAAA,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE;wBACb,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM;oBACvC;oBACA,MAAM,MAAM,GAAGC,8BAAoB,CAAC,CAAC,EAAE,CAAC,CAAC;AACzC,oBAAA,IAAI,CAAC,QAAQ,GAAG,MAAM;AACtB,oBAAA,OAAO,MAAM;gBACf,CAAC;AACD,gBAAA,OAAO,EAAE,MAAM,EAAE;aAClB,CAAC;;YAEF,aAAa,EAAED,oBAAU,CAAgB;;gBAEvC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC;AACpB,gBAAA,OAAO,EAAE,MAAM,EAAE;aAClB,CAAC;AACH,SAAA,CAAC;AAEF,QAAA,MAAM,OAAO,GAAG,IAAIE,oBAAU,CAAC,eAAe,CAAC;;QAG/C,KAAK,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE;;AAE1C,YAAA,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAU;AAC7C,YAAA,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAU;;AAG5C,YAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE;gBACpC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAClE,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE;oBACtC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC1D,oBAAA,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACxD;YACF;;AAGA,YAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE;gBACnC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBAClE,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE;oBACtC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAC1D,oBAAA,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACvD;YACF;;AAGA,YAAA,MAAM,eAAe,GAAG,mBAAmB,CAAC,IAAI,GAAG,CAAC;AACpD,YAAA,MAAM,cAAc,GAAG,kBAAkB,CAAC,IAAI,GAAG,CAAC;AAClD,YAAA,MAAM,mBAAmB,GAAG,eAAe,IAAI,cAAc;;AAG7D,YAAA,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;AAC9B,gBAAA,GAAG,mBAAmB;AACtB,gBAAA,GAAG,kBAAkB;AACtB,aAAA,CAAC;AACF,YAAA,IAAI,mBAAmB,CAAC,IAAI,GAAG,CAAC,IAAI,kBAAkB,CAAC,IAAI,KAAK,CAAC,EAAE;AACjE,gBAAA,eAAe,CAAC,GAAG,CAACC,aAAG,CAAC;YAC1B;;YAGA,MAAM,aAAa,GAAG,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC;;YAGvD,MAAM,YAAY,GAAG,OACnB,KAA6B,EAC7B,MAAgC,KACa;AAC7C,gBAAA,IAAI,MAA8B;AAElC;;;;;AAKG;AACH,gBAAA,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,CACjD,KAAK,CAAC,QAAQ,EACd,OAAO,CACR;AAED,gBAAA,IAAI,cAAc,KAAK,IAAI,EAAE;oBAC3B,MAAM,EACJ,gBAAgB,EAChB,YAAY,EACZ,eAAe,EACf,gBAAgB,GACjB,GAAG,cAAc;AAElB;;;AAGG;oBACH,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC;AACpD,oBAAA,IACE,YAAY;AACZ,wBAAA,eAAe,IAAI,IAAI;wBACvB,eAAe,KAAK,EAAE,EACtB;AACA,wBAAA,YAAY,CAAC,iBAAiB,CAAC,eAAe,EAAE,gBAAgB,CAAC;oBACnE;;oBAGA,IAAI,gBAAgB,GAAG,gBAAgB;AAEvC;;;;;;;;;;;AAWG;oBACH,MAAM,eAAe,GAAG,YAAY,KAAK,IAAI,IAAI,YAAY,KAAK,EAAE;oBACpE,IAAI,eAAe,EAAE;AACnB,wBAAA,MAAM,OAAO,GACX,gBAAgB,CAAC,MAAM,GAAG;8BACtB,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC;8BAC5C,IAAI;wBAEV,IAAI,OAAO,IAAI,IAAI,IAAI,OAAO,CAAC,OAAO,EAAE,KAAK,MAAM,EAAE;AACnD,4BAAA,gBAAgB,GAAG;AACjB,gCAAA,GAAG,gBAAgB;AACnB,gCAAA,IAAIJ,kBAAS,CACX,CAAA,2CAAA,EAA8C,OAAO,GAAG,CACzD;gCACD,IAAIK,qBAAY,CAAC,YAAY,CAAC;6BAC/B;wBACH;6BAAO;AACL,4BAAA,gBAAgB,GAAG;AACjB,gCAAA,GAAG,gBAAgB;gCACnB,IAAIA,qBAAY,CAAC,YAAY,CAAC;6BAC/B;wBACH;oBACF;;AAGA,oBAAA,IAAI,YAAY,EAAE,YAAY,IAAI,eAAe,EAAE;wBACjD,MAAM,aAAa,GAA2B,EAAE;wBAChD,KACE,IAAI,CAAC,GAAG,CAAC,EACT,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,EACtD,CAAC,EAAE,EACH;4BACA,MAAM,UAAU,GAAG,YAAY,CAAC,kBAAkB,CAAC,CAAC,CAAC;AACrD,4BAAA,IAAI,UAAU,KAAK,SAAS,EAAE;AAC5B,gCAAA,aAAa,CAAC,CAAC,CAAC,GAAG,UAAU;4BAC/B;wBACF;;AAEA,wBAAA,KACE,IAAI,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAC/B,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAC3B,CAAC,EAAE,EACH;AACA,4BAAA,aAAa,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;wBACnE;AACA,wBAAA,YAAY,CAAC,8BAA8B,CAAC,aAAa,CAAC;oBAC5D;AAEA,oBAAA,MAAM,gBAAgB,GAA2B;AAC/C,wBAAA,GAAG,KAAK;AACR,wBAAA,QAAQ,EAAE,gBAAgB;qBAC3B;oBACD,MAAM,GAAG,MAAM,aAAa,CAAC,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC;AAC7D,oBAAA,MAAM,GAAG;AACP,wBAAA,GAAG,MAAM;AACT,wBAAA,aAAa,EAAE,EAAE;qBAClB;gBACH;AAAO,qBAAA,IACL,KAAK,CAAC,aAAa,IAAI,IAAI;AAC3B,oBAAA,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAC9B;AACA;;;AAGG;oBACH,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC;AACpD,oBAAA,IAAI,YAAY,IAAI,YAAY,CAAC,YAAY,EAAE;AAC7C;;;AAGG;wBACH,MAAM,aAAa,GAA2B,EAAE;;AAGhD,wBAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;4BACxC,MAAM,UAAU,GAAG,YAAY,CAAC,kBAAkB,CAAC,CAAC,CAAC;AACrD,4BAAA,IAAI,UAAU,KAAK,SAAS,EAAE;AAC5B,gCAAA,aAAa,CAAC,CAAC,CAAC,GAAG,UAAU;4BAC/B;wBACF;;wBAGA,MAAM,kBAAkB,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC;AACzD,wBAAA,IAAI,kBAAkB,IAAI,IAAI,CAAC,UAAU,EAAE;4BACzC,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,kBAAkB,CAAC;4BAC7D,aAAa,CAAC,kBAAkB,CAAC;AAC/B,gCAAA,YAAY,CAAC,YAAY,CAAC,aAAa,CAAC;wBAC5C;;AAGA,wBAAA,YAAY,CAAC,8BAA8B,CAAC,aAAa,CAAC;oBAC5D;;AAGA,oBAAA,MAAM,gBAAgB,GAA2B;AAC/C,wBAAA,GAAG,KAAK;wBACR,QAAQ,EAAE,KAAK,CAAC,aAAa;qBAC9B;oBACD,MAAM,GAAG,MAAM,aAAa,CAAC,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC;AAC7D,oBAAA,MAAM,GAAG;AACP,wBAAA,GAAG,MAAM;;AAET,wBAAA,aAAa,EAAE,EAAE;qBAClB;gBACH;qBAAO;oBACL,MAAM,GAAG,MAAM,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC;gBACpD;;gBAGA,IAAI,mBAAmB,EAAE;;AAEvB,oBAAA,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CACjC,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CACL;oBACvB,IACE,WAAW,IAAI,IAAI;AACnB,wBAAA,WAAW,CAAC,OAAO,EAAE,KAAK,MAAM;AAChC,wBAAA,OAAO,WAAW,CAAC,IAAI,KAAK,QAAQ;wBACpC,WAAW,CAAC,IAAI,CAAC,UAAU,CAACP,eAAS,CAAC,eAAe,CAAC,EACtD;;AAEA,wBAAA,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAC1CA,eAAS,CAAC,eAAe,EACzB,EAAE,CACH;wBACD,OAAO,IAAID,iBAAO,CAAC;AACjB,4BAAA,MAAM,EAAE,MAAM;AACd,4BAAA,IAAI,EAAE,WAAW;AAClB,yBAAA,CAAC;oBACJ;yBAAO;;wBAEL,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC;AAClD,wBAAA,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE;4BAC5B,OAAO,IAAIA,iBAAO,CAAC;AACjB,gCAAA,MAAM,EAAE,MAAM;AACd,gCAAA,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;AACrB,6BAAA,CAAC;wBACJ;AAAO,6BAAA,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;;4BAEjC,OAAO,IAAIA,iBAAO,CAAC;AACjB,gCAAA,MAAM,EAAE,MAAM;AACd,gCAAA,IAAI,EAAE,WAAW;AAClB,6BAAA,CAAC;wBACJ;oBACF;gBACF;;AAGA,gBAAA,OAAO,MAAM;AACf,YAAA,CAAC;;AAGD,YAAA,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,YAAY,EAAE;AACrC,gBAAA,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC;AAClC,aAAA,CAAC;QACJ;;AAGA,QAAA,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,aAAa,EAAE;;;AAG1C,YAAA,OAAO,CAAC,OAAO,CAACS,eAAK,EAAE,SAAS,CAAC;QACnC;AAEA;;;;AAIG;AACH,QAAA,MAAM,UAAU,GAAG,IAAI,GAAG,EAAe;AACzC,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE;YACnC,IAAI,CAAC,IAAI,CAAC,YAAY;gBAAE;YAExB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAClE,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AAEjE,YAAA,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;AAC5B,gBAAA,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE;oBAC/B,MAAM,UAAU,GAAGC,sCAAqB,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;AAClE,oBAAA,MAAM,QAAQ,GAAGC,uCAAsB,CACrC,IAAI,CAAC,YAAY,EACjB,MAAM,EACN,IAAI,CACL;;;AAID,oBAAA,OAAO,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC;;;AAGrC,oBAAA,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC;;;AAGnC,oBAAA,OAAO,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC;gBACnC;YACF;AACA,YAAA,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;QACtB;AAEA;;;;AAIG;AACH,QAAA,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAyB;AAE3D,QAAA,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE;AACnC,YAAA,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE;YAC1B,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;AACjE,YAAA,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE;gBACtC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE;AACxC,oBAAA,kBAAkB,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,CAAC;gBACzC;gBACA,kBAAkB,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC;YACjD;QACF;QAEA,KAAK,MAAM,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,kBAAkB,EAAE;;YAErD,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAClC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE,CACpD;AAED,YAAA,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE;AAC9B;;AAEG;AACH,gBAAA,MAAM,aAAa,GAAG,CAAA,OAAA,EAAU,WAAW,SAAS;AACpD;;;AAGG;gBACH,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,MAAM;AACxC;;;AAGG;gBACH,MAAM,cAAc,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,cAAc;gBAExD,OAAO,CAAC,OAAO,CAAC,aAAa,EAAE,OAAO,KAAuB,KAAI;AAC/D,oBAAA,IAAI,UAA8B;oBAClC,IAAI,uBAAuB,GAAG,cAAc;AAE5C,oBAAA,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE;AAChC,wBAAA,UAAU,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC;oBAC5D;AAAO,yBAAA,IAAI,MAAM,IAAI,IAAI,EAAE;AACzB,wBAAA,IAAI,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE;AAChC,4BAAA,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;AAC7D,4BAAA,MAAM,aAAa,GAAGC,wBAAe,CAAC,eAAe,CAAC;4BACtD,MAAM,cAAc,GAAGC,sBAAc,CAAC,YAAY,CAAC,MAAM,CAAC;AAC1D,4BAAA,MAAM,MAAM,GAAG,MAAM,cAAc,CAAC,MAAM,CAAC;AACzC,gCAAA,OAAO,EAAE,aAAa;AACvB,6BAAA,CAAC;AACF,4BAAA,UAAU,GAAG,MAAM,CAAC,KAAK;4BACzB,uBAAuB;AACrB,gCAAA,cAAc,KAAK,KAAK,IAAI,UAAU,KAAK,EAAE;wBACjD;6BAAO;4BACL,UAAU,GAAG,MAAM;wBACrB;oBACF;oBAEA,IAAI,UAAU,IAAI,IAAI,IAAI,UAAU,KAAK,EAAE,EAAE;wBAC3C,IACE,uBAAuB,IAAI,IAAI;4BAC/B,uBAAuB,KAAK,KAAK,EACjC;4BACA,OAAO;AACL,gCAAA,QAAQ,EAAE,CAAC,IAAIL,qBAAY,CAAC,UAAU,CAAC,CAAC;6BACzC;wBACH;AAEA;;AAEG;AACH,wBAAA,MAAM,gBAAgB,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC;wBACjE,OAAO;AACL,4BAAA,QAAQ,EAAE,CAAC,IAAIA,qBAAY,CAAC,UAAU,CAAC,CAAC;AACxC,4BAAA,aAAa,EAAEH,8BAAoB,CAAC,gBAAgB,EAAE;gCACpD,IAAIG,qBAAY,CAAC,UAAU,CAAC;6BAC7B,CAAC;yBACH;oBACH;;AAGA,oBAAA,OAAO,EAAE;AACX,gBAAA,CAAC,CAAC;;AAGF,gBAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;oBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAClE,oBAAA,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;;;AAG5B,wBAAA,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC;oBACxC;gBACF;;;;AAKA,gBAAA,OAAO,CAAC,OAAO,CAAC,aAAa,EAAE,WAAW,CAAC;YAC7C;iBAAO;;AAEL,gBAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;oBACxB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AAClE,oBAAA,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;;wBAE5B,MAAM,kBAAkB,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,KAAI;4BACxD,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1D,4BAAA,OAAO,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;AAClC,wBAAA,CAAC,CAAC;wBACF,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,KAAI;4BACtD,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1D,4BAAA,OAAO,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC;AAClC,wBAAA,CAAC,CAAC;;AAGF,wBAAA,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;4BACjE;wBACF;;;AAIA,wBAAA,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC;oBACtC;gBACF;YACF;QACF;QAEA,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,cAAkC,CAAC;IACjE;AACD;;;;"}

package/dist/cjs/graphs/phases/memoryFlushPhase.cjs

@@ -9,7 +9,7 @@ var flushLoop = require('./flushLoop.cjs');
 /**
  * Pure trigger function: fires when the current context is within
  * `softThreshold + reserveFloor` tokens of the model window. Matches
- * the standard formula.
+ * upstream's formula.
  */
 function shouldFlushMemory(input) {
     if (!Number.isFinite(input.currentTokens) ||

package/dist/cjs/graphs/phases/memoryFlushPhase.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"memoryFlushPhase.cjs","sources":["../../../../src/graphs/phases/memoryFlushPhase.ts"],"sourcesContent":["/**\n * Memory flush phase — trigger logic + reflection invocation.\n *\n * Ported from the reference implementation's post-turn flush handler. The agent is re-invoked\n * with a reflection system prompt and the `memory_append` tool unlocked;\n * it writes notes to its future self, then the graph returns to normal.\n *\n * This module is INTENTIONALLY decoupled from the specific graph runtime —\n * it exposes pure functions (`shouldFlushMemory`) plus a runner that takes\n * the model as a parameter, so the same logic works from `createAgentNode`,\n * `MultiAgentGraph`, or a future graph backend that wants to override\n * flush behaviour.\n *\n * The agentic tool-execution loop (invoke → run tool_calls → feed results\n * back → repeat until stop) lives in {@link ./flushLoop}. This module wires\n * it up: build tools, resolve prompts, flip the phase, call the loop,\n * shape the rich result.\n */\nimport type { BaseChatModel } from '@langchain/core/language_models/chat_models';\nimport { HumanMessage, SystemMessage } from '@langchain/core/messages';\nimport {\n  DEFAULT_FLUSH_RESERVE_FLOOR_TOKENS,\n  DEFAULT_FLUSH_SOFT_THRESHOLD_TOKENS,\n  DEFAULT_MAX_FLUSH_ITERATIONS,\n  MEMORY_PHASE_FLUSHING,\n  MEMORY_PHASE_NORMAL,\n} from '@/memory/constants';\nimport type { MemoryConfig } from '@/memory/types';\nimport { buildMemoryTools } from '@/tools/memory';\nimport { resolveFlushPrompts } from '@/prompts/memoryFlushPrompt';\nimport {\n  bindToolsIfSupported,\n  runFlushLoop,\n  type FlushLoopResult,\n  type ToolErrorRecord,\n} from './flushLoop';\n\nexport interface ShouldFlushInput {\n  currentTokens: number;\n  windowTokens: number;\n  reserveFloorTokens?: number;\n  softThresholdTokens?: number;\n}\n\n/**\n * Pure trigger function: fires when the current context is within\n * `softThreshold + reserveFloor` tokens of the model window. Matches\n * the standard formula.\n */\nexport function shouldFlushMemory(input: ShouldFlushInput): boolean {\n  if (\n    !Number.isFinite(input.currentTokens) ||\n    !Number.isFinite(input.windowTokens)\n  ) {\n    return false;\n  }\n  if (input.windowTokens <= 0) return false;\n  const reserve =\n    input.reserveFloorTokens ?? DEFAULT_FLUSH_RESERVE_FLOOR_TOKENS;\n  const soft = input.softThresholdTokens ?? DEFAULT_FLUSH_SOFT_THRESHOLD_TOKENS;\n  return input.currentTokens >= input.windowTokens - reserve - soft;\n}\n\nexport interface RunFlushParams {\n  model: BaseChatModel;\n  memory: MemoryConfig;\n  /** A compact summary of the conversation — last N turns, not raw history. */\n  conversationSummary: string;\n  /**\n   * Accessor the graph runtime uses to expose the current phase to the\n   * append tool. The runner sets this to `memory_flushing` for the duration\n   * of the reflection turn and restores it on exit.\n   */\n  setPhase: (\n    phase: typeof MEMORY_PHASE_NORMAL | typeof MEMORY_PHASE_FLUSHING\n  ) => void;\n  /**\n   * @deprecated No longer used — the 8-path canonical-document model\n   * does not date-stamp files. Kept in the params shape for one release\n   * so host's callers don't break on the type signature.\n   */\n  timezone?: string;\n  /**\n   * @deprecated Same as `timezone` — unused in the canonical-document model.\n   */\n  nowMs?: number;\n  /** Override for the agentic-loop iteration cap. */\n  maxIterations?: number;\n  /**\n   * Optional per-iteration callback for structured debug logging.\n   * Caller is expected to demote this to debug once the rollout is stable.\n   */\n  onIteration?: (event: {\n    i: number;\n    toolCallCount: number;\n    toolNames: string[];\n  }) => void;\n}\n\nexport interface RunFlushResult {\n  /** Did the flush actually run (false if disabled via config). */\n  ran: boolean;\n  /** Model.invoke() iterations actually performed. */\n  iterations?: number;\n  /** Total `memory_append` calls the model emitted. */\n  appendsAttempted?: number;\n  /** Subset that returned `{ ok: true }` from the backend. */\n  appendsSucceeded?: number;\n  /** Tool errors the model saw during the flush — surfaced for logging. */\n  toolErrors?: ToolErrorRecord[];\n  /** Final text reply equalled SILENT_REPLY_TOKEN (`NO_REPLY`). */\n  silentReply?: boolean;\n  /** Loop hit its iteration cap with tool_calls still pending. */\n  hitIterationCap?: boolean;\n  /** Final text reply from the last AIMessage. */\n  finalText?: string;\n  /** Error message if the flush threw. */\n  error?: string;\n}\n\n/**\n * Run the reflection turn. The model is re-invoked with just the flush\n * prompt + compact summary + the append tool unlocked. We intentionally\n * drop the full history — the prompt tells the agent to write notes based\n * on what it learned, not to continue the conversation.\n *\n * The loop keeps invoking the model until it stops emitting tool_calls,\n * hits the iteration cap, or replies with {@link SILENT_REPLY_TOKEN}. Each\n * `memory_append` tool_call is executed against the pgvector backend and\n * the result (success path or error) is fed back as a ToolMessage so the\n * model can self-correct (e.g. retry with a valid path).\n */\nexport async function runMemoryFlush(\n  params: RunFlushParams\n): Promise<RunFlushResult> {\n  const {\n    model,\n    memory,\n    conversationSummary,\n    setPhase,\n    maxIterations,\n    onIteration,\n  } = params;\n  if (memory.flush?.enabled === false) {\n    return { ran: false };\n  }\n\n  setPhase(MEMORY_PHASE_FLUSHING);\n  try {\n    const tools = buildMemoryTools({\n      ...memory,\n      readEnabled: false,\n      writeEnabled: true,\n      getPhase: () => MEMORY_PHASE_FLUSHING,\n    });\n\n    // Bind tools to the caller-provided model. If the model already came\n    // bound (some graph wrappers do), bindToolsIfSupported is a no-op.\n    const bound = bindToolsIfSupported(model, tools);\n\n    // Resolve flush prompts with the scope-aware rubric. For an\n    // isolated agent (no userId in scope), the user-tier paths are\n    // filtered out of the rubric so the LLM never sees them — it\n    // physically cannot route a write to `memory/user/*` because the\n    // prompt never lists those paths.\n    const { systemPrompt, prompt } = resolveFlushPrompts({\n      scope: memory.scope,\n    });\n    const initialMessages = [\n      new SystemMessage(systemPrompt),\n      new HumanMessage(\n        `${prompt}\\n\\nConversation context:\\n\\n${conversationSummary}`\n      ),\n    ];\n\n    const loop: FlushLoopResult = await runFlushLoop({\n      model: bound,\n      tools,\n      initialMessages,\n      maxIterations: maxIterations ?? DEFAULT_MAX_FLUSH_ITERATIONS,\n      onIteration: onIteration\n        ? (ev): void =>\n            onIteration({\n              i: ev.i,\n              toolCallCount: ev.toolCalls.length,\n              toolNames: ev.toolCalls.map((c) => c.name),\n            })\n        : undefined,\n    });\n\n    return {\n      ran: true,\n      iterations: loop.iterations,\n      appendsAttempted: loop.appendsAttempted,\n      appendsSucceeded: loop.appendsSucceeded,\n      toolErrors: loop.toolErrors,\n      silentReply: loop.silentReply,\n      hitIterationCap: loop.hitIterationCap,\n      finalText: loop.finalText,\n    };\n  } catch (err) {\n    return {\n      ran: false,\n      error: err instanceof Error ? err.message : String(err),\n    };\n  } finally {\n    setPhase(MEMORY_PHASE_NORMAL);\n  }\n}\n"],"names":["DEFAULT_FLUSH_RESERVE_FLOOR_TOKENS","DEFAULT_FLUSH_SOFT_THRESHOLD_TOKENS","MEMORY_PHASE_FLUSHING","buildMemoryTools","bindToolsIfSupported","resolveFlushPrompts","SystemMessage","HumanMessage","runFlushLoop","DEFAULT_MAX_FLUSH_ITERATIONS","MEMORY_PHASE_NORMAL"],"mappings":";;;;;;;;AA4CA;;;;AAIG;AACG,SAAU,iBAAiB,CAAC,KAAuB,EAAA;IACvD,IACE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC;QACrC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,YAAY,CAAC,EACpC;AACA,QAAA,OAAO,KAAK;IACd;AACA,IAAA,IAAI,KAAK,CAAC,YAAY,IAAI,CAAC;AAAE,QAAA,OAAO,KAAK;AACzC,IAAA,MAAM,OAAO,GACX,KAAK,CAAC,kBAAkB,IAAIA,4CAAkC;AAChE,IAAA,MAAM,IAAI,GAAG,KAAK,CAAC,mBAAmB,IAAIC,6CAAmC;IAC7E,OAAO,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,YAAY,GAAG,OAAO,GAAG,IAAI;AACnE;AA2DA;;;;;;;;;;;AAWG;AACI,eAAe,cAAc,CAClC,MAAsB,EAAA;AAEtB,IAAA,MAAM,EACJ,KAAK,EACL,MAAM,EACN,mBAAmB,EACnB,QAAQ,EACR,aAAa,EACb,WAAW,GACZ,GAAG,MAAM;IACV,IAAI,MAAM,CAAC,KAAK,EAAE,OAAO,KAAK,KAAK,EAAE;AACnC,QAAA,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE;IACvB;IAEA,QAAQ,CAACC,+BAAqB,CAAC;AAC/B,IAAA,IAAI;QACF,MAAM,KAAK,GAAGC,sBAAgB,CAAC;AAC7B,YAAA,GAAG,MAAM;AACT,YAAA,WAAW,EAAE,KAAK;AAClB,YAAA,YAAY,EAAE,IAAI;AAClB,YAAA,QAAQ,EAAE,MAAMD,+BAAqB;AACtC,SAAA,CAAC;;;QAIF,MAAM,KAAK,GAAGE,8BAAoB,CAAC,KAAK,EAAE,KAAK,CAAC;;;;;;AAOhD,QAAA,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,GAAGC,qCAAmB,CAAC;YACnD,KAAK,EAAE,MAAM,CAAC,KAAK;AACpB,SAAA,CAAC;AACF,QAAA,MAAM,eAAe,GAAG;YACtB,IAAIC,sBAAa,CAAC,YAAY,CAAC;AAC/B,YAAA,IAAIC,qBAAY,CACd,CAAA,EAAG,MAAM,CAAA,6BAAA,EAAgC,mBAAmB,EAAE,CAC/D;SACF;AAED,QAAA,MAAM,IAAI,GAAoB,MAAMC,sBAAY,CAAC;AAC/C,YAAA,KAAK,EAAE,KAAK;YACZ,KAAK;YACL,eAAe;YACf,aAAa,EAAE,aAAa,IAAIC,sCAA4B;AAC5D,YAAA,WAAW,EAAE;AACX,kBAAE,CAAC,EAAE,KACD,WAAW,CAAC;oBACV,CAAC,EAAE,EAAE,CAAC,CAAC;AACP,oBAAA,aAAa,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM;AAClC,oBAAA,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC;iBAC3C;AACL,kBAAE,SAAS;AACd,SAAA,CAAC;QAEF,OAAO;AACL,YAAA,GAAG,EAAE,IAAI;YACT,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,gBAAgB,EAAE,IAAI,CAAC,gBAAgB;YACvC,gBAAgB,EAAE,IAAI,CAAC,gBAAgB;YACvC,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B;IACH;IAAE,OAAO,GAAG,EAAE;QACZ,OAAO;AACL,YAAA,GAAG,EAAE,KAAK;AACV,YAAA,KAAK,EAAE,GAAG,YAAY,KAAK,GAAG,GAAG,CAAC,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC;SACxD;IACH;YAAU;QACR,QAAQ,CAACC,6BAAmB,CAAC;IAC/B;AACF;;;;;"}
+{"version":3,"file":"memoryFlushPhase.cjs","sources":["../../../../src/graphs/phases/memoryFlushPhase.ts"],"sourcesContent":["/**\n * Memory flush phase — trigger logic + reflection invocation.\n *\n * Ported from upstream's post-turn flush handler. The agent is re-invoked\n * with a reflection system prompt and the `memory_append` tool unlocked;\n * it writes notes to its future self, then the graph returns to normal.\n *\n * This module is INTENTIONALLY decoupled from the specific graph runtime —\n * it exposes pure functions (`shouldFlushMemory`) plus a runner that takes\n * the model as a parameter, so the same logic works from `createAgentNode`,\n * `MultiAgentGraph`, or a future graph backend that wants to override\n * flush behaviour.\n *\n * The agentic tool-execution loop (invoke → run tool_calls → feed results\n * back → repeat until stop) lives in {@link ./flushLoop}. This module wires\n * it up: build tools, resolve prompts, flip the phase, call the loop,\n * shape the rich result.\n */\nimport type { BaseChatModel } from '@langchain/core/language_models/chat_models';\nimport { HumanMessage, SystemMessage } from '@langchain/core/messages';\nimport {\n  DEFAULT_FLUSH_RESERVE_FLOOR_TOKENS,\n  DEFAULT_FLUSH_SOFT_THRESHOLD_TOKENS,\n  DEFAULT_MAX_FLUSH_ITERATIONS,\n  MEMORY_PHASE_FLUSHING,\n  MEMORY_PHASE_NORMAL,\n} from '@/memory/constants';\nimport type { MemoryConfig } from '@/memory/types';\nimport { buildMemoryTools } from '@/tools/memory';\nimport { resolveFlushPrompts } from '@/prompts/memoryFlushPrompt';\nimport {\n  bindToolsIfSupported,\n  runFlushLoop,\n  type FlushLoopResult,\n  type ToolErrorRecord,\n} from './flushLoop';\n\nexport interface ShouldFlushInput {\n  currentTokens: number;\n  windowTokens: number;\n  reserveFloorTokens?: number;\n  softThresholdTokens?: number;\n}\n\n/**\n * Pure trigger function: fires when the current context is within\n * `softThreshold + reserveFloor` tokens of the model window. Matches\n * upstream's formula.\n */\nexport function shouldFlushMemory(input: ShouldFlushInput): boolean {\n  if (\n    !Number.isFinite(input.currentTokens) ||\n    !Number.isFinite(input.windowTokens)\n  ) {\n    return false;\n  }\n  if (input.windowTokens <= 0) return false;\n  const reserve =\n    input.reserveFloorTokens ?? DEFAULT_FLUSH_RESERVE_FLOOR_TOKENS;\n  const soft = input.softThresholdTokens ?? DEFAULT_FLUSH_SOFT_THRESHOLD_TOKENS;\n  return input.currentTokens >= input.windowTokens - reserve - soft;\n}\n\nexport interface RunFlushParams {\n  model: BaseChatModel;\n  memory: MemoryConfig;\n  /** A compact summary of the conversation — last N turns, not raw history. */\n  conversationSummary: string;\n  /**\n   * Accessor the graph runtime uses to expose the current phase to the\n   * append tool. The runner sets this to `memory_flushing` for the duration\n   * of the reflection turn and restores it on exit.\n   */\n  setPhase: (\n    phase: typeof MEMORY_PHASE_NORMAL | typeof MEMORY_PHASE_FLUSHING\n  ) => void;\n  /**\n   * @deprecated No longer used — the 8-path canonical-document model\n   * does not date-stamp files. Kept in the params shape for one release\n   * so host's callers don't break on the type signature.\n   */\n  timezone?: string;\n  /**\n   * @deprecated Same as `timezone` — unused in the canonical-document model.\n   */\n  nowMs?: number;\n  /** Override for the agentic-loop iteration cap. */\n  maxIterations?: number;\n  /**\n   * Optional per-iteration callback for structured debug logging.\n   * Caller is expected to demote this to debug once the rollout is stable.\n   */\n  onIteration?: (event: {\n    i: number;\n    toolCallCount: number;\n    toolNames: string[];\n  }) => void;\n}\n\nexport interface RunFlushResult {\n  /** Did the flush actually run (false if disabled via config). */\n  ran: boolean;\n  /** Model.invoke() iterations actually performed. */\n  iterations?: number;\n  /** Total `memory_append` calls the model emitted. */\n  appendsAttempted?: number;\n  /** Subset that returned `{ ok: true }` from the backend. */\n  appendsSucceeded?: number;\n  /** Tool errors the model saw during the flush — surfaced for logging. */\n  toolErrors?: ToolErrorRecord[];\n  /** Final text reply equalled SILENT_REPLY_TOKEN (`NO_REPLY`). */\n  silentReply?: boolean;\n  /** Loop hit its iteration cap with tool_calls still pending. */\n  hitIterationCap?: boolean;\n  /** Final text reply from the last AIMessage. */\n  finalText?: string;\n  /** Error message if the flush threw. */\n  error?: string;\n}\n\n/**\n * Run the reflection turn. The model is re-invoked with just the flush\n * prompt + compact summary + the append tool unlocked. We intentionally\n * drop the full history — the prompt tells the agent to write notes based\n * on what it learned, not to continue the conversation.\n *\n * The loop keeps invoking the model until it stops emitting tool_calls,\n * hits the iteration cap, or replies with {@link SILENT_REPLY_TOKEN}. Each\n * `memory_append` tool_call is executed against the pgvector backend and\n * the result (success path or error) is fed back as a ToolMessage so the\n * model can self-correct (e.g. retry with a valid path).\n */\nexport async function runMemoryFlush(\n  params: RunFlushParams\n): Promise<RunFlushResult> {\n  const {\n    model,\n    memory,\n    conversationSummary,\n    setPhase,\n    maxIterations,\n    onIteration,\n  } = params;\n  if (memory.flush?.enabled === false) {\n    return { ran: false };\n  }\n\n  setPhase(MEMORY_PHASE_FLUSHING);\n  try {\n    const tools = buildMemoryTools({\n      ...memory,\n      readEnabled: false,\n      writeEnabled: true,\n      getPhase: () => MEMORY_PHASE_FLUSHING,\n    });\n\n    // Bind tools to the caller-provided model. If the model already came\n    // bound (some graph wrappers do), bindToolsIfSupported is a no-op.\n    const bound = bindToolsIfSupported(model, tools);\n\n    // Resolve flush prompts with the scope-aware rubric. For an\n    // isolated agent (no userId in scope), the user-tier paths are\n    // filtered out of the rubric so the LLM never sees them — it\n    // physically cannot route a write to `memory/user/*` because the\n    // prompt never lists those paths.\n    const { systemPrompt, prompt } = resolveFlushPrompts({\n      scope: memory.scope,\n    });\n    const initialMessages = [\n      new SystemMessage(systemPrompt),\n      new HumanMessage(\n        `${prompt}\\n\\nConversation context:\\n\\n${conversationSummary}`\n      ),\n    ];\n\n    const loop: FlushLoopResult = await runFlushLoop({\n      model: bound,\n      tools,\n      initialMessages,\n      maxIterations: maxIterations ?? DEFAULT_MAX_FLUSH_ITERATIONS,\n      onIteration: onIteration\n        ? (ev): void =>\n            onIteration({\n              i: ev.i,\n              toolCallCount: ev.toolCalls.length,\n              toolNames: ev.toolCalls.map((c) => c.name),\n            })\n        : undefined,\n    });\n\n    return {\n      ran: true,\n      iterations: loop.iterations,\n      appendsAttempted: loop.appendsAttempted,\n      appendsSucceeded: loop.appendsSucceeded,\n      toolErrors: loop.toolErrors,\n      silentReply: loop.silentReply,\n      hitIterationCap: loop.hitIterationCap,\n      finalText: loop.finalText,\n    };\n  } catch (err) {\n    return {\n      ran: false,\n      error: err instanceof Error ? err.message : String(err),\n    };\n  } finally {\n    setPhase(MEMORY_PHASE_NORMAL);\n  }\n}\n"],"names":["DEFAULT_FLUSH_RESERVE_FLOOR_TOKENS","DEFAULT_FLUSH_SOFT_THRESHOLD_TOKENS","MEMORY_PHASE_FLUSHING","buildMemoryTools","bindToolsIfSupported","resolveFlushPrompts","SystemMessage","HumanMessage","runFlushLoop","DEFAULT_MAX_FLUSH_ITERATIONS","MEMORY_PHASE_NORMAL"],"mappings":";;;;;;;;AA4CA;;;;AAIG;AACG,SAAU,iBAAiB,CAAC,KAAuB,EAAA;IACvD,IACE,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC;QACrC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,YAAY,CAAC,EACpC;AACA,QAAA,OAAO,KAAK;IACd;AACA,IAAA,IAAI,KAAK,CAAC,YAAY,IAAI,CAAC;AAAE,QAAA,OAAO,KAAK;AACzC,IAAA,MAAM,OAAO,GACX,KAAK,CAAC,kBAAkB,IAAIA,4CAAkC;AAChE,IAAA,MAAM,IAAI,GAAG,KAAK,CAAC,mBAAmB,IAAIC,6CAAmC;IAC7E,OAAO,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,YAAY,GAAG,OAAO,GAAG,IAAI;AACnE;AA2DA;;;;;;;;;;;AAWG;AACI,eAAe,cAAc,CAClC,MAAsB,EAAA;AAEtB,IAAA,MAAM,EACJ,KAAK,EACL,MAAM,EACN,mBAAmB,EACnB,QAAQ,EACR,aAAa,EACb,WAAW,GACZ,GAAG,MAAM;IACV,IAAI,MAAM,CAAC,KAAK,EAAE,OAAO,KAAK,KAAK,EAAE;AACnC,QAAA,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE;IACvB;IAEA,QAAQ,CAACC,+BAAqB,CAAC;AAC/B,IAAA,IAAI;QACF,MAAM,KAAK,GAAGC,sBAAgB,CAAC;AAC7B,YAAA,GAAG,MAAM;AACT,YAAA,WAAW,EAAE,KAAK;AAClB,YAAA,YAAY,EAAE,IAAI;AAClB,YAAA,QAAQ,EAAE,MAAMD,+BAAqB;AACtC,SAAA,CAAC;;;QAIF,MAAM,KAAK,GAAGE,8BAAoB,CAAC,KAAK,EAAE,KAAK,CAAC;;;;;;AAOhD,QAAA,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,GAAGC,qCAAmB,CAAC;YACnD,KAAK,EAAE,MAAM,CAAC,KAAK;AACpB,SAAA,CAAC;AACF,QAAA,MAAM,eAAe,GAAG;YACtB,IAAIC,sBAAa,CAAC,YAAY,CAAC;AAC/B,YAAA,IAAIC,qBAAY,CACd,CAAA,EAAG,MAAM,CAAA,6BAAA,EAAgC,mBAAmB,EAAE,CAC/D;SACF;AAED,QAAA,MAAM,IAAI,GAAoB,MAAMC,sBAAY,CAAC;AAC/C,YAAA,KAAK,EAAE,KAAK;YACZ,KAAK;YACL,eAAe;YACf,aAAa,EAAE,aAAa,IAAIC,sCAA4B;AAC5D,YAAA,WAAW,EAAE;AACX,kBAAE,CAAC,EAAE,KACD,WAAW,CAAC;oBACV,CAAC,EAAE,EAAE,CAAC,CAAC;AACP,oBAAA,aAAa,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM;AAClC,oBAAA,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC;iBAC3C;AACL,kBAAE,SAAS;AACd,SAAA,CAAC;QAEF,OAAO;AACL,YAAA,GAAG,EAAE,IAAI;YACT,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,gBAAgB,EAAE,IAAI,CAAC,gBAAgB;YACvC,gBAAgB,EAAE,IAAI,CAAC,gBAAgB;YACvC,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B;IACH;IAAE,OAAO,GAAG,EAAE;QACZ,OAAO;AACL,YAAA,GAAG,EAAE,KAAK;AACV,YAAA,KAAK,EAAE,GAAG,YAAY,KAAK,GAAG,GAAG,CAAC,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC;SACxD;IACH;YAAU;QACR,QAAQ,CAACC,6BAAmB,CAAC;IAC/B;AACF;;;;;"}

package/dist/cjs/hooks/HookRegistry.cjs

@@ -11,7 +11,7 @@
  *
  * ## Why `Map<sessionId, MatcherBucket>` and not `Record`
  *
- * Real consumers run thousands of parallel sessions in one Node process, and
+ * LibreChat runs thousands of parallel sessions in one Node process, and
  * hook registration happens inside hot paths (tool loading, agent spawning).
  * A `Record<sessionId, ...>` has to be spread on every insertion, which is
  * O(n) per call and O(n²) total for a batch of parallel registrations. A

package/dist/cjs/hooks/HookRegistry.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"HookRegistry.cjs","sources":["../../../src/hooks/HookRegistry.ts"],"sourcesContent":["// src/hooks/HookRegistry.ts\nimport type { HookEvent, HookMatcher } from './types';\n\n/**\n * Internal matcher storage type.\n *\n * Matchers registered via the public `register<E>` API are strictly typed\n * to a single `E`, but the storage needs one uniform slot type per event.\n * We store them as `HookMatcher<HookEvent>` and cast once at the variance\n * boundary — see `ensureList` and `snapshot` below. The invariant (every\n * matcher in `bucket[event]` was registered with that exact event) is\n * enforced by the public API; breaking it requires bypassing the types.\n */\ntype MatcherBucket = Partial<Record<HookEvent, HookMatcher<HookEvent>[]>>;\n\n/**\n * Run-scoped storage for hook matchers with an additional layer for\n * session-scoped matchers that should be cleaned up between sessions.\n *\n * Hosts construct one registry per `Run` (mirroring how `HandlerRegistry` is\n * scoped) and register global matchers + per-session matchers against it.\n * Registration is strictly additive — nothing in this class mutates a\n * matcher's callbacks or flags after insertion.\n *\n * ## Why `Map<sessionId, MatcherBucket>` and not `Record`\n *\n * Real consumers run thousands of parallel sessions in one Node process, and\n * hook registration happens inside hot paths (tool loading, agent spawning).\n * A `Record<sessionId, ...>` has to be spread on every insertion, which is\n * O(n) per call and O(n²) total for a batch of parallel registrations. A\n * Map mutates in place, keeping insertions O(1). This mirrors the reasoning\n * Claude Code documents at `utils/hooks/sessionHooks.ts:62`.\n */\nexport class HookRegistry {\n  private readonly global: MatcherBucket = {};\n  private readonly sessions: Map<string, MatcherBucket> = new Map();\n\n  /**\n   * Register a matcher for the lifetime of this registry (= one Run).\n   * Returns an unregister function that removes the matcher by reference.\n   */\n  register<E extends HookEvent>(event: E, matcher: HookMatcher<E>): () => void {\n    const list = ensureList(this.global, event);\n    list.push(widen(matcher));\n    return () => {\n      removeFromList(list, matcher);\n    };\n  }\n\n  /**\n   * Register a matcher for a specific session. Cleared automatically when\n   * `clearSession(sessionId)` is called, or can be removed directly via the\n   * returned unregister function.\n   */\n  registerSession<E extends HookEvent>(\n    sessionId: string,\n    event: E,\n    matcher: HookMatcher<E>\n  ): () => void {\n    const bucket = this.ensureSessionBucket(sessionId);\n    const list = ensureList(bucket, event);\n    list.push(widen(matcher));\n    return () => {\n      removeFromList(list, matcher);\n    };\n  }\n\n  /**\n   * Returns all matchers registered for `event`, concatenating global first\n   * and then session-specific (when `sessionId` is supplied). The caller\n   * receives a fresh array, so iterating it is safe even if a matcher is\n   * removed mid-iteration (e.g. via `once: true`).\n   */\n  getMatchers<E extends HookEvent>(\n    event: E,\n    sessionId?: string\n  ): HookMatcher<E>[] {\n    const globalList = readList(this.global, event);\n    if (sessionId === undefined) {\n      return snapshot<E>(globalList);\n    }\n    const bucket = this.sessions.get(sessionId);\n    if (bucket === undefined) {\n      return snapshot<E>(globalList);\n    }\n    const sessionList = readList(bucket, event);\n    if (globalList.length === 0) {\n      return snapshot<E>(sessionList);\n    }\n    if (sessionList.length === 0) {\n      return snapshot<E>(globalList);\n    }\n    return snapshot<E>([...globalList, ...sessionList]);\n  }\n\n  /**\n   * Removes `matcher` by reference from global storage first, falling back\n   * to the session bucket when `sessionId` is supplied. Used by\n   * `executeHooks` to drop `once: true` matchers after they fire.\n   */\n  removeMatcher<E extends HookEvent>(\n    event: E,\n    matcher: HookMatcher<E>,\n    sessionId?: string\n  ): boolean {\n    if (removeFromList(readList(this.global, event), matcher)) {\n      return true;\n    }\n    if (sessionId === undefined) {\n      return false;\n    }\n    const bucket = this.sessions.get(sessionId);\n    if (bucket === undefined) {\n      return false;\n    }\n    return removeFromList(readList(bucket, event), matcher);\n  }\n\n  /**\n   * Drops every session-scoped matcher for `sessionId`. Call this in the\n   * `finally` block around a Run so a `once: true` hook that never fired\n   * cannot leak into the next session on the same registry.\n   */\n  clearSession(sessionId: string): void {\n    this.sessions.delete(sessionId);\n  }\n\n  /** True if at least one matcher exists for `event` (global + session). */\n  hasHookFor(event: HookEvent, sessionId?: string): boolean {\n    if (readList(this.global, event).length > 0) {\n      return true;\n    }\n    if (sessionId === undefined) {\n      return false;\n    }\n    const bucket = this.sessions.get(sessionId);\n    if (bucket === undefined) {\n      return false;\n    }\n    return readList(bucket, event).length > 0;\n  }\n\n  private ensureSessionBucket(sessionId: string): MatcherBucket {\n    const existing = this.sessions.get(sessionId);\n    if (existing !== undefined) {\n      return existing;\n    }\n    const fresh: MatcherBucket = {};\n    this.sessions.set(sessionId, fresh);\n    return fresh;\n  }\n}\n\nfunction ensureList(\n  bucket: MatcherBucket,\n  event: HookEvent\n): HookMatcher<HookEvent>[] {\n  const existing = bucket[event];\n  if (existing !== undefined) {\n    return existing;\n  }\n  const fresh: HookMatcher<HookEvent>[] = [];\n  bucket[event] = fresh;\n  return fresh;\n}\n\nfunction readList(\n  bucket: MatcherBucket,\n  event: HookEvent\n): HookMatcher<HookEvent>[] {\n  return bucket[event] ?? [];\n}\n\nfunction removeFromList<E extends HookEvent>(\n  list: HookMatcher<HookEvent>[],\n  matcher: HookMatcher<E>\n): boolean {\n  const idx = list.indexOf(widen(matcher));\n  if (idx < 0) {\n    return false;\n  }\n  list.splice(idx, 1);\n  return true;\n}\n\n/**\n * Widen a per-event matcher to the storage's uniform slot type. Unsound at\n * the type level (function parameters are contravariant) but safe by\n * construction: `HookRegistry.register<E>` only ever puts matchers into the\n * bucket slot for their own event, and reads go through `snapshot<E>`\n * which is only called with the same `E`.\n */\nfunction widen<E extends HookEvent>(\n  matcher: HookMatcher<E>\n): HookMatcher<HookEvent> {\n  return matcher as unknown as HookMatcher<HookEvent>;\n}\n\n/**\n * Narrow a storage list back to a per-event matcher list on the way out.\n * Sound counterpart to `widen`: the list only contains matchers that were\n * registered against `E`, because the public API enforces it on insert.\n */\nfunction snapshot<E extends HookEvent>(\n  list: readonly HookMatcher<HookEvent>[]\n): HookMatcher<E>[] {\n  return list.slice() as unknown as HookMatcher<E>[];\n}\n"],"names":[],"mappings":";;AAeA;;;;;;;;;;;;;;;;;AAiBG;MACU,YAAY,CAAA;IACN,MAAM,GAAkB,EAAE;AAC1B,IAAA,QAAQ,GAA+B,IAAI,GAAG,EAAE;AAEjE;;;AAGG;IACH,QAAQ,CAAsB,KAAQ,EAAE,OAAuB,EAAA;QAC7D,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;AACzB,QAAA,OAAO,MAAK;AACV,YAAA,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC;AAC/B,QAAA,CAAC;IACH;AAEA;;;;AAIG;AACH,IAAA,eAAe,CACb,SAAiB,EACjB,KAAQ,EACR,OAAuB,EAAA;QAEvB,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC;QAClD,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC;QACtC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;AACzB,QAAA,OAAO,MAAK;AACV,YAAA,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC;AAC/B,QAAA,CAAC;IACH;AAEA;;;;;AAKG;IACH,WAAW,CACT,KAAQ,EACR,SAAkB,EAAA;QAElB,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;AAC/C,QAAA,IAAI,SAAS,KAAK,SAAS,EAAE;AAC3B,YAAA,OAAO,QAAQ,CAAI,UAAU,CAAC;QAChC;QACA,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;AAC3C,QAAA,IAAI,MAAM,KAAK,SAAS,EAAE;AACxB,YAAA,OAAO,QAAQ,CAAI,UAAU,CAAC;QAChC;QACA,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC;AAC3C,QAAA,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE;AAC3B,YAAA,OAAO,QAAQ,CAAI,WAAW,CAAC;QACjC;AACA,QAAA,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE;AAC5B,YAAA,OAAO,QAAQ,CAAI,UAAU,CAAC;QAChC;QACA,OAAO,QAAQ,CAAI,CAAC,GAAG,UAAU,EAAE,GAAG,WAAW,CAAC,CAAC;IACrD;AAEA;;;;AAIG;AACH,IAAA,aAAa,CACX,KAAQ,EACR,OAAuB,EACvB,SAAkB,EAAA;AAElB,QAAA,IAAI,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,EAAE;AACzD,YAAA,OAAO,IAAI;QACb;AACA,QAAA,IAAI,SAAS,KAAK,SAAS,EAAE;AAC3B,YAAA,OAAO,KAAK;QACd;QACA,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;AAC3C,QAAA,IAAI,MAAM,KAAK,SAAS,EAAE;AACxB,YAAA,OAAO,KAAK;QACd;QACA,OAAO,cAAc,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC;IACzD;AAEA;;;;AAIG;AACH,IAAA,YAAY,CAAC,SAAiB,EAAA;AAC5B,QAAA,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC;IACjC;;IAGA,UAAU,CAAC,KAAgB,EAAE,SAAkB,EAAA;AAC7C,QAAA,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AAC3C,YAAA,OAAO,IAAI;QACb;AACA,QAAA,IAAI,SAAS,KAAK,SAAS,EAAE;AAC3B,YAAA,OAAO,KAAK;QACd;QACA,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;AAC3C,QAAA,IAAI,MAAM,KAAK,SAAS,EAAE;AACxB,YAAA,OAAO,KAAK;QACd;QACA,OAAO,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;IAC3C;AAEQ,IAAA,mBAAmB,CAAC,SAAiB,EAAA;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;AAC7C,QAAA,IAAI,QAAQ,KAAK,SAAS,EAAE;AAC1B,YAAA,OAAO,QAAQ;QACjB;QACA,MAAM,KAAK,GAAkB,EAAE;QAC/B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC;AACnC,QAAA,OAAO,KAAK;IACd;AACD;AAED,SAAS,UAAU,CACjB,MAAqB,EACrB,KAAgB,EAAA;AAEhB,IAAA,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC;AAC9B,IAAA,IAAI,QAAQ,KAAK,SAAS,EAAE;AAC1B,QAAA,OAAO,QAAQ;IACjB;IACA,MAAM,KAAK,GAA6B,EAAE;AAC1C,IAAA,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK;AACrB,IAAA,OAAO,KAAK;AACd;AAEA,SAAS,QAAQ,CACf,MAAqB,EACrB,KAAgB,EAAA;AAEhB,IAAA,OAAO,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE;AAC5B;AAEA,SAAS,cAAc,CACrB,IAA8B,EAC9B,OAAuB,EAAA;IAEvB,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;AACxC,IAAA,IAAI,GAAG,GAAG,CAAC,EAAE;AACX,QAAA,OAAO,KAAK;IACd;AACA,IAAA,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC;AACnB,IAAA,OAAO,IAAI;AACb;AAEA;;;;;;AAMG;AACH,SAAS,KAAK,CACZ,OAAuB,EAAA;AAEvB,IAAA,OAAO,OAA4C;AACrD;AAEA;;;;AAIG;AACH,SAAS,QAAQ,CACf,IAAuC,EAAA;AAEvC,IAAA,OAAO,IAAI,CAAC,KAAK,EAAiC;AACpD;;;;"}
+{"version":3,"file":"HookRegistry.cjs","sources":["../../../src/hooks/HookRegistry.ts"],"sourcesContent":["// src/hooks/HookRegistry.ts\nimport type { HookEvent, HookMatcher } from './types';\n\n/**\n * Internal matcher storage type.\n *\n * Matchers registered via the public `register<E>` API are strictly typed\n * to a single `E`, but the storage needs one uniform slot type per event.\n * We store them as `HookMatcher<HookEvent>` and cast once at the variance\n * boundary — see `ensureList` and `snapshot` below. The invariant (every\n * matcher in `bucket[event]` was registered with that exact event) is\n * enforced by the public API; breaking it requires bypassing the types.\n */\ntype MatcherBucket = Partial<Record<HookEvent, HookMatcher<HookEvent>[]>>;\n\n/**\n * Run-scoped storage for hook matchers with an additional layer for\n * session-scoped matchers that should be cleaned up between sessions.\n *\n * Hosts construct one registry per `Run` (mirroring how `HandlerRegistry` is\n * scoped) and register global matchers + per-session matchers against it.\n * Registration is strictly additive — nothing in this class mutates a\n * matcher's callbacks or flags after insertion.\n *\n * ## Why `Map<sessionId, MatcherBucket>` and not `Record`\n *\n * LibreChat runs thousands of parallel sessions in one Node process, and\n * hook registration happens inside hot paths (tool loading, agent spawning).\n * A `Record<sessionId, ...>` has to be spread on every insertion, which is\n * O(n) per call and O(n²) total for a batch of parallel registrations. A\n * Map mutates in place, keeping insertions O(1). This mirrors the reasoning\n * Claude Code documents at `utils/hooks/sessionHooks.ts:62`.\n */\nexport class HookRegistry {\n  private readonly global: MatcherBucket = {};\n  private readonly sessions: Map<string, MatcherBucket> = new Map();\n\n  /**\n   * Register a matcher for the lifetime of this registry (= one Run).\n   * Returns an unregister function that removes the matcher by reference.\n   */\n  register<E extends HookEvent>(event: E, matcher: HookMatcher<E>): () => void {\n    const list = ensureList(this.global, event);\n    list.push(widen(matcher));\n    return () => {\n      removeFromList(list, matcher);\n    };\n  }\n\n  /**\n   * Register a matcher for a specific session. Cleared automatically when\n   * `clearSession(sessionId)` is called, or can be removed directly via the\n   * returned unregister function.\n   */\n  registerSession<E extends HookEvent>(\n    sessionId: string,\n    event: E,\n    matcher: HookMatcher<E>\n  ): () => void {\n    const bucket = this.ensureSessionBucket(sessionId);\n    const list = ensureList(bucket, event);\n    list.push(widen(matcher));\n    return () => {\n      removeFromList(list, matcher);\n    };\n  }\n\n  /**\n   * Returns all matchers registered for `event`, concatenating global first\n   * and then session-specific (when `sessionId` is supplied). The caller\n   * receives a fresh array, so iterating it is safe even if a matcher is\n   * removed mid-iteration (e.g. via `once: true`).\n   */\n  getMatchers<E extends HookEvent>(\n    event: E,\n    sessionId?: string\n  ): HookMatcher<E>[] {\n    const globalList = readList(this.global, event);\n    if (sessionId === undefined) {\n      return snapshot<E>(globalList);\n    }\n    const bucket = this.sessions.get(sessionId);\n    if (bucket === undefined) {\n      return snapshot<E>(globalList);\n    }\n    const sessionList = readList(bucket, event);\n    if (globalList.length === 0) {\n      return snapshot<E>(sessionList);\n    }\n    if (sessionList.length === 0) {\n      return snapshot<E>(globalList);\n    }\n    return snapshot<E>([...globalList, ...sessionList]);\n  }\n\n  /**\n   * Removes `matcher` by reference from global storage first, falling back\n   * to the session bucket when `sessionId` is supplied. Used by\n   * `executeHooks` to drop `once: true` matchers after they fire.\n   */\n  removeMatcher<E extends HookEvent>(\n    event: E,\n    matcher: HookMatcher<E>,\n    sessionId?: string\n  ): boolean {\n    if (removeFromList(readList(this.global, event), matcher)) {\n      return true;\n    }\n    if (sessionId === undefined) {\n      return false;\n    }\n    const bucket = this.sessions.get(sessionId);\n    if (bucket === undefined) {\n      return false;\n    }\n    return removeFromList(readList(bucket, event), matcher);\n  }\n\n  /**\n   * Drops every session-scoped matcher for `sessionId`. Call this in the\n   * `finally` block around a Run so a `once: true` hook that never fired\n   * cannot leak into the next session on the same registry.\n   */\n  clearSession(sessionId: string): void {\n    this.sessions.delete(sessionId);\n  }\n\n  /** True if at least one matcher exists for `event` (global + session). */\n  hasHookFor(event: HookEvent, sessionId?: string): boolean {\n    if (readList(this.global, event).length > 0) {\n      return true;\n    }\n    if (sessionId === undefined) {\n      return false;\n    }\n    const bucket = this.sessions.get(sessionId);\n    if (bucket === undefined) {\n      return false;\n    }\n    return readList(bucket, event).length > 0;\n  }\n\n  private ensureSessionBucket(sessionId: string): MatcherBucket {\n    const existing = this.sessions.get(sessionId);\n    if (existing !== undefined) {\n      return existing;\n    }\n    const fresh: MatcherBucket = {};\n    this.sessions.set(sessionId, fresh);\n    return fresh;\n  }\n}\n\nfunction ensureList(\n  bucket: MatcherBucket,\n  event: HookEvent\n): HookMatcher<HookEvent>[] {\n  const existing = bucket[event];\n  if (existing !== undefined) {\n    return existing;\n  }\n  const fresh: HookMatcher<HookEvent>[] = [];\n  bucket[event] = fresh;\n  return fresh;\n}\n\nfunction readList(\n  bucket: MatcherBucket,\n  event: HookEvent\n): HookMatcher<HookEvent>[] {\n  return bucket[event] ?? [];\n}\n\nfunction removeFromList<E extends HookEvent>(\n  list: HookMatcher<HookEvent>[],\n  matcher: HookMatcher<E>\n): boolean {\n  const idx = list.indexOf(widen(matcher));\n  if (idx < 0) {\n    return false;\n  }\n  list.splice(idx, 1);\n  return true;\n}\n\n/**\n * Widen a per-event matcher to the storage's uniform slot type. Unsound at\n * the type level (function parameters are contravariant) but safe by\n * construction: `HookRegistry.register<E>` only ever puts matchers into the\n * bucket slot for their own event, and reads go through `snapshot<E>`\n * which is only called with the same `E`.\n */\nfunction widen<E extends HookEvent>(\n  matcher: HookMatcher<E>\n): HookMatcher<HookEvent> {\n  return matcher as unknown as HookMatcher<HookEvent>;\n}\n\n/**\n * Narrow a storage list back to a per-event matcher list on the way out.\n * Sound counterpart to `widen`: the list only contains matchers that were\n * registered against `E`, because the public API enforces it on insert.\n */\nfunction snapshot<E extends HookEvent>(\n  list: readonly HookMatcher<HookEvent>[]\n): HookMatcher<E>[] {\n  return list.slice() as unknown as HookMatcher<E>[];\n}\n"],"names":[],"mappings":";;AAeA;;;;;;;;;;;;;;;;;AAiBG;MACU,YAAY,CAAA;IACN,MAAM,GAAkB,EAAE;AAC1B,IAAA,QAAQ,GAA+B,IAAI,GAAG,EAAE;AAEjE;;;AAGG;IACH,QAAQ,CAAsB,KAAQ,EAAE,OAAuB,EAAA;QAC7D,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;QAC3C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;AACzB,QAAA,OAAO,MAAK;AACV,YAAA,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC;AAC/B,QAAA,CAAC;IACH;AAEA;;;;AAIG;AACH,IAAA,eAAe,CACb,SAAiB,EACjB,KAAQ,EACR,OAAuB,EAAA;QAEvB,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC;QAClD,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC;QACtC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;AACzB,QAAA,OAAO,MAAK;AACV,YAAA,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC;AAC/B,QAAA,CAAC;IACH;AAEA;;;;;AAKG;IACH,WAAW,CACT,KAAQ,EACR,SAAkB,EAAA;QAElB,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC;AAC/C,QAAA,IAAI,SAAS,KAAK,SAAS,EAAE;AAC3B,YAAA,OAAO,QAAQ,CAAI,UAAU,CAAC;QAChC;QACA,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;AAC3C,QAAA,IAAI,MAAM,KAAK,SAAS,EAAE;AACxB,YAAA,OAAO,QAAQ,CAAI,UAAU,CAAC;QAChC;QACA,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC;AAC3C,QAAA,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE;AAC3B,YAAA,OAAO,QAAQ,CAAI,WAAW,CAAC;QACjC;AACA,QAAA,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE;AAC5B,YAAA,OAAO,QAAQ,CAAI,UAAU,CAAC;QAChC;QACA,OAAO,QAAQ,CAAI,CAAC,GAAG,UAAU,EAAE,GAAG,WAAW,CAAC,CAAC;IACrD;AAEA;;;;AAIG;AACH,IAAA,aAAa,CACX,KAAQ,EACR,OAAuB,EACvB,SAAkB,EAAA;AAElB,QAAA,IAAI,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC,EAAE;AACzD,YAAA,OAAO,IAAI;QACb;AACA,QAAA,IAAI,SAAS,KAAK,SAAS,EAAE;AAC3B,YAAA,OAAO,KAAK;QACd;QACA,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;AAC3C,QAAA,IAAI,MAAM,KAAK,SAAS,EAAE;AACxB,YAAA,OAAO,KAAK;QACd;QACA,OAAO,cAAc,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,OAAO,CAAC;IACzD;AAEA;;;;AAIG;AACH,IAAA,YAAY,CAAC,SAAiB,EAAA;AAC5B,QAAA,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC;IACjC;;IAGA,UAAU,CAAC,KAAgB,EAAE,SAAkB,EAAA;AAC7C,QAAA,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AAC3C,YAAA,OAAO,IAAI;QACb;AACA,QAAA,IAAI,SAAS,KAAK,SAAS,EAAE;AAC3B,YAAA,OAAO,KAAK;QACd;QACA,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;AAC3C,QAAA,IAAI,MAAM,KAAK,SAAS,EAAE;AACxB,YAAA,OAAO,KAAK;QACd;QACA,OAAO,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;IAC3C;AAEQ,IAAA,mBAAmB,CAAC,SAAiB,EAAA;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC;AAC7C,QAAA,IAAI,QAAQ,KAAK,SAAS,EAAE;AAC1B,YAAA,OAAO,QAAQ;QACjB;QACA,MAAM,KAAK,GAAkB,EAAE;QAC/B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC;AACnC,QAAA,OAAO,KAAK;IACd;AACD;AAED,SAAS,UAAU,CACjB,MAAqB,EACrB,KAAgB,EAAA;AAEhB,IAAA,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC;AAC9B,IAAA,IAAI,QAAQ,KAAK,SAAS,EAAE;AAC1B,QAAA,OAAO,QAAQ;IACjB;IACA,MAAM,KAAK,GAA6B,EAAE;AAC1C,IAAA,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK;AACrB,IAAA,OAAO,KAAK;AACd;AAEA,SAAS,QAAQ,CACf,MAAqB,EACrB,KAAgB,EAAA;AAEhB,IAAA,OAAO,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE;AAC5B;AAEA,SAAS,cAAc,CACrB,IAA8B,EAC9B,OAAuB,EAAA;IAEvB,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;AACxC,IAAA,IAAI,GAAG,GAAG,CAAC,EAAE;AACX,QAAA,OAAO,KAAK;IACd;AACA,IAAA,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC;AACnB,IAAA,OAAO,IAAI;AACb;AAEA;;;;;;AAMG;AACH,SAAS,KAAK,CACZ,OAAuB,EAAA;AAEvB,IAAA,OAAO,OAA4C;AACrD;AAEA;;;;AAIG;AACH,SAAS,QAAQ,CACf,IAAuC,EAAA;AAEvC,IAAA,OAAO,IAAI,CAAC,KAAK,EAAiC;AACpD;;;;"}

package/dist/cjs/hooks/matchers.cjs

@@ -115,7 +115,7 @@ function skipGroupSyntaxPrefix(pattern, start) {
  * This catches the common forms but not all. Ambiguous-alternation ReDoS
  * like `(a|a)+` is not detected. Pathologically long patterns are also
  * caught by {@link MAX_PATTERN_LENGTH}. Hosts that accept user-supplied
- * patterns must still validate standard.
+ * patterns must still validate upstream.
  */
 function hasNestedQuantifier(pattern) {
     const stack = [];
@@ -231,7 +231,7 @@ function compile(pattern) {
  *    never re-enter the regex compiler.
  *
  * These are a floor, not a ceiling. Hosts that accept user-supplied
- * patterns should still validate standard. The design report §3.8 routes
+ * patterns should still validate upstream. The design report §3.8 routes
  * persistable hooks through a host-side compiler before they reach this
  * module.
  */

package/dist/cjs/hooks/matchers.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"matchers.cjs","sources":["../../../src/hooks/matchers.ts"],"sourcesContent":["// src/hooks/matchers.ts\n\n/**\n * Upper bound on hook-matcher pattern length. Patterns longer than this\n * are rejected outright — the goal is a cheap cap on pathological inputs\n * (repeated quantifiers, huge alternation groups) without pulling in a\n * safe-regex dependency.\n *\n * Legitimate matchers are almost always under 50 characters (tool names,\n * short alternations, simple prefix anchors); 512 leaves generous\n * headroom while preventing 10KB regexes.\n */\nexport const MAX_PATTERN_LENGTH = 512;\n\n/**\n * Upper bound on the compilation cache. Chosen to comfortably hold every\n * distinct pattern a single multi-tenant run is likely to see (tools,\n * agent types, basename filters) without growing without bound.\n *\n * Under hosts that register unique patterns per tenant, LRU eviction\n * keeps the working set bounded — cold patterns are re-compiled on next\n * use, which is the correct cost trade-off for long-running processes\n * that must not leak memory.\n */\nexport const MAX_CACHE_SIZE = 256;\n\ninterface CacheEntry {\n  regex: RegExp | null;\n}\n\n/**\n * Module-level LRU cache keyed by pattern string. Map iteration order is\n * insertion order in ECMAScript, so refreshing an entry's position means\n * \"delete then re-set\". On overflow we evict the first key (least\n * recently used).\n *\n * Failed compiles are cached as `{ regex: null }` so a malformed pattern\n * does not re-enter the compiler — and so a tenant spamming bad patterns\n * doesn't burn CPU on every call.\n */\nconst patternCache: Map<string, CacheEntry> = new Map();\n\n/**\n * Threshold above which `touchCacheEntry` actually performs the LRU\n * refresh. Below this watermark the cache has zero eviction pressure, so\n * the delete+set on every hit would be pure overhead. Above it we refresh\n * properly so hot patterns survive evictions. 75% of capacity is the\n * standard sweet spot.\n */\nconst LRU_REFRESH_THRESHOLD = Math.floor((MAX_CACHE_SIZE * 3) / 4);\n\nfunction touchCacheEntry(pattern: string, entry: CacheEntry): void {\n  if (patternCache.size < LRU_REFRESH_THRESHOLD) {\n    return;\n  }\n  patternCache.delete(pattern);\n  patternCache.set(pattern, entry);\n}\n\nfunction setCacheEntry(pattern: string, entry: CacheEntry): void {\n  if (patternCache.size >= MAX_CACHE_SIZE) {\n    const oldestKey = patternCache.keys().next().value;\n    if (oldestKey !== undefined) {\n      patternCache.delete(oldestKey);\n    }\n  }\n  patternCache.set(pattern, entry);\n}\n\ninterface QuantifierFrame {\n  hasBacktrackRisk: boolean;\n}\n\nfunction skipGroupSyntaxPrefix(pattern: string, start: number): number {\n  if (start >= pattern.length || pattern[start] !== '?') {\n    return start;\n  }\n  let i = start + 1;\n  if (i >= pattern.length) {\n    return i;\n  }\n  const modifier = pattern[i];\n  if (modifier === ':' || modifier === '=' || modifier === '!') {\n    return i + 1;\n  }\n  if (modifier !== '<') {\n    return i;\n  }\n  i++;\n  if (i < pattern.length && (pattern[i] === '=' || pattern[i] === '!')) {\n    return i + 1;\n  }\n  while (i < pattern.length && pattern[i] !== '>') {\n    i++;\n  }\n  if (i < pattern.length) {\n    i++;\n  }\n  return i;\n}\n\n/**\n * Cheap syntactic detector for the most common catastrophic-backtracking\n * shape: a quantified group that contains another quantifier (e.g.\n * `(a+)+`, `(.*)*`, `(\\w+)+$`, `(?:(a+))+`). This is the \"nested\n * quantifier\" class of ReDoS — runs in polynomial-or-worse time on\n * adversarial inputs.\n *\n * The scan walks the pattern linearly using an explicit stack of group\n * frames. For each group it tracks whether the group's contents include\n * \"backtrack risk\" — meaning a direct quantifier OR a nested group that\n * carries risk up. When a group closes with a trailing quantifier AND its\n * frame carries backtrack risk, the pattern is flagged. Risk propagates\n * to the enclosing frame when a child group closes (whether the child\n * itself was quantified or not), so `(?:(a+))+` — equivalent to `(a+)+`\n * — is flagged correctly even though the outer non-capturing wrapper is\n * one level removed from the inner quantifier.\n *\n * ## Group-syntax prefixes\n *\n * Non-capturing groups (`(?:`), lookaheads (`(?=`, `(?!`), lookbehinds\n * (`(?<=`, `(?<!`), and named groups (`(?<name>`) are skipped over at\n * the `(` so their `?` is not misread as a quantifier. Without this,\n * `(?:pre_)?tool_name` would be incorrectly rejected because the scanner\n * would see the group-syntax `?` as a quantifier at depth 1.\n *\n * ## Heuristic, not a proof\n *\n * This catches the common forms but not all. Ambiguous-alternation ReDoS\n * like `(a|a)+` is not detected. Pathologically long patterns are also\n * caught by {@link MAX_PATTERN_LENGTH}. Hosts that accept user-supplied\n * patterns must still validate standard.\n */\nexport function hasNestedQuantifier(pattern: string): boolean {\n  const stack: QuantifierFrame[] = [];\n  let i = 0;\n  while (i < pattern.length) {\n    const ch = pattern[i];\n    if (ch === '\\\\') {\n      i += 2;\n      continue;\n    }\n    if (ch === '[') {\n      i = findCharClassEnd(pattern, i) + 1;\n      continue;\n    }\n    if (ch === '(') {\n      stack.push({ hasBacktrackRisk: false });\n      i = skipGroupSyntaxPrefix(pattern, i + 1);\n      continue;\n    }\n    if (ch === ')') {\n      const frame = stack.pop();\n      if (frame === undefined) {\n        i++;\n        continue;\n      }\n      const next = pattern[i + 1];\n      const isQuantifier =\n        next === '*' || next === '+' || next === '?' || next === '{';\n      if (isQuantifier && frame.hasBacktrackRisk) {\n        return true;\n      }\n      if (stack.length > 0 && (frame.hasBacktrackRisk || isQuantifier)) {\n        stack[stack.length - 1].hasBacktrackRisk = true;\n      }\n      i++;\n      continue;\n    }\n    if (ch === '*' || ch === '+' || ch === '?' || ch === '{') {\n      if (stack.length > 0) {\n        stack[stack.length - 1].hasBacktrackRisk = true;\n      }\n    }\n    i++;\n  }\n  return false;\n}\n\nfunction findCharClassEnd(pattern: string, start: number): number {\n  let i = start + 1;\n  while (i < pattern.length) {\n    const ch = pattern[i];\n    if (ch === '\\\\') {\n      i += 2;\n      continue;\n    }\n    if (ch === ']') {\n      return i;\n    }\n    i++;\n  }\n  return pattern.length - 1;\n}\n\nfunction compile(pattern: string): RegExp | null {\n  const cached = patternCache.get(pattern);\n  if (cached !== undefined) {\n    touchCacheEntry(pattern, cached);\n    return cached.regex;\n  }\n  if (pattern.length > MAX_PATTERN_LENGTH) {\n    setCacheEntry(pattern, { regex: null });\n    return null;\n  }\n  if (hasNestedQuantifier(pattern)) {\n    setCacheEntry(pattern, { regex: null });\n    return null;\n  }\n  try {\n    const regex = new RegExp(pattern);\n    setCacheEntry(pattern, { regex });\n    return regex;\n  } catch {\n    setCacheEntry(pattern, { regex: null });\n    return null;\n  }\n}\n\n/**\n * Tests whether a hook matcher pattern matches the given query string.\n *\n * ## Semantics\n *\n * - `undefined` or empty `pattern` matches any query (wildcard). This is\n *   the intended shape for events that do not supply a query string at\n *   all (`RunStart`, `Stop`, etc.) — register such matchers without a\n *   pattern.\n * - `undefined` or empty `query` with a non-empty `pattern` never matches.\n *   Setting a pattern on a query-less event is therefore inert: the\n *   matcher will simply never fire. This is intentional — it keeps\n *   query-based filtering out of event types where \"query\" has no meaning,\n *   and is documented on `HookMatcher.pattern`.\n * - Otherwise, the pattern is compiled once (via a bounded LRU cache) and\n *   tested against the query.\n * - Invalid regex patterns never throw — a failed compile is cached as\n *   \"never matches\" so a single malformed pattern cannot take out a whole\n *   `executeHooks` batch.\n *\n * ## ReDoS mitigations\n *\n * Patterns compile through three cheap gates before reaching `new RegExp`:\n *\n * 1. {@link MAX_PATTERN_LENGTH} length cap rejects oversized inputs.\n * 2. {@link hasNestedQuantifier} rejects the most common catastrophic-\n *    backtracking shape (quantified group containing a quantifier).\n * 3. Successful compiles are cached in a bounded LRU so repeated calls\n *    never re-enter the regex compiler.\n *\n * These are a floor, not a ceiling. Hosts that accept user-supplied\n * patterns should still validate standard. The design report §3.8 routes\n * persistable hooks through a host-side compiler before they reach this\n * module.\n */\nexport function matchesQuery(\n  pattern: string | undefined,\n  query: string | undefined\n): boolean {\n  if (pattern === undefined || pattern === '') {\n    return true;\n  }\n  if (query === undefined || query === '') {\n    return false;\n  }\n  const regex = compile(pattern);\n  if (regex === null) {\n    return false;\n  }\n  return regex.test(query);\n}\n\n/** Clears the regex compilation cache. Intended for test isolation. */\nexport function clearMatcherCache(): void {\n  patternCache.clear();\n}\n\n/** Returns the current size of the compilation cache. Intended for tests. */\nexport function getMatcherCacheSize(): number {\n  return patternCache.size;\n}\n"],"names":[],"mappings":";;AAAA;AAEA;;;;;;;;;AASG;AACI,MAAM,kBAAkB,GAAG;AAElC;;;;;;;;;AASG;AACI,MAAM,cAAc,GAAG;AAM9B;;;;;;;;;AASG;AACH,MAAM,YAAY,GAA4B,IAAI,GAAG,EAAE;AAEvD;;;;;;AAMG;AACH,MAAM,qBAAqB,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,cAAc,GAAG,CAAC,IAAI,CAAC,CAAC;AAElE,SAAS,eAAe,CAAC,OAAe,EAAE,KAAiB,EAAA;AACzD,IAAA,IAAI,YAAY,CAAC,IAAI,GAAG,qBAAqB,EAAE;QAC7C;IACF;AACA,IAAA,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC;AAC5B,IAAA,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC;AAClC;AAEA,SAAS,aAAa,CAAC,OAAe,EAAE,KAAiB,EAAA;AACvD,IAAA,IAAI,YAAY,CAAC,IAAI,IAAI,cAAc,EAAE;QACvC,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK;AAClD,QAAA,IAAI,SAAS,KAAK,SAAS,EAAE;AAC3B,YAAA,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC;QAChC;IACF;AACA,IAAA,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC;AAClC;AAMA,SAAS,qBAAqB,CAAC,OAAe,EAAE,KAAa,EAAA;AAC3D,IAAA,IAAI,KAAK,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE;AACrD,QAAA,OAAO,KAAK;IACd;AACA,IAAA,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC;AACjB,IAAA,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE;AACvB,QAAA,OAAO,CAAC;IACV;AACA,IAAA,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC;AAC3B,IAAA,IAAI,QAAQ,KAAK,GAAG,IAAI,QAAQ,KAAK,GAAG,IAAI,QAAQ,KAAK,GAAG,EAAE;QAC5D,OAAO,CAAC,GAAG,CAAC;IACd;AACA,IAAA,IAAI,QAAQ,KAAK,GAAG,EAAE;AACpB,QAAA,OAAO,CAAC;IACV;AACA,IAAA,CAAC,EAAE;IACH,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE;QACpE,OAAO,CAAC,GAAG,CAAC;IACd;AACA,IAAA,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;AAC/C,QAAA,CAAC,EAAE;IACL;AACA,IAAA,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE;AACtB,QAAA,CAAC,EAAE;IACL;AACA,IAAA,OAAO,CAAC;AACV;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BG;AACG,SAAU,mBAAmB,CAAC,OAAe,EAAA;IACjD,MAAM,KAAK,GAAsB,EAAE;IACnC,IAAI,CAAC,GAAG,CAAC;AACT,IAAA,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE;AACzB,QAAA,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;AACrB,QAAA,IAAI,EAAE,KAAK,IAAI,EAAE;YACf,CAAC,IAAI,CAAC;YACN;QACF;AACA,QAAA,IAAI,EAAE,KAAK,GAAG,EAAE;YACd,CAAC,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC;YACpC;QACF;AACA,QAAA,IAAI,EAAE,KAAK,GAAG,EAAE;YACd,KAAK,CAAC,IAAI,CAAC,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC;YACvC,CAAC,GAAG,qBAAqB,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC;YACzC;QACF;AACA,QAAA,IAAI,EAAE,KAAK,GAAG,EAAE;AACd,YAAA,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE;AACzB,YAAA,IAAI,KAAK,KAAK,SAAS,EAAE;AACvB,gBAAA,CAAC,EAAE;gBACH;YACF;YACA,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;AAC3B,YAAA,MAAM,YAAY,GAChB,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG;AAC9D,YAAA,IAAI,YAAY,IAAI,KAAK,CAAC,gBAAgB,EAAE;AAC1C,gBAAA,OAAO,IAAI;YACb;AACA,YAAA,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,KAAK,CAAC,gBAAgB,IAAI,YAAY,CAAC,EAAE;gBAChE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,gBAAgB,GAAG,IAAI;YACjD;AACA,YAAA,CAAC,EAAE;YACH;QACF;AACA,QAAA,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE;AACxD,YAAA,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;gBACpB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,gBAAgB,GAAG,IAAI;YACjD;QACF;AACA,QAAA,CAAC,EAAE;IACL;AACA,IAAA,OAAO,KAAK;AACd;AAEA,SAAS,gBAAgB,CAAC,OAAe,EAAE,KAAa,EAAA;AACtD,IAAA,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC;AACjB,IAAA,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE;AACzB,QAAA,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;AACrB,QAAA,IAAI,EAAE,KAAK,IAAI,EAAE;YACf,CAAC,IAAI,CAAC;YACN;QACF;AACA,QAAA,IAAI,EAAE,KAAK,GAAG,EAAE;AACd,YAAA,OAAO,CAAC;QACV;AACA,QAAA,CAAC,EAAE;IACL;AACA,IAAA,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC;AAC3B;AAEA,SAAS,OAAO,CAAC,OAAe,EAAA;IAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC;AACxC,IAAA,IAAI,MAAM,KAAK,SAAS,EAAE;AACxB,QAAA,eAAe,CAAC,OAAO,EAAE,MAAM,CAAC;QAChC,OAAO,MAAM,CAAC,KAAK;IACrB;AACA,IAAA,IAAI,OAAO,CAAC,MAAM,GAAG,kBAAkB,EAAE;QACvC,aAAa,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACvC,QAAA,OAAO,IAAI;IACb;AACA,IAAA,IAAI,mBAAmB,CAAC,OAAO,CAAC,EAAE;QAChC,aAAa,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACvC,QAAA,OAAO,IAAI;IACb;AACA,IAAA,IAAI;AACF,QAAA,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC;AACjC,QAAA,aAAa,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,CAAC;AACjC,QAAA,OAAO,KAAK;IACd;AAAE,IAAA,MAAM;QACN,aAAa,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACvC,QAAA,OAAO,IAAI;IACb;AACF;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkCG;AACG,SAAU,YAAY,CAC1B,OAA2B,EAC3B,KAAyB,EAAA;IAEzB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,EAAE,EAAE;AAC3C,QAAA,OAAO,IAAI;IACb;IACA,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,EAAE,EAAE;AACvC,QAAA,OAAO,KAAK;IACd;AACA,IAAA,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC;AAC9B,IAAA,IAAI,KAAK,KAAK,IAAI,EAAE;AAClB,QAAA,OAAO,KAAK;IACd;AACA,IAAA,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;AAC1B;;;;;;;"}
+{"version":3,"file":"matchers.cjs","sources":["../../../src/hooks/matchers.ts"],"sourcesContent":["// src/hooks/matchers.ts\n\n/**\n * Upper bound on hook-matcher pattern length. Patterns longer than this\n * are rejected outright — the goal is a cheap cap on pathological inputs\n * (repeated quantifiers, huge alternation groups) without pulling in a\n * safe-regex dependency.\n *\n * Legitimate matchers are almost always under 50 characters (tool names,\n * short alternations, simple prefix anchors); 512 leaves generous\n * headroom while preventing 10KB regexes.\n */\nexport const MAX_PATTERN_LENGTH = 512;\n\n/**\n * Upper bound on the compilation cache. Chosen to comfortably hold every\n * distinct pattern a single multi-tenant run is likely to see (tools,\n * agent types, basename filters) without growing without bound.\n *\n * Under hosts that register unique patterns per tenant, LRU eviction\n * keeps the working set bounded — cold patterns are re-compiled on next\n * use, which is the correct cost trade-off for long-running processes\n * that must not leak memory.\n */\nexport const MAX_CACHE_SIZE = 256;\n\ninterface CacheEntry {\n  regex: RegExp | null;\n}\n\n/**\n * Module-level LRU cache keyed by pattern string. Map iteration order is\n * insertion order in ECMAScript, so refreshing an entry's position means\n * \"delete then re-set\". On overflow we evict the first key (least\n * recently used).\n *\n * Failed compiles are cached as `{ regex: null }` so a malformed pattern\n * does not re-enter the compiler — and so a tenant spamming bad patterns\n * doesn't burn CPU on every call.\n */\nconst patternCache: Map<string, CacheEntry> = new Map();\n\n/**\n * Threshold above which `touchCacheEntry` actually performs the LRU\n * refresh. Below this watermark the cache has zero eviction pressure, so\n * the delete+set on every hit would be pure overhead. Above it we refresh\n * properly so hot patterns survive evictions. 75% of capacity is the\n * standard sweet spot.\n */\nconst LRU_REFRESH_THRESHOLD = Math.floor((MAX_CACHE_SIZE * 3) / 4);\n\nfunction touchCacheEntry(pattern: string, entry: CacheEntry): void {\n  if (patternCache.size < LRU_REFRESH_THRESHOLD) {\n    return;\n  }\n  patternCache.delete(pattern);\n  patternCache.set(pattern, entry);\n}\n\nfunction setCacheEntry(pattern: string, entry: CacheEntry): void {\n  if (patternCache.size >= MAX_CACHE_SIZE) {\n    const oldestKey = patternCache.keys().next().value;\n    if (oldestKey !== undefined) {\n      patternCache.delete(oldestKey);\n    }\n  }\n  patternCache.set(pattern, entry);\n}\n\ninterface QuantifierFrame {\n  hasBacktrackRisk: boolean;\n}\n\nfunction skipGroupSyntaxPrefix(pattern: string, start: number): number {\n  if (start >= pattern.length || pattern[start] !== '?') {\n    return start;\n  }\n  let i = start + 1;\n  if (i >= pattern.length) {\n    return i;\n  }\n  const modifier = pattern[i];\n  if (modifier === ':' || modifier === '=' || modifier === '!') {\n    return i + 1;\n  }\n  if (modifier !== '<') {\n    return i;\n  }\n  i++;\n  if (i < pattern.length && (pattern[i] === '=' || pattern[i] === '!')) {\n    return i + 1;\n  }\n  while (i < pattern.length && pattern[i] !== '>') {\n    i++;\n  }\n  if (i < pattern.length) {\n    i++;\n  }\n  return i;\n}\n\n/**\n * Cheap syntactic detector for the most common catastrophic-backtracking\n * shape: a quantified group that contains another quantifier (e.g.\n * `(a+)+`, `(.*)*`, `(\\w+)+$`, `(?:(a+))+`). This is the \"nested\n * quantifier\" class of ReDoS — runs in polynomial-or-worse time on\n * adversarial inputs.\n *\n * The scan walks the pattern linearly using an explicit stack of group\n * frames. For each group it tracks whether the group's contents include\n * \"backtrack risk\" — meaning a direct quantifier OR a nested group that\n * carries risk up. When a group closes with a trailing quantifier AND its\n * frame carries backtrack risk, the pattern is flagged. Risk propagates\n * to the enclosing frame when a child group closes (whether the child\n * itself was quantified or not), so `(?:(a+))+` — equivalent to `(a+)+`\n * — is flagged correctly even though the outer non-capturing wrapper is\n * one level removed from the inner quantifier.\n *\n * ## Group-syntax prefixes\n *\n * Non-capturing groups (`(?:`), lookaheads (`(?=`, `(?!`), lookbehinds\n * (`(?<=`, `(?<!`), and named groups (`(?<name>`) are skipped over at\n * the `(` so their `?` is not misread as a quantifier. Without this,\n * `(?:pre_)?tool_name` would be incorrectly rejected because the scanner\n * would see the group-syntax `?` as a quantifier at depth 1.\n *\n * ## Heuristic, not a proof\n *\n * This catches the common forms but not all. Ambiguous-alternation ReDoS\n * like `(a|a)+` is not detected. Pathologically long patterns are also\n * caught by {@link MAX_PATTERN_LENGTH}. Hosts that accept user-supplied\n * patterns must still validate upstream.\n */\nexport function hasNestedQuantifier(pattern: string): boolean {\n  const stack: QuantifierFrame[] = [];\n  let i = 0;\n  while (i < pattern.length) {\n    const ch = pattern[i];\n    if (ch === '\\\\') {\n      i += 2;\n      continue;\n    }\n    if (ch === '[') {\n      i = findCharClassEnd(pattern, i) + 1;\n      continue;\n    }\n    if (ch === '(') {\n      stack.push({ hasBacktrackRisk: false });\n      i = skipGroupSyntaxPrefix(pattern, i + 1);\n      continue;\n    }\n    if (ch === ')') {\n      const frame = stack.pop();\n      if (frame === undefined) {\n        i++;\n        continue;\n      }\n      const next = pattern[i + 1];\n      const isQuantifier =\n        next === '*' || next === '+' || next === '?' || next === '{';\n      if (isQuantifier && frame.hasBacktrackRisk) {\n        return true;\n      }\n      if (stack.length > 0 && (frame.hasBacktrackRisk || isQuantifier)) {\n        stack[stack.length - 1].hasBacktrackRisk = true;\n      }\n      i++;\n      continue;\n    }\n    if (ch === '*' || ch === '+' || ch === '?' || ch === '{') {\n      if (stack.length > 0) {\n        stack[stack.length - 1].hasBacktrackRisk = true;\n      }\n    }\n    i++;\n  }\n  return false;\n}\n\nfunction findCharClassEnd(pattern: string, start: number): number {\n  let i = start + 1;\n  while (i < pattern.length) {\n    const ch = pattern[i];\n    if (ch === '\\\\') {\n      i += 2;\n      continue;\n    }\n    if (ch === ']') {\n      return i;\n    }\n    i++;\n  }\n  return pattern.length - 1;\n}\n\nfunction compile(pattern: string): RegExp | null {\n  const cached = patternCache.get(pattern);\n  if (cached !== undefined) {\n    touchCacheEntry(pattern, cached);\n    return cached.regex;\n  }\n  if (pattern.length > MAX_PATTERN_LENGTH) {\n    setCacheEntry(pattern, { regex: null });\n    return null;\n  }\n  if (hasNestedQuantifier(pattern)) {\n    setCacheEntry(pattern, { regex: null });\n    return null;\n  }\n  try {\n    const regex = new RegExp(pattern);\n    setCacheEntry(pattern, { regex });\n    return regex;\n  } catch {\n    setCacheEntry(pattern, { regex: null });\n    return null;\n  }\n}\n\n/**\n * Tests whether a hook matcher pattern matches the given query string.\n *\n * ## Semantics\n *\n * - `undefined` or empty `pattern` matches any query (wildcard). This is\n *   the intended shape for events that do not supply a query string at\n *   all (`RunStart`, `Stop`, etc.) — register such matchers without a\n *   pattern.\n * - `undefined` or empty `query` with a non-empty `pattern` never matches.\n *   Setting a pattern on a query-less event is therefore inert: the\n *   matcher will simply never fire. This is intentional — it keeps\n *   query-based filtering out of event types where \"query\" has no meaning,\n *   and is documented on `HookMatcher.pattern`.\n * - Otherwise, the pattern is compiled once (via a bounded LRU cache) and\n *   tested against the query.\n * - Invalid regex patterns never throw — a failed compile is cached as\n *   \"never matches\" so a single malformed pattern cannot take out a whole\n *   `executeHooks` batch.\n *\n * ## ReDoS mitigations\n *\n * Patterns compile through three cheap gates before reaching `new RegExp`:\n *\n * 1. {@link MAX_PATTERN_LENGTH} length cap rejects oversized inputs.\n * 2. {@link hasNestedQuantifier} rejects the most common catastrophic-\n *    backtracking shape (quantified group containing a quantifier).\n * 3. Successful compiles are cached in a bounded LRU so repeated calls\n *    never re-enter the regex compiler.\n *\n * These are a floor, not a ceiling. Hosts that accept user-supplied\n * patterns should still validate upstream. The design report §3.8 routes\n * persistable hooks through a host-side compiler before they reach this\n * module.\n */\nexport function matchesQuery(\n  pattern: string | undefined,\n  query: string | undefined\n): boolean {\n  if (pattern === undefined || pattern === '') {\n    return true;\n  }\n  if (query === undefined || query === '') {\n    return false;\n  }\n  const regex = compile(pattern);\n  if (regex === null) {\n    return false;\n  }\n  return regex.test(query);\n}\n\n/** Clears the regex compilation cache. Intended for test isolation. */\nexport function clearMatcherCache(): void {\n  patternCache.clear();\n}\n\n/** Returns the current size of the compilation cache. Intended for tests. */\nexport function getMatcherCacheSize(): number {\n  return patternCache.size;\n}\n"],"names":[],"mappings":";;AAAA;AAEA;;;;;;;;;AASG;AACI,MAAM,kBAAkB,GAAG;AAElC;;;;;;;;;AASG;AACI,MAAM,cAAc,GAAG;AAM9B;;;;;;;;;AASG;AACH,MAAM,YAAY,GAA4B,IAAI,GAAG,EAAE;AAEvD;;;;;;AAMG;AACH,MAAM,qBAAqB,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,cAAc,GAAG,CAAC,IAAI,CAAC,CAAC;AAElE,SAAS,eAAe,CAAC,OAAe,EAAE,KAAiB,EAAA;AACzD,IAAA,IAAI,YAAY,CAAC,IAAI,GAAG,qBAAqB,EAAE;QAC7C;IACF;AACA,IAAA,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC;AAC5B,IAAA,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC;AAClC;AAEA,SAAS,aAAa,CAAC,OAAe,EAAE,KAAiB,EAAA;AACvD,IAAA,IAAI,YAAY,CAAC,IAAI,IAAI,cAAc,EAAE;QACvC,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK;AAClD,QAAA,IAAI,SAAS,KAAK,SAAS,EAAE;AAC3B,YAAA,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC;QAChC;IACF;AACA,IAAA,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC;AAClC;AAMA,SAAS,qBAAqB,CAAC,OAAe,EAAE,KAAa,EAAA;AAC3D,IAAA,IAAI,KAAK,IAAI,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE;AACrD,QAAA,OAAO,KAAK;IACd;AACA,IAAA,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC;AACjB,IAAA,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE;AACvB,QAAA,OAAO,CAAC;IACV;AACA,IAAA,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC;AAC3B,IAAA,IAAI,QAAQ,KAAK,GAAG,IAAI,QAAQ,KAAK,GAAG,IAAI,QAAQ,KAAK,GAAG,EAAE;QAC5D,OAAO,CAAC,GAAG,CAAC;IACd;AACA,IAAA,IAAI,QAAQ,KAAK,GAAG,EAAE;AACpB,QAAA,OAAO,CAAC;IACV;AACA,IAAA,CAAC,EAAE;IACH,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE;QACpE,OAAO,CAAC,GAAG,CAAC;IACd;AACA,IAAA,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;AAC/C,QAAA,CAAC,EAAE;IACL;AACA,IAAA,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE;AACtB,QAAA,CAAC,EAAE;IACL;AACA,IAAA,OAAO,CAAC;AACV;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BG;AACG,SAAU,mBAAmB,CAAC,OAAe,EAAA;IACjD,MAAM,KAAK,GAAsB,EAAE;IACnC,IAAI,CAAC,GAAG,CAAC;AACT,IAAA,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE;AACzB,QAAA,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;AACrB,QAAA,IAAI,EAAE,KAAK,IAAI,EAAE;YACf,CAAC,IAAI,CAAC;YACN;QACF;AACA,QAAA,IAAI,EAAE,KAAK,GAAG,EAAE;YACd,CAAC,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC;YACpC;QACF;AACA,QAAA,IAAI,EAAE,KAAK,GAAG,EAAE;YACd,KAAK,CAAC,IAAI,CAAC,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC;YACvC,CAAC,GAAG,qBAAqB,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC;YACzC;QACF;AACA,QAAA,IAAI,EAAE,KAAK,GAAG,EAAE;AACd,YAAA,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE;AACzB,YAAA,IAAI,KAAK,KAAK,SAAS,EAAE;AACvB,gBAAA,CAAC,EAAE;gBACH;YACF;YACA,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;AAC3B,YAAA,MAAM,YAAY,GAChB,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG;AAC9D,YAAA,IAAI,YAAY,IAAI,KAAK,CAAC,gBAAgB,EAAE;AAC1C,gBAAA,OAAO,IAAI;YACb;AACA,YAAA,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,KAAK,CAAC,gBAAgB,IAAI,YAAY,CAAC,EAAE;gBAChE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,gBAAgB,GAAG,IAAI;YACjD;AACA,YAAA,CAAC,EAAE;YACH;QACF;AACA,QAAA,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE;AACxD,YAAA,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;gBACpB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,gBAAgB,GAAG,IAAI;YACjD;QACF;AACA,QAAA,CAAC,EAAE;IACL;AACA,IAAA,OAAO,KAAK;AACd;AAEA,SAAS,gBAAgB,CAAC,OAAe,EAAE,KAAa,EAAA;AACtD,IAAA,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC;AACjB,IAAA,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE;AACzB,QAAA,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;AACrB,QAAA,IAAI,EAAE,KAAK,IAAI,EAAE;YACf,CAAC,IAAI,CAAC;YACN;QACF;AACA,QAAA,IAAI,EAAE,KAAK,GAAG,EAAE;AACd,YAAA,OAAO,CAAC;QACV;AACA,QAAA,CAAC,EAAE;IACL;AACA,IAAA,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC;AAC3B;AAEA,SAAS,OAAO,CAAC,OAAe,EAAA;IAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC;AACxC,IAAA,IAAI,MAAM,KAAK,SAAS,EAAE;AACxB,QAAA,eAAe,CAAC,OAAO,EAAE,MAAM,CAAC;QAChC,OAAO,MAAM,CAAC,KAAK;IACrB;AACA,IAAA,IAAI,OAAO,CAAC,MAAM,GAAG,kBAAkB,EAAE;QACvC,aAAa,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACvC,QAAA,OAAO,IAAI;IACb;AACA,IAAA,IAAI,mBAAmB,CAAC,OAAO,CAAC,EAAE;QAChC,aAAa,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACvC,QAAA,OAAO,IAAI;IACb;AACA,IAAA,IAAI;AACF,QAAA,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC;AACjC,QAAA,aAAa,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,CAAC;AACjC,QAAA,OAAO,KAAK;IACd;AAAE,IAAA,MAAM;QACN,aAAa,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACvC,QAAA,OAAO,IAAI;IACb;AACF;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkCG;AACG,SAAU,YAAY,CAC1B,OAA2B,EAC3B,KAAyB,EAAA;IAEzB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,EAAE,EAAE;AAC3C,QAAA,OAAO,IAAI;IACb;IACA,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,EAAE,EAAE;AACvC,QAAA,OAAO,KAAK;IACd;AACA,IAAA,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC;AAC9B,IAAA,IAAI,KAAK,KAAK,IAAI,EAAE;AAClB,QAAA,OAAO,KAAK;IACd;AACA,IAAA,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;AAC1B;;;;;;;"}

package/dist/cjs/hooks/types.cjs

@@ -6,7 +6,7 @@
  * These mirror the subset of Claude Code's event surface that makes sense
  * for a library context (no filesystem/CLI-specific events). See
  * `docs/hooks-design-report.md` §3.2 for the mapping to existing
- * `@illuma-ai/agents` emission points.
+ * `@librechat/agents` emission points.
  */
 const HOOK_EVENTS = [
     'RunStart',