@librechat/agents 3.4.6 → 3.5.0

package/dist/cjs/tools/subagent/childGraphConfig.cjs

@@ -168,7 +168,6 @@ function normalizeSingleAgentConfig(config, parentContext) {
 	if (!isNonEmptyString(config.configId)) throw new Error(`Lazy subagent "${config.type}" requires a non-empty "configId".`);
 	return config;
 }
-/** Normalize eager, self, lazy, and graph subagent entries for advertisement. */
 function normalizeSubagentConfigEntries(configs, parentContext) {
 	const normalized = [];
 	const seenTypes = /* @__PURE__ */ new Set();
@@ -185,17 +184,14 @@ function normalizeSubagentConfigEntries(configs, parentContext) {
 	}
 	return normalized;
 }
-/** Resolve self-spawn inputs and validate explicit graph configs. */
 function resolveSubagentConfigEntries(configs, parentContext) {
 	return normalizeSubagentConfigEntries(configs, parentContext).filter((config) => isGraphSubagentConfig(config) || config.agentInputs != null);
 }
-/** Resolve legacy single-agent configs with the original public signature. */
 function resolveSubagentConfigs(configs, parentContext) {
 	const graphConfig = configs.find(isGraphSubagentConfig);
 	if (graphConfig != null) throw new Error(`Graph subagent "${graphConfig.type}" requires resolveSubagentConfigEntries().`);
 	return resolveSubagentConfigEntries(configs, parentContext);
 }
-/** Normalize legacy single-agent configs while rejecting graph entries. */
 function normalizeSubagentConfigs(configs, parentContext) {
 	const graphConfig = configs.find(isGraphSubagentConfig);
 	if (graphConfig != null) throw new Error(`Graph subagent "${graphConfig.type}" requires normalizeSubagentConfigEntries().`);

package/dist/cjs/tools/subagent/childGraphConfig.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"childGraphConfig.cjs","names":["MAX_GRAPH_SUBAGENT_TURNS"],"sources":["../../../../src/tools/subagent/childGraphConfig.ts"],"sourcesContent":["import type {\n  AgentInputs,\n  ExecutableSubagentConfig,\n  ExecutableSubagentConfigEntry,\n  GraphEdge,\n  GraphSubagentConfig,\n  ResolvedSingleAgentSubagentConfig,\n  ResolvedSubagentConfig,\n  ResolvedSubagentConfigEntry,\n  SubagentConfig,\n  SubagentConfigEntry,\n} from '@/types';\nimport type { AgentContext } from '@/agents/AgentContext';\nimport {\n  MAX_GRAPH_SUBAGENT_MEMBERS,\n  MAX_GRAPH_SUBAGENT_TURNS,\n} from './runtimeLimits';\n\nconst RESERVED_GRAPH_MEMBER_IDS = new Set([\n  '__start__',\n  '__end__',\n  'messages',\n  'agentMessages',\n  'subagentResult',\n]);\n\ntype ChildGraphPlanBase = {\n  subjectAgentId: string;\n  checkpointNodeId: string;\n  agents: AgentInputs[];\n  memberInputs: ReadonlyMap<string, AgentInputs>;\n};\n\nexport type ChildGraphPlan =\n  | (ChildGraphPlanBase & {\n      kind: 'agent';\n    })\n  | (ChildGraphPlanBase & {\n      kind: 'graph';\n      edges: GraphEdge[];\n      entryAgentId: string;\n      resultAgentId: string;\n    });\n\ntype CreateChildGraphPlanParams = {\n  config: ResolvedSubagentConfigEntry;\n  executionSuffix: string;\n  parentAgentId?: string;\n  parentMaxDepth: number;\n  keepToolDefinitions: boolean;\n};\n\ntype UnvalidatedGraphSubagentConfig = Omit<\n  GraphSubagentConfig,\n  'allowNested' | 'edges'\n> & { allowNested?: boolean; edges: GraphEdge[] };\n\ntype GraphSubagentConfigCandidate = {\n  kind?: unknown;\n  type?: unknown;\n  name?: unknown;\n  description?: unknown;\n  maxTurns?: unknown;\n  allowNested?: unknown;\n  agents?: unknown;\n  edges?: unknown;\n  entryAgentId?: unknown;\n  resultAgentId?: unknown;\n  configId?: unknown;\n  agentInputs?: unknown;\n  resolveAgentInputs?: unknown;\n  self?: unknown;\n};\n\nfunction isObject(value: unknown): value is object {\n  return value != null && typeof value === 'object';\n}\n\nfunction isNonEmptyString(value: unknown): value is string {\n  return typeof value === 'string' && value.trim() !== '';\n}\n\nexport function isGraphSubagentConfig(\n  config: SubagentConfigEntry\n): config is GraphSubagentConfig {\n  return (config as { kind?: unknown }).kind === 'graph';\n}\n\nfunction assertGraphSubagentConfigShape(\n  input: unknown\n): asserts input is UnvalidatedGraphSubagentConfig {\n  if (!isObject(input)) {\n    throw new Error('Graph subagent config must be an object.');\n  }\n  const candidate = input as GraphSubagentConfigCandidate;\n  const configType = isNonEmptyString(candidate.type)\n    ? candidate.type\n    : '<unknown>';\n  if (candidate.kind !== 'graph') {\n    throw new Error(`Graph subagent \"${configType}\" must set kind to \"graph\".`);\n  }\n  for (const [field, value] of [\n    ['type', candidate.type],\n    ['name', candidate.name],\n    ['description', candidate.description],\n    ['entryAgentId', candidate.entryAgentId],\n    ['resultAgentId', candidate.resultAgentId],\n  ] as const) {\n    if (!isNonEmptyString(value)) {\n      throw new Error(\n        `Graph subagent \"${configType}\" must define a non-empty ${field}.`\n      );\n    }\n  }\n  if (!Array.isArray(candidate.agents)) {\n    throw new Error(`Graph subagent \"${configType}\" agents must be an array.`);\n  }\n  const agents: unknown[] = candidate.agents;\n  for (const agent of agents) {\n    if (!isObject(agent)) {\n      throw new Error(\n        `Graph subagent \"${configType}\" agents must contain objects.`\n      );\n    }\n  }\n  if (!Array.isArray(candidate.edges)) {\n    throw new Error(`Graph subagent \"${configType}\" edges must be an array.`);\n  }\n  const edges: unknown[] = candidate.edges;\n  for (const edge of edges) {\n    if (!isObject(edge)) {\n      throw new Error(\n        `Graph subagent \"${configType}\" edges must contain objects.`\n      );\n    }\n  }\n  if (\n    candidate.allowNested != null &&\n    typeof candidate.allowNested !== 'boolean'\n  ) {\n    throw new Error(\n      `Graph subagent \"${configType}\" allowNested must be a boolean.`\n    );\n  }\n  if (\n    candidate.maxTurns != null &&\n    (typeof candidate.maxTurns !== 'number' ||\n      !Number.isSafeInteger(candidate.maxTurns) ||\n      candidate.maxTurns <= 0)\n  ) {\n    throw new Error(\n      `Graph subagent \"${configType}\" maxTurns must be a positive safe integer.`\n    );\n  }\n  if (\n    candidate.agentInputs !== undefined ||\n    candidate.resolveAgentInputs !== undefined ||\n    candidate.configId !== undefined ||\n    candidate.self !== undefined\n  ) {\n    throw new Error(\n      `Graph subagent \"${configType}\" cannot define agentInputs or self, or lazy fields configId/resolveAgentInputs.`\n    );\n  }\n}\n\nfunction getEndpoints(endpoint: string | string[]): string[] {\n  return Array.isArray(endpoint) ? endpoint : [endpoint];\n}\n\nfunction assertNonEmptyUniqueEndpoints(\n  endpoints: string[],\n  label: string,\n  edgeIndex: number\n): void {\n  if (endpoints.length === 0) {\n    throw new Error(\n      `Graph subagent edge ${edgeIndex} must include at least one ${label} agent.`\n    );\n  }\n  const seen = new Set<string>();\n  for (const endpoint of endpoints) {\n    if (typeof endpoint !== 'string' || endpoint.trim() === '') {\n      throw new Error(\n        `Graph subagent edge ${edgeIndex} contains a blank ${label} agent ID.`\n      );\n    }\n    if (seen.has(endpoint)) {\n      throw new Error(\n        `Graph subagent edge ${edgeIndex} repeats ${label} agent \"${endpoint}\".`\n      );\n    }\n    seen.add(endpoint);\n  }\n}\n\nfunction visitReachable(\n  start: string,\n  adjacency: ReadonlyMap<string, ReadonlySet<string>>\n): Set<string> {\n  const visited = new Set<string>();\n  const pending = [start];\n  while (pending.length > 0) {\n    const current = pending.pop();\n    if (current == null || visited.has(current)) {\n      continue;\n    }\n    visited.add(current);\n    for (const next of adjacency.get(current) ?? []) {\n      if (!visited.has(next)) {\n        pending.push(next);\n      }\n    }\n  }\n  return visited;\n}\n\nexport function validateGraphSubagentConfig(config: unknown): void {\n  assertGraphSubagentConfigShape(config);\n  if (config.agents.length === 0) {\n    throw new Error(`Graph subagent \"${config.type}\" must include an agent.`);\n  }\n  if (config.agents.length > MAX_GRAPH_SUBAGENT_MEMBERS) {\n    throw new Error(\n      `Graph subagent \"${config.type}\" cannot exceed ${MAX_GRAPH_SUBAGENT_MEMBERS} agents.`\n    );\n  }\n  if (config.maxTurns != null && config.maxTurns > MAX_GRAPH_SUBAGENT_TURNS) {\n    throw new Error(\n      `Graph subagent \"${config.type}\" maxTurns exceeds the safe graph recursion budget.`\n    );\n  }\n  if (config.allowNested === true) {\n    throw new Error(\n      `Graph subagent \"${config.type}\" cannot enable allowNested because graph-member nesting and resume semantics are outside this MVP.`\n    );\n  }\n\n  const agentIds = new Set<string>();\n  for (const agent of config.agents) {\n    if (typeof agent.agentId !== 'string' || agent.agentId.trim() === '') {\n      throw new Error(\n        `Graph subagent \"${config.type}\" contains a blank agent ID.`\n      );\n    }\n    if (agentIds.has(agent.agentId)) {\n      throw new Error(\n        `Graph subagent \"${config.type}\" contains duplicate agent ID \"${agent.agentId}\".`\n      );\n    }\n    if (\n      RESERVED_GRAPH_MEMBER_IDS.has(agent.agentId) ||\n      agent.agentId.includes('|') ||\n      agent.agentId.includes(':')\n    ) {\n      throw new Error(\n        `Graph subagent \"${config.type}\" agent ID \"${agent.agentId}\" is reserved by the graph runtime.`\n      );\n    }\n    agentIds.add(agent.agentId);\n  }\n\n  if (!agentIds.has(config.entryAgentId)) {\n    throw new Error(\n      `Graph subagent \"${config.type}\" entryAgentId \"${config.entryAgentId}\" is not a configured agent.`\n    );\n  }\n  if (!agentIds.has(config.resultAgentId)) {\n    throw new Error(\n      `Graph subagent \"${config.type}\" resultAgentId \"${config.resultAgentId}\" is not a configured agent.`\n    );\n  }\n\n  const adjacency = new Map<string, Set<string>>();\n  const reverseAdjacency = new Map<string, Set<string>>();\n  const incomingEdgeSources = new Map<string, string[][]>();\n  const promptedEdges: Array<{\n    edgeIndex: number;\n    destinations: string[];\n  }> = [];\n  const directedEdges = new Set<string>();\n  for (const agentId of agentIds) {\n    adjacency.set(agentId, new Set());\n    reverseAdjacency.set(agentId, new Set());\n  }\n\n  for (let edgeIndex = 0; edgeIndex < config.edges.length; edgeIndex++) {\n    const edge = config.edges[edgeIndex];\n    if (edge.edgeType !== 'direct') {\n      throw new Error(\n        `Graph subagent \"${config.type}\" edge ${edgeIndex} must set edgeType to \"direct\".`\n      );\n    }\n    if (edge.condition != null) {\n      throw new Error(\n        `Graph subagent \"${config.type}\" edge ${edgeIndex} cannot define a condition.`\n      );\n    }\n    if (edge.promptKey != null) {\n      throw new Error(\n        `Graph subagent \"${config.type}\" edge ${edgeIndex} cannot define promptKey.`\n      );\n    }\n    const runtimePrompt = (edge as { prompt?: unknown }).prompt;\n    if (\n      runtimePrompt != null &&\n      typeof runtimePrompt !== 'string' &&\n      typeof runtimePrompt !== 'function'\n    ) {\n      throw new Error(\n        `Graph subagent \"${config.type}\" edge ${edgeIndex} prompt must be a string or function.`\n      );\n    }\n    const runtimeExcludeResults = (edge as { excludeResults?: unknown })\n      .excludeResults;\n    if (\n      runtimeExcludeResults != null &&\n      typeof runtimeExcludeResults !== 'boolean'\n    ) {\n      throw new Error(\n        `Graph subagent \"${config.type}\" edge ${edgeIndex} excludeResults must be a boolean.`\n      );\n    }\n\n    const sources = getEndpoints(edge.from);\n    const destinations = getEndpoints(edge.to);\n    assertNonEmptyUniqueEndpoints(sources, 'source', edgeIndex);\n    assertNonEmptyUniqueEndpoints(destinations, 'destination', edgeIndex);\n    if (runtimePrompt != null && runtimePrompt !== '') {\n      promptedEdges.push({ edgeIndex, destinations });\n    } else if (runtimeExcludeResults != null) {\n      throw new Error(\n        `Graph subagent \"${config.type}\" edge ${edgeIndex} cannot define excludeResults without a prompt.`\n      );\n    }\n\n    for (const endpoint of [...sources, ...destinations]) {\n      if (!agentIds.has(endpoint)) {\n        throw new Error(\n          `Graph subagent \"${config.type}\" edge ${edgeIndex} references unknown agent \"${endpoint}\".`\n        );\n      }\n    }\n\n    for (const destination of destinations) {\n      const incomingGroups = incomingEdgeSources.get(destination) ?? [];\n      incomingGroups.push(sources);\n      incomingEdgeSources.set(destination, incomingGroups);\n      if (\n        edge.prompt != null &&\n        edge.prompt !== '' &&\n        agentIds.has(`fan_in_${destination}_prompt`)\n      ) {\n        throw new Error(\n          `Graph subagent \"${config.type}\" agent ID \"fan_in_${destination}_prompt\" conflicts with a generated prompt node.`\n        );\n      }\n      for (const source of sources) {\n        if (source === destination) {\n          throw new Error(\n            `Graph subagent \"${config.type}\" cannot contain self-edge \"${source}\".`\n          );\n        }\n        const edgeKey = `${source}\\u0000${destination}`;\n        if (directedEdges.has(edgeKey)) {\n          throw new Error(\n            `Graph subagent \"${config.type}\" repeats edge \"${source}\" -> \"${destination}\".`\n          );\n        }\n        directedEdges.add(edgeKey);\n        adjacency.get(source)!.add(destination);\n        reverseAdjacency.get(destination)!.add(source);\n      }\n    }\n  }\n\n  for (const [destination, incomingGroups] of incomingEdgeSources) {\n    const incomingSources = reverseAdjacency.get(destination)!;\n    if (incomingSources.size <= 1) {\n      continue;\n    }\n    if (\n      incomingGroups.length !== 1 ||\n      incomingGroups[0].length !== incomingSources.size\n    ) {\n      throw new Error(\n        `Graph subagent \"${config.type}\" fan-in to \"${destination}\" must use one edge with an array-valued from field.`\n      );\n    }\n  }\n\n  const isSimpleChain = [...agentIds].every(\n    (agentId) =>\n      adjacency.get(agentId)!.size <= 1 &&\n      reverseAdjacency.get(agentId)!.size <= 1\n  );\n  for (const { edgeIndex, destinations } of promptedEdges) {\n    if (destinations.length !== 1) {\n      throw new Error(\n        `Graph subagent \"${config.type}\" prompted edge ${edgeIndex} must have exactly one destination.`\n      );\n    }\n    if (!isSimpleChain && destinations[0] !== config.resultAgentId) {\n      throw new Error(\n        `Graph subagent \"${config.type}\" prompted edge ${edgeIndex} must target resultAgentId \"${config.resultAgentId}\" after parallel branches converge.`\n      );\n    }\n  }\n\n  const roots = [...agentIds].filter(\n    (agentId) => reverseAdjacency.get(agentId)!.size === 0\n  );\n  if (roots.length !== 1 || roots[0] !== config.entryAgentId) {\n    throw new Error(\n      `Graph subagent \"${config.type}\" must have entryAgentId \"${config.entryAgentId}\" as its only root.`\n    );\n  }\n  const sinks = [...agentIds].filter(\n    (agentId) => adjacency.get(agentId)!.size === 0\n  );\n  if (sinks.length !== 1 || sinks[0] !== config.resultAgentId) {\n    throw new Error(\n      `Graph subagent \"${config.type}\" must have resultAgentId \"${config.resultAgentId}\" as its only sink.`\n    );\n  }\n\n  const remainingIncoming = new Map<string, number>();\n  const ready: string[] = [];\n  for (const agentId of agentIds) {\n    const incomingCount = reverseAdjacency.get(agentId)!.size;\n    remainingIncoming.set(agentId, incomingCount);\n    if (incomingCount === 0) {\n      ready.push(agentId);\n    }\n  }\n  let visitedCount = 0;\n  while (ready.length > 0) {\n    const current = ready.pop()!;\n    visitedCount++;\n    for (const destination of adjacency.get(current) ?? []) {\n      const incomingCount = remainingIncoming.get(destination)! - 1;\n      remainingIncoming.set(destination, incomingCount);\n      if (incomingCount === 0) {\n        ready.push(destination);\n      }\n    }\n  }\n  if (visitedCount !== agentIds.size) {\n    throw new Error(`Graph subagent \"${config.type}\" must be acyclic.`);\n  }\n\n  const reachableFromEntry = visitReachable(config.entryAgentId, adjacency);\n  const canReachResult = visitReachable(config.resultAgentId, reverseAdjacency);\n  if (\n    reachableFromEntry.size !== agentIds.size ||\n    canReachResult.size !== agentIds.size\n  ) {\n    throw new Error(\n      `Every agent in graph subagent \"${config.type}\" must be reachable from entryAgentId and able to reach resultAgentId.`\n    );\n  }\n}\n\nfunction normalizeSingleAgentConfig(\n  config: SubagentConfig,\n  parentContext: AgentContext\n): ExecutableSubagentConfig | null {\n  const candidate = config as GraphSubagentConfigCandidate;\n  if (\n    candidate.kind === 'agent' &&\n    (candidate.agents !== undefined ||\n      candidate.edges !== undefined ||\n      candidate.entryAgentId !== undefined ||\n      candidate.resultAgentId !== undefined)\n  ) {\n    throw new Error(\n      `Single-agent subagent \"${config.type}\" cannot define graph topology fields.`\n    );\n  }\n  if (config.self === true && config.resolveAgentInputs != null) {\n    throw new Error(\n      `Subagent \"${config.type}\" cannot combine self with resolveAgentInputs.`\n    );\n  }\n  if (config.agentInputs != null) {\n    return config as ResolvedSingleAgentSubagentConfig;\n  }\n  if (config.self === true && parentContext._sourceInputs != null) {\n    return {\n      ...config,\n      agentInputs: { ...parentContext._sourceInputs },\n    };\n  }\n  if (config.resolveAgentInputs == null) {\n    return null;\n  }\n  if (!isNonEmptyString(config.configId)) {\n    throw new Error(\n      `Lazy subagent \"${config.type}\" requires a non-empty \"configId\".`\n    );\n  }\n  return config as ExecutableSubagentConfig;\n}\n\n/** Normalize eager, self, lazy, and graph subagent entries for advertisement. */\nexport function normalizeSubagentConfigEntries(\n  configs: SubagentConfigEntry[],\n  parentContext: AgentContext\n): ExecutableSubagentConfigEntry[] {\n  const normalized: ExecutableSubagentConfigEntry[] = [];\n  const seenTypes = new Set<string>();\n  for (const config of configs) {\n    let executable: ExecutableSubagentConfigEntry | null;\n    if (isGraphSubagentConfig(config)) {\n      validateGraphSubagentConfig(config);\n      executable = config;\n    } else {\n      executable = normalizeSingleAgentConfig(config, parentContext);\n    }\n    if (executable == null) {\n      continue;\n    }\n    if (seenTypes.has(executable.type)) {\n      throw new Error(\n        `Duplicate subagent type \"${executable.type}\". Each SubagentConfig must have a unique \"type\" field.`\n      );\n    }\n    seenTypes.add(executable.type);\n    normalized.push(executable);\n  }\n  return normalized;\n}\n\n/** Resolve self-spawn inputs and validate explicit graph configs. */\nexport function resolveSubagentConfigEntries(\n  configs: SubagentConfigEntry[],\n  parentContext: AgentContext\n): ResolvedSubagentConfigEntry[] {\n  return normalizeSubagentConfigEntries(configs, parentContext).filter(\n    (config): config is ResolvedSubagentConfigEntry =>\n      isGraphSubagentConfig(config) || config.agentInputs != null\n  );\n}\n\n/** Resolve legacy single-agent configs with the original public signature. */\nexport function resolveSubagentConfigs(\n  configs: SubagentConfig[],\n  parentContext: AgentContext\n): ResolvedSubagentConfig[] {\n  const graphConfig = configs.find(isGraphSubagentConfig);\n  if (graphConfig != null) {\n    throw new Error(\n      `Graph subagent \"${graphConfig.type}\" requires resolveSubagentConfigEntries().`\n    );\n  }\n  return resolveSubagentConfigEntries(\n    configs,\n    parentContext\n  ) as ResolvedSubagentConfig[];\n}\n\n/** Normalize legacy single-agent configs while rejecting graph entries. */\nexport function normalizeSubagentConfigs(\n  configs: SubagentConfig[],\n  parentContext: AgentContext\n): ExecutableSubagentConfig[] {\n  const graphConfig = configs.find(isGraphSubagentConfig);\n  if (graphConfig != null) {\n    throw new Error(\n      `Graph subagent \"${graphConfig.type}\" requires normalizeSubagentConfigEntries().`\n    );\n  }\n  return normalizeSubagentConfigEntries(\n    configs,\n    parentContext\n  ) as ExecutableSubagentConfig[];\n}\n\nfunction prepareChildInputs({\n  agentInputs,\n  agentId,\n  self,\n  allowNested,\n  parentMaxDepth,\n  keepToolDefinitions,\n}: {\n  agentInputs: AgentInputs;\n  agentId: string;\n  self: boolean;\n  allowNested: boolean;\n  parentMaxDepth: number;\n  keepToolDefinitions: boolean;\n}): AgentInputs {\n  const childInputs: AgentInputs = {\n    ...agentInputs,\n    agentId,\n    toolDefinitions: keepToolDefinitions\n      ? agentInputs.toolDefinitions\n      : undefined,\n    initialSummary: undefined,\n    discoveredTools: undefined,\n    graphTools: self ? undefined : agentInputs.graphTools,\n  };\n  if (allowNested) {\n    childInputs.maxSubagentDepth = Math.max(0, parentMaxDepth - 1);\n  } else {\n    childInputs.subagentConfigs = undefined;\n    childInputs.maxSubagentDepth = undefined;\n  }\n  return childInputs;\n}\n\nexport function buildChildInputs(\n  config: ResolvedSubagentConfig,\n  childAgentId: string,\n  parentMaxDepth: number,\n  keepToolDefinitions: boolean = false\n): AgentInputs {\n  return prepareChildInputs({\n    agentInputs: config.agentInputs,\n    agentId: childAgentId,\n    self: config.self === true,\n    allowNested: config.allowNested === true,\n    parentMaxDepth,\n    keepToolDefinitions,\n  });\n}\n\nexport function buildGraphChildInputs(\n  config: GraphSubagentConfig,\n  parentMaxDepth: number,\n  keepToolDefinitions: boolean = false\n): AgentInputs[] {\n  return config.agents.map((agentInputs) =>\n    prepareChildInputs({\n      agentInputs,\n      agentId: agentInputs.agentId,\n      self: false,\n      allowNested: false,\n      parentMaxDepth,\n      keepToolDefinitions,\n    })\n  );\n}\n\nexport function createChildGraphPlan({\n  config,\n  executionSuffix,\n  parentAgentId,\n  parentMaxDepth,\n  keepToolDefinitions,\n}: CreateChildGraphPlanParams): ChildGraphPlan {\n  if (isGraphSubagentConfig(config)) {\n    validateGraphSubagentConfig(config);\n    const agents = buildGraphChildInputs(\n      config,\n      parentMaxDepth,\n      keepToolDefinitions\n    );\n    return {\n      kind: 'graph',\n      subjectAgentId: `${parentAgentId ?? 'agent'}_subgraph_${executionSuffix}`,\n      checkpointNodeId: config.resultAgentId,\n      agents,\n      memberInputs: new Map(\n        agents.map((agentInputs) => [agentInputs.agentId, agentInputs])\n      ),\n      edges: config.edges.map((edge) => ({\n        ...edge,\n        from: Array.isArray(edge.from) ? [...edge.from] : edge.from,\n        to: Array.isArray(edge.to) ? [...edge.to] : edge.to,\n      })),\n      entryAgentId: config.entryAgentId,\n      resultAgentId: config.resultAgentId,\n    };\n  }\n\n  const childAgentId =\n    config.agentInputs.agentId ||\n    `${parentAgentId ?? 'agent'}_sub_${executionSuffix}`;\n  const childInputs = buildChildInputs(\n    config,\n    childAgentId,\n    parentMaxDepth,\n    keepToolDefinitions\n  );\n  return {\n    kind: 'agent',\n    subjectAgentId: childAgentId,\n    checkpointNodeId: childAgentId,\n    agents: [childInputs],\n    memberInputs: new Map([[childAgentId, childInputs]]),\n  };\n}\n"],"mappings":";;AAkBA,MAAM,4BAA4B,IAAI,IAAI;CACxC;CACA;CACA;CACA;CACA;AACF,CAAC;AAkDD,SAAS,SAAS,OAAiC;CACjD,OAAO,SAAS,QAAQ,OAAO,UAAU;AAC3C;AAEA,SAAS,iBAAiB,OAAiC;CACzD,OAAO,OAAO,UAAU,YAAY,MAAM,KAAK,MAAM;AACvD;AAEA,SAAgB,sBACd,QAC+B;CAC/B,OAAQ,OAA8B,SAAS;AACjD;AAEA,SAAS,+BACP,OACiD;CACjD,IAAI,CAAC,SAAS,KAAK,GACjB,MAAM,IAAI,MAAM,0CAA0C;CAE5D,MAAM,YAAY;CAClB,MAAM,aAAa,iBAAiB,UAAU,IAAI,IAC9C,UAAU,OACV;CACJ,IAAI,UAAU,SAAS,SACrB,MAAM,IAAI,MAAM,mBAAmB,WAAW,4BAA4B;CAE5E,KAAK,MAAM,CAAC,OAAO,UAAU;EAC3B,CAAC,QAAQ,UAAU,IAAI;EACvB,CAAC,QAAQ,UAAU,IAAI;EACvB,CAAC,eAAe,UAAU,WAAW;EACrC,CAAC,gBAAgB,UAAU,YAAY;EACvC,CAAC,iBAAiB,UAAU,aAAa;CAC3C,GACE,IAAI,CAAC,iBAAiB,KAAK,GACzB,MAAM,IAAI,MACR,mBAAmB,WAAW,4BAA4B,MAAM,EAClE;CAGJ,IAAI,CAAC,MAAM,QAAQ,UAAU,MAAM,GACjC,MAAM,IAAI,MAAM,mBAAmB,WAAW,2BAA2B;CAE3E,MAAM,SAAoB,UAAU;CACpC,KAAK,MAAM,SAAS,QAClB,IAAI,CAAC,SAAS,KAAK,GACjB,MAAM,IAAI,MACR,mBAAmB,WAAW,+BAChC;CAGJ,IAAI,CAAC,MAAM,QAAQ,UAAU,KAAK,GAChC,MAAM,IAAI,MAAM,mBAAmB,WAAW,0BAA0B;CAE1E,MAAM,QAAmB,UAAU;CACnC,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,SAAS,IAAI,GAChB,MAAM,IAAI,MACR,mBAAmB,WAAW,8BAChC;CAGJ,IACE,UAAU,eAAe,QACzB,OAAO,UAAU,gBAAgB,WAEjC,MAAM,IAAI,MACR,mBAAmB,WAAW,iCAChC;CAEF,IACE,UAAU,YAAY,SACrB,OAAO,UAAU,aAAa,YAC7B,CAAC,OAAO,cAAc,UAAU,QAAQ,KACxC,UAAU,YAAY,IAExB,MAAM,IAAI,MACR,mBAAmB,WAAW,4CAChC;CAEF,IACE,UAAU,gBAAgB,KAAA,KAC1B,UAAU,uBAAuB,KAAA,KACjC,UAAU,aAAa,KAAA,KACvB,UAAU,SAAS,KAAA,GAEnB,MAAM,IAAI,MACR,mBAAmB,WAAW,iFAChC;AAEJ;AAEA,SAAS,aAAa,UAAuC;CAC3D,OAAO,MAAM,QAAQ,QAAQ,IAAI,WAAW,CAAC,QAAQ;AACvD;AAEA,SAAS,8BACP,WACA,OACA,WACM;CACN,IAAI,UAAU,WAAW,GACvB,MAAM,IAAI,MACR,uBAAuB,UAAU,6BAA6B,MAAM,QACtE;CAEF,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,YAAY,WAAW;EAChC,IAAI,OAAO,aAAa,YAAY,SAAS,KAAK,MAAM,IACtD,MAAM,IAAI,MACR,uBAAuB,UAAU,oBAAoB,MAAM,WAC7D;EAEF,IAAI,KAAK,IAAI,QAAQ,GACnB,MAAM,IAAI,MACR,uBAAuB,UAAU,WAAW,MAAM,UAAU,SAAS,GACvE;EAEF,KAAK,IAAI,QAAQ;CACnB;AACF;AAEA,SAAS,eACP,OACA,WACa;CACb,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,UAAU,CAAC,KAAK;CACtB,OAAO,QAAQ,SAAS,GAAG;EACzB,MAAM,UAAU,QAAQ,IAAI;EAC5B,IAAI,WAAW,QAAQ,QAAQ,IAAI,OAAO,GACxC;EAEF,QAAQ,IAAI,OAAO;EACnB,KAAK,MAAM,QAAQ,UAAU,IAAI,OAAO,KAAK,CAAC,GAC5C,IAAI,CAAC,QAAQ,IAAI,IAAI,GACnB,QAAQ,KAAK,IAAI;CAGvB;CACA,OAAO;AACT;AAEA,SAAgB,4BAA4B,QAAuB;CACjE,+BAA+B,MAAM;CACrC,IAAI,OAAO,OAAO,WAAW,GAC3B,MAAM,IAAI,MAAM,mBAAmB,OAAO,KAAK,yBAAyB;CAE1E,IAAI,OAAO,OAAO,SAAA,IAChB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,2BACjC;CAEF,IAAI,OAAO,YAAY,QAAQ,OAAO,WAAWA,sBAAAA,0BAC/C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,oDACjC;CAEF,IAAI,OAAO,gBAAgB,MACzB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,oGACjC;CAGF,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,SAAS,OAAO,QAAQ;EACjC,IAAI,OAAO,MAAM,YAAY,YAAY,MAAM,QAAQ,KAAK,MAAM,IAChE,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,6BACjC;EAEF,IAAI,SAAS,IAAI,MAAM,OAAO,GAC5B,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,iCAAiC,MAAM,QAAQ,GAChF;EAEF,IACE,0BAA0B,IAAI,MAAM,OAAO,KAC3C,MAAM,QAAQ,SAAS,GAAG,KAC1B,MAAM,QAAQ,SAAS,GAAG,GAE1B,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,cAAc,MAAM,QAAQ,oCAC7D;EAEF,SAAS,IAAI,MAAM,OAAO;CAC5B;CAEA,IAAI,CAAC,SAAS,IAAI,OAAO,YAAY,GACnC,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,kBAAkB,OAAO,aAAa,6BACvE;CAEF,IAAI,CAAC,SAAS,IAAI,OAAO,aAAa,GACpC,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,mBAAmB,OAAO,cAAc,6BACzE;CAGF,MAAM,4BAAY,IAAI,IAAyB;CAC/C,MAAM,mCAAmB,IAAI,IAAyB;CACtD,MAAM,sCAAsB,IAAI,IAAwB;CACxD,MAAM,gBAGD,CAAC;CACN,MAAM,gCAAgB,IAAI,IAAY;CACtC,KAAK,MAAM,WAAW,UAAU;EAC9B,UAAU,IAAI,yBAAS,IAAI,IAAI,CAAC;EAChC,iBAAiB,IAAI,yBAAS,IAAI,IAAI,CAAC;CACzC;CAEA,KAAK,IAAI,YAAY,GAAG,YAAY,OAAO,MAAM,QAAQ,aAAa;EACpE,MAAM,OAAO,OAAO,MAAM;EAC1B,IAAI,KAAK,aAAa,UACpB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,gCACpD;EAEF,IAAI,KAAK,aAAa,MACpB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,4BACpD;EAEF,IAAI,KAAK,aAAa,MACpB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,0BACpD;EAEF,MAAM,gBAAiB,KAA8B;EACrD,IACE,iBAAiB,QACjB,OAAO,kBAAkB,YACzB,OAAO,kBAAkB,YAEzB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,sCACpD;EAEF,MAAM,wBAAyB,KAC5B;EACH,IACE,yBAAyB,QACzB,OAAO,0BAA0B,WAEjC,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,mCACpD;EAGF,MAAM,UAAU,aAAa,KAAK,IAAI;EACtC,MAAM,eAAe,aAAa,KAAK,EAAE;EACzC,8BAA8B,SAAS,UAAU,SAAS;EAC1D,8BAA8B,cAAc,eAAe,SAAS;EACpE,IAAI,iBAAiB,QAAQ,kBAAkB,IAC7C,cAAc,KAAK;GAAE;GAAW;EAAa,CAAC;OACzC,IAAI,yBAAyB,MAClC,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,gDACpD;EAGF,KAAK,MAAM,YAAY,CAAC,GAAG,SAAS,GAAG,YAAY,GACjD,IAAI,CAAC,SAAS,IAAI,QAAQ,GACxB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,6BAA6B,SAAS,GAC1F;EAIJ,KAAK,MAAM,eAAe,cAAc;GACtC,MAAM,iBAAiB,oBAAoB,IAAI,WAAW,KAAK,CAAC;GAChE,eAAe,KAAK,OAAO;GAC3B,oBAAoB,IAAI,aAAa,cAAc;GACnD,IACE,KAAK,UAAU,QACf,KAAK,WAAW,MAChB,SAAS,IAAI,UAAU,YAAY,QAAQ,GAE3C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,qBAAqB,YAAY,iDAClE;GAEF,KAAK,MAAM,UAAU,SAAS;IAC5B,IAAI,WAAW,aACb,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,8BAA8B,OAAO,GACtE;IAEF,MAAM,UAAU,GAAG,OAAO,QAAQ;IAClC,IAAI,cAAc,IAAI,OAAO,GAC3B,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,kBAAkB,OAAO,QAAQ,YAAY,GAC9E;IAEF,cAAc,IAAI,OAAO;IACzB,UAAU,IAAI,MAAM,CAAC,CAAE,IAAI,WAAW;IACtC,iBAAiB,IAAI,WAAW,CAAC,CAAE,IAAI,MAAM;GAC/C;EACF;CACF;CAEA,KAAK,MAAM,CAAC,aAAa,mBAAmB,qBAAqB;EAC/D,MAAM,kBAAkB,iBAAiB,IAAI,WAAW;EACxD,IAAI,gBAAgB,QAAQ,GAC1B;EAEF,IACE,eAAe,WAAW,KAC1B,eAAe,EAAE,CAAC,WAAW,gBAAgB,MAE7C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,eAAe,YAAY,qDAC5D;CAEJ;CAEA,MAAM,gBAAgB,CAAC,GAAG,QAAQ,CAAC,CAAC,OACjC,YACC,UAAU,IAAI,OAAO,CAAC,CAAE,QAAQ,KAChC,iBAAiB,IAAI,OAAO,CAAC,CAAE,QAAQ,CAC3C;CACA,KAAK,MAAM,EAAE,WAAW,kBAAkB,eAAe;EACvD,IAAI,aAAa,WAAW,GAC1B,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,kBAAkB,UAAU,oCAC7D;EAEF,IAAI,CAAC,iBAAiB,aAAa,OAAO,OAAO,eAC/C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,kBAAkB,UAAU,8BAA8B,OAAO,cAAc,oCAChH;CAEJ;CAEA,MAAM,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,QACzB,YAAY,iBAAiB,IAAI,OAAO,CAAC,CAAE,SAAS,CACvD;CACA,IAAI,MAAM,WAAW,KAAK,MAAM,OAAO,OAAO,cAC5C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,4BAA4B,OAAO,aAAa,oBACjF;CAEF,MAAM,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,QACzB,YAAY,UAAU,IAAI,OAAO,CAAC,CAAE,SAAS,CAChD;CACA,IAAI,MAAM,WAAW,KAAK,MAAM,OAAO,OAAO,eAC5C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,6BAA6B,OAAO,cAAc,oBACnF;CAGF,MAAM,oCAAoB,IAAI,IAAoB;CAClD,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,gBAAgB,iBAAiB,IAAI,OAAO,CAAC,CAAE;EACrD,kBAAkB,IAAI,SAAS,aAAa;EAC5C,IAAI,kBAAkB,GACpB,MAAM,KAAK,OAAO;CAEtB;CACA,IAAI,eAAe;CACnB,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,UAAU,MAAM,IAAI;EAC1B;EACA,KAAK,MAAM,eAAe,UAAU,IAAI,OAAO,KAAK,CAAC,GAAG;GACtD,MAAM,gBAAgB,kBAAkB,IAAI,WAAW,IAAK;GAC5D,kBAAkB,IAAI,aAAa,aAAa;GAChD,IAAI,kBAAkB,GACpB,MAAM,KAAK,WAAW;EAE1B;CACF;CACA,IAAI,iBAAiB,SAAS,MAC5B,MAAM,IAAI,MAAM,mBAAmB,OAAO,KAAK,mBAAmB;CAGpE,MAAM,qBAAqB,eAAe,OAAO,cAAc,SAAS;CACxE,MAAM,iBAAiB,eAAe,OAAO,eAAe,gBAAgB;CAC5E,IACE,mBAAmB,SAAS,SAAS,QACrC,eAAe,SAAS,SAAS,MAEjC,MAAM,IAAI,MACR,kCAAkC,OAAO,KAAK,uEAChD;AAEJ;AAEA,SAAS,2BACP,QACA,eACiC;CACjC,MAAM,YAAY;CAClB,IACE,UAAU,SAAS,YAClB,UAAU,WAAW,KAAA,KACpB,UAAU,UAAU,KAAA,KACpB,UAAU,iBAAiB,KAAA,KAC3B,UAAU,kBAAkB,KAAA,IAE9B,MAAM,IAAI,MACR,0BAA0B,OAAO,KAAK,uCACxC;CAEF,IAAI,OAAO,SAAS,QAAQ,OAAO,sBAAsB,MACvD,MAAM,IAAI,MACR,aAAa,OAAO,KAAK,+CAC3B;CAEF,IAAI,OAAO,eAAe,MACxB,OAAO;CAET,IAAI,OAAO,SAAS,QAAQ,cAAc,iBAAiB,MACzD,OAAO;EACL,GAAG;EACH,aAAa,EAAE,GAAG,cAAc,cAAc;CAChD;CAEF,IAAI,OAAO,sBAAsB,MAC/B,OAAO;CAET,IAAI,CAAC,iBAAiB,OAAO,QAAQ,GACnC,MAAM,IAAI,MACR,kBAAkB,OAAO,KAAK,mCAChC;CAEF,OAAO;AACT;;AAGA,SAAgB,+BACd,SACA,eACiC;CACjC,MAAM,aAA8C,CAAC;CACrD,MAAM,4BAAY,IAAI,IAAY;CAClC,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI;EACJ,IAAI,sBAAsB,MAAM,GAAG;GACjC,4BAA4B,MAAM;GAClC,aAAa;EACf,OACE,aAAa,2BAA2B,QAAQ,aAAa;EAE/D,IAAI,cAAc,MAChB;EAEF,IAAI,UAAU,IAAI,WAAW,IAAI,GAC/B,MAAM,IAAI,MACR,4BAA4B,WAAW,KAAK,wDAC9C;EAEF,UAAU,IAAI,WAAW,IAAI;EAC7B,WAAW,KAAK,UAAU;CAC5B;CACA,OAAO;AACT;;AAGA,SAAgB,6BACd,SACA,eAC+B;CAC/B,OAAO,+BAA+B,SAAS,aAAa,CAAC,CAAC,QAC3D,WACC,sBAAsB,MAAM,KAAK,OAAO,eAAe,IAC3D;AACF;;AAGA,SAAgB,uBACd,SACA,eAC0B;CAC1B,MAAM,cAAc,QAAQ,KAAK,qBAAqB;CACtD,IAAI,eAAe,MACjB,MAAM,IAAI,MACR,mBAAmB,YAAY,KAAK,2CACtC;CAEF,OAAO,6BACL,SACA,aACF;AACF;;AAGA,SAAgB,yBACd,SACA,eAC4B;CAC5B,MAAM,cAAc,QAAQ,KAAK,qBAAqB;CACtD,IAAI,eAAe,MACjB,MAAM,IAAI,MACR,mBAAmB,YAAY,KAAK,6CACtC;CAEF,OAAO,+BACL,SACA,aACF;AACF;AAEA,SAAS,mBAAmB,EAC1B,aACA,SACA,MACA,aACA,gBACA,uBAQc;CACd,MAAM,cAA2B;EAC/B,GAAG;EACH;EACA,iBAAiB,sBACb,YAAY,kBACZ,KAAA;EACJ,gBAAgB,KAAA;EAChB,iBAAiB,KAAA;EACjB,YAAY,OAAO,KAAA,IAAY,YAAY;CAC7C;CACA,IAAI,aACF,YAAY,mBAAmB,KAAK,IAAI,GAAG,iBAAiB,CAAC;MACxD;EACL,YAAY,kBAAkB,KAAA;EAC9B,YAAY,mBAAmB,KAAA;CACjC;CACA,OAAO;AACT;AAEA,SAAgB,iBACd,QACA,cACA,gBACA,sBAA+B,OAClB;CACb,OAAO,mBAAmB;EACxB,aAAa,OAAO;EACpB,SAAS;EACT,MAAM,OAAO,SAAS;EACtB,aAAa,OAAO,gBAAgB;EACpC;EACA;CACF,CAAC;AACH;AAEA,SAAgB,sBACd,QACA,gBACA,sBAA+B,OAChB;CACf,OAAO,OAAO,OAAO,KAAK,gBACxB,mBAAmB;EACjB;EACA,SAAS,YAAY;EACrB,MAAM;EACN,aAAa;EACb;EACA;CACF,CAAC,CACH;AACF;AAEA,SAAgB,qBAAqB,EACnC,QACA,iBACA,eACA,gBACA,uBAC6C;CAC7C,IAAI,sBAAsB,MAAM,GAAG;EACjC,4BAA4B,MAAM;EAClC,MAAM,SAAS,sBACb,QACA,gBACA,mBACF;EACA,OAAO;GACL,MAAM;GACN,gBAAgB,GAAG,iBAAiB,QAAQ,YAAY;GACxD,kBAAkB,OAAO;GACzB;GACA,cAAc,IAAI,IAChB,OAAO,KAAK,gBAAgB,CAAC,YAAY,SAAS,WAAW,CAAC,CAChE;GACA,OAAO,OAAO,MAAM,KAAK,UAAU;IACjC,GAAG;IACH,MAAM,MAAM,QAAQ,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,KAAK;IACvD,IAAI,MAAM,QAAQ,KAAK,EAAE,IAAI,CAAC,GAAG,KAAK,EAAE,IAAI,KAAK;GACnD,EAAE;GACF,cAAc,OAAO;GACrB,eAAe,OAAO;EACxB;CACF;CAEA,MAAM,eACJ,OAAO,YAAY,WACnB,GAAG,iBAAiB,QAAQ,OAAO;CACrC,MAAM,cAAc,iBAClB,QACA,cACA,gBACA,mBACF;CACA,OAAO;EACL,MAAM;EACN,gBAAgB;EAChB,kBAAkB;EAClB,QAAQ,CAAC,WAAW;EACpB,cAAc,IAAI,IAAI,CAAC,CAAC,cAAc,WAAW,CAAC,CAAC;CACrD;AACF"}
+{"version":3,"file":"childGraphConfig.cjs","names":["MAX_GRAPH_SUBAGENT_TURNS"],"sources":["../../../../src/tools/subagent/childGraphConfig.ts"],"mappings":";;AAkBA,MAAM,4BAA4B,IAAI,IAAI;CACxC;CACA;CACA;CACA;CACA;AACF,CAAC;AAkDD,SAAS,SAAS,OAAiC;CACjD,OAAO,SAAS,QAAQ,OAAO,UAAU;AAC3C;AAEA,SAAS,iBAAiB,OAAiC;CACzD,OAAO,OAAO,UAAU,YAAY,MAAM,KAAK,MAAM;AACvD;AAEA,SAAgB,sBACd,QAC+B;CAC/B,OAAQ,OAA8B,SAAS;AACjD;AAEA,SAAS,+BACP,OACiD;CACjD,IAAI,CAAC,SAAS,KAAK,GACjB,MAAM,IAAI,MAAM,0CAA0C;CAE5D,MAAM,YAAY;CAClB,MAAM,aAAa,iBAAiB,UAAU,IAAI,IAC9C,UAAU,OACV;CACJ,IAAI,UAAU,SAAS,SACrB,MAAM,IAAI,MAAM,mBAAmB,WAAW,4BAA4B;CAE5E,KAAK,MAAM,CAAC,OAAO,UAAU;EAC3B,CAAC,QAAQ,UAAU,IAAI;EACvB,CAAC,QAAQ,UAAU,IAAI;EACvB,CAAC,eAAe,UAAU,WAAW;EACrC,CAAC,gBAAgB,UAAU,YAAY;EACvC,CAAC,iBAAiB,UAAU,aAAa;CAC3C,GACE,IAAI,CAAC,iBAAiB,KAAK,GACzB,MAAM,IAAI,MACR,mBAAmB,WAAW,4BAA4B,MAAM,EAClE;CAGJ,IAAI,CAAC,MAAM,QAAQ,UAAU,MAAM,GACjC,MAAM,IAAI,MAAM,mBAAmB,WAAW,2BAA2B;CAE3E,MAAM,SAAoB,UAAU;CACpC,KAAK,MAAM,SAAS,QAClB,IAAI,CAAC,SAAS,KAAK,GACjB,MAAM,IAAI,MACR,mBAAmB,WAAW,+BAChC;CAGJ,IAAI,CAAC,MAAM,QAAQ,UAAU,KAAK,GAChC,MAAM,IAAI,MAAM,mBAAmB,WAAW,0BAA0B;CAE1E,MAAM,QAAmB,UAAU;CACnC,KAAK,MAAM,QAAQ,OACjB,IAAI,CAAC,SAAS,IAAI,GAChB,MAAM,IAAI,MACR,mBAAmB,WAAW,8BAChC;CAGJ,IACE,UAAU,eAAe,QACzB,OAAO,UAAU,gBAAgB,WAEjC,MAAM,IAAI,MACR,mBAAmB,WAAW,iCAChC;CAEF,IACE,UAAU,YAAY,SACrB,OAAO,UAAU,aAAa,YAC7B,CAAC,OAAO,cAAc,UAAU,QAAQ,KACxC,UAAU,YAAY,IAExB,MAAM,IAAI,MACR,mBAAmB,WAAW,4CAChC;CAEF,IACE,UAAU,gBAAgB,KAAA,KAC1B,UAAU,uBAAuB,KAAA,KACjC,UAAU,aAAa,KAAA,KACvB,UAAU,SAAS,KAAA,GAEnB,MAAM,IAAI,MACR,mBAAmB,WAAW,iFAChC;AAEJ;AAEA,SAAS,aAAa,UAAuC;CAC3D,OAAO,MAAM,QAAQ,QAAQ,IAAI,WAAW,CAAC,QAAQ;AACvD;AAEA,SAAS,8BACP,WACA,OACA,WACM;CACN,IAAI,UAAU,WAAW,GACvB,MAAM,IAAI,MACR,uBAAuB,UAAU,6BAA6B,MAAM,QACtE;CAEF,MAAM,uBAAO,IAAI,IAAY;CAC7B,KAAK,MAAM,YAAY,WAAW;EAChC,IAAI,OAAO,aAAa,YAAY,SAAS,KAAK,MAAM,IACtD,MAAM,IAAI,MACR,uBAAuB,UAAU,oBAAoB,MAAM,WAC7D;EAEF,IAAI,KAAK,IAAI,QAAQ,GACnB,MAAM,IAAI,MACR,uBAAuB,UAAU,WAAW,MAAM,UAAU,SAAS,GACvE;EAEF,KAAK,IAAI,QAAQ;CACnB;AACF;AAEA,SAAS,eACP,OACA,WACa;CACb,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,UAAU,CAAC,KAAK;CACtB,OAAO,QAAQ,SAAS,GAAG;EACzB,MAAM,UAAU,QAAQ,IAAI;EAC5B,IAAI,WAAW,QAAQ,QAAQ,IAAI,OAAO,GACxC;EAEF,QAAQ,IAAI,OAAO;EACnB,KAAK,MAAM,QAAQ,UAAU,IAAI,OAAO,KAAK,CAAC,GAC5C,IAAI,CAAC,QAAQ,IAAI,IAAI,GACnB,QAAQ,KAAK,IAAI;CAGvB;CACA,OAAO;AACT;AAEA,SAAgB,4BAA4B,QAAuB;CACjE,+BAA+B,MAAM;CACrC,IAAI,OAAO,OAAO,WAAW,GAC3B,MAAM,IAAI,MAAM,mBAAmB,OAAO,KAAK,yBAAyB;CAE1E,IAAI,OAAO,OAAO,SAAA,IAChB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,2BACjC;CAEF,IAAI,OAAO,YAAY,QAAQ,OAAO,WAAWA,sBAAAA,0BAC/C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,oDACjC;CAEF,IAAI,OAAO,gBAAgB,MACzB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,oGACjC;CAGF,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,SAAS,OAAO,QAAQ;EACjC,IAAI,OAAO,MAAM,YAAY,YAAY,MAAM,QAAQ,KAAK,MAAM,IAChE,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,6BACjC;EAEF,IAAI,SAAS,IAAI,MAAM,OAAO,GAC5B,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,iCAAiC,MAAM,QAAQ,GAChF;EAEF,IACE,0BAA0B,IAAI,MAAM,OAAO,KAC3C,MAAM,QAAQ,SAAS,GAAG,KAC1B,MAAM,QAAQ,SAAS,GAAG,GAE1B,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,cAAc,MAAM,QAAQ,oCAC7D;EAEF,SAAS,IAAI,MAAM,OAAO;CAC5B;CAEA,IAAI,CAAC,SAAS,IAAI,OAAO,YAAY,GACnC,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,kBAAkB,OAAO,aAAa,6BACvE;CAEF,IAAI,CAAC,SAAS,IAAI,OAAO,aAAa,GACpC,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,mBAAmB,OAAO,cAAc,6BACzE;CAGF,MAAM,4BAAY,IAAI,IAAyB;CAC/C,MAAM,mCAAmB,IAAI,IAAyB;CACtD,MAAM,sCAAsB,IAAI,IAAwB;CACxD,MAAM,gBAGD,CAAC;CACN,MAAM,gCAAgB,IAAI,IAAY;CACtC,KAAK,MAAM,WAAW,UAAU;EAC9B,UAAU,IAAI,yBAAS,IAAI,IAAI,CAAC;EAChC,iBAAiB,IAAI,yBAAS,IAAI,IAAI,CAAC;CACzC;CAEA,KAAK,IAAI,YAAY,GAAG,YAAY,OAAO,MAAM,QAAQ,aAAa;EACpE,MAAM,OAAO,OAAO,MAAM;EAC1B,IAAI,KAAK,aAAa,UACpB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,gCACpD;EAEF,IAAI,KAAK,aAAa,MACpB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,4BACpD;EAEF,IAAI,KAAK,aAAa,MACpB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,0BACpD;EAEF,MAAM,gBAAiB,KAA8B;EACrD,IACE,iBAAiB,QACjB,OAAO,kBAAkB,YACzB,OAAO,kBAAkB,YAEzB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,sCACpD;EAEF,MAAM,wBAAyB,KAC5B;EACH,IACE,yBAAyB,QACzB,OAAO,0BAA0B,WAEjC,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,mCACpD;EAGF,MAAM,UAAU,aAAa,KAAK,IAAI;EACtC,MAAM,eAAe,aAAa,KAAK,EAAE;EACzC,8BAA8B,SAAS,UAAU,SAAS;EAC1D,8BAA8B,cAAc,eAAe,SAAS;EACpE,IAAI,iBAAiB,QAAQ,kBAAkB,IAC7C,cAAc,KAAK;GAAE;GAAW;EAAa,CAAC;OACzC,IAAI,yBAAyB,MAClC,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,gDACpD;EAGF,KAAK,MAAM,YAAY,CAAC,GAAG,SAAS,GAAG,YAAY,GACjD,IAAI,CAAC,SAAS,IAAI,QAAQ,GACxB,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,SAAS,UAAU,6BAA6B,SAAS,GAC1F;EAIJ,KAAK,MAAM,eAAe,cAAc;GACtC,MAAM,iBAAiB,oBAAoB,IAAI,WAAW,KAAK,CAAC;GAChE,eAAe,KAAK,OAAO;GAC3B,oBAAoB,IAAI,aAAa,cAAc;GACnD,IACE,KAAK,UAAU,QACf,KAAK,WAAW,MAChB,SAAS,IAAI,UAAU,YAAY,QAAQ,GAE3C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,qBAAqB,YAAY,iDAClE;GAEF,KAAK,MAAM,UAAU,SAAS;IAC5B,IAAI,WAAW,aACb,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,8BAA8B,OAAO,GACtE;IAEF,MAAM,UAAU,GAAG,OAAO,QAAQ;IAClC,IAAI,cAAc,IAAI,OAAO,GAC3B,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,kBAAkB,OAAO,QAAQ,YAAY,GAC9E;IAEF,cAAc,IAAI,OAAO;IACzB,UAAU,IAAI,MAAM,CAAC,CAAE,IAAI,WAAW;IACtC,iBAAiB,IAAI,WAAW,CAAC,CAAE,IAAI,MAAM;GAC/C;EACF;CACF;CAEA,KAAK,MAAM,CAAC,aAAa,mBAAmB,qBAAqB;EAC/D,MAAM,kBAAkB,iBAAiB,IAAI,WAAW;EACxD,IAAI,gBAAgB,QAAQ,GAC1B;EAEF,IACE,eAAe,WAAW,KAC1B,eAAe,EAAE,CAAC,WAAW,gBAAgB,MAE7C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,eAAe,YAAY,qDAC5D;CAEJ;CAEA,MAAM,gBAAgB,CAAC,GAAG,QAAQ,CAAC,CAAC,OACjC,YACC,UAAU,IAAI,OAAO,CAAC,CAAE,QAAQ,KAChC,iBAAiB,IAAI,OAAO,CAAC,CAAE,QAAQ,CAC3C;CACA,KAAK,MAAM,EAAE,WAAW,kBAAkB,eAAe;EACvD,IAAI,aAAa,WAAW,GAC1B,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,kBAAkB,UAAU,oCAC7D;EAEF,IAAI,CAAC,iBAAiB,aAAa,OAAO,OAAO,eAC/C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,kBAAkB,UAAU,8BAA8B,OAAO,cAAc,oCAChH;CAEJ;CAEA,MAAM,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,QACzB,YAAY,iBAAiB,IAAI,OAAO,CAAC,CAAE,SAAS,CACvD;CACA,IAAI,MAAM,WAAW,KAAK,MAAM,OAAO,OAAO,cAC5C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,4BAA4B,OAAO,aAAa,oBACjF;CAEF,MAAM,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC,QACzB,YAAY,UAAU,IAAI,OAAO,CAAC,CAAE,SAAS,CAChD;CACA,IAAI,MAAM,WAAW,KAAK,MAAM,OAAO,OAAO,eAC5C,MAAM,IAAI,MACR,mBAAmB,OAAO,KAAK,6BAA6B,OAAO,cAAc,oBACnF;CAGF,MAAM,oCAAoB,IAAI,IAAoB;CAClD,MAAM,QAAkB,CAAC;CACzB,KAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,gBAAgB,iBAAiB,IAAI,OAAO,CAAC,CAAE;EACrD,kBAAkB,IAAI,SAAS,aAAa;EAC5C,IAAI,kBAAkB,GACpB,MAAM,KAAK,OAAO;CAEtB;CACA,IAAI,eAAe;CACnB,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,UAAU,MAAM,IAAI;EAC1B;EACA,KAAK,MAAM,eAAe,UAAU,IAAI,OAAO,KAAK,CAAC,GAAG;GACtD,MAAM,gBAAgB,kBAAkB,IAAI,WAAW,IAAK;GAC5D,kBAAkB,IAAI,aAAa,aAAa;GAChD,IAAI,kBAAkB,GACpB,MAAM,KAAK,WAAW;EAE1B;CACF;CACA,IAAI,iBAAiB,SAAS,MAC5B,MAAM,IAAI,MAAM,mBAAmB,OAAO,KAAK,mBAAmB;CAGpE,MAAM,qBAAqB,eAAe,OAAO,cAAc,SAAS;CACxE,MAAM,iBAAiB,eAAe,OAAO,eAAe,gBAAgB;CAC5E,IACE,mBAAmB,SAAS,SAAS,QACrC,eAAe,SAAS,SAAS,MAEjC,MAAM,IAAI,MACR,kCAAkC,OAAO,KAAK,uEAChD;AAEJ;AAEA,SAAS,2BACP,QACA,eACiC;CACjC,MAAM,YAAY;CAClB,IACE,UAAU,SAAS,YAClB,UAAU,WAAW,KAAA,KACpB,UAAU,UAAU,KAAA,KACpB,UAAU,iBAAiB,KAAA,KAC3B,UAAU,kBAAkB,KAAA,IAE9B,MAAM,IAAI,MACR,0BAA0B,OAAO,KAAK,uCACxC;CAEF,IAAI,OAAO,SAAS,QAAQ,OAAO,sBAAsB,MACvD,MAAM,IAAI,MACR,aAAa,OAAO,KAAK,+CAC3B;CAEF,IAAI,OAAO,eAAe,MACxB,OAAO;CAET,IAAI,OAAO,SAAS,QAAQ,cAAc,iBAAiB,MACzD,OAAO;EACL,GAAG;EACH,aAAa,EAAE,GAAG,cAAc,cAAc;CAChD;CAEF,IAAI,OAAO,sBAAsB,MAC/B,OAAO;CAET,IAAI,CAAC,iBAAiB,OAAO,QAAQ,GACnC,MAAM,IAAI,MACR,kBAAkB,OAAO,KAAK,mCAChC;CAEF,OAAO;AACT;AAGA,SAAgB,+BACd,SACA,eACiC;CACjC,MAAM,aAA8C,CAAC;CACrD,MAAM,4BAAY,IAAI,IAAY;CAClC,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI;EACJ,IAAI,sBAAsB,MAAM,GAAG;GACjC,4BAA4B,MAAM;GAClC,aAAa;EACf,OACE,aAAa,2BAA2B,QAAQ,aAAa;EAE/D,IAAI,cAAc,MAChB;EAEF,IAAI,UAAU,IAAI,WAAW,IAAI,GAC/B,MAAM,IAAI,MACR,4BAA4B,WAAW,KAAK,wDAC9C;EAEF,UAAU,IAAI,WAAW,IAAI;EAC7B,WAAW,KAAK,UAAU;CAC5B;CACA,OAAO;AACT;AAGA,SAAgB,6BACd,SACA,eAC+B;CAC/B,OAAO,+BAA+B,SAAS,aAAa,CAAC,CAAC,QAC3D,WACC,sBAAsB,MAAM,KAAK,OAAO,eAAe,IAC3D;AACF;AAGA,SAAgB,uBACd,SACA,eAC0B;CAC1B,MAAM,cAAc,QAAQ,KAAK,qBAAqB;CACtD,IAAI,eAAe,MACjB,MAAM,IAAI,MACR,mBAAmB,YAAY,KAAK,2CACtC;CAEF,OAAO,6BACL,SACA,aACF;AACF;AAGA,SAAgB,yBACd,SACA,eAC4B;CAC5B,MAAM,cAAc,QAAQ,KAAK,qBAAqB;CACtD,IAAI,eAAe,MACjB,MAAM,IAAI,MACR,mBAAmB,YAAY,KAAK,6CACtC;CAEF,OAAO,+BACL,SACA,aACF;AACF;AAEA,SAAS,mBAAmB,EAC1B,aACA,SACA,MACA,aACA,gBACA,uBAQc;CACd,MAAM,cAA2B;EAC/B,GAAG;EACH;EACA,iBAAiB,sBACb,YAAY,kBACZ,KAAA;EACJ,gBAAgB,KAAA;EAChB,iBAAiB,KAAA;EACjB,YAAY,OAAO,KAAA,IAAY,YAAY;CAC7C;CACA,IAAI,aACF,YAAY,mBAAmB,KAAK,IAAI,GAAG,iBAAiB,CAAC;MACxD;EACL,YAAY,kBAAkB,KAAA;EAC9B,YAAY,mBAAmB,KAAA;CACjC;CACA,OAAO;AACT;AAEA,SAAgB,iBACd,QACA,cACA,gBACA,sBAA+B,OAClB;CACb,OAAO,mBAAmB;EACxB,aAAa,OAAO;EACpB,SAAS;EACT,MAAM,OAAO,SAAS;EACtB,aAAa,OAAO,gBAAgB;EACpC;EACA;CACF,CAAC;AACH;AAEA,SAAgB,sBACd,QACA,gBACA,sBAA+B,OAChB;CACf,OAAO,OAAO,OAAO,KAAK,gBACxB,mBAAmB;EACjB;EACA,SAAS,YAAY;EACrB,MAAM;EACN,aAAa;EACb;EACA;CACF,CAAC,CACH;AACF;AAEA,SAAgB,qBAAqB,EACnC,QACA,iBACA,eACA,gBACA,uBAC6C;CAC7C,IAAI,sBAAsB,MAAM,GAAG;EACjC,4BAA4B,MAAM;EAClC,MAAM,SAAS,sBACb,QACA,gBACA,mBACF;EACA,OAAO;GACL,MAAM;GACN,gBAAgB,GAAG,iBAAiB,QAAQ,YAAY;GACxD,kBAAkB,OAAO;GACzB;GACA,cAAc,IAAI,IAChB,OAAO,KAAK,gBAAgB,CAAC,YAAY,SAAS,WAAW,CAAC,CAChE;GACA,OAAO,OAAO,MAAM,KAAK,UAAU;IACjC,GAAG;IACH,MAAM,MAAM,QAAQ,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,KAAK;IACvD,IAAI,MAAM,QAAQ,KAAK,EAAE,IAAI,CAAC,GAAG,KAAK,EAAE,IAAI,KAAK;GACnD,EAAE;GACF,cAAc,OAAO;GACrB,eAAe,OAAO;EACxB;CACF;CAEA,MAAM,eACJ,OAAO,YAAY,WACnB,GAAG,iBAAiB,QAAQ,OAAO;CACrC,MAAM,cAAc,iBAClB,QACA,cACA,gBACA,mBACF;CACA,OAAO;EACL,MAAM;EACN,gBAAgB;EAChB,kBAAkB;EAClB,QAAQ,CAAC,WAAW;EACpB,cAAc,IAAI,IAAI,CAAC,CAAC,cAAc,WAAW,CAAC,CAAC;CACrD;AACF"}

package/dist/cjs/tools/subagent/runtimeLimits.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"runtimeLimits.cjs","names":[],"sources":["../../../../src/tools/subagent/runtimeLimits.ts"],"sourcesContent":["export const DEFAULT_SUBAGENT_MAX_TURNS = 25;\nexport const SUBAGENT_RECURSION_MULTIPLIER = 3;\nexport const MAX_GRAPH_SUBAGENT_MEMBERS = 32;\nexport const MAX_GRAPH_SUBAGENT_TURNS = Math.floor(\n  Number.MAX_SAFE_INTEGER /\n    (SUBAGENT_RECURSION_MULTIPLIER * MAX_GRAPH_SUBAGENT_MEMBERS)\n);\n"],"mappings":"AAGA,MAAa,2BAA2B,KAAK,MAC3C,OAAO,mBAAA,EAET"}
+{"version":3,"file":"runtimeLimits.cjs","names":[],"sources":["../../../../src/tools/subagent/runtimeLimits.ts"],"mappings":"AAGA,MAAa,2BAA2B,KAAK,MAC3C,OAAO,mBAAA,EAET"}

package/dist/cjs/tools/toolOutputReferences.cjs

@@ -3,30 +3,6 @@ const require_toolContent = require("../utils/toolContent.cjs");
 require("./intentArg.cjs");
 let _langchain_core_messages = require("@langchain/core/messages");
 //#region src/tools/toolOutputReferences.ts
-/**
-* Tool output reference registry.
-*
-* When enabled via `RunConfig.toolOutputReferences.enabled`, ToolNode
-* stores each successful tool output under a stable key
-* (`tool<idx>turn<turn>`) where `idx` is the tool's position within a
-* ToolNode batch and `turn` is the batch index within the run
-* (incremented once per ToolNode invocation).
-*
-* Subsequent tool calls can pipe a previous output into their args by
-* embedding `{{tool<idx>turn<turn>}}` inside any string argument;
-* {@link ToolOutputReferenceRegistry.resolve} walks the args and
-* substitutes the placeholders immediately before invocation.
-*
-* The registry stores the *raw, untruncated* tool output so a later
-* `{{…}}` substitution pipes the full payload into the next tool —
-* even when the LLM only saw a head+tail-truncated preview in
-* `ToolMessage.content`. Outputs are stored without any annotation
-* (the `_ref` key or the `[ref: ...]` prefix seen by the LLM is
-* strictly a UX signal attached to `ToolMessage.content`). Keeping the
-* registry pristine means downstream bash/jq piping receives the
-* complete, verbatim output with no injected fields.
-*/
-/** Parses a stringified JSON object arg; undefined for anything else. */
 function parseStringifiedArgsObject(value) {
 	if (!value.trim().startsWith("{")) return;
 	try {
@@ -36,106 +12,34 @@ function parseStringifiedArgsObject(value) {
 		return;
 	}
 }
-/**
-* Non-global matcher for a single `{{tool<i>turn<n>}}` placeholder.
-* Exported for consumers that want to detect references (e.g., syntax
-* highlighting, docs). The stateful `g` variant lives inside the
-* registry so nobody trips on `lastIndex`.
-*/
 const TOOL_OUTPUT_REF_PATTERN = /\{\{(tool\d+turn\d+)\}\}/;
-/** Object key used when a parsed-object output has `_ref` injected. */
 const TOOL_OUTPUT_REF_KEY = "_ref";
-/**
-* Object key used to carry unresolved reference warnings on a parsed-
-* object output. Using a dedicated field instead of a trailing text
-* line keeps the annotated `ToolMessage.content` parseable as JSON for
-* downstream consumers that rely on the object shape.
-*/
 const TOOL_OUTPUT_UNRESOLVED_KEY = "_unresolved_refs";
-/** Single-line prefix prepended to non-object tool outputs so the LLM sees the reference key. */
 function buildReferencePrefix(key) {
 	return `[ref: ${key}]`;
 }
-/** Stable registry key for a tool output. */
 function buildReferenceKey(toolIndex, turn) {
 	return `tool${toolIndex}turn${turn}`;
 }
 const EMPTY_ENTRIES = /* @__PURE__ */ new Map();
-/**
-* Per-run state bucket held inside the registry. Each distinct
-* `run_id` gets its own bucket so overlapping concurrent runs on a
-* shared registry cannot leak outputs, turn counters, or warn-memos
-* into one another.
-*/
 var RunStateBucket = class {
 	entries = /* @__PURE__ */ new Map();
 	totalSize = 0;
 	turnCounter = 0;
 	warnedNonStringTools = /* @__PURE__ */ new Set();
 };
-/**
-* Anonymous (`run_id` absent) bucket key. Anonymous batches are
-* treated as fresh runs on every invocation — see `nextTurn`.
-*/
 const ANON_RUN_KEY = "\0anon";
-/**
-* Default upper bound on the number of concurrently-tracked runs per
-* registry. When exceeded, the oldest run's bucket (by insertion
-* order) is evicted. Keeps memory bounded when a ToolNode is reused
-* across many runs without explicit `releaseRun` calls.
-*/
 const DEFAULT_MAX_ACTIVE_RUNS = 32;
-/**
-* Ordered map of reference-key → stored output, partitioned by run so
-* concurrent / interleaved runs sharing one registry cannot leak
-* outputs between each other.
-*
-* Each public method takes a `runId` which selects the run's bucket.
-* Hosts typically get one registry per run via `Graph`, in which
-* case only a single bucket is ever populated; the partitioning
-* exists so the registry also behaves correctly when a single
-* instance is reused directly.
-*/
 var ToolOutputReferenceRegistry = class ToolOutputReferenceRegistry {
 	runStates = /* @__PURE__ */ new Map();
 	maxOutputSize;
 	maxTotalSize;
 	maxActiveRuns;
-	/**
-	* Local stateful matcher used only by `replaceInString`. Kept
-	* off-module so callers of the exported `TOOL_OUTPUT_REF_PATTERN`
-	* never see a stale `lastIndex`.
-	*/
 	static PLACEHOLDER_MATCHER = /\{\{(tool\d+turn\d+)\}\}/g;
 	constructor(options = {}) {
-		/**
-		* Per-output default is the same ~400 KB budget as the standard
-		* tool-result truncation (`HARD_MAX_TOOL_RESULT_CHARS`). This
-		* keeps a single `{{…}}` substitution at a size that is safe to
-		* pass through typical shell `ARG_MAX` limits and matches what
-		* the LLM would otherwise have seen. Hosts that want larger per-
-		* output payloads (API consumers, long JSON streams) can raise
-		* the cap explicitly up to the 5 MB total budget.
-		*/
 		const perOutput = options.maxOutputSize != null && options.maxOutputSize > 0 ? options.maxOutputSize : require_truncation.HARD_MAX_TOOL_RESULT_CHARS;
-		/**
-		* Clamp a caller-supplied `maxTotalSize` to
-		* `HARD_MAX_TOTAL_TOOL_OUTPUT_SIZE` (5 MB) so the documented
-		* absolute cap is enforced regardless of host config —
-		* `calculateMaxTotalToolOutputSize` already applies the same
-		* upper bound on its computed default, but the user-provided
-		* branch was bypassing it.
-		*/
 		const totalRaw = options.maxTotalSize != null && options.maxTotalSize > 0 ? Math.min(options.maxTotalSize, require_truncation.HARD_MAX_TOTAL_TOOL_OUTPUT_SIZE) : require_truncation.calculateMaxTotalToolOutputSize(perOutput);
 		this.maxTotalSize = totalRaw;
-		/**
-		* The per-output cap can never exceed the per-run aggregate cap:
-		* if a single entry were allowed to be larger than `maxTotalSize`,
-		* the eviction loop would either blow the cap (to keep the entry)
-		* or self-evict a just-stored value. Clamping here turns
-		* `maxTotalSize` into a hard upper bound on *any* state the
-		* registry retains per run.
-		*/
 		this.maxOutputSize = Math.min(perOutput, totalRaw);
 		this.maxActiveRuns = options.maxActiveRuns != null && options.maxActiveRuns > 0 ? options.maxActiveRuns : DEFAULT_MAX_ACTIVE_RUNS;
 	}
@@ -155,7 +59,6 @@ var ToolOutputReferenceRegistry = class ToolOutputReferenceRegistry {
 		}
 		return state;
 	}
-	/** Registers (or replaces) the output stored under `key` for `runId`. */
 	set(runId, key, value) {
 		const bucket = this.getOrCreate(runId);
 		const clipped = value.length > this.maxOutputSize ? value.slice(0, this.maxOutputSize) : value;
@@ -168,83 +71,40 @@ var ToolOutputReferenceRegistry = class ToolOutputReferenceRegistry {
 		bucket.totalSize += clipped.length;
 		this.evictWithinBucket(bucket);
 	}
-	/** Returns the stored value for `key` in `runId`'s bucket, or `undefined`. */
 	get(runId, key) {
 		return this.runStates.get(this.keyFor(runId))?.entries.get(key);
 	}
-	/**
-	* Returns `true` when `key` is currently stored in `runId`'s bucket.
-	* Used by {@link annotateMessagesForLLM} to gate transient annotation
-	* on whether the registry still owns the referenced output (a stale
-	* `_refKey` from a prior run silently no-ops here).
-	*/
 	has(runId, key) {
 		return this.runStates.get(this.keyFor(runId))?.entries.has(key) ?? false;
 	}
-	/** Total number of registered outputs across every run bucket. */
 	get size() {
 		let n = 0;
 		for (const bucket of this.runStates.values()) n += bucket.entries.size;
 		return n;
 	}
-	/** Maximum characters retained per output (post-clip). */
 	get perOutputLimit() {
 		return this.maxOutputSize;
 	}
-	/** Maximum total characters retained *per run*. */
 	get totalLimit() {
 		return this.maxTotalSize;
 	}
-	/** Drops every run's state. */
 	clear() {
 		this.runStates.clear();
 	}
-	/**
-	* Explicitly release `runId`'s state. Safe to call when a run has
-	* finished. Hosts sharing one registry across runs should call this
-	* to reclaim memory deterministically; otherwise LRU eviction kicks
-	* in when `maxActiveRuns` runs accumulate.
-	*/
 	releaseRun(runId) {
 		this.runStates.delete(this.keyFor(runId));
 	}
-	/**
-	* Claims the next batch turn synchronously from `runId`'s bucket.
-	*
-	* Must be called once at the start of each ToolNode batch before
-	* any `await`, so concurrent invocations within the same run see
-	* distinct turn values (reads are effectively atomic by JS's
-	* single-threaded execution of the sync prefix).
-	*
-	* If `runId` is missing the anonymous bucket is dropped and a
-	* fresh one created so each anonymous call behaves as its own run.
-	*/
 	nextTurn(runId) {
 		if (runId == null) this.runStates.delete(ANON_RUN_KEY);
 		const bucket = this.getOrCreate(runId);
 		return bucket.turnCounter++;
 	}
-	/**
-	* Records that `toolName` has been warned about in `runId` (returns
-	* `true` on the first call per run, `false` after). Used by
-	* ToolNode to emit one log line per offending tool per run when a
-	* `ToolMessage.content` isn't a string.
-	*/
 	claimWarnOnce(runId, toolName) {
 		const bucket = this.getOrCreate(runId);
 		if (bucket.warnedNonStringTools.has(toolName)) return false;
 		bucket.warnedNonStringTools.add(toolName);
 		return true;
 	}
-	/**
-	* Walks `args` and replaces every `{{tool<i>turn<n>}}` placeholder in
-	* string values with the stored output *from `runId`'s bucket*. Non-
-	* string values and object keys are left untouched. Unresolved
-	* references are left in-place and reported so the caller can
-	* surface them to the LLM. When no placeholder appears anywhere in
-	* the serialized args, the original input is returned without
-	* walking the tree.
-	*/
 	resolve(runId, args, options) {
 		if (!hasAnyPlaceholder(args)) return {
 			resolved: args,
@@ -253,23 +113,11 @@ var ToolOutputReferenceRegistry = class ToolOutputReferenceRegistry {
 		const bucket = this.runStates.get(this.keyFor(runId));
 		return this.resolveAgainst(bucket?.entries ?? EMPTY_ENTRIES, args, options);
 	}
-	/**
-	* Captures a frozen snapshot of `runId`'s current entries and
-	* returns a view that resolves placeholders against *only* that
-	* snapshot. The snapshot is decoupled from the live registry, so
-	* subsequent `set()` calls (for example, same-turn direct outputs
-	* registering while an event branch is still in flight) are
-	* invisible to the snapshot's `resolve`. Used by the mixed
-	* direct+event dispatch path to preserve same-turn isolation when
-	* a `PreToolUse` hook rewrites event args after directs have
-	* completed.
-	*/
 	snapshot(runId) {
 		const bucket = this.runStates.get(this.keyFor(runId));
 		const entries = bucket ? new Map(bucket.entries) : EMPTY_ENTRIES;
 		return { resolve: (args, options) => this.resolveAgainst(entries, args, options) };
 	}
-	/** Captures the checkpoint-safe state needed to resume one run bucket. */
 	snapshotState(runId) {
 		const bucket = this.runStates.get(this.keyFor(runId));
 		return {
@@ -281,7 +129,6 @@ var ToolOutputReferenceRegistry = class ToolOutputReferenceRegistry {
 			warnedNonStringTools: [...bucket?.warnedNonStringTools ?? []]
 		};
 	}
-	/** Restores a checkpointed run bucket under the current resume scope. */
 	restoreState(runId, state) {
 		this.releaseRun(runId);
 		const bucket = this.getOrCreate(runId);
@@ -296,14 +143,6 @@ var ToolOutputReferenceRegistry = class ToolOutputReferenceRegistry {
 		};
 		const exemptIntentKey = options?.substituteIntentKey !== true;
 		const unresolved = /* @__PURE__ */ new Set();
-		/**
-		* Providers may deliver the args OBJECT as a JSON string. A plain
-		* string-root transform would expand placeholders inside the `intent`
-		* label too, bypassing the top-level exclusion below — parse, transform
-		* key-aware, and re-serialize so the label stays verbatim while every
-		* other field still substitutes. Only taken when an `intent` key is
-		* actually present; other strings keep the fast raw-string path.
-		*/
 		if (exemptIntentKey && typeof args === "string") {
 			const parsedRoot = parseStringifiedArgsObject(args);
 			if (parsedRoot != null && "intent" in parsedRoot) return {
@@ -322,14 +161,7 @@ var ToolOutputReferenceRegistry = class ToolOutputReferenceRegistry {
 		if (value !== null && typeof value === "object") {
 			const source = value;
 			const next = {};
-			for (const [key, item] of Object.entries(source))
- /**
-			* The top-level `intent` arg is a display label, never a data
-			* channel: expanding a `{{tool<i>turn<n>}}` placeholder there would
-			* dump a stored output (up to the registry cap) into a single-line
-			* UI label and persist it with the message. Left verbatim instead.
-			*/
-			next[key] = exemptRootIntent && key === "intent" ? item : this.transform(entries, item, unresolved);
+			for (const [key, item] of Object.entries(source)) next[key] = exemptRootIntent && key === "intent" ? item : this.transform(entries, item, unresolved);
 			return next;
 		}
 		return value;
@@ -356,11 +188,6 @@ var ToolOutputReferenceRegistry = class ToolOutputReferenceRegistry {
 		}
 	}
 };
-/**
-* Cheap pre-check: returns true if any string value in `args` contains
-* the `{{tool` substring. Lets `resolve()` skip the deep tree walk (and
-* its object allocations) for the common case of plain args.
-*/
 function hasAnyPlaceholder(value) {
 	if (typeof value === "string") return value.indexOf("{{tool") !== -1;
 	if (Array.isArray(value)) {
@@ -373,32 +200,6 @@ function hasAnyPlaceholder(value) {
 	}
 	return false;
 }
-/**
-* Annotates `content` with a reference key and/or unresolved-ref
-* warnings so the LLM sees both alongside the tool output.
-*
-* Behavior:
-*  - If `content` parses as a plain (non-array, non-null) JSON object
-*    and the object does not already have a conflicting `_ref` key,
-*    the reference key and (when present) `_unresolved_refs` array
-*    are injected as object fields, preserving JSON validity for
-*    downstream consumers that parse the output.
-*  - Otherwise (string output, JSON array/primitive, parse failure,
-*    or `_ref` collision), a `[ref: <key>]\n` prefix line is
-*    prepended and unresolved refs are appended as a trailing
-*    `[unresolved refs: …]` line.
-*
-* The annotated string is what the LLM sees as `ToolMessage.content`.
-* The *original* (un-annotated) value is what gets stored in the
-* registry, so downstream piping remains pristine.
-*
-* @param content     Raw (post-truncation) tool output.
-* @param key         Reference key for this output, or undefined when
-*                    there is nothing to register (errors etc.).
-* @param unresolved  Reference keys that failed to resolve during
-*                    argument substitution. Surfaced so the LLM can
-*                    self-correct its next tool call.
-*/
 function annotateToolOutputWithReference(content, key, unresolved = []) {
 	const hasRefKey = key != null;
 	const hasUnresolved = unresolved.length > 0;
@@ -420,25 +221,8 @@ function tryInjectRefIntoJsonObject(content, key, unresolved) {
 	const obj = parsed;
 	const injectingRef = key != null;
 	const injectingUnresolved = unresolved.length > 0;
-	/**
-	* Reject the JSON-injection path (fall back to prefix form) when
-	* either of our keys collides with real payload data:
-	*  - `_ref` collision: existing value is non-null and differs from
-	*    the key we're about to inject.
-	*  - `_unresolved_refs` collision: existing value is non-null and
-	*    is not a deep-equal match for the array we'd inject.
-	* This keeps us from silently overwriting legitimate tool output.
-	*/
 	if (injectingRef && "_ref" in obj && obj["_ref"] !== key && obj["_ref"] != null) return null;
 	if (injectingUnresolved && "_unresolved_refs" in obj && obj["_unresolved_refs"] != null && !arraysShallowEqual(obj["_unresolved_refs"], unresolved)) return null;
-	/**
-	* Only strip the framework-owned key we're actually injecting —
-	* leave everything else (including a pre-existing `_ref` on the
-	* unresolved-only path, or a pre-existing `_unresolved_refs` on a
-	* plain-annotation path) untouched so we annotate rather than
-	* mutate downstream payload data. Our injected keys land first in
-	* the serialized JSON so the LLM sees them before the body.
-	*/
 	const omitKeys = /* @__PURE__ */ new Set();
 	if (injectingRef) omitKeys.add(TOOL_OUTPUT_REF_KEY);
 	if (injectingUnresolved) omitKeys.add(TOOL_OUTPUT_UNRESOLVED_KEY);
@@ -455,49 +239,12 @@ function arraysShallowEqual(a, b) {
 	for (let i = 0; i < a.length; i++) if (a[i] !== b[i]) return false;
 	return true;
 }
-/**
-* Lazy projection that, given a registry and a runId, returns a new
-* `messages` array where each `ToolMessage` carrying ref metadata is
-* projected into a transient copy with annotated content (when the ref
-* is live in the registry) and with the framework-owned `additional_
-* kwargs` keys (`_refKey`, `_refScope`, `_unresolvedRefs`) stripped
-* regardless of whether annotation applied. The original input array
-* and its messages are never mutated.
-*
-* Annotation is gated on registry presence: a stale `_refKey` from a
-* prior run (e.g. one that survived in persisted history) silently
-* no-ops on the *content* side. The strip-metadata side still runs so
-* stale framework keys never leak onto the wire under any custom or
-* future provider serializer that might transmit `additional_kwargs`.
-* `_unresolvedRefs` is always meaningful and is not gated.
-*
-* **Feature-disabled fast path:** when the host hasn't enabled the
-* tool-output-reference feature, the registry is `undefined` and this
-* function returns the input array reference-equal *without iterating
-* a single message*. The loop is exclusive to the feature-enabled
-* code path.
-*/
 function annotateMessagesForLLM(messages, registry, runId) {
 	if (registry == null) return messages;
-	/**
-	* Lazy-allocate the output array so the common case (no ToolMessage
-	* carries framework metadata) returns the input reference-equal with
-	* zero allocations beyond the per-message predicate checks.
-	*/
 	let out;
 	for (let i = 0; i < messages.length; i++) {
 		const m = messages[i];
 		if (m._getType() !== "tool") continue;
-		/**
-		* `additional_kwargs` is untyped at the LangChain layer
-		* (`Record<string, unknown>`), so persisted or client-supplied
-		* ToolMessages can carry arbitrary shapes — including primitives
-		* (a malformed serializer might write a string, or `null`).
-		* Guard with a runtime object check before the `in` probes
-		* because the `in` operator throws `TypeError` on primitives.
-		* A single malformed message must never crash the provider call
-		* path; skip its annotation/strip and continue.
-		*/
 		const rawMeta = m.additional_kwargs;
 		if (rawMeta == null || typeof rawMeta !== "object") continue;
 		const meta = rawMeta;
@@ -512,14 +259,6 @@ function annotateMessagesForLLM(messages, registry, runId) {
 		}
 		const refKey = readRefKey(meta);
 		const unresolved = readUnresolvedRefs(meta);
-		/**
-		* Prefer the message-stamped `_refScope` for the registry lookup.
-		* For named runs it equals the current `runId`; for anonymous
-		* invocations it carries the per-batch synthetic scope minted by
-		* ToolNode (`\0anon-<n>`), which `runId` from config cannot
-		* recover. Falling back to `runId` keeps backward compatibility
-		* with messages stamped before this field existed.
-		*/
 		const lookupScope = readRefScope(meta) ?? runId;
 		const liveRef = refKey != null && registry.has(lookupScope, refKey) ? refKey : void 0;
 		const annotates = liveRef != null || unresolved.length > 0;
@@ -527,22 +266,6 @@ function annotateMessagesForLLM(messages, registry, runId) {
 		let nextContent = tm.content;
 		if (annotates && typeof tm.content === "string") nextContent = annotateToolOutputWithReference(tm.content, liveRef, unresolved);
 		else if (annotates && Array.isArray(tm.content)) {
-			/**
-			* Array tool content. The string annotator can't run — this notably
-			* includes a tail tool result that prompt caching rewrote from a string
-			* into a text-block array to host its `cache_control` / `cachePoint`
-			* marker (the `_refKey` survives on `additional_kwargs`). Project the
-			* same markers the string path would, as leading text blocks: the live
-			* `[ref: …]` prefix and/or the unresolved-refs warning. Without this the
-			* common tool-result tail loses its reference marker once cached.
-			*
-			* `as unknown as ToolMessage['content']` is unavoidable: LangChain's
-			* content union does not accept a freshly built mixed array literal even
-			* though the structural shape is valid at runtime. The double-cast is
-			* structurally safe — every original block is preserved and only
-			* `{ type: 'text', text }` blocks (which all providers accept) are
-			* prepended.
-			*/
 			const prefixBlocks = [];
 			if (liveRef != null) prefixBlocks.push({
 				type: "text",
@@ -554,43 +277,19 @@ function annotateMessagesForLLM(messages, registry, runId) {
 			});
 			if (prefixBlocks.length > 0) nextContent = [...prefixBlocks, ...tm.content];
 		}
-		/**
-		* Project unconditionally: even when no annotation applies (stale
-		* `_refKey` or non-annotatable content), `cloneToolMessageWithContent`
-		* runs `stripFrameworkRefMetadata` on `additional_kwargs` so the
-		* framework-owned keys never reach the wire.
-		*/
 		out ??= messages.slice();
 		out[i] = cloneToolMessageWithContent(tm, nextContent);
 	}
 	return out ?? messages;
 }
-/**
-* Reads `_refKey` defensively from untyped `additional_kwargs`. Returns
-* undefined for non-string values so a malformed field cannot poison
-* the registry lookup or downstream string operations.
-*/
 function readRefKey(meta) {
 	const v = meta?._refKey;
 	return typeof v === "string" ? v : void 0;
 }
-/**
-* Reads `_refScope` defensively from untyped `additional_kwargs`.
-* Mirrors {@link readRefKey} — non-string scopes are dropped (the
-* caller falls back to the run-derived scope) rather than passed into
-* the registry as a malformed key.
-*/
 function readRefScope(meta) {
 	const v = meta?._refScope;
 	return typeof v === "string" ? v : void 0;
 }
-/**
-* Reads `_unresolvedRefs` defensively from untyped `additional_kwargs`.
-* Returns an empty array for any non-array value, and filters out
-* non-string entries from a real array. Without this guard, a hydrated
-* ToolMessage carrying e.g. `_unresolvedRefs: 'tool0turn0'` would crash
-* `attemptInvoke` on the eventual `.length` / `.join(...)` call.
-*/
 function readUnresolvedRefs(meta) {
 	const v = meta?._unresolvedRefs;
 	if (!Array.isArray(v)) return [];
@@ -598,19 +297,6 @@ function readUnresolvedRefs(meta) {
 	for (const item of v) if (typeof item === "string") out.push(item);
 	return out;
 }
-/**
-* Builds a fresh `ToolMessage` that mirrors `tm`'s identity fields with
-* the supplied `content`. Every `ToolMessage` field but `content` is
-* carried over so the projection is structurally identical to the
-* original from a LangChain serializer's perspective.
-*
-* `additional_kwargs` is rebuilt with the framework-owned ref keys
-* stripped. Defensive: LangChain's standard provider serializers do not
-* transmit `additional_kwargs` to provider HTTP APIs, but a custom
-* adapter or future LangChain change could. Stripping keeps the
-* implementation correct under any serializer behavior at the cost of a
-* shallow object spread per annotated message.
-*/
 function cloneToolMessageWithContent(tm, content) {
 	return new _langchain_core_messages.ToolMessage({
 		id: tm.id,
@@ -623,13 +309,6 @@ function cloneToolMessageWithContent(tm, content) {
 		content
 	});
 }
-/**
-* Returns a copy of `kwargs` with `_refKey`, `_refScope`, and
-* `_unresolvedRefs` removed. Returns the input reference-equal when
-* none of those keys are present so the no-strip path stays cheap;
-* returns `undefined` when stripping leaves the object empty so the
-* caller can drop the field entirely.
-*/
 function stripFrameworkRefMetadata(kwargs) {
 	if (kwargs == null) return void 0;
 	if (!("_refKey" in kwargs) && !("_refScope" in kwargs) && !("_unresolvedRefs" in kwargs)) return kwargs;