@langchain/langgraph 1.0.12 → 1.0.13

package/dist/channels/last_value.cjs

@@ -0,0 +1,98 @@
+const require_errors = require('../errors.cjs');
+const require_base = require('./base.cjs');
+
+//#region src/channels/last_value.ts
+/**
+* Stores the last value received, can receive at most one value per step.
+*
+* Since `update` is only called once per step and value can only be of length 1,
+* LastValue always stores the last value of a single node. If multiple nodes attempt to
+* write to this channel in a single step, an error will be thrown.
+* @internal
+*/
+var LastValue = class LastValue extends require_base.BaseChannel {
+	lc_graph_name = "LastValue";
+	value = [];
+	constructor(initialValueFactory) {
+		super();
+		this.initialValueFactory = initialValueFactory;
+		if (initialValueFactory) this.value = [initialValueFactory()];
+	}
+	fromCheckpoint(checkpoint) {
+		const empty = new LastValue(this.initialValueFactory);
+		if (typeof checkpoint !== "undefined") empty.value = [checkpoint];
+		return empty;
+	}
+	update(values) {
+		if (values.length === 0) return false;
+		if (values.length !== 1) throw new require_errors.InvalidUpdateError("LastValue can only receive one value per step.", { lc_error_code: "INVALID_CONCURRENT_GRAPH_UPDATE" });
+		this.value = [values[values.length - 1]];
+		return true;
+	}
+	get() {
+		if (this.value.length === 0) throw new require_errors.EmptyChannelError();
+		return this.value[0];
+	}
+	checkpoint() {
+		if (this.value.length === 0) throw new require_errors.EmptyChannelError();
+		return this.value[0];
+	}
+	isAvailable() {
+		return this.value.length !== 0;
+	}
+};
+/**
+* Stores the last value received, but only made available after finish().
+* Once made available, clears the value.
+*/
+var LastValueAfterFinish = class LastValueAfterFinish extends require_base.BaseChannel {
+	lc_graph_name = "LastValueAfterFinish";
+	value = [];
+	finished = false;
+	fromCheckpoint(checkpoint) {
+		const empty = new LastValueAfterFinish();
+		if (typeof checkpoint !== "undefined") {
+			const [value, finished] = checkpoint;
+			empty.value = [value];
+			empty.finished = finished;
+		}
+		return empty;
+	}
+	update(values) {
+		if (values.length === 0) return false;
+		this.finished = false;
+		this.value = [values[values.length - 1]];
+		return true;
+	}
+	get() {
+		if (this.value.length === 0 || !this.finished) throw new require_errors.EmptyChannelError();
+		return this.value[0];
+	}
+	checkpoint() {
+		if (this.value.length === 0) return void 0;
+		return [this.value[0], this.finished];
+	}
+	consume() {
+		if (this.finished) {
+			this.finished = false;
+			this.value = [];
+			return true;
+		}
+		return false;
+	}
+	finish() {
+		if (!this.finished && this.value.length > 0) {
+			this.finished = true;
+			return true;
+		}
+		return false;
+	}
+	isAvailable() {
+		return this.value.length !== 0 && this.finished;
+	}
+};
+
+//#endregion
+exports.LastValue = LastValue;
+exports.LastValueAfterFinish = LastValueAfterFinish;
+//# sourceMappingURL=last_value.cjs.map

package/dist/channels/last_value.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"last_value.cjs","names":["BaseChannel","InvalidUpdateError","EmptyChannelError"],"sources":["../../src/channels/last_value.ts"],"sourcesContent":["import { EmptyChannelError, InvalidUpdateError } from \"../errors.js\";\nimport { BaseChannel } from \"./base.js\";\n\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 class LastValue<Value> extends BaseChannel<Value, Value, Value> {\n  lc_graph_name = \"LastValue\";\n\n  // value is an array so we don't misinterpret an update to undefined as no write\n  value: [Value] | [] = [];\n\n  constructor(protected initialValueFactory?: () => Value) {\n    super();\n    if (initialValueFactory) {\n      this.value = [initialValueFactory()];\n    }\n  }\n\n  fromCheckpoint(checkpoint?: Value) {\n    const empty = new LastValue<Value>(this.initialValueFactory);\n    if (typeof checkpoint !== \"undefined\") {\n      empty.value = [checkpoint];\n    }\n\n    return empty as this;\n  }\n\n  update(values: Value[]): boolean {\n    if (values.length === 0) {\n      return false;\n    }\n    if (values.length !== 1) {\n      throw new InvalidUpdateError(\n        \"LastValue can only receive one value per step.\",\n        { lc_error_code: \"INVALID_CONCURRENT_GRAPH_UPDATE\" }\n      );\n    }\n\n    // eslint-disable-next-line prefer-destructuring\n    this.value = [values[values.length - 1]];\n    return true;\n  }\n\n  get(): Value {\n    if (this.value.length === 0) {\n      throw new EmptyChannelError();\n    }\n    return this.value[0];\n  }\n\n  checkpoint(): Value {\n    if (this.value.length === 0) {\n      throw new EmptyChannelError();\n    }\n    return this.value[0];\n  }\n\n  isAvailable(): boolean {\n    return this.value.length !== 0;\n  }\n}\n\n/**\n * Stores the last value received, but only made available after finish().\n * Once made available, clears the value.\n */\nexport class LastValueAfterFinish<Value> extends BaseChannel<\n  Value,\n  Value,\n  [Value, boolean]\n> {\n  lc_graph_name = \"LastValueAfterFinish\";\n\n  // value is an array so we don't misinterpret an update to undefined as no write\n  value: [Value] | [] = [];\n\n  finished: boolean = false;\n\n  fromCheckpoint(checkpoint?: [Value, boolean]) {\n    const empty = new LastValueAfterFinish<Value>();\n    if (typeof checkpoint !== \"undefined\") {\n      const [value, finished] = checkpoint;\n      empty.value = [value];\n      empty.finished = finished;\n    }\n    return empty as this;\n  }\n\n  update(values: Value[]): boolean {\n    if (values.length === 0) {\n      return false;\n    }\n\n    this.finished = false;\n    // eslint-disable-next-line prefer-destructuring\n    this.value = [values[values.length - 1]];\n    return true;\n  }\n\n  get(): Value {\n    if (this.value.length === 0 || !this.finished) {\n      throw new EmptyChannelError();\n    }\n    return this.value[0];\n  }\n\n  checkpoint(): [Value, boolean] | undefined {\n    if (this.value.length === 0) return undefined;\n    return [this.value[0], this.finished];\n  }\n\n  consume(): boolean {\n    if (this.finished) {\n      this.finished = false;\n      this.value = [];\n      return true;\n    }\n    return false;\n  }\n\n  finish(): boolean {\n    if (!this.finished && this.value.length > 0) {\n      this.finished = true;\n      return true;\n    }\n    return false;\n  }\n\n  isAvailable(): boolean {\n    return this.value.length !== 0 && this.finished;\n  }\n}\n"],"mappings":";;;;;;;;;;;;AAWA,IAAa,YAAb,MAAa,kBAAyBA,yBAAiC;CACrE,gBAAgB;CAGhB,QAAsB,EAAE;CAExB,YAAY,AAAU,qBAAmC;AACvD,SAAO;EADa;AAEpB,MAAI,oBACF,MAAK,QAAQ,CAAC,qBAAqB,CAAC;;CAIxC,eAAe,YAAoB;EACjC,MAAM,QAAQ,IAAI,UAAiB,KAAK,oBAAoB;AAC5D,MAAI,OAAO,eAAe,YACxB,OAAM,QAAQ,CAAC,WAAW;AAG5B,SAAO;;CAGT,OAAO,QAA0B;AAC/B,MAAI,OAAO,WAAW,EACpB,QAAO;AAET,MAAI,OAAO,WAAW,EACpB,OAAM,IAAIC,kCACR,kDACA,EAAE,eAAe,mCAAmC,CACrD;AAIH,OAAK,QAAQ,CAAC,OAAO,OAAO,SAAS,GAAG;AACxC,SAAO;;CAGT,MAAa;AACX,MAAI,KAAK,MAAM,WAAW,EACxB,OAAM,IAAIC,kCAAmB;AAE/B,SAAO,KAAK,MAAM;;CAGpB,aAAoB;AAClB,MAAI,KAAK,MAAM,WAAW,EACxB,OAAM,IAAIA,kCAAmB;AAE/B,SAAO,KAAK,MAAM;;CAGpB,cAAuB;AACrB,SAAO,KAAK,MAAM,WAAW;;;;;;;AAQjC,IAAa,uBAAb,MAAa,6BAAoCF,yBAI/C;CACA,gBAAgB;CAGhB,QAAsB,EAAE;CAExB,WAAoB;CAEpB,eAAe,YAA+B;EAC5C,MAAM,QAAQ,IAAI,sBAA6B;AAC/C,MAAI,OAAO,eAAe,aAAa;GACrC,MAAM,CAAC,OAAO,YAAY;AAC1B,SAAM,QAAQ,CAAC,MAAM;AACrB,SAAM,WAAW;;AAEnB,SAAO;;CAGT,OAAO,QAA0B;AAC/B,MAAI,OAAO,WAAW,EACpB,QAAO;AAGT,OAAK,WAAW;AAEhB,OAAK,QAAQ,CAAC,OAAO,OAAO,SAAS,GAAG;AACxC,SAAO;;CAGT,MAAa;AACX,MAAI,KAAK,MAAM,WAAW,KAAK,CAAC,KAAK,SACnC,OAAM,IAAIE,kCAAmB;AAE/B,SAAO,KAAK,MAAM;;CAGpB,aAA2C;AACzC,MAAI,KAAK,MAAM,WAAW,EAAG,QAAO;AACpC,SAAO,CAAC,KAAK,MAAM,IAAI,KAAK,SAAS;;CAGvC,UAAmB;AACjB,MAAI,KAAK,UAAU;AACjB,QAAK,WAAW;AAChB,QAAK,QAAQ,EAAE;AACf,UAAO;;AAET,SAAO;;CAGT,SAAkB;AAChB,MAAI,CAAC,KAAK,YAAY,KAAK,MAAM,SAAS,GAAG;AAC3C,QAAK,WAAW;AAChB,UAAO;;AAET,SAAO;;CAGT,cAAuB;AACrB,SAAO,KAAK,MAAM,WAAW,KAAK,KAAK"}

package/dist/channels/last_value.d.cts

@@ -0,0 +1,42 @@
+import { BaseChannel } from "./base.cjs";
+
+//#region src/channels/last_value.d.ts
+
+/**
+ * Stores the last value received, can receive at most one value per step.
+ *
+ * Since `update` is only called once per step and value can only be of length 1,
+ * LastValue always stores the last value of a single node. If multiple nodes attempt to
+ * write to this channel in a single step, an error will be thrown.
+ * @internal
+ */
+declare class LastValue<Value> extends BaseChannel<Value, Value, Value> {
+  protected initialValueFactory?: (() => Value) | undefined;
+  lc_graph_name: string;
+  value: [Value] | [];
+  constructor(initialValueFactory?: (() => Value) | undefined);
+  fromCheckpoint(checkpoint?: Value): this;
+  update(values: Value[]): boolean;
+  get(): Value;
+  checkpoint(): Value;
+  isAvailable(): boolean;
+}
+/**
+ * Stores the last value received, but only made available after finish().
+ * Once made available, clears the value.
+ */
+declare class LastValueAfterFinish<Value> extends BaseChannel<Value, Value, [Value, boolean]> {
+  lc_graph_name: string;
+  value: [Value] | [];
+  finished: boolean;
+  fromCheckpoint(checkpoint?: [Value, boolean]): this;
+  update(values: Value[]): boolean;
+  get(): Value;
+  checkpoint(): [Value, boolean] | undefined;
+  consume(): boolean;
+  finish(): boolean;
+  isAvailable(): boolean;
+}
+//#endregion
+export { LastValue, LastValueAfterFinish };
+//# sourceMappingURL=last_value.d.cts.map

package/dist/channels/last_value.d.cts.map

@@ -0,0 +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"}

package/dist/channels/last_value.d.ts

@@ -0,0 +1,42 @@
+import { BaseChannel } from "./base.js";
+
+//#region src/channels/last_value.d.ts
+
+/**
+ * Stores the last value received, can receive at most one value per step.
+ *
+ * Since `update` is only called once per step and value can only be of length 1,
+ * LastValue always stores the last value of a single node. If multiple nodes attempt to
+ * write to this channel in a single step, an error will be thrown.
+ * @internal
+ */
+declare class LastValue<Value> extends BaseChannel<Value, Value, Value> {
+  protected initialValueFactory?: (() => Value) | undefined;
+  lc_graph_name: string;
+  value: [Value] | [];
+  constructor(initialValueFactory?: (() => Value) | undefined);
+  fromCheckpoint(checkpoint?: Value): this;
+  update(values: Value[]): boolean;
+  get(): Value;
+  checkpoint(): Value;
+  isAvailable(): boolean;
+}
+/**
+ * Stores the last value received, but only made available after finish().
+ * Once made available, clears the value.
+ */
+declare class LastValueAfterFinish<Value> extends BaseChannel<Value, Value, [Value, boolean]> {
+  lc_graph_name: string;
+  value: [Value] | [];
+  finished: boolean;
+  fromCheckpoint(checkpoint?: [Value, boolean]): this;
+  update(values: Value[]): boolean;
+  get(): Value;
+  checkpoint(): [Value, boolean] | undefined;
+  consume(): boolean;
+  finish(): boolean;
+  isAvailable(): boolean;
+}
+//#endregion
+export { LastValue, LastValueAfterFinish };
+//# sourceMappingURL=last_value.d.ts.map

package/dist/channels/last_value.d.ts.map

@@ -0,0 +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"}

package/dist/channels/last_value.js

@@ -0,0 +1,97 @@
+import { EmptyChannelError, InvalidUpdateError } from "../errors.js";
+import { BaseChannel } from "./base.js";
+
+//#region src/channels/last_value.ts
+/**
+* Stores the last value received, can receive at most one value per step.
+*
+* Since `update` is only called once per step and value can only be of length 1,
+* LastValue always stores the last value of a single node. If multiple nodes attempt to
+* write to this channel in a single step, an error will be thrown.
+* @internal
+*/
+var LastValue = class LastValue extends BaseChannel {
+	lc_graph_name = "LastValue";
+	value = [];
+	constructor(initialValueFactory) {
+		super();
+		this.initialValueFactory = initialValueFactory;
+		if (initialValueFactory) this.value = [initialValueFactory()];
+	}
+	fromCheckpoint(checkpoint) {
+		const empty = new LastValue(this.initialValueFactory);
+		if (typeof checkpoint !== "undefined") empty.value = [checkpoint];
+		return empty;
+	}
+	update(values) {
+		if (values.length === 0) return false;
+		if (values.length !== 1) throw new InvalidUpdateError("LastValue can only receive one value per step.", { lc_error_code: "INVALID_CONCURRENT_GRAPH_UPDATE" });
+		this.value = [values[values.length - 1]];
+		return true;
+	}
+	get() {
+		if (this.value.length === 0) throw new EmptyChannelError();
+		return this.value[0];
+	}
+	checkpoint() {
+		if (this.value.length === 0) throw new EmptyChannelError();
+		return this.value[0];
+	}
+	isAvailable() {
+		return this.value.length !== 0;
+	}
+};
+/**
+* Stores the last value received, but only made available after finish().
+* Once made available, clears the value.
+*/
+var LastValueAfterFinish = class LastValueAfterFinish extends BaseChannel {
+	lc_graph_name = "LastValueAfterFinish";
+	value = [];
+	finished = false;
+	fromCheckpoint(checkpoint) {
+		const empty = new LastValueAfterFinish();
+		if (typeof checkpoint !== "undefined") {
+			const [value, finished] = checkpoint;
+			empty.value = [value];
+			empty.finished = finished;
+		}
+		return empty;
+	}
+	update(values) {
+		if (values.length === 0) return false;
+		this.finished = false;
+		this.value = [values[values.length - 1]];
+		return true;
+	}
+	get() {
+		if (this.value.length === 0 || !this.finished) throw new EmptyChannelError();
+		return this.value[0];
+	}
+	checkpoint() {
+		if (this.value.length === 0) return void 0;
+		return [this.value[0], this.finished];
+	}
+	consume() {
+		if (this.finished) {
+			this.finished = false;
+			this.value = [];
+			return true;
+		}
+		return false;
+	}
+	finish() {
+		if (!this.finished && this.value.length > 0) {
+			this.finished = true;
+			return true;
+		}
+		return false;
+	}
+	isAvailable() {
+		return this.value.length !== 0 && this.finished;
+	}
+};
+
+//#endregion
+export { LastValue, LastValueAfterFinish };
+//# sourceMappingURL=last_value.js.map

package/dist/channels/last_value.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"last_value.js","names":[],"sources":["../../src/channels/last_value.ts"],"sourcesContent":["import { EmptyChannelError, InvalidUpdateError } from \"../errors.js\";\nimport { BaseChannel } from \"./base.js\";\n\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 class LastValue<Value> extends BaseChannel<Value, Value, Value> {\n  lc_graph_name = \"LastValue\";\n\n  // value is an array so we don't misinterpret an update to undefined as no write\n  value: [Value] | [] = [];\n\n  constructor(protected initialValueFactory?: () => Value) {\n    super();\n    if (initialValueFactory) {\n      this.value = [initialValueFactory()];\n    }\n  }\n\n  fromCheckpoint(checkpoint?: Value) {\n    const empty = new LastValue<Value>(this.initialValueFactory);\n    if (typeof checkpoint !== \"undefined\") {\n      empty.value = [checkpoint];\n    }\n\n    return empty as this;\n  }\n\n  update(values: Value[]): boolean {\n    if (values.length === 0) {\n      return false;\n    }\n    if (values.length !== 1) {\n      throw new InvalidUpdateError(\n        \"LastValue can only receive one value per step.\",\n        { lc_error_code: \"INVALID_CONCURRENT_GRAPH_UPDATE\" }\n      );\n    }\n\n    // eslint-disable-next-line prefer-destructuring\n    this.value = [values[values.length - 1]];\n    return true;\n  }\n\n  get(): Value {\n    if (this.value.length === 0) {\n      throw new EmptyChannelError();\n    }\n    return this.value[0];\n  }\n\n  checkpoint(): Value {\n    if (this.value.length === 0) {\n      throw new EmptyChannelError();\n    }\n    return this.value[0];\n  }\n\n  isAvailable(): boolean {\n    return this.value.length !== 0;\n  }\n}\n\n/**\n * Stores the last value received, but only made available after finish().\n * Once made available, clears the value.\n */\nexport class LastValueAfterFinish<Value> extends BaseChannel<\n  Value,\n  Value,\n  [Value, boolean]\n> {\n  lc_graph_name = \"LastValueAfterFinish\";\n\n  // value is an array so we don't misinterpret an update to undefined as no write\n  value: [Value] | [] = [];\n\n  finished: boolean = false;\n\n  fromCheckpoint(checkpoint?: [Value, boolean]) {\n    const empty = new LastValueAfterFinish<Value>();\n    if (typeof checkpoint !== \"undefined\") {\n      const [value, finished] = checkpoint;\n      empty.value = [value];\n      empty.finished = finished;\n    }\n    return empty as this;\n  }\n\n  update(values: Value[]): boolean {\n    if (values.length === 0) {\n      return false;\n    }\n\n    this.finished = false;\n    // eslint-disable-next-line prefer-destructuring\n    this.value = [values[values.length - 1]];\n    return true;\n  }\n\n  get(): Value {\n    if (this.value.length === 0 || !this.finished) {\n      throw new EmptyChannelError();\n    }\n    return this.value[0];\n  }\n\n  checkpoint(): [Value, boolean] | undefined {\n    if (this.value.length === 0) return undefined;\n    return [this.value[0], this.finished];\n  }\n\n  consume(): boolean {\n    if (this.finished) {\n      this.finished = false;\n      this.value = [];\n      return true;\n    }\n    return false;\n  }\n\n  finish(): boolean {\n    if (!this.finished && this.value.length > 0) {\n      this.finished = true;\n      return true;\n    }\n    return false;\n  }\n\n  isAvailable(): boolean {\n    return this.value.length !== 0 && this.finished;\n  }\n}\n"],"mappings":";;;;;;;;;;;;AAWA,IAAa,YAAb,MAAa,kBAAyB,YAAiC;CACrE,gBAAgB;CAGhB,QAAsB,EAAE;CAExB,YAAY,AAAU,qBAAmC;AACvD,SAAO;EADa;AAEpB,MAAI,oBACF,MAAK,QAAQ,CAAC,qBAAqB,CAAC;;CAIxC,eAAe,YAAoB;EACjC,MAAM,QAAQ,IAAI,UAAiB,KAAK,oBAAoB;AAC5D,MAAI,OAAO,eAAe,YACxB,OAAM,QAAQ,CAAC,WAAW;AAG5B,SAAO;;CAGT,OAAO,QAA0B;AAC/B,MAAI,OAAO,WAAW,EACpB,QAAO;AAET,MAAI,OAAO,WAAW,EACpB,OAAM,IAAI,mBACR,kDACA,EAAE,eAAe,mCAAmC,CACrD;AAIH,OAAK,QAAQ,CAAC,OAAO,OAAO,SAAS,GAAG;AACxC,SAAO;;CAGT,MAAa;AACX,MAAI,KAAK,MAAM,WAAW,EACxB,OAAM,IAAI,mBAAmB;AAE/B,SAAO,KAAK,MAAM;;CAGpB,aAAoB;AAClB,MAAI,KAAK,MAAM,WAAW,EACxB,OAAM,IAAI,mBAAmB;AAE/B,SAAO,KAAK,MAAM;;CAGpB,cAAuB;AACrB,SAAO,KAAK,MAAM,WAAW;;;;;;;AAQjC,IAAa,uBAAb,MAAa,6BAAoC,YAI/C;CACA,gBAAgB;CAGhB,QAAsB,EAAE;CAExB,WAAoB;CAEpB,eAAe,YAA+B;EAC5C,MAAM,QAAQ,IAAI,sBAA6B;AAC/C,MAAI,OAAO,eAAe,aAAa;GACrC,MAAM,CAAC,OAAO,YAAY;AAC1B,SAAM,QAAQ,CAAC,MAAM;AACrB,SAAM,WAAW;;AAEnB,SAAO;;CAGT,OAAO,QAA0B;AAC/B,MAAI,OAAO,WAAW,EACpB,QAAO;AAGT,OAAK,WAAW;AAEhB,OAAK,QAAQ,CAAC,OAAO,OAAO,SAAS,GAAG;AACxC,SAAO;;CAGT,MAAa;AACX,MAAI,KAAK,MAAM,WAAW,KAAK,CAAC,KAAK,SACnC,OAAM,IAAI,mBAAmB;AAE/B,SAAO,KAAK,MAAM;;CAGpB,aAA2C;AACzC,MAAI,KAAK,MAAM,WAAW,EAAG,QAAO;AACpC,SAAO,CAAC,KAAK,MAAM,IAAI,KAAK,SAAS;;CAGvC,UAAmB;AACjB,MAAI,KAAK,UAAU;AACjB,QAAK,WAAW;AAChB,QAAK,QAAQ,EAAE;AACf,UAAO;;AAET,SAAO;;CAGT,SAAkB;AAChB,MAAI,CAAC,KAAK,YAAY,KAAK,MAAM,SAAS,GAAG;AAC3C,QAAK,WAAW;AAChB,UAAO;;AAET,SAAO;;CAGT,cAAuB;AACrB,SAAO,KAAK,MAAM,WAAW,KAAK,KAAK"}

package/dist/channels/named_barrier_value.cjs

@@ -0,0 +1,116 @@
+const require_errors = require('../errors.cjs');
+const require_base = require('./base.cjs');
+
+//#region src/channels/named_barrier_value.ts
+const areSetsEqual = (a, b) => a.size === b.size && [...a].every((value) => b.has(value));
+/**
+* A channel that waits until all named values are received before making the value available.
+*
+* This ensures that if node N and node M both write to channel C, the value of C will not be updated
+* until N and M have completed updating.
+*/
+var NamedBarrierValue = class NamedBarrierValue extends require_base.BaseChannel {
+	lc_graph_name = "NamedBarrierValue";
+	names;
+	seen;
+	constructor(names) {
+		super();
+		this.names = names;
+		this.seen = /* @__PURE__ */ new Set();
+	}
+	fromCheckpoint(checkpoint) {
+		const empty = new NamedBarrierValue(this.names);
+		if (typeof checkpoint !== "undefined") empty.seen = new Set(checkpoint);
+		return empty;
+	}
+	update(values) {
+		let updated = false;
+		for (const nodeName of values) if (this.names.has(nodeName)) {
+			if (!this.seen.has(nodeName)) {
+				this.seen.add(nodeName);
+				updated = true;
+			}
+		} else throw new require_errors.InvalidUpdateError(`Value ${JSON.stringify(nodeName)} not in names ${JSON.stringify(this.names)}`);
+		return updated;
+	}
+	get() {
+		if (!areSetsEqual(this.names, this.seen)) throw new require_errors.EmptyChannelError();
+	}
+	checkpoint() {
+		return [...this.seen];
+	}
+	consume() {
+		if (this.seen && this.names && areSetsEqual(this.seen, this.names)) {
+			this.seen = /* @__PURE__ */ new Set();
+			return true;
+		}
+		return false;
+	}
+	isAvailable() {
+		return !!this.names && areSetsEqual(this.names, this.seen);
+	}
+};
+/**
+* A channel that waits until all named values are received before making the value ready to be made available.
+* It is only made available after finish() is called.
+* @internal
+*/
+var NamedBarrierValueAfterFinish = class NamedBarrierValueAfterFinish extends require_base.BaseChannel {
+	lc_graph_name = "NamedBarrierValueAfterFinish";
+	names;
+	seen;
+	finished;
+	constructor(names) {
+		super();
+		this.names = names;
+		this.seen = /* @__PURE__ */ new Set();
+		this.finished = false;
+	}
+	fromCheckpoint(checkpoint) {
+		const empty = new NamedBarrierValueAfterFinish(this.names);
+		if (typeof checkpoint !== "undefined") {
+			const [seen, finished] = checkpoint;
+			empty.seen = new Set(seen);
+			empty.finished = finished;
+		}
+		return empty;
+	}
+	update(values) {
+		let updated = false;
+		for (const nodeName of values) if (this.names.has(nodeName) && !this.seen.has(nodeName)) {
+			this.seen.add(nodeName);
+			updated = true;
+		} else if (!this.names.has(nodeName)) throw new require_errors.InvalidUpdateError(`Value ${JSON.stringify(nodeName)} not in names ${JSON.stringify(this.names)}`);
+		return updated;
+	}
+	get() {
+		if (!this.finished || !areSetsEqual(this.names, this.seen)) throw new require_errors.EmptyChannelError();
+	}
+	checkpoint() {
+		return [[...this.seen], this.finished];
+	}
+	consume() {
+		if (this.finished && this.seen && this.names && areSetsEqual(this.seen, this.names)) {
+			this.seen = /* @__PURE__ */ new Set();
+			this.finished = false;
+			return true;
+		}
+		return false;
+	}
+	finish() {
+		if (!this.finished && !!this.names && areSetsEqual(this.names, this.seen)) {
+			this.finished = true;
+			return true;
+		}
+		return false;
+	}
+	isAvailable() {
+		return this.finished && !!this.names && areSetsEqual(this.names, this.seen);
+	}
+};
+
+//#endregion
+exports.NamedBarrierValue = NamedBarrierValue;
+exports.NamedBarrierValueAfterFinish = NamedBarrierValueAfterFinish;
+exports.areSetsEqual = areSetsEqual;
+//# sourceMappingURL=named_barrier_value.cjs.map

package/dist/channels/named_barrier_value.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"named_barrier_value.cjs","names":["BaseChannel","InvalidUpdateError","EmptyChannelError"],"sources":["../../src/channels/named_barrier_value.ts"],"sourcesContent":["import { EmptyChannelError, InvalidUpdateError } from \"../errors.js\";\nimport { BaseChannel } from \"./base.js\";\n\nexport const areSetsEqual = <T>(a: Set<T>, b: Set<T>) =>\n  a.size === b.size && [...a].every((value) => b.has(value));\n\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 class NamedBarrierValue<Value> extends BaseChannel<\n  void,\n  Value,\n  Value[]\n> {\n  lc_graph_name = \"NamedBarrierValue\";\n\n  names: Set<Value>; // Names of nodes that we want to wait for.\n\n  seen: Set<Value>;\n\n  constructor(names: Set<Value>) {\n    super();\n    this.names = names;\n    this.seen = new Set<Value>();\n  }\n\n  fromCheckpoint(checkpoint?: Value[]) {\n    const empty = new NamedBarrierValue<Value>(this.names);\n    if (typeof checkpoint !== \"undefined\") {\n      empty.seen = new Set(checkpoint);\n    }\n    return empty as this;\n  }\n\n  update(values: Value[]): boolean {\n    let updated = false;\n    for (const nodeName of values) {\n      if (this.names.has(nodeName)) {\n        if (!this.seen.has(nodeName)) {\n          this.seen.add(nodeName);\n          updated = true;\n        }\n      } else {\n        throw new InvalidUpdateError(\n          `Value ${JSON.stringify(nodeName)} not in names ${JSON.stringify(\n            this.names\n          )}`\n        );\n      }\n    }\n    return updated;\n  }\n\n  // If we have not yet seen all the node names we want to wait for,\n  // throw an error to prevent continuing.\n  get(): void {\n    if (!areSetsEqual(this.names, this.seen)) {\n      throw new EmptyChannelError();\n    }\n    return undefined;\n  }\n\n  checkpoint(): Value[] {\n    return [...this.seen];\n  }\n\n  consume(): boolean {\n    if (this.seen && this.names && areSetsEqual(this.seen, this.names)) {\n      this.seen = new Set<Value>();\n      return true;\n    }\n    return false;\n  }\n\n  isAvailable(): boolean {\n    return !!this.names && areSetsEqual(this.names, this.seen);\n  }\n}\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 class NamedBarrierValueAfterFinish<Value> extends BaseChannel<\n  void,\n  Value,\n  [Value[], boolean]\n> {\n  lc_graph_name = \"NamedBarrierValueAfterFinish\";\n\n  names: Set<Value>; // Names of nodes that we want to wait for.\n\n  seen: Set<Value>;\n\n  finished: boolean;\n\n  constructor(names: Set<Value>) {\n    super();\n    this.names = names;\n    this.seen = new Set<Value>();\n    this.finished = false;\n  }\n\n  fromCheckpoint(checkpoint?: [Value[], boolean]) {\n    const empty = new NamedBarrierValueAfterFinish<Value>(this.names);\n    if (typeof checkpoint !== \"undefined\") {\n      const [seen, finished] = checkpoint;\n      empty.seen = new Set(seen);\n      empty.finished = finished;\n    }\n    return empty as this;\n  }\n\n  update(values: Value[]): boolean {\n    let updated = false;\n    for (const nodeName of values) {\n      if (this.names.has(nodeName) && !this.seen.has(nodeName)) {\n        this.seen.add(nodeName);\n        updated = true;\n      } else if (!this.names.has(nodeName)) {\n        throw new InvalidUpdateError(\n          `Value ${JSON.stringify(nodeName)} not in names ${JSON.stringify(\n            this.names\n          )}`\n        );\n      }\n    }\n    return updated;\n  }\n\n  get(): void {\n    if (!this.finished || !areSetsEqual(this.names, this.seen)) {\n      throw new EmptyChannelError();\n    }\n    return undefined;\n  }\n\n  checkpoint(): [Value[], boolean] {\n    return [[...this.seen], this.finished];\n  }\n\n  consume(): boolean {\n    if (\n      this.finished &&\n      this.seen &&\n      this.names &&\n      areSetsEqual(this.seen, this.names)\n    ) {\n      this.seen = new Set<Value>();\n      this.finished = false;\n      return true;\n    }\n    return false;\n  }\n\n  finish(): boolean {\n    if (!this.finished && !!this.names && areSetsEqual(this.names, this.seen)) {\n      this.finished = true;\n      return true;\n    }\n    return false;\n  }\n\n  isAvailable(): boolean {\n    return this.finished && !!this.names && areSetsEqual(this.names, this.seen);\n  }\n}\n"],"mappings":";;;;AAGA,MAAa,gBAAmB,GAAW,MACzC,EAAE,SAAS,EAAE,QAAQ,CAAC,GAAG,EAAE,CAAC,OAAO,UAAU,EAAE,IAAI,MAAM,CAAC;;;;;;;AAQ5D,IAAa,oBAAb,MAAa,0BAAiCA,yBAI5C;CACA,gBAAgB;CAEhB;CAEA;CAEA,YAAY,OAAmB;AAC7B,SAAO;AACP,OAAK,QAAQ;AACb,OAAK,uBAAO,IAAI,KAAY;;CAG9B,eAAe,YAAsB;EACnC,MAAM,QAAQ,IAAI,kBAAyB,KAAK,MAAM;AACtD,MAAI,OAAO,eAAe,YACxB,OAAM,OAAO,IAAI,IAAI,WAAW;AAElC,SAAO;;CAGT,OAAO,QAA0B;EAC/B,IAAI,UAAU;AACd,OAAK,MAAM,YAAY,OACrB,KAAI,KAAK,MAAM,IAAI,SAAS,EAC1B;OAAI,CAAC,KAAK,KAAK,IAAI,SAAS,EAAE;AAC5B,SAAK,KAAK,IAAI,SAAS;AACvB,cAAU;;QAGZ,OAAM,IAAIC,kCACR,SAAS,KAAK,UAAU,SAAS,CAAC,gBAAgB,KAAK,UACrD,KAAK,MACN,GACF;AAGL,SAAO;;CAKT,MAAY;AACV,MAAI,CAAC,aAAa,KAAK,OAAO,KAAK,KAAK,CACtC,OAAM,IAAIC,kCAAmB;;CAKjC,aAAsB;AACpB,SAAO,CAAC,GAAG,KAAK,KAAK;;CAGvB,UAAmB;AACjB,MAAI,KAAK,QAAQ,KAAK,SAAS,aAAa,KAAK,MAAM,KAAK,MAAM,EAAE;AAClE,QAAK,uBAAO,IAAI,KAAY;AAC5B,UAAO;;AAET,SAAO;;CAGT,cAAuB;AACrB,SAAO,CAAC,CAAC,KAAK,SAAS,aAAa,KAAK,OAAO,KAAK,KAAK;;;;;;;;AAS9D,IAAa,+BAAb,MAAa,qCAA4CF,yBAIvD;CACA,gBAAgB;CAEhB;CAEA;CAEA;CAEA,YAAY,OAAmB;AAC7B,SAAO;AACP,OAAK,QAAQ;AACb,OAAK,uBAAO,IAAI,KAAY;AAC5B,OAAK,WAAW;;CAGlB,eAAe,YAAiC;EAC9C,MAAM,QAAQ,IAAI,6BAAoC,KAAK,MAAM;AACjE,MAAI,OAAO,eAAe,aAAa;GACrC,MAAM,CAAC,MAAM,YAAY;AACzB,SAAM,OAAO,IAAI,IAAI,KAAK;AAC1B,SAAM,WAAW;;AAEnB,SAAO;;CAGT,OAAO,QAA0B;EAC/B,IAAI,UAAU;AACd,OAAK,MAAM,YAAY,OACrB,KAAI,KAAK,MAAM,IAAI,SAAS,IAAI,CAAC,KAAK,KAAK,IAAI,SAAS,EAAE;AACxD,QAAK,KAAK,IAAI,SAAS;AACvB,aAAU;aACD,CAAC,KAAK,MAAM,IAAI,SAAS,CAClC,OAAM,IAAIC,kCACR,SAAS,KAAK,UAAU,SAAS,CAAC,gBAAgB,KAAK,UACrD,KAAK,MACN,GACF;AAGL,SAAO;;CAGT,MAAY;AACV,MAAI,CAAC,KAAK,YAAY,CAAC,aAAa,KAAK,OAAO,KAAK,KAAK,CACxD,OAAM,IAAIC,kCAAmB;;CAKjC,aAAiC;AAC/B,SAAO,CAAC,CAAC,GAAG,KAAK,KAAK,EAAE,KAAK,SAAS;;CAGxC,UAAmB;AACjB,MACE,KAAK,YACL,KAAK,QACL,KAAK,SACL,aAAa,KAAK,MAAM,KAAK,MAAM,EACnC;AACA,QAAK,uBAAO,IAAI,KAAY;AAC5B,QAAK,WAAW;AAChB,UAAO;;AAET,SAAO;;CAGT,SAAkB;AAChB,MAAI,CAAC,KAAK,YAAY,CAAC,CAAC,KAAK,SAAS,aAAa,KAAK,OAAO,KAAK,KAAK,EAAE;AACzE,QAAK,WAAW;AAChB,UAAO;;AAET,SAAO;;CAGT,cAAuB;AACrB,SAAO,KAAK,YAAY,CAAC,CAAC,KAAK,SAAS,aAAa,KAAK,OAAO,KAAK,KAAK"}

package/dist/channels/named_barrier_value.d.cts

@@ -0,0 +1,44 @@
+import { BaseChannel } from "./base.cjs";
+
+//#region src/channels/named_barrier_value.d.ts
+
+/**
+ * A channel that waits until all named values are received before making the value available.
+ *
+ * This ensures that if node N and node M both write to channel C, the value of C will not be updated
+ * until N and M have completed updating.
+ */
+declare class NamedBarrierValue<Value> extends BaseChannel<void, Value, Value[]> {
+  lc_graph_name: string;
+  names: Set<Value>;
+  seen: Set<Value>;
+  constructor(names: Set<Value>);
+  fromCheckpoint(checkpoint?: Value[]): this;
+  update(values: Value[]): boolean;
+  get(): void;
+  checkpoint(): Value[];
+  consume(): boolean;
+  isAvailable(): boolean;
+}
+/**
+ * A channel that waits until all named values are received before making the value ready to be made available.
+ * It is only made available after finish() is called.
+ * @internal
+ */
+declare class NamedBarrierValueAfterFinish<Value> extends BaseChannel<void, Value, [Value[], boolean]> {
+  lc_graph_name: string;
+  names: Set<Value>;
+  seen: Set<Value>;
+  finished: boolean;
+  constructor(names: Set<Value>);
+  fromCheckpoint(checkpoint?: [Value[], boolean]): this;
+  update(values: Value[]): boolean;
+  get(): void;
+  checkpoint(): [Value[], boolean];
+  consume(): boolean;
+  finish(): boolean;
+  isAvailable(): boolean;
+}
+//#endregion
+export { NamedBarrierValue, NamedBarrierValueAfterFinish };
+//# sourceMappingURL=named_barrier_value.d.cts.map

package/dist/channels/named_barrier_value.d.cts.map

@@ -0,0 +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"}

package/dist/channels/named_barrier_value.d.ts

@@ -0,0 +1,44 @@
+import { BaseChannel } from "./base.js";
+
+//#region src/channels/named_barrier_value.d.ts
+
+/**
+ * A channel that waits until all named values are received before making the value available.
+ *
+ * This ensures that if node N and node M both write to channel C, the value of C will not be updated
+ * until N and M have completed updating.
+ */
+declare class NamedBarrierValue<Value> extends BaseChannel<void, Value, Value[]> {
+  lc_graph_name: string;
+  names: Set<Value>;
+  seen: Set<Value>;
+  constructor(names: Set<Value>);
+  fromCheckpoint(checkpoint?: Value[]): this;
+  update(values: Value[]): boolean;
+  get(): void;
+  checkpoint(): Value[];
+  consume(): boolean;
+  isAvailable(): boolean;
+}
+/**
+ * A channel that waits until all named values are received before making the value ready to be made available.
+ * It is only made available after finish() is called.
+ * @internal
+ */
+declare class NamedBarrierValueAfterFinish<Value> extends BaseChannel<void, Value, [Value[], boolean]> {
+  lc_graph_name: string;
+  names: Set<Value>;
+  seen: Set<Value>;
+  finished: boolean;
+  constructor(names: Set<Value>);
+  fromCheckpoint(checkpoint?: [Value[], boolean]): this;
+  update(values: Value[]): boolean;
+  get(): void;
+  checkpoint(): [Value[], boolean];
+  consume(): boolean;
+  finish(): boolean;
+  isAvailable(): boolean;
+}
+//#endregion
+export { NamedBarrierValue, NamedBarrierValueAfterFinish };
+//# sourceMappingURL=named_barrier_value.d.ts.map

package/dist/channels/named_barrier_value.d.ts.map

@@ -0,0 +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"}