@rocicorp/zero 1.12.0-canary.2 → 1.12.0-canary.4

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

@@ -1 +1 @@
-{"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"}
+{"version":3,"file":"debug-delegate.js","names":[],"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,KAAK,eAAe;EACpB,KAAK,mBAAmB;EACxB,KAAK,qBAAqB,CAAC;EAC3B,KAAK,gBAAgB,CAAC;EACtB,KAAK,kBAAkB,CAAC;EACxB,KAAK,SAAS,CAAC;CACjB;CAEA,qBAAwC;EACtC,OAAO,KAAK;CACd;CAEA,gBAA8B;EAC5B,OAAO,KAAK;CACd;CAEA,kBAAqC;EACnC,OAAO,KAAK;CACd;CAEA,iBAA8B;EAC5B,OAAO,KAAK;CACd;CAEA,UAAU,OAAmB,OAAkB;EAC7C,MAAM,EAAC,WAAU,KAAK,aAAa,KAAK;EACxC,IAAI,QACE;OAAA,CAAC,OAAO,QACV,OAAO,SAAS;EAAA;CAGtB;CAEA,QAAc;EACZ,KAAK,qBAAqB,CAAC;EAC3B,KAAK,gBAAgB,CAAC;EACtB,KAAK,kBAAkB,CAAC;EACxB,KAAK,SAAS,CAAC;CACjB;CAEA,UAAU,OAAmB,OAAY,KAAgB;EACvD,MAAM,EAAC,QAAQ,SAAQ,KAAK,aAAa,KAAK;EAC9C,IAAI,QACF,OAAO,UAAU,OAAO,UAAU,KAAK;EAEzC,IAAI,KAAK,cAAc;GACrB,MAAM,YAAa,KAAK,WAAW,CAAC;GACpC,IAAI,UAAU,SAAS,KAAK,kBAC1B,UAAU,KAAK,GAAG;EAEtB;CACF;CAEA,aAAa,OAAmB,OAAY,QAAsB;EAChE,IAAI,eAAe,KAAK,gBAAgB;EACxC,IAAI,CAAC,cAAc;GACjB,eAAe,CAAC;GAChB,KAAK,gBAAgB,SAAS;EAChC;EACA,IAAI,CAAC,aAAa,QAChB,aAAa,SAAS;EAExB,aAAa,UAAU;CACzB;CAEA,cAAc,QAAoB,OAAY,MAAsB;EAClE,KAAK,OAAO,SAAS;CACvB;CAEA,aAAa,QAAoB;EAC/B,IAAI;EACJ,IAAI;EACJ,SAAS,KAAK,mBAAmB;EACjC,IAAI,CAAC,QAAQ;GACX,SAAS,CAAC;GACV,KAAK,mBAAmB,UAAU;EACpC;EACA,OAAO,KAAK,cAAc;EAC1B,IAAI,CAAC,MAAM;GACT,OAAO,CAAC;GACR,KAAK,cAAc,UAAU;EAC/B;EACA,OAAO;GAAC;GAAQ;EAAI;CACtB;AACF"}

package/out/zql/src/builder/like.js

@@ -38,7 +38,6 @@ function patternToRegExp(source, flags = "") {
 			default:
 				if (specialCharsRe.test(c)) pattern += "\\";
 				pattern += c;
-				break;
 		}
 	}
 	return new RegExp(pattern + "$", flags + "s");

package/out/zql/src/builder/like.js.map

@@ -1 +1 @@
-{"version":3,"file":"like.js","names":[],"sources":["../../../../../zql/src/builder/like.ts"],"sourcesContent":["import {assertString} from '../../../shared/src/asserts.ts';\nimport type {NonNullValue, SimplePredicateNoNull} from './filter.ts';\n\nexport function getLikePredicate(\n  pattern: NonNullValue,\n  flags: 'i' | '',\n): SimplePredicateNoNull {\n  const op = getLikeOp(String(pattern), flags);\n  return (lhs: NonNullValue) => {\n    assertString(lhs);\n    return op(String(lhs));\n  };\n}\n\nconst likePatternRe = /_|%|\\\\/;\n\nfunction getLikeOp(pattern: string, flags: 'i' | ''): (lhs: string) => boolean {\n  // if lhs does not contain '%' or '_' then it is a simple string comparison.\n  // if it does contain '%' or '_' then it is a regex comparison.\n  // '%' is a wildcard for any number of characters\n  // '_' is a wildcard for a single character\n  // Postgres SQL allows escaping using `\\`.\n\n  if (!likePatternRe.test(pattern)) {\n    if (flags === 'i') {\n      const rhsLower = pattern.toLowerCase();\n      return (lhs: string) => lhs.toLowerCase() === rhsLower;\n    }\n    return (lhs: string) => lhs === pattern;\n  }\n  const re = patternToRegExp(pattern, flags);\n  return (lhs: string) => re.test(lhs);\n}\n\nconst specialCharsRe = /[$()*+.?[\\]\\\\^{|}]/;\n\nfunction patternToRegExp(source: string, flags: '' | 'i' = ''): RegExp {\n  // There are a few cases:\n  // % => .*\n  // _ => .\n  // \\x => \\x for any x except special regexp chars\n  // special regexp chars => \\special regexp chars\n  let pattern = '^';\n  for (let i = 0; i < source.length; i++) {\n    let c = source[i];\n    switch (c) {\n      case '%':\n        pattern += '.*';\n        break;\n      case '_':\n        pattern += '.';\n        break;\n\n      // @ts-expect-error fallthrough\n      case '\\\\':\n        if (i === source.length - 1) {\n          throw new Error('LIKE pattern must not end with escape character');\n        }\n        i++;\n        c = source[i];\n\n      // fall through\n      default:\n        if (specialCharsRe.test(c)) {\n          pattern += '\\\\';\n        }\n        pattern += c;\n\n        break;\n    }\n  }\n  // Use the `s` (dotall) flag so `.` (from `_`) and `.*` (from `%`) match\n  // newlines, and keep `^`/`$` anchored to the whole string. The `m` (multiline)\n  // flag was wrong on both counts: it let `^`/`$` match interior line boundaries\n  // (false positives, e.g. 'fooa\\nbar' LIKE 'foo_') while the wildcards still\n  // skipped newlines (false negatives, e.g. 'a\\nb' NOT LIKE 'a%b').\n  return new RegExp(pattern + '$', flags + 's');\n}\n"],"mappings":";;AAGA,SAAgB,iBACd,SACA,OACuB;CACvB,MAAM,KAAK,UAAU,OAAO,OAAO,GAAG,KAAK;CAC3C,QAAQ,QAAsB;EAC5B,aAAa,GAAG;EAChB,OAAO,GAAG,OAAO,GAAG,CAAC;CACvB;AACF;AAEA,IAAM,gBAAgB;AAEtB,SAAS,UAAU,SAAiB,OAA2C;CAO7E,IAAI,CAAC,cAAc,KAAK,OAAO,GAAG;EAChC,IAAI,UAAU,KAAK;GACjB,MAAM,WAAW,QAAQ,YAAY;GACrC,QAAQ,QAAgB,IAAI,YAAY,MAAM;EAChD;EACA,QAAQ,QAAgB,QAAQ;CAClC;CACA,MAAM,KAAK,gBAAgB,SAAS,KAAK;CACzC,QAAQ,QAAgB,GAAG,KAAK,GAAG;AACrC;AAEA,IAAM,iBAAiB;AAEvB,SAAS,gBAAgB,QAAgB,QAAkB,IAAY;CAMrE,IAAI,UAAU;CACd,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,IAAI,IAAI,OAAO;EACf,QAAQ,GAAR;GACE,KAAK;IACH,WAAW;IACX;GACF,KAAK;IACH,WAAW;IACX;GAGF,KAAK;IACH,IAAI,MAAM,OAAO,SAAS,GACxB,MAAM,IAAI,MAAM,iDAAiD;IAEnE;IACA,IAAI,OAAO;GAGb;IACE,IAAI,eAAe,KAAK,CAAC,GACvB,WAAW;IAEb,WAAW;IAEX;EACJ;CACF;CAMA,OAAO,IAAI,OAAO,UAAU,KAAK,QAAQ,GAAG;AAC9C"}
+{"version":3,"file":"like.js","names":[],"sources":["../../../../../zql/src/builder/like.ts"],"sourcesContent":["import {assertString} from '../../../shared/src/asserts.ts';\nimport type {NonNullValue, SimplePredicateNoNull} from './filter.ts';\n\nexport function getLikePredicate(\n  pattern: NonNullValue,\n  flags: 'i' | '',\n): SimplePredicateNoNull {\n  const op = getLikeOp(String(pattern), flags);\n  return (lhs: NonNullValue) => {\n    assertString(lhs);\n    return op(String(lhs));\n  };\n}\n\nconst likePatternRe = /_|%|\\\\/;\n\nfunction getLikeOp(pattern: string, flags: 'i' | ''): (lhs: string) => boolean {\n  // if lhs does not contain '%' or '_' then it is a simple string comparison.\n  // if it does contain '%' or '_' then it is a regex comparison.\n  // '%' is a wildcard for any number of characters\n  // '_' is a wildcard for a single character\n  // Postgres SQL allows escaping using `\\`.\n\n  if (!likePatternRe.test(pattern)) {\n    if (flags === 'i') {\n      const rhsLower = pattern.toLowerCase();\n      return (lhs: string) => lhs.toLowerCase() === rhsLower;\n    }\n    return (lhs: string) => lhs === pattern;\n  }\n  const re = patternToRegExp(pattern, flags);\n  return (lhs: string) => re.test(lhs);\n}\n\nconst specialCharsRe = /[$()*+.?[\\]\\\\^{|}]/;\n\nfunction patternToRegExp(source: string, flags: '' | 'i' = ''): RegExp {\n  // There are a few cases:\n  // % => .*\n  // _ => .\n  // \\x => \\x for any x except special regexp chars\n  // special regexp chars => \\special regexp chars\n  let pattern = '^';\n  for (let i = 0; i < source.length; i++) {\n    let c = source[i];\n    switch (c) {\n      case '%':\n        pattern += '.*';\n        break;\n      case '_':\n        pattern += '.';\n        break;\n\n      // @ts-expect-error fallthrough\n      case '\\\\':\n        if (i === source.length - 1) {\n          throw new Error('LIKE pattern must not end with escape character');\n        }\n        i++;\n        c = source[i];\n\n      // fall through\n      default:\n        if (specialCharsRe.test(c)) {\n          pattern += '\\\\';\n        }\n        pattern += c;\n\n        break;\n    }\n  }\n  // Use the `s` (dotall) flag so `.` (from `_`) and `.*` (from `%`) match\n  // newlines, and keep `^`/`$` anchored to the whole string. The `m` (multiline)\n  // flag was wrong on both counts: it let `^`/`$` match interior line boundaries\n  // (false positives, e.g. 'fooa\\nbar' LIKE 'foo_') while the wildcards still\n  // skipped newlines (false negatives, e.g. 'a\\nb' NOT LIKE 'a%b').\n  return new RegExp(pattern + '$', flags + 's');\n}\n"],"mappings":";;AAGA,SAAgB,iBACd,SACA,OACuB;CACvB,MAAM,KAAK,UAAU,OAAO,OAAO,GAAG,KAAK;CAC3C,QAAQ,QAAsB;EAC5B,aAAa,GAAG;EAChB,OAAO,GAAG,OAAO,GAAG,CAAC;CACvB;AACF;AAEA,IAAM,gBAAgB;AAEtB,SAAS,UAAU,SAAiB,OAA2C;CAO7E,IAAI,CAAC,cAAc,KAAK,OAAO,GAAG;EAChC,IAAI,UAAU,KAAK;GACjB,MAAM,WAAW,QAAQ,YAAY;GACrC,QAAQ,QAAgB,IAAI,YAAY,MAAM;EAChD;EACA,QAAQ,QAAgB,QAAQ;CAClC;CACA,MAAM,KAAK,gBAAgB,SAAS,KAAK;CACzC,QAAQ,QAAgB,GAAG,KAAK,GAAG;AACrC;AAEA,IAAM,iBAAiB;AAEvB,SAAS,gBAAgB,QAAgB,QAAkB,IAAY;CAMrE,IAAI,UAAU;CACd,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;EACtC,IAAI,IAAI,OAAO;EACf,QAAQ,GAAR;GACE,KAAK;IACH,WAAW;IACX;GACF,KAAK;IACH,WAAW;IACX;GAGF,KAAK;IACH,IAAI,MAAM,OAAO,SAAS,GACxB,MAAM,IAAI,MAAM,iDAAiD;IAEnE;IACA,IAAI,OAAO;GAGb;IACE,IAAI,eAAe,KAAK,CAAC,GACvB,WAAW;IAEb,WAAW;EAGf;CACF;CAMA,OAAO,IAAI,OAAO,UAAU,KAAK,QAAQ,GAAG;AAC9C"}

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","#committedRoot","#schema","#listenerArgs","#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    listener(...this.#listenerArgs());\n\n    return () => {\n      this.#listeners.delete(listener);\n    };\n  }\n\n  #fireListeners() {\n    // Read the snapshot once: a listener may push() synchronously, and the\n    // listeners after it must not be handed the root that push is building,\n    // which the rest of the transaction would then mutate in place.\n    const args = this.#listenerArgs();\n    for (const listener of this.#listeners) {\n      listener(...args);\n    }\n  }\n\n  #listenerArgs(): Parameters<Listener<V>> {\n    if (this.#committedRoot !== undefined) {\n      // Held rows go with the held type; after releaseData() both are current.\n      return [this.data as Immutable<V>, this.#heldResultType, this.#heldError];\n    }\n    return [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    const newRoot = 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    // applyChange returns the same root when the change did not affect the\n    // view — e.g. a child change for a relationship that is not in the format,\n    // such as a whereExists subquery (zsubq_*). Only mark dirty when the root\n    // actually changed so flush() does not notify listeners with identical\n    // data. Within a transaction the root keeps its reference across a *real*\n    // change only if an earlier change in the same transaction already cloned\n    // it (copy-on-write) — and that earlier change set #dirty, so an unchanged\n    // reference here never hides a real change.\n    if (newRoot !== this.#root) {\n      this.#root = newRoot;\n      this.#dirty = true;\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    // The snapshot about to be handed to listeners becomes 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    //\n    // Reset BEFORE notifying: a listener may throw (swallowed by\n    // ZeroContext#endTransaction) or re-enter push(). If the committed root\n    // kept its \"owned\" marks, a later transaction would mutate it in place and\n    // return an identical reference — which push() would read as \"no change\",\n    // permanently silencing the view.\n    this.#txnDirty = new WeakSet();\n    this.#fireListeners();\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,SAAS,GAAG,KAAKU,cAAc,CAAC;EAEhC,aAAa;GACX,KAAKV,WAAW,OAAO,QAAQ;EACjC;CACF;CAEA,iBAAiB;EAIf,MAAM,OAAO,KAAKU,cAAc;EAChC,KAAK,MAAM,YAAY,KAAKV,YAC1B,SAAS,GAAG,IAAI;CAEpB;CAEA,gBAAyC;EACvC,IAAI,KAAKQ,mBAAmB,KAAA,GAE1B,OAAO;GAAC,KAAK;GAAsB,KAAKG;GAAiB,KAAKC;EAAU;EAE1E,OAAO;GAAC,KAAK;GAAsB,KAAKR;GAAa,KAAKC;EAAM;CAClE;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,MAAM,UAAU,YACd,KAAKE,OACL,mBAAmB,MAAM,GACzB,KAAKW,WAAW,GAChB,IACA,KAAKb,SACL,OACA,KAAKc,SACP;EASA,IAAI,YAAY,KAAKZ,OAAO;GAC1B,KAAKA,QAAQ;GACb,KAAKU,SAAS;EAChB;EACA,OAAO;CACT;;;;;;;;;;;;CAaA,WAAiB;EACf,KAAKL,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;EAUd,KAAKE,4BAAY,IAAI,QAAQ;EAC7B,KAAKE,eAAe;CACtB;CAEA,UAAU,KAAU;EAClB,KAAKf,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"}
+{"version":3,"file":"array-view.js","names":[],"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    listener(...this.#listenerArgs());\n\n    return () => {\n      this.#listeners.delete(listener);\n    };\n  }\n\n  #fireListeners() {\n    // Read the snapshot once: a listener may push() synchronously, and the\n    // listeners after it must not be handed the root that push is building,\n    // which the rest of the transaction would then mutate in place.\n    const args = this.#listenerArgs();\n    for (const listener of this.#listeners) {\n      listener(...args);\n    }\n  }\n\n  #listenerArgs(): Parameters<Listener<V>> {\n    if (this.#committedRoot !== undefined) {\n      // Held rows go with the held type; after releaseData() both are current.\n      return [this.data as Immutable<V>, this.#heldResultType, this.#heldError];\n    }\n    return [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    const newRoot = 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    // applyChange returns the same root when the change did not affect the\n    // view — e.g. a child change for a relationship that is not in the format,\n    // such as a whereExists subquery (zsubq_*). Only mark dirty when the root\n    // actually changed so flush() does not notify listeners with identical\n    // data. Within a transaction the root keeps its reference across a *real*\n    // change only if an earlier change in the same transaction already cloned\n    // it (copy-on-write) — and that earlier change set #dirty, so an unchanged\n    // reference here never hides a real change.\n    if (newRoot !== this.#root) {\n      this.#root = newRoot;\n      this.#dirty = true;\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    // The snapshot about to be handed to listeners becomes 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    //\n    // Reset BEFORE notifying: a listener may throw (swallowed by\n    // ZeroContext#endTransaction) or re-enter push(). If the committed root\n    // kept its \"owned\" marks, a later transaction would mutate it in place and\n    // return an identical reference — which push() would read as \"no change\",\n    // permanently silencing the view.\n    this.#txnDirty = new WeakSet();\n    this.#fireListeners();\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,EAAuB,CAAC;IACjD,QAAQ,mBAAmB,OAAO,EAAuB,CAAC,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,KAAK,SAAS;EACd,KAAK,UAAU;EACf,KAAK,aAAa;EAClB,KAAK,QAAQ,EAAC,IAAI,OAAO,WAAW,KAAA,IAAY,CAAC,EAAC;EAClD,MAAM,UAAU,IAAI;EAEpB,IAAI,kBAAkB,MACpB,KAAK,cAAc;OACd,IAAI,WAAW,eAAe;GACnC,KAAK,cAAc;GACnB,KAAK,SAAS;EAChB,OACE,cACG,WAAW,KAAK,eAAe,UAAU,CAAC,CAAC,CAC3C,OAAM,MAAK,KAAK,eAAe,SAAS,CAAC,CAAC;EAE/C,KAAK,SAAS;CAChB;CAEA,IAAI,OAAO;EACT,QAAQ,KAAK,kBAAkB,KAAK,MAAA,CAAO;CAC7C;CAEA,aAA2B;EACzB,OAAQ,KAAK,YAAY,KAAK,OAAO,UAAU;CACjD;CAEA,YAAY,UAAuB;EACjC,OAAO,CAAC,KAAK,WAAW,IAAI,QAAQ,GAAG,6BAA6B;EACpE,KAAK,WAAW,IAAI,QAAQ;EAE5B,SAAS,GAAG,KAAK,cAAc,CAAC;EAEhC,aAAa;GACX,KAAK,WAAW,OAAO,QAAQ;EACjC;CACF;CAEA,iBAAiB;EAIf,MAAM,OAAO,KAAK,cAAc;EAChC,KAAK,MAAM,YAAY,KAAK,YAC1B,SAAS,GAAG,IAAI;CAEpB;CAEA,gBAAyC;EACvC,IAAI,KAAK,mBAAmB,KAAA,GAE1B,OAAO;GAAC,KAAK;GAAsB,KAAK;GAAiB,KAAK;EAAU;EAE1E,OAAO;GAAC,KAAK;GAAsB,KAAK;GAAa,KAAK;EAAM;CAClE;CAEA,UAAU;EACR,KAAK,YAAY;CACnB;CAEA,WAAW;EACT,KAAK,SAAS;EACd,KAAK,MAAM,QAAQ,WAAW,KAAK,OAAO,MAAM,CAAC,CAAC,CAAC,GACjD,KAAK,QAAQ,YACX,KAAK,OACL;GAAC,MAAM;GAAO;EAAI,GAClB,KAAK,WAAW,GAChB,IACA,KAAK,SACL,OACA,IAIF;EAEF,KAAK,MAAM;CACb;CAEA,KAAK,QAAgB;EACnB,MAAM,UAAU,YACd,KAAK,OACL,mBAAmB,MAAM,GACzB,KAAK,WAAW,GAChB,IACA,KAAK,SACL,OACA,KAAK,SACP;EASA,IAAI,YAAY,KAAK,OAAO;GAC1B,KAAK,QAAQ;GACb,KAAK,SAAS;EAChB;EACA,OAAO;CACT;;;;;;;;;;;;CAaA,WAAiB;EACf,KAAK,iBAAiB,KAAK;EAC3B,KAAK,QAAQ;EACb,KAAK,kBAAkB,KAAK;EAC5B,KAAK,aAAa,KAAK;CACzB;;;;;;;CAQA,cAAoB;EAClB,KAAK,iBAAiB,KAAA;CACxB;CAEA,QAAQ;EACN,KAAK,iBAAiB,KAAA;EACtB,KAAK,QAAQ;EACb,IAAI,CAAC,KAAK,QACR;EAEF,KAAK,SAAS;EAUd,KAAK,4BAAY,IAAI,QAAQ;EAC7B,KAAK,eAAe;CACtB;CAEA,UAAU,KAAU;EAClB,KAAK,WAAW,GAAG;CACrB;;;;;;;;CASA,aAAmB;EACjB,IAAI,KAAK,gBAAgB,WACvB,KAAK,eAAe,QAAQ;CAEhC;;CAGA,eAAqB;EACnB,IAAI,KAAK,gBAAgB,UACvB,KAAK,eAAe,SAAS;CAEjC;CAEA,eAAe,YAAwB,OAAsB;EAC3D,KAAK,cAAc;EACnB,KAAK,SAAS;EAOd,IAAI,KAAK,OAEP,KAAK,SAAS;OACT,IAAI,CAAC,KAAK,QACf,KAAK,eAAe;CAExB;AACF"}

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

@@ -51,7 +51,7 @@ var Cap = class {
 		const capStateKey = getCapStateKey(this.#partitionKey, req.constraint);
 		const capState = this.#storage.get(capStateKey);
 		if (!capState) {
-			yield* this.#initialFetch(req);
+			yield* this.#initialFetch(req, capStateKey);
 			return;
 		}
 		if (capState.size === 0) return;
@@ -70,11 +70,9 @@ var Cap = class {
 			}
 		}
 	}
-	*#initialFetch(req) {
+	*#initialFetch(req, capStateKey) {
 		if (this.#limit === 0) return;
 		assert(constraintMatchesPartitionKey(req.constraint, this.#partitionKey), "Constraint should match partition key");
-		const capStateKey = getCapStateKey(this.#partitionKey, req.constraint);
-		assert(this.#storage.get(capStateKey) === void 0, "Cap state should be undefined");
 		let size = 0;
 		const pks = [];
 		let downstreamEarlyReturn = true;

package/out/zql/src/ivm/cap.js.map

@@ -1 +1 @@
-{"version":3,"file":"cap.js","names":["#input","#storage","#limit","#partitionKey","#partitionKeyComparator","#primaryKey","#output","#initialFetch","#pushEditChange"],"sources":["../../../../../zql/src/ivm/cap.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {emptyArray} from '../../../shared/src/sentinels.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.ts';\nimport {makeAddChange, type Change, type EditChange} from './change.ts';\nimport type {Constraint} from './constraint.ts';\nimport type {Comparator, Node} from './data.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type InputBase,\n  type Operator,\n  type Output,\n  type Storage,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.ts';\nimport {\n  constraintMatchesPartitionKey,\n  makePartitionKeyComparator,\n  type PartitionKey,\n} from './take.ts';\n\ntype CapState = {\n  size: number;\n  pks: string[];\n};\n\ninterface CapStorage {\n  get(key: string): CapState | undefined;\n  set(key: string, value: CapState): void;\n  del(key: string): void;\n  destroy(): void;\n}\n\n/**\n * The Cap operator is a count-based limiter for EXISTS subqueries that\n * does not require ordering. Unlike Take, it tracks membership by primary\n * key set rather than by a sorted bound. This means:\n *\n * - No comparator needed (no ordering requirement)\n * - No `start` or `reverse` fetch support\n * - No `#rowHiddenFromFetch` complexity (we can defer when adding to the pk set)\n *\n * Cap is used in EXISTS child pipelines where only the count of matching\n * rows matters, not their order. This allows SQLite to skip ORDER BY\n * entirely, enabling much faster query plans.\n *\n * Cap can count rows globally or by unique value of some partition key\n * (same as Take).\n */\nexport class Cap implements Operator {\n  readonly #input: Input;\n  readonly #storage: CapStorage;\n  readonly #limit: number;\n  readonly #partitionKey: PartitionKey | undefined;\n  readonly #partitionKeyComparator: Comparator | undefined;\n  readonly #primaryKey: PrimaryKey;\n\n  #output: Output = throwOutput;\n\n  constructor(\n    input: Input,\n    storage: Storage,\n    limit: number,\n    partitionKey?: PartitionKey,\n  ) {\n    assert(limit >= 0, 'Limit must be non-negative');\n    input.setOutput(this);\n    this.#input = input;\n    this.#storage = storage as CapStorage;\n    this.#limit = limit;\n    this.#partitionKey = partitionKey;\n    this.#partitionKeyComparator =\n      partitionKey && makePartitionKeyComparator(partitionKey);\n    this.#primaryKey = input.getSchema().primaryKey;\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    assert(!req.start, 'Cap does not support start');\n    assert(!req.reverse, 'Cap does not support reverse');\n\n    // Cap is only built for non-flipped EXISTS subqueries, whose only\n    // downstream consumer is a Join that always fetches with a constraint\n    // built from the correlation's childField — which is Cap's partition\n    // key. So either partitionKey is undefined, or constraint matches.\n    assert(\n      !this.#partitionKey ||\n        (req.constraint !== undefined &&\n          constraintMatchesPartitionKey(req.constraint, this.#partitionKey)),\n      'Cap fetch: constraint must match partition key when partitioned',\n    );\n\n    const capStateKey = getCapStateKey(this.#partitionKey, req.constraint);\n    const capState = this.#storage.get(capStateKey);\n    if (!capState) {\n      yield* this.#initialFetch(req);\n      return;\n    }\n    if (capState.size === 0) {\n      return;\n    }\n    // PK-based point lookups: fetch each tracked row by its PK directly,\n    // rather than scanning the partition and filtering.\n    for (const pk of capState.pks) {\n      const pkConstraint = deserializePKToConstraint(pk, this.#primaryKey);\n      // Preserve req.constraint (the partition key) so upstream partitioned\n      // operators (e.g. Take) retain their partition scope and do not throw.\n      const constraint = req.constraint\n        ? {...req.constraint, ...pkConstraint}\n        : pkConstraint;\n      for (const inputNode of this.#input.fetch({constraint})) {\n        if (inputNode === 'yield') {\n          yield inputNode;\n          continue;\n        }\n        yield inputNode;\n      }\n    }\n  }\n\n  *#initialFetch(req: FetchRequest): Stream<Node | 'yield'> {\n    if (this.#limit === 0) {\n      return;\n    }\n\n    assert(\n      constraintMatchesPartitionKey(req.constraint, this.#partitionKey),\n      'Constraint should match partition key',\n    );\n\n    const capStateKey = getCapStateKey(this.#partitionKey, req.constraint);\n    assert(\n      this.#storage.get(capStateKey) === undefined,\n      'Cap state should be undefined',\n    );\n\n    let size = 0;\n    const pks: string[] = [];\n    let downstreamEarlyReturn = true;\n    let exceptionThrown = false;\n    try {\n      for (const inputNode of this.#input.fetch(req)) {\n        if (inputNode === 'yield') {\n          yield 'yield';\n          continue;\n        }\n        yield inputNode;\n        pks.push(serializePK(inputNode.row, this.#primaryKey));\n        size++;\n        if (size === this.#limit) {\n          break;\n        }\n      }\n      downstreamEarlyReturn = false;\n    } catch (e) {\n      exceptionThrown = true;\n      throw e;\n    } finally {\n      if (!exceptionThrown) {\n        this.#storage.set(capStateKey, {size, pks});\n        // If it becomes necessary to support downstream early return, this\n        // assert should be removed, and replaced with code that consumes\n        // the input stream until limit is reached or the input stream is\n        // exhausted so that capState is properly hydrated.\n        assert(\n          !downstreamEarlyReturn,\n          'Unexpected early return prevented full hydration',\n        );\n      }\n    }\n  }\n\n  *push(change: Change): Stream<'yield'> {\n    if (change[ChangeIndex.TYPE] === ChangeType.EDIT) {\n      yield* this.#pushEditChange(change);\n      return;\n    }\n\n    const capStateKey = getCapStateKey(\n      this.#partitionKey,\n      change[ChangeIndex.NODE].row,\n    );\n    const capState = this.#storage.get(capStateKey);\n    if (!capState) {\n      return;\n    }\n\n    const pk = serializePK(change[ChangeIndex.NODE].row, this.#primaryKey);\n\n    if (change[ChangeIndex.TYPE] === ChangeType.ADD) {\n      if (capState.size < this.#limit) {\n        const pks = [...capState.pks, pk];\n        this.#storage.set(capStateKey, {size: capState.size + 1, pks});\n        yield* this.#output.push(change, this);\n        return;\n      }\n      // Full — drop\n      return;\n    } else if (change[ChangeIndex.TYPE] === ChangeType.REMOVE) {\n      const pkIndex = capState.pks.indexOf(pk);\n      if (pkIndex === -1) {\n        // Not in our set — drop\n        return;\n      }\n      // Remove from set\n      const pks = [...capState.pks];\n      pks.splice(pkIndex, 1);\n      const newSize = capState.size - 1;\n\n      // Try to refill: fetch from input with partition constraint,\n      // find first row NOT in PK set\n      const pkSet = new Set(pks);\n      const constraint = this.#partitionKey\n        ? (Object.fromEntries(\n            this.#partitionKey.map(\n              key => [key, change[ChangeIndex.NODE].row[key]] as const,\n            ),\n          ) as Constraint)\n        : undefined;\n\n      let replacement: Node | undefined;\n      for (const node of this.#input.fetch({constraint})) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        }\n        const nodePK = serializePK(node.row, this.#primaryKey);\n        if (!pkSet.has(nodePK)) {\n          replacement = node;\n          break;\n        }\n      }\n\n      if (replacement) {\n        // Store state WITHOUT replacement during remove forward,\n        // matching Take's pattern of hiding in-flight changes from re-fetches.\n        this.#storage.set(capStateKey, {size: newSize, pks});\n        yield* this.#output.push(change, this);\n        // Now add replacement to set and forward the add.\n        const replacementPK = serializePK(replacement.row, this.#primaryKey);\n        pks.push(replacementPK);\n        this.#storage.set(capStateKey, {size: newSize + 1, pks});\n        yield* this.#output.push(makeAddChange(replacement), this);\n      } else {\n        this.#storage.set(capStateKey, {size: newSize, pks});\n        yield* this.#output.push(change, this);\n      }\n    } else if (change[ChangeIndex.TYPE] === ChangeType.CHILD) {\n      const pkSet = new Set(capState.pks);\n      if (pkSet.has(pk)) {\n        yield* this.#output.push(change, this);\n      }\n    }\n  }\n\n  #pushEditChange(change: EditChange): Stream<'yield'> {\n    assert(\n      !this.#partitionKeyComparator ||\n        this.#partitionKeyComparator(\n          change[ChangeIndex.OLD_NODE].row,\n          change[ChangeIndex.NODE].row,\n        ) === 0,\n      'Unexpected change of partition key',\n    );\n    const capStateKey = getCapStateKey(\n      this.#partitionKey,\n      change[ChangeIndex.OLD_NODE].row,\n    );\n    const capState = this.#storage.get(capStateKey);\n    if (!capState) {\n      return emptyArray;\n    }\n\n    const oldPK = serializePK(\n      change[ChangeIndex.OLD_NODE].row,\n      this.#primaryKey,\n    );\n    const pkSet = new Set(capState.pks);\n    if (pkSet.has(oldPK)) {\n      // Update the PK in our set if it changed\n      const newPK = serializePK(change[ChangeIndex.NODE].row, this.#primaryKey);\n      if (oldPK !== newPK) {\n        const pks = capState.pks.map(p => (p === oldPK ? newPK : p));\n        this.#storage.set(capStateKey, {size: capState.size, pks});\n      }\n      return this.#output.push(change, this);\n    }\n    // If not in our set, drop\n    return emptyArray;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n    this.#storage.destroy();\n  }\n\n  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n}\n\nfunction getCapStateKey(\n  partitionKey: PartitionKey | undefined,\n  rowOrConstraint: Row | Constraint | undefined,\n): string {\n  const partitionValues: Value[] = [];\n\n  if (partitionKey && rowOrConstraint) {\n    for (const key of partitionKey) {\n      partitionValues.push(rowOrConstraint[key]);\n    }\n  }\n\n  return JSON.stringify(['cap', ...partitionValues]);\n}\n\nfunction serializePK(row: Row, primaryKey: PrimaryKey): string {\n  return JSON.stringify(primaryKey.map(k => row[k]));\n}\n\nfunction deserializePKToConstraint(\n  pk: string,\n  primaryKey: PrimaryKey,\n): Constraint {\n  const values = JSON.parse(pk) as Value[];\n  const constraint: Record<string, Value> = {};\n  for (let i = 0; i < primaryKey.length; i++) {\n    constraint[primaryKey[i]] = values[i];\n  }\n  return constraint;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAsDA,IAAa,MAAb,MAAqC;CACnC;CACA;CACA;CACA;CACA;CACA;CAEA,UAAkB;CAElB,YACE,OACA,SACA,OACA,cACA;EACA,OAAO,SAAS,GAAG,4BAA4B;EAC/C,MAAM,UAAU,IAAI;EACpB,KAAKA,SAAS;EACd,KAAKC,WAAW;EAChB,KAAKC,SAAS;EACd,KAAKC,gBAAgB;EACrB,KAAKC,0BACH,gBAAgB,2BAA2B,YAAY;EACzD,KAAKC,cAAc,MAAM,UAAU,EAAE;CACvC;CAEA,UAAU,QAAsB;EAC9B,KAAKC,UAAU;CACjB;CAEA,YAA0B;EACxB,OAAO,KAAKN,OAAO,UAAU;CAC/B;CAEA,CAAC,MAAM,KAA2C;EAChD,OAAO,CAAC,IAAI,OAAO,4BAA4B;EAC/C,OAAO,CAAC,IAAI,SAAS,8BAA8B;EAMnD,OACE,CAAC,KAAKG,iBACH,IAAI,eAAe,KAAA,KAClB,8BAA8B,IAAI,YAAY,KAAKA,aAAa,GACpE,iEACF;EAEA,MAAM,cAAc,eAAe,KAAKA,eAAe,IAAI,UAAU;EACrE,MAAM,WAAW,KAAKF,SAAS,IAAI,WAAW;EAC9C,IAAI,CAAC,UAAU;GACb,OAAO,KAAKM,cAAc,GAAG;GAC7B;EACF;EACA,IAAI,SAAS,SAAS,GACpB;EAIF,KAAK,MAAM,MAAM,SAAS,KAAK;GAC7B,MAAM,eAAe,0BAA0B,IAAI,KAAKF,WAAW;GAGnE,MAAM,aAAa,IAAI,aACnB;IAAC,GAAG,IAAI;IAAY,GAAG;GAAY,IACnC;GACJ,KAAK,MAAM,aAAa,KAAKL,OAAO,MAAM,EAAC,WAAU,CAAC,GAAG;IACvD,IAAI,cAAc,SAAS;KACzB,MAAM;KACN;IACF;IACA,MAAM;GACR;EACF;CACF;CAEA,CAACO,cAAc,KAA2C;EACxD,IAAI,KAAKL,WAAW,GAClB;EAGF,OACE,8BAA8B,IAAI,YAAY,KAAKC,aAAa,GAChE,uCACF;EAEA,MAAM,cAAc,eAAe,KAAKA,eAAe,IAAI,UAAU;EACrE,OACE,KAAKF,SAAS,IAAI,WAAW,MAAM,KAAA,GACnC,+BACF;EAEA,IAAI,OAAO;EACX,MAAM,MAAgB,CAAC;EACvB,IAAI,wBAAwB;EAC5B,IAAI,kBAAkB;EACtB,IAAI;GACF,KAAK,MAAM,aAAa,KAAKD,OAAO,MAAM,GAAG,GAAG;IAC9C,IAAI,cAAc,SAAS;KACzB,MAAM;KACN;IACF;IACA,MAAM;IACN,IAAI,KAAK,YAAY,UAAU,KAAK,KAAKK,WAAW,CAAC;IACrD;IACA,IAAI,SAAS,KAAKH,QAChB;GAEJ;GACA,wBAAwB;EAC1B,SAAS,GAAG;GACV,kBAAkB;GAClB,MAAM;EACR,UAAU;GACR,IAAI,CAAC,iBAAiB;IACpB,KAAKD,SAAS,IAAI,aAAa;KAAC;KAAM;IAAG,CAAC;IAK1C,OACE,CAAC,uBACD,kDACF;GACF;EACF;CACF;CAEA,CAAC,KAAK,QAAiC;EACrC,IAAI,OAAO,OAAsB,GAAiB;GAChD,OAAO,KAAKO,gBAAgB,MAAM;GAClC;EACF;EAEA,MAAM,cAAc,eAClB,KAAKL,eACL,OAAO,GAAkB,GAC3B;EACA,MAAM,WAAW,KAAKF,SAAS,IAAI,WAAW;EAC9C,IAAI,CAAC,UACH;EAGF,MAAM,KAAK,YAAY,OAAO,GAAkB,KAAK,KAAKI,WAAW;EAErE,IAAI,OAAO,OAAsB,GAAgB;GAC/C,IAAI,SAAS,OAAO,KAAKH,QAAQ;IAC/B,MAAM,MAAM,CAAC,GAAG,SAAS,KAAK,EAAE;IAChC,KAAKD,SAAS,IAAI,aAAa;KAAC,MAAM,SAAS,OAAO;KAAG;IAAG,CAAC;IAC7D,OAAO,KAAKK,QAAQ,KAAK,QAAQ,IAAI;IACrC;GACF;GAEA;EACF,OAAO,IAAI,OAAO,OAAsB,GAAmB;GACzD,MAAM,UAAU,SAAS,IAAI,QAAQ,EAAE;GACvC,IAAI,YAAY,IAEd;GAGF,MAAM,MAAM,CAAC,GAAG,SAAS,GAAG;GAC5B,IAAI,OAAO,SAAS,CAAC;GACrB,MAAM,UAAU,SAAS,OAAO;GAIhC,MAAM,QAAQ,IAAI,IAAI,GAAG;GACzB,MAAM,aAAa,KAAKH,gBACnB,OAAO,YACN,KAAKA,cAAc,KACjB,QAAO,CAAC,KAAK,OAAO,GAAkB,IAAI,IAAI,CAChD,CACF,IACA,KAAA;GAEJ,IAAI;GACJ,KAAK,MAAM,QAAQ,KAAKH,OAAO,MAAM,EAAC,WAAU,CAAC,GAAG;IAClD,IAAI,SAAS,SAAS;KACpB,MAAM;KACN;IACF;IACA,MAAM,SAAS,YAAY,KAAK,KAAK,KAAKK,WAAW;IACrD,IAAI,CAAC,MAAM,IAAI,MAAM,GAAG;KACtB,cAAc;KACd;IACF;GACF;GAEA,IAAI,aAAa;IAGf,KAAKJ,SAAS,IAAI,aAAa;KAAC,MAAM;KAAS;IAAG,CAAC;IACnD,OAAO,KAAKK,QAAQ,KAAK,QAAQ,IAAI;IAErC,MAAM,gBAAgB,YAAY,YAAY,KAAK,KAAKD,WAAW;IACnE,IAAI,KAAK,aAAa;IACtB,KAAKJ,SAAS,IAAI,aAAa;KAAC,MAAM,UAAU;KAAG;IAAG,CAAC;IACvD,OAAO,KAAKK,QAAQ,KAAK,cAAc,WAAW,GAAG,IAAI;GAC3D,OAAO;IACL,KAAKL,SAAS,IAAI,aAAa;KAAC,MAAM;KAAS;IAAG,CAAC;IACnD,OAAO,KAAKK,QAAQ,KAAK,QAAQ,IAAI;GACvC;EACF,OAAO,IAAI,OAAO,OAAsB;OAElC,IADc,IAAI,SAAS,GAC3B,EAAM,IAAI,EAAE,GACd,OAAO,KAAKA,QAAQ,KAAK,QAAQ,IAAI;EAAA;CAG3C;CAEA,gBAAgB,QAAqC;EACnD,OACE,CAAC,KAAKF,2BACJ,KAAKA,wBACH,OAAO,GAAsB,KAC7B,OAAO,GAAkB,GAC3B,MAAM,GACR,oCACF;EACA,MAAM,cAAc,eAClB,KAAKD,eACL,OAAO,GAAsB,GAC/B;EACA,MAAM,WAAW,KAAKF,SAAS,IAAI,WAAW;EAC9C,IAAI,CAAC,UACH,OAAO;EAGT,MAAM,QAAQ,YACZ,OAAO,GAAsB,KAC7B,KAAKI,WACP;EAEA,IAAI,IADc,IAAI,SAAS,GAC3B,EAAM,IAAI,KAAK,GAAG;GAEpB,MAAM,QAAQ,YAAY,OAAO,GAAkB,KAAK,KAAKA,WAAW;GACxE,IAAI,UAAU,OAAO;IACnB,MAAM,MAAM,SAAS,IAAI,KAAI,MAAM,MAAM,QAAQ,QAAQ,CAAE;IAC3D,KAAKJ,SAAS,IAAI,aAAa;KAAC,MAAM,SAAS;KAAM;IAAG,CAAC;GAC3D;GACA,OAAO,KAAKK,QAAQ,KAAK,QAAQ,IAAI;EACvC;EAEA,OAAO;CACT;CAEA,UAAgB;EACd,KAAKN,OAAO,QAAQ;EACpB,KAAKC,SAAS,QAAQ;CACxB;CAEA,CAAC,UAAU,SAAqC;EAC9C,IAAI,KAAKK,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;AACF;AAEA,SAAS,eACP,cACA,iBACQ;CACR,MAAM,kBAA2B,CAAC;CAElC,IAAI,gBAAgB,iBAClB,KAAK,MAAM,OAAO,cAChB,gBAAgB,KAAK,gBAAgB,IAAI;CAI7C,OAAO,KAAK,UAAU,CAAC,OAAO,GAAG,eAAe,CAAC;AACnD;AAEA,SAAS,YAAY,KAAU,YAAgC;CAC7D,OAAO,KAAK,UAAU,WAAW,KAAI,MAAK,IAAI,EAAE,CAAC;AACnD;AAEA,SAAS,0BACP,IACA,YACY;CACZ,MAAM,SAAS,KAAK,MAAM,EAAE;CAC5B,MAAM,aAAoC,CAAC;CAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KACrC,WAAW,WAAW,MAAM,OAAO;CAErC,OAAO;AACT"}
+{"version":3,"file":"cap.js","names":[],"sources":["../../../../../zql/src/ivm/cap.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {emptyArray} from '../../../shared/src/sentinels.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.ts';\nimport {makeAddChange, type Change, type EditChange} from './change.ts';\nimport type {Constraint} from './constraint.ts';\nimport type {Comparator, Node} from './data.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type InputBase,\n  type Operator,\n  type Output,\n  type Storage,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.ts';\nimport {\n  constraintMatchesPartitionKey,\n  makePartitionKeyComparator,\n  type PartitionKey,\n} from './take.ts';\n\ntype CapState = {\n  size: number;\n  pks: string[];\n};\n\ninterface CapStorage {\n  get(key: string): CapState | undefined;\n  set(key: string, value: CapState): void;\n  del(key: string): void;\n  destroy(): void;\n}\n\n/**\n * The Cap operator is a count-based limiter for EXISTS subqueries that\n * does not require ordering. Unlike Take, it tracks membership by primary\n * key set rather than by a sorted bound. This means:\n *\n * - No comparator needed (no ordering requirement)\n * - No `start` or `reverse` fetch support\n * - No `#rowHiddenFromFetch` complexity (we can defer when adding to the pk set)\n *\n * Cap is used in EXISTS child pipelines where only the count of matching\n * rows matters, not their order. This allows SQLite to skip ORDER BY\n * entirely, enabling much faster query plans.\n *\n * Cap can count rows globally or by unique value of some partition key\n * (same as Take).\n */\nexport class Cap implements Operator {\n  readonly #input: Input;\n  readonly #storage: CapStorage;\n  readonly #limit: number;\n  readonly #partitionKey: PartitionKey | undefined;\n  readonly #partitionKeyComparator: Comparator | undefined;\n  readonly #primaryKey: PrimaryKey;\n\n  #output: Output = throwOutput;\n\n  constructor(\n    input: Input,\n    storage: Storage,\n    limit: number,\n    partitionKey?: PartitionKey,\n  ) {\n    assert(limit >= 0, 'Limit must be non-negative');\n    input.setOutput(this);\n    this.#input = input;\n    this.#storage = storage as CapStorage;\n    this.#limit = limit;\n    this.#partitionKey = partitionKey;\n    this.#partitionKeyComparator =\n      partitionKey && makePartitionKeyComparator(partitionKey);\n    this.#primaryKey = input.getSchema().primaryKey;\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  *fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    assert(!req.start, 'Cap does not support start');\n    assert(!req.reverse, 'Cap does not support reverse');\n\n    // Cap is only built for non-flipped EXISTS subqueries, whose only\n    // downstream consumer is a Join that always fetches with a constraint\n    // built from the correlation's childField — which is Cap's partition\n    // key. So either partitionKey is undefined, or constraint matches.\n    assert(\n      !this.#partitionKey ||\n        (req.constraint !== undefined &&\n          constraintMatchesPartitionKey(req.constraint, this.#partitionKey)),\n      'Cap fetch: constraint must match partition key when partitioned',\n    );\n\n    const capStateKey = getCapStateKey(this.#partitionKey, req.constraint);\n    const capState = this.#storage.get(capStateKey);\n    if (!capState) {\n      yield* this.#initialFetch(req, capStateKey);\n      return;\n    }\n    if (capState.size === 0) {\n      return;\n    }\n    // PK-based point lookups: fetch each tracked row by its PK directly,\n    // rather than scanning the partition and filtering.\n    for (const pk of capState.pks) {\n      const pkConstraint = deserializePKToConstraint(pk, this.#primaryKey);\n      // Preserve req.constraint (the partition key) so upstream partitioned\n      // operators (e.g. Take) retain their partition scope and do not throw.\n      const constraint = req.constraint\n        ? {...req.constraint, ...pkConstraint}\n        : pkConstraint;\n      for (const inputNode of this.#input.fetch({constraint})) {\n        if (inputNode === 'yield') {\n          yield inputNode;\n          continue;\n        }\n        yield inputNode;\n      }\n    }\n  }\n\n  *#initialFetch(\n    req: FetchRequest,\n    capStateKey: string,\n  ): Stream<Node | 'yield'> {\n    if (this.#limit === 0) {\n      return;\n    }\n\n    assert(\n      constraintMatchesPartitionKey(req.constraint, this.#partitionKey),\n      'Constraint should match partition key',\n    );\n\n    // The caller (fetch) has already checked that there is no state for\n    // capStateKey.\n\n    let size = 0;\n    const pks: string[] = [];\n    let downstreamEarlyReturn = true;\n    let exceptionThrown = false;\n    try {\n      for (const inputNode of this.#input.fetch(req)) {\n        if (inputNode === 'yield') {\n          yield 'yield';\n          continue;\n        }\n        yield inputNode;\n        pks.push(serializePK(inputNode.row, this.#primaryKey));\n        size++;\n        if (size === this.#limit) {\n          break;\n        }\n      }\n      downstreamEarlyReturn = false;\n    } catch (e) {\n      exceptionThrown = true;\n      throw e;\n    } finally {\n      if (!exceptionThrown) {\n        this.#storage.set(capStateKey, {size, pks});\n        // If it becomes necessary to support downstream early return, this\n        // assert should be removed, and replaced with code that consumes\n        // the input stream until limit is reached or the input stream is\n        // exhausted so that capState is properly hydrated.\n        assert(\n          !downstreamEarlyReturn,\n          'Unexpected early return prevented full hydration',\n        );\n      }\n    }\n  }\n\n  *push(change: Change): Stream<'yield'> {\n    if (change[ChangeIndex.TYPE] === ChangeType.EDIT) {\n      yield* this.#pushEditChange(change);\n      return;\n    }\n\n    const capStateKey = getCapStateKey(\n      this.#partitionKey,\n      change[ChangeIndex.NODE].row,\n    );\n    const capState = this.#storage.get(capStateKey);\n    if (!capState) {\n      return;\n    }\n\n    const pk = serializePK(change[ChangeIndex.NODE].row, this.#primaryKey);\n\n    if (change[ChangeIndex.TYPE] === ChangeType.ADD) {\n      if (capState.size < this.#limit) {\n        const pks = [...capState.pks, pk];\n        this.#storage.set(capStateKey, {size: capState.size + 1, pks});\n        yield* this.#output.push(change, this);\n        return;\n      }\n      // Full — drop\n      return;\n    } else if (change[ChangeIndex.TYPE] === ChangeType.REMOVE) {\n      const pkIndex = capState.pks.indexOf(pk);\n      if (pkIndex === -1) {\n        // Not in our set — drop\n        return;\n      }\n      // Remove from set\n      const pks = [...capState.pks];\n      pks.splice(pkIndex, 1);\n      const newSize = capState.size - 1;\n\n      // Try to refill: fetch from input with partition constraint,\n      // find first row NOT in PK set\n      const pkSet = new Set(pks);\n      const constraint = this.#partitionKey\n        ? (Object.fromEntries(\n            this.#partitionKey.map(\n              key => [key, change[ChangeIndex.NODE].row[key]] as const,\n            ),\n          ) as Constraint)\n        : undefined;\n\n      let replacement: Node | undefined;\n      for (const node of this.#input.fetch({constraint})) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        }\n        const nodePK = serializePK(node.row, this.#primaryKey);\n        if (!pkSet.has(nodePK)) {\n          replacement = node;\n          break;\n        }\n      }\n\n      if (replacement) {\n        // Store state WITHOUT replacement during remove forward,\n        // matching Take's pattern of hiding in-flight changes from re-fetches.\n        this.#storage.set(capStateKey, {size: newSize, pks});\n        yield* this.#output.push(change, this);\n        // Now add replacement to set and forward the add.\n        const replacementPK = serializePK(replacement.row, this.#primaryKey);\n        pks.push(replacementPK);\n        this.#storage.set(capStateKey, {size: newSize + 1, pks});\n        yield* this.#output.push(makeAddChange(replacement), this);\n      } else {\n        this.#storage.set(capStateKey, {size: newSize, pks});\n        yield* this.#output.push(change, this);\n      }\n    } else if (change[ChangeIndex.TYPE] === ChangeType.CHILD) {\n      const pkSet = new Set(capState.pks);\n      if (pkSet.has(pk)) {\n        yield* this.#output.push(change, this);\n      }\n    }\n  }\n\n  #pushEditChange(change: EditChange): Stream<'yield'> {\n    assert(\n      !this.#partitionKeyComparator ||\n        this.#partitionKeyComparator(\n          change[ChangeIndex.OLD_NODE].row,\n          change[ChangeIndex.NODE].row,\n        ) === 0,\n      'Unexpected change of partition key',\n    );\n    const capStateKey = getCapStateKey(\n      this.#partitionKey,\n      change[ChangeIndex.OLD_NODE].row,\n    );\n    const capState = this.#storage.get(capStateKey);\n    if (!capState) {\n      return emptyArray;\n    }\n\n    const oldPK = serializePK(\n      change[ChangeIndex.OLD_NODE].row,\n      this.#primaryKey,\n    );\n    const pkSet = new Set(capState.pks);\n    if (pkSet.has(oldPK)) {\n      // Update the PK in our set if it changed\n      const newPK = serializePK(change[ChangeIndex.NODE].row, this.#primaryKey);\n      if (oldPK !== newPK) {\n        const pks = capState.pks.map(p => (p === oldPK ? newPK : p));\n        this.#storage.set(capStateKey, {size: capState.size, pks});\n      }\n      return this.#output.push(change, this);\n    }\n    // If not in our set, drop\n    return emptyArray;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n    this.#storage.destroy();\n  }\n\n  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n}\n\nfunction getCapStateKey(\n  partitionKey: PartitionKey | undefined,\n  rowOrConstraint: Row | Constraint | undefined,\n): string {\n  const partitionValues: Value[] = [];\n\n  if (partitionKey && rowOrConstraint) {\n    for (const key of partitionKey) {\n      partitionValues.push(rowOrConstraint[key]);\n    }\n  }\n\n  return JSON.stringify(['cap', ...partitionValues]);\n}\n\nfunction serializePK(row: Row, primaryKey: PrimaryKey): string {\n  return JSON.stringify(primaryKey.map(k => row[k]));\n}\n\nfunction deserializePKToConstraint(\n  pk: string,\n  primaryKey: PrimaryKey,\n): Constraint {\n  const values = JSON.parse(pk) as Value[];\n  const constraint: Record<string, Value> = {};\n  for (let i = 0; i < primaryKey.length; i++) {\n    constraint[primaryKey[i]] = values[i];\n  }\n  return constraint;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAsDA,IAAa,MAAb,MAAqC;CACnC;CACA;CACA;CACA;CACA;CACA;CAEA,UAAkB;CAElB,YACE,OACA,SACA,OACA,cACA;EACA,OAAO,SAAS,GAAG,4BAA4B;EAC/C,MAAM,UAAU,IAAI;EACpB,KAAK,SAAS;EACd,KAAK,WAAW;EAChB,KAAK,SAAS;EACd,KAAK,gBAAgB;EACrB,KAAK,0BACH,gBAAgB,2BAA2B,YAAY;EACzD,KAAK,cAAc,MAAM,UAAU,CAAC,CAAC;CACvC;CAEA,UAAU,QAAsB;EAC9B,KAAK,UAAU;CACjB;CAEA,YAA0B;EACxB,OAAO,KAAK,OAAO,UAAU;CAC/B;CAEA,CAAC,MAAM,KAA2C;EAChD,OAAO,CAAC,IAAI,OAAO,4BAA4B;EAC/C,OAAO,CAAC,IAAI,SAAS,8BAA8B;EAMnD,OACE,CAAC,KAAK,iBACH,IAAI,eAAe,KAAA,KAClB,8BAA8B,IAAI,YAAY,KAAK,aAAa,GACpE,iEACF;EAEA,MAAM,cAAc,eAAe,KAAK,eAAe,IAAI,UAAU;EACrE,MAAM,WAAW,KAAK,SAAS,IAAI,WAAW;EAC9C,IAAI,CAAC,UAAU;GACb,OAAO,KAAK,cAAc,KAAK,WAAW;GAC1C;EACF;EACA,IAAI,SAAS,SAAS,GACpB;EAIF,KAAK,MAAM,MAAM,SAAS,KAAK;GAC7B,MAAM,eAAe,0BAA0B,IAAI,KAAK,WAAW;GAGnE,MAAM,aAAa,IAAI,aACnB;IAAC,GAAG,IAAI;IAAY,GAAG;GAAY,IACnC;GACJ,KAAK,MAAM,aAAa,KAAK,OAAO,MAAM,EAAC,WAAU,CAAC,GAAG;IACvD,IAAI,cAAc,SAAS;KACzB,MAAM;KACN;IACF;IACA,MAAM;GACR;EACF;CACF;CAEA,CAAC,cACC,KACA,aACwB;EACxB,IAAI,KAAK,WAAW,GAClB;EAGF,OACE,8BAA8B,IAAI,YAAY,KAAK,aAAa,GAChE,uCACF;EAKA,IAAI,OAAO;EACX,MAAM,MAAgB,CAAC;EACvB,IAAI,wBAAwB;EAC5B,IAAI,kBAAkB;EACtB,IAAI;GACF,KAAK,MAAM,aAAa,KAAK,OAAO,MAAM,GAAG,GAAG;IAC9C,IAAI,cAAc,SAAS;KACzB,MAAM;KACN;IACF;IACA,MAAM;IACN,IAAI,KAAK,YAAY,UAAU,KAAK,KAAK,WAAW,CAAC;IACrD;IACA,IAAI,SAAS,KAAK,QAChB;GAEJ;GACA,wBAAwB;EAC1B,SAAS,GAAG;GACV,kBAAkB;GAClB,MAAM;EACR,UAAU;GACR,IAAI,CAAC,iBAAiB;IACpB,KAAK,SAAS,IAAI,aAAa;KAAC;KAAM;IAAG,CAAC;IAK1C,OACE,CAAC,uBACD,kDACF;GACF;EACF;CACF;CAEA,CAAC,KAAK,QAAiC;EACrC,IAAI,OAAO,OAAsB,GAAiB;GAChD,OAAO,KAAK,gBAAgB,MAAM;GAClC;EACF;EAEA,MAAM,cAAc,eAClB,KAAK,eACL,OAAO,EAAiB,CAAC,GAC3B;EACA,MAAM,WAAW,KAAK,SAAS,IAAI,WAAW;EAC9C,IAAI,CAAC,UACH;EAGF,MAAM,KAAK,YAAY,OAAO,EAAiB,CAAC,KAAK,KAAK,WAAW;EAErE,IAAI,OAAO,OAAsB,GAAgB;GAC/C,IAAI,SAAS,OAAO,KAAK,QAAQ;IAC/B,MAAM,MAAM,CAAC,GAAG,SAAS,KAAK,EAAE;IAChC,KAAK,SAAS,IAAI,aAAa;KAAC,MAAM,SAAS,OAAO;KAAG;IAAG,CAAC;IAC7D,OAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;IACrC;GACF;GAEA;EACF,OAAO,IAAI,OAAO,OAAsB,GAAmB;GACzD,MAAM,UAAU,SAAS,IAAI,QAAQ,EAAE;GACvC,IAAI,YAAY,IAEd;GAGF,MAAM,MAAM,CAAC,GAAG,SAAS,GAAG;GAC5B,IAAI,OAAO,SAAS,CAAC;GACrB,MAAM,UAAU,SAAS,OAAO;GAIhC,MAAM,QAAQ,IAAI,IAAI,GAAG;GACzB,MAAM,aAAa,KAAK,gBACnB,OAAO,YACN,KAAK,cAAc,KACjB,QAAO,CAAC,KAAK,OAAO,EAAiB,CAAC,IAAI,IAAI,CAChD,CACF,IACA,KAAA;GAEJ,IAAI;GACJ,KAAK,MAAM,QAAQ,KAAK,OAAO,MAAM,EAAC,WAAU,CAAC,GAAG;IAClD,IAAI,SAAS,SAAS;KACpB,MAAM;KACN;IACF;IACA,MAAM,SAAS,YAAY,KAAK,KAAK,KAAK,WAAW;IACrD,IAAI,CAAC,MAAM,IAAI,MAAM,GAAG;KACtB,cAAc;KACd;IACF;GACF;GAEA,IAAI,aAAa;IAGf,KAAK,SAAS,IAAI,aAAa;KAAC,MAAM;KAAS;IAAG,CAAC;IACnD,OAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;IAErC,MAAM,gBAAgB,YAAY,YAAY,KAAK,KAAK,WAAW;IACnE,IAAI,KAAK,aAAa;IACtB,KAAK,SAAS,IAAI,aAAa;KAAC,MAAM,UAAU;KAAG;IAAG,CAAC;IACvD,OAAO,KAAK,QAAQ,KAAK,cAAc,WAAW,GAAG,IAAI;GAC3D,OAAO;IACL,KAAK,SAAS,IAAI,aAAa;KAAC,MAAM;KAAS;IAAG,CAAC;IACnD,OAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;GACvC;EACF,OAAO,IAAI,OAAO,OAAsB,GAElC;OAAA,IADc,IAAI,SAAS,GAC3B,CAAA,CAAM,IAAI,EAAE,GACd,OAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;EAAA;CAG3C;CAEA,gBAAgB,QAAqC;EACnD,OACE,CAAC,KAAK,2BACJ,KAAK,wBACH,OAAO,EAAqB,CAAC,KAC7B,OAAO,EAAiB,CAAC,GAC3B,MAAM,GACR,oCACF;EACA,MAAM,cAAc,eAClB,KAAK,eACL,OAAO,EAAqB,CAAC,GAC/B;EACA,MAAM,WAAW,KAAK,SAAS,IAAI,WAAW;EAC9C,IAAI,CAAC,UACH,OAAO;EAGT,MAAM,QAAQ,YACZ,OAAO,EAAqB,CAAC,KAC7B,KAAK,WACP;EAEA,IAAI,IADc,IAAI,SAAS,GAC3B,CAAA,CAAM,IAAI,KAAK,GAAG;GAEpB,MAAM,QAAQ,YAAY,OAAO,EAAiB,CAAC,KAAK,KAAK,WAAW;GACxE,IAAI,UAAU,OAAO;IACnB,MAAM,MAAM,SAAS,IAAI,KAAI,MAAM,MAAM,QAAQ,QAAQ,CAAE;IAC3D,KAAK,SAAS,IAAI,aAAa;KAAC,MAAM,SAAS;KAAM;IAAG,CAAC;GAC3D;GACA,OAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;EACvC;EAEA,OAAO;CACT;CAEA,UAAgB;EACd,KAAK,OAAO,QAAQ;EACpB,KAAK,SAAS,QAAQ;CACxB;CAEA,CAAC,UAAU,SAAqC;EAC9C,IAAI,KAAK,QAAQ,WACf,OAAO,KAAK,QAAQ,UAAU,IAAI;CAEtC;AACF;AAEA,SAAS,eACP,cACA,iBACQ;CACR,MAAM,kBAA2B,CAAC;CAElC,IAAI,gBAAgB,iBAClB,KAAK,MAAM,OAAO,cAChB,gBAAgB,KAAK,gBAAgB,IAAI;CAI7C,OAAO,KAAK,UAAU,CAAC,OAAO,GAAG,eAAe,CAAC;AACnD;AAEA,SAAS,YAAY,KAAU,YAAgC;CAC7D,OAAO,KAAK,UAAU,WAAW,KAAI,MAAK,IAAI,EAAE,CAAC;AACnD;AAEA,SAAS,0BACP,IACA,YACY;CACZ,MAAM,SAAS,KAAK,MAAM,EAAE;CAC5B,MAAM,aAAoC,CAAC;CAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KACrC,WAAW,WAAW,MAAM,OAAO;CAErC,OAAO;AACT"}

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

@@ -77,6 +77,6 @@ function extractColumn(condition) {
 	}
 }
 //#endregion
-export { constraintMatchesPrimaryKey, constraintMatchesRow, constraintsAreCompatible, primaryKeyConstraintFromFilters };
+export { constraintMatchesPrimaryKey, constraintMatchesRow, constraintsAreCompatible, keyMatchesPrimaryKey, primaryKeyConstraintFromFilters, pullSimpleAndComponents };
 
 //# sourceMappingURL=constraint.js.map

package/out/zql/src/ivm/constraint.js.map

@@ -1 +1 @@
-{"version":3,"file":"constraint.js","names":["#data","#indexOf"],"sources":["../../../../../zql/src/ivm/constraint.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {stringCompare} from '../../../shared/src/string-compare.ts';\nimport {assertTesting} from '../../../shared/src/testing.ts';\nimport type {Writable} from '../../../shared/src/writable.ts';\nimport type {\n  Condition,\n  SimpleCondition,\n} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\nimport {valuesEqual} from './data.ts';\n\nexport type Constraint = {\n  readonly [key: string]: Value;\n};\n\nexport function constraintMatchesRow(\n  constraint: Constraint,\n  row: Row,\n): boolean {\n  for (const key in constraint) {\n    if (!valuesEqual(row[key], constraint[key])) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * Constraints are compatible if:\n * 1. They do not have any keys in common\n * 2. They have keys in common, but the values for those keys are equal\n */\nexport function constraintsAreCompatible(\n  left: Constraint,\n  right: Constraint,\n): boolean {\n  for (const key in left) {\n    if (key in right && !valuesEqual(left[key], right[key])) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function constraintMatchesPrimaryKey(\n  constraint: Constraint,\n  primary: PrimaryKey,\n): boolean {\n  return keyMatchesPrimaryKey(Object.keys(constraint), primary);\n}\n\nexport function keyMatchesPrimaryKey(\n  key: Iterable<string>,\n  primary: PrimaryKey,\n): boolean {\n  const constraintKeys = [...key];\n\n  if (constraintKeys.length !== primary.length) {\n    return false;\n  }\n\n  // Primary key is always sorted\n  // Constraint does not have to be sorted\n  constraintKeys.sort(stringCompare);\n\n  for (let i = 0; i < constraintKeys.length; i++) {\n    if (constraintKeys[i] !== primary[i]) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * Pulls top level `and` components out of a condition tree.\n * The resulting array of simple conditions would match a superset of\n * values that the original condition would match.\n *\n * Examples:\n * a AND b OR c\n *\n * In this case we cannot pull anything because the `or` is at the top level.\n *\n * a AND b AND c\n * We can pull all three.\n *\n * a AND (b OR c)\n * We can only pull `a`.\n */\nexport function pullSimpleAndComponents(\n  condition: Condition,\n): SimpleCondition[] {\n  if (condition.type === 'and') {\n    return condition.conditions.flatMap(pullSimpleAndComponents);\n  }\n\n  if (condition.type === 'simple') {\n    return [condition];\n  }\n\n  if (condition.type === 'or' && condition.conditions.length === 1) {\n    return pullSimpleAndComponents(condition.conditions[0]);\n  }\n\n  return [];\n}\n\n/**\n * Checks if the supplied filters constitute a primary key lookup.\n * If so, returns the constraint that would be used to look up the primary key.\n * If not, returns undefined.\n */\nexport function primaryKeyConstraintFromFilters(\n  condition: Condition | undefined,\n  primary: PrimaryKey,\n): Constraint | undefined {\n  if (condition === undefined) {\n    return undefined;\n  }\n\n  const conditions = pullSimpleAndComponents(condition);\n  if (conditions.length === 0) {\n    return undefined;\n  }\n\n  const ret: Writable<Constraint> = {};\n  for (const subCondition of conditions) {\n    if (subCondition.op === '=') {\n      const column = extractColumn(subCondition);\n      if (column !== undefined) {\n        if (!primary.includes(column.name)) {\n          continue;\n        }\n        ret[column.name] = column.value;\n      }\n    }\n  }\n\n  if (Object.keys(ret).length !== primary.length) {\n    return undefined;\n  }\n\n  return ret;\n}\n\nfunction extractColumn(\n  condition: SimpleCondition,\n): {name: string; value: Value} | undefined {\n  if (condition.left.type === 'column') {\n    assert(\n      condition.right.type === 'literal',\n      () =>\n        `extractColumn: expected right side to be literal, got ${condition.right.type}`,\n    );\n    return {name: condition.left.name, value: condition.right.value};\n  }\n\n  return undefined;\n}\n\nexport class SetOfConstraint {\n  #data: Constraint[] = [];\n\n  constructor() {\n    assertTesting('SetOfConstraint is only available in testing');\n  }\n\n  #indexOf(value: Constraint): number {\n    return this.#data.findIndex(v => constraintEquals(v, value));\n  }\n\n  has(value: Constraint): boolean {\n    return this.#indexOf(value) !== -1;\n  }\n\n  add(value: Constraint): this {\n    if (!this.has(value)) {\n      this.#data.push(value);\n    }\n    return this;\n  }\n}\n\nfunction constraintEquals(a: Constraint, b: Constraint): boolean {\n  const aEntries = Object.entries(a);\n  const bEntries = Object.entries(b);\n  if (aEntries.length !== bEntries.length) {\n    return false;\n  }\n  for (let i = 0; i < aEntries.length; i++) {\n    if (\n      aEntries[i][0] !== bEntries[i][0] ||\n      !valuesEqual(aEntries[i][1], bEntries[i][1])\n    ) {\n      return false;\n    }\n  }\n  return true;\n}\n"],"mappings":";;;;AAgBA,SAAgB,qBACd,YACA,KACS;CACT,KAAK,MAAM,OAAO,YAChB,IAAI,CAAC,YAAY,IAAI,MAAM,WAAW,IAAI,GACxC,OAAO;CAGX,OAAO;AACT;;;;;;AAOA,SAAgB,yBACd,MACA,OACS;CACT,KAAK,MAAM,OAAO,MAChB,IAAI,OAAO,SAAS,CAAC,YAAY,KAAK,MAAM,MAAM,IAAI,GACpD,OAAO;CAGX,OAAO;AACT;AAEA,SAAgB,4BACd,YACA,SACS;CACT,OAAO,qBAAqB,OAAO,KAAK,UAAU,GAAG,OAAO;AAC9D;AAEA,SAAgB,qBACd,KACA,SACS;CACT,MAAM,iBAAiB,CAAC,GAAG,GAAG;CAE9B,IAAI,eAAe,WAAW,QAAQ,QACpC,OAAO;CAKT,eAAe,KAAK,aAAa;CAEjC,KAAK,IAAI,IAAI,GAAG,IAAI,eAAe,QAAQ,KACzC,IAAI,eAAe,OAAO,QAAQ,IAChC,OAAO;CAGX,OAAO;AACT;;;;;;;;;;;;;;;;;AAkBA,SAAgB,wBACd,WACmB;CACnB,IAAI,UAAU,SAAS,OACrB,OAAO,UAAU,WAAW,QAAQ,uBAAuB;CAG7D,IAAI,UAAU,SAAS,UACrB,OAAO,CAAC,SAAS;CAGnB,IAAI,UAAU,SAAS,QAAQ,UAAU,WAAW,WAAW,GAC7D,OAAO,wBAAwB,UAAU,WAAW,EAAE;CAGxD,OAAO,CAAC;AACV;;;;;;AAOA,SAAgB,gCACd,WACA,SACwB;CACxB,IAAI,cAAc,KAAA,GAChB;CAGF,MAAM,aAAa,wBAAwB,SAAS;CACpD,IAAI,WAAW,WAAW,GACxB;CAGF,MAAM,MAA4B,CAAC;CACnC,KAAK,MAAM,gBAAgB,YACzB,IAAI,aAAa,OAAO,KAAK;EAC3B,MAAM,SAAS,cAAc,YAAY;EACzC,IAAI,WAAW,KAAA,GAAW;GACxB,IAAI,CAAC,QAAQ,SAAS,OAAO,IAAI,GAC/B;GAEF,IAAI,OAAO,QAAQ,OAAO;EAC5B;CACF;CAGF,IAAI,OAAO,KAAK,GAAG,EAAE,WAAW,QAAQ,QACtC;CAGF,OAAO;AACT;AAEA,SAAS,cACP,WAC0C;CAC1C,IAAI,UAAU,KAAK,SAAS,UAAU;EACpC,OACE,UAAU,MAAM,SAAS,iBAEvB,yDAAyD,UAAU,MAAM,MAC7E;EACA,OAAO;GAAC,MAAM,UAAU,KAAK;GAAM,OAAO,UAAU,MAAM;EAAK;CACjE;AAGF"}
+{"version":3,"file":"constraint.js","names":[],"sources":["../../../../../zql/src/ivm/constraint.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {stringCompare} from '../../../shared/src/string-compare.ts';\nimport {assertTesting} from '../../../shared/src/testing.ts';\nimport type {Writable} from '../../../shared/src/writable.ts';\nimport type {\n  Condition,\n  SimpleCondition,\n} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\nimport {valuesEqual} from './data.ts';\n\nexport type Constraint = {\n  readonly [key: string]: Value;\n};\n\nexport function constraintMatchesRow(\n  constraint: Constraint,\n  row: Row,\n): boolean {\n  for (const key in constraint) {\n    if (!valuesEqual(row[key], constraint[key])) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * Constraints are compatible if:\n * 1. They do not have any keys in common\n * 2. They have keys in common, but the values for those keys are equal\n */\nexport function constraintsAreCompatible(\n  left: Constraint,\n  right: Constraint,\n): boolean {\n  for (const key in left) {\n    if (key in right && !valuesEqual(left[key], right[key])) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function constraintMatchesPrimaryKey(\n  constraint: Constraint,\n  primary: PrimaryKey,\n): boolean {\n  return keyMatchesPrimaryKey(Object.keys(constraint), primary);\n}\n\nexport function keyMatchesPrimaryKey(\n  key: Iterable<string>,\n  primary: PrimaryKey,\n): boolean {\n  const constraintKeys = [...key];\n\n  if (constraintKeys.length !== primary.length) {\n    return false;\n  }\n\n  // Primary key is always sorted\n  // Constraint does not have to be sorted\n  constraintKeys.sort(stringCompare);\n\n  for (let i = 0; i < constraintKeys.length; i++) {\n    if (constraintKeys[i] !== primary[i]) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * Pulls top level `and` components out of a condition tree.\n * The resulting array of simple conditions would match a superset of\n * values that the original condition would match.\n *\n * Examples:\n * a AND b OR c\n *\n * In this case we cannot pull anything because the `or` is at the top level.\n *\n * a AND b AND c\n * We can pull all three.\n *\n * a AND (b OR c)\n * We can only pull `a`.\n */\nexport function pullSimpleAndComponents(\n  condition: Condition,\n): SimpleCondition[] {\n  if (condition.type === 'and') {\n    return condition.conditions.flatMap(pullSimpleAndComponents);\n  }\n\n  if (condition.type === 'simple') {\n    return [condition];\n  }\n\n  if (condition.type === 'or' && condition.conditions.length === 1) {\n    return pullSimpleAndComponents(condition.conditions[0]);\n  }\n\n  return [];\n}\n\n/**\n * Checks if the supplied filters constitute a primary key lookup.\n * If so, returns the constraint that would be used to look up the primary key.\n * If not, returns undefined.\n */\nexport function primaryKeyConstraintFromFilters(\n  condition: Condition | undefined,\n  primary: PrimaryKey,\n): Constraint | undefined {\n  if (condition === undefined) {\n    return undefined;\n  }\n\n  const conditions = pullSimpleAndComponents(condition);\n  if (conditions.length === 0) {\n    return undefined;\n  }\n\n  const ret: Writable<Constraint> = {};\n  for (const subCondition of conditions) {\n    if (subCondition.op === '=') {\n      const column = extractColumn(subCondition);\n      if (column !== undefined) {\n        if (!primary.includes(column.name)) {\n          continue;\n        }\n        ret[column.name] = column.value;\n      }\n    }\n  }\n\n  if (Object.keys(ret).length !== primary.length) {\n    return undefined;\n  }\n\n  return ret;\n}\n\nfunction extractColumn(\n  condition: SimpleCondition,\n): {name: string; value: Value} | undefined {\n  if (condition.left.type === 'column') {\n    assert(\n      condition.right.type === 'literal',\n      () =>\n        `extractColumn: expected right side to be literal, got ${condition.right.type}`,\n    );\n    return {name: condition.left.name, value: condition.right.value};\n  }\n\n  return undefined;\n}\n\nexport class SetOfConstraint {\n  #data: Constraint[] = [];\n\n  constructor() {\n    assertTesting('SetOfConstraint is only available in testing');\n  }\n\n  #indexOf(value: Constraint): number {\n    return this.#data.findIndex(v => constraintEquals(v, value));\n  }\n\n  has(value: Constraint): boolean {\n    return this.#indexOf(value) !== -1;\n  }\n\n  add(value: Constraint): this {\n    if (!this.has(value)) {\n      this.#data.push(value);\n    }\n    return this;\n  }\n}\n\nfunction constraintEquals(a: Constraint, b: Constraint): boolean {\n  const aEntries = Object.entries(a);\n  const bEntries = Object.entries(b);\n  if (aEntries.length !== bEntries.length) {\n    return false;\n  }\n  for (let i = 0; i < aEntries.length; i++) {\n    if (\n      aEntries[i][0] !== bEntries[i][0] ||\n      !valuesEqual(aEntries[i][1], bEntries[i][1])\n    ) {\n      return false;\n    }\n  }\n  return true;\n}\n"],"mappings":";;;;AAgBA,SAAgB,qBACd,YACA,KACS;CACT,KAAK,MAAM,OAAO,YAChB,IAAI,CAAC,YAAY,IAAI,MAAM,WAAW,IAAI,GACxC,OAAO;CAGX,OAAO;AACT;;;;;;AAOA,SAAgB,yBACd,MACA,OACS;CACT,KAAK,MAAM,OAAO,MAChB,IAAI,OAAO,SAAS,CAAC,YAAY,KAAK,MAAM,MAAM,IAAI,GACpD,OAAO;CAGX,OAAO;AACT;AAEA,SAAgB,4BACd,YACA,SACS;CACT,OAAO,qBAAqB,OAAO,KAAK,UAAU,GAAG,OAAO;AAC9D;AAEA,SAAgB,qBACd,KACA,SACS;CACT,MAAM,iBAAiB,CAAC,GAAG,GAAG;CAE9B,IAAI,eAAe,WAAW,QAAQ,QACpC,OAAO;CAKT,eAAe,KAAK,aAAa;CAEjC,KAAK,IAAI,IAAI,GAAG,IAAI,eAAe,QAAQ,KACzC,IAAI,eAAe,OAAO,QAAQ,IAChC,OAAO;CAGX,OAAO;AACT;;;;;;;;;;;;;;;;;AAkBA,SAAgB,wBACd,WACmB;CACnB,IAAI,UAAU,SAAS,OACrB,OAAO,UAAU,WAAW,QAAQ,uBAAuB;CAG7D,IAAI,UAAU,SAAS,UACrB,OAAO,CAAC,SAAS;CAGnB,IAAI,UAAU,SAAS,QAAQ,UAAU,WAAW,WAAW,GAC7D,OAAO,wBAAwB,UAAU,WAAW,EAAE;CAGxD,OAAO,CAAC;AACV;;;;;;AAOA,SAAgB,gCACd,WACA,SACwB;CACxB,IAAI,cAAc,KAAA,GAChB;CAGF,MAAM,aAAa,wBAAwB,SAAS;CACpD,IAAI,WAAW,WAAW,GACxB;CAGF,MAAM,MAA4B,CAAC;CACnC,KAAK,MAAM,gBAAgB,YACzB,IAAI,aAAa,OAAO,KAAK;EAC3B,MAAM,SAAS,cAAc,YAAY;EACzC,IAAI,WAAW,KAAA,GAAW;GACxB,IAAI,CAAC,QAAQ,SAAS,OAAO,IAAI,GAC/B;GAEF,IAAI,OAAO,QAAQ,OAAO;EAC5B;CACF;CAGF,IAAI,OAAO,KAAK,GAAG,CAAC,CAAC,WAAW,QAAQ,QACtC;CAGF,OAAO;AACT;AAEA,SAAS,cACP,WAC0C;CAC1C,IAAI,UAAU,KAAK,SAAS,UAAU;EACpC,OACE,UAAU,MAAM,SAAS,iBAEvB,yDAAyD,UAAU,MAAM,MAC7E;EACA,OAAO;GAAC,MAAM,UAAU,KAAK;GAAM,OAAO,UAAU,MAAM;EAAK;CACjE;AAGF"}

package/out/zql/src/ivm/data.js.map

@@ -1 +1 @@
-{"version":3,"file":"data.js","names":[],"sources":["../../../../../zql/src/ivm/data.ts"],"sourcesContent":["import {compareUTF8} from 'compare-utf8';\nimport type {Ordering} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {Stream} from './stream.ts';\n\n/**\n * A row flowing through the pipeline, plus its relationships.\n * Relationships are generated lazily as read.\n */\nexport type Node = {\n  row: Row;\n  /**\n   * Relationships are generated lazily as read.\n   * The stream may contain 'yield' to indicate the operator has yielded control.\n   * See {@link Operator.fetch} for more details about yields.\n   */\n  relationships: Record<string, () => Stream<Node | 'yield'>>;\n};\n\n/**\n * Compare two values. The values must be of the same type. This function\n * throws at runtime if the types differ.\n *\n * Note, this function considers `null === null` and\n * `undefined === undefined`. This is different than SQL. In join code,\n * null must be treated separately.\n *\n * See: https://github.com/rocicorp/mono/pull/2116/files#r1704811479\n *\n * @returns < 0 if a < b, 0 if a === b, > 0 if a > b\n */\nexport function compareValues(a: Value, b: Value): number {\n  a = a ?? null;\n  b = b ?? null;\n\n  if (a === b) {\n    return 0;\n  }\n\n  if (typeof a === 'string' && typeof b === 'string') {\n    // We compare all strings in Zero as UTF-8. This is the default on SQLite\n    // and we need to match it. See:\n    // https://blog.replicache.dev/blog/replicache-11-adventures-in-text-encoding.\n    //\n    // TODO: We could change this since SQLite supports UTF-16. Microbenchmark\n    // to see if there's a big win.\n    //\n    // https://www.sqlite.org/c3ref/create_collation.html\n    return compareUTF8(a, b);\n  }\n\n  if (typeof a === 'number' && typeof b === 'number') {\n    return a - b;\n  }\n\n  if (typeof a === 'boolean' && typeof b === 'boolean') {\n    return a ? 1 : -1;\n  }\n\n  // check with null after since it is less likely to be the common case and we\n  // want to avoid the extra checks in that case\n  if (a === null) {\n    return -1;\n  }\n  if (b === null) {\n    return 1;\n  }\n\n  if (typeof a !== typeof b) {\n    throw new Error(\n      `Cannot compare values of different types: ${typeof a} and ${typeof b}`,\n    );\n  }\n\n  throw new Error(`Unsupported type: ${typeof a}`);\n}\n\nexport type NormalizedValue = Exclude<Value, undefined>;\n\n/**\n * We allow undefined to be passed for the convenience of developers, but we\n * treat it equivalently to null. It's better for perf to not create an copy\n * of input values, so we just normalize at use when necessary.\n */\nexport function normalizeUndefined(v: Value): NormalizedValue {\n  return v ?? null;\n}\n\nexport type Comparator = (r1: Row, r2: Row) => number;\n\nexport function makeComparator(order: Ordering, reverse?: boolean): Comparator {\n  // A single ascending field is the common shape -- it is what every source\n  // ordered by a single-column primary key gets -- and specializing it drops\n  // the loop, the direction test and the reverse test from the hottest\n  // function in hydration.\n  if (order.length === 1 && order[0][1] === 'asc' && !reverse) {\n    const field = order[0][0];\n    return (a, b) => compareValues(a[field], b[field]);\n  }\n\n  const length = order.length;\n  return (a, b) => {\n    // Skip destructuring here since it is hot code. An indexed loop rather\n    // than `for...of` for the same reason: Hermes allocates an iterator and\n    // calls `next()` per element, which costs more than the comparison for an\n    // ordering this short.\n    for (let i = 0; i < length; i++) {\n      const ord = order[i];\n      const comp = compareValues(a[ord[0]], b[ord[0]]);\n      if (comp !== 0) {\n        const result = ord[1] === 'asc' ? comp : -comp;\n        return reverse ? -result : result;\n      }\n    }\n    return 0;\n  };\n}\n\n/**\n * Determine if two values are equal. Note that unlike compareValues() above,\n * this function treats `null` as unequal to itself (and same for `undefined`).\n * This is required to make joins work correctly, but may not be the right\n * semantic for your application.\n */\nexport function valuesEqual(a: Value, b: Value): boolean {\n  // oxlint-disable-next-line eqeqeq\n  if (a == null || b == null) {\n    return false;\n  }\n  return a === b;\n}\n\nexport function drainStreams(node: Node | 'yield') {\n  if (node === 'yield') {\n    return;\n  }\n  for (const stream of Object.values(node.relationships)) {\n    for (const node of stream()) {\n      drainStreams(node);\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;AA+BA,SAAgB,cAAc,GAAU,GAAkB;CACxD,IAAI,KAAK;CACT,IAAI,KAAK;CAET,IAAI,MAAM,GACR,OAAO;CAGT,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UASxC,OAAO,YAAY,GAAG,CAAC;CAGzB,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO,IAAI;CAGb,IAAI,OAAO,MAAM,aAAa,OAAO,MAAM,WACzC,OAAO,IAAI,IAAI;CAKjB,IAAI,MAAM,MACR,OAAO;CAET,IAAI,MAAM,MACR,OAAO;CAGT,IAAI,OAAO,MAAM,OAAO,GACtB,MAAM,IAAI,MACR,6CAA6C,OAAO,EAAE,OAAO,OAAO,GACtE;CAGF,MAAM,IAAI,MAAM,qBAAqB,OAAO,GAAG;AACjD;;;;;;AASA,SAAgB,mBAAmB,GAA2B;CAC5D,OAAO,KAAK;AACd;AAIA,SAAgB,eAAe,OAAiB,SAA+B;CAK7E,IAAI,MAAM,WAAW,KAAK,MAAM,GAAG,OAAO,SAAS,CAAC,SAAS;EAC3D,MAAM,QAAQ,MAAM,GAAG;EACvB,QAAQ,GAAG,MAAM,cAAc,EAAE,QAAQ,EAAE,MAAM;CACnD;CAEA,MAAM,SAAS,MAAM;CACrB,QAAQ,GAAG,MAAM;EAKf,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC/B,MAAM,MAAM,MAAM;GAClB,MAAM,OAAO,cAAc,EAAE,IAAI,KAAK,EAAE,IAAI,GAAG;GAC/C,IAAI,SAAS,GAAG;IACd,MAAM,SAAS,IAAI,OAAO,QAAQ,OAAO,CAAC;IAC1C,OAAO,UAAU,CAAC,SAAS;GAC7B;EACF;EACA,OAAO;CACT;AACF;;;;;;;AAQA,SAAgB,YAAY,GAAU,GAAmB;CAEvD,IAAI,KAAK,QAAQ,KAAK,MACpB,OAAO;CAET,OAAO,MAAM;AACf"}
+{"version":3,"file":"data.js","names":[],"sources":["../../../../../zql/src/ivm/data.ts"],"sourcesContent":["import {compareUTF8} from 'compare-utf8';\nimport type {Ordering} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {Stream} from './stream.ts';\n\n/**\n * A row flowing through the pipeline, plus its relationships.\n * Relationships are generated lazily as read.\n */\nexport type Node = {\n  row: Row;\n  /**\n   * Relationships are generated lazily as read.\n   * The stream may contain 'yield' to indicate the operator has yielded control.\n   * See {@link Operator.fetch} for more details about yields.\n   */\n  relationships: Record<string, () => Stream<Node | 'yield'>>;\n};\n\n/**\n * Compare two values. The values must be of the same type. This function\n * throws at runtime if the types differ.\n *\n * Note, this function considers `null === null` and\n * `undefined === undefined`. This is different than SQL. In join code,\n * null must be treated separately.\n *\n * See: https://github.com/rocicorp/mono/pull/2116/files#r1704811479\n *\n * @returns < 0 if a < b, 0 if a === b, > 0 if a > b\n */\nexport function compareValues(a: Value, b: Value): number {\n  a = a ?? null;\n  b = b ?? null;\n\n  if (a === b) {\n    return 0;\n  }\n\n  if (typeof a === 'string' && typeof b === 'string') {\n    // We compare all strings in Zero as UTF-8. This is the default on SQLite\n    // and we need to match it. See:\n    // https://blog.replicache.dev/blog/replicache-11-adventures-in-text-encoding.\n    //\n    // TODO: We could change this since SQLite supports UTF-16. Microbenchmark\n    // to see if there's a big win.\n    //\n    // https://www.sqlite.org/c3ref/create_collation.html\n    return compareUTF8(a, b);\n  }\n\n  if (typeof a === 'number' && typeof b === 'number') {\n    return a - b;\n  }\n\n  if (typeof a === 'boolean' && typeof b === 'boolean') {\n    return a ? 1 : -1;\n  }\n\n  // check with null after since it is less likely to be the common case and we\n  // want to avoid the extra checks in that case\n  if (a === null) {\n    return -1;\n  }\n  if (b === null) {\n    return 1;\n  }\n\n  if (typeof a !== typeof b) {\n    throw new Error(\n      `Cannot compare values of different types: ${typeof a} and ${typeof b}`,\n    );\n  }\n\n  throw new Error(`Unsupported type: ${typeof a}`);\n}\n\nexport type NormalizedValue = Exclude<Value, undefined>;\n\n/**\n * We allow undefined to be passed for the convenience of developers, but we\n * treat it equivalently to null. It's better for perf to not create an copy\n * of input values, so we just normalize at use when necessary.\n */\nexport function normalizeUndefined(v: Value): NormalizedValue {\n  return v ?? null;\n}\n\nexport type Comparator = (r1: Row, r2: Row) => number;\n\nexport function makeComparator(order: Ordering, reverse?: boolean): Comparator {\n  // A single ascending field is the common shape -- it is what every source\n  // ordered by a single-column primary key gets -- and specializing it drops\n  // the loop, the direction test and the reverse test from the hottest\n  // function in hydration.\n  if (order.length === 1 && order[0][1] === 'asc' && !reverse) {\n    const field = order[0][0];\n    return (a, b) => compareValues(a[field], b[field]);\n  }\n\n  const length = order.length;\n  return (a, b) => {\n    // Skip destructuring here since it is hot code. An indexed loop rather\n    // than `for...of` for the same reason: Hermes allocates an iterator and\n    // calls `next()` per element, which costs more than the comparison for an\n    // ordering this short.\n    for (let i = 0; i < length; i++) {\n      const ord = order[i];\n      const comp = compareValues(a[ord[0]], b[ord[0]]);\n      if (comp !== 0) {\n        const result = ord[1] === 'asc' ? comp : -comp;\n        return reverse ? -result : result;\n      }\n    }\n    return 0;\n  };\n}\n\n/**\n * Determine if two values are equal. Note that unlike compareValues() above,\n * this function treats `null` as unequal to itself (and same for `undefined`).\n * This is required to make joins work correctly, but may not be the right\n * semantic for your application.\n */\nexport function valuesEqual(a: Value, b: Value): boolean {\n  // oxlint-disable-next-line eqeqeq\n  if (a == null || b == null) {\n    return false;\n  }\n  return a === b;\n}\n\nexport function drainStreams(node: Node | 'yield') {\n  if (node === 'yield') {\n    return;\n  }\n  for (const stream of Object.values(node.relationships)) {\n    for (const node of stream()) {\n      drainStreams(node);\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;AA+BA,SAAgB,cAAc,GAAU,GAAkB;CACxD,IAAI,KAAK;CACT,IAAI,KAAK;CAET,IAAI,MAAM,GACR,OAAO;CAGT,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UASxC,OAAO,YAAY,GAAG,CAAC;CAGzB,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO,IAAI;CAGb,IAAI,OAAO,MAAM,aAAa,OAAO,MAAM,WACzC,OAAO,IAAI,IAAI;CAKjB,IAAI,MAAM,MACR,OAAO;CAET,IAAI,MAAM,MACR,OAAO;CAGT,IAAI,OAAO,MAAM,OAAO,GACtB,MAAM,IAAI,MACR,6CAA6C,OAAO,EAAE,OAAO,OAAO,GACtE;CAGF,MAAM,IAAI,MAAM,qBAAqB,OAAO,GAAG;AACjD;;;;;;AASA,SAAgB,mBAAmB,GAA2B;CAC5D,OAAO,KAAK;AACd;AAIA,SAAgB,eAAe,OAAiB,SAA+B;CAK7E,IAAI,MAAM,WAAW,KAAK,MAAM,EAAE,CAAC,OAAO,SAAS,CAAC,SAAS;EAC3D,MAAM,QAAQ,MAAM,EAAE,CAAC;EACvB,QAAQ,GAAG,MAAM,cAAc,EAAE,QAAQ,EAAE,MAAM;CACnD;CAEA,MAAM,SAAS,MAAM;CACrB,QAAQ,GAAG,MAAM;EAKf,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;GAC/B,MAAM,MAAM,MAAM;GAClB,MAAM,OAAO,cAAc,EAAE,IAAI,KAAK,EAAE,IAAI,GAAG;GAC/C,IAAI,SAAS,GAAG;IACd,MAAM,SAAS,IAAI,OAAO,QAAQ,OAAO,CAAC;IAC1C,OAAO,UAAU,CAAC,SAAS;GAC7B;EACF;EACA,OAAO;CACT;AACF;;;;;;;AAQA,SAAgB,YAAY,GAAU,GAAmB;CAEvD,IAAI,KAAK,QAAQ,KAAK,MACpB,OAAO;CAET,OAAO,MAAM;AACf"}

package/out/zql/src/ivm/deferred-input.js.map

@@ -1 +1 @@
-{"version":3,"file":"deferred-input.js","names":["#schema","#build","#input","#destroyed","#output"],"sources":["../../../../../zql/src/ivm/deferred-input.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {emptyArray} from '../../../shared/src/sentinels.ts';\nimport {makeAddChange} from './change.ts';\nimport type {Node} from './data.ts';\nimport type {FetchRequest, Input, Output} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {consume, type Stream} from './stream.ts';\n\n/**\n * A placeholder `Input` for a view whose pipeline has not been built yet.\n *\n * Until {@link attach} is called it behaves like an empty pipeline: `fetch`\n * yields nothing and pushes never happen. When the real pipeline is attached\n * the view is hydrated with a single `fetch`, whose rows are delivered to the\n * view as add changes, so the view sees the data exactly as it would see rows\n * arriving incrementally.\n *\n * This lets `materialize()` stay synchronous and return a view immediately\n * while the expensive pipeline construction and hydration are postponed, for\n * example until the client's replica has been loaded into the IVM sources.\n */\nexport class DeferredInput implements Input {\n  readonly #schema: SourceSchema;\n  readonly #build: () => Input;\n  #output: Output | undefined;\n  #input: Input | undefined;\n  #destroyed = false;\n\n  /**\n   * @param schema The schema the built pipeline reports. Passed in so this\n   *   input can answer `getSchema()` unconditionally, as the `Input` contract\n   *   requires, before its pipeline exists.\n   * @param build Builds the real pipeline. Called once, from {@link attach}.\n   */\n  constructor(schema: SourceSchema, build: () => Input) {\n    this.#schema = schema;\n    this.#build = build;\n  }\n\n  get attached(): boolean {\n    return this.#input !== undefined;\n  }\n\n  get destroyed(): boolean {\n    return this.#destroyed;\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n    this.#input?.setOutput(output);\n  }\n\n  getSchema(): SourceSchema {\n    return this.#schema;\n  }\n\n  fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    return this.#input ? this.#input.fetch(req) : emptyArray;\n  }\n\n  destroy(): void {\n    this.#destroyed = true;\n    this.#input?.destroy();\n  }\n\n  /**\n   * Build the real pipeline and hydrate the output with its current contents.\n   *\n   * Must be called inside the delegate's `batchViewUpdates`; the delegate is\n   * responsible for notifying commit listeners afterwards so views flush.\n   *\n   * If building or hydrating throws, the pipeline is torn down again and this\n   * input stays unattached so the caller can report the failure.\n   */\n  attach(): void {\n    assert(!this.#input, 'DeferredInput: pipeline already attached');\n    assert(!this.#destroyed, 'DeferredInput: cannot attach after destroy');\n    const input = this.#build();\n    const output = this.#output;\n    if (!output) {\n      // The view never asked for output; there is nothing to hydrate.\n      this.#input = input;\n      return;\n    }\n    try {\n      input.setOutput(output);\n      for (const node of input.fetch({})) {\n        if (node === 'yield') {\n          continue;\n        }\n        consume(output.push(makeAddChange(node), input));\n      }\n    } catch (e) {\n      input.destroy();\n      throw e;\n    }\n    this.#input = input;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAqBA,IAAa,gBAAb,MAA4C;CAC1C;CACA;CACA;CACA;CACA,aAAa;;;;;;;CAQb,YAAY,QAAsB,OAAoB;EACpD,KAAKA,UAAU;EACf,KAAKC,SAAS;CAChB;CAEA,IAAI,WAAoB;EACtB,OAAO,KAAKC,WAAW,KAAA;CACzB;CAEA,IAAI,YAAqB;EACvB,OAAO,KAAKC;CACd;CAEA,UAAU,QAAsB;EAC9B,KAAKC,UAAU;EACf,KAAKF,QAAQ,UAAU,MAAM;CAC/B;CAEA,YAA0B;EACxB,OAAO,KAAKF;CACd;CAEA,MAAM,KAA2C;EAC/C,OAAO,KAAKE,SAAS,KAAKA,OAAO,MAAM,GAAG,IAAI;CAChD;CAEA,UAAgB;EACd,KAAKC,aAAa;EAClB,KAAKD,QAAQ,QAAQ;CACvB;;;;;;;;;;CAWA,SAAe;EACb,OAAO,CAAC,KAAKA,QAAQ,0CAA0C;EAC/D,OAAO,CAAC,KAAKC,YAAY,4CAA4C;EACrE,MAAM,QAAQ,KAAKF,OAAO;EAC1B,MAAM,SAAS,KAAKG;EACpB,IAAI,CAAC,QAAQ;GAEX,KAAKF,SAAS;GACd;EACF;EACA,IAAI;GACF,MAAM,UAAU,MAAM;GACtB,KAAK,MAAM,QAAQ,MAAM,MAAM,CAAC,CAAC,GAAG;IAClC,IAAI,SAAS,SACX;IAEF,QAAQ,OAAO,KAAK,cAAc,IAAI,GAAG,KAAK,CAAC;GACjD;EACF,SAAS,GAAG;GACV,MAAM,QAAQ;GACd,MAAM;EACR;EACA,KAAKA,SAAS;CAChB;AACF"}
+{"version":3,"file":"deferred-input.js","names":[],"sources":["../../../../../zql/src/ivm/deferred-input.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {emptyArray} from '../../../shared/src/sentinels.ts';\nimport {makeAddChange} from './change.ts';\nimport type {Node} from './data.ts';\nimport type {FetchRequest, Input, Output} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {consume, type Stream} from './stream.ts';\n\n/**\n * A placeholder `Input` for a view whose pipeline has not been built yet.\n *\n * Until {@link attach} is called it behaves like an empty pipeline: `fetch`\n * yields nothing and pushes never happen. When the real pipeline is attached\n * the view is hydrated with a single `fetch`, whose rows are delivered to the\n * view as add changes, so the view sees the data exactly as it would see rows\n * arriving incrementally.\n *\n * This lets `materialize()` stay synchronous and return a view immediately\n * while the expensive pipeline construction and hydration are postponed, for\n * example until the client's replica has been loaded into the IVM sources.\n */\nexport class DeferredInput implements Input {\n  readonly #schema: SourceSchema;\n  readonly #build: () => Input;\n  #output: Output | undefined;\n  #input: Input | undefined;\n  #destroyed = false;\n\n  /**\n   * @param schema The schema the built pipeline reports. Passed in so this\n   *   input can answer `getSchema()` unconditionally, as the `Input` contract\n   *   requires, before its pipeline exists.\n   * @param build Builds the real pipeline. Called once, from {@link attach}.\n   */\n  constructor(schema: SourceSchema, build: () => Input) {\n    this.#schema = schema;\n    this.#build = build;\n  }\n\n  get attached(): boolean {\n    return this.#input !== undefined;\n  }\n\n  get destroyed(): boolean {\n    return this.#destroyed;\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n    this.#input?.setOutput(output);\n  }\n\n  getSchema(): SourceSchema {\n    return this.#schema;\n  }\n\n  fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    return this.#input ? this.#input.fetch(req) : emptyArray;\n  }\n\n  destroy(): void {\n    this.#destroyed = true;\n    this.#input?.destroy();\n  }\n\n  /**\n   * Build the real pipeline and hydrate the output with its current contents.\n   *\n   * Must be called inside the delegate's `batchViewUpdates`; the delegate is\n   * responsible for notifying commit listeners afterwards so views flush.\n   *\n   * If building or hydrating throws, the pipeline is torn down again and this\n   * input stays unattached so the caller can report the failure.\n   */\n  attach(): void {\n    assert(!this.#input, 'DeferredInput: pipeline already attached');\n    assert(!this.#destroyed, 'DeferredInput: cannot attach after destroy');\n    const input = this.#build();\n    const output = this.#output;\n    if (!output) {\n      // The view never asked for output; there is nothing to hydrate.\n      this.#input = input;\n      return;\n    }\n    try {\n      input.setOutput(output);\n      for (const node of input.fetch({})) {\n        if (node === 'yield') {\n          continue;\n        }\n        consume(output.push(makeAddChange(node), input));\n      }\n    } catch (e) {\n      input.destroy();\n      throw e;\n    }\n    this.#input = input;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AAqBA,IAAa,gBAAb,MAA4C;CAC1C;CACA;CACA;CACA;CACA,aAAa;;;;;;;CAQb,YAAY,QAAsB,OAAoB;EACpD,KAAK,UAAU;EACf,KAAK,SAAS;CAChB;CAEA,IAAI,WAAoB;EACtB,OAAO,KAAK,WAAW,KAAA;CACzB;CAEA,IAAI,YAAqB;EACvB,OAAO,KAAK;CACd;CAEA,UAAU,QAAsB;EAC9B,KAAK,UAAU;EACf,KAAK,QAAQ,UAAU,MAAM;CAC/B;CAEA,YAA0B;EACxB,OAAO,KAAK;CACd;CAEA,MAAM,KAA2C;EAC/C,OAAO,KAAK,SAAS,KAAK,OAAO,MAAM,GAAG,IAAI;CAChD;CAEA,UAAgB;EACd,KAAK,aAAa;EAClB,KAAK,QAAQ,QAAQ;CACvB;;;;;;;;;;CAWA,SAAe;EACb,OAAO,CAAC,KAAK,QAAQ,0CAA0C;EAC/D,OAAO,CAAC,KAAK,YAAY,4CAA4C;EACrE,MAAM,QAAQ,KAAK,OAAO;EAC1B,MAAM,SAAS,KAAK;EACpB,IAAI,CAAC,QAAQ;GAEX,KAAK,SAAS;GACd;EACF;EACA,IAAI;GACF,MAAM,UAAU,MAAM;GACtB,KAAK,MAAM,QAAQ,MAAM,MAAM,CAAC,CAAC,GAAG;IAClC,IAAI,SAAS,SACX;IAEF,QAAQ,OAAO,KAAK,cAAc,IAAI,GAAG,KAAK,CAAC;GACjD;EACF,SAAS,GAAG;GACV,MAAM,QAAQ;GACd,MAAM;EACR;EACA,KAAK,SAAS;CAChB;AACF"}

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

@@ -86,28 +86,30 @@ var Exists = class {
 					switch (change[2].change[0]) {
 						case 0: {
 							const size = yield* this.#fetchSize(change[1]);
-							if (size === 1) if (this.#not) yield* this.#output.push(makeRemoveChange({
-								row: change[1].row,
-								relationships: {
-									...change[1].relationships,
-									[this.#relationshipName]: () => []
-								}
-							}), this);
-							else yield* this.#output.push(makeAddChange(change[1]), this);
-							else yield* this.#pushWithFilter(change, size > 0);
+							if (size === 1) {
+								if (this.#not) yield* this.#output.push(makeRemoveChange({
+									row: change[1].row,
+									relationships: {
+										...change[1].relationships,
+										[this.#relationshipName]: () => []
+									}
+								}), this);
+								else yield* this.#output.push(makeAddChange(change[1]), this);
+							} else yield* this.#pushWithFilter(change, size > 0);
 							return;
 						}
 						case 1: {
 							const size = yield* this.#fetchSize(change[1]);
-							if (size === 0) if (this.#not) yield* this.#output.push(makeAddChange(change[1]), this);
-							else yield* this.#output.push(makeRemoveChange({
-								row: change[1].row,
-								relationships: {
-									...change[1].relationships,
-									[this.#relationshipName]: () => [change[2].change[1]]
-								}
-							}), this);
-							else yield* this.#pushWithFilter(change, size > 0);
+							if (size === 0) {
+								if (this.#not) yield* this.#output.push(makeAddChange(change[1]), this);
+								else yield* this.#output.push(makeRemoveChange({
+									row: change[1].row,
+									relationships: {
+										...change[1].relationships,
+										[this.#relationshipName]: () => [change[2].change[1]]
+									}
+								}), this);
+							} else yield* this.#pushWithFilter(change, size > 0);
 							return;
 						}
 					}

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

@@ -1 +1 @@
-{"version":3,"file":"exists.js","names":["#input","#relationshipName","#not","#parentJoinKey","#noSizeReuse","#cache","#cacheHitCountsForTesting","#output","#inPush","#getCacheKey","#fetchExists","#filter","#pushWithFilter","#fetchSize"],"sources":["../../../../../zql/src/ivm/exists.ts"],"sourcesContent":["import {areEqual} from '../../../shared/src/arrays.ts';\nimport {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport type {CompoundKey} from '../../../zero-protocol/src/ast.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.ts';\nimport {makeAddChange, makeRemoveChange, type Change} from './change.ts';\nimport {normalizeUndefined, type Node, type NormalizedValue} from './data.ts';\nimport {\n  throwFilterOutput,\n  type FilterInput,\n  type FilterOperator,\n  type FilterOutput,\n} from './filter-operators.ts';\nimport type {InputBase} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.ts';\n\n/**\n * The Exists operator filters data based on whether or not a relationship is\n * non-empty.\n */\nexport class Exists implements FilterOperator {\n  readonly #input: FilterInput;\n  readonly #relationshipName: string;\n  readonly #not: boolean;\n  readonly #parentJoinKey: CompoundKey;\n  readonly #noSizeReuse: boolean;\n  #cache: Map<string, boolean>;\n  #cacheHitCountsForTesting: Map<string, number> | undefined;\n  #output: FilterOutput = throwFilterOutput;\n\n  /**\n   * This instance variable is `true` when this operator is processing a `push`,\n   * and is used to disable reuse of cached sizes across rows with the\n   * same parent join key value.\n   * This is necessary because during a push relationships can be inconsistent\n   * due to push communicating changes (which may change multiple Nodes) one\n   * Node at a time.\n   */\n  #inPush = false;\n\n  constructor(\n    input: FilterInput,\n    relationshipName: string,\n    parentJoinKey: CompoundKey,\n    type: 'EXISTS' | 'NOT EXISTS',\n    cacheHitCountsForTesting?: Map<string, number>,\n  ) {\n    this.#input = input;\n    this.#relationshipName = relationshipName;\n    this.#input.setFilterOutput(this);\n    this.#cache = new Map();\n    this.#cacheHitCountsForTesting = cacheHitCountsForTesting;\n    assert(\n      this.#input.getSchema().relationships[relationshipName],\n      // log-leak-ignore -- relationship name is schema, allowed in errors\n      `Input schema missing ${relationshipName}`,\n    );\n    this.#not = type === 'NOT EXISTS';\n    this.#parentJoinKey = parentJoinKey;\n\n    // If the parentJoinKey is the primary key, no sense in trying to reuse.\n    this.#noSizeReuse = areEqual(\n      parentJoinKey,\n      this.#input.getSchema().primaryKey,\n    );\n  }\n\n  setFilterOutput(output: FilterOutput): void {\n    this.#output = output;\n  }\n\n  beginFilter() {\n    this.#output.beginFilter();\n  }\n\n  endFilter() {\n    this.#cache = new Map();\n    this.#output.endFilter();\n  }\n\n  *filter(node: Node): IterableIterator<'yield', boolean> {\n    let exists: boolean | undefined;\n    if (!this.#noSizeReuse && !this.#inPush) {\n      const key = this.#getCacheKey(node, this.#parentJoinKey);\n      exists = this.#cache.get(key);\n      if (exists === undefined) {\n        exists = yield* this.#fetchExists(node);\n        this.#cache.set(key, exists);\n      } else if (this.#cacheHitCountsForTesting) {\n        this.#cacheHitCountsForTesting.set(\n          key,\n          (this.#cacheHitCountsForTesting.get(key) ?? 0) + 1,\n        );\n      }\n    }\n\n    const result =\n      (yield* this.#filter(node, exists)) && (yield* this.#output.filter(node));\n    return result;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n\n  *push(change: Change): Stream<'yield'> {\n    assert(!this.#inPush, 'Unexpected re-entrancy');\n    this.#inPush = true;\n    try {\n      switch (change[ChangeIndex.TYPE]) {\n        // add, remove and edit cannot change the size of the\n        // this.#relationshipName relationship, so simply #pushWithFilter\n        case ChangeType.ADD:\n        case ChangeType.EDIT:\n        case ChangeType.REMOVE: {\n          yield* this.#pushWithFilter(change);\n          return;\n        }\n        case ChangeType.CHILD:\n          // Only add and remove child changes for the\n          // this.#relationshipName relationship, can change the size\n          // of the this.#relationshipName relationship, for other\n          // child changes simply #pushWithFilter\n          if (\n            change[ChangeIndex.CHILD_DATA].relationshipName !==\n              this.#relationshipName ||\n            change[ChangeIndex.CHILD_DATA].change[ChangeIndex.TYPE] ===\n              ChangeType.EDIT ||\n            change[ChangeIndex.CHILD_DATA].change[ChangeIndex.TYPE] ===\n              ChangeType.CHILD\n          ) {\n            yield* this.#pushWithFilter(change);\n            return;\n          }\n          switch (change[ChangeIndex.CHILD_DATA].change[ChangeIndex.TYPE]) {\n            case ChangeType.ADD: {\n              const size = yield* this.#fetchSize(change[ChangeIndex.NODE]);\n              if (size === 1) {\n                if (this.#not) {\n                  // Since the add child change currently being processed is not\n                  // pushed to output, the added child needs to be excluded from\n                  // the remove being pushed to output (since the child has\n                  // never been added to the output).\n                  yield* this.#output.push(\n                    makeRemoveChange({\n                      row: change[ChangeIndex.NODE].row,\n                      relationships: {\n                        ...change[ChangeIndex.NODE].relationships,\n                        [this.#relationshipName]: () => [],\n                      },\n                    }),\n                    this,\n                  );\n                } else {\n                  yield* this.#output.push(\n                    makeAddChange(change[ChangeIndex.NODE]),\n                    this,\n                  );\n                }\n              } else {\n                yield* this.#pushWithFilter(change, size > 0);\n              }\n              return;\n            }\n            case ChangeType.REMOVE: {\n              const size = yield* this.#fetchSize(change[ChangeIndex.NODE]);\n              if (size === 0) {\n                if (this.#not) {\n                  yield* this.#output.push(\n                    makeAddChange(change[ChangeIndex.NODE]),\n                    this,\n                  );\n                } else {\n                  // Since the remove child change currently being processed is\n                  // not pushed to output, the removed child needs to be added to\n                  // the remove being pushed to output.\n                  yield* this.#output.push(\n                    makeRemoveChange({\n                      row: change[ChangeIndex.NODE].row,\n                      relationships: {\n                        ...change[ChangeIndex.NODE].relationships,\n                        [this.#relationshipName]: () => [\n                          change[ChangeIndex.CHILD_DATA].change[\n                            ChangeIndex.NODE\n                          ],\n                        ],\n                      },\n                    }),\n                    this,\n                  );\n                }\n              } else {\n                yield* this.#pushWithFilter(change, size > 0);\n              }\n              return;\n            }\n          }\n          return;\n        default:\n          unreachable(change);\n      }\n    } finally {\n      this.#inPush = false;\n    }\n  }\n\n  /**\n   * Returns whether or not the node's this.#relationshipName\n   * relationship passes the exist/not exists filter condition.\n   * If the optional `size` is passed it is used.\n   * Otherwise, if there is a stored size for the row it is used.\n   * Otherwise the size is computed by streaming the node's\n   * relationship with this.#relationshipName (this computed size is also\n   * stored).\n   */\n  *#filter(node: Node, exists?: boolean): IterableIterator<'yield', boolean> {\n    exists = exists ?? (yield* this.#fetchExists(node));\n    return this.#not ? !exists : exists;\n  }\n\n  #getCacheKey(node: Node, def: CompoundKey): string {\n    const values: NormalizedValue[] = [];\n    for (const key of def) {\n      values.push(normalizeUndefined(node.row[key]));\n    }\n    return JSON.stringify(values);\n  }\n\n  /**\n   * Pushes a change if this.#filter is true for its row.\n   */\n  *#pushWithFilter(change: Change, exists?: boolean): Stream<'yield'> {\n    if (yield* this.#filter(change[ChangeIndex.NODE], exists)) {\n      yield* this.#output.push(change, this);\n    }\n  }\n\n  *#fetchExists(node: Node): IterableIterator<'yield', boolean> {\n    // While it seems like this should be able to fetch just 1 node\n    // to check for exists, we can't because Take does not support\n    // early return during initial fetch.\n    return (yield* this.#fetchSize(node)) > 0;\n  }\n\n  *#fetchSize(node: Node): IterableIterator<'yield', number> {\n    const relationship = node.relationships[this.#relationshipName];\n    assert(\n      relationship,\n      () =>\n        `Exists: relationship \"${this.#relationshipName}\" not found on node`,\n    );\n    let size = 0;\n    for (const n of relationship()) {\n      if (n === 'yield') {\n        yield 'yield';\n      } else {\n        size++;\n      }\n    }\n    return size;\n  }\n}\n"],"mappings":";;;;;;;;;;AAqBA,IAAa,SAAb,MAA8C;CAC5C;CACA;CACA;CACA;CACA;CACA;CACA;CACA,UAAwB;;;;;;;;;CAUxB,UAAU;CAEV,YACE,OACA,kBACA,eACA,MACA,0BACA;EACA,KAAKA,SAAS;EACd,KAAKC,oBAAoB;EACzB,KAAKD,OAAO,gBAAgB,IAAI;EAChC,KAAKK,yBAAS,IAAI,IAAI;EACtB,KAAKC,4BAA4B;EACjC,OACE,KAAKN,OAAO,UAAU,EAAE,cAAc,mBAEtC,wBAAwB,kBAC1B;EACA,KAAKE,OAAO,SAAS;EACrB,KAAKC,iBAAiB;EAGtB,KAAKC,eAAe,SAClB,eACA,KAAKJ,OAAO,UAAU,EAAE,UAC1B;CACF;CAEA,gBAAgB,QAA4B;EAC1C,KAAKO,UAAU;CACjB;CAEA,cAAc;EACZ,KAAKA,QAAQ,YAAY;CAC3B;CAEA,YAAY;EACV,KAAKF,yBAAS,IAAI,IAAI;EACtB,KAAKE,QAAQ,UAAU;CACzB;CAEA,CAAC,OAAO,MAAgD;EACtD,IAAI;EACJ,IAAI,CAAC,KAAKH,gBAAgB,CAAC,KAAKI,SAAS;GACvC,MAAM,MAAM,KAAKC,aAAa,MAAM,KAAKN,cAAc;GACvD,SAAS,KAAKE,OAAO,IAAI,GAAG;GAC5B,IAAI,WAAW,KAAA,GAAW;IACxB,SAAS,OAAO,KAAKK,aAAa,IAAI;IACtC,KAAKL,OAAO,IAAI,KAAK,MAAM;GAC7B,OAAO,IAAI,KAAKC,2BACd,KAAKA,0BAA0B,IAC7B,MACC,KAAKA,0BAA0B,IAAI,GAAG,KAAK,KAAK,CACnD;EAEJ;EAIA,QADG,OAAO,KAAKK,QAAQ,MAAM,MAAM,OAAO,OAAO,KAAKJ,QAAQ,OAAO,IAAI;CAE3E;CAEA,UAAgB;EACd,KAAKP,OAAO,QAAQ;CACtB;CAEA,YAA0B;EACxB,OAAO,KAAKA,OAAO,UAAU;CAC/B;CAEA,CAAC,UAAU,SAAqC;EAC9C,IAAI,KAAKO,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;CAEA,CAAC,KAAK,QAAiC;EACrC,OAAO,CAAC,KAAKC,SAAS,wBAAwB;EAC9C,KAAKA,UAAU;EACf,IAAI;GACF,QAAQ,OAAO,IAAf;IAGE,KAAK;IACL,KAAK;IACL,KAAK;KACH,OAAO,KAAKI,gBAAgB,MAAM;KAClC;IAEF,KAAK;KAKH,IACE,OAAO,GAAwB,qBAC7B,KAAKX,qBACP,OAAO,GAAwB,OAAO,OACpC,KACF,OAAO,GAAwB,OAAO,OACpC,GACF;MACA,OAAO,KAAKW,gBAAgB,MAAM;MAClC;KACF;KACA,QAAQ,OAAO,GAAwB,OAAO,IAA9C;MACE,KAAK,GAAgB;OACnB,MAAM,OAAO,OAAO,KAAKC,WAAW,OAAO,EAAiB;OAC5D,IAAI,SAAS,GACX,IAAI,KAAKX,MAKP,OAAO,KAAKK,QAAQ,KAClB,iBAAiB;QACf,KAAK,OAAO,GAAkB;QAC9B,eAAe;SACb,GAAG,OAAO,GAAkB;UAC3B,KAAKN,0BAA0B,CAAC;QACnC;OACF,CAAC,GACD,IACF;YAEA,OAAO,KAAKM,QAAQ,KAClB,cAAc,OAAO,EAAiB,GACtC,IACF;YAGF,OAAO,KAAKK,gBAAgB,QAAQ,OAAO,CAAC;OAE9C;MACF;MACA,KAAK,GAAmB;OACtB,MAAM,OAAO,OAAO,KAAKC,WAAW,OAAO,EAAiB;OAC5D,IAAI,SAAS,GACX,IAAI,KAAKX,MACP,OAAO,KAAKK,QAAQ,KAClB,cAAc,OAAO,EAAiB,GACtC,IACF;YAKA,OAAO,KAAKA,QAAQ,KAClB,iBAAiB;QACf,KAAK,OAAO,GAAkB;QAC9B,eAAe;SACb,GAAG,OAAO,GAAkB;UAC3B,KAAKN,0BAA0B,CAC9B,OAAO,GAAwB,OAC7B,EAEJ;QACF;OACF,CAAC,GACD,IACF;YAGF,OAAO,KAAKW,gBAAgB,QAAQ,OAAO,CAAC;OAE9C;MACF;KACF;KACA;IACF,SACE,YAAY,MAAM;GACtB;EACF,UAAU;GACR,KAAKJ,UAAU;EACjB;CACF;;;;;;;;;;CAWA,CAACG,QAAQ,MAAY,QAAsD;EACzE,SAAS,WAAW,OAAO,KAAKD,aAAa,IAAI;EACjD,OAAO,KAAKR,OAAO,CAAC,SAAS;CAC/B;CAEA,aAAa,MAAY,KAA0B;EACjD,MAAM,SAA4B,CAAC;EACnC,KAAK,MAAM,OAAO,KAChB,OAAO,KAAK,mBAAmB,KAAK,IAAI,IAAI,CAAC;EAE/C,OAAO,KAAK,UAAU,MAAM;CAC9B;;;;CAKA,CAACU,gBAAgB,QAAgB,QAAmC;EAClE,IAAI,OAAO,KAAKD,QAAQ,OAAO,IAAmB,MAAM,GACtD,OAAO,KAAKJ,QAAQ,KAAK,QAAQ,IAAI;CAEzC;CAEA,CAACG,aAAa,MAAgD;EAI5D,QAAQ,OAAO,KAAKG,WAAW,IAAI,KAAK;CAC1C;CAEA,CAACA,WAAW,MAA+C;EACzD,MAAM,eAAe,KAAK,cAAc,KAAKZ;EAC7C,OACE,oBAEE,yBAAyB,KAAKA,kBAAkB,oBACpD;EACA,IAAI,OAAO;EACX,KAAK,MAAM,KAAK,aAAa,GAC3B,IAAI,MAAM,SACR,MAAM;OAEN;EAGJ,OAAO;CACT;AACF"}
+{"version":3,"file":"exists.js","names":[],"sources":["../../../../../zql/src/ivm/exists.ts"],"sourcesContent":["import {areEqual} from '../../../shared/src/arrays.ts';\nimport {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport type {CompoundKey} from '../../../zero-protocol/src/ast.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.ts';\nimport {makeAddChange, makeRemoveChange, type Change} from './change.ts';\nimport {normalizeUndefined, type Node, type NormalizedValue} from './data.ts';\nimport {\n  throwFilterOutput,\n  type FilterInput,\n  type FilterOperator,\n  type FilterOutput,\n} from './filter-operators.ts';\nimport type {InputBase} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {type Stream} from './stream.ts';\n\n/**\n * The Exists operator filters data based on whether or not a relationship is\n * non-empty.\n */\nexport class Exists implements FilterOperator {\n  readonly #input: FilterInput;\n  readonly #relationshipName: string;\n  readonly #not: boolean;\n  readonly #parentJoinKey: CompoundKey;\n  readonly #noSizeReuse: boolean;\n  #cache: Map<string, boolean>;\n  #cacheHitCountsForTesting: Map<string, number> | undefined;\n  #output: FilterOutput = throwFilterOutput;\n\n  /**\n   * This instance variable is `true` when this operator is processing a `push`,\n   * and is used to disable reuse of cached sizes across rows with the\n   * same parent join key value.\n   * This is necessary because during a push relationships can be inconsistent\n   * due to push communicating changes (which may change multiple Nodes) one\n   * Node at a time.\n   */\n  #inPush = false;\n\n  constructor(\n    input: FilterInput,\n    relationshipName: string,\n    parentJoinKey: CompoundKey,\n    type: 'EXISTS' | 'NOT EXISTS',\n    cacheHitCountsForTesting?: Map<string, number>,\n  ) {\n    this.#input = input;\n    this.#relationshipName = relationshipName;\n    this.#input.setFilterOutput(this);\n    this.#cache = new Map();\n    this.#cacheHitCountsForTesting = cacheHitCountsForTesting;\n    assert(\n      this.#input.getSchema().relationships[relationshipName],\n      // log-leak-ignore -- relationship name is schema, allowed in errors\n      `Input schema missing ${relationshipName}`,\n    );\n    this.#not = type === 'NOT EXISTS';\n    this.#parentJoinKey = parentJoinKey;\n\n    // If the parentJoinKey is the primary key, no sense in trying to reuse.\n    this.#noSizeReuse = areEqual(\n      parentJoinKey,\n      this.#input.getSchema().primaryKey,\n    );\n  }\n\n  setFilterOutput(output: FilterOutput): void {\n    this.#output = output;\n  }\n\n  beginFilter() {\n    this.#output.beginFilter();\n  }\n\n  endFilter() {\n    this.#cache = new Map();\n    this.#output.endFilter();\n  }\n\n  *filter(node: Node): IterableIterator<'yield', boolean> {\n    let exists: boolean | undefined;\n    if (!this.#noSizeReuse && !this.#inPush) {\n      const key = this.#getCacheKey(node, this.#parentJoinKey);\n      exists = this.#cache.get(key);\n      if (exists === undefined) {\n        exists = yield* this.#fetchExists(node);\n        this.#cache.set(key, exists);\n      } else if (this.#cacheHitCountsForTesting) {\n        this.#cacheHitCountsForTesting.set(\n          key,\n          (this.#cacheHitCountsForTesting.get(key) ?? 0) + 1,\n        );\n      }\n    }\n\n    const result =\n      (yield* this.#filter(node, exists)) && (yield* this.#output.filter(node));\n    return result;\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n\n  getSchema(): SourceSchema {\n    return this.#input.getSchema();\n  }\n\n  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n\n  *push(change: Change): Stream<'yield'> {\n    assert(!this.#inPush, 'Unexpected re-entrancy');\n    this.#inPush = true;\n    try {\n      switch (change[ChangeIndex.TYPE]) {\n        // add, remove and edit cannot change the size of the\n        // this.#relationshipName relationship, so simply #pushWithFilter\n        case ChangeType.ADD:\n        case ChangeType.EDIT:\n        case ChangeType.REMOVE: {\n          yield* this.#pushWithFilter(change);\n          return;\n        }\n        case ChangeType.CHILD:\n          // Only add and remove child changes for the\n          // this.#relationshipName relationship, can change the size\n          // of the this.#relationshipName relationship, for other\n          // child changes simply #pushWithFilter\n          if (\n            change[ChangeIndex.CHILD_DATA].relationshipName !==\n              this.#relationshipName ||\n            change[ChangeIndex.CHILD_DATA].change[ChangeIndex.TYPE] ===\n              ChangeType.EDIT ||\n            change[ChangeIndex.CHILD_DATA].change[ChangeIndex.TYPE] ===\n              ChangeType.CHILD\n          ) {\n            yield* this.#pushWithFilter(change);\n            return;\n          }\n          switch (change[ChangeIndex.CHILD_DATA].change[ChangeIndex.TYPE]) {\n            case ChangeType.ADD: {\n              const size = yield* this.#fetchSize(change[ChangeIndex.NODE]);\n              if (size === 1) {\n                if (this.#not) {\n                  // Since the add child change currently being processed is not\n                  // pushed to output, the added child needs to be excluded from\n                  // the remove being pushed to output (since the child has\n                  // never been added to the output).\n                  yield* this.#output.push(\n                    makeRemoveChange({\n                      row: change[ChangeIndex.NODE].row,\n                      relationships: {\n                        ...change[ChangeIndex.NODE].relationships,\n                        [this.#relationshipName]: () => [],\n                      },\n                    }),\n                    this,\n                  );\n                } else {\n                  yield* this.#output.push(\n                    makeAddChange(change[ChangeIndex.NODE]),\n                    this,\n                  );\n                }\n              } else {\n                yield* this.#pushWithFilter(change, size > 0);\n              }\n              return;\n            }\n            case ChangeType.REMOVE: {\n              const size = yield* this.#fetchSize(change[ChangeIndex.NODE]);\n              if (size === 0) {\n                if (this.#not) {\n                  yield* this.#output.push(\n                    makeAddChange(change[ChangeIndex.NODE]),\n                    this,\n                  );\n                } else {\n                  // Since the remove child change currently being processed is\n                  // not pushed to output, the removed child needs to be added to\n                  // the remove being pushed to output.\n                  yield* this.#output.push(\n                    makeRemoveChange({\n                      row: change[ChangeIndex.NODE].row,\n                      relationships: {\n                        ...change[ChangeIndex.NODE].relationships,\n                        [this.#relationshipName]: () => [\n                          change[ChangeIndex.CHILD_DATA].change[\n                            ChangeIndex.NODE\n                          ],\n                        ],\n                      },\n                    }),\n                    this,\n                  );\n                }\n              } else {\n                yield* this.#pushWithFilter(change, size > 0);\n              }\n              return;\n            }\n          }\n          return;\n        default:\n          unreachable(change);\n      }\n    } finally {\n      this.#inPush = false;\n    }\n  }\n\n  /**\n   * Returns whether or not the node's this.#relationshipName\n   * relationship passes the exist/not exists filter condition.\n   * If the optional `size` is passed it is used.\n   * Otherwise, if there is a stored size for the row it is used.\n   * Otherwise the size is computed by streaming the node's\n   * relationship with this.#relationshipName (this computed size is also\n   * stored).\n   */\n  *#filter(node: Node, exists?: boolean): IterableIterator<'yield', boolean> {\n    exists = exists ?? (yield* this.#fetchExists(node));\n    return this.#not ? !exists : exists;\n  }\n\n  #getCacheKey(node: Node, def: CompoundKey): string {\n    const values: NormalizedValue[] = [];\n    for (const key of def) {\n      values.push(normalizeUndefined(node.row[key]));\n    }\n    return JSON.stringify(values);\n  }\n\n  /**\n   * Pushes a change if this.#filter is true for its row.\n   */\n  *#pushWithFilter(change: Change, exists?: boolean): Stream<'yield'> {\n    if (yield* this.#filter(change[ChangeIndex.NODE], exists)) {\n      yield* this.#output.push(change, this);\n    }\n  }\n\n  *#fetchExists(node: Node): IterableIterator<'yield', boolean> {\n    // While it seems like this should be able to fetch just 1 node\n    // to check for exists, we can't because Take does not support\n    // early return during initial fetch.\n    return (yield* this.#fetchSize(node)) > 0;\n  }\n\n  *#fetchSize(node: Node): IterableIterator<'yield', number> {\n    const relationship = node.relationships[this.#relationshipName];\n    assert(\n      relationship,\n      () =>\n        `Exists: relationship \"${this.#relationshipName}\" not found on node`,\n    );\n    let size = 0;\n    for (const n of relationship()) {\n      if (n === 'yield') {\n        yield 'yield';\n      } else {\n        size++;\n      }\n    }\n    return size;\n  }\n}\n"],"mappings":";;;;;;;;;;AAqBA,IAAa,SAAb,MAA8C;CAC5C;CACA;CACA;CACA;CACA;CACA;CACA;CACA,UAAwB;;;;;;;;;CAUxB,UAAU;CAEV,YACE,OACA,kBACA,eACA,MACA,0BACA;EACA,KAAK,SAAS;EACd,KAAK,oBAAoB;EACzB,KAAK,OAAO,gBAAgB,IAAI;EAChC,KAAK,yBAAS,IAAI,IAAI;EACtB,KAAK,4BAA4B;EACjC,OACE,KAAK,OAAO,UAAU,CAAC,CAAC,cAAc,mBAEtC,wBAAwB,kBAC1B;EACA,KAAK,OAAO,SAAS;EACrB,KAAK,iBAAiB;EAGtB,KAAK,eAAe,SAClB,eACA,KAAK,OAAO,UAAU,CAAC,CAAC,UAC1B;CACF;CAEA,gBAAgB,QAA4B;EAC1C,KAAK,UAAU;CACjB;CAEA,cAAc;EACZ,KAAK,QAAQ,YAAY;CAC3B;CAEA,YAAY;EACV,KAAK,yBAAS,IAAI,IAAI;EACtB,KAAK,QAAQ,UAAU;CACzB;CAEA,CAAC,OAAO,MAAgD;EACtD,IAAI;EACJ,IAAI,CAAC,KAAK,gBAAgB,CAAC,KAAK,SAAS;GACvC,MAAM,MAAM,KAAK,aAAa,MAAM,KAAK,cAAc;GACvD,SAAS,KAAK,OAAO,IAAI,GAAG;GAC5B,IAAI,WAAW,KAAA,GAAW;IACxB,SAAS,OAAO,KAAK,aAAa,IAAI;IACtC,KAAK,OAAO,IAAI,KAAK,MAAM;GAC7B,OAAO,IAAI,KAAK,2BACd,KAAK,0BAA0B,IAC7B,MACC,KAAK,0BAA0B,IAAI,GAAG,KAAK,KAAK,CACnD;EAEJ;EAIA,QADG,OAAO,KAAK,QAAQ,MAAM,MAAM,OAAO,OAAO,KAAK,QAAQ,OAAO,IAAI;CAE3E;CAEA,UAAgB;EACd,KAAK,OAAO,QAAQ;CACtB;CAEA,YAA0B;EACxB,OAAO,KAAK,OAAO,UAAU;CAC/B;CAEA,CAAC,UAAU,SAAqC;EAC9C,IAAI,KAAK,QAAQ,WACf,OAAO,KAAK,QAAQ,UAAU,IAAI;CAEtC;CAEA,CAAC,KAAK,QAAiC;EACrC,OAAO,CAAC,KAAK,SAAS,wBAAwB;EAC9C,KAAK,UAAU;EACf,IAAI;GACF,QAAQ,OAAO,IAAf;IAGE,KAAK;IACL,KAAK;IACL,KAAK;KACH,OAAO,KAAK,gBAAgB,MAAM;KAClC;IAEF,KAAK;KAKH,IACE,OAAO,EAAuB,CAAC,qBAC7B,KAAK,qBACP,OAAO,EAAuB,CAAC,OAAO,OACpC,KACF,OAAO,EAAuB,CAAC,OAAO,OACpC,GACF;MACA,OAAO,KAAK,gBAAgB,MAAM;MAClC;KACF;KACA,QAAQ,OAAO,EAAuB,CAAC,OAAO,IAA9C;MACE,KAAK,GAAgB;OACnB,MAAM,OAAO,OAAO,KAAK,WAAW,OAAO,EAAiB;OAC5D,IAAI,SAAS,GAAG;QACd,IAAI,KAAK,MAKP,OAAO,KAAK,QAAQ,KAClB,iBAAiB;SACf,KAAK,OAAO,EAAiB,CAAC;SAC9B,eAAe;UACb,GAAG,OAAO,EAAiB,CAAC;WAC3B,KAAK,0BAA0B,CAAC;SACnC;QACF,CAAC,GACD,IACF;aAEA,OAAO,KAAK,QAAQ,KAClB,cAAc,OAAO,EAAiB,GACtC,IACF;OAEJ,OACE,OAAO,KAAK,gBAAgB,QAAQ,OAAO,CAAC;OAE9C;MACF;MACA,KAAK,GAAmB;OACtB,MAAM,OAAO,OAAO,KAAK,WAAW,OAAO,EAAiB;OAC5D,IAAI,SAAS,GAAG;QACd,IAAI,KAAK,MACP,OAAO,KAAK,QAAQ,KAClB,cAAc,OAAO,EAAiB,GACtC,IACF;aAKA,OAAO,KAAK,QAAQ,KAClB,iBAAiB;SACf,KAAK,OAAO,EAAiB,CAAC;SAC9B,eAAe;UACb,GAAG,OAAO,EAAiB,CAAC;WAC3B,KAAK,0BAA0B,CAC9B,OAAO,EAAuB,CAAC,OAC7B,EAEJ;SACF;QACF,CAAC,GACD,IACF;OAEJ,OACE,OAAO,KAAK,gBAAgB,QAAQ,OAAO,CAAC;OAE9C;MACF;KACF;KACA;IACF,SACE,YAAY,MAAM;GACtB;EACF,UAAU;GACR,KAAK,UAAU;EACjB;CACF;;;;;;;;;;CAWA,CAAC,QAAQ,MAAY,QAAsD;EACzE,SAAS,WAAW,OAAO,KAAK,aAAa,IAAI;EACjD,OAAO,KAAK,OAAO,CAAC,SAAS;CAC/B;CAEA,aAAa,MAAY,KAA0B;EACjD,MAAM,SAA4B,CAAC;EACnC,KAAK,MAAM,OAAO,KAChB,OAAO,KAAK,mBAAmB,KAAK,IAAI,IAAI,CAAC;EAE/C,OAAO,KAAK,UAAU,MAAM;CAC9B;;;;CAKA,CAAC,gBAAgB,QAAgB,QAAmC;EAClE,IAAI,OAAO,KAAK,QAAQ,OAAO,IAAmB,MAAM,GACtD,OAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;CAEzC;CAEA,CAAC,aAAa,MAAgD;EAI5D,QAAQ,OAAO,KAAK,WAAW,IAAI,KAAK;CAC1C;CAEA,CAAC,WAAW,MAA+C;EACzD,MAAM,eAAe,KAAK,cAAc,KAAK;EAC7C,OACE,oBAEE,yBAAyB,KAAK,kBAAkB,oBACpD;EACA,IAAI,OAAO;EACX,KAAK,MAAM,KAAK,aAAa,GAC3B,IAAI,MAAM,SACR,MAAM;OAEN;EAGJ,OAAO;CACT;AACF"}

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

@@ -1 +1 @@
-{"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 {emptyIterator} from '../../../shared/src/iterables.ts';\nimport {emptyArray, identity} from '../../../shared/src/sentinels.ts';\nimport type {ChangeType} from './change-type.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 type {InputBase} from './operator.ts';\nimport {pushAccumulatedChanges} from './push-accumulated.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Stream} from './stream.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): IterableIterator<'yield', boolean> {\n    return this.#output.filter(node);\n  }\n\n  push(change: Change) {\n    this.#accumulatedPushes.push(change);\n    return emptyArray;\n  }\n\n  fanOutDonePushingToAllBranches(fanOutChangeType: ChangeType) {\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 emptyIterator;\n    }\n\n    return pushAccumulatedChanges(\n      this.#accumulatedPushes,\n      this.#output,\n      this,\n      fanOutChangeType,\n      identity,\n      identity,\n    );\n  }\n\n  reconcile(_pusher: InputBase): Stream<'yield'> {\n    // Reconcile is coordinated by FanOut, which calls fanOutDoneReconciling after all branches complete.\n    return emptyArray;\n  }\n\n  *fanOutDoneReconciling(): Stream<'yield'> {\n    if (this.#inputs.length === 0) {\n      return;\n    }\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAgCA,IAAa,QAAb,MAA6C;CAC3C;CACA;CACA,UAAwB;CACxB,qBAA+B,CAAC;CAEhC,YAAY,QAAgB,QAAuB;EACjD,KAAKA,UAAU;EACf,KAAKC,UAAU,OAAO,UAAU;EAChC,KAAK,MAAM,SAAS,QAAQ;GAC1B,MAAM,gBAAgB,IAAI;GAC1B,OAAO,KAAKA,YAAY,MAAM,UAAU,GAAG,2BAA2B;EACxE;CACF;CAEA,gBAAgB,QAA4B;EAC1C,KAAKC,UAAU;CACjB;CAEA,UAAgB;EACd,KAAK,MAAM,SAAS,KAAKF,SACvB,MAAM,QAAQ;CAElB;CAEA,YAAY;EACV,OAAO,KAAKC;CACd;CAEA,cAAoB;EAClB,KAAKC,QAAQ,YAAY;CAC3B;CAEA,YAAkB;EAChB,KAAKA,QAAQ,UAAU;CACzB;CAEA,OAAO,MAAgD;EACrD,OAAO,KAAKA,QAAQ,OAAO,IAAI;CACjC;CAEA,KAAK,QAAgB;EACnB,KAAKC,mBAAmB,KAAK,MAAM;EACnC,OAAO;CACT;CAEA,+BAA+B,kBAA8B;EAC3D,IAAI,KAAKH,QAAQ,WAAW,GAAG;GAC7B,OACE,KAAKG,mBAAmB,WAAW,GACnC,mEACF;GACA,OAAO;EACT;EAEA,OAAO,uBACL,KAAKA,oBACL,KAAKD,SACL,MACA,kBACA,UACA,QACF;CACF;CAEA,UAAU,SAAqC;EAE7C,OAAO;CACT;CAEA,CAAC,wBAAyC;EACxC,IAAI,KAAKF,QAAQ,WAAW,GAC1B;EAEF,IAAI,KAAKE,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;AACF"}
+{"version":3,"file":"fan-in.js","names":[],"sources":["../../../../../zql/src/ivm/fan-in.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {emptyIterator} from '../../../shared/src/iterables.ts';\nimport {emptyArray, identity} from '../../../shared/src/sentinels.ts';\nimport type {ChangeType} from './change-type.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 type {InputBase} from './operator.ts';\nimport {pushAccumulatedChanges} from './push-accumulated.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Stream} from './stream.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): IterableIterator<'yield', boolean> {\n    return this.#output.filter(node);\n  }\n\n  push(change: Change) {\n    this.#accumulatedPushes.push(change);\n    return emptyArray;\n  }\n\n  fanOutDonePushingToAllBranches(fanOutChangeType: ChangeType) {\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 emptyIterator;\n    }\n\n    return pushAccumulatedChanges(\n      this.#accumulatedPushes,\n      this.#output,\n      this,\n      fanOutChangeType,\n      identity,\n      identity,\n    );\n  }\n\n  reconcile(_pusher: InputBase): Stream<'yield'> {\n    // Reconcile is coordinated by FanOut, which calls fanOutDoneReconciling after all branches complete.\n    return emptyArray;\n  }\n\n  *fanOutDoneReconciling(): Stream<'yield'> {\n    if (this.#inputs.length === 0) {\n      return;\n    }\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAgCA,IAAa,QAAb,MAA6C;CAC3C;CACA;CACA,UAAwB;CACxB,qBAA+B,CAAC;CAEhC,YAAY,QAAgB,QAAuB;EACjD,KAAK,UAAU;EACf,KAAK,UAAU,OAAO,UAAU;EAChC,KAAK,MAAM,SAAS,QAAQ;GAC1B,MAAM,gBAAgB,IAAI;GAC1B,OAAO,KAAK,YAAY,MAAM,UAAU,GAAG,2BAA2B;EACxE;CACF;CAEA,gBAAgB,QAA4B;EAC1C,KAAK,UAAU;CACjB;CAEA,UAAgB;EACd,KAAK,MAAM,SAAS,KAAK,SACvB,MAAM,QAAQ;CAElB;CAEA,YAAY;EACV,OAAO,KAAK;CACd;CAEA,cAAoB;EAClB,KAAK,QAAQ,YAAY;CAC3B;CAEA,YAAkB;EAChB,KAAK,QAAQ,UAAU;CACzB;CAEA,OAAO,MAAgD;EACrD,OAAO,KAAK,QAAQ,OAAO,IAAI;CACjC;CAEA,KAAK,QAAgB;EACnB,KAAK,mBAAmB,KAAK,MAAM;EACnC,OAAO;CACT;CAEA,+BAA+B,kBAA8B;EAC3D,IAAI,KAAK,QAAQ,WAAW,GAAG;GAC7B,OACE,KAAK,mBAAmB,WAAW,GACnC,mEACF;GACA,OAAO;EACT;EAEA,OAAO,uBACL,KAAK,oBACL,KAAK,SACL,MACA,kBACA,UACA,QACF;CACF;CAEA,UAAU,SAAqC;EAE7C,OAAO;CACT;CAEA,CAAC,wBAAyC;EACxC,IAAI,KAAK,QAAQ,WAAW,GAC1B;EAEF,IAAI,KAAK,QAAQ,WACf,OAAO,KAAK,QAAQ,UAAU,IAAI;CAEtC;AACF"}

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

@@ -1 +1 @@
-{"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 {ChangeIndex} from './change-index.ts';\nimport type {Change} from './change.ts';\nimport type {Node} from './data.ts';\nimport type {FanIn} from './fan-in.ts';\nimport type {\n  FilterInput,\n  FilterOperator,\n  FilterOutput,\n} from './filter-operators.ts';\nimport type {InputBase} from './operator.ts';\nimport type {Stream} from './stream.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): IterableIterator<'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[ChangeIndex.TYPE]);\n  }\n\n  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    for (const output of this.#outputs) {\n      if (output.reconcile) {\n        yield* output.reconcile(this);\n      }\n    }\n    if (this.#fanIn) {\n      yield* this.#fanIn.fanOutDoneReconciling();\n    }\n  }\n}\n"],"mappings":";;;;;;;AAkBA,IAAa,SAAb,MAA8C;CAC5C;CACA,WAAoC,CAAC;CACrC;CACA,gBAAwB;CAExB,YAAY,OAAoB;EAC9B,KAAKA,SAAS;EACd,MAAM,gBAAgB,IAAI;CAC5B;CAEA,SAAS,OAAc;EACrB,KAAKE,SAAS;CAChB;CAEA,gBAAgB,QAA4B;EAC1C,KAAKD,SAAS,KAAK,MAAM;CAC3B;CAEA,UAAgB;EACd,IAAI,KAAKE,gBAAgB,KAAKF,SAAS,QAAQ;GAC7C,EAAE,KAAKE;GACP,IAAI,KAAKA,kBAAkB,KAAKF,SAAS,QACvC,KAAKD,OAAO,QAAQ;EAExB,OACE,MAAM,IAAI,MAAM,+CAA+C;CAEnE;CAEA,YAAY;EACV,OAAO,KAAKA,OAAO,UAAU;CAC/B;CAEA,cAAoB;EAClB,KAAK,MAAM,UAAU,KAAKC,UACxB,OAAO,YAAY;CAEvB;CAEA,YAAkB;EAChB,KAAK,MAAM,UAAU,KAAKA,UACxB,OAAO,UAAU;CAErB;CAEA,CAAC,OAAO,MAAgD;EACtD,IAAI,SAAS;EACb,KAAK,MAAM,UAAU,KAAKA,UAAU;GAClC,UAAU,OAAO,OAAO,OAAO,IAAI,MAAM;GACzC,IAAI,QACF,OAAO;EAEX;EACA,OAAO;CACT;CAEA,CAAC,KAAK,QAAgB;EACpB,KAAK,MAAM,OAAO,KAAKA,UACrB,OAAO,IAAI,KAAK,QAAQ,IAAI;EAE9B,OAAO,KACL,KAAKC,QACL,+CACF,EAAE,+BAA+B,OAAO,EAAiB;CAC3D;CAEA,CAAC,UAAU,SAAqC;EAC9C,KAAK,MAAM,UAAU,KAAKD,UACxB,IAAI,OAAO,WACT,OAAO,OAAO,UAAU,IAAI;EAGhC,IAAI,KAAKC,QACP,OAAO,KAAKA,OAAO,sBAAsB;CAE7C;AACF"}
+{"version":3,"file":"fan-out.js","names":[],"sources":["../../../../../zql/src/ivm/fan-out.ts"],"sourcesContent":["import {must} from '../../../shared/src/must.ts';\nimport {ChangeIndex} from './change-index.ts';\nimport type {Change} from './change.ts';\nimport type {Node} from './data.ts';\nimport type {FanIn} from './fan-in.ts';\nimport type {\n  FilterInput,\n  FilterOperator,\n  FilterOutput,\n} from './filter-operators.ts';\nimport type {InputBase} from './operator.ts';\nimport type {Stream} from './stream.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): IterableIterator<'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[ChangeIndex.TYPE]);\n  }\n\n  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    for (const output of this.#outputs) {\n      if (output.reconcile) {\n        yield* output.reconcile(this);\n      }\n    }\n    if (this.#fanIn) {\n      yield* this.#fanIn.fanOutDoneReconciling();\n    }\n  }\n}\n"],"mappings":";;;;;;;AAkBA,IAAa,SAAb,MAA8C;CAC5C;CACA,WAAoC,CAAC;CACrC;CACA,gBAAwB;CAExB,YAAY,OAAoB;EAC9B,KAAK,SAAS;EACd,MAAM,gBAAgB,IAAI;CAC5B;CAEA,SAAS,OAAc;EACrB,KAAK,SAAS;CAChB;CAEA,gBAAgB,QAA4B;EAC1C,KAAK,SAAS,KAAK,MAAM;CAC3B;CAEA,UAAgB;EACd,IAAI,KAAK,gBAAgB,KAAK,SAAS,QAAQ;GAC7C,EAAE,KAAK;GACP,IAAI,KAAK,kBAAkB,KAAK,SAAS,QACvC,KAAK,OAAO,QAAQ;EAExB,OACE,MAAM,IAAI,MAAM,+CAA+C;CAEnE;CAEA,YAAY;EACV,OAAO,KAAK,OAAO,UAAU;CAC/B;CAEA,cAAoB;EAClB,KAAK,MAAM,UAAU,KAAK,UACxB,OAAO,YAAY;CAEvB;CAEA,YAAkB;EAChB,KAAK,MAAM,UAAU,KAAK,UACxB,OAAO,UAAU;CAErB;CAEA,CAAC,OAAO,MAAgD;EACtD,IAAI,SAAS;EACb,KAAK,MAAM,UAAU,KAAK,UAAU;GAClC,UAAU,OAAO,OAAO,OAAO,IAAI,MAAM;GACzC,IAAI,QACF,OAAO;EAEX;EACA,OAAO;CACT;CAEA,CAAC,KAAK,QAAgB;EACpB,KAAK,MAAM,OAAO,KAAK,UACrB,OAAO,IAAI,KAAK,QAAQ,IAAI;EAE9B,OAAO,KACL,KAAK,QACL,+CACF,CAAC,CAAC,+BAA+B,OAAO,EAAiB;CAC3D;CAEA,CAAC,UAAU,SAAqC;EAC9C,KAAK,MAAM,UAAU,KAAK,UACxB,IAAI,OAAO,WACT,OAAO,OAAO,UAAU,IAAI;EAGhC,IAAI,KAAK,QACP,OAAO,KAAK,OAAO,sBAAsB;CAE7C;AACF"}

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

@@ -115,6 +115,6 @@ function buildFilterPipeline(input, delegate, pipeline, condition) {
 	return filterEnd;
 }
 //#endregion
-export { buildFilterPipeline, throwFilterOutput };
+export { FilterEnd, FilterStart, buildFilterPipeline, throwFilterOutput };
 
 //# sourceMappingURL=filter-operators.js.map

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

@@ -1 +1 @@
-{"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  reconcile(): Stream<'yield'> {\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) {\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  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\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  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\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,\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,YAA6B;EAC3B,MAAM,IAAI,MAAM,gBAAgB;CAClC;CAEA,cAAc,CAAC;CACf,YAAY,CAAC;AACf;AAEA,IAAa,cAAb,MAAwD;CACtD;CACA;CACA,UAAwB;CAExB,YAAY,OAAc,WAAiC;EACzD,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,UAAU,SAAqC;EAC9C,IAAI,KAAKA,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;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;CAEA,CAAC,UAAU,SAAqC;EAC9C,IAAI,KAAKA,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;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"}
+{"version":3,"file":"filter-operators.js","names":[],"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  reconcile(): Stream<'yield'> {\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) {\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  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\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  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\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,\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,YAA6B;EAC3B,MAAM,IAAI,MAAM,gBAAgB;CAClC;CAEA,cAAc,CAAC;CACf,YAAY,CAAC;AACf;AAEA,IAAa,cAAb,MAAwD;CACtD;CACA;CACA,UAAwB;CAExB,YAAY,OAAc,WAAiC;EACzD,KAAK,SAAS;EACd,KAAK,aAAa;EAClB,MAAM,UAAU,IAAI;CACtB;CAEA,gBAAgB,QAAsB;EACpC,KAAK,UAAU;CACjB;CAEA,UAAgB;EACd,KAAK,OAAO,QAAQ;CACtB;CAEA,YAA0B;EACxB,OAAO,KAAK,OAAO,UAAU;CAC/B;CAEA,KAAK,QAAgB;EACnB,OAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;CACvC;CAEA,CAAC,UAAU,SAAqC;EAC9C,IAAI,KAAK,QAAQ,WACf,OAAO,KAAK,QAAQ,UAAU,IAAI;CAEtC;CAEA,CAAC,MAAM,KAA2C;EAChD,MAAM,eAAe,aAAa,IAAI,QAAQ,KAAK,UAAU;EAC7D,MAAM,WACJ,iBAAiB,IAAI,SAAS,MAAM;GAAC,GAAG;GAAK,QAAQ;EAAY;EACnE,KAAK,QAAQ,YAAY;EACzB,IAAI;GACF,KAAK,MAAM,QAAQ,KAAK,OAAO,MAAM,QAAQ,GAAG;IAC9C,IAAI,SAAS,SAAS;KACpB,MAAM;KACN;IACF;IACA,IAAI,OAAO,KAAK,QAAQ,OAAO,IAAI,GACjC,MAAM;GAEV;EACF,UAAU;GAGR,KAAK,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,KAAK,SAAS;EACd,KAAK,SAAS;EACd,MAAM,gBAAgB,IAAI;CAC5B;CAEA,MAAM,KAA2C;EAC/C,OAAO,KAAK,OAAO,MAAM,GAAG;CAC9B;CAEA,cAAc,CAAC;CACf,YAAY,CAAC;CAEb,OAAO,OAAa;EAClB,OAAO;CACT;CAEA,UAAU,QAAgB;EACxB,KAAK,UAAU;CACjB;CAEA,UAAgB;EACd,KAAK,OAAO,QAAQ;CACtB;CAEA,YAA0B;EACxB,OAAO,KAAK,OAAO,UAAU;CAC/B;CAEA,KAAK,QAAgB;EACnB,OAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;CACvC;CAEA,CAAC,UAAU,SAAqC;EAC9C,IAAI,KAAK,QAAQ,WACf,OAAO,KAAK,QAAQ,UAAU,IAAI;CAEtC;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"}

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

@@ -1 +1 @@
-{"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 {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.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[ChangeIndex.TYPE]) {\n    case ChangeType.ADD:\n    case ChangeType.REMOVE:\n      if (predicate(change[ChangeIndex.NODE].row)) {\n        yield* output.push(change, pusher);\n      }\n      break;\n    case ChangeType.CHILD:\n      if (predicate(change[ChangeIndex.NODE].row)) {\n        yield* output.push(change, pusher);\n      }\n      break;\n    case ChangeType.EDIT:\n      yield* maybeSplitAndPushEditChange(change, predicate, output, pusher);\n      break;\n    default:\n      unreachable(change);\n  }\n}\n"],"mappings":";;;AASA,UAAiB,WACf,QACA,QACA,QACA,WACiB;CACjB,IAAI,CAAC,WAAW;EACd,OAAO,OAAO,KAAK,QAAQ,MAAM;EACjC;CACF;CACA,QAAQ,OAAO,IAAf;EACE,KAAK;EACL,KAAK;GACH,IAAI,UAAU,OAAO,GAAkB,GAAG,GACxC,OAAO,OAAO,KAAK,QAAQ,MAAM;GAEnC;EACF,KAAK;GACH,IAAI,UAAU,OAAO,GAAkB,GAAG,GACxC,OAAO,OAAO,KAAK,QAAQ,MAAM;GAEnC;EACF,KAAK;GACH,OAAO,4BAA4B,QAAQ,WAAW,QAAQ,MAAM;GACpE;EACF,SACE,YAAY,MAAM;CACtB;AACF"}
+{"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 {ChangeIndex} from './change-index.ts';\nimport {ChangeType} from './change-type.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[ChangeIndex.TYPE]) {\n    case ChangeType.ADD:\n    case ChangeType.REMOVE:\n      if (predicate(change[ChangeIndex.NODE].row)) {\n        yield* output.push(change, pusher);\n      }\n      break;\n    case ChangeType.CHILD:\n      if (predicate(change[ChangeIndex.NODE].row)) {\n        yield* output.push(change, pusher);\n      }\n      break;\n    case ChangeType.EDIT:\n      yield* maybeSplitAndPushEditChange(change, predicate, output, pusher);\n      break;\n    default:\n      unreachable(change);\n  }\n}\n"],"mappings":";;;AASA,UAAiB,WACf,QACA,QACA,QACA,WACiB;CACjB,IAAI,CAAC,WAAW;EACd,OAAO,OAAO,KAAK,QAAQ,MAAM;EACjC;CACF;CACA,QAAQ,OAAO,IAAf;EACE,KAAK;EACL,KAAK;GACH,IAAI,UAAU,OAAO,EAAiB,CAAC,GAAG,GACxC,OAAO,OAAO,KAAK,QAAQ,MAAM;GAEnC;EACF,KAAK;GACH,IAAI,UAAU,OAAO,EAAiB,CAAC,GAAG,GACxC,OAAO,OAAO,KAAK,QAAQ,MAAM;GAEnC;EACF,KAAK;GACH,OAAO,4BAA4B,QAAQ,WAAW,QAAQ,MAAM;GACpE;EACF,SACE,YAAY,MAAM;CACtB;AACF"}

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

@@ -1 +1 @@
-{"version":3,"file":"filter.js","names":["#input","#predicate","#output"],"sources":["../../../../../zql/src/ivm/filter.ts"],"sourcesContent":["import {makeEmptyIteratorWithReturn} from '../../../shared/src/iterables.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport type {Change} from './change.ts';\nimport {type Node} from './data.ts';\nimport {\n  throwFilterOutput,\n  type FilterInput,\n  type FilterOperator,\n  type FilterOutput,\n} from './filter-operators.ts';\nimport {filterPush} from './filter-push.ts';\nimport type {InputBase} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Stream} from './stream.ts';\n\n/**\n * The Filter operator filters data through a predicate. It is stateless.\n *\n * The predicate must be pure.\n */\nexport class Filter implements FilterOperator {\n  readonly #input: FilterInput;\n  readonly #predicate: (row: Row) => boolean;\n\n  #output: FilterOutput = throwFilterOutput;\n\n  constructor(input: FilterInput, predicate: (row: Row) => boolean) {\n    this.#input = input;\n    this.#predicate = predicate;\n    input.setFilterOutput(this);\n  }\n\n  beginFilter(): void {\n    this.#output.beginFilter();\n  }\n\n  endFilter(): void {\n    this.#output.endFilter();\n  }\n\n  filter(node: Node): IterableIterator<'yield', boolean> {\n    if (this.#predicate(node.row)) {\n      return this.#output.filter(node);\n    }\n    return emptyIteratorReturnFalse;\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 filterPush(change, this.#output, this, this.#predicate);\n  }\n\n  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n}\n\nconst emptyIteratorReturnFalse = makeEmptyIteratorWithReturn(false);\n"],"mappings":";;;;;;;;;;AAoBA,IAAa,SAAb,MAA8C;CAC5C;CACA;CAEA,UAAwB;CAExB,YAAY,OAAoB,WAAkC;EAChE,KAAKA,SAAS;EACd,KAAKC,aAAa;EAClB,MAAM,gBAAgB,IAAI;CAC5B;CAEA,cAAoB;EAClB,KAAKC,QAAQ,YAAY;CAC3B;CAEA,YAAkB;EAChB,KAAKA,QAAQ,UAAU;CACzB;CAEA,OAAO,MAAgD;EACrD,IAAI,KAAKD,WAAW,KAAK,GAAG,GAC1B,OAAO,KAAKC,QAAQ,OAAO,IAAI;EAEjC,OAAO;CACT;CAEA,gBAAgB,QAAsB;EACpC,KAAKA,UAAU;CACjB;CAEA,UAAgB;EACd,KAAKF,OAAO,QAAQ;CACtB;CAEA,YAA0B;EACxB,OAAO,KAAKA,OAAO,UAAU;CAC/B;CAEA,KAAK,QAAgB;EACnB,OAAO,WAAW,QAAQ,KAAKE,SAAS,MAAM,KAAKD,UAAU;CAC/D;CAEA,CAAC,UAAU,SAAqC;EAC9C,IAAI,KAAKC,QAAQ,WACf,OAAO,KAAKA,QAAQ,UAAU,IAAI;CAEtC;AACF;AAEA,IAAM,2BAA2B,4BAA4B,KAAK"}
+{"version":3,"file":"filter.js","names":[],"sources":["../../../../../zql/src/ivm/filter.ts"],"sourcesContent":["import {makeEmptyIteratorWithReturn} from '../../../shared/src/iterables.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport type {Change} from './change.ts';\nimport {type Node} from './data.ts';\nimport {\n  throwFilterOutput,\n  type FilterInput,\n  type FilterOperator,\n  type FilterOutput,\n} from './filter-operators.ts';\nimport {filterPush} from './filter-push.ts';\nimport type {InputBase} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {Stream} from './stream.ts';\n\n/**\n * The Filter operator filters data through a predicate. It is stateless.\n *\n * The predicate must be pure.\n */\nexport class Filter implements FilterOperator {\n  readonly #input: FilterInput;\n  readonly #predicate: (row: Row) => boolean;\n\n  #output: FilterOutput = throwFilterOutput;\n\n  constructor(input: FilterInput, predicate: (row: Row) => boolean) {\n    this.#input = input;\n    this.#predicate = predicate;\n    input.setFilterOutput(this);\n  }\n\n  beginFilter(): void {\n    this.#output.beginFilter();\n  }\n\n  endFilter(): void {\n    this.#output.endFilter();\n  }\n\n  filter(node: Node): IterableIterator<'yield', boolean> {\n    if (this.#predicate(node.row)) {\n      return this.#output.filter(node);\n    }\n    return emptyIteratorReturnFalse;\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 filterPush(change, this.#output, this, this.#predicate);\n  }\n\n  *reconcile(_pusher: InputBase): Stream<'yield'> {\n    if (this.#output.reconcile) {\n      yield* this.#output.reconcile(this);\n    }\n  }\n}\n\nconst emptyIteratorReturnFalse = makeEmptyIteratorWithReturn(false);\n"],"mappings":";;;;;;;;;;AAoBA,IAAa,SAAb,MAA8C;CAC5C;CACA;CAEA,UAAwB;CAExB,YAAY,OAAoB,WAAkC;EAChE,KAAK,SAAS;EACd,KAAK,aAAa;EAClB,MAAM,gBAAgB,IAAI;CAC5B;CAEA,cAAoB;EAClB,KAAK,QAAQ,YAAY;CAC3B;CAEA,YAAkB;EAChB,KAAK,QAAQ,UAAU;CACzB;CAEA,OAAO,MAAgD;EACrD,IAAI,KAAK,WAAW,KAAK,GAAG,GAC1B,OAAO,KAAK,QAAQ,OAAO,IAAI;EAEjC,OAAO;CACT;CAEA,gBAAgB,QAAsB;EACpC,KAAK,UAAU;CACjB;CAEA,UAAgB;EACd,KAAK,OAAO,QAAQ;CACtB;CAEA,YAA0B;EACxB,OAAO,KAAK,OAAO,UAAU;CAC/B;CAEA,KAAK,QAAgB;EACnB,OAAO,WAAW,QAAQ,KAAK,SAAS,MAAM,KAAK,UAAU;CAC/D;CAEA,CAAC,UAAU,SAAqC;EAC9C,IAAI,KAAK,QAAQ,WACf,OAAO,KAAK,QAAQ,UAAU,IAAI;CAEtC;AACF;AAEA,IAAM,2BAA2B,4BAA4B,KAAK"}