@rocicorp/zero 0.26.0-canary.0 → 0.26.0-canary.3

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

@@ -205,7 +205,10 @@ class Take {
           }
         }
       }
-      assert(boundNode !== void 0);
+      assert(
+        boundNode !== void 0,
+        "Take: boundNode must be found during fetch"
+      );
       const removeChange = {
         type: "remove",
         node: boundNode
@@ -351,7 +354,10 @@ class Take {
           beforeBoundNode = node;
           break;
         }
-        assert(beforeBoundNode !== void 0);
+        assert(
+          beforeBoundNode !== void 0,
+          "Take: beforeBoundNode must be found during fetch"
+        );
         this.#setTakeState(
           takeStateKey,
           takeState.size,
@@ -377,7 +383,10 @@ class Take {
         newBoundNode = node;
         break;
       }
-      assert(newBoundNode !== void 0);
+      assert(
+        newBoundNode !== void 0,
+        "Take: newBoundNode must be found during fetch"
+      );
       if (compareRows(newBoundNode.row, change.node.row) === 0) {
         yield* replaceBoundAndForwardChange();
         return;
@@ -427,8 +436,14 @@ class Take {
           break;
         }
       }
-      assert(oldBoundNode !== void 0);
-      assert(newBoundNode !== void 0);
+      assert(
+        oldBoundNode !== void 0,
+        "Take: oldBoundNode must be found during fetch"
+      );
+      assert(
+        newBoundNode !== void 0,
+        "Take: newBoundNode must be found during fetch"
+      );
       this.#setTakeState(
         takeStateKey,
         takeState.size,
@@ -470,7 +485,10 @@ class Take {
         afterBoundNode = node;
         break;
       }
-      assert(afterBoundNode !== void 0);
+      assert(
+        afterBoundNode !== void 0,
+        "Take: afterBoundNode must be found during fetch"
+      );
       if (compareRows(afterBoundNode.row, change.node.row) === 0) {
         yield* replaceBoundAndForwardChange();
         return;

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

@@ -1 +1 @@
-{"version":3,"file":"take.js","sources":["../../../../../zql/src/ivm/take.ts"],"sourcesContent":["import {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport {hasOwn} from '../../../shared/src/has-own.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\nimport {assertOrderingIncludesPK} from '../query/complete-ordering.ts';\nimport {type Change, type EditChange, type RemoveChange} from './change.ts';\nimport type {Constraint} from './constraint.ts';\nimport {compareValues, type Comparator, type 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';\n\nconst MAX_BOUND_KEY = 'maxBound';\n\ntype TakeState = {\n  size: number;\n  bound: Row | undefined;\n};\n\ninterface TakeStorage {\n  get(key: typeof MAX_BOUND_KEY): Row | undefined;\n  get(key: string): TakeState | undefined;\n  set(key: typeof MAX_BOUND_KEY, value: Row): void;\n  set(key: string, value: TakeState): void;\n  del(key: string): void;\n}\n\nexport type PartitionKey = PrimaryKey;\n\n/**\n * The Take operator is for implementing limit queries. It takes the first n\n * nodes of its input as determined by the input’s comparator. It then keeps\n * a *bound* of the last item it has accepted so that it can evaluate whether\n * new incoming pushes should be accepted or rejected.\n *\n * Take can count rows globally or by unique value of some field.\n *\n * Maintains the invariant that its output size is always <= limit, even\n * mid processing of a push.\n */\nexport class Take implements Operator {\n  readonly #input: Input;\n  readonly #storage: TakeStorage;\n  readonly #limit: number;\n  readonly #partitionKey: PartitionKey | undefined;\n  readonly #partitionKeyComparator: Comparator | undefined;\n  // Fetch overlay needed for some split push cases.\n  #rowHiddenFromFetch: Row | undefined;\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    assertOrderingIncludesPK(\n      input.getSchema().sort,\n      input.getSchema().primaryKey,\n    );\n    input.setOutput(this);\n    this.#input = input;\n    this.#storage = storage as TakeStorage;\n    this.#limit = limit;\n    this.#partitionKey = partitionKey;\n    this.#partitionKeyComparator =\n      partitionKey && makePartitionKeyComparator(partitionKey);\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    if (\n      !this.#partitionKey ||\n      (req.constraint &&\n        constraintMatchesPartitionKey(req.constraint, this.#partitionKey))\n    ) {\n      const takeStateKey = getTakeStateKey(this.#partitionKey, req.constraint);\n      const takeState = this.#storage.get(takeStateKey);\n      if (!takeState) {\n        yield* this.#initialFetch(req);\n        return;\n      }\n      if (takeState.bound === undefined) {\n        return;\n      }\n      for (const inputNode of this.#input.fetch(req)) {\n        if (inputNode === 'yield') {\n          yield inputNode;\n          continue;\n        }\n        if (this.getSchema().compareRows(takeState.bound, inputNode.row) < 0) {\n          return;\n        }\n        if (\n          this.#rowHiddenFromFetch &&\n          this.getSchema().compareRows(\n            this.#rowHiddenFromFetch,\n            inputNode.row,\n          ) === 0\n        ) {\n          continue;\n        }\n        yield inputNode;\n      }\n      return;\n    }\n    // There is a partition key, but the fetch is not constrained or constrained\n    // on a different key.  Thus we don't have a single take state to bound by.\n    // This currently only happens with nested sub-queries\n    // e.g. issues include issuelabels include label.  We could remove this\n    // case if we added a translation layer (powered by some state) in join.\n    // Specifically we need joinKeyValue => parent constraint key\n    const maxBound = this.#storage.get(MAX_BOUND_KEY);\n    if (maxBound === undefined) {\n      return;\n    }\n    for (const inputNode of this.#input.fetch(req)) {\n      if (inputNode === 'yield') {\n        yield inputNode;\n        continue;\n      }\n      if (this.getSchema().compareRows(inputNode.row, maxBound) > 0) {\n        return;\n      }\n      const takeStateKey = getTakeStateKey(this.#partitionKey, inputNode.row);\n      const takeState = this.#storage.get(takeStateKey);\n      if (\n        takeState?.bound !== undefined &&\n        this.getSchema().compareRows(takeState.bound, inputNode.row) >= 0\n      ) {\n        yield inputNode;\n      }\n    }\n  }\n\n  *#initialFetch(req: FetchRequest): Stream<Node | 'yield'> {\n    assert(req.start === undefined, 'Start should be undefined');\n    assert(!req.reverse, 'Reverse should be false');\n    assert(\n      constraintMatchesPartitionKey(req.constraint, this.#partitionKey),\n      'Constraint should match partition key',\n    );\n\n    if (this.#limit === 0) {\n      return;\n    }\n\n    const takeStateKey = getTakeStateKey(this.#partitionKey, req.constraint);\n    assert(\n      this.#storage.get(takeStateKey) === undefined,\n      'Take state should be undefined',\n    );\n\n    let size = 0;\n    let bound: Row | undefined;\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        bound = inputNode.row;\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.#setTakeState(\n          takeStateKey,\n          size,\n          bound,\n          this.#storage.get(MAX_BOUND_KEY),\n        );\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 takeState is properly hydrated.\n        assert(\n          !downstreamEarlyReturn,\n          'Unexpected early return prevented full hydration',\n        );\n      }\n    }\n  }\n\n  #getStateAndConstraint(row: Row) {\n    const takeStateKey = getTakeStateKey(this.#partitionKey, row);\n    const takeState = this.#storage.get(takeStateKey);\n    let maxBound: Row | undefined;\n    let constraint: Constraint | undefined;\n    if (takeState) {\n      maxBound = this.#storage.get(MAX_BOUND_KEY);\n      constraint =\n        this.#partitionKey &&\n        Object.fromEntries(\n          this.#partitionKey.map(key => [key, row[key]] as const),\n        );\n    }\n\n    return {takeState, takeStateKey, maxBound, constraint} as\n      | {\n          takeState: undefined;\n          takeStateKey: string;\n          maxBound: undefined;\n          constraint: undefined;\n        }\n      | {\n          takeState: TakeState;\n          takeStateKey: string;\n          maxBound: Row | undefined;\n          constraint: Constraint | undefined;\n        };\n  }\n\n  *push(change: Change): Stream<'yield'> {\n    if (change.type === 'edit') {\n      yield* this.#pushEditChange(change);\n      return;\n    }\n\n    const {takeState, takeStateKey, maxBound, constraint} =\n      this.#getStateAndConstraint(change.node.row);\n    if (!takeState) {\n      return;\n    }\n\n    const {compareRows} = this.getSchema();\n\n    if (change.type === 'add') {\n      if (takeState.size < this.#limit) {\n        this.#setTakeState(\n          takeStateKey,\n          takeState.size + 1,\n          takeState.bound === undefined ||\n            compareRows(takeState.bound, change.node.row) < 0\n            ? change.node.row\n            : takeState.bound,\n          maxBound,\n        );\n        yield* this.#output.push(change, this);\n        return;\n      }\n      // size === limit\n      if (\n        takeState.bound === undefined ||\n        compareRows(change.node.row, takeState.bound) >= 0\n      ) {\n        return;\n      }\n      // added row < bound\n      let beforeBoundNode: Node | undefined;\n      let boundNode: Node | undefined;\n      if (this.#limit === 1) {\n        for (const node of this.#input.fetch({\n          start: {\n            row: takeState.bound,\n            basis: 'at',\n          },\n          constraint,\n        })) {\n          if (node === 'yield') {\n            yield node;\n            continue;\n          }\n          boundNode = node;\n          break;\n        }\n      } else {\n        for (const node of this.#input.fetch({\n          start: {\n            row: takeState.bound,\n            basis: 'at',\n          },\n          constraint,\n          reverse: true,\n        })) {\n          if (node === 'yield') {\n            yield node;\n            continue;\n          } else if (boundNode === undefined) {\n            boundNode = node;\n          } else {\n            beforeBoundNode = node;\n            break;\n          }\n        }\n      }\n      assert(boundNode !== undefined);\n      const removeChange: RemoveChange = {\n        type: 'remove',\n        node: boundNode,\n      };\n      // Remove before add to maintain invariant that\n      // output size <= limit.\n      this.#setTakeState(\n        takeStateKey,\n        takeState.size,\n        beforeBoundNode === undefined ||\n          compareRows(change.node.row, beforeBoundNode.row) > 0\n          ? change.node.row\n          : beforeBoundNode.row,\n        maxBound,\n      );\n      yield* this.#pushWithRowHiddenFromFetch(change.node.row, removeChange);\n      yield* this.#output.push(change, this);\n    } else if (change.type === 'remove') {\n      if (takeState.bound === undefined) {\n        // change is after bound\n        return;\n      }\n      const compToBound = compareRows(change.node.row, takeState.bound);\n      if (compToBound > 0) {\n        // change is after bound\n        return;\n      }\n      let beforeBoundNode: Node | undefined;\n      for (const node of this.#input.fetch({\n        start: {\n          row: takeState.bound,\n          basis: 'after',\n        },\n        constraint,\n        reverse: true,\n      })) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        }\n        beforeBoundNode = node;\n        break;\n      }\n\n      let newBound: {node: Node; push: boolean} | undefined;\n      if (beforeBoundNode) {\n        const push = compareRows(beforeBoundNode.row, takeState.bound) > 0;\n        newBound = {\n          node: beforeBoundNode,\n          push,\n        };\n      }\n      if (!newBound?.push) {\n        for (const node of this.#input.fetch({\n          start: {\n            row: takeState.bound,\n            basis: 'at',\n          },\n          constraint,\n        })) {\n          if (node === 'yield') {\n            yield node;\n            continue;\n          }\n          const push = compareRows(node.row, takeState.bound) > 0;\n          newBound = {\n            node,\n            push,\n          };\n          if (push) {\n            break;\n          }\n        }\n      }\n\n      if (newBound?.push) {\n        yield* this.#output.push(change, this);\n        this.#setTakeState(\n          takeStateKey,\n          takeState.size,\n          newBound.node.row,\n          maxBound,\n        );\n        yield* this.#output.push(\n          {\n            type: 'add',\n            node: newBound.node,\n          },\n          this,\n        );\n        return;\n      }\n      this.#setTakeState(\n        takeStateKey,\n        takeState.size - 1,\n        newBound?.node.row,\n        maxBound,\n      );\n      yield* this.#output.push(change, this);\n    } else if (change.type === 'child') {\n      // A 'child' change should be pushed to output if its row\n      // is <= bound.\n      if (\n        takeState.bound &&\n        compareRows(change.node.row, takeState.bound) <= 0\n      ) {\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(change.oldNode.row, change.node.row) === 0,\n      'Unexpected change of partition key',\n    );\n\n    const {takeState, takeStateKey, maxBound, constraint} =\n      this.#getStateAndConstraint(change.oldNode.row);\n    if (!takeState) {\n      return;\n    }\n\n    assert(takeState.bound, 'Bound should be set');\n    const {compareRows} = this.getSchema();\n    const oldCmp = compareRows(change.oldNode.row, takeState.bound);\n    const newCmp = compareRows(change.node.row, takeState.bound);\n\n    const that = this;\n    const replaceBoundAndForwardChange = function* () {\n      that.#setTakeState(\n        takeStateKey,\n        takeState.size,\n        change.node.row,\n        maxBound,\n      );\n      yield* that.#output.push(change, that);\n    };\n\n    // The bounds row was changed.\n    if (oldCmp === 0) {\n      // The new row is the new bound.\n      if (newCmp === 0) {\n        // no need to update the state since we are keeping the bounds\n        yield* this.#output.push(change, this);\n        return;\n      }\n\n      if (newCmp < 0) {\n        if (this.#limit === 1) {\n          yield* replaceBoundAndForwardChange();\n          return;\n        }\n\n        // New row will be in the result but it might not be the bounds any\n        // more. We need to find the row before the bounds to determine the new\n        // bounds.\n\n        let beforeBoundNode: Node | undefined;\n        for (const node of this.#input.fetch({\n          start: {\n            row: takeState.bound,\n            basis: 'after',\n          },\n          constraint,\n          reverse: true,\n        })) {\n          if (node === 'yield') {\n            yield node;\n            continue;\n          }\n          beforeBoundNode = node;\n          break;\n        }\n        assert(beforeBoundNode !== undefined);\n\n        this.#setTakeState(\n          takeStateKey,\n          takeState.size,\n          beforeBoundNode.row,\n          maxBound,\n        );\n        yield* this.#output.push(change, this);\n        return;\n      }\n\n      assert(newCmp > 0, 'New comparison must be greater than 0');\n      // Find the first item at the old bounds. This will be the new bounds.\n      let newBoundNode: Node | undefined;\n      for (const node of this.#input.fetch({\n        start: {\n          row: takeState.bound,\n          basis: 'at',\n        },\n        constraint,\n      })) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        }\n        newBoundNode = node;\n        break;\n      }\n      assert(newBoundNode !== undefined);\n\n      // The next row is the new row. We can replace the bounds and keep the\n      // edit change.\n      if (compareRows(newBoundNode.row, change.node.row) === 0) {\n        yield* replaceBoundAndForwardChange();\n        return;\n      }\n\n      // The new row is now outside the bounds, so we need to remove the old\n      // row and add the new bounds row.\n      this.#setTakeState(\n        takeStateKey,\n        takeState.size,\n        newBoundNode.row,\n        maxBound,\n      );\n      yield* this.#pushWithRowHiddenFromFetch(newBoundNode.row, {\n        type: 'remove',\n        node: change.oldNode,\n      });\n      yield* this.#output.push(\n        {\n          type: 'add',\n          node: newBoundNode,\n        },\n        this,\n      );\n      return;\n    }\n\n    if (oldCmp > 0) {\n      assert(newCmp !== 0, 'Invalid state. Row has duplicate primary key');\n\n      // Both old and new outside of bounds\n      if (newCmp > 0) {\n        return;\n      }\n\n      // old was outside, new is inside. Pushing out the old bounds\n      assert(newCmp < 0, 'New comparison must be less than 0');\n\n      let oldBoundNode: Node | undefined;\n      let newBoundNode: Node | undefined;\n      for (const node of this.#input.fetch({\n        start: {\n          row: takeState.bound,\n          basis: 'at',\n        },\n        constraint,\n        reverse: true,\n      })) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        } else if (oldBoundNode === undefined) {\n          oldBoundNode = node;\n        } else {\n          newBoundNode = node;\n          break;\n        }\n      }\n      assert(oldBoundNode !== undefined);\n      assert(newBoundNode !== undefined);\n\n      // Remove before add to maintain invariant that\n      // output size <= limit.\n      this.#setTakeState(\n        takeStateKey,\n        takeState.size,\n        newBoundNode.row,\n        maxBound,\n      );\n      yield* this.#pushWithRowHiddenFromFetch(change.node.row, {\n        type: 'remove',\n        node: oldBoundNode,\n      });\n      yield* this.#output.push(\n        {\n          type: 'add',\n          node: change.node,\n        },\n        this,\n      );\n\n      return;\n    }\n\n    if (oldCmp < 0) {\n      assert(newCmp !== 0, 'Invalid state. Row has duplicate primary key');\n\n      // Both old and new inside of bounds\n      if (newCmp < 0) {\n        yield* this.#output.push(change, this);\n        return;\n      }\n\n      // old was inside, new is larger than old bound\n\n      assert(newCmp > 0, 'New comparison must be greater than 0');\n\n      // at this point we need to find the row after the bound and use that or\n      // the newRow as the new bound.\n      let afterBoundNode: Node | undefined;\n      for (const node of this.#input.fetch({\n        start: {\n          row: takeState.bound,\n          basis: 'after',\n        },\n        constraint,\n      })) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        }\n        afterBoundNode = node;\n        break;\n      }\n      assert(afterBoundNode !== undefined);\n\n      // The new row is the new bound. Use an edit change.\n      if (compareRows(afterBoundNode.row, change.node.row) === 0) {\n        yield* replaceBoundAndForwardChange();\n        return;\n      }\n\n      yield* this.#output.push(\n        {\n          type: 'remove',\n          node: change.oldNode,\n        },\n        this,\n      );\n      this.#setTakeState(\n        takeStateKey,\n        takeState.size,\n        afterBoundNode.row,\n        maxBound,\n      );\n      yield* this.#output.push(\n        {\n          type: 'add',\n          node: afterBoundNode,\n        },\n        this,\n      );\n      return;\n    }\n\n    unreachable();\n  }\n\n  *#pushWithRowHiddenFromFetch(row: Row, change: Change) {\n    this.#rowHiddenFromFetch = row;\n    try {\n      yield* this.#output.push(change, this);\n    } finally {\n      this.#rowHiddenFromFetch = undefined;\n    }\n  }\n\n  #setTakeState(\n    takeStateKey: string,\n    size: number,\n    bound: Row | undefined,\n    maxBound: Row | undefined,\n  ) {\n    this.#storage.set(takeStateKey, {\n      size,\n      bound,\n    });\n    if (\n      bound !== undefined &&\n      (maxBound === undefined ||\n        this.getSchema().compareRows(bound, maxBound) > 0)\n    ) {\n      this.#storage.set(MAX_BOUND_KEY, bound);\n    }\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n}\n\nfunction getTakeStateKey(\n  partitionKey: PartitionKey | undefined,\n  rowOrConstraint: Row | Constraint | undefined,\n): string {\n  // The order must be consistent. We always use the order as defined by the\n  // partition key.\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(['take', ...partitionValues]);\n}\n\nfunction constraintMatchesPartitionKey(\n  constraint: Constraint | undefined,\n  partitionKey: PartitionKey | undefined,\n): boolean {\n  if (constraint === undefined || partitionKey === undefined) {\n    return constraint === partitionKey;\n  }\n  if (partitionKey.length !== Object.keys(constraint).length) {\n    return false;\n  }\n  for (const key of partitionKey) {\n    if (!hasOwn(constraint, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction makePartitionKeyComparator(partitionKey: PartitionKey): Comparator {\n  return (a, b) => {\n    for (const key of partitionKey) {\n      const cmp = compareValues(a[key], b[key]);\n      if (cmp !== 0) {\n        return cmp;\n      }\n    }\n    return 0;\n  };\n}\n"],"names":[],"mappings":";;;;;AAmBA,MAAM,gBAAgB;AA4Bf,MAAM,KAAyB;AAAA,EAC3B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAET;AAAA,EAEA,UAAkB;AAAA,EAElB,YACE,OACA,SACA,OACA,cACA;AACA,WAAO,SAAS,GAAG,4BAA4B;AAC/C;AAAA,MACE,MAAM,YAAY;AAAA,MAClB,MAAM,YAAY;AAAA,IAAA;AAEpB,UAAM,UAAU,IAAI;AACpB,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,SAAS;AACd,SAAK,gBAAgB;AACrB,SAAK,0BACH,gBAAgB,2BAA2B,YAAY;AAAA,EAC3D;AAAA,EAEA,UAAU,QAAsB;AAC9B,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK,OAAO,UAAA;AAAA,EACrB;AAAA,EAEA,CAAC,MAAM,KAA2C;AAChD,QACE,CAAC,KAAK,iBACL,IAAI,cACH,8BAA8B,IAAI,YAAY,KAAK,aAAa,GAClE;AACA,YAAM,eAAe,gBAAgB,KAAK,eAAe,IAAI,UAAU;AACvE,YAAM,YAAY,KAAK,SAAS,IAAI,YAAY;AAChD,UAAI,CAAC,WAAW;AACd,eAAO,KAAK,cAAc,GAAG;AAC7B;AAAA,MACF;AACA,UAAI,UAAU,UAAU,QAAW;AACjC;AAAA,MACF;AACA,iBAAW,aAAa,KAAK,OAAO,MAAM,GAAG,GAAG;AAC9C,YAAI,cAAc,SAAS;AACzB,gBAAM;AACN;AAAA,QACF;AACA,YAAI,KAAK,YAAY,YAAY,UAAU,OAAO,UAAU,GAAG,IAAI,GAAG;AACpE;AAAA,QACF;AACA,YACE,KAAK,uBACL,KAAK,UAAA,EAAY;AAAA,UACf,KAAK;AAAA,UACL,UAAU;AAAA,QAAA,MACN,GACN;AACA;AAAA,QACF;AACA,cAAM;AAAA,MACR;AACA;AAAA,IACF;AAOA,UAAM,WAAW,KAAK,SAAS,IAAI,aAAa;AAChD,QAAI,aAAa,QAAW;AAC1B;AAAA,IACF;AACA,eAAW,aAAa,KAAK,OAAO,MAAM,GAAG,GAAG;AAC9C,UAAI,cAAc,SAAS;AACzB,cAAM;AACN;AAAA,MACF;AACA,UAAI,KAAK,YAAY,YAAY,UAAU,KAAK,QAAQ,IAAI,GAAG;AAC7D;AAAA,MACF;AACA,YAAM,eAAe,gBAAgB,KAAK,eAAe,UAAU,GAAG;AACtE,YAAM,YAAY,KAAK,SAAS,IAAI,YAAY;AAChD,UACE,WAAW,UAAU,UACrB,KAAK,UAAA,EAAY,YAAY,UAAU,OAAO,UAAU,GAAG,KAAK,GAChE;AACA,cAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,CAAC,cAAc,KAA2C;AACxD,WAAO,IAAI,UAAU,QAAW,2BAA2B;AAC3D,WAAO,CAAC,IAAI,SAAS,yBAAyB;AAC9C;AAAA,MACE,8BAA8B,IAAI,YAAY,KAAK,aAAa;AAAA,MAChE;AAAA,IAAA;AAGF,QAAI,KAAK,WAAW,GAAG;AACrB;AAAA,IACF;AAEA,UAAM,eAAe,gBAAgB,KAAK,eAAe,IAAI,UAAU;AACvE;AAAA,MACE,KAAK,SAAS,IAAI,YAAY,MAAM;AAAA,MACpC;AAAA,IAAA;AAGF,QAAI,OAAO;AACX,QAAI;AACJ,QAAI,wBAAwB;AAC5B,QAAI,kBAAkB;AACtB,QAAI;AACF,iBAAW,aAAa,KAAK,OAAO,MAAM,GAAG,GAAG;AAC9C,YAAI,cAAc,SAAS;AACzB,gBAAM;AACN;AAAA,QACF;AACA,cAAM;AACN,gBAAQ,UAAU;AAClB;AACA,YAAI,SAAS,KAAK,QAAQ;AACxB;AAAA,QACF;AAAA,MACF;AACA,8BAAwB;AAAA,IAC1B,SAAS,GAAG;AACV,wBAAkB;AAClB,YAAM;AAAA,IACR,UAAA;AACE,UAAI,CAAC,iBAAiB;AACpB,aAAK;AAAA,UACH;AAAA,UACA;AAAA,UACA;AAAA,UACA,KAAK,SAAS,IAAI,aAAa;AAAA,QAAA;AAMjC;AAAA,UACE,CAAC;AAAA,UACD;AAAA,QAAA;AAAA,MAEJ;AAAA,IACF;AAAA,EACF;AAAA,EAEA,uBAAuB,KAAU;AAC/B,UAAM,eAAe,gBAAgB,KAAK,eAAe,GAAG;AAC5D,UAAM,YAAY,KAAK,SAAS,IAAI,YAAY;AAChD,QAAI;AACJ,QAAI;AACJ,QAAI,WAAW;AACb,iBAAW,KAAK,SAAS,IAAI,aAAa;AAC1C,mBACE,KAAK,iBACL,OAAO;AAAA,QACL,KAAK,cAAc,IAAI,CAAA,QAAO,CAAC,KAAK,IAAI,GAAG,CAAC,CAAU;AAAA,MAAA;AAAA,IAE5D;AAEA,WAAO,EAAC,WAAW,cAAc,UAAU,WAAA;AAAA,EAa7C;AAAA,EAEA,CAAC,KAAK,QAAiC;AACrC,QAAI,OAAO,SAAS,QAAQ;AAC1B,aAAO,KAAK,gBAAgB,MAAM;AAClC;AAAA,IACF;AAEA,UAAM,EAAC,WAAW,cAAc,UAAU,WAAA,IACxC,KAAK,uBAAuB,OAAO,KAAK,GAAG;AAC7C,QAAI,CAAC,WAAW;AACd;AAAA,IACF;AAEA,UAAM,EAAC,YAAA,IAAe,KAAK,UAAA;AAE3B,QAAI,OAAO,SAAS,OAAO;AACzB,UAAI,UAAU,OAAO,KAAK,QAAQ;AAChC,aAAK;AAAA,UACH;AAAA,UACA,UAAU,OAAO;AAAA,UACjB,UAAU,UAAU,UAClB,YAAY,UAAU,OAAO,OAAO,KAAK,GAAG,IAAI,IAC9C,OAAO,KAAK,MACZ,UAAU;AAAA,UACd;AAAA,QAAA;AAEF,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC;AAAA,MACF;AAEA,UACE,UAAU,UAAU,UACpB,YAAY,OAAO,KAAK,KAAK,UAAU,KAAK,KAAK,GACjD;AACA;AAAA,MACF;AAEA,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK,WAAW,GAAG;AACrB,mBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,UACnC,OAAO;AAAA,YACL,KAAK,UAAU;AAAA,YACf,OAAO;AAAA,UAAA;AAAA,UAET;AAAA,QAAA,CACD,GAAG;AACF,cAAI,SAAS,SAAS;AACpB,kBAAM;AACN;AAAA,UACF;AACA,sBAAY;AACZ;AAAA,QACF;AAAA,MACF,OAAO;AACL,mBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,UACnC,OAAO;AAAA,YACL,KAAK,UAAU;AAAA,YACf,OAAO;AAAA,UAAA;AAAA,UAET;AAAA,UACA,SAAS;AAAA,QAAA,CACV,GAAG;AACF,cAAI,SAAS,SAAS;AACpB,kBAAM;AACN;AAAA,UACF,WAAW,cAAc,QAAW;AAClC,wBAAY;AAAA,UACd,OAAO;AACL,8BAAkB;AAClB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA,aAAO,cAAc,MAAS;AAC9B,YAAM,eAA6B;AAAA,QACjC,MAAM;AAAA,QACN,MAAM;AAAA,MAAA;AAIR,WAAK;AAAA,QACH;AAAA,QACA,UAAU;AAAA,QACV,oBAAoB,UAClB,YAAY,OAAO,KAAK,KAAK,gBAAgB,GAAG,IAAI,IAClD,OAAO,KAAK,MACZ,gBAAgB;AAAA,QACpB;AAAA,MAAA;AAEF,aAAO,KAAK,4BAA4B,OAAO,KAAK,KAAK,YAAY;AACrE,aAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,IACvC,WAAW,OAAO,SAAS,UAAU;AACnC,UAAI,UAAU,UAAU,QAAW;AAEjC;AAAA,MACF;AACA,YAAM,cAAc,YAAY,OAAO,KAAK,KAAK,UAAU,KAAK;AAChE,UAAI,cAAc,GAAG;AAEnB;AAAA,MACF;AACA,UAAI;AACJ,iBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,QACnC,OAAO;AAAA,UACL,KAAK,UAAU;AAAA,UACf,OAAO;AAAA,QAAA;AAAA,QAET;AAAA,QACA,SAAS;AAAA,MAAA,CACV,GAAG;AACF,YAAI,SAAS,SAAS;AACpB,gBAAM;AACN;AAAA,QACF;AACA,0BAAkB;AAClB;AAAA,MACF;AAEA,UAAI;AACJ,UAAI,iBAAiB;AACnB,cAAM,OAAO,YAAY,gBAAgB,KAAK,UAAU,KAAK,IAAI;AACjE,mBAAW;AAAA,UACT,MAAM;AAAA,UACN;AAAA,QAAA;AAAA,MAEJ;AACA,UAAI,CAAC,UAAU,MAAM;AACnB,mBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,UACnC,OAAO;AAAA,YACL,KAAK,UAAU;AAAA,YACf,OAAO;AAAA,UAAA;AAAA,UAET;AAAA,QAAA,CACD,GAAG;AACF,cAAI,SAAS,SAAS;AACpB,kBAAM;AACN;AAAA,UACF;AACA,gBAAM,OAAO,YAAY,KAAK,KAAK,UAAU,KAAK,IAAI;AACtD,qBAAW;AAAA,YACT;AAAA,YACA;AAAA,UAAA;AAEF,cAAI,MAAM;AACR;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,UAAI,UAAU,MAAM;AAClB,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC,aAAK;AAAA,UACH;AAAA,UACA,UAAU;AAAA,UACV,SAAS,KAAK;AAAA,UACd;AAAA,QAAA;AAEF,eAAO,KAAK,QAAQ;AAAA,UAClB;AAAA,YACE,MAAM;AAAA,YACN,MAAM,SAAS;AAAA,UAAA;AAAA,UAEjB;AAAA,QAAA;AAEF;AAAA,MACF;AACA,WAAK;AAAA,QACH;AAAA,QACA,UAAU,OAAO;AAAA,QACjB,UAAU,KAAK;AAAA,QACf;AAAA,MAAA;AAEF,aAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,IACvC,WAAW,OAAO,SAAS,SAAS;AAGlC,UACE,UAAU,SACV,YAAY,OAAO,KAAK,KAAK,UAAU,KAAK,KAAK,GACjD;AACA,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,MACvC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,CAAC,gBAAgB,QAAqC;AACpD;AAAA,MACE,CAAC,KAAK,2BACJ,KAAK,wBAAwB,OAAO,QAAQ,KAAK,OAAO,KAAK,GAAG,MAAM;AAAA,MACxE;AAAA,IAAA;AAGF,UAAM,EAAC,WAAW,cAAc,UAAU,WAAA,IACxC,KAAK,uBAAuB,OAAO,QAAQ,GAAG;AAChD,QAAI,CAAC,WAAW;AACd;AAAA,IACF;AAEA,WAAO,UAAU,OAAO,qBAAqB;AAC7C,UAAM,EAAC,YAAA,IAAe,KAAK,UAAA;AAC3B,UAAM,SAAS,YAAY,OAAO,QAAQ,KAAK,UAAU,KAAK;AAC9D,UAAM,SAAS,YAAY,OAAO,KAAK,KAAK,UAAU,KAAK;AAE3D,UAAM,OAAO;AACb,UAAM,+BAA+B,aAAa;AAChD,WAAK;AAAA,QACH;AAAA,QACA,UAAU;AAAA,QACV,OAAO,KAAK;AAAA,QACZ;AAAA,MAAA;AAEF,aAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,IACvC;AAGA,QAAI,WAAW,GAAG;AAEhB,UAAI,WAAW,GAAG;AAEhB,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC;AAAA,MACF;AAEA,UAAI,SAAS,GAAG;AACd,YAAI,KAAK,WAAW,GAAG;AACrB,iBAAO,6BAAA;AACP;AAAA,QACF;AAMA,YAAI;AACJ,mBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,UACnC,OAAO;AAAA,YACL,KAAK,UAAU;AAAA,YACf,OAAO;AAAA,UAAA;AAAA,UAET;AAAA,UACA,SAAS;AAAA,QAAA,CACV,GAAG;AACF,cAAI,SAAS,SAAS;AACpB,kBAAM;AACN;AAAA,UACF;AACA,4BAAkB;AAClB;AAAA,QACF;AACA,eAAO,oBAAoB,MAAS;AAEpC,aAAK;AAAA,UACH;AAAA,UACA,UAAU;AAAA,UACV,gBAAgB;AAAA,UAChB;AAAA,QAAA;AAEF,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC;AAAA,MACF;AAEA,aAAO,SAAS,GAAG,uCAAuC;AAE1D,UAAI;AACJ,iBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,QACnC,OAAO;AAAA,UACL,KAAK,UAAU;AAAA,UACf,OAAO;AAAA,QAAA;AAAA,QAET;AAAA,MAAA,CACD,GAAG;AACF,YAAI,SAAS,SAAS;AACpB,gBAAM;AACN;AAAA,QACF;AACA,uBAAe;AACf;AAAA,MACF;AACA,aAAO,iBAAiB,MAAS;AAIjC,UAAI,YAAY,aAAa,KAAK,OAAO,KAAK,GAAG,MAAM,GAAG;AACxD,eAAO,6BAAA;AACP;AAAA,MACF;AAIA,WAAK;AAAA,QACH;AAAA,QACA,UAAU;AAAA,QACV,aAAa;AAAA,QACb;AAAA,MAAA;AAEF,aAAO,KAAK,4BAA4B,aAAa,KAAK;AAAA,QACxD,MAAM;AAAA,QACN,MAAM,OAAO;AAAA,MAAA,CACd;AACD,aAAO,KAAK,QAAQ;AAAA,QAClB;AAAA,UACE,MAAM;AAAA,UACN,MAAM;AAAA,QAAA;AAAA,QAER;AAAA,MAAA;AAEF;AAAA,IACF;AAEA,QAAI,SAAS,GAAG;AACd,aAAO,WAAW,GAAG,8CAA8C;AAGnE,UAAI,SAAS,GAAG;AACd;AAAA,MACF;AAGA,aAAO,SAAS,GAAG,oCAAoC;AAEvD,UAAI;AACJ,UAAI;AACJ,iBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,QACnC,OAAO;AAAA,UACL,KAAK,UAAU;AAAA,UACf,OAAO;AAAA,QAAA;AAAA,QAET;AAAA,QACA,SAAS;AAAA,MAAA,CACV,GAAG;AACF,YAAI,SAAS,SAAS;AACpB,gBAAM;AACN;AAAA,QACF,WAAW,iBAAiB,QAAW;AACrC,yBAAe;AAAA,QACjB,OAAO;AACL,yBAAe;AACf;AAAA,QACF;AAAA,MACF;AACA,aAAO,iBAAiB,MAAS;AACjC,aAAO,iBAAiB,MAAS;AAIjC,WAAK;AAAA,QACH;AAAA,QACA,UAAU;AAAA,QACV,aAAa;AAAA,QACb;AAAA,MAAA;AAEF,aAAO,KAAK,4BAA4B,OAAO,KAAK,KAAK;AAAA,QACvD,MAAM;AAAA,QACN,MAAM;AAAA,MAAA,CACP;AACD,aAAO,KAAK,QAAQ;AAAA,QAClB;AAAA,UACE,MAAM;AAAA,UACN,MAAM,OAAO;AAAA,QAAA;AAAA,QAEf;AAAA,MAAA;AAGF;AAAA,IACF;AAEA,QAAI,SAAS,GAAG;AACd,aAAO,WAAW,GAAG,8CAA8C;AAGnE,UAAI,SAAS,GAAG;AACd,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC;AAAA,MACF;AAIA,aAAO,SAAS,GAAG,uCAAuC;AAI1D,UAAI;AACJ,iBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,QACnC,OAAO;AAAA,UACL,KAAK,UAAU;AAAA,UACf,OAAO;AAAA,QAAA;AAAA,QAET;AAAA,MAAA,CACD,GAAG;AACF,YAAI,SAAS,SAAS;AACpB,gBAAM;AACN;AAAA,QACF;AACA,yBAAiB;AACjB;AAAA,MACF;AACA,aAAO,mBAAmB,MAAS;AAGnC,UAAI,YAAY,eAAe,KAAK,OAAO,KAAK,GAAG,MAAM,GAAG;AAC1D,eAAO,6BAAA;AACP;AAAA,MACF;AAEA,aAAO,KAAK,QAAQ;AAAA,QAClB;AAAA,UACE,MAAM;AAAA,UACN,MAAM,OAAO;AAAA,QAAA;AAAA,QAEf;AAAA,MAAA;AAEF,WAAK;AAAA,QACH;AAAA,QACA,UAAU;AAAA,QACV,eAAe;AAAA,QACf;AAAA,MAAA;AAEF,aAAO,KAAK,QAAQ;AAAA,QAClB;AAAA,UACE,MAAM;AAAA,UACN,MAAM;AAAA,QAAA;AAAA,QAER;AAAA,MAAA;AAEF;AAAA,IACF;AAEA,gBAAA;AAAA,EACF;AAAA,EAEA,CAAC,4BAA4B,KAAU,QAAgB;AACrD,SAAK,sBAAsB;AAC3B,QAAI;AACF,aAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,IACvC,UAAA;AACE,WAAK,sBAAsB;AAAA,IAC7B;AAAA,EACF;AAAA,EAEA,cACE,cACA,MACA,OACA,UACA;AACA,SAAK,SAAS,IAAI,cAAc;AAAA,MAC9B;AAAA,MACA;AAAA,IAAA,CACD;AACD,QACE,UAAU,WACT,aAAa,UACZ,KAAK,UAAA,EAAY,YAAY,OAAO,QAAQ,IAAI,IAClD;AACA,WAAK,SAAS,IAAI,eAAe,KAAK;AAAA,IACxC;AAAA,EACF;AAAA,EAEA,UAAgB;AACd,SAAK,OAAO,QAAA;AAAA,EACd;AACF;AAEA,SAAS,gBACP,cACA,iBACQ;AAGR,QAAM,kBAA2B,CAAA;AAEjC,MAAI,gBAAgB,iBAAiB;AACnC,eAAW,OAAO,cAAc;AAC9B,sBAAgB,KAAK,gBAAgB,GAAG,CAAC;AAAA,IAC3C;AAAA,EACF;AAEA,SAAO,KAAK,UAAU,CAAC,QAAQ,GAAG,eAAe,CAAC;AACpD;AAEA,SAAS,8BACP,YACA,cACS;AACT,MAAI,eAAe,UAAa,iBAAiB,QAAW;AAC1D,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,aAAa,WAAW,OAAO,KAAK,UAAU,EAAE,QAAQ;AAC1D,WAAO;AAAA,EACT;AACA,aAAW,OAAO,cAAc;AAC9B,QAAI,CAAC,OAAO,YAAY,GAAG,GAAG;AAC5B,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,2BAA2B,cAAwC;AAC1E,SAAO,CAAC,GAAG,MAAM;AACf,eAAW,OAAO,cAAc;AAC9B,YAAM,MAAM,cAAc,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC;AACxC,UAAI,QAAQ,GAAG;AACb,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;"}
+{"version":3,"file":"take.js","sources":["../../../../../zql/src/ivm/take.ts"],"sourcesContent":["import {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport {hasOwn} from '../../../shared/src/has-own.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\nimport {assertOrderingIncludesPK} from '../query/complete-ordering.ts';\nimport {type Change, type EditChange, type RemoveChange} from './change.ts';\nimport type {Constraint} from './constraint.ts';\nimport {compareValues, type Comparator, type 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';\n\nconst MAX_BOUND_KEY = 'maxBound';\n\ntype TakeState = {\n  size: number;\n  bound: Row | undefined;\n};\n\ninterface TakeStorage {\n  get(key: typeof MAX_BOUND_KEY): Row | undefined;\n  get(key: string): TakeState | undefined;\n  set(key: typeof MAX_BOUND_KEY, value: Row): void;\n  set(key: string, value: TakeState): void;\n  del(key: string): void;\n}\n\nexport type PartitionKey = PrimaryKey;\n\n/**\n * The Take operator is for implementing limit queries. It takes the first n\n * nodes of its input as determined by the input’s comparator. It then keeps\n * a *bound* of the last item it has accepted so that it can evaluate whether\n * new incoming pushes should be accepted or rejected.\n *\n * Take can count rows globally or by unique value of some field.\n *\n * Maintains the invariant that its output size is always <= limit, even\n * mid processing of a push.\n */\nexport class Take implements Operator {\n  readonly #input: Input;\n  readonly #storage: TakeStorage;\n  readonly #limit: number;\n  readonly #partitionKey: PartitionKey | undefined;\n  readonly #partitionKeyComparator: Comparator | undefined;\n  // Fetch overlay needed for some split push cases.\n  #rowHiddenFromFetch: Row | undefined;\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    assertOrderingIncludesPK(\n      input.getSchema().sort,\n      input.getSchema().primaryKey,\n    );\n    input.setOutput(this);\n    this.#input = input;\n    this.#storage = storage as TakeStorage;\n    this.#limit = limit;\n    this.#partitionKey = partitionKey;\n    this.#partitionKeyComparator =\n      partitionKey && makePartitionKeyComparator(partitionKey);\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    if (\n      !this.#partitionKey ||\n      (req.constraint &&\n        constraintMatchesPartitionKey(req.constraint, this.#partitionKey))\n    ) {\n      const takeStateKey = getTakeStateKey(this.#partitionKey, req.constraint);\n      const takeState = this.#storage.get(takeStateKey);\n      if (!takeState) {\n        yield* this.#initialFetch(req);\n        return;\n      }\n      if (takeState.bound === undefined) {\n        return;\n      }\n      for (const inputNode of this.#input.fetch(req)) {\n        if (inputNode === 'yield') {\n          yield inputNode;\n          continue;\n        }\n        if (this.getSchema().compareRows(takeState.bound, inputNode.row) < 0) {\n          return;\n        }\n        if (\n          this.#rowHiddenFromFetch &&\n          this.getSchema().compareRows(\n            this.#rowHiddenFromFetch,\n            inputNode.row,\n          ) === 0\n        ) {\n          continue;\n        }\n        yield inputNode;\n      }\n      return;\n    }\n    // There is a partition key, but the fetch is not constrained or constrained\n    // on a different key.  Thus we don't have a single take state to bound by.\n    // This currently only happens with nested sub-queries\n    // e.g. issues include issuelabels include label.  We could remove this\n    // case if we added a translation layer (powered by some state) in join.\n    // Specifically we need joinKeyValue => parent constraint key\n    const maxBound = this.#storage.get(MAX_BOUND_KEY);\n    if (maxBound === undefined) {\n      return;\n    }\n    for (const inputNode of this.#input.fetch(req)) {\n      if (inputNode === 'yield') {\n        yield inputNode;\n        continue;\n      }\n      if (this.getSchema().compareRows(inputNode.row, maxBound) > 0) {\n        return;\n      }\n      const takeStateKey = getTakeStateKey(this.#partitionKey, inputNode.row);\n      const takeState = this.#storage.get(takeStateKey);\n      if (\n        takeState?.bound !== undefined &&\n        this.getSchema().compareRows(takeState.bound, inputNode.row) >= 0\n      ) {\n        yield inputNode;\n      }\n    }\n  }\n\n  *#initialFetch(req: FetchRequest): Stream<Node | 'yield'> {\n    assert(req.start === undefined, 'Start should be undefined');\n    assert(!req.reverse, 'Reverse should be false');\n    assert(\n      constraintMatchesPartitionKey(req.constraint, this.#partitionKey),\n      'Constraint should match partition key',\n    );\n\n    if (this.#limit === 0) {\n      return;\n    }\n\n    const takeStateKey = getTakeStateKey(this.#partitionKey, req.constraint);\n    assert(\n      this.#storage.get(takeStateKey) === undefined,\n      'Take state should be undefined',\n    );\n\n    let size = 0;\n    let bound: Row | undefined;\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        bound = inputNode.row;\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.#setTakeState(\n          takeStateKey,\n          size,\n          bound,\n          this.#storage.get(MAX_BOUND_KEY),\n        );\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 takeState is properly hydrated.\n        assert(\n          !downstreamEarlyReturn,\n          'Unexpected early return prevented full hydration',\n        );\n      }\n    }\n  }\n\n  #getStateAndConstraint(row: Row) {\n    const takeStateKey = getTakeStateKey(this.#partitionKey, row);\n    const takeState = this.#storage.get(takeStateKey);\n    let maxBound: Row | undefined;\n    let constraint: Constraint | undefined;\n    if (takeState) {\n      maxBound = this.#storage.get(MAX_BOUND_KEY);\n      constraint =\n        this.#partitionKey &&\n        Object.fromEntries(\n          this.#partitionKey.map(key => [key, row[key]] as const),\n        );\n    }\n\n    return {takeState, takeStateKey, maxBound, constraint} as\n      | {\n          takeState: undefined;\n          takeStateKey: string;\n          maxBound: undefined;\n          constraint: undefined;\n        }\n      | {\n          takeState: TakeState;\n          takeStateKey: string;\n          maxBound: Row | undefined;\n          constraint: Constraint | undefined;\n        };\n  }\n\n  *push(change: Change): Stream<'yield'> {\n    if (change.type === 'edit') {\n      yield* this.#pushEditChange(change);\n      return;\n    }\n\n    const {takeState, takeStateKey, maxBound, constraint} =\n      this.#getStateAndConstraint(change.node.row);\n    if (!takeState) {\n      return;\n    }\n\n    const {compareRows} = this.getSchema();\n\n    if (change.type === 'add') {\n      if (takeState.size < this.#limit) {\n        this.#setTakeState(\n          takeStateKey,\n          takeState.size + 1,\n          takeState.bound === undefined ||\n            compareRows(takeState.bound, change.node.row) < 0\n            ? change.node.row\n            : takeState.bound,\n          maxBound,\n        );\n        yield* this.#output.push(change, this);\n        return;\n      }\n      // size === limit\n      if (\n        takeState.bound === undefined ||\n        compareRows(change.node.row, takeState.bound) >= 0\n      ) {\n        return;\n      }\n      // added row < bound\n      let beforeBoundNode: Node | undefined;\n      let boundNode: Node | undefined;\n      if (this.#limit === 1) {\n        for (const node of this.#input.fetch({\n          start: {\n            row: takeState.bound,\n            basis: 'at',\n          },\n          constraint,\n        })) {\n          if (node === 'yield') {\n            yield node;\n            continue;\n          }\n          boundNode = node;\n          break;\n        }\n      } else {\n        for (const node of this.#input.fetch({\n          start: {\n            row: takeState.bound,\n            basis: 'at',\n          },\n          constraint,\n          reverse: true,\n        })) {\n          if (node === 'yield') {\n            yield node;\n            continue;\n          } else if (boundNode === undefined) {\n            boundNode = node;\n          } else {\n            beforeBoundNode = node;\n            break;\n          }\n        }\n      }\n      assert(\n        boundNode !== undefined,\n        'Take: boundNode must be found during fetch',\n      );\n      const removeChange: RemoveChange = {\n        type: 'remove',\n        node: boundNode,\n      };\n      // Remove before add to maintain invariant that\n      // output size <= limit.\n      this.#setTakeState(\n        takeStateKey,\n        takeState.size,\n        beforeBoundNode === undefined ||\n          compareRows(change.node.row, beforeBoundNode.row) > 0\n          ? change.node.row\n          : beforeBoundNode.row,\n        maxBound,\n      );\n      yield* this.#pushWithRowHiddenFromFetch(change.node.row, removeChange);\n      yield* this.#output.push(change, this);\n    } else if (change.type === 'remove') {\n      if (takeState.bound === undefined) {\n        // change is after bound\n        return;\n      }\n      const compToBound = compareRows(change.node.row, takeState.bound);\n      if (compToBound > 0) {\n        // change is after bound\n        return;\n      }\n      let beforeBoundNode: Node | undefined;\n      for (const node of this.#input.fetch({\n        start: {\n          row: takeState.bound,\n          basis: 'after',\n        },\n        constraint,\n        reverse: true,\n      })) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        }\n        beforeBoundNode = node;\n        break;\n      }\n\n      let newBound: {node: Node; push: boolean} | undefined;\n      if (beforeBoundNode) {\n        const push = compareRows(beforeBoundNode.row, takeState.bound) > 0;\n        newBound = {\n          node: beforeBoundNode,\n          push,\n        };\n      }\n      if (!newBound?.push) {\n        for (const node of this.#input.fetch({\n          start: {\n            row: takeState.bound,\n            basis: 'at',\n          },\n          constraint,\n        })) {\n          if (node === 'yield') {\n            yield node;\n            continue;\n          }\n          const push = compareRows(node.row, takeState.bound) > 0;\n          newBound = {\n            node,\n            push,\n          };\n          if (push) {\n            break;\n          }\n        }\n      }\n\n      if (newBound?.push) {\n        yield* this.#output.push(change, this);\n        this.#setTakeState(\n          takeStateKey,\n          takeState.size,\n          newBound.node.row,\n          maxBound,\n        );\n        yield* this.#output.push(\n          {\n            type: 'add',\n            node: newBound.node,\n          },\n          this,\n        );\n        return;\n      }\n      this.#setTakeState(\n        takeStateKey,\n        takeState.size - 1,\n        newBound?.node.row,\n        maxBound,\n      );\n      yield* this.#output.push(change, this);\n    } else if (change.type === 'child') {\n      // A 'child' change should be pushed to output if its row\n      // is <= bound.\n      if (\n        takeState.bound &&\n        compareRows(change.node.row, takeState.bound) <= 0\n      ) {\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(change.oldNode.row, change.node.row) === 0,\n      'Unexpected change of partition key',\n    );\n\n    const {takeState, takeStateKey, maxBound, constraint} =\n      this.#getStateAndConstraint(change.oldNode.row);\n    if (!takeState) {\n      return;\n    }\n\n    assert(takeState.bound, 'Bound should be set');\n    const {compareRows} = this.getSchema();\n    const oldCmp = compareRows(change.oldNode.row, takeState.bound);\n    const newCmp = compareRows(change.node.row, takeState.bound);\n\n    const that = this;\n    const replaceBoundAndForwardChange = function* () {\n      that.#setTakeState(\n        takeStateKey,\n        takeState.size,\n        change.node.row,\n        maxBound,\n      );\n      yield* that.#output.push(change, that);\n    };\n\n    // The bounds row was changed.\n    if (oldCmp === 0) {\n      // The new row is the new bound.\n      if (newCmp === 0) {\n        // no need to update the state since we are keeping the bounds\n        yield* this.#output.push(change, this);\n        return;\n      }\n\n      if (newCmp < 0) {\n        if (this.#limit === 1) {\n          yield* replaceBoundAndForwardChange();\n          return;\n        }\n\n        // New row will be in the result but it might not be the bounds any\n        // more. We need to find the row before the bounds to determine the new\n        // bounds.\n\n        let beforeBoundNode: Node | undefined;\n        for (const node of this.#input.fetch({\n          start: {\n            row: takeState.bound,\n            basis: 'after',\n          },\n          constraint,\n          reverse: true,\n        })) {\n          if (node === 'yield') {\n            yield node;\n            continue;\n          }\n          beforeBoundNode = node;\n          break;\n        }\n        assert(\n          beforeBoundNode !== undefined,\n          'Take: beforeBoundNode must be found during fetch',\n        );\n\n        this.#setTakeState(\n          takeStateKey,\n          takeState.size,\n          beforeBoundNode.row,\n          maxBound,\n        );\n        yield* this.#output.push(change, this);\n        return;\n      }\n\n      assert(newCmp > 0, 'New comparison must be greater than 0');\n      // Find the first item at the old bounds. This will be the new bounds.\n      let newBoundNode: Node | undefined;\n      for (const node of this.#input.fetch({\n        start: {\n          row: takeState.bound,\n          basis: 'at',\n        },\n        constraint,\n      })) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        }\n        newBoundNode = node;\n        break;\n      }\n      assert(\n        newBoundNode !== undefined,\n        'Take: newBoundNode must be found during fetch',\n      );\n\n      // The next row is the new row. We can replace the bounds and keep the\n      // edit change.\n      if (compareRows(newBoundNode.row, change.node.row) === 0) {\n        yield* replaceBoundAndForwardChange();\n        return;\n      }\n\n      // The new row is now outside the bounds, so we need to remove the old\n      // row and add the new bounds row.\n      this.#setTakeState(\n        takeStateKey,\n        takeState.size,\n        newBoundNode.row,\n        maxBound,\n      );\n      yield* this.#pushWithRowHiddenFromFetch(newBoundNode.row, {\n        type: 'remove',\n        node: change.oldNode,\n      });\n      yield* this.#output.push(\n        {\n          type: 'add',\n          node: newBoundNode,\n        },\n        this,\n      );\n      return;\n    }\n\n    if (oldCmp > 0) {\n      assert(newCmp !== 0, 'Invalid state. Row has duplicate primary key');\n\n      // Both old and new outside of bounds\n      if (newCmp > 0) {\n        return;\n      }\n\n      // old was outside, new is inside. Pushing out the old bounds\n      assert(newCmp < 0, 'New comparison must be less than 0');\n\n      let oldBoundNode: Node | undefined;\n      let newBoundNode: Node | undefined;\n      for (const node of this.#input.fetch({\n        start: {\n          row: takeState.bound,\n          basis: 'at',\n        },\n        constraint,\n        reverse: true,\n      })) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        } else if (oldBoundNode === undefined) {\n          oldBoundNode = node;\n        } else {\n          newBoundNode = node;\n          break;\n        }\n      }\n      assert(\n        oldBoundNode !== undefined,\n        'Take: oldBoundNode must be found during fetch',\n      );\n      assert(\n        newBoundNode !== undefined,\n        'Take: newBoundNode must be found during fetch',\n      );\n\n      // Remove before add to maintain invariant that\n      // output size <= limit.\n      this.#setTakeState(\n        takeStateKey,\n        takeState.size,\n        newBoundNode.row,\n        maxBound,\n      );\n      yield* this.#pushWithRowHiddenFromFetch(change.node.row, {\n        type: 'remove',\n        node: oldBoundNode,\n      });\n      yield* this.#output.push(\n        {\n          type: 'add',\n          node: change.node,\n        },\n        this,\n      );\n\n      return;\n    }\n\n    if (oldCmp < 0) {\n      assert(newCmp !== 0, 'Invalid state. Row has duplicate primary key');\n\n      // Both old and new inside of bounds\n      if (newCmp < 0) {\n        yield* this.#output.push(change, this);\n        return;\n      }\n\n      // old was inside, new is larger than old bound\n\n      assert(newCmp > 0, 'New comparison must be greater than 0');\n\n      // at this point we need to find the row after the bound and use that or\n      // the newRow as the new bound.\n      let afterBoundNode: Node | undefined;\n      for (const node of this.#input.fetch({\n        start: {\n          row: takeState.bound,\n          basis: 'after',\n        },\n        constraint,\n      })) {\n        if (node === 'yield') {\n          yield node;\n          continue;\n        }\n        afterBoundNode = node;\n        break;\n      }\n      assert(\n        afterBoundNode !== undefined,\n        'Take: afterBoundNode must be found during fetch',\n      );\n\n      // The new row is the new bound. Use an edit change.\n      if (compareRows(afterBoundNode.row, change.node.row) === 0) {\n        yield* replaceBoundAndForwardChange();\n        return;\n      }\n\n      yield* this.#output.push(\n        {\n          type: 'remove',\n          node: change.oldNode,\n        },\n        this,\n      );\n      this.#setTakeState(\n        takeStateKey,\n        takeState.size,\n        afterBoundNode.row,\n        maxBound,\n      );\n      yield* this.#output.push(\n        {\n          type: 'add',\n          node: afterBoundNode,\n        },\n        this,\n      );\n      return;\n    }\n\n    unreachable();\n  }\n\n  *#pushWithRowHiddenFromFetch(row: Row, change: Change) {\n    this.#rowHiddenFromFetch = row;\n    try {\n      yield* this.#output.push(change, this);\n    } finally {\n      this.#rowHiddenFromFetch = undefined;\n    }\n  }\n\n  #setTakeState(\n    takeStateKey: string,\n    size: number,\n    bound: Row | undefined,\n    maxBound: Row | undefined,\n  ) {\n    this.#storage.set(takeStateKey, {\n      size,\n      bound,\n    });\n    if (\n      bound !== undefined &&\n      (maxBound === undefined ||\n        this.getSchema().compareRows(bound, maxBound) > 0)\n    ) {\n      this.#storage.set(MAX_BOUND_KEY, bound);\n    }\n  }\n\n  destroy(): void {\n    this.#input.destroy();\n  }\n}\n\nfunction getTakeStateKey(\n  partitionKey: PartitionKey | undefined,\n  rowOrConstraint: Row | Constraint | undefined,\n): string {\n  // The order must be consistent. We always use the order as defined by the\n  // partition key.\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(['take', ...partitionValues]);\n}\n\nfunction constraintMatchesPartitionKey(\n  constraint: Constraint | undefined,\n  partitionKey: PartitionKey | undefined,\n): boolean {\n  if (constraint === undefined || partitionKey === undefined) {\n    return constraint === partitionKey;\n  }\n  if (partitionKey.length !== Object.keys(constraint).length) {\n    return false;\n  }\n  for (const key of partitionKey) {\n    if (!hasOwn(constraint, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nfunction makePartitionKeyComparator(partitionKey: PartitionKey): Comparator {\n  return (a, b) => {\n    for (const key of partitionKey) {\n      const cmp = compareValues(a[key], b[key]);\n      if (cmp !== 0) {\n        return cmp;\n      }\n    }\n    return 0;\n  };\n}\n"],"names":[],"mappings":";;;;;AAmBA,MAAM,gBAAgB;AA4Bf,MAAM,KAAyB;AAAA,EAC3B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EAET;AAAA,EAEA,UAAkB;AAAA,EAElB,YACE,OACA,SACA,OACA,cACA;AACA,WAAO,SAAS,GAAG,4BAA4B;AAC/C;AAAA,MACE,MAAM,YAAY;AAAA,MAClB,MAAM,YAAY;AAAA,IAAA;AAEpB,UAAM,UAAU,IAAI;AACpB,SAAK,SAAS;AACd,SAAK,WAAW;AAChB,SAAK,SAAS;AACd,SAAK,gBAAgB;AACrB,SAAK,0BACH,gBAAgB,2BAA2B,YAAY;AAAA,EAC3D;AAAA,EAEA,UAAU,QAAsB;AAC9B,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK,OAAO,UAAA;AAAA,EACrB;AAAA,EAEA,CAAC,MAAM,KAA2C;AAChD,QACE,CAAC,KAAK,iBACL,IAAI,cACH,8BAA8B,IAAI,YAAY,KAAK,aAAa,GAClE;AACA,YAAM,eAAe,gBAAgB,KAAK,eAAe,IAAI,UAAU;AACvE,YAAM,YAAY,KAAK,SAAS,IAAI,YAAY;AAChD,UAAI,CAAC,WAAW;AACd,eAAO,KAAK,cAAc,GAAG;AAC7B;AAAA,MACF;AACA,UAAI,UAAU,UAAU,QAAW;AACjC;AAAA,MACF;AACA,iBAAW,aAAa,KAAK,OAAO,MAAM,GAAG,GAAG;AAC9C,YAAI,cAAc,SAAS;AACzB,gBAAM;AACN;AAAA,QACF;AACA,YAAI,KAAK,YAAY,YAAY,UAAU,OAAO,UAAU,GAAG,IAAI,GAAG;AACpE;AAAA,QACF;AACA,YACE,KAAK,uBACL,KAAK,UAAA,EAAY;AAAA,UACf,KAAK;AAAA,UACL,UAAU;AAAA,QAAA,MACN,GACN;AACA;AAAA,QACF;AACA,cAAM;AAAA,MACR;AACA;AAAA,IACF;AAOA,UAAM,WAAW,KAAK,SAAS,IAAI,aAAa;AAChD,QAAI,aAAa,QAAW;AAC1B;AAAA,IACF;AACA,eAAW,aAAa,KAAK,OAAO,MAAM,GAAG,GAAG;AAC9C,UAAI,cAAc,SAAS;AACzB,cAAM;AACN;AAAA,MACF;AACA,UAAI,KAAK,YAAY,YAAY,UAAU,KAAK,QAAQ,IAAI,GAAG;AAC7D;AAAA,MACF;AACA,YAAM,eAAe,gBAAgB,KAAK,eAAe,UAAU,GAAG;AACtE,YAAM,YAAY,KAAK,SAAS,IAAI,YAAY;AAChD,UACE,WAAW,UAAU,UACrB,KAAK,UAAA,EAAY,YAAY,UAAU,OAAO,UAAU,GAAG,KAAK,GAChE;AACA,cAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAAA,EAEA,CAAC,cAAc,KAA2C;AACxD,WAAO,IAAI,UAAU,QAAW,2BAA2B;AAC3D,WAAO,CAAC,IAAI,SAAS,yBAAyB;AAC9C;AAAA,MACE,8BAA8B,IAAI,YAAY,KAAK,aAAa;AAAA,MAChE;AAAA,IAAA;AAGF,QAAI,KAAK,WAAW,GAAG;AACrB;AAAA,IACF;AAEA,UAAM,eAAe,gBAAgB,KAAK,eAAe,IAAI,UAAU;AACvE;AAAA,MACE,KAAK,SAAS,IAAI,YAAY,MAAM;AAAA,MACpC;AAAA,IAAA;AAGF,QAAI,OAAO;AACX,QAAI;AACJ,QAAI,wBAAwB;AAC5B,QAAI,kBAAkB;AACtB,QAAI;AACF,iBAAW,aAAa,KAAK,OAAO,MAAM,GAAG,GAAG;AAC9C,YAAI,cAAc,SAAS;AACzB,gBAAM;AACN;AAAA,QACF;AACA,cAAM;AACN,gBAAQ,UAAU;AAClB;AACA,YAAI,SAAS,KAAK,QAAQ;AACxB;AAAA,QACF;AAAA,MACF;AACA,8BAAwB;AAAA,IAC1B,SAAS,GAAG;AACV,wBAAkB;AAClB,YAAM;AAAA,IACR,UAAA;AACE,UAAI,CAAC,iBAAiB;AACpB,aAAK;AAAA,UACH;AAAA,UACA;AAAA,UACA;AAAA,UACA,KAAK,SAAS,IAAI,aAAa;AAAA,QAAA;AAMjC;AAAA,UACE,CAAC;AAAA,UACD;AAAA,QAAA;AAAA,MAEJ;AAAA,IACF;AAAA,EACF;AAAA,EAEA,uBAAuB,KAAU;AAC/B,UAAM,eAAe,gBAAgB,KAAK,eAAe,GAAG;AAC5D,UAAM,YAAY,KAAK,SAAS,IAAI,YAAY;AAChD,QAAI;AACJ,QAAI;AACJ,QAAI,WAAW;AACb,iBAAW,KAAK,SAAS,IAAI,aAAa;AAC1C,mBACE,KAAK,iBACL,OAAO;AAAA,QACL,KAAK,cAAc,IAAI,CAAA,QAAO,CAAC,KAAK,IAAI,GAAG,CAAC,CAAU;AAAA,MAAA;AAAA,IAE5D;AAEA,WAAO,EAAC,WAAW,cAAc,UAAU,WAAA;AAAA,EAa7C;AAAA,EAEA,CAAC,KAAK,QAAiC;AACrC,QAAI,OAAO,SAAS,QAAQ;AAC1B,aAAO,KAAK,gBAAgB,MAAM;AAClC;AAAA,IACF;AAEA,UAAM,EAAC,WAAW,cAAc,UAAU,WAAA,IACxC,KAAK,uBAAuB,OAAO,KAAK,GAAG;AAC7C,QAAI,CAAC,WAAW;AACd;AAAA,IACF;AAEA,UAAM,EAAC,YAAA,IAAe,KAAK,UAAA;AAE3B,QAAI,OAAO,SAAS,OAAO;AACzB,UAAI,UAAU,OAAO,KAAK,QAAQ;AAChC,aAAK;AAAA,UACH;AAAA,UACA,UAAU,OAAO;AAAA,UACjB,UAAU,UAAU,UAClB,YAAY,UAAU,OAAO,OAAO,KAAK,GAAG,IAAI,IAC9C,OAAO,KAAK,MACZ,UAAU;AAAA,UACd;AAAA,QAAA;AAEF,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC;AAAA,MACF;AAEA,UACE,UAAU,UAAU,UACpB,YAAY,OAAO,KAAK,KAAK,UAAU,KAAK,KAAK,GACjD;AACA;AAAA,MACF;AAEA,UAAI;AACJ,UAAI;AACJ,UAAI,KAAK,WAAW,GAAG;AACrB,mBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,UACnC,OAAO;AAAA,YACL,KAAK,UAAU;AAAA,YACf,OAAO;AAAA,UAAA;AAAA,UAET;AAAA,QAAA,CACD,GAAG;AACF,cAAI,SAAS,SAAS;AACpB,kBAAM;AACN;AAAA,UACF;AACA,sBAAY;AACZ;AAAA,QACF;AAAA,MACF,OAAO;AACL,mBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,UACnC,OAAO;AAAA,YACL,KAAK,UAAU;AAAA,YACf,OAAO;AAAA,UAAA;AAAA,UAET;AAAA,UACA,SAAS;AAAA,QAAA,CACV,GAAG;AACF,cAAI,SAAS,SAAS;AACpB,kBAAM;AACN;AAAA,UACF,WAAW,cAAc,QAAW;AAClC,wBAAY;AAAA,UACd,OAAO;AACL,8BAAkB;AAClB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AACA;AAAA,QACE,cAAc;AAAA,QACd;AAAA,MAAA;AAEF,YAAM,eAA6B;AAAA,QACjC,MAAM;AAAA,QACN,MAAM;AAAA,MAAA;AAIR,WAAK;AAAA,QACH;AAAA,QACA,UAAU;AAAA,QACV,oBAAoB,UAClB,YAAY,OAAO,KAAK,KAAK,gBAAgB,GAAG,IAAI,IAClD,OAAO,KAAK,MACZ,gBAAgB;AAAA,QACpB;AAAA,MAAA;AAEF,aAAO,KAAK,4BAA4B,OAAO,KAAK,KAAK,YAAY;AACrE,aAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,IACvC,WAAW,OAAO,SAAS,UAAU;AACnC,UAAI,UAAU,UAAU,QAAW;AAEjC;AAAA,MACF;AACA,YAAM,cAAc,YAAY,OAAO,KAAK,KAAK,UAAU,KAAK;AAChE,UAAI,cAAc,GAAG;AAEnB;AAAA,MACF;AACA,UAAI;AACJ,iBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,QACnC,OAAO;AAAA,UACL,KAAK,UAAU;AAAA,UACf,OAAO;AAAA,QAAA;AAAA,QAET;AAAA,QACA,SAAS;AAAA,MAAA,CACV,GAAG;AACF,YAAI,SAAS,SAAS;AACpB,gBAAM;AACN;AAAA,QACF;AACA,0BAAkB;AAClB;AAAA,MACF;AAEA,UAAI;AACJ,UAAI,iBAAiB;AACnB,cAAM,OAAO,YAAY,gBAAgB,KAAK,UAAU,KAAK,IAAI;AACjE,mBAAW;AAAA,UACT,MAAM;AAAA,UACN;AAAA,QAAA;AAAA,MAEJ;AACA,UAAI,CAAC,UAAU,MAAM;AACnB,mBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,UACnC,OAAO;AAAA,YACL,KAAK,UAAU;AAAA,YACf,OAAO;AAAA,UAAA;AAAA,UAET;AAAA,QAAA,CACD,GAAG;AACF,cAAI,SAAS,SAAS;AACpB,kBAAM;AACN;AAAA,UACF;AACA,gBAAM,OAAO,YAAY,KAAK,KAAK,UAAU,KAAK,IAAI;AACtD,qBAAW;AAAA,YACT;AAAA,YACA;AAAA,UAAA;AAEF,cAAI,MAAM;AACR;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAEA,UAAI,UAAU,MAAM;AAClB,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC,aAAK;AAAA,UACH;AAAA,UACA,UAAU;AAAA,UACV,SAAS,KAAK;AAAA,UACd;AAAA,QAAA;AAEF,eAAO,KAAK,QAAQ;AAAA,UAClB;AAAA,YACE,MAAM;AAAA,YACN,MAAM,SAAS;AAAA,UAAA;AAAA,UAEjB;AAAA,QAAA;AAEF;AAAA,MACF;AACA,WAAK;AAAA,QACH;AAAA,QACA,UAAU,OAAO;AAAA,QACjB,UAAU,KAAK;AAAA,QACf;AAAA,MAAA;AAEF,aAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,IACvC,WAAW,OAAO,SAAS,SAAS;AAGlC,UACE,UAAU,SACV,YAAY,OAAO,KAAK,KAAK,UAAU,KAAK,KAAK,GACjD;AACA,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,MACvC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,CAAC,gBAAgB,QAAqC;AACpD;AAAA,MACE,CAAC,KAAK,2BACJ,KAAK,wBAAwB,OAAO,QAAQ,KAAK,OAAO,KAAK,GAAG,MAAM;AAAA,MACxE;AAAA,IAAA;AAGF,UAAM,EAAC,WAAW,cAAc,UAAU,WAAA,IACxC,KAAK,uBAAuB,OAAO,QAAQ,GAAG;AAChD,QAAI,CAAC,WAAW;AACd;AAAA,IACF;AAEA,WAAO,UAAU,OAAO,qBAAqB;AAC7C,UAAM,EAAC,YAAA,IAAe,KAAK,UAAA;AAC3B,UAAM,SAAS,YAAY,OAAO,QAAQ,KAAK,UAAU,KAAK;AAC9D,UAAM,SAAS,YAAY,OAAO,KAAK,KAAK,UAAU,KAAK;AAE3D,UAAM,OAAO;AACb,UAAM,+BAA+B,aAAa;AAChD,WAAK;AAAA,QACH;AAAA,QACA,UAAU;AAAA,QACV,OAAO,KAAK;AAAA,QACZ;AAAA,MAAA;AAEF,aAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,IACvC;AAGA,QAAI,WAAW,GAAG;AAEhB,UAAI,WAAW,GAAG;AAEhB,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC;AAAA,MACF;AAEA,UAAI,SAAS,GAAG;AACd,YAAI,KAAK,WAAW,GAAG;AACrB,iBAAO,6BAAA;AACP;AAAA,QACF;AAMA,YAAI;AACJ,mBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,UACnC,OAAO;AAAA,YACL,KAAK,UAAU;AAAA,YACf,OAAO;AAAA,UAAA;AAAA,UAET;AAAA,UACA,SAAS;AAAA,QAAA,CACV,GAAG;AACF,cAAI,SAAS,SAAS;AACpB,kBAAM;AACN;AAAA,UACF;AACA,4BAAkB;AAClB;AAAA,QACF;AACA;AAAA,UACE,oBAAoB;AAAA,UACpB;AAAA,QAAA;AAGF,aAAK;AAAA,UACH;AAAA,UACA,UAAU;AAAA,UACV,gBAAgB;AAAA,UAChB;AAAA,QAAA;AAEF,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC;AAAA,MACF;AAEA,aAAO,SAAS,GAAG,uCAAuC;AAE1D,UAAI;AACJ,iBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,QACnC,OAAO;AAAA,UACL,KAAK,UAAU;AAAA,UACf,OAAO;AAAA,QAAA;AAAA,QAET;AAAA,MAAA,CACD,GAAG;AACF,YAAI,SAAS,SAAS;AACpB,gBAAM;AACN;AAAA,QACF;AACA,uBAAe;AACf;AAAA,MACF;AACA;AAAA,QACE,iBAAiB;AAAA,QACjB;AAAA,MAAA;AAKF,UAAI,YAAY,aAAa,KAAK,OAAO,KAAK,GAAG,MAAM,GAAG;AACxD,eAAO,6BAAA;AACP;AAAA,MACF;AAIA,WAAK;AAAA,QACH;AAAA,QACA,UAAU;AAAA,QACV,aAAa;AAAA,QACb;AAAA,MAAA;AAEF,aAAO,KAAK,4BAA4B,aAAa,KAAK;AAAA,QACxD,MAAM;AAAA,QACN,MAAM,OAAO;AAAA,MAAA,CACd;AACD,aAAO,KAAK,QAAQ;AAAA,QAClB;AAAA,UACE,MAAM;AAAA,UACN,MAAM;AAAA,QAAA;AAAA,QAER;AAAA,MAAA;AAEF;AAAA,IACF;AAEA,QAAI,SAAS,GAAG;AACd,aAAO,WAAW,GAAG,8CAA8C;AAGnE,UAAI,SAAS,GAAG;AACd;AAAA,MACF;AAGA,aAAO,SAAS,GAAG,oCAAoC;AAEvD,UAAI;AACJ,UAAI;AACJ,iBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,QACnC,OAAO;AAAA,UACL,KAAK,UAAU;AAAA,UACf,OAAO;AAAA,QAAA;AAAA,QAET;AAAA,QACA,SAAS;AAAA,MAAA,CACV,GAAG;AACF,YAAI,SAAS,SAAS;AACpB,gBAAM;AACN;AAAA,QACF,WAAW,iBAAiB,QAAW;AACrC,yBAAe;AAAA,QACjB,OAAO;AACL,yBAAe;AACf;AAAA,QACF;AAAA,MACF;AACA;AAAA,QACE,iBAAiB;AAAA,QACjB;AAAA,MAAA;AAEF;AAAA,QACE,iBAAiB;AAAA,QACjB;AAAA,MAAA;AAKF,WAAK;AAAA,QACH;AAAA,QACA,UAAU;AAAA,QACV,aAAa;AAAA,QACb;AAAA,MAAA;AAEF,aAAO,KAAK,4BAA4B,OAAO,KAAK,KAAK;AAAA,QACvD,MAAM;AAAA,QACN,MAAM;AAAA,MAAA,CACP;AACD,aAAO,KAAK,QAAQ;AAAA,QAClB;AAAA,UACE,MAAM;AAAA,UACN,MAAM,OAAO;AAAA,QAAA;AAAA,QAEf;AAAA,MAAA;AAGF;AAAA,IACF;AAEA,QAAI,SAAS,GAAG;AACd,aAAO,WAAW,GAAG,8CAA8C;AAGnE,UAAI,SAAS,GAAG;AACd,eAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC;AAAA,MACF;AAIA,aAAO,SAAS,GAAG,uCAAuC;AAI1D,UAAI;AACJ,iBAAW,QAAQ,KAAK,OAAO,MAAM;AAAA,QACnC,OAAO;AAAA,UACL,KAAK,UAAU;AAAA,UACf,OAAO;AAAA,QAAA;AAAA,QAET;AAAA,MAAA,CACD,GAAG;AACF,YAAI,SAAS,SAAS;AACpB,gBAAM;AACN;AAAA,QACF;AACA,yBAAiB;AACjB;AAAA,MACF;AACA;AAAA,QACE,mBAAmB;AAAA,QACnB;AAAA,MAAA;AAIF,UAAI,YAAY,eAAe,KAAK,OAAO,KAAK,GAAG,MAAM,GAAG;AAC1D,eAAO,6BAAA;AACP;AAAA,MACF;AAEA,aAAO,KAAK,QAAQ;AAAA,QAClB;AAAA,UACE,MAAM;AAAA,UACN,MAAM,OAAO;AAAA,QAAA;AAAA,QAEf;AAAA,MAAA;AAEF,WAAK;AAAA,QACH;AAAA,QACA,UAAU;AAAA,QACV,eAAe;AAAA,QACf;AAAA,MAAA;AAEF,aAAO,KAAK,QAAQ;AAAA,QAClB;AAAA,UACE,MAAM;AAAA,UACN,MAAM;AAAA,QAAA;AAAA,QAER;AAAA,MAAA;AAEF;AAAA,IACF;AAEA,gBAAA;AAAA,EACF;AAAA,EAEA,CAAC,4BAA4B,KAAU,QAAgB;AACrD,SAAK,sBAAsB;AAC3B,QAAI;AACF,aAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,IACvC,UAAA;AACE,WAAK,sBAAsB;AAAA,IAC7B;AAAA,EACF;AAAA,EAEA,cACE,cACA,MACA,OACA,UACA;AACA,SAAK,SAAS,IAAI,cAAc;AAAA,MAC9B;AAAA,MACA;AAAA,IAAA,CACD;AACD,QACE,UAAU,WACT,aAAa,UACZ,KAAK,UAAA,EAAY,YAAY,OAAO,QAAQ,IAAI,IAClD;AACA,WAAK,SAAS,IAAI,eAAe,KAAK;AAAA,IACxC;AAAA,EACF;AAAA,EAEA,UAAgB;AACd,SAAK,OAAO,QAAA;AAAA,EACd;AACF;AAEA,SAAS,gBACP,cACA,iBACQ;AAGR,QAAM,kBAA2B,CAAA;AAEjC,MAAI,gBAAgB,iBAAiB;AACnC,eAAW,OAAO,cAAc;AAC9B,sBAAgB,KAAK,gBAAgB,GAAG,CAAC;AAAA,IAC3C;AAAA,EACF;AAEA,SAAO,KAAK,UAAU,CAAC,QAAQ,GAAG,eAAe,CAAC;AACpD;AAEA,SAAS,8BACP,YACA,cACS;AACT,MAAI,eAAe,UAAa,iBAAiB,QAAW;AAC1D,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,aAAa,WAAW,OAAO,KAAK,UAAU,EAAE,QAAQ;AAC1D,WAAO;AAAA,EACT;AACA,aAAW,OAAO,cAAc;AAC9B,QAAI,CAAC,OAAO,YAAY,GAAG,GAAG;AAC5B,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,2BAA2B,cAAwC;AAC1E,SAAO,CAAC,GAAG,MAAM;AACf,eAAW,OAAO,cAAc;AAC9B,YAAM,MAAM,cAAc,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC;AACxC,UAAI,QAAQ,GAAG;AACb,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;"}

package/out/zql/src/ivm/union-fan-in.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"union-fan-in.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/union-fan-in.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AAExC,OAAO,KAAK,EAAC,IAAI,EAAC,MAAM,WAAW,CAAC;AACpC,OAAO,EAEL,KAAK,YAAY,EACjB,KAAK,KAAK,EACV,KAAK,SAAS,EACd,KAAK,QAAQ,EACb,KAAK,MAAM,EACZ,MAAM,eAAe,CAAC;AAMvB,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAQ,KAAK,MAAM,EAAC,MAAM,aAAa,CAAC;AAC/C,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,oBAAoB,CAAC;AAEpD,qBAAa,UAAW,YAAW,QAAQ;;gBAO7B,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE;IAgEhD,OAAO,IAAI,IAAI;IAMf,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC;IAOhD,SAAS,IAAI,YAAY;IAIxB,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC;IAgEzD,oBAAoB;IAKnB,iBAAiB,CAAC,gBAAgB,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC;IAuBrE,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;CAGhC;AAED,wBAAiB,YAAY,CAC3B,OAAO,EAAE,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC,EAAE,EACnC,UAAU,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,KAAK,MAAM,GACvC,gBAAgB,CAAC,IAAI,GAAG,OAAO,CAAC,CAuElC"}
+{"version":3,"file":"union-fan-in.d.ts","sourceRoot":"","sources":["../../../../../zql/src/ivm/union-fan-in.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,aAAa,CAAC;AAExC,OAAO,KAAK,EAAC,IAAI,EAAC,MAAM,WAAW,CAAC;AACpC,OAAO,EAEL,KAAK,YAAY,EACjB,KAAK,KAAK,EACV,KAAK,SAAS,EACd,KAAK,QAAQ,EACb,KAAK,MAAM,EACZ,MAAM,eAAe,CAAC;AAMvB,OAAO,KAAK,EAAC,YAAY,EAAC,MAAM,aAAa,CAAC;AAC9C,OAAO,EAAQ,KAAK,MAAM,EAAC,MAAM,aAAa,CAAC;AAC/C,OAAO,KAAK,EAAC,WAAW,EAAC,MAAM,oBAAoB,CAAC;AAEpD,qBAAa,UAAW,YAAW,QAAQ;;gBAO7B,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE;IAgEhD,OAAO,IAAI,IAAI;IAMf,KAAK,CAAC,GAAG,EAAE,YAAY,GAAG,MAAM,CAAC,IAAI,GAAG,OAAO,CAAC;IAOhD,SAAS,IAAI,YAAY;IAIxB,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC;IAoEzD,oBAAoB;IAQnB,iBAAiB,CAAC,gBAAgB,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC;IA0BrE,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;CAGhC;AAED,wBAAiB,YAAY,CAC3B,OAAO,EAAE,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC,EAAE,EACnC,UAAU,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,KAAK,MAAM,GACvC,gBAAgB,CAAC,IAAI,GAAG,OAAO,CAAC,CAuElC"}

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

@@ -110,7 +110,10 @@ class UnionFanIn {
       yield* this.#output.push(change, this);
       return;
     }
-    assert(change.type === "add" || change.type === "remove");
+    assert(
+      change.type === "add" || change.type === "remove",
+      () => `UnionFanIn: expected add or remove change type, got ${change.type}`
+    );
     let hadMatch = false;
     for (const input of this.#inputs) {
       if (input === pusher) {
@@ -132,11 +135,17 @@ class UnionFanIn {
     yield* this.#output.push(change, this);
   }
   fanOutStartedPushing() {
-    assert(this.#fanOutPushStarted === false);
+    assert(
+      this.#fanOutPushStarted === false,
+      "UnionFanIn: fanOutStartedPushing called while already pushing"
+    );
     this.#fanOutPushStarted = true;
   }
   *fanOutDonePushing(fanOutChangeType) {
-    assert(this.#fanOutPushStarted);
+    assert(
+      this.#fanOutPushStarted,
+      "UnionFanIn: fanOutDonePushing called without fanOutStartedPushing"
+    );
     this.#fanOutPushStarted = false;
     if (this.#inputs.length === 0) {
       return;

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

@@ -1 +1 @@
-{"version":3,"file":"union-fan-in.js","sources":["../../../../../zql/src/ivm/union-fan-in.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {Writable} from '../../../shared/src/writable.ts';\nimport type {Change} from './change.ts';\nimport type {Constraint} from './constraint.ts';\nimport type {Node} from './data.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type InputBase,\n  type Operator,\n  type Output,\n} from './operator.ts';\nimport {\n  makeAddEmptyRelationships,\n  mergeRelationships,\n  pushAccumulatedChanges,\n} from './push-accumulated.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {first, type Stream} from './stream.ts';\nimport type {UnionFanOut} from './union-fan-out.ts';\n\nexport class UnionFanIn implements Operator {\n  readonly #inputs: readonly Input[];\n  readonly #schema: SourceSchema;\n  #fanOutPushStarted: boolean = false;\n  #output: Output = throwOutput;\n  #accumulatedPushes: Change[] = [];\n\n  constructor(fanOut: UnionFanOut, inputs: Input[]) {\n    this.#inputs = inputs;\n    const fanOutSchema = fanOut.getSchema();\n    fanOut.setFanIn(this);\n\n    const schema: Writable<SourceSchema> = {\n      tableName: fanOutSchema.tableName,\n      columns: fanOutSchema.columns,\n      primaryKey: fanOutSchema.primaryKey,\n      relationships: {\n        ...fanOutSchema.relationships,\n      },\n      isHidden: fanOutSchema.isHidden,\n      system: fanOutSchema.system,\n      compareRows: fanOutSchema.compareRows,\n      sort: fanOutSchema.sort,\n    };\n\n    // now go through inputs and merge relationships\n    const relationshipsFromBranches: Set<string> = new Set();\n    for (const input of inputs) {\n      const inputSchema = input.getSchema();\n      assert(\n        schema.tableName === inputSchema.tableName,\n        `Table name mismatch in union fan-in: ${schema.tableName} !== ${inputSchema.tableName}`,\n      );\n      assert(\n        schema.primaryKey === inputSchema.primaryKey,\n        `Primary key mismatch in union fan-in`,\n      );\n      assert(\n        schema.system === inputSchema.system,\n        `System mismatch in union fan-in: ${schema.system} !== ${inputSchema.system}`,\n      );\n      assert(\n        schema.compareRows === inputSchema.compareRows,\n        `compareRows mismatch in union fan-in`,\n      );\n      assert(schema.sort === inputSchema.sort, `Sort mismatch in union fan-in`);\n\n      for (const [relName, relSchema] of Object.entries(\n        inputSchema.relationships,\n      )) {\n        if (relName in fanOutSchema.relationships) {\n          continue;\n        }\n\n        // All branches will have unique relationship names except for relationships\n        // that come in from `fanOut`.\n        assert(\n          !relationshipsFromBranches.has(relName),\n          `Relationship ${relName} exists in multiple upstream inputs to union fan-in`,\n        );\n        schema.relationships[relName] = relSchema;\n        relationshipsFromBranches.add(relName);\n      }\n\n      input.setOutput(this);\n    }\n\n    this.#schema = schema;\n    this.#inputs = inputs;\n  }\n\n  destroy(): void {\n    for (const input of this.#inputs) {\n      input.destroy();\n    }\n  }\n\n  fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    const iterables = this.#inputs.map(input => input.fetch(req));\n    return mergeFetches(iterables, (l, r) =>\n      this.#schema.compareRows(l.row, r.row),\n    );\n  }\n\n  getSchema(): SourceSchema {\n    return this.#schema;\n  }\n\n  *push(change: Change, pusher: InputBase): Stream<'yield'> {\n    if (!this.#fanOutPushStarted) {\n      yield* this.#pushInternalChange(change, pusher);\n    } else {\n      this.#accumulatedPushes.push(change);\n    }\n  }\n\n  /**\n   * An internal change means that a change was received inside the fan-out/fan-in sub-graph.\n   *\n   * These changes always come from children of a flip-join as no other push generating operators\n   * currently exist between union-fan-in and union-fan-out. All other pushes\n   * enter into union-fan-out before reaching union-fan-in.\n   *\n   * - normal joins for `exists` come before `union-fan-out`\n   * - joins for `related` come after `union-fan-out`\n   * - take comes after `union-fan-out`\n   *\n   * The algorithm for deciding whether or not to forward a push that came from inside the ufo/ufi sub-graph:\n   * 1. If the change is a `child` change we can forward it. This is because all child branches in the ufo/ufi sub-graph are unique.\n   * 2. If the change is `add` we can forward it iff no `fetches` for the row return any results.\n   *    If another branch has it, the add was already emitted in the past.\n   * 3. If the change is `remove` we can forward it iff no `fetches` for the row return any results.\n   *    If no other branches have the change, the remove can be sent as the value is no longer present.\n   *    If other branches have it, the last branch the processes the remove will send the remove.\n   * 4. Edits will always come through as child changes as flip join will flip them into children.\n   *    An edit that would result in a remove or add will have been split into an add/remove pair rather than being an edit.\n   */\n  *#pushInternalChange(change: Change, pusher: InputBase): Stream<'yield'> {\n    if (change.type === 'child') {\n      yield* this.#output.push(change, this);\n      return;\n    }\n\n    assert(change.type === 'add' || change.type === 'remove');\n\n    let hadMatch = false;\n    for (const input of this.#inputs) {\n      if (input === pusher) {\n        hadMatch = true;\n        continue;\n      }\n\n      const constraint: Writable<Constraint> = {};\n      for (const key of this.#schema.primaryKey) {\n        constraint[key] = change.node.row[key];\n      }\n      const fetchResult = input.fetch({\n        constraint,\n      });\n\n      if (first(fetchResult) !== undefined) {\n        // Another branch has the row, so the add/remove is not needed.\n        return;\n      }\n    }\n\n    assert(hadMatch, 'Pusher was not one of the inputs to union-fan-in!');\n\n    // No other branches have the row, so we can push the change.\n    yield* this.#output.push(change, this);\n  }\n\n  fanOutStartedPushing() {\n    assert(this.#fanOutPushStarted === false);\n    this.#fanOutPushStarted = true;\n  }\n\n  *fanOutDonePushing(fanOutChangeType: Change['type']): Stream<'yield'> {\n    assert(this.#fanOutPushStarted);\n    this.#fanOutPushStarted = false;\n    if (this.#inputs.length === 0) {\n      return;\n    }\n\n    if (this.#accumulatedPushes.length === 0) {\n      // It is possible for no forks to pass along the push.\n      // E.g., if no filters match in any fork.\n      return;\n    }\n\n    yield* pushAccumulatedChanges(\n      this.#accumulatedPushes,\n      this.#output,\n      this,\n      fanOutChangeType,\n      mergeRelationships,\n      makeAddEmptyRelationships(this.#schema),\n    );\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n}\n\nexport function* mergeFetches(\n  fetches: Iterable<Node | 'yield'>[],\n  comparator: (l: Node, r: Node) => number,\n): IterableIterator<Node | 'yield'> {\n  const iterators = fetches.map(i => i[Symbol.iterator]());\n  let threw = false;\n  try {\n    const current: (Node | null)[] = [];\n    let lastNodeYielded: Node | undefined;\n    for (let i = 0; i < iterators.length; i++) {\n      const iter = iterators[i];\n      let result = iter.next();\n      // yield yields when initializing\n      while (!result.done && result.value === 'yield') {\n        yield result.value;\n        result = iter.next();\n      }\n      current[i] = result.done ? null : (result.value as Node);\n    }\n    while (current.some(c => c !== null)) {\n      const min = current.reduce(\n        (acc: [Node, number] | undefined, c, i): [Node, number] | undefined => {\n          if (c === null) {\n            return acc;\n          }\n          if (acc === undefined || comparator(c, acc[0]) < 0) {\n            return [c, i];\n          }\n          return acc;\n        },\n        undefined,\n      );\n\n      assert(min !== undefined, 'min is undefined');\n      const [minNode, minIndex] = min;\n      const iter = iterators[minIndex];\n      let result = iter.next();\n      while (!result.done && result.value === 'yield') {\n        yield result.value;\n        result = iter.next();\n      }\n      current[minIndex] = result.done ? null : (result.value as Node);\n      if (\n        lastNodeYielded !== undefined &&\n        comparator(lastNodeYielded, minNode) === 0\n      ) {\n        continue;\n      }\n      lastNodeYielded = minNode;\n      yield minNode;\n    }\n  } catch (e) {\n    threw = true;\n    for (const iter of iterators) {\n      try {\n        iter.throw?.(e);\n      } catch (_cleanupError) {\n        // error in the iter.throw cleanup,\n        // catch so other iterators are cleaned up\n      }\n    }\n    throw e;\n  } finally {\n    if (!threw) {\n      for (const iter of iterators) {\n        try {\n          iter.return?.();\n        } catch (_cleanupError) {\n          // error in the iter.return cleanup,\n          // catch so other iterators are cleaned up\n        }\n      }\n    }\n  }\n}\n"],"names":[],"mappings":";;;;AAsBO,MAAM,WAA+B;AAAA,EACjC;AAAA,EACA;AAAA,EACT,qBAA8B;AAAA,EAC9B,UAAkB;AAAA,EAClB,qBAA+B,CAAA;AAAA,EAE/B,YAAY,QAAqB,QAAiB;AAChD,SAAK,UAAU;AACf,UAAM,eAAe,OAAO,UAAA;AAC5B,WAAO,SAAS,IAAI;AAEpB,UAAM,SAAiC;AAAA,MACrC,WAAW,aAAa;AAAA,MACxB,SAAS,aAAa;AAAA,MACtB,YAAY,aAAa;AAAA,MACzB,eAAe;AAAA,QACb,GAAG,aAAa;AAAA,MAAA;AAAA,MAElB,UAAU,aAAa;AAAA,MACvB,QAAQ,aAAa;AAAA,MACrB,aAAa,aAAa;AAAA,MAC1B,MAAM,aAAa;AAAA,IAAA;AAIrB,UAAM,gDAA6C,IAAA;AACnD,eAAW,SAAS,QAAQ;AAC1B,YAAM,cAAc,MAAM,UAAA;AAC1B;AAAA,QACE,OAAO,cAAc,YAAY;AAAA,QACjC,wCAAwC,OAAO,SAAS,QAAQ,YAAY,SAAS;AAAA,MAAA;AAEvF;AAAA,QACE,OAAO,eAAe,YAAY;AAAA,QAClC;AAAA,MAAA;AAEF;AAAA,QACE,OAAO,WAAW,YAAY;AAAA,QAC9B,oCAAoC,OAAO,MAAM,QAAQ,YAAY,MAAM;AAAA,MAAA;AAE7E;AAAA,QACE,OAAO,gBAAgB,YAAY;AAAA,QACnC;AAAA,MAAA;AAEF,aAAO,OAAO,SAAS,YAAY,MAAM,+BAA+B;AAExE,iBAAW,CAAC,SAAS,SAAS,KAAK,OAAO;AAAA,QACxC,YAAY;AAAA,MAAA,GACX;AACD,YAAI,WAAW,aAAa,eAAe;AACzC;AAAA,QACF;AAIA;AAAA,UACE,CAAC,0BAA0B,IAAI,OAAO;AAAA,UACtC,gBAAgB,OAAO;AAAA,QAAA;AAEzB,eAAO,cAAc,OAAO,IAAI;AAChC,kCAA0B,IAAI,OAAO;AAAA,MACvC;AAEA,YAAM,UAAU,IAAI;AAAA,IACtB;AAEA,SAAK,UAAU;AACf,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,UAAgB;AACd,eAAW,SAAS,KAAK,SAAS;AAChC,YAAM,QAAA;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAM,KAA2C;AAC/C,UAAM,YAAY,KAAK,QAAQ,IAAI,WAAS,MAAM,MAAM,GAAG,CAAC;AAC5D,WAAO;AAAA,MAAa;AAAA,MAAW,CAAC,GAAG,MACjC,KAAK,QAAQ,YAAY,EAAE,KAAK,EAAE,GAAG;AAAA,IAAA;AAAA,EAEzC;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,CAAC,KAAK,QAAgB,QAAoC;AACxD,QAAI,CAAC,KAAK,oBAAoB;AAC5B,aAAO,KAAK,oBAAoB,QAAQ,MAAM;AAAA,IAChD,OAAO;AACL,WAAK,mBAAmB,KAAK,MAAM;AAAA,IACrC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBA,CAAC,oBAAoB,QAAgB,QAAoC;AACvE,QAAI,OAAO,SAAS,SAAS;AAC3B,aAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC;AAAA,IACF;AAEA,WAAO,OAAO,SAAS,SAAS,OAAO,SAAS,QAAQ;AAExD,QAAI,WAAW;AACf,eAAW,SAAS,KAAK,SAAS;AAChC,UAAI,UAAU,QAAQ;AACpB,mBAAW;AACX;AAAA,MACF;AAEA,YAAM,aAAmC,CAAA;AACzC,iBAAW,OAAO,KAAK,QAAQ,YAAY;AACzC,mBAAW,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG;AAAA,MACvC;AACA,YAAM,cAAc,MAAM,MAAM;AAAA,QAC9B;AAAA,MAAA,CACD;AAED,UAAI,MAAM,WAAW,MAAM,QAAW;AAEpC;AAAA,MACF;AAAA,IACF;AAEA,WAAO,UAAU,mDAAmD;AAGpE,WAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,EACvC;AAAA,EAEA,uBAAuB;AACrB,WAAO,KAAK,uBAAuB,KAAK;AACxC,SAAK,qBAAqB;AAAA,EAC5B;AAAA,EAEA,CAAC,kBAAkB,kBAAmD;AACpE,WAAO,KAAK,kBAAkB;AAC9B,SAAK,qBAAqB;AAC1B,QAAI,KAAK,QAAQ,WAAW,GAAG;AAC7B;AAAA,IACF;AAEA,QAAI,KAAK,mBAAmB,WAAW,GAAG;AAGxC;AAAA,IACF;AAEA,WAAO;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,0BAA0B,KAAK,OAAO;AAAA,IAAA;AAAA,EAE1C;AAAA,EAEA,UAAU,QAAsB;AAC9B,SAAK,UAAU;AAAA,EACjB;AACF;AAEO,UAAU,aACf,SACA,YACkC;AAClC,QAAM,YAAY,QAAQ,IAAI,CAAA,MAAK,EAAE,OAAO,QAAQ,GAAG;AACvD,MAAI,QAAQ;AACZ,MAAI;AACF,UAAM,UAA2B,CAAA;AACjC,QAAI;AACJ,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,YAAM,OAAO,UAAU,CAAC;AACxB,UAAI,SAAS,KAAK,KAAA;AAElB,aAAO,CAAC,OAAO,QAAQ,OAAO,UAAU,SAAS;AAC/C,cAAM,OAAO;AACb,iBAAS,KAAK,KAAA;AAAA,MAChB;AACA,cAAQ,CAAC,IAAI,OAAO,OAAO,OAAQ,OAAO;AAAA,IAC5C;AACA,WAAO,QAAQ,KAAK,CAAA,MAAK,MAAM,IAAI,GAAG;AACpC,YAAM,MAAM,QAAQ;AAAA,QAClB,CAAC,KAAiC,GAAG,MAAkC;AACrE,cAAI,MAAM,MAAM;AACd,mBAAO;AAAA,UACT;AACA,cAAI,QAAQ,UAAa,WAAW,GAAG,IAAI,CAAC,CAAC,IAAI,GAAG;AAClD,mBAAO,CAAC,GAAG,CAAC;AAAA,UACd;AACA,iBAAO;AAAA,QACT;AAAA,QACA;AAAA,MAAA;AAGF,aAAO,QAAQ,QAAW,kBAAkB;AAC5C,YAAM,CAAC,SAAS,QAAQ,IAAI;AAC5B,YAAM,OAAO,UAAU,QAAQ;AAC/B,UAAI,SAAS,KAAK,KAAA;AAClB,aAAO,CAAC,OAAO,QAAQ,OAAO,UAAU,SAAS;AAC/C,cAAM,OAAO;AACb,iBAAS,KAAK,KAAA;AAAA,MAChB;AACA,cAAQ,QAAQ,IAAI,OAAO,OAAO,OAAQ,OAAO;AACjD,UACE,oBAAoB,UACpB,WAAW,iBAAiB,OAAO,MAAM,GACzC;AACA;AAAA,MACF;AACA,wBAAkB;AAClB,YAAM;AAAA,IACR;AAAA,EACF,SAAS,GAAG;AACV,YAAQ;AACR,eAAW,QAAQ,WAAW;AAC5B,UAAI;AACF,aAAK,QAAQ,CAAC;AAAA,MAChB,SAAS,eAAe;AAAA,MAGxB;AAAA,IACF;AACA,UAAM;AAAA,EACR,UAAA;AACE,QAAI,CAAC,OAAO;AACV,iBAAW,QAAQ,WAAW;AAC5B,YAAI;AACF,eAAK,SAAA;AAAA,QACP,SAAS,eAAe;AAAA,QAGxB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;"}
+{"version":3,"file":"union-fan-in.js","sources":["../../../../../zql/src/ivm/union-fan-in.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport type {Writable} from '../../../shared/src/writable.ts';\nimport type {Change} from './change.ts';\nimport type {Constraint} from './constraint.ts';\nimport type {Node} from './data.ts';\nimport {\n  throwOutput,\n  type FetchRequest,\n  type Input,\n  type InputBase,\n  type Operator,\n  type Output,\n} from './operator.ts';\nimport {\n  makeAddEmptyRelationships,\n  mergeRelationships,\n  pushAccumulatedChanges,\n} from './push-accumulated.ts';\nimport type {SourceSchema} from './schema.ts';\nimport {first, type Stream} from './stream.ts';\nimport type {UnionFanOut} from './union-fan-out.ts';\n\nexport class UnionFanIn implements Operator {\n  readonly #inputs: readonly Input[];\n  readonly #schema: SourceSchema;\n  #fanOutPushStarted: boolean = false;\n  #output: Output = throwOutput;\n  #accumulatedPushes: Change[] = [];\n\n  constructor(fanOut: UnionFanOut, inputs: Input[]) {\n    this.#inputs = inputs;\n    const fanOutSchema = fanOut.getSchema();\n    fanOut.setFanIn(this);\n\n    const schema: Writable<SourceSchema> = {\n      tableName: fanOutSchema.tableName,\n      columns: fanOutSchema.columns,\n      primaryKey: fanOutSchema.primaryKey,\n      relationships: {\n        ...fanOutSchema.relationships,\n      },\n      isHidden: fanOutSchema.isHidden,\n      system: fanOutSchema.system,\n      compareRows: fanOutSchema.compareRows,\n      sort: fanOutSchema.sort,\n    };\n\n    // now go through inputs and merge relationships\n    const relationshipsFromBranches: Set<string> = new Set();\n    for (const input of inputs) {\n      const inputSchema = input.getSchema();\n      assert(\n        schema.tableName === inputSchema.tableName,\n        `Table name mismatch in union fan-in: ${schema.tableName} !== ${inputSchema.tableName}`,\n      );\n      assert(\n        schema.primaryKey === inputSchema.primaryKey,\n        `Primary key mismatch in union fan-in`,\n      );\n      assert(\n        schema.system === inputSchema.system,\n        `System mismatch in union fan-in: ${schema.system} !== ${inputSchema.system}`,\n      );\n      assert(\n        schema.compareRows === inputSchema.compareRows,\n        `compareRows mismatch in union fan-in`,\n      );\n      assert(schema.sort === inputSchema.sort, `Sort mismatch in union fan-in`);\n\n      for (const [relName, relSchema] of Object.entries(\n        inputSchema.relationships,\n      )) {\n        if (relName in fanOutSchema.relationships) {\n          continue;\n        }\n\n        // All branches will have unique relationship names except for relationships\n        // that come in from `fanOut`.\n        assert(\n          !relationshipsFromBranches.has(relName),\n          `Relationship ${relName} exists in multiple upstream inputs to union fan-in`,\n        );\n        schema.relationships[relName] = relSchema;\n        relationshipsFromBranches.add(relName);\n      }\n\n      input.setOutput(this);\n    }\n\n    this.#schema = schema;\n    this.#inputs = inputs;\n  }\n\n  destroy(): void {\n    for (const input of this.#inputs) {\n      input.destroy();\n    }\n  }\n\n  fetch(req: FetchRequest): Stream<Node | 'yield'> {\n    const iterables = this.#inputs.map(input => input.fetch(req));\n    return mergeFetches(iterables, (l, r) =>\n      this.#schema.compareRows(l.row, r.row),\n    );\n  }\n\n  getSchema(): SourceSchema {\n    return this.#schema;\n  }\n\n  *push(change: Change, pusher: InputBase): Stream<'yield'> {\n    if (!this.#fanOutPushStarted) {\n      yield* this.#pushInternalChange(change, pusher);\n    } else {\n      this.#accumulatedPushes.push(change);\n    }\n  }\n\n  /**\n   * An internal change means that a change was received inside the fan-out/fan-in sub-graph.\n   *\n   * These changes always come from children of a flip-join as no other push generating operators\n   * currently exist between union-fan-in and union-fan-out. All other pushes\n   * enter into union-fan-out before reaching union-fan-in.\n   *\n   * - normal joins for `exists` come before `union-fan-out`\n   * - joins for `related` come after `union-fan-out`\n   * - take comes after `union-fan-out`\n   *\n   * The algorithm for deciding whether or not to forward a push that came from inside the ufo/ufi sub-graph:\n   * 1. If the change is a `child` change we can forward it. This is because all child branches in the ufo/ufi sub-graph are unique.\n   * 2. If the change is `add` we can forward it iff no `fetches` for the row return any results.\n   *    If another branch has it, the add was already emitted in the past.\n   * 3. If the change is `remove` we can forward it iff no `fetches` for the row return any results.\n   *    If no other branches have the change, the remove can be sent as the value is no longer present.\n   *    If other branches have it, the last branch the processes the remove will send the remove.\n   * 4. Edits will always come through as child changes as flip join will flip them into children.\n   *    An edit that would result in a remove or add will have been split into an add/remove pair rather than being an edit.\n   */\n  *#pushInternalChange(change: Change, pusher: InputBase): Stream<'yield'> {\n    if (change.type === 'child') {\n      yield* this.#output.push(change, this);\n      return;\n    }\n\n    assert(\n      change.type === 'add' || change.type === 'remove',\n      () =>\n        `UnionFanIn: expected add or remove change type, got ${change.type}`,\n    );\n\n    let hadMatch = false;\n    for (const input of this.#inputs) {\n      if (input === pusher) {\n        hadMatch = true;\n        continue;\n      }\n\n      const constraint: Writable<Constraint> = {};\n      for (const key of this.#schema.primaryKey) {\n        constraint[key] = change.node.row[key];\n      }\n      const fetchResult = input.fetch({\n        constraint,\n      });\n\n      if (first(fetchResult) !== undefined) {\n        // Another branch has the row, so the add/remove is not needed.\n        return;\n      }\n    }\n\n    assert(hadMatch, 'Pusher was not one of the inputs to union-fan-in!');\n\n    // No other branches have the row, so we can push the change.\n    yield* this.#output.push(change, this);\n  }\n\n  fanOutStartedPushing() {\n    assert(\n      this.#fanOutPushStarted === false,\n      'UnionFanIn: fanOutStartedPushing called while already pushing',\n    );\n    this.#fanOutPushStarted = true;\n  }\n\n  *fanOutDonePushing(fanOutChangeType: Change['type']): Stream<'yield'> {\n    assert(\n      this.#fanOutPushStarted,\n      'UnionFanIn: fanOutDonePushing called without fanOutStartedPushing',\n    );\n    this.#fanOutPushStarted = false;\n    if (this.#inputs.length === 0) {\n      return;\n    }\n\n    if (this.#accumulatedPushes.length === 0) {\n      // It is possible for no forks to pass along the push.\n      // E.g., if no filters match in any fork.\n      return;\n    }\n\n    yield* pushAccumulatedChanges(\n      this.#accumulatedPushes,\n      this.#output,\n      this,\n      fanOutChangeType,\n      mergeRelationships,\n      makeAddEmptyRelationships(this.#schema),\n    );\n  }\n\n  setOutput(output: Output): void {\n    this.#output = output;\n  }\n}\n\nexport function* mergeFetches(\n  fetches: Iterable<Node | 'yield'>[],\n  comparator: (l: Node, r: Node) => number,\n): IterableIterator<Node | 'yield'> {\n  const iterators = fetches.map(i => i[Symbol.iterator]());\n  let threw = false;\n  try {\n    const current: (Node | null)[] = [];\n    let lastNodeYielded: Node | undefined;\n    for (let i = 0; i < iterators.length; i++) {\n      const iter = iterators[i];\n      let result = iter.next();\n      // yield yields when initializing\n      while (!result.done && result.value === 'yield') {\n        yield result.value;\n        result = iter.next();\n      }\n      current[i] = result.done ? null : (result.value as Node);\n    }\n    while (current.some(c => c !== null)) {\n      const min = current.reduce(\n        (acc: [Node, number] | undefined, c, i): [Node, number] | undefined => {\n          if (c === null) {\n            return acc;\n          }\n          if (acc === undefined || comparator(c, acc[0]) < 0) {\n            return [c, i];\n          }\n          return acc;\n        },\n        undefined,\n      );\n\n      assert(min !== undefined, 'min is undefined');\n      const [minNode, minIndex] = min;\n      const iter = iterators[minIndex];\n      let result = iter.next();\n      while (!result.done && result.value === 'yield') {\n        yield result.value;\n        result = iter.next();\n      }\n      current[minIndex] = result.done ? null : (result.value as Node);\n      if (\n        lastNodeYielded !== undefined &&\n        comparator(lastNodeYielded, minNode) === 0\n      ) {\n        continue;\n      }\n      lastNodeYielded = minNode;\n      yield minNode;\n    }\n  } catch (e) {\n    threw = true;\n    for (const iter of iterators) {\n      try {\n        iter.throw?.(e);\n      } catch (_cleanupError) {\n        // error in the iter.throw cleanup,\n        // catch so other iterators are cleaned up\n      }\n    }\n    throw e;\n  } finally {\n    if (!threw) {\n      for (const iter of iterators) {\n        try {\n          iter.return?.();\n        } catch (_cleanupError) {\n          // error in the iter.return cleanup,\n          // catch so other iterators are cleaned up\n        }\n      }\n    }\n  }\n}\n"],"names":[],"mappings":";;;;AAsBO,MAAM,WAA+B;AAAA,EACjC;AAAA,EACA;AAAA,EACT,qBAA8B;AAAA,EAC9B,UAAkB;AAAA,EAClB,qBAA+B,CAAA;AAAA,EAE/B,YAAY,QAAqB,QAAiB;AAChD,SAAK,UAAU;AACf,UAAM,eAAe,OAAO,UAAA;AAC5B,WAAO,SAAS,IAAI;AAEpB,UAAM,SAAiC;AAAA,MACrC,WAAW,aAAa;AAAA,MACxB,SAAS,aAAa;AAAA,MACtB,YAAY,aAAa;AAAA,MACzB,eAAe;AAAA,QACb,GAAG,aAAa;AAAA,MAAA;AAAA,MAElB,UAAU,aAAa;AAAA,MACvB,QAAQ,aAAa;AAAA,MACrB,aAAa,aAAa;AAAA,MAC1B,MAAM,aAAa;AAAA,IAAA;AAIrB,UAAM,gDAA6C,IAAA;AACnD,eAAW,SAAS,QAAQ;AAC1B,YAAM,cAAc,MAAM,UAAA;AAC1B;AAAA,QACE,OAAO,cAAc,YAAY;AAAA,QACjC,wCAAwC,OAAO,SAAS,QAAQ,YAAY,SAAS;AAAA,MAAA;AAEvF;AAAA,QACE,OAAO,eAAe,YAAY;AAAA,QAClC;AAAA,MAAA;AAEF;AAAA,QACE,OAAO,WAAW,YAAY;AAAA,QAC9B,oCAAoC,OAAO,MAAM,QAAQ,YAAY,MAAM;AAAA,MAAA;AAE7E;AAAA,QACE,OAAO,gBAAgB,YAAY;AAAA,QACnC;AAAA,MAAA;AAEF,aAAO,OAAO,SAAS,YAAY,MAAM,+BAA+B;AAExE,iBAAW,CAAC,SAAS,SAAS,KAAK,OAAO;AAAA,QACxC,YAAY;AAAA,MAAA,GACX;AACD,YAAI,WAAW,aAAa,eAAe;AACzC;AAAA,QACF;AAIA;AAAA,UACE,CAAC,0BAA0B,IAAI,OAAO;AAAA,UACtC,gBAAgB,OAAO;AAAA,QAAA;AAEzB,eAAO,cAAc,OAAO,IAAI;AAChC,kCAA0B,IAAI,OAAO;AAAA,MACvC;AAEA,YAAM,UAAU,IAAI;AAAA,IACtB;AAEA,SAAK,UAAU;AACf,SAAK,UAAU;AAAA,EACjB;AAAA,EAEA,UAAgB;AACd,eAAW,SAAS,KAAK,SAAS;AAChC,YAAM,QAAA;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAM,KAA2C;AAC/C,UAAM,YAAY,KAAK,QAAQ,IAAI,WAAS,MAAM,MAAM,GAAG,CAAC;AAC5D,WAAO;AAAA,MAAa;AAAA,MAAW,CAAC,GAAG,MACjC,KAAK,QAAQ,YAAY,EAAE,KAAK,EAAE,GAAG;AAAA,IAAA;AAAA,EAEzC;AAAA,EAEA,YAA0B;AACxB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,CAAC,KAAK,QAAgB,QAAoC;AACxD,QAAI,CAAC,KAAK,oBAAoB;AAC5B,aAAO,KAAK,oBAAoB,QAAQ,MAAM;AAAA,IAChD,OAAO;AACL,WAAK,mBAAmB,KAAK,MAAM;AAAA,IACrC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAuBA,CAAC,oBAAoB,QAAgB,QAAoC;AACvE,QAAI,OAAO,SAAS,SAAS;AAC3B,aAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AACrC;AAAA,IACF;AAEA;AAAA,MACE,OAAO,SAAS,SAAS,OAAO,SAAS;AAAA,MACzC,MACE,uDAAuD,OAAO,IAAI;AAAA,IAAA;AAGtE,QAAI,WAAW;AACf,eAAW,SAAS,KAAK,SAAS;AAChC,UAAI,UAAU,QAAQ;AACpB,mBAAW;AACX;AAAA,MACF;AAEA,YAAM,aAAmC,CAAA;AACzC,iBAAW,OAAO,KAAK,QAAQ,YAAY;AACzC,mBAAW,GAAG,IAAI,OAAO,KAAK,IAAI,GAAG;AAAA,MACvC;AACA,YAAM,cAAc,MAAM,MAAM;AAAA,QAC9B;AAAA,MAAA,CACD;AAED,UAAI,MAAM,WAAW,MAAM,QAAW;AAEpC;AAAA,MACF;AAAA,IACF;AAEA,WAAO,UAAU,mDAAmD;AAGpE,WAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI;AAAA,EACvC;AAAA,EAEA,uBAAuB;AACrB;AAAA,MACE,KAAK,uBAAuB;AAAA,MAC5B;AAAA,IAAA;AAEF,SAAK,qBAAqB;AAAA,EAC5B;AAAA,EAEA,CAAC,kBAAkB,kBAAmD;AACpE;AAAA,MACE,KAAK;AAAA,MACL;AAAA,IAAA;AAEF,SAAK,qBAAqB;AAC1B,QAAI,KAAK,QAAQ,WAAW,GAAG;AAC7B;AAAA,IACF;AAEA,QAAI,KAAK,mBAAmB,WAAW,GAAG;AAGxC;AAAA,IACF;AAEA,WAAO;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,0BAA0B,KAAK,OAAO;AAAA,IAAA;AAAA,EAE1C;AAAA,EAEA,UAAU,QAAsB;AAC9B,SAAK,UAAU;AAAA,EACjB;AACF;AAEO,UAAU,aACf,SACA,YACkC;AAClC,QAAM,YAAY,QAAQ,IAAI,CAAA,MAAK,EAAE,OAAO,QAAQ,GAAG;AACvD,MAAI,QAAQ;AACZ,MAAI;AACF,UAAM,UAA2B,CAAA;AACjC,QAAI;AACJ,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,YAAM,OAAO,UAAU,CAAC;AACxB,UAAI,SAAS,KAAK,KAAA;AAElB,aAAO,CAAC,OAAO,QAAQ,OAAO,UAAU,SAAS;AAC/C,cAAM,OAAO;AACb,iBAAS,KAAK,KAAA;AAAA,MAChB;AACA,cAAQ,CAAC,IAAI,OAAO,OAAO,OAAQ,OAAO;AAAA,IAC5C;AACA,WAAO,QAAQ,KAAK,CAAA,MAAK,MAAM,IAAI,GAAG;AACpC,YAAM,MAAM,QAAQ;AAAA,QAClB,CAAC,KAAiC,GAAG,MAAkC;AACrE,cAAI,MAAM,MAAM;AACd,mBAAO;AAAA,UACT;AACA,cAAI,QAAQ,UAAa,WAAW,GAAG,IAAI,CAAC,CAAC,IAAI,GAAG;AAClD,mBAAO,CAAC,GAAG,CAAC;AAAA,UACd;AACA,iBAAO;AAAA,QACT;AAAA,QACA;AAAA,MAAA;AAGF,aAAO,QAAQ,QAAW,kBAAkB;AAC5C,YAAM,CAAC,SAAS,QAAQ,IAAI;AAC5B,YAAM,OAAO,UAAU,QAAQ;AAC/B,UAAI,SAAS,KAAK,KAAA;AAClB,aAAO,CAAC,OAAO,QAAQ,OAAO,UAAU,SAAS;AAC/C,cAAM,OAAO;AACb,iBAAS,KAAK,KAAA;AAAA,MAChB;AACA,cAAQ,QAAQ,IAAI,OAAO,OAAO,OAAQ,OAAO;AACjD,UACE,oBAAoB,UACpB,WAAW,iBAAiB,OAAO,MAAM,GACzC;AACA;AAAA,MACF;AACA,wBAAkB;AAClB,YAAM;AAAA,IACR;AAAA,EACF,SAAS,GAAG;AACV,YAAQ;AACR,eAAW,QAAQ,WAAW;AAC5B,UAAI;AACF,aAAK,QAAQ,CAAC;AAAA,MAChB,SAAS,eAAe;AAAA,MAGxB;AAAA,IACF;AACA,UAAM;AAAA,EACR,UAAA;AACE,QAAI,CAAC,OAAO;AACV,iBAAW,QAAQ,WAAW;AAC5B,YAAI;AACF,eAAK,SAAA;AAAA,QACP,SAAS,eAAe;AAAA,QAGxB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACF;"}

package/out/zql/src/mutate/mutator.js

@@ -5,12 +5,12 @@ function isMutatorDefinition(f) {
 function defineMutator(validatorOrMutator, mutator) {
   let validator;
   let actualMutator;
-  if (typeof validatorOrMutator === "function") {
-    validator = void 0;
-    actualMutator = validatorOrMutator;
-  } else {
+  if ("~standard" in validatorOrMutator) {
     validator = validatorOrMutator;
     actualMutator = must(mutator);
+  } else {
+    validator = void 0;
+    actualMutator = validatorOrMutator;
   }
   const mutatorDefinition = {
     "fn": actualMutator,

package/out/zql/src/mutate/mutator.js.map

@@ -1 +1 @@
-{"version":3,"file":"mutator.js","sources":["../../../../../zql/src/mutate/mutator.ts"],"sourcesContent":["import type {StandardSchemaV1} from '@standard-schema/spec';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {\n  DefaultContext,\n  DefaultSchema,\n  DefaultWrappedTransaction,\n} from '../../../zero-types/src/default-types.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport type {AnyTransaction, Transaction} from './custom.ts';\n\n// ----------------------------------------------------------------------------\n// defineMutator\n// ----------------------------------------------------------------------------\n\nexport type MutatorDefinitionTypes<\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput,\n  TContext,\n  TWrappedTransaction,\n> = 'MutatorDefinition' & {\n  readonly $input: TInput;\n  readonly $output: TOutput;\n  readonly $context: TContext;\n  readonly $wrappedTransaction: TWrappedTransaction;\n};\n\nexport type MutatorDefinition<\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n> = {\n  readonly 'fn': MutatorDefinitionFunction<TOutput, TContext, AnyTransaction>;\n  readonly 'validator': StandardSchemaV1<TInput, TOutput> | undefined;\n  readonly '~': MutatorDefinitionTypes<\n    TInput,\n    TOutput,\n    TContext,\n    TWrappedTransaction\n  >;\n};\n\n// oxlint-disable-next-line no-explicit-any\nexport type AnyMutatorDefinition = MutatorDefinition<any, any, any, any>;\n\nexport function isMutatorDefinition(f: unknown): f is AnyMutatorDefinition {\n  return (\n    typeof f === 'object' &&\n    f !== null &&\n    (f as {['~']?: unknown})['~'] === 'MutatorDefinition'\n  );\n}\n\n// Overload for no validator\nexport function defineMutator<\n  TInput extends ReadonlyJSONValue | undefined = ReadonlyJSONValue | undefined,\n  TSchema extends Schema = DefaultSchema,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n>(\n  mutator: MutatorDefinitionFunction<\n    TInput,\n    TContext,\n    Transaction<TSchema, TWrappedTransaction>\n  >,\n): MutatorDefinition<TInput, TInput, TContext, TWrappedTransaction>;\n\n// Overload for validator\nexport function defineMutator<\n  TInput extends ReadonlyJSONValue | undefined = undefined,\n  TOutput extends ReadonlyJSONValue | undefined = TInput,\n  TSchema extends Schema = DefaultSchema,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n>(\n  validator: StandardSchemaV1<TInput, TOutput>,\n  mutator: MutatorDefinitionFunction<\n    TOutput,\n    TContext,\n    Transaction<TSchema, TWrappedTransaction>\n  >,\n): MutatorDefinition<TInput, TOutput, TContext, TWrappedTransaction>;\n\n// Implementation\nexport function defineMutator<\n  TInput extends ReadonlyJSONValue | undefined = undefined,\n  TOutput extends ReadonlyJSONValue | undefined = TInput,\n  TSchema extends Schema = DefaultSchema,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n>(\n  validatorOrMutator:\n    | StandardSchemaV1<TInput, TOutput>\n    | MutatorDefinitionFunction<\n        TOutput,\n        TContext,\n        Transaction<TSchema, TWrappedTransaction>\n      >,\n  mutator?: MutatorDefinitionFunction<\n    TOutput,\n    TContext,\n    Transaction<TSchema, TWrappedTransaction>\n  >,\n): MutatorDefinition<TInput, TOutput, TContext, TWrappedTransaction> {\n  let validator: StandardSchemaV1<TInput, TOutput> | undefined;\n  let actualMutator: MutatorDefinitionFunction<\n    TOutput,\n    TContext,\n    Transaction<TSchema, TWrappedTransaction>\n  >;\n\n  if (typeof validatorOrMutator === 'function') {\n    // defineMutator(mutator) - no validator\n    validator = undefined;\n    actualMutator = validatorOrMutator;\n  } else {\n    // defineMutator(validator, mutator)\n    validator = validatorOrMutator;\n    actualMutator = must(mutator);\n  }\n\n  const mutatorDefinition: MutatorDefinition<\n    TInput,\n    TOutput,\n    TContext,\n    TWrappedTransaction\n  > = {\n    'fn': actualMutator as MutatorDefinitionFunction<\n      TOutput,\n      TContext,\n      AnyTransaction\n    >,\n    'validator': validator,\n    '~': 'MutatorDefinition' as unknown as MutatorDefinitionTypes<\n      TInput,\n      TOutput,\n      TContext,\n      TWrappedTransaction\n    >,\n  };\n  return mutatorDefinition;\n}\n\n// intentionally not using DefaultSchema, DefaultContext, or DefaultWrappedTransaction\nexport function defineMutatorWithType<\n  TSchema extends Schema,\n  TContext = unknown,\n  TWrappedTransaction = unknown,\n>(): TypedDefineMutator<TSchema, TContext, TWrappedTransaction> {\n  return defineMutator;\n}\n\n/**\n * The return type of defineMutatorWithType. A function matching the\n * defineMutator overloads but with Schema, Context, and WrappedTransaction\n * pre-bound.\n *\n * This is used as a workaround to using DefaultTypes (e.g. when using\n * multiple Zero instances).\n */\ntype TypedDefineMutator<\n  TSchema extends Schema,\n  TContext,\n  TWrappedTransaction,\n> = {\n  // Without validator\n  <TArgs extends ReadonlyJSONValue | undefined>(\n    mutator: MutatorDefinitionFunction<\n      TArgs,\n      TContext,\n      Transaction<TSchema, TWrappedTransaction>\n    >,\n  ): MutatorDefinition<TArgs, TArgs, TContext, TWrappedTransaction>;\n\n  // With validator\n  <\n    TInput extends ReadonlyJSONValue | undefined,\n    TOutput extends ReadonlyJSONValue | undefined,\n  >(\n    validator: StandardSchemaV1<TInput, TOutput>,\n    mutator: MutatorDefinitionFunction<\n      TOutput,\n      TContext,\n      Transaction<TSchema, TWrappedTransaction>\n    >,\n  ): MutatorDefinition<TInput, TOutput, TContext, TWrappedTransaction>;\n};\n\nexport type MutatorDefinitionFunction<\n  TOutput extends ReadonlyJSONValue | undefined,\n  TContext,\n  TTransaction,\n> = (options: {\n  args: TOutput;\n  ctx: TContext;\n  tx: TTransaction;\n}) => Promise<void>;\n\n// ----------------------------------------------------------------------------\n// Mutator and MutateRequest types\n// ----------------------------------------------------------------------------\n\nexport type MutatorTypes<\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TContext,\n  TWrappedTransaction,\n> = 'Mutator' & {\n  readonly $input: TInput;\n  readonly $schema: TSchema;\n  readonly $context: TContext;\n  readonly $wrappedTransaction: TWrappedTransaction;\n};\n\n/**\n * A callable wrapper around a MutatorDefinition, created by `defineMutators()`.\n *\n * Accessed like `mutators.foo.bar`, and called to create a MutateRequest:\n * `mutators.foo.bar(42)` returns a `MutateRequest`.\n *\n * The `fn` property is used for execution and takes raw JSON args (for rebase\n * and server wire format cases) that are validated internally.\n */\nexport type Mutator<\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema = DefaultSchema,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n> = {\n  readonly 'mutatorName': string;\n  /**\n   * Execute the mutation. Args are ReadonlyJSONValue because this is called\n   * during rebase (from stored JSON) and on the server (from wire format).\n   * Validation happens internally before the recipe function runs.\n   */\n  readonly 'fn': MutatorDefinitionFunction<\n    TInput,\n    TContext,\n    Transaction<TSchema, TWrappedTransaction>\n  >;\n  readonly '~': MutatorTypes<TInput, TSchema, TContext, TWrappedTransaction>;\n} & MutatorCallable<TInput, TSchema, TContext, TWrappedTransaction>;\n\n// Helper type for the callable part of Mutator\n// When TInput is undefined, the function is callable with 0 args\n// When TInput includes undefined (optional), args is optional\n// Otherwise, args is required\ntype MutatorCallable<\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TContext,\n  TWrappedTransaction,\n> = [TInput] extends [undefined]\n  ? () => MutateRequest<TInput, TSchema, TContext, TWrappedTransaction>\n  : undefined extends TInput\n    ? {\n        (): MutateRequest<TInput, TSchema, TContext, TWrappedTransaction>;\n        (\n          args?: TInput,\n        ): MutateRequest<TInput, TSchema, TContext, TWrappedTransaction>;\n      }\n    : {\n        (\n          args: TInput,\n        ): MutateRequest<TInput, TSchema, TContext, TWrappedTransaction>;\n      };\n\n// oxlint-disable-next-line no-explicit-any\nexport type AnyMutator = Mutator<any, any, any, any>;\n\n/**\n * Checks if a value is a Mutator (the result of processing a MutatorDefinition\n * through defineMutators).\n */\nexport function isMutator<S extends Schema>(\n  value: unknown,\n  // oxlint-disable-next-line no-explicit-any\n): value is Mutator<any, S, any, any> {\n  return (\n    typeof value === 'function' &&\n    typeof (value as {mutatorName?: unknown}).mutatorName === 'string' &&\n    typeof (value as {fn?: unknown}).fn === 'function'\n  );\n}\n\nexport type MutateRequestTypes<\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TContext,\n  TWrappedTransaction,\n> = 'MutateRequest' & {\n  readonly $input: TInput;\n  readonly $schema: TSchema;\n  readonly $context: TContext;\n  readonly $wrappedTransaction: TWrappedTransaction;\n};\n\n/**\n * The result of calling a Mutator with arguments.\n *\n * Created by `mutators.foo.bar(42)`, executed by `zero.mutate(mr)` on the client\n * or `mr.mutator.fn({tx, ctx, args: mr.args})` on the server.\n */\nexport type MutateRequest<\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema = DefaultSchema,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n> = {\n  readonly 'mutator': Mutator<TInput, TSchema, TContext, TWrappedTransaction>;\n  readonly 'args': TInput;\n  readonly '~': MutateRequestTypes<\n    TInput,\n    TSchema,\n    TContext,\n    TWrappedTransaction\n  >;\n};\n"],"names":[],"mappings":";AA8CO,SAAS,oBAAoB,GAAuC;AACzE,SACE,OAAO,MAAM,YACb,MAAM,QACL,EAAwB,GAAG,MAAM;AAEtC;AAiCO,SAAS,cAOd,oBAOA,SAKmE;AACnE,MAAI;AACJ,MAAI;AAMJ,MAAI,OAAO,uBAAuB,YAAY;AAE5C,gBAAY;AACZ,oBAAgB;AAAA,EAClB,OAAO;AAEL,gBAAY;AACZ,oBAAgB,KAAK,OAAO;AAAA,EAC9B;AAEA,QAAM,oBAKF;AAAA,IACF,MAAM;AAAA,IAKN,aAAa;AAAA,IACb,KAAK;AAAA,EAAA;AAOP,SAAO;AACT;AAGO,SAAS,wBAIgD;AAC9D,SAAO;AACT;AA4HO,SAAS,UACd,OAEoC;AACpC,SACE,OAAO,UAAU,cACjB,OAAQ,MAAkC,gBAAgB,YAC1D,OAAQ,MAAyB,OAAO;AAE5C;"}
+{"version":3,"file":"mutator.js","sources":["../../../../../zql/src/mutate/mutator.ts"],"sourcesContent":["import type {StandardSchemaV1} from '@standard-schema/spec';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {\n  DefaultContext,\n  DefaultSchema,\n  DefaultWrappedTransaction,\n} from '../../../zero-types/src/default-types.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport type {AnyTransaction, Transaction} from './custom.ts';\n\n// ----------------------------------------------------------------------------\n// defineMutator\n// ----------------------------------------------------------------------------\n\nexport type MutatorDefinitionTypes<\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput,\n  TContext,\n  TWrappedTransaction,\n> = 'MutatorDefinition' & {\n  readonly $input: TInput;\n  readonly $output: TOutput;\n  readonly $context: TContext;\n  readonly $wrappedTransaction: TWrappedTransaction;\n};\n\nexport type MutatorDefinition<\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n> = {\n  readonly 'fn': MutatorDefinitionFunction<TOutput, TContext, AnyTransaction>;\n  readonly 'validator': StandardSchemaV1<TInput, TOutput> | undefined;\n  readonly '~': MutatorDefinitionTypes<\n    TInput,\n    TOutput,\n    TContext,\n    TWrappedTransaction\n  >;\n};\n\n// oxlint-disable-next-line no-explicit-any\nexport type AnyMutatorDefinition = MutatorDefinition<any, any, any, any>;\n\nexport function isMutatorDefinition(f: unknown): f is AnyMutatorDefinition {\n  return (\n    typeof f === 'object' &&\n    f !== null &&\n    (f as {['~']?: unknown})['~'] === 'MutatorDefinition'\n  );\n}\n\n// Overload for no validator\nexport function defineMutator<\n  TInput extends ReadonlyJSONValue | undefined = ReadonlyJSONValue | undefined,\n  TSchema extends Schema = DefaultSchema,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n>(\n  mutator: MutatorDefinitionFunction<\n    TInput,\n    TContext,\n    Transaction<TSchema, TWrappedTransaction>\n  >,\n): MutatorDefinition<TInput, TInput, TContext, TWrappedTransaction>;\n\n// Overload for validator\nexport function defineMutator<\n  TInput extends ReadonlyJSONValue | undefined = undefined,\n  TOutput extends ReadonlyJSONValue | undefined = TInput,\n  TSchema extends Schema = DefaultSchema,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n>(\n  validator: StandardSchemaV1<TInput, TOutput>,\n  mutator: MutatorDefinitionFunction<\n    TOutput,\n    TContext,\n    Transaction<TSchema, TWrappedTransaction>\n  >,\n): MutatorDefinition<TInput, TOutput, TContext, TWrappedTransaction>;\n\n// Implementation\nexport function defineMutator<\n  TInput extends ReadonlyJSONValue | undefined = undefined,\n  TOutput extends ReadonlyJSONValue | undefined = TInput,\n  TSchema extends Schema = DefaultSchema,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n>(\n  validatorOrMutator:\n    | StandardSchemaV1<TInput, TOutput>\n    | MutatorDefinitionFunction<\n        TOutput,\n        TContext,\n        Transaction<TSchema, TWrappedTransaction>\n      >,\n  mutator?: MutatorDefinitionFunction<\n    TOutput,\n    TContext,\n    Transaction<TSchema, TWrappedTransaction>\n  >,\n): MutatorDefinition<TInput, TOutput, TContext, TWrappedTransaction> {\n  let validator: StandardSchemaV1<TInput, TOutput> | undefined;\n  let actualMutator: MutatorDefinitionFunction<\n    TOutput,\n    TContext,\n    Transaction<TSchema, TWrappedTransaction>\n  >;\n\n  if ('~standard' in validatorOrMutator) {\n    // defineMutator(validator, mutator)\n    validator = validatorOrMutator;\n    actualMutator = must(mutator);\n  } else {\n    // defineMutator(mutator) - no validator\n    validator = undefined;\n    actualMutator = validatorOrMutator;\n  }\n\n  const mutatorDefinition: MutatorDefinition<\n    TInput,\n    TOutput,\n    TContext,\n    TWrappedTransaction\n  > = {\n    'fn': actualMutator as MutatorDefinitionFunction<\n      TOutput,\n      TContext,\n      AnyTransaction\n    >,\n    'validator': validator,\n    '~': 'MutatorDefinition' as unknown as MutatorDefinitionTypes<\n      TInput,\n      TOutput,\n      TContext,\n      TWrappedTransaction\n    >,\n  };\n  return mutatorDefinition;\n}\n\n// intentionally not using DefaultSchema, DefaultContext, or DefaultWrappedTransaction\nexport function defineMutatorWithType<\n  TSchema extends Schema,\n  TContext = unknown,\n  TWrappedTransaction = unknown,\n>(): TypedDefineMutator<TSchema, TContext, TWrappedTransaction> {\n  return defineMutator;\n}\n\n/**\n * The return type of defineMutatorWithType. A function matching the\n * defineMutator overloads but with Schema, Context, and WrappedTransaction\n * pre-bound.\n *\n * This is used as a workaround to using DefaultTypes (e.g. when using\n * multiple Zero instances).\n */\ntype TypedDefineMutator<\n  TSchema extends Schema,\n  TContext,\n  TWrappedTransaction,\n> = {\n  // Without validator\n  <TArgs extends ReadonlyJSONValue | undefined>(\n    mutator: MutatorDefinitionFunction<\n      TArgs,\n      TContext,\n      Transaction<TSchema, TWrappedTransaction>\n    >,\n  ): MutatorDefinition<TArgs, TArgs, TContext, TWrappedTransaction>;\n\n  // With validator\n  <\n    TInput extends ReadonlyJSONValue | undefined,\n    TOutput extends ReadonlyJSONValue | undefined,\n  >(\n    validator: StandardSchemaV1<TInput, TOutput>,\n    mutator: MutatorDefinitionFunction<\n      TOutput,\n      TContext,\n      Transaction<TSchema, TWrappedTransaction>\n    >,\n  ): MutatorDefinition<TInput, TOutput, TContext, TWrappedTransaction>;\n};\n\nexport type MutatorDefinitionFunction<\n  TOutput extends ReadonlyJSONValue | undefined,\n  TContext,\n  TTransaction,\n> = (options: {\n  args: TOutput;\n  ctx: TContext;\n  tx: TTransaction;\n}) => Promise<void>;\n\n// ----------------------------------------------------------------------------\n// Mutator and MutateRequest types\n// ----------------------------------------------------------------------------\n\nexport type MutatorTypes<\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TContext,\n  TWrappedTransaction,\n> = 'Mutator' & {\n  readonly $input: TInput;\n  readonly $schema: TSchema;\n  readonly $context: TContext;\n  readonly $wrappedTransaction: TWrappedTransaction;\n};\n\n/**\n * A callable wrapper around a MutatorDefinition, created by `defineMutators()`.\n *\n * Accessed like `mutators.foo.bar`, and called to create a MutateRequest:\n * `mutators.foo.bar(42)` returns a `MutateRequest`.\n *\n * The `fn` property is used for execution and takes raw JSON args (for rebase\n * and server wire format cases) that are validated internally.\n */\nexport type Mutator<\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema = DefaultSchema,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n> = {\n  readonly 'mutatorName': string;\n  /**\n   * Execute the mutation. Args are ReadonlyJSONValue because this is called\n   * during rebase (from stored JSON) and on the server (from wire format).\n   * Validation happens internally before the recipe function runs.\n   */\n  readonly 'fn': MutatorDefinitionFunction<\n    TInput,\n    TContext,\n    Transaction<TSchema, TWrappedTransaction>\n  >;\n  readonly '~': MutatorTypes<TInput, TSchema, TContext, TWrappedTransaction>;\n} & MutatorCallable<TInput, TSchema, TContext, TWrappedTransaction>;\n\n// Helper type for the callable part of Mutator\n// When TInput is undefined, the function is callable with 0 args\n// When TInput includes undefined (optional), args is optional\n// Otherwise, args is required\ntype MutatorCallable<\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TContext,\n  TWrappedTransaction,\n> = [TInput] extends [undefined]\n  ? () => MutateRequest<TInput, TSchema, TContext, TWrappedTransaction>\n  : undefined extends TInput\n    ? {\n        (): MutateRequest<TInput, TSchema, TContext, TWrappedTransaction>;\n        (\n          args?: TInput,\n        ): MutateRequest<TInput, TSchema, TContext, TWrappedTransaction>;\n      }\n    : {\n        (\n          args: TInput,\n        ): MutateRequest<TInput, TSchema, TContext, TWrappedTransaction>;\n      };\n\n// oxlint-disable-next-line no-explicit-any\nexport type AnyMutator = Mutator<any, any, any, any>;\n\n/**\n * Checks if a value is a Mutator (the result of processing a MutatorDefinition\n * through defineMutators).\n */\nexport function isMutator<S extends Schema>(\n  value: unknown,\n  // oxlint-disable-next-line no-explicit-any\n): value is Mutator<any, S, any, any> {\n  return (\n    typeof value === 'function' &&\n    typeof (value as {mutatorName?: unknown}).mutatorName === 'string' &&\n    typeof (value as {fn?: unknown}).fn === 'function'\n  );\n}\n\nexport type MutateRequestTypes<\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TContext,\n  TWrappedTransaction,\n> = 'MutateRequest' & {\n  readonly $input: TInput;\n  readonly $schema: TSchema;\n  readonly $context: TContext;\n  readonly $wrappedTransaction: TWrappedTransaction;\n};\n\n/**\n * The result of calling a Mutator with arguments.\n *\n * Created by `mutators.foo.bar(42)`, executed by `zero.mutate(mr)` on the client\n * or `mr.mutator.fn({tx, ctx, args: mr.args})` on the server.\n */\nexport type MutateRequest<\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema = DefaultSchema,\n  TContext = DefaultContext,\n  TWrappedTransaction = DefaultWrappedTransaction,\n> = {\n  readonly 'mutator': Mutator<TInput, TSchema, TContext, TWrappedTransaction>;\n  readonly 'args': TInput;\n  readonly '~': MutateRequestTypes<\n    TInput,\n    TSchema,\n    TContext,\n    TWrappedTransaction\n  >;\n};\n"],"names":[],"mappings":";AA8CO,SAAS,oBAAoB,GAAuC;AACzE,SACE,OAAO,MAAM,YACb,MAAM,QACL,EAAwB,GAAG,MAAM;AAEtC;AAiCO,SAAS,cAOd,oBAOA,SAKmE;AACnE,MAAI;AACJ,MAAI;AAMJ,MAAI,eAAe,oBAAoB;AAErC,gBAAY;AACZ,oBAAgB,KAAK,OAAO;AAAA,EAC9B,OAAO;AAEL,gBAAY;AACZ,oBAAgB;AAAA,EAClB;AAEA,QAAM,oBAKF;AAAA,IACF,MAAM;AAAA,IAKN,aAAa;AAAA,IACb,KAAK;AAAA,EAAA;AAOP,SAAO;AACT;AAGO,SAAS,wBAIgD;AAC9D,SAAO;AACT;AA4HO,SAAS,UACd,OAEoC;AACpC,SACE,OAAO,UAAU,cACjB,OAAQ,MAAkC,gBAAgB,YAC1D,OAAQ,MAAyB,OAAO;AAE5C;"}

package/out/zql/src/query/create-builder.js

@@ -17,12 +17,10 @@ function createRunnableBuilder(delegate, schema) {
   );
 }
 function createBuilderWithQueryFactory(schema, queryFactory) {
+  const target = Object.assign(/* @__PURE__ */ Object.create(null), schema.tables);
   return recordProxy(
-    schema.tables,
-    (_tableSchema, prop) => queryFactory(prop),
-    (prop) => {
-      throw new Error(`Table ${prop} does not exist in schema`);
-    }
+    target,
+    (_tableSchema, prop) => queryFactory(prop)
   );
 }
 export {

package/out/zql/src/query/create-builder.js.map

@@ -1 +1 @@
-{"version":3,"file":"create-builder.js","sources":["../../../../../zql/src/query/create-builder.ts"],"sourcesContent":["import {recordProxy} from '../../../shared/src/record-proxy.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport type {QueryDelegate} from './query-delegate.ts';\nimport {newQuery} from './query-impl.ts';\nimport type {Query} from './query.ts';\nimport {newRunnableQuery} from './runnable-query-impl.ts';\nimport type {ConditionalSchemaQuery, SchemaQuery} from './schema-query.ts';\n\n/**\n * Returns a set of query builders for the given schema.\n */\nexport function createBuilder<S extends Schema>(schema: S): SchemaQuery<S> {\n  return createBuilderWithQueryFactory(schema, table =>\n    newQuery(schema, table),\n  );\n}\n\n/** @deprecated Use {@linkcode createBuilder} with `tx.run(zql.table.where(...))` instead. */\nexport function createRunnableBuilder<S extends Schema>(\n  delegate: QueryDelegate,\n  schema: S,\n): ConditionalSchemaQuery<S> {\n  if (!schema.enableLegacyQueries) {\n    return undefined as ConditionalSchemaQuery<S>;\n  }\n\n  return createBuilderWithQueryFactory(schema, table =>\n    newRunnableQuery(delegate, schema, table),\n  ) as ConditionalSchemaQuery<S>;\n}\n\nfunction createBuilderWithQueryFactory<S extends Schema>(\n  schema: S,\n  queryFactory: (table: keyof S['tables'] & string) => Query<string, S>,\n): SchemaQuery<S> {\n  return recordProxy(\n    schema.tables,\n    (_tableSchema, prop) => queryFactory(prop),\n    prop => {\n      throw new Error(`Table ${prop} does not exist in schema`);\n    },\n  ) as SchemaQuery<S>;\n}\n"],"names":[],"mappings":";;;AAWO,SAAS,cAAgC,QAA2B;AACzE,SAAO;AAAA,IAA8B;AAAA,IAAQ,CAAA,UAC3C,SAAS,QAAQ,KAAK;AAAA,EAAA;AAE1B;AAGO,SAAS,sBACd,UACA,QAC2B;AAC3B,MAAI,CAAC,OAAO,qBAAqB;AAC/B,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IAA8B;AAAA,IAAQ,CAAA,UAC3C,iBAAiB,UAAU,QAAQ,KAAK;AAAA,EAAA;AAE5C;AAEA,SAAS,8BACP,QACA,cACgB;AAChB,SAAO;AAAA,IACL,OAAO;AAAA,IACP,CAAC,cAAc,SAAS,aAAa,IAAI;AAAA,IACzC,CAAA,SAAQ;AACN,YAAM,IAAI,MAAM,SAAS,IAAI,2BAA2B;AAAA,IAC1D;AAAA,EAAA;AAEJ;"}
+{"version":3,"file":"create-builder.js","sources":["../../../../../zql/src/query/create-builder.ts"],"sourcesContent":["import {recordProxy} from '../../../shared/src/record-proxy.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport type {QueryDelegate} from './query-delegate.ts';\nimport {newQuery} from './query-impl.ts';\nimport type {Query} from './query.ts';\nimport {newRunnableQuery} from './runnable-query-impl.ts';\nimport type {ConditionalSchemaQuery, SchemaQuery} from './schema-query.ts';\n\n/**\n * Returns a set of query builders for the given schema.\n */\nexport function createBuilder<S extends Schema>(schema: S): SchemaQuery<S> {\n  return createBuilderWithQueryFactory(schema, table =>\n    newQuery(schema, table),\n  );\n}\n\n/** @deprecated Use {@linkcode createBuilder} with `tx.run(zql.table.where(...))` instead. */\nexport function createRunnableBuilder<S extends Schema>(\n  delegate: QueryDelegate,\n  schema: S,\n): ConditionalSchemaQuery<S> {\n  if (!schema.enableLegacyQueries) {\n    return undefined as ConditionalSchemaQuery<S>;\n  }\n\n  return createBuilderWithQueryFactory(schema, table =>\n    newRunnableQuery(delegate, schema, table),\n  ) as ConditionalSchemaQuery<S>;\n}\n\nfunction createBuilderWithQueryFactory<S extends Schema>(\n  schema: S,\n  queryFactory: (table: keyof S['tables'] & string) => Query<string, S>,\n): SchemaQuery<S> {\n  // Create a target with no prototype so accessing unknown properties returns\n  // undefined instead of inherited Object.prototype methods (e.g., toString).\n  // This fixes React 19 dev mode compatibility where accessing $$typeof should\n  // return undefined rather than throwing.\n  const target = Object.assign(Object.create(null), schema.tables) as Record<\n    string,\n    unknown\n  >;\n\n  // No onMissing handler needed - unknown properties return undefined due to\n  // null prototype, which is the desired behavior for normal JS object semantics.\n  return recordProxy(target, (_tableSchema, prop) =>\n    queryFactory(prop),\n  ) as SchemaQuery<S>;\n}\n"],"names":[],"mappings":";;;AAWO,SAAS,cAAgC,QAA2B;AACzE,SAAO;AAAA,IAA8B;AAAA,IAAQ,CAAA,UAC3C,SAAS,QAAQ,KAAK;AAAA,EAAA;AAE1B;AAGO,SAAS,sBACd,UACA,QAC2B;AAC3B,MAAI,CAAC,OAAO,qBAAqB;AAC/B,WAAO;AAAA,EACT;AAEA,SAAO;AAAA,IAA8B;AAAA,IAAQ,CAAA,UAC3C,iBAAiB,UAAU,QAAQ,KAAK;AAAA,EAAA;AAE5C;AAEA,SAAS,8BACP,QACA,cACgB;AAKhB,QAAM,SAAS,OAAO,OAAO,uBAAO,OAAO,IAAI,GAAG,OAAO,MAAM;AAO/D,SAAO;AAAA,IAAY;AAAA,IAAQ,CAAC,cAAc,SACxC,aAAa,IAAI;AAAA,EAAA;AAErB;"}

package/out/zql/src/query/query-registry.js

@@ -16,12 +16,12 @@ function isQueryDefinition(f) {
 function defineQuery(validatorOrQueryFn, queryFn) {
   let validator;
   let actualQueryFn;
-  if (typeof validatorOrQueryFn === "function") {
-    validator = void 0;
-    actualQueryFn = validatorOrQueryFn;
-  } else {
+  if ("~standard" in validatorOrQueryFn) {
     validator = validatorOrQueryFn;
     actualQueryFn = must(queryFn);
+  } else {
+    validator = void 0;
+    actualQueryFn = validatorOrQueryFn;
   }
   const queryDefinition = {
     "fn": actualQueryFn,

package/out/zql/src/query/query-registry.js.map

@@ -1 +1 @@
-{"version":3,"file":"query-registry.js","sources":["../../../../../zql/src/query/query-registry.ts"],"sourcesContent":["import type {StandardSchemaV1} from '@standard-schema/spec';\nimport {\n  deepMerge,\n  isPlainObject,\n  type DeepMerge,\n} from '../../../shared/src/deep-merge.ts';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport {getValueAtPath} from '../../../shared/src/object-traversal.ts';\nimport type {\n  DefaultContext,\n  DefaultSchema,\n} from '../../../zero-types/src/default-types.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport {asQueryInternals} from './query-internals.ts';\nimport type {PullRow, Query} from './query.ts';\nimport {validateInput} from './validate-input.ts';\n\n// ----------------------------------------------------------------------------\n// CustomQuery and QueryRequest types\n// ----------------------------------------------------------------------------\n\nexport type CustomQueryTypes<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n> = 'Query' & {\n  readonly $tableName: TTable;\n  readonly $input: TInput;\n  readonly $schema: TSchema;\n  readonly $return: TReturn;\n  readonly $context: TContext;\n};\n\n/**\n * CustomQuery is returned from defineQueries. It is a callable that captures\n * args and can be turned into a Query via {@link QueryRequest}.\n */\nexport type CustomQuery<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined = TInput,\n  TSchema extends Schema = DefaultSchema,\n  TReturn = PullRow<TTable, TSchema>,\n  TContext = DefaultContext,\n> = {\n  readonly 'queryName': string;\n  readonly 'fn': QueryDefinitionFunction<TTable, TInput, TReturn, TContext>;\n  readonly '~': CustomQueryTypes<TTable, TInput, TSchema, TReturn, TContext>;\n} & CustomQueryCallable<TTable, TInput, TOutput, TSchema, TReturn, TContext>;\n\ntype CustomQueryCallable<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n> = [TInput] extends [undefined]\n  ? () => QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext>\n  : undefined extends TInput\n    ? {\n        (): QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext>;\n        (\n          args?: TInput,\n        ): QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext>;\n      }\n    : {\n        (\n          args: TInput,\n        ): QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext>;\n      };\n\n// oxlint-disable-next-line no-explicit-any\nexport type AnyCustomQuery = CustomQuery<string, any, any, Schema, any, any>;\n\nexport function isQuery<S extends Schema>(\n  value: unknown,\n  // oxlint-disable-next-line no-explicit-any\n): value is CustomQuery<string, any, any, S, any, any> {\n  return (\n    typeof value === 'function' &&\n    typeof (value as {queryName?: unknown}).queryName === 'string' &&\n    typeof (value as {fn?: unknown}).fn === 'function'\n  );\n}\n\nexport type QueryRequestTypes<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n> = 'QueryRequest' & {\n  readonly $tableName: TTable;\n  readonly $input: TInput;\n  readonly $output: TOutput;\n  readonly $schema: TSchema;\n  readonly $return: TReturn;\n  readonly $context: TContext;\n};\n\nexport type QueryRequest<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n> = {\n  readonly 'query': CustomQuery<\n    TTable,\n    TInput,\n    TOutput,\n    TSchema,\n    TReturn,\n    TContext\n  >;\n  readonly 'args': TInput;\n  readonly '~': QueryRequestTypes<\n    TTable,\n    TInput,\n    TOutput,\n    TSchema,\n    TReturn,\n    TContext\n  >;\n};\n\n/**\n * A shared type that can be a query request or a query builder.\n *\n * If it is a query request, it will be converted to a {@link Query} using the context.\n * Otherwise, it will be returned as is.\n */\nexport type QueryOrQueryRequest<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n> =\n  | QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext>\n  | Query<TTable, TSchema, TReturn>;\n\n/**\n * Converts a query request to a {@link Query} using the context,\n * or returns the query as is.\n *\n * @param query - The query request or query builder to convert\n * @param context - The context to use to convert the query request\n */\nexport const addContextToQuery = <\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n>(\n  query: QueryOrQueryRequest<\n    TTable,\n    TInput,\n    TOutput,\n    TSchema,\n    TReturn,\n    TContext\n  >,\n  context: TContext,\n): Query<TTable, TSchema, TReturn> =>\n  'query' in query ? query.query.fn({ctx: context, args: query.args}) : query;\n\n// ----------------------------------------------------------------------------\n// QueryRegistry types\n// ----------------------------------------------------------------------------\n\nexport function isQueryRegistry(obj: unknown): obj is AnyQueryRegistry {\n  return (\n    typeof obj === 'object' &&\n    obj !== null &&\n    (obj as unknown as {['~']: string})?.['~'] === 'QueryRegistry'\n  );\n}\n\nexport type QueryRegistryTypes<TSchema extends Schema> = 'QueryRegistry' & {\n  readonly $schema: TSchema;\n};\n\nexport type QueryRegistry<\n  QD extends QueryDefinitions,\n  S extends Schema,\n> = ToQueryTree<QD, S> & {\n  ['~']: QueryRegistryTypes<S>;\n};\n\nexport type AnyQueryRegistry = {\n  ['~']: QueryRegistryTypes<Schema>;\n  [key: string]: unknown;\n};\n\ntype ToQueryTree<QD extends QueryDefinitions, S extends Schema> = {\n  readonly [K in keyof QD]: QD[K] extends AnyQueryDefinition\n    ? // pull types from the phantom property\n      CustomQuery<\n        QD[K]['~']['$tableName'],\n        QD[K]['~']['$input'],\n        QD[K]['~']['$output'],\n        S,\n        QD[K]['~']['$return'],\n        QD[K]['~']['$context']\n      >\n    : QD[K] extends QueryDefinitions\n      ? ToQueryTree<QD[K], S>\n      : never;\n};\n\nexport type FromQueryTree<QD extends QueryDefinitions, S extends Schema> = {\n  readonly [K in keyof QD]: QD[K] extends AnyQueryDefinition\n    ? CustomQuery<\n        QD[K]['~']['$tableName'],\n        // intentionally left as generic to avoid variance issues\n        ReadonlyJSONValue | undefined,\n        ReadonlyJSONValue | undefined,\n        S,\n        QD[K]['~']['$return'],\n        QD[K]['~']['$context']\n      >\n    : QD[K] extends QueryDefinitions\n      ? FromQueryTree<QD[K], S>\n      : never;\n}[keyof QD];\n\nexport type QueryDefinitions = {\n  readonly [key: string]: AnyQueryDefinition | QueryDefinitions;\n};\n\n// ----------------------------------------------------------------------------\n// defineQuery\n// ----------------------------------------------------------------------------\n\nexport type QueryDefinitionTypes<\n  TTable extends string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput,\n  TReturn,\n  TContext,\n> = 'QueryDefinition' & {\n  readonly $tableName: TTable;\n  readonly $input: TInput;\n  readonly $output: TOutput;\n  readonly $return: TReturn;\n  readonly $context: TContext;\n};\n\n/**\n * A query definition is the return type of `defineQuery()`.\n */\nexport type QueryDefinition<\n  TTable extends string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TReturn,\n  TContext = DefaultContext,\n> = {\n  readonly 'fn': QueryDefinitionFunction<TTable, TOutput, TReturn, TContext>;\n  readonly 'validator': StandardSchemaV1<TInput, TOutput> | undefined;\n  readonly '~': QueryDefinitionTypes<\n    TTable,\n    TInput,\n    TOutput,\n    TReturn,\n    TContext\n  >;\n};\n\n// oxlint-disable-next-line no-explicit-any\nexport type AnyQueryDefinition = QueryDefinition<any, any, any, any, any>;\n\nexport function isQueryDefinition(f: unknown): f is AnyQueryDefinition {\n  return (\n    typeof f === 'object' &&\n    f !== null &&\n    (f as {['~']?: unknown})['~'] === 'QueryDefinition'\n  );\n}\n\nexport type QueryDefinitionFunction<\n  TTable extends string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TReturn,\n  TContext,\n> = (options: {args: TInput; ctx: TContext}) => Query<TTable, Schema, TReturn>;\n\n/**\n * Defines a query to be used with {@link defineQueries}.\n *\n * The query function receives an object with `args` (the query arguments) and\n * `ctx` (the context). It should return a {@link Query} built using a builder\n * created from {@link createBuilder}.\n *\n * Note: A query defined with `defineQuery` must be passed to\n * {@link defineQueries} to be usable. The query name is derived from its\n * position in the `defineQueries` object.\n *\n * @example\n * ```ts\n * const builder = createBuilder(schema);\n *\n * const queries = defineQueries({\n *   // Simple query with no arguments\n *   allIssues: defineQuery(() => builder.issue.orderBy('created', 'desc')),\n *\n *   // Query with typed arguments\n *   issueById: defineQuery(({args}: {args: {id: string}}) =>\n *     builder.issue.where('id', args.id).one(),\n *   ),\n *\n *   // Query with validation using a Standard Schema validator (e.g., Zod)\n *   issuesByStatus: defineQuery(\n *     z.object({status: z.enum(['open', 'closed'])}),\n *     ({args}) => builder.issue.where('status', args.status),\n *   ),\n *\n *   // Query using context\n *   myIssues: defineQuery(({ctx}: {ctx: {userID: string}}) =>\n *     builder.issue.where('creatorID', ctx.userID),\n *   ),\n * });\n * ```\n *\n * @param queryFn - A function that receives `{args, ctx}` and returns a Query.\n * @returns A {@link QueryDefinition} that can be passed to {@link defineQueries}.\n *\n * @overload\n * @param validator - A Standard Schema validator for the arguments.\n * @param queryFn - A function that receives `{args, ctx}` and returns a Query.\n * @returns A {@link QueryDefinition} with validated arguments.\n */\n// Overload for no validator parameter with default inference for untyped functions\nexport function defineQuery<\n  TInput extends ReadonlyJSONValue | undefined,\n  TContext = DefaultContext,\n  TSchema extends Schema = DefaultSchema,\n  TTable extends keyof TSchema['tables'] & string = keyof TSchema['tables'] &\n    string,\n  TReturn = PullRow<TTable, TSchema>,\n>(\n  queryFn: QueryDefinitionFunction<TTable, TInput, TReturn, TContext>,\n): QueryDefinition<TTable, TInput, TInput, TReturn, TContext>;\n\n// Overload for validator parameter - Input and Output can be different\nexport function defineQuery<\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TContext = DefaultContext,\n  TSchema extends Schema = DefaultSchema,\n  TTable extends keyof TSchema['tables'] & string = keyof TSchema['tables'] &\n    string,\n  TReturn = PullRow<TTable, TSchema>,\n>(\n  validator: StandardSchemaV1<TInput, TOutput>,\n  queryFn: QueryDefinitionFunction<TTable, TOutput, TReturn, TContext>,\n): QueryDefinition<TTable, TInput, TOutput, TReturn, TContext>;\n\n// Implementation\nexport function defineQuery<\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TContext = DefaultContext,\n  TSchema extends Schema = DefaultSchema,\n  TTable extends keyof TSchema['tables'] & string = keyof TSchema['tables'] &\n    string,\n  TReturn = PullRow<TTable, TSchema>,\n>(\n  validatorOrQueryFn:\n    | StandardSchemaV1<TInput, TOutput>\n    | QueryDefinitionFunction<TTable, TOutput, TReturn, TContext>,\n  queryFn?: QueryDefinitionFunction<TTable, TOutput, TReturn, TContext>,\n): QueryDefinition<TTable, TInput, TOutput, TReturn, TContext> {\n  // Handle different parameter patterns\n  let validator: StandardSchemaV1<TInput, TOutput> | undefined;\n  let actualQueryFn: QueryDefinitionFunction<\n    TTable,\n    TOutput,\n    TReturn,\n    TContext\n  >;\n\n  if (typeof validatorOrQueryFn === 'function') {\n    // defineQuery(queryFn) - no validator\n    validator = undefined;\n    actualQueryFn = validatorOrQueryFn;\n  } else {\n    // defineQuery(validator, queryFn) - with validator\n    validator = validatorOrQueryFn;\n    actualQueryFn = must(queryFn);\n  }\n\n  const queryDefinition: QueryDefinition<\n    TTable,\n    TInput,\n    TOutput,\n    TReturn,\n    TContext\n  > = {\n    'fn': actualQueryFn,\n    'validator': validator,\n    '~': 'QueryDefinition' as unknown as QueryDefinitionTypes<\n      TTable,\n      TInput,\n      TOutput,\n      TReturn,\n      TContext\n    >,\n  };\n  return queryDefinition;\n}\n\n/**\n * Returns a typed version of {@link defineQuery} with the schema and context\n * types pre-specified. This enables better type inference when defining\n * queries.\n *\n * @example\n * ```ts\n * const zql = createBuilder(schema);\n *\n * // With both Schema and Context types\n * const defineAppQuery = defineQueryWithType<AppSchema, AppContext>();\n * const myQuery = defineAppQuery(({ctx}) =>\n *   zql.issue.where('userID', ctx.userID),\n * );\n *\n * // With just Context type (Schema inferred)\n * const defineAppQuery = defineQueryWithType<AppContext>();\n * ```\n *\n * @typeParam S - The Zero schema type.\n * @typeParam C - The context type passed to query functions.\n * @returns A function equivalent to {@link defineQuery} but with types\n *   pre-bound.\n */\nexport function defineQueryWithType<\n  S extends Schema,\n  C = unknown,\n>(): TypedDefineQuery<S, C>;\n\n/**\n * Returns a typed version of {@link defineQuery} with the context type\n * pre-specified.\n *\n * @typeParam C - The context type passed to query functions.\n * @returns A function equivalent to {@link defineQuery} but with the context\n *   type pre-bound.\n */\nexport function defineQueryWithType<C>(): TypedDefineQuery<Schema, C>;\n\nexport function defineQueryWithType() {\n  return defineQuery;\n}\n\n/**\n * The return type of defineQueryWithType. A function matching the\n * defineQuery overloads but with Schema and Context pre-bound.\n */\ntype TypedDefineQuery<TSchema extends Schema, TContext> = {\n  // Without validator\n  <\n    TArgs extends ReadonlyJSONValue | undefined,\n    TReturn,\n    TTable extends keyof TSchema['tables'] & string = keyof TSchema['tables'] &\n      string,\n  >(\n    queryFn: QueryDefinitionFunction<TTable, TArgs, TReturn, TContext>,\n  ): QueryDefinition<TTable, TArgs, TArgs, TReturn, TContext>;\n\n  // With validator\n  <\n    TInput extends ReadonlyJSONValue | undefined,\n    TOutput extends ReadonlyJSONValue | undefined,\n    TReturn,\n    TTable extends keyof TSchema['tables'] & string = keyof TSchema['tables'] &\n      string,\n  >(\n    validator: StandardSchemaV1<TInput, TOutput>,\n    queryFn: QueryDefinitionFunction<TTable, TOutput, TReturn, TContext>,\n  ): QueryDefinition<TTable, TInput, TOutput, TReturn, TContext>;\n};\n\n// ----------------------------------------------------------------------------\n// createQuery\n// ----------------------------------------------------------------------------\n\nexport function createQuery<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n>(\n  name: string,\n  definition: QueryDefinition<TTable, TInput, TOutput, TReturn, TContext>,\n): CustomQuery<TTable, TInput, TOutput, TSchema, TReturn, TContext> {\n  const {validator} = definition;\n\n  const fn: QueryDefinitionFunction<\n    TTable,\n    TInput,\n    TReturn,\n    TContext\n  > = options => {\n    const validatedArgs = validator\n      ? validateInput(name, options.args, validator, 'query')\n      : (options.args as unknown as TOutput);\n\n    return asQueryInternals(\n      definition.fn({\n        args: validatedArgs,\n        ctx: options.ctx,\n      }),\n    ).nameAndArgs(\n      name,\n      // TODO(arv): Get rid of the array?\n      // Send original input args to server (not transformed output)\n      options.args === undefined ? [] : [options.args],\n    );\n  };\n\n  const query = (\n    args: TInput,\n  ): QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext> => ({\n    args,\n    '~': 'QueryRequest' as QueryRequestTypes<\n      TTable,\n      TInput,\n      TOutput,\n      TSchema,\n      TReturn,\n      TContext\n    >,\n    'query': query as unknown as CustomQuery<\n      TTable,\n      TInput,\n      TOutput,\n      TSchema,\n      TReturn,\n      TContext\n    >,\n  });\n\n  query.queryName = name;\n  query.fn = fn;\n  query['~'] = 'Query' as CustomQueryTypes<\n    TTable,\n    TInput,\n    TSchema,\n    TReturn,\n    TContext\n  >;\n\n  return query as unknown as CustomQuery<\n    TTable,\n    TInput,\n    TOutput,\n    TSchema,\n    TReturn,\n    TContext\n  >;\n}\n\n// ----------------------------------------------------------------------------\n// defineQueries\n// ----------------------------------------------------------------------------\n\n/**\n * Converts query definitions created with {@link defineQuery} into callable\n * {@link Query} objects that can be invoked with arguments and a context.\n *\n * Query definitions can be nested for organization. The resulting query names\n * are dot-separated paths (e.g., `users.byId`).\n *\n * @example\n * ```ts\n * const builder = createBuilder(schema);\n *\n * const queries = defineQueries({\n *   issues: defineQuery(() => builder.issue.orderBy('created', 'desc')),\n *   users: {\n *     byId: defineQuery(({args}: {args: {id: string}}) =>\n *       builder.user.where('id', args.id),\n *     ),\n *   },\n * });\n *\n * // Usage:\n * const request = queries.issues.byId({id: '123'});\n * const [data] = zero.useQuery(request);\n * ```\n *\n * @param defs - An object containing query definitions or nested objects of\n *   query definitions.\n * @returns An object with the same structure where each query definition is\n *   converted to a {@link CustomQuery}.\n */\nexport function defineQueries<\n  // let QD infer freely so defaults aren't erased by a QueryDefinitions<any, any> constraint\n  const QD,\n  S extends Schema = DefaultSchema,\n>(\n  defs: QD & AssertQueryDefinitions<QD>,\n): QueryRegistry<EnsureQueryDefinitions<QD>, S>;\n\nexport function defineQueries<\n  const TBase,\n  const TOverrides,\n  S extends Schema = DefaultSchema,\n>(\n  base:\n    | QueryRegistry<EnsureQueryDefinitions<TBase>, S>\n    | (TBase & AssertQueryDefinitions<TBase>),\n  overrides: TOverrides & AssertQueryDefinitions<TOverrides>,\n): QueryRegistry<\n  DeepMerge<\n    EnsureQueryDefinitions<TBase>,\n    EnsureQueryDefinitions<TOverrides>,\n    AnyQueryDefinition\n  >,\n  S\n>;\n\nexport function defineQueries<QD extends QueryDefinitions, S extends Schema>(\n  defsOrBase: QD | QueryRegistry<QD, S>,\n  overrides?: QueryDefinitions,\n): QueryRegistry<QD, S> {\n  function processDefinitions(\n    definitions: QueryDefinitions,\n    path: string[],\n  ): Record<string | symbol, unknown> {\n    const result: Record<string | symbol, unknown> = {\n      ['~']: 'QueryRegistry',\n    };\n\n    for (const [key, value] of Object.entries(definitions)) {\n      path.push(key);\n      const defaultName = path.join('.');\n\n      if (isQueryDefinition(value)) {\n        result[key] = createQuery(defaultName, value);\n      } else {\n        // Nested definitions\n        result[key] = processDefinitions(value, path);\n      }\n      path.pop();\n    }\n\n    return result;\n  }\n\n  if (overrides !== undefined) {\n    // Merge base and overrides\n\n    let base: Record<string | symbol, unknown>;\n    if (!isQueryRegistry(defsOrBase)) {\n      base = processDefinitions(defsOrBase, []);\n    } else {\n      base = defsOrBase;\n    }\n\n    const processed = processDefinitions(overrides, []);\n\n    const merged = deepMerge(base, processed, isQueryLeaf);\n    merged['~'] = 'QueryRegistry';\n    return merged as QueryRegistry<QD, S>;\n  }\n\n  return processDefinitions(defsOrBase as QD, []) as QueryRegistry<QD, S>;\n}\n\nconst isQueryLeaf = (value: unknown): boolean =>\n  !isPlainObject(value) || isQuery(value);\n\nexport type AssertQueryDefinitions<QD> = QD extends QueryDefinitions\n  ? unknown\n  : never;\n\nexport type EnsureQueryDefinitions<QD> = QD extends QueryDefinitions\n  ? QD\n  : QD extends QueryRegistry<infer InnerQD, infer _S>\n    ? InnerQD\n    : never;\n\n/**\n * Creates a function that can be used to define queries with a specific schema.\n */\nexport function defineQueriesWithType<\n  TSchema extends Schema,\n>(): TypedDefineQueries<TSchema> {\n  return defineQueries;\n}\n\n/**\n * The return type of defineQueriesWithType. A function matching the\n * defineQueries overloads but with Schema pre-bound.\n */\ntype TypedDefineQueries<S extends Schema> = {\n  // Single definitions\n  <QD>(\n    definitions: QD & AssertQueryDefinitions<QD>,\n  ): QueryRegistry<EnsureQueryDefinitions<QD>, S>;\n\n  // Base and overrides\n  <TBase, TOverrides>(\n    base:\n      | QueryRegistry<EnsureQueryDefinitions<TBase>, S>\n      | (TBase & AssertQueryDefinitions<TBase>),\n    overrides: TOverrides & AssertQueryDefinitions<TOverrides>,\n  ): QueryRegistry<\n    DeepMerge<\n      EnsureQueryDefinitions<TBase>,\n      EnsureQueryDefinitions<TOverrides>,\n      AnyQueryDefinition\n    >,\n    S\n  >;\n};\n\n// ----------------------------------------------------------------------------\n// getQuery / mustGetQuery\n// ----------------------------------------------------------------------------\n\nexport function getQuery<QD extends QueryDefinitions, S extends Schema>(\n  queries: QueryRegistry<QD, S>,\n  name: string,\n): FromQueryTree<QD, S> | undefined {\n  const q = getValueAtPath(queries, name, /[.|]/);\n  return q as FromQueryTree<QD, S> | undefined;\n}\n\nexport function mustGetQuery<QD extends QueryDefinitions, S extends Schema>(\n  queries: QueryRegistry<QD, S>,\n  name: string,\n): FromQueryTree<QD, S> {\n  const query = getQuery(queries, name);\n  if (query === undefined) {\n    throw new Error(`Query not found: ${name}`);\n  }\n  return query;\n}\n"],"names":[],"mappings":";;;;;AA8EO,SAAS,QACd,OAEqD;AACrD,SACE,OAAO,UAAU,cACjB,OAAQ,MAAgC,cAAc,YACtD,OAAQ,MAAyB,OAAO;AAE5C;AAqEO,MAAM,oBAAoB,CAQ/B,OAQA,YAEA,WAAW,QAAQ,MAAM,MAAM,GAAG,EAAC,KAAK,SAAS,MAAM,MAAM,KAAA,CAAK,IAAI;AAMjE,SAAS,gBAAgB,KAAuC;AACrE,SACE,OAAO,QAAQ,YACf,QAAQ,QACP,MAAqC,GAAG,MAAM;AAEnD;AAgGO,SAAS,kBAAkB,GAAqC;AACrE,SACE,OAAO,MAAM,YACb,MAAM,QACL,EAAwB,GAAG,MAAM;AAEtC;AAiFO,SAAS,YASd,oBAGA,SAC6D;AAE7D,MAAI;AACJ,MAAI;AAOJ,MAAI,OAAO,uBAAuB,YAAY;AAE5C,gBAAY;AACZ,oBAAgB;AAAA,EAClB,OAAO;AAEL,gBAAY;AACZ,oBAAgB,KAAK,OAAO;AAAA,EAC9B;AAEA,QAAM,kBAMF;AAAA,IACF,MAAM;AAAA,IACN,aAAa;AAAA,IACb,KAAK;AAAA,EAAA;AAQP,SAAO;AACT;AAyCO,SAAS,sBAAsB;AACpC,SAAO;AACT;AAkCO,SAAS,YAQd,MACA,YACkE;AAClE,QAAM,EAAC,cAAa;AAEpB,QAAM,KAKF,CAAA,YAAW;AACb,UAAM,gBAAgB,YAClB,cAAc,MAAM,QAAQ,MAAM,WAAW,OAAO,IACnD,QAAQ;AAEb,WAAO;AAAA,MACL,WAAW,GAAG;AAAA,QACZ,MAAM;AAAA,QACN,KAAK,QAAQ;AAAA,MAAA,CACd;AAAA,IAAA,EACD;AAAA,MACA;AAAA;AAAA;AAAA,MAGA,QAAQ,SAAS,SAAY,CAAA,IAAK,CAAC,QAAQ,IAAI;AAAA,IAAA;AAAA,EAEnD;AAEA,QAAM,QAAQ,CACZ,UACuE;AAAA,IACvE;AAAA,IACA,KAAK;AAAA,IAQL,SAAS;AAAA,EAAA;AAUX,QAAM,YAAY;AAClB,QAAM,KAAK;AACX,QAAM,GAAG,IAAI;AAQb,SAAO;AAQT;AA8DO,SAAS,cACd,YACA,WACsB;AACtB,WAAS,mBACP,aACA,MACkC;AAClC,UAAM,SAA2C;AAAA,MAC/C,CAAC,GAAG,GAAG;AAAA,IAAA;AAGT,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,WAAW,GAAG;AACtD,WAAK,KAAK,GAAG;AACb,YAAM,cAAc,KAAK,KAAK,GAAG;AAEjC,UAAI,kBAAkB,KAAK,GAAG;AAC5B,eAAO,GAAG,IAAI,YAAY,aAAa,KAAK;AAAA,MAC9C,OAAO;AAEL,eAAO,GAAG,IAAI,mBAAmB,OAAO,IAAI;AAAA,MAC9C;AACA,WAAK,IAAA;AAAA,IACP;AAEA,WAAO;AAAA,EACT;AAEA,MAAI,cAAc,QAAW;AAG3B,QAAI;AACJ,QAAI,CAAC,gBAAgB,UAAU,GAAG;AAChC,aAAO,mBAAmB,YAAY,EAAE;AAAA,IAC1C,OAAO;AACL,aAAO;AAAA,IACT;AAEA,UAAM,YAAY,mBAAmB,WAAW,EAAE;AAElD,UAAM,SAAS,UAAU,MAAM,WAAW,WAAW;AACrD,WAAO,GAAG,IAAI;AACd,WAAO;AAAA,EACT;AAEA,SAAO,mBAAmB,YAAkB,EAAE;AAChD;AAEA,MAAM,cAAc,CAAC,UACnB,CAAC,cAAc,KAAK,KAAK,QAAQ,KAAK;AAejC,SAAS,wBAEiB;AAC/B,SAAO;AACT;AAgCO,SAAS,SACd,SACA,MACkC;AAClC,QAAM,IAAI,eAAe,SAAS,MAAM,MAAM;AAC9C,SAAO;AACT;AAEO,SAAS,aACd,SACA,MACsB;AACtB,QAAM,QAAQ,SAAS,SAAS,IAAI;AACpC,MAAI,UAAU,QAAW;AACvB,UAAM,IAAI,MAAM,oBAAoB,IAAI,EAAE;AAAA,EAC5C;AACA,SAAO;AACT;"}
+{"version":3,"file":"query-registry.js","sources":["../../../../../zql/src/query/query-registry.ts"],"sourcesContent":["import type {StandardSchemaV1} from '@standard-schema/spec';\nimport {\n  deepMerge,\n  isPlainObject,\n  type DeepMerge,\n} from '../../../shared/src/deep-merge.ts';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport {getValueAtPath} from '../../../shared/src/object-traversal.ts';\nimport type {\n  DefaultContext,\n  DefaultSchema,\n} from '../../../zero-types/src/default-types.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport {asQueryInternals} from './query-internals.ts';\nimport type {PullRow, Query} from './query.ts';\nimport {validateInput} from './validate-input.ts';\n\n// ----------------------------------------------------------------------------\n// CustomQuery and QueryRequest types\n// ----------------------------------------------------------------------------\n\nexport type CustomQueryTypes<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n> = 'Query' & {\n  readonly $tableName: TTable;\n  readonly $input: TInput;\n  readonly $schema: TSchema;\n  readonly $return: TReturn;\n  readonly $context: TContext;\n};\n\n/**\n * CustomQuery is returned from defineQueries. It is a callable that captures\n * args and can be turned into a Query via {@link QueryRequest}.\n */\nexport type CustomQuery<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined = TInput,\n  TSchema extends Schema = DefaultSchema,\n  TReturn = PullRow<TTable, TSchema>,\n  TContext = DefaultContext,\n> = {\n  readonly 'queryName': string;\n  readonly 'fn': QueryDefinitionFunction<TTable, TInput, TReturn, TContext>;\n  readonly '~': CustomQueryTypes<TTable, TInput, TSchema, TReturn, TContext>;\n} & CustomQueryCallable<TTable, TInput, TOutput, TSchema, TReturn, TContext>;\n\ntype CustomQueryCallable<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n> = [TInput] extends [undefined]\n  ? () => QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext>\n  : undefined extends TInput\n    ? {\n        (): QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext>;\n        (\n          args?: TInput,\n        ): QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext>;\n      }\n    : {\n        (\n          args: TInput,\n        ): QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext>;\n      };\n\n// oxlint-disable-next-line no-explicit-any\nexport type AnyCustomQuery = CustomQuery<string, any, any, Schema, any, any>;\n\nexport function isQuery<S extends Schema>(\n  value: unknown,\n  // oxlint-disable-next-line no-explicit-any\n): value is CustomQuery<string, any, any, S, any, any> {\n  return (\n    typeof value === 'function' &&\n    typeof (value as {queryName?: unknown}).queryName === 'string' &&\n    typeof (value as {fn?: unknown}).fn === 'function'\n  );\n}\n\nexport type QueryRequestTypes<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n> = 'QueryRequest' & {\n  readonly $tableName: TTable;\n  readonly $input: TInput;\n  readonly $output: TOutput;\n  readonly $schema: TSchema;\n  readonly $return: TReturn;\n  readonly $context: TContext;\n};\n\nexport type QueryRequest<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n> = {\n  readonly 'query': CustomQuery<\n    TTable,\n    TInput,\n    TOutput,\n    TSchema,\n    TReturn,\n    TContext\n  >;\n  readonly 'args': TInput;\n  readonly '~': QueryRequestTypes<\n    TTable,\n    TInput,\n    TOutput,\n    TSchema,\n    TReturn,\n    TContext\n  >;\n};\n\n/**\n * A shared type that can be a query request or a query builder.\n *\n * If it is a query request, it will be converted to a {@link Query} using the context.\n * Otherwise, it will be returned as is.\n */\nexport type QueryOrQueryRequest<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n> =\n  | QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext>\n  | Query<TTable, TSchema, TReturn>;\n\n/**\n * Converts a query request to a {@link Query} using the context,\n * or returns the query as is.\n *\n * @param query - The query request or query builder to convert\n * @param context - The context to use to convert the query request\n */\nexport const addContextToQuery = <\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n>(\n  query: QueryOrQueryRequest<\n    TTable,\n    TInput,\n    TOutput,\n    TSchema,\n    TReturn,\n    TContext\n  >,\n  context: TContext,\n): Query<TTable, TSchema, TReturn> =>\n  'query' in query ? query.query.fn({ctx: context, args: query.args}) : query;\n\n// ----------------------------------------------------------------------------\n// QueryRegistry types\n// ----------------------------------------------------------------------------\n\nexport function isQueryRegistry(obj: unknown): obj is AnyQueryRegistry {\n  return (\n    typeof obj === 'object' &&\n    obj !== null &&\n    (obj as unknown as {['~']: string})?.['~'] === 'QueryRegistry'\n  );\n}\n\nexport type QueryRegistryTypes<TSchema extends Schema> = 'QueryRegistry' & {\n  readonly $schema: TSchema;\n};\n\nexport type QueryRegistry<\n  QD extends QueryDefinitions,\n  S extends Schema,\n> = ToQueryTree<QD, S> & {\n  ['~']: QueryRegistryTypes<S>;\n};\n\nexport type AnyQueryRegistry = {\n  ['~']: QueryRegistryTypes<Schema>;\n  [key: string]: unknown;\n};\n\ntype ToQueryTree<QD extends QueryDefinitions, S extends Schema> = {\n  readonly [K in keyof QD]: QD[K] extends AnyQueryDefinition\n    ? // pull types from the phantom property\n      CustomQuery<\n        QD[K]['~']['$tableName'],\n        QD[K]['~']['$input'],\n        QD[K]['~']['$output'],\n        S,\n        QD[K]['~']['$return'],\n        QD[K]['~']['$context']\n      >\n    : QD[K] extends QueryDefinitions\n      ? ToQueryTree<QD[K], S>\n      : never;\n};\n\nexport type FromQueryTree<QD extends QueryDefinitions, S extends Schema> = {\n  readonly [K in keyof QD]: QD[K] extends AnyQueryDefinition\n    ? CustomQuery<\n        QD[K]['~']['$tableName'],\n        // intentionally left as generic to avoid variance issues\n        ReadonlyJSONValue | undefined,\n        ReadonlyJSONValue | undefined,\n        S,\n        QD[K]['~']['$return'],\n        QD[K]['~']['$context']\n      >\n    : QD[K] extends QueryDefinitions\n      ? FromQueryTree<QD[K], S>\n      : never;\n}[keyof QD];\n\nexport type QueryDefinitions = {\n  readonly [key: string]: AnyQueryDefinition | QueryDefinitions;\n};\n\n// ----------------------------------------------------------------------------\n// defineQuery\n// ----------------------------------------------------------------------------\n\nexport type QueryDefinitionTypes<\n  TTable extends string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput,\n  TReturn,\n  TContext,\n> = 'QueryDefinition' & {\n  readonly $tableName: TTable;\n  readonly $input: TInput;\n  readonly $output: TOutput;\n  readonly $return: TReturn;\n  readonly $context: TContext;\n};\n\n/**\n * A query definition is the return type of `defineQuery()`.\n */\nexport type QueryDefinition<\n  TTable extends string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TReturn,\n  TContext = DefaultContext,\n> = {\n  readonly 'fn': QueryDefinitionFunction<TTable, TOutput, TReturn, TContext>;\n  readonly 'validator': StandardSchemaV1<TInput, TOutput> | undefined;\n  readonly '~': QueryDefinitionTypes<\n    TTable,\n    TInput,\n    TOutput,\n    TReturn,\n    TContext\n  >;\n};\n\n// oxlint-disable-next-line no-explicit-any\nexport type AnyQueryDefinition = QueryDefinition<any, any, any, any, any>;\n\nexport function isQueryDefinition(f: unknown): f is AnyQueryDefinition {\n  return (\n    typeof f === 'object' &&\n    f !== null &&\n    (f as {['~']?: unknown})['~'] === 'QueryDefinition'\n  );\n}\n\nexport type QueryDefinitionFunction<\n  TTable extends string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TReturn,\n  TContext,\n> = (options: {args: TInput; ctx: TContext}) => Query<TTable, Schema, TReturn>;\n\n/**\n * Defines a query to be used with {@link defineQueries}.\n *\n * The query function receives an object with `args` (the query arguments) and\n * `ctx` (the context). It should return a {@link Query} built using a builder\n * created from {@link createBuilder}.\n *\n * Note: A query defined with `defineQuery` must be passed to\n * {@link defineQueries} to be usable. The query name is derived from its\n * position in the `defineQueries` object.\n *\n * @example\n * ```ts\n * const builder = createBuilder(schema);\n *\n * const queries = defineQueries({\n *   // Simple query with no arguments\n *   allIssues: defineQuery(() => builder.issue.orderBy('created', 'desc')),\n *\n *   // Query with typed arguments\n *   issueById: defineQuery(({args}: {args: {id: string}}) =>\n *     builder.issue.where('id', args.id).one(),\n *   ),\n *\n *   // Query with validation using a Standard Schema validator (e.g., Zod)\n *   issuesByStatus: defineQuery(\n *     z.object({status: z.enum(['open', 'closed'])}),\n *     ({args}) => builder.issue.where('status', args.status),\n *   ),\n *\n *   // Query using context\n *   myIssues: defineQuery(({ctx}: {ctx: {userID: string}}) =>\n *     builder.issue.where('creatorID', ctx.userID),\n *   ),\n * });\n * ```\n *\n * @param queryFn - A function that receives `{args, ctx}` and returns a Query.\n * @returns A {@link QueryDefinition} that can be passed to {@link defineQueries}.\n *\n * @overload\n * @param validator - A Standard Schema validator for the arguments.\n * @param queryFn - A function that receives `{args, ctx}` and returns a Query.\n * @returns A {@link QueryDefinition} with validated arguments.\n */\n// Overload for no validator parameter with default inference for untyped functions\nexport function defineQuery<\n  TInput extends ReadonlyJSONValue | undefined,\n  TContext = DefaultContext,\n  TSchema extends Schema = DefaultSchema,\n  TTable extends keyof TSchema['tables'] & string = keyof TSchema['tables'] &\n    string,\n  TReturn = PullRow<TTable, TSchema>,\n>(\n  queryFn: QueryDefinitionFunction<TTable, TInput, TReturn, TContext>,\n): QueryDefinition<TTable, TInput, TInput, TReturn, TContext>;\n\n// Overload for validator parameter - Input and Output can be different\nexport function defineQuery<\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TContext = DefaultContext,\n  TSchema extends Schema = DefaultSchema,\n  TTable extends keyof TSchema['tables'] & string = keyof TSchema['tables'] &\n    string,\n  TReturn = PullRow<TTable, TSchema>,\n>(\n  validator: StandardSchemaV1<TInput, TOutput>,\n  queryFn: QueryDefinitionFunction<TTable, TOutput, TReturn, TContext>,\n): QueryDefinition<TTable, TInput, TOutput, TReturn, TContext>;\n\n// Implementation\nexport function defineQuery<\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TContext = DefaultContext,\n  TSchema extends Schema = DefaultSchema,\n  TTable extends keyof TSchema['tables'] & string = keyof TSchema['tables'] &\n    string,\n  TReturn = PullRow<TTable, TSchema>,\n>(\n  validatorOrQueryFn:\n    | StandardSchemaV1<TInput, TOutput>\n    | QueryDefinitionFunction<TTable, TOutput, TReturn, TContext>,\n  queryFn?: QueryDefinitionFunction<TTable, TOutput, TReturn, TContext>,\n): QueryDefinition<TTable, TInput, TOutput, TReturn, TContext> {\n  // Handle different parameter patterns\n  let validator: StandardSchemaV1<TInput, TOutput> | undefined;\n  let actualQueryFn: QueryDefinitionFunction<\n    TTable,\n    TOutput,\n    TReturn,\n    TContext\n  >;\n\n  if ('~standard' in validatorOrQueryFn) {\n    // defineQuery(validator, queryFn) - with validator\n    validator = validatorOrQueryFn;\n    actualQueryFn = must(queryFn);\n  } else {\n    // defineQuery(queryFn) - no validator\n    validator = undefined;\n    actualQueryFn = validatorOrQueryFn;\n  }\n\n  const queryDefinition: QueryDefinition<\n    TTable,\n    TInput,\n    TOutput,\n    TReturn,\n    TContext\n  > = {\n    'fn': actualQueryFn,\n    'validator': validator,\n    '~': 'QueryDefinition' as unknown as QueryDefinitionTypes<\n      TTable,\n      TInput,\n      TOutput,\n      TReturn,\n      TContext\n    >,\n  };\n  return queryDefinition;\n}\n\n/**\n * Returns a typed version of {@link defineQuery} with the schema and context\n * types pre-specified. This enables better type inference when defining\n * queries.\n *\n * @example\n * ```ts\n * const zql = createBuilder(schema);\n *\n * // With both Schema and Context types\n * const defineAppQuery = defineQueryWithType<AppSchema, AppContext>();\n * const myQuery = defineAppQuery(({ctx}) =>\n *   zql.issue.where('userID', ctx.userID),\n * );\n *\n * // With just Context type (Schema inferred)\n * const defineAppQuery = defineQueryWithType<AppContext>();\n * ```\n *\n * @typeParam S - The Zero schema type.\n * @typeParam C - The context type passed to query functions.\n * @returns A function equivalent to {@link defineQuery} but with types\n *   pre-bound.\n */\nexport function defineQueryWithType<\n  S extends Schema,\n  C = unknown,\n>(): TypedDefineQuery<S, C>;\n\n/**\n * Returns a typed version of {@link defineQuery} with the context type\n * pre-specified.\n *\n * @typeParam C - The context type passed to query functions.\n * @returns A function equivalent to {@link defineQuery} but with the context\n *   type pre-bound.\n */\nexport function defineQueryWithType<C>(): TypedDefineQuery<Schema, C>;\n\nexport function defineQueryWithType() {\n  return defineQuery;\n}\n\n/**\n * The return type of defineQueryWithType. A function matching the\n * defineQuery overloads but with Schema and Context pre-bound.\n */\ntype TypedDefineQuery<TSchema extends Schema, TContext> = {\n  // Without validator\n  <\n    TArgs extends ReadonlyJSONValue | undefined,\n    TReturn,\n    TTable extends keyof TSchema['tables'] & string = keyof TSchema['tables'] &\n      string,\n  >(\n    queryFn: QueryDefinitionFunction<TTable, TArgs, TReturn, TContext>,\n  ): QueryDefinition<TTable, TArgs, TArgs, TReturn, TContext>;\n\n  // With validator\n  <\n    TInput extends ReadonlyJSONValue | undefined,\n    TOutput extends ReadonlyJSONValue | undefined,\n    TReturn,\n    TTable extends keyof TSchema['tables'] & string = keyof TSchema['tables'] &\n      string,\n  >(\n    validator: StandardSchemaV1<TInput, TOutput>,\n    queryFn: QueryDefinitionFunction<TTable, TOutput, TReturn, TContext>,\n  ): QueryDefinition<TTable, TInput, TOutput, TReturn, TContext>;\n};\n\n// ----------------------------------------------------------------------------\n// createQuery\n// ----------------------------------------------------------------------------\n\nexport function createQuery<\n  TTable extends keyof TSchema['tables'] & string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TOutput extends ReadonlyJSONValue | undefined,\n  TSchema extends Schema,\n  TReturn,\n  TContext,\n>(\n  name: string,\n  definition: QueryDefinition<TTable, TInput, TOutput, TReturn, TContext>,\n): CustomQuery<TTable, TInput, TOutput, TSchema, TReturn, TContext> {\n  const {validator} = definition;\n\n  const fn: QueryDefinitionFunction<\n    TTable,\n    TInput,\n    TReturn,\n    TContext\n  > = options => {\n    const validatedArgs = validator\n      ? validateInput(name, options.args, validator, 'query')\n      : (options.args as unknown as TOutput);\n\n    return asQueryInternals(\n      definition.fn({\n        args: validatedArgs,\n        ctx: options.ctx,\n      }),\n    ).nameAndArgs(\n      name,\n      // TODO(arv): Get rid of the array?\n      // Send original input args to server (not transformed output)\n      options.args === undefined ? [] : [options.args],\n    );\n  };\n\n  const query = (\n    args: TInput,\n  ): QueryRequest<TTable, TInput, TOutput, TSchema, TReturn, TContext> => ({\n    args,\n    '~': 'QueryRequest' as QueryRequestTypes<\n      TTable,\n      TInput,\n      TOutput,\n      TSchema,\n      TReturn,\n      TContext\n    >,\n    'query': query as unknown as CustomQuery<\n      TTable,\n      TInput,\n      TOutput,\n      TSchema,\n      TReturn,\n      TContext\n    >,\n  });\n\n  query.queryName = name;\n  query.fn = fn;\n  query['~'] = 'Query' as CustomQueryTypes<\n    TTable,\n    TInput,\n    TSchema,\n    TReturn,\n    TContext\n  >;\n\n  return query as unknown as CustomQuery<\n    TTable,\n    TInput,\n    TOutput,\n    TSchema,\n    TReturn,\n    TContext\n  >;\n}\n\n// ----------------------------------------------------------------------------\n// defineQueries\n// ----------------------------------------------------------------------------\n\n/**\n * Converts query definitions created with {@link defineQuery} into callable\n * {@link Query} objects that can be invoked with arguments and a context.\n *\n * Query definitions can be nested for organization. The resulting query names\n * are dot-separated paths (e.g., `users.byId`).\n *\n * @example\n * ```ts\n * const builder = createBuilder(schema);\n *\n * const queries = defineQueries({\n *   issues: defineQuery(() => builder.issue.orderBy('created', 'desc')),\n *   users: {\n *     byId: defineQuery(({args}: {args: {id: string}}) =>\n *       builder.user.where('id', args.id),\n *     ),\n *   },\n * });\n *\n * // Usage:\n * const request = queries.issues.byId({id: '123'});\n * const [data] = zero.useQuery(request);\n * ```\n *\n * @param defs - An object containing query definitions or nested objects of\n *   query definitions.\n * @returns An object with the same structure where each query definition is\n *   converted to a {@link CustomQuery}.\n */\nexport function defineQueries<\n  // let QD infer freely so defaults aren't erased by a QueryDefinitions<any, any> constraint\n  const QD,\n  S extends Schema = DefaultSchema,\n>(\n  defs: QD & AssertQueryDefinitions<QD>,\n): QueryRegistry<EnsureQueryDefinitions<QD>, S>;\n\nexport function defineQueries<\n  const TBase,\n  const TOverrides,\n  S extends Schema = DefaultSchema,\n>(\n  base:\n    | QueryRegistry<EnsureQueryDefinitions<TBase>, S>\n    | (TBase & AssertQueryDefinitions<TBase>),\n  overrides: TOverrides & AssertQueryDefinitions<TOverrides>,\n): QueryRegistry<\n  DeepMerge<\n    EnsureQueryDefinitions<TBase>,\n    EnsureQueryDefinitions<TOverrides>,\n    AnyQueryDefinition\n  >,\n  S\n>;\n\nexport function defineQueries<QD extends QueryDefinitions, S extends Schema>(\n  defsOrBase: QD | QueryRegistry<QD, S>,\n  overrides?: QueryDefinitions,\n): QueryRegistry<QD, S> {\n  function processDefinitions(\n    definitions: QueryDefinitions,\n    path: string[],\n  ): Record<string | symbol, unknown> {\n    const result: Record<string | symbol, unknown> = {\n      ['~']: 'QueryRegistry',\n    };\n\n    for (const [key, value] of Object.entries(definitions)) {\n      path.push(key);\n      const defaultName = path.join('.');\n\n      if (isQueryDefinition(value)) {\n        result[key] = createQuery(defaultName, value);\n      } else {\n        // Nested definitions\n        result[key] = processDefinitions(value, path);\n      }\n      path.pop();\n    }\n\n    return result;\n  }\n\n  if (overrides !== undefined) {\n    // Merge base and overrides\n\n    let base: Record<string | symbol, unknown>;\n    if (!isQueryRegistry(defsOrBase)) {\n      base = processDefinitions(defsOrBase, []);\n    } else {\n      base = defsOrBase;\n    }\n\n    const processed = processDefinitions(overrides, []);\n\n    const merged = deepMerge(base, processed, isQueryLeaf);\n    merged['~'] = 'QueryRegistry';\n    return merged as QueryRegistry<QD, S>;\n  }\n\n  return processDefinitions(defsOrBase as QD, []) as QueryRegistry<QD, S>;\n}\n\nconst isQueryLeaf = (value: unknown): boolean =>\n  !isPlainObject(value) || isQuery(value);\n\nexport type AssertQueryDefinitions<QD> = QD extends QueryDefinitions\n  ? unknown\n  : never;\n\nexport type EnsureQueryDefinitions<QD> = QD extends QueryDefinitions\n  ? QD\n  : QD extends QueryRegistry<infer InnerQD, infer _S>\n    ? InnerQD\n    : never;\n\n/**\n * Creates a function that can be used to define queries with a specific schema.\n */\nexport function defineQueriesWithType<\n  TSchema extends Schema,\n>(): TypedDefineQueries<TSchema> {\n  return defineQueries;\n}\n\n/**\n * The return type of defineQueriesWithType. A function matching the\n * defineQueries overloads but with Schema pre-bound.\n */\ntype TypedDefineQueries<S extends Schema> = {\n  // Single definitions\n  <QD>(\n    definitions: QD & AssertQueryDefinitions<QD>,\n  ): QueryRegistry<EnsureQueryDefinitions<QD>, S>;\n\n  // Base and overrides\n  <TBase, TOverrides>(\n    base:\n      | QueryRegistry<EnsureQueryDefinitions<TBase>, S>\n      | (TBase & AssertQueryDefinitions<TBase>),\n    overrides: TOverrides & AssertQueryDefinitions<TOverrides>,\n  ): QueryRegistry<\n    DeepMerge<\n      EnsureQueryDefinitions<TBase>,\n      EnsureQueryDefinitions<TOverrides>,\n      AnyQueryDefinition\n    >,\n    S\n  >;\n};\n\n// ----------------------------------------------------------------------------\n// getQuery / mustGetQuery\n// ----------------------------------------------------------------------------\n\nexport function getQuery<QD extends QueryDefinitions, S extends Schema>(\n  queries: QueryRegistry<QD, S>,\n  name: string,\n): FromQueryTree<QD, S> | undefined {\n  const q = getValueAtPath(queries, name, /[.|]/);\n  return q as FromQueryTree<QD, S> | undefined;\n}\n\nexport function mustGetQuery<QD extends QueryDefinitions, S extends Schema>(\n  queries: QueryRegistry<QD, S>,\n  name: string,\n): FromQueryTree<QD, S> {\n  const query = getQuery(queries, name);\n  if (query === undefined) {\n    throw new Error(`Query not found: ${name}`);\n  }\n  return query;\n}\n"],"names":[],"mappings":";;;;;AA8EO,SAAS,QACd,OAEqD;AACrD,SACE,OAAO,UAAU,cACjB,OAAQ,MAAgC,cAAc,YACtD,OAAQ,MAAyB,OAAO;AAE5C;AAqEO,MAAM,oBAAoB,CAQ/B,OAQA,YAEA,WAAW,QAAQ,MAAM,MAAM,GAAG,EAAC,KAAK,SAAS,MAAM,MAAM,KAAA,CAAK,IAAI;AAMjE,SAAS,gBAAgB,KAAuC;AACrE,SACE,OAAO,QAAQ,YACf,QAAQ,QACP,MAAqC,GAAG,MAAM;AAEnD;AAgGO,SAAS,kBAAkB,GAAqC;AACrE,SACE,OAAO,MAAM,YACb,MAAM,QACL,EAAwB,GAAG,MAAM;AAEtC;AAiFO,SAAS,YASd,oBAGA,SAC6D;AAE7D,MAAI;AACJ,MAAI;AAOJ,MAAI,eAAe,oBAAoB;AAErC,gBAAY;AACZ,oBAAgB,KAAK,OAAO;AAAA,EAC9B,OAAO;AAEL,gBAAY;AACZ,oBAAgB;AAAA,EAClB;AAEA,QAAM,kBAMF;AAAA,IACF,MAAM;AAAA,IACN,aAAa;AAAA,IACb,KAAK;AAAA,EAAA;AAQP,SAAO;AACT;AAyCO,SAAS,sBAAsB;AACpC,SAAO;AACT;AAkCO,SAAS,YAQd,MACA,YACkE;AAClE,QAAM,EAAC,cAAa;AAEpB,QAAM,KAKF,CAAA,YAAW;AACb,UAAM,gBAAgB,YAClB,cAAc,MAAM,QAAQ,MAAM,WAAW,OAAO,IACnD,QAAQ;AAEb,WAAO;AAAA,MACL,WAAW,GAAG;AAAA,QACZ,MAAM;AAAA,QACN,KAAK,QAAQ;AAAA,MAAA,CACd;AAAA,IAAA,EACD;AAAA,MACA;AAAA;AAAA;AAAA,MAGA,QAAQ,SAAS,SAAY,CAAA,IAAK,CAAC,QAAQ,IAAI;AAAA,IAAA;AAAA,EAEnD;AAEA,QAAM,QAAQ,CACZ,UACuE;AAAA,IACvE;AAAA,IACA,KAAK;AAAA,IAQL,SAAS;AAAA,EAAA;AAUX,QAAM,YAAY;AAClB,QAAM,KAAK;AACX,QAAM,GAAG,IAAI;AAQb,SAAO;AAQT;AA8DO,SAAS,cACd,YACA,WACsB;AACtB,WAAS,mBACP,aACA,MACkC;AAClC,UAAM,SAA2C;AAAA,MAC/C,CAAC,GAAG,GAAG;AAAA,IAAA;AAGT,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,WAAW,GAAG;AACtD,WAAK,KAAK,GAAG;AACb,YAAM,cAAc,KAAK,KAAK,GAAG;AAEjC,UAAI,kBAAkB,KAAK,GAAG;AAC5B,eAAO,GAAG,IAAI,YAAY,aAAa,KAAK;AAAA,MAC9C,OAAO;AAEL,eAAO,GAAG,IAAI,mBAAmB,OAAO,IAAI;AAAA,MAC9C;AACA,WAAK,IAAA;AAAA,IACP;AAEA,WAAO;AAAA,EACT;AAEA,MAAI,cAAc,QAAW;AAG3B,QAAI;AACJ,QAAI,CAAC,gBAAgB,UAAU,GAAG;AAChC,aAAO,mBAAmB,YAAY,EAAE;AAAA,IAC1C,OAAO;AACL,aAAO;AAAA,IACT;AAEA,UAAM,YAAY,mBAAmB,WAAW,EAAE;AAElD,UAAM,SAAS,UAAU,MAAM,WAAW,WAAW;AACrD,WAAO,GAAG,IAAI;AACd,WAAO;AAAA,EACT;AAEA,SAAO,mBAAmB,YAAkB,EAAE;AAChD;AAEA,MAAM,cAAc,CAAC,UACnB,CAAC,cAAc,KAAK,KAAK,QAAQ,KAAK;AAejC,SAAS,wBAEiB;AAC/B,SAAO;AACT;AAgCO,SAAS,SACd,SACA,MACkC;AAClC,QAAM,IAAI,eAAe,SAAS,MAAM,MAAM;AAC9C,SAAO;AACT;AAEO,SAAS,aACd,SACA,MACsB;AACtB,QAAM,QAAQ,SAAS,SAAS,IAAI;AACpC,MAAI,UAAU,QAAW;AACvB,UAAM,IAAI,MAAM,oBAAoB,IAAI,EAAE;AAAA,EAC5C;AACA,SAAO;AACT;"}

package/out/zqlite/src/table-source.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"table-source.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/table-source.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,+BAA+B,CAAC;AAK7D,OAAO,KAAK,EAAC,SAAS,EAAE,QAAQ,EAAC,MAAM,gCAAgC,CAAC;AACxE,OAAO,KAAK,EAAC,GAAG,EAAQ,MAAM,iCAAiC,CAAC;AAChE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AACvE,OAAO,KAAK,EACV,WAAW,EACX,SAAS,EACV,MAAM,uCAAuC,CAAC;AAC/C,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,yCAAyC,CAAC;AAe3E,OAAO,EACL,KAAK,MAAM,EACX,KAAK,YAAY,EACjB,KAAK,WAAW,EACjB,MAAM,6BAA6B,CAAC;AACrC,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,6BAA6B,CAAC;AACxD,OAAO,KAAK,EAAC,QAAQ,EAAY,MAAM,SAAS,CAAC;AAqBjD;;;;;;;;;;;;;GAaG;AACH,qBAAa,WAAY,YAAW,MAAM;;IAexC;;;;;OAKG;gBAED,UAAU,EAAE,UAAU,EACtB,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,QAAQ,EACZ,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACpC,UAAU,EAAE,UAAU,EACtB,WAAW,gBAAc;IAiB3B,IAAI,WAAW;;;;MAMd;IAED;;;OAGG;IACH,KAAK,CAAC,EAAE,EAAE,QAAQ;IA4FlB,OAAO,CACL,IAAI,EAAE,QAAQ,EACd,OAAO,CAAC,EAAE,SAAS,EACnB,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAC3B,KAAK,CAAC,EAAE,aAAa;IAuCvB,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG;IAqGzB,IAAI,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC;IAQ3C,OAAO,CAAC,MAAM,EAAE,YAAY;IA4F7B;;;;;;OAMG;IACH,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS;CA6BrC;AA6BD,wBAAgB,aAAa,CAC3B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,GAAG,EAAE,GAAG,EACR,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,GACvC,SAAS,OAAO,EAAE,CAEpB;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,SAAS,wCAa/C;AAED,wBAAgB,eAAe,CAC7B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACvC,GAAG,EAAE,GAAG,EACR,SAAS,EAAE,MAAM,GAChB,GAAG,CAaL;AAwCD,qBAAa,qBAAsB,SAAQ,KAAK;CAAG"}
+{"version":3,"file":"table-source.d.ts","sourceRoot":"","sources":["../../../../zqlite/src/table-source.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAEjD,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,+BAA+B,CAAC;AAK7D,OAAO,KAAK,EAAC,SAAS,EAAE,QAAQ,EAAC,MAAM,gCAAgC,CAAC;AACxE,OAAO,KAAK,EAAC,GAAG,EAAQ,MAAM,iCAAiC,CAAC;AAChE,OAAO,KAAK,EAAC,UAAU,EAAC,MAAM,wCAAwC,CAAC;AACvE,OAAO,KAAK,EACV,WAAW,EACX,SAAS,EACV,MAAM,uCAAuC,CAAC;AAC/C,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,yCAAyC,CAAC;AAe3E,OAAO,EACL,KAAK,MAAM,EACX,KAAK,YAAY,EACjB,KAAK,WAAW,EACjB,MAAM,6BAA6B,CAAC;AACrC,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,6BAA6B,CAAC;AACxD,OAAO,KAAK,EAAC,QAAQ,EAAY,MAAM,SAAS,CAAC;AAqBjD;;;;;;;;;;;;;GAaG;AACH,qBAAa,WAAY,YAAW,MAAM;;IAexC;;;;;OAKG;gBAED,UAAU,EAAE,UAAU,EACtB,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,QAAQ,EACZ,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACpC,UAAU,EAAE,UAAU,EACtB,WAAW,gBAAc;IAiB3B,IAAI,WAAW;;;;MAMd;IAED;;;OAGG;IACH,KAAK,CAAC,EAAE,EAAE,QAAQ;IA4FlB,OAAO,CACL,IAAI,EAAE,QAAQ,EACd,OAAO,CAAC,EAAE,SAAS,EACnB,aAAa,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAC3B,KAAK,CAAC,EAAE,aAAa;IAuCvB,WAAW,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG;IAqGzB,IAAI,CAAC,MAAM,EAAE,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC;IAQ3C,OAAO,CAAC,MAAM,EAAE,YAAY;IA4F7B;;;;;;OAMG;IACH,MAAM,CAAC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS;CA8BrC;AA6BD,wBAAgB,aAAa,CAC3B,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,GAAG,EAAE,GAAG,EACR,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,GACvC,SAAS,OAAO,EAAE,CAEpB;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,SAAS,wCAa/C;AAED,wBAAgB,eAAe,CAC7B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,EACvC,GAAG,EAAE,GAAG,EACR,SAAS,EAAE,MAAM,GAChB,GAAG,CAaL;AAwCD,qBAAa,qBAAsB,SAAQ,KAAK;CAAG"}

package/out/zqlite/src/table-source.js

@@ -355,11 +355,10 @@ class TableSource {
    */
   getRow(rowKey) {
     const keyCols = Object.keys(rowKey);
-    const keyVals = Object.values(rowKey);
     const stmt = this.#getRowStmt(keyCols);
     const row = this.#stmts.cache.use(
       stmt,
-      (cached) => cached.statement.safeIntegers(true).get(keyVals)
+      (cached) => cached.statement.safeIntegers(true).get(...toSQLiteTypes(keyCols, rowKey, this.#columns))
     );
     if (row) {
       return fromSQLiteTypes(this.#columns, row, this.#table);