@rocicorp/zero 1.10.0-canary.22 → 1.10.0-canary.24

package/out/zql/src/builder/debug-delegate.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"debug-delegate.d.ts","sourceRoot":"","sources":["../../../../../zql/src/builder/debug-delegate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAEV,iBAAiB,EAEjB,YAAY,EACb,MAAM,oDAAoD,CAAC;AAC5D,OAAO,EAAC,KAAK,GAAG,EAAC,MAAM,oCAAoC,CAAC;AAE5D,eAAO,MAAM,iBAAiB;;;CAG7B,CAAC;AAEF,KAAK,UAAU,GAAG,MAAM,CAAC;AACzB,KAAK,GAAG,GAAG,MAAM,CAAC;AAElB,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;AAEhD,MAAM,WAAW,aAAa;IAC5B,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,GAAG,IAAI,CAAC;IAC/C,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC;IACzD,kBAAkB,IAAI,iBAAiB,CAAC;IACxC,aAAa,IAAI,YAAY,CAAC;IAC9B,YAAY,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAClE,eAAe,IAAI,iBAAiB,CAAC;IACrC,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IACnE,cAAc,IAAI,WAAW,CAAC;IAE9B,KAAK,IAAI,IAAI,CAAC;CACf;AAED,qBAAa,KAAM,YAAW,aAAa;;;IAazC,kBAAkB,IAAI,iBAAiB;IAIvC,aAAa,IAAI,YAAY;IAI7B,eAAe,IAAI,iBAAiB;IAIpC,cAAc,IAAI,WAAW;IAI7B,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,GAAG,IAAI;IAS9C,KAAK,IAAI,IAAI;IAOb,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,IAAI;IAUxD,YAAY,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAYjE,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI;CAmBpE"}
+{"version":3,"file":"debug-delegate.d.ts","sourceRoot":"","sources":["../../../../../zql/src/builder/debug-delegate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAEV,iBAAiB,EAEjB,YAAY,EACb,MAAM,oDAAoD,CAAC;AAC5D,OAAO,EAAC,KAAK,GAAG,EAAC,MAAM,oCAAoC,CAAC;AAE5D,eAAO,MAAM,iBAAiB;;;CAG7B,CAAC;AAEF,KAAK,UAAU,GAAG,MAAM,CAAC;AACzB,KAAK,GAAG,GAAG,MAAM,CAAC;AAElB,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;AAEhD,MAAM,WAAW,aAAa;IAC5B,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,GAAG,IAAI,CAAC;IAC/C,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,IAAI,CAAC;IACzD,kBAAkB,IAAI,iBAAiB,CAAC;IACxC,aAAa,IAAI,YAAY,CAAC;IAC9B,YAAY,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAClE,eAAe,IAAI,iBAAiB,CAAC;IACrC,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IACnE,cAAc,IAAI,WAAW,CAAC;IAE9B,KAAK,IAAI,IAAI,CAAC;CACf;AAED,qBAAa,KAAM,YAAW,aAAa;;IAQzC;;;;OAIG;gBACS,WAAW,EAAE,OAAO,EAAE,eAAe,SAAW;IAS5D,kBAAkB,IAAI,iBAAiB;IAIvC,aAAa,IAAI,YAAY;IAI7B,eAAe,IAAI,iBAAiB;IAIpC,cAAc,IAAI,WAAW;IAI7B,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,GAAG,IAAI;IAS9C,KAAK,IAAI,IAAI;IAOb,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,IAAI;IAaxD,YAAY,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAYjE,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,IAAI;CAmBpE"}

package/out/zql/src/builder/debug-delegate.js

@@ -9,7 +9,16 @@ var Debug = class {
 	#rowsBySource;
 	#nvisitBySource;
 	#plans;
-	constructor() {
+	#collectRows;
+	#maxRowsPerQuery;
+	/**
+	* @param collectRows Whether to keep the vended rows.
+	* @param maxRowsPerQuery Maximum number of rows kept per table/query. Rows
+	*   past this are still counted but not kept.
+	*/
+	constructor(collectRows, maxRowsPerQuery = Infinity) {
+		this.#collectRows = collectRows;
+		this.#maxRowsPerQuery = maxRowsPerQuery;
 		this.#rowCountsBySource = {};
 		this.#rowsBySource = {};
 		this.#nvisitBySource = {};
@@ -42,7 +51,10 @@ var Debug = class {
 	rowVended(table, query, row) {
 		const { counts, rows } = this.#getRowStats(table);
 		if (counts) counts[query] = (counts[query] ?? 0) + 1;
-		if (rows) (rows[query] ??= []).push(row);
+		if (this.#collectRows) {
+			const queryRows = rows[query] ??= [];
+			if (queryRows.length < this.#maxRowsPerQuery) queryRows.push(row);
+		}
 	}
 	recordNVisit(table, query, nvisit) {
 		let nvisitCounts = this.#nvisitBySource[table];

package/out/zql/src/builder/debug-delegate.js.map

@@ -1 +1 @@
-{"version":3,"file":"debug-delegate.js","names":["#rowCountsBySource","#rowsBySource","#nvisitBySource","#plans","#getRowStats"],"sources":["../../../../../zql/src/builder/debug-delegate.ts"],"sourcesContent":["import type {\n  RowCountsByQuery,\n  RowCountsBySource,\n  RowsByQuery,\n  RowsBySource,\n} from '../../../zero-protocol/src/analyze-query-result.ts';\nimport {type Row} from '../../../zero-protocol/src/data.ts';\n\nexport const runtimeDebugFlags = {\n  trackRowCountsVended: false,\n  trackRowsVended: false,\n};\n\ntype SourceName = string;\ntype SQL = string;\n\nexport type SQLitePlans = Record<SQL, string[]>;\n\nexport interface DebugDelegate {\n  initQuery(table: SourceName, query: SQL): void;\n  rowVended(table: SourceName, query: SQL, row: Row): void;\n  getVendedRowCounts(): RowCountsBySource;\n  getVendedRows(): RowsBySource;\n  recordNVisit(table: SourceName, query: SQL, nvisit: number): void;\n  getNVisitCounts(): RowCountsBySource;\n  recordExplain(table: SourceName, query: SQL, plan: string[]): void;\n  getSQLitePlans(): SQLitePlans;\n  // clears all internal state\n  reset(): void;\n}\n\nexport class Debug implements DebugDelegate {\n  #rowCountsBySource: RowCountsBySource;\n  #rowsBySource: RowsBySource;\n  #nvisitBySource: RowCountsBySource;\n  #plans: SQLitePlans;\n\n  constructor() {\n    this.#rowCountsBySource = {};\n    this.#rowsBySource = {};\n    this.#nvisitBySource = {};\n    this.#plans = {};\n  }\n\n  getVendedRowCounts(): RowCountsBySource {\n    return this.#rowCountsBySource;\n  }\n\n  getVendedRows(): RowsBySource {\n    return this.#rowsBySource;\n  }\n\n  getNVisitCounts(): RowCountsBySource {\n    return this.#nvisitBySource;\n  }\n\n  getSQLitePlans(): SQLitePlans {\n    return this.#plans;\n  }\n\n  initQuery(table: SourceName, query: SQL): void {\n    const {counts} = this.#getRowStats(table);\n    if (counts) {\n      if (!counts[query]) {\n        counts[query] = 0;\n      }\n    }\n  }\n\n  reset(): void {\n    this.#rowCountsBySource = {};\n    this.#rowsBySource = {};\n    this.#nvisitBySource = {};\n    this.#plans = {};\n  }\n\n  rowVended(table: SourceName, query: SQL, row: Row): void {\n    const {counts, rows} = this.#getRowStats(table);\n    if (counts) {\n      counts[query] = (counts[query] ?? 0) + 1;\n    }\n    if (rows) {\n      (rows[query] ??= []).push(row);\n    }\n  }\n\n  recordNVisit(table: SourceName, query: SQL, nvisit: number): void {\n    let nvisitCounts = this.#nvisitBySource[table];\n    if (!nvisitCounts) {\n      nvisitCounts = {};\n      this.#nvisitBySource[table] = nvisitCounts;\n    }\n    if (!nvisitCounts[query]) {\n      nvisitCounts[query] = 0;\n    }\n    nvisitCounts[query] += nvisit;\n  }\n\n  recordExplain(_table: SourceName, query: SQL, plan: string[]): void {\n    this.#plans[query] = plan;\n  }\n\n  #getRowStats(source: SourceName) {\n    let counts: RowCountsByQuery | undefined;\n    let rows: RowsByQuery | undefined;\n    counts = this.#rowCountsBySource[source];\n    if (!counts) {\n      counts = {};\n      this.#rowCountsBySource[source] = counts;\n    }\n    rows = this.#rowsBySource[source];\n    if (!rows) {\n      rows = {};\n      this.#rowsBySource[source] = rows;\n    }\n    return {counts, rows};\n  }\n}\n"],"mappings":";;AAQA,IAAa,oBAAoB;CAC/B,sBAAsB;CACtB,iBAAiB;AACnB;AAoBA,IAAa,QAAb,MAA4C;CAC1C;CACA;CACA;CACA;CAEA,cAAc;EACZ,KAAKA,qBAAqB,CAAC;EAC3B,KAAKC,gBAAgB,CAAC;EACtB,KAAKC,kBAAkB,CAAC;EACxB,KAAKC,SAAS,CAAC;CACjB;CAEA,qBAAwC;EACtC,OAAO,KAAKH;CACd;CAEA,gBAA8B;EAC5B,OAAO,KAAKC;CACd;CAEA,kBAAqC;EACnC,OAAO,KAAKC;CACd;CAEA,iBAA8B;EAC5B,OAAO,KAAKC;CACd;CAEA,UAAU,OAAmB,OAAkB;EAC7C,MAAM,EAAC,WAAU,KAAKC,aAAa,KAAK;EACxC,IAAI;OACE,CAAC,OAAO,QACV,OAAO,SAAS;EAAA;CAGtB;CAEA,QAAc;EACZ,KAAKJ,qBAAqB,CAAC;EAC3B,KAAKC,gBAAgB,CAAC;EACtB,KAAKC,kBAAkB,CAAC;EACxB,KAAKC,SAAS,CAAC;CACjB;CAEA,UAAU,OAAmB,OAAY,KAAgB;EACvD,MAAM,EAAC,QAAQ,SAAQ,KAAKC,aAAa,KAAK;EAC9C,IAAI,QACF,OAAO,UAAU,OAAO,UAAU,KAAK;EAEzC,IAAI,MACF,CAAC,KAAK,WAAW,CAAC,GAAG,KAAK,GAAG;CAEjC;CAEA,aAAa,OAAmB,OAAY,QAAsB;EAChE,IAAI,eAAe,KAAKF,gBAAgB;EACxC,IAAI,CAAC,cAAc;GACjB,eAAe,CAAC;GAChB,KAAKA,gBAAgB,SAAS;EAChC;EACA,IAAI,CAAC,aAAa,QAChB,aAAa,SAAS;EAExB,aAAa,UAAU;CACzB;CAEA,cAAc,QAAoB,OAAY,MAAsB;EAClE,KAAKC,OAAO,SAAS;CACvB;CAEA,aAAa,QAAoB;EAC/B,IAAI;EACJ,IAAI;EACJ,SAAS,KAAKH,mBAAmB;EACjC,IAAI,CAAC,QAAQ;GACX,SAAS,CAAC;GACV,KAAKA,mBAAmB,UAAU;EACpC;EACA,OAAO,KAAKC,cAAc;EAC1B,IAAI,CAAC,MAAM;GACT,OAAO,CAAC;GACR,KAAKA,cAAc,UAAU;EAC/B;EACA,OAAO;GAAC;GAAQ;EAAI;CACtB;AACF"}
+{"version":3,"file":"debug-delegate.js","names":["#collectRows","#maxRowsPerQuery","#rowCountsBySource","#rowsBySource","#nvisitBySource","#plans","#getRowStats"],"sources":["../../../../../zql/src/builder/debug-delegate.ts"],"sourcesContent":["import type {\n  RowCountsByQuery,\n  RowCountsBySource,\n  RowsByQuery,\n  RowsBySource,\n} from '../../../zero-protocol/src/analyze-query-result.ts';\nimport {type Row} from '../../../zero-protocol/src/data.ts';\n\nexport const runtimeDebugFlags = {\n  trackRowCountsVended: false,\n  trackRowsVended: false,\n};\n\ntype SourceName = string;\ntype SQL = string;\n\nexport type SQLitePlans = Record<SQL, string[]>;\n\nexport interface DebugDelegate {\n  initQuery(table: SourceName, query: SQL): void;\n  rowVended(table: SourceName, query: SQL, row: Row): void;\n  getVendedRowCounts(): RowCountsBySource;\n  getVendedRows(): RowsBySource;\n  recordNVisit(table: SourceName, query: SQL, nvisit: number): void;\n  getNVisitCounts(): RowCountsBySource;\n  recordExplain(table: SourceName, query: SQL, plan: string[]): void;\n  getSQLitePlans(): SQLitePlans;\n  // clears all internal state\n  reset(): void;\n}\n\nexport class Debug implements DebugDelegate {\n  #rowCountsBySource: RowCountsBySource;\n  #rowsBySource: RowsBySource;\n  #nvisitBySource: RowCountsBySource;\n  #plans: SQLitePlans;\n  readonly #collectRows: boolean;\n  readonly #maxRowsPerQuery: number;\n\n  /**\n   * @param collectRows Whether to keep the vended rows.\n   * @param maxRowsPerQuery Maximum number of rows kept per table/query. Rows\n   *   past this are still counted but not kept.\n   */\n  constructor(collectRows: boolean, maxRowsPerQuery = Infinity) {\n    this.#collectRows = collectRows;\n    this.#maxRowsPerQuery = maxRowsPerQuery;\n    this.#rowCountsBySource = {};\n    this.#rowsBySource = {};\n    this.#nvisitBySource = {};\n    this.#plans = {};\n  }\n\n  getVendedRowCounts(): RowCountsBySource {\n    return this.#rowCountsBySource;\n  }\n\n  getVendedRows(): RowsBySource {\n    return this.#rowsBySource;\n  }\n\n  getNVisitCounts(): RowCountsBySource {\n    return this.#nvisitBySource;\n  }\n\n  getSQLitePlans(): SQLitePlans {\n    return this.#plans;\n  }\n\n  initQuery(table: SourceName, query: SQL): void {\n    const {counts} = this.#getRowStats(table);\n    if (counts) {\n      if (!counts[query]) {\n        counts[query] = 0;\n      }\n    }\n  }\n\n  reset(): void {\n    this.#rowCountsBySource = {};\n    this.#rowsBySource = {};\n    this.#nvisitBySource = {};\n    this.#plans = {};\n  }\n\n  rowVended(table: SourceName, query: SQL, row: Row): void {\n    const {counts, rows} = this.#getRowStats(table);\n    if (counts) {\n      counts[query] = (counts[query] ?? 0) + 1;\n    }\n    if (this.#collectRows) {\n      const queryRows = (rows[query] ??= []);\n      if (queryRows.length < this.#maxRowsPerQuery) {\n        queryRows.push(row);\n      }\n    }\n  }\n\n  recordNVisit(table: SourceName, query: SQL, nvisit: number): void {\n    let nvisitCounts = this.#nvisitBySource[table];\n    if (!nvisitCounts) {\n      nvisitCounts = {};\n      this.#nvisitBySource[table] = nvisitCounts;\n    }\n    if (!nvisitCounts[query]) {\n      nvisitCounts[query] = 0;\n    }\n    nvisitCounts[query] += nvisit;\n  }\n\n  recordExplain(_table: SourceName, query: SQL, plan: string[]): void {\n    this.#plans[query] = plan;\n  }\n\n  #getRowStats(source: SourceName) {\n    let counts: RowCountsByQuery | undefined;\n    let rows: RowsByQuery | undefined;\n    counts = this.#rowCountsBySource[source];\n    if (!counts) {\n      counts = {};\n      this.#rowCountsBySource[source] = counts;\n    }\n    rows = this.#rowsBySource[source];\n    if (!rows) {\n      rows = {};\n      this.#rowsBySource[source] = rows;\n    }\n    return {counts, rows};\n  }\n}\n"],"mappings":";;AAQA,IAAa,oBAAoB;CAC/B,sBAAsB;CACtB,iBAAiB;AACnB;AAoBA,IAAa,QAAb,MAA4C;CAC1C;CACA;CACA;CACA;CACA;CACA;;;;;;CAOA,YAAY,aAAsB,kBAAkB,UAAU;EAC5D,KAAKA,eAAe;EACpB,KAAKC,mBAAmB;EACxB,KAAKC,qBAAqB,CAAC;EAC3B,KAAKC,gBAAgB,CAAC;EACtB,KAAKC,kBAAkB,CAAC;EACxB,KAAKC,SAAS,CAAC;CACjB;CAEA,qBAAwC;EACtC,OAAO,KAAKH;CACd;CAEA,gBAA8B;EAC5B,OAAO,KAAKC;CACd;CAEA,kBAAqC;EACnC,OAAO,KAAKC;CACd;CAEA,iBAA8B;EAC5B,OAAO,KAAKC;CACd;CAEA,UAAU,OAAmB,OAAkB;EAC7C,MAAM,EAAC,WAAU,KAAKC,aAAa,KAAK;EACxC,IAAI;OACE,CAAC,OAAO,QACV,OAAO,SAAS;EAAA;CAGtB;CAEA,QAAc;EACZ,KAAKJ,qBAAqB,CAAC;EAC3B,KAAKC,gBAAgB,CAAC;EACtB,KAAKC,kBAAkB,CAAC;EACxB,KAAKC,SAAS,CAAC;CACjB;CAEA,UAAU,OAAmB,OAAY,KAAgB;EACvD,MAAM,EAAC,QAAQ,SAAQ,KAAKC,aAAa,KAAK;EAC9C,IAAI,QACF,OAAO,UAAU,OAAO,UAAU,KAAK;EAEzC,IAAI,KAAKN,cAAc;GACrB,MAAM,YAAa,KAAK,WAAW,CAAC;GACpC,IAAI,UAAU,SAAS,KAAKC,kBAC1B,UAAU,KAAK,GAAG;EAEtB;CACF;CAEA,aAAa,OAAmB,OAAY,QAAsB;EAChE,IAAI,eAAe,KAAKG,gBAAgB;EACxC,IAAI,CAAC,cAAc;GACjB,eAAe,CAAC;GAChB,KAAKA,gBAAgB,SAAS;EAChC;EACA,IAAI,CAAC,aAAa,QAChB,aAAa,SAAS;EAExB,aAAa,UAAU;CACzB;CAEA,cAAc,QAAoB,OAAY,MAAsB;EAClE,KAAKC,OAAO,SAAS;CACvB;CAEA,aAAa,QAAoB;EAC/B,IAAI;EACJ,IAAI;EACJ,SAAS,KAAKH,mBAAmB;EACjC,IAAI,CAAC,QAAQ;GACX,SAAS,CAAC;GACV,KAAKA,mBAAmB,UAAU;EACpC;EACA,OAAO,KAAKC,cAAc;EAC1B,IAAI,CAAC,MAAM;GACT,OAAO,CAAC;GACR,KAAKA,cAAc,UAAU;EAC/B;EACA,OAAO;GAAC;GAAQ;EAAI;CACtB;AACF"}

package/out/zql/src/ivm/array-view.d.ts

@@ -23,6 +23,25 @@ export declare class ArrayView<V extends View> implements Output, TypedView<V> {
     addListener(listener: Listener<V>): () => void;
     destroy(): void;
     push(change: Change): readonly never[];
+    /**
+     * Keep exposing the current snapshot, whatever is pushed in the meantime,
+     * until {@link releaseData} or the next {@link flush}. Result type
+     * notifications are held back until that flush.
+     *
+     * A transaction is normally one synchronous task, so nobody can look at a
+     * view between its pushes and its flush. Deferred pipelines are different:
+     * they are hydrated over several tasks and flushed together (see
+     * `QueryDelegate.onPipelinesReady`), and a view that already has its rows
+     * must not show them early.
+     */
+    holdData(): void;
+    /**
+     * Make `data` current again without notifying anyone yet; listeners are
+     * still only called by the next {@link flush}. Views released together get
+     * this called on all of them before any is flushed, so a listener of one
+     * that reads another sees its rows too.
+     */
+    releaseData(): void;
     flush(): void;
     updateTTL(ttl: TTL): void;
     /**

package/out/zql/src/ivm/array-view.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"array-view.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/array-view.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,8CAA8C,CAAC;AAC/E,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,iBAAiB,CAAC;AACzC,OAAO,KAAK,EAAC,QAAQ,EAAc,SAAS,EAAC,MAAM,wBAAwB,CAAC;AAG5E,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AACxC,OAAO,EAAa,KAAK,KAAK,EAAE,KAAK,MAAM,EAAC,MAAM,eAAe,CAAC;AAGlE,OAAO,KAAK,EAAQ,MAAM,EAAE,IAAI,EAAC,MAAM,WAAW,CAAC;AA0BnD;;;;;;;;;;GAUG;AACH,qBAAa,SAAS,CAAC,CAAC,SAAS,IAAI,CAAE,YAAW,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;;IAgBpE,SAAS,EAAE,CAAC,MAAM,IAAI,CAAC,GAAG,SAAS,CAAC;gBAelC,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,aAAa,EAAE,IAAI,GAAG,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,EAClD,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,IAAI;IAqB/B,IAAI,IAAI,IACmB,CAAC,CAC3B;IAMD,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IAqBjC,OAAO;IAuBP,IAAI,CAAC,MAAM,EAAE,MAAM;IAcnB,KAAK;IAYL,SAAS,CAAC,GAAG,EAAE,GAAG;IAIlB;;;;;;OAMG;IACH,UAAU,IAAI,IAAI;IAMlB,wEAAwE;IACxE,YAAY,IAAI,IAAI;CAiBrB"}
+{"version":3,"file":"array-view.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/array-view.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,8CAA8C,CAAC;AAC/E,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,iBAAiB,CAAC;AACzC,OAAO,KAAK,EAAC,QAAQ,EAAc,SAAS,EAAC,MAAM,wBAAwB,CAAC;AAG5E,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AACxC,OAAO,EAAa,KAAK,KAAK,EAAE,KAAK,MAAM,EAAC,MAAM,eAAe,CAAC;AAGlE,OAAO,KAAK,EAAQ,MAAM,EAAE,IAAI,EAAC,MAAM,WAAW,CAAC;AA0BnD;;;;;;;;;;GAUG;AACH,qBAAa,SAAS,CAAC,CAAC,SAAS,IAAI,CAAE,YAAW,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;;IAgBpE,SAAS,EAAE,CAAC,MAAM,IAAI,CAAC,GAAG,SAAS,CAAC;gBA0BlC,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,aAAa,EAAE,IAAI,GAAG,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,EAClD,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,IAAI;IAqB/B,IAAI,IAAI,IAC4C,CAAC,CACpD;IAMD,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IA8BjC,OAAO;IAuBP,IAAI,CAAC,MAAM,EAAE,MAAM;IAcnB;;;;;;;;;;OAUG;IACH,QAAQ,IAAI,IAAI;IAOhB;;;;;OAKG;IACH,WAAW,IAAI,IAAI;IAInB,KAAK;IAcL,SAAS,CAAC,GAAG,EAAE,GAAG;IAIlB;;;;;;OAMG;IACH,UAAU,IAAI,IAAI;IAMlB,wEAAwE;IACxE,YAAY,IAAI,IAAI;CAsBrB"}

package/out/zql/src/ivm/array-view.js

@@ -47,6 +47,10 @@ var ArrayView = class {
 	#root;
 	onDestroy;
 	#dirty = false;
+	#committedRoot;
+	#held = false;
+	#heldResultType = "unknown";
+	#heldError;
 	#resultType = "unknown";
 	#error;
 	#updateTTL;
@@ -65,7 +69,7 @@ var ArrayView = class {
 		this.#hydrate();
 	}
 	get data() {
-		return this.#root[""];
+		return (this.#committedRoot ?? this.#root)[""];
 	}
 	#getSchema() {
 		return this.#schema ??= this.#input.getSchema();
@@ -82,6 +86,10 @@ var ArrayView = class {
 		for (const listener of this.#listeners) this.#fireListener(listener);
 	}
 	#fireListener(listener) {
+		if (this.#committedRoot !== void 0) {
+			listener(this.data, this.#heldResultType, this.#heldError);
+			return;
+		}
 		listener(this.data, this.#resultType, this.#error);
 	}
 	destroy() {
@@ -100,7 +108,35 @@ var ArrayView = class {
 		this.#root = applyChange(this.#root, changeToViewChange(change), this.#getSchema(), "", this.#format, false, this.#txnDirty);
 		return emptyArray;
 	}
+	/**
+	* Keep exposing the current snapshot, whatever is pushed in the meantime,
+	* until {@link releaseData} or the next {@link flush}. Result type
+	* notifications are held back until that flush.
+	*
+	* A transaction is normally one synchronous task, so nobody can look at a
+	* view between its pushes and its flush. Deferred pipelines are different:
+	* they are hydrated over several tasks and flushed together (see
+	* `QueryDelegate.onPipelinesReady`), and a view that already has its rows
+	* must not show them early.
+	*/
+	holdData() {
+		this.#committedRoot = this.#root;
+		this.#held = true;
+		this.#heldResultType = this.#resultType;
+		this.#heldError = this.#error;
+	}
+	/**
+	* Make `data` current again without notifying anyone yet; listeners are
+	* still only called by the next {@link flush}. Views released together get
+	* this called on all of them before any is flushed, so a listener of one
+	* that reads another sees its rows too.
+	*/
+	releaseData() {
+		this.#committedRoot = void 0;
+	}
 	flush() {
+		this.#committedRoot = void 0;
+		this.#held = false;
 		if (!this.#dirty) return;
 		this.#dirty = false;
 		this.#fireListeners();
@@ -126,7 +162,8 @@ var ArrayView = class {
 	#setResultType(resultType, error) {
 		this.#resultType = resultType;
 		this.#error = error;
-		if (!this.#dirty) this.#fireListeners();
+		if (this.#held) this.#dirty = true;
+		else if (!this.#dirty) this.#fireListeners();
 	}
 };
 //#endregion

package/out/zql/src/ivm/array-view.js.map

@@ -1 +1 @@
-{"version":3,"file":"array-view.js","names":["#input","#listeners","#format","#updateTTL","#root","#resultType","#error","#setResultType","#hydrate","#schema","#fireListener","#dirty","#getSchema","#txnDirty","#fireListeners"],"sources":["../../../../../zql/src/ivm/array-view.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {Immutable} from '../../../shared/src/immutable.ts';\nimport {emptyArray} from '../../../shared/src/sentinels.ts';\nimport type {ErroredQuery} from '../../../zero-protocol/src/custom-queries.ts';\nimport type {TTL} from '../query/ttl.ts';\nimport type {Listener, ResultType, TypedView} from '../query/typed-view.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.ts';\nimport type {Change} from './change.ts';\nimport {skipYields, type Input, type Output} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {applyChange, type ViewChange} from './view-apply-change.ts';\nimport type {Entry, Format, View} from './view.ts';\n\nfunction changeToViewChange(change: Change): ViewChange {\n  switch (change[ChangeIndex.TYPE]) {\n    case ChangeType.ADD:\n      return {type: 'add', node: change[ChangeIndex.NODE]};\n    case ChangeType.REMOVE:\n      return {type: 'remove', node: change[ChangeIndex.NODE]};\n    case ChangeType.CHILD:\n      return {\n        type: 'child',\n        node: change[ChangeIndex.NODE],\n        child: {\n          relationshipName: change[ChangeIndex.CHILD_DATA].relationshipName,\n          change: changeToViewChange(change[ChangeIndex.CHILD_DATA].change),\n        },\n      };\n    case ChangeType.EDIT:\n      return {\n        type: 'edit',\n        node: change[ChangeIndex.NODE],\n        oldNode: change[ChangeIndex.OLD_NODE],\n      };\n  }\n}\n\n/**\n * Implements a materialized view of the output of an operator.\n *\n * It might seem more efficient to use an immutable b-tree for the\n * materialization, but it's not so clear. Inserts in the middle are\n * asymptotically slower in an array, but can often be done with zero\n * allocations, where changes to the b-tree will often require several allocs.\n *\n * Also the plain array view is more convenient for consumers since you can dump\n * it into console to see what it is, rather than having to iterate it.\n */\nexport class ArrayView<V extends View> implements Output, TypedView<V> {\n  readonly #input: Input;\n  readonly #listeners = new Set<Listener<V>>();\n  // Read lazily: a DeferredInput has no schema until its pipeline is attached,\n  // and the schema is only needed once there is a change to apply.\n  #schema: SourceSchema | undefined;\n  readonly #format: Format;\n\n  // Synthetic \"root\" entry that has a single \"\" relationship, so that we can\n  // treat all changes, including the root change, generically.\n  //\n  // applyChange is immutable: it returns a new root, preserving the references\n  // of unchanged subtrees so consumers (React.memo / Solid) can skip them. We\n  // therefore reassign #root on every change rather than mutating in place.\n  #root: Entry;\n\n  onDestroy: (() => void) | undefined;\n\n  #dirty = false;\n  #resultType: ResultType = 'unknown';\n  #error: ErroredQuery | undefined;\n  readonly #updateTTL: (ttl: TTL) => void;\n\n  // Objects/arrays created or cloned during the current (un-flushed)\n  // transaction. applyChange may mutate these in place rather than copying\n  // again, since they are not yet observed by any listener. Replaced at\n  // flush(), after which the committed snapshot must be copied-on-write again.\n  // A WeakSet (not a Set) so it never extends the lifetime of transient clones.\n  #txnDirty: WeakSet<object> = new WeakSet();\n\n  constructor(\n    input: Input,\n    format: Format,\n    queryComplete: true | ErroredQuery | Promise<true>,\n    updateTTL: (ttl: TTL) => void,\n  ) {\n    this.#input = input;\n    this.#format = format;\n    this.#updateTTL = updateTTL;\n    this.#root = {'': format.singular ? undefined : []};\n    input.setOutput(this);\n\n    if (queryComplete === true) {\n      this.#resultType = 'complete';\n    } else if ('error' in queryComplete) {\n      this.#resultType = 'error';\n      this.#error = queryComplete;\n    } else {\n      void queryComplete\n        .then(() => this.#setResultType('complete'))\n        .catch(e => this.#setResultType('error', e));\n    }\n    this.#hydrate();\n  }\n\n  get data() {\n    return this.#root[''] as V;\n  }\n\n  #getSchema(): SourceSchema {\n    return (this.#schema ??= this.#input.getSchema());\n  }\n\n  addListener(listener: Listener<V>) {\n    assert(!this.#listeners.has(listener), 'Listener already registered');\n    this.#listeners.add(listener);\n\n    this.#fireListener(listener);\n\n    return () => {\n      this.#listeners.delete(listener);\n    };\n  }\n\n  #fireListeners() {\n    for (const listener of this.#listeners) {\n      this.#fireListener(listener);\n    }\n  }\n\n  #fireListener(listener: Listener<V>) {\n    listener(this.data as Immutable<V>, this.#resultType, this.#error);\n  }\n\n  destroy() {\n    this.onDestroy?.();\n  }\n\n  #hydrate() {\n    this.#dirty = true;\n    for (const node of skipYields(this.#input.fetch({}))) {\n      this.#root = applyChange(\n        this.#root,\n        {type: 'add', node},\n        this.#getSchema(),\n        '',\n        this.#format,\n        false /* withIDs */,\n        true /* mutate: #root is freshly created and not yet observed by any\n                 consumer, so build it in place to avoid O(N^2) array copies.\n                 Every later push() is immutable, preserving reference\n                 stability for unchanged subtrees. */,\n      );\n    }\n    this.flush();\n  }\n\n  push(change: Change) {\n    this.#dirty = true;\n    this.#root = applyChange(\n      this.#root,\n      changeToViewChange(change),\n      this.#getSchema(),\n      '',\n      this.#format,\n      false /* withIDs */,\n      this.#txnDirty /* mutate: copy-on-write within this transaction */,\n    );\n    return emptyArray;\n  }\n\n  flush() {\n    if (!this.#dirty) {\n      return;\n    }\n    this.#dirty = false;\n    this.#fireListeners();\n    // The snapshot just handed to listeners is now observed; the next\n    // transaction must copy-on-write rather than mutate these objects. A fresh\n    // WeakSet drops all \"owned\" marks (WeakSet has no clear()).\n    this.#txnDirty = new WeakSet();\n  }\n\n  updateTTL(ttl: TTL) {\n    this.#updateTTL(ttl);\n  }\n\n  /**\n   * The store holds the server-confirmed complete result of this query from a\n   * previous sync (the persisted got-queries key exists, pre-authoritative).\n   * Never downgrades 'complete'/'error', and never resolves anything that\n   * waits on 'complete' — freshness stays a promise only the connection can\n   * keep.\n   */\n  markCached(): void {\n    if (this.#resultType === 'unknown') {\n      this.#setResultType('cached');\n    }\n  }\n\n  /** The got key was deleted (eviction) while still pre-authoritative. */\n  unmarkCached(): void {\n    if (this.#resultType === 'cached') {\n      this.#setResultType('unknown');\n    }\n  }\n\n  #setResultType(resultType: ResultType, error?: ErroredQuery) {\n    this.#resultType = resultType;\n    this.#error = error;\n    // A dirty view is mid-transaction: rows were pushed and not yet flushed,\n    // and the objects in #txnDirty are still mutable. Firing now would hand\n    // those to listeners and then fire again at flush() with the same data, so\n    // let the pending flush deliver the new result type instead.\n    if (!this.#dirty) {\n      this.#fireListeners();\n    }\n  }\n}\n"],"mappings":";;;;;AAcA,SAAS,mBAAmB,QAA4B;CACtD,QAAQ,OAAO,IAAf;EACE,KAAK,GACH,OAAO;GAAC,MAAM;GAAO,MAAM,OAAO;EAAiB;EACrD,KAAK,GACH,OAAO;GAAC,MAAM;GAAU,MAAM,OAAO;EAAiB;EACxD,KAAK,GACH,OAAO;GACL,MAAM;GACN,MAAM,OAAO;GACb,OAAO;IACL,kBAAkB,OAAO,GAAwB;IACjD,QAAQ,mBAAmB,OAAO,GAAwB,MAAM;GAClE;EACF;EACF,KAAK,GACH,OAAO;GACL,MAAM;GACN,MAAM,OAAO;GACb,SAAS,OAAO;EAClB;CACJ;AACF;;;;;;;;;;;;AAaA,IAAa,YAAb,MAAuE;CACrE;CACA,6BAAsB,IAAI,IAAiB;CAG3C;CACA;CAQA;CAEA;CAEA,SAAS;CACT,cAA0B;CAC1B;CACA;CAOA,4BAA6B,IAAI,QAAQ;CAEzC,YACE,OACA,QACA,eACA,WACA;EACA,KAAKA,SAAS;EACd,KAAKE,UAAU;EACf,KAAKC,aAAa;EAClB,KAAKC,QAAQ,EAAC,IAAI,OAAO,WAAW,KAAA,IAAY,CAAC,EAAC;EAClD,MAAM,UAAU,IAAI;EAEpB,IAAI,kBAAkB,MACpB,KAAKC,cAAc;OACd,IAAI,WAAW,eAAe;GACnC,KAAKA,cAAc;GACnB,KAAKC,SAAS;EAChB,OACE,cACG,WAAW,KAAKC,eAAe,UAAU,CAAC,EAC1C,OAAM,MAAK,KAAKA,eAAe,SAAS,CAAC,CAAC;EAE/C,KAAKC,SAAS;CAChB;CAEA,IAAI,OAAO;EACT,OAAO,KAAKJ,MAAM;CACpB;CAEA,aAA2B;EACzB,OAAQ,KAAKK,YAAY,KAAKT,OAAO,UAAU;CACjD;CAEA,YAAY,UAAuB;EACjC,OAAO,CAAC,KAAKC,WAAW,IAAI,QAAQ,GAAG,6BAA6B;EACpE,KAAKA,WAAW,IAAI,QAAQ;EAE5B,KAAKS,cAAc,QAAQ;EAE3B,aAAa;GACX,KAAKT,WAAW,OAAO,QAAQ;EACjC;CACF;CAEA,iBAAiB;EACf,KAAK,MAAM,YAAY,KAAKA,YAC1B,KAAKS,cAAc,QAAQ;CAE/B;CAEA,cAAc,UAAuB;EACnC,SAAS,KAAK,MAAsB,KAAKL,aAAa,KAAKC,MAAM;CACnE;CAEA,UAAU;EACR,KAAK,YAAY;CACnB;CAEA,WAAW;EACT,KAAKK,SAAS;EACd,KAAK,MAAM,QAAQ,WAAW,KAAKX,OAAO,MAAM,CAAC,CAAC,CAAC,GACjD,KAAKI,QAAQ,YACX,KAAKA,OACL;GAAC,MAAM;GAAO;EAAI,GAClB,KAAKQ,WAAW,GAChB,IACA,KAAKV,SACL,OACA,IAIF;EAEF,KAAK,MAAM;CACb;CAEA,KAAK,QAAgB;EACnB,KAAKS,SAAS;EACd,KAAKP,QAAQ,YACX,KAAKA,OACL,mBAAmB,MAAM,GACzB,KAAKQ,WAAW,GAChB,IACA,KAAKV,SACL,OACA,KAAKW,SACP;EACA,OAAO;CACT;CAEA,QAAQ;EACN,IAAI,CAAC,KAAKF,QACR;EAEF,KAAKA,SAAS;EACd,KAAKG,eAAe;EAIpB,KAAKD,4BAAY,IAAI,QAAQ;CAC/B;CAEA,UAAU,KAAU;EAClB,KAAKV,WAAW,GAAG;CACrB;;;;;;;;CASA,aAAmB;EACjB,IAAI,KAAKE,gBAAgB,WACvB,KAAKE,eAAe,QAAQ;CAEhC;;CAGA,eAAqB;EACnB,IAAI,KAAKF,gBAAgB,UACvB,KAAKE,eAAe,SAAS;CAEjC;CAEA,eAAe,YAAwB,OAAsB;EAC3D,KAAKF,cAAc;EACnB,KAAKC,SAAS;EAKd,IAAI,CAAC,KAAKK,QACR,KAAKG,eAAe;CAExB;AACF"}
+{"version":3,"file":"array-view.js","names":["#input","#listeners","#format","#updateTTL","#root","#resultType","#error","#setResultType","#hydrate","#committedRoot","#schema","#fireListener","#heldResultType","#heldError","#dirty","#getSchema","#txnDirty","#held","#fireListeners"],"sources":["../../../../../zql/src/ivm/array-view.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {Immutable} from '../../../shared/src/immutable.ts';\nimport {emptyArray} from '../../../shared/src/sentinels.ts';\nimport type {ErroredQuery} from '../../../zero-protocol/src/custom-queries.ts';\nimport type {TTL} from '../query/ttl.ts';\nimport type {Listener, ResultType, TypedView} from '../query/typed-view.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.ts';\nimport type {Change} from './change.ts';\nimport {skipYields, type Input, type Output} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {applyChange, type ViewChange} from './view-apply-change.ts';\nimport type {Entry, Format, View} from './view.ts';\n\nfunction changeToViewChange(change: Change): ViewChange {\n  switch (change[ChangeIndex.TYPE]) {\n    case ChangeType.ADD:\n      return {type: 'add', node: change[ChangeIndex.NODE]};\n    case ChangeType.REMOVE:\n      return {type: 'remove', node: change[ChangeIndex.NODE]};\n    case ChangeType.CHILD:\n      return {\n        type: 'child',\n        node: change[ChangeIndex.NODE],\n        child: {\n          relationshipName: change[ChangeIndex.CHILD_DATA].relationshipName,\n          change: changeToViewChange(change[ChangeIndex.CHILD_DATA].change),\n        },\n      };\n    case ChangeType.EDIT:\n      return {\n        type: 'edit',\n        node: change[ChangeIndex.NODE],\n        oldNode: change[ChangeIndex.OLD_NODE],\n      };\n  }\n}\n\n/**\n * Implements a materialized view of the output of an operator.\n *\n * It might seem more efficient to use an immutable b-tree for the\n * materialization, but it's not so clear. Inserts in the middle are\n * asymptotically slower in an array, but can often be done with zero\n * allocations, where changes to the b-tree will often require several allocs.\n *\n * Also the plain array view is more convenient for consumers since you can dump\n * it into console to see what it is, rather than having to iterate it.\n */\nexport class ArrayView<V extends View> implements Output, TypedView<V> {\n  readonly #input: Input;\n  readonly #listeners = new Set<Listener<V>>();\n  // Read lazily: a DeferredInput has no schema until its pipeline is attached,\n  // and the schema is only needed once there is a change to apply.\n  #schema: SourceSchema | undefined;\n  readonly #format: Format;\n\n  // Synthetic \"root\" entry that has a single \"\" relationship, so that we can\n  // treat all changes, including the root change, generically.\n  //\n  // applyChange is immutable: it returns a new root, preserving the references\n  // of unchanged subtrees so consumers (React.memo / Solid) can skip them. We\n  // therefore reassign #root on every change rather than mutating in place.\n  #root: Entry;\n\n  onDestroy: (() => void) | undefined;\n\n  #dirty = false;\n  // Set by holdData(): the root that `data` and newly added listeners keep\n  // seeing until releaseData() or the next flush, while pushes build up #root\n  // behind it.\n  #committedRoot: Entry | undefined;\n  // From holdData() until the next flush. Outlasts #committedRoot, which\n  // releaseData() drops first.\n  #held = false;\n  // The result type and error as of holdData(): what a listener added while\n  // held is called with, so it never sees old rows paired with a new type.\n  #heldResultType: ResultType = 'unknown';\n  #heldError: ErroredQuery | undefined;\n  #resultType: ResultType = 'unknown';\n  #error: ErroredQuery | undefined;\n  readonly #updateTTL: (ttl: TTL) => void;\n\n  // Objects/arrays created or cloned during the current (un-flushed)\n  // transaction. applyChange may mutate these in place rather than copying\n  // again, since they are not yet observed by any listener. Replaced at\n  // flush(), after which the committed snapshot must be copied-on-write again.\n  // A WeakSet (not a Set) so it never extends the lifetime of transient clones.\n  #txnDirty: WeakSet<object> = new WeakSet();\n\n  constructor(\n    input: Input,\n    format: Format,\n    queryComplete: true | ErroredQuery | Promise<true>,\n    updateTTL: (ttl: TTL) => void,\n  ) {\n    this.#input = input;\n    this.#format = format;\n    this.#updateTTL = updateTTL;\n    this.#root = {'': format.singular ? undefined : []};\n    input.setOutput(this);\n\n    if (queryComplete === true) {\n      this.#resultType = 'complete';\n    } else if ('error' in queryComplete) {\n      this.#resultType = 'error';\n      this.#error = queryComplete;\n    } else {\n      void queryComplete\n        .then(() => this.#setResultType('complete'))\n        .catch(e => this.#setResultType('error', e));\n    }\n    this.#hydrate();\n  }\n\n  get data() {\n    return (this.#committedRoot ?? this.#root)[''] as V;\n  }\n\n  #getSchema(): SourceSchema {\n    return (this.#schema ??= this.#input.getSchema());\n  }\n\n  addListener(listener: Listener<V>) {\n    assert(!this.#listeners.has(listener), 'Listener already registered');\n    this.#listeners.add(listener);\n\n    this.#fireListener(listener);\n\n    return () => {\n      this.#listeners.delete(listener);\n    };\n  }\n\n  #fireListeners() {\n    for (const listener of this.#listeners) {\n      this.#fireListener(listener);\n    }\n  }\n\n  #fireListener(listener: Listener<V>) {\n    if (this.#committedRoot !== undefined) {\n      // Held rows go with the held type; after releaseData() both are current.\n      listener(\n        this.data as Immutable<V>,\n        this.#heldResultType,\n        this.#heldError,\n      );\n      return;\n    }\n    listener(this.data as Immutable<V>, this.#resultType, this.#error);\n  }\n\n  destroy() {\n    this.onDestroy?.();\n  }\n\n  #hydrate() {\n    this.#dirty = true;\n    for (const node of skipYields(this.#input.fetch({}))) {\n      this.#root = applyChange(\n        this.#root,\n        {type: 'add', node},\n        this.#getSchema(),\n        '',\n        this.#format,\n        false /* withIDs */,\n        true /* mutate: #root is freshly created and not yet observed by any\n                 consumer, so build it in place to avoid O(N^2) array copies.\n                 Every later push() is immutable, preserving reference\n                 stability for unchanged subtrees. */,\n      );\n    }\n    this.flush();\n  }\n\n  push(change: Change) {\n    this.#dirty = true;\n    this.#root = applyChange(\n      this.#root,\n      changeToViewChange(change),\n      this.#getSchema(),\n      '',\n      this.#format,\n      false /* withIDs */,\n      this.#txnDirty /* mutate: copy-on-write within this transaction */,\n    );\n    return emptyArray;\n  }\n\n  /**\n   * Keep exposing the current snapshot, whatever is pushed in the meantime,\n   * until {@link releaseData} or the next {@link flush}. Result type\n   * notifications are held back until that flush.\n   *\n   * A transaction is normally one synchronous task, so nobody can look at a\n   * view between its pushes and its flush. Deferred pipelines are different:\n   * they are hydrated over several tasks and flushed together (see\n   * `QueryDelegate.onPipelinesReady`), and a view that already has its rows\n   * must not show them early.\n   */\n  holdData(): void {\n    this.#committedRoot = this.#root;\n    this.#held = true;\n    this.#heldResultType = this.#resultType;\n    this.#heldError = this.#error;\n  }\n\n  /**\n   * Make `data` current again without notifying anyone yet; listeners are\n   * still only called by the next {@link flush}. Views released together get\n   * this called on all of them before any is flushed, so a listener of one\n   * that reads another sees its rows too.\n   */\n  releaseData(): void {\n    this.#committedRoot = undefined;\n  }\n\n  flush() {\n    this.#committedRoot = undefined;\n    this.#held = false;\n    if (!this.#dirty) {\n      return;\n    }\n    this.#dirty = false;\n    this.#fireListeners();\n    // The snapshot just handed to listeners is now observed; the next\n    // transaction must copy-on-write rather than mutate these objects. A fresh\n    // WeakSet drops all \"owned\" marks (WeakSet has no clear()).\n    this.#txnDirty = new WeakSet();\n  }\n\n  updateTTL(ttl: TTL) {\n    this.#updateTTL(ttl);\n  }\n\n  /**\n   * The store holds the server-confirmed complete result of this query from a\n   * previous sync (the persisted got-queries key exists, pre-authoritative).\n   * Never downgrades 'complete'/'error', and never resolves anything that\n   * waits on 'complete' — freshness stays a promise only the connection can\n   * keep.\n   */\n  markCached(): void {\n    if (this.#resultType === 'unknown') {\n      this.#setResultType('cached');\n    }\n  }\n\n  /** The got key was deleted (eviction) while still pre-authoritative. */\n  unmarkCached(): void {\n    if (this.#resultType === 'cached') {\n      this.#setResultType('unknown');\n    }\n  }\n\n  #setResultType(resultType: ResultType, error?: ErroredQuery) {\n    this.#resultType = resultType;\n    this.#error = error;\n    // A dirty view is mid-transaction: rows were pushed and not yet flushed,\n    // and the objects in #txnDirty are still mutable. Firing now would hand\n    // those to listeners and then fire again at flush() with the same data, so\n    // let the pending flush deliver the new result type instead.\n    // A held view is waiting to be exposed together with others at the next\n    // flush; that goes for its result type as much as for its rows.\n    if (this.#held) {\n      // Dirty so that the flush notifies even when no rows were pushed.\n      this.#dirty = true;\n    } else if (!this.#dirty) {\n      this.#fireListeners();\n    }\n  }\n}\n"],"mappings":";;;;;AAcA,SAAS,mBAAmB,QAA4B;CACtD,QAAQ,OAAO,IAAf;EACE,KAAK,GACH,OAAO;GAAC,MAAM;GAAO,MAAM,OAAO;EAAiB;EACrD,KAAK,GACH,OAAO;GAAC,MAAM;GAAU,MAAM,OAAO;EAAiB;EACxD,KAAK,GACH,OAAO;GACL,MAAM;GACN,MAAM,OAAO;GACb,OAAO;IACL,kBAAkB,OAAO,GAAwB;IACjD,QAAQ,mBAAmB,OAAO,GAAwB,MAAM;GAClE;EACF;EACF,KAAK,GACH,OAAO;GACL,MAAM;GACN,MAAM,OAAO;GACb,SAAS,OAAO;EAClB;CACJ;AACF;;;;;;;;;;;;AAaA,IAAa,YAAb,MAAuE;CACrE;CACA,6BAAsB,IAAI,IAAiB;CAG3C;CACA;CAQA;CAEA;CAEA,SAAS;CAIT;CAGA,QAAQ;CAGR,kBAA8B;CAC9B;CACA,cAA0B;CAC1B;CACA;CAOA,4BAA6B,IAAI,QAAQ;CAEzC,YACE,OACA,QACA,eACA,WACA;EACA,KAAKA,SAAS;EACd,KAAKE,UAAU;EACf,KAAKC,aAAa;EAClB,KAAKC,QAAQ,EAAC,IAAI,OAAO,WAAW,KAAA,IAAY,CAAC,EAAC;EAClD,MAAM,UAAU,IAAI;EAEpB,IAAI,kBAAkB,MACpB,KAAKC,cAAc;OACd,IAAI,WAAW,eAAe;GACnC,KAAKA,cAAc;GACnB,KAAKC,SAAS;EAChB,OACE,cACG,WAAW,KAAKC,eAAe,UAAU,CAAC,EAC1C,OAAM,MAAK,KAAKA,eAAe,SAAS,CAAC,CAAC;EAE/C,KAAKC,SAAS;CAChB;CAEA,IAAI,OAAO;EACT,QAAQ,KAAKC,kBAAkB,KAAKL,OAAO;CAC7C;CAEA,aAA2B;EACzB,OAAQ,KAAKM,YAAY,KAAKV,OAAO,UAAU;CACjD;CAEA,YAAY,UAAuB;EACjC,OAAO,CAAC,KAAKC,WAAW,IAAI,QAAQ,GAAG,6BAA6B;EACpE,KAAKA,WAAW,IAAI,QAAQ;EAE5B,KAAKU,cAAc,QAAQ;EAE3B,aAAa;GACX,KAAKV,WAAW,OAAO,QAAQ;EACjC;CACF;CAEA,iBAAiB;EACf,KAAK,MAAM,YAAY,KAAKA,YAC1B,KAAKU,cAAc,QAAQ;CAE/B;CAEA,cAAc,UAAuB;EACnC,IAAI,KAAKF,mBAAmB,KAAA,GAAW;GAErC,SACE,KAAK,MACL,KAAKG,iBACL,KAAKC,UACP;GACA;EACF;EACA,SAAS,KAAK,MAAsB,KAAKR,aAAa,KAAKC,MAAM;CACnE;CAEA,UAAU;EACR,KAAK,YAAY;CACnB;CAEA,WAAW;EACT,KAAKQ,SAAS;EACd,KAAK,MAAM,QAAQ,WAAW,KAAKd,OAAO,MAAM,CAAC,CAAC,CAAC,GACjD,KAAKI,QAAQ,YACX,KAAKA,OACL;GAAC,MAAM;GAAO;EAAI,GAClB,KAAKW,WAAW,GAChB,IACA,KAAKb,SACL,OACA,IAIF;EAEF,KAAK,MAAM;CACb;CAEA,KAAK,QAAgB;EACnB,KAAKY,SAAS;EACd,KAAKV,QAAQ,YACX,KAAKA,OACL,mBAAmB,MAAM,GACzB,KAAKW,WAAW,GAChB,IACA,KAAKb,SACL,OACA,KAAKc,SACP;EACA,OAAO;CACT;;;;;;;;;;;;CAaA,WAAiB;EACf,KAAKP,iBAAiB,KAAKL;EAC3B,KAAKa,QAAQ;EACb,KAAKL,kBAAkB,KAAKP;EAC5B,KAAKQ,aAAa,KAAKP;CACzB;;;;;;;CAQA,cAAoB;EAClB,KAAKG,iBAAiB,KAAA;CACxB;CAEA,QAAQ;EACN,KAAKA,iBAAiB,KAAA;EACtB,KAAKQ,QAAQ;EACb,IAAI,CAAC,KAAKH,QACR;EAEF,KAAKA,SAAS;EACd,KAAKI,eAAe;EAIpB,KAAKF,4BAAY,IAAI,QAAQ;CAC/B;CAEA,UAAU,KAAU;EAClB,KAAKb,WAAW,GAAG;CACrB;;;;;;;;CASA,aAAmB;EACjB,IAAI,KAAKE,gBAAgB,WACvB,KAAKE,eAAe,QAAQ;CAEhC;;CAGA,eAAqB;EACnB,IAAI,KAAKF,gBAAgB,UACvB,KAAKE,eAAe,SAAS;CAEjC;CAEA,eAAe,YAAwB,OAAsB;EAC3D,KAAKF,cAAc;EACnB,KAAKC,SAAS;EAOd,IAAI,KAAKW,OAEP,KAAKH,SAAS;OACT,IAAI,CAAC,KAAKA,QACf,KAAKI,eAAe;CAExB;AACF"}

package/out/zql/src/ivm/connection-index.d.ts

@@ -0,0 +1,68 @@
+import type { Row, Value } from '../../../zero-protocol/src/data.ts';
+import type { NoSubqueryCondition } from '../builder/filter.ts';
+import type { SourceChange } from './source.ts';
+/**
+ * The static equality constraint a connection's filters place on a single
+ * column: the row is accepted only if `row[column]` is one of `values`.
+ * The push-time counterpart of the fetch-time `Constraint` in
+ * `constraint.ts`, which pins columns to single values.
+ */
+export type StaticConstraint = {
+    readonly column: string;
+    readonly values: readonly Value[];
+};
+/**
+ * Indexes the connections of a source by a static equality constraint
+ * (`column = literal` or `column IN (literals)`) taken from each
+ * connection's filters, so that a push can determine in O(distinct indexed
+ * columns) whether any connection could possibly accept a row, before doing
+ * any per-connection work.
+ *
+ * The index is conservative: {@link mayAccept} returns `true` whenever a
+ * connection's filters could accept the row, and may return `true` when they
+ * do not (e.g. the connection has further conditions that reject it).
+ * It only ever returns `false` when every connection's filters reject the
+ * row. Connections without a static equality constraint (no filters, or
+ * filters whose top level is not an equality) count as unconstrained and
+ * make every row a candidate, as does an index with no connections at all.
+ *
+ * Values are matched with SameValueZero (`Map` key semantics), which agrees
+ * with the `=` / `IN` predicates (`===` / `Set#has`) for every value except
+ * `NaN`, where the index is merely more permissive.
+ */
+export declare class ConnectionIndex<C> {
+    #private;
+    add(connection: C, filters: NoSubqueryCondition | undefined): void;
+    remove(connection: C): void;
+    get size(): number;
+    /**
+     * Returns `false` only if the filters of every indexed connection reject
+     * `row`. An empty index accepts every row: a source with no connections
+     * is still written to (e.g. to populate it).
+     */
+    mayAccept(row: Row): boolean;
+    /**
+     * Returns `false` only if the filters of every indexed connection reject
+     * the row(s) of `change`: the row for an add or remove, and both the old
+     * and the new row for an edit.
+     */
+    mayAcceptChange(change: SourceChange): boolean;
+}
+/**
+ * Extracts a static equality constraint that every row accepted by
+ * `condition` must satisfy, or `undefined` if there is none.
+ *
+ * - `column = literal`, `column IS literal` and `column IN (literals)`
+ *   constrain the column. `column = null` (which the predicate folds to
+ *   `false`) and an empty `IN` constrain it to the empty set, i.e. the
+ *   connection never accepts a row.
+ * - An `and` is constrained by any of its constrained conditions; the one
+ *   with the fewest values is chosen, so a never-matching condition wins.
+ * - An `or` is constrained only if all of its branches constrain the same
+ *   column, by the union of their values. Never-matching branches cannot
+ *   widen the result and are ignored.
+ * - Anything else (`!=`, `IS NOT`, `NOT IN`, ranges, `LIKE`, a literal on
+ *   the left) is unconstrained.
+ */
+export declare function staticConstraint(condition: NoSubqueryCondition | undefined): StaticConstraint | undefined;
+//# sourceMappingURL=connection-index.d.ts.map

package/out/zql/src/ivm/connection-index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"connection-index.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/connection-index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,GAAG,EAAE,KAAK,EAAC,MAAM,oCAAoC,CAAC;AACnE,OAAO,KAAK,EAAC,mBAAmB,EAAC,MAAM,sBAAsB,CAAC;AAG9D,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,aAAa,CAAC;AAE9C;;;;;GAKG;AACH,MAAM,MAAM,gBAAgB,GAAG;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,CAAC;CACnC,CAAC;AAEF;;;;;;;;;;;;;;;;;;GAkBG;AACH,qBAAa,eAAe,CAAC,CAAC;;IAM5B,GAAG,CAAC,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,mBAAmB,GAAG,SAAS,GAAG,IAAI;IAwBlE,MAAM,CAAC,UAAU,EAAE,CAAC,GAAG,IAAI;IA8B3B,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;;;OAIG;IACH,SAAS,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO;IAY5B;;;;OAIG;IACH,eAAe,CAAC,MAAM,EAAE,YAAY,GAAG,OAAO;CAS/C;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,gBAAgB,CAC9B,SAAS,EAAE,mBAAmB,GAAG,SAAS,GACzC,gBAAgB,GAAG,SAAS,CA4D9B"}

package/out/zql/src/ivm/connection-index.js

@@ -0,0 +1,149 @@
+//#region ../zql/src/ivm/connection-index.ts
+/**
+* Indexes the connections of a source by a static equality constraint
+* (`column = literal` or `column IN (literals)`) taken from each
+* connection's filters, so that a push can determine in O(distinct indexed
+* columns) whether any connection could possibly accept a row, before doing
+* any per-connection work.
+*
+* The index is conservative: {@link mayAccept} returns `true` whenever a
+* connection's filters could accept the row, and may return `true` when they
+* do not (e.g. the connection has further conditions that reject it).
+* It only ever returns `false` when every connection's filters reject the
+* row. Connections without a static equality constraint (no filters, or
+* filters whose top level is not an equality) count as unconstrained and
+* make every row a candidate, as does an index with no connections at all.
+*
+* Values are matched with SameValueZero (`Map` key semantics), which agrees
+* with the `=` / `IN` predicates (`===` / `Set#has`) for every value except
+* `NaN`, where the index is merely more permissive.
+*/
+var ConnectionIndex = class {
+	#byColumn = /* @__PURE__ */ new Map();
+	#constraints = /* @__PURE__ */ new Map();
+	#unconstrained = 0;
+	add(connection, filters) {
+		if (this.#constraints.has(connection)) throw new Error("connection is already indexed");
+		const constraint = staticConstraint(filters);
+		this.#constraints.set(connection, constraint);
+		if (!constraint) {
+			this.#unconstrained++;
+			return;
+		}
+		if (constraint.values.length === 0) return;
+		let byValue = this.#byColumn.get(constraint.column);
+		if (!byValue) {
+			byValue = /* @__PURE__ */ new Map();
+			this.#byColumn.set(constraint.column, byValue);
+		}
+		for (const value of constraint.values) byValue.set(value, (byValue.get(value) ?? 0) + 1);
+	}
+	remove(connection) {
+		if (!this.#constraints.has(connection)) throw new Error("connection is not indexed");
+		const constraint = this.#constraints.get(connection);
+		this.#constraints.delete(connection);
+		if (!constraint) {
+			this.#unconstrained--;
+			return;
+		}
+		if (constraint.values.length === 0) return;
+		const byValue = this.#byColumn.get(constraint.column);
+		if (!byValue) throw new Error(`no index for column ${constraint.column}`);
+		for (const value of constraint.values) {
+			const count = byValue.get(value) ?? 0;
+			if (count <= 1) byValue.delete(value);
+			else byValue.set(value, count - 1);
+		}
+		if (byValue.size === 0) this.#byColumn.delete(constraint.column);
+	}
+	get size() {
+		return this.#constraints.size;
+	}
+	/**
+	* Returns `false` only if the filters of every indexed connection reject
+	* `row`. An empty index accepts every row: a source with no connections
+	* is still written to (e.g. to populate it).
+	*/
+	mayAccept(row) {
+		if (this.#unconstrained > 0 || this.#constraints.size === 0) return true;
+		for (const [column, byValue] of this.#byColumn) if (byValue.has(row[column])) return true;
+		return false;
+	}
+	/**
+	* Returns `false` only if the filters of every indexed connection reject
+	* the row(s) of `change`: the row for an add or remove, and both the old
+	* and the new row for an edit.
+	*/
+	mayAcceptChange(change) {
+		if (this.mayAccept(change[1])) return true;
+		return change[0] === 2 && this.mayAccept(change[2]);
+	}
+};
+/**
+* Extracts a static equality constraint that every row accepted by
+* `condition` must satisfy, or `undefined` if there is none.
+*
+* - `column = literal`, `column IS literal` and `column IN (literals)`
+*   constrain the column. `column = null` (which the predicate folds to
+*   `false`) and an empty `IN` constrain it to the empty set, i.e. the
+*   connection never accepts a row.
+* - An `and` is constrained by any of its constrained conditions; the one
+*   with the fewest values is chosen, so a never-matching condition wins.
+* - An `or` is constrained only if all of its branches constrain the same
+*   column, by the union of their values. Never-matching branches cannot
+*   widen the result and are ignored.
+* - Anything else (`!=`, `IS NOT`, `NOT IN`, ranges, `LIKE`, a literal on
+*   the left) is unconstrained.
+*/
+function staticConstraint(condition) {
+	if (!condition) return;
+	switch (condition.type) {
+		case "simple": {
+			const { left, right, op } = condition;
+			if (left.type !== "column" || right.type !== "literal") return;
+			switch (op) {
+				case "=": return {
+					column: left.name,
+					values: right.value === null ? [] : [right.value]
+				};
+				case "IS": return {
+					column: left.name,
+					values: [right.value]
+				};
+				case "IN": return Array.isArray(right.value) ? {
+					column: left.name,
+					values: right.value
+				} : void 0;
+				default: return;
+			}
+		}
+		case "and": {
+			let best;
+			for (const c of condition.conditions) {
+				const constraint = staticConstraint(c);
+				if (constraint && (!best || constraint.values.length < best.values.length)) best = constraint;
+			}
+			return best;
+		}
+		case "or": {
+			let column;
+			const values = [];
+			for (const c of condition.conditions) {
+				const constraint = staticConstraint(c);
+				if (!constraint) return;
+				if (constraint.values.length === 0) continue;
+				if (column !== void 0 && constraint.column !== column) return;
+				column = constraint.column;
+				values.push(...constraint.values);
+			}
+			return {
+				column: column ?? "",
+				values
+			};
+		}
+	}
+}
+//#endregion
+export { ConnectionIndex };
+
+//# sourceMappingURL=connection-index.js.map

package/out/zql/src/ivm/connection-index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"connection-index.js","names":["#byColumn","#constraints","#unconstrained"],"sources":["../../../../../zql/src/ivm/connection-index.ts"],"sourcesContent":["import type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {NoSubqueryCondition} from '../builder/filter.ts';\nimport {ChangeType} from './change-type.ts';\nimport {SourceChangeIndex} from './source-change-index.ts';\nimport type {SourceChange} from './source.ts';\n\n/**\n * The static equality constraint a connection's filters place on a single\n * column: the row is accepted only if `row[column]` is one of `values`.\n * The push-time counterpart of the fetch-time `Constraint` in\n * `constraint.ts`, which pins columns to single values.\n */\nexport type StaticConstraint = {\n  readonly column: string;\n  readonly values: readonly Value[];\n};\n\n/**\n * Indexes the connections of a source by a static equality constraint\n * (`column = literal` or `column IN (literals)`) taken from each\n * connection's filters, so that a push can determine in O(distinct indexed\n * columns) whether any connection could possibly accept a row, before doing\n * any per-connection work.\n *\n * The index is conservative: {@link mayAccept} returns `true` whenever a\n * connection's filters could accept the row, and may return `true` when they\n * do not (e.g. the connection has further conditions that reject it).\n * It only ever returns `false` when every connection's filters reject the\n * row. Connections without a static equality constraint (no filters, or\n * filters whose top level is not an equality) count as unconstrained and\n * make every row a candidate, as does an index with no connections at all.\n *\n * Values are matched with SameValueZero (`Map` key semantics), which agrees\n * with the `=` / `IN` predicates (`===` / `Set#has`) for every value except\n * `NaN`, where the index is merely more permissive.\n */\nexport class ConnectionIndex<C> {\n  // column -> value -> number of connections constrained to that value.\n  readonly #byColumn = new Map<string, Map<Value, number>>();\n  readonly #constraints = new Map<C, StaticConstraint | undefined>();\n  #unconstrained = 0;\n\n  add(connection: C, filters: NoSubqueryCondition | undefined): void {\n    if (this.#constraints.has(connection)) {\n      throw new Error('connection is already indexed');\n    }\n    const constraint = staticConstraint(filters);\n    this.#constraints.set(connection, constraint);\n    if (!constraint) {\n      this.#unconstrained++;\n      return;\n    }\n    if (constraint.values.length === 0) {\n      // Never matches: indexed nowhere, so it is never a candidate.\n      return;\n    }\n    let byValue = this.#byColumn.get(constraint.column);\n    if (!byValue) {\n      byValue = new Map();\n      this.#byColumn.set(constraint.column, byValue);\n    }\n    for (const value of constraint.values) {\n      byValue.set(value, (byValue.get(value) ?? 0) + 1);\n    }\n  }\n\n  remove(connection: C): void {\n    if (!this.#constraints.has(connection)) {\n      throw new Error('connection is not indexed');\n    }\n    const constraint = this.#constraints.get(connection);\n    this.#constraints.delete(connection);\n    if (!constraint) {\n      this.#unconstrained--;\n      return;\n    }\n    if (constraint.values.length === 0) {\n      return;\n    }\n    const byValue = this.#byColumn.get(constraint.column);\n    if (!byValue) {\n      throw new Error(`no index for column ${constraint.column}`);\n    }\n    for (const value of constraint.values) {\n      const count = byValue.get(value) ?? 0;\n      if (count <= 1) {\n        byValue.delete(value);\n      } else {\n        byValue.set(value, count - 1);\n      }\n    }\n    if (byValue.size === 0) {\n      this.#byColumn.delete(constraint.column);\n    }\n  }\n\n  get size(): number {\n    return this.#constraints.size;\n  }\n\n  /**\n   * Returns `false` only if the filters of every indexed connection reject\n   * `row`. An empty index accepts every row: a source with no connections\n   * is still written to (e.g. to populate it).\n   */\n  mayAccept(row: Row): boolean {\n    if (this.#unconstrained > 0 || this.#constraints.size === 0) {\n      return true;\n    }\n    for (const [column, byValue] of this.#byColumn) {\n      if (byValue.has(row[column])) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Returns `false` only if the filters of every indexed connection reject\n   * the row(s) of `change`: the row for an add or remove, and both the old\n   * and the new row for an edit.\n   */\n  mayAcceptChange(change: SourceChange): boolean {\n    if (this.mayAccept(change[SourceChangeIndex.ROW])) {\n      return true;\n    }\n    return (\n      change[SourceChangeIndex.TYPE] === ChangeType.EDIT &&\n      this.mayAccept(change[SourceChangeIndex.OLD_ROW])\n    );\n  }\n}\n\n/**\n * Extracts a static equality constraint that every row accepted by\n * `condition` must satisfy, or `undefined` if there is none.\n *\n * - `column = literal`, `column IS literal` and `column IN (literals)`\n *   constrain the column. `column = null` (which the predicate folds to\n *   `false`) and an empty `IN` constrain it to the empty set, i.e. the\n *   connection never accepts a row.\n * - An `and` is constrained by any of its constrained conditions; the one\n *   with the fewest values is chosen, so a never-matching condition wins.\n * - An `or` is constrained only if all of its branches constrain the same\n *   column, by the union of their values. Never-matching branches cannot\n *   widen the result and are ignored.\n * - Anything else (`!=`, `IS NOT`, `NOT IN`, ranges, `LIKE`, a literal on\n *   the left) is unconstrained.\n */\nexport function staticConstraint(\n  condition: NoSubqueryCondition | undefined,\n): StaticConstraint | undefined {\n  if (!condition) {\n    return undefined;\n  }\n  switch (condition.type) {\n    case 'simple': {\n      const {left, right, op} = condition;\n      if (left.type !== 'column' || right.type !== 'literal') {\n        return undefined;\n      }\n      switch (op) {\n        case '=':\n          return {\n            column: left.name,\n            values: right.value === null ? [] : [right.value],\n          };\n        case 'IS':\n          return {column: left.name, values: [right.value]};\n        case 'IN':\n          return Array.isArray(right.value)\n            ? {column: left.name, values: right.value}\n            : undefined;\n        default:\n          return undefined;\n      }\n    }\n    case 'and': {\n      let best: StaticConstraint | undefined;\n      for (const c of condition.conditions) {\n        const constraint = staticConstraint(c);\n        if (\n          constraint &&\n          (!best || constraint.values.length < best.values.length)\n        ) {\n          best = constraint;\n        }\n      }\n      return best;\n    }\n    case 'or': {\n      let column: string | undefined;\n      const values: Value[] = [];\n      for (const c of condition.conditions) {\n        const constraint = staticConstraint(c);\n        if (!constraint) {\n          return undefined;\n        }\n        if (constraint.values.length === 0) {\n          continue; // a never-matching branch cannot widen the result\n        }\n        if (column !== undefined && constraint.column !== column) {\n          return undefined;\n        }\n        column = constraint.column;\n        values.push(...constraint.values);\n      }\n      // Every branch never matches: the whole `or` never matches.\n      return {column: column ?? '', values};\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAoCA,IAAa,kBAAb,MAAgC;CAE9B,4BAAqB,IAAI,IAAgC;CACzD,+BAAwB,IAAI,IAAqC;CACjE,iBAAiB;CAEjB,IAAI,YAAe,SAAgD;EACjE,IAAI,KAAKC,aAAa,IAAI,UAAU,GAClC,MAAM,IAAI,MAAM,+BAA+B;EAEjD,MAAM,aAAa,iBAAiB,OAAO;EAC3C,KAAKA,aAAa,IAAI,YAAY,UAAU;EAC5C,IAAI,CAAC,YAAY;GACf,KAAKC;GACL;EACF;EACA,IAAI,WAAW,OAAO,WAAW,GAE/B;EAEF,IAAI,UAAU,KAAKF,UAAU,IAAI,WAAW,MAAM;EAClD,IAAI,CAAC,SAAS;GACZ,0BAAU,IAAI,IAAI;GAClB,KAAKA,UAAU,IAAI,WAAW,QAAQ,OAAO;EAC/C;EACA,KAAK,MAAM,SAAS,WAAW,QAC7B,QAAQ,IAAI,QAAQ,QAAQ,IAAI,KAAK,KAAK,KAAK,CAAC;CAEpD;CAEA,OAAO,YAAqB;EAC1B,IAAI,CAAC,KAAKC,aAAa,IAAI,UAAU,GACnC,MAAM,IAAI,MAAM,2BAA2B;EAE7C,MAAM,aAAa,KAAKA,aAAa,IAAI,UAAU;EACnD,KAAKA,aAAa,OAAO,UAAU;EACnC,IAAI,CAAC,YAAY;GACf,KAAKC;GACL;EACF;EACA,IAAI,WAAW,OAAO,WAAW,GAC/B;EAEF,MAAM,UAAU,KAAKF,UAAU,IAAI,WAAW,MAAM;EACpD,IAAI,CAAC,SACH,MAAM,IAAI,MAAM,uBAAuB,WAAW,QAAQ;EAE5D,KAAK,MAAM,SAAS,WAAW,QAAQ;GACrC,MAAM,QAAQ,QAAQ,IAAI,KAAK,KAAK;GACpC,IAAI,SAAS,GACX,QAAQ,OAAO,KAAK;QAEpB,QAAQ,IAAI,OAAO,QAAQ,CAAC;EAEhC;EACA,IAAI,QAAQ,SAAS,GACnB,KAAKA,UAAU,OAAO,WAAW,MAAM;CAE3C;CAEA,IAAI,OAAe;EACjB,OAAO,KAAKC,aAAa;CAC3B;;;;;;CAOA,UAAU,KAAmB;EAC3B,IAAI,KAAKC,iBAAiB,KAAK,KAAKD,aAAa,SAAS,GACxD,OAAO;EAET,KAAK,MAAM,CAAC,QAAQ,YAAY,KAAKD,WACnC,IAAI,QAAQ,IAAI,IAAI,OAAO,GACzB,OAAO;EAGX,OAAO;CACT;;;;;;CAOA,gBAAgB,QAA+B;EAC7C,IAAI,KAAK,UAAU,OAAO,EAAsB,GAC9C,OAAO;EAET,OACE,OAAO,OAA4B,KACnC,KAAK,UAAU,OAAO,EAA0B;CAEpD;AACF;;;;;;;;;;;;;;;;;AAkBA,SAAgB,iBACd,WAC8B;CAC9B,IAAI,CAAC,WACH;CAEF,QAAQ,UAAU,MAAlB;EACE,KAAK,UAAU;GACb,MAAM,EAAC,MAAM,OAAO,OAAM;GAC1B,IAAI,KAAK,SAAS,YAAY,MAAM,SAAS,WAC3C;GAEF,QAAQ,IAAR;IACE,KAAK,KACH,OAAO;KACL,QAAQ,KAAK;KACb,QAAQ,MAAM,UAAU,OAAO,CAAC,IAAI,CAAC,MAAM,KAAK;IAClD;IACF,KAAK,MACH,OAAO;KAAC,QAAQ,KAAK;KAAM,QAAQ,CAAC,MAAM,KAAK;IAAC;IAClD,KAAK,MACH,OAAO,MAAM,QAAQ,MAAM,KAAK,IAC5B;KAAC,QAAQ,KAAK;KAAM,QAAQ,MAAM;IAAK,IACvC,KAAA;IACN,SACE;GACJ;EACF;EACA,KAAK,OAAO;GACV,IAAI;GACJ,KAAK,MAAM,KAAK,UAAU,YAAY;IACpC,MAAM,aAAa,iBAAiB,CAAC;IACrC,IACE,eACC,CAAC,QAAQ,WAAW,OAAO,SAAS,KAAK,OAAO,SAEjD,OAAO;GAEX;GACA,OAAO;EACT;EACA,KAAK,MAAM;GACT,IAAI;GACJ,MAAM,SAAkB,CAAC;GACzB,KAAK,MAAM,KAAK,UAAU,YAAY;IACpC,MAAM,aAAa,iBAAiB,CAAC;IACrC,IAAI,CAAC,YACH;IAEF,IAAI,WAAW,OAAO,WAAW,GAC/B;IAEF,IAAI,WAAW,KAAA,KAAa,WAAW,WAAW,QAChD;IAEF,SAAS,WAAW;IACpB,OAAO,KAAK,GAAG,WAAW,MAAM;GAClC;GAEA,OAAO;IAAC,QAAQ,UAAU;IAAI;GAAM;EACtC;CACF;AACF"}

package/out/zql/src/ivm/exists.js

@@ -1,7 +1,7 @@
 import { assert, unreachable } from "../../../shared/src/asserts.js";
+import { areEqual } from "../../../shared/src/arrays.js";
 import { makeAddChange, makeRemoveChange } from "./change.js";
 import { normalizeUndefined } from "./data.js";
-import { areEqual } from "../../../shared/src/arrays.js";
 import { throwFilterOutput } from "./filter-operators.js";
 //#region ../zql/src/ivm/exists.ts
 /**

package/out/zql/src/ivm/filter-operators.d.ts

@@ -1,4 +1,5 @@
 import type { BuilderDelegate } from '../builder/builder.ts';
+import type { NoSubqueryCondition } from '../builder/filter.ts';
 import type { Change } from './change.ts';
 import { type Node } from './data.ts';
 import type { FetchRequest, Input, InputBase, Output } from './operator.ts';
@@ -41,7 +42,7 @@ export interface FilterOperator extends FilterInput, FilterOutput {
 export declare const throwFilterOutput: FilterOutput;
 export declare class FilterStart implements FilterInput, Output {
     #private;
-    constructor(input: Input);
+    constructor(input: Input, condition?: NoSubqueryCondition | undefined);
     setFilterOutput(output: FilterOutput): void;
     destroy(): void;
     getSchema(): SourceSchema;
@@ -60,5 +61,5 @@ export declare class FilterEnd implements Input, FilterOutput {
     getSchema(): SourceSchema;
     push(change: Change): Stream<"yield">;
 }
-export declare function buildFilterPipeline(input: Input, delegate: BuilderDelegate, pipeline: (filterInput: FilterInput) => FilterInput): Input;
+export declare function buildFilterPipeline(input: Input, delegate: BuilderDelegate, pipeline: (filterInput: FilterInput) => FilterInput, condition?: NoSubqueryCondition | undefined): Input;
 //# sourceMappingURL=filter-operators.d.ts.map

package/out/zql/src/ivm/filter-operators.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"filter-operators.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/filter-operators.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAC3D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AACxC,OAAO,EAAC,KAAK,IAAI,EAAC,MAAM,WAAW,CAAC;AACpC,OAAO,KAAK,EAAC,YAAY,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAC,MAAM,eAAe,CAAC;AAC1E,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAC,KAAK,MAAM,EAAC,MAAM,aAAa,CAAC;AAExC;;;;;;;;;;;;;;;;;GAiBG;AAEH,MAAM,WAAW,WAAY,SAAQ,SAAS;IAC5C,+CAA+C;IAC/C,eAAe,CAAC,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;CAC7C;AAED,MAAM,WAAW,YAAa,SAAQ,MAAM;IAI1C,WAAW,IAAI,IAAI,CAAC;IACpB,MAAM,CAAC,IAAI,EAAE,IAAI,GAAG,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACvD,SAAS,IAAI,IAAI,CAAC;CACnB;AAED,MAAM,WAAW,cAAe,SAAQ,WAAW,EAAE,YAAY;CAAG;AAEpE;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,EAAE,YAa/B,CAAC;AAEF,qBAAa,WAAY,YAAW,WAAW,EAAE,MAAM;;gBAIzC,KAAK,EAAE,KAAK;IAKxB,eAAe,CAAC,MAAM,EAAE,YAAY;IAIpC,OAAO,IAAI,IAAI;IAIf,SAAS,IAAI,YAAY;IAIzB,IAAI,CAAC,MAAM,EAAE,MAAM;IAIlB,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC;CAkBlD;AAED,qBAAa,SAAU,YAAW,KAAK,EAAE,YAAY;;gBAMvC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW;IAMlD,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC;IAIhD,WAAW;IACX,SAAS;IAET,MAAM,CAAC,KAAK,EAAE,IAAI;IAIlB,SAAS,CAAC,MAAM,EAAE,MAAM;IAIxB,OAAO,IAAI,IAAI;IAIf,SAAS,IAAI,YAAY;IAIzB,IAAI,CAAC,MAAM,EAAE,MAAM;CAGpB;AAID,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,KAAK,EACZ,QAAQ,EAAE,eAAe,EACzB,QAAQ,EAAE,CAAC,WAAW,EAAE,WAAW,KAAK,WAAW,GAClD,KAAK,CAQP"}
+{"version":3,"file":"filter-operators.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/filter-operators.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,eAAe,EAAC,MAAM,uBAAuB,CAAC;AAC3D,OAAO,KAAK,EAAC,mBAAmB,EAAC,MAAM,sBAAsB,CAAC;AAC9D,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AACxC,OAAO,EAAC,KAAK,IAAI,EAAC,MAAM,WAAW,CAAC;AACpC,OAAO,KAAK,EAAC,YAAY,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAC,MAAM,eAAe,CAAC;AAC1E,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAC,KAAK,MAAM,EAAC,MAAM,aAAa,CAAC;AAExC;;;;;;;;;;;;;;;;;GAiBG;AAEH,MAAM,WAAW,WAAY,SAAQ,SAAS;IAC5C,+CAA+C;IAC/C,eAAe,CAAC,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;CAC7C;AAED,MAAM,WAAW,YAAa,SAAQ,MAAM;IAI1C,WAAW,IAAI,IAAI,CAAC;IACpB,MAAM,CAAC,IAAI,EAAE,IAAI,GAAG,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACvD,SAAS,IAAI,IAAI,CAAC;CACnB;AAED,MAAM,WAAW,cAAe,SAAQ,WAAW,EAAE,YAAY;CAAG;AAEpE;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,EAAE,YAa/B,CAAC;AAEF,qBAAa,WAAY,YAAW,WAAW,EAAE,MAAM;;gBAKzC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,mBAAmB,GAAG,SAAS;IAMrE,eAAe,CAAC,MAAM,EAAE,YAAY;IAIpC,OAAO,IAAI,IAAI;IAIf,SAAS,IAAI,YAAY;IAIzB,IAAI,CAAC,MAAM,EAAE,MAAM;IAIlB,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC;CAqBlD;AAeD,qBAAa,SAAU,YAAW,KAAK,EAAE,YAAY;;gBAMvC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,WAAW;IAMlD,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC;IAIhD,WAAW;IACX,SAAS;IAET,MAAM,CAAC,KAAK,EAAE,IAAI;IAIlB,SAAS,CAAC,MAAM,EAAE,MAAM;IAIxB,OAAO,IAAI,IAAI;IAIf,SAAS,IAAI,YAAY;IAIzB,IAAI,CAAC,MAAM,EAAE,MAAM;CAGpB;AAID,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,KAAK,EACZ,QAAQ,EAAE,eAAe,EACzB,QAAQ,EAAE,CAAC,WAAW,EAAE,WAAW,KAAK,WAAW,EACnD,SAAS,CAAC,EAAE,mBAAmB,GAAG,SAAS,GAC1C,KAAK,CAQP"}

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

@@ -18,9 +18,11 @@ var throwFilterOutput = {
 };
 var FilterStart = class {
 	#input;
+	#condition;
 	#output = throwFilterOutput;
-	constructor(input) {
+	constructor(input, condition) {
 		this.#input = input;
+		this.#condition = condition;
 		input.setOutput(this);
 	}
 	setFilterOutput(output) {
@@ -36,9 +38,14 @@ var FilterStart = class {
 		return this.#output.push(change, this);
 	}
 	*fetch(req) {
+		const mergedFilter = mergeFilters(req.filter, this.#condition);
+		const childReq = mergedFilter === req.filter ? req : {
+			...req,
+			filter: mergedFilter
+		};
 		this.#output.beginFilter();
 		try {
-			for (const node of this.#input.fetch(req)) {
+			for (const node of this.#input.fetch(childReq)) {
 				if (node === "yield") {
 					yield node;
 					continue;
@@ -50,6 +57,14 @@ var FilterStart = class {
 		}
 	}
 };
+function mergeFilters(reqFilter, ownCondition) {
+	if (!ownCondition) return reqFilter;
+	if (!reqFilter) return ownCondition;
+	return {
+		type: "and",
+		conditions: [reqFilter, ownCondition]
+	};
+}
 var FilterEnd = class {
 	#start;
 	#input;
@@ -81,8 +96,8 @@ var FilterEnd = class {
 	}
 };
 var returnTrueEmptyIterator = makeEmptyIteratorWithReturn(true);
-function buildFilterPipeline(input, delegate, pipeline) {
-	const filterStart = new FilterStart(input);
+function buildFilterPipeline(input, delegate, pipeline, condition) {
+	const filterStart = new FilterStart(input, condition);
 	delegate.addEdge(input, filterStart);
 	const middle = pipeline(filterStart);
 	delegate.addEdge(filterStart, middle);

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

@@ -1 +1 @@
-{"version":3,"file":"filter-operators.js","names":["#input","#output","#start"],"sources":["../../../../../zql/src/ivm/filter-operators.ts"],"sourcesContent":["import {makeEmptyIteratorWithReturn} from '../../../shared/src/iterables.ts';\nimport type {BuilderDelegate} from '../builder/builder.ts';\nimport type {Change} from './change.ts';\nimport {type Node} from './data.ts';\nimport type {FetchRequest, Input, InputBase, Output} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.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): IterableIterator<'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  // oxlint-disable-next-line require-yield\n  *push(_change: Change): Stream<'yield'> {\n    throw new Error('Output not set');\n  },\n\n  // oxlint-disable-next-line require-yield\n  *filter(_node: Node): IterableIterator<'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    return 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    return this.#start.fetch(req);\n  }\n\n  beginFilter() {}\n  endFilter() {}\n\n  filter(_node: Node) {\n    return returnTrueEmptyIterator;\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    return this.#output.push(change, this);\n  }\n}\n\nconst returnTrueEmptyIterator = makeEmptyIteratorWithReturn(true);\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":";;;;;;;;AAgDA,IAAa,oBAAkC;CAE7C,CAAC,KAAK,SAAkC;EACtC,MAAM,IAAI,MAAM,gBAAgB;CAClC;CAGA,CAAC,OAAO,OAAiD;EACvD,MAAM,IAAI,MAAM,gBAAgB;CAClC;CAEA,cAAc,CAAC;CACf,YAAY,CAAC;AACf;AAEA,IAAa,cAAb,MAAwD;CACtD;CACA,UAAwB;CAExB,YAAY,OAAc;EACxB,KAAKA,SAAS;EACd,MAAM,UAAU,IAAI;CACtB;CAEA,gBAAgB,QAAsB;EACpC,KAAKC,UAAU;CACjB;CAEA,UAAgB;EACd,KAAKD,OAAO,QAAQ;CACtB;CAEA,YAA0B;EACxB,OAAO,KAAKA,OAAO,UAAU;CAC/B;CAEA,KAAK,QAAgB;EACnB,OAAO,KAAKC,QAAQ,KAAK,QAAQ,IAAI;CACvC;CAEA,CAAC,MAAM,KAA2C;EAChD,KAAKA,QAAQ,YAAY;EACzB,IAAI;GACF,KAAK,MAAM,QAAQ,KAAKD,OAAO,MAAM,GAAG,GAAG;IACzC,IAAI,SAAS,SAAS;KACpB,MAAM;KACN;IACF;IACA,IAAI,OAAO,KAAKC,QAAQ,OAAO,IAAI,GACjC,MAAM;GAEV;EACF,UAAU;GAGR,KAAKA,QAAQ,UAAU;EACzB;CACF;AACF;AAEA,IAAa,YAAb,MAAsD;CACpD;CACA;CAEA,UAAkB;CAElB,YAAY,OAAoB,OAAoB;EAClD,KAAKC,SAAS;EACd,KAAKF,SAAS;EACd,MAAM,gBAAgB,IAAI;CAC5B;CAEA,MAAM,KAA2C;EAC/C,OAAO,KAAKE,OAAO,MAAM,GAAG;CAC9B;CAEA,cAAc,CAAC;CACf,YAAY,CAAC;CAEb,OAAO,OAAa;EAClB,OAAO;CACT;CAEA,UAAU,QAAgB;EACxB,KAAKD,UAAU;CACjB;CAEA,UAAgB;EACd,KAAKD,OAAO,QAAQ;CACtB;CAEA,YAA0B;EACxB,OAAO,KAAKA,OAAO,UAAU;CAC/B;CAEA,KAAK,QAAgB;EACnB,OAAO,KAAKC,QAAQ,KAAK,QAAQ,IAAI;CACvC;AACF;AAEA,IAAM,0BAA0B,4BAA4B,IAAI;AAEhE,SAAgB,oBACd,OACA,UACA,UACO;CACP,MAAM,cAAc,IAAI,YAAY,KAAK;CACzC,SAAS,QAAQ,OAAO,WAAW;CACnC,MAAM,SAAS,SAAS,WAAW;CACnC,SAAS,QAAQ,aAAa,MAAM;CACpC,MAAM,YAAY,IAAI,UAAU,aAAa,MAAM;CACnD,SAAS,QAAQ,QAAQ,SAAS;CAClC,OAAO;AACT"}
+{"version":3,"file":"filter-operators.js","names":["#input","#condition","#output","#start"],"sources":["../../../../../zql/src/ivm/filter-operators.ts"],"sourcesContent":["import {makeEmptyIteratorWithReturn} from '../../../shared/src/iterables.ts';\nimport type {BuilderDelegate} from '../builder/builder.ts';\nimport type {NoSubqueryCondition} from '../builder/filter.ts';\nimport type {Change} from './change.ts';\nimport {type Node} from './data.ts';\nimport type {FetchRequest, Input, InputBase, Output} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.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): IterableIterator<'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  // oxlint-disable-next-line require-yield\n  *push(_change: Change): Stream<'yield'> {\n    throw new Error('Output not set');\n  },\n\n  // oxlint-disable-next-line require-yield\n  *filter(_node: Node): IterableIterator<'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  readonly #condition: NoSubqueryCondition | undefined;\n  #output: FilterOutput = throwFilterOutput;\n\n  constructor(input: Input, condition?: NoSubqueryCondition | undefined) {\n    this.#input = input;\n    this.#condition = condition;\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    return this.#output.push(change, this);\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    const mergedFilter = mergeFilters(req.filter, this.#condition);\n    const childReq =\n      mergedFilter === req.filter ? req : {...req, filter: mergedFilter};\n    this.#output.beginFilter();\n    try {\n      for (const node of this.#input.fetch(childReq)) {\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\nfunction mergeFilters(\n  reqFilter: NoSubqueryCondition | undefined,\n  ownCondition: NoSubqueryCondition | undefined,\n): NoSubqueryCondition | undefined {\n  if (!ownCondition) {\n    return reqFilter;\n  }\n  if (!reqFilter) {\n    return ownCondition;\n  }\n  return {type: 'and', conditions: [reqFilter, ownCondition]};\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    return this.#start.fetch(req);\n  }\n\n  beginFilter() {}\n  endFilter() {}\n\n  filter(_node: Node) {\n    return returnTrueEmptyIterator;\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    return this.#output.push(change, this);\n  }\n}\n\nconst returnTrueEmptyIterator = makeEmptyIteratorWithReturn(true);\n\nexport function buildFilterPipeline(\n  input: Input,\n  delegate: BuilderDelegate,\n  pipeline: (filterInput: FilterInput) => FilterInput,\n  condition?: NoSubqueryCondition | undefined,\n): Input {\n  const filterStart = new FilterStart(input, condition);\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":";;;;;;;;AAiDA,IAAa,oBAAkC;CAE7C,CAAC,KAAK,SAAkC;EACtC,MAAM,IAAI,MAAM,gBAAgB;CAClC;CAGA,CAAC,OAAO,OAAiD;EACvD,MAAM,IAAI,MAAM,gBAAgB;CAClC;CAEA,cAAc,CAAC;CACf,YAAY,CAAC;AACf;AAEA,IAAa,cAAb,MAAwD;CACtD;CACA;CACA,UAAwB;CAExB,YAAY,OAAc,WAA6C;EACrE,KAAKA,SAAS;EACd,KAAKC,aAAa;EAClB,MAAM,UAAU,IAAI;CACtB;CAEA,gBAAgB,QAAsB;EACpC,KAAKC,UAAU;CACjB;CAEA,UAAgB;EACd,KAAKF,OAAO,QAAQ;CACtB;CAEA,YAA0B;EACxB,OAAO,KAAKA,OAAO,UAAU;CAC/B;CAEA,KAAK,QAAgB;EACnB,OAAO,KAAKE,QAAQ,KAAK,QAAQ,IAAI;CACvC;CAEA,CAAC,MAAM,KAA2C;EAChD,MAAM,eAAe,aAAa,IAAI,QAAQ,KAAKD,UAAU;EAC7D,MAAM,WACJ,iBAAiB,IAAI,SAAS,MAAM;GAAC,GAAG;GAAK,QAAQ;EAAY;EACnE,KAAKC,QAAQ,YAAY;EACzB,IAAI;GACF,KAAK,MAAM,QAAQ,KAAKF,OAAO,MAAM,QAAQ,GAAG;IAC9C,IAAI,SAAS,SAAS;KACpB,MAAM;KACN;IACF;IACA,IAAI,OAAO,KAAKE,QAAQ,OAAO,IAAI,GACjC,MAAM;GAEV;EACF,UAAU;GAGR,KAAKA,QAAQ,UAAU;EACzB;CACF;AACF;AAEA,SAAS,aACP,WACA,cACiC;CACjC,IAAI,CAAC,cACH,OAAO;CAET,IAAI,CAAC,WACH,OAAO;CAET,OAAO;EAAC,MAAM;EAAO,YAAY,CAAC,WAAW,YAAY;CAAC;AAC5D;AAEA,IAAa,YAAb,MAAsD;CACpD;CACA;CAEA,UAAkB;CAElB,YAAY,OAAoB,OAAoB;EAClD,KAAKC,SAAS;EACd,KAAKH,SAAS;EACd,MAAM,gBAAgB,IAAI;CAC5B;CAEA,MAAM,KAA2C;EAC/C,OAAO,KAAKG,OAAO,MAAM,GAAG;CAC9B;CAEA,cAAc,CAAC;CACf,YAAY,CAAC;CAEb,OAAO,OAAa;EAClB,OAAO;CACT;CAEA,UAAU,QAAgB;EACxB,KAAKD,UAAU;CACjB;CAEA,UAAgB;EACd,KAAKF,OAAO,QAAQ;CACtB;CAEA,YAA0B;EACxB,OAAO,KAAKA,OAAO,UAAU;CAC/B;CAEA,KAAK,QAAgB;EACnB,OAAO,KAAKE,QAAQ,KAAK,QAAQ,IAAI;CACvC;AACF;AAEA,IAAM,0BAA0B,4BAA4B,IAAI;AAEhE,SAAgB,oBACd,OACA,UACA,UACA,WACO;CACP,MAAM,cAAc,IAAI,YAAY,OAAO,SAAS;CACpD,SAAS,QAAQ,OAAO,WAAW;CACnC,MAAM,SAAS,SAAS,WAAW;CACnC,SAAS,QAAQ,aAAa,MAAM;CACpC,MAAM,YAAY,IAAI,UAAU,aAAa,MAAM;CACnD,SAAS,QAAQ,QAAQ,SAAS;CAClC,OAAO;AACT"}