@langchain/langgraph 1.1.3 → 1.1.5

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (179) hide show
  1. package/dist/channels/any_value.d.cts +0 -1
  2. package/dist/channels/any_value.d.cts.map +1 -1
  3. package/dist/channels/any_value.d.ts +0 -1
  4. package/dist/channels/any_value.d.ts.map +1 -1
  5. package/dist/channels/base.d.cts.map +1 -1
  6. package/dist/channels/base.d.ts.map +1 -1
  7. package/dist/channels/binop.d.cts.map +1 -1
  8. package/dist/channels/binop.d.ts.map +1 -1
  9. package/dist/channels/dynamic_barrier_value.d.cts +0 -10
  10. package/dist/channels/dynamic_barrier_value.d.cts.map +1 -1
  11. package/dist/channels/dynamic_barrier_value.d.ts +0 -10
  12. package/dist/channels/dynamic_barrier_value.d.ts.map +1 -1
  13. package/dist/channels/ephemeral_value.d.cts +0 -1
  14. package/dist/channels/ephemeral_value.d.cts.map +1 -1
  15. package/dist/channels/ephemeral_value.d.ts +0 -1
  16. package/dist/channels/ephemeral_value.d.ts.map +1 -1
  17. package/dist/channels/last_value.d.cts +0 -1
  18. package/dist/channels/last_value.d.cts.map +1 -1
  19. package/dist/channels/last_value.d.ts +0 -1
  20. package/dist/channels/last_value.d.ts.map +1 -1
  21. package/dist/channels/named_barrier_value.d.cts +0 -1
  22. package/dist/channels/named_barrier_value.d.cts.map +1 -1
  23. package/dist/channels/named_barrier_value.d.ts +0 -1
  24. package/dist/channels/named_barrier_value.d.ts.map +1 -1
  25. package/dist/channels/topic.d.cts +0 -1
  26. package/dist/channels/topic.d.cts.map +1 -1
  27. package/dist/channels/topic.d.ts +0 -1
  28. package/dist/channels/topic.d.ts.map +1 -1
  29. package/dist/channels/untracked_value.d.cts +0 -1
  30. package/dist/channels/untracked_value.d.cts.map +1 -1
  31. package/dist/channels/untracked_value.d.ts +0 -1
  32. package/dist/channels/untracked_value.d.ts.map +1 -1
  33. package/dist/constants.d.cts +0 -15
  34. package/dist/constants.d.cts.map +1 -1
  35. package/dist/constants.d.ts +0 -15
  36. package/dist/constants.d.ts.map +1 -1
  37. package/dist/errors.d.cts.map +1 -1
  38. package/dist/errors.d.ts.map +1 -1
  39. package/dist/func/index.d.cts +0 -1
  40. package/dist/func/index.d.cts.map +1 -1
  41. package/dist/func/index.d.ts +0 -1
  42. package/dist/func/index.d.ts.map +1 -1
  43. package/dist/func/types.d.cts +0 -11
  44. package/dist/func/types.d.cts.map +1 -1
  45. package/dist/func/types.d.ts +0 -11
  46. package/dist/func/types.d.ts.map +1 -1
  47. package/dist/graph/annotation.d.cts.map +1 -1
  48. package/dist/graph/annotation.d.ts.map +1 -1
  49. package/dist/graph/graph.d.cts.map +1 -1
  50. package/dist/graph/graph.d.ts.map +1 -1
  51. package/dist/graph/index.d.ts +7 -0
  52. package/dist/graph/message.d.cts.map +1 -1
  53. package/dist/graph/message.d.ts +2 -2
  54. package/dist/graph/message.d.ts.map +1 -1
  55. package/dist/graph/messages_annotation.d.cts +5 -6
  56. package/dist/graph/messages_annotation.d.cts.map +1 -1
  57. package/dist/graph/messages_annotation.d.ts +1 -1
  58. package/dist/graph/messages_annotation.d.ts.map +1 -1
  59. package/dist/graph/messages_reducer.d.cts +0 -1
  60. package/dist/graph/messages_reducer.d.cts.map +1 -1
  61. package/dist/graph/messages_reducer.d.ts +0 -1
  62. package/dist/graph/messages_reducer.d.ts.map +1 -1
  63. package/dist/graph/state.cjs +59 -0
  64. package/dist/graph/state.cjs.map +1 -1
  65. package/dist/graph/state.d.cts +59 -0
  66. package/dist/graph/state.d.cts.map +1 -1
  67. package/dist/graph/state.d.ts +59 -0
  68. package/dist/graph/state.d.ts.map +1 -1
  69. package/dist/graph/state.js +59 -0
  70. package/dist/graph/state.js.map +1 -1
  71. package/dist/graph/types.d.cts +2 -18
  72. package/dist/graph/types.d.cts.map +1 -1
  73. package/dist/graph/types.d.ts +2 -18
  74. package/dist/graph/types.d.ts.map +1 -1
  75. package/dist/graph/zod/index.d.cts +1 -0
  76. package/dist/graph/zod/index.d.ts +1 -0
  77. package/dist/graph/zod/meta.d.cts.map +1 -1
  78. package/dist/graph/zod/meta.d.ts.map +1 -1
  79. package/dist/graph/zod/plugin.d.cts +30 -0
  80. package/dist/graph/zod/plugin.d.cts.map +1 -0
  81. package/dist/graph/zod/plugin.d.ts +30 -0
  82. package/dist/graph/zod/plugin.d.ts.map +1 -0
  83. package/dist/graph/zod/schema.d.cts +0 -1
  84. package/dist/graph/zod/schema.d.cts.map +1 -1
  85. package/dist/graph/zod/schema.d.ts +0 -1
  86. package/dist/graph/zod/schema.d.ts.map +1 -1
  87. package/dist/graph/zod/zod-registry.d.cts +0 -1
  88. package/dist/graph/zod/zod-registry.d.cts.map +1 -1
  89. package/dist/graph/zod/zod-registry.d.ts +0 -1
  90. package/dist/graph/zod/zod-registry.d.ts.map +1 -1
  91. package/dist/interrupt.d.cts.map +1 -1
  92. package/dist/interrupt.d.ts.map +1 -1
  93. package/dist/prebuilt/agentName.d.cts +0 -17
  94. package/dist/prebuilt/agentName.d.cts.map +1 -1
  95. package/dist/prebuilt/agentName.d.ts +0 -17
  96. package/dist/prebuilt/agentName.d.ts.map +1 -1
  97. package/dist/prebuilt/agent_executor.d.cts +5 -5
  98. package/dist/prebuilt/agent_executor.d.cts.map +1 -1
  99. package/dist/prebuilt/agent_executor.d.ts +6 -5
  100. package/dist/prebuilt/agent_executor.d.ts.map +1 -1
  101. package/dist/prebuilt/chat_agent_executor.d.cts.map +1 -1
  102. package/dist/prebuilt/chat_agent_executor.d.ts.map +1 -1
  103. package/dist/prebuilt/interrupt.d.cts.map +1 -1
  104. package/dist/prebuilt/interrupt.d.ts.map +1 -1
  105. package/dist/prebuilt/react_agent_executor.d.cts +8 -14
  106. package/dist/prebuilt/react_agent_executor.d.cts.map +1 -1
  107. package/dist/prebuilt/react_agent_executor.d.ts +10 -14
  108. package/dist/prebuilt/react_agent_executor.d.ts.map +1 -1
  109. package/dist/prebuilt/tool_executor.d.cts.map +1 -1
  110. package/dist/prebuilt/tool_executor.d.ts.map +1 -1
  111. package/dist/prebuilt/tool_node.d.cts.map +1 -1
  112. package/dist/prebuilt/tool_node.d.ts.map +1 -1
  113. package/dist/pregel/algo.d.cts +0 -1
  114. package/dist/pregel/algo.d.cts.map +1 -1
  115. package/dist/pregel/algo.d.ts +5 -1
  116. package/dist/pregel/algo.d.ts.map +1 -1
  117. package/dist/pregel/index.d.cts.map +1 -1
  118. package/dist/pregel/index.d.ts.map +1 -1
  119. package/dist/pregel/read.d.cts +0 -1
  120. package/dist/pregel/read.d.cts.map +1 -1
  121. package/dist/pregel/read.d.ts +1 -1
  122. package/dist/pregel/read.d.ts.map +1 -1
  123. package/dist/pregel/remote.cjs +1 -1
  124. package/dist/pregel/remote.cjs.map +1 -1
  125. package/dist/pregel/remote.d.cts.map +1 -1
  126. package/dist/pregel/remote.d.ts +2 -0
  127. package/dist/pregel/remote.d.ts.map +1 -1
  128. package/dist/pregel/remote.js +2 -2
  129. package/dist/pregel/remote.js.map +1 -1
  130. package/dist/pregel/runnable_types.d.cts.map +1 -1
  131. package/dist/pregel/runnable_types.d.ts.map +1 -1
  132. package/dist/pregel/stream.d.ts +2 -0
  133. package/dist/pregel/types.d.cts +0 -7
  134. package/dist/pregel/types.d.cts.map +1 -1
  135. package/dist/pregel/types.d.ts +0 -7
  136. package/dist/pregel/types.d.ts.map +1 -1
  137. package/dist/pregel/utils/config.d.cts +0 -1
  138. package/dist/pregel/utils/config.d.cts.map +1 -1
  139. package/dist/pregel/utils/config.d.ts +0 -1
  140. package/dist/pregel/utils/config.d.ts.map +1 -1
  141. package/dist/pregel/utils/index.d.cts +3 -7
  142. package/dist/pregel/utils/index.d.cts.map +1 -1
  143. package/dist/pregel/utils/index.d.ts +3 -7
  144. package/dist/pregel/utils/index.d.ts.map +1 -1
  145. package/dist/pregel/write.d.cts +0 -1
  146. package/dist/pregel/write.d.cts.map +1 -1
  147. package/dist/pregel/write.d.ts +0 -1
  148. package/dist/pregel/write.d.ts.map +1 -1
  149. package/dist/state/adapter.d.cts +0 -1
  150. package/dist/state/adapter.d.cts.map +1 -1
  151. package/dist/state/adapter.d.ts +0 -1
  152. package/dist/state/adapter.d.ts.map +1 -1
  153. package/dist/state/index.d.ts +7 -0
  154. package/dist/state/prebuilt/index.d.ts +1 -0
  155. package/dist/state/prebuilt/messages.d.cts +2 -2
  156. package/dist/state/prebuilt/messages.d.cts.map +1 -1
  157. package/dist/state/prebuilt/messages.d.ts +2 -2
  158. package/dist/state/prebuilt/messages.d.ts.map +1 -1
  159. package/dist/state/schema.d.cts.map +1 -1
  160. package/dist/state/schema.d.ts +1 -0
  161. package/dist/state/schema.d.ts.map +1 -1
  162. package/dist/state/types.d.cts +0 -20
  163. package/dist/state/types.d.cts.map +1 -1
  164. package/dist/state/types.d.ts +0 -20
  165. package/dist/state/types.d.ts.map +1 -1
  166. package/dist/state/values/reduced.d.cts +0 -1
  167. package/dist/state/values/reduced.d.cts.map +1 -1
  168. package/dist/state/values/reduced.d.ts +0 -1
  169. package/dist/state/values/reduced.d.ts.map +1 -1
  170. package/dist/state/values/untracked.d.cts +0 -1
  171. package/dist/state/values/untracked.d.cts.map +1 -1
  172. package/dist/state/values/untracked.d.ts +0 -1
  173. package/dist/state/values/untracked.d.ts.map +1 -1
  174. package/dist/utils.d.cts.map +1 -1
  175. package/dist/utils.d.ts.map +1 -1
  176. package/dist/web.d.ts +3 -0
  177. package/dist/writer.d.cts.map +1 -1
  178. package/dist/writer.d.ts.map +1 -1
  179. package/package.json +4 -4
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.cjs";
2
2
 
3
3
  //#region src/channels/any_value.d.ts
4
-
5
4
  /**
6
5
  * Stores the last value received, assumes that if multiple values are received, they are all equal.
7
6
  *
@@ -1 +1 @@
1
- {"version":3,"file":"any_value.d.cts","names":["BaseChannel","AnyValue","Value"],"sources":["../../src/channels/any_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\n/**\n * Stores the last value received, assumes that if multiple values are received, they are all equal.\n *\n * Note: Unlike 'LastValue' if multiple nodes write to this channel in a single step, the values\n * will be continuously overwritten.\n */\nexport declare class AnyValue<Value> extends BaseChannel<Value, Value, Value> {\n lc_graph_name: string;\n value: [Value] | [];\n constructor();\n fromCheckpoint(checkpoint?: Value): this;\n update(values: Value[]): boolean;\n get(): Value;\n checkpoint(): Value;\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;;AAOA;;;;AAAuEE,cAAlDD,QAAkDC,CAAAA,KAAAA,CAAAA,SAA1BF,WAA0BE,CAAdA,KAAcA,EAAPA,KAAOA,EAAAA,KAAAA,CAAAA,CAAAA;eAE3DA,EAAAA,MAAAA;OAEoBA,EAAAA,CAFpBA,KAEoBA,CAAAA,GAAAA,EAAAA;aACbA,CAAAA;gBACRA,CAAAA,UAAAA,CAAAA,EAFqBA,KAErBA,CAAAA,EAAAA,IAAAA;QACOA,CAAAA,MAAAA,EAFCA,KAEDA,EAAAA,CAAAA,EAAAA,OAAAA;KAP2BF,CAAAA,CAAAA,EAMlCE,KANkCF;EAAW,UAAA,CAAA,CAAA,EAOtCE,KAPsC"}
1
+ {"version":3,"file":"any_value.d.cts","names":[],"sources":["../../src/channels/any_value.ts"],"mappings":";;;;;AASA;;;;cAAa,QAAA,gBAAwB,WAAA,CAAY,KAAA,EAAO,KAAA,EAAO,KAAA;EAC7D,aAAA;EAGA,KAAA,GAAQ,KAAA;EAER,WAAA,CAAA;EAIA,cAAA,CAAe,UAAA,GAAa,KAAA;EAQ5B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAYf,GAAA,CAAA,GAAO,KAAA;EAOP,UAAA,CAAA,GAAc,KAAA;EAOd,WAAA,CAAA;AAAA"}
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.js";
2
2
 
3
3
  //#region src/channels/any_value.d.ts
4
-
5
4
  /**
6
5
  * Stores the last value received, assumes that if multiple values are received, they are all equal.
7
6
  *
@@ -1 +1 @@
1
- {"version":3,"file":"any_value.d.ts","names":["BaseChannel","AnyValue","Value"],"sources":["../../src/channels/any_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\n/**\n * Stores the last value received, assumes that if multiple values are received, they are all equal.\n *\n * Note: Unlike 'LastValue' if multiple nodes write to this channel in a single step, the values\n * will be continuously overwritten.\n */\nexport declare class AnyValue<Value> extends BaseChannel<Value, Value, Value> {\n lc_graph_name: string;\n value: [Value] | [];\n constructor();\n fromCheckpoint(checkpoint?: Value): this;\n update(values: Value[]): boolean;\n get(): Value;\n checkpoint(): Value;\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;;AAOA;;;;AAAuEE,cAAlDD,QAAkDC,CAAAA,KAAAA,CAAAA,SAA1BF,WAA0BE,CAAdA,KAAcA,EAAPA,KAAOA,EAAAA,KAAAA,CAAAA,CAAAA;eAE3DA,EAAAA,MAAAA;OAEoBA,EAAAA,CAFpBA,KAEoBA,CAAAA,GAAAA,EAAAA;aACbA,CAAAA;gBACRA,CAAAA,UAAAA,CAAAA,EAFqBA,KAErBA,CAAAA,EAAAA,IAAAA;QACOA,CAAAA,MAAAA,EAFCA,KAEDA,EAAAA,CAAAA,EAAAA,OAAAA;KAP2BF,CAAAA,CAAAA,EAMlCE,KANkCF;EAAW,UAAA,CAAA,CAAA,EAOtCE,KAPsC"}
1
+ {"version":3,"file":"any_value.d.ts","names":[],"sources":["../../src/channels/any_value.ts"],"mappings":";;;;;AASA;;;;cAAa,QAAA,gBAAwB,WAAA,CAAY,KAAA,EAAO,KAAA,EAAO,KAAA;EAC7D,aAAA;EAGA,KAAA,GAAQ,KAAA;EAER,WAAA,CAAA;EAIA,cAAA,CAAe,UAAA,GAAa,KAAA;EAQ5B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAYf,GAAA,CAAA,GAAO,KAAA;EAOP,UAAA,CAAA,GAAc,KAAA;EAOd,WAAA,CAAA;AAAA"}
@@ -1 +1 @@
1
- {"version":3,"file":"base.d.cts","names":["ReadonlyCheckpoint","Checkpoint","isBaseChannel","BaseChannel","ValueType","UpdateType","CheckpointType","getOnlyChannels","Record","emptyChannels","Cc","createCheckpoint"],"sources":["../../src/channels/base.d.ts"],"sourcesContent":["import { ReadonlyCheckpoint, Checkpoint } from \"@langchain/langgraph-checkpoint\";\nexport declare function isBaseChannel(obj: unknown): obj is BaseChannel;\n/** @internal */\nexport declare abstract class BaseChannel<ValueType = unknown, UpdateType = unknown, CheckpointType = unknown> {\n ValueType: ValueType;\n UpdateType: UpdateType;\n /**\n * The name of the channel.\n */\n abstract lc_graph_name: string;\n /** @ignore */\n lg_is_channel: boolean;\n /**\n * Return a new identical channel, optionally initialized from a checkpoint.\n * Can be thought of as a \"restoration\" from a checkpoint which is a \"snapshot\" of the channel's state.\n *\n * @param {CheckpointType | undefined} checkpoint\n * @param {CheckpointType | undefined} initialValue\n * @returns {this}\n */\n abstract fromCheckpoint(checkpoint?: CheckpointType): this;\n /**\n * Update the channel's value with the given sequence of updates.\n * The order of the updates in the sequence is arbitrary.\n * This method is called by Pregel for all channels at the end of each step.\n * If there are no updates, it is called with an empty sequence.\n *\n * Raises InvalidUpdateError if the sequence of updates is invalid.\n * Returns True if the channel was updated, False otherwise.\n *\n * @throws {InvalidUpdateError} if the sequence of updates is invalid.\n * @param {Array<UpdateType>} values\n * @returns {void}\n */\n abstract update(values: UpdateType[]): boolean;\n /**\n * Return the current value of the channel.\n *\n * @throws {EmptyChannelError} if the channel is empty (never updated yet).\n * @returns {ValueType}\n */\n abstract get(): ValueType;\n /**\n * Return a string representation of the channel's current state.\n *\n * @throws {EmptyChannelError} if the channel is empty (never updated yet), or doesn't support checkpoints.\n * @returns {CheckpointType | undefined}\n */\n abstract checkpoint(): CheckpointType | undefined;\n /**\n * Mark the current value of the channel as consumed. By default, no-op.\n * A channel can use this method to modify its state, preventing the value\n * from being consumed again.\n *\n * Returns True if the channel was updated, False otherwise.\n */\n consume(): boolean;\n /**\n * Notify the channel that the Pregel run is finishing. By default, no-op.\n * A channel can use this method to modify its state, preventing finish.\n *\n * Returns True if the channel was updated, False otherwise.\n */\n finish(): boolean;\n /**\n * Return True if the channel is available (not empty), False otherwise.\n * Subclasses should override this method to provide a more efficient\n * implementation than calling get() and catching EmptyChannelError.\n */\n isAvailable(): boolean;\n /**\n * Compare this channel with another channel for equality.\n * Used to determine if two channels with the same key are semantically equivalent.\n * Subclasses should override this method to provide a meaningful comparison.\n *\n * @param {BaseChannel} other - The other channel to compare with.\n * @returns {boolean} True if the channels are equal, false otherwise.\n */\n equals(other: BaseChannel): boolean;\n}\nexport declare function getOnlyChannels(channels: Record<string, BaseChannel>): Record<string, BaseChannel>;\nexport declare function emptyChannels<Cc extends Record<string, BaseChannel>>(channels: Cc, checkpoint: ReadonlyCheckpoint): Cc;\nexport declare function createCheckpoint<ValueType>(checkpoint: ReadonlyCheckpoint, channels: Record<string, BaseChannel<ValueType>> | undefined, step: number, options?: {\n id?: string;\n}): Checkpoint;\n"],"mappings":";;;;AAG8BG,uBAAAA,WAAW,CAAA,YAAA,OAAA,EAAA,aAAA,OAAA,EAAA,iBAAA,OAAA,CAAA,CAAA;EAAA,SAAA,EAC1BC,SAD0B;YAC1BA,EACCC,UADDD;;;;WAqCKA,aAAAA,EAAAA,MAAAA;;eAqCFD,EAAAA,OAAAA;EAAW;AAG7B;;;;;;;EAA+H,SAAA,cAAA,CAAA,UAAA,CAAA,EA7DtFG,cA6DsF,CAAA,EAAA,IAAA;EACvGK;;;;;;;;;;;;;0BAhDIN;;;;;;;kBAORD;;;;;;;yBAOOE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;gBA8BTH;;iBAGMM,yBAAyBD,eAAeL,wBAAwBO,gBAAgBV,qBAAqBU;iBACrGC,wCAAwCX,8BAA8BQ,eAAeL,YAAYC;;IAErHH"}
1
+ {"version":3,"file":"base.d.cts","names":[],"sources":["../../src/channels/base.ts"],"mappings":";;;;uBAYsB,WAAA;EAKpB,SAAA,EAAW,SAAA;EAEX,UAAA,EAAY,UAAA;EAFD;;;EAAA,SAOF,aAAA;EAoCO;EAjChB,aAAA;EA0Fc;;;;;;;;EAAA,SAhFL,cAAA,CAAe,UAAA,GAAa,cAAA;EAlBzB;;;;;;;;;;;;;EAAA,SAiCH,MAAA,CAAO,MAAA,EAAQ,UAAA;EAmCxB;;;;;;EAAA,SA3BS,GAAA,CAAA,GAAO,SAAA;EAgFF;;;;;;EAAA,SAxEL,UAAA,CAAA,GAAc,cAAA;EA2EtB;;;;;;;EAlED,OAAA,CAAA;EAiEY;;;;;AAcd;EArEE,MAAA,CAAA;EAqE8B;;;;;EA5D9B,WAAA,CAAA;EAiEW;;;;;;;;EA5CX,MAAA,CAAO,KAAA,EAAO,WAAA;AAAA;AAAA,iBAuBA,aAAA,YAAyB,MAAA,SAAe,WAAA,EAAA,CACtD,QAAA,EAAU,EAAA,EACV,UAAA,EAAY,kBAAA,GACX,EAAA;AAAA,iBAaa,gBAAA,WAAA,CACd,UAAA,EAAY,kBAAA,EACZ,QAAA,EAAU,MAAA,SAAe,WAAA,CAAY,SAAA,gBACrC,IAAA,UACA,OAAA;EAAY,EAAA;AAAA,IACX,UAAA"}
@@ -1 +1 @@
1
- {"version":3,"file":"base.d.ts","names":["ReadonlyCheckpoint","Checkpoint","isBaseChannel","BaseChannel","ValueType","UpdateType","CheckpointType","getOnlyChannels","Record","emptyChannels","Cc","createCheckpoint"],"sources":["../../src/channels/base.d.ts"],"sourcesContent":["import { ReadonlyCheckpoint, Checkpoint } from \"@langchain/langgraph-checkpoint\";\nexport declare function isBaseChannel(obj: unknown): obj is BaseChannel;\n/** @internal */\nexport declare abstract class BaseChannel<ValueType = unknown, UpdateType = unknown, CheckpointType = unknown> {\n ValueType: ValueType;\n UpdateType: UpdateType;\n /**\n * The name of the channel.\n */\n abstract lc_graph_name: string;\n /** @ignore */\n lg_is_channel: boolean;\n /**\n * Return a new identical channel, optionally initialized from a checkpoint.\n * Can be thought of as a \"restoration\" from a checkpoint which is a \"snapshot\" of the channel's state.\n *\n * @param {CheckpointType | undefined} checkpoint\n * @param {CheckpointType | undefined} initialValue\n * @returns {this}\n */\n abstract fromCheckpoint(checkpoint?: CheckpointType): this;\n /**\n * Update the channel's value with the given sequence of updates.\n * The order of the updates in the sequence is arbitrary.\n * This method is called by Pregel for all channels at the end of each step.\n * If there are no updates, it is called with an empty sequence.\n *\n * Raises InvalidUpdateError if the sequence of updates is invalid.\n * Returns True if the channel was updated, False otherwise.\n *\n * @throws {InvalidUpdateError} if the sequence of updates is invalid.\n * @param {Array<UpdateType>} values\n * @returns {void}\n */\n abstract update(values: UpdateType[]): boolean;\n /**\n * Return the current value of the channel.\n *\n * @throws {EmptyChannelError} if the channel is empty (never updated yet).\n * @returns {ValueType}\n */\n abstract get(): ValueType;\n /**\n * Return a string representation of the channel's current state.\n *\n * @throws {EmptyChannelError} if the channel is empty (never updated yet), or doesn't support checkpoints.\n * @returns {CheckpointType | undefined}\n */\n abstract checkpoint(): CheckpointType | undefined;\n /**\n * Mark the current value of the channel as consumed. By default, no-op.\n * A channel can use this method to modify its state, preventing the value\n * from being consumed again.\n *\n * Returns True if the channel was updated, False otherwise.\n */\n consume(): boolean;\n /**\n * Notify the channel that the Pregel run is finishing. By default, no-op.\n * A channel can use this method to modify its state, preventing finish.\n *\n * Returns True if the channel was updated, False otherwise.\n */\n finish(): boolean;\n /**\n * Return True if the channel is available (not empty), False otherwise.\n * Subclasses should override this method to provide a more efficient\n * implementation than calling get() and catching EmptyChannelError.\n */\n isAvailable(): boolean;\n /**\n * Compare this channel with another channel for equality.\n * Used to determine if two channels with the same key are semantically equivalent.\n * Subclasses should override this method to provide a meaningful comparison.\n *\n * @param {BaseChannel} other - The other channel to compare with.\n * @returns {boolean} True if the channels are equal, false otherwise.\n */\n equals(other: BaseChannel): boolean;\n}\nexport declare function getOnlyChannels(channels: Record<string, BaseChannel>): Record<string, BaseChannel>;\nexport declare function emptyChannels<Cc extends Record<string, BaseChannel>>(channels: Cc, checkpoint: ReadonlyCheckpoint): Cc;\nexport declare function createCheckpoint<ValueType>(checkpoint: ReadonlyCheckpoint, channels: Record<string, BaseChannel<ValueType>> | undefined, step: number, options?: {\n id?: string;\n}): Checkpoint;\n"],"mappings":";;;;AAG8BG,uBAAAA,WAAW,CAAA,YAAA,OAAA,EAAA,aAAA,OAAA,EAAA,iBAAA,OAAA,CAAA,CAAA;EAAA,SAAA,EAC1BC,SAD0B;YAC1BA,EACCC,UADDD;;;;WAqCKA,aAAAA,EAAAA,MAAAA;;eAqCFD,EAAAA,OAAAA;EAAW;AAG7B;;;;;;;EAA+H,SAAA,cAAA,CAAA,UAAA,CAAA,EA7DtFG,cA6DsF,CAAA,EAAA,IAAA;EACvGK;;;;;;;;;;;;;0BAhDIN;;;;;;;kBAORD;;;;;;;yBAOOE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;gBA8BTH;;iBAGMM,yBAAyBD,eAAeL,wBAAwBO,gBAAgBV,qBAAqBU;iBACrGC,wCAAwCX,8BAA8BQ,eAAeL,YAAYC;;IAErHH"}
1
+ {"version":3,"file":"base.d.ts","names":[],"sources":["../../src/channels/base.ts"],"mappings":";;;;uBAYsB,WAAA;EAKpB,SAAA,EAAW,SAAA;EAEX,UAAA,EAAY,UAAA;EAFD;;;EAAA,SAOF,aAAA;EAoCO;EAjChB,aAAA;EA0Fc;;;;;;;;EAAA,SAhFL,cAAA,CAAe,UAAA,GAAa,cAAA;EAlBzB;;;;;;;;;;;;;EAAA,SAiCH,MAAA,CAAO,MAAA,EAAQ,UAAA;EAmCxB;;;;;;EAAA,SA3BS,GAAA,CAAA,GAAO,SAAA;EAgFF;;;;;;EAAA,SAxEL,UAAA,CAAA,GAAc,cAAA;EA2EtB;;;;;;;EAlED,OAAA,CAAA;EAiEY;;;;;AAcd;EArEE,MAAA,CAAA;EAqE8B;;;;;EA5D9B,WAAA,CAAA;EAiEW;;;;;;;;EA5CX,MAAA,CAAO,KAAA,EAAO,WAAA;AAAA;AAAA,iBAuBA,aAAA,YAAyB,MAAA,SAAe,WAAA,EAAA,CACtD,QAAA,EAAU,EAAA,EACV,UAAA,EAAY,kBAAA,GACX,EAAA;AAAA,iBAaa,gBAAA,WAAA,CACd,UAAA,EAAY,kBAAA,EACZ,QAAA,EAAU,MAAA,SAAe,WAAA,CAAY,SAAA,gBACrC,IAAA,UACA,OAAA;EAAY,EAAA;AAAA,IACX,UAAA"}
@@ -1 +1 @@
1
- {"version":3,"file":"binop.d.cts","names":["BaseChannel","BinaryOperator","ValueType","UpdateType","BinaryOperatorAggregate"],"sources":["../../src/channels/binop.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\nexport type BinaryOperator<ValueType, UpdateType> = (a: ValueType, b: UpdateType) => ValueType;\n/**\n * Stores the result of applying a binary operator to the current value and each new value.\n */\nexport declare class BinaryOperatorAggregate<ValueType, UpdateType = ValueType> extends BaseChannel<ValueType, UpdateType, ValueType> {\n lc_graph_name: string;\n value: ValueType | undefined;\n operator: BinaryOperator<ValueType, UpdateType>;\n initialValueFactory?: () => ValueType;\n constructor(operator: BinaryOperator<ValueType, UpdateType>, initialValueFactory?: () => ValueType);\n fromCheckpoint(checkpoint?: ValueType): this;\n update(values: UpdateType[]): boolean;\n get(): ValueType;\n checkpoint(): ValueType;\n isAvailable(): boolean;\n /**\n * Compare this channel with another channel for equality.\n * Two BinaryOperatorAggregate channels are equal if they have the same operator function.\n * This follows the Python implementation which compares operator references.\n */\n equals(other: BaseChannel): boolean;\n}\n"],"mappings":";;;KACYC,4CAA4CC,cAAcC,eAAeD;;AAArF;;AAAwDA,cAInCE,uBAJmCF,CAAAA,SAAAA,EAAAA,aAIaA,SAJbA,CAAAA,SAIgCF,WAJhCE,CAI4CA,SAJ5CA,EAIuDC,UAJvDD,EAImEA,SAJnEA,CAAAA,CAAAA;eAAcC,EAAAA,MAAAA;OAAeD,EAM1EA,SAN0EA,GAAAA,SAAAA;EAAS,QAAA,EAOhFD,cAPgF,CAOjEC,SAPiE,EAOtDC,UAPsD,CAAA;EAIzEC,mBAAAA,CAAAA,EAAAA,GAAAA,GAIWF,SAJY;EAAA,WAAA,CAAA,QAAA,EAKlBD,cALkB,CAKHC,SALG,EAKQC,UALR,CAAA,EAAA,mBAAA,CAAA,EAAA,GAAA,GAKiDD,SALjD;gBAAyBA,CAAAA,UAAAA,CAAAA,EAMrCA,SANqCA,CAAAA,EAAAA,IAAAA;QAA+BA,CAAAA,MAAAA,EAOjFC,UAPiFD,EAAAA,CAAAA,EAAAA,OAAAA;KAAWC,CAAAA,CAAAA,EAQpGD,SARoGC;YAAYD,CAAAA,CAAAA,EASzGA,SATyGA;aAEhHA,CAAAA,CAAAA,EAAAA,OAAAA;;;;;;QAGyCC,CAAAA,KAAAA,EAWlCH,WAXkCG,CAAAA,EAAAA,OAAAA"}
1
+ {"version":3,"file":"binop.d.cts","names":[],"sources":["../../src/channels/binop.ts"],"mappings":";;;KAGY,cAAA,2BACV,CAAA,EAAG,SAAA,EACH,CAAA,EAAG,UAAA,KACA,SAAA;;AAHL;;cAca,uBAAA,yBAEE,SAAA,UACL,WAAA,CAAY,SAAA,EAAW,UAAA,EAAY,SAAA;EAC3C,aAAA;EAEA,KAAA,EAAO,SAAA;EAEP,QAAA,EAAU,cAAA,CAAe,SAAA,EAAW,UAAA;EAEpC,mBAAA,SAA4B,SAAA;EAE5B,WAAA,CACE,QAAA,EAAU,cAAA,CAAe,SAAA,EAAW,UAAA,GACpC,mBAAA,SAA4B,SAAA;EASvB,cAAA,CAAe,UAAA,GAAa,SAAA;EAW5B,MAAA,CAAO,MAAA,EAAQ,UAAA;EAiBf,GAAA,CAAA,GAAO,SAAA;EAOP,UAAA,CAAA,GAAc,SAAA;EAOrB,WAAA,CAAA;EA7EA;;;;AAYF;EA0EE,MAAA,CAAO,KAAA,EAAO,WAAA;AAAA"}
@@ -1 +1 @@
1
- {"version":3,"file":"binop.d.ts","names":["BaseChannel","BinaryOperator","ValueType","UpdateType","BinaryOperatorAggregate"],"sources":["../../src/channels/binop.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\nexport type BinaryOperator<ValueType, UpdateType> = (a: ValueType, b: UpdateType) => ValueType;\n/**\n * Stores the result of applying a binary operator to the current value and each new value.\n */\nexport declare class BinaryOperatorAggregate<ValueType, UpdateType = ValueType> extends BaseChannel<ValueType, UpdateType, ValueType> {\n lc_graph_name: string;\n value: ValueType | undefined;\n operator: BinaryOperator<ValueType, UpdateType>;\n initialValueFactory?: () => ValueType;\n constructor(operator: BinaryOperator<ValueType, UpdateType>, initialValueFactory?: () => ValueType);\n fromCheckpoint(checkpoint?: ValueType): this;\n update(values: UpdateType[]): boolean;\n get(): ValueType;\n checkpoint(): ValueType;\n isAvailable(): boolean;\n /**\n * Compare this channel with another channel for equality.\n * Two BinaryOperatorAggregate channels are equal if they have the same operator function.\n * This follows the Python implementation which compares operator references.\n */\n equals(other: BaseChannel): boolean;\n}\n"],"mappings":";;;KACYC,4CAA4CC,cAAcC,eAAeD;;AAArF;;AAAwDA,cAInCE,uBAJmCF,CAAAA,SAAAA,EAAAA,aAIaA,SAJbA,CAAAA,SAIgCF,WAJhCE,CAI4CA,SAJ5CA,EAIuDC,UAJvDD,EAImEA,SAJnEA,CAAAA,CAAAA;eAAcC,EAAAA,MAAAA;OAAeD,EAM1EA,SAN0EA,GAAAA,SAAAA;EAAS,QAAA,EAOhFD,cAPgF,CAOjEC,SAPiE,EAOtDC,UAPsD,CAAA;EAIzEC,mBAAAA,CAAAA,EAAAA,GAAAA,GAIWF,SAJY;EAAA,WAAA,CAAA,QAAA,EAKlBD,cALkB,CAKHC,SALG,EAKQC,UALR,CAAA,EAAA,mBAAA,CAAA,EAAA,GAAA,GAKiDD,SALjD;gBAAyBA,CAAAA,UAAAA,CAAAA,EAMrCA,SANqCA,CAAAA,EAAAA,IAAAA;QAA+BA,CAAAA,MAAAA,EAOjFC,UAPiFD,EAAAA,CAAAA,EAAAA,OAAAA;KAAWC,CAAAA,CAAAA,EAQpGD,SARoGC;YAAYD,CAAAA,CAAAA,EASzGA,SATyGA;aAEhHA,CAAAA,CAAAA,EAAAA,OAAAA;;;;;;QAGyCC,CAAAA,KAAAA,EAWlCH,WAXkCG,CAAAA,EAAAA,OAAAA"}
1
+ {"version":3,"file":"binop.d.ts","names":[],"sources":["../../src/channels/binop.ts"],"mappings":";;;KAGY,cAAA,2BACV,CAAA,EAAG,SAAA,EACH,CAAA,EAAG,UAAA,KACA,SAAA;;AAHL;;cAca,uBAAA,yBAEE,SAAA,UACL,WAAA,CAAY,SAAA,EAAW,UAAA,EAAY,SAAA;EAC3C,aAAA;EAEA,KAAA,EAAO,SAAA;EAEP,QAAA,EAAU,cAAA,CAAe,SAAA,EAAW,UAAA;EAEpC,mBAAA,SAA4B,SAAA;EAE5B,WAAA,CACE,QAAA,EAAU,cAAA,CAAe,SAAA,EAAW,UAAA,GACpC,mBAAA,SAA4B,SAAA;EASvB,cAAA,CAAe,UAAA,GAAa,SAAA;EAW5B,MAAA,CAAO,MAAA,EAAQ,UAAA;EAiBf,GAAA,CAAA,GAAO,SAAA;EAOP,UAAA,CAAA,GAAc,SAAA;EAOrB,WAAA,CAAA;EA7EA;;;;AAYF;EA0EE,MAAA,CAAO,KAAA,EAAO,WAAA;AAAA"}
@@ -25,16 +25,6 @@ declare class DynamicBarrierValue<Value> extends BaseChannel<void, Value | WaitF
25
25
  checkpoint(): [Value[] | undefined, Value[]];
26
26
  isAvailable(): boolean;
27
27
  }
28
- /**
29
- * A channel that switches between two states with an additional finished flag
30
- *
31
- * - in the "priming" state it can't be read from.
32
- * - if it receives a WaitForNames update, it switches to the "waiting" state.
33
- * - in the "waiting" state it collects named values until all are received.
34
- * - once all named values are received, and the finished flag is set, it can be read once, and it switches
35
- * back to the "priming" state.
36
- * @internal
37
- */
38
28
  //#endregion
39
29
  export { DynamicBarrierValue, WaitForNames };
40
30
  //# sourceMappingURL=dynamic_barrier_value.d.cts.map
@@ -1 +1 @@
1
- {"version":3,"file":"dynamic_barrier_value.d.cts","names":["BaseChannel","WaitForNames","Value","DynamicBarrierValue","Set","DynamicBarrierValueAfterFinish"],"sources":["../../src/channels/dynamic_barrier_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\nexport interface WaitForNames<Value> {\n __names: Value[];\n}\n/**\n * A channel that switches between two states\n *\n * - in the \"priming\" state it can't be read from.\n * - if it receives a WaitForNames update, it switches to the \"waiting\" state.\n * - in the \"waiting\" state it collects named values until all are received.\n * - once all named values are received, it can be read once, and it switches\n * back to the \"priming\" state.\n */\nexport declare class DynamicBarrierValue<Value> extends BaseChannel<void, Value | WaitForNames<Value>, [\n Value[] | undefined,\n Value[]\n]> {\n lc_graph_name: string;\n names?: Set<Value>;\n seen: Set<Value>;\n constructor();\n fromCheckpoint(checkpoint?: [Value[] | undefined, Value[]]): this;\n update(values: (Value | WaitForNames<Value>)[]): boolean;\n consume(): boolean;\n get(): void;\n checkpoint(): [Value[] | undefined, Value[]];\n isAvailable(): boolean;\n}\n/**\n * A channel that switches between two states with an additional finished flag\n *\n * - in the \"priming\" state it can't be read from.\n * - if it receives a WaitForNames update, it switches to the \"waiting\" state.\n * - in the \"waiting\" state it collects named values until all are received.\n * - once all named values are received, and the finished flag is set, it can be read once, and it switches\n * back to the \"priming\" state.\n * @internal\n */\nexport declare class DynamicBarrierValueAfterFinish<Value> extends BaseChannel<void, Value | WaitForNames<Value>, [\n Value[] | undefined,\n Value[],\n boolean\n]> {\n lc_graph_name: string;\n names?: Set<Value>;\n seen: Set<Value>;\n finished: boolean;\n constructor();\n fromCheckpoint(checkpoint?: [Value[] | undefined, Value[], boolean]): this;\n update(values: (Value | WaitForNames<Value>)[]): boolean;\n consume(): boolean;\n finish(): boolean;\n get(): void;\n checkpoint(): [Value[] | undefined, Value[], boolean];\n isAvailable(): boolean;\n}\n"],"mappings":";;;UACiBC;WACJC;AADb;AAYA;;;;;;;;;AAMcA,cANOC,mBAMPD,CAAAA,KAAAA,CAAAA,SAN0CF,WAM1CE,CAAAA,IAAAA,EAN4DA,KAM5DA,GANoED,YAMpEC,CANiFA,KAMjFA,CAAAA,EAAAA,CALVA,KAKME,EAAAA,GAAAA,SAAAA,EAJNF,KAM6BA,EAAAA;eACbA,EAAAA,MAAAA;OAAqBA,CAAAA,EAJ7BE,GAI6BF,CAJzBA,KAIyBA,CAAAA;MAAbD,EAHlBG,GAGkBH,CAHdC,KAGcD,CAAAA;aAGTC,CAAAA;gBAAqBA,CAAAA,UAAAA,CAAAA,EAAAA,CAJPA,KAIOA,EAAAA,GAAAA,SAAAA,EAJcA,KAIdA,EAAAA,CAAAA,CAAAA,EAAAA,IAAAA;QAZgBF,CAAAA,MAAAA,EAAAA,CASpCE,KAToCF,GAS5BC,YAT4BD,CASfE,KATeF,CAAAA,CAAAA,EAAAA,CAAAA,EAAAA,OAAAA;EAAW,OAAA,CAAA,CAAA,EAAA,OAAA;;iBAYhDE,qBAAqBA"}
1
+ {"version":3,"file":"dynamic_barrier_value.d.cts","names":[],"sources":["../../src/channels/dynamic_barrier_value.ts"],"mappings":";;;UAIiB,YAAA;EACf,OAAA,EAAS,KAAA;AAAA;;;;;;;;;AAkBX;cAAa,mBAAA,gBAAmC,WAAA,OAE9C,KAAA,GAAQ,YAAA,CAAa,KAAA,IACpB,KAAA,gBAAqB,KAAA;EAEtB,aAAA;EAEA,KAAA,GAAQ,GAAA,CAAI,KAAA;EAEZ,IAAA,EAAM,GAAA,CAAI,KAAA;EAEV,WAAA,CAAA;EAMA,cAAA,CAAe,UAAA,IAAc,KAAA,gBAAqB,KAAA;EASlD,MAAA,CAAO,MAAA,GAAS,KAAA,GAAQ,YAAA,CAAa,KAAA;EA4BrC,OAAA,CAAA;EAWA,GAAA,CAAA;EAOA,UAAA,CAAA,IAAe,KAAA,gBAAqB,KAAA;EAIpC,WAAA,CAAA;AAAA"}
@@ -25,16 +25,6 @@ declare class DynamicBarrierValue<Value> extends BaseChannel<void, Value | WaitF
25
25
  checkpoint(): [Value[] | undefined, Value[]];
26
26
  isAvailable(): boolean;
27
27
  }
28
- /**
29
- * A channel that switches between two states with an additional finished flag
30
- *
31
- * - in the "priming" state it can't be read from.
32
- * - if it receives a WaitForNames update, it switches to the "waiting" state.
33
- * - in the "waiting" state it collects named values until all are received.
34
- * - once all named values are received, and the finished flag is set, it can be read once, and it switches
35
- * back to the "priming" state.
36
- * @internal
37
- */
38
28
  //#endregion
39
29
  export { DynamicBarrierValue, WaitForNames };
40
30
  //# sourceMappingURL=dynamic_barrier_value.d.ts.map
@@ -1 +1 @@
1
- {"version":3,"file":"dynamic_barrier_value.d.ts","names":["BaseChannel","WaitForNames","Value","DynamicBarrierValue","Set","DynamicBarrierValueAfterFinish"],"sources":["../../src/channels/dynamic_barrier_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\nexport interface WaitForNames<Value> {\n __names: Value[];\n}\n/**\n * A channel that switches between two states\n *\n * - in the \"priming\" state it can't be read from.\n * - if it receives a WaitForNames update, it switches to the \"waiting\" state.\n * - in the \"waiting\" state it collects named values until all are received.\n * - once all named values are received, it can be read once, and it switches\n * back to the \"priming\" state.\n */\nexport declare class DynamicBarrierValue<Value> extends BaseChannel<void, Value | WaitForNames<Value>, [\n Value[] | undefined,\n Value[]\n]> {\n lc_graph_name: string;\n names?: Set<Value>;\n seen: Set<Value>;\n constructor();\n fromCheckpoint(checkpoint?: [Value[] | undefined, Value[]]): this;\n update(values: (Value | WaitForNames<Value>)[]): boolean;\n consume(): boolean;\n get(): void;\n checkpoint(): [Value[] | undefined, Value[]];\n isAvailable(): boolean;\n}\n/**\n * A channel that switches between two states with an additional finished flag\n *\n * - in the \"priming\" state it can't be read from.\n * - if it receives a WaitForNames update, it switches to the \"waiting\" state.\n * - in the \"waiting\" state it collects named values until all are received.\n * - once all named values are received, and the finished flag is set, it can be read once, and it switches\n * back to the \"priming\" state.\n * @internal\n */\nexport declare class DynamicBarrierValueAfterFinish<Value> extends BaseChannel<void, Value | WaitForNames<Value>, [\n Value[] | undefined,\n Value[],\n boolean\n]> {\n lc_graph_name: string;\n names?: Set<Value>;\n seen: Set<Value>;\n finished: boolean;\n constructor();\n fromCheckpoint(checkpoint?: [Value[] | undefined, Value[], boolean]): this;\n update(values: (Value | WaitForNames<Value>)[]): boolean;\n consume(): boolean;\n finish(): boolean;\n get(): void;\n checkpoint(): [Value[] | undefined, Value[], boolean];\n isAvailable(): boolean;\n}\n"],"mappings":";;;UACiBC;WACJC;AADb;AAYA;;;;;;;;;AAMcA,cANOC,mBAMPD,CAAAA,KAAAA,CAAAA,SAN0CF,WAM1CE,CAAAA,IAAAA,EAN4DA,KAM5DA,GANoED,YAMpEC,CANiFA,KAMjFA,CAAAA,EAAAA,CALVA,KAKME,EAAAA,GAAAA,SAAAA,EAJNF,KAM6BA,EAAAA;eACbA,EAAAA,MAAAA;OAAqBA,CAAAA,EAJ7BE,GAI6BF,CAJzBA,KAIyBA,CAAAA;MAAbD,EAHlBG,GAGkBH,CAHdC,KAGcD,CAAAA;aAGTC,CAAAA;gBAAqBA,CAAAA,UAAAA,CAAAA,EAAAA,CAJPA,KAIOA,EAAAA,GAAAA,SAAAA,EAJcA,KAIdA,EAAAA,CAAAA,CAAAA,EAAAA,IAAAA;QAZgBF,CAAAA,MAAAA,EAAAA,CASpCE,KAToCF,GAS5BC,YAT4BD,CASfE,KATeF,CAAAA,CAAAA,EAAAA,CAAAA,EAAAA,OAAAA;EAAW,OAAA,CAAA,CAAA,EAAA,OAAA;;iBAYhDE,qBAAqBA"}
1
+ {"version":3,"file":"dynamic_barrier_value.d.ts","names":[],"sources":["../../src/channels/dynamic_barrier_value.ts"],"mappings":";;;UAIiB,YAAA;EACf,OAAA,EAAS,KAAA;AAAA;;;;;;;;;AAkBX;cAAa,mBAAA,gBAAmC,WAAA,OAE9C,KAAA,GAAQ,YAAA,CAAa,KAAA,IACpB,KAAA,gBAAqB,KAAA;EAEtB,aAAA;EAEA,KAAA,GAAQ,GAAA,CAAI,KAAA;EAEZ,IAAA,EAAM,GAAA,CAAI,KAAA;EAEV,WAAA,CAAA;EAMA,cAAA,CAAe,UAAA,IAAc,KAAA,gBAAqB,KAAA;EASlD,MAAA,CAAO,MAAA,GAAS,KAAA,GAAQ,YAAA,CAAa,KAAA;EA4BrC,OAAA,CAAA;EAWA,GAAA,CAAA;EAOA,UAAA,CAAA,IAAe,KAAA,gBAAqB,KAAA;EAIpC,WAAA,CAAA;AAAA"}
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.cjs";
2
2
 
3
3
  //#region src/channels/ephemeral_value.d.ts
4
-
5
4
  /**
6
5
  * Stores the value received in the step immediately preceding, clears after.
7
6
  */
@@ -1 +1 @@
1
- {"version":3,"file":"ephemeral_value.d.cts","names":["BaseChannel","EphemeralValue","Value"],"sources":["../../src/channels/ephemeral_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\n/**\n * Stores the value received in the step immediately preceding, clears after.\n */\nexport declare class EphemeralValue<Value> extends BaseChannel<Value, Value, Value> {\n lc_graph_name: string;\n guard: boolean;\n value: [Value] | [];\n constructor(guard?: boolean);\n fromCheckpoint(checkpoint?: Value): this;\n update(values: Value[]): boolean;\n get(): Value;\n checkpoint(): Value;\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;;AAIA;AAAmC,cAAdC,cAAc,CAAA,KAAA,CAAA,SAAgBD,WAAhB,CAA4BE,KAA5B,EAAmCA,KAAnC,EAA0CA,KAA1C,CAAA,CAAA;eAA4BA,EAAAA,MAAAA;OAAOA,EAAAA,OAAAA;OAAOA,EAAAA,CAGjEA,KAHiEA,CAAAA,GAAAA,EAAAA;aAGjEA,CAAAA,KAAAA,CAAAA,EAAAA,OAAAA;gBAEoBA,CAAAA,UAAAA,CAAAA,EAAAA,KAAAA,CAAAA,EAAAA,IAAAA;QACbA,CAAAA,MAAAA,EAAAA,KAAAA,EAAAA,CAAAA,EAAAA,OAAAA;KACRA,CAAAA,CAAAA,EAAAA,KAAAA;YACOA,CAAAA,CAAAA,EAAAA,KAAAA;aARiCF,CAAAA,CAAAA,EAAAA,OAAAA"}
1
+ {"version":3,"file":"ephemeral_value.d.cts","names":[],"sources":["../../src/channels/ephemeral_value.ts"],"mappings":";;;;;AAMA;cAAa,cAAA,gBAA8B,WAAA,CAAY,KAAA,EAAO,KAAA,EAAO,KAAA;EACnE,aAAA;EAEA,KAAA;EAGA,KAAA,GAAQ,KAAA;EAER,WAAA,CAAY,KAAA;EAKZ,cAAA,CAAe,UAAA,GAAa,KAAA;EAQ5B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAkBf,GAAA,CAAA,GAAO,KAAA;EAOP,UAAA,CAAA,GAAc,KAAA;EAOd,WAAA,CAAA;AAAA"}
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.js";
2
2
 
3
3
  //#region src/channels/ephemeral_value.d.ts
4
-
5
4
  /**
6
5
  * Stores the value received in the step immediately preceding, clears after.
7
6
  */
@@ -1 +1 @@
1
- {"version":3,"file":"ephemeral_value.d.ts","names":["BaseChannel","EphemeralValue","Value"],"sources":["../../src/channels/ephemeral_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\n/**\n * Stores the value received in the step immediately preceding, clears after.\n */\nexport declare class EphemeralValue<Value> extends BaseChannel<Value, Value, Value> {\n lc_graph_name: string;\n guard: boolean;\n value: [Value] | [];\n constructor(guard?: boolean);\n fromCheckpoint(checkpoint?: Value): this;\n update(values: Value[]): boolean;\n get(): Value;\n checkpoint(): Value;\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;;AAIA;AAAmC,cAAdC,cAAc,CAAA,KAAA,CAAA,SAAgBD,WAAhB,CAA4BE,KAA5B,EAAmCA,KAAnC,EAA0CA,KAA1C,CAAA,CAAA;eAA4BA,EAAAA,MAAAA;OAAOA,EAAAA,OAAAA;OAAOA,EAAAA,CAGjEA,KAHiEA,CAAAA,GAAAA,EAAAA;aAGjEA,CAAAA,KAAAA,CAAAA,EAAAA,OAAAA;gBAEoBA,CAAAA,UAAAA,CAAAA,EAAAA,KAAAA,CAAAA,EAAAA,IAAAA;QACbA,CAAAA,MAAAA,EAAAA,KAAAA,EAAAA,CAAAA,EAAAA,OAAAA;KACRA,CAAAA,CAAAA,EAAAA,KAAAA;YACOA,CAAAA,CAAAA,EAAAA,KAAAA;aARiCF,CAAAA,CAAAA,EAAAA,OAAAA"}
1
+ {"version":3,"file":"ephemeral_value.d.ts","names":[],"sources":["../../src/channels/ephemeral_value.ts"],"mappings":";;;;;AAMA;cAAa,cAAA,gBAA8B,WAAA,CAAY,KAAA,EAAO,KAAA,EAAO,KAAA;EACnE,aAAA;EAEA,KAAA;EAGA,KAAA,GAAQ,KAAA;EAER,WAAA,CAAY,KAAA;EAKZ,cAAA,CAAe,UAAA,GAAa,KAAA;EAQ5B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAkBf,GAAA,CAAA,GAAO,KAAA;EAOP,UAAA,CAAA,GAAc,KAAA;EAOd,WAAA,CAAA;AAAA"}
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.cjs";
2
2
 
3
3
  //#region src/channels/last_value.d.ts
4
-
5
4
  /**
6
5
  * Stores the last value received, can receive at most one value per step.
7
6
  *
@@ -1 +1 @@
1
- {"version":3,"file":"last_value.d.cts","names":["BaseChannel","LastValue","Value","LastValueAfterFinish"],"sources":["../../src/channels/last_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\n/**\n * Stores the last value received, can receive at most one value per step.\n *\n * Since `update` is only called once per step and value can only be of length 1,\n * LastValue always stores the last value of a single node. If multiple nodes attempt to\n * write to this channel in a single step, an error will be thrown.\n * @internal\n */\nexport declare class LastValue<Value> extends BaseChannel<Value, Value, Value> {\n protected initialValueFactory?: (() => Value) | undefined;\n lc_graph_name: string;\n value: [Value] | [];\n constructor(initialValueFactory?: (() => Value) | undefined);\n fromCheckpoint(checkpoint?: Value): this;\n update(values: Value[]): boolean;\n get(): Value;\n checkpoint(): Value;\n isAvailable(): boolean;\n}\n/**\n * Stores the last value received, but only made available after finish().\n * Once made available, clears the value.\n */\nexport declare class LastValueAfterFinish<Value> extends BaseChannel<Value, Value, [\n Value,\n boolean\n]> {\n lc_graph_name: string;\n value: [Value] | [];\n finished: boolean;\n fromCheckpoint(checkpoint?: [Value, boolean]): this;\n update(values: Value[]): boolean;\n get(): Value;\n checkpoint(): [Value, boolean] | undefined;\n consume(): boolean;\n finish(): boolean;\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;;AASA;;;;;;AAGYE,cAHSD,SAGTC,CAAAA,KAAAA,CAAAA,SAHkCF,WAGlCE,CAH8CA,KAG9CA,EAHqDA,KAGrDA,EAH4DA,KAG5DA,CAAAA,CAAAA;YACiCA,mBAAAA,CAAAA,EAAAA,CAAAA,GAAAA,GAHFA,KAGEA,CAAAA,GAAAA,SAAAA;eACbA,EAAAA,MAAAA;OACbA,EAAAA,CAHPA,KAGOA,CAAAA,GAAAA,EAAAA;aACRA,CAAAA,mBAAAA,CAAAA,EAAAA,CAAAA,GAAAA,GAHkCA,KAGlCA,CAAAA,GAAAA,SAAAA;gBACOA,CAAAA,UAAAA,CAAAA,EAHcA,KAGdA,CAAAA,EAAAA,IAAAA;QAR4BF,CAAAA,MAAAA,EAM3BE,KAN2BF,EAAAA,CAAAA,EAAAA,OAAAA;EAAW,GAAA,CAAA,CAAA,EAO9CE,KAP8C;EAepCC,UAAAA,CAAAA,CAAAA,EAPHD,KAOGC;EAAoB,WAAA,CAAA,CAAA,EAAA,OAAA;;;;;;AAQtBD,cAREC,oBAQFD,CAAAA,KAAAA,CAAAA,SARsCF,WAQtCE,CARkDA,KAQlDA,EARyDA,KAQzDA,EAAAA,CAPfA,KAQOA,SACQA;EAViD,aAAA,EAAA,MAAA;UAKxDA;;+BAEqBA;iBACdA;SACRA;iBACQA"}
1
+ {"version":3,"file":"last_value.d.cts","names":[],"sources":["../../src/channels/last_value.ts"],"mappings":";;;;;AAWA;;;;;;cAAa,SAAA,gBAAyB,WAAA,CAAY,KAAA,EAAO,KAAA,EAAO,KAAA;EAAA,UAMxC,mBAAA,UAAoB,KAAA;EAL1C,aAAA;EAGA,KAAA,GAAQ,KAAA;EAER,WAAA,CAAsB,mBAAA,UAAoB,KAAA;EAO1C,cAAA,CAAe,UAAA,GAAa,KAAA;EAS5B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAgBf,GAAA,CAAA,GAAO,KAAA;EAOP,UAAA,CAAA,GAAc,KAAA;EAOd,WAAA,CAAA;AAAA;;;;;cASW,oBAAA,gBAAoC,WAAA,CAC/C,KAAA,EACA,KAAA,GACC,KAAA;EAED,aAAA;EAGA,KAAA,GAAQ,KAAA;EAER,QAAA;EAEA,cAAA,CAAe,UAAA,IAAc,KAAA;EAU7B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAWf,GAAA,CAAA,GAAO,KAAA;EAOP,UAAA,CAAA,IAAe,KAAA;EAKf,OAAA,CAAA;EASA,MAAA,CAAA;EAQA,WAAA,CAAA;AAAA"}
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.js";
2
2
 
3
3
  //#region src/channels/last_value.d.ts
4
-
5
4
  /**
6
5
  * Stores the last value received, can receive at most one value per step.
7
6
  *
@@ -1 +1 @@
1
- {"version":3,"file":"last_value.d.ts","names":["BaseChannel","LastValue","Value","LastValueAfterFinish"],"sources":["../../src/channels/last_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\n/**\n * Stores the last value received, can receive at most one value per step.\n *\n * Since `update` is only called once per step and value can only be of length 1,\n * LastValue always stores the last value of a single node. If multiple nodes attempt to\n * write to this channel in a single step, an error will be thrown.\n * @internal\n */\nexport declare class LastValue<Value> extends BaseChannel<Value, Value, Value> {\n protected initialValueFactory?: (() => Value) | undefined;\n lc_graph_name: string;\n value: [Value] | [];\n constructor(initialValueFactory?: (() => Value) | undefined);\n fromCheckpoint(checkpoint?: Value): this;\n update(values: Value[]): boolean;\n get(): Value;\n checkpoint(): Value;\n isAvailable(): boolean;\n}\n/**\n * Stores the last value received, but only made available after finish().\n * Once made available, clears the value.\n */\nexport declare class LastValueAfterFinish<Value> extends BaseChannel<Value, Value, [\n Value,\n boolean\n]> {\n lc_graph_name: string;\n value: [Value] | [];\n finished: boolean;\n fromCheckpoint(checkpoint?: [Value, boolean]): this;\n update(values: Value[]): boolean;\n get(): Value;\n checkpoint(): [Value, boolean] | undefined;\n consume(): boolean;\n finish(): boolean;\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;;AASA;;;;;;AAGYE,cAHSD,SAGTC,CAAAA,KAAAA,CAAAA,SAHkCF,WAGlCE,CAH8CA,KAG9CA,EAHqDA,KAGrDA,EAH4DA,KAG5DA,CAAAA,CAAAA;YACiCA,mBAAAA,CAAAA,EAAAA,CAAAA,GAAAA,GAHFA,KAGEA,CAAAA,GAAAA,SAAAA;eACbA,EAAAA,MAAAA;OACbA,EAAAA,CAHPA,KAGOA,CAAAA,GAAAA,EAAAA;aACRA,CAAAA,mBAAAA,CAAAA,EAAAA,CAAAA,GAAAA,GAHkCA,KAGlCA,CAAAA,GAAAA,SAAAA;gBACOA,CAAAA,UAAAA,CAAAA,EAHcA,KAGdA,CAAAA,EAAAA,IAAAA;QAR4BF,CAAAA,MAAAA,EAM3BE,KAN2BF,EAAAA,CAAAA,EAAAA,OAAAA;EAAW,GAAA,CAAA,CAAA,EAO9CE,KAP8C;EAepCC,UAAAA,CAAAA,CAAAA,EAPHD,KAOGC;EAAoB,WAAA,CAAA,CAAA,EAAA,OAAA;;;;;;AAQtBD,cAREC,oBAQFD,CAAAA,KAAAA,CAAAA,SARsCF,WAQtCE,CARkDA,KAQlDA,EARyDA,KAQzDA,EAAAA,CAPfA,KAQOA,SACQA;EAViD,aAAA,EAAA,MAAA;UAKxDA;;+BAEqBA;iBACdA;SACRA;iBACQA"}
1
+ {"version":3,"file":"last_value.d.ts","names":[],"sources":["../../src/channels/last_value.ts"],"mappings":";;;;;AAWA;;;;;;cAAa,SAAA,gBAAyB,WAAA,CAAY,KAAA,EAAO,KAAA,EAAO,KAAA;EAAA,UAMxC,mBAAA,UAAoB,KAAA;EAL1C,aAAA;EAGA,KAAA,GAAQ,KAAA;EAER,WAAA,CAAsB,mBAAA,UAAoB,KAAA;EAO1C,cAAA,CAAe,UAAA,GAAa,KAAA;EAS5B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAgBf,GAAA,CAAA,GAAO,KAAA;EAOP,UAAA,CAAA,GAAc,KAAA;EAOd,WAAA,CAAA;AAAA;;;;;cASW,oBAAA,gBAAoC,WAAA,CAC/C,KAAA,EACA,KAAA,GACC,KAAA;EAED,aAAA;EAGA,KAAA,GAAQ,KAAA;EAER,QAAA;EAEA,cAAA,CAAe,UAAA,IAAc,KAAA;EAU7B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAWf,GAAA,CAAA,GAAO,KAAA;EAOP,UAAA,CAAA,IAAe,KAAA;EAKf,OAAA,CAAA;EASA,MAAA,CAAA;EAQA,WAAA,CAAA;AAAA"}
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.cjs";
2
2
 
3
3
  //#region src/channels/named_barrier_value.d.ts
4
-
5
4
  /**
6
5
  * A channel that waits until all named values are received before making the value available.
7
6
  *
@@ -1 +1 @@
1
- {"version":3,"file":"named_barrier_value.d.cts","names":["BaseChannel","areSetsEqual","T","Set","NamedBarrierValue","Value","NamedBarrierValueAfterFinish"],"sources":["../../src/channels/named_barrier_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\nexport declare const areSetsEqual: <T>(a: Set<T>, b: Set<T>) => boolean;\n/**\n * A channel that waits until all named values are received before making the value available.\n *\n * This ensures that if node N and node M both write to channel C, the value of C will not be updated\n * until N and M have completed updating.\n */\nexport declare class NamedBarrierValue<Value> extends BaseChannel<void, Value, Value[]> {\n lc_graph_name: string;\n names: Set<Value>;\n seen: Set<Value>;\n constructor(names: Set<Value>);\n fromCheckpoint(checkpoint?: Value[]): this;\n update(values: Value[]): boolean;\n get(): void;\n checkpoint(): Value[];\n consume(): boolean;\n isAvailable(): boolean;\n}\n/**\n * A channel that waits until all named values are received before making the value ready to be made available.\n * It is only made available after finish() is called.\n * @internal\n */\nexport declare class NamedBarrierValueAfterFinish<Value> extends BaseChannel<void, Value, [\n Value[],\n boolean\n]> {\n lc_graph_name: string;\n names: Set<Value>;\n seen: Set<Value>;\n finished: boolean;\n constructor(names: Set<Value>);\n fromCheckpoint(checkpoint?: [Value[], boolean]): this;\n update(values: Value[]): boolean;\n get(): void;\n checkpoint(): [Value[], boolean];\n consume(): boolean;\n finish(): boolean;\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;AAQA;;;;;AAEWG,cAFUC,iBAEVD,CAAAA,KAAAA,CAAAA,SAF2CH,WAE3CG,CAAAA,IAAAA,EAF6DE,KAE7DF,EAFoEE,KAEpEF,EAAAA,CAAAA,CAAAA;eACGE,EAAAA,MAAAA;OAAJF,EADCA,GACDA,CADKE,KACLF,CAAAA;MACiBE,EADjBF,GACiBE,CADbA,KACaA,CAAAA;aAAJF,CAAAA,KAAAA,EAAAA,GAAAA,CAAIE,KAAJF,CAAAA;gBACSE,CAAAA,UAAAA,CAAAA,EAAAA,KAAAA,EAAAA,CAAAA,EAAAA,IAAAA;QACbA,CAAAA,MAAAA,EAAAA,KAAAA,EAAAA,CAAAA,EAAAA,OAAAA;KAEDA,CAAAA,CAAAA,EAAAA,IAAAA;YARoCL,CAAAA,CAAAA,EAQpCK,KARoCL,EAAAA;EAAW,OAAA,CAAA,CAAA,EAAA,OAAA;EAiB5CM,WAAAA,CAAAA,CAAAA,EAAAA,OAAAA;;;;;;;AAMXH,cANWG,4BAMXH,CAAAA,KAAAA,CAAAA,SANuDH,WAMvDG,CAAAA,IAAAA,EANyEE,KAMzEF,EAAAA,CALNE,KAOuBA,EAAAA,SAAJF;eAEJE,EAAAA,MAAAA;OAEAA,EAPRF,GAOQE,CAPJA,KAOIA,CAAAA;MAZ8CL,EAMvDG,GANuDH,CAMnDK,KANmDL,CAAAA;EAAW,QAAA,EAAA,OAAA;qBAQrDG,IAAIE;+BACMA;iBACdA;;iBAEAA"}
1
+ {"version":3,"file":"named_barrier_value.d.cts","names":[],"sources":["../../src/channels/named_barrier_value.ts"],"mappings":";;;;AAYA;;;;;cAAa,iBAAA,gBAAiC,WAAA,OAE5C,KAAA,EACA,KAAA;EAEA,aAAA;EAEA,KAAA,EAAO,GAAA,CAAI,KAAA;EAEX,IAAA,EAAM,GAAA,CAAI,KAAA;EAEV,WAAA,CAAY,KAAA,EAAO,GAAA,CAAI,KAAA;EAMvB,cAAA,CAAe,UAAA,GAAa,KAAA;EAQ5B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAqBf,GAAA,CAAA;EAOA,UAAA,CAAA,GAAc,KAAA;EAId,OAAA,CAAA;EAQA,WAAA,CAAA;AAAA;;;;;;cAUW,4BAAA,gBAA4C,WAAA,OAEvD,KAAA,GACC,KAAA;EAED,aAAA;EAEA,KAAA,EAAO,GAAA,CAAI,KAAA;EAEX,IAAA,EAAM,GAAA,CAAI,KAAA;EAEV,QAAA;EAEA,WAAA,CAAY,KAAA,EAAO,GAAA,CAAI,KAAA;EAOvB,cAAA,CAAe,UAAA,IAAc,KAAA;EAU7B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAiBf,GAAA,CAAA;EAOA,UAAA,CAAA,IAAe,KAAA;EAIf,OAAA,CAAA;EAcA,MAAA,CAAA;EAQA,WAAA,CAAA;AAAA"}
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.js";
2
2
 
3
3
  //#region src/channels/named_barrier_value.d.ts
4
-
5
4
  /**
6
5
  * A channel that waits until all named values are received before making the value available.
7
6
  *
@@ -1 +1 @@
1
- {"version":3,"file":"named_barrier_value.d.ts","names":["BaseChannel","areSetsEqual","T","Set","NamedBarrierValue","Value","NamedBarrierValueAfterFinish"],"sources":["../../src/channels/named_barrier_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\nexport declare const areSetsEqual: <T>(a: Set<T>, b: Set<T>) => boolean;\n/**\n * A channel that waits until all named values are received before making the value available.\n *\n * This ensures that if node N and node M both write to channel C, the value of C will not be updated\n * until N and M have completed updating.\n */\nexport declare class NamedBarrierValue<Value> extends BaseChannel<void, Value, Value[]> {\n lc_graph_name: string;\n names: Set<Value>;\n seen: Set<Value>;\n constructor(names: Set<Value>);\n fromCheckpoint(checkpoint?: Value[]): this;\n update(values: Value[]): boolean;\n get(): void;\n checkpoint(): Value[];\n consume(): boolean;\n isAvailable(): boolean;\n}\n/**\n * A channel that waits until all named values are received before making the value ready to be made available.\n * It is only made available after finish() is called.\n * @internal\n */\nexport declare class NamedBarrierValueAfterFinish<Value> extends BaseChannel<void, Value, [\n Value[],\n boolean\n]> {\n lc_graph_name: string;\n names: Set<Value>;\n seen: Set<Value>;\n finished: boolean;\n constructor(names: Set<Value>);\n fromCheckpoint(checkpoint?: [Value[], boolean]): this;\n update(values: Value[]): boolean;\n get(): void;\n checkpoint(): [Value[], boolean];\n consume(): boolean;\n finish(): boolean;\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;AAQA;;;;;AAEWG,cAFUC,iBAEVD,CAAAA,KAAAA,CAAAA,SAF2CH,WAE3CG,CAAAA,IAAAA,EAF6DE,KAE7DF,EAFoEE,KAEpEF,EAAAA,CAAAA,CAAAA;eACGE,EAAAA,MAAAA;OAAJF,EADCA,GACDA,CADKE,KACLF,CAAAA;MACiBE,EADjBF,GACiBE,CADbA,KACaA,CAAAA;aAAJF,CAAAA,KAAAA,EAAAA,GAAAA,CAAIE,KAAJF,CAAAA;gBACSE,CAAAA,UAAAA,CAAAA,EAAAA,KAAAA,EAAAA,CAAAA,EAAAA,IAAAA;QACbA,CAAAA,MAAAA,EAAAA,KAAAA,EAAAA,CAAAA,EAAAA,OAAAA;KAEDA,CAAAA,CAAAA,EAAAA,IAAAA;YARoCL,CAAAA,CAAAA,EAQpCK,KARoCL,EAAAA;EAAW,OAAA,CAAA,CAAA,EAAA,OAAA;EAiB5CM,WAAAA,CAAAA,CAAAA,EAAAA,OAAAA;;;;;;;AAMXH,cANWG,4BAMXH,CAAAA,KAAAA,CAAAA,SANuDH,WAMvDG,CAAAA,IAAAA,EANyEE,KAMzEF,EAAAA,CALNE,KAOuBA,EAAAA,SAAJF;eAEJE,EAAAA,MAAAA;OAEAA,EAPRF,GAOQE,CAPJA,KAOIA,CAAAA;MAZ8CL,EAMvDG,GANuDH,CAMnDK,KANmDL,CAAAA;EAAW,QAAA,EAAA,OAAA;qBAQrDG,IAAIE;+BACMA;iBACdA;;iBAEAA"}
1
+ {"version":3,"file":"named_barrier_value.d.ts","names":[],"sources":["../../src/channels/named_barrier_value.ts"],"mappings":";;;;AAYA;;;;;cAAa,iBAAA,gBAAiC,WAAA,OAE5C,KAAA,EACA,KAAA;EAEA,aAAA;EAEA,KAAA,EAAO,GAAA,CAAI,KAAA;EAEX,IAAA,EAAM,GAAA,CAAI,KAAA;EAEV,WAAA,CAAY,KAAA,EAAO,GAAA,CAAI,KAAA;EAMvB,cAAA,CAAe,UAAA,GAAa,KAAA;EAQ5B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAqBf,GAAA,CAAA;EAOA,UAAA,CAAA,GAAc,KAAA;EAId,OAAA,CAAA;EAQA,WAAA,CAAA;AAAA;;;;;;cAUW,4BAAA,gBAA4C,WAAA,OAEvD,KAAA,GACC,KAAA;EAED,aAAA;EAEA,KAAA,EAAO,GAAA,CAAI,KAAA;EAEX,IAAA,EAAM,GAAA,CAAI,KAAA;EAEV,QAAA;EAEA,WAAA,CAAY,KAAA,EAAO,GAAA,CAAI,KAAA;EAOvB,cAAA,CAAe,UAAA,IAAc,KAAA;EAU7B,MAAA,CAAO,MAAA,EAAQ,KAAA;EAiBf,GAAA,CAAA;EAOA,UAAA,CAAA,IAAe,KAAA;EAIf,OAAA,CAAA;EAcA,MAAA,CAAA;EAQA,WAAA,CAAA;AAAA"}
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.cjs";
2
2
 
3
3
  //#region src/channels/topic.d.ts
4
-
5
4
  /**
6
5
  * A configurable PubSub Topic.
7
6
  */
@@ -1 +1 @@
1
- {"version":3,"file":"topic.d.cts","names":["BaseChannel","Topic","Value","Array","Set"],"sources":["../../src/channels/topic.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\n/**\n * A configurable PubSub Topic.\n */\nexport declare class Topic<Value> extends BaseChannel<Array<Value>, Value | Value[], [\n Value[],\n Value[]\n]> {\n lc_graph_name: string;\n unique: boolean;\n accumulate: boolean;\n seen: Set<Value>;\n values: Value[];\n constructor(fields?: {\n /**\n * Whether to only add unique values to the topic. If `true`, only unique values (using reference equality) will be added to the topic.\n */\n unique?: boolean;\n /**\n * Whether to accumulate values across steps. If `false`, the channel will be emptied after each step.\n */\n accumulate?: boolean;\n });\n fromCheckpoint(checkpoint?: [Value[], Value[]]): this;\n update(values: Array<Value | Value[]>): boolean;\n get(): Array<Value>;\n checkpoint(): [Value[], Value[]];\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;;AAIA;AAA0B,cAALC,KAAK,CAAA,KAAA,CAAA,SAAgBD,WAAhB,CAA4BG,KAA5B,CAAkCD,KAAlC,CAAA,EAA0CA,KAA1C,GAAkDA,KAAlD,EAAA,EAAA,CACtBA,KADwDA,EAAAA,EAExDA,KAFkDC,EAAAA;eAAsBD,EAAAA,MAAAA;QACxEA,EAAAA,OAAAA;YACAA,EAAAA,OAAAA;MAKUA,EAAJE,GAAIF,CAAAA,KAAAA,CAAAA;QAAJE,EACEF,KADFE,EAAAA;aACEF,CAAAA,OAAAA,EAAAA;IAWqBA;;;IACAA,MAAAA,CAAAA,EAAAA,OAAAA;IAAdC;;;IAEAD,UAAAA,CAAAA,EAAAA,OAAAA;;gBAtBuBF,CAAAA,UAAAA,CAAAA,EAAAA,CAmBTE,KAnBSF,EAAAA,EAmBAE,KAnBAF,EAAAA,CAAAA,CAAAA,EAAAA,IAAAA;EAAW,MAAA,CAAA,MAAA,EAoBlCG,KApBkC,CAoB5BD,KApB4B,GAoBpBA,KApBoB,EAAA,CAAA,CAAA,EAAA,OAAA;SAqB1CC,MAAMD;iBACEA,SAASA"}
1
+ {"version":3,"file":"topic.d.cts","names":[],"sources":["../../src/channels/topic.ts"],"mappings":";;;;;AAMA;cAAa,KAAA,gBAAqB,WAAA,CAChC,KAAA,CAAM,KAAA,GACN,KAAA,GAAQ,KAAA,KACP,KAAA,IAAS,KAAA;EAEV,aAAA;EAEA,MAAA;EAEA,UAAA;EAEA,IAAA,EAAM,GAAA,CAAI,KAAA;EAEV,MAAA,EAAQ,KAAA;EAER,WAAA,CAAY,MAAA;IAFJ;;;IAMN,MAAA;IA4BkC;;;IAxBlC,UAAA;EAAA;EAWK,cAAA,CAAe,UAAA,IAAc,KAAA,IAAS,KAAA;EAatC,MAAA,CAAO,MAAA,EAAQ,KAAA,CAAM,KAAA,GAAQ,KAAA;EAwB7B,GAAA,CAAA,GAAO,KAAA,CAAM,KAAA;EAOb,UAAA,CAAA,IAAe,KAAA,IAAS,KAAA;EAI/B,WAAA,CAAA;AAAA"}
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.js";
2
2
 
3
3
  //#region src/channels/topic.d.ts
4
-
5
4
  /**
6
5
  * A configurable PubSub Topic.
7
6
  */
@@ -1 +1 @@
1
- {"version":3,"file":"topic.d.ts","names":["BaseChannel","Topic","Value","Array","Set"],"sources":["../../src/channels/topic.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\n/**\n * A configurable PubSub Topic.\n */\nexport declare class Topic<Value> extends BaseChannel<Array<Value>, Value | Value[], [\n Value[],\n Value[]\n]> {\n lc_graph_name: string;\n unique: boolean;\n accumulate: boolean;\n seen: Set<Value>;\n values: Value[];\n constructor(fields?: {\n /**\n * Whether to only add unique values to the topic. If `true`, only unique values (using reference equality) will be added to the topic.\n */\n unique?: boolean;\n /**\n * Whether to accumulate values across steps. If `false`, the channel will be emptied after each step.\n */\n accumulate?: boolean;\n });\n fromCheckpoint(checkpoint?: [Value[], Value[]]): this;\n update(values: Array<Value | Value[]>): boolean;\n get(): Array<Value>;\n checkpoint(): [Value[], Value[]];\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;;AAIA;AAA0B,cAALC,KAAK,CAAA,KAAA,CAAA,SAAgBD,WAAhB,CAA4BG,KAA5B,CAAkCD,KAAlC,CAAA,EAA0CA,KAA1C,GAAkDA,KAAlD,EAAA,EAAA,CACtBA,KADwDA,EAAAA,EAExDA,KAFkDC,EAAAA;eAAsBD,EAAAA,MAAAA;QACxEA,EAAAA,OAAAA;YACAA,EAAAA,OAAAA;MAKUA,EAAJE,GAAIF,CAAAA,KAAAA,CAAAA;QAAJE,EACEF,KADFE,EAAAA;aACEF,CAAAA,OAAAA,EAAAA;IAWqBA;;;IACAA,MAAAA,CAAAA,EAAAA,OAAAA;IAAdC;;;IAEAD,UAAAA,CAAAA,EAAAA,OAAAA;;gBAtBuBF,CAAAA,UAAAA,CAAAA,EAAAA,CAmBTE,KAnBSF,EAAAA,EAmBAE,KAnBAF,EAAAA,CAAAA,CAAAA,EAAAA,IAAAA;EAAW,MAAA,CAAA,MAAA,EAoBlCG,KApBkC,CAoB5BD,KApB4B,GAoBpBA,KApBoB,EAAA,CAAA,CAAA,EAAA,OAAA;SAqB1CC,MAAMD;iBACEA,SAASA"}
1
+ {"version":3,"file":"topic.d.ts","names":[],"sources":["../../src/channels/topic.ts"],"mappings":";;;;;AAMA;cAAa,KAAA,gBAAqB,WAAA,CAChC,KAAA,CAAM,KAAA,GACN,KAAA,GAAQ,KAAA,KACP,KAAA,IAAS,KAAA;EAEV,aAAA;EAEA,MAAA;EAEA,UAAA;EAEA,IAAA,EAAM,GAAA,CAAI,KAAA;EAEV,MAAA,EAAQ,KAAA;EAER,WAAA,CAAY,MAAA;IAFJ;;;IAMN,MAAA;IA4BkC;;;IAxBlC,UAAA;EAAA;EAWK,cAAA,CAAe,UAAA,IAAc,KAAA,IAAS,KAAA;EAatC,MAAA,CAAO,MAAA,EAAQ,KAAA,CAAM,KAAA,GAAQ,KAAA;EAwB7B,GAAA,CAAA,GAAO,KAAA,CAAM,KAAA;EAOb,UAAA,CAAA,IAAe,KAAA,IAAS,KAAA;EAI/B,WAAA,CAAA;AAAA"}
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.cjs";
2
2
 
3
3
  //#region src/channels/untracked_value.d.ts
4
-
5
4
  /**
6
5
  * Stores the last value received, never checkpointed.
7
6
  *
@@ -1 +1 @@
1
- {"version":3,"file":"untracked_value.d.cts","names":["BaseChannel","UntrackedValueChannel","Value"],"sources":["../../src/channels/untracked_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\n/**\n * Stores the last value received, never checkpointed.\n *\n * This channel stores values during graph execution but does NOT persist\n * the value to checkpoints. On restoration from a checkpoint, the value\n * will be reset to empty (or the initial value if provided).\n *\n * Useful for transient state like:\n * - Database connections\n * - Temporary caches\n * - Runtime-only configuration\n *\n * @internal\n */\nexport declare class UntrackedValueChannel<Value> extends BaseChannel<Value, Value, undefined> {\n lc_graph_name: string;\n /**\n * If true, throws an error when multiple values are received in a single step.\n * If false, stores the last value received.\n */\n guard: boolean;\n /**\n * The current value. MISSING sentinel indicates no value has been set.\n */\n private _value;\n /**\n * Optional factory function for the initial value.\n */\n private initialValueFactory?;\n constructor(options?: {\n guard?: boolean;\n initialValueFactory?: () => Value;\n });\n /**\n * Return a new channel, ignoring the checkpoint since we don't persist.\n * The initial value (if any) is restored.\n */\n fromCheckpoint(_checkpoint?: undefined): this;\n /**\n * Update the channel with the given values.\n * If guard is true, throws if more than one value is received.\n */\n update(values: Value[]): boolean;\n /**\n * Get the current value.\n * @throws EmptyChannelError if no value has been set.\n */\n get(): Value;\n /**\n * Always returns undefined - untracked values are never checkpointed.\n */\n checkpoint(): undefined;\n /**\n * Return true if a value has been set.\n */\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;;AAeA;;;;;;;;;;;;cAAqBC,qCAAqCD,YAAYE,OAAOA;;;;;;;;;;;;;;;;;gCAiBzCA;;;;;;;;;;;iBAWjBA;;;;;SAKRA"}
1
+ {"version":3,"file":"untracked_value.d.cts","names":[],"sources":["../../src/channels/untracked_value.ts"],"mappings":";;;;;AAoBA;;;;;;;;;;;;cAAa,qBAAA,gBAAqC,WAAA,CAChD,KAAA,EACA,KAAA;EAGA,aAAA;EAHA;;;;EASA,KAAA;EAYA;;;EAAA,QAPQ,MAAA;EAOI;;;EAAA,QAFJ,mBAAA;EAER,WAAA,CAAY,OAAA;IACV,KAAA;IACA,mBAAA,SAA4B,KAAA;EAAA;EAyD9B;;;;EA3CA,cAAA,CAAe,WAAA;;;;;EAYf,MAAA,CAAO,MAAA,EAAQ,KAAA;;;;;EAqBf,GAAA,CAAA,GAAO,KAAA;;;;EAUP,UAAA,CAAA;;;;EAOA,WAAA,CAAA;AAAA"}
@@ -1,7 +1,6 @@
1
1
  import { BaseChannel } from "./base.js";
2
2
 
3
3
  //#region src/channels/untracked_value.d.ts
4
-
5
4
  /**
6
5
  * Stores the last value received, never checkpointed.
7
6
  *
@@ -1 +1 @@
1
- {"version":3,"file":"untracked_value.d.ts","names":["BaseChannel","UntrackedValueChannel","Value"],"sources":["../../src/channels/untracked_value.d.ts"],"sourcesContent":["import { BaseChannel } from \"./base.js\";\n/**\n * Stores the last value received, never checkpointed.\n *\n * This channel stores values during graph execution but does NOT persist\n * the value to checkpoints. On restoration from a checkpoint, the value\n * will be reset to empty (or the initial value if provided).\n *\n * Useful for transient state like:\n * - Database connections\n * - Temporary caches\n * - Runtime-only configuration\n *\n * @internal\n */\nexport declare class UntrackedValueChannel<Value> extends BaseChannel<Value, Value, undefined> {\n lc_graph_name: string;\n /**\n * If true, throws an error when multiple values are received in a single step.\n * If false, stores the last value received.\n */\n guard: boolean;\n /**\n * The current value. MISSING sentinel indicates no value has been set.\n */\n private _value;\n /**\n * Optional factory function for the initial value.\n */\n private initialValueFactory?;\n constructor(options?: {\n guard?: boolean;\n initialValueFactory?: () => Value;\n });\n /**\n * Return a new channel, ignoring the checkpoint since we don't persist.\n * The initial value (if any) is restored.\n */\n fromCheckpoint(_checkpoint?: undefined): this;\n /**\n * Update the channel with the given values.\n * If guard is true, throws if more than one value is received.\n */\n update(values: Value[]): boolean;\n /**\n * Get the current value.\n * @throws EmptyChannelError if no value has been set.\n */\n get(): Value;\n /**\n * Always returns undefined - untracked values are never checkpointed.\n */\n checkpoint(): undefined;\n /**\n * Return true if a value has been set.\n */\n isAvailable(): boolean;\n}\n"],"mappings":";;;;;;AAeA;;;;;;;;;;;;cAAqBC,qCAAqCD,YAAYE,OAAOA;;;;;;;;;;;;;;;;;gCAiBzCA;;;;;;;;;;;iBAWjBA;;;;;SAKRA"}
1
+ {"version":3,"file":"untracked_value.d.ts","names":[],"sources":["../../src/channels/untracked_value.ts"],"mappings":";;;;;AAoBA;;;;;;;;;;;;cAAa,qBAAA,gBAAqC,WAAA,CAChD,KAAA,EACA,KAAA;EAGA,aAAA;EAHA;;;;EASA,KAAA;EAYA;;;EAAA,QAPQ,MAAA;EAOI;;;EAAA,QAFJ,mBAAA;EAER,WAAA,CAAY,OAAA;IACV,KAAA;IACA,mBAAA,SAA4B,KAAA;EAAA;EAyD9B;;;;EA3CA,cAAA,CAAe,WAAA;;;;;EAYf,MAAA,CAAO,MAAA,EAAQ,KAAA;;;;;EAqBf,GAAA,CAAA,GAAO,KAAA;;;;EAUP,UAAA,CAAA;;;;EAOA,WAAA,CAAA;AAAA"}
@@ -7,8 +7,6 @@ declare const START = "__start__";
7
7
  declare const END = "__end__";
8
8
  /** Special channel reserved for graph interrupts */
9
9
  declare const INTERRUPT = "__interrupt__";
10
- /** Special channel reserved for graph resume */
11
-
12
10
  /** Special channel reserved for graph previous state */
13
11
  declare const PREVIOUS = "__previous__";
14
12
  /** @internal */
@@ -263,19 +261,6 @@ declare class Command<Resume = unknown, Update extends Record<string, unknown> =
263
261
  * @returns `true` if the value is a {@link Command}, `false` otherwise.
264
262
  */
265
263
  declare function isCommand(x: unknown): x is Command;
266
- /**
267
- * Reconstructs Command and Send objects from a deeply nested tree of anonymous objects
268
- * matching their interfaces.
269
- *
270
- * This is only exported for testing purposes. It is NOT intended to be used outside of
271
- * the Command and Send classes.
272
- *
273
- * @internal
274
- *
275
- * @param x - The command send tree to convert.
276
- * @param seen - A map of seen objects to avoid infinite loops.
277
- * @returns The converted command send tree.
278
- */
279
264
  //#endregion
280
265
  export { Command, CommandInstance, CommandParams, END, INTERRUPT, Interrupt, PREVIOUS, START, Send, isCommand, isInterrupted };
281
266
  //# sourceMappingURL=constants.d.cts.map
@@ -1 +1 @@
1
- {"version":3,"file":"constants.d.cts","names":["PendingWrite","START","END","INPUT","COPY","ERROR","CACHE_NS_WRITES","CONFIG_KEY_SEND","CONFIG_KEY_CALL","CONFIG_KEY_READ","CONFIG_KEY_CHECKPOINTER","CONFIG_KEY_RESUMING","CONFIG_KEY_TASK_ID","CONFIG_KEY_STREAM","CONFIG_KEY_RESUME_VALUE","CONFIG_KEY_RESUME_MAP","CONFIG_KEY_SCRATCHPAD","CONFIG_KEY_PREVIOUS_STATE","CONFIG_KEY_DURABILITY","CONFIG_KEY_CHECKPOINT_ID","CONFIG_KEY_CHECKPOINT_NS","CONFIG_KEY_NODE_FINISHED","CONFIG_KEY_CHECKPOINT_MAP","CONFIG_KEY_ABORT_SIGNALS","INTERRUPT","RESUME","NO_WRITES","RETURN","PREVIOUS","RUNTIME_PLACEHOLDER","RECURSION_LIMIT_DEFAULT","TAG_HIDDEN","TAG_NOSTREAM","SELF","TASKS","PUSH","PULL","TASK_NAMESPACE","NULL_TASK_ID","RESERVED","CHECKPOINT_NAMESPACE_SEPARATOR","CHECKPOINT_NAMESPACE_END","COMMAND_SYMBOL","CommandInstance","Record","Resume","Update","Nodes","CommandParams","SendInterface","Node","Args","_isSendInterface","Send","_isSend","Interrupt","Value","isInterrupted","Command","Omit","isCommand","_deserializeCommandSendObjectGraph","Map"],"sources":["../src/constants.d.ts"],"sourcesContent":["import { PendingWrite } from \"@langchain/langgraph-checkpoint\";\n/** Special reserved node name denoting the start of a graph. */\nexport declare const START = \"__start__\";\n/** Special reserved node name denoting the end of a graph. */\nexport declare const END = \"__end__\";\nexport declare const INPUT = \"__input__\";\nexport declare const COPY = \"__copy__\";\nexport declare const ERROR = \"__error__\";\n/** Special reserved cache namespaces */\nexport declare const CACHE_NS_WRITES = \"__pregel_ns_writes\";\nexport declare const CONFIG_KEY_SEND = \"__pregel_send\";\n/** config key containing function used to call a node (push task) */\nexport declare const CONFIG_KEY_CALL = \"__pregel_call\";\nexport declare const CONFIG_KEY_READ = \"__pregel_read\";\nexport declare const CONFIG_KEY_CHECKPOINTER = \"__pregel_checkpointer\";\nexport declare const CONFIG_KEY_RESUMING = \"__pregel_resuming\";\nexport declare const CONFIG_KEY_TASK_ID = \"__pregel_task_id\";\nexport declare const CONFIG_KEY_STREAM = \"__pregel_stream\";\nexport declare const CONFIG_KEY_RESUME_VALUE = \"__pregel_resume_value\";\nexport declare const CONFIG_KEY_RESUME_MAP = \"__pregel_resume_map\";\nexport declare const CONFIG_KEY_SCRATCHPAD = \"__pregel_scratchpad\";\n/** config key containing state from previous invocation of graph for the given thread */\nexport declare const CONFIG_KEY_PREVIOUS_STATE = \"__pregel_previous\";\nexport declare const CONFIG_KEY_DURABILITY = \"__pregel_durability\";\nexport declare const CONFIG_KEY_CHECKPOINT_ID = \"checkpoint_id\";\nexport declare const CONFIG_KEY_CHECKPOINT_NS = \"checkpoint_ns\";\nexport declare const CONFIG_KEY_NODE_FINISHED = \"__pregel_node_finished\";\nexport declare const CONFIG_KEY_CHECKPOINT_MAP = \"checkpoint_map\";\nexport declare const CONFIG_KEY_ABORT_SIGNALS = \"__pregel_abort_signals\";\n/** Special channel reserved for graph interrupts */\nexport declare const INTERRUPT = \"__interrupt__\";\n/** Special channel reserved for graph resume */\nexport declare const RESUME = \"__resume__\";\n/** Special channel reserved for cases when a task exits without any writes */\nexport declare const NO_WRITES = \"__no_writes__\";\n/** Special channel reserved for graph return */\nexport declare const RETURN = \"__return__\";\n/** Special channel reserved for graph previous state */\nexport declare const PREVIOUS = \"__previous__\";\nexport declare const RUNTIME_PLACEHOLDER = \"__pregel_runtime_placeholder__\";\nexport declare const RECURSION_LIMIT_DEFAULT = 25;\nexport declare const TAG_HIDDEN = \"langsmith:hidden\";\nexport declare const TAG_NOSTREAM = \"langsmith:nostream\";\nexport declare const SELF = \"__self__\";\nexport declare const TASKS = \"__pregel_tasks\";\nexport declare const PUSH = \"__pregel_push\";\nexport declare const PULL = \"__pregel_pull\";\nexport declare const TASK_NAMESPACE = \"6ba7b831-9dad-11d1-80b4-00c04fd430c8\";\nexport declare const NULL_TASK_ID = \"00000000-0000-0000-0000-000000000000\";\nexport declare const RESERVED: string[];\nexport declare const CHECKPOINT_NAMESPACE_SEPARATOR = \"|\";\nexport declare const CHECKPOINT_NAMESPACE_END = \":\";\n/** @internal */\ndeclare const COMMAND_SYMBOL: unique symbol;\n/**\n * Instance of a {@link Command} class.\n *\n * This is used to avoid IntelliSense suggesting public fields\n * of {@link Command} class when a plain object is expected.\n *\n * @see {@link Command}\n * @internal\n */\nexport declare class CommandInstance<Resume = unknown, Update = Record<string, unknown>, Nodes extends string = string> {\n [COMMAND_SYMBOL]: CommandParams<Resume, Update, Nodes>;\n constructor(args: CommandParams<Resume, Update, Nodes>);\n}\nexport interface SendInterface<Node extends string = string, Args = any> {\n node: Node;\n args: Args;\n}\nexport declare function _isSendInterface(x: unknown): x is SendInterface;\n/**\n *\n * A message or packet to send to a specific node in the graph.\n *\n * The `Send` class is used within a `StateGraph`'s conditional edges to\n * dynamically invoke a node with a custom state at the next step.\n *\n * Importantly, the sent state can differ from the core graph's state,\n * allowing for flexible and dynamic workflow management.\n *\n * One such example is a \"map-reduce\" workflow where your graph invokes\n * the same node multiple times in parallel with different states,\n * before aggregating the results back into the main graph's state.\n *\n * @example\n * ```typescript\n * import { Annotation, Send, StateGraph } from \"@langchain/langgraph\";\n *\n * const ChainState = Annotation.Root({\n * subjects: Annotation<string[]>,\n * jokes: Annotation<string[]>({\n * reducer: (a, b) => a.concat(b),\n * }),\n * });\n *\n * const continueToJokes = async (state: typeof ChainState.State) => {\n * return state.subjects.map((subject) => {\n * return new Send(\"generate_joke\", { subjects: [subject] });\n * });\n * };\n *\n * const graph = new StateGraph(ChainState)\n * .addNode(\"generate_joke\", (state) => ({\n * jokes: [`Joke about ${state.subjects}`],\n * }))\n * .addConditionalEdges(\"__start__\", continueToJokes)\n * .addEdge(\"generate_joke\", \"__end__\")\n * .compile();\n *\n * const res = await graph.invoke({ subjects: [\"cats\", \"dogs\"] });\n * console.log(res);\n *\n * // Invoking with two subjects results in a generated joke for each\n * // { subjects: [\"cats\", \"dogs\"], jokes: [`Joke about cats`, `Joke about dogs`] }\n * ```\n */\nexport declare class Send<Node extends string = string, Args = any> implements SendInterface<Node, Args> {\n lg_name: string;\n node: Node;\n args: Args;\n constructor(node: Node, args: Args);\n toJSON(): {\n lg_name: string;\n node: Node;\n args: Args;\n };\n}\nexport declare function _isSend(x: unknown): x is Send;\nexport type Interrupt<Value = any> = {\n id?: string;\n value?: Value;\n};\n/**\n * Checks if the given graph invoke / stream chunk contains interrupt.\n *\n * @example\n * ```ts\n * import { INTERRUPT, isInterrupted } from \"@langchain/langgraph\";\n *\n * const values = await graph.invoke({ foo: \"bar\" });\n * if (isInterrupted<string>(values)) {\n * const interrupt = values[INTERRUPT][0].value;\n * }\n * ```\n *\n * @param values - The values to check.\n * @returns `true` if the values contain an interrupt, `false` otherwise.\n */\nexport declare function isInterrupted<Value = unknown>(values: unknown): values is {\n [INTERRUPT]: Interrupt<Value>[];\n};\nexport type CommandParams<Resume = unknown, Update = Record<string, unknown>, Nodes extends string = string> = {\n /**\n * A discriminator field used to identify the type of object. Must be populated when serializing.\n *\n * Optional because it's not required to specify this when directly constructing a {@link Command}\n * object.\n */\n lg_name?: \"Command\";\n /**\n * Value to resume execution with. To be used together with {@link interrupt}.\n */\n resume?: Resume;\n /**\n * Graph to send the command to. Supported values are:\n * - None: the current graph (default)\n * - The specific name of the graph to send the command to\n * - {@link Command.PARENT}: closest parent graph (only supported when returned from a node in a subgraph)\n */\n graph?: string;\n /**\n * Update to apply to the graph's state.\n */\n update?: Update | [string, unknown][];\n /**\n * Can be one of the following:\n * - name of the node to navigate to next (any node that belongs to the specified `graph`)\n * - sequence of node names to navigate to next\n * - `Send` object (to execute a node with the input provided)\n * - sequence of `Send` objects\n */\n goto?: Nodes | SendInterface<Nodes> | (Nodes | SendInterface<Nodes>)[];\n};\n/**\n * One or more commands to update the graph's state and send messages to nodes.\n * Can be used to combine routing logic with state updates in lieu of conditional edges\n *\n * @example\n * ```ts\n * import { Annotation, Command } from \"@langchain/langgraph\";\n *\n * // Define graph state\n * const StateAnnotation = Annotation.Root({\n * foo: Annotation<string>,\n * });\n *\n * // Define the nodes\n * const nodeA = async (_state: typeof StateAnnotation.State) => {\n * console.log(\"Called A\");\n * // this is a replacement for a real conditional edge function\n * const goto = Math.random() > .5 ? \"nodeB\" : \"nodeC\";\n * // note how Command allows you to BOTH update the graph state AND route to the next node\n * return new Command({\n * // this is the state update\n * update: {\n * foo: \"a\",\n * },\n * // this is a replacement for an edge\n * goto,\n * });\n * };\n *\n * // Nodes B and C are unchanged\n * const nodeB = async (state: typeof StateAnnotation.State) => {\n * console.log(\"Called B\");\n * return {\n * foo: state.foo + \"|b\",\n * };\n * }\n *\n * const nodeC = async (state: typeof StateAnnotation.State) => {\n * console.log(\"Called C\");\n * return {\n * foo: state.foo + \"|c\",\n * };\n * }\n *\n * import { StateGraph } from \"@langchain/langgraph\";\n\n * // NOTE: there are no edges between nodes A, B and C!\n * const graph = new StateGraph(StateAnnotation)\n * .addNode(\"nodeA\", nodeA, {\n * ends: [\"nodeB\", \"nodeC\"],\n * })\n * .addNode(\"nodeB\", nodeB)\n * .addNode(\"nodeC\", nodeC)\n * .addEdge(\"__start__\", \"nodeA\")\n * .compile();\n *\n * await graph.invoke({ foo: \"\" });\n *\n * // Randomly oscillates between\n * // { foo: 'a|c' } and { foo: 'a|b' }\n * ```\n */\nexport declare class Command<Resume = unknown, Update extends Record<string, unknown> = Record<string, unknown>, Nodes extends string = string> extends CommandInstance<Resume, Update, Nodes> {\n readonly lg_name = \"Command\";\n lc_direct_tool_output: boolean;\n /**\n * Graph to send the command to. Supported values are:\n * - None: the current graph (default)\n * - The specific name of the graph to send the command to\n * - {@link Command.PARENT}: closest parent graph (only supported when returned from a node in a subgraph)\n */\n graph?: string;\n /**\n * Update to apply to the graph's state as a result of executing the node that is returning the command.\n * Written to the state as if the node had simply returned this value instead of the Command object.\n */\n update?: Update | [string, unknown][];\n /**\n * Value to resume execution with. To be used together with {@link interrupt}.\n */\n resume?: Resume;\n /**\n * Can be one of the following:\n * - name of the node to navigate to next (any node that belongs to the specified `graph`)\n * - sequence of node names to navigate to next\n * - {@link Send} object (to execute a node with the exact input provided in the {@link Send} object)\n * - sequence of {@link Send} objects\n */\n goto?: Nodes | Send<Nodes> | (Nodes | Send<Nodes>)[];\n static PARENT: string;\n constructor(args: Omit<CommandParams<Resume, Update, Nodes>, \"lg_name\">);\n /**\n * Convert the update field to a list of {@link PendingWrite} tuples\n * @returns List of {@link PendingWrite} tuples of the form `[channelKey, value]`.\n * @internal\n */\n _updateAsTuples(): PendingWrite[];\n toJSON(): {\n lg_name: string;\n update: Update | [string, unknown][] | undefined;\n resume: Resume | undefined;\n goto: Nodes | (Nodes | {\n lg_name: string;\n node: Nodes;\n args: any;\n })[] | {\n lg_name: string;\n node: Nodes;\n args: any;\n } | undefined;\n };\n}\n/**\n * A type guard to check if the given value is a {@link Command}.\n *\n * Useful for type narrowing when working with the {@link Command} object.\n *\n * @param x - The value to check.\n * @returns `true` if the value is a {@link Command}, `false` otherwise.\n */\nexport declare function isCommand(x: unknown): x is Command;\n/**\n * Reconstructs Command and Send objects from a deeply nested tree of anonymous objects\n * matching their interfaces.\n *\n * This is only exported for testing purposes. It is NOT intended to be used outside of\n * the Command and Send classes.\n *\n * @internal\n *\n * @param x - The command send tree to convert.\n * @param seen - A map of seen objects to avoid infinite loops.\n * @returns The converted command send tree.\n */\nexport declare function _deserializeCommandSendObjectGraph(x: unknown, seen?: Map<object, unknown>): unknown;\nexport {};\n"],"mappings":";;;;cAEqBC,KAAAA;AAArB;AAEqBC,cAAAA,GAAAA,GAAG,SAAA;;AAoHdgD,cA1FW1B,SAAAA,GA0FX0B,eAAAA;;;;AAUEK,cA5FS3B,QAAAA,GA8FT4B,cAAK;;cA/EHd,cAkI6BK,EAAAA,OAAAA,MAAAA;;;;AAgE3C;;;;;;AAAwLA,cAxLnKJ,eAwLmKI,CAAAA,SAAAA,OAAAA,EAAAA,SAxLxHH,MAwLwHG,CAAAA,MAAAA,EAAAA,OAAAA,CAAAA,EAAAA,cAAAA,MAAAA,GAAAA,MAAAA,CAAAA,CAAAA;GAvLnLL,cAAAA,CAqMQI,EArMSE,aAqMTF,CArMuBD,MAqMvBC,EArM+BA,MAqM/BA,EArMuCC,KAqMvCD,CAAAA;aAIAD,CAAAA,IAAAA,EAxMSG,aAwMTH,CAxMuBA,MAwMvBA,EAxM+BC,MAwM/BD,EAxMuCE,KAwMvCF,CAAAA;;AAQWE,UA9MPE,aA8MOF,CAAAA,aAAAA,MAAAA,GAAAA,MAAAA,EAAAA,OAAAA,GAAAA,CAAAA,CAAAA;MAALM,EA7MTH,IA6MSG;MAAeN,EA5MxBI,IA4MwBJ;;;;;;;;;;;;;;;;AAgClC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cA3LqBM,0DAA0DJ,cAAcC,MAAMC;;QAEzFD;QACAC;oBACYD,YAAYC;;;UAGpBD;UACAC;;;KAIFI;;UAEAC;;;;;;;;;;;;;;;;;;iBAkBYC;GACnBjC,SAAAA,GAAY+B,UAAUC;;KAEfR,yCAAyCJ;;;;;;;;;;;WAWxCC;;;;;;;;;;;WAWAC;;;;;;;;SAQFC,QAAQE,cAAcF,UAAUA,QAAQE,cAAcF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAgE5CW,yCAAyCd,0BAA0BA,gEAAgED,gBAAgBE,QAAQC,QAAQC;;;;;;;;;;;;;;WAc3KD;;;;WAIAD;;;;;;;;SAQFE,QAAQM,KAAKN,UAAUA,QAAQM,KAAKN;;oBAEzBY,KAAKX,cAAcH,QAAQC,QAAQC;;;;;;qBAMlC/C;;;YAGP8C;YACAD;UACFE,SAASA;;YAELA;;;;YAIAA;;;;;;;;;;;;;iBAaMa,SAAAA,mBAA4BF"}
1
+ {"version":3,"file":"constants.d.cts","names":[],"sources":["../src/constants.ts"],"mappings":";;;;cAGa,KAAA;AAAb;AAAA,cAEa,GAAA;;cAiCA,SAAA;;cAQA,QAAA;;cA4CP,cAAA;;;;;;;AAwBN;;;cAba,eAAA,4BAEF,MAAA;EAAA,CAGR,cAAA,GAAiB,aAAA,CAAc,MAAA,EAAQ,MAAA,EAAQ,KAAA;EAEhD,WAAA,CAAY,IAAA,EAAM,aAAA,CAAc,MAAA,EAAQ,MAAA,EAAQ,KAAA;AAAA;AAAA,UAMjC,aAAA;EACf,IAAA,EAAM,IAAA;EACN,IAAA,EAAM,IAAA;AAAA;AA4DR;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA;;;;;;;;;AAzBA,cAAa,IAAA,sDACA,aAAA,CAAc,IAAA,EAAM,IAAA;EAE/B,OAAA;EAEO,IAAA,EAAM,IAAA;EAEN,IAAA,EAAM,IAAA;EAEb,WAAA,CAAY,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,IAAA;EAK9B,MAAA,CAAA;;;;;;KAWU,SAAA;EACV,EAAA;EACA,KAAA,GAAQ,KAAA;AAAA;;AA2BV;;;;;;;;;;;;;;;iBARgB,aAAA,iBAAA,CACd,MAAA,YACC,MAAA;EAAA,CAAa,SAAA,GAAY,SAAA,CAAU,KAAA;AAAA;AAAA,KAM1B,aAAA,4BAED,MAAA;EAcT;;;;;;EALA,OAAA;EA4BI;;;EAvBJ,MAAA,GAAS,MAAA;EAwBkB;;;AAiE7B;;;EAlFE,KAAA;EAoFyC;;;EA/EzC,MAAA,GAAS,MAAA;EAkGA;;;;;;;EAzFT,IAAA,GACI,KAAA,GACA,aAAA,CAAc,KAAA,KACb,KAAA,GAAQ,aAAA,CAAc,KAAA;AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAiEhB,OAAA,kCAEI,MAAA,oBAA0B,MAAA,0DAEjC,eAAA,CAAgB,MAAA,EAAQ,MAAA,EAAQ,KAAA;EAAA,SAC/B,OAAA;EAET,qBAAA;;AAuGF;;;;;EA/FE,KAAA;EA+F0C;;;;EAzF1C,MAAA,GAAS,MAAA;;;;EAKT,MAAA,GAAS,MAAA;;;;;;;;EAST,IAAA,GAAO,KAAA,GAAQ,IAAA,CAAK,KAAA,KAAU,KAAA,GAAQ,IAAA,CAAK,KAAA;EAAA,OAEpC,MAAA;EAEP,WAAA,CAAY,IAAA,EAAM,IAAA,CAAK,aAAA,CAAc,MAAA,EAAQ,MAAA,EAAQ,KAAA;;;;;;EAmBrD,eAAA,CAAA,GAAmB,YAAA;EAoBnB,MAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;iBAgCc,SAAA,CAAU,CAAA,YAAa,CAAA,IAAK,OAAA"}
@@ -7,8 +7,6 @@ declare const START = "__start__";
7
7
  declare const END = "__end__";
8
8
  /** Special channel reserved for graph interrupts */
9
9
  declare const INTERRUPT = "__interrupt__";
10
- /** Special channel reserved for graph resume */
11
-
12
10
  /** Special channel reserved for graph previous state */
13
11
  declare const PREVIOUS = "__previous__";
14
12
  /** @internal */
@@ -263,19 +261,6 @@ declare class Command<Resume = unknown, Update extends Record<string, unknown> =
263
261
  * @returns `true` if the value is a {@link Command}, `false` otherwise.
264
262
  */
265
263
  declare function isCommand(x: unknown): x is Command;
266
- /**
267
- * Reconstructs Command and Send objects from a deeply nested tree of anonymous objects
268
- * matching their interfaces.
269
- *
270
- * This is only exported for testing purposes. It is NOT intended to be used outside of
271
- * the Command and Send classes.
272
- *
273
- * @internal
274
- *
275
- * @param x - The command send tree to convert.
276
- * @param seen - A map of seen objects to avoid infinite loops.
277
- * @returns The converted command send tree.
278
- */
279
264
  //#endregion
280
265
  export { Command, CommandInstance, CommandParams, END, INTERRUPT, Interrupt, PREVIOUS, START, Send, isCommand, isInterrupted };
281
266
  //# sourceMappingURL=constants.d.ts.map
@@ -1 +1 @@
1
- {"version":3,"file":"constants.d.ts","names":["PendingWrite","START","END","INPUT","COPY","ERROR","CACHE_NS_WRITES","CONFIG_KEY_SEND","CONFIG_KEY_CALL","CONFIG_KEY_READ","CONFIG_KEY_CHECKPOINTER","CONFIG_KEY_RESUMING","CONFIG_KEY_TASK_ID","CONFIG_KEY_STREAM","CONFIG_KEY_RESUME_VALUE","CONFIG_KEY_RESUME_MAP","CONFIG_KEY_SCRATCHPAD","CONFIG_KEY_PREVIOUS_STATE","CONFIG_KEY_DURABILITY","CONFIG_KEY_CHECKPOINT_ID","CONFIG_KEY_CHECKPOINT_NS","CONFIG_KEY_NODE_FINISHED","CONFIG_KEY_CHECKPOINT_MAP","CONFIG_KEY_ABORT_SIGNALS","INTERRUPT","RESUME","NO_WRITES","RETURN","PREVIOUS","RUNTIME_PLACEHOLDER","RECURSION_LIMIT_DEFAULT","TAG_HIDDEN","TAG_NOSTREAM","SELF","TASKS","PUSH","PULL","TASK_NAMESPACE","NULL_TASK_ID","RESERVED","CHECKPOINT_NAMESPACE_SEPARATOR","CHECKPOINT_NAMESPACE_END","COMMAND_SYMBOL","CommandInstance","Record","Resume","Update","Nodes","CommandParams","SendInterface","Node","Args","_isSendInterface","Send","_isSend","Interrupt","Value","isInterrupted","Command","Omit","isCommand","_deserializeCommandSendObjectGraph","Map"],"sources":["../src/constants.d.ts"],"sourcesContent":["import { PendingWrite } from \"@langchain/langgraph-checkpoint\";\n/** Special reserved node name denoting the start of a graph. */\nexport declare const START = \"__start__\";\n/** Special reserved node name denoting the end of a graph. */\nexport declare const END = \"__end__\";\nexport declare const INPUT = \"__input__\";\nexport declare const COPY = \"__copy__\";\nexport declare const ERROR = \"__error__\";\n/** Special reserved cache namespaces */\nexport declare const CACHE_NS_WRITES = \"__pregel_ns_writes\";\nexport declare const CONFIG_KEY_SEND = \"__pregel_send\";\n/** config key containing function used to call a node (push task) */\nexport declare const CONFIG_KEY_CALL = \"__pregel_call\";\nexport declare const CONFIG_KEY_READ = \"__pregel_read\";\nexport declare const CONFIG_KEY_CHECKPOINTER = \"__pregel_checkpointer\";\nexport declare const CONFIG_KEY_RESUMING = \"__pregel_resuming\";\nexport declare const CONFIG_KEY_TASK_ID = \"__pregel_task_id\";\nexport declare const CONFIG_KEY_STREAM = \"__pregel_stream\";\nexport declare const CONFIG_KEY_RESUME_VALUE = \"__pregel_resume_value\";\nexport declare const CONFIG_KEY_RESUME_MAP = \"__pregel_resume_map\";\nexport declare const CONFIG_KEY_SCRATCHPAD = \"__pregel_scratchpad\";\n/** config key containing state from previous invocation of graph for the given thread */\nexport declare const CONFIG_KEY_PREVIOUS_STATE = \"__pregel_previous\";\nexport declare const CONFIG_KEY_DURABILITY = \"__pregel_durability\";\nexport declare const CONFIG_KEY_CHECKPOINT_ID = \"checkpoint_id\";\nexport declare const CONFIG_KEY_CHECKPOINT_NS = \"checkpoint_ns\";\nexport declare const CONFIG_KEY_NODE_FINISHED = \"__pregel_node_finished\";\nexport declare const CONFIG_KEY_CHECKPOINT_MAP = \"checkpoint_map\";\nexport declare const CONFIG_KEY_ABORT_SIGNALS = \"__pregel_abort_signals\";\n/** Special channel reserved for graph interrupts */\nexport declare const INTERRUPT = \"__interrupt__\";\n/** Special channel reserved for graph resume */\nexport declare const RESUME = \"__resume__\";\n/** Special channel reserved for cases when a task exits without any writes */\nexport declare const NO_WRITES = \"__no_writes__\";\n/** Special channel reserved for graph return */\nexport declare const RETURN = \"__return__\";\n/** Special channel reserved for graph previous state */\nexport declare const PREVIOUS = \"__previous__\";\nexport declare const RUNTIME_PLACEHOLDER = \"__pregel_runtime_placeholder__\";\nexport declare const RECURSION_LIMIT_DEFAULT = 25;\nexport declare const TAG_HIDDEN = \"langsmith:hidden\";\nexport declare const TAG_NOSTREAM = \"langsmith:nostream\";\nexport declare const SELF = \"__self__\";\nexport declare const TASKS = \"__pregel_tasks\";\nexport declare const PUSH = \"__pregel_push\";\nexport declare const PULL = \"__pregel_pull\";\nexport declare const TASK_NAMESPACE = \"6ba7b831-9dad-11d1-80b4-00c04fd430c8\";\nexport declare const NULL_TASK_ID = \"00000000-0000-0000-0000-000000000000\";\nexport declare const RESERVED: string[];\nexport declare const CHECKPOINT_NAMESPACE_SEPARATOR = \"|\";\nexport declare const CHECKPOINT_NAMESPACE_END = \":\";\n/** @internal */\ndeclare const COMMAND_SYMBOL: unique symbol;\n/**\n * Instance of a {@link Command} class.\n *\n * This is used to avoid IntelliSense suggesting public fields\n * of {@link Command} class when a plain object is expected.\n *\n * @see {@link Command}\n * @internal\n */\nexport declare class CommandInstance<Resume = unknown, Update = Record<string, unknown>, Nodes extends string = string> {\n [COMMAND_SYMBOL]: CommandParams<Resume, Update, Nodes>;\n constructor(args: CommandParams<Resume, Update, Nodes>);\n}\nexport interface SendInterface<Node extends string = string, Args = any> {\n node: Node;\n args: Args;\n}\nexport declare function _isSendInterface(x: unknown): x is SendInterface;\n/**\n *\n * A message or packet to send to a specific node in the graph.\n *\n * The `Send` class is used within a `StateGraph`'s conditional edges to\n * dynamically invoke a node with a custom state at the next step.\n *\n * Importantly, the sent state can differ from the core graph's state,\n * allowing for flexible and dynamic workflow management.\n *\n * One such example is a \"map-reduce\" workflow where your graph invokes\n * the same node multiple times in parallel with different states,\n * before aggregating the results back into the main graph's state.\n *\n * @example\n * ```typescript\n * import { Annotation, Send, StateGraph } from \"@langchain/langgraph\";\n *\n * const ChainState = Annotation.Root({\n * subjects: Annotation<string[]>,\n * jokes: Annotation<string[]>({\n * reducer: (a, b) => a.concat(b),\n * }),\n * });\n *\n * const continueToJokes = async (state: typeof ChainState.State) => {\n * return state.subjects.map((subject) => {\n * return new Send(\"generate_joke\", { subjects: [subject] });\n * });\n * };\n *\n * const graph = new StateGraph(ChainState)\n * .addNode(\"generate_joke\", (state) => ({\n * jokes: [`Joke about ${state.subjects}`],\n * }))\n * .addConditionalEdges(\"__start__\", continueToJokes)\n * .addEdge(\"generate_joke\", \"__end__\")\n * .compile();\n *\n * const res = await graph.invoke({ subjects: [\"cats\", \"dogs\"] });\n * console.log(res);\n *\n * // Invoking with two subjects results in a generated joke for each\n * // { subjects: [\"cats\", \"dogs\"], jokes: [`Joke about cats`, `Joke about dogs`] }\n * ```\n */\nexport declare class Send<Node extends string = string, Args = any> implements SendInterface<Node, Args> {\n lg_name: string;\n node: Node;\n args: Args;\n constructor(node: Node, args: Args);\n toJSON(): {\n lg_name: string;\n node: Node;\n args: Args;\n };\n}\nexport declare function _isSend(x: unknown): x is Send;\nexport type Interrupt<Value = any> = {\n id?: string;\n value?: Value;\n};\n/**\n * Checks if the given graph invoke / stream chunk contains interrupt.\n *\n * @example\n * ```ts\n * import { INTERRUPT, isInterrupted } from \"@langchain/langgraph\";\n *\n * const values = await graph.invoke({ foo: \"bar\" });\n * if (isInterrupted<string>(values)) {\n * const interrupt = values[INTERRUPT][0].value;\n * }\n * ```\n *\n * @param values - The values to check.\n * @returns `true` if the values contain an interrupt, `false` otherwise.\n */\nexport declare function isInterrupted<Value = unknown>(values: unknown): values is {\n [INTERRUPT]: Interrupt<Value>[];\n};\nexport type CommandParams<Resume = unknown, Update = Record<string, unknown>, Nodes extends string = string> = {\n /**\n * A discriminator field used to identify the type of object. Must be populated when serializing.\n *\n * Optional because it's not required to specify this when directly constructing a {@link Command}\n * object.\n */\n lg_name?: \"Command\";\n /**\n * Value to resume execution with. To be used together with {@link interrupt}.\n */\n resume?: Resume;\n /**\n * Graph to send the command to. Supported values are:\n * - None: the current graph (default)\n * - The specific name of the graph to send the command to\n * - {@link Command.PARENT}: closest parent graph (only supported when returned from a node in a subgraph)\n */\n graph?: string;\n /**\n * Update to apply to the graph's state.\n */\n update?: Update | [string, unknown][];\n /**\n * Can be one of the following:\n * - name of the node to navigate to next (any node that belongs to the specified `graph`)\n * - sequence of node names to navigate to next\n * - `Send` object (to execute a node with the input provided)\n * - sequence of `Send` objects\n */\n goto?: Nodes | SendInterface<Nodes> | (Nodes | SendInterface<Nodes>)[];\n};\n/**\n * One or more commands to update the graph's state and send messages to nodes.\n * Can be used to combine routing logic with state updates in lieu of conditional edges\n *\n * @example\n * ```ts\n * import { Annotation, Command } from \"@langchain/langgraph\";\n *\n * // Define graph state\n * const StateAnnotation = Annotation.Root({\n * foo: Annotation<string>,\n * });\n *\n * // Define the nodes\n * const nodeA = async (_state: typeof StateAnnotation.State) => {\n * console.log(\"Called A\");\n * // this is a replacement for a real conditional edge function\n * const goto = Math.random() > .5 ? \"nodeB\" : \"nodeC\";\n * // note how Command allows you to BOTH update the graph state AND route to the next node\n * return new Command({\n * // this is the state update\n * update: {\n * foo: \"a\",\n * },\n * // this is a replacement for an edge\n * goto,\n * });\n * };\n *\n * // Nodes B and C are unchanged\n * const nodeB = async (state: typeof StateAnnotation.State) => {\n * console.log(\"Called B\");\n * return {\n * foo: state.foo + \"|b\",\n * };\n * }\n *\n * const nodeC = async (state: typeof StateAnnotation.State) => {\n * console.log(\"Called C\");\n * return {\n * foo: state.foo + \"|c\",\n * };\n * }\n *\n * import { StateGraph } from \"@langchain/langgraph\";\n\n * // NOTE: there are no edges between nodes A, B and C!\n * const graph = new StateGraph(StateAnnotation)\n * .addNode(\"nodeA\", nodeA, {\n * ends: [\"nodeB\", \"nodeC\"],\n * })\n * .addNode(\"nodeB\", nodeB)\n * .addNode(\"nodeC\", nodeC)\n * .addEdge(\"__start__\", \"nodeA\")\n * .compile();\n *\n * await graph.invoke({ foo: \"\" });\n *\n * // Randomly oscillates between\n * // { foo: 'a|c' } and { foo: 'a|b' }\n * ```\n */\nexport declare class Command<Resume = unknown, Update extends Record<string, unknown> = Record<string, unknown>, Nodes extends string = string> extends CommandInstance<Resume, Update, Nodes> {\n readonly lg_name = \"Command\";\n lc_direct_tool_output: boolean;\n /**\n * Graph to send the command to. Supported values are:\n * - None: the current graph (default)\n * - The specific name of the graph to send the command to\n * - {@link Command.PARENT}: closest parent graph (only supported when returned from a node in a subgraph)\n */\n graph?: string;\n /**\n * Update to apply to the graph's state as a result of executing the node that is returning the command.\n * Written to the state as if the node had simply returned this value instead of the Command object.\n */\n update?: Update | [string, unknown][];\n /**\n * Value to resume execution with. To be used together with {@link interrupt}.\n */\n resume?: Resume;\n /**\n * Can be one of the following:\n * - name of the node to navigate to next (any node that belongs to the specified `graph`)\n * - sequence of node names to navigate to next\n * - {@link Send} object (to execute a node with the exact input provided in the {@link Send} object)\n * - sequence of {@link Send} objects\n */\n goto?: Nodes | Send<Nodes> | (Nodes | Send<Nodes>)[];\n static PARENT: string;\n constructor(args: Omit<CommandParams<Resume, Update, Nodes>, \"lg_name\">);\n /**\n * Convert the update field to a list of {@link PendingWrite} tuples\n * @returns List of {@link PendingWrite} tuples of the form `[channelKey, value]`.\n * @internal\n */\n _updateAsTuples(): PendingWrite[];\n toJSON(): {\n lg_name: string;\n update: Update | [string, unknown][] | undefined;\n resume: Resume | undefined;\n goto: Nodes | (Nodes | {\n lg_name: string;\n node: Nodes;\n args: any;\n })[] | {\n lg_name: string;\n node: Nodes;\n args: any;\n } | undefined;\n };\n}\n/**\n * A type guard to check if the given value is a {@link Command}.\n *\n * Useful for type narrowing when working with the {@link Command} object.\n *\n * @param x - The value to check.\n * @returns `true` if the value is a {@link Command}, `false` otherwise.\n */\nexport declare function isCommand(x: unknown): x is Command;\n/**\n * Reconstructs Command and Send objects from a deeply nested tree of anonymous objects\n * matching their interfaces.\n *\n * This is only exported for testing purposes. It is NOT intended to be used outside of\n * the Command and Send classes.\n *\n * @internal\n *\n * @param x - The command send tree to convert.\n * @param seen - A map of seen objects to avoid infinite loops.\n * @returns The converted command send tree.\n */\nexport declare function _deserializeCommandSendObjectGraph(x: unknown, seen?: Map<object, unknown>): unknown;\nexport {};\n"],"mappings":";;;;cAEqBC,KAAAA;AAArB;AAEqBC,cAAAA,GAAAA,GAAG,SAAA;;AAoHdgD,cA1FW1B,SAAAA,GA0FX0B,eAAAA;;;;AAUEK,cA5FS3B,QAAAA,GA8FT4B,cAAK;;cA/EHd,cAkI6BK,EAAAA,OAAAA,MAAAA;;;;AAgE3C;;;;;;AAAwLA,cAxLnKJ,eAwLmKI,CAAAA,SAAAA,OAAAA,EAAAA,SAxLxHH,MAwLwHG,CAAAA,MAAAA,EAAAA,OAAAA,CAAAA,EAAAA,cAAAA,MAAAA,GAAAA,MAAAA,CAAAA,CAAAA;GAvLnLL,cAAAA,CAqMQI,EArMSE,aAqMTF,CArMuBD,MAqMvBC,EArM+BA,MAqM/BA,EArMuCC,KAqMvCD,CAAAA;aAIAD,CAAAA,IAAAA,EAxMSG,aAwMTH,CAxMuBA,MAwMvBA,EAxM+BC,MAwM/BD,EAxMuCE,KAwMvCF,CAAAA;;AAQWE,UA9MPE,aA8MOF,CAAAA,aAAAA,MAAAA,GAAAA,MAAAA,EAAAA,OAAAA,GAAAA,CAAAA,CAAAA;MAALM,EA7MTH,IA6MSG;MAAeN,EA5MxBI,IA4MwBJ;;;;;;;;;;;;;;;;AAgClC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cA3LqBM,0DAA0DJ,cAAcC,MAAMC;;QAEzFD;QACAC;oBACYD,YAAYC;;;UAGpBD;UACAC;;;KAIFI;;UAEAC;;;;;;;;;;;;;;;;;;iBAkBYC;GACnBjC,SAAAA,GAAY+B,UAAUC;;KAEfR,yCAAyCJ;;;;;;;;;;;WAWxCC;;;;;;;;;;;WAWAC;;;;;;;;SAQFC,QAAQE,cAAcF,UAAUA,QAAQE,cAAcF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAgE5CW,yCAAyCd,0BAA0BA,gEAAgED,gBAAgBE,QAAQC,QAAQC;;;;;;;;;;;;;;WAc3KD;;;;WAIAD;;;;;;;;SAQFE,QAAQM,KAAKN,UAAUA,QAAQM,KAAKN;;oBAEzBY,KAAKX,cAAcH,QAAQC,QAAQC;;;;;;qBAMlC/C;;;YAGP8C;YACAD;UACFE,SAASA;;YAELA;;;;YAIAA;;;;;;;;;;;;;iBAaMa,SAAAA,mBAA4BF"}
1
+ {"version":3,"file":"constants.d.ts","names":[],"sources":["../src/constants.ts"],"mappings":";;;;cAGa,KAAA;AAAb;AAAA,cAEa,GAAA;;cAiCA,SAAA;;cAQA,QAAA;;cA4CP,cAAA;;;;;;;AAwBN;;;cAba,eAAA,4BAEF,MAAA;EAAA,CAGR,cAAA,GAAiB,aAAA,CAAc,MAAA,EAAQ,MAAA,EAAQ,KAAA;EAEhD,WAAA,CAAY,IAAA,EAAM,aAAA,CAAc,MAAA,EAAQ,MAAA,EAAQ,KAAA;AAAA;AAAA,UAMjC,aAAA;EACf,IAAA,EAAM,IAAA;EACN,IAAA,EAAM,IAAA;AAAA;AA4DR;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA;;;;;;;;;AAzBA,cAAa,IAAA,sDACA,aAAA,CAAc,IAAA,EAAM,IAAA;EAE/B,OAAA;EAEO,IAAA,EAAM,IAAA;EAEN,IAAA,EAAM,IAAA;EAEb,WAAA,CAAY,IAAA,EAAM,IAAA,EAAM,IAAA,EAAM,IAAA;EAK9B,MAAA,CAAA;;;;;;KAWU,SAAA;EACV,EAAA;EACA,KAAA,GAAQ,KAAA;AAAA;;AA2BV;;;;;;;;;;;;;;;iBARgB,aAAA,iBAAA,CACd,MAAA,YACC,MAAA;EAAA,CAAa,SAAA,GAAY,SAAA,CAAU,KAAA;AAAA;AAAA,KAM1B,aAAA,4BAED,MAAA;EAcT;;;;;;EALA,OAAA;EA4BI;;;EAvBJ,MAAA,GAAS,MAAA;EAwBkB;;;AAiE7B;;;EAlFE,KAAA;EAoFyC;;;EA/EzC,MAAA,GAAS,MAAA;EAkGA;;;;;;;EAzFT,IAAA,GACI,KAAA,GACA,aAAA,CAAc,KAAA,KACb,KAAA,GAAQ,aAAA,CAAc,KAAA;AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;cAiEhB,OAAA,kCAEI,MAAA,oBAA0B,MAAA,0DAEjC,eAAA,CAAgB,MAAA,EAAQ,MAAA,EAAQ,KAAA;EAAA,SAC/B,OAAA;EAET,qBAAA;;AAuGF;;;;;EA/FE,KAAA;EA+F0C;;;;EAzF1C,MAAA,GAAS,MAAA;;;;EAKT,MAAA,GAAS,MAAA;;;;;;;;EAST,IAAA,GAAO,KAAA,GAAQ,IAAA,CAAK,KAAA,KAAU,KAAA,GAAQ,IAAA,CAAK,KAAA;EAAA,OAEpC,MAAA;EAEP,WAAA,CAAY,IAAA,EAAM,IAAA,CAAK,aAAA,CAAc,MAAA,EAAQ,MAAA,EAAQ,KAAA;;;;;;EAmBrD,eAAA,CAAA,GAAmB,YAAA;EAoBnB,MAAA,CAAA;;;;;;;;;;;;;;;;;;;;;;;iBAgCc,SAAA,CAAU,CAAA,YAAa,CAAA,IAAK,OAAA"}
@@ -1 +1 @@
1
- {"version":3,"file":"errors.d.cts","names":["Command","Interrupt","BaseLangGraphErrorFields","BaseLangGraphError","Error","GraphBubbleUp","GraphRecursionError","GraphValueError","GraphInterrupt","NodeInterrupt","ParentCommand","isParentCommand","isGraphBubbleUp","isGraphInterrupt","EmptyInputError","EmptyChannelError","InvalidUpdateError","MultipleSubgraphsError","UnreachableNodeError","RemoteException","StateGraphInputError","getSubgraphsSeenSet"],"sources":["../src/errors.d.ts"],"sourcesContent":["import { Command, Interrupt } from \"./constants.js\";\nexport type BaseLangGraphErrorFields = {\n lc_error_code?: \"GRAPH_RECURSION_LIMIT\" | \"INVALID_CONCURRENT_GRAPH_UPDATE\" | \"INVALID_GRAPH_NODE_RETURN_VALUE\" | \"MISSING_CHECKPOINTER\" | \"MULTIPLE_SUBGRAPHS\" | \"UNREACHABLE_NODE\";\n};\n/** @category Errors */\nexport declare class BaseLangGraphError extends Error {\n lc_error_code?: string;\n constructor(message?: string, fields?: BaseLangGraphErrorFields);\n}\nexport declare class GraphBubbleUp extends BaseLangGraphError {\n get is_bubble_up(): boolean;\n}\nexport declare class GraphRecursionError extends BaseLangGraphError {\n constructor(message?: string, fields?: BaseLangGraphErrorFields);\n static get unminifiable_name(): string;\n}\nexport declare class GraphValueError extends BaseLangGraphError {\n constructor(message?: string, fields?: BaseLangGraphErrorFields);\n static get unminifiable_name(): string;\n}\nexport declare class GraphInterrupt extends GraphBubbleUp {\n interrupts: Interrupt[];\n constructor(interrupts?: Interrupt[], fields?: BaseLangGraphErrorFields);\n static get unminifiable_name(): string;\n}\n/** Raised by a node to interrupt execution. */\nexport declare class NodeInterrupt extends GraphInterrupt {\n constructor(message: any, fields?: BaseLangGraphErrorFields);\n static get unminifiable_name(): string;\n}\nexport declare class ParentCommand extends GraphBubbleUp {\n command: Command;\n constructor(command: Command);\n static get unminifiable_name(): string;\n}\nexport declare function isParentCommand(e?: unknown): e is ParentCommand;\nexport declare function isGraphBubbleUp(e?: unknown): e is GraphBubbleUp;\nexport declare function isGraphInterrupt(e?: unknown): e is GraphInterrupt;\nexport declare class EmptyInputError extends BaseLangGraphError {\n constructor(message?: string, fields?: BaseLangGraphErrorFields);\n static get unminifiable_name(): string;\n}\nexport declare class EmptyChannelError extends BaseLangGraphError {\n constructor(message?: string, fields?: BaseLangGraphErrorFields);\n static get unminifiable_name(): string;\n}\nexport declare class InvalidUpdateError extends BaseLangGraphError {\n constructor(message?: string, fields?: BaseLangGraphErrorFields);\n static get unminifiable_name(): string;\n}\n/**\n * @deprecated This exception type is no longer thrown.\n */\nexport declare class MultipleSubgraphsError extends BaseLangGraphError {\n constructor(message?: string, fields?: BaseLangGraphErrorFields);\n static get unminifiable_name(): string;\n}\nexport declare class UnreachableNodeError extends BaseLangGraphError {\n constructor(message?: string, fields?: BaseLangGraphErrorFields);\n static get unminifiable_name(): string;\n}\n/**\n * Exception raised when an error occurs in the remote graph.\n */\nexport declare class RemoteException extends BaseLangGraphError {\n constructor(message?: string, fields?: BaseLangGraphErrorFields);\n static get unminifiable_name(): string;\n}\n/**\n * Error thrown when invalid input is provided to a StateGraph.\n *\n * This typically means that the input to the StateGraph constructor or builder\n * did not match the required types. A valid input should be a\n * StateDefinition, an Annotation.Root, or a Zod schema.\n *\n * @example\n * // Example of incorrect usage:\n * try {\n * new StateGraph({ foo: \"bar\" }); // Not a valid input\n * } catch (err) {\n * if (err instanceof StateGraphInputError) {\n * console.error(err.message);\n * }\n * }\n */\nexport declare class StateGraphInputError extends BaseLangGraphError {\n /**\n * Create a new StateGraphInputError.\n * @param message - Optional custom error message.\n * @param fields - Optional additional error fields.\n */\n constructor(message?: string, fields?: BaseLangGraphErrorFields);\n /**\n * The unminifiable (static, human-readable) error name for this error class.\n */\n static get unminifiable_name(): string;\n}\n/**\n * Used for subgraph detection.\n */\nexport declare const getSubgraphsSeenSet: () => any;\n"],"mappings":";;;KACYE,wBAAAA;;AAAZ,CAAA;AAIA;AAAuC,cAAlBC,kBAAAA,SAA2BC,KAAAA,CAAT;eAEIF,CAAAA,EAAAA,MAAAA;aAFKE,CAAAA,OAAAA,CAAAA,EAAAA,MAAAA,EAAAA,MAAAA,CAAAA,EAELF,wBAFKE;;AAI3BC,cAAAA,aAAAA,SAAsBF,kBAAAA,CAAkB;EAGxCG,IAAAA,YAAAA,CAAAA,CAAAA,EAAAA,OAAmB;;AACGJ,cADtBI,mBAAAA,SAA4BH,kBAAAA,CACND;aADMC,CAAAA,OAAAA,CAAAA,EAAAA,MAAAA,EAAAA,MAAAA,CAAAA,EACND,wBADMC;EAAkB,WAAA,iBAAA,CAAA,CAAA,EAAA,MAAA;AAInE;AAAoC,cAAfI,eAAAA,SAAwBJ,kBAAAA,CAAT;aACOD,CAAAA,OAAAA,CAAAA,EAAAA,MAAAA,EAAAA,MAAAA,CAAAA,EAAAA,wBAAAA;aADEC,iBAAAA,CAAAA,CAAAA,EAAAA,MAAAA;;AAIxBK,cAAAA,cAAAA,SAAuBH,aAAAA,CAAT;EAAA,UAAA,EACnBJ,SADmB,EAAA;aACnBA,CAAAA,UAAAA,CAAAA,EACaA,SADbA,EAAAA,EAAAA,MAAAA,CAAAA,EACmCC,wBADnCD;aACaA,iBAAAA,CAAAA,CAAAA,EAAAA,MAAAA;;;AAF4B,cAMpCQ,aAAAA,SAAsBD,cAAAA,CANc;EAMpCC,WAAAA,CAAAA,OAAa,EAAA,GAAA,EAAA,MAAA,CAAA,EACKP,wBADL;EAAA,WAAA,iBAAA,CAAA,CAAA,EAAA,MAAA;;AAASM,cAItBE,aAAAA,SAAsBL,aAAAA,CAJAG;EAAc,OAAA,EAK5CR,OAL4C;EAIpCU,WAAAA,CAAAA,OAAa,EAETV,OAFS;EAAA,WAAA,iBAAA,CAAA,CAAA,EAAA,MAAA;;AAETA,iBAGDW,eAAAA,CAHCX,CAAAA,CAAAA,EAAAA,OAAAA,CAAAA,EAAAA,CAAAA,IAGkCU,aAHlCV;AAFkBK,iBAMnBO,eAAAA,CANmBP,CAAAA,CAAAA,EAAAA,OAAAA,CAAAA,EAAAA,CAAAA,IAMgBA,aANhBA;AAAa,iBAOhCQ,gBAAAA,CAPgC,CAAA,CAAA,EAAA,OAAA,CAAA,EAAA,CAAA,IAOIL,cAPJ;AAKhCG,cAGHG,eAAAA,SAAwBX,kBAAAA,CAH2B;EAChDS,WAAAA,CAAAA,OAAe,CAAA,EAAA,MAAA,EAAoBP,MAAa,CAAbA,EAGhBH,wBAH6B;EAChDW,WAAAA,iBAAgB,CAAA,CAAA,EAAoBL,MAAAA;AAC5D;AAAoC,cAIfO,iBAAAA,SAA0BZ,kBAAAA,CAJX;aACOD,CAAAA,OAAAA,CAAAA,EAAAA,MAAAA,EAAAA,MAAAA,CAAAA,EAIAA,wBAJAA;aADEC,iBAAAA,CAAAA,CAAAA,EAAAA,MAAAA;;AAIxBY,cAIAC,kBAAAA,SAA2Bb,kBAAAA,CAJV;EAAA,WAAA,CAAA,OAAA,CAAA,EAAA,MAAA,EAAA,MAAA,CAAA,EAKKD,wBALL;aACKA,iBAAAA,CAAAA,CAAAA,EAAAA,MAAAA;;;AAG3C;;AAC2CA,cAMtBe,sBAAAA,SAA+Bd,kBAAAA,CANTD;aADKC,CAAAA,OAAAA,CAAAA,EAAAA,MAAAA,EAAAA,MAAAA,CAAAA,EAQLD,wBARKC;EAAkB,WAAA,iBAAA,CAAA,CAAA,EAAA,MAAA;AAOlE;AAA2C,cAItBe,oBAAAA,SAA6Bf,kBAAAA,CAJP;aACAD,CAAAA,OAAAA,CAAAA,EAAAA,MAAAA,EAAAA,MAAAA,CAAAA,EAIAA,wBAJAA;aADSC,iBAAAA,CAAAA,CAAAA,EAAAA,MAAAA;;AAIpD;;;AAAkDA,cAO7BgB,eAAAA,SAAwBhB,kBAAAA,CAPKA;EAAkB,WAAA,CAAA,OAAA,CAAA,EAAA,MAAA,EAAA,MAAA,CAAA,EAQzBD,wBARyB;EAO/CiB,WAAAA,iBAAe,CAAA,CAAA,EAAA,MAAA;;;;;AAqBpC;;;;;AAeA;;;;;;;;;cAfqBC,oBAAAA,SAA6BjB,kBAAAA;;;;;;yCAMPD;;;;;;;;;cAStBmB"}
1
+ {"version":3,"file":"errors.d.cts","names":[],"sources":["../src/errors.ts"],"mappings":";;;KAIY,wBAAA;EACV,aAAA;AAAA;;cAWW,kBAAA,SAA2B,KAAA;EACtC,aAAA;EAEA,WAAA,CAAY,OAAA,WAAkB,MAAA,GAAS,wBAAA;AAAA;AAAA,cAU5B,aAAA,SAAsB,kBAAA;EAAA,IAC7B,YAAA,CAAA;AAAA;AAAA,cAKO,mBAAA,SAA4B,kBAAA;EACvC,WAAA,CAAY,OAAA,WAAkB,MAAA,GAAS,wBAAA;EAAA,WAK5B,iBAAA,CAAA;AAAA;AAAA,cAKA,eAAA,SAAwB,kBAAA;EACnC,WAAA,CAAY,OAAA,WAAkB,MAAA,GAAS,wBAAA;EAAA,WAK5B,iBAAA,CAAA;AAAA;AAAA,cAKA,cAAA,SAAuB,aAAA;EAClC,UAAA,EAAY,SAAA;EAEZ,WAAA,CAAY,UAAA,GAAa,SAAA,IAAa,MAAA,GAAS,wBAAA;EAAA,WAMpC,iBAAA,CAAA;AAAA;AA/Bb;AAAA,cAqCa,aAAA,SAAsB,cAAA;EAEjC,WAAA,CAAY,OAAA,OAAc,MAAA,GAAS,wBAAA;EAAA,WAKxB,iBAAA,CAAA;AAAA;AAAA,cAKA,aAAA,SAAsB,aAAA;EACjC,OAAA,EAAS,OAAA;EAET,WAAA,CAAY,OAAA,EAAS,OAAA;EAAA,WAMV,iBAAA,CAAA;AAAA;AAAA,iBAKG,eAAA,CAAgB,CAAA,aAAc,CAAA,IAAK,aAAA;AAAA,iBAOnC,eAAA,CAAgB,CAAA,aAAc,CAAA,IAAK,aAAA;AAAA,iBAInC,gBAAA,CAAiB,CAAA,aAAc,CAAA,IAAK,cAAA;AAAA,cAUvC,eAAA,SAAwB,kBAAA;EACnC,WAAA,CAAY,OAAA,WAAkB,MAAA,GAAS,wBAAA;EAAA,WAK5B,iBAAA,CAAA;AAAA;AAAA,cAKA,iBAAA,SAA0B,kBAAA;EACrC,WAAA,CAAY,OAAA,WAAkB,MAAA,GAAS,wBAAA;EAAA,WAK5B,iBAAA,CAAA;AAAA;AAAA,cAKA,kBAAA,SAA2B,kBAAA;EACtC,WAAA,CAAY,OAAA,WAAkB,MAAA,GAAS,wBAAA;EAAA,WAK5B,iBAAA,CAAA;AAAA;;;;cAQA,sBAAA,SAA+B,kBAAA;EAC1C,WAAA,CAAY,OAAA,WAAkB,MAAA,GAAS,wBAAA;EAAA,WAK5B,iBAAA,CAAA;AAAA;AAAA,cAKA,oBAAA,SAA6B,kBAAA;EACxC,WAAA,CAAY,OAAA,WAAkB,MAAA,GAAS,wBAAA;EAAA,WAK5B,iBAAA,CAAA;AAAA;;;;cAQA,eAAA,SAAwB,kBAAA;EACnC,WAAA,CAAY,OAAA,WAAkB,MAAA,GAAS,wBAAA;EAAA,WAK5B,iBAAA,CAAA;AAAA;;AAlHb;;;;;;;;;;;;AAYA;;;;cA4Ha,oBAAA,SAA6B,kBAAA;EA5HP;;;;;EAkIjC,WAAA,CAAY,OAAA,WAAkB,MAAA,GAAS,wBAAA;EA/HvC;;;EAAA,WAyIW,iBAAA,CAAA;AAAA;;AA9Hb;;cAsIa,mBAAA"}