@rocicorp/zero 1.2.0 → 1.3.0-canary.1

package/out/zql/src/ivm/memory-source.js.map

@@ -1 +1 @@
-{"version":3,"file":"memory-source.js","names":["#tableName","#columns","#primaryKey","#primaryIndexSort","#indexes","#connections","#getPrimaryIndex","#fetch","#disconnect","#getSchema","#getOrCreateIndex","#overlay","#writeChange","#pushEpoch"],"sources":["../../../../../zql/src/ivm/memory-source.ts"],"sourcesContent":["import {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport {BTreeSet} from '../../../shared/src/btree-set.ts';\nimport {hasOwn} from '../../../shared/src/has-own.ts';\nimport {once} from '../../../shared/src/iterables.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {\n  Condition,\n  Ordering,\n  OrderPart,\n} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\nimport type {SchemaValue} from '../../../zero-types/src/schema-value.ts';\nimport type {DebugDelegate} from '../builder/debug-delegate.ts';\nimport {\n  createPredicate,\n  transformFilters,\n  type NoSubqueryCondition,\n} from '../builder/filter.ts';\nimport {assertOrderingIncludesPK} from '../query/complete-ordering.ts';\nimport type {Change} from './change.ts';\nimport {\n  constraintMatchesPrimaryKey,\n  constraintMatchesRow,\n  primaryKeyConstraintFromFilters,\n  type Constraint,\n} from './constraint.ts';\nimport {\n  compareValues,\n  makeComparator,\n  valuesEqual,\n  type Comparator,\n  type Node,\n} from './data.ts';\nimport {filterPush} from './filter-push.ts';\nimport {\n  skipYields,\n  type FetchRequest,\n  type Input,\n  type Output,\n  type Start,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {\n  Source,\n  SourceChange,\n  SourceChangeAdd,\n  SourceChangeEdit,\n  SourceChangeRemove,\n  SourceInput,\n} from './source.ts';\nimport type {Stream} from './stream.ts';\n\nexport type Overlay = {\n  epoch: number;\n  change: SourceChange;\n};\n\nexport type Overlays = {\n  add: Row | undefined;\n  remove: Row | undefined;\n};\n\ntype Index = {\n  comparator: Comparator;\n  data: BTreeSet<Row>;\n  usedBy: Set<Connection>;\n};\n\nexport type Connection = {\n  input: Input;\n  output: Output | undefined;\n  sort?: Ordering | undefined;\n  splitEditKeys: Set<string> | undefined;\n  compareRows: Comparator;\n  filters:\n    | {\n        condition: NoSubqueryCondition;\n        predicate: (row: Row) => boolean;\n      }\n    | undefined;\n  readonly debug?: DebugDelegate | undefined;\n  lastPushedEpoch: number;\n};\n\n/**\n * A `MemorySource` is a source that provides data to the pipeline from an\n * in-memory data source.\n *\n * This data is kept in sorted order as downstream pipelines will always expect\n * the data they receive from `pull` to be in sorted order.\n */\nexport class MemorySource implements Source {\n  readonly #tableName: string;\n  readonly #columns: Record<string, SchemaValue>;\n  readonly #primaryKey: PrimaryKey;\n  readonly #primaryIndexSort: Ordering;\n  readonly #indexes: Map<string, Index> = new Map();\n  readonly #connections: Connection[] = [];\n\n  #overlay: Overlay | undefined;\n  #pushEpoch = 0;\n\n  constructor(\n    tableName: string,\n    columns: Record<string, SchemaValue>,\n    primaryKey: PrimaryKey,\n    primaryIndexData?: BTreeSet<Row>,\n  ) {\n    this.#tableName = tableName;\n    this.#columns = columns;\n    this.#primaryKey = primaryKey;\n    this.#primaryIndexSort = primaryKey.map(k => [k, 'asc']);\n    const comparator = makeBoundComparator(this.#primaryIndexSort);\n    this.#indexes.set(JSON.stringify(this.#primaryIndexSort), {\n      comparator,\n      data: primaryIndexData ?? new BTreeSet<Row>(comparator),\n      usedBy: new Set(),\n    });\n  }\n\n  get tableSchema() {\n    return {\n      name: this.#tableName,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n    };\n  }\n\n  fork() {\n    const primaryIndex = this.#getPrimaryIndex();\n    return new MemorySource(\n      this.#tableName,\n      this.#columns,\n      this.#primaryKey,\n      primaryIndex.data.clone(),\n    );\n  }\n\n  get data(): BTreeSet<Row> {\n    return this.#getPrimaryIndex().data;\n  }\n\n  #getSchema(connection: Connection, unordered: boolean): SourceSchema {\n    return {\n      tableName: this.#tableName,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n      sort: unordered ? undefined : connection.sort,\n      system: 'client',\n      relationships: {},\n      isHidden: false,\n      compareRows: connection.compareRows,\n    };\n  }\n\n  connect(\n    sort: Ordering | undefined,\n    filters?: Condition,\n    splitEditKeys?: Set<string>,\n  ): SourceInput {\n    const transformedFilters = transformFilters(filters);\n    const unordered = sort === undefined;\n    const internalSort = sort ?? this.#primaryIndexSort;\n\n    const input: SourceInput = {\n      getSchema: () => schema,\n      fetch: req => this.#fetch(req, connection),\n      setOutput: output => {\n        connection.output = output;\n      },\n      destroy: () => {\n        this.#disconnect(input);\n      },\n      fullyAppliedFilters: !transformedFilters.conditionsRemoved,\n    };\n\n    const connection: Connection = {\n      input,\n      output: undefined,\n      sort: internalSort,\n      splitEditKeys,\n      compareRows: makeComparator(internalSort),\n      filters: transformedFilters.filters\n        ? {\n            condition: transformedFilters.filters,\n            predicate: createPredicate(transformedFilters.filters),\n          }\n        : undefined,\n      lastPushedEpoch: 0,\n    };\n    const schema = this.#getSchema(connection, unordered);\n    if (!unordered) {\n      assertOrderingIncludesPK(internalSort, this.#primaryKey);\n    }\n    this.#connections.push(connection);\n    return input;\n  }\n\n  #disconnect(input: Input): void {\n    const idx = this.#connections.findIndex(c => c.input === input);\n    assert(idx !== -1, 'Connection not found');\n    this.#connections.splice(idx, 1);\n\n    // TODO: We used to delete unused indexes here. But in common cases like\n    // navigating into issue detail pages it caused a ton of constantly\n    // building and destroying indexes.\n    //\n    // Perhaps some intelligent LRU or something is needed here but for now,\n    // the opposite extreme of keeping all indexes for the lifetime of the\n    // page seems better.\n  }\n\n  #getPrimaryIndex(): Index {\n    const index = this.#indexes.get(JSON.stringify(this.#primaryIndexSort));\n    assert(index, 'Primary index not found');\n    return index;\n  }\n\n  #getOrCreateIndex(sort: Ordering, usedBy: Connection): Index {\n    const key = JSON.stringify(sort);\n    const index = this.#indexes.get(key);\n    // Future optimization could use existing index if it's the same just sorted\n    // in reverse of needed.\n    if (index) {\n      index.usedBy.add(usedBy);\n      return index;\n    }\n\n    const comparator = makeBoundComparator(sort);\n\n    // When creating these synchronously becomes a problem, a few options:\n    // 1. Allow users to specify needed indexes up front\n    // 2. Create indexes in a different thread asynchronously (this would require\n    // modifying the BTree to be able to be passed over structured-clone, or using\n    // a different library.)\n    // 3. We could even theoretically do (2) on multiple threads and then merge the\n    // results!\n    const data = new BTreeSet<Row>(comparator);\n\n    // I checked, there's no special path for adding data in bulk faster.\n    // The constructor takes an array, but it just calls add/set over and over.\n    for (const row of this.#getPrimaryIndex().data) {\n      data.add(row);\n    }\n\n    const newIndex = {comparator, data, usedBy: new Set([usedBy])};\n    this.#indexes.set(key, newIndex);\n    return newIndex;\n  }\n\n  // For unit testing that we correctly clean up indexes.\n  getIndexKeys(): string[] {\n    return [...this.#indexes.keys()];\n  }\n\n  *#fetch(req: FetchRequest, conn: Connection): Stream<Node | 'yield'> {\n    const requestedSort = must(conn.sort);\n    const {compareRows} = conn;\n    // Avoid allocating a new closure when not reversing (the common case).\n    const connectionComparator: Comparator = req.reverse\n      ? (r1, r2) => compareRows(r2, r1)\n      : compareRows;\n\n    const pkConstraint = primaryKeyConstraintFromFilters(\n      conn.filters?.condition,\n      this.#primaryKey,\n    );\n    // The primary key constraint will be more limiting than the constraint\n    // so swap out to that if it exists.\n    const fetchOrPkConstraint = pkConstraint ?? req.constraint;\n\n    // If there is a constraint, we need an index sorted by it first.\n    const indexSort: OrderPart[] = [];\n    if (fetchOrPkConstraint) {\n      for (const key of Object.keys(fetchOrPkConstraint)) {\n        indexSort.push([key, 'asc']);\n      }\n    }\n\n    // For the special case of constraining by PK, we don't need to worry about\n    // any requested sort since there can only be one result. Otherwise we also\n    // need the index sorted by the requested sort.\n    if (\n      this.#primaryKey.length > 1 ||\n      !fetchOrPkConstraint ||\n      !constraintMatchesPrimaryKey(fetchOrPkConstraint, this.#primaryKey)\n    ) {\n      indexSort.push(...requestedSort);\n    }\n\n    const index = this.#getOrCreateIndex(indexSort, conn);\n    const {data, comparator: compare} = index;\n    // Avoid allocating a new closure when not reversing (the common case).\n    const indexComparator: Comparator = req.reverse\n      ? (r1, r2) => compare(r2, r1)\n      : compare;\n\n    const startAt = req.start?.row;\n\n    // If there is a constraint, we want to start our scan at the first row that\n    // matches the constraint. But because the next OrderPart can be `desc`,\n    // it's not true that {[constraintKey]: constraintValue} is the first\n    // matching row. Because in that case, the other fields will all be\n    // `undefined`, and in Zero `undefined` is always less than any other value.\n    // So if the second OrderPart is descending then `undefined` values will\n    // actually be the *last* row. We need a way to stay \"start at the first row\n    // with this constraint value\". RowBound with the corresponding compareBound\n    // comparator accomplishes this. The right thing is probably to teach the\n    // btree library to support this concept.\n    let scanStart: RowBound | undefined;\n\n    if (fetchOrPkConstraint) {\n      scanStart = {};\n      for (const [key, dir] of indexSort) {\n        if (hasOwn(fetchOrPkConstraint, key)) {\n          scanStart[key] = fetchOrPkConstraint[key];\n        } else {\n          if (req.reverse) {\n            scanStart[key] = dir === 'asc' ? maxValue : minValue;\n          } else {\n            scanStart[key] = dir === 'asc' ? minValue : maxValue;\n          }\n        }\n      }\n    } else {\n      scanStart = startAt;\n    }\n\n    const rowsIterable = generateRows(data, scanStart, req.reverse);\n    const withOverlay = generateWithOverlay(\n      startAt,\n      pkConstraint ? once(rowsIterable) : rowsIterable,\n      // use `req.constraint` here and not `fetchOrPkConstraint` since `fetchOrPkConstraint` could be the\n      // primary key constraint. The primary key constraint comes from filters and is acting as a filter\n      // rather than as the fetch constraint.\n      req.constraint,\n      this.#overlay,\n      conn.lastPushedEpoch,\n      // Use indexComparator, generateWithOverlayInner has a subtle dependency\n      // on this.  Since generateWithConstraint is done after\n      // generateWithOverlay, the generator consumed by generateWithOverlayInner\n      // does not end when the constraint stops matching and so the final\n      // check to yield an add overlay if not yet yielded is not reached.\n      // However, using the indexComparator the add overlay will be less than\n      // the first row that does not match the constraint, and so any\n      // not yet yielded add overlay will be yielded when the first row\n      // not matching the constraint is reached.\n      indexComparator,\n      conn.filters?.predicate,\n    );\n\n    const withConstraint = generateWithConstraint(\n      skipYields(\n        generateWithStart(withOverlay, req.start, connectionComparator),\n      ),\n      // we use `req.constraint` and not `fetchOrPkConstraint` here because we need to\n      // AND the constraint with what could have been the primary key constraint\n      req.constraint,\n    );\n\n    yield* conn.filters\n      ? generateWithFilter(withConstraint, conn.filters.predicate)\n      : withConstraint;\n  }\n\n  *push(change: SourceChange): Stream<'yield'> {\n    for (const result of this.genPush(change)) {\n      if (result === 'yield') {\n        yield result;\n      }\n    }\n  }\n\n  *genPush(change: SourceChange) {\n    const primaryIndex = this.#getPrimaryIndex();\n    const {data} = primaryIndex;\n    const exists = (row: Row) => data.has(row);\n    const setOverlay = (o: Overlay | undefined) => (this.#overlay = o);\n    const writeChange = (c: SourceChange) => this.#writeChange(c);\n    yield* genPushAndWriteWithSplitEdit(\n      this.#connections,\n      change,\n      exists,\n      setOverlay,\n      writeChange,\n      () => ++this.#pushEpoch,\n    );\n  }\n\n  #writeChange(change: SourceChange) {\n    for (const {data} of this.#indexes.values()) {\n      switch (change.type) {\n        case 'add': {\n          const added = data.add(change.row);\n          // must succeed since we checked has() above.\n          assert(\n            added,\n            'MemorySource: add must succeed since row existence was already checked',\n          );\n          break;\n        }\n        case 'remove': {\n          const removed = data.delete(change.row);\n          // must succeed since we checked has() above.\n          assert(\n            removed,\n            'MemorySource: remove must succeed since row existence was already checked',\n          );\n          break;\n        }\n        case 'edit': {\n          // TODO: We could see if the PK (form the index tree's perspective)\n          // changed and if not we could use set.\n          // We cannot just do `set` with the new value since the `oldRow` might\n          // not map to the same entry as the new `row` in the index btree.\n          const removed = data.delete(change.oldRow);\n          // must succeed since we checked has() above.\n          assert(\n            removed,\n            'MemorySource: edit remove must succeed since row existence was already checked',\n          );\n          data.add(change.row);\n          break;\n        }\n        default:\n          unreachable(change);\n      }\n    }\n  }\n}\n\nfunction* generateWithConstraint(\n  it: Stream<Node>,\n  constraint: Constraint | undefined,\n) {\n  for (const node of it) {\n    if (constraint && !constraintMatchesRow(constraint, node.row)) {\n      break;\n    }\n    yield node;\n  }\n}\n\nfunction* generateWithFilter(it: Stream<Node>, filter: (row: Row) => boolean) {\n  for (const node of it) {\n    if (filter(node.row)) {\n      yield node;\n    }\n  }\n}\n\nexport function* genPushAndWriteWithSplitEdit(\n  connections: readonly Connection[],\n  change: SourceChange,\n  exists: (row: Row) => boolean,\n  setOverlay: (o: Overlay | undefined) => Overlay | undefined,\n  writeChange: (c: SourceChange) => void,\n  getNextEpoch: () => number,\n) {\n  let shouldSplitEdit = false;\n  if (change.type === 'edit') {\n    for (const {splitEditKeys} of connections) {\n      if (splitEditKeys) {\n        for (const key of splitEditKeys) {\n          if (!valuesEqual(change.row[key], change.oldRow[key])) {\n            shouldSplitEdit = true;\n            break;\n          }\n        }\n      }\n    }\n  }\n\n  if (change.type === 'edit' && shouldSplitEdit) {\n    yield* genPushAndWrite(\n      connections,\n      {\n        type: 'remove',\n        row: change.oldRow,\n      },\n      exists,\n      setOverlay,\n      writeChange,\n      getNextEpoch(),\n    );\n    yield* genPushAndWrite(\n      connections,\n      {\n        type: 'add',\n        row: change.row,\n      },\n      exists,\n      setOverlay,\n      writeChange,\n      getNextEpoch(),\n    );\n  } else {\n    yield* genPushAndWrite(\n      connections,\n      change,\n      exists,\n      setOverlay,\n      writeChange,\n      getNextEpoch(),\n    );\n  }\n}\n\nfunction* genPushAndWrite(\n  connections: readonly Connection[],\n  change: SourceChangeAdd | SourceChangeRemove | SourceChangeEdit,\n  exists: (row: Row) => boolean,\n  setOverlay: (o: Overlay | undefined) => Overlay | undefined,\n  writeChange: (c: SourceChange) => void,\n  pushEpoch: number,\n) {\n  for (const x of genPush(connections, change, exists, setOverlay, pushEpoch)) {\n    yield x;\n  }\n  writeChange(change);\n}\n\nfunction* genPush(\n  connections: readonly Connection[],\n  change: SourceChange,\n  exists: (row: Row) => boolean,\n  setOverlay: (o: Overlay | undefined) => void,\n  pushEpoch: number,\n) {\n  switch (change.type) {\n    case 'add':\n      assert(\n        !exists(change.row),\n        () => `Row already exists ${stringify(change)}`,\n      );\n      break;\n    case 'remove':\n      assert(exists(change.row), () => `Row not found ${stringify(change)}`);\n      break;\n    case 'edit':\n      assert(exists(change.oldRow), () => `Row not found ${stringify(change)}`);\n      break;\n    default:\n      unreachable(change);\n  }\n\n  for (const conn of connections) {\n    const {output, filters, input} = conn;\n    if (output) {\n      conn.lastPushedEpoch = pushEpoch;\n      setOverlay({epoch: pushEpoch, change});\n      const outputChange: Change =\n        change.type === 'edit'\n          ? {\n              type: change.type,\n              oldNode: {\n                row: change.oldRow,\n                relationships: {},\n              },\n              node: {\n                row: change.row,\n                relationships: {},\n              },\n            }\n          : {\n              type: change.type,\n              node: {\n                row: change.row,\n                relationships: {},\n              },\n            };\n      yield* filterPush(outputChange, output, input, filters?.predicate);\n      yield undefined;\n    }\n  }\n\n  setOverlay(undefined);\n}\n\nexport function* generateWithStart(\n  nodes: Iterable<Node | 'yield'>,\n  start: Start | undefined,\n  compare: (r1: Row, r2: Row) => number,\n): Stream<Node | 'yield'> {\n  if (!start) {\n    yield* nodes;\n    return;\n  }\n  let started = false;\n  for (const node of nodes) {\n    if (node === 'yield') {\n      yield node;\n      continue;\n    }\n    if (!started) {\n      if (start.basis === 'at') {\n        if (compare(node.row, start.row) >= 0) {\n          started = true;\n        }\n      } else if (start.basis === 'after') {\n        if (compare(node.row, start.row) > 0) {\n          started = true;\n        }\n      }\n    }\n    if (started) {\n      yield node;\n    }\n  }\n}\n\n/**\n * Takes an iterator and overlay.\n * Splices the overlay into the iterator at the correct position.\n *\n * @param startAt - if there is a lower bound to the stream. If the lower bound of the stream\n * is above the overlay, the overlay will be skipped.\n * @param rows - the stream into which the overlay should be spliced\n * @param constraint - constraint that was applied to the rowIterator and should\n * also be applied to the overlay.\n * @param overlay - the overlay values to splice in\n * @param compare - the comparator to use to find the position for the overlay\n */\nexport function* generateWithOverlay(\n  startAt: Row | undefined,\n  rows: Iterable<Row>,\n  constraint: Constraint | undefined,\n  overlay: Overlay | undefined,\n  lastPushedEpoch: number,\n  compare: Comparator,\n  filterPredicate?: (row: Row) => boolean | undefined,\n) {\n  let overlayToApply: Overlay | undefined = undefined;\n  if (overlay && lastPushedEpoch >= overlay.epoch) {\n    overlayToApply = overlay;\n  }\n  const overlays = computeOverlays(\n    startAt,\n    constraint,\n    overlayToApply,\n    compare,\n    filterPredicate,\n  );\n  yield* generateWithOverlayInner(rows, overlays, compare);\n}\n\nfunction computeOverlays(\n  startAt: Row | undefined,\n  constraint: Constraint | undefined,\n  overlay: Overlay | undefined,\n  compare: Comparator,\n  filterPredicate?: (row: Row) => boolean | undefined,\n): Overlays {\n  let overlays: Overlays = {\n    add: undefined,\n    remove: undefined,\n  };\n  switch (overlay?.change.type) {\n    case 'add':\n      overlays = {\n        add: overlay.change.row,\n        remove: undefined,\n      };\n      break;\n    case 'remove':\n      overlays = {\n        add: undefined,\n        remove: overlay.change.row,\n      };\n      break;\n    case 'edit':\n      overlays = {\n        add: overlay.change.row,\n        remove: overlay.change.oldRow,\n      };\n      break;\n  }\n\n  if (startAt) {\n    overlays = overlaysForStartAt(overlays, startAt, compare);\n  }\n\n  if (constraint) {\n    overlays = overlaysForConstraint(overlays, constraint);\n  }\n\n  if (filterPredicate) {\n    overlays = overlaysForFilterPredicate(overlays, filterPredicate);\n  }\n\n  return overlays;\n}\n\nexport {overlaysForStartAt as overlaysForStartAtForTest};\n\nfunction overlaysForStartAt(\n  {add, remove}: Overlays,\n  startAt: Row,\n  compare: Comparator,\n): Overlays {\n  const undefinedIfBeforeStartAt = (row: Row | undefined) =>\n    row === undefined || compare(row, startAt) < 0 ? undefined : row;\n  return {\n    add: undefinedIfBeforeStartAt(add),\n    remove: undefinedIfBeforeStartAt(remove),\n  };\n}\n\nexport {overlaysForConstraint as overlaysForConstraintForTest};\n\nfunction overlaysForConstraint(\n  {add, remove}: Overlays,\n  constraint: Constraint,\n): Overlays {\n  const undefinedIfDoesntMatchConstraint = (row: Row | undefined) =>\n    row === undefined || !constraintMatchesRow(constraint, row)\n      ? undefined\n      : row;\n\n  return {\n    add: undefinedIfDoesntMatchConstraint(add),\n    remove: undefinedIfDoesntMatchConstraint(remove),\n  };\n}\n\nfunction overlaysForFilterPredicate(\n  {add, remove}: Overlays,\n  filterPredicate: (row: Row) => boolean | undefined,\n): Overlays {\n  const undefinedIfDoesntMatchFilter = (row: Row | undefined) =>\n    row === undefined || !filterPredicate(row) ? undefined : row;\n\n  return {\n    add: undefinedIfDoesntMatchFilter(add),\n    remove: undefinedIfDoesntMatchFilter(remove),\n  };\n}\n\nexport function* generateWithOverlayInner(\n  rowIterator: Iterable<Row>,\n  overlays: Overlays,\n  compare: (r1: Row, r2: Row) => number,\n) {\n  let addOverlayYielded = false;\n  let removeOverlaySkipped = false;\n  for (const row of rowIterator) {\n    if (!addOverlayYielded && overlays.add) {\n      const cmp = compare(overlays.add, row);\n      if (cmp < 0) {\n        addOverlayYielded = true;\n        yield {row: overlays.add, relationships: {}};\n      }\n    }\n\n    if (!removeOverlaySkipped && overlays.remove) {\n      const cmp = compare(overlays.remove, row);\n      if (cmp === 0) {\n        removeOverlaySkipped = true;\n        continue;\n      }\n    }\n    yield {row, relationships: {}};\n  }\n\n  if (!addOverlayYielded && overlays.add) {\n    yield {row: overlays.add, relationships: {}};\n  }\n}\n\n/**\n * Like {@link generateWithOverlay} but for unordered streams.\n * No `startAt` or comparator needed. Injects remove/old-edit rows eagerly\n * at the start, and suppresses add/new-edit rows inline by PK match.\n */\nexport function* generateWithOverlayUnordered(\n  rows: Iterable<Row>,\n  constraint: Constraint | undefined,\n  overlay: Overlay | undefined,\n  lastPushedEpoch: number,\n  primaryKey: PrimaryKey,\n  filterPredicate?: (row: Row) => boolean,\n) {\n  let overlayToApply: Overlay | undefined = undefined;\n  if (overlay && lastPushedEpoch >= overlay.epoch) {\n    overlayToApply = overlay;\n  }\n  let overlays: Overlays = {add: undefined, remove: undefined};\n  switch (overlayToApply?.change.type) {\n    case 'add':\n      overlays = {add: overlayToApply.change.row, remove: undefined};\n      break;\n    case 'remove':\n      overlays = {add: undefined, remove: overlayToApply.change.row};\n      break;\n    case 'edit':\n      overlays = {\n        add: overlayToApply.change.row,\n        remove: overlayToApply.change.oldRow,\n      };\n      break;\n  }\n  if (constraint) {\n    overlays = overlaysForConstraint(overlays, constraint);\n  }\n  if (filterPredicate) {\n    overlays = overlaysForFilterPredicate(overlays, filterPredicate);\n  }\n  yield* generateWithOverlayInnerUnordered(rows, overlays, primaryKey);\n}\n\nexport function* generateWithOverlayInnerUnordered(\n  rowIterator: Iterable<Row>,\n  overlays: Overlays,\n  primaryKey: PrimaryKey,\n) {\n  // Eager inject: yield the add overlay at the start (row not yet in storage)\n  if (overlays.add) {\n    yield {row: overlays.add, relationships: {}};\n  }\n  // Stream with inline suppress: skip the remove overlay (row still in storage)\n  let removeSkipped = false;\n  for (const row of rowIterator) {\n    if (\n      !removeSkipped &&\n      overlays.remove &&\n      rowMatchesPK(overlays.remove, row, primaryKey)\n    ) {\n      removeSkipped = true;\n      continue;\n    }\n    yield {row, relationships: {}};\n  }\n}\n\nfunction rowMatchesPK(a: Row, b: Row, primaryKey: PrimaryKey): boolean {\n  for (const key of primaryKey) {\n    if (!valuesEqual(a[key], b[key])) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * A location to begin scanning an index from. Can either be a specific value\n * or the min or max possible value for the type. This is used to start a scan\n * at the beginning of the rows matching a constraint.\n */\ntype Bound = Value | MinValue | MaxValue;\ntype RowBound = Record<string, Bound>;\nconst minValue = Symbol('min-value');\ntype MinValue = typeof minValue;\nconst maxValue = Symbol('max-value');\ntype MaxValue = typeof maxValue;\n\nfunction makeBoundComparator(sort: Ordering) {\n  return (a: RowBound, b: RowBound) => {\n    // Hot! Do not use destructuring\n    for (const entry of sort) {\n      const key = entry[0];\n      const cmp = compareBounds(a[key], b[key]);\n      if (cmp !== 0) {\n        return entry[1] === 'asc' ? cmp : -cmp;\n      }\n    }\n    return 0;\n  };\n}\n\nfunction compareBounds(a: Bound, b: Bound): number {\n  if (a === b) {\n    return 0;\n  }\n  if (a === minValue) {\n    return -1;\n  }\n  if (b === minValue) {\n    return 1;\n  }\n  if (a === maxValue) {\n    return 1;\n  }\n  if (b === maxValue) {\n    return -1;\n  }\n  return compareValues(a, b);\n}\n\nfunction* generateRows(\n  data: BTreeSet<Row>,\n  scanStart: RowBound | undefined,\n  reverse: boolean | undefined,\n) {\n  yield* data[reverse ? 'valuesFromReversed' : 'valuesFrom'](\n    scanStart as Row | undefined,\n  );\n}\n\nexport function stringify(change: SourceChange) {\n  return JSON.stringify(change, (_, v) =>\n    typeof v === 'bigint' ? v.toString() : v,\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AA4FA,IAAa,eAAb,MAAa,aAA+B;CAC1C;CACA;CACA;CACA;CACA,2BAAwC,IAAI,KAAK;CACjD,eAAsC,EAAE;CAExC;CACA,aAAa;CAEb,YACE,WACA,SACA,YACA,kBACA;AACA,QAAA,YAAkB;AAClB,QAAA,UAAgB;AAChB,QAAA,aAAmB;AACnB,QAAA,mBAAyB,WAAW,KAAI,MAAK,CAAC,GAAG,MAAM,CAAC;EACxD,MAAM,aAAa,oBAAoB,MAAA,iBAAuB;AAC9D,QAAA,QAAc,IAAI,KAAK,UAAU,MAAA,iBAAuB,EAAE;GACxD;GACA,MAAM,oBAAoB,IAAI,SAAc,WAAW;GACvD,wBAAQ,IAAI,KAAK;GAClB,CAAC;;CAGJ,IAAI,cAAc;AAChB,SAAO;GACL,MAAM,MAAA;GACN,SAAS,MAAA;GACT,YAAY,MAAA;GACb;;CAGH,OAAO;EACL,MAAM,eAAe,MAAA,iBAAuB;AAC5C,SAAO,IAAI,aACT,MAAA,WACA,MAAA,SACA,MAAA,YACA,aAAa,KAAK,OAAO,CAC1B;;CAGH,IAAI,OAAsB;AACxB,SAAO,MAAA,iBAAuB,CAAC;;CAGjC,WAAW,YAAwB,WAAkC;AACnE,SAAO;GACL,WAAW,MAAA;GACX,SAAS,MAAA;GACT,YAAY,MAAA;GACZ,MAAM,YAAY,KAAA,IAAY,WAAW;GACzC,QAAQ;GACR,eAAe,EAAE;GACjB,UAAU;GACV,aAAa,WAAW;GACzB;;CAGH,QACE,MACA,SACA,eACa;EACb,MAAM,qBAAqB,iBAAiB,QAAQ;EACpD,MAAM,YAAY,SAAS,KAAA;EAC3B,MAAM,eAAe,QAAQ,MAAA;EAE7B,MAAM,QAAqB;GACzB,iBAAiB;GACjB,QAAO,QAAO,MAAA,MAAY,KAAK,WAAW;GAC1C,YAAW,WAAU;AACnB,eAAW,SAAS;;GAEtB,eAAe;AACb,UAAA,WAAiB,MAAM;;GAEzB,qBAAqB,CAAC,mBAAmB;GAC1C;EAED,MAAM,aAAyB;GAC7B;GACA,QAAQ,KAAA;GACR,MAAM;GACN;GACA,aAAa,eAAe,aAAa;GACzC,SAAS,mBAAmB,UACxB;IACE,WAAW,mBAAmB;IAC9B,WAAW,gBAAgB,mBAAmB,QAAQ;IACvD,GACD,KAAA;GACJ,iBAAiB;GAClB;EACD,MAAM,SAAS,MAAA,UAAgB,YAAY,UAAU;AACrD,MAAI,CAAC,UACH,0BAAyB,cAAc,MAAA,WAAiB;AAE1D,QAAA,YAAkB,KAAK,WAAW;AAClC,SAAO;;CAGT,YAAY,OAAoB;EAC9B,MAAM,MAAM,MAAA,YAAkB,WAAU,MAAK,EAAE,UAAU,MAAM;AAC/D,SAAO,QAAQ,IAAI,uBAAuB;AAC1C,QAAA,YAAkB,OAAO,KAAK,EAAE;;CAWlC,mBAA0B;EACxB,MAAM,QAAQ,MAAA,QAAc,IAAI,KAAK,UAAU,MAAA,iBAAuB,CAAC;AACvE,SAAO,OAAO,0BAA0B;AACxC,SAAO;;CAGT,kBAAkB,MAAgB,QAA2B;EAC3D,MAAM,MAAM,KAAK,UAAU,KAAK;EAChC,MAAM,QAAQ,MAAA,QAAc,IAAI,IAAI;AAGpC,MAAI,OAAO;AACT,SAAM,OAAO,IAAI,OAAO;AACxB,UAAO;;EAGT,MAAM,aAAa,oBAAoB,KAAK;EAS5C,MAAM,OAAO,IAAI,SAAc,WAAW;AAI1C,OAAK,MAAM,OAAO,MAAA,iBAAuB,CAAC,KACxC,MAAK,IAAI,IAAI;EAGf,MAAM,WAAW;GAAC;GAAY;GAAM,QAAQ,IAAI,IAAI,CAAC,OAAO,CAAC;GAAC;AAC9D,QAAA,QAAc,IAAI,KAAK,SAAS;AAChC,SAAO;;CAIT,eAAyB;AACvB,SAAO,CAAC,GAAG,MAAA,QAAc,MAAM,CAAC;;CAGlC,EAAA,MAAQ,KAAmB,MAA0C;EACnE,MAAM,gBAAgB,KAAK,KAAK,KAAK;EACrC,MAAM,EAAC,gBAAe;EAEtB,MAAM,uBAAmC,IAAI,WACxC,IAAI,OAAO,YAAY,IAAI,GAAG,GAC/B;EAEJ,MAAM,eAAe,gCACnB,KAAK,SAAS,WACd,MAAA,WACD;EAGD,MAAM,sBAAsB,gBAAgB,IAAI;EAGhD,MAAM,YAAyB,EAAE;AACjC,MAAI,oBACF,MAAK,MAAM,OAAO,OAAO,KAAK,oBAAoB,CAChD,WAAU,KAAK,CAAC,KAAK,MAAM,CAAC;AAOhC,MACE,MAAA,WAAiB,SAAS,KAC1B,CAAC,uBACD,CAAC,4BAA4B,qBAAqB,MAAA,WAAiB,CAEnE,WAAU,KAAK,GAAG,cAAc;EAIlC,MAAM,EAAC,MAAM,YAAY,YADX,MAAA,iBAAuB,WAAW,KAAK;EAGrD,MAAM,kBAA8B,IAAI,WACnC,IAAI,OAAO,QAAQ,IAAI,GAAG,GAC3B;EAEJ,MAAM,UAAU,IAAI,OAAO;EAY3B,IAAI;AAEJ,MAAI,qBAAqB;AACvB,eAAY,EAAE;AACd,QAAK,MAAM,CAAC,KAAK,QAAQ,UACvB,KAAI,OAAO,qBAAqB,IAAI,CAClC,WAAU,OAAO,oBAAoB;YAEjC,IAAI,QACN,WAAU,OAAO,QAAQ,QAAQ,WAAW;OAE5C,WAAU,OAAO,QAAQ,QAAQ,WAAW;QAKlD,aAAY;EAGd,MAAM,eAAe,aAAa,MAAM,WAAW,IAAI,QAAQ;EAuB/D,MAAM,iBAAiB,uBACrB,WACE,kBAxBgB,oBAClB,SACA,eAAe,KAAK,aAAa,GAAG,cAIpC,IAAI,YACJ,MAAA,SACA,KAAK,iBAUL,iBACA,KAAK,SAAS,UACf,EAIkC,IAAI,OAAO,qBAAqB,CAChE,EAGD,IAAI,WACL;AAED,SAAO,KAAK,UACR,mBAAmB,gBAAgB,KAAK,QAAQ,UAAU,GAC1D;;CAGN,CAAC,KAAK,QAAuC;AAC3C,OAAK,MAAM,UAAU,KAAK,QAAQ,OAAO,CACvC,KAAI,WAAW,QACb,OAAM;;CAKZ,CAAC,QAAQ,QAAsB;EAE7B,MAAM,EAAC,SADc,MAAA,iBAAuB;EAE5C,MAAM,UAAU,QAAa,KAAK,IAAI,IAAI;EAC1C,MAAM,cAAc,MAA4B,MAAA,UAAgB;EAChE,MAAM,eAAe,MAAoB,MAAA,YAAkB,EAAE;AAC7D,SAAO,6BACL,MAAA,aACA,QACA,QACA,YACA,mBACM,EAAE,MAAA,UACT;;CAGH,aAAa,QAAsB;AACjC,OAAK,MAAM,EAAC,UAAS,MAAA,QAAc,QAAQ,CACzC,SAAQ,OAAO,MAAf;GACE,KAAK;AAGH,WAFc,KAAK,IAAI,OAAO,IAAI,EAIhC,yEACD;AACD;GAEF,KAAK;AAGH,WAFgB,KAAK,OAAO,OAAO,IAAI,EAIrC,4EACD;AACD;GAEF,KAAK;AAOH,WAFgB,KAAK,OAAO,OAAO,OAAO,EAIxC,iFACD;AACD,SAAK,IAAI,OAAO,IAAI;AACpB;GAEF,QACE,aAAY,OAAO;;;;AAM7B,UAAU,uBACR,IACA,YACA;AACA,MAAK,MAAM,QAAQ,IAAI;AACrB,MAAI,cAAc,CAAC,qBAAqB,YAAY,KAAK,IAAI,CAC3D;AAEF,QAAM;;;AAIV,UAAU,mBAAmB,IAAkB,QAA+B;AAC5E,MAAK,MAAM,QAAQ,GACjB,KAAI,OAAO,KAAK,IAAI,CAClB,OAAM;;AAKZ,UAAiB,6BACf,aACA,QACA,QACA,YACA,aACA,cACA;CACA,IAAI,kBAAkB;AACtB,KAAI,OAAO,SAAS;OACb,MAAM,EAAC,mBAAkB,YAC5B,KAAI;QACG,MAAM,OAAO,cAChB,KAAI,CAAC,YAAY,OAAO,IAAI,MAAM,OAAO,OAAO,KAAK,EAAE;AACrD,sBAAkB;AAClB;;;;AAOV,KAAI,OAAO,SAAS,UAAU,iBAAiB;AAC7C,SAAO,gBACL,aACA;GACE,MAAM;GACN,KAAK,OAAO;GACb,EACD,QACA,YACA,aACA,cAAc,CACf;AACD,SAAO,gBACL,aACA;GACE,MAAM;GACN,KAAK,OAAO;GACb,EACD,QACA,YACA,aACA,cAAc,CACf;OAED,QAAO,gBACL,aACA,QACA,QACA,YACA,aACA,cAAc,CACf;;AAIL,UAAU,gBACR,aACA,QACA,QACA,YACA,aACA,WACA;AACA,MAAK,MAAM,KAAK,QAAQ,aAAa,QAAQ,QAAQ,YAAY,UAAU,CACzE,OAAM;AAER,aAAY,OAAO;;AAGrB,UAAU,QACR,aACA,QACA,QACA,YACA,WACA;AACA,SAAQ,OAAO,MAAf;EACE,KAAK;AACH,UACE,CAAC,OAAO,OAAO,IAAI,QACb,sBAAsB,UAAU,OAAO,GAC9C;AACD;EACF,KAAK;AACH,UAAO,OAAO,OAAO,IAAI,QAAQ,iBAAiB,UAAU,OAAO,GAAG;AACtE;EACF,KAAK;AACH,UAAO,OAAO,OAAO,OAAO,QAAQ,iBAAiB,UAAU,OAAO,GAAG;AACzE;EACF,QACE,aAAY,OAAO;;AAGvB,MAAK,MAAM,QAAQ,aAAa;EAC9B,MAAM,EAAC,QAAQ,SAAS,UAAS;AACjC,MAAI,QAAQ;AACV,QAAK,kBAAkB;AACvB,cAAW;IAAC,OAAO;IAAW;IAAO,CAAC;AAqBtC,UAAO,WAnBL,OAAO,SAAS,SACZ;IACE,MAAM,OAAO;IACb,SAAS;KACP,KAAK,OAAO;KACZ,eAAe,EAAE;KAClB;IACD,MAAM;KACJ,KAAK,OAAO;KACZ,eAAe,EAAE;KAClB;IACF,GACD;IACE,MAAM,OAAO;IACb,MAAM;KACJ,KAAK,OAAO;KACZ,eAAe,EAAE;KAClB;IACF,EACyB,QAAQ,OAAO,SAAS,UAAU;AAClE,SAAM,KAAA;;;AAIV,YAAW,KAAA,EAAU;;AAGvB,UAAiB,kBACf,OACA,OACA,SACwB;AACxB,KAAI,CAAC,OAAO;AACV,SAAO;AACP;;CAEF,IAAI,UAAU;AACd,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,SAAS,SAAS;AACpB,SAAM;AACN;;AAEF,MAAI,CAAC;OACC,MAAM,UAAU;QACd,QAAQ,KAAK,KAAK,MAAM,IAAI,IAAI,EAClC,WAAU;cAEH,MAAM,UAAU;QACrB,QAAQ,KAAK,KAAK,MAAM,IAAI,GAAG,EACjC,WAAU;;;AAIhB,MAAI,QACF,OAAM;;;;;;;;;;;;;;;AAiBZ,UAAiB,oBACf,SACA,MACA,YACA,SACA,iBACA,SACA,iBACA;CACA,IAAI,iBAAsC,KAAA;AAC1C,KAAI,WAAW,mBAAmB,QAAQ,MACxC,kBAAiB;AASnB,QAAO,yBAAyB,MAPf,gBACf,SACA,YACA,gBACA,SACA,gBACD,EAC+C,QAAQ;;AAG1D,SAAS,gBACP,SACA,YACA,SACA,SACA,iBACU;CACV,IAAI,WAAqB;EACvB,KAAK,KAAA;EACL,QAAQ,KAAA;EACT;AACD,SAAQ,SAAS,OAAO,MAAxB;EACE,KAAK;AACH,cAAW;IACT,KAAK,QAAQ,OAAO;IACpB,QAAQ,KAAA;IACT;AACD;EACF,KAAK;AACH,cAAW;IACT,KAAK,KAAA;IACL,QAAQ,QAAQ,OAAO;IACxB;AACD;EACF,KAAK;AACH,cAAW;IACT,KAAK,QAAQ,OAAO;IACpB,QAAQ,QAAQ,OAAO;IACxB;AACD;;AAGJ,KAAI,QACF,YAAW,mBAAmB,UAAU,SAAS,QAAQ;AAG3D,KAAI,WACF,YAAW,sBAAsB,UAAU,WAAW;AAGxD,KAAI,gBACF,YAAW,2BAA2B,UAAU,gBAAgB;AAGlE,QAAO;;AAKT,SAAS,mBACP,EAAC,KAAK,UACN,SACA,SACU;CACV,MAAM,4BAA4B,QAChC,QAAQ,KAAA,KAAa,QAAQ,KAAK,QAAQ,GAAG,IAAI,KAAA,IAAY;AAC/D,QAAO;EACL,KAAK,yBAAyB,IAAI;EAClC,QAAQ,yBAAyB,OAAO;EACzC;;AAKH,SAAS,sBACP,EAAC,KAAK,UACN,YACU;CACV,MAAM,oCAAoC,QACxC,QAAQ,KAAA,KAAa,CAAC,qBAAqB,YAAY,IAAI,GACvD,KAAA,IACA;AAEN,QAAO;EACL,KAAK,iCAAiC,IAAI;EAC1C,QAAQ,iCAAiC,OAAO;EACjD;;AAGH,SAAS,2BACP,EAAC,KAAK,UACN,iBACU;CACV,MAAM,gCAAgC,QACpC,QAAQ,KAAA,KAAa,CAAC,gBAAgB,IAAI,GAAG,KAAA,IAAY;AAE3D,QAAO;EACL,KAAK,6BAA6B,IAAI;EACtC,QAAQ,6BAA6B,OAAO;EAC7C;;AAGH,UAAiB,yBACf,aACA,UACA,SACA;CACA,IAAI,oBAAoB;CACxB,IAAI,uBAAuB;AAC3B,MAAK,MAAM,OAAO,aAAa;AAC7B,MAAI,CAAC,qBAAqB,SAAS;OACrB,QAAQ,SAAS,KAAK,IAAI,GAC5B,GAAG;AACX,wBAAoB;AACpB,UAAM;KAAC,KAAK,SAAS;KAAK,eAAe,EAAE;KAAC;;;AAIhD,MAAI,CAAC,wBAAwB,SAAS;OACxB,QAAQ,SAAS,QAAQ,IAAI,KAC7B,GAAG;AACb,2BAAuB;AACvB;;;AAGJ,QAAM;GAAC;GAAK,eAAe,EAAE;GAAC;;AAGhC,KAAI,CAAC,qBAAqB,SAAS,IACjC,OAAM;EAAC,KAAK,SAAS;EAAK,eAAe,EAAE;EAAC;;;;;;;AAShD,UAAiB,6BACf,MACA,YACA,SACA,iBACA,YACA,iBACA;CACA,IAAI,iBAAsC,KAAA;AAC1C,KAAI,WAAW,mBAAmB,QAAQ,MACxC,kBAAiB;CAEnB,IAAI,WAAqB;EAAC,KAAK,KAAA;EAAW,QAAQ,KAAA;EAAU;AAC5D,SAAQ,gBAAgB,OAAO,MAA/B;EACE,KAAK;AACH,cAAW;IAAC,KAAK,eAAe,OAAO;IAAK,QAAQ,KAAA;IAAU;AAC9D;EACF,KAAK;AACH,cAAW;IAAC,KAAK,KAAA;IAAW,QAAQ,eAAe,OAAO;IAAI;AAC9D;EACF,KAAK;AACH,cAAW;IACT,KAAK,eAAe,OAAO;IAC3B,QAAQ,eAAe,OAAO;IAC/B;AACD;;AAEJ,KAAI,WACF,YAAW,sBAAsB,UAAU,WAAW;AAExD,KAAI,gBACF,YAAW,2BAA2B,UAAU,gBAAgB;AAElE,QAAO,kCAAkC,MAAM,UAAU,WAAW;;AAGtE,UAAiB,kCACf,aACA,UACA,YACA;AAEA,KAAI,SAAS,IACX,OAAM;EAAC,KAAK,SAAS;EAAK,eAAe,EAAE;EAAC;CAG9C,IAAI,gBAAgB;AACpB,MAAK,MAAM,OAAO,aAAa;AAC7B,MACE,CAAC,iBACD,SAAS,UACT,aAAa,SAAS,QAAQ,KAAK,WAAW,EAC9C;AACA,mBAAgB;AAChB;;AAEF,QAAM;GAAC;GAAK,eAAe,EAAE;GAAC;;;AAIlC,SAAS,aAAa,GAAQ,GAAQ,YAAiC;AACrE,MAAK,MAAM,OAAO,WAChB,KAAI,CAAC,YAAY,EAAE,MAAM,EAAE,KAAK,CAC9B,QAAO;AAGX,QAAO;;AAUT,IAAM,WAAW,OAAO,YAAY;AAEpC,IAAM,WAAW,OAAO,YAAY;AAGpC,SAAS,oBAAoB,MAAgB;AAC3C,SAAQ,GAAa,MAAgB;AAEnC,OAAK,MAAM,SAAS,MAAM;GACxB,MAAM,MAAM,MAAM;GAClB,MAAM,MAAM,cAAc,EAAE,MAAM,EAAE,KAAK;AACzC,OAAI,QAAQ,EACV,QAAO,MAAM,OAAO,QAAQ,MAAM,CAAC;;AAGvC,SAAO;;;AAIX,SAAS,cAAc,GAAU,GAAkB;AACjD,KAAI,MAAM,EACR,QAAO;AAET,KAAI,MAAM,SACR,QAAO;AAET,KAAI,MAAM,SACR,QAAO;AAET,KAAI,MAAM,SACR,QAAO;AAET,KAAI,MAAM,SACR,QAAO;AAET,QAAO,cAAc,GAAG,EAAE;;AAG5B,UAAU,aACR,MACA,WACA,SACA;AACA,QAAO,KAAK,UAAU,uBAAuB,cAC3C,UACD;;AAGH,SAAgB,UAAU,QAAsB;AAC9C,QAAO,KAAK,UAAU,SAAS,GAAG,MAChC,OAAO,MAAM,WAAW,EAAE,UAAU,GAAG,EACxC"}
+{"version":3,"file":"memory-source.js","names":["#tableName","#columns","#primaryKey","#primaryIndexSort","#indexes","#connections","#getPrimaryIndex","#fetch","#disconnect","#getSchema","#getOrCreateIndex","#overlay","#writeChange","#pushEpoch"],"sources":["../../../../../zql/src/ivm/memory-source.ts"],"sourcesContent":["import {assert, unreachable} from '../../../shared/src/asserts.ts';\nimport {BTreeSet} from '../../../shared/src/btree-set.ts';\nimport {hasOwn} from '../../../shared/src/has-own.ts';\nimport {once} from '../../../shared/src/iterables.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {\n  Condition,\n  Ordering,\n  OrderPart,\n} from '../../../zero-protocol/src/ast.ts';\nimport type {Row, Value} from '../../../zero-protocol/src/data.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\nimport type {SchemaValue} from '../../../zero-types/src/schema-value.ts';\nimport type {DebugDelegate} from '../builder/debug-delegate.ts';\nimport {\n  createPredicate,\n  transformFilters,\n  type NoSubqueryCondition,\n} from '../builder/filter.ts';\nimport {assertOrderingIncludesPK} from '../query/complete-ordering.ts';\nimport type {Change} from './change.ts';\nimport {\n  constraintMatchesPrimaryKey,\n  constraintMatchesRow,\n  primaryKeyConstraintFromFilters,\n  type Constraint,\n} from './constraint.ts';\nimport {\n  compareValues,\n  makeComparator,\n  valuesEqual,\n  type Comparator,\n  type Node,\n} from './data.ts';\nimport {filterPush} from './filter-push.ts';\nimport {\n  skipYields,\n  type FetchRequest,\n  type Input,\n  type Output,\n  type Start,\n} from './operator.ts';\nimport type {SourceSchema} from './schema.ts';\nimport type {\n  Source,\n  SourceChange,\n  SourceChangeAdd,\n  SourceChangeEdit,\n  SourceChangeRemove,\n  SourceInput,\n} from './source.ts';\nimport type {Stream} from './stream.ts';\n\nexport type Overlay = {\n  epoch: number;\n  change: SourceChange;\n};\n\nexport type Overlays = {\n  add: Row | undefined;\n  remove: Row | undefined;\n};\n\ntype Index = {\n  comparator: Comparator;\n  data: BTreeSet<Row>;\n  usedBy: Set<Connection>;\n};\n\nexport type Connection = {\n  input: Input;\n  output: Output | undefined;\n  sort?: Ordering | undefined;\n  splitEditKeys: Set<string> | undefined;\n  compareRows: Comparator;\n  filters:\n    | {\n        condition: NoSubqueryCondition;\n        predicate: (row: Row) => boolean;\n      }\n    | undefined;\n  readonly debug?: DebugDelegate | undefined;\n  lastPushedEpoch: number;\n};\n\n/**\n * A `MemorySource` is a source that provides data to the pipeline from an\n * in-memory data source.\n *\n * This data is kept in sorted order as downstream pipelines will always expect\n * the data they receive from `pull` to be in sorted order.\n */\nexport class MemorySource implements Source {\n  readonly #tableName: string;\n  readonly #columns: Record<string, SchemaValue>;\n  readonly #primaryKey: PrimaryKey;\n  readonly #primaryIndexSort: Ordering;\n  readonly #indexes: Map<string, Index> = new Map();\n  readonly #connections: Connection[] = [];\n\n  #overlay: Overlay | undefined;\n  #pushEpoch = 0;\n\n  constructor(\n    tableName: string,\n    columns: Record<string, SchemaValue>,\n    primaryKey: PrimaryKey,\n    primaryIndexData?: BTreeSet<Row>,\n  ) {\n    this.#tableName = tableName;\n    this.#columns = columns;\n    this.#primaryKey = primaryKey;\n    this.#primaryIndexSort = primaryKey.map(k => [k, 'asc']);\n    const comparator = makeBoundComparator(this.#primaryIndexSort);\n    this.#indexes.set(JSON.stringify(this.#primaryIndexSort), {\n      comparator,\n      data: primaryIndexData ?? new BTreeSet<Row>(comparator),\n      usedBy: new Set(),\n    });\n  }\n\n  get tableSchema() {\n    return {\n      name: this.#tableName,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n    };\n  }\n\n  fork() {\n    const primaryIndex = this.#getPrimaryIndex();\n    return new MemorySource(\n      this.#tableName,\n      this.#columns,\n      this.#primaryKey,\n      primaryIndex.data.clone(),\n    );\n  }\n\n  get data(): BTreeSet<Row> {\n    return this.#getPrimaryIndex().data;\n  }\n\n  #getSchema(connection: Connection, unordered: boolean): SourceSchema {\n    return {\n      tableName: this.#tableName,\n      columns: this.#columns,\n      primaryKey: this.#primaryKey,\n      sort: unordered ? undefined : connection.sort,\n      system: 'client',\n      relationships: {},\n      isHidden: false,\n      compareRows: connection.compareRows,\n    };\n  }\n\n  connect(\n    sort: Ordering | undefined,\n    filters?: Condition,\n    splitEditKeys?: Set<string>,\n  ): SourceInput {\n    const transformedFilters = transformFilters(filters);\n    const unordered = sort === undefined;\n    const internalSort = sort ?? this.#primaryIndexSort;\n\n    const input: SourceInput = {\n      getSchema: () => schema,\n      fetch: req => this.#fetch(req, connection),\n      setOutput: output => {\n        connection.output = output;\n      },\n      destroy: () => {\n        this.#disconnect(input);\n      },\n      fullyAppliedFilters: !transformedFilters.conditionsRemoved,\n    };\n\n    const connection: Connection = {\n      input,\n      output: undefined,\n      sort: internalSort,\n      splitEditKeys,\n      compareRows: makeComparator(internalSort),\n      filters: transformedFilters.filters\n        ? {\n            condition: transformedFilters.filters,\n            predicate: createPredicate(transformedFilters.filters),\n          }\n        : undefined,\n      lastPushedEpoch: 0,\n    };\n    const schema = this.#getSchema(connection, unordered);\n    if (!unordered) {\n      assertOrderingIncludesPK(internalSort, this.#primaryKey);\n    }\n    this.#connections.push(connection);\n    return input;\n  }\n\n  #disconnect(input: Input): void {\n    const idx = this.#connections.findIndex(c => c.input === input);\n    assert(idx !== -1, 'Connection not found');\n    this.#connections.splice(idx, 1);\n\n    // TODO: We used to delete unused indexes here. But in common cases like\n    // navigating into issue detail pages it caused a ton of constantly\n    // building and destroying indexes.\n    //\n    // Perhaps some intelligent LRU or something is needed here but for now,\n    // the opposite extreme of keeping all indexes for the lifetime of the\n    // page seems better.\n  }\n\n  #getPrimaryIndex(): Index {\n    const index = this.#indexes.get(JSON.stringify(this.#primaryIndexSort));\n    assert(index, 'Primary index not found');\n    return index;\n  }\n\n  #getOrCreateIndex(sort: Ordering, usedBy: Connection): Index {\n    const key = JSON.stringify(sort);\n    const index = this.#indexes.get(key);\n    // Future optimization could use existing index if it's the same just sorted\n    // in reverse of needed.\n    if (index) {\n      index.usedBy.add(usedBy);\n      return index;\n    }\n\n    const comparator = makeBoundComparator(sort);\n\n    // When creating these synchronously becomes a problem, a few options:\n    // 1. Allow users to specify needed indexes up front\n    // 2. Create indexes in a different thread asynchronously (this would require\n    // modifying the BTree to be able to be passed over structured-clone, or using\n    // a different library.)\n    // 3. We could even theoretically do (2) on multiple threads and then merge the\n    // results!\n    const data = new BTreeSet<Row>(comparator);\n\n    // I checked, there's no special path for adding data in bulk faster.\n    // The constructor takes an array, but it just calls add/set over and over.\n    for (const row of this.#getPrimaryIndex().data) {\n      data.add(row);\n    }\n\n    const newIndex = {comparator, data, usedBy: new Set([usedBy])};\n    this.#indexes.set(key, newIndex);\n    return newIndex;\n  }\n\n  // For unit testing that we correctly clean up indexes.\n  getIndexKeys(): string[] {\n    return [...this.#indexes.keys()];\n  }\n\n  *#fetch(req: FetchRequest, conn: Connection): Stream<Node | 'yield'> {\n    const requestedSort = must(conn.sort);\n    const {compareRows} = conn;\n    // Avoid allocating a new closure when not reversing (the common case).\n    const connectionComparator: Comparator = req.reverse\n      ? (r1, r2) => compareRows(r2, r1)\n      : compareRows;\n\n    const pkConstraint = primaryKeyConstraintFromFilters(\n      conn.filters?.condition,\n      this.#primaryKey,\n    );\n    // The primary key constraint will be more limiting than the constraint\n    // so swap out to that if it exists.\n    const fetchOrPkConstraint = pkConstraint ?? req.constraint;\n\n    // If there is a constraint, we need an index sorted by it first.\n    const indexSort: OrderPart[] = [];\n    if (fetchOrPkConstraint) {\n      for (const key of Object.keys(fetchOrPkConstraint)) {\n        indexSort.push([key, 'asc']);\n      }\n    }\n\n    // For the special case of constraining by PK, we don't need to worry about\n    // any requested sort since there can only be one result. Otherwise we also\n    // need the index sorted by the requested sort.\n    if (\n      this.#primaryKey.length > 1 ||\n      !fetchOrPkConstraint ||\n      !constraintMatchesPrimaryKey(fetchOrPkConstraint, this.#primaryKey)\n    ) {\n      indexSort.push(...requestedSort);\n    }\n\n    const index = this.#getOrCreateIndex(indexSort, conn);\n    const {data, comparator: compare} = index;\n    // Avoid allocating a new closure when not reversing (the common case).\n    const indexComparator: Comparator = req.reverse\n      ? (r1, r2) => compare(r2, r1)\n      : compare;\n\n    const startAt = req.start?.row;\n\n    // If there is a constraint, we want to start our scan at the first row that\n    // matches the constraint. But because the next OrderPart can be `desc`,\n    // it's not true that {[constraintKey]: constraintValue} is the first\n    // matching row. Because in that case, the other fields will all be\n    // `undefined`, and in Zero `undefined` is always less than any other value.\n    // So if the second OrderPart is descending then `undefined` values will\n    // actually be the *last* row. We need a way to stay \"start at the first row\n    // with this constraint value\". RowBound with the corresponding compareBound\n    // comparator accomplishes this. The right thing is probably to teach the\n    // btree library to support this concept.\n    let scanStart: RowBound | undefined;\n\n    if (fetchOrPkConstraint) {\n      scanStart = {};\n      for (const [key, dir] of indexSort) {\n        if (hasOwn(fetchOrPkConstraint, key)) {\n          scanStart[key] = fetchOrPkConstraint[key];\n        } else {\n          if (req.reverse) {\n            scanStart[key] = dir === 'asc' ? maxValue : minValue;\n          } else {\n            scanStart[key] = dir === 'asc' ? minValue : maxValue;\n          }\n        }\n      }\n    } else {\n      scanStart = startAt;\n    }\n\n    const rowsIterable = generateRows(data, scanStart, req.reverse);\n    const withOverlay = generateWithOverlay(\n      startAt,\n      pkConstraint ? once(rowsIterable) : rowsIterable,\n      // use `req.constraint` here and not `fetchOrPkConstraint` since `fetchOrPkConstraint` could be the\n      // primary key constraint. The primary key constraint comes from filters and is acting as a filter\n      // rather than as the fetch constraint.\n      req.constraint,\n      this.#overlay,\n      conn.lastPushedEpoch,\n      // Use indexComparator, generateWithOverlayInner has a subtle dependency\n      // on this.  Since generateWithConstraint is done after\n      // generateWithOverlay, the generator consumed by generateWithOverlayInner\n      // does not end when the constraint stops matching and so the final\n      // check to yield an add overlay if not yet yielded is not reached.\n      // However, using the indexComparator the add overlay will be less than\n      // the first row that does not match the constraint, and so any\n      // not yet yielded add overlay will be yielded when the first row\n      // not matching the constraint is reached.\n      indexComparator,\n      conn.filters?.predicate,\n    );\n\n    const withConstraint = generateWithConstraint(\n      skipYields(\n        generateWithStart(withOverlay, req.start, connectionComparator),\n      ),\n      // we use `req.constraint` and not `fetchOrPkConstraint` here because we need to\n      // AND the constraint with what could have been the primary key constraint\n      req.constraint,\n    );\n\n    yield* conn.filters\n      ? generateWithFilter(withConstraint, conn.filters.predicate)\n      : withConstraint;\n  }\n\n  *push(change: SourceChange): Stream<'yield'> {\n    for (const result of this.genPush(change)) {\n      if (result === 'yield') {\n        yield result;\n      }\n    }\n  }\n\n  *genPush(change: SourceChange) {\n    const primaryIndex = this.#getPrimaryIndex();\n    const {data} = primaryIndex;\n    const exists = (row: Row) => data.has(row);\n    const setOverlay = (o: Overlay | undefined) => (this.#overlay = o);\n    const writeChange = (c: SourceChange) => this.#writeChange(c);\n    yield* genPushAndWriteWithSplitEdit(\n      this.#connections,\n      change,\n      exists,\n      setOverlay,\n      writeChange,\n      () => ++this.#pushEpoch,\n    );\n  }\n\n  #writeChange(change: SourceChange) {\n    for (const {data} of this.#indexes.values()) {\n      switch (change.type) {\n        case 'add': {\n          const added = data.add(change.row);\n          // must succeed since we checked has() above.\n          assert(\n            added,\n            'MemorySource: add must succeed since row existence was already checked',\n          );\n          break;\n        }\n        case 'remove': {\n          const removed = data.delete(change.row);\n          // must succeed since we checked has() above.\n          assert(\n            removed,\n            'MemorySource: remove must succeed since row existence was already checked',\n          );\n          break;\n        }\n        case 'edit': {\n          // TODO: We could see if the PK (form the index tree's perspective)\n          // changed and if not we could use set.\n          // We cannot just do `set` with the new value since the `oldRow` might\n          // not map to the same entry as the new `row` in the index btree.\n          const removed = data.delete(change.oldRow);\n          // must succeed since we checked has() above.\n          assert(\n            removed,\n            'MemorySource: edit remove must succeed since row existence was already checked',\n          );\n          data.add(change.row);\n          break;\n        }\n        default:\n          unreachable(change);\n      }\n    }\n  }\n}\n\nfunction* generateWithConstraint(\n  it: Stream<Node>,\n  constraint: Constraint | undefined,\n) {\n  for (const node of it) {\n    if (constraint && !constraintMatchesRow(constraint, node.row)) {\n      break;\n    }\n    yield node;\n  }\n}\n\nfunction* generateWithFilter(it: Stream<Node>, filter: (row: Row) => boolean) {\n  for (const node of it) {\n    if (filter(node.row)) {\n      yield node;\n    }\n  }\n}\n\nexport function* genPushAndWriteWithSplitEdit(\n  connections: readonly Connection[],\n  change: SourceChange,\n  exists: (row: Row) => boolean,\n  setOverlay: (o: Overlay | undefined) => Overlay | undefined,\n  writeChange: (c: SourceChange) => void,\n  getNextEpoch: () => number,\n) {\n  let shouldSplitEdit = false;\n  if (change.type === 'edit') {\n    for (const {splitEditKeys} of connections) {\n      if (splitEditKeys) {\n        for (const key of splitEditKeys) {\n          if (!valuesEqual(change.row[key], change.oldRow[key])) {\n            shouldSplitEdit = true;\n            break;\n          }\n        }\n      }\n    }\n  }\n\n  if (change.type === 'edit' && shouldSplitEdit) {\n    yield* genPushAndWrite(\n      connections,\n      {\n        type: 'remove',\n        row: change.oldRow,\n      },\n      exists,\n      setOverlay,\n      writeChange,\n      getNextEpoch(),\n    );\n    yield* genPushAndWrite(\n      connections,\n      {\n        type: 'add',\n        row: change.row,\n      },\n      exists,\n      setOverlay,\n      writeChange,\n      getNextEpoch(),\n    );\n  } else {\n    yield* genPushAndWrite(\n      connections,\n      change,\n      exists,\n      setOverlay,\n      writeChange,\n      getNextEpoch(),\n    );\n  }\n}\n\nfunction* genPushAndWrite(\n  connections: readonly Connection[],\n  change: SourceChangeAdd | SourceChangeRemove | SourceChangeEdit,\n  exists: (row: Row) => boolean,\n  setOverlay: (o: Overlay | undefined) => Overlay | undefined,\n  writeChange: (c: SourceChange) => void,\n  pushEpoch: number,\n) {\n  for (const x of genPush(connections, change, exists, setOverlay, pushEpoch)) {\n    yield x;\n  }\n  writeChange(change);\n}\n\nfunction* genPush(\n  connections: readonly Connection[],\n  change: SourceChange,\n  exists: (row: Row) => boolean,\n  setOverlay: (o: Overlay | undefined) => void,\n  pushEpoch: number,\n) {\n  switch (change.type) {\n    case 'add':\n      assert(\n        !exists(change.row),\n        () => `Row already exists ${stringify(change)}`,\n      );\n      break;\n    case 'remove':\n      assert(exists(change.row), () => `Row not found ${stringify(change)}`);\n      break;\n    case 'edit':\n      assert(exists(change.oldRow), () => `Row not found ${stringify(change)}`);\n      break;\n    default:\n      unreachable(change);\n  }\n\n  for (const conn of connections) {\n    const {output, filters, input} = conn;\n    if (output) {\n      conn.lastPushedEpoch = pushEpoch;\n      setOverlay({epoch: pushEpoch, change});\n      const outputChange: Change =\n        change.type === 'edit'\n          ? {\n              type: change.type,\n              oldNode: {\n                row: change.oldRow,\n                relationships: {},\n              },\n              node: {\n                row: change.row,\n                relationships: {},\n              },\n            }\n          : {\n              type: change.type,\n              node: {\n                row: change.row,\n                relationships: {},\n              },\n            };\n      yield* filterPush(outputChange, output, input, filters?.predicate);\n      yield undefined;\n    }\n  }\n\n  setOverlay(undefined);\n}\n\nexport function* generateWithStart(\n  nodes: Iterable<Node | 'yield'>,\n  start: Start | undefined,\n  compare: (r1: Row, r2: Row) => number,\n): Stream<Node | 'yield'> {\n  if (!start) {\n    yield* nodes;\n    return;\n  }\n  let started = false;\n  for (const node of nodes) {\n    if (node === 'yield') {\n      yield node;\n      continue;\n    }\n    if (!started) {\n      if (start.basis === 'at') {\n        if (compare(node.row, start.row) >= 0) {\n          started = true;\n        }\n      } else if (start.basis === 'after') {\n        if (compare(node.row, start.row) > 0) {\n          started = true;\n        }\n      }\n    }\n    if (started) {\n      yield node;\n    }\n  }\n}\n\n/**\n * Takes an iterator and overlay.\n * Splices the overlay into the iterator at the correct position.\n *\n * @param startAt - if there is a lower bound to the stream. If the lower bound of the stream\n * is above the overlay, the overlay will be skipped.\n * @param rows - the stream into which the overlay should be spliced\n * @param constraint - constraint that was applied to the rowIterator and should\n * also be applied to the overlay.\n * @param overlay - the overlay values to splice in\n * @param compare - the comparator to use to find the position for the overlay\n */\nexport function* generateWithOverlay(\n  startAt: Row | undefined,\n  rows: Iterable<Row>,\n  constraint: Constraint | undefined,\n  overlay: Overlay | undefined,\n  lastPushedEpoch: number,\n  compare: Comparator,\n  filterPredicate?: (row: Row) => boolean | undefined,\n) {\n  let overlayToApply: Overlay | undefined = undefined;\n  if (overlay && lastPushedEpoch >= overlay.epoch) {\n    overlayToApply = overlay;\n  }\n  const overlays = computeOverlays(\n    startAt,\n    constraint,\n    overlayToApply,\n    compare,\n    filterPredicate,\n  );\n  yield* generateWithOverlayInner(rows, overlays, compare);\n}\n\nfunction computeOverlays(\n  startAt: Row | undefined,\n  constraint: Constraint | undefined,\n  overlay: Overlay | undefined,\n  compare: Comparator,\n  filterPredicate?: (row: Row) => boolean | undefined,\n): Overlays {\n  let overlays: Overlays = {\n    add: undefined,\n    remove: undefined,\n  };\n  switch (overlay?.change.type) {\n    case 'add':\n      overlays = {\n        add: overlay.change.row,\n        remove: undefined,\n      };\n      break;\n    case 'remove':\n      overlays = {\n        add: undefined,\n        remove: overlay.change.row,\n      };\n      break;\n    case 'edit':\n      overlays = {\n        add: overlay.change.row,\n        remove: overlay.change.oldRow,\n      };\n      break;\n  }\n\n  if (startAt) {\n    overlays = overlaysForStartAt(overlays, startAt, compare);\n  }\n\n  if (constraint) {\n    overlays = overlaysForConstraint(overlays, constraint);\n  }\n\n  if (filterPredicate) {\n    overlays = overlaysForFilterPredicate(overlays, filterPredicate);\n  }\n\n  return overlays;\n}\n\nexport {overlaysForStartAt as overlaysForStartAtForTest};\n\nfunction overlaysForStartAt(\n  {add, remove}: Overlays,\n  startAt: Row,\n  compare: Comparator,\n): Overlays {\n  const undefinedIfBeforeStartAt = (row: Row | undefined) =>\n    row === undefined || compare(row, startAt) < 0 ? undefined : row;\n  return {\n    add: undefinedIfBeforeStartAt(add),\n    remove: undefinedIfBeforeStartAt(remove),\n  };\n}\n\nexport {overlaysForConstraint as overlaysForConstraintForTest};\n\nfunction overlaysForConstraint(\n  {add, remove}: Overlays,\n  constraint: Constraint,\n): Overlays {\n  const undefinedIfDoesntMatchConstraint = (row: Row | undefined) =>\n    row === undefined || !constraintMatchesRow(constraint, row)\n      ? undefined\n      : row;\n\n  return {\n    add: undefinedIfDoesntMatchConstraint(add),\n    remove: undefinedIfDoesntMatchConstraint(remove),\n  };\n}\n\nfunction overlaysForFilterPredicate(\n  {add, remove}: Overlays,\n  filterPredicate: (row: Row) => boolean | undefined,\n): Overlays {\n  const undefinedIfDoesntMatchFilter = (row: Row | undefined) =>\n    row === undefined || !filterPredicate(row) ? undefined : row;\n\n  return {\n    add: undefinedIfDoesntMatchFilter(add),\n    remove: undefinedIfDoesntMatchFilter(remove),\n  };\n}\n\nexport function* generateWithOverlayInner(\n  rowIterator: Iterable<Row>,\n  overlays: Overlays,\n  compare: (r1: Row, r2: Row) => number,\n) {\n  let addOverlayYielded = false;\n  let removeOverlaySkipped = false;\n  for (const row of rowIterator) {\n    if (!addOverlayYielded && overlays.add) {\n      const cmp = compare(overlays.add, row);\n      if (cmp < 0) {\n        addOverlayYielded = true;\n        yield {row: overlays.add, relationships: {}};\n      }\n    }\n\n    if (!removeOverlaySkipped && overlays.remove) {\n      const cmp = compare(overlays.remove, row);\n      if (cmp === 0) {\n        removeOverlaySkipped = true;\n        continue;\n      }\n    }\n    yield {row, relationships: {}};\n  }\n\n  if (!addOverlayYielded && overlays.add) {\n    yield {row: overlays.add, relationships: {}};\n  }\n}\n\n/**\n * Like {@link generateWithOverlay} but for unordered streams.\n * No `startAt` or comparator needed. Injects remove/old-edit rows eagerly\n * at the start, and suppresses add/new-edit rows inline by PK match.\n */\nexport function* generateWithOverlayUnordered(\n  rows: Iterable<Row>,\n  constraint: Constraint | undefined,\n  overlay: Overlay | undefined,\n  lastPushedEpoch: number,\n  primaryKey: PrimaryKey,\n  filterPredicate?: (row: Row) => boolean,\n) {\n  let overlayToApply: Overlay | undefined = undefined;\n  if (overlay && lastPushedEpoch >= overlay.epoch) {\n    overlayToApply = overlay;\n  }\n  let overlays: Overlays = {add: undefined, remove: undefined};\n  switch (overlayToApply?.change.type) {\n    case 'add':\n      overlays = {add: overlayToApply.change.row, remove: undefined};\n      break;\n    case 'remove':\n      overlays = {add: undefined, remove: overlayToApply.change.row};\n      break;\n    case 'edit':\n      overlays = {\n        add: overlayToApply.change.row,\n        remove: overlayToApply.change.oldRow,\n      };\n      break;\n  }\n  if (constraint) {\n    overlays = overlaysForConstraint(overlays, constraint);\n  }\n  if (filterPredicate) {\n    overlays = overlaysForFilterPredicate(overlays, filterPredicate);\n  }\n  yield* generateWithOverlayInnerUnordered(rows, overlays, primaryKey);\n}\n\nexport function* generateWithOverlayInnerUnordered(\n  rowIterator: Iterable<Row>,\n  overlays: Overlays,\n  primaryKey: PrimaryKey,\n) {\n  // Eager inject: yield the add overlay at the start (row not yet in storage)\n  if (overlays.add) {\n    yield {row: overlays.add, relationships: {}};\n  }\n  // Stream with inline suppress: skip the remove overlay (row still in storage)\n  let removeSkipped = false;\n  for (const row of rowIterator) {\n    if (\n      !removeSkipped &&\n      overlays.remove &&\n      rowMatchesPK(overlays.remove, row, primaryKey)\n    ) {\n      removeSkipped = true;\n      continue;\n    }\n    yield {row, relationships: {}};\n  }\n}\n\nfunction rowMatchesPK(a: Row, b: Row, primaryKey: PrimaryKey): boolean {\n  for (const key of primaryKey) {\n    if (!valuesEqual(a[key], b[key])) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * A location to begin scanning an index from. Can either be a specific value\n * or the min or max possible value for the type. This is used to start a scan\n * at the beginning of the rows matching a constraint.\n */\ntype Bound = Value | MinValue | MaxValue;\ntype RowBound = Record<string, Bound>;\nconst minValue = Symbol('min-value');\ntype MinValue = typeof minValue;\nconst maxValue = Symbol('max-value');\ntype MaxValue = typeof maxValue;\n\nfunction makeBoundComparator(sort: Ordering): Comparator {\n  // Pre-extract the first two keys/directions to avoid per-call array access.\n  // All paths share one function literal (single SFI) so the BTree comparator call site\n  // stays monomorphic across indexes with different sort orderings, preventing V8 IC deopt.\n  // Even a 2-SFI split (e.g. separate len=1 path) creates a polymorphic IC that\n  // measurably regresses performance, so we keep a single return body.\n  const len = sort.length;\n  const k0 = sort[0][0];\n  const a0 = sort[0][1] === 'asc';\n  const k1 = len > 1 ? sort[1][0] : '';\n  const a1 = len > 1 ? sort[1][1] === 'asc' : true;\n\n  return (a: RowBound, b: RowBound) => {\n    const c0 = a0 ? compareBounds(a[k0], b[k0]) : compareBounds(b[k0], a[k0]);\n    if (len === 1 || c0 !== 0) return c0;\n    const c1 = a1 ? compareBounds(a[k1], b[k1]) : compareBounds(b[k1], a[k1]);\n    if (len === 2 || c1 !== 0) return c1;\n    // Hot! Do not use destructuring\n    for (let i = 2; i < len; i++) {\n      const cmp = compareBounds(a[sort[i][0]], b[sort[i][0]]);\n      if (cmp !== 0) return sort[i][1] === 'asc' ? cmp : -cmp;\n    }\n    return 0;\n  };\n}\n\nfunction compareBounds(a: Bound, b: Bound): number {\n  if (a === b) {\n    return 0;\n  }\n  // Use typeof to guard the Symbol sentinel checks first. This gives V8 a\n  // clear type discriminant so the common non-symbol path compiles as a\n  // specialised numeric/string fast-path without a Smi deopt when the\n  // minValue/maxValue sentinel symbols appear.\n  if (typeof a === 'symbol') {\n    return a === minValue ? -1 : 1;\n  }\n  if (typeof b === 'symbol') {\n    return b === minValue ? 1 : -1;\n  }\n  return compareValues(a, b);\n}\n\nfunction* generateRows(\n  data: BTreeSet<Row>,\n  scanStart: RowBound | undefined,\n  reverse: boolean | undefined,\n) {\n  yield* data[reverse ? 'valuesFromReversed' : 'valuesFrom'](\n    scanStart as Row | undefined,\n  );\n}\n\nexport function stringify(change: SourceChange) {\n  return JSON.stringify(change, (_, v) =>\n    typeof v === 'bigint' ? v.toString() : v,\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AA4FA,IAAa,eAAb,MAAa,aAA+B;CAC1C;CACA;CACA;CACA;CACA,2BAAwC,IAAI,KAAK;CACjD,eAAsC,EAAE;CAExC;CACA,aAAa;CAEb,YACE,WACA,SACA,YACA,kBACA;AACA,QAAA,YAAkB;AAClB,QAAA,UAAgB;AAChB,QAAA,aAAmB;AACnB,QAAA,mBAAyB,WAAW,KAAI,MAAK,CAAC,GAAG,MAAM,CAAC;EACxD,MAAM,aAAa,oBAAoB,MAAA,iBAAuB;AAC9D,QAAA,QAAc,IAAI,KAAK,UAAU,MAAA,iBAAuB,EAAE;GACxD;GACA,MAAM,oBAAoB,IAAI,SAAc,WAAW;GACvD,wBAAQ,IAAI,KAAK;GAClB,CAAC;;CAGJ,IAAI,cAAc;AAChB,SAAO;GACL,MAAM,MAAA;GACN,SAAS,MAAA;GACT,YAAY,MAAA;GACb;;CAGH,OAAO;EACL,MAAM,eAAe,MAAA,iBAAuB;AAC5C,SAAO,IAAI,aACT,MAAA,WACA,MAAA,SACA,MAAA,YACA,aAAa,KAAK,OAAO,CAC1B;;CAGH,IAAI,OAAsB;AACxB,SAAO,MAAA,iBAAuB,CAAC;;CAGjC,WAAW,YAAwB,WAAkC;AACnE,SAAO;GACL,WAAW,MAAA;GACX,SAAS,MAAA;GACT,YAAY,MAAA;GACZ,MAAM,YAAY,KAAA,IAAY,WAAW;GACzC,QAAQ;GACR,eAAe,EAAE;GACjB,UAAU;GACV,aAAa,WAAW;GACzB;;CAGH,QACE,MACA,SACA,eACa;EACb,MAAM,qBAAqB,iBAAiB,QAAQ;EACpD,MAAM,YAAY,SAAS,KAAA;EAC3B,MAAM,eAAe,QAAQ,MAAA;EAE7B,MAAM,QAAqB;GACzB,iBAAiB;GACjB,QAAO,QAAO,MAAA,MAAY,KAAK,WAAW;GAC1C,YAAW,WAAU;AACnB,eAAW,SAAS;;GAEtB,eAAe;AACb,UAAA,WAAiB,MAAM;;GAEzB,qBAAqB,CAAC,mBAAmB;GAC1C;EAED,MAAM,aAAyB;GAC7B;GACA,QAAQ,KAAA;GACR,MAAM;GACN;GACA,aAAa,eAAe,aAAa;GACzC,SAAS,mBAAmB,UACxB;IACE,WAAW,mBAAmB;IAC9B,WAAW,gBAAgB,mBAAmB,QAAQ;IACvD,GACD,KAAA;GACJ,iBAAiB;GAClB;EACD,MAAM,SAAS,MAAA,UAAgB,YAAY,UAAU;AACrD,MAAI,CAAC,UACH,0BAAyB,cAAc,MAAA,WAAiB;AAE1D,QAAA,YAAkB,KAAK,WAAW;AAClC,SAAO;;CAGT,YAAY,OAAoB;EAC9B,MAAM,MAAM,MAAA,YAAkB,WAAU,MAAK,EAAE,UAAU,MAAM;AAC/D,SAAO,QAAQ,IAAI,uBAAuB;AAC1C,QAAA,YAAkB,OAAO,KAAK,EAAE;;CAWlC,mBAA0B;EACxB,MAAM,QAAQ,MAAA,QAAc,IAAI,KAAK,UAAU,MAAA,iBAAuB,CAAC;AACvE,SAAO,OAAO,0BAA0B;AACxC,SAAO;;CAGT,kBAAkB,MAAgB,QAA2B;EAC3D,MAAM,MAAM,KAAK,UAAU,KAAK;EAChC,MAAM,QAAQ,MAAA,QAAc,IAAI,IAAI;AAGpC,MAAI,OAAO;AACT,SAAM,OAAO,IAAI,OAAO;AACxB,UAAO;;EAGT,MAAM,aAAa,oBAAoB,KAAK;EAS5C,MAAM,OAAO,IAAI,SAAc,WAAW;AAI1C,OAAK,MAAM,OAAO,MAAA,iBAAuB,CAAC,KACxC,MAAK,IAAI,IAAI;EAGf,MAAM,WAAW;GAAC;GAAY;GAAM,QAAQ,IAAI,IAAI,CAAC,OAAO,CAAC;GAAC;AAC9D,QAAA,QAAc,IAAI,KAAK,SAAS;AAChC,SAAO;;CAIT,eAAyB;AACvB,SAAO,CAAC,GAAG,MAAA,QAAc,MAAM,CAAC;;CAGlC,EAAA,MAAQ,KAAmB,MAA0C;EACnE,MAAM,gBAAgB,KAAK,KAAK,KAAK;EACrC,MAAM,EAAC,gBAAe;EAEtB,MAAM,uBAAmC,IAAI,WACxC,IAAI,OAAO,YAAY,IAAI,GAAG,GAC/B;EAEJ,MAAM,eAAe,gCACnB,KAAK,SAAS,WACd,MAAA,WACD;EAGD,MAAM,sBAAsB,gBAAgB,IAAI;EAGhD,MAAM,YAAyB,EAAE;AACjC,MAAI,oBACF,MAAK,MAAM,OAAO,OAAO,KAAK,oBAAoB,CAChD,WAAU,KAAK,CAAC,KAAK,MAAM,CAAC;AAOhC,MACE,MAAA,WAAiB,SAAS,KAC1B,CAAC,uBACD,CAAC,4BAA4B,qBAAqB,MAAA,WAAiB,CAEnE,WAAU,KAAK,GAAG,cAAc;EAIlC,MAAM,EAAC,MAAM,YAAY,YADX,MAAA,iBAAuB,WAAW,KAAK;EAGrD,MAAM,kBAA8B,IAAI,WACnC,IAAI,OAAO,QAAQ,IAAI,GAAG,GAC3B;EAEJ,MAAM,UAAU,IAAI,OAAO;EAY3B,IAAI;AAEJ,MAAI,qBAAqB;AACvB,eAAY,EAAE;AACd,QAAK,MAAM,CAAC,KAAK,QAAQ,UACvB,KAAI,OAAO,qBAAqB,IAAI,CAClC,WAAU,OAAO,oBAAoB;YAEjC,IAAI,QACN,WAAU,OAAO,QAAQ,QAAQ,WAAW;OAE5C,WAAU,OAAO,QAAQ,QAAQ,WAAW;QAKlD,aAAY;EAGd,MAAM,eAAe,aAAa,MAAM,WAAW,IAAI,QAAQ;EAuB/D,MAAM,iBAAiB,uBACrB,WACE,kBAxBgB,oBAClB,SACA,eAAe,KAAK,aAAa,GAAG,cAIpC,IAAI,YACJ,MAAA,SACA,KAAK,iBAUL,iBACA,KAAK,SAAS,UACf,EAIkC,IAAI,OAAO,qBAAqB,CAChE,EAGD,IAAI,WACL;AAED,SAAO,KAAK,UACR,mBAAmB,gBAAgB,KAAK,QAAQ,UAAU,GAC1D;;CAGN,CAAC,KAAK,QAAuC;AAC3C,OAAK,MAAM,UAAU,KAAK,QAAQ,OAAO,CACvC,KAAI,WAAW,QACb,OAAM;;CAKZ,CAAC,QAAQ,QAAsB;EAE7B,MAAM,EAAC,SADc,MAAA,iBAAuB;EAE5C,MAAM,UAAU,QAAa,KAAK,IAAI,IAAI;EAC1C,MAAM,cAAc,MAA4B,MAAA,UAAgB;EAChE,MAAM,eAAe,MAAoB,MAAA,YAAkB,EAAE;AAC7D,SAAO,6BACL,MAAA,aACA,QACA,QACA,YACA,mBACM,EAAE,MAAA,UACT;;CAGH,aAAa,QAAsB;AACjC,OAAK,MAAM,EAAC,UAAS,MAAA,QAAc,QAAQ,CACzC,SAAQ,OAAO,MAAf;GACE,KAAK;AAGH,WAFc,KAAK,IAAI,OAAO,IAAI,EAIhC,yEACD;AACD;GAEF,KAAK;AAGH,WAFgB,KAAK,OAAO,OAAO,IAAI,EAIrC,4EACD;AACD;GAEF,KAAK;AAOH,WAFgB,KAAK,OAAO,OAAO,OAAO,EAIxC,iFACD;AACD,SAAK,IAAI,OAAO,IAAI;AACpB;GAEF,QACE,aAAY,OAAO;;;;AAM7B,UAAU,uBACR,IACA,YACA;AACA,MAAK,MAAM,QAAQ,IAAI;AACrB,MAAI,cAAc,CAAC,qBAAqB,YAAY,KAAK,IAAI,CAC3D;AAEF,QAAM;;;AAIV,UAAU,mBAAmB,IAAkB,QAA+B;AAC5E,MAAK,MAAM,QAAQ,GACjB,KAAI,OAAO,KAAK,IAAI,CAClB,OAAM;;AAKZ,UAAiB,6BACf,aACA,QACA,QACA,YACA,aACA,cACA;CACA,IAAI,kBAAkB;AACtB,KAAI,OAAO,SAAS;OACb,MAAM,EAAC,mBAAkB,YAC5B,KAAI;QACG,MAAM,OAAO,cAChB,KAAI,CAAC,YAAY,OAAO,IAAI,MAAM,OAAO,OAAO,KAAK,EAAE;AACrD,sBAAkB;AAClB;;;;AAOV,KAAI,OAAO,SAAS,UAAU,iBAAiB;AAC7C,SAAO,gBACL,aACA;GACE,MAAM;GACN,KAAK,OAAO;GACb,EACD,QACA,YACA,aACA,cAAc,CACf;AACD,SAAO,gBACL,aACA;GACE,MAAM;GACN,KAAK,OAAO;GACb,EACD,QACA,YACA,aACA,cAAc,CACf;OAED,QAAO,gBACL,aACA,QACA,QACA,YACA,aACA,cAAc,CACf;;AAIL,UAAU,gBACR,aACA,QACA,QACA,YACA,aACA,WACA;AACA,MAAK,MAAM,KAAK,QAAQ,aAAa,QAAQ,QAAQ,YAAY,UAAU,CACzE,OAAM;AAER,aAAY,OAAO;;AAGrB,UAAU,QACR,aACA,QACA,QACA,YACA,WACA;AACA,SAAQ,OAAO,MAAf;EACE,KAAK;AACH,UACE,CAAC,OAAO,OAAO,IAAI,QACb,sBAAsB,UAAU,OAAO,GAC9C;AACD;EACF,KAAK;AACH,UAAO,OAAO,OAAO,IAAI,QAAQ,iBAAiB,UAAU,OAAO,GAAG;AACtE;EACF,KAAK;AACH,UAAO,OAAO,OAAO,OAAO,QAAQ,iBAAiB,UAAU,OAAO,GAAG;AACzE;EACF,QACE,aAAY,OAAO;;AAGvB,MAAK,MAAM,QAAQ,aAAa;EAC9B,MAAM,EAAC,QAAQ,SAAS,UAAS;AACjC,MAAI,QAAQ;AACV,QAAK,kBAAkB;AACvB,cAAW;IAAC,OAAO;IAAW;IAAO,CAAC;AAqBtC,UAAO,WAnBL,OAAO,SAAS,SACZ;IACE,MAAM,OAAO;IACb,SAAS;KACP,KAAK,OAAO;KACZ,eAAe,EAAE;KAClB;IACD,MAAM;KACJ,KAAK,OAAO;KACZ,eAAe,EAAE;KAClB;IACF,GACD;IACE,MAAM,OAAO;IACb,MAAM;KACJ,KAAK,OAAO;KACZ,eAAe,EAAE;KAClB;IACF,EACyB,QAAQ,OAAO,SAAS,UAAU;AAClE,SAAM,KAAA;;;AAIV,YAAW,KAAA,EAAU;;AAGvB,UAAiB,kBACf,OACA,OACA,SACwB;AACxB,KAAI,CAAC,OAAO;AACV,SAAO;AACP;;CAEF,IAAI,UAAU;AACd,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,SAAS,SAAS;AACpB,SAAM;AACN;;AAEF,MAAI,CAAC;OACC,MAAM,UAAU;QACd,QAAQ,KAAK,KAAK,MAAM,IAAI,IAAI,EAClC,WAAU;cAEH,MAAM,UAAU;QACrB,QAAQ,KAAK,KAAK,MAAM,IAAI,GAAG,EACjC,WAAU;;;AAIhB,MAAI,QACF,OAAM;;;;;;;;;;;;;;;AAiBZ,UAAiB,oBACf,SACA,MACA,YACA,SACA,iBACA,SACA,iBACA;CACA,IAAI,iBAAsC,KAAA;AAC1C,KAAI,WAAW,mBAAmB,QAAQ,MACxC,kBAAiB;AASnB,QAAO,yBAAyB,MAPf,gBACf,SACA,YACA,gBACA,SACA,gBACD,EAC+C,QAAQ;;AAG1D,SAAS,gBACP,SACA,YACA,SACA,SACA,iBACU;CACV,IAAI,WAAqB;EACvB,KAAK,KAAA;EACL,QAAQ,KAAA;EACT;AACD,SAAQ,SAAS,OAAO,MAAxB;EACE,KAAK;AACH,cAAW;IACT,KAAK,QAAQ,OAAO;IACpB,QAAQ,KAAA;IACT;AACD;EACF,KAAK;AACH,cAAW;IACT,KAAK,KAAA;IACL,QAAQ,QAAQ,OAAO;IACxB;AACD;EACF,KAAK;AACH,cAAW;IACT,KAAK,QAAQ,OAAO;IACpB,QAAQ,QAAQ,OAAO;IACxB;AACD;;AAGJ,KAAI,QACF,YAAW,mBAAmB,UAAU,SAAS,QAAQ;AAG3D,KAAI,WACF,YAAW,sBAAsB,UAAU,WAAW;AAGxD,KAAI,gBACF,YAAW,2BAA2B,UAAU,gBAAgB;AAGlE,QAAO;;AAKT,SAAS,mBACP,EAAC,KAAK,UACN,SACA,SACU;CACV,MAAM,4BAA4B,QAChC,QAAQ,KAAA,KAAa,QAAQ,KAAK,QAAQ,GAAG,IAAI,KAAA,IAAY;AAC/D,QAAO;EACL,KAAK,yBAAyB,IAAI;EAClC,QAAQ,yBAAyB,OAAO;EACzC;;AAKH,SAAS,sBACP,EAAC,KAAK,UACN,YACU;CACV,MAAM,oCAAoC,QACxC,QAAQ,KAAA,KAAa,CAAC,qBAAqB,YAAY,IAAI,GACvD,KAAA,IACA;AAEN,QAAO;EACL,KAAK,iCAAiC,IAAI;EAC1C,QAAQ,iCAAiC,OAAO;EACjD;;AAGH,SAAS,2BACP,EAAC,KAAK,UACN,iBACU;CACV,MAAM,gCAAgC,QACpC,QAAQ,KAAA,KAAa,CAAC,gBAAgB,IAAI,GAAG,KAAA,IAAY;AAE3D,QAAO;EACL,KAAK,6BAA6B,IAAI;EACtC,QAAQ,6BAA6B,OAAO;EAC7C;;AAGH,UAAiB,yBACf,aACA,UACA,SACA;CACA,IAAI,oBAAoB;CACxB,IAAI,uBAAuB;AAC3B,MAAK,MAAM,OAAO,aAAa;AAC7B,MAAI,CAAC,qBAAqB,SAAS;OACrB,QAAQ,SAAS,KAAK,IAAI,GAC5B,GAAG;AACX,wBAAoB;AACpB,UAAM;KAAC,KAAK,SAAS;KAAK,eAAe,EAAE;KAAC;;;AAIhD,MAAI,CAAC,wBAAwB,SAAS;OACxB,QAAQ,SAAS,QAAQ,IAAI,KAC7B,GAAG;AACb,2BAAuB;AACvB;;;AAGJ,QAAM;GAAC;GAAK,eAAe,EAAE;GAAC;;AAGhC,KAAI,CAAC,qBAAqB,SAAS,IACjC,OAAM;EAAC,KAAK,SAAS;EAAK,eAAe,EAAE;EAAC;;;;;;;AAShD,UAAiB,6BACf,MACA,YACA,SACA,iBACA,YACA,iBACA;CACA,IAAI,iBAAsC,KAAA;AAC1C,KAAI,WAAW,mBAAmB,QAAQ,MACxC,kBAAiB;CAEnB,IAAI,WAAqB;EAAC,KAAK,KAAA;EAAW,QAAQ,KAAA;EAAU;AAC5D,SAAQ,gBAAgB,OAAO,MAA/B;EACE,KAAK;AACH,cAAW;IAAC,KAAK,eAAe,OAAO;IAAK,QAAQ,KAAA;IAAU;AAC9D;EACF,KAAK;AACH,cAAW;IAAC,KAAK,KAAA;IAAW,QAAQ,eAAe,OAAO;IAAI;AAC9D;EACF,KAAK;AACH,cAAW;IACT,KAAK,eAAe,OAAO;IAC3B,QAAQ,eAAe,OAAO;IAC/B;AACD;;AAEJ,KAAI,WACF,YAAW,sBAAsB,UAAU,WAAW;AAExD,KAAI,gBACF,YAAW,2BAA2B,UAAU,gBAAgB;AAElE,QAAO,kCAAkC,MAAM,UAAU,WAAW;;AAGtE,UAAiB,kCACf,aACA,UACA,YACA;AAEA,KAAI,SAAS,IACX,OAAM;EAAC,KAAK,SAAS;EAAK,eAAe,EAAE;EAAC;CAG9C,IAAI,gBAAgB;AACpB,MAAK,MAAM,OAAO,aAAa;AAC7B,MACE,CAAC,iBACD,SAAS,UACT,aAAa,SAAS,QAAQ,KAAK,WAAW,EAC9C;AACA,mBAAgB;AAChB;;AAEF,QAAM;GAAC;GAAK,eAAe,EAAE;GAAC;;;AAIlC,SAAS,aAAa,GAAQ,GAAQ,YAAiC;AACrE,MAAK,MAAM,OAAO,WAChB,KAAI,CAAC,YAAY,EAAE,MAAM,EAAE,KAAK,CAC9B,QAAO;AAGX,QAAO;;AAUT,IAAM,WAAW,OAAO,YAAY;AAEpC,IAAM,WAAW,OAAO,YAAY;AAGpC,SAAS,oBAAoB,MAA4B;CAMvD,MAAM,MAAM,KAAK;CACjB,MAAM,KAAK,KAAK,GAAG;CACnB,MAAM,KAAK,KAAK,GAAG,OAAO;CAC1B,MAAM,KAAK,MAAM,IAAI,KAAK,GAAG,KAAK;CAClC,MAAM,KAAK,MAAM,IAAI,KAAK,GAAG,OAAO,QAAQ;AAE5C,SAAQ,GAAa,MAAgB;EACnC,MAAM,KAAK,KAAK,cAAc,EAAE,KAAK,EAAE,IAAI,GAAG,cAAc,EAAE,KAAK,EAAE,IAAI;AACzE,MAAI,QAAQ,KAAK,OAAO,EAAG,QAAO;EAClC,MAAM,KAAK,KAAK,cAAc,EAAE,KAAK,EAAE,IAAI,GAAG,cAAc,EAAE,KAAK,EAAE,IAAI;AACzE,MAAI,QAAQ,KAAK,OAAO,EAAG,QAAO;AAElC,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK;GAC5B,MAAM,MAAM,cAAc,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,GAAG,IAAI;AACvD,OAAI,QAAQ,EAAG,QAAO,KAAK,GAAG,OAAO,QAAQ,MAAM,CAAC;;AAEtD,SAAO;;;AAIX,SAAS,cAAc,GAAU,GAAkB;AACjD,KAAI,MAAM,EACR,QAAO;AAMT,KAAI,OAAO,MAAM,SACf,QAAO,MAAM,WAAW,KAAK;AAE/B,KAAI,OAAO,MAAM,SACf,QAAO,MAAM,WAAW,IAAI;AAE9B,QAAO,cAAc,GAAG,EAAE;;AAG5B,UAAU,aACR,MACA,WACA,SACA;AACA,QAAO,KAAK,UAAU,uBAAuB,cAC3C,UACD;;AAGH,SAAgB,UAAU,QAAsB;AAC9C,QAAO,KAAK,UAAU,SAAS,GAAG,MAChC,OAAO,MAAM,WAAW,EAAE,UAAU,GAAG,EACxC"}

package/out/zql/src/query/complete-ordering.js

@@ -39,7 +39,7 @@ function addPrimaryKeys(primaryKey, orderBy) {
 	const primaryKeysToAdd = new Set(primaryKey);
 	for (const [field] of orderBy) primaryKeysToAdd.delete(field);
 	if (primaryKeysToAdd.size === 0) return orderBy;
-	return [...orderBy, ...[...primaryKeysToAdd].map((key) => [key, "asc"])];
+	return [...orderBy, ...Array.from(primaryKeysToAdd, (key) => [key, "asc"])];
 }
 //#endregion
 export { assertOrderingIncludesPK, completeOrdering };

package/out/zql/src/query/complete-ordering.js.map

@@ -1 +1 @@
-{"version":3,"file":"complete-ordering.js","names":[],"sources":["../../../../../zql/src/query/complete-ordering.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {AST, Condition, Ordering} from '../../../zero-protocol/src/ast.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\n\nexport function completeOrdering(\n  ast: AST,\n  getPrimaryKey: (tableName: string) => PrimaryKey,\n): AST {\n  const primaryKey = must(getPrimaryKey(ast.table));\n  return {\n    ...ast,\n    ...(ast.related\n      ? {\n          related: ast.related?.map(r => ({\n            ...r,\n            subquery: completeOrdering(r.subquery, getPrimaryKey),\n          })),\n        }\n      : undefined),\n    ...(ast.where\n      ? {\n          where: completeOrderingInCondition(ast.where, getPrimaryKey),\n        }\n      : undefined),\n    orderBy: addPrimaryKeys(primaryKey, ast.orderBy),\n  };\n}\n\nexport function assertOrderingIncludesPK(\n  ordering: Ordering,\n  pk: PrimaryKey,\n): void {\n  // oxlint-disable-next-line unicorn/prefer-set-has -- Array is more appropriate here for small collections\n  const orderingFields = ordering.map(([field]) => field);\n  const missingFields = pk.filter(pkField => !orderingFields.includes(pkField));\n\n  assert(\n    missingFields.length === 0,\n    `Ordering must include all primary key fields. Missing: ${missingFields.join(\n      ', ',\n    )}.`,\n  );\n}\n\nfunction completeOrderingInCondition<C extends Condition | undefined>(\n  condition: C,\n  getPrimaryKey: (tableName: string) => PrimaryKey,\n): C {\n  if (!condition) {\n    return condition;\n  }\n  if (condition.type === 'simple') {\n    return condition;\n  }\n  if (condition.type === 'correlatedSubquery') {\n    return {\n      ...condition,\n      related: {\n        ...condition.related,\n        subquery: completeOrdering(condition.related.subquery, getPrimaryKey),\n      },\n    };\n  }\n  condition.type satisfies 'and' | 'or';\n  return {\n    ...condition,\n    conditions: condition.conditions.map(c =>\n      completeOrderingInCondition(c, getPrimaryKey),\n    ),\n  };\n}\n\nfunction addPrimaryKeys(\n  primaryKey: PrimaryKey,\n  orderBy: Ordering | undefined,\n): Ordering {\n  orderBy = orderBy ?? [];\n  const primaryKeysToAdd = new Set(primaryKey);\n\n  for (const [field] of orderBy) {\n    primaryKeysToAdd.delete(field);\n  }\n\n  if (primaryKeysToAdd.size === 0) {\n    return orderBy;\n  }\n\n  return [\n    ...orderBy,\n    ...[...primaryKeysToAdd].map(key => [key, 'asc'] as [string, 'asc']),\n  ];\n}\n"],"mappings":";;;AAKA,SAAgB,iBACd,KACA,eACK;CACL,MAAM,aAAa,KAAK,cAAc,IAAI,MAAM,CAAC;AACjD,QAAO;EACL,GAAG;EACH,GAAI,IAAI,UACJ,EACE,SAAS,IAAI,SAAS,KAAI,OAAM;GAC9B,GAAG;GACH,UAAU,iBAAiB,EAAE,UAAU,cAAc;GACtD,EAAE,EACJ,GACD,KAAA;EACJ,GAAI,IAAI,QACJ,EACE,OAAO,4BAA4B,IAAI,OAAO,cAAc,EAC7D,GACD,KAAA;EACJ,SAAS,eAAe,YAAY,IAAI,QAAQ;EACjD;;AAGH,SAAgB,yBACd,UACA,IACM;CAEN,MAAM,iBAAiB,SAAS,KAAK,CAAC,WAAW,MAAM;CACvD,MAAM,gBAAgB,GAAG,QAAO,YAAW,CAAC,eAAe,SAAS,QAAQ,CAAC;AAE7E,QACE,cAAc,WAAW,GACzB,0DAA0D,cAAc,KACtE,KACD,CAAC,GACH;;AAGH,SAAS,4BACP,WACA,eACG;AACH,KAAI,CAAC,UACH,QAAO;AAET,KAAI,UAAU,SAAS,SACrB,QAAO;AAET,KAAI,UAAU,SAAS,qBACrB,QAAO;EACL,GAAG;EACH,SAAS;GACP,GAAG,UAAU;GACb,UAAU,iBAAiB,UAAU,QAAQ,UAAU,cAAc;GACtE;EACF;AAEH,WAAU;AACV,QAAO;EACL,GAAG;EACH,YAAY,UAAU,WAAW,KAAI,MACnC,4BAA4B,GAAG,cAAc,CAC9C;EACF;;AAGH,SAAS,eACP,YACA,SACU;AACV,WAAU,WAAW,EAAE;CACvB,MAAM,mBAAmB,IAAI,IAAI,WAAW;AAE5C,MAAK,MAAM,CAAC,UAAU,QACpB,kBAAiB,OAAO,MAAM;AAGhC,KAAI,iBAAiB,SAAS,EAC5B,QAAO;AAGT,QAAO,CACL,GAAG,SACH,GAAG,CAAC,GAAG,iBAAiB,CAAC,KAAI,QAAO,CAAC,KAAK,MAAM,CAAoB,CACrE"}
+{"version":3,"file":"complete-ordering.js","names":[],"sources":["../../../../../zql/src/query/complete-ordering.ts"],"sourcesContent":["import {assert} from '../../../shared/src/asserts.ts';\nimport {must} from '../../../shared/src/must.ts';\nimport type {AST, Condition, Ordering} from '../../../zero-protocol/src/ast.ts';\nimport type {PrimaryKey} from '../../../zero-protocol/src/primary-key.ts';\n\nexport function completeOrdering(\n  ast: AST,\n  getPrimaryKey: (tableName: string) => PrimaryKey,\n): AST {\n  const primaryKey = must(getPrimaryKey(ast.table));\n  return {\n    ...ast,\n    ...(ast.related\n      ? {\n          related: ast.related?.map(r => ({\n            ...r,\n            subquery: completeOrdering(r.subquery, getPrimaryKey),\n          })),\n        }\n      : undefined),\n    ...(ast.where\n      ? {\n          where: completeOrderingInCondition(ast.where, getPrimaryKey),\n        }\n      : undefined),\n    orderBy: addPrimaryKeys(primaryKey, ast.orderBy),\n  };\n}\n\nexport function assertOrderingIncludesPK(\n  ordering: Ordering,\n  pk: PrimaryKey,\n): void {\n  // oxlint-disable-next-line unicorn/prefer-set-has -- Array is more appropriate here for small collections\n  const orderingFields = ordering.map(([field]) => field);\n  const missingFields = pk.filter(pkField => !orderingFields.includes(pkField));\n\n  assert(\n    missingFields.length === 0,\n    `Ordering must include all primary key fields. Missing: ${missingFields.join(\n      ', ',\n    )}.`,\n  );\n}\n\nfunction completeOrderingInCondition<C extends Condition | undefined>(\n  condition: C,\n  getPrimaryKey: (tableName: string) => PrimaryKey,\n): C {\n  if (!condition) {\n    return condition;\n  }\n  if (condition.type === 'simple') {\n    return condition;\n  }\n  if (condition.type === 'correlatedSubquery') {\n    return {\n      ...condition,\n      related: {\n        ...condition.related,\n        subquery: completeOrdering(condition.related.subquery, getPrimaryKey),\n      },\n    };\n  }\n  condition.type satisfies 'and' | 'or';\n  return {\n    ...condition,\n    conditions: condition.conditions.map(c =>\n      completeOrderingInCondition(c, getPrimaryKey),\n    ),\n  };\n}\n\nfunction addPrimaryKeys(\n  primaryKey: PrimaryKey,\n  orderBy: Ordering | undefined,\n): Ordering {\n  orderBy = orderBy ?? [];\n  const primaryKeysToAdd = new Set(primaryKey);\n\n  for (const [field] of orderBy) {\n    primaryKeysToAdd.delete(field);\n  }\n\n  if (primaryKeysToAdd.size === 0) {\n    return orderBy;\n  }\n\n  return [\n    ...orderBy,\n    ...Array.from(primaryKeysToAdd, key => [key, 'asc'] as [string, 'asc']),\n  ];\n}\n"],"mappings":";;;AAKA,SAAgB,iBACd,KACA,eACK;CACL,MAAM,aAAa,KAAK,cAAc,IAAI,MAAM,CAAC;AACjD,QAAO;EACL,GAAG;EACH,GAAI,IAAI,UACJ,EACE,SAAS,IAAI,SAAS,KAAI,OAAM;GAC9B,GAAG;GACH,UAAU,iBAAiB,EAAE,UAAU,cAAc;GACtD,EAAE,EACJ,GACD,KAAA;EACJ,GAAI,IAAI,QACJ,EACE,OAAO,4BAA4B,IAAI,OAAO,cAAc,EAC7D,GACD,KAAA;EACJ,SAAS,eAAe,YAAY,IAAI,QAAQ;EACjD;;AAGH,SAAgB,yBACd,UACA,IACM;CAEN,MAAM,iBAAiB,SAAS,KAAK,CAAC,WAAW,MAAM;CACvD,MAAM,gBAAgB,GAAG,QAAO,YAAW,CAAC,eAAe,SAAS,QAAQ,CAAC;AAE7E,QACE,cAAc,WAAW,GACzB,0DAA0D,cAAc,KACtE,KACD,CAAC,GACH;;AAGH,SAAS,4BACP,WACA,eACG;AACH,KAAI,CAAC,UACH,QAAO;AAET,KAAI,UAAU,SAAS,SACrB,QAAO;AAET,KAAI,UAAU,SAAS,qBACrB,QAAO;EACL,GAAG;EACH,SAAS;GACP,GAAG,UAAU;GACb,UAAU,iBAAiB,UAAU,QAAQ,UAAU,cAAc;GACtE;EACF;AAEH,WAAU;AACV,QAAO;EACL,GAAG;EACH,YAAY,UAAU,WAAW,KAAI,MACnC,4BAA4B,GAAG,cAAc,CAC9C;EACF;;AAGH,SAAS,eACP,YACA,SACU;AACV,WAAU,WAAW,EAAE;CACvB,MAAM,mBAAmB,IAAI,IAAI,WAAW;AAE5C,MAAK,MAAM,CAAC,UAAU,QACpB,kBAAiB,OAAO,MAAM;AAGhC,KAAI,iBAAiB,SAAS,EAC5B,QAAO;AAGT,QAAO,CACL,GAAG,SACH,GAAG,MAAM,KAAK,mBAAkB,QAAO,CAAC,KAAK,MAAM,CAAoB,CACxE"}

package/out/zql/src/query/query-impl.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"query-impl.d.ts","sourceRoot":"","sources":["../../../../../zql/src/query/query-impl.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,6BAA6B,CAAC;AACnE,OAAO,EACL,KAAK,GAAG,EAKR,KAAK,MAAM,EAEZ,MAAM,mCAAmC,CAAC;AAE3C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAG9D,OAAO,KAAK,EAAC,MAAM,EAAE,WAAW,EAAC,MAAM,gBAAgB,CAAC;AACxD,OAAO,EACL,KAAK,iBAAiB,EACtB,iBAAiB,EAIlB,MAAM,iBAAiB,CAAC;AACzB,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,YAAY,CAAC;AAC9C,OAAO,EAAC,KAAK,cAAc,EAAE,iBAAiB,EAAC,MAAM,sBAAsB,CAAC;AAC5E,OAAO,KAAK,EACV,QAAQ,EACR,aAAa,EAEb,aAAa,EACb,cAAc,EACd,OAAO,EACP,KAAK,EACL,UAAU,EACX,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,UAAU,CAAC;AAClC,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAI/C,KAAK,gBAAgB,CAAC,OAAO,SAAS,MAAM,IAAI,CAC9C,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,EAEP,IAAI,EAAE,OAAO,EACb,SAAS,EAAE,MAAM,EACjB,GAAG,EAAE,GAAG,EACR,MAAM,EAAE,MAAM,EACd,aAAa,EAAE,aAAa,GAAG,SAAS,EACxC,eAAe,EAAE,MAAM,GAAG,SAAS,KAChC,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AAEzC,wBAAgB,QAAQ,CACtB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,SAAS,MAAM,EACtB,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,OAAO,CAAC,CAExD;AAED,wBAAgB,YAAY,CAC1B,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,SAAS,MAAM,EACtB,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAElC,MAAM,EAAE,OAAO,EACf,SAAS,EAAE,MAAM,EACjB,GAAG,EAAE,GAAG,EACR,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,GACb,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAoBrC;AAED,qBAAa,SAAS,CACpB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,SAAS,MAAM,EACtB,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAElC,YACE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,EAC/B,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC;;IAE1C,QAAQ,CAAC,CAAC,iBAAiB,CAAC,QAAQ;IAKpC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAIxB,QAAQ,CAAC,aAAa,EAAE,aAAa,GAAG,SAAS,CAAC;gBAIhD,MAAM,EAAE,OAAO,EACf,SAAS,EAAE,MAAM,EACjB,GAAG,EAAE,GAAG,EACR,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,aAAa,EAAE,aAAa,GAAG,SAAS,EACxC,eAAe,EAAE,MAAM,GAAG,SAAS,EACnC,QAAQ,EAAE,gBAAgB,CAAC,OAAO,CAAC;IAYrC,GAAG,CAAC,QAAQ,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAI3D,OAAO,CAAC,QAAQ,CAAC,EAAE,cAAc,GAAG;QAClC,OAAO,EAAE,MAAM,IAAI,CAAC;QACpB,QAAQ,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;KACzB;IAID,WAAW,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IACzD,WAAW,CAAC,CAAC,EACX,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,EACjD,GAAG,CAAC,EAAE,GAAG,GACR,CAAC;IAQJ,WAAW,CACT,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,aAAa,CAAC,iBAAiB,CAAC,GACrC,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC;IAalC,IAAI,IAAI,MAAM;IAOd,GAAG,QAAO,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,SAAS,CAAC,CAajD;IAEJ,WAAW,GACT,cAAc,MAAM,EACpB,cAAc,CAAC,CAAC,CAAC,EAAE,QAAQ,KAAK,QAAQ,CAAC,GAAG,aAAa,EACzD,UAAU,aAAa,KACtB,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAQhC;IAEF,OAAO,GACL,cAAc,MAAM,EACpB,KAAK,CAAC,CAAC,EAAE,QAAQ,KAAK,QAAQ,KAC7B,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,CAAC,CA+I5B;IAEF,KAAK,2IAsCQ;IAEb,KAAK,GACH,KAAK,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,iBAAiB,GAAG,SAAS,CAAC,CAAC,EAC3D,OAAO;QAAC,SAAS,EAAE,OAAO,CAAA;KAAC,KAC1B,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAa9B;IAEJ,KAAK,GAAI,OAAO,MAAM,KAAG,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAwBtD;IAEF,OAAO,GAAI,SAAS,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,EACrE,OAAO,SAAS,EAChB,WAAW,KAAK,GAAG,MAAM,KACxB,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAiBhC;IAyGF,IAAI,GAAG,IAAI,GAAG,CAEb;IAED,iBAAiB;CAGlB;AAED,wBAAgB,WAAW,CACzB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAGzE"}
+{"version":3,"file":"query-impl.d.ts","sourceRoot":"","sources":["../../../../../zql/src/query/query-impl.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,6BAA6B,CAAC;AACnE,OAAO,EACL,KAAK,GAAG,EAKR,KAAK,MAAM,EAEZ,MAAM,mCAAmC,CAAC;AAE3C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAG9D,OAAO,KAAK,EAAC,MAAM,EAAE,WAAW,EAAC,MAAM,gBAAgB,CAAC;AACxD,OAAO,EACL,KAAK,iBAAiB,EACtB,iBAAiB,EAIlB,MAAM,iBAAiB,CAAC;AACzB,OAAO,KAAK,EAAC,aAAa,EAAC,MAAM,YAAY,CAAC;AAC9C,OAAO,EAAC,KAAK,cAAc,EAAE,iBAAiB,EAAC,MAAM,sBAAsB,CAAC;AAC5E,OAAO,KAAK,EACV,QAAQ,EACR,aAAa,EAEb,aAAa,EACb,cAAc,EACd,OAAO,EACP,KAAK,EACL,UAAU,EACX,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,UAAU,CAAC;AAClC,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,iBAAiB,CAAC;AAI/C,KAAK,gBAAgB,CAAC,OAAO,SAAS,MAAM,IAAI,CAC9C,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,EAEP,IAAI,EAAE,OAAO,EACb,SAAS,EAAE,MAAM,EACjB,GAAG,EAAE,GAAG,EACR,MAAM,EAAE,MAAM,EACd,aAAa,EAAE,aAAa,GAAG,SAAS,EACxC,eAAe,EAAE,MAAM,GAAG,SAAS,KAChC,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AAEzC,wBAAgB,QAAQ,CACtB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,SAAS,MAAM,EACtB,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,OAAO,CAAC,CAExD;AAED,wBAAgB,YAAY,CAC1B,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,SAAS,MAAM,EACtB,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAElC,MAAM,EAAE,OAAO,EACf,SAAS,EAAE,MAAM,EACjB,GAAG,EAAE,GAAG,EACR,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,GACb,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAoBrC;AAED,qBAAa,SAAS,CACpB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,SAAS,MAAM,EACtB,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAElC,YACE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,EAC/B,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC;;IAE1C,QAAQ,CAAC,CAAC,iBAAiB,CAAC,QAAQ;IAKpC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAIxB,QAAQ,CAAC,aAAa,EAAE,aAAa,GAAG,SAAS,CAAC;gBAIhD,MAAM,EAAE,OAAO,EACf,SAAS,EAAE,MAAM,EACjB,GAAG,EAAE,GAAG,EACR,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,EACd,aAAa,EAAE,aAAa,GAAG,SAAS,EACxC,eAAe,EAAE,MAAM,GAAG,SAAS,EACnC,QAAQ,EAAE,gBAAgB,CAAC,OAAO,CAAC;IAYrC,GAAG,CAAC,QAAQ,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAI3D,OAAO,CAAC,QAAQ,CAAC,EAAE,cAAc,GAAG;QAClC,OAAO,EAAE,MAAM,IAAI,CAAC;QACpB,QAAQ,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;KACzB;IAID,WAAW,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IACzD,WAAW,CAAC,CAAC,EACX,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,EACjD,GAAG,CAAC,EAAE,GAAG,GACR,CAAC;IAQJ,WAAW,CACT,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,aAAa,CAAC,iBAAiB,CAAC,GACrC,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC;IAalC,IAAI,IAAI,MAAM;IAOd,GAAG,QAAO,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,SAAS,CAAC,CAajD;IAEJ,WAAW,GACT,cAAc,MAAM,EACpB,cAAc,CAAC,CAAC,CAAC,EAAE,QAAQ,KAAK,QAAQ,CAAC,GAAG,aAAa,EACzD,UAAU,aAAa,KACtB,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAQhC;IAEF,OAAO,GACL,cAAc,MAAM,EACpB,KAAK,CAAC,CAAC,EAAE,QAAQ,KAAK,QAAQ,KAC7B,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,CAAC,CA+I5B;IAEF,KAAK,2IAsCQ;IAEb,KAAK,GACH,KAAK,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,iBAAiB,GAAG,SAAS,CAAC,CAAC,EAC3D,OAAO;QAAC,SAAS,EAAE,OAAO,CAAA;KAAC,KAC1B,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAa9B;IAEJ,KAAK,GAAI,OAAO,MAAM,KAAG,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAwBtD;IAEF,OAAO,GAAI,SAAS,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,EACrE,OAAO,SAAS,EAChB,WAAW,KAAK,GAAG,MAAM,KACxB,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAiBhC;IAwGF,IAAI,GAAG,IAAI,GAAG,CAEb;IAED,iBAAiB;CAGlB;AAED,wBAAgB,WAAW,CACzB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAGzE"}

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

@@ -216,7 +216,6 @@ var QueryImpl = class {
 				...scalar !== void 0 ? { scalar } : {}
 			};
 		}
-		assert(!scalar, "scalar option only supports one-hop relationships");
 		if (isTwoHop(related)) {
 			const [firstRelation, secondRelation] = related;
 			assert(isCompoundKey(firstRelation.sourceField), "Invalid relationship");
@@ -251,7 +250,8 @@ var QueryImpl = class {
 								subquery: asQueryImpl(queryToDest).#ast
 							},
 							op: "EXISTS",
-							...flip !== void 0 ? { flip } : {}
+							...flip !== void 0 ? { flip } : {},
+							...scalar !== void 0 ? { scalar } : {}
 						}
 					}
 				},

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

@@ -1 +1 @@
-{"version":3,"file":"query-impl.js","names":["#schema","#tableName","#ast","#system","#currentJunction","#newQuery","#hash","#exists"],"sources":["../../../../../zql/src/query/query-impl.ts"],"sourcesContent":["// oxlint-disable no-explicit-any\nimport {assert} from '../../../shared/src/asserts.ts';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport {\n  type AST,\n  type CompoundKey,\n  type Condition,\n  type Parameter,\n  type SimpleOperator,\n  type System,\n  SUBQ_PREFIX,\n} from '../../../zero-protocol/src/ast.ts';\nimport {hashOfAST} from '../../../zero-protocol/src/query-hash.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport {NotImplementedError} from '../error.ts';\nimport {defaultFormat} from '../ivm/default-format.ts';\nimport type {Format, ViewFactory} from '../ivm/view.ts';\nimport {\n  type ExpressionFactory,\n  ExpressionBuilder,\n  and,\n  cmp,\n  simplifyCondition,\n} from './expression.ts';\nimport type {CustomQueryID} from './named.ts';\nimport {type QueryInternals, queryInternalsTag} from './query-internals.ts';\nimport type {\n  AnyQuery,\n  ExistsOptions,\n  GetFilterType,\n  HumanReadable,\n  PreloadOptions,\n  PullRow,\n  Query,\n  RunOptions,\n} from './query.ts';\nimport type {TTL} from './ttl.ts';\nimport type {TypedView} from './typed-view.ts';\n\ntype GetFilterTypeAny = GetFilterType<any, any, any>;\n\ntype NewQueryFunction<TSchema extends Schema> = <\n  TTable extends keyof TSchema['tables'] & string,\n  TReturn,\n>(\n  this: unknown,\n  tableName: TTable,\n  ast: AST,\n  format: Format,\n  customQueryID: CustomQueryID | undefined,\n  currentJunction: string | undefined,\n) => QueryImpl<TTable, TSchema, TReturn>;\n\nexport function newQuery<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n>(schema: TSchema, table: TTable): Query<TTable, TSchema> {\n  return newQueryImpl(schema, table, {table}, defaultFormat, 'client');\n}\n\nexport function newQueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn = PullRow<TTable, TSchema>,\n>(\n  schema: TSchema,\n  tableName: TTable,\n  ast: AST,\n  format: Format,\n  system: System,\n): QueryImpl<TTable, TSchema, TReturn> {\n  const inner: NewQueryFunction<TSchema> = (\n    tableName,\n    ast,\n    format,\n    customQueryID,\n    currentJunction,\n  ) =>\n    new QueryImpl(\n      schema,\n      tableName,\n      ast,\n      format,\n      system,\n      customQueryID,\n      currentJunction,\n      inner,\n    );\n\n  return inner(tableName, ast, format, undefined, undefined);\n}\n\nexport class QueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn = PullRow<TTable, TSchema>,\n>\n  implements\n    Query<TTable, TSchema, TReturn>,\n    QueryInternals<TTable, TSchema, TReturn>\n{\n  readonly [queryInternalsTag] = true;\n\n  readonly #schema: TSchema;\n  readonly #tableName: TTable;\n  readonly #ast: AST;\n  readonly format: Format;\n  #hash: string = '';\n  readonly #system: System;\n  readonly #currentJunction: string | undefined;\n  readonly customQueryID: CustomQueryID | undefined;\n  readonly #newQuery: NewQueryFunction<TSchema>;\n\n  constructor(\n    schema: TSchema,\n    tableName: TTable,\n    ast: AST,\n    format: Format,\n    system: System,\n    customQueryID: CustomQueryID | undefined,\n    currentJunction: string | undefined,\n    newQuery: NewQueryFunction<TSchema>,\n  ) {\n    this.#schema = schema;\n    this.#tableName = tableName;\n    this.#ast = ast;\n    this.format = format;\n    this.#system = system;\n    this.#currentJunction = currentJunction;\n    this.customQueryID = customQueryID;\n    this.#newQuery = newQuery;\n  }\n\n  run(_options?: RunOptions): Promise<HumanReadable<TReturn>> {\n    throwQueryNotRunnable();\n  }\n\n  preload(_options?: PreloadOptions): {\n    cleanup: () => void;\n    complete: Promise<void>;\n  } {\n    throwQueryNotRunnable();\n  }\n\n  materialize(ttl?: TTL): TypedView<HumanReadable<TReturn>>;\n  materialize<T>(\n    factory: ViewFactory<TTable, TSchema, TReturn, T>,\n    ttl?: TTL,\n  ): T;\n  materialize<T>(\n    _factoryOrTTL?: ViewFactory<TTable, TSchema, TReturn, T> | TTL,\n    _ttl?: TTL,\n  ): T | TypedView<HumanReadable<TReturn>> {\n    throwQueryNotRunnable();\n  }\n\n  nameAndArgs(\n    name: string,\n    args: ReadonlyArray<ReadonlyJSONValue>,\n  ): Query<TTable, TSchema, TReturn> {\n    return this.#newQuery(\n      this.#tableName,\n      this.#ast,\n      this.format,\n      {\n        name,\n        args,\n      },\n      this.#currentJunction,\n    );\n  }\n\n  hash(): string {\n    if (!this.#hash) {\n      this.#hash = hashOfAST(this.#ast);\n    }\n    return this.#hash;\n  }\n\n  one = (): Query<TTable, TSchema, TReturn | undefined> =>\n    this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        limit: 1,\n      },\n      {\n        ...this.format,\n        singular: true,\n      },\n      this.customQueryID,\n      this.#currentJunction,\n    );\n\n  whereExists = (\n    relationship: string,\n    cbOrOptions?: ((q: AnyQuery) => AnyQuery) | ExistsOptions,\n    options?: ExistsOptions,\n  ): Query<TTable, TSchema, TReturn> => {\n    const cb = typeof cbOrOptions === 'function' ? cbOrOptions : undefined;\n    const opts = typeof cbOrOptions === 'function' ? options : cbOrOptions;\n    return this.where(({exists}) => exists(relationship, cb, opts)) as Query<\n      TTable,\n      TSchema,\n      TReturn\n    >;\n  };\n\n  related = (\n    relationship: string,\n    cb?: (q: AnyQuery) => AnyQuery,\n  ): Query<TTable, TSchema, any> => {\n    if (relationship.startsWith(SUBQ_PREFIX)) {\n      throw new Error(\n        `Relationship names may not start with \"${SUBQ_PREFIX}\". That is a reserved prefix.`,\n      );\n    }\n    cb = cb ?? (q => q);\n\n    const related = this.#schema.relationships[this.#tableName][relationship];\n    assert(related, 'Invalid relationship');\n    if (isOneHop(related)) {\n      const {destSchema, destField, sourceField, cardinality} = related[0];\n      const q: AnyQuery = this.#newQuery(\n        destSchema,\n        {\n          table: destSchema,\n          alias: relationship,\n        },\n        {\n          relationships: {},\n          singular: cardinality === 'one',\n        },\n        this.customQueryID,\n        undefined,\n      ) as AnyQuery;\n      // Intentionally not setting to `one` as it is a perf degradation\n      // and the user should not be making the mistake of setting cardinality to\n      // `one` when it is actually not.\n      // if (cardinality === 'one') {\n      //   q = q.one();\n      // }\n      const subQuery = asQueryImpl(cb(q));\n      assert(\n        isCompoundKey(sourceField),\n        'The source of a relationship must specify at last 1 field',\n      );\n      assert(\n        isCompoundKey(destField),\n        'The destination of a relationship must specify at last 1 field',\n      );\n      assert(\n        sourceField.length === destField.length,\n        'The source and destination of a relationship must have the same number of fields',\n      );\n\n      return this.#newQuery(\n        this.#tableName,\n        {\n          ...this.#ast,\n          related: [\n            ...(this.#ast.related ?? []),\n            {\n              system: this.#system,\n              correlation: {\n                parentField: sourceField,\n                childField: destField,\n              },\n              subquery: subQuery.#ast,\n            },\n          ],\n        },\n        {\n          ...this.format,\n          relationships: {\n            ...this.format.relationships,\n            [relationship]: subQuery.format,\n          },\n        },\n        this.customQueryID,\n        this.#currentJunction,\n      ) as AnyQuery;\n    }\n\n    if (isTwoHop(related)) {\n      const [firstRelation, secondRelation] = related;\n      const {destSchema} = secondRelation;\n      const junctionSchema = firstRelation.destSchema;\n      const sq = asQueryImpl(\n        cb(\n          this.#newQuery(\n            destSchema,\n            {\n              table: destSchema,\n              alias: relationship,\n            },\n            {\n              relationships: {},\n              singular: secondRelation.cardinality === 'one',\n            },\n            this.customQueryID,\n            relationship,\n          ),\n        ),\n      );\n\n      assert(isCompoundKey(firstRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(firstRelation.destField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.destField), 'Invalid relationship');\n\n      return this.#newQuery(\n        this.#tableName,\n        {\n          ...this.#ast,\n          related: [\n            ...(this.#ast.related ?? []),\n            {\n              system: this.#system,\n              correlation: {\n                parentField: firstRelation.sourceField,\n                childField: firstRelation.destField,\n              },\n              hidden: true,\n              subquery: {\n                table: junctionSchema,\n                alias: relationship,\n                related: [\n                  {\n                    system: this.#system,\n                    correlation: {\n                      parentField: secondRelation.sourceField,\n                      childField: secondRelation.destField,\n                    },\n                    subquery: sq.#ast,\n                  },\n                ],\n              },\n            },\n          ],\n        },\n        {\n          ...this.format,\n          relationships: {\n            ...this.format.relationships,\n            [relationship]: sq.format,\n          },\n        },\n        this.customQueryID,\n        this.#currentJunction,\n      ) as AnyQuery;\n    }\n\n    throw new Error(`Invalid relationship ${relationship}`);\n  };\n\n  where = function (\n    this: QueryImpl<TTable, TSchema, TReturn>,\n    fieldOrExpressionFactory: string | ExpressionFactory<TTable, TSchema>,\n    opOrValue?: SimpleOperator | GetFilterTypeAny | Parameter,\n    value?: GetFilterTypeAny | Parameter,\n  ): Query<TTable, TSchema, TReturn> {\n    let cond: Condition;\n\n    if (typeof fieldOrExpressionFactory === 'function') {\n      cond = fieldOrExpressionFactory(this.expressionBuilder());\n    } else {\n      assert(arguments.length >= 2, 'Invalid condition. Too few arguments.');\n      // Distinguish between 2-arg form (field, value) and 3-arg form (field, op, value)\n      // using arguments.length to allow explicit undefined in 3-arg form.\n      if (arguments.length === 2) {\n        cond = cmp(fieldOrExpressionFactory, opOrValue);\n      } else {\n        cond = cmp(fieldOrExpressionFactory, opOrValue, value);\n      }\n    }\n\n    const existingWhere = this.#ast.where;\n    if (existingWhere) {\n      cond = and(existingWhere, cond);\n    }\n\n    const where = simplifyCondition(cond);\n\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        where,\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  }.bind(this);\n\n  start = (\n    row: Partial<Record<string, ReadonlyJSONValue | undefined>>,\n    opts?: {inclusive: boolean},\n  ): Query<TTable, TSchema, TReturn> =>\n    this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        start: {\n          row,\n          exclusive: !opts?.inclusive,\n        },\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n\n  limit = (limit: number): Query<TTable, TSchema, TReturn> => {\n    if (limit < 0) {\n      throw new Error('Limit must be non-negative');\n    }\n    if ((limit | 0) !== limit) {\n      throw new Error('Limit must be an integer');\n    }\n    if (this.#currentJunction) {\n      throw new NotImplementedError(\n        'Limit is not supported in junction relationships yet. Junction relationship being limited: ' +\n          this.#currentJunction,\n      );\n    }\n\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        limit,\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  };\n\n  orderBy = <TSelector extends keyof TSchema['tables'][TTable]['columns']>(\n    field: TSelector,\n    direction: 'asc' | 'desc',\n  ): Query<TTable, TSchema, TReturn> => {\n    if (this.#currentJunction) {\n      throw new NotImplementedError(\n        'Order by is not supported in junction relationships yet. Junction relationship being ordered: ' +\n          this.#currentJunction,\n      );\n    }\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        orderBy: [...(this.#ast.orderBy ?? []), [field as string, direction]],\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  };\n\n  #exists = (\n    relationship: string,\n    cb: ((query: AnyQuery) => AnyQuery) | undefined,\n    options?: ExistsOptions,\n  ): Condition => {\n    cb = cb ?? (q => q);\n    const flip = options?.flip;\n    const scalar = options?.scalar;\n    const related = this.#schema.relationships[this.#tableName][relationship];\n    assert(related, 'Invalid relationship');\n\n    if (isOneHop(related)) {\n      const {destSchema: destTableName, sourceField, destField} = related[0];\n      assert(isCompoundKey(sourceField), 'Invalid relationship');\n      assert(isCompoundKey(destField), 'Invalid relationship');\n\n      const subQuery = asQueryImpl(\n        cb(\n          this.#newQuery(\n            destTableName,\n            {\n              table: destTableName,\n              alias: `${SUBQ_PREFIX}${relationship}`,\n            },\n            defaultFormat,\n            this.customQueryID,\n            undefined,\n          ),\n        ),\n      );\n      return {\n        type: 'correlatedSubquery',\n        related: {\n          system: this.#system,\n          correlation: {\n            parentField: sourceField,\n            childField: destField,\n          },\n          subquery: subQuery.#ast,\n        },\n        op: 'EXISTS',\n        ...(flip !== undefined ? {flip} : {}),\n        ...(scalar !== undefined ? {scalar} : {}),\n      };\n    }\n\n    assert(!scalar, 'scalar option only supports one-hop relationships');\n\n    if (isTwoHop(related)) {\n      const [firstRelation, secondRelation] = related;\n      assert(isCompoundKey(firstRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(firstRelation.destField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.destField), 'Invalid relationship');\n      const {destSchema} = secondRelation;\n      const junctionSchema = firstRelation.destSchema;\n      const queryToDest = cb(\n        this.#newQuery(\n          destSchema,\n          {\n            table: destSchema,\n            alias: `${SUBQ_PREFIX}zhidden_${relationship}`,\n          },\n          defaultFormat,\n          this.customQueryID,\n          relationship,\n        ) as AnyQuery,\n      );\n\n      return {\n        type: 'correlatedSubquery',\n        related: {\n          system: this.#system,\n          correlation: {\n            parentField: firstRelation.sourceField,\n            childField: firstRelation.destField,\n          },\n          subquery: {\n            table: junctionSchema,\n            alias: `${SUBQ_PREFIX}${relationship}`,\n            where: {\n              type: 'correlatedSubquery',\n              related: {\n                system: this.#system,\n                correlation: {\n                  parentField: secondRelation.sourceField,\n                  childField: secondRelation.destField,\n                },\n                subquery: asQueryImpl(queryToDest).#ast,\n              },\n              op: 'EXISTS',\n              ...(flip !== undefined ? {flip} : {}),\n            },\n          },\n        },\n        op: 'EXISTS',\n        ...(flip !== undefined ? {flip} : {}),\n      };\n    }\n\n    throw new Error(`Invalid relationship ${relationship}`);\n  };\n\n  get ast(): AST {\n    return this.#ast;\n  }\n\n  expressionBuilder() {\n    return new ExpressionBuilder(this.#exists);\n  }\n}\n\nexport function asQueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(q: Query<TTable, TSchema, TReturn>): QueryImpl<TTable, TSchema, TReturn> {\n  assert(q instanceof QueryImpl, 'Expected QueryImpl instance');\n  return q;\n}\n\nfunction throwQueryNotRunnable(): never {\n  throw new Error('Query is not runnable');\n}\n\nfunction isCompoundKey(field: readonly string[]): field is CompoundKey {\n  return Array.isArray(field) && field.length >= 1;\n}\n\nfunction isOneHop<T>(r: readonly T[]): r is readonly [T] {\n  return r.length === 1;\n}\n\nfunction isTwoHop<T>(r: readonly T[]): r is readonly [T, T] {\n  return r.length === 2;\n}\n"],"mappings":";;;;;;;;AAqDA,SAAgB,SAGd,QAAiB,OAAuC;AACxD,QAAO,aAAa,QAAQ,OAAO,EAAC,OAAM,EAAE,eAAe,SAAS;;AAGtE,SAAgB,aAKd,QACA,WACA,KACA,QACA,QACqC;CACrC,MAAM,SACJ,WACA,KACA,QACA,eACA,oBAEA,IAAI,UACF,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,MACD;AAEH,QAAO,MAAM,WAAW,KAAK,QAAQ,KAAA,GAAW,KAAA,EAAU;;AAG5D,IAAa,YAAb,MAQA;CACE,CAAU,qBAAqB;CAE/B;CACA;CACA;CACA;CACA,QAAgB;CAChB;CACA;CACA;CACA;CAEA,YACE,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,UACA;AACA,QAAA,SAAe;AACf,QAAA,YAAkB;AAClB,QAAA,MAAY;AACZ,OAAK,SAAS;AACd,QAAA,SAAe;AACf,QAAA,kBAAwB;AACxB,OAAK,gBAAgB;AACrB,QAAA,WAAiB;;CAGnB,IAAI,UAAwD;AAC1D,yBAAuB;;CAGzB,QAAQ,UAGN;AACA,yBAAuB;;CAQzB,YACE,eACA,MACuC;AACvC,yBAAuB;;CAGzB,YACE,MACA,MACiC;AACjC,SAAO,MAAA,SACL,MAAA,WACA,MAAA,KACA,KAAK,QACL;GACE;GACA;GACD,EACD,MAAA,gBACD;;CAGH,OAAe;AACb,MAAI,CAAC,MAAA,KACH,OAAA,OAAa,UAAU,MAAA,IAAU;AAEnC,SAAO,MAAA;;CAGT,YACE,MAAA,SACE,MAAA,WACA;EACE,GAAG,MAAA;EACH,OAAO;EACR,EACD;EACE,GAAG,KAAK;EACR,UAAU;EACX,EACD,KAAK,eACL,MAAA,gBACD;CAEH,eACE,cACA,aACA,YACoC;EACpC,MAAM,KAAK,OAAO,gBAAgB,aAAa,cAAc,KAAA;EAC7D,MAAM,OAAO,OAAO,gBAAgB,aAAa,UAAU;AAC3D,SAAO,KAAK,OAAO,EAAC,aAAY,OAAO,cAAc,IAAI,KAAK,CAAC;;CAOjE,WACE,cACA,OACgC;AAChC,MAAI,aAAa,WAAA,SAAuB,CACtC,OAAM,IAAI,MACR,0CAA0C,YAAY,+BACvD;AAEH,OAAK,QAAO,MAAK;EAEjB,MAAM,UAAU,MAAA,OAAa,cAAc,MAAA,WAAiB;AAC5D,SAAO,SAAS,uBAAuB;AACvC,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,EAAC,YAAY,WAAW,aAAa,gBAAe,QAAQ;GAClE,MAAM,IAAc,MAAA,SAClB,YACA;IACE,OAAO;IACP,OAAO;IACR,EACD;IACE,eAAe,EAAE;IACjB,UAAU,gBAAgB;IAC3B,EACD,KAAK,eACL,KAAA,EACD;GAOD,MAAM,WAAW,YAAY,GAAG,EAAE,CAAC;AACnC,UACE,cAAc,YAAY,EAC1B,4DACD;AACD,UACE,cAAc,UAAU,EACxB,iEACD;AACD,UACE,YAAY,WAAW,UAAU,QACjC,mFACD;AAED,UAAO,MAAA,SACL,MAAA,WACA;IACE,GAAG,MAAA;IACH,SAAS,CACP,GAAI,MAAA,IAAU,WAAW,EAAE,EAC3B;KACE,QAAQ,MAAA;KACR,aAAa;MACX,aAAa;MACb,YAAY;MACb;KACD,UAAU,UAAA;KACX,CACF;IACF,EACD;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,SAAS;KAC1B;IACF,EACD,KAAK,eACL,MAAA,gBACD;;AAGH,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,CAAC,eAAe,kBAAkB;GACxC,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,KAAK,YACT,GACE,MAAA,SACE,YACA;IACE,OAAO;IACP,OAAO;IACR,EACD;IACE,eAAe,EAAE;IACjB,UAAU,eAAe,gBAAgB;IAC1C,EACD,KAAK,eACL,aACD,CACF,CACF;AAED,UAAO,cAAc,cAAc,YAAY,EAAE,uBAAuB;AACxE,UAAO,cAAc,cAAc,UAAU,EAAE,uBAAuB;AACtE,UAAO,cAAc,eAAe,YAAY,EAAE,uBAAuB;AACzE,UAAO,cAAc,eAAe,UAAU,EAAE,uBAAuB;AAEvE,UAAO,MAAA,SACL,MAAA,WACA;IACE,GAAG,MAAA;IACH,SAAS,CACP,GAAI,MAAA,IAAU,WAAW,EAAE,EAC3B;KACE,QAAQ,MAAA;KACR,aAAa;MACX,aAAa,cAAc;MAC3B,YAAY,cAAc;MAC3B;KACD,QAAQ;KACR,UAAU;MACR,OAAO;MACP,OAAO;MACP,SAAS,CACP;OACE,QAAQ,MAAA;OACR,aAAa;QACX,aAAa,eAAe;QAC5B,YAAY,eAAe;QAC5B;OACD,UAAU,IAAA;OACX,CACF;MACF;KACF,CACF;IACF,EACD;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,GAAG;KACpB;IACF,EACD,KAAK,eACL,MAAA,gBACD;;AAGH,QAAM,IAAI,MAAM,wBAAwB,eAAe;;CAGzD,QAAQ,SAEN,0BACA,WACA,OACiC;EACjC,IAAI;AAEJ,MAAI,OAAO,6BAA6B,WACtC,QAAO,yBAAyB,KAAK,mBAAmB,CAAC;OACpD;AACL,UAAO,UAAU,UAAU,GAAG,wCAAwC;AAGtE,OAAI,UAAU,WAAW,EACvB,QAAO,IAAI,0BAA0B,UAAU;OAE/C,QAAO,IAAI,0BAA0B,WAAW,MAAM;;EAI1D,MAAM,gBAAgB,MAAA,IAAU;AAChC,MAAI,cACF,QAAO,IAAI,eAAe,KAAK;EAGjC,MAAM,QAAQ,kBAAkB,KAAK;AAErC,SAAO,MAAA,SACL,MAAA,WACA;GACE,GAAG,MAAA;GACH;GACD,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;GACD,KAAK,KAAK;CAEZ,SACE,KACA,SAEA,MAAA,SACE,MAAA,WACA;EACE,GAAG,MAAA;EACH,OAAO;GACL;GACA,WAAW,CAAC,MAAM;GACnB;EACF,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;CAEH,SAAS,UAAmD;AAC1D,MAAI,QAAQ,EACV,OAAM,IAAI,MAAM,6BAA6B;AAE/C,OAAK,QAAQ,OAAO,MAClB,OAAM,IAAI,MAAM,2BAA2B;AAE7C,MAAI,MAAA,gBACF,OAAM,IAAI,oBACR,gGACE,MAAA,gBACH;AAGH,SAAO,MAAA,SACL,MAAA,WACA;GACE,GAAG,MAAA;GACH;GACD,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;;CAGH,WACE,OACA,cACoC;AACpC,MAAI,MAAA,gBACF,OAAM,IAAI,oBACR,mGACE,MAAA,gBACH;AAEH,SAAO,MAAA,SACL,MAAA,WACA;GACE,GAAG,MAAA;GACH,SAAS,CAAC,GAAI,MAAA,IAAU,WAAW,EAAE,EAAG,CAAC,OAAiB,UAAU,CAAC;GACtE,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;;CAGH,WACE,cACA,IACA,YACc;AACd,OAAK,QAAO,MAAK;EACjB,MAAM,OAAO,SAAS;EACtB,MAAM,SAAS,SAAS;EACxB,MAAM,UAAU,MAAA,OAAa,cAAc,MAAA,WAAiB;AAC5D,SAAO,SAAS,uBAAuB;AAEvC,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,EAAC,YAAY,eAAe,aAAa,cAAa,QAAQ;AACpE,UAAO,cAAc,YAAY,EAAE,uBAAuB;AAC1D,UAAO,cAAc,UAAU,EAAE,uBAAuB;GAExD,MAAM,WAAW,YACf,GACE,MAAA,SACE,eACA;IACE,OAAO;IACP,OAAO,GAAG,cAAc;IACzB,EACD,eACA,KAAK,eACL,KAAA,EACD,CACF,CACF;AACD,UAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,MAAA;KACR,aAAa;MACX,aAAa;MACb,YAAY;MACb;KACD,UAAU,UAAA;KACX;IACD,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,MAAK,GAAG,EAAE;IACpC,GAAI,WAAW,KAAA,IAAY,EAAC,QAAO,GAAG,EAAE;IACzC;;AAGH,SAAO,CAAC,QAAQ,oDAAoD;AAEpE,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,CAAC,eAAe,kBAAkB;AACxC,UAAO,cAAc,cAAc,YAAY,EAAE,uBAAuB;AACxE,UAAO,cAAc,cAAc,UAAU,EAAE,uBAAuB;AACtE,UAAO,cAAc,eAAe,YAAY,EAAE,uBAAuB;AACzE,UAAO,cAAc,eAAe,UAAU,EAAE,uBAAuB;GACvE,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,cAAc,GAClB,MAAA,SACE,YACA;IACE,OAAO;IACP,OAAO,GAAG,YAAY,UAAU;IACjC,EACD,eACA,KAAK,eACL,aACD,CACF;AAED,UAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,MAAA;KACR,aAAa;MACX,aAAa,cAAc;MAC3B,YAAY,cAAc;MAC3B;KACD,UAAU;MACR,OAAO;MACP,OAAO,GAAG,cAAc;MACxB,OAAO;OACL,MAAM;OACN,SAAS;QACP,QAAQ,MAAA;QACR,aAAa;SACX,aAAa,eAAe;SAC5B,YAAY,eAAe;SAC5B;QACD,UAAU,YAAY,YAAY,EAAA;QACnC;OACD,IAAI;OACJ,GAAI,SAAS,KAAA,IAAY,EAAC,MAAK,GAAG,EAAE;OACrC;MACF;KACF;IACD,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,MAAK,GAAG,EAAE;IACrC;;AAGH,QAAM,IAAI,MAAM,wBAAwB,eAAe;;CAGzD,IAAI,MAAW;AACb,SAAO,MAAA;;CAGT,oBAAoB;AAClB,SAAO,IAAI,kBAAkB,MAAA,OAAa;;;AAI9C,SAAgB,YAId,GAAyE;AACzE,QAAO,aAAa,WAAW,8BAA8B;AAC7D,QAAO;;AAGT,SAAS,wBAA+B;AACtC,OAAM,IAAI,MAAM,wBAAwB;;AAG1C,SAAS,cAAc,OAAgD;AACrE,QAAO,MAAM,QAAQ,MAAM,IAAI,MAAM,UAAU;;AAGjD,SAAS,SAAY,GAAoC;AACvD,QAAO,EAAE,WAAW;;AAGtB,SAAS,SAAY,GAAuC;AAC1D,QAAO,EAAE,WAAW"}
+{"version":3,"file":"query-impl.js","names":["#schema","#tableName","#ast","#system","#currentJunction","#newQuery","#hash","#exists"],"sources":["../../../../../zql/src/query/query-impl.ts"],"sourcesContent":["// oxlint-disable no-explicit-any\nimport {assert} from '../../../shared/src/asserts.ts';\nimport type {ReadonlyJSONValue} from '../../../shared/src/json.ts';\nimport {\n  type AST,\n  type CompoundKey,\n  type Condition,\n  type Parameter,\n  type SimpleOperator,\n  type System,\n  SUBQ_PREFIX,\n} from '../../../zero-protocol/src/ast.ts';\nimport {hashOfAST} from '../../../zero-protocol/src/query-hash.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport {NotImplementedError} from '../error.ts';\nimport {defaultFormat} from '../ivm/default-format.ts';\nimport type {Format, ViewFactory} from '../ivm/view.ts';\nimport {\n  type ExpressionFactory,\n  ExpressionBuilder,\n  and,\n  cmp,\n  simplifyCondition,\n} from './expression.ts';\nimport type {CustomQueryID} from './named.ts';\nimport {type QueryInternals, queryInternalsTag} from './query-internals.ts';\nimport type {\n  AnyQuery,\n  ExistsOptions,\n  GetFilterType,\n  HumanReadable,\n  PreloadOptions,\n  PullRow,\n  Query,\n  RunOptions,\n} from './query.ts';\nimport type {TTL} from './ttl.ts';\nimport type {TypedView} from './typed-view.ts';\n\ntype GetFilterTypeAny = GetFilterType<any, any, any>;\n\ntype NewQueryFunction<TSchema extends Schema> = <\n  TTable extends keyof TSchema['tables'] & string,\n  TReturn,\n>(\n  this: unknown,\n  tableName: TTable,\n  ast: AST,\n  format: Format,\n  customQueryID: CustomQueryID | undefined,\n  currentJunction: string | undefined,\n) => QueryImpl<TTable, TSchema, TReturn>;\n\nexport function newQuery<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n>(schema: TSchema, table: TTable): Query<TTable, TSchema> {\n  return newQueryImpl(schema, table, {table}, defaultFormat, 'client');\n}\n\nexport function newQueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn = PullRow<TTable, TSchema>,\n>(\n  schema: TSchema,\n  tableName: TTable,\n  ast: AST,\n  format: Format,\n  system: System,\n): QueryImpl<TTable, TSchema, TReturn> {\n  const inner: NewQueryFunction<TSchema> = (\n    tableName,\n    ast,\n    format,\n    customQueryID,\n    currentJunction,\n  ) =>\n    new QueryImpl(\n      schema,\n      tableName,\n      ast,\n      format,\n      system,\n      customQueryID,\n      currentJunction,\n      inner,\n    );\n\n  return inner(tableName, ast, format, undefined, undefined);\n}\n\nexport class QueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn = PullRow<TTable, TSchema>,\n>\n  implements\n    Query<TTable, TSchema, TReturn>,\n    QueryInternals<TTable, TSchema, TReturn>\n{\n  readonly [queryInternalsTag] = true;\n\n  readonly #schema: TSchema;\n  readonly #tableName: TTable;\n  readonly #ast: AST;\n  readonly format: Format;\n  #hash: string = '';\n  readonly #system: System;\n  readonly #currentJunction: string | undefined;\n  readonly customQueryID: CustomQueryID | undefined;\n  readonly #newQuery: NewQueryFunction<TSchema>;\n\n  constructor(\n    schema: TSchema,\n    tableName: TTable,\n    ast: AST,\n    format: Format,\n    system: System,\n    customQueryID: CustomQueryID | undefined,\n    currentJunction: string | undefined,\n    newQuery: NewQueryFunction<TSchema>,\n  ) {\n    this.#schema = schema;\n    this.#tableName = tableName;\n    this.#ast = ast;\n    this.format = format;\n    this.#system = system;\n    this.#currentJunction = currentJunction;\n    this.customQueryID = customQueryID;\n    this.#newQuery = newQuery;\n  }\n\n  run(_options?: RunOptions): Promise<HumanReadable<TReturn>> {\n    throwQueryNotRunnable();\n  }\n\n  preload(_options?: PreloadOptions): {\n    cleanup: () => void;\n    complete: Promise<void>;\n  } {\n    throwQueryNotRunnable();\n  }\n\n  materialize(ttl?: TTL): TypedView<HumanReadable<TReturn>>;\n  materialize<T>(\n    factory: ViewFactory<TTable, TSchema, TReturn, T>,\n    ttl?: TTL,\n  ): T;\n  materialize<T>(\n    _factoryOrTTL?: ViewFactory<TTable, TSchema, TReturn, T> | TTL,\n    _ttl?: TTL,\n  ): T | TypedView<HumanReadable<TReturn>> {\n    throwQueryNotRunnable();\n  }\n\n  nameAndArgs(\n    name: string,\n    args: ReadonlyArray<ReadonlyJSONValue>,\n  ): Query<TTable, TSchema, TReturn> {\n    return this.#newQuery(\n      this.#tableName,\n      this.#ast,\n      this.format,\n      {\n        name,\n        args,\n      },\n      this.#currentJunction,\n    );\n  }\n\n  hash(): string {\n    if (!this.#hash) {\n      this.#hash = hashOfAST(this.#ast);\n    }\n    return this.#hash;\n  }\n\n  one = (): Query<TTable, TSchema, TReturn | undefined> =>\n    this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        limit: 1,\n      },\n      {\n        ...this.format,\n        singular: true,\n      },\n      this.customQueryID,\n      this.#currentJunction,\n    );\n\n  whereExists = (\n    relationship: string,\n    cbOrOptions?: ((q: AnyQuery) => AnyQuery) | ExistsOptions,\n    options?: ExistsOptions,\n  ): Query<TTable, TSchema, TReturn> => {\n    const cb = typeof cbOrOptions === 'function' ? cbOrOptions : undefined;\n    const opts = typeof cbOrOptions === 'function' ? options : cbOrOptions;\n    return this.where(({exists}) => exists(relationship, cb, opts)) as Query<\n      TTable,\n      TSchema,\n      TReturn\n    >;\n  };\n\n  related = (\n    relationship: string,\n    cb?: (q: AnyQuery) => AnyQuery,\n  ): Query<TTable, TSchema, any> => {\n    if (relationship.startsWith(SUBQ_PREFIX)) {\n      throw new Error(\n        `Relationship names may not start with \"${SUBQ_PREFIX}\". That is a reserved prefix.`,\n      );\n    }\n    cb = cb ?? (q => q);\n\n    const related = this.#schema.relationships[this.#tableName][relationship];\n    assert(related, 'Invalid relationship');\n    if (isOneHop(related)) {\n      const {destSchema, destField, sourceField, cardinality} = related[0];\n      const q: AnyQuery = this.#newQuery(\n        destSchema,\n        {\n          table: destSchema,\n          alias: relationship,\n        },\n        {\n          relationships: {},\n          singular: cardinality === 'one',\n        },\n        this.customQueryID,\n        undefined,\n      ) as AnyQuery;\n      // Intentionally not setting to `one` as it is a perf degradation\n      // and the user should not be making the mistake of setting cardinality to\n      // `one` when it is actually not.\n      // if (cardinality === 'one') {\n      //   q = q.one();\n      // }\n      const subQuery = asQueryImpl(cb(q));\n      assert(\n        isCompoundKey(sourceField),\n        'The source of a relationship must specify at last 1 field',\n      );\n      assert(\n        isCompoundKey(destField),\n        'The destination of a relationship must specify at last 1 field',\n      );\n      assert(\n        sourceField.length === destField.length,\n        'The source and destination of a relationship must have the same number of fields',\n      );\n\n      return this.#newQuery(\n        this.#tableName,\n        {\n          ...this.#ast,\n          related: [\n            ...(this.#ast.related ?? []),\n            {\n              system: this.#system,\n              correlation: {\n                parentField: sourceField,\n                childField: destField,\n              },\n              subquery: subQuery.#ast,\n            },\n          ],\n        },\n        {\n          ...this.format,\n          relationships: {\n            ...this.format.relationships,\n            [relationship]: subQuery.format,\n          },\n        },\n        this.customQueryID,\n        this.#currentJunction,\n      ) as AnyQuery;\n    }\n\n    if (isTwoHop(related)) {\n      const [firstRelation, secondRelation] = related;\n      const {destSchema} = secondRelation;\n      const junctionSchema = firstRelation.destSchema;\n      const sq = asQueryImpl(\n        cb(\n          this.#newQuery(\n            destSchema,\n            {\n              table: destSchema,\n              alias: relationship,\n            },\n            {\n              relationships: {},\n              singular: secondRelation.cardinality === 'one',\n            },\n            this.customQueryID,\n            relationship,\n          ),\n        ),\n      );\n\n      assert(isCompoundKey(firstRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(firstRelation.destField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.destField), 'Invalid relationship');\n\n      return this.#newQuery(\n        this.#tableName,\n        {\n          ...this.#ast,\n          related: [\n            ...(this.#ast.related ?? []),\n            {\n              system: this.#system,\n              correlation: {\n                parentField: firstRelation.sourceField,\n                childField: firstRelation.destField,\n              },\n              hidden: true,\n              subquery: {\n                table: junctionSchema,\n                alias: relationship,\n                related: [\n                  {\n                    system: this.#system,\n                    correlation: {\n                      parentField: secondRelation.sourceField,\n                      childField: secondRelation.destField,\n                    },\n                    subquery: sq.#ast,\n                  },\n                ],\n              },\n            },\n          ],\n        },\n        {\n          ...this.format,\n          relationships: {\n            ...this.format.relationships,\n            [relationship]: sq.format,\n          },\n        },\n        this.customQueryID,\n        this.#currentJunction,\n      ) as AnyQuery;\n    }\n\n    throw new Error(`Invalid relationship ${relationship}`);\n  };\n\n  where = function (\n    this: QueryImpl<TTable, TSchema, TReturn>,\n    fieldOrExpressionFactory: string | ExpressionFactory<TTable, TSchema>,\n    opOrValue?: SimpleOperator | GetFilterTypeAny | Parameter,\n    value?: GetFilterTypeAny | Parameter,\n  ): Query<TTable, TSchema, TReturn> {\n    let cond: Condition;\n\n    if (typeof fieldOrExpressionFactory === 'function') {\n      cond = fieldOrExpressionFactory(this.expressionBuilder());\n    } else {\n      assert(arguments.length >= 2, 'Invalid condition. Too few arguments.');\n      // Distinguish between 2-arg form (field, value) and 3-arg form (field, op, value)\n      // using arguments.length to allow explicit undefined in 3-arg form.\n      if (arguments.length === 2) {\n        cond = cmp(fieldOrExpressionFactory, opOrValue);\n      } else {\n        cond = cmp(fieldOrExpressionFactory, opOrValue, value);\n      }\n    }\n\n    const existingWhere = this.#ast.where;\n    if (existingWhere) {\n      cond = and(existingWhere, cond);\n    }\n\n    const where = simplifyCondition(cond);\n\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        where,\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  }.bind(this);\n\n  start = (\n    row: Partial<Record<string, ReadonlyJSONValue | undefined>>,\n    opts?: {inclusive: boolean},\n  ): Query<TTable, TSchema, TReturn> =>\n    this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        start: {\n          row,\n          exclusive: !opts?.inclusive,\n        },\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n\n  limit = (limit: number): Query<TTable, TSchema, TReturn> => {\n    if (limit < 0) {\n      throw new Error('Limit must be non-negative');\n    }\n    if ((limit | 0) !== limit) {\n      throw new Error('Limit must be an integer');\n    }\n    if (this.#currentJunction) {\n      throw new NotImplementedError(\n        'Limit is not supported in junction relationships yet. Junction relationship being limited: ' +\n          this.#currentJunction,\n      );\n    }\n\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        limit,\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  };\n\n  orderBy = <TSelector extends keyof TSchema['tables'][TTable]['columns']>(\n    field: TSelector,\n    direction: 'asc' | 'desc',\n  ): Query<TTable, TSchema, TReturn> => {\n    if (this.#currentJunction) {\n      throw new NotImplementedError(\n        'Order by is not supported in junction relationships yet. Junction relationship being ordered: ' +\n          this.#currentJunction,\n      );\n    }\n    return this.#newQuery(\n      this.#tableName,\n      {\n        ...this.#ast,\n        orderBy: [...(this.#ast.orderBy ?? []), [field as string, direction]],\n      },\n      this.format,\n      this.customQueryID,\n      this.#currentJunction,\n    );\n  };\n\n  #exists = (\n    relationship: string,\n    cb: ((query: AnyQuery) => AnyQuery) | undefined,\n    options?: ExistsOptions,\n  ): Condition => {\n    cb = cb ?? (q => q);\n    const flip = options?.flip;\n    const scalar = options?.scalar;\n    const related = this.#schema.relationships[this.#tableName][relationship];\n    assert(related, 'Invalid relationship');\n\n    if (isOneHop(related)) {\n      const {destSchema: destTableName, sourceField, destField} = related[0];\n      assert(isCompoundKey(sourceField), 'Invalid relationship');\n      assert(isCompoundKey(destField), 'Invalid relationship');\n\n      const subQuery = asQueryImpl(\n        cb(\n          this.#newQuery(\n            destTableName,\n            {\n              table: destTableName,\n              alias: `${SUBQ_PREFIX}${relationship}`,\n            },\n            defaultFormat,\n            this.customQueryID,\n            undefined,\n          ),\n        ),\n      );\n      return {\n        type: 'correlatedSubquery',\n        related: {\n          system: this.#system,\n          correlation: {\n            parentField: sourceField,\n            childField: destField,\n          },\n          subquery: subQuery.#ast,\n        },\n        op: 'EXISTS',\n        ...(flip !== undefined ? {flip} : {}),\n        ...(scalar !== undefined ? {scalar} : {}),\n      };\n    }\n\n    if (isTwoHop(related)) {\n      const [firstRelation, secondRelation] = related;\n      assert(isCompoundKey(firstRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(firstRelation.destField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.sourceField), 'Invalid relationship');\n      assert(isCompoundKey(secondRelation.destField), 'Invalid relationship');\n      const {destSchema} = secondRelation;\n      const junctionSchema = firstRelation.destSchema;\n      const queryToDest = cb(\n        this.#newQuery(\n          destSchema,\n          {\n            table: destSchema,\n            alias: `${SUBQ_PREFIX}zhidden_${relationship}`,\n          },\n          defaultFormat,\n          this.customQueryID,\n          relationship,\n        ) as AnyQuery,\n      );\n\n      return {\n        type: 'correlatedSubquery',\n        related: {\n          system: this.#system,\n          correlation: {\n            parentField: firstRelation.sourceField,\n            childField: firstRelation.destField,\n          },\n          subquery: {\n            table: junctionSchema,\n            alias: `${SUBQ_PREFIX}${relationship}`,\n            where: {\n              type: 'correlatedSubquery',\n              related: {\n                system: this.#system,\n                correlation: {\n                  parentField: secondRelation.sourceField,\n                  childField: secondRelation.destField,\n                },\n                subquery: asQueryImpl(queryToDest).#ast,\n              },\n              op: 'EXISTS',\n              ...(flip !== undefined ? {flip} : {}),\n              ...(scalar !== undefined ? {scalar} : {}),\n            },\n          },\n        },\n        op: 'EXISTS',\n        ...(flip !== undefined ? {flip} : {}),\n      };\n    }\n\n    throw new Error(`Invalid relationship ${relationship}`);\n  };\n\n  get ast(): AST {\n    return this.#ast;\n  }\n\n  expressionBuilder() {\n    return new ExpressionBuilder(this.#exists);\n  }\n}\n\nexport function asQueryImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(q: Query<TTable, TSchema, TReturn>): QueryImpl<TTable, TSchema, TReturn> {\n  assert(q instanceof QueryImpl, 'Expected QueryImpl instance');\n  return q;\n}\n\nfunction throwQueryNotRunnable(): never {\n  throw new Error('Query is not runnable');\n}\n\nfunction isCompoundKey(field: readonly string[]): field is CompoundKey {\n  return Array.isArray(field) && field.length >= 1;\n}\n\nfunction isOneHop<T>(r: readonly T[]): r is readonly [T] {\n  return r.length === 1;\n}\n\nfunction isTwoHop<T>(r: readonly T[]): r is readonly [T, T] {\n  return r.length === 2;\n}\n"],"mappings":";;;;;;;;AAqDA,SAAgB,SAGd,QAAiB,OAAuC;AACxD,QAAO,aAAa,QAAQ,OAAO,EAAC,OAAM,EAAE,eAAe,SAAS;;AAGtE,SAAgB,aAKd,QACA,WACA,KACA,QACA,QACqC;CACrC,MAAM,SACJ,WACA,KACA,QACA,eACA,oBAEA,IAAI,UACF,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,MACD;AAEH,QAAO,MAAM,WAAW,KAAK,QAAQ,KAAA,GAAW,KAAA,EAAU;;AAG5D,IAAa,YAAb,MAQA;CACE,CAAU,qBAAqB;CAE/B;CACA;CACA;CACA;CACA,QAAgB;CAChB;CACA;CACA;CACA;CAEA,YACE,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,UACA;AACA,QAAA,SAAe;AACf,QAAA,YAAkB;AAClB,QAAA,MAAY;AACZ,OAAK,SAAS;AACd,QAAA,SAAe;AACf,QAAA,kBAAwB;AACxB,OAAK,gBAAgB;AACrB,QAAA,WAAiB;;CAGnB,IAAI,UAAwD;AAC1D,yBAAuB;;CAGzB,QAAQ,UAGN;AACA,yBAAuB;;CAQzB,YACE,eACA,MACuC;AACvC,yBAAuB;;CAGzB,YACE,MACA,MACiC;AACjC,SAAO,MAAA,SACL,MAAA,WACA,MAAA,KACA,KAAK,QACL;GACE;GACA;GACD,EACD,MAAA,gBACD;;CAGH,OAAe;AACb,MAAI,CAAC,MAAA,KACH,OAAA,OAAa,UAAU,MAAA,IAAU;AAEnC,SAAO,MAAA;;CAGT,YACE,MAAA,SACE,MAAA,WACA;EACE,GAAG,MAAA;EACH,OAAO;EACR,EACD;EACE,GAAG,KAAK;EACR,UAAU;EACX,EACD,KAAK,eACL,MAAA,gBACD;CAEH,eACE,cACA,aACA,YACoC;EACpC,MAAM,KAAK,OAAO,gBAAgB,aAAa,cAAc,KAAA;EAC7D,MAAM,OAAO,OAAO,gBAAgB,aAAa,UAAU;AAC3D,SAAO,KAAK,OAAO,EAAC,aAAY,OAAO,cAAc,IAAI,KAAK,CAAC;;CAOjE,WACE,cACA,OACgC;AAChC,MAAI,aAAa,WAAA,SAAuB,CACtC,OAAM,IAAI,MACR,0CAA0C,YAAY,+BACvD;AAEH,OAAK,QAAO,MAAK;EAEjB,MAAM,UAAU,MAAA,OAAa,cAAc,MAAA,WAAiB;AAC5D,SAAO,SAAS,uBAAuB;AACvC,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,EAAC,YAAY,WAAW,aAAa,gBAAe,QAAQ;GAClE,MAAM,IAAc,MAAA,SAClB,YACA;IACE,OAAO;IACP,OAAO;IACR,EACD;IACE,eAAe,EAAE;IACjB,UAAU,gBAAgB;IAC3B,EACD,KAAK,eACL,KAAA,EACD;GAOD,MAAM,WAAW,YAAY,GAAG,EAAE,CAAC;AACnC,UACE,cAAc,YAAY,EAC1B,4DACD;AACD,UACE,cAAc,UAAU,EACxB,iEACD;AACD,UACE,YAAY,WAAW,UAAU,QACjC,mFACD;AAED,UAAO,MAAA,SACL,MAAA,WACA;IACE,GAAG,MAAA;IACH,SAAS,CACP,GAAI,MAAA,IAAU,WAAW,EAAE,EAC3B;KACE,QAAQ,MAAA;KACR,aAAa;MACX,aAAa;MACb,YAAY;MACb;KACD,UAAU,UAAA;KACX,CACF;IACF,EACD;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,SAAS;KAC1B;IACF,EACD,KAAK,eACL,MAAA,gBACD;;AAGH,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,CAAC,eAAe,kBAAkB;GACxC,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,KAAK,YACT,GACE,MAAA,SACE,YACA;IACE,OAAO;IACP,OAAO;IACR,EACD;IACE,eAAe,EAAE;IACjB,UAAU,eAAe,gBAAgB;IAC1C,EACD,KAAK,eACL,aACD,CACF,CACF;AAED,UAAO,cAAc,cAAc,YAAY,EAAE,uBAAuB;AACxE,UAAO,cAAc,cAAc,UAAU,EAAE,uBAAuB;AACtE,UAAO,cAAc,eAAe,YAAY,EAAE,uBAAuB;AACzE,UAAO,cAAc,eAAe,UAAU,EAAE,uBAAuB;AAEvE,UAAO,MAAA,SACL,MAAA,WACA;IACE,GAAG,MAAA;IACH,SAAS,CACP,GAAI,MAAA,IAAU,WAAW,EAAE,EAC3B;KACE,QAAQ,MAAA;KACR,aAAa;MACX,aAAa,cAAc;MAC3B,YAAY,cAAc;MAC3B;KACD,QAAQ;KACR,UAAU;MACR,OAAO;MACP,OAAO;MACP,SAAS,CACP;OACE,QAAQ,MAAA;OACR,aAAa;QACX,aAAa,eAAe;QAC5B,YAAY,eAAe;QAC5B;OACD,UAAU,IAAA;OACX,CACF;MACF;KACF,CACF;IACF,EACD;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,GAAG;KACpB;IACF,EACD,KAAK,eACL,MAAA,gBACD;;AAGH,QAAM,IAAI,MAAM,wBAAwB,eAAe;;CAGzD,QAAQ,SAEN,0BACA,WACA,OACiC;EACjC,IAAI;AAEJ,MAAI,OAAO,6BAA6B,WACtC,QAAO,yBAAyB,KAAK,mBAAmB,CAAC;OACpD;AACL,UAAO,UAAU,UAAU,GAAG,wCAAwC;AAGtE,OAAI,UAAU,WAAW,EACvB,QAAO,IAAI,0BAA0B,UAAU;OAE/C,QAAO,IAAI,0BAA0B,WAAW,MAAM;;EAI1D,MAAM,gBAAgB,MAAA,IAAU;AAChC,MAAI,cACF,QAAO,IAAI,eAAe,KAAK;EAGjC,MAAM,QAAQ,kBAAkB,KAAK;AAErC,SAAO,MAAA,SACL,MAAA,WACA;GACE,GAAG,MAAA;GACH;GACD,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;GACD,KAAK,KAAK;CAEZ,SACE,KACA,SAEA,MAAA,SACE,MAAA,WACA;EACE,GAAG,MAAA;EACH,OAAO;GACL;GACA,WAAW,CAAC,MAAM;GACnB;EACF,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;CAEH,SAAS,UAAmD;AAC1D,MAAI,QAAQ,EACV,OAAM,IAAI,MAAM,6BAA6B;AAE/C,OAAK,QAAQ,OAAO,MAClB,OAAM,IAAI,MAAM,2BAA2B;AAE7C,MAAI,MAAA,gBACF,OAAM,IAAI,oBACR,gGACE,MAAA,gBACH;AAGH,SAAO,MAAA,SACL,MAAA,WACA;GACE,GAAG,MAAA;GACH;GACD,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;;CAGH,WACE,OACA,cACoC;AACpC,MAAI,MAAA,gBACF,OAAM,IAAI,oBACR,mGACE,MAAA,gBACH;AAEH,SAAO,MAAA,SACL,MAAA,WACA;GACE,GAAG,MAAA;GACH,SAAS,CAAC,GAAI,MAAA,IAAU,WAAW,EAAE,EAAG,CAAC,OAAiB,UAAU,CAAC;GACtE,EACD,KAAK,QACL,KAAK,eACL,MAAA,gBACD;;CAGH,WACE,cACA,IACA,YACc;AACd,OAAK,QAAO,MAAK;EACjB,MAAM,OAAO,SAAS;EACtB,MAAM,SAAS,SAAS;EACxB,MAAM,UAAU,MAAA,OAAa,cAAc,MAAA,WAAiB;AAC5D,SAAO,SAAS,uBAAuB;AAEvC,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,EAAC,YAAY,eAAe,aAAa,cAAa,QAAQ;AACpE,UAAO,cAAc,YAAY,EAAE,uBAAuB;AAC1D,UAAO,cAAc,UAAU,EAAE,uBAAuB;GAExD,MAAM,WAAW,YACf,GACE,MAAA,SACE,eACA;IACE,OAAO;IACP,OAAO,GAAG,cAAc;IACzB,EACD,eACA,KAAK,eACL,KAAA,EACD,CACF,CACF;AACD,UAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,MAAA;KACR,aAAa;MACX,aAAa;MACb,YAAY;MACb;KACD,UAAU,UAAA;KACX;IACD,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,MAAK,GAAG,EAAE;IACpC,GAAI,WAAW,KAAA,IAAY,EAAC,QAAO,GAAG,EAAE;IACzC;;AAGH,MAAI,SAAS,QAAQ,EAAE;GACrB,MAAM,CAAC,eAAe,kBAAkB;AACxC,UAAO,cAAc,cAAc,YAAY,EAAE,uBAAuB;AACxE,UAAO,cAAc,cAAc,UAAU,EAAE,uBAAuB;AACtE,UAAO,cAAc,eAAe,YAAY,EAAE,uBAAuB;AACzE,UAAO,cAAc,eAAe,UAAU,EAAE,uBAAuB;GACvE,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,cAAc,GAClB,MAAA,SACE,YACA;IACE,OAAO;IACP,OAAO,GAAG,YAAY,UAAU;IACjC,EACD,eACA,KAAK,eACL,aACD,CACF;AAED,UAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,MAAA;KACR,aAAa;MACX,aAAa,cAAc;MAC3B,YAAY,cAAc;MAC3B;KACD,UAAU;MACR,OAAO;MACP,OAAO,GAAG,cAAc;MACxB,OAAO;OACL,MAAM;OACN,SAAS;QACP,QAAQ,MAAA;QACR,aAAa;SACX,aAAa,eAAe;SAC5B,YAAY,eAAe;SAC5B;QACD,UAAU,YAAY,YAAY,EAAA;QACnC;OACD,IAAI;OACJ,GAAI,SAAS,KAAA,IAAY,EAAC,MAAK,GAAG,EAAE;OACpC,GAAI,WAAW,KAAA,IAAY,EAAC,QAAO,GAAG,EAAE;OACzC;MACF;KACF;IACD,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,MAAK,GAAG,EAAE;IACrC;;AAGH,QAAM,IAAI,MAAM,wBAAwB,eAAe;;CAGzD,IAAI,MAAW;AACb,SAAO,MAAA;;CAGT,oBAAoB;AAClB,SAAO,IAAI,kBAAkB,MAAA,OAAa;;;AAI9C,SAAgB,YAId,GAAyE;AACzE,QAAO,aAAa,WAAW,8BAA8B;AAC7D,QAAO;;AAGT,SAAS,wBAA+B;AACtC,OAAM,IAAI,MAAM,wBAAwB;;AAG1C,SAAS,cAAc,OAAgD;AACrE,QAAO,MAAM,QAAQ,MAAM,IAAI,MAAM,UAAU;;AAGjD,SAAS,SAAY,GAAoC;AACvD,QAAO,EAAE,WAAW;;AAGtB,SAAS,SAAY,GAAuC;AAC1D,QAAO,EAAE,WAAW"}

package/out/zql/src/query/query-registry.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"query-registry.d.ts","sourceRoot":"","sources":["../../../../../zql/src/query/query-registry.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,gBAAgB,EAAC,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAGL,KAAK,SAAS,EACf,MAAM,mCAAmC,CAAC;AAC3C,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,6BAA6B,CAAC;AAGnE,OAAO,KAAK,EACV,iBAAiB,EACjB,cAAc,EACd,aAAa,EACd,MAAM,0CAA0C,CAAC;AAClD,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAE9D,OAAO,KAAK,EAAC,OAAO,EAAE,KAAK,EAAC,MAAM,YAAY,CAAC;AAO/C,MAAM,MAAM,gBAAgB,CAC1B,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,IACN,OAAO,GAAG;IACZ,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;CAC7B,CAAC;AAEF;;;GAGG;AACH,MAAM,MAAM,WAAW,CACrB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,GAAG,MAAM,EACtD,OAAO,SAAS,MAAM,GAAG,aAAa,EACtC,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAClC,QAAQ,GAAG,cAAc,IACvB;IACF,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC1E,QAAQ,CAAC,GAAG,EAAE,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;CAC5E,GAAG,mBAAmB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;AAE7E,KAAK,mBAAmB,CACtB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,IACN,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,GAC5B,MAAM,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,GACvE,SAAS,SAAS,MAAM,GACtB;IACE,IAAI,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACtE,CACE,IAAI,CAAC,EAAE,MAAM,GACZ,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;CACtE,GACD;IACE,CACE,IAAI,EAAE,MAAM,GACX,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;CACtE,CAAC;AAGR,MAAM,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAE7E,wBAAgB,OAAO,CAAC,CAAC,SAAS,MAAM,EACtC,KAAK,EAAE,OAAO,GAEb,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAMrD;AAED,MAAM,MAAM,iBAAiB,CAC3B,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,IACN,cAAc,GAAG;IACnB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;CAC7B,CAAC;AAEF,MAAM,MAAM,YAAY,CACtB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,IACN;IACF,QAAQ,CAAC,OAAO,EAAE,WAAW,CAC3B,MAAM,EACN,MAAM,EACN,OAAO,EACP,OAAO,EACP,OAAO,EACP,QAAQ,CACT,CAAC;IACF,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,iBAAiB,CAC7B,MAAM,EACN,MAAM,EACN,OAAO,EACP,OAAO,EACP,OAAO,EACP,QAAQ,CACT,CAAC;CACH,CAAC;AAEF;;;;;GAKG;AACH,MAAM,MAAM,mBAAmB,CAC7B,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,IAEN,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,GACjE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AAEpC;;;;;;GAMG;AACH,eAAO,MAAM,iBAAiB,GAC5B,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,EAER,OAAO,mBAAmB,CACxB,MAAM,EACN,MAAM,EACN,OAAO,EACP,OAAO,EACP,OAAO,EACP,QAAQ,CACT,EACD,SAAS,QAAQ,KAChB,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAC4C,CAAC;AAM9E,wBAAgB,eAAe,CAAC,GAAG,EAAE,OAAO,GAAG,GAAG,IAAI,gBAAgB,CAMrE;AAED,MAAM,MAAM,kBAAkB,CAAC,OAAO,SAAS,MAAM,IAAI,eAAe,GAAG;IACzE,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;CAC3B,CAAC;AAEF,MAAM,MAAM,aAAa,CACvB,EAAE,SAAS,gBAAgB,EAC3B,CAAC,SAAS,MAAM,IACd,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG;IACvB,CAAC,GAAG,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC;CAC9B,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG;IAC7B,CAAC,GAAG,CAAC,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB,CAAC;AAEF,KAAK,WAAW,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC,SAAS,MAAM,IAAI;IAChE,QAAQ,EAAE,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,kBAAkB,GAEtD,WAAW,CACT,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,EACxB,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,EACpB,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EACrB,CAAC,EACD,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EACrB,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CACvB,GACD,EAAE,CAAC,CAAC,CAAC,SAAS,gBAAgB,GAC5B,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GACrB,KAAK;CACZ,CAAC;AAEF,MAAM,MAAM,aAAa,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC,SAAS,MAAM,IAAI;IACzE,QAAQ,EAAE,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,kBAAkB,GACtD,WAAW,CACT,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,EAExB,iBAAiB,GAAG,SAAS,EAC7B,iBAAiB,GAAG,SAAS,EAC7B,CAAC,EACD,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EACrB,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CACvB,GACD,EAAE,CAAC,CAAC,CAAC,SAAS,gBAAgB,GAC5B,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GACvB,KAAK;CACZ,CAAC,MAAM,EAAE,CAAC,CAAC;AAEZ,MAAM,MAAM,gBAAgB,GAAG;IAC7B,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,kBAAkB,GAAG,gBAAgB,CAAC;CAC/D,CAAC;AAMF,MAAM,MAAM,oBAAoB,CAC9B,MAAM,SAAS,MAAM,EACrB,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,EACP,OAAO,EACP,QAAQ,IACN,iBAAiB,GAAG;IACtB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;CAC7B,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,eAAe,CACzB,MAAM,SAAS,MAAM,EACrB,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,EACP,QAAQ,GAAG,cAAc,IACvB;IACF,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC3E,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;IACpE,QAAQ,CAAC,GAAG,EAAE,oBAAoB,CAChC,MAAM,EACN,MAAM,EACN,OAAO,EACP,OAAO,EACP,QAAQ,CACT,CAAC;CACH,CAAC;AAGF,MAAM,MAAM,kBAAkB,GAAG,eAAe,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAE1E,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,kBAAkB,CAMrE;AAED,MAAM,MAAM,uBAAuB,CACjC,MAAM,SAAS,MAAM,EACrB,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,EACP,QAAQ,IACN,CAAC,OAAO,EAAE;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAA;CAAC,KAAK,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AAE/E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AAEH,wBAAgB,WAAW,CACzB,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,QAAQ,GAAG,cAAc,EACzB,OAAO,SAAS,MAAM,GAAG,aAAa,EACtC,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,GACvE,MAAM,EACR,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAElC,OAAO,EAAE,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,GAClE,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;AAG9D,wBAAgB,WAAW,CACzB,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,QAAQ,GAAG,cAAc,EACzB,OAAO,SAAS,MAAM,GAAG,aAAa,EACtC,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,GACvE,MAAM,EACR,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAElC,SAAS,EAAE,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,EAC5C,OAAO,EAAE,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,GACnE,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;AAwD/D;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,mBAAmB,CACjC,CAAC,SAAS,MAAM,EAChB,CAAC,GAAG,OAAO,KACR,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAE5B;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,KAAK,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAMtE;;;GAGG;AACH,KAAK,gBAAgB,CAAC,OAAO,SAAS,MAAM,EAAE,QAAQ,IAAI;IAExD,CACE,KAAK,SAAS,iBAAiB,GAAG,SAAS,EAC3C,OAAO,EACP,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,GACvE,MAAM,EAER,OAAO,EAAE,uBAAuB,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,GACjE,eAAe,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAG5D,CACE,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,EACP,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,GACvE,MAAM,EAER,SAAS,EAAE,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,EAC5C,OAAO,EAAE,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,GACnE,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;CAChE,CAAC;AAMF,wBAAgB,WAAW,CACzB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,EAER,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,GACtE,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAkElE;AAMD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,wBAAgB,aAAa,CAE3B,KAAK,CAAC,EAAE,EACR,CAAC,SAAS,iBAAiB,GAAG,aAAa,EAE3C,IAAI,EAAE,EAAE,GAAG,sBAAsB,CAAC,EAAE,CAAC,GACpC,aAAa,CAAC,sBAAsB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAEhD,wBAAgB,aAAa,CAC3B,KAAK,CAAC,KAAK,EACX,KAAK,CAAC,UAAU,EAChB,CAAC,SAAS,iBAAiB,GAAG,aAAa,EAE3C,IAAI,EACA,aAAa,CAAC,sBAAsB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAC/C,CAAC,KAAK,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC,EAC3C,SAAS,EAAE,UAAU,GAAG,sBAAsB,CAAC,UAAU,CAAC,GACzD,aAAa,CACd,SAAS,CACP,sBAAsB,CAAC,KAAK,CAAC,EAC7B,sBAAsB,CAAC,UAAU,CAAC,EAClC,kBAAkB,CACnB,EACD,CAAC,CACF,CAAC;AAqDF,MAAM,MAAM,sBAAsB,CAAC,EAAE,IAAI,EAAE,SAAS,gBAAgB,GAChE,OAAO,GACP,KAAK,CAAC;AAEV,MAAM,MAAM,sBAAsB,CAAC,EAAE,IAAI,EAAE,SAAS,gBAAgB,GAChE,EAAE,GACF,EAAE,SAAS,aAAa,CAAC,MAAM,OAAO,EAAE,MAAM,EAAE,CAAC,GAC/C,OAAO,GACP,KAAK,CAAC;AAEZ;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,SAAS,MAAM,KACnB,kBAAkB,CAAC,OAAO,CAAC,CAE/B;AAED;;;GAGG;AACH,KAAK,kBAAkB,CAAC,CAAC,SAAS,MAAM,IAAI;IAE1C,CAAC,EAAE,EACD,WAAW,EAAE,EAAE,GAAG,sBAAsB,CAAC,EAAE,CAAC,GAC3C,aAAa,CAAC,sBAAsB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAGhD,CAAC,KAAK,EAAE,UAAU,EAChB,IAAI,EACA,aAAa,CAAC,sBAAsB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAC/C,CAAC,KAAK,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC,EAC3C,SAAS,EAAE,UAAU,GAAG,sBAAsB,CAAC,UAAU,CAAC,GACzD,aAAa,CACd,SAAS,CACP,sBAAsB,CAAC,KAAK,CAAC,EAC7B,sBAAsB,CAAC,UAAU,CAAC,EAClC,kBAAkB,CACnB,EACD,CAAC,CACF,CAAC;CACH,CAAC;AAMF,wBAAgB,QAAQ,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC,SAAS,MAAM,EACpE,OAAO,EAAE,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC,EAC7B,IAAI,EAAE,MAAM,GACX,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,SAAS,CAGlC;AAED,wBAAgB,YAAY,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC,SAAS,MAAM,EACxE,OAAO,EAAE,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC,EAC7B,IAAI,EAAE,MAAM,GACX,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC,CAMtB"}
+{"version":3,"file":"query-registry.d.ts","sourceRoot":"","sources":["../../../../../zql/src/query/query-registry.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,gBAAgB,EAAC,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAGL,KAAK,SAAS,EACf,MAAM,mCAAmC,CAAC;AAC3C,OAAO,KAAK,EAAC,iBAAiB,EAAC,MAAM,6BAA6B,CAAC;AAGnE,OAAO,KAAK,EACV,iBAAiB,EACjB,cAAc,EACd,aAAa,EACd,MAAM,0CAA0C,CAAC;AAClD,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,mCAAmC,CAAC;AAE9D,OAAO,KAAK,EAAC,OAAO,EAAE,KAAK,EAAC,MAAM,YAAY,CAAC;AAO/C,MAAM,MAAM,gBAAgB,CAC1B,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,IACN,OAAO,GAAG;IACZ,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;CAC7B,CAAC;AAEF;;;GAGG;AACH,MAAM,MAAM,WAAW,CACrB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,GAAG,MAAM,EACtD,OAAO,SAAS,MAAM,GAAG,aAAa,EACtC,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAClC,QAAQ,GAAG,cAAc,IACvB;IACF,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC1E,QAAQ,CAAC,GAAG,EAAE,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;CAC5E,GAAG,mBAAmB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;AAE7E,KAAK,mBAAmB,CACtB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,IACN,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,GAC5B,MAAM,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,GACvE,SAAS,SAAS,MAAM,GACtB;IACE,IAAI,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACtE,CACE,IAAI,CAAC,EAAE,MAAM,GACZ,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;CACtE,GACD;IACE,CACE,IAAI,EAAE,MAAM,GACX,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;CACtE,CAAC;AAGR,MAAM,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAE7E,wBAAgB,OAAO,CAAC,CAAC,SAAS,MAAM,EACtC,KAAK,EAAE,OAAO,GAEb,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAMrD;AAED,MAAM,MAAM,iBAAiB,CAC3B,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,IACN,cAAc,GAAG;IACnB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;CAC7B,CAAC;AAEF,MAAM,MAAM,YAAY,CACtB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,IACN;IACF,QAAQ,CAAC,OAAO,EAAE,WAAW,CAC3B,MAAM,EACN,MAAM,EACN,OAAO,EACP,OAAO,EACP,OAAO,EACP,QAAQ,CACT,CAAC;IACF,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,iBAAiB,CAC7B,MAAM,EACN,MAAM,EACN,OAAO,EACP,OAAO,EACP,OAAO,EACP,QAAQ,CACT,CAAC;CACH,CAAC;AAEF;;;;;GAKG;AACH,MAAM,MAAM,mBAAmB,CAC7B,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,IAEN,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,GACjE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AAEpC;;;;;;GAMG;AACH,eAAO,MAAM,iBAAiB,GAC5B,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,EAER,OAAO,mBAAmB,CACxB,MAAM,EACN,MAAM,EACN,OAAO,EACP,OAAO,EACP,OAAO,EACP,QAAQ,CACT,EACD,SAAS,QAAQ,KAChB,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAC4C,CAAC;AAM9E,wBAAgB,eAAe,CAAC,GAAG,EAAE,OAAO,GAAG,GAAG,IAAI,gBAAgB,CAMrE;AAED,MAAM,MAAM,kBAAkB,CAAC,OAAO,SAAS,MAAM,IAAI,eAAe,GAAG;IACzE,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;CAC3B,CAAC;AAEF,MAAM,MAAM,aAAa,CACvB,EAAE,SAAS,gBAAgB,EAC3B,CAAC,SAAS,MAAM,IACd,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG;IACvB,CAAC,GAAG,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC;CAC9B,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG;IAC7B,CAAC,GAAG,CAAC,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB,CAAC;AAEF,KAAK,WAAW,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC,SAAS,MAAM,IAAI;IAChE,QAAQ,EAAE,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,kBAAkB,GAEtD,WAAW,CACT,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,EACxB,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,EACpB,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EACrB,CAAC,EACD,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EACrB,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CACvB,GACD,EAAE,CAAC,CAAC,CAAC,SAAS,gBAAgB,GAC5B,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GACrB,KAAK;CACZ,CAAC;AAEF,MAAM,MAAM,aAAa,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC,SAAS,MAAM,IAAI;IACzE,QAAQ,EAAE,CAAC,IAAI,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,kBAAkB,GACtD,WAAW,CACT,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,EAExB,iBAAiB,GAAG,SAAS,EAC7B,iBAAiB,GAAG,SAAS,EAC7B,CAAC,EACD,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EACrB,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CACvB,GACD,EAAE,CAAC,CAAC,CAAC,SAAS,gBAAgB,GAC5B,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GACvB,KAAK;CACZ,CAAC,MAAM,EAAE,CAAC,CAAC;AAEZ,MAAM,MAAM,gBAAgB,GAAG;IAC7B,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,kBAAkB,GAAG,gBAAgB,CAAC;CAC/D,CAAC;AAMF,MAAM,MAAM,oBAAoB,CAC9B,MAAM,SAAS,MAAM,EACrB,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,EACP,OAAO,EACP,QAAQ,IACN,iBAAiB,GAAG;IACtB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;CAC7B,CAAC;AAEF;;GAEG;AACH,MAAM,MAAM,eAAe,CACzB,MAAM,SAAS,MAAM,EACrB,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,EACP,QAAQ,GAAG,cAAc,IACvB;IACF,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC3E,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;IACpE,QAAQ,CAAC,GAAG,EAAE,oBAAoB,CAChC,MAAM,EACN,MAAM,EACN,OAAO,EACP,OAAO,EACP,QAAQ,CACT,CAAC;CACH,CAAC;AAGF,MAAM,MAAM,kBAAkB,GAAG,eAAe,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAE1E,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,kBAAkB,CAMrE;AAED,MAAM,MAAM,uBAAuB,CACjC,MAAM,SAAS,MAAM,EACrB,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,EACP,QAAQ,IACN,CAAC,OAAO,EAAE;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,QAAQ,CAAA;CAAC,KAAK,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AAE/E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4CG;AAEH,wBAAgB,WAAW,CACzB,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,QAAQ,GAAG,cAAc,EACzB,OAAO,SAAS,MAAM,GAAG,aAAa,EACtC,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,GACvE,MAAM,EACR,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAElC,OAAO,EAAE,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,GAClE,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;AAG9D,wBAAgB,WAAW,CACzB,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,QAAQ,GAAG,cAAc,EACzB,OAAO,SAAS,MAAM,GAAG,aAAa,EACtC,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,GACvE,MAAM,EACR,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAElC,SAAS,EAAE,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,EAC5C,OAAO,EAAE,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,GACnE,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;AAwD/D;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,mBAAmB,CACjC,CAAC,SAAS,MAAM,EAChB,CAAC,GAAG,OAAO,KACR,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAE5B;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,KAAK,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAMtE;;;GAGG;AACH,KAAK,gBAAgB,CAAC,OAAO,SAAS,MAAM,EAAE,QAAQ,IAAI;IAExD,CACE,KAAK,SAAS,iBAAiB,GAAG,SAAS,EAC3C,OAAO,EACP,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,GACvE,MAAM,EAER,OAAO,EAAE,uBAAuB,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,GACjE,eAAe,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAG5D,CACE,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,EACP,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,GACvE,MAAM,EAER,SAAS,EAAE,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,EAC5C,OAAO,EAAE,uBAAuB,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,GACnE,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;CAChE,CAAC;AAMF,wBAAgB,WAAW,CACzB,MAAM,SAAS,MAAM,OAAO,CAAC,QAAQ,CAAC,GAAG,MAAM,EAC/C,MAAM,SAAS,iBAAiB,GAAG,SAAS,EAC5C,OAAO,SAAS,iBAAiB,GAAG,SAAS,EAC7C,OAAO,SAAS,MAAM,EACtB,OAAO,EACP,QAAQ,EAER,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,GACtE,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,CAkElE;AAMD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,wBAAgB,aAAa,CAE3B,KAAK,CAAC,EAAE,EACR,CAAC,SAAS,iBAAiB,GAAG,aAAa,EAE3C,IAAI,EAAE,EAAE,GAAG,sBAAsB,CAAC,EAAE,CAAC,GACpC,aAAa,CAAC,sBAAsB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAEhD,wBAAgB,aAAa,CAC3B,KAAK,CAAC,KAAK,EACX,KAAK,CAAC,UAAU,EAChB,CAAC,SAAS,iBAAiB,GAAG,aAAa,EAE3C,IAAI,EACA,aAAa,CAAC,sBAAsB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAC/C,CAAC,KAAK,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC,EAC3C,SAAS,EAAE,UAAU,GAAG,sBAAsB,CAAC,UAAU,CAAC,GACzD,aAAa,CACd,SAAS,CACP,sBAAsB,CAAC,KAAK,CAAC,EAC7B,sBAAsB,CAAC,UAAU,CAAC,EAClC,kBAAkB,CACnB,EACD,CAAC,CACF,CAAC;AAqDF,MAAM,MAAM,sBAAsB,CAAC,EAAE,IAAI,EAAE,SAAS,gBAAgB,GAChE,OAAO,GACP,KAAK,CAAC;AAEV,MAAM,MAAM,sBAAsB,CAAC,EAAE,IAAI,EAAE,SAAS,gBAAgB,GAChE,EAAE,GACF,EAAE,SAAS,aAAa,CAAC,MAAM,OAAO,EAAE,MAAM,EAAE,CAAC,GAC/C,OAAO,GACP,KAAK,CAAC;AAEZ;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,OAAO,SAAS,MAAM,KACnB,kBAAkB,CAAC,OAAO,CAAC,CAE/B;AAED;;;GAGG;AACH,KAAK,kBAAkB,CAAC,CAAC,SAAS,MAAM,IAAI;IAE1C,CAAC,EAAE,EACD,WAAW,EAAE,EAAE,GAAG,sBAAsB,CAAC,EAAE,CAAC,GAC3C,aAAa,CAAC,sBAAsB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAGhD,CAAC,KAAK,EAAE,UAAU,EAChB,IAAI,EACA,aAAa,CAAC,sBAAsB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAC/C,CAAC,KAAK,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC,EAC3C,SAAS,EAAE,UAAU,GAAG,sBAAsB,CAAC,UAAU,CAAC,GACzD,aAAa,CACd,SAAS,CACP,sBAAsB,CAAC,KAAK,CAAC,EAC7B,sBAAsB,CAAC,UAAU,CAAC,EAClC,kBAAkB,CACnB,EACD,CAAC,CACF,CAAC;CACH,CAAC;AAQF,wBAAgB,QAAQ,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC,SAAS,MAAM,EACpE,OAAO,EAAE,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC,EAC7B,IAAI,EAAE,MAAM,GACX,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,SAAS,CAGlC;AAED,wBAAgB,YAAY,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC,SAAS,MAAM,EACxE,OAAO,EAAE,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC,EAC7B,IAAI,EAAE,MAAM,GACX,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC,CAMtB"}

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

@@ -92,8 +92,9 @@ var isQueryLeaf = (value) => !isPlainObject(value) || isQuery(value);
 function defineQueriesWithType() {
 	return defineQueries;
 }
+var separatorRe = /[.|]/;
 function getQuery(queries, name) {
-	return getValueAtPath(queries, name, /[.|]/);
+	return getValueAtPath(queries, name, separatorRe);
 }
 function mustGetQuery(queries, name) {
 	const query = getQuery(queries, name);

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

@@ -1 +1 @@
-{"version":3,"file":"query-registry.js","names":[],"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  BaseDefaultSchema,\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 BaseDefaultSchema = 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 BaseDefaultSchema = 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"],"mappings":";;;;;;AA+EA,SAAgB,QACd,OAEqD;AACrD,QACE,OAAO,UAAU,cACjB,OAAQ,MAAgC,cAAc,YACtD,OAAQ,MAAyB,OAAO;;;;;;;;;AAuE5C,IAAa,qBAQX,OAQA,YAEA,WAAW,QAAQ,MAAM,MAAM,GAAG;CAAC,KAAK;CAAS,MAAM,MAAM;CAAK,CAAC,GAAG;AAMxE,SAAgB,gBAAgB,KAAuC;AACrE,QACE,OAAO,QAAQ,YACf,QAAQ,QACP,MAAqC,SAAS;;AAkGnD,SAAgB,kBAAkB,GAAqC;AACrE,QACE,OAAO,MAAM,YACb,MAAM,QACL,EAAwB,SAAS;;AAmFtC,SAAgB,YASd,oBAGA,SAC6D;CAE7D,IAAI;CACJ,IAAI;AAOJ,KAAI,eAAe,oBAAoB;AAErC,cAAY;AACZ,kBAAgB,KAAK,QAAQ;QACxB;AAEL,cAAY,KAAA;AACZ,kBAAgB;;AAoBlB,QAXI;EACF,MAAM;EACN,aAAa;EACb,KAAK;EAON;;AA2CH,SAAgB,sBAAsB;AACpC,QAAO;;AAmCT,SAAgB,YAQd,MACA,YACkE;CAClE,MAAM,EAAC,cAAa;CAEpB,MAAM,MAKF,YAAW;EACb,MAAM,gBAAgB,YAClB,cAAc,MAAM,QAAQ,MAAM,WAAW,QAAQ,GACpD,QAAQ;AAEb,SAAO,iBACL,WAAW,GAAG;GACZ,MAAM;GACN,KAAK,QAAQ;GACd,CAAC,CACH,CAAC,YACA,MAGA,QAAQ,SAAS,KAAA,IAAY,EAAE,GAAG,CAAC,QAAQ,KAAK,CACjD;;CAGH,MAAM,SACJ,UACuE;EACvE;EACA,KAAK;EAQL,SAAS;EAQV;AAED,OAAM,YAAY;AAClB,OAAM,KAAK;AACX,OAAM,OAAO;AAQb,QAAO;;AAsET,SAAgB,cACd,YACA,WACsB;CACtB,SAAS,mBACP,aACA,MACkC;EAClC,MAAM,SAA2C,GAC9C,MAAM,iBACR;AAED,OAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,YAAY,EAAE;AACtD,QAAK,KAAK,IAAI;GACd,MAAM,cAAc,KAAK,KAAK,IAAI;AAElC,OAAI,kBAAkB,MAAM,CAC1B,QAAO,OAAO,YAAY,aAAa,MAAM;OAG7C,QAAO,OAAO,mBAAmB,OAAO,KAAK;AAE/C,QAAK,KAAK;;AAGZ,SAAO;;AAGT,KAAI,cAAc,KAAA,GAAW;EAG3B,IAAI;AACJ,MAAI,CAAC,gBAAgB,WAAW,CAC9B,QAAO,mBAAmB,YAAY,EAAE,CAAC;MAEzC,QAAO;EAGT,MAAM,YAAY,mBAAmB,WAAW,EAAE,CAAC;EAEnD,MAAM,SAAS,UAAU,MAAM,WAAW,YAAY;AACtD,SAAO,OAAO;AACd,SAAO;;AAGT,QAAO,mBAAmB,YAAkB,EAAE,CAAC;;AAGjD,IAAM,eAAe,UACnB,CAAC,cAAc,MAAM,IAAI,QAAQ,MAAM;;;;AAezC,SAAgB,wBAEiB;AAC/B,QAAO;;AAiCT,SAAgB,SACd,SACA,MACkC;AAElC,QADU,eAAe,SAAS,MAAM,OAAO;;AAIjD,SAAgB,aACd,SACA,MACsB;CACtB,MAAM,QAAQ,SAAS,SAAS,KAAK;AACrC,KAAI,UAAU,KAAA,EACZ,OAAM,IAAI,MAAM,oBAAoB,OAAO;AAE7C,QAAO"}
+{"version":3,"file":"query-registry.js","names":[],"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  BaseDefaultSchema,\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 BaseDefaultSchema = 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 BaseDefaultSchema = 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\nconst separatorRe = /[.|]/;\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, separatorRe);\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"],"mappings":";;;;;;AA+EA,SAAgB,QACd,OAEqD;AACrD,QACE,OAAO,UAAU,cACjB,OAAQ,MAAgC,cAAc,YACtD,OAAQ,MAAyB,OAAO;;;;;;;;;AAuE5C,IAAa,qBAQX,OAQA,YAEA,WAAW,QAAQ,MAAM,MAAM,GAAG;CAAC,KAAK;CAAS,MAAM,MAAM;CAAK,CAAC,GAAG;AAMxE,SAAgB,gBAAgB,KAAuC;AACrE,QACE,OAAO,QAAQ,YACf,QAAQ,QACP,MAAqC,SAAS;;AAkGnD,SAAgB,kBAAkB,GAAqC;AACrE,QACE,OAAO,MAAM,YACb,MAAM,QACL,EAAwB,SAAS;;AAmFtC,SAAgB,YASd,oBAGA,SAC6D;CAE7D,IAAI;CACJ,IAAI;AAOJ,KAAI,eAAe,oBAAoB;AAErC,cAAY;AACZ,kBAAgB,KAAK,QAAQ;QACxB;AAEL,cAAY,KAAA;AACZ,kBAAgB;;AAoBlB,QAXI;EACF,MAAM;EACN,aAAa;EACb,KAAK;EAON;;AA2CH,SAAgB,sBAAsB;AACpC,QAAO;;AAmCT,SAAgB,YAQd,MACA,YACkE;CAClE,MAAM,EAAC,cAAa;CAEpB,MAAM,MAKF,YAAW;EACb,MAAM,gBAAgB,YAClB,cAAc,MAAM,QAAQ,MAAM,WAAW,QAAQ,GACpD,QAAQ;AAEb,SAAO,iBACL,WAAW,GAAG;GACZ,MAAM;GACN,KAAK,QAAQ;GACd,CAAC,CACH,CAAC,YACA,MAGA,QAAQ,SAAS,KAAA,IAAY,EAAE,GAAG,CAAC,QAAQ,KAAK,CACjD;;CAGH,MAAM,SACJ,UACuE;EACvE;EACA,KAAK;EAQL,SAAS;EAQV;AAED,OAAM,YAAY;AAClB,OAAM,KAAK;AACX,OAAM,OAAO;AAQb,QAAO;;AAsET,SAAgB,cACd,YACA,WACsB;CACtB,SAAS,mBACP,aACA,MACkC;EAClC,MAAM,SAA2C,GAC9C,MAAM,iBACR;AAED,OAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,YAAY,EAAE;AACtD,QAAK,KAAK,IAAI;GACd,MAAM,cAAc,KAAK,KAAK,IAAI;AAElC,OAAI,kBAAkB,MAAM,CAC1B,QAAO,OAAO,YAAY,aAAa,MAAM;OAG7C,QAAO,OAAO,mBAAmB,OAAO,KAAK;AAE/C,QAAK,KAAK;;AAGZ,SAAO;;AAGT,KAAI,cAAc,KAAA,GAAW;EAG3B,IAAI;AACJ,MAAI,CAAC,gBAAgB,WAAW,CAC9B,QAAO,mBAAmB,YAAY,EAAE,CAAC;MAEzC,QAAO;EAGT,MAAM,YAAY,mBAAmB,WAAW,EAAE,CAAC;EAEnD,MAAM,SAAS,UAAU,MAAM,WAAW,YAAY;AACtD,SAAO,OAAO;AACd,SAAO;;AAGT,QAAO,mBAAmB,YAAkB,EAAE,CAAC;;AAGjD,IAAM,eAAe,UACnB,CAAC,cAAc,MAAM,IAAI,QAAQ,MAAM;;;;AAezC,SAAgB,wBAEiB;AAC/B,QAAO;;AA6BT,IAAM,cAAc;AAMpB,SAAgB,SACd,SACA,MACkC;AAElC,QADU,eAAe,SAAS,MAAM,YAAY;;AAItD,SAAgB,aACd,SACA,MACsB;CACtB,MAAM,QAAQ,SAAS,SAAS,KAAK;AACrC,KAAI,UAAU,KAAA,EACZ,OAAM,IAAI,MAAM,oBAAoB,OAAO;AAE7C,QAAO"}

package/out/zql/src/query/ttl.js

@@ -12,7 +12,7 @@ function parseTTL(ttl) {
 	if (typeof ttl === "number") return Number.isNaN(ttl) ? 0 : !Number.isFinite(ttl) || ttl < 0 ? -1 : ttl;
 	if (ttl === "none") return 0;
 	if (ttl === "forever") return -1;
-	const multi = multiplier[ttl[ttl.length - 1]];
+	const multi = multiplier[ttl.at(-1)];
 	return Number(ttl.slice(0, -1)) * multi;
 }
 function compareTTL(a, b) {

package/out/zql/src/query/ttl.js.map

@@ -1 +1 @@
-{"version":3,"file":"ttl.js","names":[],"sources":["../../../../../zql/src/query/ttl.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\n\nexport type TimeUnit = 's' | 'm' | 'h' | 'd' | 'y';\n\n/**\n * Time To Live. This is used for query expiration.\n * - `forever` means the query will never expire.\n * - `none` means the query will expire immediately.\n * - A number means the query will expire after that many milliseconds.\n * - A negative number means the query will never expire, this is same as 'forever'.\n * - A string like `1s` means the query will expire after that many seconds.\n * - A string like `1m` means the query will expire after that many minutes.\n * - A string like `1h` means the query will expire after that many hours.\n * - A string like `1d` means the query will expire after that many days.\n * - A string like `1y` means the query will expire after that many years.\n */\nexport type TTL = `${number}${TimeUnit}` | 'forever' | 'none' | number;\n\nexport const DEFAULT_TTL: TTL = '5m';\nexport const DEFAULT_TTL_MS = 1_000 * 60 * 5;\n\nexport const DEFAULT_PRELOAD_TTL: TTL = 'none';\nexport const DEFAULT_PRELOAD_TTL_MS = 0;\n\nexport const MAX_TTL: TTL = '10m';\nexport const MAX_TTL_MS = 1_000 * 60 * 10;\n\nconst multiplier = {\n  s: 1000,\n  m: 60 * 1000,\n  h: 60 * 60 * 1000,\n  d: 24 * 60 * 60 * 1000,\n  y: 365 * 24 * 60 * 60 * 1000,\n} as const;\n\nexport function parseTTL(ttl: TTL): number {\n  if (typeof ttl === 'number') {\n    return Number.isNaN(ttl) ? 0 : !Number.isFinite(ttl) || ttl < 0 ? -1 : ttl;\n  }\n  if (ttl === 'none') {\n    return 0;\n  }\n  if (ttl === 'forever') {\n    return -1;\n  }\n  const multi = multiplier[ttl[ttl.length - 1] as TimeUnit];\n  return Number(ttl.slice(0, -1)) * multi;\n}\n\nexport function compareTTL(a: TTL, b: TTL): number {\n  const ap = parseTTL(a);\n  const bp = parseTTL(b);\n  if (ap === -1 && bp !== -1) {\n    return 1;\n  }\n  if (ap !== -1 && bp === -1) {\n    return -1;\n  }\n  return ap - bp;\n}\n\nexport function normalizeTTL(ttl: TTL): TTL {\n  if (typeof ttl === 'string') {\n    return ttl;\n  }\n\n  if (ttl < 0) {\n    return 'forever';\n  }\n\n  if (ttl === 0) {\n    return 'none';\n  }\n\n  let shortest = ttl.toString();\n  const lengthOfNumber = shortest.length;\n  for (const unit of ['y', 'd', 'h', 'm', 's'] as const) {\n    const multi = multiplier[unit];\n    const value = ttl / multi;\n    const candidate = `${value}${unit}`;\n    if (candidate.length < shortest.length) {\n      shortest = candidate;\n    }\n  }\n\n  return (shortest.length < lengthOfNumber ? shortest : ttl) as TTL;\n}\n\nexport function clampTTL(ttl: TTL, lc?: Pick<LogContext, 'warn'>): number {\n  const parsedTTL = parseTTL(ttl);\n  if (parsedTTL === -1 || parsedTTL > 10 * 60 * 1000) {\n    // 10 minutes in milliseconds\n    lc?.warn?.(`TTL (${ttl}) is too high, clamping to ${MAX_TTL}`);\n    return parseTTL(MAX_TTL);\n  }\n  return parsedTTL;\n}\n"],"mappings":";AAmBA,IAAa,iBAAiB,MAAQ,KAAK;AAM3C,IAAa,aAAa,MAAQ,KAAK;AAEvC,IAAM,aAAa;CACjB,GAAG;CACH,GAAG,KAAK;CACR,GAAG,OAAU;CACb,GAAG,OAAU,KAAK;CAClB,GAAG,MAAM,KAAK,KAAK,KAAK;CACzB;AAED,SAAgB,SAAS,KAAkB;AACzC,KAAI,OAAO,QAAQ,SACjB,QAAO,OAAO,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,SAAS,IAAI,IAAI,MAAM,IAAI,KAAK;AAEzE,KAAI,QAAQ,OACV,QAAO;AAET,KAAI,QAAQ,UACV,QAAO;CAET,MAAM,QAAQ,WAAW,IAAI,IAAI,SAAS;AAC1C,QAAO,OAAO,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG;;AAGpC,SAAgB,WAAW,GAAQ,GAAgB;CACjD,MAAM,KAAK,SAAS,EAAE;CACtB,MAAM,KAAK,SAAS,EAAE;AACtB,KAAI,OAAO,MAAM,OAAO,GACtB,QAAO;AAET,KAAI,OAAO,MAAM,OAAO,GACtB,QAAO;AAET,QAAO,KAAK;;AAGd,SAAgB,aAAa,KAAe;AAC1C,KAAI,OAAO,QAAQ,SACjB,QAAO;AAGT,KAAI,MAAM,EACR,QAAO;AAGT,KAAI,QAAQ,EACV,QAAO;CAGT,IAAI,WAAW,IAAI,UAAU;CAC7B,MAAM,iBAAiB,SAAS;AAChC,MAAK,MAAM,QAAQ;EAAC;EAAK;EAAK;EAAK;EAAK;EAAI,EAAW;EAGrD,MAAM,YAAY,GADJ,MADA,WAAW,QAEI;AAC7B,MAAI,UAAU,SAAS,SAAS,OAC9B,YAAW;;AAIf,QAAQ,SAAS,SAAS,iBAAiB,WAAW;;AAGxD,SAAgB,SAAS,KAAU,IAAuC;CACxE,MAAM,YAAY,SAAS,IAAI;AAC/B,KAAI,cAAc,MAAM,YAAY,MAAU,KAAM;AAElD,MAAI,OAAO,QAAQ,IAAI,gCAAuC;AAC9D,SAAO,SAAA,MAAiB;;AAE1B,QAAO"}
+{"version":3,"file":"ttl.js","names":[],"sources":["../../../../../zql/src/query/ttl.ts"],"sourcesContent":["import type {LogContext} from '@rocicorp/logger';\n\nexport type TimeUnit = 's' | 'm' | 'h' | 'd' | 'y';\n\n/**\n * Time To Live. This is used for query expiration.\n * - `forever` means the query will never expire.\n * - `none` means the query will expire immediately.\n * - A number means the query will expire after that many milliseconds.\n * - A negative number means the query will never expire, this is same as 'forever'.\n * - A string like `1s` means the query will expire after that many seconds.\n * - A string like `1m` means the query will expire after that many minutes.\n * - A string like `1h` means the query will expire after that many hours.\n * - A string like `1d` means the query will expire after that many days.\n * - A string like `1y` means the query will expire after that many years.\n */\nexport type TTL = `${number}${TimeUnit}` | 'forever' | 'none' | number;\n\nexport const DEFAULT_TTL: TTL = '5m';\nexport const DEFAULT_TTL_MS = 1_000 * 60 * 5;\n\nexport const DEFAULT_PRELOAD_TTL: TTL = 'none';\nexport const DEFAULT_PRELOAD_TTL_MS = 0;\n\nexport const MAX_TTL: TTL = '10m';\nexport const MAX_TTL_MS = 1_000 * 60 * 10;\n\nconst multiplier = {\n  s: 1000,\n  m: 60 * 1000,\n  h: 60 * 60 * 1000,\n  d: 24 * 60 * 60 * 1000,\n  y: 365 * 24 * 60 * 60 * 1000,\n} as const;\n\nexport function parseTTL(ttl: TTL): number {\n  if (typeof ttl === 'number') {\n    return Number.isNaN(ttl) ? 0 : !Number.isFinite(ttl) || ttl < 0 ? -1 : ttl;\n  }\n  if (ttl === 'none') {\n    return 0;\n  }\n  if (ttl === 'forever') {\n    return -1;\n  }\n  const multi = multiplier[ttl.at(-1) as TimeUnit];\n  return Number(ttl.slice(0, -1)) * multi;\n}\n\nexport function compareTTL(a: TTL, b: TTL): number {\n  const ap = parseTTL(a);\n  const bp = parseTTL(b);\n  if (ap === -1 && bp !== -1) {\n    return 1;\n  }\n  if (ap !== -1 && bp === -1) {\n    return -1;\n  }\n  return ap - bp;\n}\n\nexport function normalizeTTL(ttl: TTL): TTL {\n  if (typeof ttl === 'string') {\n    return ttl;\n  }\n\n  if (ttl < 0) {\n    return 'forever';\n  }\n\n  if (ttl === 0) {\n    return 'none';\n  }\n\n  let shortest = ttl.toString();\n  const lengthOfNumber = shortest.length;\n  for (const unit of ['y', 'd', 'h', 'm', 's'] as const) {\n    const multi = multiplier[unit];\n    const value = ttl / multi;\n    const candidate = `${value}${unit}`;\n    if (candidate.length < shortest.length) {\n      shortest = candidate;\n    }\n  }\n\n  return (shortest.length < lengthOfNumber ? shortest : ttl) as TTL;\n}\n\nexport function clampTTL(ttl: TTL, lc?: Pick<LogContext, 'warn'>): number {\n  const parsedTTL = parseTTL(ttl);\n  if (parsedTTL === -1 || parsedTTL > 10 * 60 * 1000) {\n    // 10 minutes in milliseconds\n    lc?.warn?.(`TTL (${ttl}) is too high, clamping to ${MAX_TTL}`);\n    return parseTTL(MAX_TTL);\n  }\n  return parsedTTL;\n}\n"],"mappings":";AAmBA,IAAa,iBAAiB,MAAQ,KAAK;AAM3C,IAAa,aAAa,MAAQ,KAAK;AAEvC,IAAM,aAAa;CACjB,GAAG;CACH,GAAG,KAAK;CACR,GAAG,OAAU;CACb,GAAG,OAAU,KAAK;CAClB,GAAG,MAAM,KAAK,KAAK,KAAK;CACzB;AAED,SAAgB,SAAS,KAAkB;AACzC,KAAI,OAAO,QAAQ,SACjB,QAAO,OAAO,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,SAAS,IAAI,IAAI,MAAM,IAAI,KAAK;AAEzE,KAAI,QAAQ,OACV,QAAO;AAET,KAAI,QAAQ,UACV,QAAO;CAET,MAAM,QAAQ,WAAW,IAAI,GAAG,GAAG;AACnC,QAAO,OAAO,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG;;AAGpC,SAAgB,WAAW,GAAQ,GAAgB;CACjD,MAAM,KAAK,SAAS,EAAE;CACtB,MAAM,KAAK,SAAS,EAAE;AACtB,KAAI,OAAO,MAAM,OAAO,GACtB,QAAO;AAET,KAAI,OAAO,MAAM,OAAO,GACtB,QAAO;AAET,QAAO,KAAK;;AAGd,SAAgB,aAAa,KAAe;AAC1C,KAAI,OAAO,QAAQ,SACjB,QAAO;AAGT,KAAI,MAAM,EACR,QAAO;AAGT,KAAI,QAAQ,EACV,QAAO;CAGT,IAAI,WAAW,IAAI,UAAU;CAC7B,MAAM,iBAAiB,SAAS;AAChC,MAAK,MAAM,QAAQ;EAAC;EAAK;EAAK;EAAK;EAAK;EAAI,EAAW;EAGrD,MAAM,YAAY,GADJ,MADA,WAAW,QAEI;AAC7B,MAAI,UAAU,SAAS,SAAS,OAC9B,YAAW;;AAIf,QAAQ,SAAS,SAAS,iBAAiB,WAAW;;AAGxD,SAAgB,SAAS,KAAU,IAAuC;CACxE,MAAM,YAAY,SAAS,IAAI;AAC/B,KAAI,cAAc,MAAM,YAAY,MAAU,KAAM;AAElD,MAAI,OAAO,QAAQ,IAAI,gCAAuC;AAC9D,SAAO,SAAA,MAAiB;;AAE1B,QAAO"}