@langchain/langgraph 0.4.9 → 1.0.0-alpha.1

package/dist/channels/last_value.js

@@ -1,138 +1,92 @@
 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
- */
-export class LastValue extends BaseChannel {
-    constructor() {
-        super(...arguments);
-        Object.defineProperty(this, "lc_graph_name", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: "LastValue"
-        });
-        // value is an array so we don't misinterpret an update to undefined as no write
-        Object.defineProperty(this, "value", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: []
-        });
-    }
-    fromCheckpoint(checkpoint) {
-        const empty = new LastValue();
-        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" });
-        }
-        // eslint-disable-next-line prefer-destructuring
-        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, 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 = [];
+	fromCheckpoint(checkpoint) {
+		const empty = new LastValue();
+		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.
- * @internal
- */
-export class LastValueAfterFinish extends BaseChannel {
-    constructor() {
-        super(...arguments);
-        Object.defineProperty(this, "lc_graph_name", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: "LastValueAfterFinish"
-        });
-        // value is an array so we don't misinterpret an update to undefined as no write
-        Object.defineProperty(this, "value", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: []
-        });
-        Object.defineProperty(this, "finished", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: 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;
-        // eslint-disable-next-line prefer-destructuring
-        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 undefined;
-        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;
-    }
-}
+* 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

@@ -1 +1 @@
-{"version":3,"file":"last_value.js","sourceRoot":"","sources":["../../src/channels/last_value.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AACrE,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAExC;;;;;;;GAOG;AACH,MAAM,OAAO,SAAiB,SAAQ,WAAgC;IAAtE;;QACE;;;;mBAAgB,WAAW;WAAC;QAE5B,gFAAgF;QAChF;;;;mBAAsB,EAAE;WAAC;IA4C3B,CAAC;IA1CC,cAAc,CAAC,UAAkB;QAC/B,MAAM,KAAK,GAAG,IAAI,SAAS,EAAS,CAAC;QACrC,IAAI,OAAO,UAAU,KAAK,WAAW,EAAE,CAAC;YACtC,KAAK,CAAC,KAAK,GAAG,CAAC,UAAU,CAAC,CAAC;QAC7B,CAAC;QAED,OAAO,KAAa,CAAC;IACvB,CAAC;IAED,MAAM,CAAC,MAAe;QACpB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,kBAAkB,CAC1B,gDAAgD,EAChD,EAAE,aAAa,EAAE,iCAAiC,EAAE,CACrD,CAAC;QACJ,CAAC;QAED,gDAAgD;QAChD,IAAI,CAAC,KAAK,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,iBAAiB,EAAE,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,UAAU;QACR,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,iBAAiB,EAAE,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACjC,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,oBAA4B,SAAQ,WAIhD;IAJD;;QAKE;;;;mBAAgB,sBAAsB;WAAC;QAEvC,gFAAgF;QAChF;;;;mBAAsB,EAAE;WAAC;QAEzB;;;;mBAAoB,KAAK;WAAC;IAuD5B,CAAC;IArDC,cAAc,CAAC,UAA6B;QAC1C,MAAM,KAAK,GAAG,IAAI,oBAAoB,EAAS,CAAC;QAChD,IAAI,OAAO,UAAU,KAAK,WAAW,EAAE,CAAC;YACtC,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,UAAU,CAAC;YACrC,KAAK,CAAC,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;YACtB,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAC5B,CAAC;QACD,OAAO,KAAa,CAAC;IACvB,CAAC;IAED,MAAM,CAAC,MAAe;QACpB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,gDAAgD;QAChD,IAAI,CAAC,KAAK,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9C,MAAM,IAAI,iBAAiB,EAAE,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,UAAU;QACR,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9C,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACxC,CAAC;IAED,OAAO;QACL,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;YACtB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAChB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM;QACJ,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC;IAClD,CAAC;CACF"}
+{"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  fromCheckpoint(checkpoint?: Value) {\n    const empty = new LastValue<Value>();\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;CAEtB,eAAe,YAAoB;EACjC,MAAM,QAAQ,IAAI;AAClB,MAAI,OAAO,eAAe,YACxB,OAAM,QAAQ,CAAC;AAGjB,SAAO;;CAGT,OAAO,QAA0B;AAC/B,MAAI,OAAO,WAAW,EACpB,QAAO;AAET,MAAI,OAAO,WAAW,EACpB,OAAM,IAAI,mBACR,kDACA,EAAE,eAAe;AAKrB,OAAK,QAAQ,CAAC,OAAO,OAAO,SAAS;AACrC,SAAO;;CAGT,MAAa;AACX,MAAI,KAAK,MAAM,WAAW,EACxB,OAAM,IAAI;AAEZ,SAAO,KAAK,MAAM;;CAGpB,aAAoB;AAClB,MAAI,KAAK,MAAM,WAAW,EACxB,OAAM,IAAI;AAEZ,SAAO,KAAK,MAAM;;CAGpB,cAAuB;AACrB,SAAO,KAAK,MAAM,WAAW;;;;;;;AAQjC,IAAa,uBAAb,MAAa,6BAAoC,YAI/C;CACA,gBAAgB;CAGhB,QAAsB;CAEtB,WAAoB;CAEpB,eAAe,YAA+B;EAC5C,MAAM,QAAQ,IAAI;AAClB,MAAI,OAAO,eAAe,aAAa;GACrC,MAAM,CAAC,OAAO,YAAY;AAC1B,SAAM,QAAQ,CAAC;AACf,SAAM,WAAW;;AAEnB,SAAO;;CAGT,OAAO,QAA0B;AAC/B,MAAI,OAAO,WAAW,EACpB,QAAO;AAGT,OAAK,WAAW;AAEhB,OAAK,QAAQ,CAAC,OAAO,OAAO,SAAS;AACrC,SAAO;;CAGT,MAAa;AACX,MAAI,KAAK,MAAM,WAAW,KAAK,CAAC,KAAK,SACnC,OAAM,IAAI;AAEZ,SAAO,KAAK,MAAM;;CAGpB,aAA2C;AACzC,MAAI,KAAK,MAAM,WAAW,EAAG,QAAO;AACpC,SAAO,CAAC,KAAK,MAAM,IAAI,KAAK;;CAG9B,UAAmB;AACjB,MAAI,KAAK,UAAU;AACjB,QAAK,WAAW;AAChB,QAAK,QAAQ;AACb,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

@@ -1,174 +1,118 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.NamedBarrierValueAfterFinish = exports.NamedBarrierValue = exports.areSetsEqual = void 0;
-const errors_js_1 = require("../errors.cjs");
-const base_js_1 = require("./base.cjs");
+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));
-exports.areSetsEqual = areSetsEqual;
 /**
- * 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.
- * @internal
- */
-class NamedBarrierValue extends base_js_1.BaseChannel {
-    constructor(names) {
-        super();
-        Object.defineProperty(this, "lc_graph_name", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: "NamedBarrierValue"
-        });
-        Object.defineProperty(this, "names", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: void 0
-        }); // Names of nodes that we want to wait for.
-        Object.defineProperty(this, "seen", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: void 0
-        });
-        this.names = names;
-        this.seen = 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 errors_js_1.InvalidUpdateError(`Value ${JSON.stringify(nodeName)} not in names ${JSON.stringify(this.names)}`);
-            }
-        }
-        return updated;
-    }
-    // If we have not yet seen all the node names we want to wait for,
-    // throw an error to prevent continuing.
-    get() {
-        if (!(0, exports.areSetsEqual)(this.names, this.seen)) {
-            throw new errors_js_1.EmptyChannelError();
-        }
-        return undefined;
-    }
-    checkpoint() {
-        return [...this.seen];
-    }
-    consume() {
-        if (this.seen && this.names && (0, exports.areSetsEqual)(this.seen, this.names)) {
-            this.seen = new Set();
-            return true;
-        }
-        return false;
-    }
-    isAvailable() {
-        return !!this.names && (0, exports.areSetsEqual)(this.names, this.seen);
-    }
-}
-exports.NamedBarrierValue = NamedBarrierValue;
+* 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();
+		return void 0;
+	}
+	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
- */
-class NamedBarrierValueAfterFinish extends base_js_1.BaseChannel {
-    constructor(names) {
-        super();
-        Object.defineProperty(this, "lc_graph_name", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: "NamedBarrierValueAfterFinish"
-        });
-        Object.defineProperty(this, "names", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: void 0
-        }); // Names of nodes that we want to wait for.
-        Object.defineProperty(this, "seen", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: void 0
-        });
-        Object.defineProperty(this, "finished", {
-            enumerable: true,
-            configurable: true,
-            writable: true,
-            value: void 0
-        });
-        this.names = names;
-        this.seen = 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 errors_js_1.InvalidUpdateError(`Value ${JSON.stringify(nodeName)} not in names ${JSON.stringify(this.names)}`);
-            }
-        }
-        return updated;
-    }
-    get() {
-        if (!this.finished || !(0, exports.areSetsEqual)(this.names, this.seen)) {
-            throw new errors_js_1.EmptyChannelError();
-        }
-        return undefined;
-    }
-    checkpoint() {
-        return [[...this.seen], this.finished];
-    }
-    consume() {
-        if (this.finished &&
-            this.seen &&
-            this.names &&
-            (0, exports.areSetsEqual)(this.seen, this.names)) {
-            this.seen = new Set();
-            this.finished = false;
-            return true;
-        }
-        return false;
-    }
-    finish() {
-        if (!this.finished && !!this.names && (0, exports.areSetsEqual)(this.names, this.seen)) {
-            this.finished = true;
-            return true;
-        }
-        return false;
-    }
-    isAvailable() {
-        return this.finished && !!this.names && (0, exports.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();
+		return void 0;
+	}
+	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;
-//# sourceMappingURL=named_barrier_value.js.map
+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,GAAG,OAAO,UAAU,EAAE,IAAI;;;;;;;AAQrD,IAAa,oBAAb,MAAa,0BAAiCA,yBAI5C;CACA,gBAAgB;CAEhB;CAEA;CAEA,YAAY,OAAmB;AAC7B;AACA,OAAK,QAAQ;AACb,OAAK,uBAAO,IAAI;;CAGlB,eAAe,YAAsB;EACnC,MAAM,QAAQ,IAAI,kBAAyB,KAAK;AAChD,MAAI,OAAO,eAAe,YACxB,OAAM,OAAO,IAAI,IAAI;AAEvB,SAAO;;CAGT,OAAO,QAA0B;EAC/B,IAAI,UAAU;AACd,OAAK,MAAM,YAAY,OACrB,KAAI,KAAK,MAAM,IAAI,WACjB;OAAI,CAAC,KAAK,KAAK,IAAI,WAAW;AAC5B,SAAK,KAAK,IAAI;AACd,cAAU;;QAGZ,OAAM,IAAIC,kCACR,SAAS,KAAK,UAAU,UAAU,gBAAgB,KAAK,UACrD,KAAK;AAKb,SAAO;;CAKT,MAAY;AACV,MAAI,CAAC,aAAa,KAAK,OAAO,KAAK,MACjC,OAAM,IAAIC;AAEZ,SAAO;;CAGT,aAAsB;AACpB,SAAO,CAAC,GAAG,KAAK;;CAGlB,UAAmB;AACjB,MAAI,KAAK,QAAQ,KAAK,SAAS,aAAa,KAAK,MAAM,KAAK,QAAQ;AAClE,QAAK,uBAAO,IAAI;AAChB,UAAO;;AAET,SAAO;;CAGT,cAAuB;AACrB,SAAO,CAAC,CAAC,KAAK,SAAS,aAAa,KAAK,OAAO,KAAK;;;;;;;;AASzD,IAAa,+BAAb,MAAa,qCAA4CF,yBAIvD;CACA,gBAAgB;CAEhB;CAEA;CAEA;CAEA,YAAY,OAAmB;AAC7B;AACA,OAAK,QAAQ;AACb,OAAK,uBAAO,IAAI;AAChB,OAAK,WAAW;;CAGlB,eAAe,YAAiC;EAC9C,MAAM,QAAQ,IAAI,6BAAoC,KAAK;AAC3D,MAAI,OAAO,eAAe,aAAa;GACrC,MAAM,CAAC,MAAM,YAAY;AACzB,SAAM,OAAO,IAAI,IAAI;AACrB,SAAM,WAAW;;AAEnB,SAAO;;CAGT,OAAO,QAA0B;EAC/B,IAAI,UAAU;AACd,OAAK,MAAM,YAAY,OACrB,KAAI,KAAK,MAAM,IAAI,aAAa,CAAC,KAAK,KAAK,IAAI,WAAW;AACxD,QAAK,KAAK,IAAI;AACd,aAAU;aACD,CAAC,KAAK,MAAM,IAAI,UACzB,OAAM,IAAIC,kCACR,SAAS,KAAK,UAAU,UAAU,gBAAgB,KAAK,UACrD,KAAK;AAKb,SAAO;;CAGT,MAAY;AACV,MAAI,CAAC,KAAK,YAAY,CAAC,aAAa,KAAK,OAAO,KAAK,MACnD,OAAM,IAAIC;AAEZ,SAAO;;CAGT,aAAiC;AAC/B,SAAO,CAAC,CAAC,GAAG,KAAK,OAAO,KAAK;;CAG/B,UAAmB;AACjB,MACE,KAAK,YACL,KAAK,QACL,KAAK,SACL,aAAa,KAAK,MAAM,KAAK,QAC7B;AACA,QAAK,uBAAO,IAAI;AAChB,QAAK,WAAW;AAChB,UAAO;;AAET,SAAO;;CAGT,SAAkB;AAChB,MAAI,CAAC,KAAK,YAAY,CAAC,CAAC,KAAK,SAAS,aAAa,KAAK,OAAO,KAAK,OAAO;AACzE,QAAK,WAAW;AAChB,UAAO;;AAET,SAAO;;CAGT,cAAuB;AACrB,SAAO,KAAK,YAAY,CAAC,CAAC,KAAK,SAAS,aAAa,KAAK,OAAO,KAAK"}

package/dist/channels/named_barrier_value.d.cts

@@ -0,0 +1,46 @@
+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>; // Names of nodes that we want to wait for.
+  seen: Set<Value>;
+  constructor(names: Set<Value>);
+  fromCheckpoint(checkpoint?: Value[]): this;
+  update(values: Value[]): boolean;
+  // If we have not yet seen all the node names we want to wait for,
+  // throw an error to prevent continuing.
+  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>; // Names of nodes that we want to wait for.
+  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>; // Names of nodes that we want to wait for.\n    seen: Set<Value>;\n    constructor(names: Set<Value>);\n    fromCheckpoint(checkpoint?: Value[]): this;\n    update(values: Value[]): boolean;\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    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>; // Names of nodes that we want to wait for.\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,CAAAA,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;;;;EAaEC,UAAAA,CAAAA,CAAAA,EATHD,KASGC,EAAAA;EAA4B,OAAA,CAAA,CAAA,EAAA,OAAA;aAAkCD,CAAAA,CAAAA,EAAAA,OAAAA;;;;;;;AAQ5DF,cARFG,4BAQEH,CAAAA,KAAAA,CAAAA,SAR0CH,WAQ1CG,CAAAA,IAAAA,EAR4DE,KAQ5DF,EAAAA,CAPnBE,KAQ6BA,EAAAA,SACdA;eAV8CL,EAAAA,MAAAA;SAKtDG,IAAIE;QACLF,IAAIE;;qBAESF,IAAIE;+BACMA;iBACdA;;iBAEAA"}