@langchain/langgraph 1.0.0-alpha.0 → 1.0.0-alpha.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (197) hide show
  1. package/CHANGELOG.md +38 -0
  2. package/dist/channels/any_value.cjs +46 -0
  3. package/dist/channels/any_value.cjs.map +1 -0
  4. package/dist/channels/any_value.d.cts +0 -2
  5. package/dist/channels/any_value.d.cts.map +1 -1
  6. package/dist/channels/any_value.d.ts +0 -2
  7. package/dist/channels/any_value.d.ts.map +1 -1
  8. package/dist/channels/any_value.js +46 -0
  9. package/dist/channels/any_value.js.map +1 -0
  10. package/dist/channels/base.cjs +3 -7
  11. package/dist/channels/base.cjs.map +1 -1
  12. package/dist/channels/base.d.cts +8 -2
  13. package/dist/channels/base.d.cts.map +1 -1
  14. package/dist/channels/base.d.ts +7 -2
  15. package/dist/channels/base.d.ts.map +1 -1
  16. package/dist/channels/base.js +3 -7
  17. package/dist/channels/base.js.map +1 -1
  18. package/dist/channels/dynamic_barrier_value.cjs +76 -0
  19. package/dist/channels/dynamic_barrier_value.cjs.map +1 -0
  20. package/dist/channels/dynamic_barrier_value.d.cts +0 -1
  21. package/dist/channels/dynamic_barrier_value.d.cts.map +1 -1
  22. package/dist/channels/dynamic_barrier_value.d.ts +0 -1
  23. package/dist/channels/dynamic_barrier_value.d.ts.map +1 -1
  24. package/dist/channels/dynamic_barrier_value.js +76 -0
  25. package/dist/channels/dynamic_barrier_value.js.map +1 -0
  26. package/dist/channels/ephemeral_value.cjs +0 -2
  27. package/dist/channels/ephemeral_value.cjs.map +1 -1
  28. package/dist/channels/ephemeral_value.d.cts +0 -1
  29. package/dist/channels/ephemeral_value.d.cts.map +1 -1
  30. package/dist/channels/ephemeral_value.d.ts +0 -1
  31. package/dist/channels/ephemeral_value.d.ts.map +1 -1
  32. package/dist/channels/ephemeral_value.js +0 -2
  33. package/dist/channels/ephemeral_value.js.map +1 -1
  34. package/dist/channels/index.cjs +19 -0
  35. package/dist/channels/index.d.cts +9 -0
  36. package/dist/channels/index.d.ts +9 -0
  37. package/dist/channels/index.js +7 -1
  38. package/dist/channels/last_value.cjs +0 -1
  39. package/dist/channels/last_value.cjs.map +1 -1
  40. package/dist/channels/last_value.d.cts +14 -2
  41. package/dist/channels/last_value.d.cts.map +1 -1
  42. package/dist/channels/last_value.d.ts +14 -2
  43. package/dist/channels/last_value.d.ts.map +1 -1
  44. package/dist/channels/last_value.js +0 -1
  45. package/dist/channels/last_value.js.map +1 -1
  46. package/dist/channels/named_barrier_value.cjs +1 -1
  47. package/dist/channels/named_barrier_value.cjs.map +1 -1
  48. package/dist/channels/named_barrier_value.d.cts +15 -2
  49. package/dist/channels/named_barrier_value.d.cts.map +1 -1
  50. package/dist/channels/named_barrier_value.d.ts +15 -2
  51. package/dist/channels/named_barrier_value.d.ts.map +1 -1
  52. package/dist/channels/named_barrier_value.js +1 -2
  53. package/dist/channels/named_barrier_value.js.map +1 -1
  54. package/dist/channels/topic.cjs +1 -1
  55. package/dist/channels/topic.cjs.map +1 -1
  56. package/dist/channels/topic.d.cts +7 -1
  57. package/dist/channels/topic.d.cts.map +1 -1
  58. package/dist/channels/topic.d.ts +7 -1
  59. package/dist/channels/topic.d.ts.map +1 -1
  60. package/dist/channels/topic.js +1 -1
  61. package/dist/channels/topic.js.map +1 -1
  62. package/dist/constants.cjs +4 -1
  63. package/dist/constants.cjs.map +1 -1
  64. package/dist/constants.d.cts +5 -4
  65. package/dist/constants.d.cts.map +1 -1
  66. package/dist/constants.d.ts +5 -4
  67. package/dist/constants.d.ts.map +1 -1
  68. package/dist/constants.js +4 -1
  69. package/dist/constants.js.map +1 -1
  70. package/dist/errors.cjs +2 -1
  71. package/dist/errors.cjs.map +1 -1
  72. package/dist/errors.d.cts +2 -1
  73. package/dist/errors.d.cts.map +1 -1
  74. package/dist/errors.d.ts +2 -1
  75. package/dist/errors.d.ts.map +1 -1
  76. package/dist/errors.js +2 -1
  77. package/dist/errors.js.map +1 -1
  78. package/dist/func/index.cjs +3 -0
  79. package/dist/func/index.cjs.map +1 -1
  80. package/dist/func/index.d.cts +5 -1
  81. package/dist/func/index.d.cts.map +1 -1
  82. package/dist/func/index.d.ts +5 -1
  83. package/dist/func/index.d.ts.map +1 -1
  84. package/dist/func/index.js +3 -0
  85. package/dist/func/index.js.map +1 -1
  86. package/dist/graph/annotation.d.cts +1 -1
  87. package/dist/graph/annotation.d.ts +1 -1
  88. package/dist/graph/graph.cjs +5 -5
  89. package/dist/graph/graph.cjs.map +1 -1
  90. package/dist/graph/graph.d.cts +4 -2
  91. package/dist/graph/graph.d.cts.map +1 -1
  92. package/dist/graph/graph.d.ts +4 -2
  93. package/dist/graph/graph.d.ts.map +1 -1
  94. package/dist/graph/graph.js +1 -1
  95. package/dist/graph/graph.js.map +1 -1
  96. package/dist/graph/index.js +2 -2
  97. package/dist/graph/message.cjs +36 -0
  98. package/dist/graph/message.cjs.map +1 -1
  99. package/dist/graph/message.d.cts +21 -1
  100. package/dist/graph/message.d.cts.map +1 -1
  101. package/dist/graph/message.d.ts +21 -1
  102. package/dist/graph/message.d.ts.map +1 -1
  103. package/dist/graph/message.js +36 -1
  104. package/dist/graph/message.js.map +1 -1
  105. package/dist/graph/messages_annotation.d.cts +1 -1
  106. package/dist/graph/messages_annotation.d.ts +1 -1
  107. package/dist/graph/state.cjs +15 -18
  108. package/dist/graph/state.cjs.map +1 -1
  109. package/dist/graph/state.d.cts +48 -25
  110. package/dist/graph/state.d.cts.map +1 -1
  111. package/dist/graph/state.d.ts +47 -24
  112. package/dist/graph/state.d.ts.map +1 -1
  113. package/dist/graph/state.js +17 -19
  114. package/dist/graph/state.js.map +1 -1
  115. package/dist/graph/zod/plugin.cjs +1 -1
  116. package/dist/graph/zod/plugin.js +3 -3
  117. package/dist/graph/zod/plugin.js.map +1 -1
  118. package/dist/graph/zod/zod-registry.d.cts.map +1 -1
  119. package/dist/index.cjs +4 -2
  120. package/dist/index.cjs.map +1 -1
  121. package/dist/index.d.cts +11 -10
  122. package/dist/index.d.ts +11 -10
  123. package/dist/index.js +5 -4
  124. package/dist/index.js.map +1 -1
  125. package/dist/interrupt.cjs +1 -1
  126. package/dist/interrupt.cjs.map +1 -1
  127. package/dist/interrupt.js +1 -1
  128. package/dist/interrupt.js.map +1 -1
  129. package/dist/prebuilt/agent_executor.d.cts +1 -1
  130. package/dist/prebuilt/agent_executor.d.cts.map +1 -1
  131. package/dist/prebuilt/agent_executor.d.ts +1 -1
  132. package/dist/prebuilt/agent_executor.d.ts.map +1 -1
  133. package/dist/prebuilt/react_agent_executor.cjs +1 -1
  134. package/dist/prebuilt/react_agent_executor.cjs.map +1 -1
  135. package/dist/prebuilt/react_agent_executor.d.cts +5 -5
  136. package/dist/prebuilt/react_agent_executor.d.cts.map +1 -1
  137. package/dist/prebuilt/react_agent_executor.d.ts +4 -4
  138. package/dist/prebuilt/react_agent_executor.d.ts.map +1 -1
  139. package/dist/prebuilt/react_agent_executor.js +1 -1
  140. package/dist/prebuilt/react_agent_executor.js.map +1 -1
  141. package/dist/pregel/algo.cjs +36 -6
  142. package/dist/pregel/algo.cjs.map +1 -1
  143. package/dist/pregel/algo.d.cts +1 -1
  144. package/dist/pregel/algo.d.cts.map +1 -1
  145. package/dist/pregel/algo.d.ts +1 -1
  146. package/dist/pregel/algo.d.ts.map +1 -1
  147. package/dist/pregel/algo.js +37 -7
  148. package/dist/pregel/algo.js.map +1 -1
  149. package/dist/pregel/index.cjs +8 -4
  150. package/dist/pregel/index.cjs.map +1 -1
  151. package/dist/pregel/index.d.cts +8 -6
  152. package/dist/pregel/index.d.cts.map +1 -1
  153. package/dist/pregel/index.d.ts +8 -6
  154. package/dist/pregel/index.d.ts.map +1 -1
  155. package/dist/pregel/index.js +8 -4
  156. package/dist/pregel/index.js.map +1 -1
  157. package/dist/pregel/loop.cjs +7 -4
  158. package/dist/pregel/loop.cjs.map +1 -1
  159. package/dist/pregel/loop.js +7 -4
  160. package/dist/pregel/loop.js.map +1 -1
  161. package/dist/pregel/remote.d.cts +2 -2
  162. package/dist/pregel/remote.d.cts.map +1 -1
  163. package/dist/pregel/remote.d.ts +2 -2
  164. package/dist/pregel/remote.d.ts.map +1 -1
  165. package/dist/pregel/runnable_types.d.cts +34 -10
  166. package/dist/pregel/runnable_types.d.cts.map +1 -1
  167. package/dist/pregel/runnable_types.d.ts +34 -10
  168. package/dist/pregel/runnable_types.d.ts.map +1 -1
  169. package/dist/pregel/stream.cjs +3 -3
  170. package/dist/pregel/stream.cjs.map +1 -1
  171. package/dist/pregel/stream.js +3 -3
  172. package/dist/pregel/stream.js.map +1 -1
  173. package/dist/pregel/types.cjs.map +1 -1
  174. package/dist/pregel/types.d.cts +10 -7
  175. package/dist/pregel/types.d.cts.map +1 -1
  176. package/dist/pregel/types.d.ts +10 -7
  177. package/dist/pregel/types.d.ts.map +1 -1
  178. package/dist/pregel/types.js.map +1 -1
  179. package/dist/pregel/utils/config.cjs +1 -0
  180. package/dist/pregel/utils/config.cjs.map +1 -1
  181. package/dist/pregel/utils/config.js +1 -0
  182. package/dist/pregel/utils/config.js.map +1 -1
  183. package/dist/ui/stream.cjs.map +1 -1
  184. package/dist/ui/stream.js.map +1 -1
  185. package/dist/web.cjs +4 -5
  186. package/dist/web.d.cts +8 -8
  187. package/dist/web.d.ts +8 -8
  188. package/dist/web.js +3 -3
  189. package/dist/writer.cjs +15 -0
  190. package/dist/writer.cjs.map +1 -0
  191. package/dist/writer.d.cts +5 -0
  192. package/dist/writer.d.cts.map +1 -0
  193. package/dist/writer.d.ts +5 -0
  194. package/dist/writer.d.ts.map +1 -0
  195. package/dist/writer.js +14 -0
  196. package/dist/writer.js.map +1 -0
  197. package/package.json +18 -8
@@ -1 +1 @@
1
- {"version":3,"file":"graph.js","names":["e: any","destinations: (string | Send)[]","Graph","args","options: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n >","name","DrawableGraph","startNodes: Record<string, DrawableGraphNode>","endNodes: Record<string, DrawableGraphNode>","subgraphs: Record<string, CompiledGraph<any>>","isUuid","defaultEnds: Record<string, string>"],"sources":["../../src/graph/graph.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-use-before-define */\nimport {\n _coerceToRunnable,\n Runnable,\n RunnableConfig,\n RunnableInterface,\n RunnableIOSchema,\n type RunnableLike as LangChainRunnableLike,\n} from \"@langchain/core/runnables\";\nimport {\n Node as DrawableGraphNode,\n Graph as DrawableGraph,\n} from \"@langchain/core/runnables/graph\";\nimport { All, BaseCheckpointSaver } from \"@langchain/langgraph-checkpoint\";\nimport { z } from \"zod\";\nimport { validate as isUuid } from \"uuid\";\nimport type {\n RunnableLike,\n LangGraphRunnableConfig,\n} from \"../pregel/runnable_types.js\";\nimport { PregelNode } from \"../pregel/read.js\";\nimport { Channel, Pregel } from \"../pregel/index.js\";\nimport type { PregelParams } from \"../pregel/types.js\";\nimport { BaseChannel } from \"../channels/base.js\";\nimport { EphemeralValue } from \"../channels/ephemeral_value.js\";\nimport { ChannelWrite, PASSTHROUGH } from \"../pregel/write.js\";\nimport {\n _isSend,\n CHECKPOINT_NAMESPACE_END,\n CHECKPOINT_NAMESPACE_SEPARATOR,\n END,\n Send,\n START,\n TAG_HIDDEN,\n} from \"../constants.js\";\nimport {\n gatherIterator,\n gatherIteratorSync,\n RunnableCallable,\n} from \"../utils.js\";\nimport {\n InvalidUpdateError,\n NodeInterrupt,\n UnreachableNodeError,\n} from \"../errors.js\";\nimport { StateDefinition, StateType } from \"./annotation.js\";\nimport { isPregelLike } from \"../pregel/utils/subgraph.js\";\n\nexport interface BranchOptions<\n IO,\n N extends string,\n CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig\n> {\n source: N;\n path: RunnableLike<IO, BranchPathReturnValue, CallOptions>;\n pathMap?: Record<string, N | typeof END> | (N | typeof END)[];\n}\n\nexport type BranchPathReturnValue =\n | string\n | Send\n | (string | Send)[]\n | Promise<string | Send | (string | Send)[]>;\n\ntype NodeAction<S, U, C extends StateDefinition> = RunnableLike<\n S,\n U extends object ? U & Record<string, any> : U, // eslint-disable-line @typescript-eslint/no-explicit-any\n LangGraphRunnableConfig<StateType<C>>\n>;\n\nexport class Branch<\n IO,\n N extends string,\n CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig\n> {\n path: Runnable<IO, BranchPathReturnValue, CallOptions>;\n\n ends?: Record<string, N | typeof END>;\n\n constructor(options: Omit<BranchOptions<IO, N, CallOptions>, \"source\">) {\n if (Runnable.isRunnable(options.path)) {\n this.path = options.path as Runnable<\n IO,\n BranchPathReturnValue,\n CallOptions\n >;\n } else {\n this.path = _coerceToRunnable(\n options.path as LangChainRunnableLike<\n IO,\n BranchPathReturnValue,\n CallOptions\n >\n ).withConfig({ runName: `Branch` } as CallOptions);\n }\n this.ends = Array.isArray(options.pathMap)\n ? options.pathMap.reduce((acc, n) => {\n acc[n] = n;\n return acc;\n }, {} as Record<string, N | typeof END>)\n : options.pathMap;\n }\n\n run(\n writer: (\n dests: (string | Send)[],\n config: LangGraphRunnableConfig\n ) => Runnable | void | Promise<void>,\n reader?: (config: CallOptions) => IO\n ) {\n return ChannelWrite.registerWriter(\n new RunnableCallable({\n name: \"<branch_run>\",\n trace: false,\n func: async (input: IO, config: CallOptions) => {\n try {\n return await this._route(input, config, writer, reader);\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n } catch (e: any) {\n // Detect & warn if NodeInterrupt is thrown in a conditional edge\n if (e.name === NodeInterrupt.unminifiable_name) {\n console.warn(\n \"[WARN]: 'NodeInterrupt' thrown in conditional edge. This is likely a bug in your graph implementation.\\n\" +\n \"NodeInterrupt should only be thrown inside a node, not in edge conditions.\"\n );\n }\n throw e;\n }\n },\n })\n );\n }\n\n async _route(\n input: IO,\n config: CallOptions,\n writer: (\n dests: (string | Send)[],\n config: LangGraphRunnableConfig\n ) => Runnable | void | Promise<void>,\n reader?: (config: CallOptions) => IO\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n ): Promise<Runnable | any> {\n let result = await this.path.invoke(\n reader ? reader(config) : input,\n config\n );\n if (!Array.isArray(result)) {\n result = [result];\n }\n\n let destinations: (string | Send)[];\n if (this.ends) {\n destinations = result.map((r) => (_isSend(r) ? r : this.ends![r]));\n } else {\n destinations = result;\n }\n if (destinations.some((dest) => !dest)) {\n throw new Error(\"Branch condition returned unknown or null destination\");\n }\n if (destinations.filter(_isSend).some((packet) => packet.node === END)) {\n throw new InvalidUpdateError(\"Cannot send a packet to the END node\");\n }\n const writeResult = await writer(destinations, config);\n return writeResult ?? input;\n }\n}\n\nexport type NodeSpec<RunInput, RunOutput> = {\n runnable: Runnable<RunInput, RunOutput>;\n metadata?: Record<string, unknown>;\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n subgraphs?: Pregel<any, any>[];\n ends?: string[];\n defer?: boolean;\n};\n\nexport type AddNodeOptions<Nodes extends string = string> = {\n metadata?: Record<string, unknown>;\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n subgraphs?: Pregel<any, any>[];\n ends?: Nodes[];\n defer?: boolean;\n};\n\nexport class Graph<\n N extends string = typeof START | typeof END,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n RunInput = any,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n RunOutput = any,\n NodeSpecType extends NodeSpec<RunInput, RunOutput> = NodeSpec<\n RunInput,\n RunOutput\n >,\n C extends StateDefinition = StateDefinition\n> {\n nodes: Record<N, NodeSpecType>;\n\n edges: Set<[N | typeof START, N | typeof END]>;\n\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n branches: Record<string, Record<string, Branch<RunInput, N, any>>>;\n\n entryPoint?: string;\n\n compiled = false;\n\n constructor() {\n this.nodes = {} as Record<N, NodeSpecType>;\n this.edges = new Set();\n this.branches = {};\n }\n\n protected warnIfCompiled(message: string): void {\n if (this.compiled) {\n console.warn(message);\n }\n }\n\n get allEdges(): Set<[string, string]> {\n return this.edges;\n }\n\n addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(\n nodes:\n | Record<K, NodeAction<NodeInput, NodeOutput, C>>\n | [\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ][]\n ): Graph<N | K, RunInput, RunOutput>;\n\n addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ): Graph<N | K, RunInput, RunOutput>;\n\n addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(\n ...args:\n | [\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ]\n | [\n nodes:\n | Record<K, NodeAction<NodeInput, NodeOutput, C>>\n | [\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ][]\n ]\n ): Graph<N | K, RunInput, RunOutput> {\n function isMutlipleNodes(\n args: unknown[]\n ): args is [\n nodes:\n | Record<K, NodeAction<NodeInput, RunOutput, C>>\n | [\n key: K,\n action: NodeAction<NodeInput, RunOutput, C>,\n options?: AddNodeOptions\n ][],\n options?: AddNodeOptions\n ] {\n return args.length >= 1 && typeof args[0] !== \"string\";\n }\n\n const nodes = (\n isMutlipleNodes(args) // eslint-disable-line no-nested-ternary\n ? Array.isArray(args[0])\n ? args[0]\n : Object.entries(args[0])\n : [[args[0], args[1], args[2]]]\n ) as [K, NodeAction<NodeInput, RunOutput, C>, AddNodeOptions][];\n\n if (nodes.length === 0) {\n throw new Error(\"No nodes provided in `addNode`\");\n }\n\n for (const [key, action, options] of nodes) {\n for (const reservedChar of [\n CHECKPOINT_NAMESPACE_SEPARATOR,\n CHECKPOINT_NAMESPACE_END,\n ]) {\n if (key.includes(reservedChar)) {\n throw new Error(\n `\"${reservedChar}\" is a reserved character and is not allowed in node names.`\n );\n }\n }\n this.warnIfCompiled(\n `Adding a node to a graph that has already been compiled. This will not be reflected in the compiled graph.`\n );\n\n if (key in this.nodes) {\n throw new Error(`Node \\`${key}\\` already present.`);\n }\n if (key === END) {\n throw new Error(`Node \\`${key}\\` is reserved.`);\n }\n\n const runnable = _coerceToRunnable<RunInput, RunOutput>(\n // Account for arbitrary state due to Send API\n action as RunnableLike<RunInput, RunOutput>\n );\n\n this.nodes[key as unknown as N] = {\n runnable,\n metadata: options?.metadata,\n subgraphs: isPregelLike(runnable) ? [runnable] : options?.subgraphs,\n ends: options?.ends,\n } as NodeSpecType;\n }\n\n return this as Graph<N | K, RunInput, RunOutput, NodeSpecType>;\n }\n\n addEdge(startKey: N | typeof START, endKey: N | typeof END): this {\n this.warnIfCompiled(\n `Adding an edge to a graph that has already been compiled. This will not be reflected in the compiled graph.`\n );\n\n if (startKey === END) {\n throw new Error(\"END cannot be a start node\");\n }\n if (endKey === START) {\n throw new Error(\"START cannot be an end node\");\n }\n if (\n Array.from(this.edges).some(([start]) => start === startKey) &&\n !(\"channels\" in this)\n ) {\n throw new Error(\n `Already found path for ${startKey}. For multiple edges, use StateGraph.`\n );\n }\n\n this.edges.add([startKey, endKey]);\n\n return this;\n }\n\n addConditionalEdges(\n source: BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>\n ): this;\n\n addConditionalEdges(\n source: N,\n path: RunnableLike<\n RunInput,\n BranchPathReturnValue,\n LangGraphRunnableConfig<StateType<C>>\n >,\n pathMap?: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n >[\"pathMap\"]\n ): this;\n\n addConditionalEdges(\n source:\n | N\n | BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>,\n path?: RunnableLike<\n RunInput,\n BranchPathReturnValue,\n LangGraphRunnableConfig<StateType<C>>\n >,\n pathMap?: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n >[\"pathMap\"]\n ): this {\n const options: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n > = typeof source === \"object\" ? source : { source, path: path!, pathMap };\n\n this.warnIfCompiled(\n \"Adding an edge to a graph that has already been compiled. This will not be reflected in the compiled graph.\"\n );\n if (!Runnable.isRunnable(options.path)) {\n const pathDisplayValues = Array.isArray(options.pathMap)\n ? options.pathMap.join(\",\")\n : Object.keys(options.pathMap ?? {}).join(\",\");\n options.path = _coerceToRunnable(\n options.path as LangChainRunnableLike<\n RunInput,\n BranchPathReturnValue,\n LangGraphRunnableConfig<StateType<C>>\n >\n ).withConfig({\n runName: `Branch<${options.source}${\n pathDisplayValues !== \"\" ? `,${pathDisplayValues}` : \"\"\n }>`.slice(0, 63),\n });\n }\n // find a name for condition\n const name =\n options.path.getName() === \"RunnableLambda\"\n ? \"condition\"\n : options.path.getName();\n // validate condition\n if (this.branches[options.source] && this.branches[options.source][name]) {\n throw new Error(\n `Condition \\`${name}\\` already present for node \\`${source}\\``\n );\n }\n // save it\n this.branches[options.source] ??= {};\n this.branches[options.source][name] = new Branch(options);\n return this;\n }\n\n /**\n * @deprecated use `addEdge(START, key)` instead\n */\n setEntryPoint(key: N): this {\n this.warnIfCompiled(\n \"Setting the entry point of a graph that has already been compiled. This will not be reflected in the compiled graph.\"\n );\n\n return this.addEdge(START, key);\n }\n\n /**\n * @deprecated use `addEdge(key, END)` instead\n */\n setFinishPoint(key: N): this {\n this.warnIfCompiled(\n \"Setting a finish point of a graph that has already been compiled. This will not be reflected in the compiled graph.\"\n );\n\n return this.addEdge(key, END);\n }\n\n compile({\n checkpointer,\n interruptBefore,\n interruptAfter,\n name,\n }: {\n checkpointer?: BaseCheckpointSaver | false;\n interruptBefore?: N[] | All;\n interruptAfter?: N[] | All;\n name?: string;\n } = {}): CompiledGraph<N> {\n // validate the graph\n this.validate([\n ...(Array.isArray(interruptBefore) ? interruptBefore : []),\n ...(Array.isArray(interruptAfter) ? interruptAfter : []),\n ]);\n\n // create empty compiled graph\n const compiled = new CompiledGraph({\n builder: this,\n checkpointer,\n interruptAfter,\n interruptBefore,\n autoValidate: false,\n nodes: {} as Record<N | typeof START, PregelNode<RunInput, RunOutput>>,\n channels: {\n [START]: new EphemeralValue(),\n [END]: new EphemeralValue(),\n } as Record<N | typeof START | typeof END | string, BaseChannel>,\n inputChannels: START,\n outputChannels: END,\n streamChannels: [] as N[],\n streamMode: \"values\",\n name,\n });\n\n // attach nodes, edges and branches\n for (const [key, node] of Object.entries<NodeSpec<RunInput, RunOutput>>(\n this.nodes\n )) {\n compiled.attachNode(key as N, node);\n }\n for (const [start, end] of this.edges) {\n compiled.attachEdge(start, end);\n }\n for (const [start, branches] of Object.entries(this.branches)) {\n for (const [name, branch] of Object.entries(branches)) {\n compiled.attachBranch(start as N, name, branch);\n }\n }\n\n return compiled.validate();\n }\n\n validate(interrupt?: string[]): void {\n // assemble sources\n const allSources = new Set([...this.allEdges].map(([src, _]) => src));\n for (const [start] of Object.entries(this.branches)) {\n allSources.add(start);\n }\n\n // validate sources\n for (const source of allSources) {\n if (source !== START && !(source in this.nodes)) {\n throw new Error(`Found edge starting at unknown node \\`${source}\\``);\n }\n }\n\n // assemble targets\n const allTargets = new Set([...this.allEdges].map(([_, target]) => target));\n for (const [start, branches] of Object.entries(this.branches)) {\n for (const branch of Object.values(branches)) {\n if (branch.ends != null) {\n for (const end of Object.values(branch.ends)) {\n allTargets.add(end);\n }\n } else {\n allTargets.add(END);\n for (const node of Object.keys(this.nodes)) {\n if (node !== start) {\n allTargets.add(node);\n }\n }\n }\n }\n }\n for (const node of Object.values<NodeSpecType>(this.nodes)) {\n for (const target of node.ends ?? []) {\n allTargets.add(target);\n }\n }\n // validate targets\n for (const node of Object.keys(this.nodes)) {\n if (!allTargets.has(node)) {\n throw new UnreachableNodeError(\n [\n `Node \\`${node}\\` is not reachable.`,\n \"\",\n \"If you are returning Command objects from your node,\",\n 'make sure you are passing names of potential destination nodes as an \"ends\" array',\n 'into \".addNode(..., { ends: [\"node1\", \"node2\"] })\".',\n ].join(\"\\n\"),\n {\n lc_error_code: \"UNREACHABLE_NODE\",\n }\n );\n }\n }\n for (const target of allTargets) {\n if (target !== END && !(target in this.nodes)) {\n throw new Error(`Found edge ending at unknown node \\`${target}\\``);\n }\n }\n\n // validate interrupts\n if (interrupt) {\n for (const node of interrupt) {\n if (!(node in this.nodes)) {\n throw new Error(`Interrupt node \\`${node}\\` is not present`);\n }\n }\n }\n\n this.compiled = true;\n }\n}\n\nexport class CompiledGraph<\n N extends string,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n State = any,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n Update = any,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n ContextType extends Record<string, any> = Record<string, any>,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n InputType = any,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n OutputType = any,\n NodeReturnType = unknown\n> extends Pregel<\n Record<N | typeof START, PregelNode<State, Update>>,\n Record<N | typeof START | typeof END | string, BaseChannel>,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n ContextType & Record<string, any>,\n InputType,\n OutputType,\n InputType,\n OutputType,\n NodeReturnType\n> {\n declare NodeType: N;\n\n declare \"~NodeReturnType\": NodeReturnType;\n\n declare RunInput: State;\n\n declare RunOutput: Update;\n\n builder: Graph<N, State, Update>;\n\n constructor({\n builder,\n ...rest\n }: { builder: Graph<N, State, Update> } & PregelParams<\n Record<N | typeof START, PregelNode<State, Update>>,\n Record<N | typeof START | typeof END | string, BaseChannel>\n >) {\n super(rest);\n this.builder = builder;\n }\n\n attachNode(key: N, node: NodeSpec<State, Update>): void {\n this.channels[key] = new EphemeralValue();\n this.nodes[key] = new PregelNode({\n channels: [],\n triggers: [],\n metadata: node.metadata,\n subgraphs: node.subgraphs,\n ends: node.ends,\n })\n .pipe(node.runnable)\n .pipe(\n new ChannelWrite([{ channel: key, value: PASSTHROUGH }], [TAG_HIDDEN])\n );\n (this.streamChannels as N[]).push(key);\n }\n\n attachEdge(start: N | typeof START, end: N | typeof END): void {\n if (end === END) {\n if (start === START) {\n throw new Error(\"Cannot have an edge from START to END\");\n }\n this.nodes[start].writers.push(\n new ChannelWrite([{ channel: END, value: PASSTHROUGH }], [TAG_HIDDEN])\n );\n } else {\n this.nodes[end].triggers.push(start);\n (this.nodes[end].channels as string[]).push(start);\n }\n }\n\n attachBranch(\n start: N | typeof START,\n name: string,\n branch: Branch<State, N>\n ) {\n // add hidden start node\n if (start === START && !this.nodes[START]) {\n this.nodes[START] = Channel.subscribeTo(START, { tags: [TAG_HIDDEN] });\n }\n\n // attach branch writer\n this.nodes[start].pipe(\n branch.run((dests) => {\n const writes = dests.map((dest) => {\n if (_isSend(dest)) {\n return dest;\n }\n return {\n channel: dest === END ? END : `branch:${start}:${name}:${dest}`,\n value: PASSTHROUGH,\n };\n });\n return new ChannelWrite(writes, [TAG_HIDDEN]);\n })\n );\n\n // attach branch readers\n const ends = branch.ends\n ? Object.values(branch.ends)\n : (Object.keys(this.nodes) as N[]);\n for (const end of ends) {\n if (end !== END) {\n const channelName = `branch:${start}:${name}:${end}`;\n (this.channels as Record<string, BaseChannel>)[channelName] =\n new EphemeralValue();\n this.nodes[end].triggers.push(channelName);\n (this.nodes[end].channels as string[]).push(channelName);\n }\n }\n }\n\n /**\n * Returns a drawable representation of the computation graph.\n */\n override async getGraphAsync(\n config?: RunnableConfig & { xray?: boolean | number }\n ): Promise<DrawableGraph> {\n const xray = config?.xray;\n const graph = new DrawableGraph();\n const startNodes: Record<string, DrawableGraphNode> = {\n [START]: graph.addNode(\n {\n schema: z.any(),\n },\n START\n ),\n };\n const endNodes: Record<string, DrawableGraphNode> = {};\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n let subgraphs: Record<string, CompiledGraph<any>> = {};\n if (xray) {\n subgraphs = Object.fromEntries(\n (await gatherIterator(this.getSubgraphsAsync())).filter(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n (x): x is [string, CompiledGraph<any>] => isCompiledGraph(x[1])\n )\n );\n }\n\n function addEdge(\n start: string,\n end: string,\n label?: string,\n conditional = false\n ) {\n if (end === END && endNodes[END] === undefined) {\n endNodes[END] = graph.addNode({ schema: z.any() }, END);\n }\n if (startNodes[start] === undefined) {\n return;\n }\n if (endNodes[end] === undefined) {\n throw new Error(`End node ${end} not found!`);\n }\n return graph.addEdge(\n startNodes[start],\n endNodes[end],\n label !== end ? label : undefined,\n conditional\n );\n }\n\n for (const [key, nodeSpec] of Object.entries(this.builder.nodes) as [\n N,\n NodeSpec<State, Update>\n ][]) {\n const displayKey = _escapeMermaidKeywords(key);\n const node = nodeSpec.runnable;\n const metadata = nodeSpec.metadata ?? {};\n if (\n this.interruptBefore?.includes(key) &&\n this.interruptAfter?.includes(key)\n ) {\n metadata.__interrupt = \"before,after\";\n } else if (this.interruptBefore?.includes(key)) {\n metadata.__interrupt = \"before\";\n } else if (this.interruptAfter?.includes(key)) {\n metadata.__interrupt = \"after\";\n }\n if (xray) {\n const newXrayValue = typeof xray === \"number\" ? xray - 1 : xray;\n const drawableSubgraph =\n subgraphs[key] !== undefined\n ? await subgraphs[key].getGraphAsync({\n ...config,\n xray: newXrayValue,\n })\n : node.getGraph(config);\n\n drawableSubgraph.trimFirstNode();\n drawableSubgraph.trimLastNode();\n\n if (Object.keys(drawableSubgraph.nodes).length > 1) {\n const [e, s] = graph.extend(drawableSubgraph, displayKey);\n if (e === undefined) {\n throw new Error(\n `Could not extend subgraph \"${key}\" due to missing entrypoint.`\n );\n }\n\n // TODO: Remove default name once we stop supporting core 0.2.0\n // eslint-disable-next-line no-inner-declarations\n function _isRunnableInterface(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n thing: any\n ): thing is RunnableInterface {\n return thing ? thing.lc_runnable : false;\n }\n // eslint-disable-next-line no-inner-declarations\n function _nodeDataStr(\n id: string | undefined,\n data: RunnableInterface | RunnableIOSchema\n ): string {\n if (id !== undefined && !isUuid(id)) {\n return id;\n } else if (_isRunnableInterface(data)) {\n try {\n let dataStr = data.getName();\n dataStr = dataStr.startsWith(\"Runnable\")\n ? dataStr.slice(\"Runnable\".length)\n : dataStr;\n return dataStr;\n } catch (error) {\n return data.getName();\n }\n } else {\n return data.name ?? \"UnknownSchema\";\n }\n }\n // TODO: Remove casts when we stop supporting core 0.2.0\n if (s !== undefined) {\n startNodes[displayKey] = {\n name: _nodeDataStr(s.id, s.data),\n ...s,\n } as DrawableGraphNode;\n }\n endNodes[displayKey] = {\n name: _nodeDataStr(e.id, e.data),\n ...e,\n } as DrawableGraphNode;\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n }\n const sortedEdges = [...this.builder.allEdges].sort(([a], [b]) => {\n if (a < b) {\n return -1;\n } else if (b > a) {\n return 1;\n } else {\n return 0;\n }\n });\n for (const [start, end] of sortedEdges) {\n addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end));\n }\n for (const [start, branches] of Object.entries(this.builder.branches)) {\n const defaultEnds: Record<string, string> = {\n ...Object.fromEntries(\n Object.keys(this.builder.nodes)\n .filter((k) => k !== start)\n .map((k) => [_escapeMermaidKeywords(k), _escapeMermaidKeywords(k)])\n ),\n [END]: END,\n };\n for (const branch of Object.values(branches)) {\n let ends;\n if (branch.ends !== undefined) {\n ends = branch.ends;\n } else {\n ends = defaultEnds;\n }\n for (const [label, end] of Object.entries(ends)) {\n addEdge(\n _escapeMermaidKeywords(start),\n _escapeMermaidKeywords(end),\n label,\n true\n );\n }\n }\n }\n for (const [key, node] of Object.entries(this.builder.nodes) as [\n N,\n NodeSpec<State, Update>\n ][]) {\n if (node.ends !== undefined) {\n for (const end of node.ends) {\n addEdge(\n _escapeMermaidKeywords(key),\n _escapeMermaidKeywords(end),\n undefined,\n true\n );\n }\n }\n }\n return graph;\n }\n\n /**\n * Returns a drawable representation of the computation graph.\n *\n * @deprecated Use getGraphAsync instead. The async method will be the default in the next minor core release.\n */\n override getGraph(\n config?: RunnableConfig & { xray?: boolean | number }\n ): DrawableGraph {\n const xray = config?.xray;\n const graph = new DrawableGraph();\n const startNodes: Record<string, DrawableGraphNode> = {\n [START]: graph.addNode(\n {\n schema: z.any(),\n },\n START\n ),\n };\n const endNodes: Record<string, DrawableGraphNode> = {};\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n let subgraphs: Record<string, CompiledGraph<any>> = {};\n if (xray) {\n subgraphs = Object.fromEntries(\n gatherIteratorSync(this.getSubgraphs()).filter(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n (x): x is [string, CompiledGraph<any>] => isCompiledGraph(x[1])\n )\n );\n }\n\n function addEdge(\n start: string,\n end: string,\n label?: string,\n conditional = false\n ) {\n if (end === END && endNodes[END] === undefined) {\n endNodes[END] = graph.addNode({ schema: z.any() }, END);\n }\n return graph.addEdge(\n startNodes[start],\n endNodes[end],\n label !== end ? label : undefined,\n conditional\n );\n }\n\n for (const [key, nodeSpec] of Object.entries(this.builder.nodes) as [\n N,\n NodeSpec<State, Update>\n ][]) {\n const displayKey = _escapeMermaidKeywords(key);\n const node = nodeSpec.runnable;\n const metadata = nodeSpec.metadata ?? {};\n if (\n this.interruptBefore?.includes(key) &&\n this.interruptAfter?.includes(key)\n ) {\n metadata.__interrupt = \"before,after\";\n } else if (this.interruptBefore?.includes(key)) {\n metadata.__interrupt = \"before\";\n } else if (this.interruptAfter?.includes(key)) {\n metadata.__interrupt = \"after\";\n }\n if (xray) {\n const newXrayValue = typeof xray === \"number\" ? xray - 1 : xray;\n const drawableSubgraph =\n subgraphs[key] !== undefined\n ? subgraphs[key].getGraph({\n ...config,\n xray: newXrayValue,\n })\n : node.getGraph(config);\n drawableSubgraph.trimFirstNode();\n drawableSubgraph.trimLastNode();\n if (Object.keys(drawableSubgraph.nodes).length > 1) {\n const [e, s] = graph.extend(drawableSubgraph, displayKey);\n if (e === undefined) {\n throw new Error(\n `Could not extend subgraph \"${key}\" due to missing entrypoint.`\n );\n }\n\n // TODO: Remove default name once we stop supporting core 0.2.0\n // eslint-disable-next-line no-inner-declarations\n function _isRunnableInterface(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n thing: any\n ): thing is RunnableInterface {\n return thing ? thing.lc_runnable : false;\n }\n // eslint-disable-next-line no-inner-declarations\n function _nodeDataStr(\n id: string | undefined,\n data: RunnableInterface | RunnableIOSchema\n ): string {\n if (id !== undefined && !isUuid(id)) {\n return id;\n } else if (_isRunnableInterface(data)) {\n try {\n let dataStr = data.getName();\n dataStr = dataStr.startsWith(\"Runnable\")\n ? dataStr.slice(\"Runnable\".length)\n : dataStr;\n return dataStr;\n } catch (error) {\n return data.getName();\n }\n } else {\n return data.name ?? \"UnknownSchema\";\n }\n }\n // TODO: Remove casts when we stop supporting core 0.2.0\n if (s !== undefined) {\n startNodes[displayKey] = {\n name: _nodeDataStr(s.id, s.data),\n ...s,\n } as DrawableGraphNode;\n }\n endNodes[displayKey] = {\n name: _nodeDataStr(e.id, e.data),\n ...e,\n } as DrawableGraphNode;\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n }\n const sortedEdges = [...this.builder.allEdges].sort(([a], [b]) => {\n if (a < b) {\n return -1;\n } else if (b > a) {\n return 1;\n } else {\n return 0;\n }\n });\n for (const [start, end] of sortedEdges) {\n addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end));\n }\n for (const [start, branches] of Object.entries(this.builder.branches)) {\n const defaultEnds: Record<string, string> = {\n ...Object.fromEntries(\n Object.keys(this.builder.nodes)\n .filter((k) => k !== start)\n .map((k) => [_escapeMermaidKeywords(k), _escapeMermaidKeywords(k)])\n ),\n [END]: END,\n };\n for (const branch of Object.values(branches)) {\n let ends;\n if (branch.ends !== undefined) {\n ends = branch.ends;\n } else {\n ends = defaultEnds;\n }\n for (const [label, end] of Object.entries(ends)) {\n addEdge(\n _escapeMermaidKeywords(start),\n _escapeMermaidKeywords(end),\n label,\n true\n );\n }\n }\n }\n return graph;\n }\n}\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction isCompiledGraph(x: unknown): x is CompiledGraph<any> {\n return (\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n typeof (x as CompiledGraph<any>).attachNode === \"function\" &&\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n typeof (x as CompiledGraph<any>).attachEdge === \"function\"\n );\n}\n\nfunction _escapeMermaidKeywords(key: string) {\n if (key === \"subgraph\") {\n return `\"${key}\"`;\n }\n return key;\n}\n"],"mappings":";;;;;;;;;;;;;;AAsEA,IAAa,SAAb,MAIE;CACA;CAEA;CAEA,YAAY,SAA4D;AACtE,MAAI,SAAS,WAAW,QAAQ,MAC9B,MAAK,OAAO,QAAQ;MAMpB,MAAK,OAAO,kBACV,QAAQ,MAKR,WAAW,EAAE,SAAS;AAE1B,OAAK,OAAO,MAAM,QAAQ,QAAQ,WAC9B,QAAQ,QAAQ,QAAQ,KAAK,MAAM;AACjC,OAAI,KAAK;AACT,UAAO;KACN,MACH,QAAQ;;CAGd,IACE,QAIA,QACA;AACA,SAAO,aAAa,eAClB,IAAI,iBAAiB;GACnB,MAAM;GACN,OAAO;GACP,MAAM,OAAO,OAAW,WAAwB;AAC9C,QAAI;AACF,YAAO,MAAM,KAAK,OAAO,OAAO,QAAQ,QAAQ;aAEzCA,GAAQ;AAEf,SAAI,EAAE,SAAS,cAAc,kBAC3B,SAAQ,KACN;AAIJ,WAAM;;;;;CAOhB,MAAM,OACJ,OACA,QACA,QAIA,QAEyB;EACzB,IAAI,SAAS,MAAM,KAAK,KAAK,OAC3B,SAAS,OAAO,UAAU,OAC1B;AAEF,MAAI,CAAC,MAAM,QAAQ,QACjB,UAAS,CAAC;EAGZ,IAAIC;AACJ,MAAI,KAAK,KACP,gBAAe,OAAO,KAAK,MAAO,QAAQ,KAAK,IAAI,KAAK,KAAM;MAE9D,gBAAe;AAEjB,MAAI,aAAa,MAAM,SAAS,CAAC,MAC/B,OAAM,IAAI,MAAM;AAElB,MAAI,aAAa,OAAO,SAAS,MAAM,WAAW,OAAO,SAAS,KAChE,OAAM,IAAI,mBAAmB;EAE/B,MAAM,cAAc,MAAM,OAAO,cAAc;AAC/C,SAAO,eAAe;;;AAqB1B,IAAaC,UAAb,MAWE;CACA;CAEA;CAGA;CAEA;CAEA,WAAW;CAEX,cAAc;AACZ,OAAK,QAAQ;AACb,OAAK,wBAAQ,IAAI;AACjB,OAAK,WAAW;;CAGlB,AAAU,eAAe,SAAuB;AAC9C,MAAI,KAAK,SACP,SAAQ,KAAK;;CAIjB,IAAI,WAAkC;AACpC,SAAO,KAAK;;CAmBd,QACE,GAAG,MAegC;EACnC,SAAS,gBACP,QAUA;AACA,UAAOC,OAAK,UAAU,KAAK,OAAOA,OAAK,OAAO;;EAGhD,MAAM,QACJ,gBAAgB,QACZ,MAAM,QAAQ,KAAK,MACjB,KAAK,KACL,OAAO,QAAQ,KAAK,MACtB,CAAC;GAAC,KAAK;GAAI,KAAK;GAAI,KAAK;;AAG/B,MAAI,MAAM,WAAW,EACnB,OAAM,IAAI,MAAM;AAGlB,OAAK,MAAM,CAAC,KAAK,QAAQ,YAAY,OAAO;AAC1C,QAAK,MAAM,gBAAgB,CACzB,gCACA,0BAEA,KAAI,IAAI,SAAS,cACf,OAAM,IAAI,MACR,IAAI,aAAa;AAIvB,QAAK,eACH;AAGF,OAAI,OAAO,KAAK,MACd,OAAM,IAAI,MAAM,UAAU,IAAI;AAEhC,OAAI,QAAQ,IACV,OAAM,IAAI,MAAM,UAAU,IAAI;GAGhC,MAAM,WAAW,kBAEf;AAGF,QAAK,MAAM,OAAuB;IAChC;IACA,UAAU,SAAS;IACnB,WAAW,aAAa,YAAY,CAAC,YAAY,SAAS;IAC1D,MAAM,SAAS;;;AAInB,SAAO;;CAGT,QAAQ,UAA4B,QAA8B;AAChE,OAAK,eACH;AAGF,MAAI,aAAa,IACf,OAAM,IAAI,MAAM;AAElB,MAAI,WAAW,MACb,OAAM,IAAI,MAAM;AAElB,MACE,MAAM,KAAK,KAAK,OAAO,MAAM,CAAC,WAAW,UAAU,aACnD,EAAE,cAAc,MAEhB,OAAM,IAAI,MACR,0BAA0B,SAAS;AAIvC,OAAK,MAAM,IAAI,CAAC,UAAU;AAE1B,SAAO;;CAqBT,oBACE,QAGA,MAKA,SAKM;EACN,MAAMC,UAIF,OAAO,WAAW,WAAW,SAAS;GAAE;GAAc;GAAO;;AAEjE,OAAK,eACH;AAEF,MAAI,CAAC,SAAS,WAAW,QAAQ,OAAO;GACtC,MAAM,oBAAoB,MAAM,QAAQ,QAAQ,WAC5C,QAAQ,QAAQ,KAAK,OACrB,OAAO,KAAK,QAAQ,WAAW,IAAI,KAAK;AAC5C,WAAQ,OAAO,kBACb,QAAQ,MAKR,WAAW,EACX,SAAS,UAAU,QAAQ,SACzB,sBAAsB,KAAK,IAAI,sBAAsB,GACtD,GAAG,MAAM,GAAG;;EAIjB,MAAM,OACJ,QAAQ,KAAK,cAAc,mBACvB,cACA,QAAQ,KAAK;AAEnB,MAAI,KAAK,SAAS,QAAQ,WAAW,KAAK,SAAS,QAAQ,QAAQ,MACjE,OAAM,IAAI,MACR,eAAe,KAAK,gCAAgC,OAAO;AAI/D,OAAK,SAAS,QAAQ,YAAY;AAClC,OAAK,SAAS,QAAQ,QAAQ,QAAQ,IAAI,OAAO;AACjD,SAAO;;;;;CAMT,cAAc,KAAc;AAC1B,OAAK,eACH;AAGF,SAAO,KAAK,QAAQ,OAAO;;;;;CAM7B,eAAe,KAAc;AAC3B,OAAK,eACH;AAGF,SAAO,KAAK,QAAQ,KAAK;;CAG3B,QAAQ,EACN,cACA,iBACA,gBACA,SAME,IAAsB;AAExB,OAAK,SAAS,CACZ,GAAI,MAAM,QAAQ,mBAAmB,kBAAkB,IACvD,GAAI,MAAM,QAAQ,kBAAkB,iBAAiB;EAIvD,MAAM,WAAW,IAAI,cAAc;GACjC,SAAS;GACT;GACA;GACA;GACA,cAAc;GACd,OAAO;GACP,UAAU;KACP,QAAQ,IAAI;KACZ,MAAM,IAAI;;GAEb,eAAe;GACf,gBAAgB;GAChB,gBAAgB;GAChB,YAAY;GACZ;;AAIF,OAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAC/B,KAAK,OAEL,UAAS,WAAW,KAAU;AAEhC,OAAK,MAAM,CAAC,OAAO,QAAQ,KAAK,MAC9B,UAAS,WAAW,OAAO;AAE7B,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,UAClD,MAAK,MAAM,CAACC,QAAM,WAAW,OAAO,QAAQ,UAC1C,UAAS,aAAa,OAAYA,QAAM;AAI5C,SAAO,SAAS;;CAGlB,SAAS,WAA4B;EAEnC,MAAM,aAAa,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,KAAK,CAAC,KAAK,OAAO;AAChE,OAAK,MAAM,CAAC,UAAU,OAAO,QAAQ,KAAK,UACxC,YAAW,IAAI;AAIjB,OAAK,MAAM,UAAU,WACnB,KAAI,WAAW,SAAS,EAAE,UAAU,KAAK,OACvC,OAAM,IAAI,MAAM,yCAAyC,OAAO;EAKpE,MAAM,aAAa,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,KAAK,CAAC,GAAG,YAAY;AACnE,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,UAClD,MAAK,MAAM,UAAU,OAAO,OAAO,UACjC,KAAI,OAAO,QAAQ,KACjB,MAAK,MAAM,OAAO,OAAO,OAAO,OAAO,MACrC,YAAW,IAAI;OAEZ;AACL,cAAW,IAAI;AACf,QAAK,MAAM,QAAQ,OAAO,KAAK,KAAK,OAClC,KAAI,SAAS,MACX,YAAW,IAAI;;AAMzB,OAAK,MAAM,QAAQ,OAAO,OAAqB,KAAK,OAClD,MAAK,MAAM,UAAU,KAAK,QAAQ,GAChC,YAAW,IAAI;AAInB,OAAK,MAAM,QAAQ,OAAO,KAAK,KAAK,OAClC,KAAI,CAAC,WAAW,IAAI,MAClB,OAAM,IAAI,qBACR;GACE,UAAU,KAAK;GACf;GACA;GACA;GACA;IACA,KAAK,OACP,EACE,eAAe;AAKvB,OAAK,MAAM,UAAU,WACnB,KAAI,WAAW,OAAO,EAAE,UAAU,KAAK,OACrC,OAAM,IAAI,MAAM,uCAAuC,OAAO;AAKlE,MAAI,WACF;QAAK,MAAM,QAAQ,UACjB,KAAI,EAAE,QAAQ,KAAK,OACjB,OAAM,IAAI,MAAM,oBAAoB,KAAK;;AAK/C,OAAK,WAAW;;;AAIpB,IAAa,gBAAb,cAaU,OAUR;CASA;CAEA,YAAY,EACV,QACA,GAAG,QAIF;AACD,QAAM;AACN,OAAK,UAAU;;CAGjB,WAAW,KAAQ,MAAqC;AACtD,OAAK,SAAS,OAAO,IAAI;AACzB,OAAK,MAAM,OAAO,IAAI,WAAW;GAC/B,UAAU;GACV,UAAU;GACV,UAAU,KAAK;GACf,WAAW,KAAK;GAChB,MAAM,KAAK;KAEV,KAAK,KAAK,UACV,KACC,IAAI,aAAa,CAAC;GAAE,SAAS;GAAK,OAAO;MAAgB,CAAC;AAE9D,EAAC,KAAK,eAAuB,KAAK;;CAGpC,WAAW,OAAyB,KAA2B;AAC7D,MAAI,QAAQ,KAAK;AACf,OAAI,UAAU,MACZ,OAAM,IAAI,MAAM;AAElB,QAAK,MAAM,OAAO,QAAQ,KACxB,IAAI,aAAa,CAAC;IAAE,SAAS;IAAK,OAAO;OAAgB,CAAC;SAEvD;AACL,QAAK,MAAM,KAAK,SAAS,KAAK;AAC9B,GAAC,KAAK,MAAM,KAAK,SAAsB,KAAK;;;CAIhD,aACE,OACA,MACA,QACA;AAEA,MAAI,UAAU,SAAS,CAAC,KAAK,MAAM,OACjC,MAAK,MAAM,SAAS,QAAQ,YAAY,OAAO,EAAE,MAAM,CAAC;AAI1D,OAAK,MAAM,OAAO,KAChB,OAAO,KAAK,UAAU;GACpB,MAAM,SAAS,MAAM,KAAK,SAAS;AACjC,QAAI,QAAQ,MACV,QAAO;AAET,WAAO;KACL,SAAS,SAAS,MAAM,MAAM,UAAU,MAAM,GAAG,KAAK,GAAG;KACzD,OAAO;;;AAGX,UAAO,IAAI,aAAa,QAAQ,CAAC;;EAKrC,MAAM,OAAO,OAAO,OAChB,OAAO,OAAO,OAAO,QACpB,OAAO,KAAK,KAAK;AACtB,OAAK,MAAM,OAAO,KAChB,KAAI,QAAQ,KAAK;GACf,MAAM,cAAc,UAAU,MAAM,GAAG,KAAK,GAAG;AAC/C,GAAC,KAAK,SAAyC,eAC7C,IAAI;AACN,QAAK,MAAM,KAAK,SAAS,KAAK;AAC9B,GAAC,KAAK,MAAM,KAAK,SAAsB,KAAK;;;;;;CAQlD,MAAe,cACb,QACwB;EACxB,MAAM,OAAO,QAAQ;EACrB,MAAM,QAAQ,IAAIC;EAClB,MAAMC,aAAgD,GACnD,QAAQ,MAAM,QACb,EACE,QAAQ,EAAE,SAEZ;EAGJ,MAAMC,WAA8C;EAEpD,IAAIC,YAAgD;AACpD,MAAI,KACF,aAAY,OAAO,aAChB,MAAM,eAAe,KAAK,sBAAsB,QAE9C,MAAyC,gBAAgB,EAAE;EAKlE,SAAS,QACP,OACA,KACA,OACA,cAAc,OACd;AACA,OAAI,QAAQ,OAAO,SAAS,SAAS,OACnC,UAAS,OAAO,MAAM,QAAQ,EAAE,QAAQ,EAAE,SAAS;AAErD,OAAI,WAAW,WAAW,OACxB;AAEF,OAAI,SAAS,SAAS,OACpB,OAAM,IAAI,MAAM,YAAY,IAAI;AAElC,UAAO,MAAM,QACX,WAAW,QACX,SAAS,MACT,UAAU,MAAM,QAAQ,QACxB;;AAIJ,OAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,KAAK,QAAQ,QAGrD;GACH,MAAM,aAAa,uBAAuB;GAC1C,MAAM,OAAO,SAAS;GACtB,MAAM,WAAW,SAAS,YAAY;AACtC,OACE,KAAK,iBAAiB,SAAS,QAC/B,KAAK,gBAAgB,SAAS,KAE9B,UAAS,cAAc;YACd,KAAK,iBAAiB,SAAS,KACxC,UAAS,cAAc;YACd,KAAK,gBAAgB,SAAS,KACvC,UAAS,cAAc;AAEzB,OAAI,MAAM;IACR,MAAM,eAAe,OAAO,SAAS,WAAW,OAAO,IAAI;IAC3D,MAAM,mBACJ,UAAU,SAAS,SACf,MAAM,UAAU,KAAK,cAAc;KACjC,GAAG;KACH,MAAM;SAER,KAAK,SAAS;AAEpB,qBAAiB;AACjB,qBAAiB;AAEjB,QAAI,OAAO,KAAK,iBAAiB,OAAO,SAAS,GAAG;KAClD,MAAM,CAAC,GAAG,KAAK,MAAM,OAAO,kBAAkB;AAC9C,SAAI,MAAM,OACR,OAAM,IAAI,MACR,8BAA8B,IAAI;KAMtC,SAAS,qBAEP,OAC4B;AAC5B,aAAO,QAAQ,MAAM,cAAc;;KAGrC,SAAS,aACP,IACA,MACQ;AACR,UAAI,OAAO,UAAa,CAACC,SAAO,IAC9B,QAAO;eACE,qBAAqB,MAC9B,KAAI;OACF,IAAI,UAAU,KAAK;AACnB,iBAAU,QAAQ,WAAW,cACzB,QAAQ,MAAM,KACd;AACJ,cAAO;eACA,OAAO;AACd,cAAO,KAAK;;UAGd,QAAO,KAAK,QAAQ;;AAIxB,SAAI,MAAM,OACR,YAAW,cAAc;MACvB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;AAGP,cAAS,cAAc;MACrB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;WAEA;KAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,gBAAW,cAAc;AACzB,cAAS,cAAc;;UAEpB;IAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,eAAW,cAAc;AACzB,aAAS,cAAc;;;EAG3B,MAAM,cAAc,CAAC,GAAG,KAAK,QAAQ,UAAU,MAAM,CAAC,IAAI,CAAC,OAAO;AAChE,OAAI,IAAI,EACN,QAAO;YACE,IAAI,EACb,QAAO;OAEP,QAAO;;AAGX,OAAK,MAAM,CAAC,OAAO,QAAQ,YACzB,SAAQ,uBAAuB,QAAQ,uBAAuB;AAEhE,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,QAAQ,WAAW;GACrE,MAAMC,cAAsC;IAC1C,GAAG,OAAO,YACR,OAAO,KAAK,KAAK,QAAQ,OACtB,QAAQ,MAAM,MAAM,OACpB,KAAK,MAAM,CAAC,uBAAuB,IAAI,uBAAuB;KAElE,MAAM;;AAET,QAAK,MAAM,UAAU,OAAO,OAAO,WAAW;IAC5C,IAAI;AACJ,QAAI,OAAO,SAAS,OAClB,QAAO,OAAO;QAEd,QAAO;AAET,SAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,MACxC,SACE,uBAAuB,QACvB,uBAAuB,MACvB,OACA;;;AAKR,OAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAK,QAAQ,OAIpD,KAAI,KAAK,SAAS,OAChB,MAAK,MAAM,OAAO,KAAK,KACrB,SACE,uBAAuB,MACvB,uBAAuB,MACvB,QACA;AAKR,SAAO;;;;;;;CAQT,AAAS,SACP,QACe;EACf,MAAM,OAAO,QAAQ;EACrB,MAAM,QAAQ,IAAIL;EAClB,MAAMC,aAAgD,GACnD,QAAQ,MAAM,QACb,EACE,QAAQ,EAAE,SAEZ;EAGJ,MAAMC,WAA8C;EAEpD,IAAIC,YAAgD;AACpD,MAAI,KACF,aAAY,OAAO,YACjB,mBAAmB,KAAK,gBAAgB,QAErC,MAAyC,gBAAgB,EAAE;EAKlE,SAAS,QACP,OACA,KACA,OACA,cAAc,OACd;AACA,OAAI,QAAQ,OAAO,SAAS,SAAS,OACnC,UAAS,OAAO,MAAM,QAAQ,EAAE,QAAQ,EAAE,SAAS;AAErD,UAAO,MAAM,QACX,WAAW,QACX,SAAS,MACT,UAAU,MAAM,QAAQ,QACxB;;AAIJ,OAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,KAAK,QAAQ,QAGrD;GACH,MAAM,aAAa,uBAAuB;GAC1C,MAAM,OAAO,SAAS;GACtB,MAAM,WAAW,SAAS,YAAY;AACtC,OACE,KAAK,iBAAiB,SAAS,QAC/B,KAAK,gBAAgB,SAAS,KAE9B,UAAS,cAAc;YACd,KAAK,iBAAiB,SAAS,KACxC,UAAS,cAAc;YACd,KAAK,gBAAgB,SAAS,KACvC,UAAS,cAAc;AAEzB,OAAI,MAAM;IACR,MAAM,eAAe,OAAO,SAAS,WAAW,OAAO,IAAI;IAC3D,MAAM,mBACJ,UAAU,SAAS,SACf,UAAU,KAAK,SAAS;KACtB,GAAG;KACH,MAAM;SAER,KAAK,SAAS;AACpB,qBAAiB;AACjB,qBAAiB;AACjB,QAAI,OAAO,KAAK,iBAAiB,OAAO,SAAS,GAAG;KAClD,MAAM,CAAC,GAAG,KAAK,MAAM,OAAO,kBAAkB;AAC9C,SAAI,MAAM,OACR,OAAM,IAAI,MACR,8BAA8B,IAAI;KAMtC,SAAS,qBAEP,OAC4B;AAC5B,aAAO,QAAQ,MAAM,cAAc;;KAGrC,SAAS,aACP,IACA,MACQ;AACR,UAAI,OAAO,UAAa,CAACC,SAAO,IAC9B,QAAO;eACE,qBAAqB,MAC9B,KAAI;OACF,IAAI,UAAU,KAAK;AACnB,iBAAU,QAAQ,WAAW,cACzB,QAAQ,MAAM,KACd;AACJ,cAAO;eACA,OAAO;AACd,cAAO,KAAK;;UAGd,QAAO,KAAK,QAAQ;;AAIxB,SAAI,MAAM,OACR,YAAW,cAAc;MACvB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;AAGP,cAAS,cAAc;MACrB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;WAEA;KAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,gBAAW,cAAc;AACzB,cAAS,cAAc;;UAEpB;IAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,eAAW,cAAc;AACzB,aAAS,cAAc;;;EAG3B,MAAM,cAAc,CAAC,GAAG,KAAK,QAAQ,UAAU,MAAM,CAAC,IAAI,CAAC,OAAO;AAChE,OAAI,IAAI,EACN,QAAO;YACE,IAAI,EACb,QAAO;OAEP,QAAO;;AAGX,OAAK,MAAM,CAAC,OAAO,QAAQ,YACzB,SAAQ,uBAAuB,QAAQ,uBAAuB;AAEhE,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,QAAQ,WAAW;GACrE,MAAMC,cAAsC;IAC1C,GAAG,OAAO,YACR,OAAO,KAAK,KAAK,QAAQ,OACtB,QAAQ,MAAM,MAAM,OACpB,KAAK,MAAM,CAAC,uBAAuB,IAAI,uBAAuB;KAElE,MAAM;;AAET,QAAK,MAAM,UAAU,OAAO,OAAO,WAAW;IAC5C,IAAI;AACJ,QAAI,OAAO,SAAS,OAClB,QAAO,OAAO;QAEd,QAAO;AAET,SAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,MACxC,SACE,uBAAuB,QACvB,uBAAuB,MACvB,OACA;;;AAKR,SAAO;;;AAKX,SAAS,gBAAgB,GAAqC;AAC5D,QAEE,OAAQ,EAAyB,eAAe,cAEhD,OAAQ,EAAyB,eAAe;;AAIpD,SAAS,uBAAuB,KAAa;AAC3C,KAAI,QAAQ,WACV,QAAO,IAAI,IAAI;AAEjB,QAAO"}
1
+ {"version":3,"file":"graph.js","names":["e: any","destinations: (string | Send)[]","Graph","args","options: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n >","name","DrawableGraph","startNodes: Record<string, DrawableGraphNode>","endNodes: Record<string, DrawableGraphNode>","subgraphs: Record<string, CompiledGraph<any>>","isUuid","defaultEnds: Record<string, string>"],"sources":["../../src/graph/graph.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-use-before-define */\nimport {\n _coerceToRunnable,\n Runnable,\n RunnableConfig,\n RunnableInterface,\n RunnableIOSchema,\n type RunnableLike as LangChainRunnableLike,\n} from \"@langchain/core/runnables\";\nimport {\n Node as DrawableGraphNode,\n Graph as DrawableGraph,\n} from \"@langchain/core/runnables/graph\";\nimport { All, BaseCheckpointSaver } from \"@langchain/langgraph-checkpoint\";\nimport { z } from \"zod/v4\";\nimport { validate as isUuid } from \"uuid\";\nimport type {\n RunnableLike,\n LangGraphRunnableConfig,\n} from \"../pregel/runnable_types.js\";\nimport { PregelNode } from \"../pregel/read.js\";\nimport { Channel, Pregel } from \"../pregel/index.js\";\nimport type { PregelParams } from \"../pregel/types.js\";\nimport { BaseChannel } from \"../channels/base.js\";\nimport { EphemeralValue } from \"../channels/ephemeral_value.js\";\nimport { ChannelWrite, PASSTHROUGH } from \"../pregel/write.js\";\nimport {\n _isSend,\n CHECKPOINT_NAMESPACE_END,\n CHECKPOINT_NAMESPACE_SEPARATOR,\n END,\n Send,\n START,\n TAG_HIDDEN,\n} from \"../constants.js\";\nimport {\n gatherIterator,\n gatherIteratorSync,\n RunnableCallable,\n} from \"../utils.js\";\nimport {\n InvalidUpdateError,\n NodeInterrupt,\n UnreachableNodeError,\n} from \"../errors.js\";\nimport { StateDefinition, StateType } from \"./annotation.js\";\nimport { isPregelLike } from \"../pregel/utils/subgraph.js\";\n\nexport interface BranchOptions<\n IO,\n N extends string,\n CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig\n> {\n source: N;\n path: RunnableLike<IO, BranchPathReturnValue, CallOptions>;\n pathMap?: Record<string, N | typeof END> | (N | typeof END)[];\n}\n\nexport type BranchPathReturnValue =\n | string\n | Send\n | (string | Send)[]\n | Promise<string | Send | (string | Send)[]>;\n\ntype NodeAction<S, U, C extends StateDefinition> = RunnableLike<\n S,\n U extends object ? U & Record<string, any> : U, // eslint-disable-line @typescript-eslint/no-explicit-any\n LangGraphRunnableConfig<StateType<C>>\n>;\n\nexport class Branch<\n IO,\n N extends string,\n CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig\n> {\n path: Runnable<IO, BranchPathReturnValue, CallOptions>;\n\n ends?: Record<string, N | typeof END>;\n\n constructor(options: Omit<BranchOptions<IO, N, CallOptions>, \"source\">) {\n if (Runnable.isRunnable(options.path)) {\n this.path = options.path as Runnable<\n IO,\n BranchPathReturnValue,\n CallOptions\n >;\n } else {\n this.path = _coerceToRunnable(\n options.path as LangChainRunnableLike<\n IO,\n BranchPathReturnValue,\n CallOptions\n >\n ).withConfig({ runName: `Branch` } as CallOptions);\n }\n this.ends = Array.isArray(options.pathMap)\n ? options.pathMap.reduce((acc, n) => {\n acc[n] = n;\n return acc;\n }, {} as Record<string, N | typeof END>)\n : options.pathMap;\n }\n\n run(\n writer: (\n dests: (string | Send)[],\n config: LangGraphRunnableConfig\n ) => Runnable | void | Promise<void>,\n reader?: (config: CallOptions) => IO\n ) {\n return ChannelWrite.registerWriter(\n new RunnableCallable({\n name: \"<branch_run>\",\n trace: false,\n func: async (input: IO, config: CallOptions) => {\n try {\n return await this._route(input, config, writer, reader);\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n } catch (e: any) {\n // Detect & warn if NodeInterrupt is thrown in a conditional edge\n if (e.name === NodeInterrupt.unminifiable_name) {\n console.warn(\n \"[WARN]: 'NodeInterrupt' thrown in conditional edge. This is likely a bug in your graph implementation.\\n\" +\n \"NodeInterrupt should only be thrown inside a node, not in edge conditions.\"\n );\n }\n throw e;\n }\n },\n })\n );\n }\n\n async _route(\n input: IO,\n config: CallOptions,\n writer: (\n dests: (string | Send)[],\n config: LangGraphRunnableConfig\n ) => Runnable | void | Promise<void>,\n reader?: (config: CallOptions) => IO\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n ): Promise<Runnable | any> {\n let result = await this.path.invoke(\n reader ? reader(config) : input,\n config\n );\n if (!Array.isArray(result)) {\n result = [result];\n }\n\n let destinations: (string | Send)[];\n if (this.ends) {\n destinations = result.map((r) => (_isSend(r) ? r : this.ends![r]));\n } else {\n destinations = result;\n }\n if (destinations.some((dest) => !dest)) {\n throw new Error(\"Branch condition returned unknown or null destination\");\n }\n if (destinations.filter(_isSend).some((packet) => packet.node === END)) {\n throw new InvalidUpdateError(\"Cannot send a packet to the END node\");\n }\n const writeResult = await writer(destinations, config);\n return writeResult ?? input;\n }\n}\n\nexport type NodeSpec<RunInput, RunOutput> = {\n runnable: Runnable<RunInput, RunOutput>;\n metadata?: Record<string, unknown>;\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n subgraphs?: Pregel<any, any>[];\n ends?: string[];\n defer?: boolean;\n};\n\nexport type AddNodeOptions<Nodes extends string = string> = {\n metadata?: Record<string, unknown>;\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n subgraphs?: Pregel<any, any>[];\n ends?: Nodes[];\n defer?: boolean;\n};\n\nexport class Graph<\n N extends string = typeof START | typeof END,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n RunInput = any,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n RunOutput = any,\n NodeSpecType extends NodeSpec<RunInput, RunOutput> = NodeSpec<\n RunInput,\n RunOutput\n >,\n C extends StateDefinition = StateDefinition\n> {\n nodes: Record<N, NodeSpecType>;\n\n edges: Set<[N | typeof START, N | typeof END]>;\n\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n branches: Record<string, Record<string, Branch<RunInput, N, any>>>;\n\n entryPoint?: string;\n\n compiled = false;\n\n constructor() {\n this.nodes = {} as Record<N, NodeSpecType>;\n this.edges = new Set();\n this.branches = {};\n }\n\n protected warnIfCompiled(message: string): void {\n if (this.compiled) {\n console.warn(message);\n }\n }\n\n get allEdges(): Set<[string, string]> {\n return this.edges;\n }\n\n addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(\n nodes:\n | Record<K, NodeAction<NodeInput, NodeOutput, C>>\n | [\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ][]\n ): Graph<N | K, RunInput, RunOutput>;\n\n addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ): Graph<N | K, RunInput, RunOutput>;\n\n addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(\n ...args:\n | [\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ]\n | [\n nodes:\n | Record<K, NodeAction<NodeInput, NodeOutput, C>>\n | [\n key: K,\n action: NodeAction<NodeInput, NodeOutput, C>,\n options?: AddNodeOptions\n ][]\n ]\n ): Graph<N | K, RunInput, RunOutput> {\n function isMutlipleNodes(\n args: unknown[]\n ): args is [\n nodes:\n | Record<K, NodeAction<NodeInput, RunOutput, C>>\n | [\n key: K,\n action: NodeAction<NodeInput, RunOutput, C>,\n options?: AddNodeOptions\n ][],\n options?: AddNodeOptions\n ] {\n return args.length >= 1 && typeof args[0] !== \"string\";\n }\n\n const nodes = (\n isMutlipleNodes(args) // eslint-disable-line no-nested-ternary\n ? Array.isArray(args[0])\n ? args[0]\n : Object.entries(args[0])\n : [[args[0], args[1], args[2]]]\n ) as [K, NodeAction<NodeInput, RunOutput, C>, AddNodeOptions][];\n\n if (nodes.length === 0) {\n throw new Error(\"No nodes provided in `addNode`\");\n }\n\n for (const [key, action, options] of nodes) {\n for (const reservedChar of [\n CHECKPOINT_NAMESPACE_SEPARATOR,\n CHECKPOINT_NAMESPACE_END,\n ]) {\n if (key.includes(reservedChar)) {\n throw new Error(\n `\"${reservedChar}\" is a reserved character and is not allowed in node names.`\n );\n }\n }\n this.warnIfCompiled(\n `Adding a node to a graph that has already been compiled. This will not be reflected in the compiled graph.`\n );\n\n if (key in this.nodes) {\n throw new Error(`Node \\`${key}\\` already present.`);\n }\n if (key === END) {\n throw new Error(`Node \\`${key}\\` is reserved.`);\n }\n\n const runnable = _coerceToRunnable<RunInput, RunOutput>(\n // Account for arbitrary state due to Send API\n action as RunnableLike<RunInput, RunOutput>\n );\n\n this.nodes[key as unknown as N] = {\n runnable,\n metadata: options?.metadata,\n subgraphs: isPregelLike(runnable) ? [runnable] : options?.subgraphs,\n ends: options?.ends,\n } as NodeSpecType;\n }\n\n return this as Graph<N | K, RunInput, RunOutput, NodeSpecType>;\n }\n\n addEdge(startKey: N | typeof START, endKey: N | typeof END): this {\n this.warnIfCompiled(\n `Adding an edge to a graph that has already been compiled. This will not be reflected in the compiled graph.`\n );\n\n if (startKey === END) {\n throw new Error(\"END cannot be a start node\");\n }\n if (endKey === START) {\n throw new Error(\"START cannot be an end node\");\n }\n if (\n Array.from(this.edges).some(([start]) => start === startKey) &&\n !(\"channels\" in this)\n ) {\n throw new Error(\n `Already found path for ${startKey}. For multiple edges, use StateGraph.`\n );\n }\n\n this.edges.add([startKey, endKey]);\n\n return this;\n }\n\n addConditionalEdges(\n source: BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>\n ): this;\n\n addConditionalEdges(\n source: N,\n path: RunnableLike<\n RunInput,\n BranchPathReturnValue,\n LangGraphRunnableConfig<StateType<C>>\n >,\n pathMap?: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n >[\"pathMap\"]\n ): this;\n\n addConditionalEdges(\n source:\n | N\n | BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>,\n path?: RunnableLike<\n RunInput,\n BranchPathReturnValue,\n LangGraphRunnableConfig<StateType<C>>\n >,\n pathMap?: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n >[\"pathMap\"]\n ): this {\n const options: BranchOptions<\n RunInput,\n N,\n LangGraphRunnableConfig<StateType<C>>\n > = typeof source === \"object\" ? source : { source, path: path!, pathMap };\n\n this.warnIfCompiled(\n \"Adding an edge to a graph that has already been compiled. This will not be reflected in the compiled graph.\"\n );\n if (!Runnable.isRunnable(options.path)) {\n const pathDisplayValues = Array.isArray(options.pathMap)\n ? options.pathMap.join(\",\")\n : Object.keys(options.pathMap ?? {}).join(\",\");\n options.path = _coerceToRunnable(\n options.path as LangChainRunnableLike<\n RunInput,\n BranchPathReturnValue,\n LangGraphRunnableConfig<StateType<C>>\n >\n ).withConfig({\n runName: `Branch<${options.source}${\n pathDisplayValues !== \"\" ? `,${pathDisplayValues}` : \"\"\n }>`.slice(0, 63),\n });\n }\n // find a name for condition\n const name =\n options.path.getName() === \"RunnableLambda\"\n ? \"condition\"\n : options.path.getName();\n // validate condition\n if (this.branches[options.source] && this.branches[options.source][name]) {\n throw new Error(\n `Condition \\`${name}\\` already present for node \\`${source}\\``\n );\n }\n // save it\n this.branches[options.source] ??= {};\n this.branches[options.source][name] = new Branch(options);\n return this;\n }\n\n /**\n * @deprecated use `addEdge(START, key)` instead\n */\n setEntryPoint(key: N): this {\n this.warnIfCompiled(\n \"Setting the entry point of a graph that has already been compiled. This will not be reflected in the compiled graph.\"\n );\n\n return this.addEdge(START, key);\n }\n\n /**\n * @deprecated use `addEdge(key, END)` instead\n */\n setFinishPoint(key: N): this {\n this.warnIfCompiled(\n \"Setting a finish point of a graph that has already been compiled. This will not be reflected in the compiled graph.\"\n );\n\n return this.addEdge(key, END);\n }\n\n compile({\n checkpointer,\n interruptBefore,\n interruptAfter,\n name,\n }: {\n checkpointer?: BaseCheckpointSaver | false;\n interruptBefore?: N[] | All;\n interruptAfter?: N[] | All;\n name?: string;\n } = {}): CompiledGraph<N> {\n // validate the graph\n this.validate([\n ...(Array.isArray(interruptBefore) ? interruptBefore : []),\n ...(Array.isArray(interruptAfter) ? interruptAfter : []),\n ]);\n\n // create empty compiled graph\n const compiled = new CompiledGraph({\n builder: this,\n checkpointer,\n interruptAfter,\n interruptBefore,\n autoValidate: false,\n nodes: {} as Record<N | typeof START, PregelNode<RunInput, RunOutput>>,\n channels: {\n [START]: new EphemeralValue(),\n [END]: new EphemeralValue(),\n } as Record<N | typeof START | typeof END | string, BaseChannel>,\n inputChannels: START,\n outputChannels: END,\n streamChannels: [] as N[],\n streamMode: \"values\",\n name,\n });\n\n // attach nodes, edges and branches\n for (const [key, node] of Object.entries<NodeSpec<RunInput, RunOutput>>(\n this.nodes\n )) {\n compiled.attachNode(key as N, node);\n }\n for (const [start, end] of this.edges) {\n compiled.attachEdge(start, end);\n }\n for (const [start, branches] of Object.entries(this.branches)) {\n for (const [name, branch] of Object.entries(branches)) {\n compiled.attachBranch(start as N, name, branch);\n }\n }\n\n return compiled.validate();\n }\n\n validate(interrupt?: string[]): void {\n // assemble sources\n const allSources = new Set([...this.allEdges].map(([src, _]) => src));\n for (const [start] of Object.entries(this.branches)) {\n allSources.add(start);\n }\n\n // validate sources\n for (const source of allSources) {\n if (source !== START && !(source in this.nodes)) {\n throw new Error(`Found edge starting at unknown node \\`${source}\\``);\n }\n }\n\n // assemble targets\n const allTargets = new Set([...this.allEdges].map(([_, target]) => target));\n for (const [start, branches] of Object.entries(this.branches)) {\n for (const branch of Object.values(branches)) {\n if (branch.ends != null) {\n for (const end of Object.values(branch.ends)) {\n allTargets.add(end);\n }\n } else {\n allTargets.add(END);\n for (const node of Object.keys(this.nodes)) {\n if (node !== start) {\n allTargets.add(node);\n }\n }\n }\n }\n }\n for (const node of Object.values<NodeSpecType>(this.nodes)) {\n for (const target of node.ends ?? []) {\n allTargets.add(target);\n }\n }\n // validate targets\n for (const node of Object.keys(this.nodes)) {\n if (!allTargets.has(node)) {\n throw new UnreachableNodeError(\n [\n `Node \\`${node}\\` is not reachable.`,\n \"\",\n \"If you are returning Command objects from your node,\",\n 'make sure you are passing names of potential destination nodes as an \"ends\" array',\n 'into \".addNode(..., { ends: [\"node1\", \"node2\"] })\".',\n ].join(\"\\n\"),\n {\n lc_error_code: \"UNREACHABLE_NODE\",\n }\n );\n }\n }\n for (const target of allTargets) {\n if (target !== END && !(target in this.nodes)) {\n throw new Error(`Found edge ending at unknown node \\`${target}\\``);\n }\n }\n\n // validate interrupts\n if (interrupt) {\n for (const node of interrupt) {\n if (!(node in this.nodes)) {\n throw new Error(`Interrupt node \\`${node}\\` is not present`);\n }\n }\n }\n\n this.compiled = true;\n }\n}\n\nexport class CompiledGraph<\n N extends string,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n State = any,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n Update = any,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n ContextType extends Record<string, any> = Record<string, any>,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n InputType = any,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n OutputType = any,\n NodeReturnType = unknown,\n CommandType = unknown,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n StreamCustomType = any\n> extends Pregel<\n Record<N | typeof START, PregelNode<State, Update>>,\n Record<N | typeof START | typeof END | string, BaseChannel>,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n ContextType & Record<string, any>,\n InputType,\n OutputType,\n InputType,\n OutputType,\n NodeReturnType,\n CommandType,\n StreamCustomType\n> {\n declare NodeType: N;\n\n declare \"~NodeReturnType\": NodeReturnType;\n\n declare RunInput: State;\n\n declare RunOutput: Update;\n\n builder: Graph<N, State, Update>;\n\n constructor({\n builder,\n ...rest\n }: { builder: Graph<N, State, Update> } & PregelParams<\n Record<N | typeof START, PregelNode<State, Update>>,\n Record<N | typeof START | typeof END | string, BaseChannel>\n >) {\n super(rest);\n this.builder = builder;\n }\n\n attachNode(key: N, node: NodeSpec<State, Update>): void {\n this.channels[key] = new EphemeralValue();\n this.nodes[key] = new PregelNode({\n channels: [],\n triggers: [],\n metadata: node.metadata,\n subgraphs: node.subgraphs,\n ends: node.ends,\n })\n .pipe(node.runnable)\n .pipe(\n new ChannelWrite([{ channel: key, value: PASSTHROUGH }], [TAG_HIDDEN])\n );\n (this.streamChannels as N[]).push(key);\n }\n\n attachEdge(start: N | typeof START, end: N | typeof END): void {\n if (end === END) {\n if (start === START) {\n throw new Error(\"Cannot have an edge from START to END\");\n }\n this.nodes[start].writers.push(\n new ChannelWrite([{ channel: END, value: PASSTHROUGH }], [TAG_HIDDEN])\n );\n } else {\n this.nodes[end].triggers.push(start);\n (this.nodes[end].channels as string[]).push(start);\n }\n }\n\n attachBranch(\n start: N | typeof START,\n name: string,\n branch: Branch<State, N>\n ) {\n // add hidden start node\n if (start === START && !this.nodes[START]) {\n this.nodes[START] = Channel.subscribeTo(START, { tags: [TAG_HIDDEN] });\n }\n\n // attach branch writer\n this.nodes[start].pipe(\n branch.run((dests) => {\n const writes = dests.map((dest) => {\n if (_isSend(dest)) {\n return dest;\n }\n return {\n channel: dest === END ? END : `branch:${start}:${name}:${dest}`,\n value: PASSTHROUGH,\n };\n });\n return new ChannelWrite(writes, [TAG_HIDDEN]);\n })\n );\n\n // attach branch readers\n const ends = branch.ends\n ? Object.values(branch.ends)\n : (Object.keys(this.nodes) as N[]);\n for (const end of ends) {\n if (end !== END) {\n const channelName = `branch:${start}:${name}:${end}`;\n (this.channels as Record<string, BaseChannel>)[channelName] =\n new EphemeralValue();\n this.nodes[end].triggers.push(channelName);\n (this.nodes[end].channels as string[]).push(channelName);\n }\n }\n }\n\n /**\n * Returns a drawable representation of the computation graph.\n */\n override async getGraphAsync(\n config?: RunnableConfig & { xray?: boolean | number }\n ): Promise<DrawableGraph> {\n const xray = config?.xray;\n const graph = new DrawableGraph();\n const startNodes: Record<string, DrawableGraphNode> = {\n [START]: graph.addNode({ schema: z.any() }, START),\n };\n const endNodes: Record<string, DrawableGraphNode> = {};\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n let subgraphs: Record<string, CompiledGraph<any>> = {};\n if (xray) {\n subgraphs = Object.fromEntries(\n (await gatherIterator(this.getSubgraphsAsync())).filter(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n (x): x is [string, CompiledGraph<any>] => isCompiledGraph(x[1])\n )\n );\n }\n\n function addEdge(\n start: string,\n end: string,\n label?: string,\n conditional = false\n ) {\n if (end === END && endNodes[END] === undefined) {\n endNodes[END] = graph.addNode({ schema: z.any() }, END);\n }\n if (startNodes[start] === undefined) {\n return;\n }\n if (endNodes[end] === undefined) {\n throw new Error(`End node ${end} not found!`);\n }\n return graph.addEdge(\n startNodes[start],\n endNodes[end],\n label !== end ? label : undefined,\n conditional\n );\n }\n\n for (const [key, nodeSpec] of Object.entries(this.builder.nodes) as [\n N,\n NodeSpec<State, Update>\n ][]) {\n const displayKey = _escapeMermaidKeywords(key);\n const node = nodeSpec.runnable;\n const metadata = nodeSpec.metadata ?? {};\n if (\n this.interruptBefore?.includes(key) &&\n this.interruptAfter?.includes(key)\n ) {\n metadata.__interrupt = \"before,after\";\n } else if (this.interruptBefore?.includes(key)) {\n metadata.__interrupt = \"before\";\n } else if (this.interruptAfter?.includes(key)) {\n metadata.__interrupt = \"after\";\n }\n if (xray) {\n const newXrayValue = typeof xray === \"number\" ? xray - 1 : xray;\n const drawableSubgraph =\n subgraphs[key] !== undefined\n ? await subgraphs[key].getGraphAsync({\n ...config,\n xray: newXrayValue,\n })\n : node.getGraph(config);\n\n drawableSubgraph.trimFirstNode();\n drawableSubgraph.trimLastNode();\n\n if (Object.keys(drawableSubgraph.nodes).length > 1) {\n const [e, s] = graph.extend(drawableSubgraph, displayKey);\n if (e === undefined) {\n throw new Error(\n `Could not extend subgraph \"${key}\" due to missing entrypoint.`\n );\n }\n\n // TODO: Remove default name once we stop supporting core 0.2.0\n // eslint-disable-next-line no-inner-declarations\n function _isRunnableInterface(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n thing: any\n ): thing is RunnableInterface {\n return thing ? thing.lc_runnable : false;\n }\n // eslint-disable-next-line no-inner-declarations\n function _nodeDataStr(\n id: string | undefined,\n data: RunnableInterface | RunnableIOSchema\n ): string {\n if (id !== undefined && !isUuid(id)) {\n return id;\n } else if (_isRunnableInterface(data)) {\n try {\n let dataStr = data.getName();\n dataStr = dataStr.startsWith(\"Runnable\")\n ? dataStr.slice(\"Runnable\".length)\n : dataStr;\n return dataStr;\n } catch (error) {\n return data.getName();\n }\n } else {\n return data.name ?? \"UnknownSchema\";\n }\n }\n // TODO: Remove casts when we stop supporting core 0.2.0\n if (s !== undefined) {\n startNodes[displayKey] = {\n name: _nodeDataStr(s.id, s.data),\n ...s,\n } as DrawableGraphNode;\n }\n endNodes[displayKey] = {\n name: _nodeDataStr(e.id, e.data),\n ...e,\n } as DrawableGraphNode;\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n }\n const sortedEdges = [...this.builder.allEdges].sort(([a], [b]) => {\n if (a < b) {\n return -1;\n } else if (b > a) {\n return 1;\n } else {\n return 0;\n }\n });\n for (const [start, end] of sortedEdges) {\n addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end));\n }\n for (const [start, branches] of Object.entries(this.builder.branches)) {\n const defaultEnds: Record<string, string> = {\n ...Object.fromEntries(\n Object.keys(this.builder.nodes)\n .filter((k) => k !== start)\n .map((k) => [_escapeMermaidKeywords(k), _escapeMermaidKeywords(k)])\n ),\n [END]: END,\n };\n for (const branch of Object.values(branches)) {\n let ends;\n if (branch.ends !== undefined) {\n ends = branch.ends;\n } else {\n ends = defaultEnds;\n }\n for (const [label, end] of Object.entries(ends)) {\n addEdge(\n _escapeMermaidKeywords(start),\n _escapeMermaidKeywords(end),\n label,\n true\n );\n }\n }\n }\n for (const [key, node] of Object.entries(this.builder.nodes) as [\n N,\n NodeSpec<State, Update>\n ][]) {\n if (node.ends !== undefined) {\n for (const end of node.ends) {\n addEdge(\n _escapeMermaidKeywords(key),\n _escapeMermaidKeywords(end),\n undefined,\n true\n );\n }\n }\n }\n return graph;\n }\n\n /**\n * Returns a drawable representation of the computation graph.\n *\n * @deprecated Use getGraphAsync instead. The async method will be the default in the next minor core release.\n */\n override getGraph(\n config?: RunnableConfig & { xray?: boolean | number }\n ): DrawableGraph {\n const xray = config?.xray;\n const graph = new DrawableGraph();\n const startNodes: Record<string, DrawableGraphNode> = {\n [START]: graph.addNode(\n {\n schema: z.any(),\n },\n START\n ),\n };\n const endNodes: Record<string, DrawableGraphNode> = {};\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n let subgraphs: Record<string, CompiledGraph<any>> = {};\n if (xray) {\n subgraphs = Object.fromEntries(\n gatherIteratorSync(this.getSubgraphs()).filter(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n (x): x is [string, CompiledGraph<any>] => isCompiledGraph(x[1])\n )\n );\n }\n\n function addEdge(\n start: string,\n end: string,\n label?: string,\n conditional = false\n ) {\n if (end === END && endNodes[END] === undefined) {\n endNodes[END] = graph.addNode({ schema: z.any() }, END);\n }\n return graph.addEdge(\n startNodes[start],\n endNodes[end],\n label !== end ? label : undefined,\n conditional\n );\n }\n\n for (const [key, nodeSpec] of Object.entries(this.builder.nodes) as [\n N,\n NodeSpec<State, Update>\n ][]) {\n const displayKey = _escapeMermaidKeywords(key);\n const node = nodeSpec.runnable;\n const metadata = nodeSpec.metadata ?? {};\n if (\n this.interruptBefore?.includes(key) &&\n this.interruptAfter?.includes(key)\n ) {\n metadata.__interrupt = \"before,after\";\n } else if (this.interruptBefore?.includes(key)) {\n metadata.__interrupt = \"before\";\n } else if (this.interruptAfter?.includes(key)) {\n metadata.__interrupt = \"after\";\n }\n if (xray) {\n const newXrayValue = typeof xray === \"number\" ? xray - 1 : xray;\n const drawableSubgraph =\n subgraphs[key] !== undefined\n ? subgraphs[key].getGraph({\n ...config,\n xray: newXrayValue,\n })\n : node.getGraph(config);\n drawableSubgraph.trimFirstNode();\n drawableSubgraph.trimLastNode();\n if (Object.keys(drawableSubgraph.nodes).length > 1) {\n const [e, s] = graph.extend(drawableSubgraph, displayKey);\n if (e === undefined) {\n throw new Error(\n `Could not extend subgraph \"${key}\" due to missing entrypoint.`\n );\n }\n\n // TODO: Remove default name once we stop supporting core 0.2.0\n // eslint-disable-next-line no-inner-declarations\n function _isRunnableInterface(\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n thing: any\n ): thing is RunnableInterface {\n return thing ? thing.lc_runnable : false;\n }\n // eslint-disable-next-line no-inner-declarations\n function _nodeDataStr(\n id: string | undefined,\n data: RunnableInterface | RunnableIOSchema\n ): string {\n if (id !== undefined && !isUuid(id)) {\n return id;\n } else if (_isRunnableInterface(data)) {\n try {\n let dataStr = data.getName();\n dataStr = dataStr.startsWith(\"Runnable\")\n ? dataStr.slice(\"Runnable\".length)\n : dataStr;\n return dataStr;\n } catch (error) {\n return data.getName();\n }\n } else {\n return data.name ?? \"UnknownSchema\";\n }\n }\n // TODO: Remove casts when we stop supporting core 0.2.0\n if (s !== undefined) {\n startNodes[displayKey] = {\n name: _nodeDataStr(s.id, s.data),\n ...s,\n } as DrawableGraphNode;\n }\n endNodes[displayKey] = {\n name: _nodeDataStr(e.id, e.data),\n ...e,\n } as DrawableGraphNode;\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n } else {\n // TODO: Remove when we stop supporting core 0.2.0\n // eslint-disable-next-line @typescript-eslint/ban-ts-comment\n // @ts-ignore\n const newNode = graph.addNode(node, displayKey, metadata);\n startNodes[displayKey] = newNode;\n endNodes[displayKey] = newNode;\n }\n }\n const sortedEdges = [...this.builder.allEdges].sort(([a], [b]) => {\n if (a < b) {\n return -1;\n } else if (b > a) {\n return 1;\n } else {\n return 0;\n }\n });\n for (const [start, end] of sortedEdges) {\n addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end));\n }\n for (const [start, branches] of Object.entries(this.builder.branches)) {\n const defaultEnds: Record<string, string> = {\n ...Object.fromEntries(\n Object.keys(this.builder.nodes)\n .filter((k) => k !== start)\n .map((k) => [_escapeMermaidKeywords(k), _escapeMermaidKeywords(k)])\n ),\n [END]: END,\n };\n for (const branch of Object.values(branches)) {\n let ends;\n if (branch.ends !== undefined) {\n ends = branch.ends;\n } else {\n ends = defaultEnds;\n }\n for (const [label, end] of Object.entries(ends)) {\n addEdge(\n _escapeMermaidKeywords(start),\n _escapeMermaidKeywords(end),\n label,\n true\n );\n }\n }\n }\n return graph;\n }\n}\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction isCompiledGraph(x: unknown): x is CompiledGraph<any> {\n return (\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n typeof (x as CompiledGraph<any>).attachNode === \"function\" &&\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n typeof (x as CompiledGraph<any>).attachEdge === \"function\"\n );\n}\n\nfunction _escapeMermaidKeywords(key: string) {\n if (key === \"subgraph\") {\n return `\"${key}\"`;\n }\n return key;\n}\n"],"mappings":";;;;;;;;;;;;;;AAsEA,IAAa,SAAb,MAIE;CACA;CAEA;CAEA,YAAY,SAA4D;AACtE,MAAI,SAAS,WAAW,QAAQ,MAC9B,MAAK,OAAO,QAAQ;MAMpB,MAAK,OAAO,kBACV,QAAQ,MAKR,WAAW,EAAE,SAAS;AAE1B,OAAK,OAAO,MAAM,QAAQ,QAAQ,WAC9B,QAAQ,QAAQ,QAAQ,KAAK,MAAM;AACjC,OAAI,KAAK;AACT,UAAO;KACN,MACH,QAAQ;;CAGd,IACE,QAIA,QACA;AACA,SAAO,aAAa,eAClB,IAAI,iBAAiB;GACnB,MAAM;GACN,OAAO;GACP,MAAM,OAAO,OAAW,WAAwB;AAC9C,QAAI;AACF,YAAO,MAAM,KAAK,OAAO,OAAO,QAAQ,QAAQ;aAEzCA,GAAQ;AAEf,SAAI,EAAE,SAAS,cAAc,kBAC3B,SAAQ,KACN;AAIJ,WAAM;;;;;CAOhB,MAAM,OACJ,OACA,QACA,QAIA,QAEyB;EACzB,IAAI,SAAS,MAAM,KAAK,KAAK,OAC3B,SAAS,OAAO,UAAU,OAC1B;AAEF,MAAI,CAAC,MAAM,QAAQ,QACjB,UAAS,CAAC;EAGZ,IAAIC;AACJ,MAAI,KAAK,KACP,gBAAe,OAAO,KAAK,MAAO,QAAQ,KAAK,IAAI,KAAK,KAAM;MAE9D,gBAAe;AAEjB,MAAI,aAAa,MAAM,SAAS,CAAC,MAC/B,OAAM,IAAI,MAAM;AAElB,MAAI,aAAa,OAAO,SAAS,MAAM,WAAW,OAAO,SAAS,KAChE,OAAM,IAAI,mBAAmB;EAE/B,MAAM,cAAc,MAAM,OAAO,cAAc;AAC/C,SAAO,eAAe;;;AAqB1B,IAAaC,UAAb,MAWE;CACA;CAEA;CAGA;CAEA;CAEA,WAAW;CAEX,cAAc;AACZ,OAAK,QAAQ;AACb,OAAK,wBAAQ,IAAI;AACjB,OAAK,WAAW;;CAGlB,AAAU,eAAe,SAAuB;AAC9C,MAAI,KAAK,SACP,SAAQ,KAAK;;CAIjB,IAAI,WAAkC;AACpC,SAAO,KAAK;;CAmBd,QACE,GAAG,MAegC;EACnC,SAAS,gBACP,QAUA;AACA,UAAOC,OAAK,UAAU,KAAK,OAAOA,OAAK,OAAO;;EAGhD,MAAM,QACJ,gBAAgB,QACZ,MAAM,QAAQ,KAAK,MACjB,KAAK,KACL,OAAO,QAAQ,KAAK,MACtB,CAAC;GAAC,KAAK;GAAI,KAAK;GAAI,KAAK;;AAG/B,MAAI,MAAM,WAAW,EACnB,OAAM,IAAI,MAAM;AAGlB,OAAK,MAAM,CAAC,KAAK,QAAQ,YAAY,OAAO;AAC1C,QAAK,MAAM,gBAAgB,CACzB,gCACA,0BAEA,KAAI,IAAI,SAAS,cACf,OAAM,IAAI,MACR,IAAI,aAAa;AAIvB,QAAK,eACH;AAGF,OAAI,OAAO,KAAK,MACd,OAAM,IAAI,MAAM,UAAU,IAAI;AAEhC,OAAI,QAAQ,IACV,OAAM,IAAI,MAAM,UAAU,IAAI;GAGhC,MAAM,WAAW,kBAEf;AAGF,QAAK,MAAM,OAAuB;IAChC;IACA,UAAU,SAAS;IACnB,WAAW,aAAa,YAAY,CAAC,YAAY,SAAS;IAC1D,MAAM,SAAS;;;AAInB,SAAO;;CAGT,QAAQ,UAA4B,QAA8B;AAChE,OAAK,eACH;AAGF,MAAI,aAAa,IACf,OAAM,IAAI,MAAM;AAElB,MAAI,WAAW,MACb,OAAM,IAAI,MAAM;AAElB,MACE,MAAM,KAAK,KAAK,OAAO,MAAM,CAAC,WAAW,UAAU,aACnD,EAAE,cAAc,MAEhB,OAAM,IAAI,MACR,0BAA0B,SAAS;AAIvC,OAAK,MAAM,IAAI,CAAC,UAAU;AAE1B,SAAO;;CAqBT,oBACE,QAGA,MAKA,SAKM;EACN,MAAMC,UAIF,OAAO,WAAW,WAAW,SAAS;GAAE;GAAc;GAAO;;AAEjE,OAAK,eACH;AAEF,MAAI,CAAC,SAAS,WAAW,QAAQ,OAAO;GACtC,MAAM,oBAAoB,MAAM,QAAQ,QAAQ,WAC5C,QAAQ,QAAQ,KAAK,OACrB,OAAO,KAAK,QAAQ,WAAW,IAAI,KAAK;AAC5C,WAAQ,OAAO,kBACb,QAAQ,MAKR,WAAW,EACX,SAAS,UAAU,QAAQ,SACzB,sBAAsB,KAAK,IAAI,sBAAsB,GACtD,GAAG,MAAM,GAAG;;EAIjB,MAAM,OACJ,QAAQ,KAAK,cAAc,mBACvB,cACA,QAAQ,KAAK;AAEnB,MAAI,KAAK,SAAS,QAAQ,WAAW,KAAK,SAAS,QAAQ,QAAQ,MACjE,OAAM,IAAI,MACR,eAAe,KAAK,gCAAgC,OAAO;AAI/D,OAAK,SAAS,QAAQ,YAAY;AAClC,OAAK,SAAS,QAAQ,QAAQ,QAAQ,IAAI,OAAO;AACjD,SAAO;;;;;CAMT,cAAc,KAAc;AAC1B,OAAK,eACH;AAGF,SAAO,KAAK,QAAQ,OAAO;;;;;CAM7B,eAAe,KAAc;AAC3B,OAAK,eACH;AAGF,SAAO,KAAK,QAAQ,KAAK;;CAG3B,QAAQ,EACN,cACA,iBACA,gBACA,SAME,IAAsB;AAExB,OAAK,SAAS,CACZ,GAAI,MAAM,QAAQ,mBAAmB,kBAAkB,IACvD,GAAI,MAAM,QAAQ,kBAAkB,iBAAiB;EAIvD,MAAM,WAAW,IAAI,cAAc;GACjC,SAAS;GACT;GACA;GACA;GACA,cAAc;GACd,OAAO;GACP,UAAU;KACP,QAAQ,IAAI;KACZ,MAAM,IAAI;;GAEb,eAAe;GACf,gBAAgB;GAChB,gBAAgB;GAChB,YAAY;GACZ;;AAIF,OAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAC/B,KAAK,OAEL,UAAS,WAAW,KAAU;AAEhC,OAAK,MAAM,CAAC,OAAO,QAAQ,KAAK,MAC9B,UAAS,WAAW,OAAO;AAE7B,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,UAClD,MAAK,MAAM,CAACC,QAAM,WAAW,OAAO,QAAQ,UAC1C,UAAS,aAAa,OAAYA,QAAM;AAI5C,SAAO,SAAS;;CAGlB,SAAS,WAA4B;EAEnC,MAAM,aAAa,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,KAAK,CAAC,KAAK,OAAO;AAChE,OAAK,MAAM,CAAC,UAAU,OAAO,QAAQ,KAAK,UACxC,YAAW,IAAI;AAIjB,OAAK,MAAM,UAAU,WACnB,KAAI,WAAW,SAAS,EAAE,UAAU,KAAK,OACvC,OAAM,IAAI,MAAM,yCAAyC,OAAO;EAKpE,MAAM,aAAa,IAAI,IAAI,CAAC,GAAG,KAAK,UAAU,KAAK,CAAC,GAAG,YAAY;AACnE,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,UAClD,MAAK,MAAM,UAAU,OAAO,OAAO,UACjC,KAAI,OAAO,QAAQ,KACjB,MAAK,MAAM,OAAO,OAAO,OAAO,OAAO,MACrC,YAAW,IAAI;OAEZ;AACL,cAAW,IAAI;AACf,QAAK,MAAM,QAAQ,OAAO,KAAK,KAAK,OAClC,KAAI,SAAS,MACX,YAAW,IAAI;;AAMzB,OAAK,MAAM,QAAQ,OAAO,OAAqB,KAAK,OAClD,MAAK,MAAM,UAAU,KAAK,QAAQ,GAChC,YAAW,IAAI;AAInB,OAAK,MAAM,QAAQ,OAAO,KAAK,KAAK,OAClC,KAAI,CAAC,WAAW,IAAI,MAClB,OAAM,IAAI,qBACR;GACE,UAAU,KAAK;GACf;GACA;GACA;GACA;IACA,KAAK,OACP,EACE,eAAe;AAKvB,OAAK,MAAM,UAAU,WACnB,KAAI,WAAW,OAAO,EAAE,UAAU,KAAK,OACrC,OAAM,IAAI,MAAM,uCAAuC,OAAO;AAKlE,MAAI,WACF;QAAK,MAAM,QAAQ,UACjB,KAAI,EAAE,QAAQ,KAAK,OACjB,OAAM,IAAI,MAAM,oBAAoB,KAAK;;AAK/C,OAAK,WAAW;;;AAIpB,IAAa,gBAAb,cAgBU,OAYR;CASA;CAEA,YAAY,EACV,QACA,GAAG,QAIF;AACD,QAAM;AACN,OAAK,UAAU;;CAGjB,WAAW,KAAQ,MAAqC;AACtD,OAAK,SAAS,OAAO,IAAI;AACzB,OAAK,MAAM,OAAO,IAAI,WAAW;GAC/B,UAAU;GACV,UAAU;GACV,UAAU,KAAK;GACf,WAAW,KAAK;GAChB,MAAM,KAAK;KAEV,KAAK,KAAK,UACV,KACC,IAAI,aAAa,CAAC;GAAE,SAAS;GAAK,OAAO;MAAgB,CAAC;AAE9D,EAAC,KAAK,eAAuB,KAAK;;CAGpC,WAAW,OAAyB,KAA2B;AAC7D,MAAI,QAAQ,KAAK;AACf,OAAI,UAAU,MACZ,OAAM,IAAI,MAAM;AAElB,QAAK,MAAM,OAAO,QAAQ,KACxB,IAAI,aAAa,CAAC;IAAE,SAAS;IAAK,OAAO;OAAgB,CAAC;SAEvD;AACL,QAAK,MAAM,KAAK,SAAS,KAAK;AAC9B,GAAC,KAAK,MAAM,KAAK,SAAsB,KAAK;;;CAIhD,aACE,OACA,MACA,QACA;AAEA,MAAI,UAAU,SAAS,CAAC,KAAK,MAAM,OACjC,MAAK,MAAM,SAAS,QAAQ,YAAY,OAAO,EAAE,MAAM,CAAC;AAI1D,OAAK,MAAM,OAAO,KAChB,OAAO,KAAK,UAAU;GACpB,MAAM,SAAS,MAAM,KAAK,SAAS;AACjC,QAAI,QAAQ,MACV,QAAO;AAET,WAAO;KACL,SAAS,SAAS,MAAM,MAAM,UAAU,MAAM,GAAG,KAAK,GAAG;KACzD,OAAO;;;AAGX,UAAO,IAAI,aAAa,QAAQ,CAAC;;EAKrC,MAAM,OAAO,OAAO,OAChB,OAAO,OAAO,OAAO,QACpB,OAAO,KAAK,KAAK;AACtB,OAAK,MAAM,OAAO,KAChB,KAAI,QAAQ,KAAK;GACf,MAAM,cAAc,UAAU,MAAM,GAAG,KAAK,GAAG;AAC/C,GAAC,KAAK,SAAyC,eAC7C,IAAI;AACN,QAAK,MAAM,KAAK,SAAS,KAAK;AAC9B,GAAC,KAAK,MAAM,KAAK,SAAsB,KAAK;;;;;;CAQlD,MAAe,cACb,QACwB;EACxB,MAAM,OAAO,QAAQ;EACrB,MAAM,QAAQ,IAAIC;EAClB,MAAMC,aAAgD,GACnD,QAAQ,MAAM,QAAQ,EAAE,QAAQ,EAAE,SAAS;EAE9C,MAAMC,WAA8C;EAEpD,IAAIC,YAAgD;AACpD,MAAI,KACF,aAAY,OAAO,aAChB,MAAM,eAAe,KAAK,sBAAsB,QAE9C,MAAyC,gBAAgB,EAAE;EAKlE,SAAS,QACP,OACA,KACA,OACA,cAAc,OACd;AACA,OAAI,QAAQ,OAAO,SAAS,SAAS,OACnC,UAAS,OAAO,MAAM,QAAQ,EAAE,QAAQ,EAAE,SAAS;AAErD,OAAI,WAAW,WAAW,OACxB;AAEF,OAAI,SAAS,SAAS,OACpB,OAAM,IAAI,MAAM,YAAY,IAAI;AAElC,UAAO,MAAM,QACX,WAAW,QACX,SAAS,MACT,UAAU,MAAM,QAAQ,QACxB;;AAIJ,OAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,KAAK,QAAQ,QAGrD;GACH,MAAM,aAAa,uBAAuB;GAC1C,MAAM,OAAO,SAAS;GACtB,MAAM,WAAW,SAAS,YAAY;AACtC,OACE,KAAK,iBAAiB,SAAS,QAC/B,KAAK,gBAAgB,SAAS,KAE9B,UAAS,cAAc;YACd,KAAK,iBAAiB,SAAS,KACxC,UAAS,cAAc;YACd,KAAK,gBAAgB,SAAS,KACvC,UAAS,cAAc;AAEzB,OAAI,MAAM;IACR,MAAM,eAAe,OAAO,SAAS,WAAW,OAAO,IAAI;IAC3D,MAAM,mBACJ,UAAU,SAAS,SACf,MAAM,UAAU,KAAK,cAAc;KACjC,GAAG;KACH,MAAM;SAER,KAAK,SAAS;AAEpB,qBAAiB;AACjB,qBAAiB;AAEjB,QAAI,OAAO,KAAK,iBAAiB,OAAO,SAAS,GAAG;KAClD,MAAM,CAAC,GAAG,KAAK,MAAM,OAAO,kBAAkB;AAC9C,SAAI,MAAM,OACR,OAAM,IAAI,MACR,8BAA8B,IAAI;KAMtC,SAAS,qBAEP,OAC4B;AAC5B,aAAO,QAAQ,MAAM,cAAc;;KAGrC,SAAS,aACP,IACA,MACQ;AACR,UAAI,OAAO,UAAa,CAACC,SAAO,IAC9B,QAAO;eACE,qBAAqB,MAC9B,KAAI;OACF,IAAI,UAAU,KAAK;AACnB,iBAAU,QAAQ,WAAW,cACzB,QAAQ,MAAM,KACd;AACJ,cAAO;eACA,OAAO;AACd,cAAO,KAAK;;UAGd,QAAO,KAAK,QAAQ;;AAIxB,SAAI,MAAM,OACR,YAAW,cAAc;MACvB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;AAGP,cAAS,cAAc;MACrB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;WAEA;KAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,gBAAW,cAAc;AACzB,cAAS,cAAc;;UAEpB;IAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,eAAW,cAAc;AACzB,aAAS,cAAc;;;EAG3B,MAAM,cAAc,CAAC,GAAG,KAAK,QAAQ,UAAU,MAAM,CAAC,IAAI,CAAC,OAAO;AAChE,OAAI,IAAI,EACN,QAAO;YACE,IAAI,EACb,QAAO;OAEP,QAAO;;AAGX,OAAK,MAAM,CAAC,OAAO,QAAQ,YACzB,SAAQ,uBAAuB,QAAQ,uBAAuB;AAEhE,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,QAAQ,WAAW;GACrE,MAAMC,cAAsC;IAC1C,GAAG,OAAO,YACR,OAAO,KAAK,KAAK,QAAQ,OACtB,QAAQ,MAAM,MAAM,OACpB,KAAK,MAAM,CAAC,uBAAuB,IAAI,uBAAuB;KAElE,MAAM;;AAET,QAAK,MAAM,UAAU,OAAO,OAAO,WAAW;IAC5C,IAAI;AACJ,QAAI,OAAO,SAAS,OAClB,QAAO,OAAO;QAEd,QAAO;AAET,SAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,MACxC,SACE,uBAAuB,QACvB,uBAAuB,MACvB,OACA;;;AAKR,OAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,KAAK,QAAQ,OAIpD,KAAI,KAAK,SAAS,OAChB,MAAK,MAAM,OAAO,KAAK,KACrB,SACE,uBAAuB,MACvB,uBAAuB,MACvB,QACA;AAKR,SAAO;;;;;;;CAQT,AAAS,SACP,QACe;EACf,MAAM,OAAO,QAAQ;EACrB,MAAM,QAAQ,IAAIL;EAClB,MAAMC,aAAgD,GACnD,QAAQ,MAAM,QACb,EACE,QAAQ,EAAE,SAEZ;EAGJ,MAAMC,WAA8C;EAEpD,IAAIC,YAAgD;AACpD,MAAI,KACF,aAAY,OAAO,YACjB,mBAAmB,KAAK,gBAAgB,QAErC,MAAyC,gBAAgB,EAAE;EAKlE,SAAS,QACP,OACA,KACA,OACA,cAAc,OACd;AACA,OAAI,QAAQ,OAAO,SAAS,SAAS,OACnC,UAAS,OAAO,MAAM,QAAQ,EAAE,QAAQ,EAAE,SAAS;AAErD,UAAO,MAAM,QACX,WAAW,QACX,SAAS,MACT,UAAU,MAAM,QAAQ,QACxB;;AAIJ,OAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,KAAK,QAAQ,QAGrD;GACH,MAAM,aAAa,uBAAuB;GAC1C,MAAM,OAAO,SAAS;GACtB,MAAM,WAAW,SAAS,YAAY;AACtC,OACE,KAAK,iBAAiB,SAAS,QAC/B,KAAK,gBAAgB,SAAS,KAE9B,UAAS,cAAc;YACd,KAAK,iBAAiB,SAAS,KACxC,UAAS,cAAc;YACd,KAAK,gBAAgB,SAAS,KACvC,UAAS,cAAc;AAEzB,OAAI,MAAM;IACR,MAAM,eAAe,OAAO,SAAS,WAAW,OAAO,IAAI;IAC3D,MAAM,mBACJ,UAAU,SAAS,SACf,UAAU,KAAK,SAAS;KACtB,GAAG;KACH,MAAM;SAER,KAAK,SAAS;AACpB,qBAAiB;AACjB,qBAAiB;AACjB,QAAI,OAAO,KAAK,iBAAiB,OAAO,SAAS,GAAG;KAClD,MAAM,CAAC,GAAG,KAAK,MAAM,OAAO,kBAAkB;AAC9C,SAAI,MAAM,OACR,OAAM,IAAI,MACR,8BAA8B,IAAI;KAMtC,SAAS,qBAEP,OAC4B;AAC5B,aAAO,QAAQ,MAAM,cAAc;;KAGrC,SAAS,aACP,IACA,MACQ;AACR,UAAI,OAAO,UAAa,CAACC,SAAO,IAC9B,QAAO;eACE,qBAAqB,MAC9B,KAAI;OACF,IAAI,UAAU,KAAK;AACnB,iBAAU,QAAQ,WAAW,cACzB,QAAQ,MAAM,KACd;AACJ,cAAO;eACA,OAAO;AACd,cAAO,KAAK;;UAGd,QAAO,KAAK,QAAQ;;AAIxB,SAAI,MAAM,OACR,YAAW,cAAc;MACvB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;AAGP,cAAS,cAAc;MACrB,MAAM,aAAa,EAAE,IAAI,EAAE;MAC3B,GAAG;;WAEA;KAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,gBAAW,cAAc;AACzB,cAAS,cAAc;;UAEpB;IAIL,MAAM,UAAU,MAAM,QAAQ,MAAM,YAAY;AAChD,eAAW,cAAc;AACzB,aAAS,cAAc;;;EAG3B,MAAM,cAAc,CAAC,GAAG,KAAK,QAAQ,UAAU,MAAM,CAAC,IAAI,CAAC,OAAO;AAChE,OAAI,IAAI,EACN,QAAO;YACE,IAAI,EACb,QAAO;OAEP,QAAO;;AAGX,OAAK,MAAM,CAAC,OAAO,QAAQ,YACzB,SAAQ,uBAAuB,QAAQ,uBAAuB;AAEhE,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,QAAQ,WAAW;GACrE,MAAMC,cAAsC;IAC1C,GAAG,OAAO,YACR,OAAO,KAAK,KAAK,QAAQ,OACtB,QAAQ,MAAM,MAAM,OACpB,KAAK,MAAM,CAAC,uBAAuB,IAAI,uBAAuB;KAElE,MAAM;;AAET,QAAK,MAAM,UAAU,OAAO,OAAO,WAAW;IAC5C,IAAI;AACJ,QAAI,OAAO,SAAS,OAClB,QAAO,OAAO;QAEd,QAAO;AAET,SAAK,MAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,MACxC,SACE,uBAAuB,QACvB,uBAAuB,MACvB,OACA;;;AAKR,SAAO;;;AAKX,SAAS,gBAAgB,GAAqC;AAC5D,QAEE,OAAQ,EAAyB,eAAe,cAEhD,OAAQ,EAAyB,eAAe;;AAIpD,SAAS,uBAAuB,KAAa;AAC3C,KAAI,QAAQ,WACV,QAAO,IAAI,IAAI;AAEjB,QAAO"}
@@ -1,6 +1,6 @@
1
1
  import { Annotation, AnnotationRoot } from "./annotation.js";
2
2
  import { Graph } from "./graph.js";
3
- import { CompiledStateGraph, StateGraph, typedNode } from "./state.js";
4
- import { MessageGraph, REMOVE_ALL_MESSAGES, messagesStateReducer } from "./message.js";
3
+ import { CompiledStateGraph, StateGraph } from "./state.js";
4
+ import { MessageGraph, REMOVE_ALL_MESSAGES, messagesStateReducer, pushMessage } from "./message.js";
5
5
 
6
6
  export { };
@@ -1,5 +1,6 @@
1
1
  const require_rolldown_runtime = require('../_virtual/rolldown_runtime.cjs');
2
2
  const require_state = require('./state.cjs');
3
+ const __langchain_core_singletons = require_rolldown_runtime.__toESM(require("@langchain/core/singletons"));
3
4
  const uuid = require_rolldown_runtime.__toESM(require("uuid"));
4
5
  const __langchain_core_messages = require_rolldown_runtime.__toESM(require("@langchain/core/messages"));
5
6
 
@@ -56,9 +57,44 @@ var MessageGraph = class extends require_state.StateGraph {
56
57
  } } });
57
58
  }
58
59
  };
60
+ /**
61
+ * Manually push a message to a message stream.
62
+ *
63
+ * This is useful when you need to push a manually created message before the node
64
+ * has finished executing.
65
+ *
66
+ * When a message is pushed, it will be automatically persisted to the state after the node has finished executing.
67
+ * To disable persisting, set `options.stateKey` to `null`.
68
+ *
69
+ * @param message The message to push. The message must have an ID set, otherwise an error will be thrown.
70
+ * @param options RunnableConfig / Runtime coming from node context.
71
+ */
72
+ function pushMessage(message, options) {
73
+ const rawOptions = options ?? __langchain_core_singletons.AsyncLocalStorageProviderSingleton.getRunnableConfig();
74
+ if (rawOptions == null) throw new Error("Calling pushMessage outside the context of a graph.");
75
+ const { stateKey: userStateKey,...config } = rawOptions;
76
+ let stateKey = userStateKey ?? "messages";
77
+ if (userStateKey === null) stateKey = void 0;
78
+ const validMessage = (0, __langchain_core_messages.coerceMessageLikeToMessage)(message);
79
+ if (!validMessage.id) throw new Error("Message ID is required.");
80
+ const callbacks = (() => {
81
+ if (Array.isArray(config.callbacks)) return config.callbacks;
82
+ if (typeof config.callbacks !== "undefined") return config.callbacks.handlers;
83
+ return [];
84
+ })();
85
+ const messagesHandler = callbacks.find((cb) => "name" in cb && cb.name === "StreamMessagesHandler");
86
+ if (messagesHandler) {
87
+ const metadata = config.metadata ?? {};
88
+ const namespace = (metadata.langgraph_checkpoint_ns ?? "").split("|");
89
+ messagesHandler._emit([namespace, metadata], validMessage, void 0, false);
90
+ }
91
+ if (stateKey) config.configurable?.__pregel_send?.([[stateKey, validMessage]]);
92
+ return validMessage;
93
+ }
59
94
 
60
95
  //#endregion
61
96
  exports.MessageGraph = MessageGraph;
62
97
  exports.REMOVE_ALL_MESSAGES = REMOVE_ALL_MESSAGES;
63
98
  exports.messagesStateReducer = messagesStateReducer;
99
+ exports.pushMessage = pushMessage;
64
100
  //# sourceMappingURL=message.cjs.map
@@ -1 +1 @@
1
- {"version":3,"file":"message.cjs","names":["coerceMessageLikeToMessage","removeAllIdx: number | undefined","StateGraph"],"sources":["../../src/graph/message.ts"],"sourcesContent":["import {\n BaseMessage,\n BaseMessageLike,\n coerceMessageLikeToMessage,\n} from \"@langchain/core/messages\";\nimport { v4 } from \"uuid\";\nimport { StateGraph } from \"./state.js\";\nimport type { LangGraphRunnableConfig } from \"../pregel/runnable_types.js\";\nimport type { StreamMessagesHandler } from \"../pregel/messages.js\";\n\nexport const REMOVE_ALL_MESSAGES = \"__remove_all__\";\n\nexport type Messages =\n | Array<BaseMessage | BaseMessageLike>\n | BaseMessage\n | BaseMessageLike;\n\n/**\n * Prebuilt reducer that combines returned messages.\n * Can handle standard messages and special modifiers like {@link RemoveMessage}\n * instances.\n */\nexport function messagesStateReducer(\n left: Messages,\n right: Messages\n): BaseMessage[] {\n const leftArray = Array.isArray(left) ? left : [left];\n const rightArray = Array.isArray(right) ? right : [right];\n // coerce to message\n const leftMessages = (leftArray as BaseMessageLike[]).map(\n coerceMessageLikeToMessage\n );\n const rightMessages = (rightArray as BaseMessageLike[]).map(\n coerceMessageLikeToMessage\n );\n // assign missing ids\n for (const m of leftMessages) {\n if (m.id === null || m.id === undefined) {\n m.id = v4();\n m.lc_kwargs.id = m.id;\n }\n }\n\n let removeAllIdx: number | undefined;\n for (let i = 0; i < rightMessages.length; i += 1) {\n const m = rightMessages[i];\n if (m.id === null || m.id === undefined) {\n m.id = v4();\n m.lc_kwargs.id = m.id;\n }\n\n if (m.getType() === \"remove\" && m.id === REMOVE_ALL_MESSAGES) {\n removeAllIdx = i;\n }\n }\n\n if (removeAllIdx != null) return rightMessages.slice(removeAllIdx + 1);\n\n // merge\n const merged = [...leftMessages];\n const mergedById = new Map(merged.map((m, i) => [m.id, i]));\n const idsToRemove = new Set();\n for (const m of rightMessages) {\n const existingIdx = mergedById.get(m.id);\n if (existingIdx !== undefined) {\n if (m.getType() === \"remove\") {\n idsToRemove.add(m.id);\n } else {\n idsToRemove.delete(m.id);\n merged[existingIdx] = m;\n }\n } else {\n if (m.getType() === \"remove\") {\n throw new Error(\n `Attempting to delete a message with an ID that doesn't exist ('${m.id}')`\n );\n }\n mergedById.set(m.id, merged.length);\n merged.push(m);\n }\n }\n return merged.filter((m) => !idsToRemove.has(m.id));\n}\n\n/** @ignore */\nexport class MessageGraph extends StateGraph<\n BaseMessage[],\n BaseMessage[],\n Messages\n> {\n constructor() {\n super({\n channels: {\n __root__: {\n reducer: messagesStateReducer,\n default: () => [],\n },\n },\n });\n }\n}\n\nexport function pushMessage(\n message: BaseMessage | BaseMessageLike,\n config: LangGraphRunnableConfig,\n options?: { stateKey?: string | null }\n) {\n let stateKey: string | undefined = options?.stateKey ?? \"messages\";\n if (options?.stateKey === null) {\n stateKey = undefined;\n }\n\n // coerce to message\n const validMessage = coerceMessageLikeToMessage(message);\n if (!validMessage.id) throw new Error(\"Message ID is required.\");\n\n const callbacks = (() => {\n if (Array.isArray(config.callbacks)) {\n return config.callbacks;\n }\n\n if (typeof config.callbacks !== \"undefined\") {\n return config.callbacks.handlers;\n }\n\n return [];\n })();\n\n const messagesHandler = callbacks.find(\n (cb): cb is StreamMessagesHandler =>\n \"name\" in cb && cb.name === \"StreamMessagesHandler\"\n );\n\n if (messagesHandler) {\n const metadata = config.metadata ?? {};\n const namespace = (\n (metadata.langgraph_checkpoint_ns ?? \"\") as string\n ).split(\"|\");\n\n messagesHandler._emit(\n [namespace, metadata],\n validMessage,\n undefined,\n false\n );\n }\n\n if (stateKey) {\n config.configurable?.__pregel_send?.([[stateKey, validMessage]]);\n }\n\n return validMessage;\n}\n"],"mappings":";;;;;;AAUA,MAAa,sBAAsB;;;;;;AAYnC,SAAgB,qBACd,MACA,OACe;CACf,MAAM,YAAY,MAAM,QAAQ,QAAQ,OAAO,CAAC;CAChD,MAAM,aAAa,MAAM,QAAQ,SAAS,QAAQ,CAAC;CAEnD,MAAM,eAAgB,UAAgC,IACpDA;CAEF,MAAM,gBAAiB,WAAiC,IACtDA;AAGF,MAAK,MAAM,KAAK,aACd,KAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,QAAW;AACvC,IAAE;AACF,IAAE,UAAU,KAAK,EAAE;;CAIvB,IAAIC;AACJ,MAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK,GAAG;EAChD,MAAM,IAAI,cAAc;AACxB,MAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,QAAW;AACvC,KAAE;AACF,KAAE,UAAU,KAAK,EAAE;;AAGrB,MAAI,EAAE,cAAc,YAAY,EAAE,OAAO,oBACvC,gBAAe;;AAInB,KAAI,gBAAgB,KAAM,QAAO,cAAc,MAAM,eAAe;CAGpE,MAAM,SAAS,CAAC,GAAG;CACnB,MAAM,aAAa,IAAI,IAAI,OAAO,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI;CACvD,MAAM,8BAAc,IAAI;AACxB,MAAK,MAAM,KAAK,eAAe;EAC7B,MAAM,cAAc,WAAW,IAAI,EAAE;AACrC,MAAI,gBAAgB,OAClB,KAAI,EAAE,cAAc,SAClB,aAAY,IAAI,EAAE;OACb;AACL,eAAY,OAAO,EAAE;AACrB,UAAO,eAAe;;OAEnB;AACL,OAAI,EAAE,cAAc,SAClB,OAAM,IAAI,MACR,kEAAkE,EAAE,GAAG;AAG3E,cAAW,IAAI,EAAE,IAAI,OAAO;AAC5B,UAAO,KAAK;;;AAGhB,QAAO,OAAO,QAAQ,MAAM,CAAC,YAAY,IAAI,EAAE;;;AAIjD,IAAa,eAAb,cAAkCC,yBAIhC;CACA,cAAc;AACZ,QAAM,EACJ,UAAU,EACR,UAAU;GACR,SAAS;GACT,eAAe"}
1
+ {"version":3,"file":"message.cjs","names":["coerceMessageLikeToMessage","removeAllIdx: number | undefined","StateGraph","rawOptions:\n | (RunnableConfig & { stateKey?: string | null })\n | undefined","AsyncLocalStorageProviderSingleton","stateKey: string | undefined"],"sources":["../../src/graph/message.ts"],"sourcesContent":["import {\n BaseMessage,\n BaseMessageLike,\n coerceMessageLikeToMessage,\n} from \"@langchain/core/messages\";\nimport type { RunnableConfig } from \"@langchain/core/runnables\";\nimport { AsyncLocalStorageProviderSingleton } from \"@langchain/core/singletons\";\nimport { v4 } from \"uuid\";\nimport { StateGraph } from \"./state.js\";\nimport type { StreamMessagesHandler } from \"../pregel/messages.js\";\n\nexport const REMOVE_ALL_MESSAGES = \"__remove_all__\";\n\nexport type Messages =\n | Array<BaseMessage | BaseMessageLike>\n | BaseMessage\n | BaseMessageLike;\n\n/**\n * Prebuilt reducer that combines returned messages.\n * Can handle standard messages and special modifiers like {@link RemoveMessage}\n * instances.\n */\nexport function messagesStateReducer(\n left: Messages,\n right: Messages\n): BaseMessage[] {\n const leftArray = Array.isArray(left) ? left : [left];\n const rightArray = Array.isArray(right) ? right : [right];\n // coerce to message\n const leftMessages = (leftArray as BaseMessageLike[]).map(\n coerceMessageLikeToMessage\n );\n const rightMessages = (rightArray as BaseMessageLike[]).map(\n coerceMessageLikeToMessage\n );\n // assign missing ids\n for (const m of leftMessages) {\n if (m.id === null || m.id === undefined) {\n m.id = v4();\n m.lc_kwargs.id = m.id;\n }\n }\n\n let removeAllIdx: number | undefined;\n for (let i = 0; i < rightMessages.length; i += 1) {\n const m = rightMessages[i];\n if (m.id === null || m.id === undefined) {\n m.id = v4();\n m.lc_kwargs.id = m.id;\n }\n\n if (m.getType() === \"remove\" && m.id === REMOVE_ALL_MESSAGES) {\n removeAllIdx = i;\n }\n }\n\n if (removeAllIdx != null) return rightMessages.slice(removeAllIdx + 1);\n\n // merge\n const merged = [...leftMessages];\n const mergedById = new Map(merged.map((m, i) => [m.id, i]));\n const idsToRemove = new Set();\n for (const m of rightMessages) {\n const existingIdx = mergedById.get(m.id);\n if (existingIdx !== undefined) {\n if (m.getType() === \"remove\") {\n idsToRemove.add(m.id);\n } else {\n idsToRemove.delete(m.id);\n merged[existingIdx] = m;\n }\n } else {\n if (m.getType() === \"remove\") {\n throw new Error(\n `Attempting to delete a message with an ID that doesn't exist ('${m.id}')`\n );\n }\n mergedById.set(m.id, merged.length);\n merged.push(m);\n }\n }\n return merged.filter((m) => !idsToRemove.has(m.id));\n}\n\n/** @ignore */\nexport class MessageGraph extends StateGraph<\n BaseMessage[],\n BaseMessage[],\n Messages\n> {\n constructor() {\n super({\n channels: {\n __root__: {\n reducer: messagesStateReducer,\n default: () => [],\n },\n },\n });\n }\n}\n\n/**\n * Manually push a message to a message stream.\n *\n * This is useful when you need to push a manually created message before the node\n * has finished executing.\n *\n * When a message is pushed, it will be automatically persisted to the state after the node has finished executing.\n * To disable persisting, set `options.stateKey` to `null`.\n *\n * @param message The message to push. The message must have an ID set, otherwise an error will be thrown.\n * @param options RunnableConfig / Runtime coming from node context.\n */\nexport function pushMessage(\n message: BaseMessage | BaseMessageLike,\n options?: RunnableConfig & {\n /**\n * The key of the state to push the message to. Set to `null` to avoid persisting.\n * @default \"messages\"\n */\n stateKey?: string | null;\n }\n) {\n const rawOptions:\n | (RunnableConfig & { stateKey?: string | null })\n | undefined =\n options ?? AsyncLocalStorageProviderSingleton.getRunnableConfig();\n\n if (rawOptions == null) {\n throw new Error(\"Calling pushMessage outside the context of a graph.\");\n }\n\n const { stateKey: userStateKey, ...config } = rawOptions;\n let stateKey: string | undefined = userStateKey ?? \"messages\";\n if (userStateKey === null) stateKey = undefined;\n\n // coerce to message\n const validMessage = coerceMessageLikeToMessage(message);\n if (!validMessage.id) throw new Error(\"Message ID is required.\");\n\n const callbacks = (() => {\n if (Array.isArray(config.callbacks)) {\n return config.callbacks;\n }\n\n if (typeof config.callbacks !== \"undefined\") {\n return config.callbacks.handlers;\n }\n\n return [];\n })();\n\n const messagesHandler = callbacks.find(\n (cb): cb is StreamMessagesHandler =>\n \"name\" in cb && cb.name === \"StreamMessagesHandler\"\n );\n\n if (messagesHandler) {\n const metadata = config.metadata ?? {};\n const namespace = (\n (metadata.langgraph_checkpoint_ns ?? \"\") as string\n ).split(\"|\");\n\n messagesHandler._emit(\n [namespace, metadata],\n validMessage,\n undefined,\n false\n );\n }\n\n if (stateKey) {\n config.configurable?.__pregel_send?.([[stateKey, validMessage]]);\n }\n\n return validMessage;\n}\n"],"mappings":";;;;;;;AAWA,MAAa,sBAAsB;;;;;;AAYnC,SAAgB,qBACd,MACA,OACe;CACf,MAAM,YAAY,MAAM,QAAQ,QAAQ,OAAO,CAAC;CAChD,MAAM,aAAa,MAAM,QAAQ,SAAS,QAAQ,CAAC;CAEnD,MAAM,eAAgB,UAAgC,IACpDA;CAEF,MAAM,gBAAiB,WAAiC,IACtDA;AAGF,MAAK,MAAM,KAAK,aACd,KAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,QAAW;AACvC,IAAE;AACF,IAAE,UAAU,KAAK,EAAE;;CAIvB,IAAIC;AACJ,MAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK,GAAG;EAChD,MAAM,IAAI,cAAc;AACxB,MAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,QAAW;AACvC,KAAE;AACF,KAAE,UAAU,KAAK,EAAE;;AAGrB,MAAI,EAAE,cAAc,YAAY,EAAE,OAAO,oBACvC,gBAAe;;AAInB,KAAI,gBAAgB,KAAM,QAAO,cAAc,MAAM,eAAe;CAGpE,MAAM,SAAS,CAAC,GAAG;CACnB,MAAM,aAAa,IAAI,IAAI,OAAO,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI;CACvD,MAAM,8BAAc,IAAI;AACxB,MAAK,MAAM,KAAK,eAAe;EAC7B,MAAM,cAAc,WAAW,IAAI,EAAE;AACrC,MAAI,gBAAgB,OAClB,KAAI,EAAE,cAAc,SAClB,aAAY,IAAI,EAAE;OACb;AACL,eAAY,OAAO,EAAE;AACrB,UAAO,eAAe;;OAEnB;AACL,OAAI,EAAE,cAAc,SAClB,OAAM,IAAI,MACR,kEAAkE,EAAE,GAAG;AAG3E,cAAW,IAAI,EAAE,IAAI,OAAO;AAC5B,UAAO,KAAK;;;AAGhB,QAAO,OAAO,QAAQ,MAAM,CAAC,YAAY,IAAI,EAAE;;;AAIjD,IAAa,eAAb,cAAkCC,yBAIhC;CACA,cAAc;AACZ,QAAM,EACJ,UAAU,EACR,UAAU;GACR,SAAS;GACT,eAAe;;;;;;;;;;;;;;;;AAmBzB,SAAgB,YACd,SACA,SAOA;CACA,MAAMC,aAGJ,WAAWC,+DAAmC;AAEhD,KAAI,cAAc,KAChB,OAAM,IAAI,MAAM;CAGlB,MAAM,EAAE,UAAU,aAAc,GAAG,WAAW;CAC9C,IAAIC,WAA+B,gBAAgB;AACnD,KAAI,iBAAiB,KAAM,YAAW;CAGtC,MAAM,yEAA0C;AAChD,KAAI,CAAC,aAAa,GAAI,OAAM,IAAI,MAAM;CAEtC,MAAM,mBAAmB;AACvB,MAAI,MAAM,QAAQ,OAAO,WACvB,QAAO,OAAO;AAGhB,MAAI,OAAO,OAAO,cAAc,YAC9B,QAAO,OAAO,UAAU;AAG1B,SAAO;;CAGT,MAAM,kBAAkB,UAAU,MAC/B,OACC,UAAU,MAAM,GAAG,SAAS;AAGhC,KAAI,iBAAiB;EACnB,MAAM,WAAW,OAAO,YAAY;EACpC,MAAM,aACH,SAAS,2BAA2B,IACrC,MAAM;AAER,kBAAgB,MACd,CAAC,WAAW,WACZ,cACA,QACA;;AAIJ,KAAI,SACF,QAAO,cAAc,gBAAgB,CAAC,CAAC,UAAU;AAGnD,QAAO"}
@@ -1,4 +1,5 @@
1
1
  import { StateGraph } from "./state.cjs";
2
+ import { RunnableConfig } from "@langchain/core/runnables";
2
3
  import { BaseMessage, BaseMessageLike } from "@langchain/core/messages";
3
4
 
4
5
  //#region src/graph/message.d.ts
@@ -14,6 +15,25 @@ declare function messagesStateReducer(left: Messages, right: Messages): BaseMess
14
15
  declare class MessageGraph extends StateGraph<BaseMessage[], BaseMessage[], Messages> {
15
16
  constructor();
16
17
  }
18
+ /**
19
+ * Manually push a message to a message stream.
20
+ *
21
+ * This is useful when you need to push a manually created message before the node
22
+ * has finished executing.
23
+ *
24
+ * When a message is pushed, it will be automatically persisted to the state after the node has finished executing.
25
+ * To disable persisting, set `options.stateKey` to `null`.
26
+ *
27
+ * @param message The message to push. The message must have an ID set, otherwise an error will be thrown.
28
+ * @param options RunnableConfig / Runtime coming from node context.
29
+ */
30
+ declare function pushMessage(message: BaseMessage | BaseMessageLike, options?: RunnableConfig & {
31
+ /**
32
+ * The key of the state to push the message to. Set to `null` to avoid persisting.
33
+ * @default "messages"
34
+ */
35
+ stateKey?: string | null;
36
+ }): BaseMessage;
17
37
  //#endregion
18
- export { MessageGraph, Messages, REMOVE_ALL_MESSAGES, messagesStateReducer };
38
+ export { MessageGraph, Messages, REMOVE_ALL_MESSAGES, messagesStateReducer, pushMessage };
19
39
  //# sourceMappingURL=message.d.cts.map
@@ -1 +1 @@
1
- {"version":3,"file":"message.d.cts","names":["BaseMessage","BaseMessageLike","StateGraph","LangGraphRunnableConfig","REMOVE_ALL_MESSAGES","Messages","Array","messagesStateReducer","MessageGraph","pushMessage"],"sources":["../../src/graph/message.d.ts"],"sourcesContent":["import { BaseMessage, BaseMessageLike } from \"@langchain/core/messages\";\nimport { StateGraph } from \"./state.js\";\nimport type { LangGraphRunnableConfig } from \"../pregel/runnable_types.js\";\nexport declare const REMOVE_ALL_MESSAGES = \"__remove_all__\";\nexport type Messages = Array<BaseMessage | BaseMessageLike> | BaseMessage | BaseMessageLike;\n/**\n * Prebuilt reducer that combines returned messages.\n * Can handle standard messages and special modifiers like {@link RemoveMessage}\n * instances.\n */\nexport declare function messagesStateReducer(left: Messages, right: Messages): BaseMessage[];\n/** @ignore */\nexport declare class MessageGraph extends StateGraph<BaseMessage[], BaseMessage[], Messages> {\n constructor();\n}\nexport declare function pushMessage(message: BaseMessage | BaseMessageLike, config: LangGraphRunnableConfig, options?: {\n stateKey?: string | null;\n}): BaseMessage;\n"],"mappings":";;;;cAGqBI,mBAAAA;AAAAA,KACTC,QAAAA,GAAWC,KADiB,CACXN,WADW,GACGC,eADH,CAAA,GACsBD,WADtB,GACoCC,eADpC;AACxC;;;;;AAA8DD,iBAMtCO,oBAAAA,CANsCP,IAAAA,EAMXK,QANWL,EAAAA,KAAAA,EAMMK,QANNL,CAAAA,EAMiBA,WANjBA,EAAAA;;cAQzCQ,YAAAA,SAAqBN,WAAWF,eAAeA,eAAeK;EAF3DE,WAAAA,CAAAA"}
1
+ {"version":3,"file":"message.d.cts","names":["BaseMessage","BaseMessageLike","RunnableConfig","StateGraph","REMOVE_ALL_MESSAGES","Messages","Array","messagesStateReducer","MessageGraph","pushMessage"],"sources":["../../src/graph/message.d.ts"],"sourcesContent":["import { BaseMessage, BaseMessageLike } from \"@langchain/core/messages\";\nimport type { RunnableConfig } from \"@langchain/core/runnables\";\nimport { StateGraph } from \"./state.js\";\nexport declare const REMOVE_ALL_MESSAGES = \"__remove_all__\";\nexport type Messages = Array<BaseMessage | BaseMessageLike> | BaseMessage | BaseMessageLike;\n/**\n * Prebuilt reducer that combines returned messages.\n * Can handle standard messages and special modifiers like {@link RemoveMessage}\n * instances.\n */\nexport declare function messagesStateReducer(left: Messages, right: Messages): BaseMessage[];\n/** @ignore */\nexport declare class MessageGraph extends StateGraph<BaseMessage[], BaseMessage[], Messages> {\n constructor();\n}\n/**\n * Manually push a message to a message stream.\n *\n * This is useful when you need to push a manually created message before the node\n * has finished executing.\n *\n * When a message is pushed, it will be automatically persisted to the state after the node has finished executing.\n * To disable persisting, set `options.stateKey` to `null`.\n *\n * @param message The message to push. The message must have an ID set, otherwise an error will be thrown.\n * @param options RunnableConfig / Runtime coming from node context.\n */\nexport declare function pushMessage(message: BaseMessage | BaseMessageLike, options?: RunnableConfig & {\n /**\n * The key of the state to push the message to. Set to `null` to avoid persisting.\n * @default \"messages\"\n */\n stateKey?: string | null;\n}): BaseMessage;\n"],"mappings":";;;;;cAGqBI,mBAAAA;KACTC,QAAAA,GAAWC,MAAMN,cAAcC,mBAAmBD,cAAcC;AAD5E;AACA;;;;AAAuBK,iBAMCC,oBAAAA,CANDD,IAAAA,EAM4BD,QAN5BC,EAAAA,KAAAA,EAM6CD,QAN7CC,CAAAA,EAMwDN,WANxDM,EAAAA;;AAAqDL,cAQvDO,YAAAA,SAAqBL,UARkCF,CAQvBD,WARuBC,EAAAA,EAQRD,WARQC,EAAAA,EAQOI,QARPJ,CAAAA,CAAAA;;AAM5E;;;;;;AAEA;;;;;;;AAewBQ,iBAAAA,WAAAA,CAAW,OAAA,EAAUT,WAAV,GAAwBC,eAAxB,EAAA,QAAA,EAAmDC,cAAnD,GAAA;EAAA;;;;UAM/BF,CAAAA,EAAAA,MAAAA,GAAAA,IAAAA;IAAAA"}
@@ -1,4 +1,5 @@
1
1
  import { StateGraph } from "./state.js";
2
+ import { RunnableConfig } from "@langchain/core/runnables";
2
3
  import { BaseMessage, BaseMessageLike } from "@langchain/core/messages";
3
4
 
4
5
  //#region src/graph/message.d.ts
@@ -14,6 +15,25 @@ declare function messagesStateReducer(left: Messages, right: Messages): BaseMess
14
15
  declare class MessageGraph extends StateGraph<BaseMessage[], BaseMessage[], Messages> {
15
16
  constructor();
16
17
  }
18
+ /**
19
+ * Manually push a message to a message stream.
20
+ *
21
+ * This is useful when you need to push a manually created message before the node
22
+ * has finished executing.
23
+ *
24
+ * When a message is pushed, it will be automatically persisted to the state after the node has finished executing.
25
+ * To disable persisting, set `options.stateKey` to `null`.
26
+ *
27
+ * @param message The message to push. The message must have an ID set, otherwise an error will be thrown.
28
+ * @param options RunnableConfig / Runtime coming from node context.
29
+ */
30
+ declare function pushMessage(message: BaseMessage | BaseMessageLike, options?: RunnableConfig & {
31
+ /**
32
+ * The key of the state to push the message to. Set to `null` to avoid persisting.
33
+ * @default "messages"
34
+ */
35
+ stateKey?: string | null;
36
+ }): BaseMessage;
17
37
  //#endregion
18
- export { MessageGraph, Messages, REMOVE_ALL_MESSAGES, messagesStateReducer };
38
+ export { MessageGraph, Messages, REMOVE_ALL_MESSAGES, messagesStateReducer, pushMessage };
19
39
  //# sourceMappingURL=message.d.ts.map
@@ -1 +1 @@
1
- {"version":3,"file":"message.d.ts","names":["BaseMessage","BaseMessageLike","StateGraph","LangGraphRunnableConfig","REMOVE_ALL_MESSAGES","Messages","Array","messagesStateReducer","MessageGraph","pushMessage"],"sources":["../../src/graph/message.d.ts"],"sourcesContent":["import { BaseMessage, BaseMessageLike } from \"@langchain/core/messages\";\nimport { StateGraph } from \"./state.js\";\nimport type { LangGraphRunnableConfig } from \"../pregel/runnable_types.js\";\nexport declare const REMOVE_ALL_MESSAGES = \"__remove_all__\";\nexport type Messages = Array<BaseMessage | BaseMessageLike> | BaseMessage | BaseMessageLike;\n/**\n * Prebuilt reducer that combines returned messages.\n * Can handle standard messages and special modifiers like {@link RemoveMessage}\n * instances.\n */\nexport declare function messagesStateReducer(left: Messages, right: Messages): BaseMessage[];\n/** @ignore */\nexport declare class MessageGraph extends StateGraph<BaseMessage[], BaseMessage[], Messages> {\n constructor();\n}\nexport declare function pushMessage(message: BaseMessage | BaseMessageLike, config: LangGraphRunnableConfig, options?: {\n stateKey?: string | null;\n}): BaseMessage;\n"],"mappings":";;;;cAGqBI,mBAAAA;AAAAA,KACTC,QAAAA,GAAWC,KADiB,CACXN,WADW,GACGC,eADH,CAAA,GACsBD,WADtB,GACoCC,eADpC;AACxC;;;;;AAA8DD,iBAMtCO,oBAAAA,CANsCP,IAAAA,EAMXK,QANWL,EAAAA,KAAAA,EAMMK,QANNL,CAAAA,EAMiBA,WANjBA,EAAAA;;cAQzCQ,YAAAA,SAAqBN,WAAWF,eAAeA,eAAeK;EAF3DE,WAAAA,CAAAA"}
1
+ {"version":3,"file":"message.d.ts","names":["BaseMessage","BaseMessageLike","RunnableConfig","StateGraph","REMOVE_ALL_MESSAGES","Messages","Array","messagesStateReducer","MessageGraph","pushMessage"],"sources":["../../src/graph/message.d.ts"],"sourcesContent":["import { BaseMessage, BaseMessageLike } from \"@langchain/core/messages\";\nimport type { RunnableConfig } from \"@langchain/core/runnables\";\nimport { StateGraph } from \"./state.js\";\nexport declare const REMOVE_ALL_MESSAGES = \"__remove_all__\";\nexport type Messages = Array<BaseMessage | BaseMessageLike> | BaseMessage | BaseMessageLike;\n/**\n * Prebuilt reducer that combines returned messages.\n * Can handle standard messages and special modifiers like {@link RemoveMessage}\n * instances.\n */\nexport declare function messagesStateReducer(left: Messages, right: Messages): BaseMessage[];\n/** @ignore */\nexport declare class MessageGraph extends StateGraph<BaseMessage[], BaseMessage[], Messages> {\n constructor();\n}\n/**\n * Manually push a message to a message stream.\n *\n * This is useful when you need to push a manually created message before the node\n * has finished executing.\n *\n * When a message is pushed, it will be automatically persisted to the state after the node has finished executing.\n * To disable persisting, set `options.stateKey` to `null`.\n *\n * @param message The message to push. The message must have an ID set, otherwise an error will be thrown.\n * @param options RunnableConfig / Runtime coming from node context.\n */\nexport declare function pushMessage(message: BaseMessage | BaseMessageLike, options?: RunnableConfig & {\n /**\n * The key of the state to push the message to. Set to `null` to avoid persisting.\n * @default \"messages\"\n */\n stateKey?: string | null;\n}): BaseMessage;\n"],"mappings":";;;;;cAGqBI,mBAAAA;KACTC,QAAAA,GAAWC,MAAMN,cAAcC,mBAAmBD,cAAcC;AAD5E;AACA;;;;AAAuBK,iBAMCC,oBAAAA,CANDD,IAAAA,EAM4BD,QAN5BC,EAAAA,KAAAA,EAM6CD,QAN7CC,CAAAA,EAMwDN,WANxDM,EAAAA;;AAAqDL,cAQvDO,YAAAA,SAAqBL,UARkCF,CAQvBD,WARuBC,EAAAA,EAQRD,WARQC,EAAAA,EAQOI,QARPJ,CAAAA,CAAAA;;AAM5E;;;;;;AAEA;;;;;;;AAewBQ,iBAAAA,WAAAA,CAAW,OAAA,EAAUT,WAAV,GAAwBC,eAAxB,EAAA,QAAA,EAAmDC,cAAnD,GAAA;EAAA;;;;UAM/BF,CAAAA,EAAAA,MAAAA,GAAAA,IAAAA;IAAAA"}
@@ -1,4 +1,5 @@
1
1
  import { StateGraph } from "./state.js";
2
+ import { AsyncLocalStorageProviderSingleton } from "@langchain/core/singletons";
2
3
  import { v4 } from "uuid";
3
4
  import { coerceMessageLikeToMessage } from "@langchain/core/messages";
4
5
 
@@ -55,7 +56,41 @@ var MessageGraph = class extends StateGraph {
55
56
  } } });
56
57
  }
57
58
  };
59
+ /**
60
+ * Manually push a message to a message stream.
61
+ *
62
+ * This is useful when you need to push a manually created message before the node
63
+ * has finished executing.
64
+ *
65
+ * When a message is pushed, it will be automatically persisted to the state after the node has finished executing.
66
+ * To disable persisting, set `options.stateKey` to `null`.
67
+ *
68
+ * @param message The message to push. The message must have an ID set, otherwise an error will be thrown.
69
+ * @param options RunnableConfig / Runtime coming from node context.
70
+ */
71
+ function pushMessage(message, options) {
72
+ const rawOptions = options ?? AsyncLocalStorageProviderSingleton.getRunnableConfig();
73
+ if (rawOptions == null) throw new Error("Calling pushMessage outside the context of a graph.");
74
+ const { stateKey: userStateKey,...config } = rawOptions;
75
+ let stateKey = userStateKey ?? "messages";
76
+ if (userStateKey === null) stateKey = void 0;
77
+ const validMessage = coerceMessageLikeToMessage(message);
78
+ if (!validMessage.id) throw new Error("Message ID is required.");
79
+ const callbacks = (() => {
80
+ if (Array.isArray(config.callbacks)) return config.callbacks;
81
+ if (typeof config.callbacks !== "undefined") return config.callbacks.handlers;
82
+ return [];
83
+ })();
84
+ const messagesHandler = callbacks.find((cb) => "name" in cb && cb.name === "StreamMessagesHandler");
85
+ if (messagesHandler) {
86
+ const metadata = config.metadata ?? {};
87
+ const namespace = (metadata.langgraph_checkpoint_ns ?? "").split("|");
88
+ messagesHandler._emit([namespace, metadata], validMessage, void 0, false);
89
+ }
90
+ if (stateKey) config.configurable?.__pregel_send?.([[stateKey, validMessage]]);
91
+ return validMessage;
92
+ }
58
93
 
59
94
  //#endregion
60
- export { MessageGraph, REMOVE_ALL_MESSAGES, messagesStateReducer };
95
+ export { MessageGraph, REMOVE_ALL_MESSAGES, messagesStateReducer, pushMessage };
61
96
  //# sourceMappingURL=message.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"message.js","names":["removeAllIdx: number | undefined"],"sources":["../../src/graph/message.ts"],"sourcesContent":["import {\n BaseMessage,\n BaseMessageLike,\n coerceMessageLikeToMessage,\n} from \"@langchain/core/messages\";\nimport { v4 } from \"uuid\";\nimport { StateGraph } from \"./state.js\";\nimport type { LangGraphRunnableConfig } from \"../pregel/runnable_types.js\";\nimport type { StreamMessagesHandler } from \"../pregel/messages.js\";\n\nexport const REMOVE_ALL_MESSAGES = \"__remove_all__\";\n\nexport type Messages =\n | Array<BaseMessage | BaseMessageLike>\n | BaseMessage\n | BaseMessageLike;\n\n/**\n * Prebuilt reducer that combines returned messages.\n * Can handle standard messages and special modifiers like {@link RemoveMessage}\n * instances.\n */\nexport function messagesStateReducer(\n left: Messages,\n right: Messages\n): BaseMessage[] {\n const leftArray = Array.isArray(left) ? left : [left];\n const rightArray = Array.isArray(right) ? right : [right];\n // coerce to message\n const leftMessages = (leftArray as BaseMessageLike[]).map(\n coerceMessageLikeToMessage\n );\n const rightMessages = (rightArray as BaseMessageLike[]).map(\n coerceMessageLikeToMessage\n );\n // assign missing ids\n for (const m of leftMessages) {\n if (m.id === null || m.id === undefined) {\n m.id = v4();\n m.lc_kwargs.id = m.id;\n }\n }\n\n let removeAllIdx: number | undefined;\n for (let i = 0; i < rightMessages.length; i += 1) {\n const m = rightMessages[i];\n if (m.id === null || m.id === undefined) {\n m.id = v4();\n m.lc_kwargs.id = m.id;\n }\n\n if (m.getType() === \"remove\" && m.id === REMOVE_ALL_MESSAGES) {\n removeAllIdx = i;\n }\n }\n\n if (removeAllIdx != null) return rightMessages.slice(removeAllIdx + 1);\n\n // merge\n const merged = [...leftMessages];\n const mergedById = new Map(merged.map((m, i) => [m.id, i]));\n const idsToRemove = new Set();\n for (const m of rightMessages) {\n const existingIdx = mergedById.get(m.id);\n if (existingIdx !== undefined) {\n if (m.getType() === \"remove\") {\n idsToRemove.add(m.id);\n } else {\n idsToRemove.delete(m.id);\n merged[existingIdx] = m;\n }\n } else {\n if (m.getType() === \"remove\") {\n throw new Error(\n `Attempting to delete a message with an ID that doesn't exist ('${m.id}')`\n );\n }\n mergedById.set(m.id, merged.length);\n merged.push(m);\n }\n }\n return merged.filter((m) => !idsToRemove.has(m.id));\n}\n\n/** @ignore */\nexport class MessageGraph extends StateGraph<\n BaseMessage[],\n BaseMessage[],\n Messages\n> {\n constructor() {\n super({\n channels: {\n __root__: {\n reducer: messagesStateReducer,\n default: () => [],\n },\n },\n });\n }\n}\n\nexport function pushMessage(\n message: BaseMessage | BaseMessageLike,\n config: LangGraphRunnableConfig,\n options?: { stateKey?: string | null }\n) {\n let stateKey: string | undefined = options?.stateKey ?? \"messages\";\n if (options?.stateKey === null) {\n stateKey = undefined;\n }\n\n // coerce to message\n const validMessage = coerceMessageLikeToMessage(message);\n if (!validMessage.id) throw new Error(\"Message ID is required.\");\n\n const callbacks = (() => {\n if (Array.isArray(config.callbacks)) {\n return config.callbacks;\n }\n\n if (typeof config.callbacks !== \"undefined\") {\n return config.callbacks.handlers;\n }\n\n return [];\n })();\n\n const messagesHandler = callbacks.find(\n (cb): cb is StreamMessagesHandler =>\n \"name\" in cb && cb.name === \"StreamMessagesHandler\"\n );\n\n if (messagesHandler) {\n const metadata = config.metadata ?? {};\n const namespace = (\n (metadata.langgraph_checkpoint_ns ?? \"\") as string\n ).split(\"|\");\n\n messagesHandler._emit(\n [namespace, metadata],\n validMessage,\n undefined,\n false\n );\n }\n\n if (stateKey) {\n config.configurable?.__pregel_send?.([[stateKey, validMessage]]);\n }\n\n return validMessage;\n}\n"],"mappings":";;;;;AAUA,MAAa,sBAAsB;;;;;;AAYnC,SAAgB,qBACd,MACA,OACe;CACf,MAAM,YAAY,MAAM,QAAQ,QAAQ,OAAO,CAAC;CAChD,MAAM,aAAa,MAAM,QAAQ,SAAS,QAAQ,CAAC;CAEnD,MAAM,eAAgB,UAAgC,IACpD;CAEF,MAAM,gBAAiB,WAAiC,IACtD;AAGF,MAAK,MAAM,KAAK,aACd,KAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,QAAW;AACvC,IAAE,KAAK;AACP,IAAE,UAAU,KAAK,EAAE;;CAIvB,IAAIA;AACJ,MAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK,GAAG;EAChD,MAAM,IAAI,cAAc;AACxB,MAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,QAAW;AACvC,KAAE,KAAK;AACP,KAAE,UAAU,KAAK,EAAE;;AAGrB,MAAI,EAAE,cAAc,YAAY,EAAE,OAAO,oBACvC,gBAAe;;AAInB,KAAI,gBAAgB,KAAM,QAAO,cAAc,MAAM,eAAe;CAGpE,MAAM,SAAS,CAAC,GAAG;CACnB,MAAM,aAAa,IAAI,IAAI,OAAO,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI;CACvD,MAAM,8BAAc,IAAI;AACxB,MAAK,MAAM,KAAK,eAAe;EAC7B,MAAM,cAAc,WAAW,IAAI,EAAE;AACrC,MAAI,gBAAgB,OAClB,KAAI,EAAE,cAAc,SAClB,aAAY,IAAI,EAAE;OACb;AACL,eAAY,OAAO,EAAE;AACrB,UAAO,eAAe;;OAEnB;AACL,OAAI,EAAE,cAAc,SAClB,OAAM,IAAI,MACR,kEAAkE,EAAE,GAAG;AAG3E,cAAW,IAAI,EAAE,IAAI,OAAO;AAC5B,UAAO,KAAK;;;AAGhB,QAAO,OAAO,QAAQ,MAAM,CAAC,YAAY,IAAI,EAAE;;;AAIjD,IAAa,eAAb,cAAkC,WAIhC;CACA,cAAc;AACZ,QAAM,EACJ,UAAU,EACR,UAAU;GACR,SAAS;GACT,eAAe"}
1
+ {"version":3,"file":"message.js","names":["removeAllIdx: number | undefined","rawOptions:\n | (RunnableConfig & { stateKey?: string | null })\n | undefined","stateKey: string | undefined"],"sources":["../../src/graph/message.ts"],"sourcesContent":["import {\n BaseMessage,\n BaseMessageLike,\n coerceMessageLikeToMessage,\n} from \"@langchain/core/messages\";\nimport type { RunnableConfig } from \"@langchain/core/runnables\";\nimport { AsyncLocalStorageProviderSingleton } from \"@langchain/core/singletons\";\nimport { v4 } from \"uuid\";\nimport { StateGraph } from \"./state.js\";\nimport type { StreamMessagesHandler } from \"../pregel/messages.js\";\n\nexport const REMOVE_ALL_MESSAGES = \"__remove_all__\";\n\nexport type Messages =\n | Array<BaseMessage | BaseMessageLike>\n | BaseMessage\n | BaseMessageLike;\n\n/**\n * Prebuilt reducer that combines returned messages.\n * Can handle standard messages and special modifiers like {@link RemoveMessage}\n * instances.\n */\nexport function messagesStateReducer(\n left: Messages,\n right: Messages\n): BaseMessage[] {\n const leftArray = Array.isArray(left) ? left : [left];\n const rightArray = Array.isArray(right) ? right : [right];\n // coerce to message\n const leftMessages = (leftArray as BaseMessageLike[]).map(\n coerceMessageLikeToMessage\n );\n const rightMessages = (rightArray as BaseMessageLike[]).map(\n coerceMessageLikeToMessage\n );\n // assign missing ids\n for (const m of leftMessages) {\n if (m.id === null || m.id === undefined) {\n m.id = v4();\n m.lc_kwargs.id = m.id;\n }\n }\n\n let removeAllIdx: number | undefined;\n for (let i = 0; i < rightMessages.length; i += 1) {\n const m = rightMessages[i];\n if (m.id === null || m.id === undefined) {\n m.id = v4();\n m.lc_kwargs.id = m.id;\n }\n\n if (m.getType() === \"remove\" && m.id === REMOVE_ALL_MESSAGES) {\n removeAllIdx = i;\n }\n }\n\n if (removeAllIdx != null) return rightMessages.slice(removeAllIdx + 1);\n\n // merge\n const merged = [...leftMessages];\n const mergedById = new Map(merged.map((m, i) => [m.id, i]));\n const idsToRemove = new Set();\n for (const m of rightMessages) {\n const existingIdx = mergedById.get(m.id);\n if (existingIdx !== undefined) {\n if (m.getType() === \"remove\") {\n idsToRemove.add(m.id);\n } else {\n idsToRemove.delete(m.id);\n merged[existingIdx] = m;\n }\n } else {\n if (m.getType() === \"remove\") {\n throw new Error(\n `Attempting to delete a message with an ID that doesn't exist ('${m.id}')`\n );\n }\n mergedById.set(m.id, merged.length);\n merged.push(m);\n }\n }\n return merged.filter((m) => !idsToRemove.has(m.id));\n}\n\n/** @ignore */\nexport class MessageGraph extends StateGraph<\n BaseMessage[],\n BaseMessage[],\n Messages\n> {\n constructor() {\n super({\n channels: {\n __root__: {\n reducer: messagesStateReducer,\n default: () => [],\n },\n },\n });\n }\n}\n\n/**\n * Manually push a message to a message stream.\n *\n * This is useful when you need to push a manually created message before the node\n * has finished executing.\n *\n * When a message is pushed, it will be automatically persisted to the state after the node has finished executing.\n * To disable persisting, set `options.stateKey` to `null`.\n *\n * @param message The message to push. The message must have an ID set, otherwise an error will be thrown.\n * @param options RunnableConfig / Runtime coming from node context.\n */\nexport function pushMessage(\n message: BaseMessage | BaseMessageLike,\n options?: RunnableConfig & {\n /**\n * The key of the state to push the message to. Set to `null` to avoid persisting.\n * @default \"messages\"\n */\n stateKey?: string | null;\n }\n) {\n const rawOptions:\n | (RunnableConfig & { stateKey?: string | null })\n | undefined =\n options ?? AsyncLocalStorageProviderSingleton.getRunnableConfig();\n\n if (rawOptions == null) {\n throw new Error(\"Calling pushMessage outside the context of a graph.\");\n }\n\n const { stateKey: userStateKey, ...config } = rawOptions;\n let stateKey: string | undefined = userStateKey ?? \"messages\";\n if (userStateKey === null) stateKey = undefined;\n\n // coerce to message\n const validMessage = coerceMessageLikeToMessage(message);\n if (!validMessage.id) throw new Error(\"Message ID is required.\");\n\n const callbacks = (() => {\n if (Array.isArray(config.callbacks)) {\n return config.callbacks;\n }\n\n if (typeof config.callbacks !== \"undefined\") {\n return config.callbacks.handlers;\n }\n\n return [];\n })();\n\n const messagesHandler = callbacks.find(\n (cb): cb is StreamMessagesHandler =>\n \"name\" in cb && cb.name === \"StreamMessagesHandler\"\n );\n\n if (messagesHandler) {\n const metadata = config.metadata ?? {};\n const namespace = (\n (metadata.langgraph_checkpoint_ns ?? \"\") as string\n ).split(\"|\");\n\n messagesHandler._emit(\n [namespace, metadata],\n validMessage,\n undefined,\n false\n );\n }\n\n if (stateKey) {\n config.configurable?.__pregel_send?.([[stateKey, validMessage]]);\n }\n\n return validMessage;\n}\n"],"mappings":";;;;;;AAWA,MAAa,sBAAsB;;;;;;AAYnC,SAAgB,qBACd,MACA,OACe;CACf,MAAM,YAAY,MAAM,QAAQ,QAAQ,OAAO,CAAC;CAChD,MAAM,aAAa,MAAM,QAAQ,SAAS,QAAQ,CAAC;CAEnD,MAAM,eAAgB,UAAgC,IACpD;CAEF,MAAM,gBAAiB,WAAiC,IACtD;AAGF,MAAK,MAAM,KAAK,aACd,KAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,QAAW;AACvC,IAAE,KAAK;AACP,IAAE,UAAU,KAAK,EAAE;;CAIvB,IAAIA;AACJ,MAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK,GAAG;EAChD,MAAM,IAAI,cAAc;AACxB,MAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,QAAW;AACvC,KAAE,KAAK;AACP,KAAE,UAAU,KAAK,EAAE;;AAGrB,MAAI,EAAE,cAAc,YAAY,EAAE,OAAO,oBACvC,gBAAe;;AAInB,KAAI,gBAAgB,KAAM,QAAO,cAAc,MAAM,eAAe;CAGpE,MAAM,SAAS,CAAC,GAAG;CACnB,MAAM,aAAa,IAAI,IAAI,OAAO,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI;CACvD,MAAM,8BAAc,IAAI;AACxB,MAAK,MAAM,KAAK,eAAe;EAC7B,MAAM,cAAc,WAAW,IAAI,EAAE;AACrC,MAAI,gBAAgB,OAClB,KAAI,EAAE,cAAc,SAClB,aAAY,IAAI,EAAE;OACb;AACL,eAAY,OAAO,EAAE;AACrB,UAAO,eAAe;;OAEnB;AACL,OAAI,EAAE,cAAc,SAClB,OAAM,IAAI,MACR,kEAAkE,EAAE,GAAG;AAG3E,cAAW,IAAI,EAAE,IAAI,OAAO;AAC5B,UAAO,KAAK;;;AAGhB,QAAO,OAAO,QAAQ,MAAM,CAAC,YAAY,IAAI,EAAE;;;AAIjD,IAAa,eAAb,cAAkC,WAIhC;CACA,cAAc;AACZ,QAAM,EACJ,UAAU,EACR,UAAU;GACR,SAAS;GACT,eAAe;;;;;;;;;;;;;;;;AAmBzB,SAAgB,YACd,SACA,SAOA;CACA,MAAMC,aAGJ,WAAW,mCAAmC;AAEhD,KAAI,cAAc,KAChB,OAAM,IAAI,MAAM;CAGlB,MAAM,EAAE,UAAU,aAAc,GAAG,WAAW;CAC9C,IAAIC,WAA+B,gBAAgB;AACnD,KAAI,iBAAiB,KAAM,YAAW;CAGtC,MAAM,eAAe,2BAA2B;AAChD,KAAI,CAAC,aAAa,GAAI,OAAM,IAAI,MAAM;CAEtC,MAAM,mBAAmB;AACvB,MAAI,MAAM,QAAQ,OAAO,WACvB,QAAO,OAAO;AAGhB,MAAI,OAAO,OAAO,cAAc,YAC9B,QAAO,OAAO,UAAU;AAG1B,SAAO;;CAGT,MAAM,kBAAkB,UAAU,MAC/B,OACC,UAAU,MAAM,GAAG,SAAS;AAGhC,KAAI,iBAAiB;EACnB,MAAM,WAAW,OAAO,YAAY;EACpC,MAAM,aACH,SAAS,2BAA2B,IACrC,MAAM;AAER,kBAAgB,MACd,CAAC,WAAW,WACZ,cACA,QACA;;AAIJ,KAAI,SACF,QAAO,cAAc,gBAAgB,CAAC,CAAC,UAAU;AAGnD,QAAO"}
@@ -1,5 +1,5 @@
1
- import { ReducedZodChannel, SchemaMeta } from "./zod/meta.cjs";
2
1
  import { BinaryOperatorAggregate } from "../channels/binop.cjs";
2
+ import { ReducedZodChannel, SchemaMeta } from "./zod/meta.cjs";
3
3
  import { AnnotationRoot } from "./annotation.cjs";
4
4
  import { Messages } from "./message.cjs";
5
5
  import * as _langchain_core_utils_types0 from "@langchain/core/utils/types";
@@ -1,5 +1,5 @@
1
- import { ReducedZodChannel, SchemaMeta } from "./zod/meta.js";
2
1
  import { BinaryOperatorAggregate } from "../channels/binop.js";
2
+ import { ReducedZodChannel, SchemaMeta } from "./zod/meta.js";
3
3
  import { AnnotationRoot } from "./annotation.js";
4
4
  import { Messages } from "./message.js";
5
5
  import { BaseMessage } from "@langchain/core/messages";
@@ -106,6 +106,10 @@ var StateGraph = class extends require_graph.Graph {
106
106
  _configSchema;
107
107
  /** @internal */
108
108
  _configRuntimeSchema;
109
+ /** @internal */
110
+ _interrupt;
111
+ /** @internal */
112
+ _writer;
109
113
  constructor(fields, contextSchema) {
110
114
  super();
111
115
  if (isZodStateGraphArgsWithStateSchema(fields)) {
@@ -146,7 +150,12 @@ var StateGraph = class extends require_graph.Graph {
146
150
  this._addSchema(this._schemaDefinition);
147
151
  this._addSchema(this._inputDefinition);
148
152
  this._addSchema(this._outputDefinition);
149
- if ((0, __langchain_core_utils_types.isInteropZodObject)(contextSchema)) this._configRuntimeSchema = contextSchema;
153
+ function isOptions(options) {
154
+ return typeof options === "object" && options != null && !("spec" in options) && !(0, __langchain_core_utils_types.isInteropZodObject)(options);
155
+ }
156
+ if (isOptions(contextSchema)) {
157
+ if ((0, __langchain_core_utils_types.isInteropZodObject)(contextSchema.context)) this._configRuntimeSchema = contextSchema.context;
158
+ } else if ((0, __langchain_core_utils_types.isInteropZodObject)(contextSchema)) this._configRuntimeSchema = contextSchema;
150
159
  }
151
160
  get allEdges() {
152
161
  return new Set([...this.edges, ...Array.from(this.waitingEdges).flatMap(([starts, end]) => starts.map((start) => [start, end]))]);
@@ -169,11 +178,7 @@ var StateGraph = class extends require_graph.Graph {
169
178
  function isMultipleNodes(args$1) {
170
179
  return args$1.length >= 1 && typeof args$1[0] !== "string";
171
180
  }
172
- const nodes = isMultipleNodes(args) ? Array.isArray(args[0]) ? args[0] : Object.entries(args[0]).map(([key, action]) => [
173
- key,
174
- action,
175
- action[Symbol.for("langgraph.state.node")] ?? void 0
176
- ]) : [[
181
+ const nodes = isMultipleNodes(args) ? Array.isArray(args[0]) ? args[0] : Object.entries(args[0]).map(([key, action]) => [key, action]) : [[
177
182
  args[0],
178
183
  args[1],
179
184
  args[2]
@@ -228,11 +233,7 @@ var StateGraph = class extends require_graph.Graph {
228
233
  return this;
229
234
  }
230
235
  addSequence(nodes) {
231
- const parsedNodes = Array.isArray(nodes) ? nodes : Object.entries(nodes).map(([key, action]) => [
232
- key,
233
- action,
234
- action[Symbol.for("langgraph.state.node")] ?? void 0
235
- ]);
236
+ const parsedNodes = Array.isArray(nodes) ? nodes : Object.entries(nodes);
236
237
  if (parsedNodes.length === 0) throw new Error("Sequence requires at least one node.");
237
238
  let previousNode;
238
239
  for (const [key, action, options] of parsedNodes) {
@@ -434,6 +435,9 @@ var CompiledStateGraph = class extends require_graph.CompiledGraph {
434
435
  if (schema != null) return (0, __langchain_core_utils_types.interopParse)(schema, input);
435
436
  return input;
436
437
  }
438
+ isInterrupted(input) {
439
+ return require_constants.isInterrupted(input);
440
+ }
437
441
  async _validateContext(config) {
438
442
  const configSchema = this.builder._configRuntimeSchema;
439
443
  if ((0, __langchain_core_utils_types.isInteropZodObject)(configSchema)) (0, __langchain_core_utils_types.interopParse)(configSchema, config);
@@ -486,15 +490,8 @@ function _getControlBranch() {
486
490
  });
487
491
  return new require_graph.Branch({ path: CONTROL_BRANCH_PATH });
488
492
  }
489
- function typedNode(_state, _options) {
490
- return (func, options) => {
491
- Object.assign(func, { [Symbol.for("langgraph.state.node")]: options });
492
- return func;
493
- };
494
- }
495
493
 
496
494
  //#endregion
497
495
  exports.CompiledStateGraph = CompiledStateGraph;
498
496
  exports.StateGraph = StateGraph;
499
- exports.typedNode = typedNode;
500
497
  //# sourceMappingURL=state.cjs.map