@rocicorp/zero 1.6.0-canary.0 → 1.6.0-canary.10

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

@@ -0,0 +1,381 @@
+import { assert, unreachable } from "../../../shared/src/asserts.js";
+import { must } from "../../../shared/src/must.js";
+import { completeOrdering } from "../query/complete-ordering.js";
+import { Take } from "../ivm/take.js";
+import { Cap } from "../ivm/cap.js";
+import { buildFilterPipeline } from "../ivm/filter-operators.js";
+import { Exists } from "../ivm/exists.js";
+import { FanIn } from "../ivm/fan-in.js";
+import { FanOut } from "../ivm/fan-out.js";
+import { Filter } from "../ivm/filter.js";
+import { createPredicate } from "./filter.js";
+import { FlippedJoin } from "../ivm/flipped-join.js";
+import { Join } from "../ivm/join.js";
+import { Skip } from "../ivm/skip.js";
+import { UnionFanIn } from "../ivm/union-fan-in.js";
+import { UnionFanOut } from "../ivm/union-fan-out.js";
+import { planQuery } from "../planner/planner-builder.js";
+//#region ../zql/src/builder/builder.ts
+/**
+* Builds a pipeline from an AST. Caller must provide a delegate to create source
+* and storage interfaces as necessary.
+*
+* Usage:
+*
+* ```ts
+* class MySink implements Output {
+*   readonly #input: Input;
+*
+*   constructor(input: Input) {
+*     this.#input = input;
+*     input.setOutput(this);
+*   }
+*
+*   push(change: Change, _: Operator) {
+*     console.log(change);
+*   }
+* }
+*
+* const input = buildPipeline(ast, myDelegate, hash(ast));
+* const sink = new MySink(input);
+* ```
+*/
+function buildPipeline(ast, delegate, queryID, costModel, lc, planDebugger) {
+	ast = delegate.mapAst ? delegate.mapAst(ast) : ast;
+	ast = completeOrdering(ast, (tableName) => must(delegate.getSource(tableName)).tableSchema.primaryKey);
+	if (costModel) ast = planQuery(ast, costModel, planDebugger, lc);
+	return buildPipelineInternal(ast, delegate, queryID, "");
+}
+function bindStaticParameters(ast, staticQueryParameters) {
+	const visit = (node) => ({
+		...node,
+		where: node.where ? bindCondition(node.where) : void 0,
+		related: node.related?.map((sq) => ({
+			...sq,
+			subquery: visit(sq.subquery)
+		}))
+	});
+	function bindCondition(condition) {
+		if (condition.type === "simple") return {
+			...condition,
+			left: bindValue(condition.left),
+			right: bindValue(condition.right)
+		};
+		if (condition.type === "correlatedSubquery") return {
+			...condition,
+			related: {
+				...condition.related,
+				subquery: visit(condition.related.subquery)
+			}
+		};
+		return {
+			...condition,
+			conditions: condition.conditions.map(bindCondition)
+		};
+	}
+	const bindValue = (value) => {
+		if (isParameter(value)) {
+			const anchor = must(staticQueryParameters, "Static query params do not exist")[value.anchor];
+			return {
+				type: "literal",
+				value: resolveField(anchor, value.field)
+			};
+		}
+		return value;
+	};
+	return visit(ast);
+}
+function resolveField(anchor, field) {
+	if (anchor === void 0) return null;
+	if (Array.isArray(field)) return field.reduce((acc, f) => acc?.[f], anchor) ?? null;
+	return anchor[field] ?? null;
+}
+function isParameter(value) {
+	return value.type === "static";
+}
+var EXISTS_LIMIT = 3;
+var PERMISSIONS_EXISTS_LIMIT = 1;
+/**
+* Checks if a condition tree contains any NOT EXISTS operations.
+* Recursively checks AND/OR branches but does not recurse into nested subqueries
+* (those are checked when buildPipelineInternal processes them).
+*/
+function assertNoNotExists(condition) {
+	switch (condition.type) {
+		case "simple": return;
+		case "correlatedSubquery":
+			if (condition.op === "NOT EXISTS") throw new Error("not(exists()) is not supported on the client - see https://bugs.rocicorp.dev/issue/3438");
+			return;
+		case "and":
+		case "or":
+			for (const c of condition.conditions) assertNoNotExists(c);
+			return;
+		default: unreachable(condition);
+	}
+}
+function buildPipelineInternal(ast, delegate, queryID, name, partitionKey, isNonFlippedExistsChild) {
+	const source = delegate.getSource(ast.table);
+	if (!source) throw new Error(`Source not found: ${ast.table}`);
+	ast = uniquifyCorrelatedSubqueryConditionAliases(ast);
+	if (!delegate.enableNotExists && ast.where) assertNoNotExists(ast.where);
+	const csqConditions = gatherCorrelatedSubqueryQueryConditions(ast.where);
+	const splitEditKeys = partitionKey ? new Set(partitionKey) : /* @__PURE__ */ new Set();
+	const aliases = /* @__PURE__ */ new Set();
+	for (const csq of csqConditions) {
+		aliases.add(csq.related.subquery.alias || "");
+		for (const key of csq.related.correlation.parentField) splitEditKeys.add(key);
+	}
+	if (ast.related) for (const csq of ast.related) for (const key of csq.correlation.parentField) splitEditKeys.add(key);
+	if (isNonFlippedExistsChild) {
+		assert(ast.start === void 0, "EXISTS subqueries must not have start");
+		assert(ast.related === void 0, "EXISTS subqueries must not have related");
+	}
+	const useCap = isNonFlippedExistsChild && !(ast.where && conditionIncludesFlippedSubqueryAtAnyLevel(ast.where));
+	const conn = source.connect(useCap ? void 0 : must(ast.orderBy), ast.where, splitEditKeys, delegate.debug);
+	let end = delegate.decorateSourceInput(conn, queryID);
+	end = delegate.decorateInput(end, `${name}:source(${ast.table})`);
+	const { fullyAppliedFilters } = conn;
+	if (ast.start) {
+		const skip = new Skip(end, ast.start);
+		delegate.addEdge(end, skip);
+		end = delegate.decorateInput(skip, `${name}:skip)`);
+	}
+	for (const csqCondition of csqConditions) if (!csqCondition.flip) end = applyCorrelatedSubQuery({
+		...csqCondition.related,
+		subquery: {
+			...csqCondition.related.subquery,
+			limit: csqCondition.related.system === "permissions" ? PERMISSIONS_EXISTS_LIMIT : EXISTS_LIMIT
+		}
+	}, delegate, queryID, end, name, true);
+	if (ast.where && (!fullyAppliedFilters || delegate.applyFiltersAnyway)) end = applyWhere(end, ast.where, delegate, name);
+	if (ast.limit !== void 0) if (useCap) {
+		const capName = `${name}:cap`;
+		const cap = new Cap(end, delegate.createStorage(capName), ast.limit, partitionKey);
+		delegate.addEdge(end, cap);
+		end = delegate.decorateInput(cap, capName);
+	} else {
+		const takeName = `${name}:take`;
+		const take = new Take(end, delegate.createStorage(takeName), ast.limit, partitionKey);
+		delegate.addEdge(end, take);
+		end = delegate.decorateInput(take, takeName);
+	}
+	if (ast.related) {
+		const byAlias = /* @__PURE__ */ new Map();
+		for (const csq of ast.related) byAlias.set(csq.subquery.alias ?? "", csq);
+		for (const csq of byAlias.values()) end = applyCorrelatedSubQuery(csq, delegate, queryID, end, name, false);
+	}
+	return end;
+}
+function applyWhere(input, condition, delegate, name) {
+	if (!conditionIncludesFlippedSubqueryAtAnyLevel(condition)) return buildFilterPipeline(input, delegate, (filterInput) => applyFilter(filterInput, condition, delegate, name));
+	return applyFilterWithFlips(input, condition, delegate, name);
+}
+function applyFilterWithFlips(input, condition, delegate, name) {
+	let end = input;
+	assert(condition.type !== "simple", "Simple conditions cannot have flips");
+	switch (condition.type) {
+		case "and": {
+			const [withFlipped, withoutFlipped] = partitionBranches(condition.conditions, conditionIncludesFlippedSubqueryAtAnyLevel);
+			if (withoutFlipped.length > 0) end = buildFilterPipeline(input, delegate, (filterInput) => applyAnd(filterInput, {
+				type: "and",
+				conditions: withoutFlipped
+			}, delegate, name));
+			assert(withFlipped.length > 0, "Impossible to have no flips here");
+			for (const cond of withFlipped) end = applyFilterWithFlips(end, cond, delegate, name);
+			break;
+		}
+		case "or": {
+			const [withFlipped, withoutFlipped] = partitionBranches(condition.conditions, conditionIncludesFlippedSubqueryAtAnyLevel);
+			assert(withFlipped.length > 0, "Impossible to have no flips here");
+			const ufo = new UnionFanOut(end);
+			delegate.addEdge(end, ufo);
+			end = delegate.decorateInput(ufo, `${name}:ufo`);
+			const branches = [];
+			if (withoutFlipped.length > 0) branches.push(buildFilterPipeline(end, delegate, (filterInput) => applyOr(filterInput, {
+				type: "or",
+				conditions: withoutFlipped
+			}, delegate, name)));
+			for (const cond of withFlipped) branches.push(applyFilterWithFlips(end, cond, delegate, name));
+			const ufi = new UnionFanIn(ufo, branches);
+			for (const branch of branches) delegate.addEdge(branch, ufi);
+			end = delegate.decorateInput(ufi, `${name}:ufi`);
+			break;
+		}
+		case "correlatedSubquery": {
+			const sq = condition.related;
+			const child = buildPipelineInternal(sq.subquery, delegate, "", `${name}.${sq.subquery.alias}`, sq.correlation.childField, false);
+			const flippedJoin = new FlippedJoin({
+				parent: end,
+				child,
+				parentKey: sq.correlation.parentField,
+				childKey: sq.correlation.childField,
+				relationshipName: must(sq.subquery.alias, "Subquery must have an alias"),
+				hidden: sq.hidden ?? false,
+				system: sq.system ?? "client"
+			});
+			delegate.addEdge(end, flippedJoin);
+			delegate.addEdge(child, flippedJoin);
+			end = delegate.decorateInput(flippedJoin, `${name}:flipped-join(${sq.subquery.alias})`);
+			break;
+		}
+	}
+	return end;
+}
+function applyFilter(input, condition, delegate, name) {
+	switch (condition.type) {
+		case "and": return applyAnd(input, condition, delegate, name);
+		case "or": return applyOr(input, condition, delegate, name);
+		case "correlatedSubquery": return applyCorrelatedSubqueryCondition(input, condition, delegate, name);
+		case "simple": return applySimpleCondition(input, delegate, condition);
+	}
+}
+function applyAnd(input, condition, delegate, name) {
+	for (const subCondition of condition.conditions) input = applyFilter(input, subCondition, delegate, name);
+	return input;
+}
+function applyOr(input, condition, delegate, name) {
+	const [subqueryConditions, otherConditions] = groupSubqueryConditions(condition);
+	if (subqueryConditions.length === 0) {
+		const filter = new Filter(input, createPredicate({
+			type: "or",
+			conditions: otherConditions
+		}));
+		delegate.addEdge(input, filter);
+		return filter;
+	}
+	const fanOut = new FanOut(input);
+	delegate.addEdge(input, fanOut);
+	const branches = subqueryConditions.map((subCondition) => applyFilter(fanOut, subCondition, delegate, name));
+	if (otherConditions.length > 0) {
+		const filter = new Filter(fanOut, createPredicate({
+			type: "or",
+			conditions: otherConditions
+		}));
+		delegate.addEdge(fanOut, filter);
+		branches.push(filter);
+	}
+	const ret = new FanIn(fanOut, branches);
+	for (const branch of branches) delegate.addEdge(branch, ret);
+	fanOut.setFanIn(ret);
+	return ret;
+}
+function groupSubqueryConditions(condition) {
+	const partitioned = [[], []];
+	for (const subCondition of condition.conditions) if (isNotAndDoesNotContainSubquery(subCondition)) partitioned[1].push(subCondition);
+	else partitioned[0].push(subCondition);
+	return partitioned;
+}
+function isNotAndDoesNotContainSubquery(condition) {
+	if (condition.type === "correlatedSubquery") return false;
+	if (condition.type === "simple") return true;
+	return condition.conditions.every(isNotAndDoesNotContainSubquery);
+}
+function applySimpleCondition(input, delegate, condition) {
+	const filter = new Filter(input, createPredicate(condition));
+	delegate.decorateFilterInput(filter, `${valuePosName(condition.left)}:${condition.op}:${valuePosName(condition.right)}`);
+	delegate.addEdge(input, filter);
+	return filter;
+}
+function valuePosName(left) {
+	switch (left.type) {
+		case "static": return left.field;
+		case "literal": return left.value;
+		case "column": return left.name;
+	}
+}
+function applyCorrelatedSubQuery(sq, delegate, queryID, end, name, fromCondition) {
+	if (sq.subquery.limit === 0 && fromCondition) return end;
+	assert(sq.subquery.alias, "Subquery must have an alias");
+	const child = buildPipelineInternal(sq.subquery, delegate, queryID, `${name}.${sq.subquery.alias}`, sq.correlation.childField, fromCondition);
+	const joinName = `${name}:join(${sq.subquery.alias})`;
+	const join = new Join({
+		parent: end,
+		child,
+		parentKey: sq.correlation.parentField,
+		childKey: sq.correlation.childField,
+		relationshipName: sq.subquery.alias,
+		hidden: sq.hidden ?? false,
+		system: sq.system ?? "client"
+	});
+	delegate.addEdge(end, join);
+	delegate.addEdge(child, join);
+	return delegate.decorateInput(join, joinName);
+}
+function applyCorrelatedSubqueryCondition(input, condition, delegate, name) {
+	assert(condition.op === "EXISTS" || condition.op === "NOT EXISTS", "Expected EXISTS or NOT EXISTS operator");
+	if (condition.related.subquery.limit === 0) {
+		if (condition.op === "EXISTS") {
+			const filter = new Filter(input, () => false);
+			delegate.addEdge(input, filter);
+			return filter;
+		}
+		const filter = new Filter(input, () => true);
+		delegate.addEdge(input, filter);
+		return filter;
+	}
+	const existsName = `${name}:exists(${condition.related.subquery.alias})`;
+	const exists = new Exists(input, must(condition.related.subquery.alias), condition.related.correlation.parentField, condition.op);
+	delegate.addEdge(input, exists);
+	return delegate.decorateFilterInput(exists, existsName);
+}
+function gatherCorrelatedSubqueryQueryConditions(condition) {
+	const csqs = [];
+	const gather = (condition) => {
+		if (condition.type === "correlatedSubquery") {
+			csqs.push(condition);
+			return;
+		}
+		if (condition.type === "and" || condition.type === "or") {
+			for (const c of condition.conditions) gather(c);
+			return;
+		}
+	};
+	if (condition) gather(condition);
+	return csqs;
+}
+function uniquifyCorrelatedSubqueryConditionAliases(ast) {
+	if (!ast.where) return ast;
+	const { where } = ast;
+	if (where.type !== "and" && where.type !== "or") return ast;
+	let count = 0;
+	const uniquifyCorrelatedSubquery = (csqc) => ({
+		...csqc,
+		related: {
+			...csqc.related,
+			subquery: {
+				...csqc.related.subquery,
+				alias: (csqc.related.subquery.alias ?? "") + "_" + count++
+			}
+		}
+	});
+	const uniquify = (cond) => {
+		if (cond.type === "simple") return cond;
+		else if (cond.type === "correlatedSubquery") return uniquifyCorrelatedSubquery(cond);
+		const conditions = [];
+		for (const c of cond.conditions) conditions.push(uniquify(c));
+		return {
+			type: cond.type,
+			conditions
+		};
+	};
+	return {
+		...ast,
+		where: uniquify(where)
+	};
+}
+function conditionIncludesFlippedSubqueryAtAnyLevel(cond) {
+	if (cond.type === "correlatedSubquery") return !!cond.flip;
+	if (cond.type === "and" || cond.type === "or") return cond.conditions.some((c) => conditionIncludesFlippedSubqueryAtAnyLevel(c));
+	return false;
+}
+function partitionBranches(conditions, predicate) {
+	const matched = [];
+	const notMatched = [];
+	for (const c of conditions) if (predicate(c)) matched.push(c);
+	else notMatched.push(c);
+	return [matched, notMatched];
+}
+//#endregion
+export { bindStaticParameters, buildPipeline };
+
+//# sourceMappingURL=builder.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"builder.js","names":[],"sources":["../../../../../../zql/src/builder/builder.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\nimport {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport type {JSONValue} from '../../../shared/src/json.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {\n  AST,\n  ColumnReference,\n  CompoundKey,\n  Condition,\n  Conjunction,\n  CorrelatedSubquery,\n  CorrelatedSubqueryCondition,\n  Disjunction,\n  LiteralValue,\n  Ordering,\n  Parameter,\n  SimpleCondition,\n  ValuePosition,\n} from '../../../zero-protocol/src/ast.ts';\nimport type {Row} from '../../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\nimport {Cap} from '../ivm/cap.ts';\nimport {Exists} from '../ivm/exists.ts';\nimport {FanIn} from '../ivm/fan-in.ts';\nimport {FanOut} from '../ivm/fan-out.ts';\nimport {\n  buildFilterPipeline,\n  type FilterInput,\n} from '../ivm/filter-operators.ts';\nimport {Filter} from '../ivm/filter.ts';\nimport {FlippedJoin} from '../ivm/flipped-join.ts';\nimport {Join} from '../ivm/join.ts';\nimport type {Input, InputBase, Storage} from '../ivm/operator.ts';\nimport {Skip} from '../ivm/skip.ts';\nimport type {Source, SourceInput} from '../ivm/source.ts';\nimport {Take} from '../ivm/take.ts';\nimport {UnionFanIn} from '../ivm/union-fan-in.ts';\nimport {UnionFanOut} from '../ivm/union-fan-out.ts';\nimport {planQuery} from '../planner/planner-builder.ts';\nimport type {ConnectionCostModel} from '../planner/planner-connection.ts';\nimport type {PlanDebugger} from '../planner/planner-debug.ts';\nimport {completeOrdering} from '../query/complete-ordering.ts';\nimport type {DebugDelegate} from './debug-delegate.ts';\nimport {createPredicate, type NoSubqueryCondition} from './filter.ts';\n\nexport type StaticQueryParameters = {\n  authData: Record<string, JSONValue>;\n  preMutationRow?: Row | undefined;\n};\n\n/**\n * Interface required of caller to buildPipeline. Connects to constructed\n * pipeline to delegate environment to provide sources and storage.\n */\nexport interface BuilderDelegate {\n  readonly applyFiltersAnyway?: boolean | undefined;\n  debug?: DebugDelegate | undefined;\n\n  /**\n   * When true, allows NOT EXISTS conditions in queries.\n   * Defaults to false.\n   *\n   * We only set this to true on the server.\n   * The client-side query engine cannot support NOT EXISTS because:\n   * 1. Zero only syncs a subset of data to the client\n   * 2. On the client, we can't distinguish between a row not existing vs.\n   *    a row not being synced to the client\n   * 3. NOT EXISTS requires complete knowledge of what doesn't exist\n   */\n  readonly enableNotExists?: boolean | undefined;\n\n  /**\n   * Called once for each source needed by the AST.\n   * Might be called multiple times with same tableName. It is OK to return\n   * same storage instance in that case.\n   */\n  getSource(tableName: string): Source | undefined;\n\n  /**\n   * Called once for each operator that requires storage. Should return a new\n   * unique storage object for each call.\n   */\n  createStorage(name: string): Storage;\n\n  decorateInput(input: Input, name: string): Input;\n\n  addEdge(source: InputBase, dest: InputBase): void;\n\n  decorateFilterInput(input: FilterInput, name: string): FilterInput;\n\n  decorateSourceInput(input: SourceInput, queryID: string): Input;\n\n  /**\n   * The AST is mapped on-the-wire between client and server names.\n   *\n   * There is no \"wire\" for zqlite tests so this function is provided\n   * to allow tests to remap the AST.\n   */\n  mapAst?: ((ast: AST) => AST) | undefined;\n}\n\n/**\n * Builds a pipeline from an AST. Caller must provide a delegate to create source\n * and storage interfaces as necessary.\n *\n * Usage:\n *\n * ```ts\n * class MySink implements Output {\n *   readonly #input: Input;\n *\n *   constructor(input: Input) {\n *     this.#input = input;\n *     input.setOutput(this);\n *   }\n *\n *   push(change: Change, _: Operator) {\n *     console.log(change);\n *   }\n * }\n *\n * const input = buildPipeline(ast, myDelegate, hash(ast));\n * const sink = new MySink(input);\n * ```\n */\nexport function buildPipeline(\n  ast: AST,\n  delegate: BuilderDelegate,\n  queryID: string,\n  costModel?: ConnectionCostModel,\n  lc?: LogContext,\n  planDebugger?: PlanDebugger,\n): Input {\n  ast = delegate.mapAst ? delegate.mapAst(ast) : ast;\n  ast = completeOrdering(\n    ast,\n    tableName => must(delegate.getSource(tableName)).tableSchema.primaryKey,\n  );\n\n  if (costModel) {\n    ast = planQuery(ast, costModel, planDebugger, lc);\n  }\n  return buildPipelineInternal(ast, delegate, queryID, '');\n}\n\nexport function bindStaticParameters(\n  ast: AST,\n  staticQueryParameters: StaticQueryParameters | undefined,\n) {\n  const visit = (node: AST): AST => ({\n    ...node,\n    where: node.where ? bindCondition(node.where) : undefined,\n    related: node.related?.map(sq => ({\n      ...sq,\n      subquery: visit(sq.subquery),\n    })),\n  });\n\n  function bindCondition(condition: Condition): Condition {\n    if (condition.type === 'simple') {\n      return {\n        ...condition,\n        left: bindValue(condition.left),\n        right: bindValue(condition.right) as Exclude<\n          ValuePosition,\n          ColumnReference\n        >,\n      };\n    }\n    if (condition.type === 'correlatedSubquery') {\n      return {\n        ...condition,\n        related: {\n          ...condition.related,\n          subquery: visit(condition.related.subquery),\n        },\n      };\n    }\n\n    return {\n      ...condition,\n      conditions: condition.conditions.map(bindCondition),\n    };\n  }\n\n  const bindValue = (value: ValuePosition): ValuePosition => {\n    if (isParameter(value)) {\n      const anchor = must(\n        staticQueryParameters,\n        'Static query params do not exist',\n      )[value.anchor];\n      const resolvedValue = resolveField(anchor, value.field);\n      return {\n        type: 'literal',\n        value: resolvedValue as LiteralValue,\n      };\n    }\n    return value;\n  };\n\n  return visit(ast);\n}\n\nfunction resolveField(\n  anchor: Record<string, JSONValue> | Row | undefined,\n  field: string | string[],\n): unknown {\n  if (anchor === undefined) {\n    return null;\n  }\n\n  if (Array.isArray(field)) {\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    return field.reduce((acc, f) => (acc as any)?.[f], anchor) ?? null;\n  }\n\n  return anchor[field] ?? null;\n}\n\nfunction isParameter(value: ValuePosition): value is Parameter {\n  return value.type === 'static';\n}\n\nconst EXISTS_LIMIT = 3;\nconst PERMISSIONS_EXISTS_LIMIT = 1;\n\n/**\n * Checks if a condition tree contains any NOT EXISTS operations.\n * Recursively checks AND/OR branches but does not recurse into nested subqueries\n * (those are checked when buildPipelineInternal processes them).\n */\nexport function assertNoNotExists(condition: Condition): void {\n  switch (condition.type) {\n    case 'simple':\n      return;\n\n    case 'correlatedSubquery':\n      if (condition.op === 'NOT EXISTS') {\n        throw new Error(\n          'not(exists()) is not supported on the client - see https://bugs.rocicorp.dev/issue/3438',\n        );\n      }\n      return;\n\n    case 'and':\n    case 'or':\n      for (const c of condition.conditions) {\n        assertNoNotExists(c);\n      }\n      return;\n    default:\n      unreachable(condition);\n  }\n}\n\nfunction buildPipelineInternal(\n  ast: AST,\n  delegate: BuilderDelegate,\n  queryID: string,\n  name: string,\n  partitionKey?: CompoundKey,\n  isNonFlippedExistsChild?: boolean | undefined,\n): Input {\n  const source = delegate.getSource(ast.table);\n  if (!source) {\n    throw new Error(`Source not found: ${ast.table}`);\n  }\n\n  ast = uniquifyCorrelatedSubqueryConditionAliases(ast);\n\n  if (!delegate.enableNotExists && ast.where) {\n    assertNoNotExists(ast.where);\n  }\n\n  const csqConditions = gatherCorrelatedSubqueryQueryConditions(ast.where);\n  const splitEditKeys: Set<string> = partitionKey\n    ? new Set(partitionKey)\n    : new Set();\n  const aliases = new Set<string>();\n  for (const csq of csqConditions) {\n    aliases.add(csq.related.subquery.alias || '');\n    for (const key of csq.related.correlation.parentField) {\n      splitEditKeys.add(key);\n    }\n  }\n  if (ast.related) {\n    for (const csq of ast.related) {\n      for (const key of csq.correlation.parentField) {\n        splitEditKeys.add(key);\n      }\n    }\n  }\n  if (isNonFlippedExistsChild) {\n    assert(ast.start === undefined, 'EXISTS subqueries must not have start');\n    assert(\n      ast.related === undefined,\n      'EXISTS subqueries must not have related',\n    );\n  }\n\n  // The Cap optimization needs the source connect to be unordered, but\n  // applyFilterWithFlips builds a UnionFanIn over the source whenever\n  // ast.where contains a flipped subquery, and UnionFanIn requires a\n  // sort on its inputs. In that case, fall back to the ordered + Take\n  // path for this EXISTS child.\n  const useCap =\n    isNonFlippedExistsChild &&\n    !(ast.where && conditionIncludesFlippedSubqueryAtAnyLevel(ast.where));\n\n  const conn = source.connect(\n    // exists pipelines are unordered — orderBy is ignored here.\n    // Non-exists pipelines always have orderBy completed with PKs.\n    useCap ? undefined : must(ast.orderBy),\n    ast.where,\n    splitEditKeys,\n    delegate.debug,\n  );\n\n  let end: Input = delegate.decorateSourceInput(conn, queryID);\n  end = delegate.decorateInput(end, `${name}:source(${ast.table})`);\n  const {fullyAppliedFilters} = conn;\n\n  if (ast.start) {\n    const skip = new Skip(end, ast.start);\n    delegate.addEdge(end, skip);\n    end = delegate.decorateInput(skip, `${name}:skip)`);\n  }\n\n  for (const csqCondition of csqConditions) {\n    // flipped EXISTS are handled in applyWhere\n    if (!csqCondition.flip) {\n      end = applyCorrelatedSubQuery(\n        {\n          ...csqCondition.related,\n          subquery: {\n            ...csqCondition.related.subquery,\n            limit:\n              csqCondition.related.system === 'permissions'\n                ? PERMISSIONS_EXISTS_LIMIT\n                : EXISTS_LIMIT,\n          },\n        },\n        delegate,\n        queryID,\n        end,\n        name,\n        true,\n      );\n    }\n  }\n\n  if (ast.where && (!fullyAppliedFilters || delegate.applyFiltersAnyway)) {\n    end = applyWhere(end, ast.where, delegate, name);\n  }\n\n  if (ast.limit !== undefined) {\n    // We end `exists` pipelines with `cap`\n    // The reason is that `cap` does not care about the order of the pipeline.\n    // This allows SQLite to chose the order and never end up creating temp b-trees.\n    // The problem with SQLite creating a temp b-tree is it will incur a scan of the entire\n    // result set where exists only needs the first row.\n    if (useCap) {\n      const capName = `${name}:cap`;\n      const cap = new Cap(\n        end,\n        delegate.createStorage(capName),\n        ast.limit,\n        partitionKey,\n      );\n      delegate.addEdge(end, cap);\n      end = delegate.decorateInput(cap, capName);\n    } else {\n      const takeName = `${name}:take`;\n      const take = new Take(\n        end,\n        delegate.createStorage(takeName),\n        ast.limit,\n        partitionKey,\n      );\n      delegate.addEdge(end, take);\n      end = delegate.decorateInput(take, takeName);\n    }\n  }\n\n  if (ast.related) {\n    // Dedupe by alias - last one wins (LWW), like limit(5).limit(10)\n    const byAlias = new Map<string, CorrelatedSubquery>();\n    for (const csq of ast.related) {\n      byAlias.set(csq.subquery.alias ?? '', csq);\n    }\n    for (const csq of byAlias.values()) {\n      end = applyCorrelatedSubQuery(csq, delegate, queryID, end, name, false);\n    }\n  }\n\n  return end;\n}\n\nfunction applyWhere(\n  input: Input,\n  condition: Condition,\n  delegate: BuilderDelegate,\n  name: string,\n): Input {\n  if (!conditionIncludesFlippedSubqueryAtAnyLevel(condition)) {\n    return buildFilterPipeline(input, delegate, filterInput =>\n      applyFilter(filterInput, condition, delegate, name),\n    );\n  }\n\n  return applyFilterWithFlips(input, condition, delegate, name);\n}\n\nfunction applyFilterWithFlips(\n  input: Input,\n  condition: Condition,\n  delegate: BuilderDelegate,\n  name: string,\n): Input {\n  let end = input;\n  assert(condition.type !== 'simple', 'Simple conditions cannot have flips');\n\n  switch (condition.type) {\n    case 'and': {\n      const [withFlipped, withoutFlipped] = partitionBranches(\n        condition.conditions,\n        conditionIncludesFlippedSubqueryAtAnyLevel,\n      );\n      if (withoutFlipped.length > 0) {\n        end = buildFilterPipeline(input, delegate, filterInput =>\n          applyAnd(\n            filterInput,\n            {\n              type: 'and',\n              conditions: withoutFlipped,\n            },\n            delegate,\n            name,\n          ),\n        );\n      }\n      assert(withFlipped.length > 0, 'Impossible to have no flips here');\n      for (const cond of withFlipped) {\n        end = applyFilterWithFlips(end, cond, delegate, name);\n      }\n      break;\n    }\n    case 'or': {\n      const [withFlipped, withoutFlipped] = partitionBranches(\n        condition.conditions,\n        conditionIncludesFlippedSubqueryAtAnyLevel,\n      );\n      assert(withFlipped.length > 0, 'Impossible to have no flips here');\n\n      const ufo = new UnionFanOut(end);\n      delegate.addEdge(end, ufo);\n      end = delegate.decorateInput(ufo, `${name}:ufo`);\n\n      const branches: Input[] = [];\n      if (withoutFlipped.length > 0) {\n        branches.push(\n          buildFilterPipeline(end, delegate, filterInput =>\n            applyOr(\n              filterInput,\n              {\n                type: 'or',\n                conditions: withoutFlipped,\n              },\n              delegate,\n              name,\n            ),\n          ),\n        );\n      }\n\n      for (const cond of withFlipped) {\n        branches.push(applyFilterWithFlips(end, cond, delegate, name));\n      }\n\n      const ufi = new UnionFanIn(ufo, branches);\n      for (const branch of branches) {\n        delegate.addEdge(branch, ufi);\n      }\n      end = delegate.decorateInput(ufi, `${name}:ufi`);\n\n      break;\n    }\n    case 'correlatedSubquery': {\n      const sq = condition.related;\n      const child = buildPipelineInternal(\n        sq.subquery,\n        delegate,\n        '',\n        `${name}.${sq.subquery.alias}`,\n        sq.correlation.childField,\n        false,\n      );\n      const flippedJoin = new FlippedJoin({\n        parent: end,\n        child,\n        parentKey: sq.correlation.parentField,\n        childKey: sq.correlation.childField,\n        relationshipName: must(\n          sq.subquery.alias,\n          'Subquery must have an alias',\n        ),\n        hidden: sq.hidden ?? false,\n        system: sq.system ?? 'client',\n      });\n      delegate.addEdge(end, flippedJoin);\n      delegate.addEdge(child, flippedJoin);\n      end = delegate.decorateInput(\n        flippedJoin,\n        `${name}:flipped-join(${sq.subquery.alias})`,\n      );\n      break;\n    }\n  }\n\n  return end;\n}\n\nfunction applyFilter(\n  input: FilterInput,\n  condition: Condition,\n  delegate: BuilderDelegate,\n  name: string,\n): FilterInput {\n  switch (condition.type) {\n    case 'and':\n      return applyAnd(input, condition, delegate, name);\n    case 'or':\n      return applyOr(input, condition, delegate, name);\n    case 'correlatedSubquery':\n      return applyCorrelatedSubqueryCondition(input, condition, delegate, name);\n    case 'simple':\n      return applySimpleCondition(input, delegate, condition);\n  }\n}\n\nfunction applyAnd(\n  input: FilterInput,\n  condition: Conjunction,\n  delegate: BuilderDelegate,\n  name: string,\n): FilterInput {\n  for (const subCondition of condition.conditions) {\n    input = applyFilter(input, subCondition, delegate, name);\n  }\n  return input;\n}\n\nexport function applyOr(\n  input: FilterInput,\n  condition: Disjunction,\n  delegate: BuilderDelegate,\n  name: string,\n): FilterInput {\n  const [subqueryConditions, otherConditions] =\n    groupSubqueryConditions(condition);\n  // if there are no subquery conditions, no fan-in / fan-out is needed\n  if (subqueryConditions.length === 0) {\n    const filter = new Filter(\n      input,\n      createPredicate({\n        type: 'or',\n        conditions: otherConditions,\n      }),\n    );\n    delegate.addEdge(input, filter);\n    return filter;\n  }\n\n  const fanOut = new FanOut(input);\n  delegate.addEdge(input, fanOut);\n  const branches = subqueryConditions.map(subCondition =>\n    applyFilter(fanOut, subCondition, delegate, name),\n  );\n  if (otherConditions.length > 0) {\n    const filter = new Filter(\n      fanOut,\n      createPredicate({\n        type: 'or',\n        conditions: otherConditions,\n      }),\n    );\n    delegate.addEdge(fanOut, filter);\n    branches.push(filter);\n  }\n  const ret = new FanIn(fanOut, branches);\n  for (const branch of branches) {\n    delegate.addEdge(branch, ret);\n  }\n  fanOut.setFanIn(ret);\n  return ret;\n}\n\nexport function groupSubqueryConditions(condition: Disjunction) {\n  const partitioned: [\n    subqueryConditions: Condition[],\n    otherConditions: NoSubqueryCondition[],\n  ] = [[], []];\n  for (const subCondition of condition.conditions) {\n    if (isNotAndDoesNotContainSubquery(subCondition)) {\n      partitioned[1].push(subCondition);\n    } else {\n      partitioned[0].push(subCondition);\n    }\n  }\n  return partitioned;\n}\n\nexport function isNotAndDoesNotContainSubquery(\n  condition: Condition,\n): condition is NoSubqueryCondition {\n  if (condition.type === 'correlatedSubquery') {\n    return false;\n  }\n  if (condition.type === 'simple') {\n    return true;\n  }\n  return condition.conditions.every(isNotAndDoesNotContainSubquery);\n}\n\nfunction applySimpleCondition(\n  input: FilterInput,\n  delegate: BuilderDelegate,\n  condition: SimpleCondition,\n): FilterInput {\n  const filter = new Filter(input, createPredicate(condition));\n  delegate.decorateFilterInput(\n    filter,\n    `${valuePosName(condition.left)}:${condition.op}:${valuePosName(condition.right)}`,\n  );\n  delegate.addEdge(input, filter);\n  return filter;\n}\n\nfunction valuePosName(left: ValuePosition) {\n  switch (left.type) {\n    case 'static':\n      return left.field;\n    case 'literal':\n      return left.value;\n    case 'column':\n      return left.name;\n  }\n}\n\nfunction applyCorrelatedSubQuery(\n  sq: CorrelatedSubquery,\n  delegate: BuilderDelegate,\n  queryID: string,\n  end: Input,\n  name: string,\n  fromCondition: boolean,\n) {\n  // TODO: we only omit the join if the CSQ if from a condition since\n  // we want to create an empty array for `related` fields that are `limit(0)`\n  if (sq.subquery.limit === 0 && fromCondition) {\n    return end;\n  }\n\n  assert(sq.subquery.alias, 'Subquery must have an alias');\n  const child = buildPipelineInternal(\n    sq.subquery,\n    delegate,\n    queryID,\n    `${name}.${sq.subquery.alias}`,\n    sq.correlation.childField,\n    fromCondition,\n  );\n\n  const joinName = `${name}:join(${sq.subquery.alias})`;\n  const join = new Join({\n    parent: end,\n    child,\n    parentKey: sq.correlation.parentField,\n    childKey: sq.correlation.childField,\n    relationshipName: sq.subquery.alias,\n    hidden: sq.hidden ?? false,\n    system: sq.system ?? 'client',\n  });\n  delegate.addEdge(end, join);\n  delegate.addEdge(child, join);\n  return delegate.decorateInput(join, joinName);\n}\n\nfunction applyCorrelatedSubqueryCondition(\n  input: FilterInput,\n  condition: CorrelatedSubqueryCondition,\n  delegate: BuilderDelegate,\n  name: string,\n): FilterInput {\n  assert(\n    condition.op === 'EXISTS' || condition.op === 'NOT EXISTS',\n    'Expected EXISTS or NOT EXISTS operator',\n  );\n  if (condition.related.subquery.limit === 0) {\n    if (condition.op === 'EXISTS') {\n      const filter = new Filter(input, () => false);\n      delegate.addEdge(input, filter);\n      return filter;\n    }\n    const filter = new Filter(input, () => true);\n    delegate.addEdge(input, filter);\n    return filter;\n  }\n  const existsName = `${name}:exists(${condition.related.subquery.alias})`;\n  const exists = new Exists(\n    input,\n    must(condition.related.subquery.alias),\n    condition.related.correlation.parentField,\n    condition.op,\n  );\n  delegate.addEdge(input, exists);\n  return delegate.decorateFilterInput(exists, existsName);\n}\n\nfunction gatherCorrelatedSubqueryQueryConditions(\n  condition: Condition | undefined,\n) {\n  const csqs: CorrelatedSubqueryCondition[] = [];\n  const gather = (condition: Condition) => {\n    if (condition.type === 'correlatedSubquery') {\n      csqs.push(condition);\n      return;\n    }\n    if (condition.type === 'and' || condition.type === 'or') {\n      for (const c of condition.conditions) {\n        gather(c);\n      }\n      return;\n    }\n  };\n  if (condition) {\n    gather(condition);\n  }\n  return csqs;\n}\n\nexport function assertOrderingIncludesPK(\n  ordering: Ordering,\n  pk: PrimaryKey,\n): void {\n  // oxlint-disable-next-line unicorn/prefer-set-has -- Array is more appropriate here for small collections\n  const orderingFields = ordering.map(([field]) => field);\n  const missingFields = pk.filter(pkField => !orderingFields.includes(pkField));\n\n  if (missingFields.length > 0) {\n    throw new Error(\n      `Ordering must include all primary key fields. Missing: ${missingFields.join(\n        ', ',\n      )}. ZQL automatically appends primary key fields to the ordering if they are missing \n      so a common cause of this error is a casing mismatch between Postgres and ZQL.\n      E.g., \"userid\" vs \"userID\".\n      You may want to add double-quotes around your Postgres column names to prevent Postgres from lower-casing them:\n      https://www.postgresql.org/docs/current/sql-syntax-lexical.htm`,\n    );\n  }\n}\n\nfunction uniquifyCorrelatedSubqueryConditionAliases(ast: AST): AST {\n  if (!ast.where) {\n    return ast;\n  }\n  const {where} = ast;\n  if (where.type !== 'and' && where.type !== 'or') {\n    return ast;\n  }\n\n  let count = 0;\n  const uniquifyCorrelatedSubquery = (csqc: CorrelatedSubqueryCondition) => ({\n    ...csqc,\n    related: {\n      ...csqc.related,\n      subquery: {\n        ...csqc.related.subquery,\n        alias: (csqc.related.subquery.alias ?? '') + '_' + count++,\n      },\n    },\n  });\n\n  const uniquify = (cond: Condition): Condition => {\n    if (cond.type === 'simple') {\n      return cond;\n    } else if (cond.type === 'correlatedSubquery') {\n      return uniquifyCorrelatedSubquery(cond);\n    }\n    const conditions = [];\n    for (const c of cond.conditions) {\n      conditions.push(uniquify(c));\n    }\n    return {\n      type: cond.type,\n      conditions,\n    };\n  };\n\n  const result = {\n    ...ast,\n    where: uniquify(where),\n  };\n  return result;\n}\n\nexport function conditionIncludesFlippedSubqueryAtAnyLevel(\n  cond: Condition,\n): boolean {\n  if (cond.type === 'correlatedSubquery') {\n    return !!cond.flip;\n  }\n  if (cond.type === 'and' || cond.type === 'or') {\n    return cond.conditions.some(c =>\n      conditionIncludesFlippedSubqueryAtAnyLevel(c),\n    );\n  }\n  // simple conditions don't have flips\n  return false;\n}\n\nexport function partitionBranches(\n  conditions: readonly Condition[],\n  predicate: (c: Condition) => boolean,\n) {\n  const matched: Condition[] = [];\n  const notMatched: Condition[] = [];\n  for (const c of conditions) {\n    if (predicate(c)) {\n      matched.push(c);\n    } else {\n      notMatched.push(c);\n    }\n  }\n  return [matched, notMatched] as const;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6HA,SAAgB,cACd,KACA,UACA,SACA,WACA,IACA,cACO;CACP,MAAM,SAAS,SAAS,SAAS,OAAO,GAAG,IAAI;CAC/C,MAAM,iBACJ,MACA,cAAa,KAAK,SAAS,UAAU,SAAS,CAAC,EAAE,YAAY,UAC/D;CAEA,IAAI,WACF,MAAM,UAAU,KAAK,WAAW,cAAc,EAAE;CAElD,OAAO,sBAAsB,KAAK,UAAU,SAAS,EAAE;AACzD;AAEA,SAAgB,qBACd,KACA,uBACA;CACA,MAAM,SAAS,UAAoB;EACjC,GAAG;EACH,OAAO,KAAK,QAAQ,cAAc,KAAK,KAAK,IAAI,KAAA;EAChD,SAAS,KAAK,SAAS,KAAI,QAAO;GAChC,GAAG;GACH,UAAU,MAAM,GAAG,QAAQ;EAC7B,EAAE;CACJ;CAEA,SAAS,cAAc,WAAiC;EACtD,IAAI,UAAU,SAAS,UACrB,OAAO;GACL,GAAG;GACH,MAAM,UAAU,UAAU,IAAI;GAC9B,OAAO,UAAU,UAAU,KAAK;EAIlC;EAEF,IAAI,UAAU,SAAS,sBACrB,OAAO;GACL,GAAG;GACH,SAAS;IACP,GAAG,UAAU;IACb,UAAU,MAAM,UAAU,QAAQ,QAAQ;GAC5C;EACF;EAGF,OAAO;GACL,GAAG;GACH,YAAY,UAAU,WAAW,IAAI,aAAa;EACpD;CACF;CAEA,MAAM,aAAa,UAAwC;EACzD,IAAI,YAAY,KAAK,GAAG;GACtB,MAAM,SAAS,KACb,uBACA,kCACF,EAAE,MAAM;GAER,OAAO;IACL,MAAM;IACN,OAHoB,aAAa,QAAQ,MAAM,KAGxC;GACT;EACF;EACA,OAAO;CACT;CAEA,OAAO,MAAM,GAAG;AAClB;AAEA,SAAS,aACP,QACA,OACS;CACT,IAAI,WAAW,KAAA,GACb,OAAO;CAGT,IAAI,MAAM,QAAQ,KAAK,GAErB,OAAO,MAAM,QAAQ,KAAK,MAAO,MAAc,IAAI,MAAM,KAAK;CAGhE,OAAO,OAAO,UAAU;AAC1B;AAEA,SAAS,YAAY,OAA0C;CAC7D,OAAO,MAAM,SAAS;AACxB;AAEA,IAAM,eAAe;AACrB,IAAM,2BAA2B;;;;;;AAOjC,SAAgB,kBAAkB,WAA4B;CAC5D,QAAQ,UAAU,MAAlB;EACE,KAAK,UACH;EAEF,KAAK;GACH,IAAI,UAAU,OAAO,cACnB,MAAM,IAAI,MACR,yFACF;GAEF;EAEF,KAAK;EACL,KAAK;GACH,KAAK,MAAM,KAAK,UAAU,YACxB,kBAAkB,CAAC;GAErB;EACF,SACE,YAAY,SAAS;CACzB;AACF;AAEA,SAAS,sBACP,KACA,UACA,SACA,MACA,cACA,yBACO;CACP,MAAM,SAAS,SAAS,UAAU,IAAI,KAAK;CAC3C,IAAI,CAAC,QACH,MAAM,IAAI,MAAM,qBAAqB,IAAI,OAAO;CAGlD,MAAM,2CAA2C,GAAG;CAEpD,IAAI,CAAC,SAAS,mBAAmB,IAAI,OACnC,kBAAkB,IAAI,KAAK;CAG7B,MAAM,gBAAgB,wCAAwC,IAAI,KAAK;CACvE,MAAM,gBAA6B,eAC/B,IAAI,IAAI,YAAY,oBACpB,IAAI,IAAI;CACZ,MAAM,0BAAU,IAAI,IAAY;CAChC,KAAK,MAAM,OAAO,eAAe;EAC/B,QAAQ,IAAI,IAAI,QAAQ,SAAS,SAAS,EAAE;EAC5C,KAAK,MAAM,OAAO,IAAI,QAAQ,YAAY,aACxC,cAAc,IAAI,GAAG;CAEzB;CACA,IAAI,IAAI,SACN,KAAK,MAAM,OAAO,IAAI,SACpB,KAAK,MAAM,OAAO,IAAI,YAAY,aAChC,cAAc,IAAI,GAAG;CAI3B,IAAI,yBAAyB;EAC3B,OAAO,IAAI,UAAU,KAAA,GAAW,uCAAuC;EACvE,OACE,IAAI,YAAY,KAAA,GAChB,yCACF;CACF;CAOA,MAAM,SACJ,2BACA,EAAE,IAAI,SAAS,2CAA2C,IAAI,KAAK;CAErE,MAAM,OAAO,OAAO,QAGlB,SAAS,KAAA,IAAY,KAAK,IAAI,OAAO,GACrC,IAAI,OACJ,eACA,SAAS,KACX;CAEA,IAAI,MAAa,SAAS,oBAAoB,MAAM,OAAO;CAC3D,MAAM,SAAS,cAAc,KAAK,GAAG,KAAK,UAAU,IAAI,MAAM,EAAE;CAChE,MAAM,EAAC,wBAAuB;CAE9B,IAAI,IAAI,OAAO;EACb,MAAM,OAAO,IAAI,KAAK,KAAK,IAAI,KAAK;EACpC,SAAS,QAAQ,KAAK,IAAI;EAC1B,MAAM,SAAS,cAAc,MAAM,GAAG,KAAK,OAAO;CACpD;CAEA,KAAK,MAAM,gBAAgB,eAEzB,IAAI,CAAC,aAAa,MAChB,MAAM,wBACJ;EACE,GAAG,aAAa;EAChB,UAAU;GACR,GAAG,aAAa,QAAQ;GACxB,OACE,aAAa,QAAQ,WAAW,gBAC5B,2BACA;EACR;CACF,GACA,UACA,SACA,KACA,MACA,IACF;CAIJ,IAAI,IAAI,UAAU,CAAC,uBAAuB,SAAS,qBACjD,MAAM,WAAW,KAAK,IAAI,OAAO,UAAU,IAAI;CAGjD,IAAI,IAAI,UAAU,KAAA,GAMhB,IAAI,QAAQ;EACV,MAAM,UAAU,GAAG,KAAK;EACxB,MAAM,MAAM,IAAI,IACd,KACA,SAAS,cAAc,OAAO,GAC9B,IAAI,OACJ,YACF;EACA,SAAS,QAAQ,KAAK,GAAG;EACzB,MAAM,SAAS,cAAc,KAAK,OAAO;CAC3C,OAAO;EACL,MAAM,WAAW,GAAG,KAAK;EACzB,MAAM,OAAO,IAAI,KACf,KACA,SAAS,cAAc,QAAQ,GAC/B,IAAI,OACJ,YACF;EACA,SAAS,QAAQ,KAAK,IAAI;EAC1B,MAAM,SAAS,cAAc,MAAM,QAAQ;CAC7C;CAGF,IAAI,IAAI,SAAS;EAEf,MAAM,0BAAU,IAAI,IAAgC;EACpD,KAAK,MAAM,OAAO,IAAI,SACpB,QAAQ,IAAI,IAAI,SAAS,SAAS,IAAI,GAAG;EAE3C,KAAK,MAAM,OAAO,QAAQ,OAAO,GAC/B,MAAM,wBAAwB,KAAK,UAAU,SAAS,KAAK,MAAM,KAAK;CAE1E;CAEA,OAAO;AACT;AAEA,SAAS,WACP,OACA,WACA,UACA,MACO;CACP,IAAI,CAAC,2CAA2C,SAAS,GACvD,OAAO,oBAAoB,OAAO,WAAU,gBAC1C,YAAY,aAAa,WAAW,UAAU,IAAI,CACpD;CAGF,OAAO,qBAAqB,OAAO,WAAW,UAAU,IAAI;AAC9D;AAEA,SAAS,qBACP,OACA,WACA,UACA,MACO;CACP,IAAI,MAAM;CACV,OAAO,UAAU,SAAS,UAAU,qCAAqC;CAEzE,QAAQ,UAAU,MAAlB;EACE,KAAK,OAAO;GACV,MAAM,CAAC,aAAa,kBAAkB,kBACpC,UAAU,YACV,0CACF;GACA,IAAI,eAAe,SAAS,GAC1B,MAAM,oBAAoB,OAAO,WAAU,gBACzC,SACE,aACA;IACE,MAAM;IACN,YAAY;GACd,GACA,UACA,IACF,CACF;GAEF,OAAO,YAAY,SAAS,GAAG,kCAAkC;GACjE,KAAK,MAAM,QAAQ,aACjB,MAAM,qBAAqB,KAAK,MAAM,UAAU,IAAI;GAEtD;EACF;EACA,KAAK,MAAM;GACT,MAAM,CAAC,aAAa,kBAAkB,kBACpC,UAAU,YACV,0CACF;GACA,OAAO,YAAY,SAAS,GAAG,kCAAkC;GAEjE,MAAM,MAAM,IAAI,YAAY,GAAG;GAC/B,SAAS,QAAQ,KAAK,GAAG;GACzB,MAAM,SAAS,cAAc,KAAK,GAAG,KAAK,KAAK;GAE/C,MAAM,WAAoB,CAAC;GAC3B,IAAI,eAAe,SAAS,GAC1B,SAAS,KACP,oBAAoB,KAAK,WAAU,gBACjC,QACE,aACA;IACE,MAAM;IACN,YAAY;GACd,GACA,UACA,IACF,CACF,CACF;GAGF,KAAK,MAAM,QAAQ,aACjB,SAAS,KAAK,qBAAqB,KAAK,MAAM,UAAU,IAAI,CAAC;GAG/D,MAAM,MAAM,IAAI,WAAW,KAAK,QAAQ;GACxC,KAAK,MAAM,UAAU,UACnB,SAAS,QAAQ,QAAQ,GAAG;GAE9B,MAAM,SAAS,cAAc,KAAK,GAAG,KAAK,KAAK;GAE/C;EACF;EACA,KAAK,sBAAsB;GACzB,MAAM,KAAK,UAAU;GACrB,MAAM,QAAQ,sBACZ,GAAG,UACH,UACA,IACA,GAAG,KAAK,GAAG,GAAG,SAAS,SACvB,GAAG,YAAY,YACf,KACF;GACA,MAAM,cAAc,IAAI,YAAY;IAClC,QAAQ;IACR;IACA,WAAW,GAAG,YAAY;IAC1B,UAAU,GAAG,YAAY;IACzB,kBAAkB,KAChB,GAAG,SAAS,OACZ,6BACF;IACA,QAAQ,GAAG,UAAU;IACrB,QAAQ,GAAG,UAAU;GACvB,CAAC;GACD,SAAS,QAAQ,KAAK,WAAW;GACjC,SAAS,QAAQ,OAAO,WAAW;GACnC,MAAM,SAAS,cACb,aACA,GAAG,KAAK,gBAAgB,GAAG,SAAS,MAAM,EAC5C;GACA;EACF;CACF;CAEA,OAAO;AACT;AAEA,SAAS,YACP,OACA,WACA,UACA,MACa;CACb,QAAQ,UAAU,MAAlB;EACE,KAAK,OACH,OAAO,SAAS,OAAO,WAAW,UAAU,IAAI;EAClD,KAAK,MACH,OAAO,QAAQ,OAAO,WAAW,UAAU,IAAI;EACjD,KAAK,sBACH,OAAO,iCAAiC,OAAO,WAAW,UAAU,IAAI;EAC1E,KAAK,UACH,OAAO,qBAAqB,OAAO,UAAU,SAAS;CAC1D;AACF;AAEA,SAAS,SACP,OACA,WACA,UACA,MACa;CACb,KAAK,MAAM,gBAAgB,UAAU,YACnC,QAAQ,YAAY,OAAO,cAAc,UAAU,IAAI;CAEzD,OAAO;AACT;AAEA,SAAgB,QACd,OACA,WACA,UACA,MACa;CACb,MAAM,CAAC,oBAAoB,mBACzB,wBAAwB,SAAS;CAEnC,IAAI,mBAAmB,WAAW,GAAG;EACnC,MAAM,SAAS,IAAI,OACjB,OACA,gBAAgB;GACd,MAAM;GACN,YAAY;EACd,CAAC,CACH;EACA,SAAS,QAAQ,OAAO,MAAM;EAC9B,OAAO;CACT;CAEA,MAAM,SAAS,IAAI,OAAO,KAAK;CAC/B,SAAS,QAAQ,OAAO,MAAM;CAC9B,MAAM,WAAW,mBAAmB,KAAI,iBACtC,YAAY,QAAQ,cAAc,UAAU,IAAI,CAClD;CACA,IAAI,gBAAgB,SAAS,GAAG;EAC9B,MAAM,SAAS,IAAI,OACjB,QACA,gBAAgB;GACd,MAAM;GACN,YAAY;EACd,CAAC,CACH;EACA,SAAS,QAAQ,QAAQ,MAAM;EAC/B,SAAS,KAAK,MAAM;CACtB;CACA,MAAM,MAAM,IAAI,MAAM,QAAQ,QAAQ;CACtC,KAAK,MAAM,UAAU,UACnB,SAAS,QAAQ,QAAQ,GAAG;CAE9B,OAAO,SAAS,GAAG;CACnB,OAAO;AACT;AAEA,SAAgB,wBAAwB,WAAwB;CAC9D,MAAM,cAGF,CAAC,CAAC,GAAG,CAAC,CAAC;CACX,KAAK,MAAM,gBAAgB,UAAU,YACnC,IAAI,+BAA+B,YAAY,GAC7C,YAAY,GAAG,KAAK,YAAY;MAEhC,YAAY,GAAG,KAAK,YAAY;CAGpC,OAAO;AACT;AAEA,SAAgB,+BACd,WACkC;CAClC,IAAI,UAAU,SAAS,sBACrB,OAAO;CAET,IAAI,UAAU,SAAS,UACrB,OAAO;CAET,OAAO,UAAU,WAAW,MAAM,8BAA8B;AAClE;AAEA,SAAS,qBACP,OACA,UACA,WACa;CACb,MAAM,SAAS,IAAI,OAAO,OAAO,gBAAgB,SAAS,CAAC;CAC3D,SAAS,oBACP,QACA,GAAG,aAAa,UAAU,IAAI,EAAE,GAAG,UAAU,GAAG,GAAG,aAAa,UAAU,KAAK,GACjF;CACA,SAAS,QAAQ,OAAO,MAAM;CAC9B,OAAO;AACT;AAEA,SAAS,aAAa,MAAqB;CACzC,QAAQ,KAAK,MAAb;EACE,KAAK,UACH,OAAO,KAAK;EACd,KAAK,WACH,OAAO,KAAK;EACd,KAAK,UACH,OAAO,KAAK;CAChB;AACF;AAEA,SAAS,wBACP,IACA,UACA,SACA,KACA,MACA,eACA;CAGA,IAAI,GAAG,SAAS,UAAU,KAAK,eAC7B,OAAO;CAGT,OAAO,GAAG,SAAS,OAAO,6BAA6B;CACvD,MAAM,QAAQ,sBACZ,GAAG,UACH,UACA,SACA,GAAG,KAAK,GAAG,GAAG,SAAS,SACvB,GAAG,YAAY,YACf,aACF;CAEA,MAAM,WAAW,GAAG,KAAK,QAAQ,GAAG,SAAS,MAAM;CACnD,MAAM,OAAO,IAAI,KAAK;EACpB,QAAQ;EACR;EACA,WAAW,GAAG,YAAY;EAC1B,UAAU,GAAG,YAAY;EACzB,kBAAkB,GAAG,SAAS;EAC9B,QAAQ,GAAG,UAAU;EACrB,QAAQ,GAAG,UAAU;CACvB,CAAC;CACD,SAAS,QAAQ,KAAK,IAAI;CAC1B,SAAS,QAAQ,OAAO,IAAI;CAC5B,OAAO,SAAS,cAAc,MAAM,QAAQ;AAC9C;AAEA,SAAS,iCACP,OACA,WACA,UACA,MACa;CACb,OACE,UAAU,OAAO,YAAY,UAAU,OAAO,cAC9C,wCACF;CACA,IAAI,UAAU,QAAQ,SAAS,UAAU,GAAG;EAC1C,IAAI,UAAU,OAAO,UAAU;GAC7B,MAAM,SAAS,IAAI,OAAO,aAAa,KAAK;GAC5C,SAAS,QAAQ,OAAO,MAAM;GAC9B,OAAO;EACT;EACA,MAAM,SAAS,IAAI,OAAO,aAAa,IAAI;EAC3C,SAAS,QAAQ,OAAO,MAAM;EAC9B,OAAO;CACT;CACA,MAAM,aAAa,GAAG,KAAK,UAAU,UAAU,QAAQ,SAAS,MAAM;CACtE,MAAM,SAAS,IAAI,OACjB,OACA,KAAK,UAAU,QAAQ,SAAS,KAAK,GACrC,UAAU,QAAQ,YAAY,aAC9B,UAAU,EACZ;CACA,SAAS,QAAQ,OAAO,MAAM;CAC9B,OAAO,SAAS,oBAAoB,QAAQ,UAAU;AACxD;AAEA,SAAS,wCACP,WACA;CACA,MAAM,OAAsC,CAAC;CAC7C,MAAM,UAAU,cAAyB;EACvC,IAAI,UAAU,SAAS,sBAAsB;GAC3C,KAAK,KAAK,SAAS;GACnB;EACF;EACA,IAAI,UAAU,SAAS,SAAS,UAAU,SAAS,MAAM;GACvD,KAAK,MAAM,KAAK,UAAU,YACxB,OAAO,CAAC;GAEV;EACF;CACF;CACA,IAAI,WACF,OAAO,SAAS;CAElB,OAAO;AACT;AAuBA,SAAS,2CAA2C,KAAe;CACjE,IAAI,CAAC,IAAI,OACP,OAAO;CAET,MAAM,EAAC,UAAS;CAChB,IAAI,MAAM,SAAS,SAAS,MAAM,SAAS,MACzC,OAAO;CAGT,IAAI,QAAQ;CACZ,MAAM,8BAA8B,UAAuC;EACzE,GAAG;EACH,SAAS;GACP,GAAG,KAAK;GACR,UAAU;IACR,GAAG,KAAK,QAAQ;IAChB,QAAQ,KAAK,QAAQ,SAAS,SAAS,MAAM,MAAM;GACrD;EACF;CACF;CAEA,MAAM,YAAY,SAA+B;EAC/C,IAAI,KAAK,SAAS,UAChB,OAAO;OACF,IAAI,KAAK,SAAS,sBACvB,OAAO,2BAA2B,IAAI;EAExC,MAAM,aAAa,CAAC;EACpB,KAAK,MAAM,KAAK,KAAK,YACnB,WAAW,KAAK,SAAS,CAAC,CAAC;EAE7B,OAAO;GACL,MAAM,KAAK;GACX;EACF;CACF;CAMA,OAAO;EAHL,GAAG;EACH,OAAO,SAAS,KAAK;CAEhB;AACT;AAEA,SAAgB,2CACd,MACS;CACT,IAAI,KAAK,SAAS,sBAChB,OAAO,CAAC,CAAC,KAAK;CAEhB,IAAI,KAAK,SAAS,SAAS,KAAK,SAAS,MACvC,OAAO,KAAK,WAAW,MAAK,MAC1B,2CAA2C,CAAC,CAC9C;CAGF,OAAO;AACT;AAEA,SAAgB,kBACd,YACA,WACA;CACA,MAAM,UAAuB,CAAC;CAC9B,MAAM,aAA0B,CAAC;CACjC,KAAK,MAAM,KAAK,YACd,IAAI,UAAU,CAAC,GACb,QAAQ,KAAK,CAAC;MAEd,WAAW,KAAK,CAAC;CAGrB,OAAO,CAAC,SAAS,UAAU;AAC7B"}

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

@@ -0,0 +1,81 @@
+import "../../../zero-protocol/src/data.js";
+//#region ../zql/src/builder/debug-delegate.ts
+var runtimeDebugFlags = {
+	trackRowCountsVended: false,
+	trackRowsVended: false
+};
+var Debug = class {
+	#rowCountsBySource;
+	#rowsBySource;
+	#nvisitBySource;
+	#plans;
+	constructor() {
+		this.#rowCountsBySource = {};
+		this.#rowsBySource = {};
+		this.#nvisitBySource = {};
+		this.#plans = {};
+	}
+	getVendedRowCounts() {
+		return this.#rowCountsBySource;
+	}
+	getVendedRows() {
+		return this.#rowsBySource;
+	}
+	getNVisitCounts() {
+		return this.#nvisitBySource;
+	}
+	getSQLitePlans() {
+		return this.#plans;
+	}
+	initQuery(table, query) {
+		const { counts } = this.#getRowStats(table);
+		if (counts) {
+			if (!counts[query]) counts[query] = 0;
+		}
+	}
+	reset() {
+		this.#rowCountsBySource = {};
+		this.#rowsBySource = {};
+		this.#nvisitBySource = {};
+		this.#plans = {};
+	}
+	rowVended(table, query, row) {
+		const { counts, rows } = this.#getRowStats(table);
+		if (counts) counts[query] = (counts[query] ?? 0) + 1;
+		if (rows) (rows[query] ??= []).push(row);
+	}
+	recordNVisit(table, query, nvisit) {
+		let nvisitCounts = this.#nvisitBySource[table];
+		if (!nvisitCounts) {
+			nvisitCounts = {};
+			this.#nvisitBySource[table] = nvisitCounts;
+		}
+		if (!nvisitCounts[query]) nvisitCounts[query] = 0;
+		nvisitCounts[query] += nvisit;
+	}
+	recordExplain(_table, query, plan) {
+		this.#plans[query] = plan;
+	}
+	#getRowStats(source) {
+		let counts;
+		let rows;
+		counts = this.#rowCountsBySource[source];
+		if (!counts) {
+			counts = {};
+			this.#rowCountsBySource[source] = counts;
+		}
+		rows = this.#rowsBySource[source];
+		if (!rows) {
+			rows = {};
+			this.#rowsBySource[source] = rows;
+		}
+		return {
+			counts,
+			rows
+		};
+	}
+};
+//#endregion
+export { Debug, runtimeDebugFlags };
+
+//# sourceMappingURL=debug-delegate.js.map

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

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

package/out/packages/zql/src/builder/filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter.js","names":[],"sources":["../../../../../../zql/src/builder/filter.ts"],"sourcesContent":["import {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport type {\n  Condition,\n  SimpleCondition,\n  SimpleOperator,\n} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport {simplifyCondition} from '../query/expression.ts';\nimport {getLikePredicate} from './like.ts';\n\nexport type NonNullValue = Exclude<Value, null | undefined>;\nexport type SimplePredicate = (rhs: Value) => boolean;\nexport type SimplePredicateNoNull = (rhs: NonNullValue) => boolean;\n\nexport type NoSubqueryCondition =\n  | SimpleCondition\n  | {\n      type: 'and';\n      conditions: readonly NoSubqueryCondition[];\n    }\n  | {\n      type: 'or';\n      conditions: readonly NoSubqueryCondition[];\n    };\n\nexport function createPredicate(\n  condition: NoSubqueryCondition,\n): (row: Row) => boolean {\n  if (condition.type !== 'simple') {\n    const predicates = condition.conditions.map(c => createPredicate(c));\n    return condition.type === 'and'\n      ? (row: Row) => {\n          // and\n          for (const predicate of predicates) {\n            if (!predicate(row)) {\n              return false;\n            }\n          }\n          return true;\n        }\n      : (row: Row) => {\n          // or\n          for (const predicate of predicates) {\n            if (predicate(row)) {\n              return true;\n            }\n          }\n          return false;\n        };\n  }\n  const {left} = condition;\n  const {right} = condition;\n  assert(\n    right.type !== 'static',\n    'static values should be resolved before creating predicates',\n  );\n  assert(\n    left.type !== 'static',\n    'static values should be resolved before creating predicates',\n  );\n\n  switch (condition.op) {\n    case 'IS':\n    case 'IS NOT': {\n      const impl = createIsPredicate(right.value, condition.op);\n      if (left.type === 'literal') {\n        const result = impl(left.value);\n        return () => result;\n      }\n      return (row: Row) => impl(row[left.name]);\n    }\n  }\n\n  if (right.value === null || right.value === undefined) {\n    return (_row: Row) => false;\n  }\n\n  const impl = createPredicateImpl(right.value, condition.op);\n  if (left.type === 'literal') {\n    if (left.value === null || left.value === undefined) {\n      return (_row: Row) => false;\n    }\n    const result = impl(left.value);\n    return () => result;\n  }\n\n  return (row: Row) => {\n    const lhs = row[left.name];\n    if (lhs === null || lhs === undefined) {\n      return false;\n    }\n    return impl(lhs);\n  };\n}\n\nfunction createIsPredicate(\n  rhs: Value | readonly Value[],\n  operator: 'IS' | 'IS NOT',\n): SimplePredicate {\n  switch (operator) {\n    case 'IS':\n      return lhs => lhs === rhs;\n    case 'IS NOT':\n      return lhs => lhs !== rhs;\n  }\n}\n\nfunction createPredicateImpl(\n  rhs: NonNullValue | readonly NonNullValue[],\n  operator: Exclude<SimpleOperator, 'IS' | 'IS NOT'>,\n): SimplePredicateNoNull {\n  switch (operator) {\n    case '=':\n      return lhs => lhs === rhs;\n    case '!=':\n      return lhs => lhs !== rhs;\n    case '<':\n      return lhs => lhs < rhs;\n    case '<=':\n      return lhs => lhs <= rhs;\n    case '>':\n      return lhs => lhs > rhs;\n    case '>=':\n      return lhs => lhs >= rhs;\n    case 'LIKE':\n      return getLikePredicate(rhs, '');\n    case 'NOT LIKE':\n      return not(getLikePredicate(rhs, ''));\n    case 'ILIKE':\n      return getLikePredicate(rhs, 'i');\n    case 'NOT ILIKE':\n      return not(getLikePredicate(rhs, 'i'));\n    case 'IN': {\n      assert(Array.isArray(rhs), 'Expected rhs to be an array for IN operator');\n      const set = new Set(rhs);\n      return lhs => set.has(lhs);\n    }\n    case 'NOT IN': {\n      assert(\n        Array.isArray(rhs),\n        'Expected rhs to be an array for NOT IN operator',\n      );\n      const set = new Set(rhs);\n      return lhs => !set.has(lhs);\n    }\n    default:\n      operator satisfies never;\n      throw new Error(`Unexpected operator: ${operator}`);\n  }\n}\n\nfunction not<T>(f: (lhs: T) => boolean) {\n  return (lhs: T) => !f(lhs);\n}\n\n/**\n * If the condition contains any CorrelatedSubqueryConditions, returns a\n * transformed condition which contains no CorrelatedSubqueryCondition(s) but\n * which will filter a subset of the rows that would be filtered by the original\n * condition, or undefined if no such transformation exists.\n *\n * If the condition does not contain any CorrelatedSubqueryConditions\n * returns the condition unmodified and `conditionsRemoved: false`.\n */\nexport function transformFilters(filters: Condition | undefined): {\n  filters: NoSubqueryCondition | undefined;\n  conditionsRemoved: boolean;\n} {\n  if (!filters) {\n    return {filters: undefined, conditionsRemoved: false};\n  }\n  switch (filters.type) {\n    case 'simple':\n      return {filters, conditionsRemoved: false};\n    case 'correlatedSubquery':\n      return {filters: undefined, conditionsRemoved: true};\n    case 'and':\n    case 'or': {\n      const transformedConditions: NoSubqueryCondition[] = [];\n      let conditionsRemoved = false;\n      for (const cond of filters.conditions) {\n        const transformed = transformFilters(cond);\n        // If any branch of the OR ends up empty, the entire OR needs\n        // to be removed.\n        if (transformed.filters === undefined && filters.type === 'or') {\n          return {filters: undefined, conditionsRemoved: true};\n        }\n        conditionsRemoved = conditionsRemoved || transformed.conditionsRemoved;\n        if (transformed.filters) {\n          transformedConditions.push(transformed.filters);\n        }\n      }\n      return {\n        filters: simplifyCondition({\n          type: filters.type,\n          conditions: transformedConditions,\n        }) as NoSubqueryCondition,\n        conditionsRemoved,\n      };\n    }\n    default:\n      unreachable(filters);\n  }\n}\n"],"mappings":";;;;AAyBA,SAAgB,gBACd,WACuB;CACvB,IAAI,UAAU,SAAS,UAAU;EAC/B,MAAM,aAAa,UAAU,WAAW,KAAI,MAAK,gBAAgB,CAAC,CAAC;EACnE,OAAO,UAAU,SAAS,SACrB,QAAa;GAEZ,KAAK,MAAM,aAAa,YACtB,IAAI,CAAC,UAAU,GAAG,GAChB,OAAO;GAGX,OAAO;EACT,KACC,QAAa;GAEZ,KAAK,MAAM,aAAa,YACtB,IAAI,UAAU,GAAG,GACf,OAAO;GAGX,OAAO;EACT;CACN;CACA,MAAM,EAAC,SAAQ;CACf,MAAM,EAAC,UAAS;CAChB,OACE,MAAM,SAAS,UACf,6DACF;CACA,OACE,KAAK,SAAS,UACd,6DACF;CAEA,QAAQ,UAAU,IAAlB;EACE,KAAK;EACL,KAAK,UAAU;GACb,MAAM,OAAO,kBAAkB,MAAM,OAAO,UAAU,EAAE;GACxD,IAAI,KAAK,SAAS,WAAW;IAC3B,MAAM,SAAS,KAAK,KAAK,KAAK;IAC9B,aAAa;GACf;GACA,QAAQ,QAAa,KAAK,IAAI,KAAK,KAAK;EAC1C;CACF;CAEA,IAAI,MAAM,UAAU,QAAQ,MAAM,UAAU,KAAA,GAC1C,QAAQ,SAAc;CAGxB,MAAM,OAAO,oBAAoB,MAAM,OAAO,UAAU,EAAE;CAC1D,IAAI,KAAK,SAAS,WAAW;EAC3B,IAAI,KAAK,UAAU,QAAQ,KAAK,UAAU,KAAA,GACxC,QAAQ,SAAc;EAExB,MAAM,SAAS,KAAK,KAAK,KAAK;EAC9B,aAAa;CACf;CAEA,QAAQ,QAAa;EACnB,MAAM,MAAM,IAAI,KAAK;EACrB,IAAI,QAAQ,QAAQ,QAAQ,KAAA,GAC1B,OAAO;EAET,OAAO,KAAK,GAAG;CACjB;AACF;AAEA,SAAS,kBACP,KACA,UACiB;CACjB,QAAQ,UAAR;EACE,KAAK,MACH,QAAO,QAAO,QAAQ;EACxB,KAAK,UACH,QAAO,QAAO,QAAQ;CAC1B;AACF;AAEA,SAAS,oBACP,KACA,UACuB;CACvB,QAAQ,UAAR;EACE,KAAK,KACH,QAAO,QAAO,QAAQ;EACxB,KAAK,MACH,QAAO,QAAO,QAAQ;EACxB,KAAK,KACH,QAAO,QAAO,MAAM;EACtB,KAAK,MACH,QAAO,QAAO,OAAO;EACvB,KAAK,KACH,QAAO,QAAO,MAAM;EACtB,KAAK,MACH,QAAO,QAAO,OAAO;EACvB,KAAK,QACH,OAAO,iBAAiB,KAAK,EAAE;EACjC,KAAK,YACH,OAAO,IAAI,iBAAiB,KAAK,EAAE,CAAC;EACtC,KAAK,SACH,OAAO,iBAAiB,KAAK,GAAG;EAClC,KAAK,aACH,OAAO,IAAI,iBAAiB,KAAK,GAAG,CAAC;EACvC,KAAK,MAAM;GACT,OAAO,MAAM,QAAQ,GAAG,GAAG,6CAA6C;GACxE,MAAM,MAAM,IAAI,IAAI,GAAG;GACvB,QAAO,QAAO,IAAI,IAAI,GAAG;EAC3B;EACA,KAAK,UAAU;GACb,OACE,MAAM,QAAQ,GAAG,GACjB,iDACF;GACA,MAAM,MAAM,IAAI,IAAI,GAAG;GACvB,QAAO,QAAO,CAAC,IAAI,IAAI,GAAG;EAC5B;EACA,SAEE,MAAM,IAAI,MAAM,wBAAwB,UAAU;CACtD;AACF;AAEA,SAAS,IAAO,GAAwB;CACtC,QAAQ,QAAW,CAAC,EAAE,GAAG;AAC3B;;;;;;;;;;AAWA,SAAgB,iBAAiB,SAG/B;CACA,IAAI,CAAC,SACH,OAAO;EAAC,SAAS,KAAA;EAAW,mBAAmB;CAAK;CAEtD,QAAQ,QAAQ,MAAhB;EACE,KAAK,UACH,OAAO;GAAC;GAAS,mBAAmB;EAAK;EAC3C,KAAK,sBACH,OAAO;GAAC,SAAS,KAAA;GAAW,mBAAmB;EAAI;EACrD,KAAK;EACL,KAAK,MAAM;GACT,MAAM,wBAA+C,CAAC;GACtD,IAAI,oBAAoB;GACxB,KAAK,MAAM,QAAQ,QAAQ,YAAY;IACrC,MAAM,cAAc,iBAAiB,IAAI;IAGzC,IAAI,YAAY,YAAY,KAAA,KAAa,QAAQ,SAAS,MACxD,OAAO;KAAC,SAAS,KAAA;KAAW,mBAAmB;IAAI;IAErD,oBAAoB,qBAAqB,YAAY;IACrD,IAAI,YAAY,SACd,sBAAsB,KAAK,YAAY,OAAO;GAElD;GACA,OAAO;IACL,SAAS,kBAAkB;KACzB,MAAM,QAAQ;KACd,YAAY;IACd,CAAC;IACD;GACF;EACF;EACA,SACE,YAAY,OAAO;CACvB;AACF"}

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

@@ -0,0 +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  return new RegExp(pattern + '$', flags + 'm');\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;CACA,OAAO,IAAI,OAAO,UAAU,KAAK,QAAQ,GAAG;AAC9C"}

package/out/packages/zql/src/error.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"error.js","names":[],"sources":["../../../../../zql/src/error.ts"],"sourcesContent":["export class NotImplementedError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = 'NotImplementedError';\n  }\n}\n\nexport type PlannerExceptionKind = 'max_flippable_joins';\n\nexport class PlannerException extends Error {\n  readonly kind: PlannerExceptionKind;\n\n  constructor(kind: PlannerExceptionKind, message: string) {\n    super(message);\n    this.name = 'PlannerException';\n    this.kind = kind;\n  }\n}\n"],"mappings":";AAAA,IAAa,sBAAb,cAAyC,MAAM;CAC7C,YAAY,SAAiB;EAC3B,MAAM,OAAO;EACb,KAAK,OAAO;CACd;AACF"}

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

@@ -0,0 +1 @@
+{"version":3,"file":"array-view.js","names":["#input","#listeners","#schema","#format","#root","#updateTTL","#resultType","#error","#fireListeners","#hydrate","#fireListener","#dirty"],"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  readonly #schema: SourceSchema;\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  readonly #root: Entry;\n\n  onDestroy: (() => void) | undefined;\n\n  #dirty = false;\n  #resultType: ResultType = 'unknown';\n  #error: ErroredQuery | undefined;\n  readonly #updateTTL: (ttl: TTL) => void;\n\n  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.#schema = input.getSchema();\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(() => {\n          this.#resultType = 'complete';\n          this.#fireListeners();\n        })\n        .catch(e => {\n          this.#resultType = 'error';\n          this.#error = e;\n          this.#fireListeners();\n        });\n    }\n    this.#hydrate();\n  }\n\n  get data() {\n    return this.#root[''] as V;\n  }\n\n  addListener(listener: Listener<V>) {\n    assert(!this.#listeners.has(listener), 'Listener already registered');\n    this.#listeners.add(listener);\n\n    this.#fireListener(listener);\n\n    return () => {\n      this.#listeners.delete(listener);\n    };\n  }\n\n  #fireListeners() {\n    for (const listener of this.#listeners) {\n      this.#fireListener(listener);\n    }\n  }\n\n  #fireListener(listener: Listener<V>) {\n    listener(this.data as Immutable<V>, this.#resultType, this.#error);\n  }\n\n  destroy() {\n    this.onDestroy?.();\n  }\n\n  #hydrate() {\n    this.#dirty = true;\n    for (const node of skipYields(this.#input.fetch({}))) {\n      applyChange(\n        this.#root,\n        {type: 'add', node},\n        this.#schema,\n        '',\n        this.#format,\n      );\n    }\n    this.flush();\n  }\n\n  push(change: Change) {\n    this.#dirty = true;\n    applyChange(\n      this.#root,\n      changeToViewChange(change),\n      this.#schema,\n      '',\n      this.#format,\n    );\n    return emptyArray;\n  }\n\n  flush() {\n    if (!this.#dirty) {\n      return;\n    }\n    this.#dirty = false;\n    this.#fireListeners();\n  }\n\n  updateTTL(ttl: TTL) {\n    this.#updateTTL(ttl);\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;CAC3C;CACA;CAIA;CAEA;CAEA,SAAS;CACT,cAA0B;CAC1B;CACA;CAEA,YACE,OACA,QACA,eACA,WACA;EACA,KAAKA,SAAS;EACd,KAAKE,UAAU,MAAM,UAAU;EAC/B,KAAKC,UAAU;EACf,KAAKE,aAAa;EAClB,KAAKD,QAAQ,EAAC,IAAI,OAAO,WAAW,KAAA,IAAY,CAAC,EAAC;EAClD,MAAM,UAAU,IAAI;EAEpB,IAAI,kBAAkB,MACpB,KAAKE,cAAc;OACd,IAAI,WAAW,eAAe;GACnC,KAAKA,cAAc;GACnB,KAAKC,SAAS;EAChB,OACE,cACG,WAAW;GACV,KAAKD,cAAc;GACnB,KAAKE,eAAe;EACtB,CAAC,EACA,OAAM,MAAK;GACV,KAAKF,cAAc;GACnB,KAAKC,SAAS;GACd,KAAKC,eAAe;EACtB,CAAC;EAEL,KAAKC,SAAS;CAChB;CAEA,IAAI,OAAO;EACT,OAAO,KAAKL,MAAM;CACpB;CAEA,YAAY,UAAuB;EACjC,OAAO,CAAC,KAAKH,WAAW,IAAI,QAAQ,GAAG,6BAA6B;EACpE,KAAKA,WAAW,IAAI,QAAQ;EAE5B,KAAKS,cAAc,QAAQ;EAE3B,aAAa;GACX,KAAKT,WAAW,OAAO,QAAQ;EACjC;CACF;CAEA,iBAAiB;EACf,KAAK,MAAM,YAAY,KAAKA,YAC1B,KAAKS,cAAc,QAAQ;CAE/B;CAEA,cAAc,UAAuB;EACnC,SAAS,KAAK,MAAsB,KAAKJ,aAAa,KAAKC,MAAM;CACnE;CAEA,UAAU;EACR,KAAK,YAAY;CACnB;CAEA,WAAW;EACT,KAAKI,SAAS;EACd,KAAK,MAAM,QAAQ,WAAW,KAAKX,OAAO,MAAM,CAAC,CAAC,CAAC,GACjD,YACE,KAAKI,OACL;GAAC,MAAM;GAAO;EAAI,GAClB,KAAKF,SACL,IACA,KAAKC,OACP;EAEF,KAAK,MAAM;CACb;CAEA,KAAK,QAAgB;EACnB,KAAKQ,SAAS;EACd,YACE,KAAKP,OACL,mBAAmB,MAAM,GACzB,KAAKF,SACL,IACA,KAAKC,OACP;EACA,OAAO;CACT;CAEA,QAAQ;EACN,IAAI,CAAC,KAAKQ,QACR;EAEF,KAAKA,SAAS;EACd,KAAKH,eAAe;CACtB;CAEA,UAAU,KAAU;EAClB,KAAKH,WAAW,GAAG;CACrB;AACF"}

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

@@ -0,0 +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 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 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}\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 constraint = deserializePKToConstraint(pk, this.#primaryKey);\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;\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      yield* this.#output.push(change, this);\n    }\n    // If not in our set, drop\n  }\n\n  destroy(): void {\n    this.#input.destroy();\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":";;;;;;;;;;;;;;;;;;;;;AAmDA,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,aAAa,0BAA0B,IAAI,KAAKF,WAAW;GACjE,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,CAACE,gBAAgB,QAAqC;EACpD,OACE,CAAC,KAAKJ,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;EAGF,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;CAEF;CAEA,UAAgB;EACd,KAAKN,OAAO,QAAQ;CACtB;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"}