@langchain/langgraph 1.0.7 → 1.0.12

package/dist/channels/last_value.js

@@ -1,97 +0,0 @@
-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

@@ -1 +0,0 @@
-{"version":3,"file":"last_value.js","names":["initialValueFactory?: () => Value"],"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;CAEtB,YAAY,AAAUA,qBAAmC;AACvD;EADoB;AAEpB,MAAI,oBACF,MAAK,QAAQ,CAAC;;CAIlB,eAAe,YAAoB;EACjC,MAAM,QAAQ,IAAI,UAAiB,KAAK;AACxC,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,118 +0,0 @@
-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();
-		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
-*/
-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;
-exports.areSetsEqual = areSetsEqual;
-//# sourceMappingURL=named_barrier_value.cjs.map

package/dist/channels/named_barrier_value.cjs.map

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

@@ -1,46 +0,0 @@
-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

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

package/dist/channels/named_barrier_value.d.ts

@@ -1,46 +0,0 @@
-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>; // 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.ts.map

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

@@ -1 +0,0 @@
-{"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>; // 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"}

package/dist/channels/named_barrier_value.js

@@ -1,116 +0,0 @@
-import { EmptyChannelError, InvalidUpdateError } from "../errors.js";
-import { BaseChannel } from "./base.js";
-
-//#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 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 InvalidUpdateError(`Value ${JSON.stringify(nodeName)} not in names ${JSON.stringify(this.names)}`);
-		return updated;
-	}
-	get() {
-		if (!areSetsEqual(this.names, this.seen)) throw new 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
-*/
-var NamedBarrierValueAfterFinish = class NamedBarrierValueAfterFinish extends 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 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 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
-export { NamedBarrierValue, NamedBarrierValueAfterFinish, areSetsEqual };
-//# sourceMappingURL=named_barrier_value.js.map

package/dist/channels/named_barrier_value.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"named_barrier_value.js","names":[],"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,0BAAiC,YAI5C;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,IAAI,mBACR,SAAS,KAAK,UAAU,UAAU,gBAAgB,KAAK,UACrD,KAAK;AAKb,SAAO;;CAKT,MAAY;AACV,MAAI,CAAC,aAAa,KAAK,OAAO,KAAK,MACjC,OAAM,IAAI;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,qCAA4C,YAIvD;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,IAAI,mBACR,SAAS,KAAK,UAAU,UAAU,gBAAgB,KAAK,UACrD,KAAK;AAKb,SAAO;;CAGT,MAAY;AACV,MAAI,CAAC,KAAK,YAAY,CAAC,aAAa,KAAK,OAAO,KAAK,MACnD,OAAM,IAAI;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/topic.cjs

@@ -1,65 +0,0 @@
-const require_errors = require('../errors.cjs');
-const require_base = require('./base.cjs');
-
-//#region src/channels/topic.ts
-/**
-* A configurable PubSub Topic.
-*/
-var Topic = class Topic extends require_base.BaseChannel {
-	lc_graph_name = "Topic";
-	unique = false;
-	accumulate = false;
-	seen;
-	values;
-	constructor(fields) {
-		super();
-		this.unique = fields?.unique ?? this.unique;
-		this.accumulate = fields?.accumulate ?? this.accumulate;
-		this.seen = /* @__PURE__ */ new Set();
-		this.values = [];
-	}
-	fromCheckpoint(checkpoint) {
-		const empty = new Topic({
-			unique: this.unique,
-			accumulate: this.accumulate
-		});
-		if (typeof checkpoint !== "undefined") {
-			empty.seen = new Set(checkpoint[0]);
-			empty.values = checkpoint[1];
-		}
-		return empty;
-	}
-	update(values) {
-		let updated = false;
-		if (!this.accumulate) {
-			updated = this.values.length > 0;
-			this.values = [];
-		}
-		const flatValues = values.flat();
-		if (flatValues.length > 0) if (this.unique) {
-			for (const value of flatValues) if (!this.seen.has(value)) {
-				updated = true;
-				this.seen.add(value);
-				this.values.push(value);
-			}
-		} else {
-			updated = true;
-			this.values.push(...flatValues);
-		}
-		return updated;
-	}
-	get() {
-		if (this.values.length === 0) throw new require_errors.EmptyChannelError();
-		return this.values;
-	}
-	checkpoint() {
-		return [[...this.seen], this.values];
-	}
-	isAvailable() {
-		return this.values.length !== 0;
-	}
-};
-
-//#endregion
-exports.Topic = Topic;
-//# sourceMappingURL=topic.cjs.map

package/dist/channels/topic.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"topic.cjs","names":["BaseChannel","EmptyChannelError"],"sources":["../../src/channels/topic.ts"],"sourcesContent":["import { EmptyChannelError } from \"../errors.js\";\nimport { BaseChannel } from \"./base.js\";\n\n/**\n * A configurable PubSub Topic.\n */\nexport class Topic<Value> extends BaseChannel<\n  Array<Value>,\n  Value | Value[],\n  [Value[], Value[]]\n> {\n  lc_graph_name = \"Topic\";\n\n  unique = false;\n\n  accumulate = false;\n\n  seen: Set<Value>;\n\n  values: Value[];\n\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    super();\n\n    this.unique = fields?.unique ?? this.unique;\n    this.accumulate = fields?.accumulate ?? this.accumulate;\n    // State\n    this.seen = new Set<Value>();\n    this.values = [];\n  }\n\n  public fromCheckpoint(checkpoint?: [Value[], Value[]]) {\n    const empty = new Topic<Value>({\n      unique: this.unique,\n      accumulate: this.accumulate,\n    });\n    if (typeof checkpoint !== \"undefined\") {\n      empty.seen = new Set(checkpoint[0]);\n      // eslint-disable-next-line prefer-destructuring\n      empty.values = checkpoint[1];\n    }\n    return empty as this;\n  }\n\n  public update(values: Array<Value | Value[]>): boolean {\n    let updated = false;\n    if (!this.accumulate) {\n      updated = this.values.length > 0;\n      this.values = [];\n    }\n    const flatValues = values.flat() as Value[];\n    if (flatValues.length > 0) {\n      if (this.unique) {\n        for (const value of flatValues) {\n          if (!this.seen.has(value)) {\n            updated = true;\n            this.seen.add(value);\n            this.values.push(value);\n          }\n        }\n      } else {\n        updated = true;\n        this.values.push(...flatValues);\n      }\n    }\n    return updated;\n  }\n\n  public get(): Array<Value> {\n    if (this.values.length === 0) {\n      throw new EmptyChannelError();\n    }\n    return this.values;\n  }\n\n  public checkpoint(): [Value[], Value[]] {\n    return [[...this.seen], this.values];\n  }\n\n  isAvailable(): boolean {\n    return this.values.length !== 0;\n  }\n}\n"],"mappings":";;;;;;;AAMA,IAAa,QAAb,MAAa,cAAqBA,yBAIhC;CACA,gBAAgB;CAEhB,SAAS;CAET,aAAa;CAEb;CAEA;CAEA,YAAY,QAST;AACD;AAEA,OAAK,SAAS,QAAQ,UAAU,KAAK;AACrC,OAAK,aAAa,QAAQ,cAAc,KAAK;AAE7C,OAAK,uBAAO,IAAI;AAChB,OAAK,SAAS;;CAGhB,AAAO,eAAe,YAAiC;EACrD,MAAM,QAAQ,IAAI,MAAa;GAC7B,QAAQ,KAAK;GACb,YAAY,KAAK;;AAEnB,MAAI,OAAO,eAAe,aAAa;AACrC,SAAM,OAAO,IAAI,IAAI,WAAW;AAEhC,SAAM,SAAS,WAAW;;AAE5B,SAAO;;CAGT,AAAO,OAAO,QAAyC;EACrD,IAAI,UAAU;AACd,MAAI,CAAC,KAAK,YAAY;AACpB,aAAU,KAAK,OAAO,SAAS;AAC/B,QAAK,SAAS;;EAEhB,MAAM,aAAa,OAAO;AAC1B,MAAI,WAAW,SAAS,EACtB,KAAI,KAAK,QACP;QAAK,MAAM,SAAS,WAClB,KAAI,CAAC,KAAK,KAAK,IAAI,QAAQ;AACzB,cAAU;AACV,SAAK,KAAK,IAAI;AACd,SAAK,OAAO,KAAK;;SAGhB;AACL,aAAU;AACV,QAAK,OAAO,KAAK,GAAG;;AAGxB,SAAO;;CAGT,AAAO,MAAoB;AACzB,MAAI,KAAK,OAAO,WAAW,EACzB,OAAM,IAAIC;AAEZ,SAAO,KAAK;;CAGd,AAAO,aAAiC;AACtC,SAAO,CAAC,CAAC,GAAG,KAAK,OAAO,KAAK;;CAG/B,cAAuB;AACrB,SAAO,KAAK,OAAO,WAAW"}

package/dist/channels/topic.d.cts

@@ -1,32 +0,0 @@
-import { BaseChannel } from "./base.cjs";
-
-//#region src/channels/topic.d.ts
-
-/**
- * A configurable PubSub Topic.
- */
-declare class Topic<Value> extends BaseChannel<Array<Value>, Value | Value[], [Value[], Value[]]> {
-  lc_graph_name: string;
-  unique: boolean;
-  accumulate: boolean;
-  seen: Set<Value>;
-  values: Value[];
-  constructor(fields?: {
-    /**
-     * Whether to only add unique values to the topic. If `true`, only unique values (using reference equality) will be added to the topic.
-     */
-    unique?: boolean;
-    /**
-     * Whether to accumulate values across steps. If `false`, the channel will be emptied after each step.
-     */
-    accumulate?: boolean;
-  });
-  fromCheckpoint(checkpoint?: [Value[], Value[]]): this;
-  update(values: Array<Value | Value[]>): boolean;
-  get(): Array<Value>;
-  checkpoint(): [Value[], Value[]];
-  isAvailable(): boolean;
-}
-//#endregion
-export { Topic };
-//# sourceMappingURL=topic.d.cts.map

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

@@ -1 +0,0 @@
-{"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;iBAoBvBG,MAAMD,QAAQA;SACtBC,MAAMD;iBACEA,SAASA"}

package/dist/channels/topic.d.ts

@@ -1,32 +0,0 @@
-import { BaseChannel } from "./base.js";
-
-//#region src/channels/topic.d.ts
-
-/**
- * A configurable PubSub Topic.
- */
-declare class Topic<Value> extends BaseChannel<Array<Value>, Value | Value[], [Value[], Value[]]> {
-  lc_graph_name: string;
-  unique: boolean;
-  accumulate: boolean;
-  seen: Set<Value>;
-  values: Value[];
-  constructor(fields?: {
-    /**
-     * Whether to only add unique values to the topic. If `true`, only unique values (using reference equality) will be added to the topic.
-     */
-    unique?: boolean;
-    /**
-     * Whether to accumulate values across steps. If `false`, the channel will be emptied after each step.
-     */
-    accumulate?: boolean;
-  });
-  fromCheckpoint(checkpoint?: [Value[], Value[]]): this;
-  update(values: Array<Value | Value[]>): boolean;
-  get(): Array<Value>;
-  checkpoint(): [Value[], Value[]];
-  isAvailable(): boolean;
-}
-//#endregion
-export { Topic };
-//# sourceMappingURL=topic.d.ts.map

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

@@ -1 +0,0 @@
-{"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;iBAoBvBG,MAAMD,QAAQA;SACtBC,MAAMD;iBACEA,SAASA"}