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

package/out/zql/src/query/query-delegate-base.js.map

@@ -1 +1 @@
-{"version":3,"file":"query-delegate-base.js","names":[],"sources":["../../../../../zql/src/query/query-delegate-base.ts"],"sourcesContent":["import {resolver} from '@rocicorp/resolver';\nimport type {AST} from '../../../zero-protocol/src/ast.ts';\nimport type {ErroredQuery} from '../../../zero-protocol/src/custom-queries.ts';\nimport {\n  hashOfAST,\n  hashOfNameAndArgs,\n} from '../../../zero-protocol/src/query-hash.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport {buildPipeline} from '../builder/builder.ts';\nimport {ArrayView} from '../ivm/array-view.ts';\nimport {DeferredInput} from '../ivm/deferred-input.ts';\nimport type {FilterInput} from '../ivm/filter-operators.ts';\nimport {MemoryStorage} from '../ivm/memory-storage.ts';\nimport type {Input, InputBase, Storage} from '../ivm/operator.ts';\nimport type {Source, SourceInput} from '../ivm/source.ts';\nimport type {Format, ViewFactory} from '../ivm/view.ts';\nimport type {MetricMap} from './metrics-delegate.ts';\nimport type {CustomQueryID} from './named.ts';\nimport type {\n  AttachPipeline,\n  CommitListener,\n  GotCallback,\n  QueryDelegate,\n} from './query-delegate.ts';\nimport {asQueryInternals, type QueryInternals} from './query-internals.ts';\nimport type {\n  HumanReadable,\n  MaterializeOptions,\n  PreloadOptions,\n  Query,\n  RunOptions,\n} from './query.ts';\nimport {DEFAULT_PRELOAD_TTL_MS, DEFAULT_TTL_MS, type TTL} from './ttl.ts';\nimport type {TypedView} from './typed-view.ts';\n\n/**\n * Base class that provides default implementations for common QueryDelegate methods.\n * Subclasses can override specific methods as needed.\n */\nexport abstract class QueryDelegateBase implements QueryDelegate {\n  /**\n   * Default implementation that just calls applyViewUpdates synchronously.\n   * Override if you need custom batching behavior (e.g., SolidJS).\n   */\n  batchViewUpdates<T>(applyViewUpdates: () => T): T {\n    return applyViewUpdates();\n  }\n\n  /**\n   * Default implementation returns MemoryStorage.\n   * Override if you need custom storage.\n   */\n  createStorage(): Storage {\n    return new MemoryStorage();\n  }\n\n  /**\n   * Default implementation calls materializeImpl.\n   * Override if you need custom materialization behavior.\n   */\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: undefined,\n    options?: MaterializeOptions,\n  ): TypedView<HumanReadable<TReturn>>;\n\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T;\n\n  /**\n   * Materialize a query into a custom view using a provided factory function.\n   */\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T;\n\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T {\n    return materializeImpl(query, this, factory, options);\n  }\n\n  /**\n   * Default implementation calls runImpl.\n   * Override if you need custom query execution (e.g., TestPGQueryDelegate).\n   */\n  run<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    options?: RunOptions,\n  ): Promise<HumanReadable<TReturn>> {\n    return runImpl(query, this, options);\n  }\n\n  /**\n   * Default implementation calls preloadImpl.\n   * Override if you need custom preload behavior.\n   */\n  preload<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    options?: PreloadOptions,\n  ): {\n    cleanup: () => void;\n    complete: Promise<void>;\n    cached: Promise<void>;\n  } {\n    return preloadImpl(query, this, options);\n  }\n\n  /**\n   * Default no-op implementation for decorateSourceInput.\n   * Override if you need to wrap or instrument source inputs.\n   */\n  decorateSourceInput(input: SourceInput, _queryID: string): Input {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for decorateInput.\n   * Override if you need to wrap or instrument inputs.\n   */\n  decorateInput(input: Input, _name: string): Input {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for decorateFilterInput.\n   * Override if you need to wrap or instrument filter inputs.\n   */\n  decorateFilterInput(input: FilterInput, _name: string): FilterInput {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for addEdge.\n   * Override if you need to track graph edges (e.g., visualization).\n   */\n  addEdge(_source: InputBase, _dest: InputBase): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation for addMetric.\n   * Override if you need to collect metrics.\n   */\n  addMetric<K extends keyof MetricMap>(\n    _metric: K,\n    _value: number,\n    ..._args: MetricMap[K]\n  ): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to track server queries (e.g., ZeroContext, test delegates).\n   */\n  addServerQuery(_ast: AST, _ttl: TTL, _gotCallback?: GotCallback): () => void {\n    return () => {};\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to track custom queries (e.g., ZeroContext, test delegates).\n   */\n  addCustomQuery(\n    _ast: AST,\n    _customQueryID: CustomQueryID,\n    _ttl: TTL,\n    _gotCallback?: GotCallback,\n  ): () => void {\n    return () => {};\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to handle query updates.\n   */\n  updateServerQuery(_ast: AST, _ttl: TTL): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to handle custom query updates.\n   */\n  updateCustomQuery(_customQueryID: CustomQueryID, _ttl: TTL): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to flush query changes.\n   */\n  flushQueryChanges(): void {\n    // No-op\n  }\n\n  /**\n   * Called when a transaction commits. Override to add custom behavior.\n   * Default implementation returns a no-op cleanup function.\n   */\n  onTransactionCommit(_cb: CommitListener): () => void {\n    return () => {};\n  }\n\n  /**\n   * Validates run options. Override to add custom validation.\n   * Default implementation is a no-op.\n   */\n  assertValidRunOptions(_options?: RunOptions): void {\n    // No-op\n  }\n\n  abstract readonly defaultQueryComplete: boolean;\n\n  /**\n   * Default: pipelines can always be built immediately. Override (together\n   * with `onPipelinesReady`) to defer pipeline construction.\n   */\n  get pipelinesReady(): boolean {\n    return true;\n  }\n\n  onPipelinesReady(_attach: AttachPipeline): () => void {\n    throw new Error(\n      'onPipelinesReady called on a delegate whose pipelines are always ready',\n    );\n  }\n\n  // BuilderDelegate methods - must be implemented\n  abstract getSource(name: string): Source | undefined;\n}\n\n// oxlint-disable-next-line require-await\nexport async function runImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  options?: RunOptions,\n): Promise<HumanReadable<TReturn>> {\n  delegate.assertValidRunOptions(options);\n  const v: TypedView<HumanReadable<TReturn>> = materializeImpl(\n    query,\n    delegate,\n    undefined,\n    {\n      ttl: options?.ttl,\n    },\n  );\n  if (options?.type === 'complete' || options?.type === 'cached') {\n    // 'cached' is satisfied by a result the server confirmed on a previous\n    // connection, or by this connection confirming it, whichever comes first.\n    const acceptCached = options.type === 'cached';\n    return new Promise(resolve => {\n      v.addListener((data, type) => {\n        if (type === 'complete' || (acceptCached && type === 'cached')) {\n          v.destroy();\n          resolve(data as HumanReadable<TReturn>);\n        } else if (type === 'error') {\n          v.destroy();\n          resolve(Promise.reject(data));\n        }\n      });\n    });\n  }\n\n  options?.type satisfies 'unknown' | undefined;\n\n  // A snapshot of what the view holds right now. While the delegate's\n  // pipelines are not ready the view is deferred and this is empty; 'unknown'\n  // has never waited for the local data, so it does not wait for that either.\n  const ret = v.data;\n  v.destroy();\n  return ret;\n}\n\nexport function preloadImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  options?: PreloadOptions,\n): {\n  cleanup: () => void;\n  complete: Promise<void>;\n  cached: Promise<void>;\n} {\n  const qi = asQueryInternals(query);\n  const ttl = options?.ttl ?? DEFAULT_PRELOAD_TTL_MS;\n  const completeResolver = resolver<void>();\n  const cachedResolver = resolver<void>();\n  const {promise: complete} = completeResolver;\n  const {promise: cached} = cachedResolver;\n  // A caller may ignore either promise; a query error must not surface as an\n  // unhandled rejection through the one nobody awaits.\n  void complete.catch(() => {});\n  void cached.catch(() => {});\n  const {customQueryID, ast} = qi;\n  const gotCallback: GotCallback = (got, error) => {\n    if (error) {\n      // The query cannot be satisfied; neither waiter should hang.\n      cachedResolver.reject(error);\n      completeResolver.reject(error);\n      return;\n    }\n    // Only a server confirmation on this connection resolves `complete`;\n    // `cached` is also satisfied by one from a previous connection.\n    if (got === true) {\n      cachedResolver.resolve();\n      completeResolver.resolve();\n    } else if (got === 'cached') {\n      cachedResolver.resolve();\n    }\n  };\n  const cleanup = customQueryID\n    ? delegate.addCustomQuery(ast, customQueryID, ttl, gotCallback)\n    : delegate.addServerQuery(ast, ttl, gotCallback);\n  if (delegate.defaultQueryComplete) {\n    // A delegate whose results are complete from the start (a server-side\n    // one) has no got callback to drive the waiters.\n    cachedResolver.resolve();\n    completeResolver.resolve();\n  }\n  return {\n    cleanup,\n    complete,\n    cached,\n  };\n}\n\nexport function materializeImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n  T,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  factory: ViewFactory<\n    TTable,\n    TSchema,\n    TReturn,\n    T\n    // oxlint-disable-next-line no-explicit-any\n  > = arrayViewFactory as any,\n  options?: MaterializeOptions,\n): T {\n  let ttl: TTL = options?.ttl ?? DEFAULT_TTL_MS;\n\n  const qi = asQueryInternals(query);\n  const {ast, format, customQueryID} = qi;\n\n  const queryID = customQueryID\n    ? hashOfNameAndArgs(customQueryID.name, customQueryID.args)\n    : hashOfAST(qi.ast);\n  const queryCompleteResolver = resolver<true>();\n  // When the delegate cannot build pipelines yet, the view starts over an\n  // empty DeferredInput and is hydrated later. A view must not report\n  // `complete` until it has actually been hydrated, so completion is gated on\n  // both the server's \"got\" and the pipeline being attached.\n  const deferPipeline = !delegate.pipelinesReady;\n  let attached = !deferPipeline;\n  // The last got report: `true` once the server confirmed the query on this\n  // connection, `'cached'` while the store holds a previous connection's\n  // confirmed result, `false` otherwise.\n  let got: boolean | 'cached' = delegate.defaultQueryComplete;\n  let queryComplete: boolean | ErroredQuery = attached && got === true;\n  const updateTTL = customQueryID\n    ? (newTTL: TTL) => delegate.updateCustomQuery(customQueryID, newTTL)\n    : (newTTL: TTL) => delegate.updateServerQuery(ast, newTTL);\n\n  // Completion, and the end-to-end metric, require both the server's \"got\"\n  // and the pipeline being attached: until then the view is still empty.\n  const maybeResolveComplete = () => {\n    if (attached && got === true && queryComplete !== true) {\n      delegate.addMetric(\n        'query-materialization-end-to-end',\n        performance.now() - t0,\n        queryID,\n        ast,\n      );\n      queryComplete = true;\n      queryCompleteResolver.resolve(true);\n    }\n  };\n\n  // The view, seen as its optional hooks. Only views that implement\n  // `markCached`/`unmarkCached` (e.g. ArrayView) surface 'cached'; for any\n  // other factory the optional calls are no-ops. The registration path can\n  // report 'cached' synchronously, before the view below exists, so this\n  // stays undefined until then and the mark is applied afterwards.\n  let viewHooks: OptionalViewHooks | undefined;\n\n  // Like 'complete', 'cached' is a claim about the rows the view holds, so it\n  // waits for the view to exist and its pipeline to be attached. Once the\n  // server has confirmed the query on this connection, 'complete' supersedes\n  // it and the mark is skipped.\n  const maybeMarkCached = () => {\n    // Only while the query is still incomplete: 'complete' supersedes the\n    // mark, and an error that arrived before attach must not be preceded by\n    // a 'cached' notification.\n    if (attached && got === 'cached' && queryComplete === false) {\n      viewHooks?.markCached?.();\n    }\n  };\n\n  let destroyed = false;\n  const gotCallback: GotCallback = (value, error) => {\n    if (destroyed) {\n      // The delegate may keep this callback registered for a while after\n      // destroy (removals are deferred while mutations are pending); a dead\n      // view must not be driven, nor its listeners fired.\n      return;\n    }\n    if (error) {\n      queryCompleteResolver.reject(error);\n      queryComplete = error;\n      return;\n    }\n\n    got = value;\n    if (got === 'cached') {\n      maybeMarkCached();\n    } else if (got === false) {\n      // The got key was deleted (eviction) before the server confirmed the\n      // query on this connection.\n      viewHooks?.unmarkCached?.();\n    } else {\n      maybeResolveComplete();\n    }\n  };\n\n  let removeCommitObserver: (() => void) | undefined;\n  let removePendingAttach: (() => void) | undefined;\n  const onDestroy = () => {\n    destroyed = true;\n    removePendingAttach?.();\n    removePendingAttach = undefined;\n    input.destroy();\n    removeCommitObserver?.();\n    removeAddedQuery();\n  };\n\n  const t0 = performance.now();\n\n  const removeAddedQuery = customQueryID\n    ? delegate.addCustomQuery(ast, customQueryID, ttl, gotCallback)\n    : delegate.addServerQuery(ast, ttl, gotCallback);\n\n  const deferred = deferPipeline\n    ? newDeferredInput(ast, delegate, queryID)\n    : undefined;\n  // No type annotation here: annotating this as `Input` widens it enough that\n  // the view type loses the pipeline's concrete schema, and `Zero.run` then\n  // stops rejecting a query built from a schema with legacy queries enabled\n  // (custom.test.ts covers that rejection).\n  const input = deferred ?? buildPipeline(ast, delegate, queryID);\n\n  const view = delegate.batchViewUpdates(() =>\n    (factory ?? arrayViewFactory)(\n      query,\n      input,\n      format,\n      onDestroy,\n      cb => {\n        removeCommitObserver = delegate.onTransactionCommit(cb);\n      },\n      queryComplete || queryCompleteResolver.promise,\n      updateTTL,\n    ),\n  );\n\n  if (!deferred) {\n    delegate.addMetric(\n      'query-materialization-client',\n      performance.now() - t0,\n      queryID,\n    );\n  } else {\n    // Registered after the factory ran so a throwing factory leaves nothing\n    // behind.\n    removePendingAttach = delegate.onPipelinesReady(() => {\n      removePendingAttach = undefined;\n      if (deferred.destroyed) {\n        return () => {};\n      }\n      const t1 = performance.now();\n      try {\n        viewHooks?.holdData?.();\n        deferred.attach();\n      } catch (e) {\n        // Surface the failure on this view and let the delegate decide how\n        // to log it. Other pending pipelines are unaffected.\n        const error: ErroredQuery = {\n          error: 'app',\n          id: queryID,\n          name: customQueryID?.name ?? '',\n          message: e instanceof Error ? e.message : String(e),\n        };\n        queryComplete = error;\n        queryCompleteResolver.reject(error);\n        throw e;\n      }\n      const hydrateMs = performance.now() - t1;\n      // The view holds its rows now but must not say so yet: the delegate\n      // releases every view hydrated in the same batch together.\n      return () => {\n        if (destroyed) {\n          return;\n        }\n        attached = true;\n        viewHooks?.releaseData?.();\n        delegate.addMetric('query-materialization-client', hydrateMs, queryID);\n        maybeResolveComplete();\n        maybeMarkCached();\n      };\n    });\n  }\n\n  viewHooks = view as OptionalViewHooks;\n  maybeMarkCached();\n\n  return view as T;\n}\n\n/**\n * Creates the placeholder input for a query whose pipeline cannot be built yet.\n *\n * `Input.getSchema()` is unconditional, so the placeholder needs the schema up\n * front. It is captured by building a pipeline and immediately destroying it:\n * building only connects to the sources, while the indexes and rows -- the\n * expensive part this deferral exists to postpone -- are read on the first\n * fetch. Measured at ~5us against ~500us for a single 100 row fetch.\n *\n * Building here also means a query that cannot be built at all (an unknown\n * table, `not(exists())` on the client) still throws from `materialize()`,\n * as it did before hydration was deferred.\n */\nfunction newDeferredInput(\n  ast: AST,\n  delegate: QueryDelegate,\n  queryID: string,\n): DeferredInput {\n  const build = () => buildPipeline(ast, delegate, queryID);\n  const probe = build();\n  try {\n    return new DeferredInput(probe.getSchema(), build);\n  } finally {\n    probe.destroy();\n  }\n}\n\n/**\n * Optional methods `materialize` calls on a view when it has them (ArrayView\n * does). See {@link ViewFactory} for what a custom view needs to know.\n */\ntype OptionalViewHooks = {\n  // Surface the 'cached' result type. Views without these never show it.\n  markCached?: (() => void) | undefined;\n  unmarkCached?: (() => void) | undefined;\n  // Keep showing the current snapshot until `releaseData()` (or the next\n  // flush), and notify nobody until that flush, so a deferred view does not\n  // show rows ahead of its release.\n  holdData?: (() => void) | undefined;\n  // Called at the release: show the hydrated rows through `data` again, but\n  // leave notifying listeners to the flush that follows all the releases.\n  releaseData?: (() => void) | undefined;\n};\n\nfunction arrayViewFactory<\n  TTable extends string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  _query: QueryInternals<TTable, TSchema, TReturn>,\n  input: Input,\n  format: Format,\n  onDestroy: () => void,\n  onTransactionCommit: (cb: () => void) => void,\n  queryComplete: true | ErroredQuery | Promise<true>,\n  updateTTL: (ttl: TTL) => void,\n): TypedView<HumanReadable<TReturn>> {\n  const v = new ArrayView<HumanReadable<TReturn>>(\n    input,\n    format,\n    queryComplete,\n    updateTTL,\n  );\n  v.onDestroy = onDestroy;\n  onTransactionCommit(() => v.flush());\n  return v;\n}\n"],"mappings":";;;;;;;;;;;;;;AAuCA,IAAsB,oBAAtB,MAAiE;;;;;CAK/D,iBAAoB,kBAA8B;EAChD,OAAO,iBAAiB;CAC1B;;;;;CAMA,gBAAyB;EACvB,OAAO,IAAI,cAAc;CAC3B;CAyCA,YAME,OACA,SACA,SACG;EACH,OAAO,gBAAgB,OAAO,MAAM,SAAS,OAAO;CACtD;;;;;CAMA,IAKE,OACA,SACiC;EACjC,OAAO,QAAQ,OAAO,MAAM,OAAO;CACrC;;;;;CAMA,QAKE,OACA,SAKA;EACA,OAAO,YAAY,OAAO,MAAM,OAAO;CACzC;;;;;CAMA,oBAAoB,OAAoB,UAAyB;EAC/D,OAAO;CACT;;;;;CAMA,cAAc,OAAc,OAAsB;EAChD,OAAO;CACT;;;;;CAMA,oBAAoB,OAAoB,OAA4B;EAClE,OAAO;CACT;;;;;CAMA,QAAQ,SAAoB,OAAwB,CAEpD;;;;;CAMA,UACE,SACA,QACA,GAAG,OACG,CAER;;;;;CAMA,eAAe,MAAW,MAAW,cAAwC;EAC3E,aAAa,CAAC;CAChB;;;;;CAMA,eACE,MACA,gBACA,MACA,cACY;EACZ,aAAa,CAAC;CAChB;;;;;CAMA,kBAAkB,MAAW,MAAiB,CAE9C;;;;;CAMA,kBAAkB,gBAA+B,MAAiB,CAElE;;;;;CAMA,oBAA0B,CAE1B;;;;;CAMA,oBAAoB,KAAiC;EACnD,aAAa,CAAC;CAChB;;;;;CAMA,sBAAsB,UAA6B,CAEnD;;;;;CAQA,IAAI,iBAA0B;EAC5B,OAAO;CACT;CAEA,iBAAiB,SAAqC;EACpD,MAAM,IAAI,MACR,wEACF;CACF;AAIF;AAGA,eAAsB,QAKpB,OACA,UACA,SACiC;CACjC,SAAS,sBAAsB,OAAO;CACtC,MAAM,IAAuC,gBAC3C,OACA,UACA,KAAA,GACA,EACE,KAAK,SAAS,IAChB,CACF;CACA,IAAI,SAAS,SAAS,cAAc,SAAS,SAAS,UAAU;EAG9D,MAAM,eAAe,QAAQ,SAAS;EACtC,OAAO,IAAI,SAAQ,YAAW;GAC5B,EAAE,aAAa,MAAM,SAAS;IAC5B,IAAI,SAAS,cAAe,gBAAgB,SAAS,UAAW;KAC9D,EAAE,QAAQ;KACV,QAAQ,IAA8B;IACxC,OAAO,IAAI,SAAS,SAAS;KAC3B,EAAE,QAAQ;KACV,QAAQ,QAAQ,OAAO,IAAI,CAAC;IAC9B;GACF,CAAC;EACH,CAAC;CACH;CAEA,SAAS;CAKT,MAAM,MAAM,EAAE;CACd,EAAE,QAAQ;CACV,OAAO;AACT;AAEA,SAAgB,YAKd,OACA,UACA,SAKA;CACA,MAAM,KAAK,iBAAiB,KAAK;CACjC,MAAM,MAAM,SAAS,OAAA;CACrB,MAAM,mBAAmB,SAAe;CACxC,MAAM,iBAAiB,SAAe;CACtC,MAAM,EAAC,SAAS,aAAY;CAC5B,MAAM,EAAC,SAAS,WAAU;CAG1B,SAAc,YAAY,CAAC,CAAC;CAC5B,OAAY,YAAY,CAAC,CAAC;CAC1B,MAAM,EAAC,eAAe,QAAO;CAC7B,MAAM,eAA4B,KAAK,UAAU;EAC/C,IAAI,OAAO;GAET,eAAe,OAAO,KAAK;GAC3B,iBAAiB,OAAO,KAAK;GAC7B;EACF;EAGA,IAAI,QAAQ,MAAM;GAChB,eAAe,QAAQ;GACvB,iBAAiB,QAAQ;EAC3B,OAAO,IAAI,QAAQ,UACjB,eAAe,QAAQ;CAE3B;CACA,MAAM,UAAU,gBACZ,SAAS,eAAe,KAAK,eAAe,KAAK,WAAW,IAC5D,SAAS,eAAe,KAAK,KAAK,WAAW;CACjD,IAAI,SAAS,sBAAsB;EAGjC,eAAe,QAAQ;EACvB,iBAAiB,QAAQ;CAC3B;CACA,OAAO;EACL;EACA;EACA;CACF;AACF;AAEA,SAAgB,gBAMd,OACA,UACA,UAMI,kBACJ,SACG;CACH,IAAI,MAAW,SAAS,OAAA;CAExB,MAAM,KAAK,iBAAiB,KAAK;CACjC,MAAM,EAAC,KAAK,QAAQ,kBAAiB;CAErC,MAAM,UAAU,gBACZ,gBAAkB,cAAc,MAAM,cAAc,IAAI,IACxD,UAAU,GAAG,GAAG;CACpB,MAAM,wBAAwB,SAAe;CAK7C,MAAM,gBAAgB,CAAC,SAAS;CAChC,IAAI,WAAW,CAAC;CAIhB,IAAI,MAA0B,SAAS;CACvC,IAAI,gBAAwC,YAAY,QAAQ;CAChE,MAAM,YAAY,iBACb,WAAgB,SAAS,kBAAkB,eAAe,MAAM,KAChE,WAAgB,SAAS,kBAAkB,KAAK,MAAM;CAI3D,MAAM,6BAA6B;EACjC,IAAI,YAAY,QAAQ,QAAQ,kBAAkB,MAAM;GACtD,SAAS,UACP,oCACA,YAAY,IAAI,IAAI,IACpB,SACA,GACF;GACA,gBAAgB;GAChB,sBAAsB,QAAQ,IAAI;EACpC;CACF;CAOA,IAAI;CAMJ,MAAM,wBAAwB;EAI5B,IAAI,YAAY,QAAQ,YAAY,kBAAkB,OACpD,WAAW,aAAa;CAE5B;CAEA,IAAI,YAAY;CAChB,MAAM,eAA4B,OAAO,UAAU;EACjD,IAAI,WAIF;EAEF,IAAI,OAAO;GACT,sBAAsB,OAAO,KAAK;GAClC,gBAAgB;GAChB;EACF;EAEA,MAAM;EACN,IAAI,QAAQ,UACV,gBAAgB;OACX,IAAI,QAAQ,OAGjB,WAAW,eAAe;OAE1B,qBAAqB;CAEzB;CAEA,IAAI;CACJ,IAAI;CACJ,MAAM,kBAAkB;EACtB,YAAY;EACZ,sBAAsB;EACtB,sBAAsB,KAAA;EACtB,MAAM,QAAQ;EACd,uBAAuB;EACvB,iBAAiB;CACnB;CAEA,MAAM,KAAK,YAAY,IAAI;CAE3B,MAAM,mBAAmB,gBACrB,SAAS,eAAe,KAAK,eAAe,KAAK,WAAW,IAC5D,SAAS,eAAe,KAAK,KAAK,WAAW;CAEjD,MAAM,WAAW,gBACb,iBAAiB,KAAK,UAAU,OAAO,IACvC,KAAA;CAKJ,MAAM,QAAQ,YAAY,cAAc,KAAK,UAAU,OAAO;CAE9D,MAAM,OAAO,SAAS,wBACnB,WAAW,kBACV,OACA,OACA,QACA,YACA,OAAM;EACJ,uBAAuB,SAAS,oBAAoB,EAAE;CACxD,GACA,iBAAiB,sBAAsB,SACvC,SACF,CACF;CAEA,IAAI,CAAC,UACH,SAAS,UACP,gCACA,YAAY,IAAI,IAAI,IACpB,OACF;MAIA,sBAAsB,SAAS,uBAAuB;EACpD,sBAAsB,KAAA;EACtB,IAAI,SAAS,WACX,aAAa,CAAC;EAEhB,MAAM,KAAK,YAAY,IAAI;EAC3B,IAAI;GACF,WAAW,WAAW;GACtB,SAAS,OAAO;EAClB,SAAS,GAAG;GAGV,MAAM,QAAsB;IAC1B,OAAO;IACP,IAAI;IACJ,MAAM,eAAe,QAAQ;IAC7B,SAAS,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;GACpD;GACA,gBAAgB;GAChB,sBAAsB,OAAO,KAAK;GAClC,MAAM;EACR;EACA,MAAM,YAAY,YAAY,IAAI,IAAI;EAGtC,aAAa;GACX,IAAI,WACF;GAEF,WAAW;GACX,WAAW,cAAc;GACzB,SAAS,UAAU,gCAAgC,WAAW,OAAO;GACrE,qBAAqB;GACrB,gBAAgB;EAClB;CACF,CAAC;CAGH,YAAY;CACZ,gBAAgB;CAEhB,OAAO;AACT;;;;;;;;;;;;;;AAeA,SAAS,iBACP,KACA,UACA,SACe;CACf,MAAM,cAAc,cAAc,KAAK,UAAU,OAAO;CACxD,MAAM,QAAQ,MAAM;CACpB,IAAI;EACF,OAAO,IAAI,cAAc,MAAM,UAAU,GAAG,KAAK;CACnD,UAAU;EACR,MAAM,QAAQ;CAChB;AACF;AAmBA,SAAS,iBAKP,QACA,OACA,QACA,WACA,qBACA,eACA,WACmC;CACnC,MAAM,IAAI,IAAI,UACZ,OACA,QACA,eACA,SACF;CACA,EAAE,YAAY;CACd,0BAA0B,EAAE,MAAM,CAAC;CACnC,OAAO;AACT"}
+{"version":3,"file":"query-delegate-base.js","names":["hashOfNameAndArgs"],"sources":["../../../../../zql/src/query/query-delegate-base.ts"],"sourcesContent":["import {resolver} from '@rocicorp/resolver';\nimport type {AST} from '../../../zero-protocol/src/ast.ts';\nimport type {ErroredQuery} from '../../../zero-protocol/src/custom-queries.ts';\nimport {\n  hashOfAST,\n  hashOfNameAndArgs,\n} from '../../../zero-protocol/src/query-hash.ts';\nimport type {Schema} from '../../../zero-types/src/schema.ts';\nimport {buildPipeline} from '../builder/builder.ts';\nimport {ArrayView} from '../ivm/array-view.ts';\nimport {DeferredInput} from '../ivm/deferred-input.ts';\nimport type {FilterInput} from '../ivm/filter-operators.ts';\nimport {MemoryStorage} from '../ivm/memory-storage.ts';\nimport type {Input, InputBase, Storage} from '../ivm/operator.ts';\nimport type {Source, SourceInput} from '../ivm/source.ts';\nimport type {Format, ViewFactory} from '../ivm/view.ts';\nimport type {MetricMap} from './metrics-delegate.ts';\nimport type {CustomQueryID} from './named.ts';\nimport type {\n  AttachPipeline,\n  CommitListener,\n  GotCallback,\n  QueryDelegate,\n} from './query-delegate.ts';\nimport {asQueryInternals, type QueryInternals} from './query-internals.ts';\nimport type {\n  HumanReadable,\n  MaterializeOptions,\n  PreloadOptions,\n  Query,\n  RunOptions,\n} from './query.ts';\nimport {DEFAULT_PRELOAD_TTL_MS, DEFAULT_TTL_MS, type TTL} from './ttl.ts';\nimport type {TypedView} from './typed-view.ts';\n\n/**\n * Base class that provides default implementations for common QueryDelegate methods.\n * Subclasses can override specific methods as needed.\n */\nexport abstract class QueryDelegateBase implements QueryDelegate {\n  /**\n   * Default implementation that just calls applyViewUpdates synchronously.\n   * Override if you need custom batching behavior (e.g., SolidJS).\n   */\n  batchViewUpdates<T>(applyViewUpdates: () => T): T {\n    return applyViewUpdates();\n  }\n\n  /**\n   * Default implementation returns MemoryStorage.\n   * Override if you need custom storage.\n   */\n  createStorage(): Storage {\n    return new MemoryStorage();\n  }\n\n  /**\n   * Default implementation calls materializeImpl.\n   * Override if you need custom materialization behavior.\n   */\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: undefined,\n    options?: MaterializeOptions,\n  ): TypedView<HumanReadable<TReturn>>;\n\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T;\n\n  /**\n   * Materialize a query into a custom view using a provided factory function.\n   */\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T;\n\n  materialize<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n    T,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    factory?: ViewFactory<TTable, TSchema, TReturn, T>,\n    options?: MaterializeOptions,\n  ): T {\n    return materializeImpl(query, this, factory, options);\n  }\n\n  /**\n   * Default implementation calls runImpl.\n   * Override if you need custom query execution (e.g., TestPGQueryDelegate).\n   */\n  run<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    options?: RunOptions,\n  ): Promise<HumanReadable<TReturn>> {\n    return runImpl(query, this, options);\n  }\n\n  /**\n   * Default implementation calls preloadImpl.\n   * Override if you need custom preload behavior.\n   */\n  preload<\n    TTable extends keyof TSchema['tables'] & string,\n    TSchema extends Schema,\n    TReturn,\n  >(\n    query: Query<TTable, TSchema, TReturn>,\n    options?: PreloadOptions,\n  ): {\n    cleanup: () => void;\n    complete: Promise<void>;\n    cached: Promise<void>;\n  } {\n    return preloadImpl(query, this, options);\n  }\n\n  /**\n   * Default no-op implementation for decorateSourceInput.\n   * Override if you need to wrap or instrument source inputs.\n   */\n  decorateSourceInput(input: SourceInput, _queryID: string): Input {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for decorateInput.\n   * Override if you need to wrap or instrument inputs.\n   */\n  decorateInput(input: Input, _name: string): Input {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for decorateFilterInput.\n   * Override if you need to wrap or instrument filter inputs.\n   */\n  decorateFilterInput(input: FilterInput, _name: string): FilterInput {\n    return input;\n  }\n\n  /**\n   * Default no-op implementation for addEdge.\n   * Override if you need to track graph edges (e.g., visualization).\n   */\n  addEdge(_source: InputBase, _dest: InputBase): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation for addMetric.\n   * Override if you need to collect metrics.\n   */\n  addMetric<K extends keyof MetricMap>(\n    _metric: K,\n    _value: number,\n    ..._args: MetricMap[K]\n  ): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to track server queries (e.g., ZeroContext, test delegates).\n   */\n  addServerQuery(_ast: AST, _ttl: TTL, _gotCallback?: GotCallback): () => void {\n    return () => {};\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to track custom queries (e.g., ZeroContext, test delegates).\n   */\n  addCustomQuery(\n    _ast: AST,\n    _customQueryID: CustomQueryID,\n    _ttl: TTL,\n    _gotCallback?: GotCallback,\n  ): () => void {\n    return () => {};\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to handle query updates.\n   */\n  updateServerQuery(_ast: AST, _ttl: TTL): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to handle custom query updates.\n   */\n  updateCustomQuery(_customQueryID: CustomQueryID, _ttl: TTL): void {\n    // No-op\n  }\n\n  /**\n   * Default no-op implementation.\n   * Override if you need to flush query changes.\n   */\n  flushQueryChanges(): void {\n    // No-op\n  }\n\n  /**\n   * Called when a transaction commits. Override to add custom behavior.\n   * Default implementation returns a no-op cleanup function.\n   */\n  onTransactionCommit(_cb: CommitListener): () => void {\n    return () => {};\n  }\n\n  /**\n   * Validates run options. Override to add custom validation.\n   * Default implementation is a no-op.\n   */\n  assertValidRunOptions(_options?: RunOptions): void {\n    // No-op\n  }\n\n  abstract readonly defaultQueryComplete: boolean;\n\n  /**\n   * Default: pipelines can always be built immediately. Override (together\n   * with `onPipelinesReady`) to defer pipeline construction.\n   */\n  get pipelinesReady(): boolean {\n    return true;\n  }\n\n  onPipelinesReady(_attach: AttachPipeline): () => void {\n    throw new Error(\n      'onPipelinesReady called on a delegate whose pipelines are always ready',\n    );\n  }\n\n  // BuilderDelegate methods - must be implemented\n  abstract getSource(name: string): Source | undefined;\n}\n\n// oxlint-disable-next-line require-await\nexport async function runImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  options?: RunOptions,\n): Promise<HumanReadable<TReturn>> {\n  delegate.assertValidRunOptions(options);\n  const v: TypedView<HumanReadable<TReturn>> = materializeImpl(\n    query,\n    delegate,\n    undefined,\n    {\n      ttl: options?.ttl,\n    },\n  );\n  if (options?.type === 'complete' || options?.type === 'cached') {\n    // 'cached' is satisfied by a result the server confirmed on a previous\n    // connection, or by this connection confirming it, whichever comes first.\n    const acceptCached = options.type === 'cached';\n    return new Promise(resolve => {\n      v.addListener((data, type) => {\n        if (type === 'complete' || (acceptCached && type === 'cached')) {\n          v.destroy();\n          resolve(data as HumanReadable<TReturn>);\n        } else if (type === 'error') {\n          v.destroy();\n          resolve(Promise.reject(data));\n        }\n      });\n    });\n  }\n\n  options?.type satisfies 'unknown' | undefined;\n\n  // A snapshot of what the view holds right now. While the delegate's\n  // pipelines are not ready the view is deferred and this is empty; 'unknown'\n  // has never waited for the local data, so it does not wait for that either.\n  const ret = v.data;\n  v.destroy();\n  return ret;\n}\n\nexport function preloadImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  options?: PreloadOptions,\n): {\n  cleanup: () => void;\n  complete: Promise<void>;\n  cached: Promise<void>;\n} {\n  const qi = asQueryInternals(query);\n  const ttl = options?.ttl ?? DEFAULT_PRELOAD_TTL_MS;\n  const completeResolver = resolver<void>();\n  const cachedResolver = resolver<void>();\n  const {promise: complete} = completeResolver;\n  const {promise: cached} = cachedResolver;\n  // A caller may ignore either promise; a query error must not surface as an\n  // unhandled rejection through the one nobody awaits.\n  void complete.catch(() => {});\n  void cached.catch(() => {});\n  const {customQueryID, ast} = qi;\n  const gotCallback: GotCallback = (got, error) => {\n    if (error) {\n      // The query cannot be satisfied; neither waiter should hang.\n      cachedResolver.reject(error);\n      completeResolver.reject(error);\n      return;\n    }\n    // Only a server confirmation on this connection resolves `complete`;\n    // `cached` is also satisfied by one from a previous connection.\n    if (got === true) {\n      cachedResolver.resolve();\n      completeResolver.resolve();\n    } else if (got === 'cached') {\n      cachedResolver.resolve();\n    }\n  };\n  const cleanup = customQueryID\n    ? delegate.addCustomQuery(ast, customQueryID, ttl, gotCallback)\n    : delegate.addServerQuery(ast, ttl, gotCallback);\n  if (delegate.defaultQueryComplete) {\n    // A delegate whose results are complete from the start (a server-side\n    // one) has no got callback to drive the waiters.\n    cachedResolver.resolve();\n    completeResolver.resolve();\n  }\n  return {\n    cleanup,\n    complete,\n    cached,\n  };\n}\n\nexport function materializeImpl<\n  TTable extends keyof TSchema['tables'] & string,\n  TSchema extends Schema,\n  TReturn,\n  T,\n>(\n  query: Query<TTable, TSchema, TReturn>,\n  delegate: QueryDelegate,\n  factory: ViewFactory<\n    TTable,\n    TSchema,\n    TReturn,\n    T\n    // oxlint-disable-next-line no-explicit-any\n  > = arrayViewFactory as any,\n  options?: MaterializeOptions,\n): T {\n  let ttl: TTL = options?.ttl ?? DEFAULT_TTL_MS;\n\n  const qi = asQueryInternals(query);\n  const {ast, format, customQueryID} = qi;\n\n  const queryID = customQueryID\n    ? hashOfNameAndArgs(customQueryID.name, customQueryID.args)\n    : hashOfAST(qi.ast);\n  const queryCompleteResolver = resolver<true>();\n  // When the delegate cannot build pipelines yet, the view starts over an\n  // empty DeferredInput and is hydrated later. A view must not report\n  // `complete` until it has actually been hydrated, so completion is gated on\n  // both the server's \"got\" and the pipeline being attached.\n  const deferPipeline = !delegate.pipelinesReady;\n  let attached = !deferPipeline;\n  // The last got report: `true` once the server confirmed the query on this\n  // connection, `'cached'` while the store holds a previous connection's\n  // confirmed result, `false` otherwise.\n  let got: boolean | 'cached' = delegate.defaultQueryComplete;\n  let queryComplete: boolean | ErroredQuery = attached && got === true;\n  const updateTTL = customQueryID\n    ? (newTTL: TTL) => delegate.updateCustomQuery(customQueryID, newTTL)\n    : (newTTL: TTL) => delegate.updateServerQuery(ast, newTTL);\n\n  // Completion, and the end-to-end metric, require both the server's \"got\"\n  // and the pipeline being attached: until then the view is still empty.\n  const maybeResolveComplete = () => {\n    if (attached && got === true && queryComplete !== true) {\n      delegate.addMetric(\n        'query-materialization-end-to-end',\n        performance.now() - t0,\n        queryID,\n        ast,\n      );\n      queryComplete = true;\n      queryCompleteResolver.resolve(true);\n    }\n  };\n\n  // The view, seen as its optional hooks. Only views that implement\n  // `markCached`/`unmarkCached` (e.g. ArrayView) surface 'cached'; for any\n  // other factory the optional calls are no-ops. The registration path can\n  // report 'cached' synchronously, before the view below exists, so this\n  // stays undefined until then and the mark is applied afterwards.\n  let viewHooks: OptionalViewHooks | undefined;\n\n  // Like 'complete', 'cached' is a claim about the rows the view holds, so it\n  // waits for the view to exist and its pipeline to be attached. Once the\n  // server has confirmed the query on this connection, 'complete' supersedes\n  // it and the mark is skipped.\n  const maybeMarkCached = () => {\n    // Only while the query is still incomplete: 'complete' supersedes the\n    // mark, and an error that arrived before attach must not be preceded by\n    // a 'cached' notification.\n    if (attached && got === 'cached' && queryComplete === false) {\n      viewHooks?.markCached?.();\n    }\n  };\n\n  let destroyed = false;\n  const gotCallback: GotCallback = (value, error) => {\n    if (destroyed) {\n      // The delegate may keep this callback registered for a while after\n      // destroy (removals are deferred while mutations are pending); a dead\n      // view must not be driven, nor its listeners fired.\n      return;\n    }\n    if (error) {\n      queryCompleteResolver.reject(error);\n      queryComplete = error;\n      return;\n    }\n\n    got = value;\n    if (got === 'cached') {\n      maybeMarkCached();\n    } else if (got === false) {\n      // The got key was deleted (eviction) before the server confirmed the\n      // query on this connection.\n      viewHooks?.unmarkCached?.();\n    } else {\n      maybeResolveComplete();\n    }\n  };\n\n  let removeCommitObserver: (() => void) | undefined;\n  let removePendingAttach: (() => void) | undefined;\n  const onDestroy = () => {\n    destroyed = true;\n    removePendingAttach?.();\n    removePendingAttach = undefined;\n    input.destroy();\n    removeCommitObserver?.();\n    removeAddedQuery();\n  };\n\n  const t0 = performance.now();\n\n  const removeAddedQuery = customQueryID\n    ? delegate.addCustomQuery(ast, customQueryID, ttl, gotCallback)\n    : delegate.addServerQuery(ast, ttl, gotCallback);\n\n  const deferred = deferPipeline\n    ? newDeferredInput(ast, delegate, queryID)\n    : undefined;\n  // No type annotation here: annotating this as `Input` widens it enough that\n  // the view type loses the pipeline's concrete schema, and `Zero.run` then\n  // stops rejecting a query built from a schema with legacy queries enabled\n  // (custom.test.ts covers that rejection).\n  const input = deferred ?? buildPipeline(ast, delegate, queryID);\n\n  const view = delegate.batchViewUpdates(() =>\n    (factory ?? arrayViewFactory)(\n      query,\n      input,\n      format,\n      onDestroy,\n      cb => {\n        removeCommitObserver = delegate.onTransactionCommit(cb);\n      },\n      queryComplete || queryCompleteResolver.promise,\n      updateTTL,\n    ),\n  );\n\n  if (!deferred) {\n    delegate.addMetric(\n      'query-materialization-client',\n      performance.now() - t0,\n      queryID,\n    );\n  } else {\n    // Registered after the factory ran so a throwing factory leaves nothing\n    // behind.\n    removePendingAttach = delegate.onPipelinesReady(() => {\n      removePendingAttach = undefined;\n      if (deferred.destroyed) {\n        return () => {};\n      }\n      const t1 = performance.now();\n      try {\n        viewHooks?.holdData?.();\n        deferred.attach();\n      } catch (e) {\n        // Surface the failure on this view and let the delegate decide how\n        // to log it. Other pending pipelines are unaffected.\n        const error: ErroredQuery = {\n          error: 'app',\n          id: queryID,\n          name: customQueryID?.name ?? '',\n          message: e instanceof Error ? e.message : String(e),\n        };\n        queryComplete = error;\n        queryCompleteResolver.reject(error);\n        throw e;\n      }\n      const hydrateMs = performance.now() - t1;\n      // The view holds its rows now but must not say so yet: the delegate\n      // releases every view hydrated in the same batch together.\n      return () => {\n        if (destroyed) {\n          return;\n        }\n        attached = true;\n        viewHooks?.releaseData?.();\n        delegate.addMetric('query-materialization-client', hydrateMs, queryID);\n        maybeResolveComplete();\n        maybeMarkCached();\n      };\n    });\n  }\n\n  viewHooks = view as OptionalViewHooks;\n  maybeMarkCached();\n\n  return view as T;\n}\n\n/**\n * Creates the placeholder input for a query whose pipeline cannot be built yet.\n *\n * `Input.getSchema()` is unconditional, so the placeholder needs the schema up\n * front. It is captured by building a pipeline and immediately destroying it:\n * building only connects to the sources, while the indexes and rows -- the\n * expensive part this deferral exists to postpone -- are read on the first\n * fetch. Measured at ~5us against ~500us for a single 100 row fetch.\n *\n * Building here also means a query that cannot be built at all (an unknown\n * table, `not(exists())` on the client) still throws from `materialize()`,\n * as it did before hydration was deferred.\n */\nfunction newDeferredInput(\n  ast: AST,\n  delegate: QueryDelegate,\n  queryID: string,\n): DeferredInput {\n  const build = () => buildPipeline(ast, delegate, queryID);\n  const probe = build();\n  try {\n    return new DeferredInput(probe.getSchema(), build);\n  } finally {\n    probe.destroy();\n  }\n}\n\n/**\n * Optional methods `materialize` calls on a view when it has them (ArrayView\n * does). See {@link ViewFactory} for what a custom view needs to know.\n */\ntype OptionalViewHooks = {\n  // Surface the 'cached' result type. Views without these never show it.\n  markCached?: (() => void) | undefined;\n  unmarkCached?: (() => void) | undefined;\n  // Keep showing the current snapshot until `releaseData()` (or the next\n  // flush), and notify nobody until that flush, so a deferred view does not\n  // show rows ahead of its release.\n  holdData?: (() => void) | undefined;\n  // Called at the release: show the hydrated rows through `data` again, but\n  // leave notifying listeners to the flush that follows all the releases.\n  releaseData?: (() => void) | undefined;\n};\n\nfunction arrayViewFactory<\n  TTable extends string,\n  TSchema extends Schema,\n  TReturn,\n>(\n  _query: QueryInternals<TTable, TSchema, TReturn>,\n  input: Input,\n  format: Format,\n  onDestroy: () => void,\n  onTransactionCommit: (cb: () => void) => void,\n  queryComplete: true | ErroredQuery | Promise<true>,\n  updateTTL: (ttl: TTL) => void,\n): TypedView<HumanReadable<TReturn>> {\n  const v = new ArrayView<HumanReadable<TReturn>>(\n    input,\n    format,\n    queryComplete,\n    updateTTL,\n  );\n  v.onDestroy = onDestroy;\n  onTransactionCommit(() => v.flush());\n  return v;\n}\n"],"mappings":";;;;;;;;;;;;;;AAuCA,IAAsB,oBAAtB,MAAiE;;;;;CAK/D,iBAAoB,kBAA8B;EAChD,OAAO,iBAAiB;CAC1B;;;;;CAMA,gBAAyB;EACvB,OAAO,IAAI,cAAc;CAC3B;CAyCA,YAME,OACA,SACA,SACG;EACH,OAAO,gBAAgB,OAAO,MAAM,SAAS,OAAO;CACtD;;;;;CAMA,IAKE,OACA,SACiC;EACjC,OAAO,QAAQ,OAAO,MAAM,OAAO;CACrC;;;;;CAMA,QAKE,OACA,SAKA;EACA,OAAO,YAAY,OAAO,MAAM,OAAO;CACzC;;;;;CAMA,oBAAoB,OAAoB,UAAyB;EAC/D,OAAO;CACT;;;;;CAMA,cAAc,OAAc,OAAsB;EAChD,OAAO;CACT;;;;;CAMA,oBAAoB,OAAoB,OAA4B;EAClE,OAAO;CACT;;;;;CAMA,QAAQ,SAAoB,OAAwB,CAEpD;;;;;CAMA,UACE,SACA,QACA,GAAG,OACG,CAER;;;;;CAMA,eAAe,MAAW,MAAW,cAAwC;EAC3E,aAAa,CAAC;CAChB;;;;;CAMA,eACE,MACA,gBACA,MACA,cACY;EACZ,aAAa,CAAC;CAChB;;;;;CAMA,kBAAkB,MAAW,MAAiB,CAE9C;;;;;CAMA,kBAAkB,gBAA+B,MAAiB,CAElE;;;;;CAMA,oBAA0B,CAE1B;;;;;CAMA,oBAAoB,KAAiC;EACnD,aAAa,CAAC;CAChB;;;;;CAMA,sBAAsB,UAA6B,CAEnD;;;;;CAQA,IAAI,iBAA0B;EAC5B,OAAO;CACT;CAEA,iBAAiB,SAAqC;EACpD,MAAM,IAAI,MACR,wEACF;CACF;AAIF;AAGA,eAAsB,QAKpB,OACA,UACA,SACiC;CACjC,SAAS,sBAAsB,OAAO;CACtC,MAAM,IAAuC,gBAC3C,OACA,UACA,KAAA,GACA,EACE,KAAK,SAAS,IAChB,CACF;CACA,IAAI,SAAS,SAAS,cAAc,SAAS,SAAS,UAAU;EAG9D,MAAM,eAAe,QAAQ,SAAS;EACtC,OAAO,IAAI,SAAQ,YAAW;GAC5B,EAAE,aAAa,MAAM,SAAS;IAC5B,IAAI,SAAS,cAAe,gBAAgB,SAAS,UAAW;KAC9D,EAAE,QAAQ;KACV,QAAQ,IAA8B;IACxC,OAAO,IAAI,SAAS,SAAS;KAC3B,EAAE,QAAQ;KACV,QAAQ,QAAQ,OAAO,IAAI,CAAC;IAC9B;GACF,CAAC;EACH,CAAC;CACH;CAEA,SAAS;CAKT,MAAM,MAAM,EAAE;CACd,EAAE,QAAQ;CACV,OAAO;AACT;AAEA,SAAgB,YAKd,OACA,UACA,SAKA;CACA,MAAM,KAAK,iBAAiB,KAAK;CACjC,MAAM,MAAM,SAAS,OAAA;CACrB,MAAM,mBAAmB,SAAe;CACxC,MAAM,iBAAiB,SAAe;CACtC,MAAM,EAAC,SAAS,aAAY;CAC5B,MAAM,EAAC,SAAS,WAAU;CAG1B,SAAc,YAAY,CAAC,CAAC;CAC5B,OAAY,YAAY,CAAC,CAAC;CAC1B,MAAM,EAAC,eAAe,QAAO;CAC7B,MAAM,eAA4B,KAAK,UAAU;EAC/C,IAAI,OAAO;GAET,eAAe,OAAO,KAAK;GAC3B,iBAAiB,OAAO,KAAK;GAC7B;EACF;EAGA,IAAI,QAAQ,MAAM;GAChB,eAAe,QAAQ;GACvB,iBAAiB,QAAQ;EAC3B,OAAO,IAAI,QAAQ,UACjB,eAAe,QAAQ;CAE3B;CACA,MAAM,UAAU,gBACZ,SAAS,eAAe,KAAK,eAAe,KAAK,WAAW,IAC5D,SAAS,eAAe,KAAK,KAAK,WAAW;CACjD,IAAI,SAAS,sBAAsB;EAGjC,eAAe,QAAQ;EACvB,iBAAiB,QAAQ;CAC3B;CACA,OAAO;EACL;EACA;EACA;CACF;AACF;AAEA,SAAgB,gBAMd,OACA,UACA,UAMI,kBACJ,SACG;CACH,IAAI,MAAW,SAAS,OAAA;CAExB,MAAM,KAAK,iBAAiB,KAAK;CACjC,MAAM,EAAC,KAAK,QAAQ,kBAAiB;CAErC,MAAM,UAAU,gBACZA,gBAAkB,cAAc,MAAM,cAAc,IAAI,IACxD,UAAU,GAAG,GAAG;CACpB,MAAM,wBAAwB,SAAe;CAK7C,MAAM,gBAAgB,CAAC,SAAS;CAChC,IAAI,WAAW,CAAC;CAIhB,IAAI,MAA0B,SAAS;CACvC,IAAI,gBAAwC,YAAY,QAAQ;CAChE,MAAM,YAAY,iBACb,WAAgB,SAAS,kBAAkB,eAAe,MAAM,KAChE,WAAgB,SAAS,kBAAkB,KAAK,MAAM;CAI3D,MAAM,6BAA6B;EACjC,IAAI,YAAY,QAAQ,QAAQ,kBAAkB,MAAM;GACtD,SAAS,UACP,oCACA,YAAY,IAAI,IAAI,IACpB,SACA,GACF;GACA,gBAAgB;GAChB,sBAAsB,QAAQ,IAAI;EACpC;CACF;CAOA,IAAI;CAMJ,MAAM,wBAAwB;EAI5B,IAAI,YAAY,QAAQ,YAAY,kBAAkB,OACpD,WAAW,aAAa;CAE5B;CAEA,IAAI,YAAY;CAChB,MAAM,eAA4B,OAAO,UAAU;EACjD,IAAI,WAIF;EAEF,IAAI,OAAO;GACT,sBAAsB,OAAO,KAAK;GAClC,gBAAgB;GAChB;EACF;EAEA,MAAM;EACN,IAAI,QAAQ,UACV,gBAAgB;OACX,IAAI,QAAQ,OAGjB,WAAW,eAAe;OAE1B,qBAAqB;CAEzB;CAEA,IAAI;CACJ,IAAI;CACJ,MAAM,kBAAkB;EACtB,YAAY;EACZ,sBAAsB;EACtB,sBAAsB,KAAA;EACtB,MAAM,QAAQ;EACd,uBAAuB;EACvB,iBAAiB;CACnB;CAEA,MAAM,KAAK,YAAY,IAAI;CAE3B,MAAM,mBAAmB,gBACrB,SAAS,eAAe,KAAK,eAAe,KAAK,WAAW,IAC5D,SAAS,eAAe,KAAK,KAAK,WAAW;CAEjD,MAAM,WAAW,gBACb,iBAAiB,KAAK,UAAU,OAAO,IACvC,KAAA;CAKJ,MAAM,QAAQ,YAAY,cAAc,KAAK,UAAU,OAAO;CAE9D,MAAM,OAAO,SAAS,wBACnB,WAAW,iBAAA,CACV,OACA,OACA,QACA,YACA,OAAM;EACJ,uBAAuB,SAAS,oBAAoB,EAAE;CACxD,GACA,iBAAiB,sBAAsB,SACvC,SACF,CACF;CAEA,IAAI,CAAC,UACH,SAAS,UACP,gCACA,YAAY,IAAI,IAAI,IACpB,OACF;MAIA,sBAAsB,SAAS,uBAAuB;EACpD,sBAAsB,KAAA;EACtB,IAAI,SAAS,WACX,aAAa,CAAC;EAEhB,MAAM,KAAK,YAAY,IAAI;EAC3B,IAAI;GACF,WAAW,WAAW;GACtB,SAAS,OAAO;EAClB,SAAS,GAAG;GAGV,MAAM,QAAsB;IAC1B,OAAO;IACP,IAAI;IACJ,MAAM,eAAe,QAAQ;IAC7B,SAAS,aAAa,QAAQ,EAAE,UAAU,OAAO,CAAC;GACpD;GACA,gBAAgB;GAChB,sBAAsB,OAAO,KAAK;GAClC,MAAM;EACR;EACA,MAAM,YAAY,YAAY,IAAI,IAAI;EAGtC,aAAa;GACX,IAAI,WACF;GAEF,WAAW;GACX,WAAW,cAAc;GACzB,SAAS,UAAU,gCAAgC,WAAW,OAAO;GACrE,qBAAqB;GACrB,gBAAgB;EAClB;CACF,CAAC;CAGH,YAAY;CACZ,gBAAgB;CAEhB,OAAO;AACT;;;;;;;;;;;;;;AAeA,SAAS,iBACP,KACA,UACA,SACe;CACf,MAAM,cAAc,cAAc,KAAK,UAAU,OAAO;CACxD,MAAM,QAAQ,MAAM;CACpB,IAAI;EACF,OAAO,IAAI,cAAc,MAAM,UAAU,GAAG,KAAK;CACnD,UAAU;EACR,MAAM,QAAQ;CAChB;AACF;AAmBA,SAAS,iBAKP,QACA,OACA,QACA,WACA,qBACA,eACA,WACmC;CACnC,MAAM,IAAI,IAAI,UACZ,OACA,QACA,eACA,SACF;CACA,EAAE,YAAY;CACd,0BAA0B,EAAE,MAAM,CAAC;CACnC,OAAO;AACT"}

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

@@ -454,7 +454,8 @@ function astID(ast) {
 */
 var whereKeys = /* @__PURE__ */ new Map();
 function whereKey(column, op) {
-	return getOrInsertComputed(getOrInsertComputed(whereKeys, column, newMap), op, (op) => `where:${column}:${op}`);
+	const byOp = getOrInsertComputed(whereKeys, column, newMap);
+	return getOrInsertComputed(byOp, op, (op) => `where:${column}:${op}`);
 }
 var relatedKeys = /* @__PURE__ */ new Map();
 var newRelatedKey = (relationship) => `related:${relationship}`;
@@ -588,6 +589,6 @@ function isTwoHop(r) {
 	return r.length === 2;
 }
 //#endregion
-export { QueryImpl, newQuery, newQueryImpl };
+export { QueryImpl, asQueryImpl, newQuery, newQueryImpl };
 
 //# sourceMappingURL=query-impl.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"query-impl.js","names":["#schema","#tableName","#ast","#system","#currentJunction","#newQuery","#transitions","#record","#parent","#derive","#hash","#canonicalize","#byHash","#sameAs","#deriveBounded","#expressionBuilder","#exists"],"sources":["../../../../../zql/src/query/query-impl.ts"],"sourcesContent":["// oxlint-disable no-explicit-any\nimport {assert} from '../../../shared/src/asserts.ts';\nimport {\n  deepEqual,\n  type ReadonlyJSONObject,\n  type ReadonlyJSONValue,\n} from '../../../shared/src/json.ts';\nimport {getOrInsertComputed, newMap} from '../../../shared/src/map.ts';\nimport {\n  type AST,\n  type CompoundKey,\n  type Condition,\n  type NormalizedAST,\n  type Parameter,\n  type LiteralValue,\n  type SimpleCondition,\n  type SimpleOperator,\n  type System,\n  insertRelated,\n  normalizeAST,\n  normalizeCondition,\n  normalizedRelated,\n  SUBQ_PREFIX,\n  tableAST,\n} from '../../../zero-protocol/src/ast.ts';\nimport {hashOfQueryInternals} from '../../../zero-protocol/src/query-hash-visitor.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 {\n  HashIndex,\n  Transitions,\n  type Delta,\n  type TransitionValue,\n} from './query-transitions.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: NormalizedAST,\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 newQueryInternal(\n    schema,\n    table,\n    tableAST(table),\n    defaultFormat,\n    'client',\n  );\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  // This is the entry point for ASTs that were not built by QueryImpl, so\n  // normalize it here to establish the invariant that #ast is normalized.\n  return newQueryInternal(schema, tableName, normalizeAST(ast), format, system);\n}\n\n/**\n * Root queries are interned per schema so that two `createBuilder(schema)` calls\n * hand out the same starting point, and therefore share the whole transition\n * tree below it. Only cleared entries accumulate here, at most one per\n * system/table pair, so no sweeping is needed.\n */\nconst rootsBySchema = new WeakMap<\n  Schema,\n  Map<string, WeakRef<QueryImpl<any, any, any>>>\n>();\n\n/**\n * Whether this is the AST `tableAST(tableName)` produces -- the whole table,\n * nothing else. A normalized AST carries every field, so this cannot be a key\n * count; each one has to be checked.\n */\nfunction isRootAST(ast: NormalizedAST, tableName: string): boolean {\n  return (\n    ast.table === tableName &&\n    ast.schema === undefined &&\n    ast.alias === undefined &&\n    ast.where === undefined &&\n    ast.related === undefined &&\n    ast.start === undefined &&\n    ast.limit === undefined &&\n    ast.orderBy === undefined\n  );\n}\n\nfunction newQueryInternal<\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: NormalizedAST,\n  format: Format,\n  system: System,\n): QueryImpl<TTable, TSchema, TReturn> {\n  // Callers that hand in a pre-built AST -- benchmarks and the integration-test\n  // harnesses -- are not roots and are not interned.\n  const interned = format === defaultFormat && isRootAST(ast, tableName);\n  const key = `${system}:${tableName}`;\n  let roots: Map<string, WeakRef<QueryImpl<any, any, any>>> | undefined;\n\n  if (interned) {\n    roots = rootsBySchema.get(schema);\n    const existing = roots?.get(key)?.deref();\n    if (existing) {\n      return existing as QueryImpl<TTable, TSchema, TReturn>;\n    }\n  }\n\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  const created = inner<TTable, TReturn>(\n    tableName,\n    ast,\n    format,\n    undefined,\n    undefined,\n  );\n\n  if (interned) {\n    if (!roots) {\n      roots = new Map();\n      rootsBySchema.set(schema, roots);\n    }\n    roots.set(key, new WeakRef(created));\n  }\n\n  return created;\n}\n\n/**\n * The AST of a QueryImpl is always normalized. Each step builds its AST in\n * normalized form rather than normalizing afterwards: a normalized AST has\n * every field, so spreading one and replacing a field keeps the field order\n * intact, and only the field a step actually changes needs normalizing (the\n * conditions of a `where`, the position of a new `related`). The ASTs that\n * come in from the outside are normalized by {@link newQueryImpl}, which is\n * what the `NormalizedAST` of the AST it holds stands for.\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: NormalizedAST;\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  /**\n   * The query this one was derived from, held *strongly*, and the queries\n   * derived from this one, held *weakly*. This is the arrangement V8 uses for\n   * hidden-class transitions, and it is what makes interning stable: as long as\n   * a query is reachable its whole ancestor spine is too, so re-deriving it from\n   * the root yields the same instance. See `query-transitions.ts`.\n   */\n  #parent: QueryImpl<any, any, any> | undefined;\n  #transitions: Transitions<QueryImpl<any, any, any>> | undefined;\n\n  /**\n   * The second level of interning, keyed by hash; see `HashIndex`. Set on the\n   * root only, which is what scopes it to one schema and one delegate.\n   */\n  #byHash: HashIndex<QueryImpl<any, any, any>> | undefined;\n\n  /**\n   * Memoized because a query is interned: the same node serves every rebuild of\n   * a chain, so building this once rather than per `where(fn)` call takes the\n   * whole thing -- the builder and the bound `#exists` -- off the repeat path.\n   */\n  #expressionBuilder: ExpressionBuilder<TTable, TSchema> | undefined;\n\n  constructor(\n    schema: TSchema,\n    tableName: TTable,\n    ast: NormalizedAST,\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  /**\n   * Interns a transition whose key space is finite and schema-derived; see\n   * {@link Transitions.storeBounded}. Used for the base sub-query handed to\n   * a `related`/`exists` callback, which is determined entirely by the\n   * relationship name.\n   */\n  #deriveBounded<T>(key: string, build: () => T): T {\n    const existing = this.#transitions?.lookupBounded(key);\n    if (existing !== undefined) {\n      return existing as T;\n    }\n    return this.#record(key, undefined, undefined, build(), true);\n  }\n\n  /**\n   * Interns the result of applying a builder operation to this query.\n   *\n   * `key` names the operation and `value` carries its varying argument, kept\n   * apart so the key stays a string V8 has already hashed. When the two do not\n   * settle it, `delta` carries the rest and is compared with `deepEqual`. Only\n   * the delta is compared, never the whole AST: this query is already canonical,\n   * so two of its children are equal exactly when the operations that produced\n   * them are.\n   *\n   * `T` is deliberately unconstrained so that the contextual return type at each\n   * call site still drives `#newQuery`'s inference, exactly as it did when the\n   * call sites returned `this.#newQuery(...)` directly.\n   */\n  #derive<T>(\n    key: string,\n    value: TransitionValue,\n    delta: Delta,\n    build: () => T,\n  ): T {\n    const existing = this.#transitions?.lookup(key, value, delta);\n    if (existing !== undefined) {\n      return existing as T;\n    }\n    return this.#record(key, value, delta, build(), false);\n  }\n\n  #record<T>(\n    key: string,\n    value: TransitionValue,\n    delta: Delta,\n    created: T,\n    bounded: boolean,\n  ): T {\n    const q = created as unknown as QueryImpl<any, any, any>;\n    q.#parent = this;\n    const transitions = (this.#transitions ??= new Transitions());\n    if (bounded) {\n      transitions.storeBounded(key, q);\n    } else {\n      transitions.store(key, value, delta, q);\n    }\n    return created;\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    cached: 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.#derive('nameAndArgs', name, args, () =>\n      this.#newQuery(\n        this.#tableName,\n        this.#ast,\n        this.format,\n        {\n          name,\n          args,\n        },\n        this.#currentJunction,\n      ),\n    );\n  }\n\n  hash(): string {\n    if (!this.#hash) {\n      this.#hash = hashOfQueryInternals(\n        this.#ast,\n        this.format,\n        this.#system,\n        this.#currentJunction,\n        this.customQueryID?.name,\n        this.customQueryID?.args,\n      );\n      this.#canonicalize();\n    }\n    return this.#hash;\n  }\n\n  /**\n   * Folds this query into its root's hash index, now that its hash is known.\n   *\n   * If an equal query is already indexed, the transition that produced this\n   * one is re-pointed at it, so the next rebuild along this path yields that\n   * instance rather than a second copy. This query itself is left alone: its\n   * identity has already been handed out. Content is verified with `#sameAs`\n   * before anything is redirected, so a hash collision costs nothing worse\n   * than a missed unification.\n   */\n  #canonicalize(): void {\n    const parent = this.#parent;\n    if (parent === undefined) {\n      // A root has no path to redirect and is its own canonical form.\n      return;\n    }\n    let root = parent;\n    while (root.#parent !== undefined) {\n      root = root.#parent;\n    }\n    const index = (root.#byHash ??= new HashIndex());\n    const existing = index.get(this.#hash);\n    if (existing === undefined) {\n      index.set(this.#hash, this);\n    } else if (existing !== this && this.#sameAs(existing)) {\n      parent.#transitions?.replace(this, existing);\n    }\n  }\n\n  /**\n   * Whether `other` is interchangeable with this query: everything `hash()`\n   * covers, compared structurally. Schema and delegate are not compared. Both\n   * are fixed by the root, and this only ever compares queries under one root.\n   */\n  #sameAs(other: QueryImpl<any, any, any>): boolean {\n    return (\n      this.#system === other.#system &&\n      this.#currentJunction === other.#currentJunction &&\n      this.customQueryID?.name === other.customQueryID?.name &&\n      deepEqual(this.customQueryID?.args, other.customQueryID?.args) &&\n      deepEqual(this.format, other.format) &&\n      deepEqual(this.#ast, other.#ast)\n    );\n  }\n\n  one(): Query<TTable, TSchema, TReturn | undefined> {\n    return this.#derive('one', undefined, undefined, () =>\n      this.#newQuery(\n        this.#tableName,\n        {...this.#ast, limit: 1},\n        {\n          ...this.format,\n          singular: true,\n        },\n        this.customQueryID,\n        this.#currentJunction,\n      ),\n    );\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      // Intern the base handed to the callback too. A deterministic callback\n      // then walks the same interned chain and hands back the *same* sub-query,\n      // which makes the comparison below a pointer compare.\n      const q: AnyQuery = this.#deriveBounded(\n        `relatedBase:${relationship}`,\n        () =>\n          this.#newQuery(\n            destSchema,\n            tableAST(destSchema, relationship),\n            {\n              relationships: {},\n              singular: cardinality === 'one',\n            },\n            this.customQueryID,\n            undefined,\n          ),\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      // Keyed by the sub-query's identity. Each query owns its AST object, so\n      // this distinguishes even `q.one()` from `q.limit(1)`, whose ASTs are\n      // structurally equal but whose formats differ. Comparing them as a delta\n      // instead would put every sibling under one key and scan.\n      return this.#derive(\n        relatedKey(relationship),\n        astID(subQuery.#ast),\n        undefined,\n        () =>\n          this.#newQuery(\n            this.#tableName,\n            {\n              ...this.#ast,\n              related: insertRelated(this.#ast.related, {\n                correlation: {\n                  parentField: sourceField,\n                  childField: destField,\n                },\n                subquery: subQuery.#ast,\n                system: this.#system,\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          ),\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.#deriveBounded(`relatedBase:${relationship}`, () =>\n            this.#newQuery(\n              destSchema,\n              tableAST(destSchema, relationship),\n              {\n                relationships: {},\n                singular: secondRelation.cardinality === 'one',\n              },\n              this.customQueryID,\n              relationship,\n            ),\n          ) as AnyQuery,\n        ),\n      );\n\n      // Bound to consts so the `isCompoundKey` narrowing survives into the\n      // closure below; TypeScript drops narrowing of property accesses there.\n      const {sourceField: firstSource, destField: firstDest} = firstRelation;\n      const {sourceField: secondSource, destField: secondDest} = secondRelation;\n      assert(isCompoundKey(firstSource), 'Invalid relationship');\n      assert(isCompoundKey(firstDest), 'Invalid relationship');\n      assert(isCompoundKey(secondSource), 'Invalid relationship');\n      assert(isCompoundKey(secondDest), 'Invalid relationship');\n\n      return this.#derive(\n        relatedKey(relationship),\n        astID(sq.#ast),\n        undefined,\n        () =>\n          this.#newQuery(\n            this.#tableName,\n            {\n              ...this.#ast,\n              related: insertRelated(this.#ast.related, {\n                correlation: {\n                  parentField: firstSource,\n                  childField: firstDest,\n                },\n                hidden: true,\n                subquery: {\n                  ...tableAST(junctionSchema, relationship),\n                  // A single subquery is sorted.\n                  related: [\n                    normalizedRelated({\n                      correlation: {\n                        parentField: secondSource,\n                        childField: secondDest,\n                      },\n                      subquery: sq.#ast,\n                      system: this.#system,\n                    }),\n                  ],\n                },\n                system: this.#system,\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          ),\n      ) as AnyQuery;\n    }\n\n    throw new Error(`Invalid relationship ${relationship}`);\n  }\n\n  // The declared return is the *bottom* of the pinned dimension, which is\n  // assignable to every `where` overload's declared return. The overloads\n  // refine `TPinned` for callers only; a single non-generic implementation\n  // signature cannot express that refinement.\n  where(\n    fieldOrExpressionFactory: string | ExpressionFactory<TTable, TSchema>,\n    opOrValue?: SimpleOperator | GetFilterTypeAny | Parameter,\n    value?: GetFilterTypeAny | Parameter,\n  ): Query<TTable, TSchema, TReturn, any> {\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      const twoArg = arguments.length === 2;\n      const op = (twoArg ? '=' : opOrValue) as SimpleOperator;\n      const raw = twoArg ? opOrValue : value;\n\n      // Comparing a column to a primitive is by far the most common thing anyone\n      // does with a query, and the transition it names is fully determined by\n      // (column, op, value) -- so check for it before building anything. On a hit\n      // this returns without allocating the `Condition` at all. Objects are\n      // excluded, which covers both parameter references and `IN` arrays; `cmp`\n      // maps a missing value to null, so this must too.\n      if (raw === null || typeof raw !== 'object') {\n        const hit = this.#transitions?.lookup(\n          whereKey(fieldOrExpressionFactory, op),\n          (raw ?? null) as TransitionValue,\n          undefined,\n        );\n        if (hit !== undefined) {\n          return hit as unknown as Query<TTable, TSchema, TReturn, any>;\n        }\n      }\n\n      cond = twoArg\n        ? cmp(fieldOrExpressionFactory, opOrValue)\n        : cmp(fieldOrExpressionFactory, opOrValue, value);\n    }\n\n    // The delta is the condition as built here, *before* it is merged with the\n    // existing where and normalized. Both steps are deterministic and the\n    // existing where is fixed by this query, so an equal `cond` always produces\n    // an equal result.\n    //\n    // A simple comparison against a column splits cleanly: the column and\n    // operator come from a small fixed set and give a memoized, stable key,\n    // while the compared value -- the part that varies per call -- is handed\n    // through as the transition value and never concatenated into a string.\n    let key: string;\n    let tValue: TransitionValue;\n    let delta: Delta = cond;\n    if (cond.type === 'simple' && cond.left.type === 'column') {\n      key = whereKey(cond.left.name, cond.op);\n      const right = cond.right;\n      tValue =\n        right.type === 'literal' && isPrimitive(right.value)\n          ? right.value\n          : rightTag(right);\n      delta = undefined;\n    } else {\n      // A sub-query an `exists` correlates to is itself interned, so its\n      // identity settles that part of the tree without walking it.\n      const exact = condKey(cond);\n      if (exact === undefined) {\n        key = treeKey(cond);\n      } else {\n        key = 'where:tree';\n        tValue = exact;\n        delta = undefined;\n      }\n    }\n\n    return this.#derive(key, tValue, delta, () => {\n      const existingWhere = this.#ast.where;\n      const merged = existingWhere ? and(existingWhere, cond) : cond;\n      return this.#newQuery(\n        this.#tableName,\n        {...this.#ast, where: normalizeCondition(simplifyCondition(merged))},\n        this.format,\n        this.customQueryID,\n        this.#currentJunction,\n      );\n    }) as unknown as Query<TTable, TSchema, TReturn, any>;\n  }\n\n  start(\n    row: Partial<Record<string, ReadonlyJSONValue | undefined>>,\n    opts?: {inclusive: boolean},\n  ): Query<TTable, TSchema, TReturn> {\n    // The row is an object, so it is encoded to a string to serve as the\n    // lookup key. Property order is part of that string.\n    return this.#derive(\n      opts?.inclusive ? 'start:inclusive' : 'start:exclusive',\n      valueTag(row as ReadonlyJSONValue),\n      undefined,\n      () =>\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  }\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.#derive('limit', limit, undefined, () =>\n      this.#newQuery(\n        this.#tableName,\n        {...this.#ast, limit},\n        this.format,\n        this.customQueryID,\n        this.#currentJunction,\n      ),\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.#derive(\n      direction === 'asc' ? 'orderBy:asc' : 'orderBy:desc',\n      field as string,\n      undefined,\n      () =>\n        this.#newQuery(\n          this.#tableName,\n          {\n            ...this.#ast,\n            orderBy: [\n              ...(this.#ast.orderBy ?? []),\n              [field as string, direction],\n            ],\n          },\n          this.format,\n          this.customQueryID,\n          this.#currentJunction,\n        ),\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.#deriveBounded(`existsBase:${relationship}`, () =>\n            this.#newQuery(\n              destTableName,\n              tableAST(destTableName, `${SUBQ_PREFIX}${relationship}`),\n              defaultFormat,\n              this.customQueryID,\n              undefined,\n            ),\n          ) as AnyQuery,\n        ),\n      );\n      // Give the sub-query's AST an id so the enclosing `where` can key on it\n      // exactly rather than comparing the sub-tree.\n      astID(subQuery.#ast);\n      // Unlike the entries of `related`, the correlated subqueries of a\n      // condition keep the order their fields are written in: normalization\n      // does not reorder them either.\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.#deriveBounded(`existsJunctionBase:${relationship}`, () =>\n          this.#newQuery(\n            destSchema,\n            tableAST(destSchema, `${SUBQ_PREFIX}zhidden_${relationship}`),\n            defaultFormat,\n            this.customQueryID,\n            relationship,\n          ),\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            ...tableAST(junctionSchema, `${SUBQ_PREFIX}${relationship}`),\n            // A single condition needs no flattening or sorting, but the node\n            // itself still has to be rebuilt into the canonical field order.\n            where: normalizeCondition({\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(): NormalizedAST {\n    return this.#ast;\n  }\n\n  expressionBuilder(): ExpressionBuilder<TTable, TSchema> {\n    // Built on demand rather than held as an eagerly initialized field: a field\n    // would cost a closure on every query constructed, where this costs one only\n    // for queries that actually use an expression factory.\n    return (this.#expressionBuilder ??= new ExpressionBuilder<TTable, TSchema>(\n      this.#exists.bind(this) as ConstructorParameters<\n        typeof ExpressionBuilder<TTable, TSchema>\n      >[0],\n    ));\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\n/**\n * A stable id per query AST.\n *\n * Every `QueryImpl` allocates its own AST object, so these are one-to-one with\n * queries, and interning makes the object identity stable across rebuilds. That\n * lets a `related` or `exists` transition key on *which* sub-query it points at\n * rather than comparing the sub-tree.\n *\n * Assigned only where it is needed. A `WeakMap.set` costs on the order of a\n * hundred nanoseconds, so doing this for every query rather than for the few\n * that are sub-queries was one of the largest single costs of building a query\n * from cold. ASTs that never pass through here -- including the junction AST a\n * two-hop `exists` builds inline -- are absent, and fall back to a delta.\n */\nconst astIDs = new WeakMap<AST, number>();\nlet nextASTID = 0;\n\nconst newASTID = () => ++nextASTID;\n\nfunction astID(ast: AST): number {\n  return getOrInsertComputed(astIDs, ast, newASTID);\n}\n\n/**\n * Memoized transition keys.\n *\n * A transition key must be a string V8 has already hashed, or the `Map` lookup\n * has to hash it from scratch -- measured at ~148ns against ~10ns, which dwarfs\n * everything else a lookup does. Both tables are keyed by schema-derived names,\n * so they are bounded by the schema.\n */\nconst whereKeys = new Map<string, Map<string, string>>();\n\nfunction whereKey(column: string, op: string): string {\n  const byOp = getOrInsertComputed(whereKeys, column, newMap);\n  return getOrInsertComputed(byOp, op, op => `where:${column}:${op}`);\n}\n\nconst relatedKeys = new Map<string, string>();\n\nconst newRelatedKey = (relationship: string) => `related:${relationship}`;\n\nfunction relatedKey(relationship: string): string {\n  return getOrInsertComputed(relatedKeys, relationship, newRelatedKey);\n}\n\nfunction isPrimitive(v: LiteralValue): v is string | number | boolean | null {\n  return v === null || typeof v !== 'object';\n}\n\n/**\n * Folds a JSON value into a self-delimiting token: a string is\n * length-prefixed, a number is terminated, an array or object is\n * count-prefixed and encodes its members recursively, and the rest are fixed\n * width. Tokens can therefore be concatenated into a key with no way for one\n * to run into the next, and the leading tag keeps `'1'` and `1` apart.\n *\n * Not `JSON.stringify`: it writes `Infinity`, `NaN` and `null` all as `null`,\n * and this token is trusted as exact, so a nested value that serialized like\n * another's would hand back a query with the wrong value in its AST. Numbers\n * are written the way `String` writes them, which keeps those apart. An\n * `undefined` property is skipped, as `deepEqual` would skip it; property\n * order is part of the encoding, so an object spelled in another order\n * interns separately.\n */\nfunction valueTag(v: ReadonlyJSONValue): string {\n  switch (typeof v) {\n    case 'string':\n      return `:s${enc(v)}`;\n    case 'number':\n      return `:n${v};`;\n    case 'boolean':\n      return v ? ':t' : ':f';\n    default: {\n      if (v === null) {\n        return ':z';\n      }\n      if (Array.isArray(v)) {\n        let out = `:a${v.length}:`;\n        for (const e of v) {\n          out += valueTag(e);\n        }\n        return out;\n      }\n      // `Array.isArray` does not narrow a readonly array out of the union.\n      const o = v as ReadonlyJSONObject;\n      let body = '';\n      let n = 0;\n      for (const key in o) {\n        const e = o[key];\n        if (e !== undefined && Object.hasOwn(o, key)) {\n          body += enc(key) + valueTag(e);\n          n++;\n        }\n      }\n      return `:o${n}:${body}`;\n    }\n  }\n}\n\n/**\n * Folds the right-hand side of a simple condition into a transition value, so\n * that the transition is exact and the lookup needs no comparison at all.\n *\n * Arrays (`IN`) and parameter references are encoded in full: that is one\n * pass over a small value, where leaving them in the delta would instead cost\n * a `deepEqual` over the whole condition for every sibling a lookup walks\n * past.\n */\nfunction rightTag(right: SimpleCondition['right']): string {\n  if (right.type !== 'literal') {\n    return `:p${valueTag(right as unknown as ReadonlyJSONValue)}`;\n  }\n  return valueTag(right.value);\n}\n\n/**\n * Length-prefixes a free-form string so it can be concatenated into a key\n * without a separator being ambiguous with the content.\n */\nfunction enc(s: string): string {\n  return `${s.length}:${s}`;\n}\n\n/** Encodes an optional boolean without collapsing `undefined` into `false`. */\nfunction tri(b: boolean | undefined): string {\n  return b === undefined ? '-' : b ? 't' : 'f';\n}\n\n/**\n * An exact key for a whole condition tree, or `undefined` for a shape we cannot\n * encode (which falls back to {@link treeKey} plus a delta).\n *\n * Everything variable-length is length-prefixed, so distinct trees cannot\n * produce the same string and the key needs no `deepEqual` to back it up. That\n * matters because the alternative -- one coarse bucket per shape -- turns N\n * sibling conditions off the same parent into an N-deep scan of tree\n * comparisons, which measured far slower than not interning at all.\n */\nfunction condKey(cond: Condition): string | undefined {\n  switch (cond.type) {\n    case 'simple': {\n      if (cond.left.type !== 'column') {\n        return undefined;\n      }\n      return `S${enc(cond.left.name)}${enc(cond.op)}${rightTag(cond.right)}`;\n    }\n    case 'correlatedSubquery': {\n      const id = astIDs.get(cond.related.subquery);\n      return id === undefined\n        ? undefined\n        : `E${id}:${enc(cond.op)}${tri(cond.flip)}${tri(cond.scalar)}`;\n    }\n    case 'and':\n    case 'or': {\n      let out = `${cond.type === 'and' ? 'A' : 'O'}${cond.conditions.length}:`;\n      for (const c of cond.conditions) {\n        const k = condKey(c);\n        if (k === undefined) {\n          return undefined;\n        }\n        out += k;\n      }\n      return out;\n    }\n    default:\n      return undefined;\n  }\n}\n\n/**\n * A coarse bucket key for the conditions {@link condKey} cannot encode --\n * a two-hop `exists`, whose junction AST is built inline and so has no identity\n * of its own. Reads only the top of the tree, so it is cheap; the delta tells\n * apart what shares it.\n */\nfunction treeKey(cond: Condition): string {\n  switch (cond.type) {\n    case 'correlatedSubquery':\n      return `where:e:${cond.related.subquery.alias}:${cond.op}`;\n    case 'and':\n    case 'or':\n      return `where:${cond.type}:${cond.conditions.length}`;\n    default:\n      return 'where:*';\n  }\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":";;;;;;;;;;;AAwEA,SAAgB,SAGd,QAAiB,OAAuC;CACxD,OAAO,iBACL,QACA,OACA,SAAS,KAAK,GACd,eACA,QACF;AACF;AAEA,SAAgB,aAKd,QACA,WACA,KACA,QACA,QACqC;CAGrC,OAAO,iBAAiB,QAAQ,WAAW,aAAa,GAAG,GAAG,QAAQ,MAAM;AAC9E;;;;;;;AAQA,IAAM,gCAAgB,IAAI,QAGxB;;;;;;AAOF,SAAS,UAAU,KAAoB,WAA4B;CACjE,OACE,IAAI,UAAU,aACd,IAAI,WAAW,KAAA,KACf,IAAI,UAAU,KAAA,KACd,IAAI,UAAU,KAAA,KACd,IAAI,YAAY,KAAA,KAChB,IAAI,UAAU,KAAA,KACd,IAAI,UAAU,KAAA,KACd,IAAI,YAAY,KAAA;AAEpB;AAEA,SAAS,iBAKP,QACA,WACA,KACA,QACA,QACqC;CAGrC,MAAM,WAAW,WAAW,iBAAiB,UAAU,KAAK,SAAS;CACrE,MAAM,MAAM,GAAG,OAAO,GAAG;CACzB,IAAI;CAEJ,IAAI,UAAU;EACZ,QAAQ,cAAc,IAAI,MAAM;EAChC,MAAM,WAAW,OAAO,IAAI,GAAG,GAAG,MAAM;EACxC,IAAI,UACF,OAAO;CAEX;CAEA,MAAM,SACJ,WACA,KACA,QACA,eACA,oBAEA,IAAI,UACF,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,KACF;CAEF,MAAM,UAAU,MACd,WACA,KACA,QACA,KAAA,GACA,KAAA,CACF;CAEA,IAAI,UAAU;EACZ,IAAI,CAAC,OAAO;GACV,wBAAQ,IAAI,IAAI;GAChB,cAAc,IAAI,QAAQ,KAAK;EACjC;EACA,MAAM,IAAI,KAAK,IAAI,QAAQ,OAAO,CAAC;CACrC;CAEA,OAAO;AACT;;;;;;;;;;AAWA,IAAa,YAAb,MAQA;CACE,CAAU,qBAAqB;CAE/B;CACA;CACA;CACA;CACA,QAAgB;CAChB;CACA;CACA;CACA;;;;;;;;CASA;CACA;;;;;CAMA;;;;;;CAOA;CAEA,YACE,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,UACA;EACA,KAAKA,UAAU;EACf,KAAKC,aAAa;EAClB,KAAKC,OAAO;EACZ,KAAK,SAAS;EACd,KAAKC,UAAU;EACf,KAAKC,mBAAmB;EACxB,KAAK,gBAAgB;EACrB,KAAKC,YAAY;CACnB;;;;;;;CAQA,eAAkB,KAAa,OAAmB;EAChD,MAAM,WAAW,KAAKC,cAAc,cAAc,GAAG;EACrD,IAAI,aAAa,KAAA,GACf,OAAO;EAET,OAAO,KAAKC,QAAQ,KAAK,KAAA,GAAW,KAAA,GAAW,MAAM,GAAG,IAAI;CAC9D;;;;;;;;;;;;;;;CAgBA,QACE,KACA,OACA,OACA,OACG;EACH,MAAM,WAAW,KAAKD,cAAc,OAAO,KAAK,OAAO,KAAK;EAC5D,IAAI,aAAa,KAAA,GACf,OAAO;EAET,OAAO,KAAKC,QAAQ,KAAK,OAAO,OAAO,MAAM,GAAG,KAAK;CACvD;CAEA,QACE,KACA,OACA,OACA,SACA,SACG;EACH,MAAM,IAAI;EACV,EAAEC,UAAU;EACZ,MAAM,cAAe,KAAKF,iBAAiB,IAAI,YAAY;EAC3D,IAAI,SACF,YAAY,aAAa,KAAK,CAAC;OAE/B,YAAY,MAAM,KAAK,OAAO,OAAO,CAAC;EAExC,OAAO;CACT;CAEA,IAAI,UAAwD;EAC1D,sBAAsB;CACxB;CAEA,QAAQ,UAIN;EACA,sBAAsB;CACxB;CAOA,YACE,eACA,MACuC;EACvC,sBAAsB;CACxB;CAEA,YACE,MACA,MACiC;EACjC,OAAO,KAAKG,QAAQ,eAAe,MAAM,YACvC,KAAKJ,UACH,KAAKJ,YACL,KAAKC,MACL,KAAK,QACL;GACE;GACA;EACF,GACA,KAAKE,gBACP,CACF;CACF;CAEA,OAAe;EACb,IAAI,CAAC,KAAKM,OAAO;GACf,KAAKA,QAAQ,qBACX,KAAKR,MACL,KAAK,QACL,KAAKC,SACL,KAAKC,kBACL,KAAK,eAAe,MACpB,KAAK,eAAe,IACtB;GACA,KAAKO,cAAc;EACrB;EACA,OAAO,KAAKD;CACd;;;;;;;;;;;CAYA,gBAAsB;EACpB,MAAM,SAAS,KAAKF;EACpB,IAAI,WAAW,KAAA,GAEb;EAEF,IAAI,OAAO;EACX,OAAO,KAAKA,YAAY,KAAA,GACtB,OAAO,KAAKA;EAEd,MAAM,QAAS,KAAKI,YAAY,IAAI,UAAU;EAC9C,MAAM,WAAW,MAAM,IAAI,KAAKF,KAAK;EACrC,IAAI,aAAa,KAAA,GACf,MAAM,IAAI,KAAKA,OAAO,IAAI;OACrB,IAAI,aAAa,QAAQ,KAAKG,QAAQ,QAAQ,GACnD,OAAOP,cAAc,QAAQ,MAAM,QAAQ;CAE/C;;;;;;CAOA,QAAQ,OAA0C;EAChD,OACE,KAAKH,YAAY,MAAMA,WACvB,KAAKC,qBAAqB,MAAMA,oBAChC,KAAK,eAAe,SAAS,MAAM,eAAe,QAClD,UAAU,KAAK,eAAe,MAAM,MAAM,eAAe,IAAI,KAC7D,UAAU,KAAK,QAAQ,MAAM,MAAM,KACnC,UAAU,KAAKF,MAAM,MAAMA,IAAI;CAEnC;CAEA,MAAmD;EACjD,OAAO,KAAKO,QAAQ,OAAO,KAAA,GAAW,KAAA,SACpC,KAAKJ,UACH,KAAKJ,YACL;GAAC,GAAG,KAAKC;GAAM,OAAO;EAAC,GACvB;GACE,GAAG,KAAK;GACR,UAAU;EACZ,GACA,KAAK,eACL,KAAKE,gBACP,CACF;CACF;CAEA,YACE,cACA,aACA,SACiC;EACjC,MAAM,KAAK,OAAO,gBAAgB,aAAa,cAAc,KAAA;EAC7D,MAAM,OAAO,OAAO,gBAAgB,aAAa,UAAU;EAC3D,OAAO,KAAK,OAAO,EAAC,aAAY,OAAO,cAAc,IAAI,IAAI,CAAC;CAKhE;CAEA,QACE,cACA,IAC6B;EAC7B,IAAI,aAAa,WAAA,QAAsB,GACrC,MAAM,IAAI,MACR,0CAA0C,YAAY,8BACxD;EAEF,KAAK,QAAO,MAAK;EAEjB,MAAM,UAAU,KAAKJ,QAAQ,cAAc,KAAKC,YAAY;EAC5D,OAAO,SAAS,sBAAsB;EACtC,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,EAAC,YAAY,WAAW,aAAa,gBAAe,QAAQ;GAIlE,MAAM,IAAc,KAAKa,eACvB,eAAe,sBAEb,KAAKT,UACH,YACA,SAAS,YAAY,YAAY,GACjC;IACE,eAAe,CAAC;IAChB,UAAU,gBAAgB;GAC5B,GACA,KAAK,eACL,KAAA,CACF,CACJ;GAOA,MAAM,WAAW,YAAY,GAAG,CAAC,CAAC;GAClC,OACE,cAAc,WAAW,GACzB,2DACF;GACA,OACE,cAAc,SAAS,GACvB,gEACF;GACA,OACE,YAAY,WAAW,UAAU,QACjC,kFACF;GAMA,OAAO,KAAKI,QACV,WAAW,YAAY,GACvB,MAAM,SAASP,IAAI,GACnB,KAAA,SAEE,KAAKG,UACH,KAAKJ,YACL;IACE,GAAG,KAAKC;IACR,SAAS,cAAc,KAAKA,KAAK,SAAS;KACxC,aAAa;MACX,aAAa;MACb,YAAY;KACd;KACA,UAAU,SAASA;KACnB,QAAQ,KAAKC;IACf,CAAC;GACH,GACA;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,SAAS;IAC3B;GACF,GACA,KAAK,eACL,KAAKC,gBACP,CACJ;EACF;EAEA,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,CAAC,eAAe,kBAAkB;GACxC,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,KAAK,YACT,GACE,KAAKU,eAAe,eAAe,sBACjC,KAAKT,UACH,YACA,SAAS,YAAY,YAAY,GACjC;IACE,eAAe,CAAC;IAChB,UAAU,eAAe,gBAAgB;GAC3C,GACA,KAAK,eACL,YACF,CACF,CACF,CACF;GAIA,MAAM,EAAC,aAAa,aAAa,WAAW,cAAa;GACzD,MAAM,EAAC,aAAa,cAAc,WAAW,eAAc;GAC3D,OAAO,cAAc,WAAW,GAAG,sBAAsB;GACzD,OAAO,cAAc,SAAS,GAAG,sBAAsB;GACvD,OAAO,cAAc,YAAY,GAAG,sBAAsB;GAC1D,OAAO,cAAc,UAAU,GAAG,sBAAsB;GAExD,OAAO,KAAKI,QACV,WAAW,YAAY,GACvB,MAAM,GAAGP,IAAI,GACb,KAAA,SAEE,KAAKG,UACH,KAAKJ,YACL;IACE,GAAG,KAAKC;IACR,SAAS,cAAc,KAAKA,KAAK,SAAS;KACxC,aAAa;MACX,aAAa;MACb,YAAY;KACd;KACA,QAAQ;KACR,UAAU;MACR,GAAG,SAAS,gBAAgB,YAAY;MAExC,SAAS,CACP,kBAAkB;OAChB,aAAa;QACX,aAAa;QACb,YAAY;OACd;OACA,UAAU,GAAGA;OACb,QAAQ,KAAKC;MACf,CAAC,CACH;KACF;KACA,QAAQ,KAAKA;IACf,CAAC;GACH,GACA;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,GAAG;IACrB;GACF,GACA,KAAK,eACL,KAAKC,gBACP,CACJ;EACF;EAEA,MAAM,IAAI,MAAM,wBAAwB,cAAc;CACxD;CAMA,MACE,0BACA,WACA,OACsC;EACtC,IAAI;EAEJ,IAAI,OAAO,6BAA6B,YACtC,OAAO,yBAAyB,KAAK,kBAAkB,CAAC;OACnD;GACL,OAAO,UAAU,UAAU,GAAG,uCAAuC;GAGrE,MAAM,SAAS,UAAU,WAAW;GACpC,MAAM,KAAM,SAAS,MAAM;GAC3B,MAAM,MAAM,SAAS,YAAY;GAQjC,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;IAC3C,MAAM,MAAM,KAAKE,cAAc,OAC7B,SAAS,0BAA0B,EAAE,GACpC,OAAO,MACR,KAAA,CACF;IACA,IAAI,QAAQ,KAAA,GACV,OAAO;GAEX;GAEA,OAAO,SACH,IAAI,0BAA0B,SAAS,IACvC,IAAI,0BAA0B,WAAW,KAAK;EACpD;EAWA,IAAI;EACJ,IAAI;EACJ,IAAI,QAAe;EACnB,IAAI,KAAK,SAAS,YAAY,KAAK,KAAK,SAAS,UAAU;GACzD,MAAM,SAAS,KAAK,KAAK,MAAM,KAAK,EAAE;GACtC,MAAM,QAAQ,KAAK;GACnB,SACE,MAAM,SAAS,aAAa,YAAY,MAAM,KAAK,IAC/C,MAAM,QACN,SAAS,KAAK;GACpB,QAAQ,KAAA;EACV,OAAO;GAGL,MAAM,QAAQ,QAAQ,IAAI;GAC1B,IAAI,UAAU,KAAA,GACZ,MAAM,QAAQ,IAAI;QACb;IACL,MAAM;IACN,SAAS;IACT,QAAQ,KAAA;GACV;EACF;EAEA,OAAO,KAAKG,QAAQ,KAAK,QAAQ,aAAa;GAC5C,MAAM,gBAAgB,KAAKP,KAAK;GAChC,MAAM,SAAS,gBAAgB,IAAI,eAAe,IAAI,IAAI;GAC1D,OAAO,KAAKG,UACV,KAAKJ,YACL;IAAC,GAAG,KAAKC;IAAM,OAAO,mBAAmB,kBAAkB,MAAM,CAAC;GAAC,GACnE,KAAK,QACL,KAAK,eACL,KAAKE,gBACP;EACF,CAAC;CACH;CAEA,MACE,KACA,MACiC;EAGjC,OAAO,KAAKK,QACV,MAAM,YAAY,oBAAoB,mBACtC,SAAS,GAAwB,GACjC,KAAA,SAEE,KAAKJ,UACH,KAAKJ,YACL;GACE,GAAG,KAAKC;GACR,OAAO;IACL;IACA,WAAW,CAAC,MAAM;GACpB;EACF,GACA,KAAK,QACL,KAAK,eACL,KAAKE,gBACP,CACJ;CACF;CAEA,MAAM,OAAgD;EACpD,IAAI,QAAQ,GACV,MAAM,IAAI,MAAM,4BAA4B;EAE9C,KAAK,QAAQ,OAAO,OAClB,MAAM,IAAI,MAAM,0BAA0B;EAE5C,IAAI,KAAKA,kBACP,MAAM,IAAI,oBACR,gGACE,KAAKA,gBACT;EAGF,OAAO,KAAKK,QAAQ,SAAS,OAAO,KAAA,SAClC,KAAKJ,UACH,KAAKJ,YACL;GAAC,GAAG,KAAKC;GAAM;EAAK,GACpB,KAAK,QACL,KAAK,eACL,KAAKE,gBACP,CACF;CACF;CAEA,QACE,OACA,WACiC;EACjC,IAAI,KAAKA,kBACP,MAAM,IAAI,oBACR,mGACE,KAAKA,gBACT;EAEF,OAAO,KAAKK,QACV,cAAc,QAAQ,gBAAgB,gBACtC,OACA,KAAA,SAEE,KAAKJ,UACH,KAAKJ,YACL;GACE,GAAG,KAAKC;GACR,SAAS,CACP,GAAI,KAAKA,KAAK,WAAW,CAAC,GAC1B,CAAC,OAAiB,SAAS,CAC7B;EACF,GACA,KAAK,QACL,KAAK,eACL,KAAKE,gBACP,CACJ;CACF;CAEA,QACE,cACA,IACA,SACW;EACX,KAAK,QAAO,MAAK;EACjB,MAAM,OAAO,SAAS;EACtB,MAAM,SAAS,SAAS;EACxB,MAAM,UAAU,KAAKJ,QAAQ,cAAc,KAAKC,YAAY;EAC5D,OAAO,SAAS,sBAAsB;EAEtC,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,EAAC,YAAY,eAAe,aAAa,cAAa,QAAQ;GACpE,OAAO,cAAc,WAAW,GAAG,sBAAsB;GACzD,OAAO,cAAc,SAAS,GAAG,sBAAsB;GAEvD,MAAM,WAAW,YACf,GACE,KAAKa,eAAe,cAAc,sBAChC,KAAKT,UACH,eACA,SAAS,eAAe,GAAG,cAAc,cAAc,GACvD,eACA,KAAK,eACL,KAAA,CACF,CACF,CACF,CACF;GAGA,MAAM,SAASH,IAAI;GAInB,OAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,KAAKC;KACb,aAAa;MACX,aAAa;MACb,YAAY;KACd;KACA,UAAU,SAASD;IACrB;IACA,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,KAAI,IAAI,CAAC;IACnC,GAAI,WAAW,KAAA,IAAY,EAAC,OAAM,IAAI,CAAC;GACzC;EACF;EAEA,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,CAAC,eAAe,kBAAkB;GACxC,OAAO,cAAc,cAAc,WAAW,GAAG,sBAAsB;GACvE,OAAO,cAAc,cAAc,SAAS,GAAG,sBAAsB;GACrE,OAAO,cAAc,eAAe,WAAW,GAAG,sBAAsB;GACxE,OAAO,cAAc,eAAe,SAAS,GAAG,sBAAsB;GACtE,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,cAAc,GAClB,KAAKY,eAAe,sBAAsB,sBACxC,KAAKT,UACH,YACA,SAAS,YAAY,GAAG,YAAY,UAAU,cAAc,GAC5D,eACA,KAAK,eACL,YACF,CACF,CACF;GAEA,OAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,KAAKF;KACb,aAAa;MACX,aAAa,cAAc;MAC3B,YAAY,cAAc;KAC5B;KACA,UAAU;MACR,GAAG,SAAS,gBAAgB,GAAG,cAAc,cAAc;MAG3D,OAAO,mBAAmB;OACxB,MAAM;OACN,SAAS;QACP,QAAQ,KAAKA;QACb,aAAa;SACX,aAAa,eAAe;SAC5B,YAAY,eAAe;QAC7B;QACA,UAAU,YAAY,WAAW,EAAED;OACrC;OACA,IAAI;OACJ,GAAI,SAAS,KAAA,IAAY,EAAC,KAAI,IAAI,CAAC;OACnC,GAAI,WAAW,KAAA,IAAY,EAAC,OAAM,IAAI,CAAC;MACzC,CAAC;KACH;IACF;IACA,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,KAAI,IAAI,CAAC;GACrC;EACF;EAEA,MAAM,IAAI,MAAM,wBAAwB,cAAc;CACxD;CAEA,IAAI,MAAqB;EACvB,OAAO,KAAKA;CACd;CAEA,oBAAwD;EAItD,OAAQ,KAAKa,uBAAuB,IAAI,kBACtC,KAAKC,QAAQ,KAAK,IAAI,CAGxB;CACF;AACF;AAEA,SAAgB,YAId,GAAyE;CACzE,OAAO,aAAa,WAAW,6BAA6B;CAC5D,OAAO;AACT;;;;;;;;;;;;;;;AAgBA,IAAM,yBAAS,IAAI,QAAqB;AACxC,IAAI,YAAY;AAEhB,IAAM,iBAAiB,EAAE;AAEzB,SAAS,MAAM,KAAkB;CAC/B,OAAO,oBAAoB,QAAQ,KAAK,QAAQ;AAClD;;;;;;;;;AAUA,IAAM,4BAAY,IAAI,IAAiC;AAEvD,SAAS,SAAS,QAAgB,IAAoB;CAEpD,OAAO,oBADM,oBAAoB,WAAW,QAAQ,MACzB,GAAM,KAAI,OAAM,SAAS,OAAO,GAAG,IAAI;AACpE;AAEA,IAAM,8BAAc,IAAI,IAAoB;AAE5C,IAAM,iBAAiB,iBAAyB,WAAW;AAE3D,SAAS,WAAW,cAA8B;CAChD,OAAO,oBAAoB,aAAa,cAAc,aAAa;AACrE;AAEA,SAAS,YAAY,GAAwD;CAC3E,OAAO,MAAM,QAAQ,OAAO,MAAM;AACpC;;;;;;;;;;;;;;;;AAiBA,SAAS,SAAS,GAA8B;CAC9C,QAAQ,OAAO,GAAf;EACE,KAAK,UACH,OAAO,KAAK,IAAI,CAAC;EACnB,KAAK,UACH,OAAO,KAAK,EAAE;EAChB,KAAK,WACH,OAAO,IAAI,OAAO;EACpB,SAAS;GACP,IAAI,MAAM,MACR,OAAO;GAET,IAAI,MAAM,QAAQ,CAAC,GAAG;IACpB,IAAI,MAAM,KAAK,EAAE,OAAO;IACxB,KAAK,MAAM,KAAK,GACd,OAAO,SAAS,CAAC;IAEnB,OAAO;GACT;GAEA,MAAM,IAAI;GACV,IAAI,OAAO;GACX,IAAI,IAAI;GACR,KAAK,MAAM,OAAO,GAAG;IACnB,MAAM,IAAI,EAAE;IACZ,IAAI,MAAM,KAAA,KAAa,OAAO,OAAO,GAAG,GAAG,GAAG;KAC5C,QAAQ,IAAI,GAAG,IAAI,SAAS,CAAC;KAC7B;IACF;GACF;GACA,OAAO,KAAK,EAAE,GAAG;EACnB;CACF;AACF;;;;;;;;;;AAWA,SAAS,SAAS,OAAyC;CACzD,IAAI,MAAM,SAAS,WACjB,OAAO,KAAK,SAAS,KAAqC;CAE5D,OAAO,SAAS,MAAM,KAAK;AAC7B;;;;;AAMA,SAAS,IAAI,GAAmB;CAC9B,OAAO,GAAG,EAAE,OAAO,GAAG;AACxB;;AAGA,SAAS,IAAI,GAAgC;CAC3C,OAAO,MAAM,KAAA,IAAY,MAAM,IAAI,MAAM;AAC3C;;;;;;;;;;;AAYA,SAAS,QAAQ,MAAqC;CACpD,QAAQ,KAAK,MAAb;EACE,KAAK;GACH,IAAI,KAAK,KAAK,SAAS,UACrB;GAEF,OAAO,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE,IAAI,SAAS,KAAK,KAAK;EAErE,KAAK,sBAAsB;GACzB,MAAM,KAAK,OAAO,IAAI,KAAK,QAAQ,QAAQ;GAC3C,OAAO,OAAO,KAAA,IACV,KAAA,IACA,IAAI,GAAG,GAAG,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,MAAM;EAC/D;EACA,KAAK;EACL,KAAK,MAAM;GACT,IAAI,MAAM,GAAG,KAAK,SAAS,QAAQ,MAAM,MAAM,KAAK,WAAW,OAAO;GACtE,KAAK,MAAM,KAAK,KAAK,YAAY;IAC/B,MAAM,IAAI,QAAQ,CAAC;IACnB,IAAI,MAAM,KAAA,GACR;IAEF,OAAO;GACT;GACA,OAAO;EACT;EACA,SACE;CACJ;AACF;;;;;;;AAQA,SAAS,QAAQ,MAAyB;CACxC,QAAQ,KAAK,MAAb;EACE,KAAK,sBACH,OAAO,WAAW,KAAK,QAAQ,SAAS,MAAM,GAAG,KAAK;EACxD,KAAK;EACL,KAAK,MACH,OAAO,SAAS,KAAK,KAAK,GAAG,KAAK,WAAW;EAC/C,SACE,OAAO;CACX;AACF;AAEA,SAAS,wBAA+B;CACtC,MAAM,IAAI,MAAM,uBAAuB;AACzC;AAEA,SAAS,cAAc,OAAgD;CACrE,OAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,UAAU;AACjD;AAEA,SAAS,SAAY,GAAoC;CACvD,OAAO,EAAE,WAAW;AACtB;AAEA,SAAS,SAAY,GAAuC;CAC1D,OAAO,EAAE,WAAW;AACtB"}
+{"version":3,"file":"query-impl.js","names":[],"sources":["../../../../../zql/src/query/query-impl.ts"],"sourcesContent":["// oxlint-disable no-explicit-any\nimport {assert} from '../../../shared/src/asserts.ts';\nimport {\n  deepEqual,\n  type ReadonlyJSONObject,\n  type ReadonlyJSONValue,\n} from '../../../shared/src/json.ts';\nimport {getOrInsertComputed, newMap} from '../../../shared/src/map.ts';\nimport {\n  type AST,\n  type CompoundKey,\n  type Condition,\n  type NormalizedAST,\n  type Parameter,\n  type LiteralValue,\n  type SimpleCondition,\n  type SimpleOperator,\n  type System,\n  insertRelated,\n  normalizeAST,\n  normalizeCondition,\n  normalizedRelated,\n  SUBQ_PREFIX,\n  tableAST,\n} from '../../../zero-protocol/src/ast.ts';\nimport {hashOfQueryInternals} from '../../../zero-protocol/src/query-hash-visitor.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 {\n  HashIndex,\n  Transitions,\n  type Delta,\n  type TransitionValue,\n} from './query-transitions.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: NormalizedAST,\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 newQueryInternal(\n    schema,\n    table,\n    tableAST(table),\n    defaultFormat,\n    'client',\n  );\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  // This is the entry point for ASTs that were not built by QueryImpl, so\n  // normalize it here to establish the invariant that #ast is normalized.\n  return newQueryInternal(schema, tableName, normalizeAST(ast), format, system);\n}\n\n/**\n * Root queries are interned per schema so that two `createBuilder(schema)` calls\n * hand out the same starting point, and therefore share the whole transition\n * tree below it. Only cleared entries accumulate here, at most one per\n * system/table pair, so no sweeping is needed.\n */\nconst rootsBySchema = new WeakMap<\n  Schema,\n  Map<string, WeakRef<QueryImpl<any, any, any>>>\n>();\n\n/**\n * Whether this is the AST `tableAST(tableName)` produces -- the whole table,\n * nothing else. A normalized AST carries every field, so this cannot be a key\n * count; each one has to be checked.\n */\nfunction isRootAST(ast: NormalizedAST, tableName: string): boolean {\n  return (\n    ast.table === tableName &&\n    ast.schema === undefined &&\n    ast.alias === undefined &&\n    ast.where === undefined &&\n    ast.related === undefined &&\n    ast.start === undefined &&\n    ast.limit === undefined &&\n    ast.orderBy === undefined\n  );\n}\n\nfunction newQueryInternal<\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: NormalizedAST,\n  format: Format,\n  system: System,\n): QueryImpl<TTable, TSchema, TReturn> {\n  // Callers that hand in a pre-built AST -- benchmarks and the integration-test\n  // harnesses -- are not roots and are not interned.\n  const interned = format === defaultFormat && isRootAST(ast, tableName);\n  const key = `${system}:${tableName}`;\n  let roots: Map<string, WeakRef<QueryImpl<any, any, any>>> | undefined;\n\n  if (interned) {\n    roots = rootsBySchema.get(schema);\n    const existing = roots?.get(key)?.deref();\n    if (existing) {\n      return existing as QueryImpl<TTable, TSchema, TReturn>;\n    }\n  }\n\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  const created = inner<TTable, TReturn>(\n    tableName,\n    ast,\n    format,\n    undefined,\n    undefined,\n  );\n\n  if (interned) {\n    if (!roots) {\n      roots = new Map();\n      rootsBySchema.set(schema, roots);\n    }\n    roots.set(key, new WeakRef(created));\n  }\n\n  return created;\n}\n\n/**\n * The AST of a QueryImpl is always normalized. Each step builds its AST in\n * normalized form rather than normalizing afterwards: a normalized AST has\n * every field, so spreading one and replacing a field keeps the field order\n * intact, and only the field a step actually changes needs normalizing (the\n * conditions of a `where`, the position of a new `related`). The ASTs that\n * come in from the outside are normalized by {@link newQueryImpl}, which is\n * what the `NormalizedAST` of the AST it holds stands for.\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: NormalizedAST;\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  /**\n   * The query this one was derived from, held *strongly*, and the queries\n   * derived from this one, held *weakly*. This is the arrangement V8 uses for\n   * hidden-class transitions, and it is what makes interning stable: as long as\n   * a query is reachable its whole ancestor spine is too, so re-deriving it from\n   * the root yields the same instance. See `query-transitions.ts`.\n   */\n  #parent: QueryImpl<any, any, any> | undefined;\n  #transitions: Transitions<QueryImpl<any, any, any>> | undefined;\n\n  /**\n   * The second level of interning, keyed by hash; see `HashIndex`. Set on the\n   * root only, which is what scopes it to one schema and one delegate.\n   */\n  #byHash: HashIndex<QueryImpl<any, any, any>> | undefined;\n\n  /**\n   * Memoized because a query is interned: the same node serves every rebuild of\n   * a chain, so building this once rather than per `where(fn)` call takes the\n   * whole thing -- the builder and the bound `#exists` -- off the repeat path.\n   */\n  #expressionBuilder: ExpressionBuilder<TTable, TSchema> | undefined;\n\n  constructor(\n    schema: TSchema,\n    tableName: TTable,\n    ast: NormalizedAST,\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  /**\n   * Interns a transition whose key space is finite and schema-derived; see\n   * {@link Transitions.storeBounded}. Used for the base sub-query handed to\n   * a `related`/`exists` callback, which is determined entirely by the\n   * relationship name.\n   */\n  #deriveBounded<T>(key: string, build: () => T): T {\n    const existing = this.#transitions?.lookupBounded(key);\n    if (existing !== undefined) {\n      return existing as T;\n    }\n    return this.#record(key, undefined, undefined, build(), true);\n  }\n\n  /**\n   * Interns the result of applying a builder operation to this query.\n   *\n   * `key` names the operation and `value` carries its varying argument, kept\n   * apart so the key stays a string V8 has already hashed. When the two do not\n   * settle it, `delta` carries the rest and is compared with `deepEqual`. Only\n   * the delta is compared, never the whole AST: this query is already canonical,\n   * so two of its children are equal exactly when the operations that produced\n   * them are.\n   *\n   * `T` is deliberately unconstrained so that the contextual return type at each\n   * call site still drives `#newQuery`'s inference, exactly as it did when the\n   * call sites returned `this.#newQuery(...)` directly.\n   */\n  #derive<T>(\n    key: string,\n    value: TransitionValue,\n    delta: Delta,\n    build: () => T,\n  ): T {\n    const existing = this.#transitions?.lookup(key, value, delta);\n    if (existing !== undefined) {\n      return existing as T;\n    }\n    return this.#record(key, value, delta, build(), false);\n  }\n\n  #record<T>(\n    key: string,\n    value: TransitionValue,\n    delta: Delta,\n    created: T,\n    bounded: boolean,\n  ): T {\n    const q = created as unknown as QueryImpl<any, any, any>;\n    q.#parent = this;\n    const transitions = (this.#transitions ??= new Transitions());\n    if (bounded) {\n      transitions.storeBounded(key, q);\n    } else {\n      transitions.store(key, value, delta, q);\n    }\n    return created;\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    cached: 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.#derive('nameAndArgs', name, args, () =>\n      this.#newQuery(\n        this.#tableName,\n        this.#ast,\n        this.format,\n        {\n          name,\n          args,\n        },\n        this.#currentJunction,\n      ),\n    );\n  }\n\n  hash(): string {\n    if (!this.#hash) {\n      this.#hash = hashOfQueryInternals(\n        this.#ast,\n        this.format,\n        this.#system,\n        this.#currentJunction,\n        this.customQueryID?.name,\n        this.customQueryID?.args,\n      );\n      this.#canonicalize();\n    }\n    return this.#hash;\n  }\n\n  /**\n   * Folds this query into its root's hash index, now that its hash is known.\n   *\n   * If an equal query is already indexed, the transition that produced this\n   * one is re-pointed at it, so the next rebuild along this path yields that\n   * instance rather than a second copy. This query itself is left alone: its\n   * identity has already been handed out. Content is verified with `#sameAs`\n   * before anything is redirected, so a hash collision costs nothing worse\n   * than a missed unification.\n   */\n  #canonicalize(): void {\n    const parent = this.#parent;\n    if (parent === undefined) {\n      // A root has no path to redirect and is its own canonical form.\n      return;\n    }\n    let root = parent;\n    while (root.#parent !== undefined) {\n      root = root.#parent;\n    }\n    const index = (root.#byHash ??= new HashIndex());\n    const existing = index.get(this.#hash);\n    if (existing === undefined) {\n      index.set(this.#hash, this);\n    } else if (existing !== this && this.#sameAs(existing)) {\n      parent.#transitions?.replace(this, existing);\n    }\n  }\n\n  /**\n   * Whether `other` is interchangeable with this query: everything `hash()`\n   * covers, compared structurally. Schema and delegate are not compared. Both\n   * are fixed by the root, and this only ever compares queries under one root.\n   */\n  #sameAs(other: QueryImpl<any, any, any>): boolean {\n    return (\n      this.#system === other.#system &&\n      this.#currentJunction === other.#currentJunction &&\n      this.customQueryID?.name === other.customQueryID?.name &&\n      deepEqual(this.customQueryID?.args, other.customQueryID?.args) &&\n      deepEqual(this.format, other.format) &&\n      deepEqual(this.#ast, other.#ast)\n    );\n  }\n\n  one(): Query<TTable, TSchema, TReturn | undefined> {\n    return this.#derive('one', undefined, undefined, () =>\n      this.#newQuery(\n        this.#tableName,\n        {...this.#ast, limit: 1},\n        {\n          ...this.format,\n          singular: true,\n        },\n        this.customQueryID,\n        this.#currentJunction,\n      ),\n    );\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      // Intern the base handed to the callback too. A deterministic callback\n      // then walks the same interned chain and hands back the *same* sub-query,\n      // which makes the comparison below a pointer compare.\n      const q: AnyQuery = this.#deriveBounded(\n        `relatedBase:${relationship}`,\n        () =>\n          this.#newQuery(\n            destSchema,\n            tableAST(destSchema, relationship),\n            {\n              relationships: {},\n              singular: cardinality === 'one',\n            },\n            this.customQueryID,\n            undefined,\n          ),\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      // Keyed by the sub-query's identity. Each query owns its AST object, so\n      // this distinguishes even `q.one()` from `q.limit(1)`, whose ASTs are\n      // structurally equal but whose formats differ. Comparing them as a delta\n      // instead would put every sibling under one key and scan.\n      return this.#derive(\n        relatedKey(relationship),\n        astID(subQuery.#ast),\n        undefined,\n        () =>\n          this.#newQuery(\n            this.#tableName,\n            {\n              ...this.#ast,\n              related: insertRelated(this.#ast.related, {\n                correlation: {\n                  parentField: sourceField,\n                  childField: destField,\n                },\n                subquery: subQuery.#ast,\n                system: this.#system,\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          ),\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.#deriveBounded(`relatedBase:${relationship}`, () =>\n            this.#newQuery(\n              destSchema,\n              tableAST(destSchema, relationship),\n              {\n                relationships: {},\n                singular: secondRelation.cardinality === 'one',\n              },\n              this.customQueryID,\n              relationship,\n            ),\n          ) as AnyQuery,\n        ),\n      );\n\n      // Bound to consts so the `isCompoundKey` narrowing survives into the\n      // closure below; TypeScript drops narrowing of property accesses there.\n      const {sourceField: firstSource, destField: firstDest} = firstRelation;\n      const {sourceField: secondSource, destField: secondDest} = secondRelation;\n      assert(isCompoundKey(firstSource), 'Invalid relationship');\n      assert(isCompoundKey(firstDest), 'Invalid relationship');\n      assert(isCompoundKey(secondSource), 'Invalid relationship');\n      assert(isCompoundKey(secondDest), 'Invalid relationship');\n\n      return this.#derive(\n        relatedKey(relationship),\n        astID(sq.#ast),\n        undefined,\n        () =>\n          this.#newQuery(\n            this.#tableName,\n            {\n              ...this.#ast,\n              related: insertRelated(this.#ast.related, {\n                correlation: {\n                  parentField: firstSource,\n                  childField: firstDest,\n                },\n                hidden: true,\n                subquery: {\n                  ...tableAST(junctionSchema, relationship),\n                  // A single subquery is sorted.\n                  related: [\n                    normalizedRelated({\n                      correlation: {\n                        parentField: secondSource,\n                        childField: secondDest,\n                      },\n                      subquery: sq.#ast,\n                      system: this.#system,\n                    }),\n                  ],\n                },\n                system: this.#system,\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          ),\n      ) as AnyQuery;\n    }\n\n    throw new Error(`Invalid relationship ${relationship}`);\n  }\n\n  // The declared return is the *bottom* of the pinned dimension, which is\n  // assignable to every `where` overload's declared return. The overloads\n  // refine `TPinned` for callers only; a single non-generic implementation\n  // signature cannot express that refinement.\n  where(\n    fieldOrExpressionFactory: string | ExpressionFactory<TTable, TSchema>,\n    opOrValue?: SimpleOperator | GetFilterTypeAny | Parameter,\n    value?: GetFilterTypeAny | Parameter,\n  ): Query<TTable, TSchema, TReturn, any> {\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      const twoArg = arguments.length === 2;\n      const op = (twoArg ? '=' : opOrValue) as SimpleOperator;\n      const raw = twoArg ? opOrValue : value;\n\n      // Comparing a column to a primitive is by far the most common thing anyone\n      // does with a query, and the transition it names is fully determined by\n      // (column, op, value) -- so check for it before building anything. On a hit\n      // this returns without allocating the `Condition` at all. Objects are\n      // excluded, which covers both parameter references and `IN` arrays; `cmp`\n      // maps a missing value to null, so this must too.\n      if (raw === null || typeof raw !== 'object') {\n        const hit = this.#transitions?.lookup(\n          whereKey(fieldOrExpressionFactory, op),\n          (raw ?? null) as TransitionValue,\n          undefined,\n        );\n        if (hit !== undefined) {\n          return hit as unknown as Query<TTable, TSchema, TReturn, any>;\n        }\n      }\n\n      cond = twoArg\n        ? cmp(fieldOrExpressionFactory, opOrValue)\n        : cmp(fieldOrExpressionFactory, opOrValue, value);\n    }\n\n    // The delta is the condition as built here, *before* it is merged with the\n    // existing where and normalized. Both steps are deterministic and the\n    // existing where is fixed by this query, so an equal `cond` always produces\n    // an equal result.\n    //\n    // A simple comparison against a column splits cleanly: the column and\n    // operator come from a small fixed set and give a memoized, stable key,\n    // while the compared value -- the part that varies per call -- is handed\n    // through as the transition value and never concatenated into a string.\n    let key: string;\n    let tValue: TransitionValue;\n    let delta: Delta = cond;\n    if (cond.type === 'simple' && cond.left.type === 'column') {\n      key = whereKey(cond.left.name, cond.op);\n      const right = cond.right;\n      tValue =\n        right.type === 'literal' && isPrimitive(right.value)\n          ? right.value\n          : rightTag(right);\n      delta = undefined;\n    } else {\n      // A sub-query an `exists` correlates to is itself interned, so its\n      // identity settles that part of the tree without walking it.\n      const exact = condKey(cond);\n      if (exact === undefined) {\n        key = treeKey(cond);\n      } else {\n        key = 'where:tree';\n        tValue = exact;\n        delta = undefined;\n      }\n    }\n\n    return this.#derive(key, tValue, delta, () => {\n      const existingWhere = this.#ast.where;\n      const merged = existingWhere ? and(existingWhere, cond) : cond;\n      return this.#newQuery(\n        this.#tableName,\n        {...this.#ast, where: normalizeCondition(simplifyCondition(merged))},\n        this.format,\n        this.customQueryID,\n        this.#currentJunction,\n      );\n    }) as unknown as Query<TTable, TSchema, TReturn, any>;\n  }\n\n  start(\n    row: Partial<Record<string, ReadonlyJSONValue | undefined>>,\n    opts?: {inclusive: boolean},\n  ): Query<TTable, TSchema, TReturn> {\n    // The row is an object, so it is encoded to a string to serve as the\n    // lookup key. Property order is part of that string.\n    return this.#derive(\n      opts?.inclusive ? 'start:inclusive' : 'start:exclusive',\n      valueTag(row as ReadonlyJSONValue),\n      undefined,\n      () =>\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  }\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.#derive('limit', limit, undefined, () =>\n      this.#newQuery(\n        this.#tableName,\n        {...this.#ast, limit},\n        this.format,\n        this.customQueryID,\n        this.#currentJunction,\n      ),\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.#derive(\n      direction === 'asc' ? 'orderBy:asc' : 'orderBy:desc',\n      field as string,\n      undefined,\n      () =>\n        this.#newQuery(\n          this.#tableName,\n          {\n            ...this.#ast,\n            orderBy: [\n              ...(this.#ast.orderBy ?? []),\n              [field as string, direction],\n            ],\n          },\n          this.format,\n          this.customQueryID,\n          this.#currentJunction,\n        ),\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.#deriveBounded(`existsBase:${relationship}`, () =>\n            this.#newQuery(\n              destTableName,\n              tableAST(destTableName, `${SUBQ_PREFIX}${relationship}`),\n              defaultFormat,\n              this.customQueryID,\n              undefined,\n            ),\n          ) as AnyQuery,\n        ),\n      );\n      // Give the sub-query's AST an id so the enclosing `where` can key on it\n      // exactly rather than comparing the sub-tree.\n      astID(subQuery.#ast);\n      // Unlike the entries of `related`, the correlated subqueries of a\n      // condition keep the order their fields are written in: normalization\n      // does not reorder them either.\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.#deriveBounded(`existsJunctionBase:${relationship}`, () =>\n          this.#newQuery(\n            destSchema,\n            tableAST(destSchema, `${SUBQ_PREFIX}zhidden_${relationship}`),\n            defaultFormat,\n            this.customQueryID,\n            relationship,\n          ),\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            ...tableAST(junctionSchema, `${SUBQ_PREFIX}${relationship}`),\n            // A single condition needs no flattening or sorting, but the node\n            // itself still has to be rebuilt into the canonical field order.\n            where: normalizeCondition({\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(): NormalizedAST {\n    return this.#ast;\n  }\n\n  expressionBuilder(): ExpressionBuilder<TTable, TSchema> {\n    // Built on demand rather than held as an eagerly initialized field: a field\n    // would cost a closure on every query constructed, where this costs one only\n    // for queries that actually use an expression factory.\n    return (this.#expressionBuilder ??= new ExpressionBuilder<TTable, TSchema>(\n      this.#exists.bind(this) as ConstructorParameters<\n        typeof ExpressionBuilder<TTable, TSchema>\n      >[0],\n    ));\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\n/**\n * A stable id per query AST.\n *\n * Every `QueryImpl` allocates its own AST object, so these are one-to-one with\n * queries, and interning makes the object identity stable across rebuilds. That\n * lets a `related` or `exists` transition key on *which* sub-query it points at\n * rather than comparing the sub-tree.\n *\n * Assigned only where it is needed. A `WeakMap.set` costs on the order of a\n * hundred nanoseconds, so doing this for every query rather than for the few\n * that are sub-queries was one of the largest single costs of building a query\n * from cold. ASTs that never pass through here -- including the junction AST a\n * two-hop `exists` builds inline -- are absent, and fall back to a delta.\n */\nconst astIDs = new WeakMap<AST, number>();\nlet nextASTID = 0;\n\nconst newASTID = () => ++nextASTID;\n\nfunction astID(ast: AST): number {\n  return getOrInsertComputed(astIDs, ast, newASTID);\n}\n\n/**\n * Memoized transition keys.\n *\n * A transition key must be a string V8 has already hashed, or the `Map` lookup\n * has to hash it from scratch -- measured at ~148ns against ~10ns, which dwarfs\n * everything else a lookup does. Both tables are keyed by schema-derived names,\n * so they are bounded by the schema.\n */\nconst whereKeys = new Map<string, Map<string, string>>();\n\nfunction whereKey(column: string, op: string): string {\n  const byOp = getOrInsertComputed(whereKeys, column, newMap);\n  return getOrInsertComputed(byOp, op, op => `where:${column}:${op}`);\n}\n\nconst relatedKeys = new Map<string, string>();\n\nconst newRelatedKey = (relationship: string) => `related:${relationship}`;\n\nfunction relatedKey(relationship: string): string {\n  return getOrInsertComputed(relatedKeys, relationship, newRelatedKey);\n}\n\nfunction isPrimitive(v: LiteralValue): v is string | number | boolean | null {\n  return v === null || typeof v !== 'object';\n}\n\n/**\n * Folds a JSON value into a self-delimiting token: a string is\n * length-prefixed, a number is terminated, an array or object is\n * count-prefixed and encodes its members recursively, and the rest are fixed\n * width. Tokens can therefore be concatenated into a key with no way for one\n * to run into the next, and the leading tag keeps `'1'` and `1` apart.\n *\n * Not `JSON.stringify`: it writes `Infinity`, `NaN` and `null` all as `null`,\n * and this token is trusted as exact, so a nested value that serialized like\n * another's would hand back a query with the wrong value in its AST. Numbers\n * are written the way `String` writes them, which keeps those apart. An\n * `undefined` property is skipped, as `deepEqual` would skip it; property\n * order is part of the encoding, so an object spelled in another order\n * interns separately.\n */\nfunction valueTag(v: ReadonlyJSONValue): string {\n  switch (typeof v) {\n    case 'string':\n      return `:s${enc(v)}`;\n    case 'number':\n      return `:n${v};`;\n    case 'boolean':\n      return v ? ':t' : ':f';\n    default: {\n      if (v === null) {\n        return ':z';\n      }\n      if (Array.isArray(v)) {\n        let out = `:a${v.length}:`;\n        for (const e of v) {\n          out += valueTag(e);\n        }\n        return out;\n      }\n      // `Array.isArray` does not narrow a readonly array out of the union.\n      const o = v as ReadonlyJSONObject;\n      let body = '';\n      let n = 0;\n      for (const key in o) {\n        const e = o[key];\n        if (e !== undefined && Object.hasOwn(o, key)) {\n          body += enc(key) + valueTag(e);\n          n++;\n        }\n      }\n      return `:o${n}:${body}`;\n    }\n  }\n}\n\n/**\n * Folds the right-hand side of a simple condition into a transition value, so\n * that the transition is exact and the lookup needs no comparison at all.\n *\n * Arrays (`IN`) and parameter references are encoded in full: that is one\n * pass over a small value, where leaving them in the delta would instead cost\n * a `deepEqual` over the whole condition for every sibling a lookup walks\n * past.\n */\nfunction rightTag(right: SimpleCondition['right']): string {\n  if (right.type !== 'literal') {\n    return `:p${valueTag(right as unknown as ReadonlyJSONValue)}`;\n  }\n  return valueTag(right.value);\n}\n\n/**\n * Length-prefixes a free-form string so it can be concatenated into a key\n * without a separator being ambiguous with the content.\n */\nfunction enc(s: string): string {\n  return `${s.length}:${s}`;\n}\n\n/** Encodes an optional boolean without collapsing `undefined` into `false`. */\nfunction tri(b: boolean | undefined): string {\n  return b === undefined ? '-' : b ? 't' : 'f';\n}\n\n/**\n * An exact key for a whole condition tree, or `undefined` for a shape we cannot\n * encode (which falls back to {@link treeKey} plus a delta).\n *\n * Everything variable-length is length-prefixed, so distinct trees cannot\n * produce the same string and the key needs no `deepEqual` to back it up. That\n * matters because the alternative -- one coarse bucket per shape -- turns N\n * sibling conditions off the same parent into an N-deep scan of tree\n * comparisons, which measured far slower than not interning at all.\n */\nfunction condKey(cond: Condition): string | undefined {\n  switch (cond.type) {\n    case 'simple': {\n      if (cond.left.type !== 'column') {\n        return undefined;\n      }\n      return `S${enc(cond.left.name)}${enc(cond.op)}${rightTag(cond.right)}`;\n    }\n    case 'correlatedSubquery': {\n      const id = astIDs.get(cond.related.subquery);\n      return id === undefined\n        ? undefined\n        : `E${id}:${enc(cond.op)}${tri(cond.flip)}${tri(cond.scalar)}`;\n    }\n    case 'and':\n    case 'or': {\n      let out = `${cond.type === 'and' ? 'A' : 'O'}${cond.conditions.length}:`;\n      for (const c of cond.conditions) {\n        const k = condKey(c);\n        if (k === undefined) {\n          return undefined;\n        }\n        out += k;\n      }\n      return out;\n    }\n    default:\n      return undefined;\n  }\n}\n\n/**\n * A coarse bucket key for the conditions {@link condKey} cannot encode --\n * a two-hop `exists`, whose junction AST is built inline and so has no identity\n * of its own. Reads only the top of the tree, so it is cheap; the delta tells\n * apart what shares it.\n */\nfunction treeKey(cond: Condition): string {\n  switch (cond.type) {\n    case 'correlatedSubquery':\n      return `where:e:${cond.related.subquery.alias}:${cond.op}`;\n    case 'and':\n    case 'or':\n      return `where:${cond.type}:${cond.conditions.length}`;\n    default:\n      return 'where:*';\n  }\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":";;;;;;;;;;;AAwEA,SAAgB,SAGd,QAAiB,OAAuC;CACxD,OAAO,iBACL,QACA,OACA,SAAS,KAAK,GACd,eACA,QACF;AACF;AAEA,SAAgB,aAKd,QACA,WACA,KACA,QACA,QACqC;CAGrC,OAAO,iBAAiB,QAAQ,WAAW,aAAa,GAAG,GAAG,QAAQ,MAAM;AAC9E;;;;;;;AAQA,IAAM,gCAAgB,IAAI,QAGxB;;;;;;AAOF,SAAS,UAAU,KAAoB,WAA4B;CACjE,OACE,IAAI,UAAU,aACd,IAAI,WAAW,KAAA,KACf,IAAI,UAAU,KAAA,KACd,IAAI,UAAU,KAAA,KACd,IAAI,YAAY,KAAA,KAChB,IAAI,UAAU,KAAA,KACd,IAAI,UAAU,KAAA,KACd,IAAI,YAAY,KAAA;AAEpB;AAEA,SAAS,iBAKP,QACA,WACA,KACA,QACA,QACqC;CAGrC,MAAM,WAAW,WAAW,iBAAiB,UAAU,KAAK,SAAS;CACrE,MAAM,MAAM,GAAG,OAAO,GAAG;CACzB,IAAI;CAEJ,IAAI,UAAU;EACZ,QAAQ,cAAc,IAAI,MAAM;EAChC,MAAM,WAAW,OAAO,IAAI,GAAG,CAAC,EAAE,MAAM;EACxC,IAAI,UACF,OAAO;CAEX;CAEA,MAAM,SACJ,WACA,KACA,QACA,eACA,oBAEA,IAAI,UACF,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,KACF;CAEF,MAAM,UAAU,MACd,WACA,KACA,QACA,KAAA,GACA,KAAA,CACF;CAEA,IAAI,UAAU;EACZ,IAAI,CAAC,OAAO;GACV,wBAAQ,IAAI,IAAI;GAChB,cAAc,IAAI,QAAQ,KAAK;EACjC;EACA,MAAM,IAAI,KAAK,IAAI,QAAQ,OAAO,CAAC;CACrC;CAEA,OAAO;AACT;;;;;;;;;;AAWA,IAAa,YAAb,MAQA;CACE,CAAU,qBAAqB;CAE/B;CACA;CACA;CACA;CACA,QAAgB;CAChB;CACA;CACA;CACA;;;;;;;;CASA;CACA;;;;;CAMA;;;;;;CAOA;CAEA,YACE,QACA,WACA,KACA,QACA,QACA,eACA,iBACA,UACA;EACA,KAAK,UAAU;EACf,KAAK,aAAa;EAClB,KAAK,OAAO;EACZ,KAAK,SAAS;EACd,KAAK,UAAU;EACf,KAAK,mBAAmB;EACxB,KAAK,gBAAgB;EACrB,KAAK,YAAY;CACnB;;;;;;;CAQA,eAAkB,KAAa,OAAmB;EAChD,MAAM,WAAW,KAAK,cAAc,cAAc,GAAG;EACrD,IAAI,aAAa,KAAA,GACf,OAAO;EAET,OAAO,KAAK,QAAQ,KAAK,KAAA,GAAW,KAAA,GAAW,MAAM,GAAG,IAAI;CAC9D;;;;;;;;;;;;;;;CAgBA,QACE,KACA,OACA,OACA,OACG;EACH,MAAM,WAAW,KAAK,cAAc,OAAO,KAAK,OAAO,KAAK;EAC5D,IAAI,aAAa,KAAA,GACf,OAAO;EAET,OAAO,KAAK,QAAQ,KAAK,OAAO,OAAO,MAAM,GAAG,KAAK;CACvD;CAEA,QACE,KACA,OACA,OACA,SACA,SACG;EACH,MAAM,IAAI;EACV,EAAE,UAAU;EACZ,MAAM,cAAe,KAAK,iBAAiB,IAAI,YAAY;EAC3D,IAAI,SACF,YAAY,aAAa,KAAK,CAAC;OAE/B,YAAY,MAAM,KAAK,OAAO,OAAO,CAAC;EAExC,OAAO;CACT;CAEA,IAAI,UAAwD;EAC1D,sBAAsB;CACxB;CAEA,QAAQ,UAIN;EACA,sBAAsB;CACxB;CAOA,YACE,eACA,MACuC;EACvC,sBAAsB;CACxB;CAEA,YACE,MACA,MACiC;EACjC,OAAO,KAAK,QAAQ,eAAe,MAAM,YACvC,KAAK,UACH,KAAK,YACL,KAAK,MACL,KAAK,QACL;GACE;GACA;EACF,GACA,KAAK,gBACP,CACF;CACF;CAEA,OAAe;EACb,IAAI,CAAC,KAAK,OAAO;GACf,KAAK,QAAQ,qBACX,KAAK,MACL,KAAK,QACL,KAAK,SACL,KAAK,kBACL,KAAK,eAAe,MACpB,KAAK,eAAe,IACtB;GACA,KAAK,cAAc;EACrB;EACA,OAAO,KAAK;CACd;;;;;;;;;;;CAYA,gBAAsB;EACpB,MAAM,SAAS,KAAK;EACpB,IAAI,WAAW,KAAA,GAEb;EAEF,IAAI,OAAO;EACX,OAAO,KAAK,YAAY,KAAA,GACtB,OAAO,KAAK;EAEd,MAAM,QAAS,KAAK,YAAY,IAAI,UAAU;EAC9C,MAAM,WAAW,MAAM,IAAI,KAAK,KAAK;EACrC,IAAI,aAAa,KAAA,GACf,MAAM,IAAI,KAAK,OAAO,IAAI;OACrB,IAAI,aAAa,QAAQ,KAAK,QAAQ,QAAQ,GACnD,OAAO,cAAc,QAAQ,MAAM,QAAQ;CAE/C;;;;;;CAOA,QAAQ,OAA0C;EAChD,OACE,KAAK,YAAY,MAAM,WACvB,KAAK,qBAAqB,MAAM,oBAChC,KAAK,eAAe,SAAS,MAAM,eAAe,QAClD,UAAU,KAAK,eAAe,MAAM,MAAM,eAAe,IAAI,KAC7D,UAAU,KAAK,QAAQ,MAAM,MAAM,KACnC,UAAU,KAAK,MAAM,MAAM,IAAI;CAEnC;CAEA,MAAmD;EACjD,OAAO,KAAK,QAAQ,OAAO,KAAA,GAAW,KAAA,SACpC,KAAK,UACH,KAAK,YACL;GAAC,GAAG,KAAK;GAAM,OAAO;EAAC,GACvB;GACE,GAAG,KAAK;GACR,UAAU;EACZ,GACA,KAAK,eACL,KAAK,gBACP,CACF;CACF;CAEA,YACE,cACA,aACA,SACiC;EACjC,MAAM,KAAK,OAAO,gBAAgB,aAAa,cAAc,KAAA;EAC7D,MAAM,OAAO,OAAO,gBAAgB,aAAa,UAAU;EAC3D,OAAO,KAAK,OAAO,EAAC,aAAY,OAAO,cAAc,IAAI,IAAI,CAAC;CAKhE;CAEA,QACE,cACA,IAC6B;EAC7B,IAAI,aAAa,WAAA,QAAsB,GACrC,MAAM,IAAI,MACR,0CAA0C,YAAY,8BACxD;EAEF,KAAK,QAAO,MAAK;EAEjB,MAAM,UAAU,KAAK,QAAQ,cAAc,KAAK,WAAW,CAAC;EAC5D,OAAO,SAAS,sBAAsB;EACtC,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,EAAC,YAAY,WAAW,aAAa,gBAAe,QAAQ;GAIlE,MAAM,IAAc,KAAK,eACvB,eAAe,sBAEb,KAAK,UACH,YACA,SAAS,YAAY,YAAY,GACjC;IACE,eAAe,CAAC;IAChB,UAAU,gBAAgB;GAC5B,GACA,KAAK,eACL,KAAA,CACF,CACJ;GAOA,MAAM,WAAW,YAAY,GAAG,CAAC,CAAC;GAClC,OACE,cAAc,WAAW,GACzB,2DACF;GACA,OACE,cAAc,SAAS,GACvB,gEACF;GACA,OACE,YAAY,WAAW,UAAU,QACjC,kFACF;GAMA,OAAO,KAAK,QACV,WAAW,YAAY,GACvB,MAAM,SAAS,IAAI,GACnB,KAAA,SAEE,KAAK,UACH,KAAK,YACL;IACE,GAAG,KAAK;IACR,SAAS,cAAc,KAAK,KAAK,SAAS;KACxC,aAAa;MACX,aAAa;MACb,YAAY;KACd;KACA,UAAU,SAAS;KACnB,QAAQ,KAAK;IACf,CAAC;GACH,GACA;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,SAAS;IAC3B;GACF,GACA,KAAK,eACL,KAAK,gBACP,CACJ;EACF;EAEA,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,CAAC,eAAe,kBAAkB;GACxC,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,KAAK,YACT,GACE,KAAK,eAAe,eAAe,sBACjC,KAAK,UACH,YACA,SAAS,YAAY,YAAY,GACjC;IACE,eAAe,CAAC;IAChB,UAAU,eAAe,gBAAgB;GAC3C,GACA,KAAK,eACL,YACF,CACF,CACF,CACF;GAIA,MAAM,EAAC,aAAa,aAAa,WAAW,cAAa;GACzD,MAAM,EAAC,aAAa,cAAc,WAAW,eAAc;GAC3D,OAAO,cAAc,WAAW,GAAG,sBAAsB;GACzD,OAAO,cAAc,SAAS,GAAG,sBAAsB;GACvD,OAAO,cAAc,YAAY,GAAG,sBAAsB;GAC1D,OAAO,cAAc,UAAU,GAAG,sBAAsB;GAExD,OAAO,KAAK,QACV,WAAW,YAAY,GACvB,MAAM,GAAG,IAAI,GACb,KAAA,SAEE,KAAK,UACH,KAAK,YACL;IACE,GAAG,KAAK;IACR,SAAS,cAAc,KAAK,KAAK,SAAS;KACxC,aAAa;MACX,aAAa;MACb,YAAY;KACd;KACA,QAAQ;KACR,UAAU;MACR,GAAG,SAAS,gBAAgB,YAAY;MAExC,SAAS,CACP,kBAAkB;OAChB,aAAa;QACX,aAAa;QACb,YAAY;OACd;OACA,UAAU,GAAG;OACb,QAAQ,KAAK;MACf,CAAC,CACH;KACF;KACA,QAAQ,KAAK;IACf,CAAC;GACH,GACA;IACE,GAAG,KAAK;IACR,eAAe;KACb,GAAG,KAAK,OAAO;MACd,eAAe,GAAG;IACrB;GACF,GACA,KAAK,eACL,KAAK,gBACP,CACJ;EACF;EAEA,MAAM,IAAI,MAAM,wBAAwB,cAAc;CACxD;CAMA,MACE,0BACA,WACA,OACsC;EACtC,IAAI;EAEJ,IAAI,OAAO,6BAA6B,YACtC,OAAO,yBAAyB,KAAK,kBAAkB,CAAC;OACnD;GACL,OAAO,UAAU,UAAU,GAAG,uCAAuC;GAGrE,MAAM,SAAS,UAAU,WAAW;GACpC,MAAM,KAAM,SAAS,MAAM;GAC3B,MAAM,MAAM,SAAS,YAAY;GAQjC,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;IAC3C,MAAM,MAAM,KAAK,cAAc,OAC7B,SAAS,0BAA0B,EAAE,GACpC,OAAO,MACR,KAAA,CACF;IACA,IAAI,QAAQ,KAAA,GACV,OAAO;GAEX;GAEA,OAAO,SACH,IAAI,0BAA0B,SAAS,IACvC,IAAI,0BAA0B,WAAW,KAAK;EACpD;EAWA,IAAI;EACJ,IAAI;EACJ,IAAI,QAAe;EACnB,IAAI,KAAK,SAAS,YAAY,KAAK,KAAK,SAAS,UAAU;GACzD,MAAM,SAAS,KAAK,KAAK,MAAM,KAAK,EAAE;GACtC,MAAM,QAAQ,KAAK;GACnB,SACE,MAAM,SAAS,aAAa,YAAY,MAAM,KAAK,IAC/C,MAAM,QACN,SAAS,KAAK;GACpB,QAAQ,KAAA;EACV,OAAO;GAGL,MAAM,QAAQ,QAAQ,IAAI;GAC1B,IAAI,UAAU,KAAA,GACZ,MAAM,QAAQ,IAAI;QACb;IACL,MAAM;IACN,SAAS;IACT,QAAQ,KAAA;GACV;EACF;EAEA,OAAO,KAAK,QAAQ,KAAK,QAAQ,aAAa;GAC5C,MAAM,gBAAgB,KAAK,KAAK;GAChC,MAAM,SAAS,gBAAgB,IAAI,eAAe,IAAI,IAAI;GAC1D,OAAO,KAAK,UACV,KAAK,YACL;IAAC,GAAG,KAAK;IAAM,OAAO,mBAAmB,kBAAkB,MAAM,CAAC;GAAC,GACnE,KAAK,QACL,KAAK,eACL,KAAK,gBACP;EACF,CAAC;CACH;CAEA,MACE,KACA,MACiC;EAGjC,OAAO,KAAK,QACV,MAAM,YAAY,oBAAoB,mBACtC,SAAS,GAAwB,GACjC,KAAA,SAEE,KAAK,UACH,KAAK,YACL;GACE,GAAG,KAAK;GACR,OAAO;IACL;IACA,WAAW,CAAC,MAAM;GACpB;EACF,GACA,KAAK,QACL,KAAK,eACL,KAAK,gBACP,CACJ;CACF;CAEA,MAAM,OAAgD;EACpD,IAAI,QAAQ,GACV,MAAM,IAAI,MAAM,4BAA4B;EAE9C,KAAK,QAAQ,OAAO,OAClB,MAAM,IAAI,MAAM,0BAA0B;EAE5C,IAAI,KAAK,kBACP,MAAM,IAAI,oBACR,gGACE,KAAK,gBACT;EAGF,OAAO,KAAK,QAAQ,SAAS,OAAO,KAAA,SAClC,KAAK,UACH,KAAK,YACL;GAAC,GAAG,KAAK;GAAM;EAAK,GACpB,KAAK,QACL,KAAK,eACL,KAAK,gBACP,CACF;CACF;CAEA,QACE,OACA,WACiC;EACjC,IAAI,KAAK,kBACP,MAAM,IAAI,oBACR,mGACE,KAAK,gBACT;EAEF,OAAO,KAAK,QACV,cAAc,QAAQ,gBAAgB,gBACtC,OACA,KAAA,SAEE,KAAK,UACH,KAAK,YACL;GACE,GAAG,KAAK;GACR,SAAS,CACP,GAAI,KAAK,KAAK,WAAW,CAAC,GAC1B,CAAC,OAAiB,SAAS,CAC7B;EACF,GACA,KAAK,QACL,KAAK,eACL,KAAK,gBACP,CACJ;CACF;CAEA,QACE,cACA,IACA,SACW;EACX,KAAK,QAAO,MAAK;EACjB,MAAM,OAAO,SAAS;EACtB,MAAM,SAAS,SAAS;EACxB,MAAM,UAAU,KAAK,QAAQ,cAAc,KAAK,WAAW,CAAC;EAC5D,OAAO,SAAS,sBAAsB;EAEtC,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,EAAC,YAAY,eAAe,aAAa,cAAa,QAAQ;GACpE,OAAO,cAAc,WAAW,GAAG,sBAAsB;GACzD,OAAO,cAAc,SAAS,GAAG,sBAAsB;GAEvD,MAAM,WAAW,YACf,GACE,KAAK,eAAe,cAAc,sBAChC,KAAK,UACH,eACA,SAAS,eAAe,GAAG,cAAc,cAAc,GACvD,eACA,KAAK,eACL,KAAA,CACF,CACF,CACF,CACF;GAGA,MAAM,SAAS,IAAI;GAInB,OAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,KAAK;KACb,aAAa;MACX,aAAa;MACb,YAAY;KACd;KACA,UAAU,SAAS;IACrB;IACA,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,KAAI,IAAI,CAAC;IACnC,GAAI,WAAW,KAAA,IAAY,EAAC,OAAM,IAAI,CAAC;GACzC;EACF;EAEA,IAAI,SAAS,OAAO,GAAG;GACrB,MAAM,CAAC,eAAe,kBAAkB;GACxC,OAAO,cAAc,cAAc,WAAW,GAAG,sBAAsB;GACvE,OAAO,cAAc,cAAc,SAAS,GAAG,sBAAsB;GACrE,OAAO,cAAc,eAAe,WAAW,GAAG,sBAAsB;GACxE,OAAO,cAAc,eAAe,SAAS,GAAG,sBAAsB;GACtE,MAAM,EAAC,eAAc;GACrB,MAAM,iBAAiB,cAAc;GACrC,MAAM,cAAc,GAClB,KAAK,eAAe,sBAAsB,sBACxC,KAAK,UACH,YACA,SAAS,YAAY,GAAG,YAAY,UAAU,cAAc,GAC5D,eACA,KAAK,eACL,YACF,CACF,CACF;GAEA,OAAO;IACL,MAAM;IACN,SAAS;KACP,QAAQ,KAAK;KACb,aAAa;MACX,aAAa,cAAc;MAC3B,YAAY,cAAc;KAC5B;KACA,UAAU;MACR,GAAG,SAAS,gBAAgB,GAAG,cAAc,cAAc;MAG3D,OAAO,mBAAmB;OACxB,MAAM;OACN,SAAS;QACP,QAAQ,KAAK;QACb,aAAa;SACX,aAAa,eAAe;SAC5B,YAAY,eAAe;QAC7B;QACA,UAAU,YAAY,WAAW,CAAC,CAAC;OACrC;OACA,IAAI;OACJ,GAAI,SAAS,KAAA,IAAY,EAAC,KAAI,IAAI,CAAC;OACnC,GAAI,WAAW,KAAA,IAAY,EAAC,OAAM,IAAI,CAAC;MACzC,CAAC;KACH;IACF;IACA,IAAI;IACJ,GAAI,SAAS,KAAA,IAAY,EAAC,KAAI,IAAI,CAAC;GACrC;EACF;EAEA,MAAM,IAAI,MAAM,wBAAwB,cAAc;CACxD;CAEA,IAAI,MAAqB;EACvB,OAAO,KAAK;CACd;CAEA,oBAAwD;EAItD,OAAQ,KAAK,uBAAuB,IAAI,kBACtC,KAAK,QAAQ,KAAK,IAAI,CAGxB;CACF;AACF;AAEA,SAAgB,YAId,GAAyE;CACzE,OAAO,aAAa,WAAW,6BAA6B;CAC5D,OAAO;AACT;;;;;;;;;;;;;;;AAgBA,IAAM,yBAAS,IAAI,QAAqB;AACxC,IAAI,YAAY;AAEhB,IAAM,iBAAiB,EAAE;AAEzB,SAAS,MAAM,KAAkB;CAC/B,OAAO,oBAAoB,QAAQ,KAAK,QAAQ;AAClD;;;;;;;;;AAUA,IAAM,4BAAY,IAAI,IAAiC;AAEvD,SAAS,SAAS,QAAgB,IAAoB;CACpD,MAAM,OAAO,oBAAoB,WAAW,QAAQ,MAAM;CAC1D,OAAO,oBAAoB,MAAM,KAAI,OAAM,SAAS,OAAO,GAAG,IAAI;AACpE;AAEA,IAAM,8BAAc,IAAI,IAAoB;AAE5C,IAAM,iBAAiB,iBAAyB,WAAW;AAE3D,SAAS,WAAW,cAA8B;CAChD,OAAO,oBAAoB,aAAa,cAAc,aAAa;AACrE;AAEA,SAAS,YAAY,GAAwD;CAC3E,OAAO,MAAM,QAAQ,OAAO,MAAM;AACpC;;;;;;;;;;;;;;;;AAiBA,SAAS,SAAS,GAA8B;CAC9C,QAAQ,OAAO,GAAf;EACE,KAAK,UACH,OAAO,KAAK,IAAI,CAAC;EACnB,KAAK,UACH,OAAO,KAAK,EAAE;EAChB,KAAK,WACH,OAAO,IAAI,OAAO;EACpB,SAAS;GACP,IAAI,MAAM,MACR,OAAO;GAET,IAAI,MAAM,QAAQ,CAAC,GAAG;IACpB,IAAI,MAAM,KAAK,EAAE,OAAO;IACxB,KAAK,MAAM,KAAK,GACd,OAAO,SAAS,CAAC;IAEnB,OAAO;GACT;GAEA,MAAM,IAAI;GACV,IAAI,OAAO;GACX,IAAI,IAAI;GACR,KAAK,MAAM,OAAO,GAAG;IACnB,MAAM,IAAI,EAAE;IACZ,IAAI,MAAM,KAAA,KAAa,OAAO,OAAO,GAAG,GAAG,GAAG;KAC5C,QAAQ,IAAI,GAAG,IAAI,SAAS,CAAC;KAC7B;IACF;GACF;GACA,OAAO,KAAK,EAAE,GAAG;EACnB;CACF;AACF;;;;;;;;;;AAWA,SAAS,SAAS,OAAyC;CACzD,IAAI,MAAM,SAAS,WACjB,OAAO,KAAK,SAAS,KAAqC;CAE5D,OAAO,SAAS,MAAM,KAAK;AAC7B;;;;;AAMA,SAAS,IAAI,GAAmB;CAC9B,OAAO,GAAG,EAAE,OAAO,GAAG;AACxB;;AAGA,SAAS,IAAI,GAAgC;CAC3C,OAAO,MAAM,KAAA,IAAY,MAAM,IAAI,MAAM;AAC3C;;;;;;;;;;;AAYA,SAAS,QAAQ,MAAqC;CACpD,QAAQ,KAAK,MAAb;EACE,KAAK;GACH,IAAI,KAAK,KAAK,SAAS,UACrB;GAEF,OAAO,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE,IAAI,SAAS,KAAK,KAAK;EAErE,KAAK,sBAAsB;GACzB,MAAM,KAAK,OAAO,IAAI,KAAK,QAAQ,QAAQ;GAC3C,OAAO,OAAO,KAAA,IACV,KAAA,IACA,IAAI,GAAG,GAAG,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,MAAM;EAC/D;EACA,KAAK;EACL,KAAK,MAAM;GACT,IAAI,MAAM,GAAG,KAAK,SAAS,QAAQ,MAAM,MAAM,KAAK,WAAW,OAAO;GACtE,KAAK,MAAM,KAAK,KAAK,YAAY;IAC/B,MAAM,IAAI,QAAQ,CAAC;IACnB,IAAI,MAAM,KAAA,GACR;IAEF,OAAO;GACT;GACA,OAAO;EACT;EACA,SACE;CACJ;AACF;;;;;;;AAQA,SAAS,QAAQ,MAAyB;CACxC,QAAQ,KAAK,MAAb;EACE,KAAK,sBACH,OAAO,WAAW,KAAK,QAAQ,SAAS,MAAM,GAAG,KAAK;EACxD,KAAK;EACL,KAAK,MACH,OAAO,SAAS,KAAK,KAAK,GAAG,KAAK,WAAW;EAC/C,SACE,OAAO;CACX;AACF;AAEA,SAAS,wBAA+B;CACtC,MAAM,IAAI,MAAM,uBAAuB;AACzC;AAEA,SAAS,cAAc,OAAgD;CACrE,OAAO,MAAM,QAAQ,KAAK,KAAK,MAAM,UAAU;AACjD;AAEA,SAAS,SAAY,GAAoC;CACvD,OAAO,EAAE,WAAW;AACtB;AAEA,SAAS,SAAY,GAAuC;CAC1D,OAAO,EAAE,WAAW;AACtB"}

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

@@ -102,6 +102,6 @@ function mustGetQuery(queries, name) {
 	return query;
 }
 //#endregion
-export { addContextToQuery, defineQueries, defineQueriesWithType, defineQuery, defineQueryWithType, getQuery, isQuery, isQueryDefinition, isQueryRegistry, mustGetQuery };
+export { addContextToQuery, createQuery, defineQueries, defineQueriesWithType, defineQuery, defineQueryWithType, getQuery, isQuery, isQueryDefinition, isQueryRegistry, mustGetQuery };
 
 //# sourceMappingURL=query-registry.js.map

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  IsUnknown,\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': QueryExecutionFunction<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\nexport type QueryExecutionFunction<\n  TTable extends string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TReturn,\n  TContext,\n> = (\n  options: QueryExecutionOptions<TInput, TContext>,\n) => Query<TTable, Schema, TReturn>;\n\ntype QueryExecutionOptions<\n  TInput extends ReadonlyJSONValue | undefined,\n  TContext,\n> = undefined extends TInput\n  ? IsUnknown<TContext> extends true\n    ? {args?: TInput | undefined; ctx?: TContext | undefined}\n    : {args?: TInput | undefined; ctx: TContext}\n  : IsUnknown<TContext> extends true\n    ? {args: TInput; ctx?: TContext | undefined}\n    : {args: TInput; ctx: TContext};\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: QueryExecutionFunction<\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 as TContext,\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":";;;;;;AAgFA,SAAgB,QACd,OAEqD;CACrD,OACE,OAAO,UAAU,cACjB,OAAQ,MAAgC,cAAc,YACtD,OAAQ,MAAyB,OAAO;AAE5C;;;;;;;;AAqEA,IAAa,qBAQX,OAQA,YAEA,WAAW,QAAQ,MAAM,MAAM,GAAG;CAAC,KAAK;CAAS,MAAM,MAAM;AAAI,CAAC,IAAI;AAMxE,SAAgB,gBAAgB,KAAuC;CACrE,OACE,OAAO,QAAQ,YACf,QAAQ,QACP,MAAqC,SAAS;AAEnD;AAgGA,SAAgB,kBAAkB,GAAqC;CACrE,OACE,OAAO,MAAM,YACb,MAAM,QACL,EAAwB,SAAS;AAEtC;AAqGA,SAAgB,YASd,oBAGA,SAC6D;CAE7D,IAAI;CACJ,IAAI;CAOJ,IAAI,eAAe,oBAAoB;EAErC,YAAY;EACZ,gBAAgB,KAAK,OAAO;CAC9B,OAAO;EAEL,YAAY,KAAA;EACZ,gBAAgB;CAClB;CAmBA,OAAO;EAVL,MAAM;EACN,aAAa;EACb,KAAK;CAQA;AACT;AAyCA,SAAgB,sBAAsB;CACpC,OAAO;AACT;AAkCA,SAAgB,YAQd,MACA,YACkE;CAClE,MAAM,EAAC,cAAa;CAEpB,MAAM,MAKF,YAAW;EACb,MAAM,gBAAgB,YAClB,cAAc,MAAM,QAAQ,MAAM,WAAW,OAAO,IACnD,QAAQ;EAEb,OAAO,iBACL,WAAW,GAAG;GACZ,MAAM;GACN,KAAK,QAAQ;EACf,CAAC,CACH,EAAE,YACA,MAGA,QAAQ,SAAS,KAAA,IAAY,CAAC,IAAI,CAAC,QAAQ,IAAI,CACjD;CACF;CAEA,MAAM,SACJ,UACuE;EACvE;EACA,KAAK;EAQL,SAAS;CAQX;CAEA,MAAM,YAAY;CAClB,MAAM,KAAK;CACX,MAAM,OAAO;CAQb,OAAO;AAQT;AA8DA,SAAgB,cACd,YACA,WACsB;CACtB,SAAS,mBACP,aACA,MACkC;EAClC,MAAM,SAA2C,GAC9C,MAAM,gBACT;EAEA,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,WAAW,GAAG;GACtD,KAAK,KAAK,GAAG;GACb,MAAM,cAAc,KAAK,KAAK,GAAG;GAEjC,IAAI,kBAAkB,KAAK,GACzB,OAAO,OAAO,YAAY,aAAa,KAAK;QAG5C,OAAO,OAAO,mBAAmB,OAAO,IAAI;GAE9C,KAAK,IAAI;EACX;EAEA,OAAO;CACT;CAEA,IAAI,cAAc,KAAA,GAAW;EAG3B,IAAI;EACJ,IAAI,CAAC,gBAAgB,UAAU,GAC7B,OAAO,mBAAmB,YAAY,CAAC,CAAC;OAExC,OAAO;EAGT,MAAM,YAAY,mBAAmB,WAAW,CAAC,CAAC;EAElD,MAAM,SAAS,UAAU,MAAM,WAAW,WAAW;EACrD,OAAO,OAAO;EACd,OAAO;CACT;CAEA,OAAO,mBAAmB,YAAkB,CAAC,CAAC;AAChD;AAEA,IAAM,eAAe,UACnB,CAAC,cAAc,KAAK,KAAK,QAAQ,KAAK;;;;AAexC,SAAgB,wBAEiB;CAC/B,OAAO;AACT;AA4BA,IAAM,cAAc;AAMpB,SAAgB,SACd,SACA,MACkC;CAElC,OADU,eAAe,SAAS,MAAM,WACjC;AACT;AAEA,SAAgB,aACd,SACA,MACsB;CACtB,MAAM,QAAQ,SAAS,SAAS,IAAI;CACpC,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,MAAM,oBAAoB,MAAM;CAE5C,OAAO;AACT"}
+{"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  IsUnknown,\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': QueryExecutionFunction<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\nexport type QueryExecutionFunction<\n  TTable extends string,\n  TInput extends ReadonlyJSONValue | undefined,\n  TReturn,\n  TContext,\n> = (\n  options: QueryExecutionOptions<TInput, TContext>,\n) => Query<TTable, Schema, TReturn>;\n\ntype QueryExecutionOptions<\n  TInput extends ReadonlyJSONValue | undefined,\n  TContext,\n> = undefined extends TInput\n  ? IsUnknown<TContext> extends true\n    ? {args?: TInput | undefined; ctx?: TContext | undefined}\n    : {args?: TInput | undefined; ctx: TContext}\n  : IsUnknown<TContext> extends true\n    ? {args: TInput; ctx?: TContext | undefined}\n    : {args: TInput; ctx: TContext};\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: QueryExecutionFunction<\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 as TContext,\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":";;;;;;AAgFA,SAAgB,QACd,OAEqD;CACrD,OACE,OAAO,UAAU,cACjB,OAAQ,MAAgC,cAAc,YACtD,OAAQ,MAAyB,OAAO;AAE5C;;;;;;;;AAqEA,IAAa,qBAQX,OAQA,YAEA,WAAW,QAAQ,MAAM,MAAM,GAAG;CAAC,KAAK;CAAS,MAAM,MAAM;AAAI,CAAC,IAAI;AAMxE,SAAgB,gBAAgB,KAAuC;CACrE,OACE,OAAO,QAAQ,YACf,QAAQ,QACP,MAAqC,SAAS;AAEnD;AAgGA,SAAgB,kBAAkB,GAAqC;CACrE,OACE,OAAO,MAAM,YACb,MAAM,QACL,EAAwB,SAAS;AAEtC;AAqGA,SAAgB,YASd,oBAGA,SAC6D;CAE7D,IAAI;CACJ,IAAI;CAOJ,IAAI,eAAe,oBAAoB;EAErC,YAAY;EACZ,gBAAgB,KAAK,OAAO;CAC9B,OAAO;EAEL,YAAY,KAAA;EACZ,gBAAgB;CAClB;CAmBA,OAAO;EAVL,MAAM;EACN,aAAa;EACb,KAAK;CAQA;AACT;AAyCA,SAAgB,sBAAsB;CACpC,OAAO;AACT;AAkCA,SAAgB,YAQd,MACA,YACkE;CAClE,MAAM,EAAC,cAAa;CAEpB,MAAM,MAKF,YAAW;EACb,MAAM,gBAAgB,YAClB,cAAc,MAAM,QAAQ,MAAM,WAAW,OAAO,IACnD,QAAQ;EAEb,OAAO,iBACL,WAAW,GAAG;GACZ,MAAM;GACN,KAAK,QAAQ;EACf,CAAC,CACH,CAAC,CAAC,YACA,MAGA,QAAQ,SAAS,KAAA,IAAY,CAAC,IAAI,CAAC,QAAQ,IAAI,CACjD;CACF;CAEA,MAAM,SACJ,UACuE;EACvE;EACA,KAAK;EAQL,SAAS;CAQX;CAEA,MAAM,YAAY;CAClB,MAAM,KAAK;CACX,MAAM,OAAO;CAQb,OAAO;AAQT;AA8DA,SAAgB,cACd,YACA,WACsB;CACtB,SAAS,mBACP,aACA,MACkC;EAClC,MAAM,SAA2C,GAC9C,MAAM,gBACT;EAEA,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,WAAW,GAAG;GACtD,KAAK,KAAK,GAAG;GACb,MAAM,cAAc,KAAK,KAAK,GAAG;GAEjC,IAAI,kBAAkB,KAAK,GACzB,OAAO,OAAO,YAAY,aAAa,KAAK;QAG5C,OAAO,OAAO,mBAAmB,OAAO,IAAI;GAE9C,KAAK,IAAI;EACX;EAEA,OAAO;CACT;CAEA,IAAI,cAAc,KAAA,GAAW;EAG3B,IAAI;EACJ,IAAI,CAAC,gBAAgB,UAAU,GAC7B,OAAO,mBAAmB,YAAY,CAAC,CAAC;OAExC,OAAO;EAGT,MAAM,YAAY,mBAAmB,WAAW,CAAC,CAAC;EAElD,MAAM,SAAS,UAAU,MAAM,WAAW,WAAW;EACrD,OAAO,OAAO;EACd,OAAO;CACT;CAEA,OAAO,mBAAmB,YAAkB,CAAC,CAAC;AAChD;AAEA,IAAM,eAAe,UACnB,CAAC,cAAc,KAAK,KAAK,QAAQ,KAAK;;;;AAexC,SAAgB,wBAEiB;CAC/B,OAAO;AACT;AA4BA,IAAM,cAAc;AAMpB,SAAgB,SACd,SACA,MACkC;CAElC,OADU,eAAe,SAAS,MAAM,WACjC;AACT;AAEA,SAAgB,aACd,SACA,MACsB;CACtB,MAAM,QAAQ,SAAS,SAAS,IAAI;CACpC,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,MAAM,oBAAoB,MAAM;CAE5C,OAAO;AACT"}

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

@@ -70,7 +70,7 @@ var Transitions = class {
 		};
 		const bucket = byValue.get(value);
 		if (bucket === void 0) byValue.set(value, entry);
-		else if (!(bucket instanceof Set)) byValue.set(value, new Set([bucket, entry]));
+		else if (!(bucket instanceof Set)) byValue.set(value, /* @__PURE__ */ new Set([bucket, entry]));
 		else {
 			if (bucket.size >= 64) return;
 			bucket.add(entry);