@rocicorp/zero 0.26.1 → 0.26.2-canary.4

package/out/zql/src/ivm/fan-in.js

@@ -1,64 +1,67 @@
 import { assert } from "../../../shared/src/asserts.js";
 import { emptyArray, identity } from "../../../shared/src/sentinels.js";
-import "compare-utf8";
+import "./data.js";
 import { throwFilterOutput } from "./filter-operators.js";
 import { pushAccumulatedChanges } from "./push-accumulated.js";
-class FanIn {
-  #inputs;
-  #schema;
-  #output = throwFilterOutput;
-  #accumulatedPushes = [];
-  constructor(fanOut, inputs) {
-    this.#inputs = inputs;
-    this.#schema = fanOut.getSchema();
-    for (const input of inputs) {
-      input.setFilterOutput(this);
-      assert(this.#schema === input.getSchema(), `Schema mismatch in fan-in`);
-    }
-  }
-  setFilterOutput(output) {
-    this.#output = output;
-  }
-  destroy() {
-    for (const input of this.#inputs) {
-      input.destroy();
-    }
-  }
-  getSchema() {
-    return this.#schema;
-  }
-  beginFilter() {
-    this.#output.beginFilter();
-  }
-  endFilter() {
-    this.#output.endFilter();
-  }
-  *filter(node) {
-    return yield* this.#output.filter(node);
-  }
-  push(change) {
-    this.#accumulatedPushes.push(change);
-    return emptyArray;
-  }
-  *fanOutDonePushingToAllBranches(fanOutChangeType) {
-    if (this.#inputs.length === 0) {
-      assert(
-        this.#accumulatedPushes.length === 0,
-        "If there are no inputs then fan-in should not receive any pushes."
-      );
-      return;
-    }
-    yield* pushAccumulatedChanges(
-      this.#accumulatedPushes,
-      this.#output,
-      this,
-      fanOutChangeType,
-      identity,
-      identity
-    );
-  }
-}
-export {
-  FanIn
+//#region ../zql/src/ivm/fan-in.ts
+/**
+* The FanIn operator merges multiple streams into one.
+* It eliminates duplicates and must be paired with a fan-out operator
+* somewhere upstream of the fan-in.
+*
+*  issue
+*    |
+* fan-out
+* /      \
+* a      b
+*  \    /
+* fan-in
+*   |
+*/
+var FanIn = class {
+	#inputs;
+	#schema;
+	#output = throwFilterOutput;
+	#accumulatedPushes = [];
+	constructor(fanOut, inputs) {
+		this.#inputs = inputs;
+		this.#schema = fanOut.getSchema();
+		for (const input of inputs) {
+			input.setFilterOutput(this);
+			assert(this.#schema === input.getSchema(), `Schema mismatch in fan-in`);
+		}
+	}
+	setFilterOutput(output) {
+		this.#output = output;
+	}
+	destroy() {
+		for (const input of this.#inputs) input.destroy();
+	}
+	getSchema() {
+		return this.#schema;
+	}
+	beginFilter() {
+		this.#output.beginFilter();
+	}
+	endFilter() {
+		this.#output.endFilter();
+	}
+	*filter(node) {
+		return yield* this.#output.filter(node);
+	}
+	push(change) {
+		this.#accumulatedPushes.push(change);
+		return emptyArray;
+	}
+	*fanOutDonePushingToAllBranches(fanOutChangeType) {
+		if (this.#inputs.length === 0) {
+			assert(this.#accumulatedPushes.length === 0, "If there are no inputs then fan-in should not receive any pushes.");
+			return;
+		}
+		yield* pushAccumulatedChanges(this.#accumulatedPushes, this.#output, this, fanOutChangeType, identity, identity);
+	}
 };
-//# sourceMappingURL=fan-in.js.map
+//#endregion
+export { FanIn };
+
+//# sourceMappingURL=fan-in.js.map

package/out/zql/src/ivm/fan-in.js.map

@@ -1 +1 @@
-{"version":3,"file":"fan-in.js","sources":["../../../../../zql/src/ivm/fan-in.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {emptyArray, identity} from '../../../shared/src/sentinels.ts';\nimport type {Change} from './change.ts';\nimport {type Node} from './data.ts';\nimport type {FanOut} from './fan-out.ts';\nimport {\n  throwFilterOutput,\n  type FilterInput,\n  type FilterOperator,\n  type FilterOutput,\n} from './filter-operators.ts';\nimport {pushAccumulatedChanges} from './push-accumulated.ts';\nimport type {SourceSchema} from './schema.ts';\n\n/**\n * The FanIn operator merges multiple streams into one.\n * It eliminates duplicates and must be paired with a fan-out operator\n * somewhere upstream of the fan-in.\n *\n *  issue\n *    |\n * fan-out\n * /      \\\n * a      b\n *  \\    /\n * fan-in\n *   |\n */\nexport class FanIn implements FilterOperator {\n  readonly #inputs: readonly FilterInput[];\n  readonly #schema: SourceSchema;\n  #output: FilterOutput = throwFilterOutput;\n  #accumulatedPushes: Change[] = [];\n\n  constructor(fanOut: FanOut, inputs: FilterInput[]) {\n    this.#inputs = inputs;\n    this.#schema = fanOut.getSchema();\n    for (const input of inputs) {\n      input.setFilterOutput(this);\n      assert(this.#schema === input.getSchema(), `Schema mismatch in fan-in`);\n    }\n  }\n\n  setFilterOutput(output: FilterOutput): void {\n    this.#output = output;\n  }\n\n  destroy(): void {\n    for (const input of this.#inputs) {\n      input.destroy();\n    }\n  }\n\n  getSchema() {\n    return this.#schema;\n  }\n\n  beginFilter(): void {\n    this.#output.beginFilter();\n  }\n\n  endFilter(): void {\n    this.#output.endFilter();\n  }\n\n  *filter(node: Node): Generator<'yield', boolean> {\n    return yield* this.#output.filter(node);\n  }\n\n  push(change: Change) {\n    this.#accumulatedPushes.push(change);\n    return emptyArray;\n  }\n\n  *fanOutDonePushingToAllBranches(fanOutChangeType: Change['type']) {\n    if (this.#inputs.length === 0) {\n      assert(\n        this.#accumulatedPushes.length === 0,\n        'If there are no inputs then fan-in should not receive any pushes.',\n      );\n      return;\n    }\n\n    yield* pushAccumulatedChanges(\n      this.#accumulatedPushes,\n      this.#output,\n      this,\n      fanOutChangeType,\n      identity,\n      identity,\n    );\n  }\n}\n"],"names":[],"mappings":";;;;;AA4BO,MAAM,MAAgC;AAAA,EAClC;AAAA,EACA;AAAA,EACT,UAAwB;AAAA,EACxB,qBAA+B,CAAA;AAAA,EAE/B,YAAY,QAAgB,QAAuB;AACjD,SAAK,UAAU;AACf,SAAK,UAAU,OAAO,UAAA;AACtB,eAAW,SAAS,QAAQ;AAC1B,YAAM,gBAAgB,IAAI;AAC1B,aAAO,KAAK,YAAY,MAAM,UAAA,GAAa,2BAA2B;AAAA,IACxE;AAAA,EACF;AAAA,EAEA,gBAAgB,QAA4B;AAC1C,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,UAAgB;AACd,eAAW,SAAS,KAAK,SAAS;AAChC,YAAM,QAAA;AAAA,IACR;AAAA,EACF;AAAA,EAEA,YAAY;AACV,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,cAAoB;AAClB,SAAK,QAAQ,YAAA;AAAA,EACf;AAAA,EAEA,YAAkB;AAChB,SAAK,QAAQ,UAAA;AAAA,EACf;AAAA,EAEA,CAAC,OAAO,MAAyC;AAC/C,WAAO,OAAO,KAAK,QAAQ,OAAO,IAAI;AAAA,EACxC;AAAA,EAEA,KAAK,QAAgB;AACnB,SAAK,mBAAmB,KAAK,MAAM;AACnC,WAAO;AAAA,EACT;AAAA,EAEA,CAAC,+BAA+B,kBAAkC;AAChE,QAAI,KAAK,QAAQ,WAAW,GAAG;AAC7B;AAAA,QACE,KAAK,mBAAmB,WAAW;AAAA,QACnC;AAAA,MAAA;AAEF;AAAA,IACF;AAEA,WAAO;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AACF;"}
+{"version":3,"file":"fan-in.js","names":["#inputs","#schema","#output","#accumulatedPushes"],"sources":["../../../../../zql/src/ivm/fan-in.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {emptyArray, identity} from '../../../shared/src/sentinels.ts';\nimport type {Change} from './change.ts';\nimport {type Node} from './data.ts';\nimport type {FanOut} from './fan-out.ts';\nimport {\n  throwFilterOutput,\n  type FilterInput,\n  type FilterOperator,\n  type FilterOutput,\n} from './filter-operators.ts';\nimport {pushAccumulatedChanges} from './push-accumulated.ts';\nimport type {SourceSchema} from './schema.ts';\n\n/**\n * The FanIn operator merges multiple streams into one.\n * It eliminates duplicates and must be paired with a fan-out operator\n * somewhere upstream of the fan-in.\n *\n *  issue\n *    |\n * fan-out\n * /      \\\n * a      b\n *  \\    /\n * fan-in\n *   |\n */\nexport class FanIn implements FilterOperator {\n  readonly #inputs: readonly FilterInput[];\n  readonly #schema: SourceSchema;\n  #output: FilterOutput = throwFilterOutput;\n  #accumulatedPushes: Change[] = [];\n\n  constructor(fanOut: FanOut, inputs: FilterInput[]) {\n    this.#inputs = inputs;\n    this.#schema = fanOut.getSchema();\n    for (const input of inputs) {\n      input.setFilterOutput(this);\n      assert(this.#schema === input.getSchema(), `Schema mismatch in fan-in`);\n    }\n  }\n\n  setFilterOutput(output: FilterOutput): void {\n    this.#output = output;\n  }\n\n  destroy(): void {\n    for (const input of this.#inputs) {\n      input.destroy();\n    }\n  }\n\n  getSchema() {\n    return this.#schema;\n  }\n\n  beginFilter(): void {\n    this.#output.beginFilter();\n  }\n\n  endFilter(): void {\n    this.#output.endFilter();\n  }\n\n  *filter(node: Node): Generator<'yield', boolean> {\n    return yield* this.#output.filter(node);\n  }\n\n  push(change: Change) {\n    this.#accumulatedPushes.push(change);\n    return emptyArray;\n  }\n\n  *fanOutDonePushingToAllBranches(fanOutChangeType: Change['type']) {\n    if (this.#inputs.length === 0) {\n      assert(\n        this.#accumulatedPushes.length === 0,\n        'If there are no inputs then fan-in should not receive any pushes.',\n      );\n      return;\n    }\n\n    yield* pushAccumulatedChanges(\n      this.#accumulatedPushes,\n      this.#output,\n      this,\n      fanOutChangeType,\n      identity,\n      identity,\n    );\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AA4BA,IAAa,QAAb,MAA6C;CAC3C;CACA;CACA,UAAwB;CACxB,qBAA+B,EAAE;CAEjC,YAAY,QAAgB,QAAuB;AACjD,QAAA,SAAe;AACf,QAAA,SAAe,OAAO,WAAW;AACjC,OAAK,MAAM,SAAS,QAAQ;AAC1B,SAAM,gBAAgB,KAAK;AAC3B,UAAO,MAAA,WAAiB,MAAM,WAAW,EAAE,4BAA4B;;;CAI3E,gBAAgB,QAA4B;AAC1C,QAAA,SAAe;;CAGjB,UAAgB;AACd,OAAK,MAAM,SAAS,MAAA,OAClB,OAAM,SAAS;;CAInB,YAAY;AACV,SAAO,MAAA;;CAGT,cAAoB;AAClB,QAAA,OAAa,aAAa;;CAG5B,YAAkB;AAChB,QAAA,OAAa,WAAW;;CAG1B,CAAC,OAAO,MAAyC;AAC/C,SAAO,OAAO,MAAA,OAAa,OAAO,KAAK;;CAGzC,KAAK,QAAgB;AACnB,QAAA,kBAAwB,KAAK,OAAO;AACpC,SAAO;;CAGT,CAAC,+BAA+B,kBAAkC;AAChE,MAAI,MAAA,OAAa,WAAW,GAAG;AAC7B,UACE,MAAA,kBAAwB,WAAW,GACnC,oEACD;AACD;;AAGF,SAAO,uBACL,MAAA,mBACA,MAAA,QACA,MACA,kBACA,UACA,SACD"}

package/out/zql/src/ivm/fan-out.js

@@ -1,63 +1,54 @@
 import { must } from "../../../shared/src/must.js";
-class FanOut {
-  #input;
-  #outputs = [];
-  #fanIn;
-  #destroyCount = 0;
-  constructor(input) {
-    this.#input = input;
-    input.setFilterOutput(this);
-  }
-  setFanIn(fanIn) {
-    this.#fanIn = fanIn;
-  }
-  setFilterOutput(output) {
-    this.#outputs.push(output);
-  }
-  destroy() {
-    if (this.#destroyCount < this.#outputs.length) {
-      ++this.#destroyCount;
-      if (this.#destroyCount === this.#outputs.length) {
-        this.#input.destroy();
-      }
-    } else {
-      throw new Error("FanOut already destroyed once for each output");
-    }
-  }
-  getSchema() {
-    return this.#input.getSchema();
-  }
-  beginFilter() {
-    for (const output of this.#outputs) {
-      output.beginFilter();
-    }
-  }
-  endFilter() {
-    for (const output of this.#outputs) {
-      output.endFilter();
-    }
-  }
-  *filter(node) {
-    let result = false;
-    for (const output of this.#outputs) {
-      result = (yield* output.filter(node)) || result;
-      if (result) {
-        return true;
-      }
-    }
-    return result;
-  }
-  *push(change) {
-    for (const out of this.#outputs) {
-      yield* out.push(change, this);
-    }
-    yield* must(
-      this.#fanIn,
-      "fan-out must have a corresponding fan-in set!"
-    ).fanOutDonePushingToAllBranches(change.type);
-  }
-}
-export {
-  FanOut
+//#region ../zql/src/ivm/fan-out.ts
+/**
+* Forks a stream into multiple streams.
+* Is meant to be paired with a `FanIn` operator which will
+* later merge the forks back together.
+*/
+var FanOut = class {
+	#input;
+	#outputs = [];
+	#fanIn;
+	#destroyCount = 0;
+	constructor(input) {
+		this.#input = input;
+		input.setFilterOutput(this);
+	}
+	setFanIn(fanIn) {
+		this.#fanIn = fanIn;
+	}
+	setFilterOutput(output) {
+		this.#outputs.push(output);
+	}
+	destroy() {
+		if (this.#destroyCount < this.#outputs.length) {
+			++this.#destroyCount;
+			if (this.#destroyCount === this.#outputs.length) this.#input.destroy();
+		} else throw new Error("FanOut already destroyed once for each output");
+	}
+	getSchema() {
+		return this.#input.getSchema();
+	}
+	beginFilter() {
+		for (const output of this.#outputs) output.beginFilter();
+	}
+	endFilter() {
+		for (const output of this.#outputs) output.endFilter();
+	}
+	*filter(node) {
+		let result = false;
+		for (const output of this.#outputs) {
+			result = (yield* output.filter(node)) || result;
+			if (result) return true;
+		}
+		return result;
+	}
+	*push(change) {
+		for (const out of this.#outputs) yield* out.push(change, this);
+		yield* must(this.#fanIn, "fan-out must have a corresponding fan-in set!").fanOutDonePushingToAllBranches(change.type);
+	}
 };
-//# sourceMappingURL=fan-out.js.map
+//#endregion
+export { FanOut };
+
+//# sourceMappingURL=fan-out.js.map

package/out/zql/src/ivm/fan-out.js.map

@@ -1 +1 @@
-{"version":3,"file":"fan-out.js","sources":["../../../../../zql/src/ivm/fan-out.ts"],"sourcesContent":["import {must} from '../../../shared/src/must.ts';\nimport type {Change} from './change.ts';\nimport type {FanIn} from './fan-in.ts';\nimport type {Node} from './data.ts';\nimport type {\n  FilterInput,\n  FilterOperator,\n  FilterOutput,\n} from './filter-operators.ts';\n\n/**\n * Forks a stream into multiple streams.\n * Is meant to be paired with a `FanIn` operator which will\n * later merge the forks back together.\n */\nexport class FanOut implements FilterOperator {\n  readonly #input: FilterInput;\n  readonly #outputs: FilterOutput[] = [];\n  #fanIn: FanIn | undefined;\n  #destroyCount: number = 0;\n\n  constructor(input: FilterInput) {\n    this.#input = input;\n    input.setFilterOutput(this);\n  }\n\n  setFanIn(fanIn: FanIn) {\n    this.#fanIn = fanIn;\n  }\n\n  setFilterOutput(output: FilterOutput): void {\n    this.#outputs.push(output);\n  }\n\n  destroy(): void {\n    if (this.#destroyCount < this.#outputs.length) {\n      ++this.#destroyCount;\n      if (this.#destroyCount === this.#outputs.length) {\n        this.#input.destroy();\n      }\n    } else {\n      throw new Error('FanOut already destroyed once for each output');\n    }\n  }\n\n  getSchema() {\n    return this.#input.getSchema();\n  }\n\n  beginFilter(): void {\n    for (const output of this.#outputs) {\n      output.beginFilter();\n    }\n  }\n\n  endFilter(): void {\n    for (const output of this.#outputs) {\n      output.endFilter();\n    }\n  }\n\n  *filter(node: Node): Generator<'yield', boolean> {\n    let result = false;\n    for (const output of this.#outputs) {\n      result = (yield* output.filter(node)) || result;\n      if (result) {\n        return true;\n      }\n    }\n    return result;\n  }\n\n  *push(change: Change) {\n    for (const out of this.#outputs) {\n      yield* out.push(change, this);\n    }\n    yield* must(\n      this.#fanIn,\n      'fan-out must have a corresponding fan-in set!',\n    ).fanOutDonePushingToAllBranches(change.type);\n  }\n}\n"],"names":[],"mappings":";AAeO,MAAM,OAAiC;AAAA,EACnC;AAAA,EACA,WAA2B,CAAA;AAAA,EACpC;AAAA,EACA,gBAAwB;AAAA,EAExB,YAAY,OAAoB;AAC9B,SAAK,SAAS;AACd,UAAM,gBAAgB,IAAI;AAAA,EAC5B;AAAA,EAEA,SAAS,OAAc;AACrB,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,gBAAgB,QAA4B;AAC1C,SAAK,SAAS,KAAK,MAAM;AAAA,EAC3B;AAAA,EAEA,UAAgB;AACd,QAAI,KAAK,gBAAgB,KAAK,SAAS,QAAQ;AAC7C,QAAE,KAAK;AACP,UAAI,KAAK,kBAAkB,KAAK,SAAS,QAAQ;AAC/C,aAAK,OAAO,QAAA;AAAA,MACd;AAAA,IACF,OAAO;AACL,YAAM,IAAI,MAAM,+CAA+C;AAAA,IACjE;AAAA,EACF;AAAA,EAEA,YAAY;AACV,WAAO,KAAK,OAAO,UAAA;AAAA,EACrB;AAAA,EAEA,cAAoB;AAClB,eAAW,UAAU,KAAK,UAAU;AAClC,aAAO,YAAA;AAAA,IACT;AAAA,EACF;AAAA,EAEA,YAAkB;AAChB,eAAW,UAAU,KAAK,UAAU;AAClC,aAAO,UAAA;AAAA,IACT;AAAA,EACF;AAAA,EAEA,CAAC,OAAO,MAAyC;AAC/C,QAAI,SAAS;AACb,eAAW,UAAU,KAAK,UAAU;AAClC,gBAAU,OAAO,OAAO,OAAO,IAAI,MAAM;AACzC,UAAI,QAAQ;AACV,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA,EAEA,CAAC,KAAK,QAAgB;AACpB,eAAW,OAAO,KAAK,UAAU;AAC/B,aAAO,IAAI,KAAK,QAAQ,IAAI;AAAA,IAC9B;AACA,WAAO;AAAA,MACL,KAAK;AAAA,MACL;AAAA,IAAA,EACA,+BAA+B,OAAO,IAAI;AAAA,EAC9C;AACF;"}
+{"version":3,"file":"fan-out.js","names":["#input","#outputs","#fanIn","#destroyCount"],"sources":["../../../../../zql/src/ivm/fan-out.ts"],"sourcesContent":["import {must} from '../../../shared/src/must.ts';\nimport type {Change} from './change.ts';\nimport type {FanIn} from './fan-in.ts';\nimport type {Node} from './data.ts';\nimport type {\n  FilterInput,\n  FilterOperator,\n  FilterOutput,\n} from './filter-operators.ts';\n\n/**\n * Forks a stream into multiple streams.\n * Is meant to be paired with a `FanIn` operator which will\n * later merge the forks back together.\n */\nexport class FanOut implements FilterOperator {\n  readonly #input: FilterInput;\n  readonly #outputs: FilterOutput[] = [];\n  #fanIn: FanIn | undefined;\n  #destroyCount: number = 0;\n\n  constructor(input: FilterInput) {\n    this.#input = input;\n    input.setFilterOutput(this);\n  }\n\n  setFanIn(fanIn: FanIn) {\n    this.#fanIn = fanIn;\n  }\n\n  setFilterOutput(output: FilterOutput): void {\n    this.#outputs.push(output);\n  }\n\n  destroy(): void {\n    if (this.#destroyCount < this.#outputs.length) {\n      ++this.#destroyCount;\n      if (this.#destroyCount === this.#outputs.length) {\n        this.#input.destroy();\n      }\n    } else {\n      throw new Error('FanOut already destroyed once for each output');\n    }\n  }\n\n  getSchema() {\n    return this.#input.getSchema();\n  }\n\n  beginFilter(): void {\n    for (const output of this.#outputs) {\n      output.beginFilter();\n    }\n  }\n\n  endFilter(): void {\n    for (const output of this.#outputs) {\n      output.endFilter();\n    }\n  }\n\n  *filter(node: Node): Generator<'yield', boolean> {\n    let result = false;\n    for (const output of this.#outputs) {\n      result = (yield* output.filter(node)) || result;\n      if (result) {\n        return true;\n      }\n    }\n    return result;\n  }\n\n  *push(change: Change) {\n    for (const out of this.#outputs) {\n      yield* out.push(change, this);\n    }\n    yield* must(\n      this.#fanIn,\n      'fan-out must have a corresponding fan-in set!',\n    ).fanOutDonePushingToAllBranches(change.type);\n  }\n}\n"],"mappings":";;;;;;;AAeA,IAAa,SAAb,MAA8C;CAC5C;CACA,WAAoC,EAAE;CACtC;CACA,gBAAwB;CAExB,YAAY,OAAoB;AAC9B,QAAA,QAAc;AACd,QAAM,gBAAgB,KAAK;;CAG7B,SAAS,OAAc;AACrB,QAAA,QAAc;;CAGhB,gBAAgB,QAA4B;AAC1C,QAAA,QAAc,KAAK,OAAO;;CAG5B,UAAgB;AACd,MAAI,MAAA,eAAqB,MAAA,QAAc,QAAQ;AAC7C,KAAE,MAAA;AACF,OAAI,MAAA,iBAAuB,MAAA,QAAc,OACvC,OAAA,MAAY,SAAS;QAGvB,OAAM,IAAI,MAAM,gDAAgD;;CAIpE,YAAY;AACV,SAAO,MAAA,MAAY,WAAW;;CAGhC,cAAoB;AAClB,OAAK,MAAM,UAAU,MAAA,QACnB,QAAO,aAAa;;CAIxB,YAAkB;AAChB,OAAK,MAAM,UAAU,MAAA,QACnB,QAAO,WAAW;;CAItB,CAAC,OAAO,MAAyC;EAC/C,IAAI,SAAS;AACb,OAAK,MAAM,UAAU,MAAA,SAAe;AAClC,aAAU,OAAO,OAAO,OAAO,KAAK,KAAK;AACzC,OAAI,OACF,QAAO;;AAGX,SAAO;;CAGT,CAAC,KAAK,QAAgB;AACpB,OAAK,MAAM,OAAO,MAAA,QAChB,QAAO,IAAI,KAAK,QAAQ,KAAK;AAE/B,SAAO,KACL,MAAA,OACA,gDACD,CAAC,+BAA+B,OAAO,KAAK"}

package/out/zql/src/ivm/filter-operators.js

@@ -1,99 +1,94 @@
-import "compare-utf8";
-const throwFilterOutput = {
-  *push(_change) {
-    throw new Error("Output not set");
-  },
-  *filter(_node) {
-    throw new Error("Output not set");
-  },
-  beginFilter() {
-  },
-  endFilter() {
-  }
+import "./data.js";
+//#region ../zql/src/ivm/filter-operators.ts
+/**
+* An implementation of FilterOutput that throws if push or filter is called.
+* It is used as the initial value for for an operator's output before it is
+* set.
+*/
+var throwFilterOutput = {
+	*push(_change) {
+		throw new Error("Output not set");
+	},
+	*filter(_node) {
+		throw new Error("Output not set");
+	},
+	beginFilter() {},
+	endFilter() {}
+};
+var FilterStart = class {
+	#input;
+	#output = throwFilterOutput;
+	constructor(input) {
+		this.#input = input;
+		input.setOutput(this);
+	}
+	setFilterOutput(output) {
+		this.#output = output;
+	}
+	destroy() {
+		this.#input.destroy();
+	}
+	getSchema() {
+		return this.#input.getSchema();
+	}
+	*push(change) {
+		yield* this.#output.push(change, this);
+	}
+	*fetch(req) {
+		this.#output.beginFilter();
+		try {
+			for (const node of this.#input.fetch(req)) {
+				if (node === "yield") {
+					yield node;
+					continue;
+				}
+				if (yield* this.#output.filter(node)) yield node;
+			}
+		} finally {
+			this.#output.endFilter();
+		}
+	}
+};
+var FilterEnd = class {
+	#start;
+	#input;
+	#output = throwFilterOutput;
+	constructor(start, input) {
+		this.#start = start;
+		this.#input = input;
+		input.setFilterOutput(this);
+	}
+	*fetch(req) {
+		for (const node of this.#start.fetch(req)) yield node;
+	}
+	beginFilter() {}
+	endFilter() {}
+	*filter(_node) {
+		return true;
+	}
+	setOutput(output) {
+		this.#output = output;
+	}
+	destroy() {
+		this.#input.destroy();
+	}
+	getSchema() {
+		return this.#input.getSchema();
+	}
+	*push(change) {
+		yield* this.#output.push(change, this);
+	}
 };
-class FilterStart {
-  #input;
-  #output = throwFilterOutput;
-  constructor(input) {
-    this.#input = input;
-    input.setOutput(this);
-  }
-  setFilterOutput(output) {
-    this.#output = output;
-  }
-  destroy() {
-    this.#input.destroy();
-  }
-  getSchema() {
-    return this.#input.getSchema();
-  }
-  *push(change) {
-    yield* this.#output.push(change, this);
-  }
-  *fetch(req) {
-    this.#output.beginFilter();
-    try {
-      for (const node of this.#input.fetch(req)) {
-        if (node === "yield") {
-          yield node;
-          continue;
-        }
-        if (yield* this.#output.filter(node)) {
-          yield node;
-        }
-      }
-    } finally {
-      this.#output.endFilter();
-    }
-  }
-}
-class FilterEnd {
-  #start;
-  #input;
-  #output = throwFilterOutput;
-  constructor(start, input) {
-    this.#start = start;
-    this.#input = input;
-    input.setFilterOutput(this);
-  }
-  *fetch(req) {
-    for (const node of this.#start.fetch(req)) {
-      yield node;
-    }
-  }
-  beginFilter() {
-  }
-  endFilter() {
-  }
-  *filter(_node) {
-    return true;
-  }
-  setOutput(output) {
-    this.#output = output;
-  }
-  destroy() {
-    this.#input.destroy();
-  }
-  getSchema() {
-    return this.#input.getSchema();
-  }
-  *push(change) {
-    yield* this.#output.push(change, this);
-  }
-}
 function buildFilterPipeline(input, delegate, pipeline) {
-  const filterStart = new FilterStart(input);
-  delegate.addEdge(input, filterStart);
-  const middle = pipeline(filterStart);
-  delegate.addEdge(filterStart, middle);
-  const filterEnd = new FilterEnd(filterStart, middle);
-  delegate.addEdge(middle, filterEnd);
-  return filterEnd;
+	const filterStart = new FilterStart(input);
+	delegate.addEdge(input, filterStart);
+	const middle = pipeline(filterStart);
+	delegate.addEdge(filterStart, middle);
+	const filterEnd = new FilterEnd(filterStart, middle);
+	delegate.addEdge(middle, filterEnd);
+	return filterEnd;
 }
-export {
-  FilterEnd,
-  FilterStart,
-  buildFilterPipeline,
-  throwFilterOutput
-};
-//# sourceMappingURL=filter-operators.js.map
+//#endregion
+export { buildFilterPipeline, throwFilterOutput };
+
+//# sourceMappingURL=filter-operators.js.map

package/out/zql/src/ivm/filter-operators.js.map

@@ -1 +1 @@
-{"version":3,"file":"filter-operators.js","sources":["../../../../../zql/src/ivm/filter-operators.ts"],"sourcesContent":["import type {FetchRequest, Input, InputBase, Output} from './operator.ts';\nimport {type Node} from './data.ts';\nimport type {Change} from './change.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.ts';\nimport type {BuilderDelegate} from '../builder/builder.ts';\n\n/**\n * The `where` clause of a ZQL query is implemented using a sub-graph of\n * `FilterOperators`.  This sub-graph starts with a `FilterStart` operator,\n * that adapts from the normal `Operator` `Output`, to the\n * `FilterOperator` `FilterInput`, and ends with a `FilterEnd` operator that\n * adapts from a `FilterOperator` `FilterOutput` to a normal `Operator` `Input`.\n * `FilterOperator`'s do not have `fetch` instead they have a\n * `filter(node: Node): boolean` method.\n * They also have `push` which is just like normal `Operator` push.\n * Not having a `fetch` means these `FilterOperator`'s cannot modify\n * `Node` `row`s or `relationship`s, but they shouldn't, they should just\n * filter.\n *\n * This `FilterOperator` abstraction enables much more efficient processing of\n * `fetch` for `where` clauses containing OR conditions.\n *\n * See https://github.com/rocicorp/mono/pull/4339\n */\n\nexport interface FilterInput extends InputBase {\n  /** Tell the input where to send its output. */\n  setFilterOutput(output: FilterOutput): void;\n}\n\nexport interface FilterOutput extends Output {\n  // Lets the operator know that we're in a loop of filtering\n  // nodes. E.g., so the operator can cache results for the\n  // duration of the loop.\n  beginFilter(): void;\n  filter(node: Node): Generator<'yield', boolean>;\n  endFilter(): void;\n}\n\nexport interface FilterOperator extends FilterInput, FilterOutput {}\n\n/**\n * An implementation of FilterOutput that throws if push or filter is called.\n * It is used as the initial value for for an operator's output before it is\n * set.\n */\nexport const throwFilterOutput: FilterOutput = {\n  *push(_change: Change): Stream<'yield'> {\n    throw new Error('Output not set');\n  },\n\n  *filter(_node: Node): Generator<'yield', boolean> {\n    throw new Error('Output not set');\n  },\n\n  beginFilter() {},\n  endFilter() {},\n};\n\nexport class FilterStart implements FilterInput, Output {\n  readonly #input: Input;\n  #output: FilterOutput = throwFilterOutput;\n\n  constructor(input: Input) {\n    this.#input = input;\n    input.setOutput(this);\n  }\n\n  setFilterOutput(output: FilterOutput) {\n    this.#output = output;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  *push(change: Change) {\n    yield* this.#output.push(change, this);\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    this.#output.beginFilter();\n    try {\n      for (const node of this.#input.fetch(req)) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        }\n        if (yield* this.#output.filter(node)) {\n          yield node;\n        }\n      }\n    } finally {\n      // finally is important if an exception is thrown or\n      // if the stream is not fully consumed.\n      this.#output.endFilter();\n    }\n  }\n}\n\nexport class FilterEnd implements Input, FilterOutput {\n  readonly #start: FilterStart;\n  readonly #input: FilterInput;\n\n  #output: Output = throwFilterOutput;\n\n  constructor(start: FilterStart, input: FilterInput) {\n    this.#start = start;\n    this.#input = input;\n    input.setFilterOutput(this);\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    for (const node of this.#start.fetch(req)) {\n      yield node;\n    }\n  }\n\n  beginFilter() {}\n  endFilter() {}\n\n  *filter(_node: Node) {\n    return true;\n  }\n\n  setOutput(output: Output) {\n    this.#output = output;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  *push(change: Change) {\n    yield* this.#output.push(change, this);\n  }\n}\n\nexport function buildFilterPipeline(\n  input: Input,\n  delegate: BuilderDelegate,\n  pipeline: (filterInput: FilterInput) => FilterInput,\n): Input {\n  const filterStart = new FilterStart(input);\n  delegate.addEdge(input, filterStart);\n  const middle = pipeline(filterStart);\n  delegate.addEdge(filterStart, middle);\n  const filterEnd = new FilterEnd(filterStart, middle);\n  delegate.addEdge(middle, filterEnd);\n  return filterEnd;\n}\n"],"names":[],"mappings":";AA+CO,MAAM,oBAAkC;AAAA,EAC7C,CAAC,KAAK,SAAkC;AACtC,UAAM,IAAI,MAAM,gBAAgB;AAAA,EAClC;AAAA,EAEA,CAAC,OAAO,OAA0C;AAChD,UAAM,IAAI,MAAM,gBAAgB;AAAA,EAClC;AAAA,EAEA,cAAc;AAAA,EAAC;AAAA,EACf,YAAY;AAAA,EAAC;AACf;AAEO,MAAM,YAA2C;AAAA,EAC7C;AAAA,EACT,UAAwB;AAAA,EAExB,YAAY,OAAc;AACxB,SAAK,SAAS;AACd,UAAM,UAAU,IAAI;AAAA,EACtB;AAAA,EAEA,gBAAgB,QAAsB;AACpC,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,UAAgB;AACd,SAAK,OAAO,QAAA;AAAA,EACd;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK,OAAO,UAAA;AAAA,EACrB;AAAA,EAEA,CAAC,KAAK,QAAgB;AACpB,WAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,EACvC;AAAA,EAEA,CAAC,MAAM,KAA2C;AAChD,SAAK,QAAQ,YAAA;AACb,QAAI;AACF,iBAAW,QAAQ,KAAK,OAAO,MAAM,GAAG,GAAG;AACzC,YAAI,SAAS,SAAS;AACpB,gBAAM;AACN;AAAA,QACF;AACA,YAAI,OAAO,KAAK,QAAQ,OAAO,IAAI,GAAG;AACpC,gBAAM;AAAA,QACR;AAAA,MACF;AAAA,IACF,UAAA;AAGE,WAAK,QAAQ,UAAA;AAAA,IACf;AAAA,EACF;AACF;AAEO,MAAM,UAAyC;AAAA,EAC3C;AAAA,EACA;AAAA,EAET,UAAkB;AAAA,EAElB,YAAY,OAAoB,OAAoB;AAClD,SAAK,SAAS;AACd,SAAK,SAAS;AACd,UAAM,gBAAgB,IAAI;AAAA,EAC5B;AAAA,EAEA,CAAC,MAAM,KAA2C;AAChD,eAAW,QAAQ,KAAK,OAAO,MAAM,GAAG,GAAG;AACzC,YAAM;AAAA,IACR;AAAA,EACF;AAAA,EAEA,cAAc;AAAA,EAAC;AAAA,EACf,YAAY;AAAA,EAAC;AAAA,EAEb,CAAC,OAAO,OAAa;AACnB,WAAO;AAAA,EACT;AAAA,EAEA,UAAU,QAAgB;AACxB,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,UAAgB;AACd,SAAK,OAAO,QAAA;AAAA,EACd;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK,OAAO,UAAA;AAAA,EACrB;AAAA,EAEA,CAAC,KAAK,QAAgB;AACpB,WAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,EACvC;AACF;AAEO,SAAS,oBACd,OACA,UACA,UACO;AACP,QAAM,cAAc,IAAI,YAAY,KAAK;AACzC,WAAS,QAAQ,OAAO,WAAW;AACnC,QAAM,SAAS,SAAS,WAAW;AACnC,WAAS,QAAQ,aAAa,MAAM;AACpC,QAAM,YAAY,IAAI,UAAU,aAAa,MAAM;AACnD,WAAS,QAAQ,QAAQ,SAAS;AAClC,SAAO;AACT;"}
+{"version":3,"file":"filter-operators.js","names":["#input","#output","#start"],"sources":["../../../../../zql/src/ivm/filter-operators.ts"],"sourcesContent":["import type {FetchRequest, Input, InputBase, Output} from './operator.ts';\nimport {type Node} from './data.ts';\nimport type {Change} from './change.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.ts';\nimport type {BuilderDelegate} from '../builder/builder.ts';\n\n/**\n * The `where` clause of a ZQL query is implemented using a sub-graph of\n * `FilterOperators`.  This sub-graph starts with a `FilterStart` operator,\n * that adapts from the normal `Operator` `Output`, to the\n * `FilterOperator` `FilterInput`, and ends with a `FilterEnd` operator that\n * adapts from a `FilterOperator` `FilterOutput` to a normal `Operator` `Input`.\n * `FilterOperator`'s do not have `fetch` instead they have a\n * `filter(node: Node): boolean` method.\n * They also have `push` which is just like normal `Operator` push.\n * Not having a `fetch` means these `FilterOperator`'s cannot modify\n * `Node` `row`s or `relationship`s, but they shouldn't, they should just\n * filter.\n *\n * This `FilterOperator` abstraction enables much more efficient processing of\n * `fetch` for `where` clauses containing OR conditions.\n *\n * See https://github.com/rocicorp/mono/pull/4339\n */\n\nexport interface FilterInput extends InputBase {\n  /** Tell the input where to send its output. */\n  setFilterOutput(output: FilterOutput): void;\n}\n\nexport interface FilterOutput extends Output {\n  // Lets the operator know that we're in a loop of filtering\n  // nodes. E.g., so the operator can cache results for the\n  // duration of the loop.\n  beginFilter(): void;\n  filter(node: Node): Generator<'yield', boolean>;\n  endFilter(): void;\n}\n\nexport interface FilterOperator extends FilterInput, FilterOutput {}\n\n/**\n * An implementation of FilterOutput that throws if push or filter is called.\n * It is used as the initial value for for an operator's output before it is\n * set.\n */\nexport const throwFilterOutput: FilterOutput = {\n  *push(_change: Change): Stream<'yield'> {\n    throw new Error('Output not set');\n  },\n\n  *filter(_node: Node): Generator<'yield', boolean> {\n    throw new Error('Output not set');\n  },\n\n  beginFilter() {},\n  endFilter() {},\n};\n\nexport class FilterStart implements FilterInput, Output {\n  readonly #input: Input;\n  #output: FilterOutput = throwFilterOutput;\n\n  constructor(input: Input) {\n    this.#input = input;\n    input.setOutput(this);\n  }\n\n  setFilterOutput(output: FilterOutput) {\n    this.#output = output;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  *push(change: Change) {\n    yield* this.#output.push(change, this);\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    this.#output.beginFilter();\n    try {\n      for (const node of this.#input.fetch(req)) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        }\n        if (yield* this.#output.filter(node)) {\n          yield node;\n        }\n      }\n    } finally {\n      // finally is important if an exception is thrown or\n      // if the stream is not fully consumed.\n      this.#output.endFilter();\n    }\n  }\n}\n\nexport class FilterEnd implements Input, FilterOutput {\n  readonly #start: FilterStart;\n  readonly #input: FilterInput;\n\n  #output: Output = throwFilterOutput;\n\n  constructor(start: FilterStart, input: FilterInput) {\n    this.#start = start;\n    this.#input = input;\n    input.setFilterOutput(this);\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    for (const node of this.#start.fetch(req)) {\n      yield node;\n    }\n  }\n\n  beginFilter() {}\n  endFilter() {}\n\n  *filter(_node: Node) {\n    return true;\n  }\n\n  setOutput(output: Output) {\n    this.#output = output;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  *push(change: Change) {\n    yield* this.#output.push(change, this);\n  }\n}\n\nexport function buildFilterPipeline(\n  input: Input,\n  delegate: BuilderDelegate,\n  pipeline: (filterInput: FilterInput) => FilterInput,\n): Input {\n  const filterStart = new FilterStart(input);\n  delegate.addEdge(input, filterStart);\n  const middle = pipeline(filterStart);\n  delegate.addEdge(filterStart, middle);\n  const filterEnd = new FilterEnd(filterStart, middle);\n  delegate.addEdge(middle, filterEnd);\n  return filterEnd;\n}\n"],"mappings":";;;;;;;AA+CA,IAAa,oBAAkC;CAC7C,CAAC,KAAK,SAAkC;AACtC,QAAM,IAAI,MAAM,iBAAiB;;CAGnC,CAAC,OAAO,OAA0C;AAChD,QAAM,IAAI,MAAM,iBAAiB;;CAGnC,cAAc;CACd,YAAY;CACb;AAED,IAAa,cAAb,MAAwD;CACtD;CACA,UAAwB;CAExB,YAAY,OAAc;AACxB,QAAA,QAAc;AACd,QAAM,UAAU,KAAK;;CAGvB,gBAAgB,QAAsB;AACpC,QAAA,SAAe;;CAGjB,UAAgB;AACd,QAAA,MAAY,SAAS;;CAGvB,YAA0B;AACxB,SAAO,MAAA,MAAY,WAAW;;CAGhC,CAAC,KAAK,QAAgB;AACpB,SAAO,MAAA,OAAa,KAAK,QAAQ,KAAK;;CAGxC,CAAC,MAAM,KAA2C;AAChD,QAAA,OAAa,aAAa;AAC1B,MAAI;AACF,QAAK,MAAM,QAAQ,MAAA,MAAY,MAAM,IAAI,EAAE;AACzC,QAAI,SAAS,SAAS;AACpB,WAAM;AACN;;AAEF,QAAI,OAAO,MAAA,OAAa,OAAO,KAAK,CAClC,OAAM;;YAGF;AAGR,SAAA,OAAa,WAAW;;;;AAK9B,IAAa,YAAb,MAAsD;CACpD;CACA;CAEA,UAAkB;CAElB,YAAY,OAAoB,OAAoB;AAClD,QAAA,QAAc;AACd,QAAA,QAAc;AACd,QAAM,gBAAgB,KAAK;;CAG7B,CAAC,MAAM,KAA2C;AAChD,OAAK,MAAM,QAAQ,MAAA,MAAY,MAAM,IAAI,CACvC,OAAM;;CAIV,cAAc;CACd,YAAY;CAEZ,CAAC,OAAO,OAAa;AACnB,SAAO;;CAGT,UAAU,QAAgB;AACxB,QAAA,SAAe;;CAGjB,UAAgB;AACd,QAAA,MAAY,SAAS;;CAGvB,YAA0B;AACxB,SAAO,MAAA,MAAY,WAAW;;CAGhC,CAAC,KAAK,QAAgB;AACpB,SAAO,MAAA,OAAa,KAAK,QAAQ,KAAK;;;AAI1C,SAAgB,oBACd,OACA,UACA,UACO;CACP,MAAM,cAAc,IAAI,YAAY,MAAM;AAC1C,UAAS,QAAQ,OAAO,YAAY;CACpC,MAAM,SAAS,SAAS,YAAY;AACpC,UAAS,QAAQ,aAAa,OAAO;CACrC,MAAM,YAAY,IAAI,UAAU,aAAa,OAAO;AACpD,UAAS,QAAQ,QAAQ,UAAU;AACnC,QAAO"}

package/out/zql/src/ivm/filter-push.js

@@ -1,30 +1,26 @@
 import { unreachable } from "../../../shared/src/asserts.js";
 import { maybeSplitAndPushEditChange } from "./maybe-split-and-push-edit-change.js";
+//#region ../zql/src/ivm/filter-push.ts
 function* filterPush(change, output, pusher, predicate) {
-  if (!predicate) {
-    yield* output.push(change, pusher);
-    return;
-  }
-  switch (change.type) {
-    case "add":
-    case "remove":
-      if (predicate(change.node.row)) {
-        yield* output.push(change, pusher);
-      }
-      break;
-    case "child":
-      if (predicate(change.node.row)) {
-        yield* output.push(change, pusher);
-      }
-      break;
-    case "edit":
-      yield* maybeSplitAndPushEditChange(change, predicate, output, pusher);
-      break;
-    default:
-      unreachable();
-  }
+	if (!predicate) {
+		yield* output.push(change, pusher);
+		return;
+	}
+	switch (change.type) {
+		case "add":
+		case "remove":
+			if (predicate(change.node.row)) yield* output.push(change, pusher);
+			break;
+		case "child":
+			if (predicate(change.node.row)) yield* output.push(change, pusher);
+			break;
+		case "edit":
+			yield* maybeSplitAndPushEditChange(change, predicate, output, pusher);
+			break;
+		default: unreachable(change);
+	}
 }
-export {
-  filterPush
-};
-//# sourceMappingURL=filter-push.js.map
+//#endregion
+export { filterPush };
+
+//# sourceMappingURL=filter-push.js.map

package/out/zql/src/ivm/filter-push.js.map

@@ -1 +1 @@
-{"version":3,"file":"filter-push.js","sources":["../../../../../zql/src/ivm/filter-push.ts"],"sourcesContent":["import {unreachable} from '../../../shared/src/asserts.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport type {Change} from './change.ts';\nimport {maybeSplitAndPushEditChange} from './maybe-split-and-push-edit-change.ts';\nimport type {InputBase, Output} from './operator.ts';\nimport type {Stream} from './stream.ts';\n\nexport function* filterPush(\n  change: Change,\n  output: Output,\n  pusher: InputBase,\n  predicate?: (row: Row) => boolean,\n): Stream<'yield'> {\n  if (!predicate) {\n    yield* output.push(change, pusher);\n    return;\n  }\n  switch (change.type) {\n    case 'add':\n    case 'remove':\n      if (predicate(change.node.row)) {\n        yield* output.push(change, pusher);\n      }\n      break;\n    case 'child':\n      if (predicate(change.node.row)) {\n        yield* output.push(change, pusher);\n      }\n      break;\n    case 'edit':\n      yield* maybeSplitAndPushEditChange(change, predicate, output, pusher);\n      break;\n    default:\n      unreachable(change);\n  }\n}\n"],"names":[],"mappings":";;AAOO,UAAU,WACf,QACA,QACA,QACA,WACiB;AACjB,MAAI,CAAC,WAAW;AACd,WAAO,OAAO,KAAK,QAAQ,MAAM;AACjC;AAAA,EACF;AACA,UAAQ,OAAO,MAAA;AAAA,IACb,KAAK;AAAA,IACL,KAAK;AACH,UAAI,UAAU,OAAO,KAAK,GAAG,GAAG;AAC9B,eAAO,OAAO,KAAK,QAAQ,MAAM;AAAA,MACnC;AACA;AAAA,IACF,KAAK;AACH,UAAI,UAAU,OAAO,KAAK,GAAG,GAAG;AAC9B,eAAO,OAAO,KAAK,QAAQ,MAAM;AAAA,MACnC;AACA;AAAA,IACF,KAAK;AACH,aAAO,4BAA4B,QAAQ,WAAW,QAAQ,MAAM;AACpE;AAAA,IACF;AACE,kBAAkB;AAAA,EAAA;AAExB;"}
+{"version":3,"file":"filter-push.js","names":[],"sources":["../../../../../zql/src/ivm/filter-push.ts"],"sourcesContent":["import {unreachable} from '../../../shared/src/asserts.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport type {Change} from './change.ts';\nimport {maybeSplitAndPushEditChange} from './maybe-split-and-push-edit-change.ts';\nimport type {InputBase, Output} from './operator.ts';\nimport type {Stream} from './stream.ts';\n\nexport function* filterPush(\n  change: Change,\n  output: Output,\n  pusher: InputBase,\n  predicate?: (row: Row) => boolean,\n): Stream<'yield'> {\n  if (!predicate) {\n    yield* output.push(change, pusher);\n    return;\n  }\n  switch (change.type) {\n    case 'add':\n    case 'remove':\n      if (predicate(change.node.row)) {\n        yield* output.push(change, pusher);\n      }\n      break;\n    case 'child':\n      if (predicate(change.node.row)) {\n        yield* output.push(change, pusher);\n      }\n      break;\n    case 'edit':\n      yield* maybeSplitAndPushEditChange(change, predicate, output, pusher);\n      break;\n    default:\n      unreachable(change);\n  }\n}\n"],"mappings":";;;AAOA,UAAiB,WACf,QACA,QACA,QACA,WACiB;AACjB,KAAI,CAAC,WAAW;AACd,SAAO,OAAO,KAAK,QAAQ,OAAO;AAClC;;AAEF,SAAQ,OAAO,MAAf;EACE,KAAK;EACL,KAAK;AACH,OAAI,UAAU,OAAO,KAAK,IAAI,CAC5B,QAAO,OAAO,KAAK,QAAQ,OAAO;AAEpC;EACF,KAAK;AACH,OAAI,UAAU,OAAO,KAAK,IAAI,CAC5B,QAAO,OAAO,KAAK,QAAQ,OAAO;AAEpC;EACF,KAAK;AACH,UAAO,4BAA4B,QAAQ,WAAW,QAAQ,OAAO;AACrE;EACF,QACE,aAAY,OAAO"}