@langchain/langgraph 1.1.3 → 1.1.5

package/dist/graph/messages_reducer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"messages_reducer.d.ts","names":["BaseMessage","BaseMessageLike","REMOVE_ALL_MESSAGES","Messages","Array","messagesStateReducer"],"sources":["../../src/graph/messages_reducer.d.ts"],"sourcesContent":["import { BaseMessage, BaseMessageLike } from \"@langchain/core/messages\";\n/**\n * Special value that signifies the intent to remove all previous messages in the state reducer.\n * Used as the unique identifier for a `RemoveMessage` instance which, when encountered,\n * causes all prior messages to be discarded, leaving only those following this marker.\n */\nexport declare const REMOVE_ALL_MESSAGES = \"__remove_all__\";\n/**\n * Type that represents an acceptable input for the messages state reducer.\n *\n * - Can be a single `BaseMessage` or `BaseMessageLike`.\n * - Can be an array of `BaseMessage` or `BaseMessageLike`.\n */\nexport type Messages = Array<BaseMessage | BaseMessageLike> | BaseMessage | BaseMessageLike;\n/**\n * Reducer function for combining two sets of messages in LangGraph's state system.\n *\n * This reducer handles several tasks:\n * 1. Normalizes both `left` and `right` message inputs to arrays.\n * 2. Coerces any message-like objects into real `BaseMessage` instances.\n * 3. Ensures all messages have unique, stable IDs by generating missing ones.\n * 4. If a `RemoveMessage` instance is encountered in `right` with the ID `REMOVE_ALL_MESSAGES`,\n *    all previous messages are discarded and only the subsequent messages in `right` are returned.\n * 5. Otherwise, merges `left` and `right` messages together following these rules:\n *    - If a message in `right` shares an ID with a message in `left`:\n *      - If it is a `RemoveMessage`, that message (by ID) is marked for removal.\n *      - If it is a normal message, it replaces the message with the same ID from `left`.\n *    - If a message in `right` **does not exist** in `left`:\n *      - If it is a `RemoveMessage`, this is considered an error (cannot remove non-existent ID).\n *      - Otherwise, the message is appended.\n *    - Messages flagged for removal are omitted from the final output.\n *\n * @param left - The existing array (or single message) of messages from current state.\n * @param right - The new array (or single message) of messages to be applied.\n * @returns A new array of `BaseMessage` objects representing the updated state.\n *\n * @throws Error if a `RemoveMessage` is used to delete a message with an ID that does not exist in the merged list.\n *\n * @example\n * ```ts\n * const msg1 = new AIMessage(\"hello\");\n * const msg2 = new HumanMessage(\"hi\");\n * const removal = new RemoveMessage({ id: msg1.id });\n * const newState = messagesStateReducer([msg1], [msg2, removal]);\n * // newState will only contain msg2 (msg1 is removed)\n * ```\n */\nexport declare function messagesStateReducer(left: Messages, right: Messages): BaseMessage[];\n"],"mappings":";;;;;;AAMA;AAOA;;AAA6BA,cAPRE,mBAAAA,GAOQF,gBAAAA;;;;;;AAkC7B;AAA4C,KAlChCG,QAAAA,GAAWC,KAkCqB,CAlCfJ,WAkCe,GAlCDC,eAkCC,CAAA,GAlCkBD,WAkClB,GAlCgCC,eAkChC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iBAApBI,oBAAAA,OAA2BF,iBAAiBA,WAAWH"}
+{"version":3,"file":"messages_reducer.d.ts","names":[],"sources":["../../src/graph/messages_reducer.ts"],"mappings":";;;;;AAaA;;;cAAa,mBAAA;;AAQb;;;;;KAAY,QAAA,GACR,KAAA,CAAM,WAAA,GAAc,eAAA,IACpB,WAAA,GACA,eAAA;;;;;;;;;;;;AAmCJ;;;;;;;;;;;;;;;;;;;;;;iBAAgB,oBAAA,CACd,IAAA,EAAM,QAAA,EACN,KAAA,EAAO,QAAA,GACN,WAAA"}

package/dist/graph/state.cjs

@@ -32,6 +32,36 @@ const PartialStateSchema = Symbol.for("langgraph.state.partial");
 * After adding nodes and edges to your graph, you must call `.compile()` on it before
 * you can use it.
 *
+* @typeParam SD - The state definition used to construct the graph. Can be an
+*   {@link AnnotationRoot}, {@link StateSchema}, or Zod object schema. This is the
+*   primary generic from which `S` and `U` are derived.
+*
+* @typeParam S - The full state type representing the complete shape of your graph's
+*   state after all reducers have been applied. Automatically inferred from `SD`.
+*
+* @typeParam U - The update type representing what nodes can return to modify state.
+*   Typically a partial of the state type. Automatically inferred from `SD`.
+*
+* @typeParam N - Union of all node names in the graph (e.g., `"agent" | "tool"`).
+*   Accumulated as you call `.addNode()`. Used for type-safe routing.
+*
+* @typeParam I - The input schema definition. Set via the `input` option in the
+*   constructor to restrict what data the graph accepts when invoked.
+*
+* @typeParam O - The output schema definition. Set via the `output` option in the
+*   constructor to restrict what data the graph returns after execution.
+*
+* @typeParam C - The config/context schema definition. Set via the `context` option
+*   to define additional configuration passed at runtime.
+*
+* @typeParam NodeReturnType - Constrains what types nodes in this graph can return.
+*
+* @typeParam InterruptType - The type for {@link interrupt} resume values. Set via
+*   the `interrupt` option for typed human-in-the-loop patterns.
+*
+* @typeParam WriterType - The type for custom stream writers. Set via the `writer`
+*   option to enable typed custom streaming from within nodes.
+*
 * @example
 * ```ts
 * import {
@@ -325,6 +355,35 @@ function _getChannels(schema) {
 * Final result from building and compiling a {@link StateGraph}.
 * Should not be instantiated directly, only using the StateGraph `.compile()`
 * instance method.
+*
+* @typeParam S - The full state type representing the complete shape of your graph's
+*   state after all reducers have been applied. This is the type you receive when
+*   reading state in nodes or after invoking the graph.
+*
+* @typeParam U - The update type representing what nodes can return to modify state.
+*   Typically a partial of the state type, allowing nodes to update only specific fields.
+*   Can also include {@link Command} objects for advanced control flow.
+*
+* @typeParam N - Union of all node names in the graph (e.g., `"agent" | "tool"`).
+*   Used for type-safe routing with {@link Command.goto} and edge definitions.
+*
+* @typeParam I - The input schema definition. Determines what shape of data the graph
+*   accepts when invoked. Defaults to the main state schema if not explicitly set.
+*
+* @typeParam O - The output schema definition. Determines what shape of data the graph
+*   returns after execution. Defaults to the main state schema if not explicitly set.
+*
+* @typeParam C - The config/context schema definition. Defines additional configuration
+*   that can be passed to the graph at runtime via {@link LangGraphRunnableConfig}.
+*
+* @typeParam NodeReturnType - Constrains what types nodes in this graph can return.
+*   Useful for enforcing consistent return patterns across all nodes.
+*
+* @typeParam InterruptType - The type of values that can be passed when resuming from
+*   an {@link interrupt}. Used with human-in-the-loop patterns.
+*
+* @typeParam WriterType - The type for custom stream writers. Used with the `writer`
+*   option to enable typed custom streaming from within nodes.
 */
 var CompiledStateGraph = class extends require_graph.CompiledGraph {
 	/**

package/dist/graph/state.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"state.cjs","names":["Graph","schemaMetaRegistry","StateGraphInputError","StateSchema","isStateGraphInit","AnnotationRoot","isStateDefinitionInit","CHECKPOINT_NAMESPACE_SEPARATOR","CHECKPOINT_NAMESPACE_END","END","START","Runnable","RunnableCallable","isPregelLike","EphemeralValue","SELF","getChannel","CompiledGraph","isCommand","Command","InvalidUpdateError","PASSTHROUGH","PregelNode","TAG_HIDDEN","ChannelWrite","LastValueAfterFinish","NamedBarrierValueAfterFinish","NamedBarrierValue","_isSend","ChannelRead","isInterrupted","ParentCommand","Branch"],"sources":["../../src/graph/state.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-use-before-define */\nimport { _coerceToRunnable, Runnable } from \"@langchain/core/runnables\";\nimport {\n  All,\n  type BaseCache,\n  BaseCheckpointSaver,\n  BaseStore,\n} from \"@langchain/langgraph-checkpoint\";\nimport {\n  type InteropZodObject,\n  interopParse,\n  interopZodObjectPartial,\n  isInteropZodObject,\n} from \"@langchain/core/utils/types\";\nimport type {\n  RunnableLike,\n  LangGraphRunnableConfig,\n  Runtime,\n} from \"../pregel/runnable_types.js\";\nimport { BaseChannel } from \"../channels/base.js\";\nimport {\n  CompiledGraph,\n  Graph,\n  Branch,\n  AddNodeOptions,\n  NodeSpec,\n} from \"./graph.js\";\nimport {\n  ChannelWrite,\n  ChannelWriteEntry,\n  ChannelWriteTupleEntry,\n  PASSTHROUGH,\n} from \"../pregel/write.js\";\nimport { ChannelRead, PregelNode } from \"../pregel/read.js\";\nimport {\n  NamedBarrierValue,\n  NamedBarrierValueAfterFinish,\n} from \"../channels/named_barrier_value.js\";\nimport { EphemeralValue } from \"../channels/ephemeral_value.js\";\nimport { RunnableCallable } from \"../utils.js\";\nimport {\n  isCommand,\n  _isSend,\n  CHECKPOINT_NAMESPACE_END,\n  CHECKPOINT_NAMESPACE_SEPARATOR,\n  Command,\n  SELF,\n  Send,\n  START,\n  END,\n  TAG_HIDDEN,\n  CommandInstance,\n  isInterrupted,\n  Interrupt,\n  INTERRUPT,\n} from \"../constants.js\";\nimport {\n  InvalidUpdateError,\n  ParentCommand,\n  StateGraphInputError,\n} from \"../errors.js\";\nimport {\n  AnnotationRoot,\n  getChannel,\n  SingleReducer,\n  StateDefinition,\n  StateType,\n} from \"./annotation.js\";\nimport { StateSchema } from \"../state/index.js\";\nimport type { CachePolicy, RetryPolicy } from \"../pregel/utils/index.js\";\nimport { isPregelLike } from \"../pregel/utils/subgraph.js\";\nimport { LastValueAfterFinish } from \"../channels/last_value.js\";\nimport { type SchemaMetaRegistry, schemaMetaRegistry } from \"./zod/meta.js\";\nimport type {\n  InferInterruptResumeType,\n  InferInterruptInputType,\n} from \"../interrupt.js\";\nimport type { InferWriterType } from \"../writer.js\";\nimport type { AnyStateSchema } from \"../state/schema.js\";\nimport {\n  ContextSchemaInit,\n  ExtractStateType,\n  ExtractUpdateType,\n  isStateDefinitionInit,\n  isStateGraphInit,\n  StateGraphInit,\n  StateGraphOptions,\n  ToStateDefinition,\n  type StateDefinitionInit,\n} from \"./types.js\";\n\nconst ROOT = \"__root__\";\n\nexport type ChannelReducers<Channels extends object> = {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  [K in keyof Channels]: SingleReducer<Channels[K], any>;\n};\n\nexport interface StateGraphArgs<Channels extends object | unknown> {\n  channels: Channels extends object\n    ? Channels extends unknown[]\n      ? ChannelReducers<{ __root__: Channels }>\n      : ChannelReducers<Channels>\n    : ChannelReducers<{ __root__: Channels }>;\n}\n\nexport type StateGraphNodeSpec<RunInput, RunOutput> = NodeSpec<\n  RunInput,\n  RunOutput\n> & {\n  input?: StateDefinition;\n  retryPolicy?: RetryPolicy;\n  cachePolicy?: CachePolicy;\n};\n\n/**\n * Options for StateGraph.addNode() method.\n *\n * @template Nodes - Node name constraints\n * @template InputSchema - Per-node input schema type (inferred from options.input)\n */\nexport type StateGraphAddNodeOptions<\n  Nodes extends string = string,\n  InputSchema extends StateDefinitionInit | undefined =\n    | StateDefinitionInit\n    | undefined\n> = {\n  retryPolicy?: RetryPolicy;\n  cachePolicy?: CachePolicy | boolean;\n  input?: InputSchema;\n} & AddNodeOptions<Nodes>;\n\nexport type StateGraphArgsWithStateSchema<\n  SD extends StateDefinition,\n  I extends StateDefinition,\n  O extends StateDefinition\n> = {\n  stateSchema: AnnotationRoot<SD>;\n  input?: AnnotationRoot<I>;\n  output?: AnnotationRoot<O>;\n};\n\nexport type StateGraphArgsWithInputOutputSchemas<\n  SD extends StateDefinition,\n  O extends StateDefinition = SD\n> = {\n  input: AnnotationRoot<SD>;\n  output: AnnotationRoot<O>;\n};\n\ntype ExtractStateDefinition<T> = T extends AnyStateSchema\n  ? T // Keep StateSchema as-is to preserve type information\n  : T extends StateDefinitionInit\n  ? ToStateDefinition<T>\n  : StateDefinition;\n\ntype NodeAction<\n  S,\n  U,\n  C extends StateDefinitionInit,\n  InterruptType,\n  WriterType\n> = RunnableLike<\n  S,\n  U extends object ? U & Record<string, any> : U, // eslint-disable-line @typescript-eslint/no-explicit-any\n  Runtime<StateType<ToStateDefinition<C>>, InterruptType, WriterType>\n>;\n\ntype StrictNodeAction<\n  S,\n  U,\n  C extends StateDefinitionInit,\n  Nodes extends string,\n  InterruptType,\n  WriterType\n> = RunnableLike<\n  Prettify<S>,\n  | U\n  | Command<\n      InferInterruptResumeType<InterruptType>,\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      U & Record<string, any>,\n      Nodes\n    >,\n  Runtime<StateType<ToStateDefinition<C>>, InterruptType, WriterType>\n>;\n\nconst PartialStateSchema = Symbol.for(\"langgraph.state.partial\");\ntype PartialStateSchema = typeof PartialStateSchema;\n\ntype MergeReturnType<Prev, Curr> = Prev & Curr extends infer T\n  ? { [K in keyof T]: T[K] } & unknown\n  : never;\n\ntype Prettify<T> = {\n  [K in keyof T]: T[K];\n  // eslint-disable-next-line @typescript-eslint/ban-types\n} & {};\n\n/**\n * A graph whose nodes communicate by reading and writing to a shared state.\n * Each node takes a defined `State` as input and returns a `Partial<State>`.\n *\n * Each state key can optionally be annotated with a reducer function that\n * will be used to aggregate the values of that key received from multiple nodes.\n * The signature of a reducer function is (left: Value, right: UpdateValue) => Value.\n *\n * See {@link Annotation} for more on defining state.\n *\n * After adding nodes and edges to your graph, you must call `.compile()` on it before\n * you can use it.\n *\n * @example\n * ```ts\n * import {\n *   type BaseMessage,\n *   AIMessage,\n *   HumanMessage,\n * } from \"@langchain/core/messages\";\n * import { StateGraph, Annotation } from \"@langchain/langgraph\";\n *\n * // Define a state with a single key named \"messages\" that will\n * // combine a returned BaseMessage or arrays of BaseMessages\n * const StateAnnotation = Annotation.Root({\n *   sentiment: Annotation<string>,\n *   messages: Annotation<BaseMessage[]>({\n *     reducer: (left: BaseMessage[], right: BaseMessage | BaseMessage[]) => {\n *       if (Array.isArray(right)) {\n *         return left.concat(right);\n *       }\n *       return left.concat([right]);\n *     },\n *     default: () => [],\n *   }),\n * });\n *\n * const graphBuilder = new StateGraph(StateAnnotation);\n *\n * // A node in the graph that returns an object with a \"messages\" key\n * // will update the state by combining the existing value with the returned one.\n * const myNode = (state: typeof StateAnnotation.State) => {\n *   return {\n *     messages: [new AIMessage(\"Some new response\")],\n *     sentiment: \"positive\",\n *   };\n * };\n *\n * const graph = graphBuilder\n *   .addNode(\"myNode\", myNode)\n *   .addEdge(\"__start__\", \"myNode\")\n *   .addEdge(\"myNode\", \"__end__\")\n *   .compile();\n *\n * await graph.invoke({ messages: [new HumanMessage(\"how are you?\")] });\n *\n * // {\n * //   messages: [HumanMessage(\"how are you?\"), AIMessage(\"Some new response\")],\n * //   sentiment: \"positive\",\n * // }\n * ```\n */\nexport class StateGraph<\n  SD extends StateDefinitionInit | unknown,\n  S = ExtractStateType<SD>,\n  U = ExtractUpdateType<SD, S>,\n  N extends string = typeof START,\n  I extends StateDefinitionInit = ExtractStateDefinition<SD>,\n  O extends StateDefinitionInit = ExtractStateDefinition<SD>,\n  C extends StateDefinitionInit = StateDefinition,\n  NodeReturnType = unknown,\n  InterruptType = unknown,\n  WriterType = unknown\n> extends Graph<N, S, U, StateGraphNodeSpec<S, U>, ToStateDefinition<C>> {\n  channels: Record<string, BaseChannel> = {};\n\n  // TODO: this doesn't dedupe edges as in py, so worth fixing at some point\n  waitingEdges: Set<[N[], N]> = new Set();\n\n  /** @internal */\n  _schemaDefinition: StateDefinition;\n\n  /** @internal */\n  _schemaRuntimeDefinition: InteropZodObject | AnyStateSchema | undefined;\n\n  /** @internal */\n  _inputDefinition: I;\n\n  /** @internal */\n  _inputRuntimeDefinition:\n    | InteropZodObject\n    | AnyStateSchema\n    | PartialStateSchema\n    | undefined;\n\n  /** @internal */\n  _outputDefinition: O;\n\n  /** @internal */\n  _outputRuntimeDefinition: InteropZodObject | AnyStateSchema | undefined;\n\n  /**\n   * Map schemas to managed values\n   * @internal\n   */\n  _schemaDefinitions = new Map();\n\n  /** @internal */\n  _metaRegistry: SchemaMetaRegistry = schemaMetaRegistry;\n\n  /** @internal Used only for typing. */\n  _configSchema: ToStateDefinition<C> | undefined;\n\n  /** @internal */\n  _configRuntimeSchema: InteropZodObject | undefined;\n\n  /** @internal */\n  _interrupt: InterruptType;\n\n  /** @internal */\n  _writer: WriterType;\n\n  declare Node: StrictNodeAction<S, U, C, N, InterruptType, WriterType>;\n\n  /**\n   * Create a new StateGraph for building stateful, multi-step workflows.\n   *\n   * Accepts state definitions via `Annotation.Root`, `StateSchema`, or Zod schemas.\n   *\n   * @example Direct schema\n   * ```ts\n   * const StateAnnotation = Annotation.Root({\n   *   messages: Annotation<string[]>({ reducer: (a, b) => [...a, ...b] }),\n   * });\n   * const graph = new StateGraph(StateAnnotation);\n   * ```\n   *\n   * @example Direct schema with input/output filtering\n   * ```ts\n   * const graph = new StateGraph(StateAnnotation, {\n   *   input: InputSchema,\n   *   output: OutputSchema,\n   * });\n   * ```\n   *\n   * @example Object pattern with state, input, output\n   * ```ts\n   * const graph = new StateGraph({\n   *   state: FullStateSchema,\n   *   input: InputSchema,\n   *   output: OutputSchema,\n   * });\n   * ```\n   *\n   * @example Input/output only (state inferred from input)\n   * ```ts\n   * const graph = new StateGraph({\n   *   input: InputAnnotation,\n   *   output: OutputAnnotation,\n   * });\n   * ```\n   */\n  constructor(\n    state: SD extends StateDefinitionInit ? SD : never,\n    options?:\n      | C\n      | AnnotationRoot<ToStateDefinition<C>>\n      | StateGraphOptions<I, O, C, N, InterruptType, WriterType>\n  );\n\n  constructor(\n    fields: SD extends StateDefinition\n      ? StateGraphArgsWithInputOutputSchemas<SD, ToStateDefinition<O>>\n      : never,\n    contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>\n  );\n\n  constructor(\n    fields: SD extends StateDefinition\n      ?\n          | AnnotationRoot<SD>\n          | StateGraphArgsWithStateSchema<\n              SD,\n              ToStateDefinition<I>,\n              ToStateDefinition<O>\n            >\n      : never,\n    contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>\n  );\n\n  constructor(\n    init: Omit<\n      StateGraphInit<\n        SD extends StateDefinitionInit ? SD : StateDefinitionInit,\n        SD extends StateDefinitionInit ? SD : StateDefinitionInit,\n        O,\n        C extends ContextSchemaInit ? C : undefined,\n        N,\n        InterruptType,\n        WriterType\n      >,\n      \"state\" | \"stateSchema\" | \"input\"\n    > & {\n      input: SD extends StateDefinitionInit ? SD : never;\n      state?: never;\n      stateSchema?: never;\n    },\n    contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>\n  );\n\n  constructor(\n    init: StateGraphInit<\n      SD extends StateDefinitionInit ? SD : StateDefinitionInit,\n      I,\n      O,\n      C extends ContextSchemaInit ? C : undefined,\n      N,\n      InterruptType,\n      WriterType\n    >\n  );\n\n  /** @deprecated Use `Annotation.Root`, `StateSchema`, or Zod schemas instead. */\n  constructor(\n    fields: StateGraphArgs<S>,\n    contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>\n  );\n\n  constructor(\n    stateOrInit:\n      | StateDefinitionInit\n      | StateGraphInit<StateDefinitionInit, I, O>\n      | StateGraphArgs<S>,\n    options?:\n      | C\n      | AnnotationRoot<ToStateDefinition<C>>\n      | StateGraphOptions<\n          I,\n          O,\n          C extends ContextSchemaInit ? C : undefined,\n          N,\n          InterruptType,\n          WriterType\n        >\n  ) {\n    super();\n\n    // Normalize all input patterns to StateGraphInit format\n    const init = this._normalizeToStateGraphInit(stateOrInit, options);\n\n    // Resolve state schema: state > stateSchema (deprecated) > input\n    const stateSchema = init.state ?? init.stateSchema ?? init.input;\n    if (!stateSchema) {\n      throw new StateGraphInputError();\n    }\n\n    // Get channel definitions from the schema (may contain channel factories)\n    const stateChannelDef = this._getChannelsFromSchema(stateSchema);\n\n    // Set schema definitions (these may contain channel factories)\n    this._schemaDefinition = stateChannelDef;\n\n    // Set runtime definitions for validation\n    if (StateSchema.isInstance(stateSchema)) {\n      this._schemaRuntimeDefinition = stateSchema;\n    } else if (isInteropZodObject(stateSchema)) {\n      this._schemaRuntimeDefinition = stateSchema;\n    }\n\n    // Set input runtime definition\n    if (init.input) {\n      if (StateSchema.isInstance(init.input)) {\n        this._inputRuntimeDefinition = init.input;\n      } else if (isInteropZodObject(init.input)) {\n        this._inputRuntimeDefinition = init.input;\n      } else {\n        this._inputRuntimeDefinition = PartialStateSchema;\n      }\n    } else {\n      this._inputRuntimeDefinition = PartialStateSchema;\n    }\n\n    // Set output runtime definition\n    if (init.output) {\n      if (StateSchema.isInstance(init.output)) {\n        this._outputRuntimeDefinition = init.output;\n      } else if (isInteropZodObject(init.output)) {\n        this._outputRuntimeDefinition = init.output;\n      } else {\n        this._outputRuntimeDefinition = this._schemaRuntimeDefinition;\n      }\n    } else {\n      this._outputRuntimeDefinition = this._schemaRuntimeDefinition;\n    }\n\n    // Set input/output definitions (default to state)\n    const inputChannelDef = init.input\n      ? this._getChannelsFromSchema(init.input)\n      : stateChannelDef;\n    const outputChannelDef = init.output\n      ? (this._getChannelsFromSchema(init.output) as O)\n      : stateChannelDef;\n    this._inputDefinition = inputChannelDef as I;\n    this._outputDefinition = outputChannelDef as O;\n\n    // Add all schemas (_addSchema instantiates channel factories and populates this.channels)\n    this._addSchema(this._schemaDefinition);\n    this._addSchema(this._inputDefinition);\n    this._addSchema(this._outputDefinition);\n\n    // Handle context schema\n    if (init.context) {\n      if (isInteropZodObject(init.context)) {\n        this._configRuntimeSchema = init.context;\n      }\n    }\n\n    // Handle interrupt and writer\n    this._interrupt = init.interrupt as InterruptType;\n    this._writer = init.writer as WriterType;\n  }\n\n  /**\n   * Normalize all constructor input patterns to a unified StateGraphInit object.\n   * @internal\n   */\n  private _normalizeToStateGraphInit(\n    stateOrInit: unknown,\n    options?: unknown\n  ): StateGraphInit<StateDefinitionInit, I, O, C> {\n    // Check if already StateGraphInit format\n    if (isStateGraphInit(stateOrInit)) {\n      // Second arg can be either a direct context schema or an options object\n      if (isInteropZodObject(options) || AnnotationRoot.isInstance(options)) {\n        return {\n          ...stateOrInit,\n          context: options as C,\n        };\n      }\n      // Merge any 2nd arg options\n      const opts = options as StateGraphOptions<I, O> | undefined;\n      return {\n        ...stateOrInit,\n        input: stateOrInit.input ?? opts?.input,\n        output: stateOrInit.output ?? opts?.output,\n        context: stateOrInit.context ?? opts?.context,\n        interrupt: stateOrInit.interrupt ?? opts?.interrupt,\n        writer: stateOrInit.writer ?? opts?.writer,\n        nodes: stateOrInit.nodes ?? opts?.nodes,\n      } as StateGraphInit<StateDefinitionInit, I, O, C>;\n    }\n\n    // Check if direct schema (StateSchema, Zod, Annotation, StateDefinition)\n    if (isStateDefinitionInit(stateOrInit)) {\n      // Second arg can be either a direct context schema or an options object\n      if (isInteropZodObject(options) || AnnotationRoot.isInstance(options)) {\n        return {\n          state: stateOrInit,\n          context: options as C,\n        };\n      }\n      const opts = options as StateGraphOptions<I, O> | undefined;\n      return {\n        state: stateOrInit as StateDefinitionInit,\n        input: opts?.input as I,\n        output: opts?.output as O,\n        context: opts?.context,\n        interrupt: opts?.interrupt,\n        writer: opts?.writer,\n        nodes: opts?.nodes,\n      };\n    }\n\n    // Check for legacy { channels } format\n    if (isStateGraphArgs(stateOrInit as StateGraphArgs<S>)) {\n      const legacyArgs = stateOrInit as StateGraphArgs<S>;\n      const spec = _getChannels(legacyArgs.channels);\n      return {\n        state: spec as StateDefinitionInit,\n      };\n    }\n\n    throw new StateGraphInputError();\n  }\n\n  /**\n   * Convert any supported schema type to a StateDefinition (channel map).\n   * @internal\n   */\n  private _getChannelsFromSchema(schema: StateDefinitionInit): StateDefinition {\n    if (StateSchema.isInstance(schema)) {\n      return schema.getChannels();\n    }\n\n    if (isInteropZodObject(schema)) {\n      return this._metaRegistry.getChannelsForSchema(schema);\n    }\n\n    // AnnotationRoot - has .spec property that is the StateDefinition\n    if (\n      typeof schema === \"object\" &&\n      \"lc_graph_name\" in schema &&\n      (schema as { lc_graph_name: unknown }).lc_graph_name === \"AnnotationRoot\"\n    ) {\n      return (schema as AnnotationRoot<StateDefinition>).spec;\n    }\n\n    // StateDefinition (raw channel map) - return as-is\n    if (\n      typeof schema === \"object\" &&\n      !Array.isArray(schema) &&\n      Object.keys(schema).length > 0\n    ) {\n      return schema as StateDefinition;\n    }\n\n    throw new StateGraphInputError(\n      \"Invalid schema type. Expected StateSchema, Zod object, AnnotationRoot, or StateDefinition.\"\n    );\n  }\n\n  get allEdges(): Set<[string, string]> {\n    return new Set([\n      ...this.edges,\n      ...Array.from(this.waitingEdges).flatMap(([starts, end]) =>\n        starts.map((start) => [start, end] as [string, string])\n      ),\n    ]);\n  }\n\n  _addSchema(stateDefinition: StateDefinitionInit) {\n    if (this._schemaDefinitions.has(stateDefinition)) {\n      return;\n    }\n    // TODO: Support managed values\n    this._schemaDefinitions.set(stateDefinition, stateDefinition);\n    for (const [key, val] of Object.entries(stateDefinition)) {\n      let channel;\n      if (typeof val === \"function\") {\n        channel = val();\n      } else {\n        channel = val;\n      }\n      if (this.channels[key] !== undefined) {\n        if (!this.channels[key].equals(channel)) {\n          if (channel.lc_graph_name !== \"LastValue\") {\n            throw new Error(\n              `Channel \"${key}\" already exists with a different type.`\n            );\n          }\n        }\n      } else {\n        this.channels[key] = channel;\n      }\n    }\n  }\n\n  override addNode<\n    K extends string,\n    NodeMap extends Record<K, NodeAction<S, U, C, InterruptType, WriterType>>\n  >(\n    nodes: NodeMap\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<\n      NodeReturnType,\n      {\n        [key in keyof NodeMap]: NodeMap[key] extends NodeAction<\n          S,\n          infer U,\n          C,\n          InterruptType,\n          WriterType\n        >\n          ? U\n          : never;\n      }\n    >\n  >;\n\n  override addNode<K extends string, NodeInput = S, NodeOutput extends U = U>(\n    nodes:\n      | [\n          key: K,\n          action: NodeAction<\n            NodeInput,\n            NodeOutput,\n            C,\n            InterruptType,\n            WriterType\n          >,\n          options?: StateGraphAddNodeOptions\n        ][]\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  >;\n\n  override addNode<\n    K extends string,\n    InputSchema extends StateDefinitionInit,\n    NodeOutput extends U = U\n  >(\n    key: K,\n    action: NodeAction<\n      ExtractStateType<InputSchema>,\n      NodeOutput,\n      C,\n      InterruptType,\n      WriterType\n    >,\n    options: StateGraphAddNodeOptions<N | K, InputSchema>\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  >;\n\n  override addNode<\n    K extends string,\n    InputSchema extends StateDefinitionInit,\n    NodeOutput extends U = U\n  >(\n    key: K,\n    action: NodeAction<\n      ExtractStateType<InputSchema>,\n      NodeOutput,\n      C,\n      InterruptType,\n      WriterType\n    >,\n    options: StateGraphAddNodeOptions<N | K, InputSchema>\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  >;\n\n  override addNode<K extends string, NodeInput = S, NodeOutput extends U = U>(\n    key: K,\n    action: NodeAction<NodeInput, NodeOutput, C, InterruptType, WriterType>,\n    options?: StateGraphAddNodeOptions\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  >;\n\n  override addNode<K extends string, NodeInput = S>(\n    key: K,\n    action: NodeAction<NodeInput, U, C, InterruptType, WriterType>,\n    options?: StateGraphAddNodeOptions\n  ): StateGraph<SD, S, U, N | K, I, O, C, NodeReturnType>;\n\n  override addNode<K extends string, NodeInput = S, NodeOutput extends U = U>(\n    ...args:\n      | [\n          key: K,\n          action: NodeAction<\n            NodeInput,\n            NodeOutput,\n            C,\n            InterruptType,\n            WriterType\n          >,\n          options?: StateGraphAddNodeOptions\n        ]\n      | [\n          nodes:\n            | Record<K, NodeAction<NodeInput, U, C, InterruptType, WriterType>>\n            | [\n                key: K,\n                action: NodeAction<NodeInput, U, C, InterruptType, WriterType>,\n                options?: StateGraphAddNodeOptions\n              ][]\n        ]\n  ): StateGraph<SD, S, U, N | K, I, O, C> {\n    function isMultipleNodes(\n      args: unknown[]\n    ): args is [\n      nodes:\n        | Record<K, NodeAction<NodeInput, U, C, InterruptType, WriterType>>\n        | [\n            key: K,\n            action: NodeAction<NodeInput, U, C, InterruptType, WriterType>,\n            options?: AddNodeOptions\n          ][]\n    ] {\n      return args.length >= 1 && typeof args[0] !== \"string\";\n    }\n\n    const nodes = (\n      isMultipleNodes(args) // eslint-disable-line no-nested-ternary\n        ? Array.isArray(args[0])\n          ? args[0]\n          : Object.entries(args[0]).map(([key, action]) => [key, action])\n        : [[args[0], args[1], args[2]]]\n    ) as [\n      K,\n      NodeAction<NodeInput, U, C, InterruptType, WriterType>,\n      StateGraphAddNodeOptions | undefined\n    ][];\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      if (key in this.channels) {\n        throw new Error(\n          `${key} is already being used as a state attribute (a.k.a. a channel), cannot also be used as a node name.`\n        );\n      }\n\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 || key === START) {\n        throw new Error(`Node \\`${key}\\` is reserved.`);\n      }\n\n      let inputSpec: StateDefinition = this._schemaDefinition;\n      if (options?.input !== undefined) {\n        inputSpec = this._getChannelsFromSchema(options.input);\n      }\n      this._addSchema(inputSpec);\n\n      let runnable;\n      if (Runnable.isRunnable(action)) {\n        runnable = action;\n      } else if (typeof action === \"function\") {\n        runnable = new RunnableCallable({\n          func: action,\n          name: key,\n          trace: false,\n        });\n      } else {\n        runnable = _coerceToRunnable(action);\n      }\n\n      let cachePolicy = options?.cachePolicy;\n      if (typeof cachePolicy === \"boolean\") {\n        cachePolicy = cachePolicy ? {} : undefined;\n      }\n\n      const nodeSpec: StateGraphNodeSpec<S, U> = {\n        runnable: runnable as unknown as Runnable<S, U>,\n        retryPolicy: options?.retryPolicy,\n        cachePolicy,\n        metadata: options?.metadata,\n        input: inputSpec ?? this._schemaDefinition,\n        subgraphs: isPregelLike(runnable)\n          ? // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            [runnable as any]\n          : options?.subgraphs,\n        ends: options?.ends,\n        defer: options?.defer,\n      };\n\n      this.nodes[key as unknown as N] = nodeSpec;\n    }\n\n    return this as StateGraph<SD, S, U, N | K, I, O, C>;\n  }\n\n  override addEdge(\n    startKey: typeof START | N | N[],\n    endKey: N | typeof END\n  ): this {\n    if (typeof startKey === \"string\") {\n      return super.addEdge(startKey, endKey);\n    }\n\n    if (this.compiled) {\n      console.warn(\n        \"Adding an edge to a graph that has already been compiled. This will \" +\n          \"not be reflected in the compiled graph.\"\n      );\n    }\n\n    for (const start of startKey) {\n      if (start === END) {\n        throw new Error(\"END cannot be a start node\");\n      }\n      if (!Object.keys(this.nodes).some((node) => node === start)) {\n        throw new Error(`Need to add a node named \"${start}\" first`);\n      }\n    }\n    if (endKey === END) {\n      throw new Error(\"END cannot be an end node\");\n    }\n    if (!Object.keys(this.nodes).some((node) => node === endKey)) {\n      throw new Error(`Need to add a node named \"${endKey}\" first`);\n    }\n\n    this.waitingEdges.add([startKey, endKey]);\n\n    return this;\n  }\n\n  addSequence<K extends string, NodeInput = S, NodeOutput extends U = U>(\n    nodes: [\n      key: K,\n      action: NodeAction<NodeInput, NodeOutput, C, InterruptType, WriterType>,\n      options?: StateGraphAddNodeOptions\n    ][]\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  >;\n\n  addSequence<\n    K extends string,\n    NodeMap extends Record<K, NodeAction<S, U, C, InterruptType, WriterType>>\n  >(\n    nodes: NodeMap\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<\n      NodeReturnType,\n      {\n        [key in keyof NodeMap]: NodeMap[key] extends NodeAction<\n          S,\n          infer U,\n          C,\n          InterruptType,\n          WriterType\n        >\n          ? U\n          : never;\n      }\n    >\n  >;\n\n  addSequence<K extends string, NodeInput = S, NodeOutput extends U = U>(\n    nodes:\n      | [\n          key: K,\n          action: NodeAction<\n            NodeInput,\n            NodeOutput,\n            C,\n            InterruptType,\n            WriterType\n          >,\n          options?: StateGraphAddNodeOptions\n        ][]\n      | Record<\n          K,\n          NodeAction<NodeInput, NodeOutput, C, InterruptType, WriterType>\n        >\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  > {\n    const parsedNodes = Array.isArray(nodes) ? nodes : Object.entries(nodes);\n\n    if (parsedNodes.length === 0) {\n      throw new Error(\"Sequence requires at least one node.\");\n    }\n\n    let previousNode: N | undefined;\n    for (const [key, action, options] of parsedNodes) {\n      if (key in this.nodes) {\n        throw new Error(\n          `Node names must be unique: node with the name \"${key}\" already exists.`\n        );\n      }\n\n      const validKey = key as unknown as N;\n      this.addNode(\n        validKey,\n        action as NodeAction<S, U, C, InterruptType, WriterType>,\n        options\n      );\n      if (previousNode != null) {\n        this.addEdge(previousNode, validKey);\n      }\n\n      previousNode = validKey;\n    }\n\n    return this as StateGraph<\n      SD,\n      S,\n      U,\n      N | K,\n      I,\n      O,\n      C,\n      MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n    >;\n  }\n\n  override compile({\n    checkpointer,\n    store,\n    cache,\n    interruptBefore,\n    interruptAfter,\n    name,\n    description,\n  }: {\n    checkpointer?: BaseCheckpointSaver | boolean;\n    store?: BaseStore;\n    cache?: BaseCache;\n    interruptBefore?: N[] | All;\n    interruptAfter?: N[] | All;\n    name?: string;\n    description?: string;\n  } = {}): CompiledStateGraph<\n    Prettify<S>,\n    Prettify<U>,\n    N,\n    I,\n    O,\n    C,\n    NodeReturnType,\n    InterruptType,\n    WriterType\n  > {\n    // validate the graph\n    this.validate([\n      ...(Array.isArray(interruptBefore) ? interruptBefore : []),\n      ...(Array.isArray(interruptAfter) ? interruptAfter : []),\n    ]);\n\n    // prepare output channels\n    const outputKeys = Object.keys(\n      this._schemaDefinitions.get(this._outputDefinition)\n    );\n    const outputChannels =\n      outputKeys.length === 1 && outputKeys[0] === ROOT ? ROOT : outputKeys;\n\n    const streamKeys = Object.keys(this.channels);\n    const streamChannels =\n      streamKeys.length === 1 && streamKeys[0] === ROOT ? ROOT : streamKeys;\n\n    const userInterrupt = this._interrupt;\n    // create empty compiled graph\n    const compiled = new CompiledStateGraph<\n      S,\n      U,\n      N,\n      I,\n      O,\n      C,\n      NodeReturnType,\n      InterruptType,\n      WriterType\n    >({\n      builder: this,\n      checkpointer,\n      interruptAfter,\n      interruptBefore,\n      autoValidate: false,\n      nodes: {} as Record<N | typeof START, PregelNode<S, U>>,\n      channels: {\n        ...this.channels,\n        [START]: new EphemeralValue(),\n      } as Record<N | typeof START | typeof END | string, BaseChannel>,\n      inputChannels: START,\n      outputChannels,\n      streamChannels,\n      streamMode: \"updates\",\n      store,\n      cache,\n      name,\n      description,\n      userInterrupt,\n    });\n\n    // attach nodes, edges and branches\n    compiled.attachNode(START);\n    for (const [key, node] of Object.entries<StateGraphNodeSpec<S, U>>(\n      this.nodes\n    )) {\n      compiled.attachNode(key as N, node);\n    }\n    compiled.attachBranch(START, SELF, _getControlBranch() as Branch<S, N>, {\n      withReader: false,\n    });\n    for (const [key] of Object.entries<StateGraphNodeSpec<S, U>>(this.nodes)) {\n      compiled.attachBranch(\n        key as N,\n        SELF,\n        _getControlBranch() as Branch<S, N>,\n        {\n          withReader: false,\n        }\n      );\n    }\n    for (const [start, end] of this.edges) {\n      compiled.attachEdge(start, end);\n    }\n    for (const [starts, end] of this.waitingEdges) {\n      compiled.attachEdge(starts, 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\nfunction _getChannels<Channels extends Record<string, unknown> | unknown>(\n  schema: StateGraphArgs<Channels>[\"channels\"]\n): Record<string, BaseChannel> {\n  const channels: Record<string, BaseChannel> = {};\n  for (const [name, val] of Object.entries(schema)) {\n    if (name === ROOT) {\n      channels[name] = getChannel<Channels>(val as SingleReducer<Channels>);\n    } else {\n      const key = name as keyof Channels;\n      channels[name] = getChannel<Channels[typeof key]>(\n        val as SingleReducer<Channels[typeof key]>\n      );\n    }\n  }\n  return channels;\n}\n\n/**\n * Final result from building and compiling a {@link StateGraph}.\n * Should not be instantiated directly, only using the StateGraph `.compile()`\n * instance method.\n */\nexport class CompiledStateGraph<\n  S,\n  U,\n  N extends string = typeof START,\n  I extends StateDefinitionInit = StateDefinition,\n  O extends StateDefinitionInit = StateDefinition,\n  C extends StateDefinitionInit = StateDefinition,\n  NodeReturnType = unknown,\n  InterruptType = unknown,\n  WriterType = unknown\n> extends CompiledGraph<\n  N,\n  S,\n  U,\n  ExtractStateType<C>,\n  ExtractUpdateType<I, ExtractStateType<I>>,\n  ExtractStateType<O>,\n  NodeReturnType,\n  CommandInstance<InferInterruptResumeType<InterruptType>, Prettify<U>, N>,\n  InferWriterType<WriterType>\n> {\n  declare builder: StateGraph<unknown, S, U, N, I, O, C, NodeReturnType>;\n\n  /**\n   * The description of the compiled graph.\n   * This is used by the supervisor agent to describe the handoff to the agent.\n   */\n  description?: string;\n\n  /** @internal */\n  _metaRegistry: SchemaMetaRegistry = schemaMetaRegistry;\n\n  constructor({\n    description,\n    ...rest\n  }: { description?: string } & ConstructorParameters<\n    typeof CompiledGraph<\n      N,\n      S,\n      U,\n      ExtractStateType<C>,\n      ExtractUpdateType<I, ExtractStateType<I>>,\n      ExtractStateType<O>,\n      NodeReturnType,\n      CommandInstance<InferInterruptResumeType<InterruptType>, Prettify<U>, N>,\n      InferWriterType<WriterType>\n    >\n  >[0]) {\n    super(rest);\n    this.description = description;\n  }\n\n  attachNode(key: typeof START, node?: never): void;\n\n  attachNode(key: N, node: StateGraphNodeSpec<S, U>): void;\n\n  attachNode(key: N | typeof START, node?: StateGraphNodeSpec<S, U>): void {\n    let outputKeys: string[];\n    if (key === START) {\n      // Get input schema keys excluding managed values\n      outputKeys = Object.entries(\n        this.builder._schemaDefinitions.get(this.builder._inputDefinition)\n      ).map(([k]) => k);\n    } else {\n      outputKeys = Object.keys(this.builder.channels);\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    function _getRoot(input: unknown): [string, any][] | null {\n      if (isCommand(input)) {\n        if (input.graph === Command.PARENT) {\n          return null;\n        }\n        return input._updateAsTuples();\n      } else if (\n        Array.isArray(input) &&\n        input.length > 0 &&\n        input.some((i) => isCommand(i))\n      ) {\n        const updates: [string, unknown][] = [];\n        for (const i of input) {\n          if (isCommand(i)) {\n            if (i.graph === Command.PARENT) {\n              continue;\n            }\n            updates.push(...i._updateAsTuples());\n          } else {\n            updates.push([ROOT, i]);\n          }\n        }\n        return updates;\n      } else if (input != null) {\n        return [[ROOT, input]];\n      }\n      return null;\n    }\n\n    // to avoid name collision below\n    const nodeKey = key;\n\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    function _getUpdates(input: U): [string, any][] | null {\n      if (!input) {\n        return null;\n      } else if (isCommand(input)) {\n        if (input.graph === Command.PARENT) {\n          return null;\n        }\n        return input._updateAsTuples().filter(([k]) => outputKeys.includes(k));\n      } else if (\n        Array.isArray(input) &&\n        input.length > 0 &&\n        input.some(isCommand)\n      ) {\n        const updates: [string, unknown][] = [];\n        for (const item of input) {\n          if (isCommand(item)) {\n            if (item.graph === Command.PARENT) {\n              continue;\n            }\n            updates.push(\n              ...item._updateAsTuples().filter(([k]) => outputKeys.includes(k))\n            );\n          } else {\n            const itemUpdates = _getUpdates(item);\n            if (itemUpdates) {\n              updates.push(...(itemUpdates ?? []));\n            }\n          }\n        }\n        return updates;\n      } else if (typeof input === \"object\" && !Array.isArray(input)) {\n        return Object.entries(input).filter(([k]) => outputKeys.includes(k));\n      } else {\n        const typeofInput = Array.isArray(input) ? \"array\" : typeof input;\n        throw new InvalidUpdateError(\n          `Expected node \"${nodeKey.toString()}\" to return an object or an array containing at least one Command object, received ${typeofInput}`,\n          {\n            lc_error_code: \"INVALID_GRAPH_NODE_RETURN_VALUE\",\n          }\n        );\n      }\n    }\n\n    const stateWriteEntries: (ChannelWriteTupleEntry | ChannelWriteEntry)[] = [\n      {\n        value: PASSTHROUGH,\n        mapper: new RunnableCallable({\n          func:\n            outputKeys.length && outputKeys[0] === ROOT\n              ? _getRoot\n              : _getUpdates,\n          trace: false,\n          recurse: false,\n        }),\n      },\n    ];\n\n    // add node and output channel\n    if (key === START) {\n      this.nodes[key] = new PregelNode<S, U>({\n        tags: [TAG_HIDDEN],\n        triggers: [START],\n        channels: [START],\n        writers: [new ChannelWrite(stateWriteEntries, [TAG_HIDDEN])],\n      });\n    } else {\n      const inputDefinition = node?.input ?? this.builder._schemaDefinition;\n      const inputValues = Object.fromEntries(\n        Object.keys(this.builder._schemaDefinitions.get(inputDefinition)).map(\n          (k) => [k, k]\n        )\n      );\n      const isSingleInput =\n        Object.keys(inputValues).length === 1 && ROOT in inputValues;\n      const branchChannel = `branch:to:${key}` as string | N;\n      this.channels[branchChannel] = node?.defer\n        ? new LastValueAfterFinish()\n        : new EphemeralValue(false);\n      this.nodes[key] = new PregelNode<S, U>({\n        triggers: [branchChannel],\n        // read state keys\n        channels: isSingleInput ? Object.keys(inputValues) : inputValues,\n        // publish to state keys\n        writers: [new ChannelWrite(stateWriteEntries, [TAG_HIDDEN])],\n        mapper: isSingleInput\n          ? undefined\n          : // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            (input: Record<string, any>) => {\n              return Object.fromEntries(\n                Object.entries(input).filter(([k]) => k in inputValues)\n              );\n            },\n        bound: node?.runnable,\n        metadata: node?.metadata,\n        retryPolicy: node?.retryPolicy,\n        cachePolicy: node?.cachePolicy,\n        subgraphs: node?.subgraphs,\n        ends: node?.ends,\n      });\n    }\n  }\n\n  attachEdge(starts: N | N[] | \"__start__\", end: N | \"__end__\"): void {\n    if (end === END) return;\n    if (typeof starts === \"string\") {\n      this.nodes[starts].writers.push(\n        new ChannelWrite(\n          [{ channel: `branch:to:${end}`, value: null }],\n          [TAG_HIDDEN]\n        )\n      );\n    } else if (Array.isArray(starts)) {\n      const channelName = `join:${starts.join(\"+\")}:${end}`;\n      // register channel\n      this.channels[channelName as string | N] = this.builder.nodes[end].defer\n        ? new NamedBarrierValueAfterFinish(new Set(starts))\n        : new NamedBarrierValue(new Set(starts));\n      // subscribe to channel\n      this.nodes[end].triggers.push(channelName);\n      // publish to channel\n      for (const start of starts) {\n        this.nodes[start].writers.push(\n          new ChannelWrite(\n            [{ channel: channelName, value: start }],\n            [TAG_HIDDEN]\n          )\n        );\n      }\n    }\n  }\n\n  attachBranch(\n    start: N | typeof START,\n    _: string,\n    branch: Branch<S, N>,\n    options: { withReader?: boolean } = { withReader: true }\n  ): void {\n    const branchWriter = async (\n      packets: (string | Send)[],\n      config: LangGraphRunnableConfig\n    ) => {\n      const filteredPackets = packets.filter((p) => p !== END);\n      if (!filteredPackets.length) return;\n\n      const writes: (ChannelWriteEntry | Send)[] = filteredPackets.map((p) => {\n        if (_isSend(p)) return p;\n        return { channel: p === END ? p : `branch:to:${p}`, value: start };\n      });\n      await ChannelWrite.doWrite(\n        { ...config, tags: (config.tags ?? []).concat([TAG_HIDDEN]) },\n        writes\n      );\n    };\n    // attach branch publisher\n    this.nodes[start].writers.push(\n      branch.run(\n        branchWriter,\n        // reader\n        options.withReader\n          ? (config) =>\n              ChannelRead.doRead<S>(\n                config,\n                this.streamChannels ?? this.outputChannels,\n                true\n              )\n          : undefined\n      )\n    );\n  }\n\n  protected async _validateInput(\n    input: ExtractUpdateType<I, ExtractStateType<I>>\n  ): Promise<ExtractUpdateType<I, ExtractStateType<I>>> {\n    if (input == null) return input;\n\n    const inputDef = this.builder._inputRuntimeDefinition;\n    const schemaDef = this.builder._schemaRuntimeDefinition;\n\n    // Determine which schema to use for validation\n    // Priority: inputDef (if it's a validatable schema), otherwise fall back to schemaDef\n\n    // Handle StateSchema validation for input schema\n    if (StateSchema.isInstance(inputDef)) {\n      if (isCommand(input)) {\n        const parsedInput = input;\n        if (input.update) {\n          parsedInput.update = await inputDef.validateInput(\n            Array.isArray(input.update)\n              ? Object.fromEntries(input.update)\n              : input.update\n          );\n        }\n        return parsedInput;\n      }\n      return await inputDef.validateInput(input);\n    }\n\n    // Handle StateSchema validation for state schema (when input is partial state)\n    if (inputDef === PartialStateSchema && StateSchema.isInstance(schemaDef)) {\n      if (isCommand(input)) {\n        const parsedInput = input;\n        if (input.update) {\n          parsedInput.update = await schemaDef.validateInput(\n            Array.isArray(input.update)\n              ? Object.fromEntries(input.update)\n              : input.update\n          );\n        }\n        return parsedInput;\n      }\n      return await schemaDef.validateInput(input);\n    }\n\n    // Handle InteropZodObject validation\n    const schema = (() => {\n      const apply = (schema: InteropZodObject | undefined) => {\n        if (schema == null) return undefined;\n        return this._metaRegistry.getExtendedChannelSchemas(schema, {\n          withReducerSchema: true,\n        });\n      };\n\n      if (isInteropZodObject(inputDef)) return apply(inputDef);\n      if (inputDef === PartialStateSchema) {\n        if (isInteropZodObject(schemaDef)) {\n          return interopZodObjectPartial(apply(schemaDef)!);\n        }\n        return undefined;\n      }\n      return undefined;\n    })();\n\n    if (isCommand(input)) {\n      const parsedInput = input;\n      if (input.update && schema != null)\n        parsedInput.update = interopParse(schema, input.update);\n      return parsedInput;\n    }\n    if (schema != null) return interopParse(schema, input);\n    return input;\n  }\n\n  public isInterrupted(input: unknown): input is {\n    [INTERRUPT]: Interrupt<InferInterruptInputType<InterruptType>>[];\n  } {\n    return isInterrupted(input);\n  }\n\n  protected async _validateContext(\n    config: Partial<Record<string, unknown>>\n  ): Promise<Partial<Record<string, unknown>>> {\n    const configSchema = this.builder._configRuntimeSchema;\n    if (isInteropZodObject(configSchema)) interopParse(configSchema, config);\n    return config;\n  }\n}\n\n/**\n * Check if value is a legacy StateGraphArgs with channels.\n * @internal\n * @deprecated Use StateGraphInit instead\n */\nfunction isStateGraphArgs<Channels extends object | unknown>(\n  obj: unknown | StateGraphArgs<Channels>\n): obj is StateGraphArgs<Channels> {\n  return (\n    typeof obj === \"object\" &&\n    obj !== null &&\n    (obj as StateGraphArgs<Channels>).channels !== undefined\n  );\n}\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction _controlBranch(value: any): (string | Send)[] {\n  if (_isSend(value)) {\n    return [value];\n  }\n  const commands = [];\n  if (isCommand(value)) {\n    commands.push(value);\n  } else if (Array.isArray(value)) {\n    commands.push(...value.filter(isCommand));\n  }\n  const destinations: (string | Send)[] = [];\n\n  for (const command of commands) {\n    if (command.graph === Command.PARENT) {\n      throw new ParentCommand(command);\n    }\n\n    if (_isSend(command.goto)) {\n      destinations.push(command.goto);\n    } else if (typeof command.goto === \"string\") {\n      destinations.push(command.goto);\n    } else {\n      if (Array.isArray(command.goto)) {\n        destinations.push(...command.goto);\n      }\n    }\n  }\n  return destinations;\n}\n\nfunction _getControlBranch() {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  const CONTROL_BRANCH_PATH = new RunnableCallable<any, (string | Send)[]>({\n    func: _controlBranch,\n    tags: [TAG_HIDDEN],\n    trace: false,\n    recurse: false,\n    name: \"<control_branch>\",\n  });\n  return new Branch({\n    path: CONTROL_BRANCH_PATH,\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AA2FA,MAAM,OAAO;AAgGb,MAAM,qBAAqB,OAAO,IAAI,0BAA0B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0EhE,IAAa,aAAb,cAWUA,oBAA+D;CACvE,WAAwC,EAAE;CAG1C,+BAA8B,IAAI,KAAK;;CAGvC;;CAGA;;CAGA;;CAGA;;CAOA;;CAGA;;;;;CAMA,qCAAqB,IAAI,KAAK;;CAG9B,gBAAoCC;;CAGpC;;CAGA;;CAGA;;CAGA;CA4GA,YACE,aAIA,SAWA;AACA,SAAO;EAGP,MAAM,OAAO,KAAK,2BAA2B,aAAa,QAAQ;EAGlE,MAAM,cAAc,KAAK,SAAS,KAAK,eAAe,KAAK;AAC3D,MAAI,CAAC,YACH,OAAM,IAAIC,qCAAsB;EAIlC,MAAM,kBAAkB,KAAK,uBAAuB,YAAY;AAGhE,OAAK,oBAAoB;AAGzB,MAAIC,2BAAY,WAAW,YAAY,CACrC,MAAK,2BAA2B;+DACJ,YAAY,CACxC,MAAK,2BAA2B;AAIlC,MAAI,KAAK,MACP,KAAIA,2BAAY,WAAW,KAAK,MAAM,CACpC,MAAK,0BAA0B,KAAK;+DACR,KAAK,MAAM,CACvC,MAAK,0BAA0B,KAAK;MAEpC,MAAK,0BAA0B;MAGjC,MAAK,0BAA0B;AAIjC,MAAI,KAAK,OACP,KAAIA,2BAAY,WAAW,KAAK,OAAO,CACrC,MAAK,2BAA2B,KAAK;+DACT,KAAK,OAAO,CACxC,MAAK,2BAA2B,KAAK;MAErC,MAAK,2BAA2B,KAAK;MAGvC,MAAK,2BAA2B,KAAK;EAIvC,MAAM,kBAAkB,KAAK,QACzB,KAAK,uBAAuB,KAAK,MAAM,GACvC;EACJ,MAAM,mBAAmB,KAAK,SACzB,KAAK,uBAAuB,KAAK,OAAO,GACzC;AACJ,OAAK,mBAAmB;AACxB,OAAK,oBAAoB;AAGzB,OAAK,WAAW,KAAK,kBAAkB;AACvC,OAAK,WAAW,KAAK,iBAAiB;AACtC,OAAK,WAAW,KAAK,kBAAkB;AAGvC,MAAI,KAAK,SACP;2DAAuB,KAAK,QAAQ,CAClC,MAAK,uBAAuB,KAAK;;AAKrC,OAAK,aAAa,KAAK;AACvB,OAAK,UAAU,KAAK;;;;;;CAOtB,AAAQ,2BACN,aACA,SAC8C;AAE9C,MAAIC,+BAAiB,YAAY,EAAE;AAEjC,2DAAuB,QAAQ,IAAIC,kCAAe,WAAW,QAAQ,CACnE,QAAO;IACL,GAAG;IACH,SAAS;IACV;GAGH,MAAM,OAAO;AACb,UAAO;IACL,GAAG;IACH,OAAO,YAAY,SAAS,MAAM;IAClC,QAAQ,YAAY,UAAU,MAAM;IACpC,SAAS,YAAY,WAAW,MAAM;IACtC,WAAW,YAAY,aAAa,MAAM;IAC1C,QAAQ,YAAY,UAAU,MAAM;IACpC,OAAO,YAAY,SAAS,MAAM;IACnC;;AAIH,MAAIC,oCAAsB,YAAY,EAAE;AAEtC,2DAAuB,QAAQ,IAAID,kCAAe,WAAW,QAAQ,CACnE,QAAO;IACL,OAAO;IACP,SAAS;IACV;GAEH,MAAM,OAAO;AACb,UAAO;IACL,OAAO;IACP,OAAO,MAAM;IACb,QAAQ,MAAM;IACd,SAAS,MAAM;IACf,WAAW,MAAM;IACjB,QAAQ,MAAM;IACd,OAAO,MAAM;IACd;;AAIH,MAAI,iBAAiB,YAAiC,CAGpD,QAAO,EACL,OAFW,aADM,YACkB,SAAS,EAG7C;AAGH,QAAM,IAAIH,qCAAsB;;;;;;CAOlC,AAAQ,uBAAuB,QAA8C;AAC3E,MAAIC,2BAAY,WAAW,OAAO,CAChC,QAAO,OAAO,aAAa;AAG7B,0DAAuB,OAAO,CAC5B,QAAO,KAAK,cAAc,qBAAqB,OAAO;AAIxD,MACE,OAAO,WAAW,YAClB,mBAAmB,UAClB,OAAsC,kBAAkB,iBAEzD,QAAQ,OAA2C;AAIrD,MACE,OAAO,WAAW,YAClB,CAAC,MAAM,QAAQ,OAAO,IACtB,OAAO,KAAK,OAAO,CAAC,SAAS,EAE7B,QAAO;AAGT,QAAM,IAAID,oCACR,6FACD;;CAGH,IAAI,WAAkC;AACpC,SAAO,IAAI,IAAI,CACb,GAAG,KAAK,OACR,GAAG,MAAM,KAAK,KAAK,aAAa,CAAC,SAAS,CAAC,QAAQ,SACjD,OAAO,KAAK,UAAU,CAAC,OAAO,IAAI,CAAqB,CACxD,CACF,CAAC;;CAGJ,WAAW,iBAAsC;AAC/C,MAAI,KAAK,mBAAmB,IAAI,gBAAgB,CAC9C;AAGF,OAAK,mBAAmB,IAAI,iBAAiB,gBAAgB;AAC7D,OAAK,MAAM,CAAC,KAAK,QAAQ,OAAO,QAAQ,gBAAgB,EAAE;GACxD,IAAI;AACJ,OAAI,OAAO,QAAQ,WACjB,WAAU,KAAK;OAEf,WAAU;AAEZ,OAAI,KAAK,SAAS,SAAS,QACzB;QAAI,CAAC,KAAK,SAAS,KAAK,OAAO,QAAQ,EACrC;SAAI,QAAQ,kBAAkB,YAC5B,OAAM,IAAI,MACR,YAAY,IAAI,yCACjB;;SAIL,MAAK,SAAS,OAAO;;;CAiI3B,AAAS,QACP,GAAG,MAqBmC;EACtC,SAAS,gBACP,MASA;AACA,UAAO,KAAK,UAAU,KAAK,OAAO,KAAK,OAAO;;EAGhD,MAAM,QACJ,gBAAgB,KAAK,GACjB,MAAM,QAAQ,KAAK,GAAG,GACpB,KAAK,KACL,OAAO,QAAQ,KAAK,GAAG,CAAC,KAAK,CAAC,KAAK,YAAY,CAAC,KAAK,OAAO,CAAC,GAC/D,CAAC;GAAC,KAAK;GAAI,KAAK;GAAI,KAAK;GAAG,CAAC;AAOnC,MAAI,MAAM,WAAW,EACnB,OAAM,IAAI,MAAM,iCAAiC;AAGnD,OAAK,MAAM,CAAC,KAAK,QAAQ,YAAY,OAAO;AAC1C,OAAI,OAAO,KAAK,SACd,OAAM,IAAI,MACR,GAAG,IAAI,qGACR;AAGH,QAAK,MAAM,gBAAgB,CACzBK,kDACAC,2CACD,CACC,KAAI,IAAI,SAAS,aAAa,CAC5B,OAAM,IAAI,MACR,IAAI,aAAa,6DAClB;AAGL,QAAK,eACH,6GACD;AAED,OAAI,OAAO,KAAK,MACd,OAAM,IAAI,MAAM,UAAU,IAAI,qBAAqB;AAErD,OAAI,QAAQC,yBAAO,QAAQC,wBACzB,OAAM,IAAI,MAAM,UAAU,IAAI,iBAAiB;GAGjD,IAAI,YAA6B,KAAK;AACtC,OAAI,SAAS,UAAU,OACrB,aAAY,KAAK,uBAAuB,QAAQ,MAAM;AAExD,QAAK,WAAW,UAAU;GAE1B,IAAI;AACJ,OAAIC,mCAAS,WAAW,OAAO,CAC7B,YAAW;YACF,OAAO,WAAW,WAC3B,YAAW,IAAIC,+BAAiB;IAC9B,MAAM;IACN,MAAM;IACN,OAAO;IACR,CAAC;OAEF,6DAA6B,OAAO;GAGtC,IAAI,cAAc,SAAS;AAC3B,OAAI,OAAO,gBAAgB,UACzB,eAAc,cAAc,EAAE,GAAG;GAGnC,MAAM,WAAqC;IAC/B;IACV,aAAa,SAAS;IACtB;IACA,UAAU,SAAS;IACnB,OAAO,aAAa,KAAK;IACzB,WAAWC,8BAAa,SAAS,GAE7B,CAAC,SAAgB,GACjB,SAAS;IACb,MAAM,SAAS;IACf,OAAO,SAAS;IACjB;AAED,QAAK,MAAM,OAAuB;;AAGpC,SAAO;;CAGT,AAAS,QACP,UACA,QACM;AACN,MAAI,OAAO,aAAa,SACtB,QAAO,MAAM,QAAQ,UAAU,OAAO;AAGxC,MAAI,KAAK,SACP,SAAQ,KACN,8GAED;AAGH,OAAK,MAAM,SAAS,UAAU;AAC5B,OAAI,UAAUJ,sBACZ,OAAM,IAAI,MAAM,6BAA6B;AAE/C,OAAI,CAAC,OAAO,KAAK,KAAK,MAAM,CAAC,MAAM,SAAS,SAAS,MAAM,CACzD,OAAM,IAAI,MAAM,6BAA6B,MAAM,SAAS;;AAGhE,MAAI,WAAWA,sBACb,OAAM,IAAI,MAAM,4BAA4B;AAE9C,MAAI,CAAC,OAAO,KAAK,KAAK,MAAM,CAAC,MAAM,SAAS,SAAS,OAAO,CAC1D,OAAM,IAAI,MAAM,6BAA6B,OAAO,SAAS;AAG/D,OAAK,aAAa,IAAI,CAAC,UAAU,OAAO,CAAC;AAEzC,SAAO;;CAiDT,YACE,OAyBA;EACA,MAAM,cAAc,MAAM,QAAQ,MAAM,GAAG,QAAQ,OAAO,QAAQ,MAAM;AAExE,MAAI,YAAY,WAAW,EACzB,OAAM,IAAI,MAAM,uCAAuC;EAGzD,IAAI;AACJ,OAAK,MAAM,CAAC,KAAK,QAAQ,YAAY,aAAa;AAChD,OAAI,OAAO,KAAK,MACd,OAAM,IAAI,MACR,kDAAkD,IAAI,mBACvD;GAGH,MAAM,WAAW;AACjB,QAAK,QACH,UACA,QACA,QACD;AACD,OAAI,gBAAgB,KAClB,MAAK,QAAQ,cAAc,SAAS;AAGtC,kBAAe;;AAGjB,SAAO;;CAYT,AAAS,QAAQ,EACf,cACA,OACA,OACA,iBACA,gBACA,MACA,gBASE,EAAE,EAUJ;AAEA,OAAK,SAAS,CACZ,GAAI,MAAM,QAAQ,gBAAgB,GAAG,kBAAkB,EAAE,EACzD,GAAI,MAAM,QAAQ,eAAe,GAAG,iBAAiB,EAAE,CACxD,CAAC;EAGF,MAAM,aAAa,OAAO,KACxB,KAAK,mBAAmB,IAAI,KAAK,kBAAkB,CACpD;EACD,MAAM,iBACJ,WAAW,WAAW,KAAK,WAAW,OAAO,OAAO,OAAO;EAE7D,MAAM,aAAa,OAAO,KAAK,KAAK,SAAS;EAC7C,MAAM,iBACJ,WAAW,WAAW,KAAK,WAAW,OAAO,OAAO,OAAO;EAE7D,MAAM,gBAAgB,KAAK;EAE3B,MAAM,WAAW,IAAI,mBAUnB;GACA,SAAS;GACT;GACA;GACA;GACA,cAAc;GACd,OAAO,EAAE;GACT,UAAU;IACR,GAAG,KAAK;KACPC,0BAAQ,IAAII,wCAAgB;IAC9B;GACD,eAAeJ;GACf;GACA;GACA,YAAY;GACZ;GACA;GACA;GACA;GACA;GACD,CAAC;AAGF,WAAS,WAAWA,wBAAM;AAC1B,OAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAC/B,KAAK,MACN,CACC,UAAS,WAAW,KAAU,KAAK;AAErC,WAAS,aAAaA,yBAAOK,wBAAM,mBAAmB,EAAkB,EACtE,YAAY,OACb,CAAC;AACF,OAAK,MAAM,CAAC,QAAQ,OAAO,QAAkC,KAAK,MAAM,CACtE,UAAS,aACP,KACAA,wBACA,mBAAmB,EACnB,EACE,YAAY,OACb,CACF;AAEH,OAAK,MAAM,CAAC,OAAO,QAAQ,KAAK,MAC9B,UAAS,WAAW,OAAO,IAAI;AAEjC,OAAK,MAAM,CAAC,QAAQ,QAAQ,KAAK,aAC/B,UAAS,WAAW,QAAQ,IAAI;AAElC,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,SAAS,CAC3D,MAAK,MAAM,CAAC,MAAM,WAAW,OAAO,QAAQ,SAAS,CACnD,UAAS,aAAa,OAAY,MAAM,OAAO;AAInD,SAAO,SAAS,UAAU;;;AAI9B,SAAS,aACP,QAC6B;CAC7B,MAAM,WAAwC,EAAE;AAChD,MAAK,MAAM,CAAC,MAAM,QAAQ,OAAO,QAAQ,OAAO,CAC9C,KAAI,SAAS,KACX,UAAS,QAAQC,8BAAqB,IAA+B;KAGrE,UAAS,QAAQA,8BACf,IACD;AAGL,QAAO;;;;;;;AAQT,IAAa,qBAAb,cAUUC,4BAUR;;;;;CAOA;;CAGA,gBAAoChB;CAEpC,YAAY,EACV,aACA,GAAG,QAaC;AACJ,QAAM,KAAK;AACX,OAAK,cAAc;;CAOrB,WAAW,KAAuB,MAAuC;EACvE,IAAI;AACJ,MAAI,QAAQS,wBAEV,cAAa,OAAO,QAClB,KAAK,QAAQ,mBAAmB,IAAI,KAAK,QAAQ,iBAAiB,CACnE,CAAC,KAAK,CAAC,OAAO,EAAE;MAEjB,cAAa,OAAO,KAAK,KAAK,QAAQ,SAAS;EAIjD,SAAS,SAAS,OAAwC;AACxD,OAAIQ,4BAAU,MAAM,EAAE;AACpB,QAAI,MAAM,UAAUC,0BAAQ,OAC1B,QAAO;AAET,WAAO,MAAM,iBAAiB;cAE9B,MAAM,QAAQ,MAAM,IACpB,MAAM,SAAS,KACf,MAAM,MAAM,MAAMD,4BAAU,EAAE,CAAC,EAC/B;IACA,MAAM,UAA+B,EAAE;AACvC,SAAK,MAAM,KAAK,MACd,KAAIA,4BAAU,EAAE,EAAE;AAChB,SAAI,EAAE,UAAUC,0BAAQ,OACtB;AAEF,aAAQ,KAAK,GAAG,EAAE,iBAAiB,CAAC;UAEpC,SAAQ,KAAK,CAAC,MAAM,EAAE,CAAC;AAG3B,WAAO;cACE,SAAS,KAClB,QAAO,CAAC,CAAC,MAAM,MAAM,CAAC;AAExB,UAAO;;EAIT,MAAM,UAAU;EAGhB,SAAS,YAAY,OAAkC;AACrD,OAAI,CAAC,MACH,QAAO;YACED,4BAAU,MAAM,EAAE;AAC3B,QAAI,MAAM,UAAUC,0BAAQ,OAC1B,QAAO;AAET,WAAO,MAAM,iBAAiB,CAAC,QAAQ,CAAC,OAAO,WAAW,SAAS,EAAE,CAAC;cAEtE,MAAM,QAAQ,MAAM,IACpB,MAAM,SAAS,KACf,MAAM,KAAKD,4BAAU,EACrB;IACA,MAAM,UAA+B,EAAE;AACvC,SAAK,MAAM,QAAQ,MACjB,KAAIA,4BAAU,KAAK,EAAE;AACnB,SAAI,KAAK,UAAUC,0BAAQ,OACzB;AAEF,aAAQ,KACN,GAAG,KAAK,iBAAiB,CAAC,QAAQ,CAAC,OAAO,WAAW,SAAS,EAAE,CAAC,CAClE;WACI;KACL,MAAM,cAAc,YAAY,KAAK;AACrC,SAAI,YACF,SAAQ,KAAK,GAAI,eAAe,EAAE,CAAE;;AAI1C,WAAO;cACE,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,MAAM,CAC3D,QAAO,OAAO,QAAQ,MAAM,CAAC,QAAQ,CAAC,OAAO,WAAW,SAAS,EAAE,CAAC;QAC/D;IACL,MAAM,cAAc,MAAM,QAAQ,MAAM,GAAG,UAAU,OAAO;AAC5D,UAAM,IAAIC,kCACR,kBAAkB,QAAQ,UAAU,CAAC,qFAAqF,eAC1H,EACE,eAAe,mCAChB,CACF;;;EAIL,MAAM,oBAAoE,CACxE;GACE,OAAOC;GACP,QAAQ,IAAIT,+BAAiB;IAC3B,MACE,WAAW,UAAU,WAAW,OAAO,OACnC,WACA;IACN,OAAO;IACP,SAAS;IACV,CAAC;GACH,CACF;AAGD,MAAI,QAAQF,wBACV,MAAK,MAAM,OAAO,IAAIY,wBAAiB;GACrC,MAAM,CAACC,6BAAW;GAClB,UAAU,CAACb,wBAAM;GACjB,UAAU,CAACA,wBAAM;GACjB,SAAS,CAAC,IAAIc,2BAAa,mBAAmB,CAACD,6BAAW,CAAC,CAAC;GAC7D,CAAC;OACG;GACL,MAAM,kBAAkB,MAAM,SAAS,KAAK,QAAQ;GACpD,MAAM,cAAc,OAAO,YACzB,OAAO,KAAK,KAAK,QAAQ,mBAAmB,IAAI,gBAAgB,CAAC,CAAC,KAC/D,MAAM,CAAC,GAAG,EAAE,CACd,CACF;GACD,MAAM,gBACJ,OAAO,KAAK,YAAY,CAAC,WAAW,KAAK,QAAQ;GACnD,MAAM,gBAAgB,aAAa;AACnC,QAAK,SAAS,iBAAiB,MAAM,QACjC,IAAIE,yCAAsB,GAC1B,IAAIX,uCAAe,MAAM;AAC7B,QAAK,MAAM,OAAO,IAAIQ,wBAAiB;IACrC,UAAU,CAAC,cAAc;IAEzB,UAAU,gBAAgB,OAAO,KAAK,YAAY,GAAG;IAErD,SAAS,CAAC,IAAIE,2BAAa,mBAAmB,CAACD,6BAAW,CAAC,CAAC;IAC5D,QAAQ,gBACJ,UAEC,UAA+B;AAC9B,YAAO,OAAO,YACZ,OAAO,QAAQ,MAAM,CAAC,QAAQ,CAAC,OAAO,KAAK,YAAY,CACxD;;IAEP,OAAO,MAAM;IACb,UAAU,MAAM;IAChB,aAAa,MAAM;IACnB,aAAa,MAAM;IACnB,WAAW,MAAM;IACjB,MAAM,MAAM;IACb,CAAC;;;CAIN,WAAW,QAA+B,KAA0B;AAClE,MAAI,QAAQd,sBAAK;AACjB,MAAI,OAAO,WAAW,SACpB,MAAK,MAAM,QAAQ,QAAQ,KACzB,IAAIe,2BACF,CAAC;GAAE,SAAS,aAAa;GAAO,OAAO;GAAM,CAAC,EAC9C,CAACD,6BAAW,CACb,CACF;WACQ,MAAM,QAAQ,OAAO,EAAE;GAChC,MAAM,cAAc,QAAQ,OAAO,KAAK,IAAI,CAAC,GAAG;AAEhD,QAAK,SAAS,eAA6B,KAAK,QAAQ,MAAM,KAAK,QAC/D,IAAIG,yDAA6B,IAAI,IAAI,OAAO,CAAC,GACjD,IAAIC,8CAAkB,IAAI,IAAI,OAAO,CAAC;AAE1C,QAAK,MAAM,KAAK,SAAS,KAAK,YAAY;AAE1C,QAAK,MAAM,SAAS,OAClB,MAAK,MAAM,OAAO,QAAQ,KACxB,IAAIH,2BACF,CAAC;IAAE,SAAS;IAAa,OAAO;IAAO,CAAC,EACxC,CAACD,6BAAW,CACb,CACF;;;CAKP,aACE,OACA,GACA,QACA,UAAoC,EAAE,YAAY,MAAM,EAClD;EACN,MAAM,eAAe,OACnB,SACA,WACG;GACH,MAAM,kBAAkB,QAAQ,QAAQ,MAAM,MAAMd,sBAAI;AACxD,OAAI,CAAC,gBAAgB,OAAQ;GAE7B,MAAM,SAAuC,gBAAgB,KAAK,MAAM;AACtE,QAAImB,0BAAQ,EAAE,CAAE,QAAO;AACvB,WAAO;KAAE,SAAS,MAAMnB,wBAAM,IAAI,aAAa;KAAK,OAAO;KAAO;KAClE;AACF,SAAMe,2BAAa,QACjB;IAAE,GAAG;IAAQ,OAAO,OAAO,QAAQ,EAAE,EAAE,OAAO,CAACD,6BAAW,CAAC;IAAE,EAC7D,OACD;;AAGH,OAAK,MAAM,OAAO,QAAQ,KACxB,OAAO,IACL,cAEA,QAAQ,cACH,WACCM,yBAAY,OACV,QACA,KAAK,kBAAkB,KAAK,gBAC5B,KACD,GACH,OACL,CACF;;CAGH,MAAgB,eACd,OACoD;AACpD,MAAI,SAAS,KAAM,QAAO;EAE1B,MAAM,WAAW,KAAK,QAAQ;EAC9B,MAAM,YAAY,KAAK,QAAQ;AAM/B,MAAI1B,2BAAY,WAAW,SAAS,EAAE;AACpC,OAAIe,4BAAU,MAAM,EAAE;IACpB,MAAM,cAAc;AACpB,QAAI,MAAM,OACR,aAAY,SAAS,MAAM,SAAS,cAClC,MAAM,QAAQ,MAAM,OAAO,GACvB,OAAO,YAAY,MAAM,OAAO,GAChC,MAAM,OACX;AAEH,WAAO;;AAET,UAAO,MAAM,SAAS,cAAc,MAAM;;AAI5C,MAAI,aAAa,sBAAsBf,2BAAY,WAAW,UAAU,EAAE;AACxE,OAAIe,4BAAU,MAAM,EAAE;IACpB,MAAM,cAAc;AACpB,QAAI,MAAM,OACR,aAAY,SAAS,MAAM,UAAU,cACnC,MAAM,QAAQ,MAAM,OAAO,GACvB,OAAO,YAAY,MAAM,OAAO,GAChC,MAAM,OACX;AAEH,WAAO;;AAET,UAAO,MAAM,UAAU,cAAc,MAAM;;EAI7C,MAAM,gBAAgB;GACpB,MAAM,SAAS,WAAyC;AACtD,QAAI,UAAU,KAAM,QAAO;AAC3B,WAAO,KAAK,cAAc,0BAA0B,QAAQ,EAC1D,mBAAmB,MACpB,CAAC;;AAGJ,2DAAuB,SAAS,CAAE,QAAO,MAAM,SAAS;AACxD,OAAI,aAAa,oBAAoB;AACnC,4DAAuB,UAAU,CAC/B,iEAA+B,MAAM,UAAU,CAAE;AAEnD;;MAGA;AAEJ,MAAIA,4BAAU,MAAM,EAAE;GACpB,MAAM,cAAc;AACpB,OAAI,MAAM,UAAU,UAAU,KAC5B,aAAY,uDAAsB,QAAQ,MAAM,OAAO;AACzD,UAAO;;AAET,MAAI,UAAU,KAAM,sDAAoB,QAAQ,MAAM;AACtD,SAAO;;CAGT,AAAO,cAAc,OAEnB;AACA,SAAOY,gCAAc,MAAM;;CAG7B,MAAgB,iBACd,QAC2C;EAC3C,MAAM,eAAe,KAAK,QAAQ;AAClC,0DAAuB,aAAa,CAAE,+CAAa,cAAc,OAAO;AACxE,SAAO;;;;;;;;AASX,SAAS,iBACP,KACiC;AACjC,QACE,OAAO,QAAQ,YACf,QAAQ,QACP,IAAiC,aAAa;;AAKnD,SAAS,eAAe,OAA+B;AACrD,KAAIF,0BAAQ,MAAM,CAChB,QAAO,CAAC,MAAM;CAEhB,MAAM,WAAW,EAAE;AACnB,KAAIV,4BAAU,MAAM,CAClB,UAAS,KAAK,MAAM;UACX,MAAM,QAAQ,MAAM,CAC7B,UAAS,KAAK,GAAG,MAAM,OAAOA,4BAAU,CAAC;CAE3C,MAAM,eAAkC,EAAE;AAE1C,MAAK,MAAM,WAAW,UAAU;AAC9B,MAAI,QAAQ,UAAUC,0BAAQ,OAC5B,OAAM,IAAIY,6BAAc,QAAQ;AAGlC,MAAIH,0BAAQ,QAAQ,KAAK,CACvB,cAAa,KAAK,QAAQ,KAAK;WACtB,OAAO,QAAQ,SAAS,SACjC,cAAa,KAAK,QAAQ,KAAK;WAE3B,MAAM,QAAQ,QAAQ,KAAK,CAC7B,cAAa,KAAK,GAAG,QAAQ,KAAK;;AAIxC,QAAO;;AAGT,SAAS,oBAAoB;AAS3B,QAAO,IAAII,qBAAO,EAChB,MAR0B,IAAIpB,+BAAyC;EACvE,MAAM;EACN,MAAM,CAACW,6BAAW;EAClB,OAAO;EACP,SAAS;EACT,MAAM;EACP,CAAC,EAGD,CAAC"}
+{"version":3,"file":"state.cjs","names":["Graph","schemaMetaRegistry","StateGraphInputError","StateSchema","isStateGraphInit","AnnotationRoot","isStateDefinitionInit","CHECKPOINT_NAMESPACE_SEPARATOR","CHECKPOINT_NAMESPACE_END","END","START","Runnable","RunnableCallable","isPregelLike","EphemeralValue","SELF","getChannel","CompiledGraph","isCommand","Command","InvalidUpdateError","PASSTHROUGH","PregelNode","TAG_HIDDEN","ChannelWrite","LastValueAfterFinish","NamedBarrierValueAfterFinish","NamedBarrierValue","_isSend","ChannelRead","isInterrupted","ParentCommand","Branch"],"sources":["../../src/graph/state.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-use-before-define */\nimport { _coerceToRunnable, Runnable } from \"@langchain/core/runnables\";\nimport {\n  All,\n  type BaseCache,\n  BaseCheckpointSaver,\n  BaseStore,\n} from \"@langchain/langgraph-checkpoint\";\nimport {\n  type InteropZodObject,\n  interopParse,\n  interopZodObjectPartial,\n  isInteropZodObject,\n} from \"@langchain/core/utils/types\";\nimport type {\n  RunnableLike,\n  LangGraphRunnableConfig,\n  Runtime,\n} from \"../pregel/runnable_types.js\";\nimport { BaseChannel } from \"../channels/base.js\";\nimport {\n  CompiledGraph,\n  Graph,\n  Branch,\n  AddNodeOptions,\n  NodeSpec,\n} from \"./graph.js\";\nimport {\n  ChannelWrite,\n  ChannelWriteEntry,\n  ChannelWriteTupleEntry,\n  PASSTHROUGH,\n} from \"../pregel/write.js\";\nimport { ChannelRead, PregelNode } from \"../pregel/read.js\";\nimport {\n  NamedBarrierValue,\n  NamedBarrierValueAfterFinish,\n} from \"../channels/named_barrier_value.js\";\nimport { EphemeralValue } from \"../channels/ephemeral_value.js\";\nimport { RunnableCallable } from \"../utils.js\";\nimport {\n  isCommand,\n  _isSend,\n  CHECKPOINT_NAMESPACE_END,\n  CHECKPOINT_NAMESPACE_SEPARATOR,\n  Command,\n  SELF,\n  Send,\n  START,\n  END,\n  TAG_HIDDEN,\n  CommandInstance,\n  isInterrupted,\n  Interrupt,\n  INTERRUPT,\n} from \"../constants.js\";\nimport {\n  InvalidUpdateError,\n  ParentCommand,\n  StateGraphInputError,\n} from \"../errors.js\";\nimport {\n  AnnotationRoot,\n  getChannel,\n  SingleReducer,\n  StateDefinition,\n  StateType,\n} from \"./annotation.js\";\nimport { StateSchema } from \"../state/index.js\";\nimport type { CachePolicy, RetryPolicy } from \"../pregel/utils/index.js\";\nimport { isPregelLike } from \"../pregel/utils/subgraph.js\";\nimport { LastValueAfterFinish } from \"../channels/last_value.js\";\nimport { type SchemaMetaRegistry, schemaMetaRegistry } from \"./zod/meta.js\";\nimport type {\n  InferInterruptResumeType,\n  InferInterruptInputType,\n} from \"../interrupt.js\";\nimport type { InferWriterType } from \"../writer.js\";\nimport type { AnyStateSchema } from \"../state/schema.js\";\nimport {\n  ContextSchemaInit,\n  ExtractStateType,\n  ExtractUpdateType,\n  isStateDefinitionInit,\n  isStateGraphInit,\n  StateGraphInit,\n  StateGraphOptions,\n  ToStateDefinition,\n  type StateDefinitionInit,\n} from \"./types.js\";\n\nconst ROOT = \"__root__\";\n\nexport type ChannelReducers<Channels extends object> = {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  [K in keyof Channels]: SingleReducer<Channels[K], any>;\n};\n\nexport interface StateGraphArgs<Channels extends object | unknown> {\n  channels: Channels extends object\n    ? Channels extends unknown[]\n      ? ChannelReducers<{ __root__: Channels }>\n      : ChannelReducers<Channels>\n    : ChannelReducers<{ __root__: Channels }>;\n}\n\nexport type StateGraphNodeSpec<RunInput, RunOutput> = NodeSpec<\n  RunInput,\n  RunOutput\n> & {\n  input?: StateDefinition;\n  retryPolicy?: RetryPolicy;\n  cachePolicy?: CachePolicy;\n};\n\n/**\n * Options for StateGraph.addNode() method.\n *\n * @template Nodes - Node name constraints\n * @template InputSchema - Per-node input schema type (inferred from options.input)\n */\nexport type StateGraphAddNodeOptions<\n  Nodes extends string = string,\n  InputSchema extends StateDefinitionInit | undefined =\n    | StateDefinitionInit\n    | undefined\n> = {\n  retryPolicy?: RetryPolicy;\n  cachePolicy?: CachePolicy | boolean;\n  input?: InputSchema;\n} & AddNodeOptions<Nodes>;\n\nexport type StateGraphArgsWithStateSchema<\n  SD extends StateDefinition,\n  I extends StateDefinition,\n  O extends StateDefinition\n> = {\n  stateSchema: AnnotationRoot<SD>;\n  input?: AnnotationRoot<I>;\n  output?: AnnotationRoot<O>;\n};\n\nexport type StateGraphArgsWithInputOutputSchemas<\n  SD extends StateDefinition,\n  O extends StateDefinition = SD\n> = {\n  input: AnnotationRoot<SD>;\n  output: AnnotationRoot<O>;\n};\n\ntype ExtractStateDefinition<T> = T extends AnyStateSchema\n  ? T // Keep StateSchema as-is to preserve type information\n  : T extends StateDefinitionInit\n  ? ToStateDefinition<T>\n  : StateDefinition;\n\ntype NodeAction<\n  S,\n  U,\n  C extends StateDefinitionInit,\n  InterruptType,\n  WriterType\n> = RunnableLike<\n  S,\n  U extends object ? U & Record<string, any> : U, // eslint-disable-line @typescript-eslint/no-explicit-any\n  Runtime<StateType<ToStateDefinition<C>>, InterruptType, WriterType>\n>;\n\ntype StrictNodeAction<\n  S,\n  U,\n  C extends StateDefinitionInit,\n  Nodes extends string,\n  InterruptType,\n  WriterType\n> = RunnableLike<\n  Prettify<S>,\n  | U\n  | Command<\n      InferInterruptResumeType<InterruptType>,\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      U & Record<string, any>,\n      Nodes\n    >,\n  Runtime<StateType<ToStateDefinition<C>>, InterruptType, WriterType>\n>;\n\nconst PartialStateSchema = Symbol.for(\"langgraph.state.partial\");\ntype PartialStateSchema = typeof PartialStateSchema;\n\ntype MergeReturnType<Prev, Curr> = Prev & Curr extends infer T\n  ? { [K in keyof T]: T[K] } & unknown\n  : never;\n\ntype Prettify<T> = {\n  [K in keyof T]: T[K];\n  // eslint-disable-next-line @typescript-eslint/ban-types\n} & {};\n\n/**\n * A graph whose nodes communicate by reading and writing to a shared state.\n * Each node takes a defined `State` as input and returns a `Partial<State>`.\n *\n * Each state key can optionally be annotated with a reducer function that\n * will be used to aggregate the values of that key received from multiple nodes.\n * The signature of a reducer function is (left: Value, right: UpdateValue) => Value.\n *\n * See {@link Annotation} for more on defining state.\n *\n * After adding nodes and edges to your graph, you must call `.compile()` on it before\n * you can use it.\n *\n * @typeParam SD - The state definition used to construct the graph. Can be an\n *   {@link AnnotationRoot}, {@link StateSchema}, or Zod object schema. This is the\n *   primary generic from which `S` and `U` are derived.\n *\n * @typeParam S - The full state type representing the complete shape of your graph's\n *   state after all reducers have been applied. Automatically inferred from `SD`.\n *\n * @typeParam U - The update type representing what nodes can return to modify state.\n *   Typically a partial of the state type. Automatically inferred from `SD`.\n *\n * @typeParam N - Union of all node names in the graph (e.g., `\"agent\" | \"tool\"`).\n *   Accumulated as you call `.addNode()`. Used for type-safe routing.\n *\n * @typeParam I - The input schema definition. Set via the `input` option in the\n *   constructor to restrict what data the graph accepts when invoked.\n *\n * @typeParam O - The output schema definition. Set via the `output` option in the\n *   constructor to restrict what data the graph returns after execution.\n *\n * @typeParam C - The config/context schema definition. Set via the `context` option\n *   to define additional configuration passed at runtime.\n *\n * @typeParam NodeReturnType - Constrains what types nodes in this graph can return.\n *\n * @typeParam InterruptType - The type for {@link interrupt} resume values. Set via\n *   the `interrupt` option for typed human-in-the-loop patterns.\n *\n * @typeParam WriterType - The type for custom stream writers. Set via the `writer`\n *   option to enable typed custom streaming from within nodes.\n *\n * @example\n * ```ts\n * import {\n *   type BaseMessage,\n *   AIMessage,\n *   HumanMessage,\n * } from \"@langchain/core/messages\";\n * import { StateGraph, Annotation } from \"@langchain/langgraph\";\n *\n * // Define a state with a single key named \"messages\" that will\n * // combine a returned BaseMessage or arrays of BaseMessages\n * const StateAnnotation = Annotation.Root({\n *   sentiment: Annotation<string>,\n *   messages: Annotation<BaseMessage[]>({\n *     reducer: (left: BaseMessage[], right: BaseMessage | BaseMessage[]) => {\n *       if (Array.isArray(right)) {\n *         return left.concat(right);\n *       }\n *       return left.concat([right]);\n *     },\n *     default: () => [],\n *   }),\n * });\n *\n * const graphBuilder = new StateGraph(StateAnnotation);\n *\n * // A node in the graph that returns an object with a \"messages\" key\n * // will update the state by combining the existing value with the returned one.\n * const myNode = (state: typeof StateAnnotation.State) => {\n *   return {\n *     messages: [new AIMessage(\"Some new response\")],\n *     sentiment: \"positive\",\n *   };\n * };\n *\n * const graph = graphBuilder\n *   .addNode(\"myNode\", myNode)\n *   .addEdge(\"__start__\", \"myNode\")\n *   .addEdge(\"myNode\", \"__end__\")\n *   .compile();\n *\n * await graph.invoke({ messages: [new HumanMessage(\"how are you?\")] });\n *\n * // {\n * //   messages: [HumanMessage(\"how are you?\"), AIMessage(\"Some new response\")],\n * //   sentiment: \"positive\",\n * // }\n * ```\n */\nexport class StateGraph<\n  SD extends StateDefinitionInit | unknown,\n  S = ExtractStateType<SD>,\n  U = ExtractUpdateType<SD, S>,\n  N extends string = typeof START,\n  I extends StateDefinitionInit = ExtractStateDefinition<SD>,\n  O extends StateDefinitionInit = ExtractStateDefinition<SD>,\n  C extends StateDefinitionInit = StateDefinition,\n  NodeReturnType = unknown,\n  InterruptType = unknown,\n  WriterType = unknown\n> extends Graph<N, S, U, StateGraphNodeSpec<S, U>, ToStateDefinition<C>> {\n  channels: Record<string, BaseChannel> = {};\n\n  // TODO: this doesn't dedupe edges as in py, so worth fixing at some point\n  waitingEdges: Set<[N[], N]> = new Set();\n\n  /** @internal */\n  _schemaDefinition: StateDefinition;\n\n  /** @internal */\n  _schemaRuntimeDefinition: InteropZodObject | AnyStateSchema | undefined;\n\n  /** @internal */\n  _inputDefinition: I;\n\n  /** @internal */\n  _inputRuntimeDefinition:\n    | InteropZodObject\n    | AnyStateSchema\n    | PartialStateSchema\n    | undefined;\n\n  /** @internal */\n  _outputDefinition: O;\n\n  /** @internal */\n  _outputRuntimeDefinition: InteropZodObject | AnyStateSchema | undefined;\n\n  /**\n   * Map schemas to managed values\n   * @internal\n   */\n  _schemaDefinitions = new Map();\n\n  /** @internal */\n  _metaRegistry: SchemaMetaRegistry = schemaMetaRegistry;\n\n  /** @internal Used only for typing. */\n  _configSchema: ToStateDefinition<C> | undefined;\n\n  /** @internal */\n  _configRuntimeSchema: InteropZodObject | undefined;\n\n  /** @internal */\n  _interrupt: InterruptType;\n\n  /** @internal */\n  _writer: WriterType;\n\n  declare Node: StrictNodeAction<S, U, C, N, InterruptType, WriterType>;\n\n  /**\n   * Create a new StateGraph for building stateful, multi-step workflows.\n   *\n   * Accepts state definitions via `Annotation.Root`, `StateSchema`, or Zod schemas.\n   *\n   * @example Direct schema\n   * ```ts\n   * const StateAnnotation = Annotation.Root({\n   *   messages: Annotation<string[]>({ reducer: (a, b) => [...a, ...b] }),\n   * });\n   * const graph = new StateGraph(StateAnnotation);\n   * ```\n   *\n   * @example Direct schema with input/output filtering\n   * ```ts\n   * const graph = new StateGraph(StateAnnotation, {\n   *   input: InputSchema,\n   *   output: OutputSchema,\n   * });\n   * ```\n   *\n   * @example Object pattern with state, input, output\n   * ```ts\n   * const graph = new StateGraph({\n   *   state: FullStateSchema,\n   *   input: InputSchema,\n   *   output: OutputSchema,\n   * });\n   * ```\n   *\n   * @example Input/output only (state inferred from input)\n   * ```ts\n   * const graph = new StateGraph({\n   *   input: InputAnnotation,\n   *   output: OutputAnnotation,\n   * });\n   * ```\n   */\n  constructor(\n    state: SD extends StateDefinitionInit ? SD : never,\n    options?:\n      | C\n      | AnnotationRoot<ToStateDefinition<C>>\n      | StateGraphOptions<I, O, C, N, InterruptType, WriterType>\n  );\n\n  constructor(\n    fields: SD extends StateDefinition\n      ? StateGraphArgsWithInputOutputSchemas<SD, ToStateDefinition<O>>\n      : never,\n    contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>\n  );\n\n  constructor(\n    fields: SD extends StateDefinition\n      ?\n          | AnnotationRoot<SD>\n          | StateGraphArgsWithStateSchema<\n              SD,\n              ToStateDefinition<I>,\n              ToStateDefinition<O>\n            >\n      : never,\n    contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>\n  );\n\n  constructor(\n    init: Omit<\n      StateGraphInit<\n        SD extends StateDefinitionInit ? SD : StateDefinitionInit,\n        SD extends StateDefinitionInit ? SD : StateDefinitionInit,\n        O,\n        C extends ContextSchemaInit ? C : undefined,\n        N,\n        InterruptType,\n        WriterType\n      >,\n      \"state\" | \"stateSchema\" | \"input\"\n    > & {\n      input: SD extends StateDefinitionInit ? SD : never;\n      state?: never;\n      stateSchema?: never;\n    },\n    contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>\n  );\n\n  constructor(\n    init: StateGraphInit<\n      SD extends StateDefinitionInit ? SD : StateDefinitionInit,\n      I,\n      O,\n      C extends ContextSchemaInit ? C : undefined,\n      N,\n      InterruptType,\n      WriterType\n    >\n  );\n\n  /** @deprecated Use `Annotation.Root`, `StateSchema`, or Zod schemas instead. */\n  constructor(\n    fields: StateGraphArgs<S>,\n    contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>\n  );\n\n  constructor(\n    stateOrInit:\n      | StateDefinitionInit\n      | StateGraphInit<StateDefinitionInit, I, O>\n      | StateGraphArgs<S>,\n    options?:\n      | C\n      | AnnotationRoot<ToStateDefinition<C>>\n      | StateGraphOptions<\n          I,\n          O,\n          C extends ContextSchemaInit ? C : undefined,\n          N,\n          InterruptType,\n          WriterType\n        >\n  ) {\n    super();\n\n    // Normalize all input patterns to StateGraphInit format\n    const init = this._normalizeToStateGraphInit(stateOrInit, options);\n\n    // Resolve state schema: state > stateSchema (deprecated) > input\n    const stateSchema = init.state ?? init.stateSchema ?? init.input;\n    if (!stateSchema) {\n      throw new StateGraphInputError();\n    }\n\n    // Get channel definitions from the schema (may contain channel factories)\n    const stateChannelDef = this._getChannelsFromSchema(stateSchema);\n\n    // Set schema definitions (these may contain channel factories)\n    this._schemaDefinition = stateChannelDef;\n\n    // Set runtime definitions for validation\n    if (StateSchema.isInstance(stateSchema)) {\n      this._schemaRuntimeDefinition = stateSchema;\n    } else if (isInteropZodObject(stateSchema)) {\n      this._schemaRuntimeDefinition = stateSchema;\n    }\n\n    // Set input runtime definition\n    if (init.input) {\n      if (StateSchema.isInstance(init.input)) {\n        this._inputRuntimeDefinition = init.input;\n      } else if (isInteropZodObject(init.input)) {\n        this._inputRuntimeDefinition = init.input;\n      } else {\n        this._inputRuntimeDefinition = PartialStateSchema;\n      }\n    } else {\n      this._inputRuntimeDefinition = PartialStateSchema;\n    }\n\n    // Set output runtime definition\n    if (init.output) {\n      if (StateSchema.isInstance(init.output)) {\n        this._outputRuntimeDefinition = init.output;\n      } else if (isInteropZodObject(init.output)) {\n        this._outputRuntimeDefinition = init.output;\n      } else {\n        this._outputRuntimeDefinition = this._schemaRuntimeDefinition;\n      }\n    } else {\n      this._outputRuntimeDefinition = this._schemaRuntimeDefinition;\n    }\n\n    // Set input/output definitions (default to state)\n    const inputChannelDef = init.input\n      ? this._getChannelsFromSchema(init.input)\n      : stateChannelDef;\n    const outputChannelDef = init.output\n      ? (this._getChannelsFromSchema(init.output) as O)\n      : stateChannelDef;\n    this._inputDefinition = inputChannelDef as I;\n    this._outputDefinition = outputChannelDef as O;\n\n    // Add all schemas (_addSchema instantiates channel factories and populates this.channels)\n    this._addSchema(this._schemaDefinition);\n    this._addSchema(this._inputDefinition);\n    this._addSchema(this._outputDefinition);\n\n    // Handle context schema\n    if (init.context) {\n      if (isInteropZodObject(init.context)) {\n        this._configRuntimeSchema = init.context;\n      }\n    }\n\n    // Handle interrupt and writer\n    this._interrupt = init.interrupt as InterruptType;\n    this._writer = init.writer as WriterType;\n  }\n\n  /**\n   * Normalize all constructor input patterns to a unified StateGraphInit object.\n   * @internal\n   */\n  private _normalizeToStateGraphInit(\n    stateOrInit: unknown,\n    options?: unknown\n  ): StateGraphInit<StateDefinitionInit, I, O, C> {\n    // Check if already StateGraphInit format\n    if (isStateGraphInit(stateOrInit)) {\n      // Second arg can be either a direct context schema or an options object\n      if (isInteropZodObject(options) || AnnotationRoot.isInstance(options)) {\n        return {\n          ...stateOrInit,\n          context: options as C,\n        };\n      }\n      // Merge any 2nd arg options\n      const opts = options as StateGraphOptions<I, O> | undefined;\n      return {\n        ...stateOrInit,\n        input: stateOrInit.input ?? opts?.input,\n        output: stateOrInit.output ?? opts?.output,\n        context: stateOrInit.context ?? opts?.context,\n        interrupt: stateOrInit.interrupt ?? opts?.interrupt,\n        writer: stateOrInit.writer ?? opts?.writer,\n        nodes: stateOrInit.nodes ?? opts?.nodes,\n      } as StateGraphInit<StateDefinitionInit, I, O, C>;\n    }\n\n    // Check if direct schema (StateSchema, Zod, Annotation, StateDefinition)\n    if (isStateDefinitionInit(stateOrInit)) {\n      // Second arg can be either a direct context schema or an options object\n      if (isInteropZodObject(options) || AnnotationRoot.isInstance(options)) {\n        return {\n          state: stateOrInit,\n          context: options as C,\n        };\n      }\n      const opts = options as StateGraphOptions<I, O> | undefined;\n      return {\n        state: stateOrInit as StateDefinitionInit,\n        input: opts?.input as I,\n        output: opts?.output as O,\n        context: opts?.context,\n        interrupt: opts?.interrupt,\n        writer: opts?.writer,\n        nodes: opts?.nodes,\n      };\n    }\n\n    // Check for legacy { channels } format\n    if (isStateGraphArgs(stateOrInit as StateGraphArgs<S>)) {\n      const legacyArgs = stateOrInit as StateGraphArgs<S>;\n      const spec = _getChannels(legacyArgs.channels);\n      return {\n        state: spec as StateDefinitionInit,\n      };\n    }\n\n    throw new StateGraphInputError();\n  }\n\n  /**\n   * Convert any supported schema type to a StateDefinition (channel map).\n   * @internal\n   */\n  private _getChannelsFromSchema(schema: StateDefinitionInit): StateDefinition {\n    if (StateSchema.isInstance(schema)) {\n      return schema.getChannels();\n    }\n\n    if (isInteropZodObject(schema)) {\n      return this._metaRegistry.getChannelsForSchema(schema);\n    }\n\n    // AnnotationRoot - has .spec property that is the StateDefinition\n    if (\n      typeof schema === \"object\" &&\n      \"lc_graph_name\" in schema &&\n      (schema as { lc_graph_name: unknown }).lc_graph_name === \"AnnotationRoot\"\n    ) {\n      return (schema as AnnotationRoot<StateDefinition>).spec;\n    }\n\n    // StateDefinition (raw channel map) - return as-is\n    if (\n      typeof schema === \"object\" &&\n      !Array.isArray(schema) &&\n      Object.keys(schema).length > 0\n    ) {\n      return schema as StateDefinition;\n    }\n\n    throw new StateGraphInputError(\n      \"Invalid schema type. Expected StateSchema, Zod object, AnnotationRoot, or StateDefinition.\"\n    );\n  }\n\n  get allEdges(): Set<[string, string]> {\n    return new Set([\n      ...this.edges,\n      ...Array.from(this.waitingEdges).flatMap(([starts, end]) =>\n        starts.map((start) => [start, end] as [string, string])\n      ),\n    ]);\n  }\n\n  _addSchema(stateDefinition: StateDefinitionInit) {\n    if (this._schemaDefinitions.has(stateDefinition)) {\n      return;\n    }\n    // TODO: Support managed values\n    this._schemaDefinitions.set(stateDefinition, stateDefinition);\n    for (const [key, val] of Object.entries(stateDefinition)) {\n      let channel;\n      if (typeof val === \"function\") {\n        channel = val();\n      } else {\n        channel = val;\n      }\n      if (this.channels[key] !== undefined) {\n        if (!this.channels[key].equals(channel)) {\n          if (channel.lc_graph_name !== \"LastValue\") {\n            throw new Error(\n              `Channel \"${key}\" already exists with a different type.`\n            );\n          }\n        }\n      } else {\n        this.channels[key] = channel;\n      }\n    }\n  }\n\n  override addNode<\n    K extends string,\n    NodeMap extends Record<K, NodeAction<S, U, C, InterruptType, WriterType>>\n  >(\n    nodes: NodeMap\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<\n      NodeReturnType,\n      {\n        [key in keyof NodeMap]: NodeMap[key] extends NodeAction<\n          S,\n          infer U,\n          C,\n          InterruptType,\n          WriterType\n        >\n          ? U\n          : never;\n      }\n    >\n  >;\n\n  override addNode<K extends string, NodeInput = S, NodeOutput extends U = U>(\n    nodes:\n      | [\n          key: K,\n          action: NodeAction<\n            NodeInput,\n            NodeOutput,\n            C,\n            InterruptType,\n            WriterType\n          >,\n          options?: StateGraphAddNodeOptions\n        ][]\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  >;\n\n  override addNode<\n    K extends string,\n    InputSchema extends StateDefinitionInit,\n    NodeOutput extends U = U\n  >(\n    key: K,\n    action: NodeAction<\n      ExtractStateType<InputSchema>,\n      NodeOutput,\n      C,\n      InterruptType,\n      WriterType\n    >,\n    options: StateGraphAddNodeOptions<N | K, InputSchema>\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  >;\n\n  override addNode<\n    K extends string,\n    InputSchema extends StateDefinitionInit,\n    NodeOutput extends U = U\n  >(\n    key: K,\n    action: NodeAction<\n      ExtractStateType<InputSchema>,\n      NodeOutput,\n      C,\n      InterruptType,\n      WriterType\n    >,\n    options: StateGraphAddNodeOptions<N | K, InputSchema>\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  >;\n\n  override addNode<K extends string, NodeInput = S, NodeOutput extends U = U>(\n    key: K,\n    action: NodeAction<NodeInput, NodeOutput, C, InterruptType, WriterType>,\n    options?: StateGraphAddNodeOptions\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  >;\n\n  override addNode<K extends string, NodeInput = S>(\n    key: K,\n    action: NodeAction<NodeInput, U, C, InterruptType, WriterType>,\n    options?: StateGraphAddNodeOptions\n  ): StateGraph<SD, S, U, N | K, I, O, C, NodeReturnType>;\n\n  override addNode<K extends string, NodeInput = S, NodeOutput extends U = U>(\n    ...args:\n      | [\n          key: K,\n          action: NodeAction<\n            NodeInput,\n            NodeOutput,\n            C,\n            InterruptType,\n            WriterType\n          >,\n          options?: StateGraphAddNodeOptions\n        ]\n      | [\n          nodes:\n            | Record<K, NodeAction<NodeInput, U, C, InterruptType, WriterType>>\n            | [\n                key: K,\n                action: NodeAction<NodeInput, U, C, InterruptType, WriterType>,\n                options?: StateGraphAddNodeOptions\n              ][]\n        ]\n  ): StateGraph<SD, S, U, N | K, I, O, C> {\n    function isMultipleNodes(\n      args: unknown[]\n    ): args is [\n      nodes:\n        | Record<K, NodeAction<NodeInput, U, C, InterruptType, WriterType>>\n        | [\n            key: K,\n            action: NodeAction<NodeInput, U, C, InterruptType, WriterType>,\n            options?: AddNodeOptions\n          ][]\n    ] {\n      return args.length >= 1 && typeof args[0] !== \"string\";\n    }\n\n    const nodes = (\n      isMultipleNodes(args) // eslint-disable-line no-nested-ternary\n        ? Array.isArray(args[0])\n          ? args[0]\n          : Object.entries(args[0]).map(([key, action]) => [key, action])\n        : [[args[0], args[1], args[2]]]\n    ) as [\n      K,\n      NodeAction<NodeInput, U, C, InterruptType, WriterType>,\n      StateGraphAddNodeOptions | undefined\n    ][];\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      if (key in this.channels) {\n        throw new Error(\n          `${key} is already being used as a state attribute (a.k.a. a channel), cannot also be used as a node name.`\n        );\n      }\n\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 || key === START) {\n        throw new Error(`Node \\`${key}\\` is reserved.`);\n      }\n\n      let inputSpec: StateDefinition = this._schemaDefinition;\n      if (options?.input !== undefined) {\n        inputSpec = this._getChannelsFromSchema(options.input);\n      }\n      this._addSchema(inputSpec);\n\n      let runnable;\n      if (Runnable.isRunnable(action)) {\n        runnable = action;\n      } else if (typeof action === \"function\") {\n        runnable = new RunnableCallable({\n          func: action,\n          name: key,\n          trace: false,\n        });\n      } else {\n        runnable = _coerceToRunnable(action);\n      }\n\n      let cachePolicy = options?.cachePolicy;\n      if (typeof cachePolicy === \"boolean\") {\n        cachePolicy = cachePolicy ? {} : undefined;\n      }\n\n      const nodeSpec: StateGraphNodeSpec<S, U> = {\n        runnable: runnable as unknown as Runnable<S, U>,\n        retryPolicy: options?.retryPolicy,\n        cachePolicy,\n        metadata: options?.metadata,\n        input: inputSpec ?? this._schemaDefinition,\n        subgraphs: isPregelLike(runnable)\n          ? // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            [runnable as any]\n          : options?.subgraphs,\n        ends: options?.ends,\n        defer: options?.defer,\n      };\n\n      this.nodes[key as unknown as N] = nodeSpec;\n    }\n\n    return this as StateGraph<SD, S, U, N | K, I, O, C>;\n  }\n\n  override addEdge(\n    startKey: typeof START | N | N[],\n    endKey: N | typeof END\n  ): this {\n    if (typeof startKey === \"string\") {\n      return super.addEdge(startKey, endKey);\n    }\n\n    if (this.compiled) {\n      console.warn(\n        \"Adding an edge to a graph that has already been compiled. This will \" +\n          \"not be reflected in the compiled graph.\"\n      );\n    }\n\n    for (const start of startKey) {\n      if (start === END) {\n        throw new Error(\"END cannot be a start node\");\n      }\n      if (!Object.keys(this.nodes).some((node) => node === start)) {\n        throw new Error(`Need to add a node named \"${start}\" first`);\n      }\n    }\n    if (endKey === END) {\n      throw new Error(\"END cannot be an end node\");\n    }\n    if (!Object.keys(this.nodes).some((node) => node === endKey)) {\n      throw new Error(`Need to add a node named \"${endKey}\" first`);\n    }\n\n    this.waitingEdges.add([startKey, endKey]);\n\n    return this;\n  }\n\n  addSequence<K extends string, NodeInput = S, NodeOutput extends U = U>(\n    nodes: [\n      key: K,\n      action: NodeAction<NodeInput, NodeOutput, C, InterruptType, WriterType>,\n      options?: StateGraphAddNodeOptions\n    ][]\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  >;\n\n  addSequence<\n    K extends string,\n    NodeMap extends Record<K, NodeAction<S, U, C, InterruptType, WriterType>>\n  >(\n    nodes: NodeMap\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<\n      NodeReturnType,\n      {\n        [key in keyof NodeMap]: NodeMap[key] extends NodeAction<\n          S,\n          infer U,\n          C,\n          InterruptType,\n          WriterType\n        >\n          ? U\n          : never;\n      }\n    >\n  >;\n\n  addSequence<K extends string, NodeInput = S, NodeOutput extends U = U>(\n    nodes:\n      | [\n          key: K,\n          action: NodeAction<\n            NodeInput,\n            NodeOutput,\n            C,\n            InterruptType,\n            WriterType\n          >,\n          options?: StateGraphAddNodeOptions\n        ][]\n      | Record<\n          K,\n          NodeAction<NodeInput, NodeOutput, C, InterruptType, WriterType>\n        >\n  ): StateGraph<\n    SD,\n    S,\n    U,\n    N | K,\n    I,\n    O,\n    C,\n    MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n  > {\n    const parsedNodes = Array.isArray(nodes) ? nodes : Object.entries(nodes);\n\n    if (parsedNodes.length === 0) {\n      throw new Error(\"Sequence requires at least one node.\");\n    }\n\n    let previousNode: N | undefined;\n    for (const [key, action, options] of parsedNodes) {\n      if (key in this.nodes) {\n        throw new Error(\n          `Node names must be unique: node with the name \"${key}\" already exists.`\n        );\n      }\n\n      const validKey = key as unknown as N;\n      this.addNode(\n        validKey,\n        action as NodeAction<S, U, C, InterruptType, WriterType>,\n        options\n      );\n      if (previousNode != null) {\n        this.addEdge(previousNode, validKey);\n      }\n\n      previousNode = validKey;\n    }\n\n    return this as StateGraph<\n      SD,\n      S,\n      U,\n      N | K,\n      I,\n      O,\n      C,\n      MergeReturnType<NodeReturnType, { [key in K]: NodeOutput }>\n    >;\n  }\n\n  override compile({\n    checkpointer,\n    store,\n    cache,\n    interruptBefore,\n    interruptAfter,\n    name,\n    description,\n  }: {\n    checkpointer?: BaseCheckpointSaver | boolean;\n    store?: BaseStore;\n    cache?: BaseCache;\n    interruptBefore?: N[] | All;\n    interruptAfter?: N[] | All;\n    name?: string;\n    description?: string;\n  } = {}): CompiledStateGraph<\n    Prettify<S>,\n    Prettify<U>,\n    N,\n    I,\n    O,\n    C,\n    NodeReturnType,\n    InterruptType,\n    WriterType\n  > {\n    // validate the graph\n    this.validate([\n      ...(Array.isArray(interruptBefore) ? interruptBefore : []),\n      ...(Array.isArray(interruptAfter) ? interruptAfter : []),\n    ]);\n\n    // prepare output channels\n    const outputKeys = Object.keys(\n      this._schemaDefinitions.get(this._outputDefinition)\n    );\n    const outputChannels =\n      outputKeys.length === 1 && outputKeys[0] === ROOT ? ROOT : outputKeys;\n\n    const streamKeys = Object.keys(this.channels);\n    const streamChannels =\n      streamKeys.length === 1 && streamKeys[0] === ROOT ? ROOT : streamKeys;\n\n    const userInterrupt = this._interrupt;\n    // create empty compiled graph\n    const compiled = new CompiledStateGraph<\n      S,\n      U,\n      N,\n      I,\n      O,\n      C,\n      NodeReturnType,\n      InterruptType,\n      WriterType\n    >({\n      builder: this,\n      checkpointer,\n      interruptAfter,\n      interruptBefore,\n      autoValidate: false,\n      nodes: {} as Record<N | typeof START, PregelNode<S, U>>,\n      channels: {\n        ...this.channels,\n        [START]: new EphemeralValue(),\n      } as Record<N | typeof START | typeof END | string, BaseChannel>,\n      inputChannels: START,\n      outputChannels,\n      streamChannels,\n      streamMode: \"updates\",\n      store,\n      cache,\n      name,\n      description,\n      userInterrupt,\n    });\n\n    // attach nodes, edges and branches\n    compiled.attachNode(START);\n    for (const [key, node] of Object.entries<StateGraphNodeSpec<S, U>>(\n      this.nodes\n    )) {\n      compiled.attachNode(key as N, node);\n    }\n    compiled.attachBranch(START, SELF, _getControlBranch() as Branch<S, N>, {\n      withReader: false,\n    });\n    for (const [key] of Object.entries<StateGraphNodeSpec<S, U>>(this.nodes)) {\n      compiled.attachBranch(\n        key as N,\n        SELF,\n        _getControlBranch() as Branch<S, N>,\n        {\n          withReader: false,\n        }\n      );\n    }\n    for (const [start, end] of this.edges) {\n      compiled.attachEdge(start, end);\n    }\n    for (const [starts, end] of this.waitingEdges) {\n      compiled.attachEdge(starts, 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\nfunction _getChannels<Channels extends Record<string, unknown> | unknown>(\n  schema: StateGraphArgs<Channels>[\"channels\"]\n): Record<string, BaseChannel> {\n  const channels: Record<string, BaseChannel> = {};\n  for (const [name, val] of Object.entries(schema)) {\n    if (name === ROOT) {\n      channels[name] = getChannel<Channels>(val as SingleReducer<Channels>);\n    } else {\n      const key = name as keyof Channels;\n      channels[name] = getChannel<Channels[typeof key]>(\n        val as SingleReducer<Channels[typeof key]>\n      );\n    }\n  }\n  return channels;\n}\n\n/**\n * Final result from building and compiling a {@link StateGraph}.\n * Should not be instantiated directly, only using the StateGraph `.compile()`\n * instance method.\n *\n * @typeParam S - The full state type representing the complete shape of your graph's\n *   state after all reducers have been applied. This is the type you receive when\n *   reading state in nodes or after invoking the graph.\n *\n * @typeParam U - The update type representing what nodes can return to modify state.\n *   Typically a partial of the state type, allowing nodes to update only specific fields.\n *   Can also include {@link Command} objects for advanced control flow.\n *\n * @typeParam N - Union of all node names in the graph (e.g., `\"agent\" | \"tool\"`).\n *   Used for type-safe routing with {@link Command.goto} and edge definitions.\n *\n * @typeParam I - The input schema definition. Determines what shape of data the graph\n *   accepts when invoked. Defaults to the main state schema if not explicitly set.\n *\n * @typeParam O - The output schema definition. Determines what shape of data the graph\n *   returns after execution. Defaults to the main state schema if not explicitly set.\n *\n * @typeParam C - The config/context schema definition. Defines additional configuration\n *   that can be passed to the graph at runtime via {@link LangGraphRunnableConfig}.\n *\n * @typeParam NodeReturnType - Constrains what types nodes in this graph can return.\n *   Useful for enforcing consistent return patterns across all nodes.\n *\n * @typeParam InterruptType - The type of values that can be passed when resuming from\n *   an {@link interrupt}. Used with human-in-the-loop patterns.\n *\n * @typeParam WriterType - The type for custom stream writers. Used with the `writer`\n *   option to enable typed custom streaming from within nodes.\n */\nexport class CompiledStateGraph<\n  S,\n  U,\n  N extends string = typeof START,\n  I extends StateDefinitionInit = StateDefinition,\n  O extends StateDefinitionInit = StateDefinition,\n  C extends StateDefinitionInit = StateDefinition,\n  NodeReturnType = unknown,\n  InterruptType = unknown,\n  WriterType = unknown\n> extends CompiledGraph<\n  N,\n  S,\n  U,\n  ExtractStateType<C>,\n  ExtractUpdateType<I, ExtractStateType<I>>,\n  ExtractStateType<O>,\n  NodeReturnType,\n  CommandInstance<InferInterruptResumeType<InterruptType>, Prettify<U>, N>,\n  InferWriterType<WriterType>\n> {\n  declare builder: StateGraph<unknown, S, U, N, I, O, C, NodeReturnType>;\n\n  /**\n   * The description of the compiled graph.\n   * This is used by the supervisor agent to describe the handoff to the agent.\n   */\n  description?: string;\n\n  /** @internal */\n  _metaRegistry: SchemaMetaRegistry = schemaMetaRegistry;\n\n  constructor({\n    description,\n    ...rest\n  }: { description?: string } & ConstructorParameters<\n    typeof CompiledGraph<\n      N,\n      S,\n      U,\n      ExtractStateType<C>,\n      ExtractUpdateType<I, ExtractStateType<I>>,\n      ExtractStateType<O>,\n      NodeReturnType,\n      CommandInstance<InferInterruptResumeType<InterruptType>, Prettify<U>, N>,\n      InferWriterType<WriterType>\n    >\n  >[0]) {\n    super(rest);\n    this.description = description;\n  }\n\n  attachNode(key: typeof START, node?: never): void;\n\n  attachNode(key: N, node: StateGraphNodeSpec<S, U>): void;\n\n  attachNode(key: N | typeof START, node?: StateGraphNodeSpec<S, U>): void {\n    let outputKeys: string[];\n    if (key === START) {\n      // Get input schema keys excluding managed values\n      outputKeys = Object.entries(\n        this.builder._schemaDefinitions.get(this.builder._inputDefinition)\n      ).map(([k]) => k);\n    } else {\n      outputKeys = Object.keys(this.builder.channels);\n    }\n\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    function _getRoot(input: unknown): [string, any][] | null {\n      if (isCommand(input)) {\n        if (input.graph === Command.PARENT) {\n          return null;\n        }\n        return input._updateAsTuples();\n      } else if (\n        Array.isArray(input) &&\n        input.length > 0 &&\n        input.some((i) => isCommand(i))\n      ) {\n        const updates: [string, unknown][] = [];\n        for (const i of input) {\n          if (isCommand(i)) {\n            if (i.graph === Command.PARENT) {\n              continue;\n            }\n            updates.push(...i._updateAsTuples());\n          } else {\n            updates.push([ROOT, i]);\n          }\n        }\n        return updates;\n      } else if (input != null) {\n        return [[ROOT, input]];\n      }\n      return null;\n    }\n\n    // to avoid name collision below\n    const nodeKey = key;\n\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    function _getUpdates(input: U): [string, any][] | null {\n      if (!input) {\n        return null;\n      } else if (isCommand(input)) {\n        if (input.graph === Command.PARENT) {\n          return null;\n        }\n        return input._updateAsTuples().filter(([k]) => outputKeys.includes(k));\n      } else if (\n        Array.isArray(input) &&\n        input.length > 0 &&\n        input.some(isCommand)\n      ) {\n        const updates: [string, unknown][] = [];\n        for (const item of input) {\n          if (isCommand(item)) {\n            if (item.graph === Command.PARENT) {\n              continue;\n            }\n            updates.push(\n              ...item._updateAsTuples().filter(([k]) => outputKeys.includes(k))\n            );\n          } else {\n            const itemUpdates = _getUpdates(item);\n            if (itemUpdates) {\n              updates.push(...(itemUpdates ?? []));\n            }\n          }\n        }\n        return updates;\n      } else if (typeof input === \"object\" && !Array.isArray(input)) {\n        return Object.entries(input).filter(([k]) => outputKeys.includes(k));\n      } else {\n        const typeofInput = Array.isArray(input) ? \"array\" : typeof input;\n        throw new InvalidUpdateError(\n          `Expected node \"${nodeKey.toString()}\" to return an object or an array containing at least one Command object, received ${typeofInput}`,\n          {\n            lc_error_code: \"INVALID_GRAPH_NODE_RETURN_VALUE\",\n          }\n        );\n      }\n    }\n\n    const stateWriteEntries: (ChannelWriteTupleEntry | ChannelWriteEntry)[] = [\n      {\n        value: PASSTHROUGH,\n        mapper: new RunnableCallable({\n          func:\n            outputKeys.length && outputKeys[0] === ROOT\n              ? _getRoot\n              : _getUpdates,\n          trace: false,\n          recurse: false,\n        }),\n      },\n    ];\n\n    // add node and output channel\n    if (key === START) {\n      this.nodes[key] = new PregelNode<S, U>({\n        tags: [TAG_HIDDEN],\n        triggers: [START],\n        channels: [START],\n        writers: [new ChannelWrite(stateWriteEntries, [TAG_HIDDEN])],\n      });\n    } else {\n      const inputDefinition = node?.input ?? this.builder._schemaDefinition;\n      const inputValues = Object.fromEntries(\n        Object.keys(this.builder._schemaDefinitions.get(inputDefinition)).map(\n          (k) => [k, k]\n        )\n      );\n      const isSingleInput =\n        Object.keys(inputValues).length === 1 && ROOT in inputValues;\n      const branchChannel = `branch:to:${key}` as string | N;\n      this.channels[branchChannel] = node?.defer\n        ? new LastValueAfterFinish()\n        : new EphemeralValue(false);\n      this.nodes[key] = new PregelNode<S, U>({\n        triggers: [branchChannel],\n        // read state keys\n        channels: isSingleInput ? Object.keys(inputValues) : inputValues,\n        // publish to state keys\n        writers: [new ChannelWrite(stateWriteEntries, [TAG_HIDDEN])],\n        mapper: isSingleInput\n          ? undefined\n          : // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            (input: Record<string, any>) => {\n              return Object.fromEntries(\n                Object.entries(input).filter(([k]) => k in inputValues)\n              );\n            },\n        bound: node?.runnable,\n        metadata: node?.metadata,\n        retryPolicy: node?.retryPolicy,\n        cachePolicy: node?.cachePolicy,\n        subgraphs: node?.subgraphs,\n        ends: node?.ends,\n      });\n    }\n  }\n\n  attachEdge(starts: N | N[] | \"__start__\", end: N | \"__end__\"): void {\n    if (end === END) return;\n    if (typeof starts === \"string\") {\n      this.nodes[starts].writers.push(\n        new ChannelWrite(\n          [{ channel: `branch:to:${end}`, value: null }],\n          [TAG_HIDDEN]\n        )\n      );\n    } else if (Array.isArray(starts)) {\n      const channelName = `join:${starts.join(\"+\")}:${end}`;\n      // register channel\n      this.channels[channelName as string | N] = this.builder.nodes[end].defer\n        ? new NamedBarrierValueAfterFinish(new Set(starts))\n        : new NamedBarrierValue(new Set(starts));\n      // subscribe to channel\n      this.nodes[end].triggers.push(channelName);\n      // publish to channel\n      for (const start of starts) {\n        this.nodes[start].writers.push(\n          new ChannelWrite(\n            [{ channel: channelName, value: start }],\n            [TAG_HIDDEN]\n          )\n        );\n      }\n    }\n  }\n\n  attachBranch(\n    start: N | typeof START,\n    _: string,\n    branch: Branch<S, N>,\n    options: { withReader?: boolean } = { withReader: true }\n  ): void {\n    const branchWriter = async (\n      packets: (string | Send)[],\n      config: LangGraphRunnableConfig\n    ) => {\n      const filteredPackets = packets.filter((p) => p !== END);\n      if (!filteredPackets.length) return;\n\n      const writes: (ChannelWriteEntry | Send)[] = filteredPackets.map((p) => {\n        if (_isSend(p)) return p;\n        return { channel: p === END ? p : `branch:to:${p}`, value: start };\n      });\n      await ChannelWrite.doWrite(\n        { ...config, tags: (config.tags ?? []).concat([TAG_HIDDEN]) },\n        writes\n      );\n    };\n    // attach branch publisher\n    this.nodes[start].writers.push(\n      branch.run(\n        branchWriter,\n        // reader\n        options.withReader\n          ? (config) =>\n              ChannelRead.doRead<S>(\n                config,\n                this.streamChannels ?? this.outputChannels,\n                true\n              )\n          : undefined\n      )\n    );\n  }\n\n  protected async _validateInput(\n    input: ExtractUpdateType<I, ExtractStateType<I>>\n  ): Promise<ExtractUpdateType<I, ExtractStateType<I>>> {\n    if (input == null) return input;\n\n    const inputDef = this.builder._inputRuntimeDefinition;\n    const schemaDef = this.builder._schemaRuntimeDefinition;\n\n    // Determine which schema to use for validation\n    // Priority: inputDef (if it's a validatable schema), otherwise fall back to schemaDef\n\n    // Handle StateSchema validation for input schema\n    if (StateSchema.isInstance(inputDef)) {\n      if (isCommand(input)) {\n        const parsedInput = input;\n        if (input.update) {\n          parsedInput.update = await inputDef.validateInput(\n            Array.isArray(input.update)\n              ? Object.fromEntries(input.update)\n              : input.update\n          );\n        }\n        return parsedInput;\n      }\n      return await inputDef.validateInput(input);\n    }\n\n    // Handle StateSchema validation for state schema (when input is partial state)\n    if (inputDef === PartialStateSchema && StateSchema.isInstance(schemaDef)) {\n      if (isCommand(input)) {\n        const parsedInput = input;\n        if (input.update) {\n          parsedInput.update = await schemaDef.validateInput(\n            Array.isArray(input.update)\n              ? Object.fromEntries(input.update)\n              : input.update\n          );\n        }\n        return parsedInput;\n      }\n      return await schemaDef.validateInput(input);\n    }\n\n    // Handle InteropZodObject validation\n    const schema = (() => {\n      const apply = (schema: InteropZodObject | undefined) => {\n        if (schema == null) return undefined;\n        return this._metaRegistry.getExtendedChannelSchemas(schema, {\n          withReducerSchema: true,\n        });\n      };\n\n      if (isInteropZodObject(inputDef)) return apply(inputDef);\n      if (inputDef === PartialStateSchema) {\n        if (isInteropZodObject(schemaDef)) {\n          return interopZodObjectPartial(apply(schemaDef)!);\n        }\n        return undefined;\n      }\n      return undefined;\n    })();\n\n    if (isCommand(input)) {\n      const parsedInput = input;\n      if (input.update && schema != null)\n        parsedInput.update = interopParse(schema, input.update);\n      return parsedInput;\n    }\n    if (schema != null) return interopParse(schema, input);\n    return input;\n  }\n\n  public isInterrupted(input: unknown): input is {\n    [INTERRUPT]: Interrupt<InferInterruptInputType<InterruptType>>[];\n  } {\n    return isInterrupted(input);\n  }\n\n  protected async _validateContext(\n    config: Partial<Record<string, unknown>>\n  ): Promise<Partial<Record<string, unknown>>> {\n    const configSchema = this.builder._configRuntimeSchema;\n    if (isInteropZodObject(configSchema)) interopParse(configSchema, config);\n    return config;\n  }\n}\n\n/**\n * Check if value is a legacy StateGraphArgs with channels.\n * @internal\n * @deprecated Use StateGraphInit instead\n */\nfunction isStateGraphArgs<Channels extends object | unknown>(\n  obj: unknown | StateGraphArgs<Channels>\n): obj is StateGraphArgs<Channels> {\n  return (\n    typeof obj === \"object\" &&\n    obj !== null &&\n    (obj as StateGraphArgs<Channels>).channels !== undefined\n  );\n}\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction _controlBranch(value: any): (string | Send)[] {\n  if (_isSend(value)) {\n    return [value];\n  }\n  const commands = [];\n  if (isCommand(value)) {\n    commands.push(value);\n  } else if (Array.isArray(value)) {\n    commands.push(...value.filter(isCommand));\n  }\n  const destinations: (string | Send)[] = [];\n\n  for (const command of commands) {\n    if (command.graph === Command.PARENT) {\n      throw new ParentCommand(command);\n    }\n\n    if (_isSend(command.goto)) {\n      destinations.push(command.goto);\n    } else if (typeof command.goto === \"string\") {\n      destinations.push(command.goto);\n    } else {\n      if (Array.isArray(command.goto)) {\n        destinations.push(...command.goto);\n      }\n    }\n  }\n  return destinations;\n}\n\nfunction _getControlBranch() {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  const CONTROL_BRANCH_PATH = new RunnableCallable<any, (string | Send)[]>({\n    func: _controlBranch,\n    tags: [TAG_HIDDEN],\n    trace: false,\n    recurse: false,\n    name: \"<control_branch>\",\n  });\n  return new Branch({\n    path: CONTROL_BRANCH_PATH,\n  });\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AA2FA,MAAM,OAAO;AAgGb,MAAM,qBAAqB,OAAO,IAAI,0BAA0B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwGhE,IAAa,aAAb,cAWUA,oBAA+D;CACvE,WAAwC,EAAE;CAG1C,+BAA8B,IAAI,KAAK;;CAGvC;;CAGA;;CAGA;;CAGA;;CAOA;;CAGA;;;;;CAMA,qCAAqB,IAAI,KAAK;;CAG9B,gBAAoCC;;CAGpC;;CAGA;;CAGA;;CAGA;CA4GA,YACE,aAIA,SAWA;AACA,SAAO;EAGP,MAAM,OAAO,KAAK,2BAA2B,aAAa,QAAQ;EAGlE,MAAM,cAAc,KAAK,SAAS,KAAK,eAAe,KAAK;AAC3D,MAAI,CAAC,YACH,OAAM,IAAIC,qCAAsB;EAIlC,MAAM,kBAAkB,KAAK,uBAAuB,YAAY;AAGhE,OAAK,oBAAoB;AAGzB,MAAIC,2BAAY,WAAW,YAAY,CACrC,MAAK,2BAA2B;+DACJ,YAAY,CACxC,MAAK,2BAA2B;AAIlC,MAAI,KAAK,MACP,KAAIA,2BAAY,WAAW,KAAK,MAAM,CACpC,MAAK,0BAA0B,KAAK;+DACR,KAAK,MAAM,CACvC,MAAK,0BAA0B,KAAK;MAEpC,MAAK,0BAA0B;MAGjC,MAAK,0BAA0B;AAIjC,MAAI,KAAK,OACP,KAAIA,2BAAY,WAAW,KAAK,OAAO,CACrC,MAAK,2BAA2B,KAAK;+DACT,KAAK,OAAO,CACxC,MAAK,2BAA2B,KAAK;MAErC,MAAK,2BAA2B,KAAK;MAGvC,MAAK,2BAA2B,KAAK;EAIvC,MAAM,kBAAkB,KAAK,QACzB,KAAK,uBAAuB,KAAK,MAAM,GACvC;EACJ,MAAM,mBAAmB,KAAK,SACzB,KAAK,uBAAuB,KAAK,OAAO,GACzC;AACJ,OAAK,mBAAmB;AACxB,OAAK,oBAAoB;AAGzB,OAAK,WAAW,KAAK,kBAAkB;AACvC,OAAK,WAAW,KAAK,iBAAiB;AACtC,OAAK,WAAW,KAAK,kBAAkB;AAGvC,MAAI,KAAK,SACP;2DAAuB,KAAK,QAAQ,CAClC,MAAK,uBAAuB,KAAK;;AAKrC,OAAK,aAAa,KAAK;AACvB,OAAK,UAAU,KAAK;;;;;;CAOtB,AAAQ,2BACN,aACA,SAC8C;AAE9C,MAAIC,+BAAiB,YAAY,EAAE;AAEjC,2DAAuB,QAAQ,IAAIC,kCAAe,WAAW,QAAQ,CACnE,QAAO;IACL,GAAG;IACH,SAAS;IACV;GAGH,MAAM,OAAO;AACb,UAAO;IACL,GAAG;IACH,OAAO,YAAY,SAAS,MAAM;IAClC,QAAQ,YAAY,UAAU,MAAM;IACpC,SAAS,YAAY,WAAW,MAAM;IACtC,WAAW,YAAY,aAAa,MAAM;IAC1C,QAAQ,YAAY,UAAU,MAAM;IACpC,OAAO,YAAY,SAAS,MAAM;IACnC;;AAIH,MAAIC,oCAAsB,YAAY,EAAE;AAEtC,2DAAuB,QAAQ,IAAID,kCAAe,WAAW,QAAQ,CACnE,QAAO;IACL,OAAO;IACP,SAAS;IACV;GAEH,MAAM,OAAO;AACb,UAAO;IACL,OAAO;IACP,OAAO,MAAM;IACb,QAAQ,MAAM;IACd,SAAS,MAAM;IACf,WAAW,MAAM;IACjB,QAAQ,MAAM;IACd,OAAO,MAAM;IACd;;AAIH,MAAI,iBAAiB,YAAiC,CAGpD,QAAO,EACL,OAFW,aADM,YACkB,SAAS,EAG7C;AAGH,QAAM,IAAIH,qCAAsB;;;;;;CAOlC,AAAQ,uBAAuB,QAA8C;AAC3E,MAAIC,2BAAY,WAAW,OAAO,CAChC,QAAO,OAAO,aAAa;AAG7B,0DAAuB,OAAO,CAC5B,QAAO,KAAK,cAAc,qBAAqB,OAAO;AAIxD,MACE,OAAO,WAAW,YAClB,mBAAmB,UAClB,OAAsC,kBAAkB,iBAEzD,QAAQ,OAA2C;AAIrD,MACE,OAAO,WAAW,YAClB,CAAC,MAAM,QAAQ,OAAO,IACtB,OAAO,KAAK,OAAO,CAAC,SAAS,EAE7B,QAAO;AAGT,QAAM,IAAID,oCACR,6FACD;;CAGH,IAAI,WAAkC;AACpC,SAAO,IAAI,IAAI,CACb,GAAG,KAAK,OACR,GAAG,MAAM,KAAK,KAAK,aAAa,CAAC,SAAS,CAAC,QAAQ,SACjD,OAAO,KAAK,UAAU,CAAC,OAAO,IAAI,CAAqB,CACxD,CACF,CAAC;;CAGJ,WAAW,iBAAsC;AAC/C,MAAI,KAAK,mBAAmB,IAAI,gBAAgB,CAC9C;AAGF,OAAK,mBAAmB,IAAI,iBAAiB,gBAAgB;AAC7D,OAAK,MAAM,CAAC,KAAK,QAAQ,OAAO,QAAQ,gBAAgB,EAAE;GACxD,IAAI;AACJ,OAAI,OAAO,QAAQ,WACjB,WAAU,KAAK;OAEf,WAAU;AAEZ,OAAI,KAAK,SAAS,SAAS,QACzB;QAAI,CAAC,KAAK,SAAS,KAAK,OAAO,QAAQ,EACrC;SAAI,QAAQ,kBAAkB,YAC5B,OAAM,IAAI,MACR,YAAY,IAAI,yCACjB;;SAIL,MAAK,SAAS,OAAO;;;CAiI3B,AAAS,QACP,GAAG,MAqBmC;EACtC,SAAS,gBACP,MASA;AACA,UAAO,KAAK,UAAU,KAAK,OAAO,KAAK,OAAO;;EAGhD,MAAM,QACJ,gBAAgB,KAAK,GACjB,MAAM,QAAQ,KAAK,GAAG,GACpB,KAAK,KACL,OAAO,QAAQ,KAAK,GAAG,CAAC,KAAK,CAAC,KAAK,YAAY,CAAC,KAAK,OAAO,CAAC,GAC/D,CAAC;GAAC,KAAK;GAAI,KAAK;GAAI,KAAK;GAAG,CAAC;AAOnC,MAAI,MAAM,WAAW,EACnB,OAAM,IAAI,MAAM,iCAAiC;AAGnD,OAAK,MAAM,CAAC,KAAK,QAAQ,YAAY,OAAO;AAC1C,OAAI,OAAO,KAAK,SACd,OAAM,IAAI,MACR,GAAG,IAAI,qGACR;AAGH,QAAK,MAAM,gBAAgB,CACzBK,kDACAC,2CACD,CACC,KAAI,IAAI,SAAS,aAAa,CAC5B,OAAM,IAAI,MACR,IAAI,aAAa,6DAClB;AAGL,QAAK,eACH,6GACD;AAED,OAAI,OAAO,KAAK,MACd,OAAM,IAAI,MAAM,UAAU,IAAI,qBAAqB;AAErD,OAAI,QAAQC,yBAAO,QAAQC,wBACzB,OAAM,IAAI,MAAM,UAAU,IAAI,iBAAiB;GAGjD,IAAI,YAA6B,KAAK;AACtC,OAAI,SAAS,UAAU,OACrB,aAAY,KAAK,uBAAuB,QAAQ,MAAM;AAExD,QAAK,WAAW,UAAU;GAE1B,IAAI;AACJ,OAAIC,mCAAS,WAAW,OAAO,CAC7B,YAAW;YACF,OAAO,WAAW,WAC3B,YAAW,IAAIC,+BAAiB;IAC9B,MAAM;IACN,MAAM;IACN,OAAO;IACR,CAAC;OAEF,6DAA6B,OAAO;GAGtC,IAAI,cAAc,SAAS;AAC3B,OAAI,OAAO,gBAAgB,UACzB,eAAc,cAAc,EAAE,GAAG;GAGnC,MAAM,WAAqC;IAC/B;IACV,aAAa,SAAS;IACtB;IACA,UAAU,SAAS;IACnB,OAAO,aAAa,KAAK;IACzB,WAAWC,8BAAa,SAAS,GAE7B,CAAC,SAAgB,GACjB,SAAS;IACb,MAAM,SAAS;IACf,OAAO,SAAS;IACjB;AAED,QAAK,MAAM,OAAuB;;AAGpC,SAAO;;CAGT,AAAS,QACP,UACA,QACM;AACN,MAAI,OAAO,aAAa,SACtB,QAAO,MAAM,QAAQ,UAAU,OAAO;AAGxC,MAAI,KAAK,SACP,SAAQ,KACN,8GAED;AAGH,OAAK,MAAM,SAAS,UAAU;AAC5B,OAAI,UAAUJ,sBACZ,OAAM,IAAI,MAAM,6BAA6B;AAE/C,OAAI,CAAC,OAAO,KAAK,KAAK,MAAM,CAAC,MAAM,SAAS,SAAS,MAAM,CACzD,OAAM,IAAI,MAAM,6BAA6B,MAAM,SAAS;;AAGhE,MAAI,WAAWA,sBACb,OAAM,IAAI,MAAM,4BAA4B;AAE9C,MAAI,CAAC,OAAO,KAAK,KAAK,MAAM,CAAC,MAAM,SAAS,SAAS,OAAO,CAC1D,OAAM,IAAI,MAAM,6BAA6B,OAAO,SAAS;AAG/D,OAAK,aAAa,IAAI,CAAC,UAAU,OAAO,CAAC;AAEzC,SAAO;;CAiDT,YACE,OAyBA;EACA,MAAM,cAAc,MAAM,QAAQ,MAAM,GAAG,QAAQ,OAAO,QAAQ,MAAM;AAExE,MAAI,YAAY,WAAW,EACzB,OAAM,IAAI,MAAM,uCAAuC;EAGzD,IAAI;AACJ,OAAK,MAAM,CAAC,KAAK,QAAQ,YAAY,aAAa;AAChD,OAAI,OAAO,KAAK,MACd,OAAM,IAAI,MACR,kDAAkD,IAAI,mBACvD;GAGH,MAAM,WAAW;AACjB,QAAK,QACH,UACA,QACA,QACD;AACD,OAAI,gBAAgB,KAClB,MAAK,QAAQ,cAAc,SAAS;AAGtC,kBAAe;;AAGjB,SAAO;;CAYT,AAAS,QAAQ,EACf,cACA,OACA,OACA,iBACA,gBACA,MACA,gBASE,EAAE,EAUJ;AAEA,OAAK,SAAS,CACZ,GAAI,MAAM,QAAQ,gBAAgB,GAAG,kBAAkB,EAAE,EACzD,GAAI,MAAM,QAAQ,eAAe,GAAG,iBAAiB,EAAE,CACxD,CAAC;EAGF,MAAM,aAAa,OAAO,KACxB,KAAK,mBAAmB,IAAI,KAAK,kBAAkB,CACpD;EACD,MAAM,iBACJ,WAAW,WAAW,KAAK,WAAW,OAAO,OAAO,OAAO;EAE7D,MAAM,aAAa,OAAO,KAAK,KAAK,SAAS;EAC7C,MAAM,iBACJ,WAAW,WAAW,KAAK,WAAW,OAAO,OAAO,OAAO;EAE7D,MAAM,gBAAgB,KAAK;EAE3B,MAAM,WAAW,IAAI,mBAUnB;GACA,SAAS;GACT;GACA;GACA;GACA,cAAc;GACd,OAAO,EAAE;GACT,UAAU;IACR,GAAG,KAAK;KACPC,0BAAQ,IAAII,wCAAgB;IAC9B;GACD,eAAeJ;GACf;GACA;GACA,YAAY;GACZ;GACA;GACA;GACA;GACA;GACD,CAAC;AAGF,WAAS,WAAWA,wBAAM;AAC1B,OAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAC/B,KAAK,MACN,CACC,UAAS,WAAW,KAAU,KAAK;AAErC,WAAS,aAAaA,yBAAOK,wBAAM,mBAAmB,EAAkB,EACtE,YAAY,OACb,CAAC;AACF,OAAK,MAAM,CAAC,QAAQ,OAAO,QAAkC,KAAK,MAAM,CACtE,UAAS,aACP,KACAA,wBACA,mBAAmB,EACnB,EACE,YAAY,OACb,CACF;AAEH,OAAK,MAAM,CAAC,OAAO,QAAQ,KAAK,MAC9B,UAAS,WAAW,OAAO,IAAI;AAEjC,OAAK,MAAM,CAAC,QAAQ,QAAQ,KAAK,aAC/B,UAAS,WAAW,QAAQ,IAAI;AAElC,OAAK,MAAM,CAAC,OAAO,aAAa,OAAO,QAAQ,KAAK,SAAS,CAC3D,MAAK,MAAM,CAAC,MAAM,WAAW,OAAO,QAAQ,SAAS,CACnD,UAAS,aAAa,OAAY,MAAM,OAAO;AAInD,SAAO,SAAS,UAAU;;;AAI9B,SAAS,aACP,QAC6B;CAC7B,MAAM,WAAwC,EAAE;AAChD,MAAK,MAAM,CAAC,MAAM,QAAQ,OAAO,QAAQ,OAAO,CAC9C,KAAI,SAAS,KACX,UAAS,QAAQC,8BAAqB,IAA+B;KAGrE,UAAS,QAAQA,8BACf,IACD;AAGL,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCT,IAAa,qBAAb,cAUUC,4BAUR;;;;;CAOA;;CAGA,gBAAoChB;CAEpC,YAAY,EACV,aACA,GAAG,QAaC;AACJ,QAAM,KAAK;AACX,OAAK,cAAc;;CAOrB,WAAW,KAAuB,MAAuC;EACvE,IAAI;AACJ,MAAI,QAAQS,wBAEV,cAAa,OAAO,QAClB,KAAK,QAAQ,mBAAmB,IAAI,KAAK,QAAQ,iBAAiB,CACnE,CAAC,KAAK,CAAC,OAAO,EAAE;MAEjB,cAAa,OAAO,KAAK,KAAK,QAAQ,SAAS;EAIjD,SAAS,SAAS,OAAwC;AACxD,OAAIQ,4BAAU,MAAM,EAAE;AACpB,QAAI,MAAM,UAAUC,0BAAQ,OAC1B,QAAO;AAET,WAAO,MAAM,iBAAiB;cAE9B,MAAM,QAAQ,MAAM,IACpB,MAAM,SAAS,KACf,MAAM,MAAM,MAAMD,4BAAU,EAAE,CAAC,EAC/B;IACA,MAAM,UAA+B,EAAE;AACvC,SAAK,MAAM,KAAK,MACd,KAAIA,4BAAU,EAAE,EAAE;AAChB,SAAI,EAAE,UAAUC,0BAAQ,OACtB;AAEF,aAAQ,KAAK,GAAG,EAAE,iBAAiB,CAAC;UAEpC,SAAQ,KAAK,CAAC,MAAM,EAAE,CAAC;AAG3B,WAAO;cACE,SAAS,KAClB,QAAO,CAAC,CAAC,MAAM,MAAM,CAAC;AAExB,UAAO;;EAIT,MAAM,UAAU;EAGhB,SAAS,YAAY,OAAkC;AACrD,OAAI,CAAC,MACH,QAAO;YACED,4BAAU,MAAM,EAAE;AAC3B,QAAI,MAAM,UAAUC,0BAAQ,OAC1B,QAAO;AAET,WAAO,MAAM,iBAAiB,CAAC,QAAQ,CAAC,OAAO,WAAW,SAAS,EAAE,CAAC;cAEtE,MAAM,QAAQ,MAAM,IACpB,MAAM,SAAS,KACf,MAAM,KAAKD,4BAAU,EACrB;IACA,MAAM,UAA+B,EAAE;AACvC,SAAK,MAAM,QAAQ,MACjB,KAAIA,4BAAU,KAAK,EAAE;AACnB,SAAI,KAAK,UAAUC,0BAAQ,OACzB;AAEF,aAAQ,KACN,GAAG,KAAK,iBAAiB,CAAC,QAAQ,CAAC,OAAO,WAAW,SAAS,EAAE,CAAC,CAClE;WACI;KACL,MAAM,cAAc,YAAY,KAAK;AACrC,SAAI,YACF,SAAQ,KAAK,GAAI,eAAe,EAAE,CAAE;;AAI1C,WAAO;cACE,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,MAAM,CAC3D,QAAO,OAAO,QAAQ,MAAM,CAAC,QAAQ,CAAC,OAAO,WAAW,SAAS,EAAE,CAAC;QAC/D;IACL,MAAM,cAAc,MAAM,QAAQ,MAAM,GAAG,UAAU,OAAO;AAC5D,UAAM,IAAIC,kCACR,kBAAkB,QAAQ,UAAU,CAAC,qFAAqF,eAC1H,EACE,eAAe,mCAChB,CACF;;;EAIL,MAAM,oBAAoE,CACxE;GACE,OAAOC;GACP,QAAQ,IAAIT,+BAAiB;IAC3B,MACE,WAAW,UAAU,WAAW,OAAO,OACnC,WACA;IACN,OAAO;IACP,SAAS;IACV,CAAC;GACH,CACF;AAGD,MAAI,QAAQF,wBACV,MAAK,MAAM,OAAO,IAAIY,wBAAiB;GACrC,MAAM,CAACC,6BAAW;GAClB,UAAU,CAACb,wBAAM;GACjB,UAAU,CAACA,wBAAM;GACjB,SAAS,CAAC,IAAIc,2BAAa,mBAAmB,CAACD,6BAAW,CAAC,CAAC;GAC7D,CAAC;OACG;GACL,MAAM,kBAAkB,MAAM,SAAS,KAAK,QAAQ;GACpD,MAAM,cAAc,OAAO,YACzB,OAAO,KAAK,KAAK,QAAQ,mBAAmB,IAAI,gBAAgB,CAAC,CAAC,KAC/D,MAAM,CAAC,GAAG,EAAE,CACd,CACF;GACD,MAAM,gBACJ,OAAO,KAAK,YAAY,CAAC,WAAW,KAAK,QAAQ;GACnD,MAAM,gBAAgB,aAAa;AACnC,QAAK,SAAS,iBAAiB,MAAM,QACjC,IAAIE,yCAAsB,GAC1B,IAAIX,uCAAe,MAAM;AAC7B,QAAK,MAAM,OAAO,IAAIQ,wBAAiB;IACrC,UAAU,CAAC,cAAc;IAEzB,UAAU,gBAAgB,OAAO,KAAK,YAAY,GAAG;IAErD,SAAS,CAAC,IAAIE,2BAAa,mBAAmB,CAACD,6BAAW,CAAC,CAAC;IAC5D,QAAQ,gBACJ,UAEC,UAA+B;AAC9B,YAAO,OAAO,YACZ,OAAO,QAAQ,MAAM,CAAC,QAAQ,CAAC,OAAO,KAAK,YAAY,CACxD;;IAEP,OAAO,MAAM;IACb,UAAU,MAAM;IAChB,aAAa,MAAM;IACnB,aAAa,MAAM;IACnB,WAAW,MAAM;IACjB,MAAM,MAAM;IACb,CAAC;;;CAIN,WAAW,QAA+B,KAA0B;AAClE,MAAI,QAAQd,sBAAK;AACjB,MAAI,OAAO,WAAW,SACpB,MAAK,MAAM,QAAQ,QAAQ,KACzB,IAAIe,2BACF,CAAC;GAAE,SAAS,aAAa;GAAO,OAAO;GAAM,CAAC,EAC9C,CAACD,6BAAW,CACb,CACF;WACQ,MAAM,QAAQ,OAAO,EAAE;GAChC,MAAM,cAAc,QAAQ,OAAO,KAAK,IAAI,CAAC,GAAG;AAEhD,QAAK,SAAS,eAA6B,KAAK,QAAQ,MAAM,KAAK,QAC/D,IAAIG,yDAA6B,IAAI,IAAI,OAAO,CAAC,GACjD,IAAIC,8CAAkB,IAAI,IAAI,OAAO,CAAC;AAE1C,QAAK,MAAM,KAAK,SAAS,KAAK,YAAY;AAE1C,QAAK,MAAM,SAAS,OAClB,MAAK,MAAM,OAAO,QAAQ,KACxB,IAAIH,2BACF,CAAC;IAAE,SAAS;IAAa,OAAO;IAAO,CAAC,EACxC,CAACD,6BAAW,CACb,CACF;;;CAKP,aACE,OACA,GACA,QACA,UAAoC,EAAE,YAAY,MAAM,EAClD;EACN,MAAM,eAAe,OACnB,SACA,WACG;GACH,MAAM,kBAAkB,QAAQ,QAAQ,MAAM,MAAMd,sBAAI;AACxD,OAAI,CAAC,gBAAgB,OAAQ;GAE7B,MAAM,SAAuC,gBAAgB,KAAK,MAAM;AACtE,QAAImB,0BAAQ,EAAE,CAAE,QAAO;AACvB,WAAO;KAAE,SAAS,MAAMnB,wBAAM,IAAI,aAAa;KAAK,OAAO;KAAO;KAClE;AACF,SAAMe,2BAAa,QACjB;IAAE,GAAG;IAAQ,OAAO,OAAO,QAAQ,EAAE,EAAE,OAAO,CAACD,6BAAW,CAAC;IAAE,EAC7D,OACD;;AAGH,OAAK,MAAM,OAAO,QAAQ,KACxB,OAAO,IACL,cAEA,QAAQ,cACH,WACCM,yBAAY,OACV,QACA,KAAK,kBAAkB,KAAK,gBAC5B,KACD,GACH,OACL,CACF;;CAGH,MAAgB,eACd,OACoD;AACpD,MAAI,SAAS,KAAM,QAAO;EAE1B,MAAM,WAAW,KAAK,QAAQ;EAC9B,MAAM,YAAY,KAAK,QAAQ;AAM/B,MAAI1B,2BAAY,WAAW,SAAS,EAAE;AACpC,OAAIe,4BAAU,MAAM,EAAE;IACpB,MAAM,cAAc;AACpB,QAAI,MAAM,OACR,aAAY,SAAS,MAAM,SAAS,cAClC,MAAM,QAAQ,MAAM,OAAO,GACvB,OAAO,YAAY,MAAM,OAAO,GAChC,MAAM,OACX;AAEH,WAAO;;AAET,UAAO,MAAM,SAAS,cAAc,MAAM;;AAI5C,MAAI,aAAa,sBAAsBf,2BAAY,WAAW,UAAU,EAAE;AACxE,OAAIe,4BAAU,MAAM,EAAE;IACpB,MAAM,cAAc;AACpB,QAAI,MAAM,OACR,aAAY,SAAS,MAAM,UAAU,cACnC,MAAM,QAAQ,MAAM,OAAO,GACvB,OAAO,YAAY,MAAM,OAAO,GAChC,MAAM,OACX;AAEH,WAAO;;AAET,UAAO,MAAM,UAAU,cAAc,MAAM;;EAI7C,MAAM,gBAAgB;GACpB,MAAM,SAAS,WAAyC;AACtD,QAAI,UAAU,KAAM,QAAO;AAC3B,WAAO,KAAK,cAAc,0BAA0B,QAAQ,EAC1D,mBAAmB,MACpB,CAAC;;AAGJ,2DAAuB,SAAS,CAAE,QAAO,MAAM,SAAS;AACxD,OAAI,aAAa,oBAAoB;AACnC,4DAAuB,UAAU,CAC/B,iEAA+B,MAAM,UAAU,CAAE;AAEnD;;MAGA;AAEJ,MAAIA,4BAAU,MAAM,EAAE;GACpB,MAAM,cAAc;AACpB,OAAI,MAAM,UAAU,UAAU,KAC5B,aAAY,uDAAsB,QAAQ,MAAM,OAAO;AACzD,UAAO;;AAET,MAAI,UAAU,KAAM,sDAAoB,QAAQ,MAAM;AACtD,SAAO;;CAGT,AAAO,cAAc,OAEnB;AACA,SAAOY,gCAAc,MAAM;;CAG7B,MAAgB,iBACd,QAC2C;EAC3C,MAAM,eAAe,KAAK,QAAQ;AAClC,0DAAuB,aAAa,CAAE,+CAAa,cAAc,OAAO;AACxE,SAAO;;;;;;;;AASX,SAAS,iBACP,KACiC;AACjC,QACE,OAAO,QAAQ,YACf,QAAQ,QACP,IAAiC,aAAa;;AAKnD,SAAS,eAAe,OAA+B;AACrD,KAAIF,0BAAQ,MAAM,CAChB,QAAO,CAAC,MAAM;CAEhB,MAAM,WAAW,EAAE;AACnB,KAAIV,4BAAU,MAAM,CAClB,UAAS,KAAK,MAAM;UACX,MAAM,QAAQ,MAAM,CAC7B,UAAS,KAAK,GAAG,MAAM,OAAOA,4BAAU,CAAC;CAE3C,MAAM,eAAkC,EAAE;AAE1C,MAAK,MAAM,WAAW,UAAU;AAC9B,MAAI,QAAQ,UAAUC,0BAAQ,OAC5B,OAAM,IAAIY,6BAAc,QAAQ;AAGlC,MAAIH,0BAAQ,QAAQ,KAAK,CACvB,cAAa,KAAK,QAAQ,KAAK;WACtB,OAAO,QAAQ,SAAS,SACjC,cAAa,KAAK,QAAQ,KAAK;WAE3B,MAAM,QAAQ,QAAQ,KAAK,CAC7B,cAAa,KAAK,GAAG,QAAQ,KAAK;;AAIxC,QAAO;;AAGT,SAAS,oBAAoB;AAS3B,QAAO,IAAII,qBAAO,EAChB,MAR0B,IAAIpB,+BAAyC;EACvE,MAAM;EACN,MAAM,CAACW,6BAAW;EAClB,OAAO;EACP,SAAS;EACT,MAAM;EACP,CAAC,EAGD,CAAC"}

package/dist/graph/state.d.cts

@@ -66,6 +66,36 @@ type Prettify<T> = { [K in keyof T]: T[K] } & {};
  * After adding nodes and edges to your graph, you must call `.compile()` on it before
  * you can use it.
  *
+ * @typeParam SD - The state definition used to construct the graph. Can be an
+ *   {@link AnnotationRoot}, {@link StateSchema}, or Zod object schema. This is the
+ *   primary generic from which `S` and `U` are derived.
+ *
+ * @typeParam S - The full state type representing the complete shape of your graph's
+ *   state after all reducers have been applied. Automatically inferred from `SD`.
+ *
+ * @typeParam U - The update type representing what nodes can return to modify state.
+ *   Typically a partial of the state type. Automatically inferred from `SD`.
+ *
+ * @typeParam N - Union of all node names in the graph (e.g., `"agent" | "tool"`).
+ *   Accumulated as you call `.addNode()`. Used for type-safe routing.
+ *
+ * @typeParam I - The input schema definition. Set via the `input` option in the
+ *   constructor to restrict what data the graph accepts when invoked.
+ *
+ * @typeParam O - The output schema definition. Set via the `output` option in the
+ *   constructor to restrict what data the graph returns after execution.
+ *
+ * @typeParam C - The config/context schema definition. Set via the `context` option
+ *   to define additional configuration passed at runtime.
+ *
+ * @typeParam NodeReturnType - Constrains what types nodes in this graph can return.
+ *
+ * @typeParam InterruptType - The type for {@link interrupt} resume values. Set via
+ *   the `interrupt` option for typed human-in-the-loop patterns.
+ *
+ * @typeParam WriterType - The type for custom stream writers. Set via the `writer`
+ *   option to enable typed custom streaming from within nodes.
+ *
  * @example
  * ```ts
  * import {
@@ -238,6 +268,35 @@ declare class StateGraph<SD extends StateDefinitionInit | unknown, S = ExtractSt
  * Final result from building and compiling a {@link StateGraph}.
  * Should not be instantiated directly, only using the StateGraph `.compile()`
  * instance method.
+ *
+ * @typeParam S - The full state type representing the complete shape of your graph's
+ *   state after all reducers have been applied. This is the type you receive when
+ *   reading state in nodes or after invoking the graph.
+ *
+ * @typeParam U - The update type representing what nodes can return to modify state.
+ *   Typically a partial of the state type, allowing nodes to update only specific fields.
+ *   Can also include {@link Command} objects for advanced control flow.
+ *
+ * @typeParam N - Union of all node names in the graph (e.g., `"agent" | "tool"`).
+ *   Used for type-safe routing with {@link Command.goto} and edge definitions.
+ *
+ * @typeParam I - The input schema definition. Determines what shape of data the graph
+ *   accepts when invoked. Defaults to the main state schema if not explicitly set.
+ *
+ * @typeParam O - The output schema definition. Determines what shape of data the graph
+ *   returns after execution. Defaults to the main state schema if not explicitly set.
+ *
+ * @typeParam C - The config/context schema definition. Defines additional configuration
+ *   that can be passed to the graph at runtime via {@link LangGraphRunnableConfig}.
+ *
+ * @typeParam NodeReturnType - Constrains what types nodes in this graph can return.
+ *   Useful for enforcing consistent return patterns across all nodes.
+ *
+ * @typeParam InterruptType - The type of values that can be passed when resuming from
+ *   an {@link interrupt}. Used with human-in-the-loop patterns.
+ *
+ * @typeParam WriterType - The type for custom stream writers. Used with the `writer`
+ *   option to enable typed custom streaming from within nodes.
  */
 declare class CompiledStateGraph<S, U, N extends string = typeof START, I extends StateDefinitionInit = StateDefinition, O extends StateDefinitionInit = StateDefinition, C extends StateDefinitionInit = StateDefinition, NodeReturnType = unknown, InterruptType = unknown, WriterType = unknown> extends CompiledGraph<N, S, U, ExtractStateType<C>, ExtractUpdateType<I, ExtractStateType<I>>, ExtractStateType<O>, NodeReturnType, CommandInstance<InferInterruptResumeType<InterruptType>, Prettify<U>, N>, InferWriterType<WriterType>> {
   builder: StateGraph<unknown, S, U, N, I, O, C, NodeReturnType>;

package/dist/graph/state.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"state.d.cts","names":["All","BaseCache","BaseCheckpointSaver","BaseStore","InteropZodObject","RunnableLike","Runtime","BaseChannel","CompiledGraph","Graph","Branch","AddNodeOptions","NodeSpec","Command","START","END","CommandInstance","Interrupt","INTERRUPT","AnnotationRoot","SingleReducer","StateDefinition","StateType","CachePolicy","RetryPolicy","SchemaMetaRegistry","InferInterruptResumeType","InferInterruptInputType","InferWriterType","AnyStateSchema","ContextSchemaInit","ExtractStateType","ExtractUpdateType","StateGraphInit","StateGraphOptions","ToStateDefinition","StateDefinitionInit","ChannelReducers","Channels","K","StateGraphArgs","StateGraphNodeSpec","RunInput","RunOutput","StateGraphAddNodeOptions","InputSchema","Nodes","StateGraphArgsWithStateSchema","SD","I","O","StateGraphArgsWithInputOutputSchemas","ExtractStateDefinition","T","NodeAction","S","U","Record","C","InterruptType","WriterType","StrictNodeAction","Prettify","PartialStateSchema","MergeReturnType","Prev","Curr","StateGraph","N","Set","Map","Omit","NodeMap","NodeReturnType","key","NodeInput","NodeOutput","checkpointer","store","cache","interruptBefore","interruptAfter","name","description","CompiledStateGraph","ConstructorParameters","Promise","Partial"],"sources":["../../src/graph/state.d.ts"],"sourcesContent":["import { All, type BaseCache, BaseCheckpointSaver, BaseStore } from \"@langchain/langgraph-checkpoint\";\nimport { type InteropZodObject } from \"@langchain/core/utils/types\";\nimport type { RunnableLike, Runtime } from \"../pregel/runnable_types.js\";\nimport { BaseChannel } from \"../channels/base.js\";\nimport { CompiledGraph, Graph, Branch, AddNodeOptions, NodeSpec } from \"./graph.js\";\nimport { Command, START, END, CommandInstance, Interrupt, INTERRUPT } from \"../constants.js\";\nimport { AnnotationRoot, SingleReducer, StateDefinition, StateType } from \"./annotation.js\";\nimport type { CachePolicy, RetryPolicy } from \"../pregel/utils/index.js\";\nimport { type SchemaMetaRegistry } from \"./zod/meta.js\";\nimport type { InferInterruptResumeType, InferInterruptInputType } from \"../interrupt.js\";\nimport type { InferWriterType } from \"../writer.js\";\nimport type { AnyStateSchema } from \"../state/schema.js\";\nimport { ContextSchemaInit, ExtractStateType, ExtractUpdateType, StateGraphInit, StateGraphOptions, ToStateDefinition, type StateDefinitionInit } from \"./types.js\";\nexport type ChannelReducers<Channels extends object> = {\n    [K in keyof Channels]: SingleReducer<Channels[K], any>;\n};\nexport interface StateGraphArgs<Channels extends object | unknown> {\n    channels: Channels extends object ? Channels extends unknown[] ? ChannelReducers<{\n        __root__: Channels;\n    }> : ChannelReducers<Channels> : ChannelReducers<{\n        __root__: Channels;\n    }>;\n}\nexport type StateGraphNodeSpec<RunInput, RunOutput> = NodeSpec<RunInput, RunOutput> & {\n    input?: StateDefinition;\n    retryPolicy?: RetryPolicy;\n    cachePolicy?: CachePolicy;\n};\n/**\n * Options for StateGraph.addNode() method.\n *\n * @template Nodes - Node name constraints\n * @template InputSchema - Per-node input schema type (inferred from options.input)\n */\nexport type StateGraphAddNodeOptions<Nodes extends string = string, InputSchema extends StateDefinitionInit | undefined = StateDefinitionInit | undefined> = {\n    retryPolicy?: RetryPolicy;\n    cachePolicy?: CachePolicy | boolean;\n    input?: InputSchema;\n} & AddNodeOptions<Nodes>;\nexport type StateGraphArgsWithStateSchema<SD extends StateDefinition, I extends StateDefinition, O extends StateDefinition> = {\n    stateSchema: AnnotationRoot<SD>;\n    input?: AnnotationRoot<I>;\n    output?: AnnotationRoot<O>;\n};\nexport type StateGraphArgsWithInputOutputSchemas<SD extends StateDefinition, O extends StateDefinition = SD> = {\n    input: AnnotationRoot<SD>;\n    output: AnnotationRoot<O>;\n};\ntype ExtractStateDefinition<T> = T extends AnyStateSchema ? T : T extends StateDefinitionInit ? ToStateDefinition<T> : StateDefinition;\ntype NodeAction<S, U, C extends StateDefinitionInit, InterruptType, WriterType> = RunnableLike<S, U extends object ? U & Record<string, any> : U, Runtime<StateType<ToStateDefinition<C>>, InterruptType, WriterType>>;\ntype StrictNodeAction<S, U, C extends StateDefinitionInit, Nodes extends string, InterruptType, WriterType> = RunnableLike<Prettify<S>, U | Command<InferInterruptResumeType<InterruptType>, U & Record<string, any>, Nodes>, Runtime<StateType<ToStateDefinition<C>>, InterruptType, WriterType>>;\ndeclare const PartialStateSchema: unique symbol;\ntype PartialStateSchema = typeof PartialStateSchema;\ntype MergeReturnType<Prev, Curr> = Prev & Curr extends infer T ? {\n    [K in keyof T]: T[K];\n} & unknown : never;\ntype Prettify<T> = {\n    [K in keyof T]: T[K];\n} & {};\n/**\n * A graph whose nodes communicate by reading and writing to a shared state.\n * Each node takes a defined `State` as input and returns a `Partial<State>`.\n *\n * Each state key can optionally be annotated with a reducer function that\n * will be used to aggregate the values of that key received from multiple nodes.\n * The signature of a reducer function is (left: Value, right: UpdateValue) => Value.\n *\n * See {@link Annotation} for more on defining state.\n *\n * After adding nodes and edges to your graph, you must call `.compile()` on it before\n * you can use it.\n *\n * @example\n * ```ts\n * import {\n *   type BaseMessage,\n *   AIMessage,\n *   HumanMessage,\n * } from \"@langchain/core/messages\";\n * import { StateGraph, Annotation } from \"@langchain/langgraph\";\n *\n * // Define a state with a single key named \"messages\" that will\n * // combine a returned BaseMessage or arrays of BaseMessages\n * const StateAnnotation = Annotation.Root({\n *   sentiment: Annotation<string>,\n *   messages: Annotation<BaseMessage[]>({\n *     reducer: (left: BaseMessage[], right: BaseMessage | BaseMessage[]) => {\n *       if (Array.isArray(right)) {\n *         return left.concat(right);\n *       }\n *       return left.concat([right]);\n *     },\n *     default: () => [],\n *   }),\n * });\n *\n * const graphBuilder = new StateGraph(StateAnnotation);\n *\n * // A node in the graph that returns an object with a \"messages\" key\n * // will update the state by combining the existing value with the returned one.\n * const myNode = (state: typeof StateAnnotation.State) => {\n *   return {\n *     messages: [new AIMessage(\"Some new response\")],\n *     sentiment: \"positive\",\n *   };\n * };\n *\n * const graph = graphBuilder\n *   .addNode(\"myNode\", myNode)\n *   .addEdge(\"__start__\", \"myNode\")\n *   .addEdge(\"myNode\", \"__end__\")\n *   .compile();\n *\n * await graph.invoke({ messages: [new HumanMessage(\"how are you?\")] });\n *\n * // {\n * //   messages: [HumanMessage(\"how are you?\"), AIMessage(\"Some new response\")],\n * //   sentiment: \"positive\",\n * // }\n * ```\n */\nexport declare class StateGraph<SD extends StateDefinitionInit | unknown, S = ExtractStateType<SD>, U = ExtractUpdateType<SD, S>, N extends string = typeof START, I extends StateDefinitionInit = ExtractStateDefinition<SD>, O extends StateDefinitionInit = ExtractStateDefinition<SD>, C extends StateDefinitionInit = StateDefinition, NodeReturnType = unknown, InterruptType = unknown, WriterType = unknown> extends Graph<N, S, U, StateGraphNodeSpec<S, U>, ToStateDefinition<C>> {\n    channels: Record<string, BaseChannel>;\n    waitingEdges: Set<[N[], N]>;\n    /** @internal */\n    _schemaDefinition: StateDefinition;\n    /** @internal */\n    _schemaRuntimeDefinition: InteropZodObject | AnyStateSchema | undefined;\n    /** @internal */\n    _inputDefinition: I;\n    /** @internal */\n    _inputRuntimeDefinition: InteropZodObject | AnyStateSchema | PartialStateSchema | undefined;\n    /** @internal */\n    _outputDefinition: O;\n    /** @internal */\n    _outputRuntimeDefinition: InteropZodObject | AnyStateSchema | undefined;\n    /**\n     * Map schemas to managed values\n     * @internal\n     */\n    _schemaDefinitions: Map<any, any>;\n    /** @internal */\n    _metaRegistry: SchemaMetaRegistry;\n    /** @internal Used only for typing. */\n    _configSchema: ToStateDefinition<C> | undefined;\n    /** @internal */\n    _configRuntimeSchema: InteropZodObject | undefined;\n    /** @internal */\n    _interrupt: InterruptType;\n    /** @internal */\n    _writer: WriterType;\n    Node: StrictNodeAction<S, U, C, N, InterruptType, WriterType>;\n    /**\n     * Create a new StateGraph for building stateful, multi-step workflows.\n     *\n     * Accepts state definitions via `Annotation.Root`, `StateSchema`, or Zod schemas.\n     *\n     * @example Direct schema\n     * ```ts\n     * const StateAnnotation = Annotation.Root({\n     *   messages: Annotation<string[]>({ reducer: (a, b) => [...a, ...b] }),\n     * });\n     * const graph = new StateGraph(StateAnnotation);\n     * ```\n     *\n     * @example Direct schema with input/output filtering\n     * ```ts\n     * const graph = new StateGraph(StateAnnotation, {\n     *   input: InputSchema,\n     *   output: OutputSchema,\n     * });\n     * ```\n     *\n     * @example Object pattern with state, input, output\n     * ```ts\n     * const graph = new StateGraph({\n     *   state: FullStateSchema,\n     *   input: InputSchema,\n     *   output: OutputSchema,\n     * });\n     * ```\n     *\n     * @example Input/output only (state inferred from input)\n     * ```ts\n     * const graph = new StateGraph({\n     *   input: InputAnnotation,\n     *   output: OutputAnnotation,\n     * });\n     * ```\n     */\n    constructor(state: SD extends StateDefinitionInit ? SD : never, options?: C | AnnotationRoot<ToStateDefinition<C>> | StateGraphOptions<I, O, C, N, InterruptType, WriterType>);\n    constructor(fields: SD extends StateDefinition ? StateGraphArgsWithInputOutputSchemas<SD, ToStateDefinition<O>> : never, contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>);\n    constructor(fields: SD extends StateDefinition ? AnnotationRoot<SD> | StateGraphArgsWithStateSchema<SD, ToStateDefinition<I>, ToStateDefinition<O>> : never, contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>);\n    constructor(init: Omit<StateGraphInit<SD extends StateDefinitionInit ? SD : StateDefinitionInit, SD extends StateDefinitionInit ? SD : StateDefinitionInit, O, C extends ContextSchemaInit ? C : undefined, N, InterruptType, WriterType>, \"state\" | \"stateSchema\" | \"input\"> & {\n        input: SD extends StateDefinitionInit ? SD : never;\n        state?: never;\n        stateSchema?: never;\n    }, contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>);\n    constructor(init: StateGraphInit<SD extends StateDefinitionInit ? SD : StateDefinitionInit, I, O, C extends ContextSchemaInit ? C : undefined, N, InterruptType, WriterType>);\n    /** @deprecated Use `Annotation.Root`, `StateSchema`, or Zod schemas instead. */\n    constructor(fields: StateGraphArgs<S>, contextSchema?: C | AnnotationRoot<ToStateDefinition<C>>);\n    /**\n     * Normalize all constructor input patterns to a unified StateGraphInit object.\n     * @internal\n     */\n    private _normalizeToStateGraphInit;\n    /**\n     * Convert any supported schema type to a StateDefinition (channel map).\n     * @internal\n     */\n    private _getChannelsFromSchema;\n    get allEdges(): Set<[string, string]>;\n    _addSchema(stateDefinition: StateDefinitionInit): void;\n    addNode<K extends string, NodeMap extends Record<K, NodeAction<S, U, C, InterruptType, WriterType>>>(nodes: NodeMap): StateGraph<SD, S, U, N | K, I, O, C, MergeReturnType<NodeReturnType, {\n        [key in keyof NodeMap]: NodeMap[key] extends NodeAction<S, infer U, C, InterruptType, WriterType> ? U : never;\n    }>>;\n    addNode<K extends string, NodeInput = S, NodeOutput extends U = U>(nodes: [\n        key: K,\n        action: NodeAction<NodeInput, NodeOutput, C, InterruptType, WriterType>,\n        options?: StateGraphAddNodeOptions\n    ][]): StateGraph<SD, S, U, N | K, I, O, C, MergeReturnType<NodeReturnType, {\n        [key in K]: NodeOutput;\n    }>>;\n    addNode<K extends string, InputSchema extends StateDefinitionInit, NodeOutput extends U = U>(key: K, action: NodeAction<ExtractStateType<InputSchema>, NodeOutput, C, InterruptType, WriterType>, options: StateGraphAddNodeOptions<N | K, InputSchema>): StateGraph<SD, S, U, N | K, I, O, C, MergeReturnType<NodeReturnType, {\n        [key in K]: NodeOutput;\n    }>>;\n    addNode<K extends string, InputSchema extends StateDefinitionInit, NodeOutput extends U = U>(key: K, action: NodeAction<ExtractStateType<InputSchema>, NodeOutput, C, InterruptType, WriterType>, options: StateGraphAddNodeOptions<N | K, InputSchema>): StateGraph<SD, S, U, N | K, I, O, C, MergeReturnType<NodeReturnType, {\n        [key in K]: NodeOutput;\n    }>>;\n    addNode<K extends string, NodeInput = S, NodeOutput extends U = U>(key: K, action: NodeAction<NodeInput, NodeOutput, C, InterruptType, WriterType>, options?: StateGraphAddNodeOptions): StateGraph<SD, S, U, N | K, I, O, C, MergeReturnType<NodeReturnType, {\n        [key in K]: NodeOutput;\n    }>>;\n    addNode<K extends string, NodeInput = S>(key: K, action: NodeAction<NodeInput, U, C, InterruptType, WriterType>, options?: StateGraphAddNodeOptions): StateGraph<SD, S, U, N | K, I, O, C, NodeReturnType>;\n    addEdge(startKey: typeof START | N | N[], endKey: N | typeof END): this;\n    addSequence<K extends string, NodeInput = S, NodeOutput extends U = U>(nodes: [\n        key: K,\n        action: NodeAction<NodeInput, NodeOutput, C, InterruptType, WriterType>,\n        options?: StateGraphAddNodeOptions\n    ][]): StateGraph<SD, S, U, N | K, I, O, C, MergeReturnType<NodeReturnType, {\n        [key in K]: NodeOutput;\n    }>>;\n    addSequence<K extends string, NodeMap extends Record<K, NodeAction<S, U, C, InterruptType, WriterType>>>(nodes: NodeMap): StateGraph<SD, S, U, N | K, I, O, C, MergeReturnType<NodeReturnType, {\n        [key in keyof NodeMap]: NodeMap[key] extends NodeAction<S, infer U, C, InterruptType, WriterType> ? U : never;\n    }>>;\n    compile({ checkpointer, store, cache, interruptBefore, interruptAfter, name, description }?: {\n        checkpointer?: BaseCheckpointSaver | boolean;\n        store?: BaseStore;\n        cache?: BaseCache;\n        interruptBefore?: N[] | All;\n        interruptAfter?: N[] | All;\n        name?: string;\n        description?: string;\n    }): CompiledStateGraph<Prettify<S>, Prettify<U>, N, I, O, C, NodeReturnType, InterruptType, WriterType>;\n}\n/**\n * Final result from building and compiling a {@link StateGraph}.\n * Should not be instantiated directly, only using the StateGraph `.compile()`\n * instance method.\n */\nexport declare class CompiledStateGraph<S, U, N extends string = typeof START, I extends StateDefinitionInit = StateDefinition, O extends StateDefinitionInit = StateDefinition, C extends StateDefinitionInit = StateDefinition, NodeReturnType = unknown, InterruptType = unknown, WriterType = unknown> extends CompiledGraph<N, S, U, ExtractStateType<C>, ExtractUpdateType<I, ExtractStateType<I>>, ExtractStateType<O>, NodeReturnType, CommandInstance<InferInterruptResumeType<InterruptType>, Prettify<U>, N>, InferWriterType<WriterType>> {\n    builder: StateGraph<unknown, S, U, N, I, O, C, NodeReturnType>;\n    /**\n     * The description of the compiled graph.\n     * This is used by the supervisor agent to describe the handoff to the agent.\n     */\n    description?: string;\n    /** @internal */\n    _metaRegistry: SchemaMetaRegistry;\n    constructor({ description, ...rest }: {\n        description?: string;\n    } & ConstructorParameters<typeof CompiledGraph<N, S, U, ExtractStateType<C>, ExtractUpdateType<I, ExtractStateType<I>>, ExtractStateType<O>, NodeReturnType, CommandInstance<InferInterruptResumeType<InterruptType>, Prettify<U>, N>, InferWriterType<WriterType>>>[0]);\n    attachNode(key: typeof START, node?: never): void;\n    attachNode(key: N, node: StateGraphNodeSpec<S, U>): void;\n    attachEdge(starts: N | N[] | \"__start__\", end: N | \"__end__\"): void;\n    attachBranch(start: N | typeof START, _: string, branch: Branch<S, N>, options?: {\n        withReader?: boolean;\n    }): void;\n    protected _validateInput(input: ExtractUpdateType<I, ExtractStateType<I>>): Promise<ExtractUpdateType<I, ExtractStateType<I>>>;\n    isInterrupted(input: unknown): input is {\n        [INTERRUPT]: Interrupt<InferInterruptInputType<InterruptType>>[];\n    };\n    protected _validateContext(config: Partial<Record<string, unknown>>): Promise<Partial<Record<string, unknown>>>;\n}\nexport {};\n"],"mappings":";;;;;;;;;;;;;;;KAaYqC,yDACIC,WAAWlB,cAAckB,SAASC,UADlD;AAA2B,UAGVC,cAHU,CAAA,iBAAA,MAAA,GAAA,OAAA,CAAA,CAAA;UACXF,EAGFA,QAHEA,SAAAA,MAAAA,GAGwBA,QAHxBA,SAAAA,OAAAA,EAAAA,GAGqDD,eAHrDC,CAAAA;IAAyBA,QAAAA,EAIvBA,QAJuBA;OAKhCD,eALyCE,CAKzBD,QALyBC,CAAAA,GAKbF,eALaE,CAAAA;IAAvBnB,QAAAA,EAMTkB,QANSlB;EAAa,CAAA,CAAA;AAExC;AAA+B,KAOnBqB,kBAPmB,CAAA,QAAA,EAAA,SAAA,CAAA,GAOuB7B,QAPvB,CAOgC8B,QAPhC,EAO0CC,SAP1C,CAAA,GAAA;OACjBL,CAAAA,EAOFjB,eAPEiB;aAA0BA,CAAAA,EAQtBd,WARsBc;aACtBA,CAAAA,EAQAf,WARAe;;;;;;;AAKlB;AAA8B,KAWlBM,wBAXkB,CAAA,cAAA,MAAA,GAAA,MAAA,EAAA,oBAW0DR,mBAX1D,GAAA,SAAA,GAW4FA,mBAX5F,GAAA,SAAA,CAAA,GAAA;aAAiCM,CAAAA,EAY7ClB,WAZ6CkB;aAAUC,CAAAA,EAavDpB,WAbuDoB,GAAAA,OAAAA;OAAnB/B,CAAAA,EAc1CiC,WAd0CjC;IAelDD,cAdQU,CAcOyB,KAdPzB,CAAAA;AACMG,KAcNuB,6BAdMvB,CAAAA,WAcmCH,eAdnCG,EAAAA,UAc8DH,eAd9DG,EAAAA,UAcyFH,eAdzFG,CAAAA,GAAAA;aACAD,EAcDJ,cAdCI,CAccyB,EAddzB,CAAAA;EAAW,KAAA,CAAA,EAejBJ,cAfiB,CAeF8B,CAfE,CAAA;EAQjBL,MAAAA,CAAAA,EAQCzB,cARDyB,CAQgBM,CARhBN,CAAAA;CAAwB;AAAoDR,KAU5Ee,oCAV4Ef,CAAAA,WAU5Bf,eAV4Be,EAAAA,UAUDf,eAVCe,GAUiBY,EAVjBZ,CAAAA,GAAAA;OAAkCA,EAW/GjB,cAX+GiB,CAWhGY,EAXgGZ,CAAAA;QACxGZ,EAWNL,cAXMK,CAWS0B,CAXT1B,CAAAA;;KAab4B,sBAXOP,CAAAA,CAAAA,CAAAA,GAWqBQ,CAXrBR,SAW+BhB,cAX/BgB,GAWgDQ,CAXhDR,GAWoDQ,CAXpDR,SAW8DT,mBAX9DS,GAWoFV,iBAXpFU,CAWsGQ,CAXtGR,CAAAA,GAW2GxB,eAX3GwB;KAYPS,UAXcR,CAAAA,CAAAA,EAAAA,CAAAA,EAAAA,UAWaV,mBAXbU,EAAAA,aAAAA,EAAAA,UAAAA,CAAAA,GAW+DzC,YAX/DyC,CAW4ES,CAX5ET,EAW+EU,CAX/EV,SAAAA,MAAAA,GAWkGU,CAXlGV,GAWsGW,MAXtGX,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA,GAW4HU,CAX5HV,EAW+HxC,OAX/HwC,CAWuIxB,SAXvIwB,CAWiJX,iBAXjJW,CAWmKY,CAXnKZ,CAAAA,CAAAA,EAWwKa,aAXxKb,EAWuLc,UAXvLd,CAAAA,CAAAA;KAYde,gBAZDlD,CAAAA,CAAAA,EAAAA,CAAAA,EAAAA,UAYkCyB,mBAZlCzB,EAAAA,cAAAA,MAAAA,EAAAA,aAAAA,EAAAA,UAAAA,CAAAA,GAY0GN,YAZ1GM,CAYuHmD,QAZvHnD,CAYgI4C,CAZhI5C,CAAAA,EAYoI6C,CAZpI7C,GAYwIE,OAZxIF,CAYgJe,wBAZhJf,CAYyKgD,aAZzKhD,CAAAA,EAYyL6C,CAZzL7C,GAY6L8C,MAZ7L9C,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA,EAYkNmC,KAZlNnC,CAAAA,EAY0NL,OAZ1NK,CAYkOW,SAZlOX,CAY4OwB,iBAZ5OxB,CAY8P+C,CAZ9P/C,CAAAA,CAAAA,EAYmQgD,aAZnQhD,EAYkRiD,UAZlRjD,CAAAA,CAAAA;cAaUoD,kBAbI,EAAA,OAAA,MAAA;AAClB,KAaKA,kBAAAA,GAbOhB,OAaqBgB,kBAbQ;KAcpCC,eAdoC,CAAA,IAAA,EAAA,IAAA,CAAA,GAcNC,IAdM,GAcCC,IAdD,SAAA,KAAA,EAAA,GAAA,QAAY7C,MAerCgC,CAfqChC,GAejCgC,CAfiChC,CAe/BkB,CAf+BlB,CAAAA,YAA2BA,GAAAA,KAAAA;KAiB3EyC,QAjBsGzC,CAAAA,CAAAA,CAAAA,GAAAA,QAC3E2B,MAiBhBK,CAjBgBL,GAiBZK,CAjBYL,CAiBVT,CAjBUS,CAAAA;;;;;;AAIhC;;;;;;;;;;AAGE;;;;;;;;;;;AACoI;;;;;;;;;;;;;;;;AACxC;;;;;;;;;;;;;;;;;;;;AAEhFe,cAsEOI,UAtE0B,CAAA,WAsEJ/B,mBAtEI,GAAA,OAAA,EAAA,IAsE+BL,gBAtE/B,CAsEgDiB,EAtEhD,CAAA,EAAA,IAsEyDhB,iBAtEzD,CAsE2EgB,EAtE3E,EAsE+EO,CAtE/E,CAAA,EAAA,UAAA,MAAA,GAAA,OAsE6GzC,KAtE7G,EAAA,UAsE8HsB,mBAtE9H,GAsEoJgB,sBAtEpJ,CAsE2KJ,EAtE3K,CAAA,EAAA,UAsE0LZ,mBAtE1L,GAsEgNgB,sBAtEhN,CAsEuOJ,EAtEvO,CAAA,EAAA,UAsEsPZ,mBAtEtP,GAsE4Qf,eAtE5Q,EAAA,iBAAA,OAAA,EAAA,gBAAA,OAAA,EAAA,aAAA,OAAA,CAAA,SAsE8WZ,KAtE9W,CAsEoX2D,CAtEpX,EAsEuXb,CAtEvX,EAsE0XC,CAtE1X,EAsE6Xf,kBAtE7X,CAsEgZc,CAtEhZ,EAsEmZC,CAtEnZ,CAAA,EAsEuZrB,iBAtEvZ,CAsEyauB,CAtEza,CAAA,CAAA,CAAA;EAC1CK,QAAAA,EAsESN,MAtETM,CAAAA,MAAkB,EAsEMxD,WAtEIwD,CAAAA;EAC5BC,YAAAA,EAsEaK,GAtEbL,CAAe,CAsEGI,CAtEH,EAAA,EAsEQA,CAtER,CAAA,CAAA;EAAA;mBAAeH,EAwEZ5C,eAxEY4C;;0BACnBZ,EAyEcjD,gBAzEdiD,GAyEiCxB,cAzEjCwB,GAAAA,SAAAA;;kBAAMd,EA2EAU,CA3EAV;EAAC;EAElBuB,uBAAQ,EA2EgB1D,gBA3EhB,GA2EmCyB,cA3EnC,GA2EoDkC,kBA3EpD,GAAA,SAAA;EAAA;mBACGV,EA4EOH,CA5EPG;;0BAAMd,EA8EQnC,gBA9ERmC,GA8E2BV,cA9E3BU,GAAAA,SAAAA;EAAC;AAgEvB;;;oBAA+FS,EAmBvEsB,GAnBuEtB,CAAAA,GAAAA,EAAAA,GAAAA,CAAAA;;eAA2BA,EAqBvGvB,kBArBuGuB;;eAAlBhB,EAuBrFG,iBAvBqFH,CAuBnE0B,CAvBmE1B,CAAAA,GAAAA,SAAAA;;sBAAqEI,EAyBnJhC,gBAzBmJgC,GAAAA,SAAAA;;YAAsBgB,EA2BnLO,aA3BmLP;;SAAmFJ,EA6BzQY,UA7ByQZ;MAAvBI,EA8BrPS,gBA9BqPT,CA8BpOG,CA9BoOH,EA8BjOI,CA9BiOJ,EA8B9NM,CA9B8NN,EA8B3NgB,CA9B2NhB,EA8BxNO,aA9BwNP,EA8BzMQ,UA9ByMR,CAAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;aA8BrPS,CAAAA,KAAAA,EAuCab,EAvCba,SAuCwBzB,mBAvCxByB,GAuC8Cb,EAvC9Ca,GAAAA,KAAAA,EAAAA,OAAAA,CAAAA,EAuCoEH,CAvCpEG,GAuCwE1C,cAvCxE0C,CAuCuF1B,iBAvCvF0B,CAuCyGH,CAvCzGG,CAAAA,CAAAA,GAuC+G3B,iBAvC/G2B,CAuCiIZ,CAvCjIY,EAuCoIX,CAvCpIW,EAuCuIH,CAvCvIG,EAuC0IO,CAvC1IP,EAuC6IF,aAvC7IE,EAuC4JD,UAvC5JC,CAAAA;aAuCab,CAAAA,MAAAA,EACCA,EADDA,SACY3B,eADZ2B,GAC8BG,oCAD9BH,CACmEA,EADnEA,EACuEb,iBADvEa,CACyFE,CADzFF,CAAAA,CAAAA,GAAAA,KAAAA,EAAAA,aAAAA,CAAAA,EACsHU,CADtHV,GAC0H7B,cAD1H6B,CACyIb,iBADzIa,CAC2JU,CAD3JV,CAAAA,CAAAA;aAAWZ,CAAAA,MAAAA,EAEVY,EAFUZ,SAECf,eAFDe,GAEmBjB,cAFnBiB,CAEkCY,EAFlCZ,CAAAA,GAEwCW,6BAFxCX,CAEsEY,EAFtEZ,EAE0ED,iBAF1EC,CAE4Fa,CAF5Fb,CAAAA,EAEgGD,iBAFhGC,CAEkHc,CAFlHd,CAAAA,CAAAA,GAAAA,KAAAA,EAAAA,aAAAA,CAAAA,EAE+IsB,CAF/ItB,GAEmJjB,cAFnJiB,CAEkKD,iBAFlKC,CAEoLsB,CAFpLtB,CAAAA,CAAAA;aAAsBY,CAAAA,IAAAA,EAGlCuB,IAHkCvB,CAG7Bf,cAH6Be,CAGdA,EAHcA,SAGHZ,mBAHGY,GAGmBA,EAHnBA,GAGwBZ,mBAHxBY,EAG6CA,EAH7CA,SAGwDZ,mBAHxDY,GAG8EA,EAH9EA,GAGmFZ,mBAHnFY,EAGwGE,CAHxGF,EAG2GU,CAH3GV,SAGqHlB,iBAHrHkB,GAGyIU,CAHzIV,GAAAA,SAAAA,EAGwJoB,CAHxJpB,EAG2JW,aAH3JX,EAG0KY,UAH1KZ,CAAAA,EAAAA,OAAAA,GAAAA,aAAAA,GAAAA,OAAAA,CAAAA,GAAAA;IAAsBU,KAAAA,EAI/DV,EAJ+DU,SAIpDtB,mBAJoDsB,GAI9BV,EAJ8BU,GAAAA,KAAAA;IAAqCA,KAAAA,CAAAA,EAAAA,KAAAA;IAAlBvB,WAAAA,CAAAA,EAAAA,KAAAA;KAAfhB,aAAAA,CAAAA,EAO3DuC,CAP2DvC,GAOvDA,cAPuDA,CAOxCgB,iBAPwChB,CAOtBuC,CAPsBvC,CAAAA,CAAAA;aAAyD8B,CAAAA,IAAAA,EAQrHhB,cARqHgB,CAQtGD,EARsGC,SAQ3Fb,mBAR2Fa,GAQrED,EARqEC,GAQhEb,mBARgEa,EAQ3CA,CAR2CA,EAQxCC,CARwCD,EAQrCS,CARqCT,SAQ3BnB,iBAR2BmB,GAQPS,CAROT,GAAAA,SAAAA,EAQQmB,CARRnB,EAQWU,aARXV,EAQ0BW,UAR1BX,CAAAA;;aAAMS,CAAAA,MAAAA,EAUzHlB,cAVyHkB,CAU1GH,CAV0GG,CAAAA,EAAAA,aAAAA,CAAAA,EAUtFA,CAVsFA,GAUlFvC,cAVkFuC,CAUnEvB,iBAVmEuB,CAUjDA,CAViDA,CAAAA,CAAAA;;;;;UACzHV,0BAAAA;;;;;UAA6BG,sBAAAA;MAAwFO,QAAAA,CAAAA,CAAAA,EAoBzHW,GApByHX,CAAAA,CAAAA,MAAAA,EAAAA,MAAAA,CAAAA,CAAAA;YAAqCA,CAAAA,eAAAA,EAqBlJtB,mBArBkJsB,CAAAA,EAAAA,IAAAA;SAAlBvB,CAAAA,UAAAA,MAAAA,EAAAA,gBAsBlHsB,MAtBkHtB,CAsB3GI,CAtB2GJ,EAsBxGmB,UAtBwGnB,CAsB7FoB,CAtB6FpB,EAsB1FqB,CAtB0FrB,EAsBvFuB,CAtBuFvB,EAsBpFwB,aAtBoFxB,EAsBrEyB,UAtBqEzB,CAAAA,CAAAA,CAAAA,CAAAA,KAAAA,EAsBhDqC,OAtBgDrC,CAAAA,EAsBtCgC,UAtBsChC,CAsB3Ba,EAtB2Bb,EAsBvBoB,CAtBuBpB,EAsBpBqB,CAtBoBrB,EAsBjBiC,CAtBiBjC,GAsBbI,CAtBaJ,EAsBVc,CAtBUd,EAsBPe,CAtBOf,EAsBJuB,CAtBIvB,EAsBD6B,eAtBC7B,CAsBesC,cAtBftC,EAAAA,UAAfhB,MAuB3HqD,OAvB2HrD,GAuBjHqD,OAvBiHrD,CAuBzGuD,GAvByGvD,CAAAA,SAuB5FmC,UAvB4FnC,CAuBjFoC,CAvBiFpC,EAAAA,KAAAA,EAAAA,EAuBrEuC,CAvBqEvC,EAuBlEwC,aAvBkExC,EAuBnDyC,UAvBmDzC,CAAAA,GAuBrCqC,CAvBqCrC,GAAAA,KAAAA,IACzH6B;SAAW3B,CAAAA,UAAAA,MAAAA,EAAAA,YAwBOkC,CAxBPlC,EAAAA,mBAwB6BmC,CAxB7BnC,GAwBiCmC,CAxBjCnC,CAAAA,CAAAA,KAAAA,EAAAA,CAAiC2B,GAAAA,EAyBvDT,CAzBuDS,EAAf7B,MAAAA,EA0BrCmC,UA1BqCnC,CA0B1BwD,SA1B0BxD,EA0BfyD,UA1BezD,EA0BHuC,CA1BGvC,EA0BAwC,aA1BAxC,EA0BeyC,UA1BfzC,CAAAA,EAAmD6B,OAAAA,GA2BtFJ,wBA3BsFI,GAAsBC,CAAAA,EA4BpHkB,UA5BoHlB,CA4BzGD,EA5ByGC,EA4BrGM,CA5BqGN,EA4BlGO,CA5BkGP,EA4B/FmB,CA5B+FnB,GA4B3FV,CA5B2FU,EA4BxFA,CA5BwFA,EA4BrFC,CA5BqFD,EA4BlFS,CA5BkFT,EA4B/Ee,eA5B+Ef,CA4B/DwB,cA5B+DxB,EAAAA,UA6B9GV,CA7B4FJ,GA6BxFyC,UA7BwFzC,IAAwCe;SAAlBf,CAAAA,UAAAA,MAAAA,EAAAA,oBA+BhFC,mBA/BgFD,EAAAA,mBA+BxCqB,CA/BwCrB,GA+BpCqB,CA/BoCrB,CAAAA,CAAAA,GAAAA,EA+B5BI,CA/B4BJ,EAAAA,MAAAA,EA+BjBmB,UA/BiBnB,CA+BNJ,gBA/BMI,CA+BWU,WA/BXV,CAAAA,EA+ByByC,UA/BzBzC,EA+BqCuB,CA/BrCvB,EA+BwCwB,aA/BxCxB,EA+BuDyB,UA/BvDzB,CAAAA,EAAAA,OAAAA,EA+B6ES,wBA/B7ET,CA+BsGiC,CA/BtGjC,GA+B0GI,CA/B1GJ,EA+B6GU,WA/B7GV,CAAAA,CAAAA,EA+B4HgC,UA/B5HhC,CA+BuIa,EA/BvIb,EA+B2IoB,CA/B3IpB,EA+B8IqB,CA/B9IrB,EA+BiJiC,CA/BjJjC,GA+BqJI,CA/BrJJ,EA+BwJc,CA/BxJd,EA+B2Je,CA/B3Jf,EA+B8JuB,CA/B9JvB,EA+BiK6B,eA/BjK7B,CA+BiLsC,cA/BjLtC,EAAAA,UAgClHI,CAhC0DQ,GAgCtD6B,UAhCsD7B,IAAuGW;SAAqCA,CAAAA,UAAAA,MAAAA,EAAAA,oBAkCpKtB,mBAlCoKsB,EAAAA,mBAkC5HF,CAlC4HE,GAkCxHF,CAlCwHE,CAAAA,CAAAA,GAAAA,EAkChHnB,CAlCgHmB,EAAAA,MAAAA,EAkCrGJ,UAlCqGI,CAkC1F3B,gBAlC0F2B,CAkCzEb,WAlCyEa,CAAAA,EAkC3DkB,UAlC2DlB,EAkC/CA,CAlC+CA,EAkC5CC,aAlC4CD,EAkC7BE,UAlC6BF,CAAAA,EAAAA,OAAAA,EAkCPd,wBAlCOc,CAkCkBU,CAlClBV,GAkCsBnB,CAlCtBmB,EAkCyBb,WAlCzBa,CAAAA,CAAAA,EAkCwCS,UAlCxCT,CAkCmDV,EAlCnDU,EAkCuDH,CAlCvDG,EAkC0DF,CAlC1DE,EAkC6DU,CAlC7DV,GAkCiEnB,CAlCjEmB,EAkCoET,CAlCpES,EAkCuER,CAlCvEQ,EAkC0EA,CAlC1EA,EAkC6EM,eAlC7EN,CAkC6Fe,cAlC7Ff,EAAAA,UAmCtMnB,CAnCoLJ,GAmChLyC,UAnCgLzC,IAAfhB;SAC3I6B,CAAAA,UAAAA,MAAAA,EAAAA,YAoCAO,CApCAP,EAAAA,mBAoCsBQ,CApCtBR,GAoC0BQ,CApC1BR,CAAAA,CAAAA,GAAAA,EAoCkCT,CApClCS,EAAAA,MAAAA,EAoC6CM,UApC7CN,CAoCwD2B,SApCxD3B,EAoCmE4B,UApCnE5B,EAoC+EU,CApC/EV,EAoCkFW,aApClFX,EAoCiGY,UApCjGZ,CAAAA,EAAAA,OAAAA,CAAAA,EAoCwHJ,wBApCxHI,CAAAA,EAoCmJmB,UApCnJnB,CAoC8JA,EApC9JA,EAoCkKO,CApClKP,EAoCqKQ,CApCrKR,EAoCwKoB,CApCxKpB,GAoC4KT,CApC5KS,EAoC+KC,CApC/KD,EAoCkLE,CApClLF,EAoCqLU,CApCrLV,EAoCwLgB,eApCxLhB,CAoCwMyB,cApCxMzB,EAAAA,UAqC1BT,CArCqCH,GAqCjCwC,UArCiCxC,IAAsBY;SAAKZ,CAAAA,UAAAA,MAAAA,EAAAA,YAuCtCmB,CAvCsCnB,CAAAA,CAAAA,GAAAA,EAuC9BG,CAvC8BH,EAAAA,MAAAA,EAuCnBkB,UAvCmBlB,CAuCRuC,SAvCQvC,EAuCGoB,CAvCHpB,EAuCMsB,CAvCNtB,EAuCSuB,aAvCTvB,EAuCwBwB,UAvCxBxB,CAAAA,EAAAA,OAAAA,CAAAA,EAuC+CQ,wBAvC/CR,CAAAA,EAuC0E+B,UAvC1E/B,CAuCqFY,EAvCrFZ,EAuCyFmB,CAvCzFnB,EAuC4FoB,CAvC5FpB,EAuC+FgC,CAvC/FhC,GAuCmGG,CAvCnGH,EAuCsGa,CAvCtGb,EAuCyGc,CAvCzGd,EAuC4GsB,CAvC5GtB,EAuC+GqC,cAvC/GrC,CAAAA;SAAqBY,CAAAA,QAAAA,EAAAA,OAwCxElC,KAxCwEkC,GAwChEoB,CAxCgEpB,GAwC5DoB,CAxC4DpB,EAAAA,EAAAA,MAAAA,EAwC/CoB,CAxC+CpB,GAAAA,OAwCpCjC,GAxCoCiC,CAAAA,EAAAA,IAAAA;aAAWZ,CAAAA,UAAAA,MAAAA,EAAAA,YAyClEmB,CAzCkEnB,EAAAA,mBAyC5CoB,CAzC4CpB,GAyCxCoB,CAzCwCpB,CAAAA,CAAAA,KAAAA,EAAAA,CAAsBY,GAAAA,EA0CzHT,CA1CyHS,EAAKZ,MAAAA,EA2C3HkB,UA3C2HlB,CA2ChHuC,SA3CgHvC,EA2CrGwC,UA3CqGxC,EA2CzFsB,CA3CyFtB,EA2CtFuB,aA3CsFvB,EA2CvEwB,UA3CuExB,CAAAA,EAAqBc,OAAAA,GA4C9IN,wBA5C8IM,GAAGQ,CAAAA,EA6CzJS,UA7CyJT,CA6C9IV,EA7C8IU,EA6C1IH,CA7C0IG,EA6CvIF,CA7CuIE,EA6CpIU,CA7CoIV,GA6ChInB,CA7CgImB,EA6C7HT,CA7C6HS,EA6C1HR,CA7C0HQ,EA6CvHA,CA7CuHA,EA6CpHM,eA7CoHN,CA6CpGe,cA7CoGf,EAAAA,UA8CnJnB,CA9C6JT,GA8CzJ8C,UA9CyJ9C,IAAoB4B;aAAeU,CAAAA,UAAAA,MAAAA,EAAAA,gBAgD9JX,MAhD8JW,CAgDvJ7B,CAhDuJ6B,EAgDpJd,UAhDoJc,CAgDzIb,CAhDyIa,EAgDtIZ,CAhDsIY,EAgDnIV,CAhDmIU,EAgDhIT,aAhDgIS,EAgDjHR,UAhDiHQ,CAAAA,CAAAA,CAAAA,CAAAA,KAAAA,EAgD5FI,OAhD4FJ,CAAAA,EAgDlFD,UAhDkFC,CAgDvEpB,EAhDuEoB,EAgDnEb,CAhDmEa,EAgDhEZ,CAhDgEY,EAgD7DA,CAhD6DA,GAgDzD7B,CAhDyD6B,EAgDtDnB,CAhDsDmB,EAgDnDlB,CAhDmDkB,EAgDhDV,CAhDgDU,EAgD7CJ,eAhD6CI,CAgD7BK,cAhD6BL,EAAAA,UAAGT,MAiD7La,OAjD6Lb,GAiDnLa,OAjDmLb,CAiD3Ke,GAjD2Kf,CAAAA,SAiD9JL,UAjD8JK,CAiDnJJ,CAjDmJI,EAAAA,KAAAA,EAAAA,EAiDvID,CAjDuIC,EAiDpIA,aAjDoIA,EAiDrHC,UAjDqHD,CAAAA,GAiDvGH,CAjDuGG,GAAAA,KAAAA,IAAeC;SAAvM3B,CAAAA;IAAAA,YAAAA;IAAAA,KAAAA;IAAAA,KAAAA;IAAAA,eAAAA;IAAAA,cAAAA;IAAAA,IAAAA;IAAAA;IAAAA,EAAAA;IAALsC,YAAAA,CAAAA,EAoDCrE,mBApDDqE,GAAAA,OAAAA;IACPvB,KAAAA,CAAAA,EAoDC7C,SApDD6C;IAAWZ,KAAAA,CAAAA,EAqDVnC,SArDUmC;IAAsBY,eAAAA,CAAAA,EAsDtBoB,CAtDsBpB,EAAAA,GAsDhBhD,GAtDgBgD;IAGzBU,cAAAA,CAAAA,EAoDEU,CApDFV,EAAAA,GAoDQ1D,GApDR0D;IAAqCA,IAAAA,CAAAA,EAAAA,MAAAA;IAAlBvB,WAAAA,CAAAA,EAAAA,MAAAA;MAuDlCiD,kBAvDmBjE,CAuDA2C,QAvDA3C,CAuDSoC,CAvDTpC,CAAAA,EAuDa2C,QAvDb3C,CAuDsBqC,CAvDtBrC,CAAAA,EAuD0BiD,CAvD1BjD,EAuD6B8B,CAvD7B9B,EAuDgC+B,CAvDhC/B,EAuDmCuC,CAvDnCvC,EAuDsCsD,cAvDtCtD,EAuDsDwC,aAvDtDxC,EAuDqEyC,UAvDrEzC,CAAAA;;;;;;;AAC2EuC,cA6DjF0B,kBA7DiF1B,CAAAA,CAAAA,EAAAA,CAAAA,EAAAA,UAAAA,MAAAA,GAAAA,OA6D9B5C,KA7D8B4C,EAAAA,UA6DbtB,mBA7DasB,GA6DSrC,eA7DTqC,EAAAA,UA6DoCtB,mBA7DpCsB,GA6D0DrC,eA7D1DqC,EAAAA,UA6DqFtB,mBA7DrFsB,GA6D2GrC,eA7D3GqC,EAAAA,iBAAAA,OAAAA,EAAAA,gBAAAA,OAAAA,EAAAA,aAAAA,OAAAA,CAAAA,SA6D6MlD,aA7D7MkD,CA6D2NU,CA7D3NV,EA6D8NH,CA7D9NG,EA6DiOF,CA7DjOE,EA6DoO3B,gBA7DpO2B,CA6DqPA,CA7DrPA,CAAAA,EA6DyP1B,iBA7DzP0B,CA6D2QT,CA7D3QS,EA6D8Q3B,gBA7D9Q2B,CA6D+RT,CA7D/RS,CAAAA,CAAAA,EA6DoS3B,gBA7DpS2B,CA6DqTR,CA7DrTQ,CAAAA,EA6DyTe,cA7DzTf,EA6DyU1C,eA7DzU0C,CA6DyVhC,wBA7DzVgC,CA6DkXC,aA7DlXD,CAAAA,EA6DkYI,QA7DlYJ,CA6D2YF,CA7D3YE,CAAAA,EA6D+YU,CA7D/YV,CAAAA,EA6DmZ9B,eA7DnZ8B,CA6DmaE,UA7DnaF,CAAAA,CAAAA,CAAAA;SAAU5B,EA8DnGqC,UA9DmGrC,CAAAA,OAAAA,EA8D/EyB,CA9D+EzB,EA8D5E0B,CA9D4E1B,EA8DzEsC,CA9DyEtC,EA8DtEmB,CA9DsEnB,EA8DnEoB,CA9DmEpB,EA8DhE4B,CA9DgE5B,EA8D7D2C,cA9D6D3C,CAAAA;;;;;aAA1FG,CAAAA,EAAAA,MAAAA;;eAEEO,EAmELf,kBAnEKe;aAAmCkB,CAAAA;IAAAA,WAAAA;IAAAA,GAAAA;EAAmBvB,CAAnBuB,EAAAA;IAAqCA,WAAAA,CAAAA,EAAAA,MAAAA;MAsExF2B,qBAtEsElD,CAAAA,OAsEzC3B,aAtEyC2B,CAsE3BiC,CAtE2BjC,EAsExBoB,CAtEwBpB,EAsErBqB,CAtEqBrB,EAsElBJ,gBAtEkBI,CAsEDuB,CAtECvB,CAAAA,EAsEGH,iBAtEHG,CAsEqBc,CAtErBd,EAsEwBJ,gBAtExBI,CAsEyCc,CAtEzCd,CAAAA,CAAAA,EAsE8CJ,gBAtE9CI,CAsE+De,CAtE/Df,CAAAA,EAsEmEsC,cAtEnEtC,EAsEmFnB,eAtEnFmB,CAsEmGT,wBAtEnGS,CAsE4HwB,aAtE5HxB,CAAAA,EAsE4I2B,QAtE5I3B,CAsEqJqB,CAtErJrB,CAAAA,EAsEyJiC,CAtEzJjC,CAAAA,EAsE6JP,eAtE7JO,CAsE6KyB,UAtE7KzB,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA,CAAAA;YAAfhB,CAAAA,GAAAA,EAAAA,OAuEpCL,KAvEoCK,EAAAA,IAAAA,CAAAA,EAAAA,KAAAA,CAAAA,EAAAA,IAAAA;YAW3CkD,CAAAA,GAAAA,EA6DAD,CA7DAC,EAAAA,IAAAA,EA6DS5B,kBA7DT4B,CA6D4Bd,CA7D5Bc,EA6D+Bb,CA7D/Ba,CAAAA,CAAAA,EAAAA,IAAAA;YACYjC,CAAAA,MAAAA,EA6DTgC,CA7DShC,GA6DLgC,CA7DKhC,EAAAA,GAAAA,WAAAA,EAAAA,GAAAA,EA6DmBgC,CA7DnBhC,GAAAA,SAAAA,CAAAA,EAAAA,IAAAA;cACqBG,CAAAA,KAAAA,EA6D7B6B,CA7D6B7B,GAAAA,OA6DlBzB,KA7DkByB,EAAAA,CAAAA,EAAAA,MAAAA,EAAAA,MAAAA,EA6DQ7B,MA7DR6B,CA6DegB,CA7DfhB,EA6DkB6B,CA7DlB7B,CAAAA,EAAAA,QAAAA,EAAAA;IAAcgB,UAAAA,CAAAA,EAAAA,OAAAA;MAAGC,IAAAA;YAAGE,cAAAA,CAAAA,KAAAA,EAgErC1B,iBAhEqC0B,CAgEnBT,CAhEmBS,EAgEhB3B,gBAhEgB2B,CAgECT,CAhEDS,CAAAA,CAAAA,CAAAA,EAgEO4B,OAhEP5B,CAgEe1B,iBAhEf0B,CAgEiCT,CAhEjCS,EAgEoC3B,gBAhEpC2B,CAgEqDT,CAhErDS,CAAAA,CAAAA,CAAAA;eAAGC,CAAAA,KAAAA,EAAAA,OAAAA,CAAAA,EAAAA,KAAAA,IAAAA;IAAeC,CAkElF1C,SAAAA,CAlEkF0C,EAkEtE3C,SAlEsE2C,CAkE5DjC,uBAlE4DiC,CAkEpCD,aAlEoCC,CAAAA,CAAAA,EAAAA;;YAA7CH,gBAAAA,CAAAA,MAAAA,EAoEP8B,OApEO9B,CAoECA,MApEDA,CAAAA,MAAAA,EAAAA,OAAAA,CAAAA,CAAAA,CAAAA,EAoE4B6B,OApE5B7B,CAoEoC8B,OApEpC9B,CAoE4CA,MApE5CA,CAAAA,MAAAA,EAAAA,OAAAA,CAAAA,CAAAA,CAAAA"}
+{"version":3,"file":"state.d.cts","names":[],"sources":["../../src/graph/state.ts"],"mappings":";;;;;;;;;;;;;;;KA6FY,eAAA,0CAEE,QAAA,GAAW,aAAA,CAAc,QAAA,CAAS,CAAA;AAAA,UAG/B,cAAA;EACf,QAAA,EAAU,QAAA,kBACN,QAAA,qBACE,eAAA;IAAkB,QAAA,EAAU,QAAA;EAAA,KAC5B,eAAA,CAAgB,QAAA,IAClB,eAAA;IAAkB,QAAA,EAAU,QAAA;EAAA;AAAA;AAAA,KAGtB,kBAAA,wBAA0C,QAAA,CACpD,QAAA,EACA,SAAA;EAEA,KAAA,GAAQ,eAAA;EACR,WAAA,GAAc,WAAA;EACd,WAAA,GAAc,WAAA;AAAA;;;;;AAdhB;;KAuBY,wBAAA,oDAEU,mBAAA,eAChB,mBAAA;EAGJ,WAAA,GAAc,WAAA;EACd,WAAA,GAAc,WAAA;EACd,KAAA,GAAQ,WAAA;AAAA,IACN,cAAA,CAAe,KAAA;AAAA,KAEP,6BAAA,YACC,eAAA,YACD,eAAA,YACA,eAAA;EAEV,WAAA,EAAa,cAAA,CAAe,EAAA;EAC5B,KAAA,GAAQ,cAAA,CAAe,CAAA;EACvB,MAAA,GAAS,cAAA,CAAe,CAAA;AAAA;AAAA,KAGd,oCAAA,YACC,eAAA,YACD,eAAA,GAAkB,EAAA;EAE5B,KAAA,EAAO,cAAA,CAAe,EAAA;EACtB,MAAA,EAAQ,cAAA,CAAe,CAAA;AAAA;AAAA,KAGpB,sBAAA,MAA4B,CAAA,SAAU,cAAA,GACvC,CAAA,GACA,CAAA,SAAU,mBAAA,GACV,iBAAA,CAAkB,CAAA,IAClB,eAAA;AAAA,KAEC,UAAA,iBAGO,mBAAA,+BAGR,YAAA,CACF,CAAA,EACA,CAAA,kBAAmB,CAAA,GAAI,MAAA,gBAAsB,CAAA,EAC7C,OAAA,CAAQ,SAAA,CAAU,iBAAA,CAAkB,CAAA,IAAK,aAAA,EAAe,UAAA;AAAA,KAGrD,gBAAA,iBAGO,mBAAA,qDAIR,YAAA,CACF,QAAA,CAAS,CAAA,GACP,CAAA,GACA,OAAA,CACE,wBAAA,CAAyB,aAAA,GAEzB,CAAA,GAAI,MAAA,eACJ,KAAA,GAEJ,OAAA,CAAQ,SAAA,CAAU,iBAAA,CAAkB,CAAA,IAAK,aAAA,EAAe,UAAA;AAAA,cAGpD,kBAAA;AAAA,KACD,kBAAA,UAA4B,kBAAA;AAAA,KAE5B,eAAA,eAA8B,IAAA,GAAO,IAAA,iCACxB,CAAA,GAAI,CAAA,CAAE,CAAA;AAAA,KAGnB,QAAA,oBACS,CAAA,GAAI,CAAA,CAAE,CAAA;AAzFpB;;;;;;;;;;;;;;;;;;;;;;;;AAeA;;;;;;;;;;;;;;;;;;;;;;;;;;AAWA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAUA;;;;;;;;;;;AApCA,cAyLa,UAAA,YACA,mBAAA,gBACP,gBAAA,CAAiB,EAAA,OACjB,iBAAA,CAAkB,EAAA,EAAI,CAAA,6BACA,KAAA,YAChB,mBAAA,GAAsB,sBAAA,CAAuB,EAAA,aAC7C,mBAAA,GAAsB,sBAAA,CAAuB,EAAA,aAC7C,mBAAA,GAAsB,eAAA,mFAIxB,KAAA,CAAM,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,kBAAA,CAAmB,CAAA,EAAG,CAAA,GAAI,iBAAA,CAAkB,CAAA;EACnE,QAAA,EAAU,MAAA,SAAe,WAAA;EAGzB,YAAA,EAAc,GAAA,EAAK,CAAA,IAAK,CAAA;EAlKxB;EAqKA,iBAAA,EAAmB,eAAA;EArKS;EAwK5B,wBAAA,EAA0B,gBAAA,GAAmB,cAAA;EAtKtC;EAyKP,gBAAA,EAAkB,CAAA;EAxKlB;EA2KA,uBAAA,EACI,gBAAA,GACA,cAAA,GACA,kBAAA;EA9KmB;EAkLvB,iBAAA,EAAmB,CAAA;EAlLK;EAqLxB,wBAAA,EAA0B,gBAAA,GAAmB,cAAA;EAlLpB;;;;EAwLzB,kBAAA,EAAkB,GAAA;EAtLhB;EAyLF,aAAA,EAAe,kBAAA;EAxLK;EA2LpB,aAAA,EAAe,iBAAA,CAAkB,CAAA;EA1L/B;EA6LF,oBAAA,EAAsB,gBAAA;EA7LL;EAgMjB,UAAA,EAAY,aAAA;EApMmB;EAuM/B,OAAA,EAAS,UAAA;EAED,IAAA,EAAM,gBAAA,CAAiB,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,aAAA,EAAe,UAAA;EAvMxD;;;;;;;AAEe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EA6OjB,WAAA,CACE,KAAA,EAAO,EAAA,SAAW,mBAAA,GAAsB,EAAA,UACxC,OAAA,GACI,CAAA,GACA,cAAA,CAAe,iBAAA,CAAkB,CAAA,KACjC,iBAAA,CAAkB,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,aAAA,EAAe,UAAA;EAGnD,WAAA,CACE,MAAA,EAAQ,EAAA,SAAW,eAAA,GACf,oCAAA,CAAqC,EAAA,EAAI,iBAAA,CAAkB,CAAA,YAE/D,aAAA,GAAgB,CAAA,GAAI,cAAA,CAAe,iBAAA,CAAkB,CAAA;EAGvD,WAAA,CACE,MAAA,EAAQ,EAAA,SAAW,eAAA,GAEX,cAAA,CAAe,EAAA,IACf,6BAAA,CACE,EAAA,EACA,iBAAA,CAAkB,CAAA,GAClB,iBAAA,CAAkB,CAAA,YAG5B,aAAA,GAAgB,CAAA,GAAI,cAAA,CAAe,iBAAA,CAAkB,CAAA;EAGvD,WAAA,CACE,IAAA,EAAM,IAAA,CACJ,cAAA,CACE,EAAA,SAAW,mBAAA,GAAsB,EAAA,GAAK,mBAAA,EACtC,EAAA,SAAW,mBAAA,GAAsB,EAAA,GAAK,mBAAA,EACtC,CAAA,EACA,CAAA,SAAU,iBAAA,GAAoB,CAAA,cAC9B,CAAA,EACA,aAAA,EACA,UAAA;IAIF,KAAA,EAAO,EAAA,SAAW,mBAAA,GAAsB,EAAA;IACxC,KAAA;IACA,WAAA;EAAA,GAEF,aAAA,GAAgB,CAAA,GAAI,cAAA,CAAe,iBAAA,CAAkB,CAAA;EAGvD,WAAA,CACE,IAAA,EAAM,cAAA,CACJ,EAAA,SAAW,mBAAA,GAAsB,EAAA,GAAK,mBAAA,EACtC,CAAA,EACA,CAAA,EACA,CAAA,SAAU,iBAAA,GAAoB,CAAA,cAC9B,CAAA,EACA,aAAA,EACA,UAAA;EAvRe;EA4RnB,WAAA,CACE,MAAA,EAAQ,cAAA,CAAe,CAAA,GACvB,aAAA,GAAgB,CAAA,GAAI,cAAA,CAAe,iBAAA,CAAkB,CAAA;EAtR9C;;;;EAAA,QA2XD,0BAAA;EAtXJ;;;;EAAA,QAqbI,sBAAA;EAAA,IAgCJ,QAAA,CAAA,GAAY,GAAA;EAShB,UAAA,CAAW,eAAA,EAAiB,mBAAA;EA2BnB,OAAA,mCAES,MAAA,CAAO,CAAA,EAAG,UAAA,CAAW,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,aAAA,EAAe,UAAA,GAAA,CAE7D,KAAA,EAAO,OAAA,GACN,UAAA,CACD,EAAA,EACA,CAAA,EACA,CAAA,EACA,CAAA,GAAI,CAAA,EACJ,CAAA,EACA,CAAA,EACA,CAAA,EACA,eAAA,CACE,cAAA,kBAEgB,OAAA,GAAU,OAAA,CAAQ,GAAA,UAAa,UAAA,CAC3C,CAAA,WAEA,CAAA,EACA,aAAA,EACA,UAAA,IAEE,CAAA;EAMD,OAAA,+BAAsC,CAAA,qBAAsB,CAAA,GAAI,CAAA,CAAA,CACvE,KAAA,GAEM,GAAA,EAAK,CAAA,EACL,MAAA,EAAQ,UAAA,CACN,SAAA,EACA,UAAA,EACA,CAAA,EACA,aAAA,EACA,UAAA,GAEF,OAAA,GAAU,wBAAA,MAEf,UAAA,CACD,EAAA,EACA,CAAA,EACA,CAAA,EACA,CAAA,GAAI,CAAA,EACJ,CAAA,EACA,CAAA,EACA,CAAA,EACA,eAAA,CAAgB,cAAA,YAA0B,CAAA,GAAI,UAAA;EAGvC,OAAA,uCAEa,mBAAA,qBACD,CAAA,GAAI,CAAA,CAAA,CAEvB,GAAA,EAAK,CAAA,EACL,MAAA,EAAQ,UAAA,CACN,gBAAA,CAAiB,WAAA,GACjB,UAAA,EACA,CAAA,EACA,aAAA,EACA,UAAA,GAEF,OAAA,EAAS,wBAAA,CAAyB,CAAA,GAAI,CAAA,EAAG,WAAA,IACxC,UAAA,CACD,EAAA,EACA,CAAA,EACA,CAAA,EACA,CAAA,GAAI,CAAA,EACJ,CAAA,EACA,CAAA,EACA,CAAA,EACA,eAAA,CAAgB,cAAA,YAA0B,CAAA,GAAI,UAAA;EAGvC,OAAA,uCAEa,mBAAA,qBACD,CAAA,GAAI,CAAA,CAAA,CAEvB,GAAA,EAAK,CAAA,EACL,MAAA,EAAQ,UAAA,CACN,gBAAA,CAAiB,WAAA,GACjB,UAAA,EACA,CAAA,EACA,aAAA,EACA,UAAA,GAEF,OAAA,EAAS,wBAAA,CAAyB,CAAA,GAAI,CAAA,EAAG,WAAA,IACxC,UAAA,CACD,EAAA,EACA,CAAA,EACA,CAAA,EACA,CAAA,GAAI,CAAA,EACJ,CAAA,EACA,CAAA,EACA,CAAA,EACA,eAAA,CAAgB,cAAA,YAA0B,CAAA,GAAI,UAAA;EAGvC,OAAA,+BAAsC,CAAA,qBAAsB,CAAA,GAAI,CAAA,CAAA,CACvE,GAAA,EAAK,CAAA,EACL,MAAA,EAAQ,UAAA,CAAW,SAAA,EAAW,UAAA,EAAY,CAAA,EAAG,aAAA,EAAe,UAAA,GAC5D,OAAA,GAAU,wBAAA,GACT,UAAA,CACD,EAAA,EACA,CAAA,EACA,CAAA,EACA,CAAA,GAAI,CAAA,EACJ,CAAA,EACA,CAAA,EACA,CAAA,EACA,eAAA,CAAgB,cAAA,YAA0B,CAAA,GAAI,UAAA;EAGvC,OAAA,+BAAsC,CAAA,CAAA,CAC7C,GAAA,EAAK,CAAA,EACL,MAAA,EAAQ,UAAA,CAAW,SAAA,EAAW,CAAA,EAAG,CAAA,EAAG,aAAA,EAAe,UAAA,GACnD,OAAA,GAAU,wBAAA,GACT,UAAA,CAAW,EAAA,EAAI,CAAA,EAAG,CAAA,EAAG,CAAA,GAAI,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,cAAA;EA+H/B,OAAA,CACP,QAAA,SAAiB,KAAA,GAAQ,CAAA,GAAI,CAAA,IAC7B,MAAA,EAAQ,CAAA,UAAW,GAAA;EAiCrB,WAAA,+BAA0C,CAAA,qBAAsB,CAAA,GAAI,CAAA,CAAA,CAClE,KAAA,GACE,GAAA,EAAK,CAAA,EACL,MAAA,EAAQ,UAAA,CAAW,SAAA,EAAW,UAAA,EAAY,CAAA,EAAG,aAAA,EAAe,UAAA,GAC5D,OAAA,GAAU,wBAAA,MAEX,UAAA,CACD,EAAA,EACA,CAAA,EACA,CAAA,EACA,CAAA,GAAI,CAAA,EACJ,CAAA,EACA,CAAA,EACA,CAAA,EACA,eAAA,CAAgB,cAAA,YAA0B,CAAA,GAAI,UAAA;EAGhD,WAAA,mCAEkB,MAAA,CAAO,CAAA,EAAG,UAAA,CAAW,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,aAAA,EAAe,UAAA,GAAA,CAE7D,KAAA,EAAO,OAAA,GACN,UAAA,CACD,EAAA,EACA,CAAA,EACA,CAAA,EACA,CAAA,GAAI,CAAA,EACJ,CAAA,EACA,CAAA,EACA,CAAA,EACA,eAAA,CACE,cAAA,kBAEgB,OAAA,GAAU,OAAA,CAAQ,GAAA,UAAa,UAAA,CAC3C,CAAA,WAEA,CAAA,EACA,aAAA,EACA,UAAA,IAEE,CAAA;EAwED,OAAA,CAAA;IACP,YAAA;IACA,KAAA;IACA,KAAA;IACA,eAAA;IACA,cAAA;IACA,IAAA;IACA;EAAA;IAEA,YAAA,GAAe,mBAAA;IACf,KAAA,GAAQ,SAAA;IACR,KAAA,GAAQ,SAAA;IACR,eAAA,GAAkB,CAAA,KAAM,GAAA;IACxB,cAAA,GAAiB,CAAA,KAAM,GAAA;IACvB,IAAA;IACA,WAAA;EAAA,IACO,kBAAA,CACP,QAAA,CAAS,CAAA,GACT,QAAA,CAAS,CAAA,GACT,CAAA,EACA,CAAA,EACA,CAAA,EACA,CAAA,EACA,cAAA,EACA,aAAA,EACA,UAAA;AAAA;AAv5B+C;;;;;;;;;;;;;;;;;;;;;AAG1B;;;;;;;;;;;;;AAH0B,cAmiCtC,kBAAA,iCAGe,KAAA,YAChB,mBAAA,GAAsB,eAAA,YACtB,mBAAA,GAAsB,eAAA,YACtB,mBAAA,GAAsB,eAAA,mFAIxB,aAAA,CACR,CAAA,EACA,CAAA,EACA,CAAA,EACA,gBAAA,CAAiB,CAAA,GACjB,iBAAA,CAAkB,CAAA,EAAG,gBAAA,CAAiB,CAAA,IACtC,gBAAA,CAAiB,CAAA,GACjB,cAAA,EACA,eAAA,CAAgB,wBAAA,CAAyB,aAAA,GAAgB,QAAA,CAAS,CAAA,GAAI,CAAA,GACtE,eAAA,CAAgB,UAAA;EAER,OAAA,EAAS,UAAA,UAAoB,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,CAAA,EAAG,cAAA;EAj9B5C;;;;EAu9BX,WAAA;EAr9BI;EAw9BJ,aAAA,EAAe,kBAAA;EAEf,WAAA,CAAA;IACE,WAAA;IAAA,GACG;EAAA;IACA,WAAA;EAAA,IAAyB,qBAAA,QACrB,aAAA,CACL,CAAA,EACA,CAAA,EACA,CAAA,EACA,gBAAA,CAAiB,CAAA,GACjB,iBAAA,CAAkB,CAAA,EAAG,gBAAA,CAAiB,CAAA,IACtC,gBAAA,CAAiB,CAAA,GACjB,cAAA,EACA,eAAA,CAAgB,wBAAA,CAAyB,aAAA,GAAgB,QAAA,CAAS,CAAA,GAAI,CAAA,GACtE,eAAA,CAAgB,UAAA;EAOpB,UAAA,CAAW,GAAA,SAAY,KAAA,EAAO,IAAA;EAE9B,UAAA,CAAW,GAAA,EAAK,CAAA,EAAG,IAAA,EAAM,kBAAA,CAAmB,CAAA,EAAG,CAAA;EAqJ/C,UAAA,CAAW,MAAA,EAAQ,CAAA,GAAI,CAAA,kBAAmB,GAAA,EAAK,CAAA;EA6B/C,YAAA,CACE,KAAA,EAAO,CAAA,UAAW,KAAA,EAClB,CAAA,UACA,MAAA,EAAQ,MAAA,CAAO,CAAA,EAAG,CAAA,GAClB,OAAA;IAAW,UAAA;EAAA;EAAA,UAmCG,cAAA,CACd,KAAA,EAAO,iBAAA,CAAkB,CAAA,EAAG,gBAAA,CAAiB,CAAA,KAC5C,OAAA,CAAQ,iBAAA,CAAkB,CAAA,EAAG,gBAAA,CAAiB,CAAA;EAsE1C,aAAA,CAAc,KAAA,YAAiB,KAAA;IAAA,CACnC,SAAA,GAAY,SAAA,CAAU,uBAAA,CAAwB,aAAA;EAAA;EAAA,UAKjC,gBAAA,CACd,MAAA,EAAQ,OAAA,CAAQ,MAAA,qBACf,OAAA,CAAQ,OAAA,CAAQ,MAAA;AAAA"}