@rocicorp/zero 1.12.0-canary.1 → 1.12.0-canary.3

package/out/zero-protocol/src/inspect-down.d.ts

@@ -100,33 +100,6 @@ export declare const inspectAnalyzeQueryDownSchema: v.ObjectType<Omit<{
             type: "attempt-start";
             attemptNumber: number;
             totalAttempts: number;
-        } | {
-            type: "connection-selected";
-            attemptNumber: number;
-            connection: string;
-            cost: number;
-            isRoot: boolean;
-        } | {
-            type: "plan-failed";
-            attemptNumber: number;
-            reason: string;
-        } | {
-            type: "best-plan-selected";
-            bestAttemptNumber: number;
-            totalCost: number;
-            flipPattern: number;
-            joinStates: {
-                join: string;
-                type: "flipped" | "semi" | "unflippable" | v.Unrecognized<string>;
-            }[];
-        } | {
-            type: "node-constraint";
-            attemptNumber?: number | undefined;
-            nodeType: "connection" | "fan-in" | "fan-out" | "filter" | "join" | "terminus" | v.Unrecognized<string>;
-            node: string;
-            branchPattern: number[];
-            constraint?: Record<string, unknown> | null | undefined;
-            from: string;
         } | {
             type: "connection-costs";
             attemptNumber: number;
@@ -152,6 +125,12 @@ export declare const inspectAnalyzeQueryDownSchema: v.ObjectType<Omit<{
                     limit?: number | undefined;
                 }>;
             }[];
+        } | {
+            type: "connection-selected";
+            attemptNumber: number;
+            connection: string;
+            cost: number;
+            isRoot: boolean;
         } | {
             type: "constraints-propagated";
             attemptNumber: number;
@@ -176,6 +155,19 @@ export declare const inspectAnalyzeQueryDownSchema: v.ObjectType<Omit<{
                 join: string;
                 type: "flipped" | "semi" | "unflippable" | v.Unrecognized<string>;
             }[];
+        } | {
+            type: "plan-failed";
+            attemptNumber: number;
+            reason: string;
+        } | {
+            type: "best-plan-selected";
+            bestAttemptNumber: number;
+            totalCost: number;
+            flipPattern: number;
+            joinStates: {
+                join: string;
+                type: "flipped" | "semi" | "unflippable" | v.Unrecognized<string>;
+            }[];
         } | {
             type: "node-cost";
             attemptNumber?: number | undefined;
@@ -194,6 +186,14 @@ export declare const inspectAnalyzeQueryDownSchema: v.ObjectType<Omit<{
             filters?: import("./ast.ts").Condition | undefined;
             ordering?: readonly (readonly [string, "asc" | "desc"])[] | undefined;
             joinType?: "flipped" | "semi" | "unflippable" | v.Unrecognized<string> | undefined;
+        } | {
+            type: "node-constraint";
+            attemptNumber?: number | undefined;
+            nodeType: "connection" | "fan-in" | "fan-out" | "filter" | "join" | "terminus" | v.Unrecognized<string>;
+            node: string;
+            branchPattern: number[];
+            constraint?: Record<string, unknown> | null | undefined;
+            from: string;
         })[]>;
     }, undefined>;
 }, undefined>;
@@ -266,33 +266,6 @@ export declare const inspectDownBodySchema: v.UnionType<[v.ObjectType<Omit<{
             type: "attempt-start";
             attemptNumber: number;
             totalAttempts: number;
-        } | {
-            type: "connection-selected";
-            attemptNumber: number;
-            connection: string;
-            cost: number;
-            isRoot: boolean;
-        } | {
-            type: "plan-failed";
-            attemptNumber: number;
-            reason: string;
-        } | {
-            type: "best-plan-selected";
-            bestAttemptNumber: number;
-            totalCost: number;
-            flipPattern: number;
-            joinStates: {
-                join: string;
-                type: "flipped" | "semi" | "unflippable" | v.Unrecognized<string>;
-            }[];
-        } | {
-            type: "node-constraint";
-            attemptNumber?: number | undefined;
-            nodeType: "connection" | "fan-in" | "fan-out" | "filter" | "join" | "terminus" | v.Unrecognized<string>;
-            node: string;
-            branchPattern: number[];
-            constraint?: Record<string, unknown> | null | undefined;
-            from: string;
         } | {
             type: "connection-costs";
             attemptNumber: number;
@@ -318,6 +291,12 @@ export declare const inspectDownBodySchema: v.UnionType<[v.ObjectType<Omit<{
                     limit?: number | undefined;
                 }>;
             }[];
+        } | {
+            type: "connection-selected";
+            attemptNumber: number;
+            connection: string;
+            cost: number;
+            isRoot: boolean;
         } | {
             type: "constraints-propagated";
             attemptNumber: number;
@@ -342,6 +321,19 @@ export declare const inspectDownBodySchema: v.UnionType<[v.ObjectType<Omit<{
                 join: string;
                 type: "flipped" | "semi" | "unflippable" | v.Unrecognized<string>;
             }[];
+        } | {
+            type: "plan-failed";
+            attemptNumber: number;
+            reason: string;
+        } | {
+            type: "best-plan-selected";
+            bestAttemptNumber: number;
+            totalCost: number;
+            flipPattern: number;
+            joinStates: {
+                join: string;
+                type: "flipped" | "semi" | "unflippable" | v.Unrecognized<string>;
+            }[];
         } | {
             type: "node-cost";
             attemptNumber?: number | undefined;
@@ -360,6 +352,14 @@ export declare const inspectDownBodySchema: v.UnionType<[v.ObjectType<Omit<{
             filters?: import("./ast.ts").Condition | undefined;
             ordering?: readonly (readonly [string, "asc" | "desc"])[] | undefined;
             joinType?: "flipped" | "semi" | "unflippable" | v.Unrecognized<string> | undefined;
+        } | {
+            type: "node-constraint";
+            attemptNumber?: number | undefined;
+            nodeType: "connection" | "fan-in" | "fan-out" | "filter" | "join" | "terminus" | v.Unrecognized<string>;
+            node: string;
+            branchPattern: number[];
+            constraint?: Record<string, unknown> | null | undefined;
+            from: string;
         })[]>;
     }, undefined>;
 }, undefined>, v.ObjectType<Omit<{
@@ -429,33 +429,6 @@ export declare const inspectDownMessageSchema: v.TupleType<[v.Type<"inspect">, v
             type: "attempt-start";
             attemptNumber: number;
             totalAttempts: number;
-        } | {
-            type: "connection-selected";
-            attemptNumber: number;
-            connection: string;
-            cost: number;
-            isRoot: boolean;
-        } | {
-            type: "plan-failed";
-            attemptNumber: number;
-            reason: string;
-        } | {
-            type: "best-plan-selected";
-            bestAttemptNumber: number;
-            totalCost: number;
-            flipPattern: number;
-            joinStates: {
-                join: string;
-                type: "flipped" | "semi" | "unflippable" | v.Unrecognized<string>;
-            }[];
-        } | {
-            type: "node-constraint";
-            attemptNumber?: number | undefined;
-            nodeType: "connection" | "fan-in" | "fan-out" | "filter" | "join" | "terminus" | v.Unrecognized<string>;
-            node: string;
-            branchPattern: number[];
-            constraint?: Record<string, unknown> | null | undefined;
-            from: string;
         } | {
             type: "connection-costs";
             attemptNumber: number;
@@ -481,6 +454,12 @@ export declare const inspectDownMessageSchema: v.TupleType<[v.Type<"inspect">, v
                     limit?: number | undefined;
                 }>;
             }[];
+        } | {
+            type: "connection-selected";
+            attemptNumber: number;
+            connection: string;
+            cost: number;
+            isRoot: boolean;
         } | {
             type: "constraints-propagated";
             attemptNumber: number;
@@ -505,6 +484,19 @@ export declare const inspectDownMessageSchema: v.TupleType<[v.Type<"inspect">, v
                 join: string;
                 type: "flipped" | "semi" | "unflippable" | v.Unrecognized<string>;
             }[];
+        } | {
+            type: "plan-failed";
+            attemptNumber: number;
+            reason: string;
+        } | {
+            type: "best-plan-selected";
+            bestAttemptNumber: number;
+            totalCost: number;
+            flipPattern: number;
+            joinStates: {
+                join: string;
+                type: "flipped" | "semi" | "unflippable" | v.Unrecognized<string>;
+            }[];
         } | {
             type: "node-cost";
             attemptNumber?: number | undefined;
@@ -523,6 +515,14 @@ export declare const inspectDownMessageSchema: v.TupleType<[v.Type<"inspect">, v
             filters?: import("./ast.ts").Condition | undefined;
             ordering?: readonly (readonly [string, "asc" | "desc"])[] | undefined;
             joinType?: "flipped" | "semi" | "unflippable" | v.Unrecognized<string> | undefined;
+        } | {
+            type: "node-constraint";
+            attemptNumber?: number | undefined;
+            nodeType: "connection" | "fan-in" | "fan-out" | "filter" | "join" | "terminus" | v.Unrecognized<string>;
+            node: string;
+            branchPattern: number[];
+            constraint?: Record<string, unknown> | null | undefined;
+            from: string;
         })[]>;
     }, undefined>;
 }, undefined>, v.ObjectType<Omit<{

package/out/zero-protocol/src/poke.d.ts

@@ -85,14 +85,14 @@ export declare const pokePartBodySchema: v.ObjectType<{
                 clientID: string;
             };
             result: {
-                data?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
-            } | {
                 error: "app";
                 message?: string | undefined;
                 details?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
             } | {
                 error: "alreadyProcessed" | "oooMutation";
                 details?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
+            } | {
+                data?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
             };
         };
     } | {
@@ -156,14 +156,14 @@ export declare const pokePartsSchema: v.ArrayType<v.ObjectType<{
                 clientID: string;
             };
             result: {
-                data?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
-            } | {
                 error: "app";
                 message?: string | undefined;
                 details?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
             } | {
                 error: "alreadyProcessed" | "oooMutation";
                 details?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
+            } | {
+                data?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
             };
         };
     } | {
@@ -240,14 +240,14 @@ export declare const pokePartMessageSchema: v.TupleType<[v.Type<"pokePart">, v.O
                 clientID: string;
             };
             result: {
-                data?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
-            } | {
                 error: "app";
                 message?: string | undefined;
                 details?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
             } | {
                 error: "alreadyProcessed" | "oooMutation";
                 details?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
+            } | {
+                data?: import("../../shared/src/json.ts").ReadonlyJSONValue | undefined;
             };
         };
     } | {

package/out/zero-protocol/src/up.d.ts

@@ -4,17 +4,17 @@ export declare const upstreamSchema: v.Type<v.UnrecognizedTuple | ["ackMutationR
     clientID: string;
 }] | ["changeDesiredQueries", {
     desiredQueriesPatch: ({
+        op: "del";
+        hash: string;
+    } | {
+        op: "clear";
+    } | {
         op: "put";
         hash: string;
         ttl?: number | undefined;
         ast?: import("./ast.ts").AST | undefined;
         name?: string | undefined;
         args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-    } | {
-        op: "del";
-        hash: string;
-    } | {
-        op: "clear";
     })[];
     traceparent?: string | undefined;
 }] | ["closeConnection", unknown[]] | ["deleteClients", {
@@ -22,17 +22,17 @@ export declare const upstreamSchema: v.Type<v.UnrecognizedTuple | ["ackMutationR
     readonly clientGroupIDs?: readonly string[] | undefined;
 }] | ["initConnection", {
     desiredQueriesPatch: ({
+        op: "del";
+        hash: string;
+    } | {
+        op: "clear";
+    } | {
         op: "put";
         hash: string;
         ttl?: number | undefined;
         ast?: import("./ast.ts").AST | undefined;
         name?: string | undefined;
         args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-    } | {
-        op: "del";
-        hash: string;
-    } | {
-        op: "clear";
     })[];
     clientSchema?: {
         tables: Record<string, {
@@ -135,17 +135,17 @@ export declare const upstreamSchema: v.Type<v.UnrecognizedTuple | ["ackMutationR
         clientID: string;
     }] | ["changeDesiredQueries", {
         desiredQueriesPatch: ({
+            op: "del";
+            hash: string;
+        } | {
+            op: "clear";
+        } | {
             op: "put";
             hash: string;
             ttl?: number | undefined;
             ast?: import("./ast.ts").AST | undefined;
             name?: string | undefined;
             args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-        } | {
-            op: "del";
-            hash: string;
-        } | {
-            op: "clear";
         })[];
         traceparent?: string | undefined;
     }] | ["closeConnection", unknown[]] | ["deleteClients", {
@@ -153,17 +153,17 @@ export declare const upstreamSchema: v.Type<v.UnrecognizedTuple | ["ackMutationR
         readonly clientGroupIDs?: readonly string[] | undefined;
     }] | ["initConnection", {
         desiredQueriesPatch: ({
+            op: "del";
+            hash: string;
+        } | {
+            op: "clear";
+        } | {
             op: "put";
             hash: string;
             ttl?: number | undefined;
             ast?: import("./ast.ts").AST | undefined;
             name?: string | undefined;
             args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-        } | {
-            op: "del";
-            hash: string;
-        } | {
-            op: "clear";
         })[];
         clientSchema?: {
             tables: Record<string, {
@@ -265,17 +265,17 @@ export declare const upstreamSchema: v.Type<v.UnrecognizedTuple | ["ackMutationR
         clientID: string;
     }] | ["changeDesiredQueries", {
         desiredQueriesPatch: ({
+            op: "del";
+            hash: string;
+        } | {
+            op: "clear";
+        } | {
             op: "put";
             hash: string;
             ttl?: number | undefined;
             ast?: import("./ast.ts").AST | undefined;
             name?: string | undefined;
             args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-        } | {
-            op: "del";
-            hash: string;
-        } | {
-            op: "clear";
         })[];
         traceparent?: string | undefined;
     }] | ["closeConnection", unknown[]] | ["deleteClients", {
@@ -283,17 +283,17 @@ export declare const upstreamSchema: v.Type<v.UnrecognizedTuple | ["ackMutationR
         readonly clientGroupIDs?: readonly string[] | undefined;
     }] | ["initConnection", {
         desiredQueriesPatch: ({
+            op: "del";
+            hash: string;
+        } | {
+            op: "clear";
+        } | {
             op: "put";
             hash: string;
             ttl?: number | undefined;
             ast?: import("./ast.ts").AST | undefined;
             name?: string | undefined;
             args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-        } | {
-            op: "del";
-            hash: string;
-        } | {
-            op: "clear";
         })[];
         clientSchema?: {
             tables: Record<string, {
@@ -397,17 +397,17 @@ export declare const upstreamSchemaWithUnparsedAnalyzeQuery: v.Type<v.Unrecogniz
     clientID: string;
 }] | ["changeDesiredQueries", {
     desiredQueriesPatch: ({
+        op: "del";
+        hash: string;
+    } | {
+        op: "clear";
+    } | {
         op: "put";
         hash: string;
         ttl?: number | undefined;
         ast?: import("./ast.ts").AST | undefined;
         name?: string | undefined;
         args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-    } | {
-        op: "del";
-        hash: string;
-    } | {
-        op: "clear";
     })[];
     traceparent?: string | undefined;
 }] | ["closeConnection", unknown[]] | ["deleteClients", {
@@ -415,17 +415,17 @@ export declare const upstreamSchemaWithUnparsedAnalyzeQuery: v.Type<v.Unrecogniz
     readonly clientGroupIDs?: readonly string[] | undefined;
 }] | ["initConnection", {
     desiredQueriesPatch: ({
+        op: "del";
+        hash: string;
+    } | {
+        op: "clear";
+    } | {
         op: "put";
         hash: string;
         ttl?: number | undefined;
         ast?: import("./ast.ts").AST | undefined;
         name?: string | undefined;
         args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-    } | {
-        op: "del";
-        hash: string;
-    } | {
-        op: "clear";
     })[];
     clientSchema?: {
         tables: Record<string, {
@@ -528,17 +528,17 @@ export declare const upstreamSchemaWithUnparsedAnalyzeQuery: v.Type<v.Unrecogniz
         clientID: string;
     }] | ["changeDesiredQueries", {
         desiredQueriesPatch: ({
+            op: "del";
+            hash: string;
+        } | {
+            op: "clear";
+        } | {
             op: "put";
             hash: string;
             ttl?: number | undefined;
             ast?: import("./ast.ts").AST | undefined;
             name?: string | undefined;
             args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-        } | {
-            op: "del";
-            hash: string;
-        } | {
-            op: "clear";
         })[];
         traceparent?: string | undefined;
     }] | ["closeConnection", unknown[]] | ["deleteClients", {
@@ -546,17 +546,17 @@ export declare const upstreamSchemaWithUnparsedAnalyzeQuery: v.Type<v.Unrecogniz
         readonly clientGroupIDs?: readonly string[] | undefined;
     }] | ["initConnection", {
         desiredQueriesPatch: ({
+            op: "del";
+            hash: string;
+        } | {
+            op: "clear";
+        } | {
             op: "put";
             hash: string;
             ttl?: number | undefined;
             ast?: import("./ast.ts").AST | undefined;
             name?: string | undefined;
             args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-        } | {
-            op: "del";
-            hash: string;
-        } | {
-            op: "clear";
         })[];
         clientSchema?: {
             tables: Record<string, {
@@ -658,17 +658,17 @@ export declare const upstreamSchemaWithUnparsedAnalyzeQuery: v.Type<v.Unrecogniz
         clientID: string;
     }] | ["changeDesiredQueries", {
         desiredQueriesPatch: ({
+            op: "del";
+            hash: string;
+        } | {
+            op: "clear";
+        } | {
             op: "put";
             hash: string;
             ttl?: number | undefined;
             ast?: import("./ast.ts").AST | undefined;
             name?: string | undefined;
             args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-        } | {
-            op: "del";
-            hash: string;
-        } | {
-            op: "clear";
         })[];
         traceparent?: string | undefined;
     }] | ["closeConnection", unknown[]] | ["deleteClients", {
@@ -676,17 +676,17 @@ export declare const upstreamSchemaWithUnparsedAnalyzeQuery: v.Type<v.Unrecogniz
         readonly clientGroupIDs?: readonly string[] | undefined;
     }] | ["initConnection", {
         desiredQueriesPatch: ({
+            op: "del";
+            hash: string;
+        } | {
+            op: "clear";
+        } | {
             op: "put";
             hash: string;
             ttl?: number | undefined;
             ast?: import("./ast.ts").AST | undefined;
             name?: string | undefined;
             args?: readonly import("../../shared/src/json.ts").ReadonlyJSONValue[] | undefined;
-        } | {
-            op: "del";
-            hash: string;
-        } | {
-            op: "clear";
         })[];
         clientSchema?: {
             tables: Record<string, {

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":["#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, 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,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,KAAK,WAAW;GAC1C;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,cACC,KACA,aACwB;EACxB,IAAI,KAAKL,WAAW,GAClB;EAGF,OACE,8BAA8B,IAAI,YAAY,KAAKC,aAAa,GAChE,uCACF;EAKA,IAAI,OAAO;EACX,MAAM,MAAgB,CAAC;EACvB,IAAI,wBAAwB;EAC5B,IAAI,kBAAkB;EACtB,IAAI;GACF,KAAK,MAAM,aAAa,KAAKH,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"}