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

package/out/shared/src/random-values.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"random-values.js","names":[],"sources":["../../../../shared/src/random-values.ts"],"sourcesContent":["export function getNonCryptoRandomValues(array: Uint8Array) {\n  if (array === null) {\n    throw new TypeError('array cannot be null');\n  }\n\n  // Fill the array with random values\n  for (let i = 0; i < array.length; i++) {\n    array[i] = Math.floor(Math.random() * 256); // Random byte (0-255)\n  }\n\n  return array;\n}\n\nexport function randomCharacters(length: number) {\n  let result = '';\n  const characters =\n    'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';\n  const charactersLength = characters.length;\n  let counter = 0;\n  while (counter < length) {\n    result += characters.charAt(Math.floor(Math.random() * charactersLength));\n    counter += 1;\n  }\n  return result;\n}\n"],"mappings":";AAAA,SAAgB,yBAAyB,OAAmB;AAC1D,KAAI,UAAU,KACZ,OAAM,IAAI,UAAU,uBAAuB;AAI7C,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAChC,OAAM,KAAK,KAAK,MAAM,KAAK,QAAQ,GAAG,IAAI;AAG5C,QAAO"}

package/out/shared/src/record-proxy.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"record-proxy.js","names":["#toValue","#onMissing","#cache","#getOwnValue"],"sources":["../../../../shared/src/record-proxy.ts"],"sourcesContent":["const missing = Symbol();\n\n/**\n * A proxy handler that lazily transforms and caches record values.\n *\n * When a property is accessed, the handler transforms the source value using\n * the provided `toValue` function and caches the result. Subsequent accesses\n * return the cached value without re-transforming.\n *\n * @template Source - The type of values in the source record\n * @template Dest - The type of transformed values\n */\nclass RecordProxyHandler<Source, Dest> implements ProxyHandler<\n  Record<string, Source>\n> {\n  readonly #toValue: (source: Source, prop: string) => Dest;\n  readonly #onMissing: ((prop: string) => void) | undefined;\n  readonly #cache: Map<string, Dest | typeof missing> = new Map();\n\n  /**\n   * @param toValue - Function to transform source values to destination values\n   * @param onMissing - Optional function called when accessing a non-existent\n   *   property. Can throw an error if desired.\n   */\n  constructor(\n    toValue: (source: Source, prop: string) => Dest,\n    onMissing?: (prop: string) => void,\n  ) {\n    this.#toValue = toValue;\n    this.#onMissing = onMissing;\n  }\n\n  #getOwnValue(\n    target: Record<string, Source>,\n    prop: string,\n  ): Dest | typeof missing {\n    const v = this.#cache.get(prop);\n    if (v !== undefined) {\n      return v;\n    }\n\n    if (Object.hasOwn(target, prop)) {\n      const value = this.#toValue(target[prop], prop);\n      this.#cache.set(prop, value);\n      return value;\n    }\n    return missing;\n  }\n\n  get(target: Record<string, Source>, prop: string | symbol) {\n    if (typeof prop !== 'string') {\n      return undefined;\n    }\n    // Only transform own properties; return inherited properties as-is\n    const ownValue = this.#getOwnValue(target, prop);\n    if (ownValue !== missing) {\n      return ownValue;\n    }\n    this.#onMissing?.(prop);\n\n    // Inherited property - return without transformation\n    return target[prop];\n  }\n\n  getOwnPropertyDescriptor(\n    target: Record<string, Source>,\n    p: string | symbol,\n  ): PropertyDescriptor | undefined {\n    if (typeof p !== 'string') {\n      return undefined;\n    }\n\n    const value = this.#getOwnValue(target, p);\n    if (value === missing) {\n      return undefined;\n    }\n    const desc = Reflect.getOwnPropertyDescriptor(target, p);\n    return {...desc, value};\n  }\n}\n\n/**\n * Creates a proxy that lazily transforms and caches record values.\n *\n * @template Source - The type of values in the source record\n * @template Dest - The type of transformed values\n * @param target - The source record to proxy\n * @param toValue - Function to transform source values to destination values\n * @param onMissing - Optional function called when accessing a non-existent\n *   property. Can throw an error if desired.\n * @returns A proxy that presents transformed values\n */\nexport function recordProxy<Source, Dest>(\n  target: Record<string, Source>,\n  toValue: (source: Source, prop: string) => Dest,\n  onMissing?: (prop: string) => void,\n): Record<string, Dest> {\n  return new Proxy(\n    target,\n    new RecordProxyHandler(toValue, onMissing),\n  ) as unknown as Record<string, Dest>;\n}\n"],"mappings":";AAAA,IAAM,UAAU,QAAQ;;;;;;;;;;;AAYxB,IAAM,qBAAN,MAEE;CACA;CACA;CACA,yBAAsD,IAAI,KAAK;;;;;;CAO/D,YACE,SACA,WACA;AACA,QAAA,UAAgB;AAChB,QAAA,YAAkB;;CAGpB,aACE,QACA,MACuB;EACvB,MAAM,IAAI,MAAA,MAAY,IAAI,KAAK;AAC/B,MAAI,MAAM,KAAA,EACR,QAAO;AAGT,MAAI,OAAO,OAAO,QAAQ,KAAK,EAAE;GAC/B,MAAM,QAAQ,MAAA,QAAc,OAAO,OAAO,KAAK;AAC/C,SAAA,MAAY,IAAI,MAAM,MAAM;AAC5B,UAAO;;AAET,SAAO;;CAGT,IAAI,QAAgC,MAAuB;AACzD,MAAI,OAAO,SAAS,SAClB;EAGF,MAAM,WAAW,MAAA,YAAkB,QAAQ,KAAK;AAChD,MAAI,aAAa,QACf,QAAO;AAET,QAAA,YAAkB,KAAK;AAGvB,SAAO,OAAO;;CAGhB,yBACE,QACA,GACgC;AAChC,MAAI,OAAO,MAAM,SACf;EAGF,MAAM,QAAQ,MAAA,YAAkB,QAAQ,EAAE;AAC1C,MAAI,UAAU,QACZ;AAGF,SAAO;GAAC,GADK,QAAQ,yBAAyB,QAAQ,EAAE;GACvC;GAAM;;;;;;;;;;;;;;AAe3B,SAAgB,YACd,QACA,SACA,WACsB;AACtB,QAAO,IAAI,MACT,QACA,IAAI,mBAAmB,SAAS,UAAU,CAC3C"}

package/out/shared/src/resolved-promises.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"resolved-promises.js","names":[],"sources":["../../../../shared/src/resolved-promises.ts"],"sourcesContent":["export const promiseTrue = Promise.resolve(true as const);\nexport const promiseFalse = Promise.resolve(false as const);\nexport const promiseUndefined = Promise.resolve(undefined);\nexport const promiseVoid = Promise.resolve();\n\n/**\n * A promise that never resolves.\n */\nexport const promiseNever = new Promise<never>(() => {});\n"],"mappings":";AAAA,IAAa,cAAc,QAAQ,QAAQ,KAAc;AACzD,IAAa,eAAe,QAAQ,QAAQ,MAAe;AAC3B,QAAQ,QAAQ,KAAA,EAAU;AAC1D,IAAa,cAAc,QAAQ,SAAS;AAKhB,IAAI,cAAqB,GAAG"}

package/out/shared/src/sentinels.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sentinels.js","names":[],"sources":["../../../../shared/src/sentinels.ts"],"sourcesContent":["export function emptyFunction() {}\nexport const emptyObject = Object.freeze({});\nexport const emptyArray = Object.freeze([]);\nexport function identity<T>(x: T): T {\n  return x;\n}\n"],"mappings":";AAAA,SAAgB,gBAAgB;AAChC,IAAa,cAAc,OAAO,OAAO,EAAE,CAAC;AAC5C,IAAa,aAAa,OAAO,OAAO,EAAE,CAAC;AAC3C,SAAgB,SAAY,GAAS;AACnC,QAAO"}

package/out/shared/src/set-utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"set-utils.js","names":[],"sources":["../../../../shared/src/set-utils.ts"],"sourcesContent":["// TODO: Change lib to pick up this type definition\n\ninterface ReadonlySetLike<T> {\n  /**\n   * Despite its name, returns an iterator of the values in the set-like.\n   */\n  keys(): Iterator<T>;\n  /**\n   * @returns a boolean indicating whether an element with the specified value exists in the set-like or not.\n   */\n  has(value: T): boolean;\n  /**\n   * @returns the number of (unique) elements in the set-like.\n   */\n  readonly size: number;\n}\n\nexport function equals<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): boolean {\n  if (a.size !== b.size) {\n    return false;\n  }\n  const iterator = a.keys();\n  for (\n    let {done, value} = iterator.next();\n    !done;\n    {done, value} = iterator.next()\n  ) {\n    if (!b.has(value)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function union<T>(...sets: ReadonlySetLike<T>[]): Set<T> {\n  const result = new Set<T>();\n  for (const set of sets) {\n    const iterator = set.keys();\n    for (\n      let {done, value} = iterator.next();\n      !done;\n      {done, value} = iterator.next()\n    ) {\n      result.add(value);\n    }\n  }\n  return result;\n}\n\nexport function intersection<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): Set<T> {\n  const result = new Set<T>();\n  if (a.size > b.size) {\n    // Optimization: iterate over the smaller Set.\n    const swap = a;\n    a = b;\n    b = swap;\n  }\n  const iterator = a.keys();\n  for (\n    let {done, value} = iterator.next();\n    !done;\n    {done, value} = iterator.next()\n  ) {\n    if (b.has(value)) {\n      result.add(value);\n    }\n  }\n  return result;\n}\n\n/**\n * Returns the elements in {@linkcode a} that are not in {@linkcode b}.\n */\nexport function difference<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): Set<T> {\n  const result = new Set<T>();\n  const iterator = a.keys();\n  for (\n    let {done, value} = iterator.next();\n    !done;\n    {done, value} = iterator.next()\n  ) {\n    if (!b.has(value)) {\n      result.add(value);\n    }\n  }\n  return result;\n}\n\nexport function symmetricDifferences<T>(\n  a: ReadonlySetLike<T>,\n  b: ReadonlySetLike<T>,\n): [onlyA: Set<T>, onlyB: Set<T>] {\n  const onlyA = new Set<T>();\n  const iteratorA = a.keys();\n  for (\n    let {done, value} = iteratorA.next();\n    !done;\n    {done, value} = iteratorA.next()\n  ) {\n    onlyA.add(value);\n  }\n\n  const onlyB = new Set<T>();\n  const iteratorB = b.keys();\n  for (\n    let {done, value} = iteratorB.next();\n    !done;\n    {done, value} = iteratorB.next()\n  ) {\n    if (a.has(value)) {\n      onlyA.delete(value);\n      onlyB.delete(value);\n    } else {\n      onlyB.add(value);\n    }\n  }\n  return [onlyA, onlyB];\n}\n"],"mappings":";AAiBA,SAAgB,OACd,GACA,GACS;AACT,KAAI,EAAE,SAAS,EAAE,KACf,QAAO;CAET,MAAM,WAAW,EAAE,MAAM;AACzB,MACE,IAAI,EAAC,MAAM,UAAS,SAAS,MAAM,EACnC,CAAC,MACD,CAAC,MAAM,SAAS,SAAS,MAAM,CAE/B,KAAI,CAAC,EAAE,IAAI,MAAM,CACf,QAAO;AAGX,QAAO;;AAGT,SAAgB,MAAS,GAAG,MAAoC;CAC9D,MAAM,yBAAS,IAAI,KAAQ;AAC3B,MAAK,MAAM,OAAO,MAAM;EACtB,MAAM,WAAW,IAAI,MAAM;AAC3B,OACE,IAAI,EAAC,MAAM,UAAS,SAAS,MAAM,EACnC,CAAC,MACD,CAAC,MAAM,SAAS,SAAS,MAAM,CAE/B,QAAO,IAAI,MAAM;;AAGrB,QAAO;;AAGT,SAAgB,aACd,GACA,GACQ;CACR,MAAM,yBAAS,IAAI,KAAQ;AAC3B,KAAI,EAAE,OAAO,EAAE,MAAM;EAEnB,MAAM,OAAO;AACb,MAAI;AACJ,MAAI;;CAEN,MAAM,WAAW,EAAE,MAAM;AACzB,MACE,IAAI,EAAC,MAAM,UAAS,SAAS,MAAM,EACnC,CAAC,MACD,CAAC,MAAM,SAAS,SAAS,MAAM,CAE/B,KAAI,EAAE,IAAI,MAAM,CACd,QAAO,IAAI,MAAM;AAGrB,QAAO;;;;;AAMT,SAAgB,WACd,GACA,GACQ;CACR,MAAM,yBAAS,IAAI,KAAQ;CAC3B,MAAM,WAAW,EAAE,MAAM;AACzB,MACE,IAAI,EAAC,MAAM,UAAS,SAAS,MAAM,EACnC,CAAC,MACD,CAAC,MAAM,SAAS,SAAS,MAAM,CAE/B,KAAI,CAAC,EAAE,IAAI,MAAM,CACf,QAAO,IAAI,MAAM;AAGrB,QAAO;;AAGT,SAAgB,qBACd,GACA,GACgC;CAChC,MAAM,wBAAQ,IAAI,KAAQ;CAC1B,MAAM,YAAY,EAAE,MAAM;AAC1B,MACE,IAAI,EAAC,MAAM,UAAS,UAAU,MAAM,EACpC,CAAC,MACD,CAAC,MAAM,SAAS,UAAU,MAAM,CAEhC,OAAM,IAAI,MAAM;CAGlB,MAAM,wBAAQ,IAAI,KAAQ;CAC1B,MAAM,YAAY,EAAE,MAAM;AAC1B,MACE,IAAI,EAAC,MAAM,UAAS,UAAU,MAAM,EACpC,CAAC,MACD,CAAC,MAAM,SAAS,UAAU,MAAM,CAEhC,KAAI,EAAE,IAAI,MAAM,EAAE;AAChB,QAAM,OAAO,MAAM;AACnB,QAAM,OAAO,MAAM;OAEnB,OAAM,IAAI,MAAM;AAGpB,QAAO,CAAC,OAAO,MAAM"}

package/out/shared/src/size-of-value.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"size-of-value.js","names":[],"sources":["../../../../shared/src/size-of-value.ts"],"sourcesContent":["import {hasOwn} from './has-own.ts';\nimport type {ReadonlyJSONObject} from './json.ts';\n\nconst SIZE_TAG = 1;\nconst SIZE_INT32 = 4;\nconst SIZE_SMI = 5;\nconst SIZE_DOUBLE = 8;\n\n/**\n * Gives a size of a value. The size is modelled after the size used by\n * Chromium/V8's structuredClone algorithm. It does not match exactly so the\n * size is just an approximation.\n * https://source.chromium.org/chromium/chromium/src/+/main:v8/src/objects/value-serializer.cc;l=102;drc=f0b6f7d12ea47ad7c08fb554f678c1e73801ca36;bpv=1;bpt=1\n * For example we follow JSC/Mozilla for ints and skip the varint encoding.\n *\n * Mozilla does things similarly. Main difference is that there is no varint\n * encoding and every value uses multiples of 64bits\n * https://searchfox.org/mozilla-central/source/js/src/vm/StructuredClone.cpp#94\n *\n * And JSC:\n * https://github.com/WebKit/WebKit/blob/main/Source/WebCore/bindings/js/SerializedScriptValue.cpp#L356\n * - Use 1 byte tag\n * - Numbers are either stored as Int32 or Float64\n */\nexport function getSizeOfValue(value: unknown): number {\n  switch (typeof value) {\n    case 'string':\n      // Assumes all strings are one byte strings. V8 writes OneByteString and\n      // TwoByteString. We could check the string but it would require iterating\n      // over all the characters.\n      return SIZE_TAG + SIZE_INT32 + value.length;\n    case 'number':\n      if (isSmi(value)) {\n        if (value <= -(2 ** 30) || value >= 2 ** 30 - 1) {\n          return SIZE_TAG + SIZE_SMI;\n        }\n        return SIZE_TAG + SIZE_INT32;\n      }\n      return SIZE_TAG + SIZE_DOUBLE;\n    case 'boolean':\n      return SIZE_TAG;\n    case 'object':\n      if (value === null) {\n        return SIZE_TAG;\n      }\n\n      if (Array.isArray(value)) {\n        let sum = 2 * SIZE_TAG + SIZE_INT32;\n        for (const element of value) {\n          sum += getSizeOfValue(element);\n        }\n        return sum;\n      }\n\n      {\n        const val = value as ReadonlyJSONObject;\n        let sum: number = 2 * SIZE_TAG + SIZE_INT32;\n        for (const k in val) {\n          if (hasOwn(val, k)) {\n            // Skip undefined values. undefined values in an object gets\n            // stripped if we round trip through JSON.stringif which is what we\n            // use when syncing.\n            const propertyValue = val[k];\n            if (propertyValue !== undefined) {\n              sum += getSizeOfValue(k) + getSizeOfValue(propertyValue);\n            }\n          }\n        }\n        return sum;\n      }\n  }\n\n  throw new Error(`Invalid value. type: ${typeof value}, value: ${value}`);\n}\n\nfunction isSmi(value: number): boolean {\n  return value === (value | 0);\n}\n\nconst entryFixed = 2 * SIZE_TAG + SIZE_INT32 + SIZE_TAG + SIZE_INT32;\n\nexport function getSizeOfEntry<K, V>(key: K, value: V): number {\n  // Entries are stored as [key, value, sizeOfEntry]\n  return entryFixed + getSizeOfValue(key) + getSizeOfValue(value);\n}\n"],"mappings":";;AAGA,IAAM,WAAW;AACjB,IAAM,aAAa;AACnB,IAAM,WAAW;AACjB,IAAM,cAAc;;;;;;;;;;;;;;;;;AAkBpB,SAAgB,eAAe,OAAwB;AACrD,SAAQ,OAAO,OAAf;EACE,KAAK,SAIH,QAAO,WAAW,aAAa,MAAM;EACvC,KAAK;AACH,OAAI,MAAM,MAAM,EAAE;AAChB,QAAI,SAAS,EAAE,KAAK,OAAO,SAAS,KAAK,KAAK,EAC5C,QAAO,WAAW;AAEpB,WAAO,WAAW;;AAEpB,UAAO,WAAW;EACpB,KAAK,UACH,QAAO;EACT,KAAK;AACH,OAAI,UAAU,KACZ,QAAO;AAGT,OAAI,MAAM,QAAQ,MAAM,EAAE;IACxB,IAAI,MAAM,IAAI,WAAW;AACzB,SAAK,MAAM,WAAW,MACpB,QAAO,eAAe,QAAQ;AAEhC,WAAO;;GAGT;IACE,MAAM,MAAM;IACZ,IAAI,MAAc,IAAI,WAAW;AACjC,SAAK,MAAM,KAAK,IACd,KAAI,OAAO,KAAK,EAAE,EAAE;KAIlB,MAAM,gBAAgB,IAAI;AAC1B,SAAI,kBAAkB,KAAA,EACpB,QAAO,eAAe,EAAE,GAAG,eAAe,cAAc;;AAI9D,WAAO;;;AAIb,OAAM,IAAI,MAAM,wBAAwB,OAAO,MAAM,WAAW,QAAQ;;AAG1E,SAAS,MAAM,OAAwB;AACrC,QAAO,WAAW,QAAQ;;AAG5B,IAAM,aAAa,IAAI,WAAW,aAAa,WAAW;AAE1D,SAAgB,eAAqB,KAAQ,OAAkB;AAE7D,QAAO,aAAa,eAAe,IAAI,GAAG,eAAe,MAAM"}

package/out/shared/src/sleep.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sleep.js","names":[],"sources":["../../../../shared/src/sleep.ts"],"sourcesContent":["import {resolver} from '@rocicorp/resolver';\nimport {AbortError} from './abort-error.ts';\n\nconst promiseVoid = Promise.resolve();\nconst promiseNever = new Promise<void>(() => undefined);\n\n/**\n * Creates a promise that resolves after `ms` milliseconds. Note that if you\n * pass in `0` no `setTimeout` is used and the promise resolves immediately. In\n * other words no macro task is used in that case.\n *\n * Pass in an AbortSignal to clear the timeout.\n */\nexport function sleep(ms: number, signal?: AbortSignal): Promise<void> {\n  const newAbortError = () => new AbortError('Aborted');\n\n  if (signal?.aborted) {\n    return Promise.reject(newAbortError());\n  }\n\n  if (ms === 0) {\n    return promiseVoid;\n  }\n\n  return new Promise((resolve, reject) => {\n    let handleAbort: () => void;\n    if (signal) {\n      handleAbort = () => {\n        clearTimeout(id);\n        reject(newAbortError());\n      };\n      signal.addEventListener('abort', handleAbort, {once: true});\n    }\n\n    const id = setTimeout(() => {\n      resolve();\n      signal?.removeEventListener('abort', handleAbort);\n    }, ms);\n  });\n}\n\n/**\n * Returns a pair of promises. The first promise resolves after `ms` milliseconds\n * unless the AbortSignal is aborted. The second promise resolves when the AbortSignal\n * is aborted.\n */\nexport function sleepWithAbort(\n  ms: number,\n  signal: AbortSignal,\n): [ok: Promise<void>, aborted: Promise<void>] {\n  if (ms === 0) {\n    return [promiseVoid, promiseNever];\n  }\n\n  const {promise: abortedPromise, resolve: abortedResolve} = resolver<void>();\n\n  const sleepPromise = new Promise<void>(resolve => {\n    const handleAbort = () => {\n      clearTimeout(id);\n      abortedResolve();\n    };\n\n    const id = setTimeout(() => {\n      resolve();\n      signal.removeEventListener('abort', handleAbort);\n    }, ms);\n\n    signal.addEventListener('abort', handleAbort, {once: true});\n  });\n\n  return [sleepPromise, abortedPromise];\n}\n"],"mappings":";;;AAGA,IAAM,cAAc,QAAQ,SAAS;AACrC,IAAM,eAAe,IAAI,cAAoB,KAAA,EAAU;;;;;;;;AASvD,SAAgB,MAAM,IAAY,QAAqC;CACrE,MAAM,sBAAsB,IAAI,WAAW,UAAU;AAErD,KAAI,QAAQ,QACV,QAAO,QAAQ,OAAO,eAAe,CAAC;AAGxC,KAAI,OAAO,EACT,QAAO;AAGT,QAAO,IAAI,SAAS,SAAS,WAAW;EACtC,IAAI;AACJ,MAAI,QAAQ;AACV,uBAAoB;AAClB,iBAAa,GAAG;AAChB,WAAO,eAAe,CAAC;;AAEzB,UAAO,iBAAiB,SAAS,aAAa,EAAC,MAAM,MAAK,CAAC;;EAG7D,MAAM,KAAK,iBAAiB;AAC1B,YAAS;AACT,WAAQ,oBAAoB,SAAS,YAAY;KAChD,GAAG;GACN;;;;;;;AAQJ,SAAgB,eACd,IACA,QAC6C;AAC7C,KAAI,OAAO,EACT,QAAO,CAAC,aAAa,aAAa;CAGpC,MAAM,EAAC,SAAS,gBAAgB,SAAS,mBAAkB,UAAgB;AAgB3E,QAAO,CAdc,IAAI,SAAc,YAAW;EAChD,MAAM,oBAAoB;AACxB,gBAAa,GAAG;AAChB,mBAAgB;;EAGlB,MAAM,KAAK,iBAAiB;AAC1B,YAAS;AACT,UAAO,oBAAoB,SAAS,YAAY;KAC/C,GAAG;AAEN,SAAO,iBAAiB,SAAS,aAAa,EAAC,MAAM,MAAK,CAAC;GAC3D,EAEoB,eAAe"}

package/out/shared/src/sorted-entries.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-entries.js","names":[],"sources":["../../../../shared/src/sorted-entries.ts"],"sourcesContent":["import {stringCompare} from './string-compare.ts';\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nexport function sortedEntries<T extends Record<string, any>>(\n  object: T,\n): [keyof T & string, T[keyof T]][] {\n  return Object.entries(object).sort((a, b) => stringCompare(a[0], b[0]));\n}\n"],"mappings":";;AAGA,SAAgB,cACd,QACkC;AAClC,QAAO,OAAO,QAAQ,OAAO,CAAC,MAAM,GAAG,MAAM,cAAc,EAAE,IAAI,EAAE,GAAG,CAAC"}

package/out/shared/src/string-compare.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"string-compare.js","names":[],"sources":["../../../../shared/src/string-compare.ts"],"sourcesContent":["export function stringCompare(a: string, b: string): number {\n  if (a === b) {\n    return 0;\n  }\n  if (a < b) {\n    return -1;\n  }\n  return 1;\n}\n"],"mappings":";AAAA,SAAgB,cAAc,GAAW,GAAmB;AAC1D,KAAI,MAAM,EACR,QAAO;AAET,KAAI,IAAI,EACN,QAAO;AAET,QAAO"}

package/out/shared/src/subscribable.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"subscribable.js","names":[],"sources":["../../../../shared/src/subscribable.ts"],"sourcesContent":["export class Subscribable<\n  TArgs,\n  TListener extends (obj: TArgs) => unknown = (obj: TArgs) => unknown,\n> {\n  protected _listeners = new Set<TListener>();\n\n  /**\n   * Subscribe to the subscribable.\n   *\n   * @param listener - The listener to subscribe to.\n   * @returns A function to unsubscribe from the subscribable.\n   */\n  subscribe = (listener: TListener): (() => void) => {\n    this._listeners.add(listener);\n\n    return () => {\n      this._listeners.delete(listener);\n    };\n  };\n\n  /**\n   * Notify all listeners.\n   *\n   * @param update - The update to notify listeners with.\n   */\n  notify = (update: TArgs): void => {\n    this._listeners.forEach(listener => listener(update));\n  };\n\n  hasListeners = (): boolean => this._listeners.size > 0;\n\n  /**\n   * Unsubscribe all listeners.\n   */\n  cleanup = (): void => {\n    this._listeners.clear();\n  };\n}\n"],"mappings":";AAAA,IAAa,eAAb,MAGE;CACA,6BAAuB,IAAI,KAAgB;;;;;;;CAQ3C,aAAa,aAAsC;AACjD,OAAK,WAAW,IAAI,SAAS;AAE7B,eAAa;AACX,QAAK,WAAW,OAAO,SAAS;;;;;;;;CASpC,UAAU,WAAwB;AAChC,OAAK,WAAW,SAAQ,aAAY,SAAS,OAAO,CAAC;;CAGvD,qBAA8B,KAAK,WAAW,OAAO;;;;CAKrD,gBAAsB;AACpB,OAAK,WAAW,OAAO"}

package/out/shared/src/tdigest-schema.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tdigest-schema.js","names":[],"sources":["../../../../shared/src/tdigest-schema.ts"],"sourcesContent":["import * as v from './valita.ts';\n\n/**\n * Valita schema for TDigest JSON representation.\n * Matches the structure returned by TDigest.toJSON().\n */\n// oxlint-disable-next-line e18e/prefer-spread-syntax\nexport const tdigestSchema = v.tuple([v.number()]).concat(v.array(v.number()));\n\nexport type TDigestJSON = v.Infer<typeof tdigestSchema>;\n"],"mappings":";;;;;;AAOA,IAAa,gBAAgB,eAAE,MAAM,CAAC,eAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,eAAE,MAAM,eAAE,QAAQ,CAAC,CAAC"}

package/out/shared/src/tdigest.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tdigest.js","names":["#maxProcessed","#maxUnprocessed","#processed","#unprocessed","#cumulative","#processedWeight","#unprocessedWeight","#min","#max","#process","#integratedQ","#integratedLocation","#updateCumulative"],"sources":["../../../../shared/src/tdigest.ts"],"sourcesContent":["// Apache License 2.0\n// https://github.com/influxdata/tdigest\n\nimport {binarySearch} from './binary-search.ts';\nimport {Centroid, sortCentroidList, type CentroidList} from './centroid.ts';\nimport type {TDigestJSON} from './tdigest-schema.ts';\n\nexport interface ReadonlyTDigest {\n  readonly count: () => number;\n  readonly quantile: (q: number) => number;\n  readonly cdf: (x: number) => number;\n}\n\n// TDigest is a data structure for accurate on-line accumulation of\n// rank-based statistics such as quantiles and trimmed means.\nexport class TDigest {\n  readonly compression: number;\n\n  #maxProcessed: number;\n  #maxUnprocessed: number;\n  #processed!: CentroidList;\n  #unprocessed!: CentroidList;\n  #cumulative!: number[];\n  #processedWeight!: number;\n  #unprocessedWeight!: number;\n  #min!: number;\n  #max!: number;\n\n  constructor(compression: number = 1000) {\n    this.compression = compression;\n    this.#maxProcessed = processedSize(0, this.compression);\n    this.#maxUnprocessed = unprocessedSize(0, this.compression);\n    this.reset();\n  }\n\n  /**\n   * fromJSON creates a TDigest from a JSON-serializable representation.\n   * The data should be an object with compression and centroids array.\n   */\n  static fromJSON(data: Readonly<TDigestJSON>): TDigest {\n    const digest = new TDigest(data[0]);\n    if (data.length % 2 !== 1) {\n      throw new Error('Invalid centroids array');\n    }\n    for (let i = 1; i < data.length; i += 2) {\n      digest.add(data[i], data[i + 1]);\n    }\n    return digest;\n  }\n\n  reset(): void {\n    this.#processed = [];\n    this.#unprocessed = [];\n    this.#cumulative = [];\n    this.#processedWeight = 0;\n    this.#unprocessedWeight = 0;\n    this.#min = Number.MAX_VALUE;\n    this.#max = -Number.MAX_VALUE;\n  }\n\n  add(mean: number, weight: number = 1) {\n    this.addCentroid(new Centroid(mean, weight));\n  }\n\n  /** AddCentroidList can quickly add multiple centroids. */\n  addCentroidList(centroidList: CentroidList) {\n    for (const c of centroidList) {\n      this.addCentroid(c);\n    }\n  }\n\n  /**\n   * AddCentroid adds a single centroid.\n   * Weights which are not a number or are <= 0 are ignored, as are NaN means.\n   */\n  addCentroid(c: Centroid): void {\n    if (\n      Number.isNaN(c.mean) ||\n      c.weight <= 0 ||\n      Number.isNaN(c.weight) ||\n      !Number.isFinite(c.weight)\n    ) {\n      return;\n    }\n\n    this.#unprocessed.push(new Centroid(c.mean, c.weight));\n    this.#unprocessedWeight += c.weight;\n\n    if (\n      this.#processed.length > this.#maxProcessed ||\n      this.#unprocessed.length > this.#maxUnprocessed\n    ) {\n      this.#process();\n    }\n  }\n\n  /**\n   *  Merges the supplied digest into this digest. Functionally equivalent to\n   * calling t.AddCentroidList(t2.Centroids(nil)), but avoids making an extra\n   * copy of the CentroidList.\n   **/\n  merge(t2: TDigest) {\n    t2.#process();\n    this.addCentroidList(t2.#processed);\n  }\n\n  #process() {\n    if (\n      this.#unprocessed.length > 0 ||\n      this.#processed.length > this.#maxProcessed\n    ) {\n      // Append all processed centroids to the unprocessed list and sort\n      this.#unprocessed.push(...this.#processed);\n      sortCentroidList(this.#unprocessed);\n\n      // Reset processed list with first centroid\n      this.#processed.length = 0;\n      this.#processed.push(this.#unprocessed[0]);\n\n      this.#processedWeight += this.#unprocessedWeight;\n      this.#unprocessedWeight = 0;\n      let soFar = this.#unprocessed[0].weight;\n      let limit = this.#processedWeight * this.#integratedQ(1);\n      for (let i = 1; i < this.#unprocessed.length; i++) {\n        const centroid = this.#unprocessed[i];\n        const projected = soFar + centroid.weight;\n        if (projected <= limit) {\n          soFar = projected;\n          // oxlint-disable-next-line typescript/no-non-null-assertion\n          this.#processed.at(-1)!.add(centroid);\n        } else {\n          const k1 = this.#integratedLocation(soFar / this.#processedWeight);\n          limit = this.#processedWeight * this.#integratedQ(k1 + 1);\n          soFar += centroid.weight;\n          this.#processed.push(centroid);\n        }\n      }\n      this.#min = Math.min(this.#min, this.#processed[0].mean);\n      // oxlint-disable-next-line typescript/no-non-null-assertion\n      this.#max = Math.max(this.#max, this.#processed.at(-1)!.mean);\n      this.#unprocessed.length = 0;\n    }\n  }\n\n  /**\n   * Centroids returns a copy of processed centroids.\n   * Useful when aggregating multiple t-digests.\n   *\n   * Centroids are appended to the passed CentroidList; if you're re-using a\n   * buffer, be sure to pass cl[:0].\n   */\n  centroids(cl: CentroidList = []): CentroidList {\n    this.#process();\n    return [...cl, ...this.#processed];\n  }\n\n  count(): number {\n    this.#process();\n\n    // this.process always updates this.processedWeight to the total count of all\n    // centroids, so we don't need to re-count here.\n    return this.#processedWeight;\n  }\n\n  /**\n   * toJSON returns a JSON-serializable representation of the digest.\n   * This processes the digest and returns an object with compression and centroid data.\n   */\n  toJSON(): TDigestJSON {\n    this.#process();\n    const data: TDigestJSON = [this.compression];\n    for (const centroid of this.#processed) {\n      data.push(centroid.mean, centroid.weight);\n    }\n    return data;\n  }\n\n  #updateCumulative() {\n    // Weight can only increase, so the final cumulative value will always be\n    // either equal to, or less than, the total weight. If they are the same,\n    // then nothing has changed since the last update.\n    if (\n      this.#cumulative.length > 0 &&\n      this.#cumulative.at(-1) === this.#processedWeight\n    ) {\n      return;\n    }\n    const n = this.#processed.length + 1;\n    if (this.#cumulative.length > n) {\n      this.#cumulative.length = n;\n    }\n\n    let prev = 0;\n    for (let i = 0; i < this.#processed.length; i++) {\n      const centroid = this.#processed[i];\n      const cur = centroid.weight;\n      this.#cumulative[i] = prev + cur / 2;\n      prev += cur;\n    }\n    this.#cumulative[this.#processed.length] = prev;\n  }\n\n  // Quantile returns the (approximate) quantile of\n  // the distribution. Accepted values for q are between 0 and 1.\n  // Returns NaN if Count is zero or bad inputs.\n  quantile(q: number): number {\n    this.#process();\n    this.#updateCumulative();\n    if (q < 0 || q > 1 || this.#processed.length === 0) {\n      return NaN;\n    }\n    if (this.#processed.length === 1) {\n      return this.#processed[0].mean;\n    }\n    const index = q * this.#processedWeight;\n    if (index <= this.#processed[0].weight / 2) {\n      return (\n        this.#min +\n        ((2 * index) / this.#processed[0].weight) *\n          (this.#processed[0].mean - this.#min)\n      );\n    }\n\n    const lower = binarySearch(\n      this.#cumulative.length,\n      (i: number) => -this.#cumulative[i] + index,\n    );\n\n    if (lower + 1 !== this.#cumulative.length) {\n      const z1 = index - this.#cumulative[lower - 1];\n      const z2 = this.#cumulative[lower] - index;\n      return weightedAverage(\n        this.#processed[lower - 1].mean,\n        z2,\n        this.#processed[lower].mean,\n        z1,\n      );\n    }\n\n    const z1 =\n      index - this.#processedWeight - this.#processed[lower - 1].weight / 2;\n    const z2 = this.#processed[lower - 1].weight / 2 - z1;\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n    return weightedAverage(this.#processed.at(-1)!.mean, z1, this.#max, z2);\n  }\n\n  /**\n   * CDF returns the cumulative distribution function for a given value x.\n   */\n  cdf(x: number): number {\n    this.#process();\n    this.#updateCumulative();\n    switch (this.#processed.length) {\n      case 0:\n        return 0;\n      case 1: {\n        const width = this.#max - this.#min;\n        if (x <= this.#min) {\n          return 0;\n        }\n        if (x >= this.#max) {\n          return 1;\n        }\n        if (x - this.#min <= width) {\n          // min and max are too close together to do any viable interpolation\n          return 0.5;\n        }\n        return (x - this.#min) / width;\n      }\n    }\n\n    if (x <= this.#min) {\n      return 0;\n    }\n    if (x >= this.#max) {\n      return 1;\n    }\n    const m0 = this.#processed[0].mean;\n    // Left Tail\n    if (x <= m0) {\n      if (m0 - this.#min > 0) {\n        return (\n          (((x - this.#min) / (m0 - this.#min)) * this.#processed[0].weight) /\n          this.#processedWeight /\n          2\n        );\n      }\n      return 0;\n    }\n    // Right Tail\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n    const mn = this.#processed.at(-1)!.mean;\n    if (x >= mn) {\n      if (this.#max - mn > 0) {\n        return (\n          1 -\n          (((this.#max - x) / (this.#max - mn)) *\n            // oxlint-disable-next-line typescript/no-non-null-assertion\n            this.#processed.at(-1)!.weight) /\n            this.#processedWeight /\n            2\n        );\n      }\n      return 1;\n    }\n\n    const upper = binarySearch(\n      this.#processed.length,\n      // Treat equals as greater than, so we can use the upper index\n      // This is equivalent to:\n      //   i => this.#processed[i].mean > x ? -1 : 1,\n      i => x - this.#processed[i].mean || 1,\n    );\n\n    const z1 = x - this.#processed[upper - 1].mean;\n    const z2 = this.#processed[upper].mean - x;\n    return (\n      weightedAverage(\n        this.#cumulative[upper - 1],\n        z2,\n        this.#cumulative[upper],\n        z1,\n      ) / this.#processedWeight\n    );\n  }\n\n  #integratedQ(k: number): number {\n    return (\n      (Math.sin(\n        (Math.min(k, this.compression) * Math.PI) / this.compression -\n          Math.PI / 2,\n      ) +\n        1) /\n      2\n    );\n  }\n\n  #integratedLocation(q: number): number {\n    return (this.compression * (Math.asin(2 * q - 1) + Math.PI / 2)) / Math.PI;\n  }\n}\n\n// Calculate number of bytes needed for a tdigest of size c,\n// where c is the compression value\nexport function byteSizeForCompression(comp: number): number {\n  const c = comp | 0;\n  // // A centroid is 2 float64s, so we need 16 bytes for each centroid\n  // float_size := 8\n  // centroid_size := 2 * float_size\n\n  // // Unprocessed and processed can grow up to length c\n  // unprocessed_size := centroid_size * c\n  // processed_size := unprocessed_size\n\n  // // the cumulative field can also be of length c, but each item is a single float64\n  // cumulative_size := float_size * c // <- this could also be unprocessed_size / 2\n\n  // return unprocessed_size + processed_size + cumulative_size\n\n  // // or, more succinctly:\n  // return float_size * c * 5\n\n  // or even more succinctly\n  return c * 40;\n}\n\nfunction weightedAverage(\n  x1: number,\n  w1: number,\n  x2: number,\n  w2: number,\n): number {\n  if (x1 <= x2) {\n    return weightedAverageSorted(x1, w1, x2, w2);\n  }\n  return weightedAverageSorted(x2, w2, x1, w1);\n}\n\nfunction weightedAverageSorted(\n  x1: number,\n  w1: number,\n  x2: number,\n  w2: number,\n): number {\n  const x = (x1 * w1 + x2 * w2) / (w1 + w2);\n  return Math.max(x1, Math.min(x, x2));\n}\n\nfunction processedSize(size: number, compression: number): number {\n  if (size === 0) {\n    return Math.ceil(compression) * 2;\n  }\n  return size;\n}\n\nfunction unprocessedSize(size: number, compression: number): number {\n  if (size === 0) {\n    return Math.ceil(compression) * 8;\n  }\n  return size;\n}\n"],"mappings":";;;AAeA,IAAa,UAAb,MAAa,QAAQ;CACnB;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAEA,YAAY,cAAsB,KAAM;AACtC,OAAK,cAAc;AACnB,QAAA,eAAqB,cAAc,GAAG,KAAK,YAAY;AACvD,QAAA,iBAAuB,gBAAgB,GAAG,KAAK,YAAY;AAC3D,OAAK,OAAO;;;;;;CAOd,OAAO,SAAS,MAAsC;EACpD,MAAM,SAAS,IAAI,QAAQ,KAAK,GAAG;AACnC,MAAI,KAAK,SAAS,MAAM,EACtB,OAAM,IAAI,MAAM,0BAA0B;AAE5C,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,EACpC,QAAO,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG;AAElC,SAAO;;CAGT,QAAc;AACZ,QAAA,YAAkB,EAAE;AACpB,QAAA,cAAoB,EAAE;AACtB,QAAA,aAAmB,EAAE;AACrB,QAAA,kBAAwB;AACxB,QAAA,oBAA0B;AAC1B,QAAA,MAAY,OAAO;AACnB,QAAA,MAAY,CAAC,OAAO;;CAGtB,IAAI,MAAc,SAAiB,GAAG;AACpC,OAAK,YAAY,IAAI,SAAS,MAAM,OAAO,CAAC;;;CAI9C,gBAAgB,cAA4B;AAC1C,OAAK,MAAM,KAAK,aACd,MAAK,YAAY,EAAE;;;;;;CAQvB,YAAY,GAAmB;AAC7B,MACE,OAAO,MAAM,EAAE,KAAK,IACpB,EAAE,UAAU,KACZ,OAAO,MAAM,EAAE,OAAO,IACtB,CAAC,OAAO,SAAS,EAAE,OAAO,CAE1B;AAGF,QAAA,YAAkB,KAAK,IAAI,SAAS,EAAE,MAAM,EAAE,OAAO,CAAC;AACtD,QAAA,qBAA2B,EAAE;AAE7B,MACE,MAAA,UAAgB,SAAS,MAAA,gBACzB,MAAA,YAAkB,SAAS,MAAA,eAE3B,OAAA,SAAe;;;;;;;CASnB,MAAM,IAAa;AACjB,MAAA,SAAa;AACb,OAAK,gBAAgB,IAAA,UAAc;;CAGrC,WAAW;AACT,MACE,MAAA,YAAkB,SAAS,KAC3B,MAAA,UAAgB,SAAS,MAAA,cACzB;AAEA,SAAA,YAAkB,KAAK,GAAG,MAAA,UAAgB;AAC1C,oBAAiB,MAAA,YAAkB;AAGnC,SAAA,UAAgB,SAAS;AACzB,SAAA,UAAgB,KAAK,MAAA,YAAkB,GAAG;AAE1C,SAAA,mBAAyB,MAAA;AACzB,SAAA,oBAA0B;GAC1B,IAAI,QAAQ,MAAA,YAAkB,GAAG;GACjC,IAAI,QAAQ,MAAA,kBAAwB,MAAA,YAAkB,EAAE;AACxD,QAAK,IAAI,IAAI,GAAG,IAAI,MAAA,YAAkB,QAAQ,KAAK;IACjD,MAAM,WAAW,MAAA,YAAkB;IACnC,MAAM,YAAY,QAAQ,SAAS;AACnC,QAAI,aAAa,OAAO;AACtB,aAAQ;AAER,WAAA,UAAgB,GAAG,GAAG,CAAE,IAAI,SAAS;WAChC;KACL,MAAM,KAAK,MAAA,mBAAyB,QAAQ,MAAA,gBAAsB;AAClE,aAAQ,MAAA,kBAAwB,MAAA,YAAkB,KAAK,EAAE;AACzD,cAAS,SAAS;AAClB,WAAA,UAAgB,KAAK,SAAS;;;AAGlC,SAAA,MAAY,KAAK,IAAI,MAAA,KAAW,MAAA,UAAgB,GAAG,KAAK;AAExD,SAAA,MAAY,KAAK,IAAI,MAAA,KAAW,MAAA,UAAgB,GAAG,GAAG,CAAE,KAAK;AAC7D,SAAA,YAAkB,SAAS;;;;;;;;;;CAW/B,UAAU,KAAmB,EAAE,EAAgB;AAC7C,QAAA,SAAe;AACf,SAAO,CAAC,GAAG,IAAI,GAAG,MAAA,UAAgB;;CAGpC,QAAgB;AACd,QAAA,SAAe;AAIf,SAAO,MAAA;;;;;;CAOT,SAAsB;AACpB,QAAA,SAAe;EACf,MAAM,OAAoB,CAAC,KAAK,YAAY;AAC5C,OAAK,MAAM,YAAY,MAAA,UACrB,MAAK,KAAK,SAAS,MAAM,SAAS,OAAO;AAE3C,SAAO;;CAGT,oBAAoB;AAIlB,MACE,MAAA,WAAiB,SAAS,KAC1B,MAAA,WAAiB,GAAG,GAAG,KAAK,MAAA,gBAE5B;EAEF,MAAM,IAAI,MAAA,UAAgB,SAAS;AACnC,MAAI,MAAA,WAAiB,SAAS,EAC5B,OAAA,WAAiB,SAAS;EAG5B,IAAI,OAAO;AACX,OAAK,IAAI,IAAI,GAAG,IAAI,MAAA,UAAgB,QAAQ,KAAK;GAE/C,MAAM,MADW,MAAA,UAAgB,GACZ;AACrB,SAAA,WAAiB,KAAK,OAAO,MAAM;AACnC,WAAQ;;AAEV,QAAA,WAAiB,MAAA,UAAgB,UAAU;;CAM7C,SAAS,GAAmB;AAC1B,QAAA,SAAe;AACf,QAAA,kBAAwB;AACxB,MAAI,IAAI,KAAK,IAAI,KAAK,MAAA,UAAgB,WAAW,EAC/C,QAAO;AAET,MAAI,MAAA,UAAgB,WAAW,EAC7B,QAAO,MAAA,UAAgB,GAAG;EAE5B,MAAM,QAAQ,IAAI,MAAA;AAClB,MAAI,SAAS,MAAA,UAAgB,GAAG,SAAS,EACvC,QACE,MAAA,MACE,IAAI,QAAS,MAAA,UAAgB,GAAG,UAC/B,MAAA,UAAgB,GAAG,OAAO,MAAA;EAIjC,MAAM,QAAQ,aACZ,MAAA,WAAiB,SAChB,MAAc,CAAC,MAAA,WAAiB,KAAK,MACvC;AAED,MAAI,QAAQ,MAAM,MAAA,WAAiB,QAAQ;GACzC,MAAM,KAAK,QAAQ,MAAA,WAAiB,QAAQ;GAC5C,MAAM,KAAK,MAAA,WAAiB,SAAS;AACrC,UAAO,gBACL,MAAA,UAAgB,QAAQ,GAAG,MAC3B,IACA,MAAA,UAAgB,OAAO,MACvB,GACD;;EAGH,MAAM,KACJ,QAAQ,MAAA,kBAAwB,MAAA,UAAgB,QAAQ,GAAG,SAAS;EACtE,MAAM,KAAK,MAAA,UAAgB,QAAQ,GAAG,SAAS,IAAI;AAEnD,SAAO,gBAAgB,MAAA,UAAgB,GAAG,GAAG,CAAE,MAAM,IAAI,MAAA,KAAW,GAAG;;;;;CAMzE,IAAI,GAAmB;AACrB,QAAA,SAAe;AACf,QAAA,kBAAwB;AACxB,UAAQ,MAAA,UAAgB,QAAxB;GACE,KAAK,EACH,QAAO;GACT,KAAK,GAAG;IACN,MAAM,QAAQ,MAAA,MAAY,MAAA;AAC1B,QAAI,KAAK,MAAA,IACP,QAAO;AAET,QAAI,KAAK,MAAA,IACP,QAAO;AAET,QAAI,IAAI,MAAA,OAAa,MAEnB,QAAO;AAET,YAAQ,IAAI,MAAA,OAAa;;;AAI7B,MAAI,KAAK,MAAA,IACP,QAAO;AAET,MAAI,KAAK,MAAA,IACP,QAAO;EAET,MAAM,KAAK,MAAA,UAAgB,GAAG;AAE9B,MAAI,KAAK,IAAI;AACX,OAAI,KAAK,MAAA,MAAY,EACnB,SACK,IAAI,MAAA,QAAc,KAAK,MAAA,OAAc,MAAA,UAAgB,GAAG,SAC3D,MAAA,kBACA;AAGJ,UAAO;;EAIT,MAAM,KAAK,MAAA,UAAgB,GAAG,GAAG,CAAE;AACnC,MAAI,KAAK,IAAI;AACX,OAAI,MAAA,MAAY,KAAK,EACnB,QACE,KACG,MAAA,MAAY,MAAM,MAAA,MAAY,MAE/B,MAAA,UAAgB,GAAG,GAAG,CAAE,SACxB,MAAA,kBACA;AAGN,UAAO;;EAGT,MAAM,QAAQ,aACZ,MAAA,UAAgB,SAIhB,MAAK,IAAI,MAAA,UAAgB,GAAG,QAAQ,EACrC;EAED,MAAM,KAAK,IAAI,MAAA,UAAgB,QAAQ,GAAG;EAC1C,MAAM,KAAK,MAAA,UAAgB,OAAO,OAAO;AACzC,SACE,gBACE,MAAA,WAAiB,QAAQ,IACzB,IACA,MAAA,WAAiB,QACjB,GACD,GAAG,MAAA;;CAIR,aAAa,GAAmB;AAC9B,UACG,KAAK,IACH,KAAK,IAAI,GAAG,KAAK,YAAY,GAAG,KAAK,KAAM,KAAK,cAC/C,KAAK,KAAK,EACb,GACC,KACF;;CAIJ,oBAAoB,GAAmB;AACrC,SAAQ,KAAK,eAAe,KAAK,KAAK,IAAI,IAAI,EAAE,GAAG,KAAK,KAAK,KAAM,KAAK;;;AA4B5E,SAAS,gBACP,IACA,IACA,IACA,IACQ;AACR,KAAI,MAAM,GACR,QAAO,sBAAsB,IAAI,IAAI,IAAI,GAAG;AAE9C,QAAO,sBAAsB,IAAI,IAAI,IAAI,GAAG;;AAG9C,SAAS,sBACP,IACA,IACA,IACA,IACQ;CACR,MAAM,KAAK,KAAK,KAAK,KAAK,OAAO,KAAK;AACtC,QAAO,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,GAAG,CAAC;;AAGtC,SAAS,cAAc,MAAc,aAA6B;AAChE,KAAI,SAAS,EACX,QAAO,KAAK,KAAK,YAAY,GAAG;AAElC,QAAO;;AAGT,SAAS,gBAAgB,MAAc,aAA6B;AAClE,KAAI,SAAS,EACX,QAAO,KAAK,KAAK,YAAY,GAAG;AAElC,QAAO"}

package/out/shared/src/valita.js

@@ -1,172 +0,0 @@
-import { __exportAll, __reExport } from "../../_virtual/_rolldown/runtime.js";
-import * as v from "@badrap/valita";
-export * from "@badrap/valita";
-//#region ../shared/src/valita.ts
-var valita_exports = /* @__PURE__ */ __exportAll({
-	assert: () => assert,
-	deepPartial: () => deepPartial,
-	instanceOfAbstractType: () => instanceOfAbstractType,
-	is: () => is,
-	literalUnion: () => literalUnion,
-	parse: () => parse,
-	readonly: () => readonly,
-	readonlyArray: () => readonlyArray,
-	readonlyObject: () => readonlyObject,
-	readonlyRecord: () => readonlyRecord,
-	test: () => test,
-	testOptional: () => testOptional
-});
-import * as import__badrap_valita from "@badrap/valita";
-__reExport(valita_exports, import__badrap_valita);
-function toDisplay(value) {
-	switch (typeof value) {
-		case "string":
-		case "number":
-		case "boolean": return JSON.stringify(value);
-		case "undefined": return "undefined";
-		case "bigint": return value.toString() + "n";
-		default:
-			if (value === null) return "null";
-			if (Array.isArray(value)) return "array";
-			return typeof value;
-	}
-}
-function toDisplayAtPath(v, path) {
-	if (!path?.length) return toDisplay(v);
-	let cur = v;
-	for (const p of path) cur = cur[p];
-	return toDisplay(cur);
-}
-function displayList(word, expected, toDisplay = (x) => String(x)) {
-	if (expected.length === 1) return toDisplay(expected[0]);
-	const suffix = `${toDisplay(expected[expected.length - 2])} ${word} ${toDisplay(expected.at(-1))}`;
-	if (expected.length === 2) return suffix;
-	return `${expected.slice(0, -2).map(toDisplay).join(", ")}, ${suffix}`;
-}
-function getMessage(err, v, schema, mode) {
-	const firstIssue = err.issues[0];
-	const { path } = firstIssue;
-	const atPath = path?.length ? ` at ${path.join(".")}` : "";
-	switch (firstIssue.code) {
-		case "invalid_type": return `Expected ${displayList("or", firstIssue.expected)}${atPath}. Got ${toDisplayAtPath(v, path)}`;
-		case "missing_value": {
-			const atPath = path && path.length > 1 ? ` at ${path.slice(0, -1).join(".")}` : "";
-			if (firstIssue.path?.length) return `Missing property ${firstIssue.path.at(-1)}${atPath}`;
-			return `TODO Unknown missing property${atPath}`;
-		}
-		case "invalid_literal": return `Expected literal value ${displayList("or", firstIssue.expected, toDisplay)}${atPath} Got ${toDisplayAtPath(v, path)}`;
-		case "invalid_length": return `Expected array with length ${firstIssue.minLength === firstIssue.maxLength ? firstIssue.minLength : `between ${firstIssue.minLength} and ${firstIssue.maxLength}`}${atPath}. Got array with length ${v.length}`;
-		case "unrecognized_keys":
-			if (firstIssue.keys.length === 1) return `Unexpected property ${firstIssue.keys[0]}${atPath}`;
-			return `Unexpected properties ${displayList("and", firstIssue.keys)}${atPath}`;
-		case "invalid_union": return schema.name === "union" ? getDeepestUnionParseError(v, schema, mode ?? "strict") : `Invalid union value${atPath}`;
-		case "custom_error": {
-			const { error } = firstIssue;
-			return `${!error ? "unknown" : typeof error === "string" ? error : error.message ?? "unknown"}${atPath}. Got ${toDisplayAtPath(v, path)}`;
-		}
-	}
-}
-function getDeepestUnionParseError(value, schema, mode) {
-	const failures = [];
-	for (const type of schema.options) {
-		const r = type.try(value, { mode });
-		if (!r.ok) failures.push({
-			type,
-			err: r
-		});
-	}
-	if (failures.length) {
-		failures.sort(pathCmp);
-		if (failures.length === 1 || pathCmp(failures[0], failures[1]) < 0) return getMessage(failures[0].err, value, failures[0].type, mode);
-	}
-	try {
-		return `Invalid union value: ${JSON.stringify(value)}`;
-	} catch {
-		return `Invalid union value`;
-	}
-}
-function pathCmp(a, b) {
-	const aPath = a.err.issues[0].path;
-	const bPath = b.err.issues[0].path;
-	if (aPath.length !== bPath.length) return bPath.length - aPath.length;
-	for (let i = 0; i < aPath.length; i++) {
-		if (bPath[i] > aPath[i]) return -1;
-		if (bPath[i] < aPath[i]) return 1;
-	}
-	return 0;
-}
-function parse(value, schema, mode) {
-	const res = test(value, schema, mode);
-	if (!res.ok) throw new TypeError(res.error);
-	return res.value;
-}
-function is(value, schema, mode) {
-	return test(value, schema, mode).ok;
-}
-function assert(value, schema, mode) {
-	parse(value, schema, mode);
-}
-function test(value, schema, mode) {
-	const res = schema.try(value, mode ? { mode } : void 0);
-	if (!res.ok) return {
-		ok: false,
-		error: getMessage(res, value, schema, mode)
-	};
-	return res;
-}
-/**
-* Similar to {@link test} but works for AbstractTypes such as Optional.
-* This is for advanced usage. Prefer {@link test} unless you really need
-* to operate directly on an Optional field.
-*/
-function testOptional(value, schema, mode) {
-	let flags = 1;
-	if (mode === "passthrough") flags = 0;
-	else if (mode === "strip") flags = 2;
-	const res = schema.func(value, flags);
-	if (res === void 0) return {
-		ok: true,
-		value
-	};
-	else if (res.ok) return res;
-	return {
-		ok: false,
-		error: getMessage(new v.ValitaError(res), value, schema, mode)
-	};
-}
-/**
-* Shallowly marks the schema as readonly.
-*/
-function readonly(t) {
-	return t;
-}
-function readonlyObject(t) {
-	return v.object(t);
-}
-function readonlyArray(t) {
-	return v.array(t);
-}
-function readonlyRecord(t) {
-	return v.record(t);
-}
-var AbstractType = Object.getPrototypeOf(Object.getPrototypeOf(v.string().optional())).constructor;
-function instanceOfAbstractType(obj) {
-	return obj instanceof AbstractType;
-}
-/**
-* Similar to `ObjectType.partial()` except it recurses into nested objects.
-* Rest types are not supported.
-*/
-function deepPartial(s) {
-	const shape = {};
-	for (const [key, type] of Object.entries(s.shape)) if (type.name === "object") shape[key] = deepPartial(type).optional();
-	else shape[key] = type.optional();
-	return v.object(shape);
-}
-function literalUnion(...literals) {
-	return v.union(...literals.map(v.literal));
-}
-//#endregion
-export { assert, deepPartial, instanceOfAbstractType, literalUnion, parse, readonly, readonlyArray, readonlyObject, readonlyRecord, test, testOptional, valita_exports };
-
-//# sourceMappingURL=valita.js.map

package/out/shared/src/valita.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"valita.js","names":[],"sources":["../../../../shared/src/valita.ts"],"sourcesContent":["import * as v from '@badrap/valita';\n\nexport * from '@badrap/valita';\n\nfunction toDisplay(value: unknown): string {\n  switch (typeof value) {\n    case 'string':\n    case 'number':\n    case 'boolean':\n      return JSON.stringify(value);\n    case 'undefined':\n      return 'undefined';\n    case 'bigint':\n      return value.toString() + 'n';\n    default:\n      if (value === null) {\n        return 'null';\n      }\n      if (Array.isArray(value)) {\n        return 'array';\n      }\n      return typeof value;\n  }\n}\n\ntype Key = string | number;\n\nfunction toDisplayAtPath(v: unknown, path: Key[] | undefined): string {\n  if (!path?.length) {\n    return toDisplay(v);\n  }\n\n  let cur = v;\n  for (const p of path) {\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    cur = (cur as any)[p];\n  }\n  return toDisplay(cur);\n}\n\nfunction displayList<T>(\n  word: string,\n  expected: T[],\n  toDisplay: (x: T) => string | number = x => String(x),\n): string | number {\n  if (expected.length === 1) {\n    return toDisplay(expected[0]);\n  }\n\n  const suffix = `${toDisplay(\n    expected[expected.length - 2],\n    // oxlint-disable-next-line typescript/no-non-null-assertion\n  )} ${word} ${toDisplay(expected.at(-1)!)}`;\n  if (expected.length === 2) {\n    return suffix;\n  }\n  return `${expected.slice(0, -2).map(toDisplay).join(', ')}, ${suffix}`;\n}\n\nfunction getMessage(\n  err: v.Err | v.ValitaError,\n  v: unknown,\n  schema: v.Type | v.Optional,\n  mode: ParseOptionsMode | undefined,\n): string {\n  const firstIssue = err.issues[0];\n  const {path} = firstIssue;\n  const atPath = path?.length ? ` at ${path.join('.')}` : '';\n\n  switch (firstIssue.code) {\n    case 'invalid_type':\n      return `Expected ${displayList(\n        'or',\n        firstIssue.expected,\n      )}${atPath}. Got ${toDisplayAtPath(v, path)}`;\n    case 'missing_value': {\n      const atPath =\n        path && path.length > 1 ? ` at ${path.slice(0, -1).join('.')}` : '';\n\n      if (firstIssue.path?.length) {\n        return `Missing property ${firstIssue.path.at(-1)}${atPath}`;\n      }\n      return `TODO Unknown missing property${atPath}`;\n    }\n\n    case 'invalid_literal':\n      return `Expected literal value ${displayList(\n        'or',\n        firstIssue.expected,\n        toDisplay,\n      )}${atPath} Got ${toDisplayAtPath(v, path)}`;\n\n    case 'invalid_length': {\n      return `Expected array with length ${\n        firstIssue.minLength === firstIssue.maxLength\n          ? firstIssue.minLength\n          : `between ${firstIssue.minLength} and ${firstIssue.maxLength}`\n      }${atPath}. Got array with length ${(v as {length: number}).length}`;\n    }\n\n    case 'unrecognized_keys':\n      if (firstIssue.keys.length === 1) {\n        return `Unexpected property ${firstIssue.keys[0]}${atPath}`;\n      }\n      return `Unexpected properties ${displayList(\n        'and',\n        firstIssue.keys,\n      )}${atPath}`;\n\n    case 'invalid_union':\n      return schema.name === 'union'\n        ? getDeepestUnionParseError(v, schema as v.UnionType, mode ?? 'strict')\n        : `Invalid union value${atPath}`;\n\n    case 'custom_error': {\n      const {error} = firstIssue;\n      const message = !error\n        ? 'unknown'\n        : typeof error === 'string'\n          ? error\n          : (error.message ?? 'unknown');\n      return `${message}${atPath}. Got ${toDisplayAtPath(v, path)}`;\n    }\n  }\n}\n\ntype FailedType = {type: v.Type; err: v.Err};\n\nfunction getDeepestUnionParseError(\n  value: unknown,\n  schema: v.UnionType,\n  mode: ParseOptionsMode,\n): string {\n  const failures: FailedType[] = [];\n  for (const type of schema.options) {\n    const r = type.try(value, {mode});\n    if (!r.ok) {\n      failures.push({type, err: r});\n    }\n  }\n  if (failures.length) {\n    // compare the first and second longest-path errors\n    failures.sort(pathCmp);\n    if (failures.length === 1 || pathCmp(failures[0], failures[1]) < 0) {\n      return getMessage(failures[0].err, value, failures[0].type, mode);\n    }\n  }\n  // paths are equivalent\n  try {\n    const str = JSON.stringify(value);\n    return `Invalid union value: ${str}`;\n  } catch {\n    // fallback if the value could not be stringified\n    return `Invalid union value`;\n  }\n}\n\n// Descending-order comparison of Issue paths.\n// * [1, 'a'] sorts before [1]\n// * [1] sorts before [0]  (i.e. errors later in the tuple sort before earlier errors)\nfunction pathCmp(a: FailedType, b: FailedType) {\n  const aPath = a.err.issues[0].path;\n  const bPath = b.err.issues[0].path;\n  if (aPath.length !== bPath.length) {\n    return bPath.length - aPath.length;\n  }\n  for (let i = 0; i < aPath.length; i++) {\n    if (bPath[i] > aPath[i]) {\n      return -1;\n    }\n    if (bPath[i] < aPath[i]) {\n      return 1;\n    }\n  }\n  return 0;\n}\n\n/**\n * 'strip' allows unknown properties and removes unknown properties.\n * 'strict' errors if there are unknown properties.\n * 'passthrough' allows unknown properties.\n */\nexport type ParseOptionsMode = 'passthrough' | 'strict' | 'strip';\n\nexport function parse<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): T {\n  const res = test(value, schema, mode);\n  if (!res.ok) {\n    throw new TypeError(res.error);\n  }\n  return res.value;\n}\n\nexport function is<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): value is T {\n  return test(value, schema, mode).ok;\n}\n\nexport function assert<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): asserts value is T {\n  parse(value, schema, mode);\n}\n\ntype Result<T> = {ok: true; value: T} | {ok: false; error: string};\n\nexport function test<T>(\n  value: unknown,\n  schema: v.Type<T>,\n  mode?: ParseOptionsMode,\n): Result<T> {\n  const res = schema.try(value, mode ? {mode} : undefined);\n  if (!res.ok) {\n    return {\n      ok: false,\n      error: getMessage(res, value, schema, mode),\n    };\n  }\n  return res;\n}\n\n/**\n * Similar to {@link test} but works for AbstractTypes such as Optional.\n * This is for advanced usage. Prefer {@link test} unless you really need\n * to operate directly on an Optional field.\n */\nexport function testOptional<T>(\n  value: unknown,\n  schema: v.Type<T> | v.Optional<T>,\n  mode?: ParseOptionsMode,\n): Result<T | undefined> {\n  let flags = 0x1; // FLAG_FORBID_EXTRA_KEYS;\n  if (mode === 'passthrough') {\n    flags = 0;\n  } else if (mode === 'strip') {\n    flags = 0x2; // FLAG_STRIP_EXTRA_KEYS;\n  }\n  const res = schema.func(value, flags);\n  if (res === undefined) {\n    return {ok: true, value} as Result<T>;\n  } else if (res.ok) {\n    return res;\n  }\n  const err = new v.ValitaError(res);\n  return {ok: false, error: getMessage(err, value, schema, mode)};\n}\n\n/**\n * Shallowly marks the schema as readonly.\n */\nexport function readonly<T extends v.Type>(t: T): v.Type<Readonly<v.Infer<T>>> {\n  return t as v.Type<Readonly<v.Infer<T>>>;\n}\n\nexport function readonlyObject<T extends Record<string, v.Type | v.Optional>>(\n  t: T,\n): v.ObjectType<Readonly<T>, undefined> {\n  return v.object(t);\n}\n\nexport function readonlyArray<T extends v.Type>(\n  t: T,\n): v.Type<readonly v.Infer<T>[]> {\n  return v.array(t);\n}\n\nexport function readonlyRecord<T extends v.Type>(\n  t: T,\n): v.Type<Readonly<Record<string, v.Infer<T>>>> {\n  return v.record(t);\n}\n\nconst AbstractType = Object.getPrototypeOf(\n  Object.getPrototypeOf(v.string().optional()),\n).constructor;\n\nexport function instanceOfAbstractType<T = unknown>(\n  obj: unknown,\n): obj is v.Type<T> | v.Optional<T> {\n  return obj instanceof AbstractType;\n}\n\ntype ObjectShape = Record<string, typeof AbstractType>;\n\n/**\n * Similar to `ObjectType.partial()` except it recurses into nested objects.\n * Rest types are not supported.\n */\nexport function deepPartial<Shape extends ObjectShape>(\n  s: v.ObjectType<Shape, undefined>,\n) {\n  const shape = {} as Record<string, unknown>;\n  for (const [key, type] of Object.entries(s.shape)) {\n    if (type.name === 'object') {\n      shape[key] = deepPartial(type as v.ObjectType).optional();\n    } else {\n      shape[key] = type.optional();\n    }\n  }\n  return v.object(shape as {[K in keyof Shape]: v.Optional<v.Infer<Shape[K]>>});\n}\n\ntype Literal = string | number | bigint | boolean;\n\nexport function literalUnion<T extends [...Literal[]]>(\n  ...literals: T\n): v.Type<T[number]> {\n  return v.union(...literals.map(v.literal));\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAIA,SAAS,UAAU,OAAwB;AACzC,SAAQ,OAAO,OAAf;EACE,KAAK;EACL,KAAK;EACL,KAAK,UACH,QAAO,KAAK,UAAU,MAAM;EAC9B,KAAK,YACH,QAAO;EACT,KAAK,SACH,QAAO,MAAM,UAAU,GAAG;EAC5B;AACE,OAAI,UAAU,KACZ,QAAO;AAET,OAAI,MAAM,QAAQ,MAAM,CACtB,QAAO;AAET,UAAO,OAAO;;;AAMpB,SAAS,gBAAgB,GAAY,MAAiC;AACpE,KAAI,CAAC,MAAM,OACT,QAAO,UAAU,EAAE;CAGrB,IAAI,MAAM;AACV,MAAK,MAAM,KAAK,KAEd,OAAO,IAAY;AAErB,QAAO,UAAU,IAAI;;AAGvB,SAAS,YACP,MACA,UACA,aAAuC,MAAK,OAAO,EAAE,EACpC;AACjB,KAAI,SAAS,WAAW,EACtB,QAAO,UAAU,SAAS,GAAG;CAG/B,MAAM,SAAS,GAAG,UAChB,SAAS,SAAS,SAAS,GAE5B,CAAC,GAAG,KAAK,GAAG,UAAU,SAAS,GAAG,GAAG,CAAE;AACxC,KAAI,SAAS,WAAW,EACtB,QAAO;AAET,QAAO,GAAG,SAAS,MAAM,GAAG,GAAG,CAAC,IAAI,UAAU,CAAC,KAAK,KAAK,CAAC,IAAI;;AAGhE,SAAS,WACP,KACA,GACA,QACA,MACQ;CACR,MAAM,aAAa,IAAI,OAAO;CAC9B,MAAM,EAAC,SAAQ;CACf,MAAM,SAAS,MAAM,SAAS,OAAO,KAAK,KAAK,IAAI,KAAK;AAExD,SAAQ,WAAW,MAAnB;EACE,KAAK,eACH,QAAO,YAAY,YACjB,MACA,WAAW,SACZ,GAAG,OAAO,QAAQ,gBAAgB,GAAG,KAAK;EAC7C,KAAK,iBAAiB;GACpB,MAAM,SACJ,QAAQ,KAAK,SAAS,IAAI,OAAO,KAAK,MAAM,GAAG,GAAG,CAAC,KAAK,IAAI,KAAK;AAEnE,OAAI,WAAW,MAAM,OACnB,QAAO,oBAAoB,WAAW,KAAK,GAAG,GAAG,GAAG;AAEtD,UAAO,gCAAgC;;EAGzC,KAAK,kBACH,QAAO,0BAA0B,YAC/B,MACA,WAAW,UACX,UACD,GAAG,OAAO,OAAO,gBAAgB,GAAG,KAAK;EAE5C,KAAK,iBACH,QAAO,8BACL,WAAW,cAAc,WAAW,YAChC,WAAW,YACX,WAAW,WAAW,UAAU,OAAO,WAAW,cACrD,OAAO,0BAA2B,EAAuB;EAG9D,KAAK;AACH,OAAI,WAAW,KAAK,WAAW,EAC7B,QAAO,uBAAuB,WAAW,KAAK,KAAK;AAErD,UAAO,yBAAyB,YAC9B,OACA,WAAW,KACZ,GAAG;EAEN,KAAK,gBACH,QAAO,OAAO,SAAS,UACnB,0BAA0B,GAAG,QAAuB,QAAQ,SAAS,GACrE,sBAAsB;EAE5B,KAAK,gBAAgB;GACnB,MAAM,EAAC,UAAS;AAMhB,UAAO,GALS,CAAC,QACb,YACA,OAAO,UAAU,WACf,QACC,MAAM,WAAW,YACJ,OAAO,QAAQ,gBAAgB,GAAG,KAAK;;;;AAOjE,SAAS,0BACP,OACA,QACA,MACQ;CACR,MAAM,WAAyB,EAAE;AACjC,MAAK,MAAM,QAAQ,OAAO,SAAS;EACjC,MAAM,IAAI,KAAK,IAAI,OAAO,EAAC,MAAK,CAAC;AACjC,MAAI,CAAC,EAAE,GACL,UAAS,KAAK;GAAC;GAAM,KAAK;GAAE,CAAC;;AAGjC,KAAI,SAAS,QAAQ;AAEnB,WAAS,KAAK,QAAQ;AACtB,MAAI,SAAS,WAAW,KAAK,QAAQ,SAAS,IAAI,SAAS,GAAG,GAAG,EAC/D,QAAO,WAAW,SAAS,GAAG,KAAK,OAAO,SAAS,GAAG,MAAM,KAAK;;AAIrE,KAAI;AAEF,SAAO,wBADK,KAAK,UAAU,MAAM;SAE3B;AAEN,SAAO;;;AAOX,SAAS,QAAQ,GAAe,GAAe;CAC7C,MAAM,QAAQ,EAAE,IAAI,OAAO,GAAG;CAC9B,MAAM,QAAQ,EAAE,IAAI,OAAO,GAAG;AAC9B,KAAI,MAAM,WAAW,MAAM,OACzB,QAAO,MAAM,SAAS,MAAM;AAE9B,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,MAAI,MAAM,KAAK,MAAM,GACnB,QAAO;AAET,MAAI,MAAM,KAAK,MAAM,GACnB,QAAO;;AAGX,QAAO;;AAUT,SAAgB,MACd,OACA,QACA,MACG;CACH,MAAM,MAAM,KAAK,OAAO,QAAQ,KAAK;AACrC,KAAI,CAAC,IAAI,GACP,OAAM,IAAI,UAAU,IAAI,MAAM;AAEhC,QAAO,IAAI;;AAGb,SAAgB,GACd,OACA,QACA,MACY;AACZ,QAAO,KAAK,OAAO,QAAQ,KAAK,CAAC;;AAGnC,SAAgB,OACd,OACA,QACA,MACoB;AACpB,OAAM,OAAO,QAAQ,KAAK;;AAK5B,SAAgB,KACd,OACA,QACA,MACW;CACX,MAAM,MAAM,OAAO,IAAI,OAAO,OAAO,EAAC,MAAK,GAAG,KAAA,EAAU;AACxD,KAAI,CAAC,IAAI,GACP,QAAO;EACL,IAAI;EACJ,OAAO,WAAW,KAAK,OAAO,QAAQ,KAAK;EAC5C;AAEH,QAAO;;;;;;;AAQT,SAAgB,aACd,OACA,QACA,MACuB;CACvB,IAAI,QAAQ;AACZ,KAAI,SAAS,cACX,SAAQ;UACC,SAAS,QAClB,SAAQ;CAEV,MAAM,MAAM,OAAO,KAAK,OAAO,MAAM;AACrC,KAAI,QAAQ,KAAA,EACV,QAAO;EAAC,IAAI;EAAM;EAAM;UACf,IAAI,GACb,QAAO;AAGT,QAAO;EAAC,IAAI;EAAO,OAAO,WADd,IAAI,EAAE,YAAY,IAAI,EACQ,OAAO,QAAQ,KAAK;EAAC;;;;;AAMjE,SAAgB,SAA2B,GAAoC;AAC7E,QAAO;;AAGT,SAAgB,eACd,GACsC;AACtC,QAAO,EAAE,OAAO,EAAE;;AAGpB,SAAgB,cACd,GAC+B;AAC/B,QAAO,EAAE,MAAM,EAAE;;AAGnB,SAAgB,eACd,GAC8C;AAC9C,QAAO,EAAE,OAAO,EAAE;;AAGpB,IAAM,eAAe,OAAO,eAC1B,OAAO,eAAe,EAAE,QAAQ,CAAC,UAAU,CAAC,CAC7C,CAAC;AAEF,SAAgB,uBACd,KACkC;AAClC,QAAO,eAAe;;;;;;AASxB,SAAgB,YACd,GACA;CACA,MAAM,QAAQ,EAAE;AAChB,MAAK,MAAM,CAAC,KAAK,SAAS,OAAO,QAAQ,EAAE,MAAM,CAC/C,KAAI,KAAK,SAAS,SAChB,OAAM,OAAO,YAAY,KAAqB,CAAC,UAAU;KAEzD,OAAM,OAAO,KAAK,UAAU;AAGhC,QAAO,EAAE,OAAO,MAA6D;;AAK/E,SAAgB,aACd,GAAG,UACgB;AACnB,QAAO,EAAE,MAAM,GAAG,SAAS,IAAI,EAAE,QAAQ,CAAC"}

package/out/z2s/src/compiler.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"compiler.js","names":[],"sources":["../../../../z2s/src/compiler.ts"],"sourcesContent":["import type {SQLQuery} from '@databases/sql';\nimport {last, zip} from '../../shared/src/arrays.ts';\nimport {assert, unreachable} from '../../shared/src/asserts.ts';\nimport {\n  parse as parseBigIntJson,\n  type JSONValue as BigIntJSONValue,\n} from '../../shared/src/bigint-json.ts';\nimport {hasOwn} from '../../shared/src/has-own.ts';\nimport {type JSONValue} from '../../shared/src/json.ts';\nimport {must} from '../../shared/src/must.ts';\nimport type {\n  AST,\n  Condition,\n  CorrelatedSubquery,\n  CorrelatedSubqueryCondition,\n  Correlation,\n  LiteralReference,\n  Ordering,\n  SimpleCondition,\n  ValuePosition,\n} from '../../zero-protocol/src/ast.ts';\nimport {\n  clientToServer,\n  type NameMapper,\n} from '../../zero-schema/src/name-mapper.ts';\nimport type {Schema} from '../../zero-types/src/schema.ts';\nimport type {ServerSchema} from '../../zero-types/src/server-schema.ts';\nimport type {Format} from '../../zql/src/ivm/view.ts';\nimport {completeOrdering} from '../../zql/src/query/complete-ordering.ts';\nimport {\n  sql,\n  sqlConvertColumnArg,\n  sqlConvertPluralLiteralArg,\n  sqlConvertSingularLiteralArg,\n  type PluralLiteralType,\n} from './sql.ts';\n\ntype Table = {\n  zql: string;\n  alias: string;\n};\n\ntype QualifiedColumn = {\n  table: Table;\n  zql: string;\n};\n\ntype ServerSpec = {\n  schema: ServerSchema;\n  // maps zql names to server names\n  mapper: NameMapper;\n};\n\nexport type Spec = {\n  server: ServerSpec;\n  zql: Schema['tables'];\n  aliasCount: number;\n};\n\nconst ZQL_RESULT_KEY = 'zql_result';\nconst ZQL_RESULT_KEY_IDENT = sql.ident(ZQL_RESULT_KEY);\n\nconst ZQL_RESULT_TABLE_KEY = 'zql_root';\nconst ZQL_RESULT_TABLE_IDENT = sql.ident(ZQL_RESULT_TABLE_KEY);\n\nexport function compile(\n  serverSchema: ServerSchema,\n  zqlSchema: Schema,\n  ast: AST,\n  format?: Format,\n): SQLQuery {\n  ast = completeOrdering(\n    ast,\n    tableName => zqlSchema.tables[tableName].primaryKey,\n  );\n  const spec: Spec = {\n    aliasCount: 0,\n    server: {\n      schema: serverSchema,\n      mapper: clientToServer(zqlSchema.tables),\n    },\n    zql: zqlSchema.tables,\n  };\n  return sql`SELECT \n    ${toJSON(ZQL_RESULT_TABLE_KEY, format?.singular)}::text AS ${ZQL_RESULT_KEY_IDENT}\n    FROM (${select(spec, ast, format)}) ${ZQL_RESULT_TABLE_IDENT}`;\n}\n\nfunction select(\n  spec: Spec,\n  ast: AST,\n  format: Format | undefined,\n  correlate?: (childTable: Table) => SQLQuery,\n): SQLQuery {\n  const table = makeTable(spec, ast.table);\n  const selectionSet = related(spec, ast.related ?? [], format, table);\n  const tableSchema = spec.zql[ast.table];\n  const usedAliases = new Set<string>(\n    ast.related?.map(r => r.subquery.alias ?? ''),\n  );\n  for (const column of Object.keys(tableSchema.columns)) {\n    if (!usedAliases.has(column)) {\n      selectionSet.push(\n        selectIdent(spec.server, {\n          table,\n          zql: column,\n        }),\n      );\n    }\n  }\n\n  let appliedWhere = false;\n  function maybeWhere(test: unknown | undefined) {\n    if (!test) {\n      return sql``;\n    }\n\n    const ret = appliedWhere ? sql`AND` : sql`WHERE`;\n    appliedWhere = true;\n    return ret;\n  }\n\n  return sql`SELECT ${sql.join(selectionSet, ',')}\n    FROM ${fromIdent(spec.server, table)}\n    ${maybeWhere(ast.where)} ${where(spec, ast.where, table)}\n    ${maybeWhere(correlate)} ${correlate ? correlate(table) : sql``}\n    ${orderBy(spec, ast.orderBy, table)}\n    ${limit(ast.limit, format?.singular)}`;\n}\n\nexport function limit(\n  limit: number | undefined,\n  singular: boolean | undefined,\n): SQLQuery {\n  if (limit === 0) {\n    return sql`LIMIT 0`;\n  }\n  if (singular) {\n    return sql`LIMIT 1`;\n  }\n  if (limit === undefined) {\n    return sql``;\n  }\n  return sql`LIMIT ${sqlConvertSingularLiteralArg(limit)}`;\n}\n\nfunction makeTable(spec: Spec, zql: string, alias?: string): Table {\n  alias = alias ?? zql + '_' + spec.aliasCount++;\n  return {\n    zql,\n    alias,\n  };\n}\n\nexport function orderBy(\n  spec: Spec,\n  orderBy: Ordering | undefined,\n  table: Table,\n): SQLQuery {\n  if (!orderBy) {\n    return sql``;\n  }\n  return sql`ORDER BY ${sql.join(\n    orderBy.map(([col, dir]) =>\n      dir === 'asc'\n        ? // Oh postgres. The table must be referred to by client name but the column by server name.\n          // E.g., `SELECT server_col as client_col FROM server_table as client_table ORDER BY client_Table.server_col`\n          sql`${colIdent(spec.server, {\n            table,\n            zql: col,\n          })} ASC NULLS FIRST`\n        : sql`${colIdent(spec.server, {\n            table,\n            zql: col,\n          })} DESC NULLS LAST`,\n    ),\n    ', ',\n  )}`;\n}\n\nfunction related(\n  spec: Spec,\n  relationships: readonly CorrelatedSubquery[],\n  format: Format | undefined,\n  parentTable: Table,\n): SQLQuery[] {\n  return relationships.map(relationship =>\n    relationshipSubquery(\n      spec,\n      relationship,\n      format?.relationships[must(relationship.subquery.alias)],\n      parentTable,\n    ),\n  );\n}\n\nfunction relationshipSubquery(\n  spec: Spec,\n  relationship: CorrelatedSubquery,\n  format: Format | undefined,\n  parentTable: Table,\n): SQLQuery {\n  const innerAlias = `inner_${relationship.subquery.alias}`;\n  if (relationship.hidden) {\n    const {join, participatingTables} = makeJunctionJoin(spec, relationship);\n    const lastTable = must(last(participatingTables)).table;\n\n    assert(\n      relationship.subquery.related,\n      'hidden relationship must be a junction',\n    );\n    const nestedAst = relationship.subquery.related[0].subquery;\n    const selectionSet = related(\n      spec,\n      nestedAst.related ?? [],\n      format,\n      lastTable,\n    );\n    const tableSchema = spec.zql[nestedAst.table];\n    for (const column of Object.keys(tableSchema.columns)) {\n      selectionSet.push(\n        selectIdent(spec.server, {\n          table: lastTable,\n          zql: column,\n        }),\n      );\n    }\n\n    return sql`(\n        SELECT ${toJSON(innerAlias, format?.singular)} FROM (SELECT ${sql.join(\n          selectionSet,\n          ',',\n        )} FROM ${join} WHERE (${makeCorrelator(\n          spec,\n          relationship.correlation.parentField.map(f => ({\n            table: parentTable,\n            zql: f,\n          })),\n          relationship.correlation.childField,\n        )(participatingTables[0].table)}) ${\n          nestedAst.where\n            ? sql`AND ${where(spec, nestedAst.where, lastTable)}`\n            : sql``\n        } ${orderBy(spec, nestedAst.orderBy, lastTable)} ${limit(\n          last(participatingTables)?.limit,\n          format?.singular,\n        )} ) ${sql.ident(innerAlias)}\n      ) as ${sql.ident(relationship.subquery.alias)}`;\n  }\n\n  return sql`(\n      SELECT ${toJSON(innerAlias, format?.singular)} FROM (${select(\n        spec,\n        relationship.subquery,\n        format,\n        makeCorrelator(\n          spec,\n          relationship.correlation.parentField.map(f => ({\n            table: parentTable,\n            zql: f,\n          })),\n          relationship.correlation.childField,\n        ),\n      )}) ${sql.ident(innerAlias)}\n    ) as ${sql.ident(relationship.subquery.alias)}`;\n}\n\nfunction where(\n  spec: Spec,\n  condition: Condition | undefined,\n  table: Table,\n): SQLQuery {\n  if (!condition) {\n    return sql``;\n  }\n\n  switch (condition.type) {\n    case 'and':\n      return sql`(${sql.join(\n        condition.conditions.map(c => where(spec, c, table)),\n        ' AND ',\n      )})`;\n    case 'or':\n      return sql`(${sql.join(\n        condition.conditions.map(c => where(spec, c, table)),\n        ' OR ',\n      )})`;\n    case 'correlatedSubquery':\n      if (condition.scalar) {\n        return scalarSubquery(spec, condition, table);\n      }\n      return exists(spec, condition, table);\n    case 'simple':\n      return simple(spec, condition, table);\n  }\n}\n\nfunction exists(\n  spec: Spec,\n  condition: CorrelatedSubqueryCondition,\n  parentTable: Table,\n): SQLQuery {\n  switch (condition.op) {\n    case 'EXISTS':\n      return sql`EXISTS (${select(\n        spec,\n        condition.related.subquery,\n        undefined,\n        makeCorrelator(\n          spec,\n          condition.related.correlation.parentField.map(f => ({\n            table: parentTable,\n            zql: f,\n          })),\n          condition.related.correlation.childField,\n        ),\n      )})`;\n    case 'NOT EXISTS':\n      return sql`NOT EXISTS (${select(\n        spec,\n        condition.related.subquery,\n        undefined,\n        makeCorrelator(\n          spec,\n          condition.related.correlation.parentField.map(f => ({\n            table: parentTable,\n            zql: f,\n          })),\n          condition.related.correlation.childField,\n        ),\n      )})`;\n  }\n}\n\nfunction scalarSubquery(\n  spec: Spec,\n  condition: CorrelatedSubqueryCondition,\n  parentTable: Table,\n): SQLQuery {\n  const parentField = condition.related.correlation.parentField[0];\n  const childField = condition.related.correlation.childField[0];\n  const subqueryAST = condition.related.subquery;\n\n  const parentCol = colIdent(spec.server, {\n    table: parentTable,\n    zql: parentField,\n  });\n\n  const subqueryTable = makeTable(spec, subqueryAST.table);\n  const childCol = colIdent(spec.server, {\n    table: subqueryTable,\n    zql: childField,\n  });\n\n  const op = sql.__dangerous__rawValue(\n    condition.op === 'EXISTS' ? '=' : 'IS NOT',\n  );\n\n  const subqueryWhere = subqueryAST.where\n    ? sql`WHERE ${where(spec, subqueryAST.where, subqueryTable)}`\n    : sql``;\n  const subqueryOrderBy = orderBy(spec, subqueryAST.orderBy, subqueryTable);\n\n  return sql`${parentCol} ${op} (SELECT ${childCol} FROM ${fromIdent(spec.server, subqueryTable)} ${subqueryWhere} ${subqueryOrderBy} LIMIT 1)`;\n}\n\nexport function makeCorrelator(\n  spec: Spec,\n  parentFields: readonly QualifiedColumn[],\n  childZqlFields: readonly string[],\n): (childTable: Table) => SQLQuery {\n  return (childTable: Table) => {\n    const childFields = childZqlFields.map(zqlField => ({\n      table: childTable,\n      zql: zqlField,\n    }));\n    return sql.join(\n      zip(parentFields, childFields).map(\n        ([parentColumn, childColumn]) =>\n          sql`${colIdent(spec.server, parentColumn)} = ${colIdent(\n            spec.server,\n            childColumn,\n          )}`,\n      ),\n      ' AND ',\n    );\n  };\n}\n\nexport function simple(\n  spec: Spec,\n  condition: SimpleCondition,\n  table: Table,\n): SQLQuery {\n  switch (condition.op) {\n    case '!=':\n    case '<':\n    case '<=':\n    case '=':\n    case '>':\n    case '>=':\n    case 'ILIKE':\n    case 'LIKE':\n    case 'NOT ILIKE':\n    case 'NOT LIKE':\n      return sql`${valueComparison(\n        spec,\n        condition.left,\n        table,\n        condition.right,\n        false,\n      )} ${sql.__dangerous__rawValue(condition.op)} ${valueComparison(\n        spec,\n        condition.right,\n        table,\n        condition.left,\n        false,\n      )}`;\n    case 'NOT IN':\n    case 'IN':\n      return any(spec, condition, table);\n    case 'IS':\n    case 'IS NOT':\n      return distinctFrom(spec, condition, table);\n  }\n}\n\nexport function any(\n  spec: Spec,\n  condition: SimpleCondition,\n  table: Table,\n): SQLQuery {\n  return sql`${condition.op === 'NOT IN' ? sql`NOT` : sql``}\n    (\n      ${valueComparison(spec, condition.left, table, condition.right, false)} = ANY \n      (${valueComparison(spec, condition.right, table, condition.left, true)})\n    )`;\n}\n\nexport function distinctFrom(\n  spec: Spec,\n  condition: SimpleCondition,\n  table: Table,\n): SQLQuery {\n  return sql`${valueComparison(spec, condition.left, table, condition.right, false)} ${\n    condition.op === 'IS' ? sql`IS NOT DISTINCT FROM` : sql`IS DISTINCT FROM`\n  } ${valueComparison(spec, condition.right, table, condition.left, false)}`;\n}\n\nfunction valueComparison(\n  spec: Spec,\n  valuePos: ValuePosition,\n  table: Table,\n  otherValuePos: ValuePosition,\n  plural: boolean,\n): SQLQuery {\n  const valuePosType = valuePos.type;\n  switch (valuePosType) {\n    case 'column': {\n      const qualified: QualifiedColumn = {\n        table,\n        zql: valuePos.name,\n      };\n      return colIdent(spec.server, qualified);\n    }\n    case 'literal':\n      return literalValueComparison(\n        spec,\n        valuePos,\n        table,\n        otherValuePos,\n        plural,\n      );\n    case 'static':\n      throw new Error(\n        'Static parameters must be bound to a value before compiling to SQL',\n      );\n    default:\n      unreachable(valuePosType);\n      break;\n  }\n}\n\nfunction literalValueComparison(\n  spec: Spec,\n  valuePos: LiteralReference,\n  table: Table,\n  otherValuePos: ValuePosition,\n  plural: boolean,\n): SQLQuery {\n  const otherType = otherValuePos.type;\n  switch (otherType) {\n    case 'column':\n      return sqlConvertColumnArg(\n        getServerColumn(spec.server, table, otherValuePos.name),\n        valuePos.value,\n        plural,\n        true,\n      );\n    case 'literal': {\n      assert(\n        plural === Array.isArray(valuePos.value),\n        'Expected plural flag to match whether value is an array',\n      );\n      if (Array.isArray(valuePos.value)) {\n        if (valuePos.value.length > 0) {\n          // If the array is non-empty base its type on its first\n          // element\n          return sqlConvertPluralLiteralArg(\n            typeof valuePos.value[0] as PluralLiteralType,\n            valuePos.value as PluralLiteralType[],\n          );\n        }\n        // If the array is empty, base its type on the other value\n        // position's type (as long as the other value position is non-null,\n        // cannot have a null[]).\n        if (otherValuePos.value !== null) {\n          return sqlConvertPluralLiteralArg(\n            typeof otherValuePos.value as PluralLiteralType,\n            [],\n          );\n        }\n        // If the other value position is null, it can be compared to any\n        // type of empty array, chose 'string' arbitrarily.\n        return sqlConvertPluralLiteralArg('string', []);\n      }\n      if (\n        typeof valuePos.value === 'string' ||\n        typeof valuePos.value === 'number' ||\n        typeof valuePos.value === 'boolean'\n      ) {\n        return sqlConvertSingularLiteralArg(valuePos.value);\n      }\n      throw new Error(\n        `Literal of unexpected type. ${valuePos.value} of type ${typeof valuePos.value}`,\n      );\n    }\n    case 'static':\n      throw new Error(\n        'Static parameters must be bound to a value before compiling to SQL',\n      );\n    default:\n      unreachable(otherType);\n  }\n}\n\nexport function makeJunctionJoin(\n  spec: Spec,\n  relationship: CorrelatedSubquery,\n): {\n  join: SQLQuery;\n  participatingTables: ReturnType<typeof pullTablesForJunction>;\n} {\n  const participatingTables = pullTablesForJunction(spec, relationship);\n  const joins: SQLQuery[] = [];\n\n  for (const {table} of participatingTables) {\n    if (joins.length === 0) {\n      joins.push(fromIdent(spec.server, table));\n      continue;\n    }\n    joins.push(\n      sql` JOIN ${fromIdent(spec.server, table)} ON ${makeCorrelator(\n        spec,\n        participatingTables[joins.length].correlation.parentField.map(f => ({\n          table: participatingTables[joins.length - 1].table,\n          zql: f,\n        })),\n        participatingTables[joins.length].correlation.childField,\n      )(participatingTables[joins.length].table)}`,\n    );\n  }\n\n  return {\n    join: sql`${sql.join(joins, '')}`,\n    participatingTables,\n    // lastTable: participatingTables[participatingTables.length - 1].table,\n    // lastLimit: participatingTables[participatingTables.length - 1].limit,\n  };\n}\n\nexport function pullTablesForJunction(\n  spec: Spec,\n  relationship: CorrelatedSubquery,\n): [\n  {\n    table: Table;\n    correlation: Correlation;\n    limit: number | undefined;\n  },\n  {table: Table; correlation: Correlation; limit: number | undefined},\n] {\n  assert(\n    relationship.subquery.related?.length === 1,\n    'Too many related tables for a junction edge',\n  );\n  const otherRelationship = relationship.subquery.related[0];\n  assert(\n    !otherRelationship.hidden,\n    'Expected junction edge relationship to not be hidden',\n  );\n  return [\n    {\n      table: makeTable(spec, relationship.subquery.table),\n      correlation: relationship.correlation,\n      limit: relationship.subquery.limit,\n    },\n    {\n      table: makeTable(spec, otherRelationship.subquery.table),\n      correlation: otherRelationship.correlation,\n      limit: otherRelationship.subquery.limit,\n    },\n  ];\n}\n\nfunction toJSON(table: string, singular = false): SQLQuery {\n  return sql`${\n    singular ? sql`` : sql`COALESCE(json_agg`\n  }(row_to_json(${sql.ident(table)}))${singular ? sql`` : sql`, '[]'::json)`}`;\n}\n\nfunction selectIdent(server: ServerSpec, column: QualifiedColumn): SQLQuery {\n  const serverColumnSchema =\n    server.schema[server.mapper.tableName(column.table.zql)][\n      server.mapper.columnName(column.table.zql, column.zql)\n    ];\n  const serverType = serverColumnSchema.type;\n  if (!serverColumnSchema.isEnum) {\n    let needsNormalization = false;\n    switch (serverType) {\n      case 'timestamptz':\n      // @ts-expect-error Fallthrough intended\n      case 'timetz':\n        needsNormalization = true;\n      // fallthrough\n\n      case 'date':\n      case 'time':\n      case 'time without time zone':\n      case 'time with time zone':\n      case 'timestamp':\n      case 'timestamp without time zone':\n      case 'timestamp with time zone': {\n        // EXTRACT(EPOCH FROM timetz) can be negative when the UTC offset is\n        // positive (e.g. 01:00+02 = 23:00 UTC prev day = -3600s). Wrap with\n        // modular arithmetic to normalize to 0..86400000.\n        const toMs = (epochExpr: SQLQuery): SQLQuery =>\n          needsNormalization\n            ? sql`((${epochExpr})::bigint + 86400000) % 86400000`\n            : epochExpr;\n\n        if (serverColumnSchema.isArray) {\n          const col = colIdent(server, column);\n          return sql`CASE WHEN ${col} IS NULL THEN NULL ELSE ARRAY(SELECT ${toMs(\n            sql`EXTRACT(EPOCH FROM unnest(${col})) * 1000`,\n          )}) END as ${sql.ident(column.zql)}`;\n        }\n\n        return sql`${toMs(\n          sql`EXTRACT(EPOCH FROM ${colIdent(server, column)}) * 1000`,\n        )} as ${sql.ident(column.zql)}`;\n      }\n    }\n  }\n\n  return sql`${colIdent(server, column)} as ${sql.ident(column.zql)}`;\n}\n\nfunction colIdent(server: ServerSpec, column: QualifiedColumn) {\n  return sql.ident(\n    column.table.alias,\n    server.mapper.columnName(column.table.zql, column.zql),\n  );\n}\n\nfunction fromIdent(server: ServerSpec, table: Table) {\n  return sql`${sql.ident(server.mapper.tableName(table.zql))} AS ${sql.ident(table.alias)}`;\n}\n\nfunction getServerColumn(spec: ServerSpec, table: Table, zqlColumn: string) {\n  return spec.schema[spec.mapper.tableName(table.zql)][\n    spec.mapper.columnName(table.zql, zqlColumn)\n  ];\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nexport function extractZqlResult(pgResult: Array<any>): JSONValue {\n  const bigIntJson: BigIntJSONValue = parseBigIntJson(\n    pgResult[0][ZQL_RESULT_KEY],\n  );\n  assertJSONValue(bigIntJson);\n  return bigIntJson;\n}\n\nfunction assertJSONValue(v: BigIntJSONValue): asserts v is JSONValue {\n  const path = findPathToBigInt(v);\n  if (path) {\n    throw new Error(`Value exceeds safe Number range. ${path}`);\n  }\n}\n\nfunction findPathToBigInt(v: BigIntJSONValue): string | undefined {\n  const typeOfV = typeof v;\n  switch (typeOfV) {\n    case 'bigint':\n      return ` = ${v}`;\n    case 'object': {\n      if (v === null) {\n        return;\n      }\n      if (Array.isArray(v)) {\n        for (let i = 0; i < v.length; i++) {\n          const path = findPathToBigInt(v[i]);\n          if (path) {\n            return `[${i}]${path}`;\n          }\n        }\n        return undefined;\n      }\n\n      const o = v as Record<string, BigIntJSONValue>;\n      for (const k in o) {\n        if (hasOwn(o, k)) {\n          const path = findPathToBigInt(o[k]);\n          if (path) {\n            return `['${k}']${path}`;\n          }\n        }\n      }\n      return undefined;\n    }\n    case 'number':\n      return undefined;\n    case 'boolean':\n      return undefined;\n    default:\n      return undefined;\n  }\n}\n"],"mappings":";;;;;;;;;;AA2DA,IAAM,iBAAiB;AACvB,IAAM,uBAAuB,IAAI,MAAM,eAAe;AAEtD,IAAM,uBAAuB;AAC7B,IAAM,yBAAyB,IAAI,MAAM,qBAAqB;AAE9D,SAAgB,QACd,cACA,WACA,KACA,QACU;AACV,OAAM,iBACJ,MACA,cAAa,UAAU,OAAO,WAAW,WAC1C;CACD,MAAM,OAAa;EACjB,YAAY;EACZ,QAAQ;GACN,QAAQ;GACR,QAAQ,eAAe,UAAU,OAAO;GACzC;EACD,KAAK,UAAU;EAChB;AACD,QAAO,GAAG;MACN,OAAO,sBAAsB,QAAQ,SAAS,CAAC,YAAY,qBAAqB;YAC1E,OAAO,MAAM,KAAK,OAAO,CAAC,IAAI;;AAG1C,SAAS,OACP,MACA,KACA,QACA,WACU;CACV,MAAM,QAAQ,UAAU,MAAM,IAAI,MAAM;CACxC,MAAM,eAAe,QAAQ,MAAM,IAAI,WAAW,EAAE,EAAE,QAAQ,MAAM;CACpE,MAAM,cAAc,KAAK,IAAI,IAAI;CACjC,MAAM,cAAc,IAAI,IACtB,IAAI,SAAS,KAAI,MAAK,EAAE,SAAS,SAAS,GAAG,CAC9C;AACD,MAAK,MAAM,UAAU,OAAO,KAAK,YAAY,QAAQ,CACnD,KAAI,CAAC,YAAY,IAAI,OAAO,CAC1B,cAAa,KACX,YAAY,KAAK,QAAQ;EACvB;EACA,KAAK;EACN,CAAC,CACH;CAIL,IAAI,eAAe;CACnB,SAAS,WAAW,MAA2B;AAC7C,MAAI,CAAC,KACH,QAAO,GAAG;EAGZ,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG;AACzC,iBAAe;AACf,SAAO;;AAGT,QAAO,GAAG,UAAU,IAAI,KAAK,cAAc,IAAI,CAAC;WACvC,UAAU,KAAK,QAAQ,MAAM,CAAC;MACnC,WAAW,IAAI,MAAM,CAAC,GAAG,MAAM,MAAM,IAAI,OAAO,MAAM,CAAC;MACvD,WAAW,UAAU,CAAC,GAAG,YAAY,UAAU,MAAM,GAAG,GAAG,GAAG;MAC9D,QAAQ,MAAM,IAAI,SAAS,MAAM,CAAC;MAClC,MAAM,IAAI,OAAO,QAAQ,SAAS;;AAGxC,SAAgB,MACd,OACA,UACU;AACV,KAAI,UAAU,EACZ,QAAO,GAAG;AAEZ,KAAI,SACF,QAAO,GAAG;AAEZ,KAAI,UAAU,KAAA,EACZ,QAAO,GAAG;AAEZ,QAAO,GAAG,SAAS,6BAA6B,MAAM;;AAGxD,SAAS,UAAU,MAAY,KAAa,OAAuB;AACjE,SAAQ,SAAS,MAAM,MAAM,KAAK;AAClC,QAAO;EACL;EACA;EACD;;AAGH,SAAgB,QACd,MACA,SACA,OACU;AACV,KAAI,CAAC,QACH,QAAO,GAAG;AAEZ,QAAO,GAAG,YAAY,IAAI,KACxB,QAAQ,KAAK,CAAC,KAAK,SACjB,QAAQ,QAGJ,GAAG,GAAG,SAAS,KAAK,QAAQ;EAC1B;EACA,KAAK;EACN,CAAC,CAAC,oBACH,GAAG,GAAG,SAAS,KAAK,QAAQ;EAC1B;EACA,KAAK;EACN,CAAC,CAAC,kBACR,EACD,KACD;;AAGH,SAAS,QACP,MACA,eACA,QACA,aACY;AACZ,QAAO,cAAc,KAAI,iBACvB,qBACE,MACA,cACA,QAAQ,cAAc,KAAK,aAAa,SAAS,MAAM,GACvD,YACD,CACF;;AAGH,SAAS,qBACP,MACA,cACA,QACA,aACU;CACV,MAAM,aAAa,SAAS,aAAa,SAAS;AAClD,KAAI,aAAa,QAAQ;EACvB,MAAM,EAAC,MAAM,wBAAuB,iBAAiB,MAAM,aAAa;EACxE,MAAM,YAAY,KAAK,KAAK,oBAAoB,CAAC,CAAC;AAElD,SACE,aAAa,SAAS,SACtB,yCACD;EACD,MAAM,YAAY,aAAa,SAAS,QAAQ,GAAG;EACnD,MAAM,eAAe,QACnB,MACA,UAAU,WAAW,EAAE,EACvB,QACA,UACD;EACD,MAAM,cAAc,KAAK,IAAI,UAAU;AACvC,OAAK,MAAM,UAAU,OAAO,KAAK,YAAY,QAAQ,CACnD,cAAa,KACX,YAAY,KAAK,QAAQ;GACvB,OAAO;GACP,KAAK;GACN,CAAC,CACH;AAGH,SAAO,GAAG;iBACG,OAAO,YAAY,QAAQ,SAAS,CAAC,gBAAgB,IAAI,KAChE,cACA,IACD,CAAC,QAAQ,KAAK,UAAU,eACvB,MACA,aAAa,YAAY,YAAY,KAAI,OAAM;GAC7C,OAAO;GACP,KAAK;GACN,EAAE,EACH,aAAa,YAAY,WAC1B,CAAC,oBAAoB,GAAG,MAAM,CAAC,IAC9B,UAAU,QACN,GAAG,OAAO,MAAM,MAAM,UAAU,OAAO,UAAU,KACjD,GAAG,GACR,GAAG,QAAQ,MAAM,UAAU,SAAS,UAAU,CAAC,GAAG,MACjD,KAAK,oBAAoB,EAAE,OAC3B,QAAQ,SACT,CAAC,KAAK,IAAI,MAAM,WAAW,CAAC;aACxB,IAAI,MAAM,aAAa,SAAS,MAAM;;AAGjD,QAAO,GAAG;eACG,OAAO,YAAY,QAAQ,SAAS,CAAC,SAAS,OACrD,MACA,aAAa,UACb,QACA,eACE,MACA,aAAa,YAAY,YAAY,KAAI,OAAM;EAC7C,OAAO;EACP,KAAK;EACN,EAAE,EACH,aAAa,YAAY,WAC1B,CACF,CAAC,IAAI,IAAI,MAAM,WAAW,CAAC;WACvB,IAAI,MAAM,aAAa,SAAS,MAAM;;AAGjD,SAAS,MACP,MACA,WACA,OACU;AACV,KAAI,CAAC,UACH,QAAO,GAAG;AAGZ,SAAQ,UAAU,MAAlB;EACE,KAAK,MACH,QAAO,GAAG,IAAI,IAAI,KAChB,UAAU,WAAW,KAAI,MAAK,MAAM,MAAM,GAAG,MAAM,CAAC,EACpD,QACD,CAAC;EACJ,KAAK,KACH,QAAO,GAAG,IAAI,IAAI,KAChB,UAAU,WAAW,KAAI,MAAK,MAAM,MAAM,GAAG,MAAM,CAAC,EACpD,OACD,CAAC;EACJ,KAAK;AACH,OAAI,UAAU,OACZ,QAAO,eAAe,MAAM,WAAW,MAAM;AAE/C,UAAO,OAAO,MAAM,WAAW,MAAM;EACvC,KAAK,SACH,QAAO,OAAO,MAAM,WAAW,MAAM;;;AAI3C,SAAS,OACP,MACA,WACA,aACU;AACV,SAAQ,UAAU,IAAlB;EACE,KAAK,SACH,QAAO,GAAG,WAAW,OACnB,MACA,UAAU,QAAQ,UAClB,KAAA,GACA,eACE,MACA,UAAU,QAAQ,YAAY,YAAY,KAAI,OAAM;GAClD,OAAO;GACP,KAAK;GACN,EAAE,EACH,UAAU,QAAQ,YAAY,WAC/B,CACF,CAAC;EACJ,KAAK,aACH,QAAO,GAAG,eAAe,OACvB,MACA,UAAU,QAAQ,UAClB,KAAA,GACA,eACE,MACA,UAAU,QAAQ,YAAY,YAAY,KAAI,OAAM;GAClD,OAAO;GACP,KAAK;GACN,EAAE,EACH,UAAU,QAAQ,YAAY,WAC/B,CACF,CAAC;;;AAIR,SAAS,eACP,MACA,WACA,aACU;CACV,MAAM,cAAc,UAAU,QAAQ,YAAY,YAAY;CAC9D,MAAM,aAAa,UAAU,QAAQ,YAAY,WAAW;CAC5D,MAAM,cAAc,UAAU,QAAQ;CAEtC,MAAM,YAAY,SAAS,KAAK,QAAQ;EACtC,OAAO;EACP,KAAK;EACN,CAAC;CAEF,MAAM,gBAAgB,UAAU,MAAM,YAAY,MAAM;CACxD,MAAM,WAAW,SAAS,KAAK,QAAQ;EACrC,OAAO;EACP,KAAK;EACN,CAAC;CAEF,MAAM,KAAK,IAAI,sBACb,UAAU,OAAO,WAAW,MAAM,SACnC;CAED,MAAM,gBAAgB,YAAY,QAC9B,GAAG,SAAS,MAAM,MAAM,YAAY,OAAO,cAAc,KACzD,GAAG;CACP,MAAM,kBAAkB,QAAQ,MAAM,YAAY,SAAS,cAAc;AAEzE,QAAO,GAAG,GAAG,UAAU,GAAG,GAAG,WAAW,SAAS,QAAQ,UAAU,KAAK,QAAQ,cAAc,CAAC,GAAG,cAAc,GAAG,gBAAgB;;AAGrI,SAAgB,eACd,MACA,cACA,gBACiC;AACjC,SAAQ,eAAsB;EAC5B,MAAM,cAAc,eAAe,KAAI,cAAa;GAClD,OAAO;GACP,KAAK;GACN,EAAE;AACH,SAAO,IAAI,KACT,IAAI,cAAc,YAAY,CAAC,KAC5B,CAAC,cAAc,iBACd,GAAG,GAAG,SAAS,KAAK,QAAQ,aAAa,CAAC,KAAK,SAC7C,KAAK,QACL,YACD,GACJ,EACD,QACD;;;AAIL,SAAgB,OACd,MACA,WACA,OACU;AACV,SAAQ,UAAU,IAAlB;EACE,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK;EACL,KAAK,WACH,QAAO,GAAG,GAAG,gBACX,MACA,UAAU,MACV,OACA,UAAU,OACV,MACD,CAAC,GAAG,IAAI,sBAAsB,UAAU,GAAG,CAAC,GAAG,gBAC9C,MACA,UAAU,OACV,OACA,UAAU,MACV,MACD;EACH,KAAK;EACL,KAAK,KACH,QAAO,IAAI,MAAM,WAAW,MAAM;EACpC,KAAK;EACL,KAAK,SACH,QAAO,aAAa,MAAM,WAAW,MAAM;;;AAIjD,SAAgB,IACd,MACA,WACA,OACU;AACV,QAAO,GAAG,GAAG,UAAU,OAAO,WAAW,GAAG,QAAQ,GAAG,GAAG;;QAEpD,gBAAgB,MAAM,UAAU,MAAM,OAAO,UAAU,OAAO,MAAM,CAAC;SACpE,gBAAgB,MAAM,UAAU,OAAO,OAAO,UAAU,MAAM,KAAK,CAAC;;;AAI7E,SAAgB,aACd,MACA,WACA,OACU;AACV,QAAO,GAAG,GAAG,gBAAgB,MAAM,UAAU,MAAM,OAAO,UAAU,OAAO,MAAM,CAAC,GAChF,UAAU,OAAO,OAAO,GAAG,yBAAyB,GAAG,mBACxD,GAAG,gBAAgB,MAAM,UAAU,OAAO,OAAO,UAAU,MAAM,MAAM;;AAG1E,SAAS,gBACP,MACA,UACA,OACA,eACA,QACU;CACV,MAAM,eAAe,SAAS;AAC9B,SAAQ,cAAR;EACE,KAAK,UAAU;GACb,MAAM,YAA6B;IACjC;IACA,KAAK,SAAS;IACf;AACD,UAAO,SAAS,KAAK,QAAQ,UAAU;;EAEzC,KAAK,UACH,QAAO,uBACL,MACA,UACA,OACA,eACA,OACD;EACH,KAAK,SACH,OAAM,IAAI,MACR,qEACD;EACH;AACE,eAAY,aAAa;AACzB;;;AAIN,SAAS,uBACP,MACA,UACA,OACA,eACA,QACU;CACV,MAAM,YAAY,cAAc;AAChC,SAAQ,WAAR;EACE,KAAK,SACH,QAAO,oBACL,gBAAgB,KAAK,QAAQ,OAAO,cAAc,KAAK,EACvD,SAAS,OACT,QACA,KACD;EACH,KAAK;AACH,UACE,WAAW,MAAM,QAAQ,SAAS,MAAM,EACxC,0DACD;AACD,OAAI,MAAM,QAAQ,SAAS,MAAM,EAAE;AACjC,QAAI,SAAS,MAAM,SAAS,EAG1B,QAAO,2BACL,OAAO,SAAS,MAAM,IACtB,SAAS,MACV;AAKH,QAAI,cAAc,UAAU,KAC1B,QAAO,2BACL,OAAO,cAAc,OACrB,EAAE,CACH;AAIH,WAAO,2BAA2B,UAAU,EAAE,CAAC;;AAEjD,OACE,OAAO,SAAS,UAAU,YAC1B,OAAO,SAAS,UAAU,YAC1B,OAAO,SAAS,UAAU,UAE1B,QAAO,6BAA6B,SAAS,MAAM;AAErD,SAAM,IAAI,MACR,+BAA+B,SAAS,MAAM,WAAW,OAAO,SAAS,QAC1E;EAEH,KAAK,SACH,OAAM,IAAI,MACR,qEACD;EACH,QACE,aAAY,UAAU;;;AAI5B,SAAgB,iBACd,MACA,cAIA;CACA,MAAM,sBAAsB,sBAAsB,MAAM,aAAa;CACrE,MAAM,QAAoB,EAAE;AAE5B,MAAK,MAAM,EAAC,WAAU,qBAAqB;AACzC,MAAI,MAAM,WAAW,GAAG;AACtB,SAAM,KAAK,UAAU,KAAK,QAAQ,MAAM,CAAC;AACzC;;AAEF,QAAM,KACJ,GAAG,SAAS,UAAU,KAAK,QAAQ,MAAM,CAAC,MAAM,eAC9C,MACA,oBAAoB,MAAM,QAAQ,YAAY,YAAY,KAAI,OAAM;GAClE,OAAO,oBAAoB,MAAM,SAAS,GAAG;GAC7C,KAAK;GACN,EAAE,EACH,oBAAoB,MAAM,QAAQ,YAAY,WAC/C,CAAC,oBAAoB,MAAM,QAAQ,MAAM,GAC3C;;AAGH,QAAO;EACL,MAAM,GAAG,GAAG,IAAI,KAAK,OAAO,GAAG;EAC/B;EAGD;;AAGH,SAAgB,sBACd,MACA,cAQA;AACA,QACE,aAAa,SAAS,SAAS,WAAW,GAC1C,8CACD;CACD,MAAM,oBAAoB,aAAa,SAAS,QAAQ;AACxD,QACE,CAAC,kBAAkB,QACnB,uDACD;AACD,QAAO,CACL;EACE,OAAO,UAAU,MAAM,aAAa,SAAS,MAAM;EACnD,aAAa,aAAa;EAC1B,OAAO,aAAa,SAAS;EAC9B,EACD;EACE,OAAO,UAAU,MAAM,kBAAkB,SAAS,MAAM;EACxD,aAAa,kBAAkB;EAC/B,OAAO,kBAAkB,SAAS;EACnC,CACF;;AAGH,SAAS,OAAO,OAAe,WAAW,OAAiB;AACzD,QAAO,GAAG,GACR,WAAW,GAAG,KAAK,GAAG,oBACvB,eAAe,IAAI,MAAM,MAAM,CAAC,IAAI,WAAW,GAAG,KAAK,GAAG;;AAG7D,SAAS,YAAY,QAAoB,QAAmC;CAC1E,MAAM,qBACJ,OAAO,OAAO,OAAO,OAAO,UAAU,OAAO,MAAM,IAAI,EACrD,OAAO,OAAO,WAAW,OAAO,MAAM,KAAK,OAAO,IAAI;CAE1D,MAAM,aAAa,mBAAmB;AACtC,KAAI,CAAC,mBAAmB,QAAQ;EAC9B,IAAI,qBAAqB;AACzB,UAAQ,YAAR;GACE,KAAK;GAEL,KAAK,SACH,sBAAqB;GAGvB,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK,4BAA4B;IAI/B,MAAM,QAAQ,cACZ,qBACI,GAAG,KAAK,UAAU,oCAClB;AAEN,QAAI,mBAAmB,SAAS;KAC9B,MAAM,MAAM,SAAS,QAAQ,OAAO;AACpC,YAAO,GAAG,aAAa,IAAI,uCAAuC,KAChE,GAAG,6BAA6B,IAAI,WACrC,CAAC,WAAW,IAAI,MAAM,OAAO,IAAI;;AAGpC,WAAO,GAAG,GAAG,KACX,GAAG,sBAAsB,SAAS,QAAQ,OAAO,CAAC,UACnD,CAAC,MAAM,IAAI,MAAM,OAAO,IAAI;;;;AAKnC,QAAO,GAAG,GAAG,SAAS,QAAQ,OAAO,CAAC,MAAM,IAAI,MAAM,OAAO,IAAI;;AAGnE,SAAS,SAAS,QAAoB,QAAyB;AAC7D,QAAO,IAAI,MACT,OAAO,MAAM,OACb,OAAO,OAAO,WAAW,OAAO,MAAM,KAAK,OAAO,IAAI,CACvD;;AAGH,SAAS,UAAU,QAAoB,OAAc;AACnD,QAAO,GAAG,GAAG,IAAI,MAAM,OAAO,OAAO,UAAU,MAAM,IAAI,CAAC,CAAC,MAAM,IAAI,MAAM,MAAM,MAAM;;AAGzF,SAAS,gBAAgB,MAAkB,OAAc,WAAmB;AAC1E,QAAO,KAAK,OAAO,KAAK,OAAO,UAAU,MAAM,IAAI,EACjD,KAAK,OAAO,WAAW,MAAM,KAAK,UAAU;;AAKhD,SAAgB,iBAAiB,UAAiC;CAChE,MAAM,aAA8B,MAClC,SAAS,GAAG,gBACb;AACD,iBAAgB,WAAW;AAC3B,QAAO;;AAGT,SAAS,gBAAgB,GAA4C;CACnE,MAAM,OAAO,iBAAiB,EAAE;AAChC,KAAI,KACF,OAAM,IAAI,MAAM,oCAAoC,OAAO;;AAI/D,SAAS,iBAAiB,GAAwC;AAEhE,SADgB,OAAO,GACvB;EACE,KAAK,SACH,QAAO,MAAM;EACf,KAAK,UAAU;AACb,OAAI,MAAM,KACR;AAEF,OAAI,MAAM,QAAQ,EAAE,EAAE;AACpB,SAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;KACjC,MAAM,OAAO,iBAAiB,EAAE,GAAG;AACnC,SAAI,KACF,QAAO,IAAI,EAAE,GAAG;;AAGpB;;GAGF,MAAM,IAAI;AACV,QAAK,MAAM,KAAK,EACd,KAAI,OAAO,GAAG,EAAE,EAAE;IAChB,MAAM,OAAO,iBAAiB,EAAE,GAAG;AACnC,QAAI,KACF,QAAO,KAAK,EAAE,IAAI;;AAIxB;;EAEF,KAAK,SACH;EACF,KAAK,UACH;EACF,QACE"}

package/out/z2s/src/sql.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sql.js","names":["#seen","#size"],"sources":["../../../../z2s/src/sql.ts"],"sourcesContent":["import {\n  escapePostgresIdentifier,\n  escapeSQLiteIdentifier,\n} from '@databases/escape-identifier';\nimport type {FormatConfig, SQLItem, SQLQuery} from '@databases/sql';\nimport sql, {SQLItemType} from '@databases/sql';\nimport {assert, unreachable} from '../../shared/src/asserts.ts';\nimport {\n  isPgNumberType,\n  isPgStringType,\n} from '../../zero-cache/src/types/pg-data-type.ts';\nimport type {LiteralValue} from '../../zero-protocol/src/ast.ts';\nimport type {ServerColumnSchema} from '../../zero-types/src/server-schema.ts';\n\nexport function formatPg(sql: SQLQuery) {\n  const format = new ReusingFormat(escapePostgresIdentifier);\n  return sql.format((items: readonly SQLItem[]) => formatFn(items, format));\n}\n\nexport function formatPgInternalConvert(sql: SQLQuery) {\n  const format = new SQLConvertFormat(escapePostgresIdentifier);\n  return sql.format((items: readonly SQLItem[]) => formatFn(items, format));\n}\n\nexport function formatSqlite(sql: SQLQuery) {\n  const format = new ReusingFormat(escapeSQLiteIdentifier);\n  return sql.format((items: readonly SQLItem[]) => formatFn(items, format));\n}\n\nconst sqlConvert = Symbol('fromJson');\n\nexport type LiteralType = 'boolean' | 'number' | 'string' | 'null';\nexport type PluralLiteralType = Exclude<LiteralType, 'null'>;\n\ntype ColumnSqlConvertArg = {\n  [sqlConvert]: 'column';\n  type: string;\n  value: unknown;\n  plural: boolean;\n  isEnum: boolean;\n  isComparison: boolean;\n};\n\ntype SqlConvertArg =\n  | ColumnSqlConvertArg\n  | {\n      [sqlConvert]: 'literal';\n      type: LiteralType;\n      value: LiteralValue;\n      plural: boolean;\n    };\n\nfunction isSqlConvert(value: unknown): value is SqlConvertArg {\n  return value !== null && typeof value === 'object' && sqlConvert in value;\n}\n\nexport function sqlConvertSingularLiteralArg(\n  value: string | boolean | number | null,\n): SQLQuery {\n  const arg: SqlConvertArg = {\n    [sqlConvert]: 'literal',\n    type: value === null ? 'null' : (typeof value as LiteralType),\n    value,\n    plural: false,\n  };\n  return sql.value(arg);\n}\n\nexport function sqlConvertPluralLiteralArg(\n  type: PluralLiteralType,\n  value: PluralLiteralType[],\n): SQLQuery {\n  const arg: SqlConvertArg = {\n    [sqlConvert]: 'literal',\n    type,\n    value,\n    plural: true,\n  };\n  return sql.value(arg);\n}\n\nexport function sqlConvertColumnArg(\n  serverColumnSchema: ServerColumnSchema,\n  value: unknown,\n  plural: boolean,\n  isComparison: boolean,\n): SQLQuery {\n  return sql.value({\n    [sqlConvert]: 'column',\n    type: serverColumnSchema.type,\n    isEnum: serverColumnSchema.isEnum,\n    value,\n    plural: plural || serverColumnSchema.isArray,\n    isComparison,\n  });\n}\n\nclass ReusingFormat implements FormatConfig {\n  readonly #seen: Map<unknown, number> = new Map();\n  readonly escapeIdentifier: (str: string) => string;\n\n  constructor(escapeIdentifier: (str: string) => string) {\n    this.escapeIdentifier = escapeIdentifier;\n  }\n\n  formatValue = (value: unknown) => {\n    if (this.#seen.has(value)) {\n      return {\n        placeholder: `$${this.#seen.get(value)}`,\n        value: PREVIOUSLY_SEEN_VALUE,\n      };\n    }\n    this.#seen.set(value, this.#seen.size + 1);\n    return {placeholder: `$${this.#seen.size}`, value};\n  };\n}\n\nfunction stringify(arg: SqlConvertArg): string | null {\n  if (arg.value === null) {\n    return null;\n  }\n  if (arg.plural) {\n    return JSON.stringify(arg.value);\n  }\n  if (arg[sqlConvert] === 'literal' && arg.type === 'string') {\n    return arg.value as unknown as string;\n  }\n  if (\n    arg[sqlConvert] === 'column' &&\n    (arg.isEnum || isPgStringType(arg.type))\n  ) {\n    return arg.value as string;\n  }\n  return JSON.stringify(arg.value);\n}\n\nclass SQLConvertFormat implements FormatConfig {\n  readonly #seen: Map<unknown, Map<string, number>> = new Map();\n  #size = 0;\n  readonly escapeIdentifier: (str: string) => string;\n\n  constructor(escapeIdentifier: (str: string) => string) {\n    this.escapeIdentifier = escapeIdentifier;\n  }\n\n  formatValue = (value: unknown) => {\n    assert(isSqlConvert(value), 'JsonPackedFormat can only take JsonPackArgs.');\n    const byType = this.#seen.get(value.value);\n    if (byType?.has(value.type)) {\n      return {\n        placeholder: createPlaceholder(byType.get(value.type)!, value),\n        value: PREVIOUSLY_SEEN_VALUE,\n      };\n    }\n    this.#size++;\n    if (byType) {\n      byType.set(value.type, this.#size);\n    } else {\n      this.#seen.set(value.value, new Map([[value.type, this.#size]]));\n    }\n    return {\n      placeholder: createPlaceholder(this.#size, value),\n      value: stringify(value),\n    };\n  };\n}\n\nfunction createPlaceholder(index: number, arg: SqlConvertArg) {\n  if (arg.type === 'null') {\n    assert(arg.value === null, \"Args of type 'null' must have value null\");\n    assert(!arg.plural, \"Args of type 'null' must not be plural\");\n    return `$${index}`;\n  }\n\n  if (arg.value === null && arg.plural) {\n    return `$${index}`;\n  }\n\n  if (arg[sqlConvert] === 'literal') {\n    const {value} = arg;\n    if (Array.isArray(value)) {\n      const elType = pgTypeForLiteralType(arg.type);\n      return formatPlural(index, `value::${elType}`);\n    }\n    return `$${index}::text::${pgTypeForLiteralType(arg.type)}`;\n  }\n\n  const common = formatCommonToSingularAndPlural(index, arg);\n  return arg.plural ? formatPlural(index, common) : common;\n}\n\nfunction formatCommonToSingularAndPlural(\n  index: number,\n  arg: ColumnSqlConvertArg,\n) {\n  // Ok, so what is with all the `::text` casts\n  // before the final cast?\n  // This is to force the statement to describe its arguments\n  // as being text. Without the text cast the args are described as\n  // being bool/json/numeric/whatever and the bindings try to coerce\n  // the inputs to those types.\n  const valuePlaceholder = arg.plural ? 'value' : `$${index}`;\n  let atTimeZone = ` AT TIME ZONE 'UTC'`;\n  switch (arg.type) {\n    case 'timestamptz':\n    // @ts-expect-error Fallthrough intended\n    case 'timestamp with time zone':\n      atTimeZone = '';\n    // fallthrough\n\n    case 'date':\n    case 'timestamp':\n    case 'timestamp without time zone':\n      return `to_timestamp(${valuePlaceholder}::text::numeric / 1000.0)${atTimeZone}`;\n\n    case 'timetz':\n    // @ts-expect-error Fallthrough intended\n    case 'time with time zone':\n      atTimeZone = '';\n    // fallthrough\n\n    case 'time':\n    case 'time without time zone':\n      return `(${valuePlaceholder}::text::int * interval'1ms')::time${atTimeZone}`;\n\n    // uuid: cast to native uuid type for proper comparison and index usage\n    case 'uuid':\n      return `${valuePlaceholder}::text::uuid`;\n  }\n  if (arg.isEnum) {\n    return `${valuePlaceholder}::text::\"${arg.type}\"`;\n  }\n  if (isPgStringType(arg.type)) {\n    // For comparison cast to the general `text` type, not the\n    // specific column type (i.e. `arg.type`), because we don't want to\n    // force the value being compared to the size/max-size of the column\n    // type before comparison.\n    return arg.isComparison\n      ? `${valuePlaceholder}::text`\n      : `${valuePlaceholder}::text::${arg.type}`;\n  }\n  if (isPgNumberType(arg.type)) {\n    // For comparison cast to `double precision` which uses IEEE 754 (the same\n    // representation as JavaScript numbers which will accurately\n    // represent any number value from zql) not the specific column type\n    // (i.e. `arg.type`), because we don't want to force the value being\n    // compared to the range and precision of the column type before comparison.\n    return arg.isComparison\n      ? `${valuePlaceholder}::text::double precision`\n      : `${valuePlaceholder}::text::${arg.type}`;\n  }\n  return `${valuePlaceholder}::text::${arg.type}`;\n}\n\nfunction formatPlural(index: number, select: string) {\n  return `ARRAY(\n          SELECT ${select} FROM jsonb_array_elements_text($${index}::text::jsonb)\n        )`;\n}\n\nfunction pgTypeForLiteralType(type: Exclude<LiteralType, 'null'>) {\n  switch (type) {\n    case 'boolean':\n      return 'boolean';\n    case 'number':\n      // `double precision` uses IEEE 754, the same representation as JavaScript\n      // numbers, and so this will accurately represent any number value\n      // from zql\n      return 'double precision';\n    case 'string':\n      return 'text';\n    default:\n      unreachable(type);\n  }\n}\n\nexport {sql};\n\nconst PREVIOUSLY_SEEN_VALUE = Symbol('PREVIOUSLY_SEEN_VALUE');\n\nconst whitespacePrefixRe = /^\\s*/;\n\nfunction formatFn(\n  items: readonly SQLItem[],\n  {escapeIdentifier, formatValue}: FormatConfig,\n): {\n  text: string;\n  values: unknown[];\n} {\n  // Create an empty query object.\n  let text = '';\n  const values = [];\n\n  const localIdentifiers = new Map<unknown, string>();\n\n  for (const item of items) {\n    switch (item.type) {\n      // If this is just raw text, we add it directly to the query text.\n      case SQLItemType.RAW: {\n        text += item.text;\n        break;\n      }\n\n      // If we got a value SQL item, add a placeholder and add the value to our\n      // placeholder values array.\n      case SQLItemType.VALUE: {\n        const {placeholder, value} = formatValue(item.value, values.length);\n        text += placeholder;\n        if (value !== PREVIOUSLY_SEEN_VALUE) {\n          values.push(value);\n        }\n\n        break;\n      }\n\n      // If we got an identifier type, escape the strings and get a local\n      // identifier for non-string identifiers.\n      case SQLItemType.IDENTIFIER: {\n        // This is a specific addition for Zero as Zero\n        // does not support dots in identifiers.\n        // If a dot is found, we assume it is a namespace\n        // and split the identifier into its parts.\n        const names =\n          item.names.length === 1 &&\n          typeof item.names[0] === 'string' &&\n          item.names[0].includes('.')\n            ? item.names[0].split('.')\n            : item.names;\n\n        text += names\n          .map((name): string => {\n            if (typeof name === 'string') return escapeIdentifier(name);\n\n            if (!localIdentifiers.has(name)) {\n              localIdentifiers.set(name, `__local_${localIdentifiers.size}__`);\n            }\n\n            return escapeIdentifier(localIdentifiers.get(name)!);\n          })\n          .join('.');\n        break;\n      }\n    }\n  }\n\n  if (text.trim()) {\n    const lines = text.split('\\n');\n    const min = Math.min(\n      ...lines\n        .filter(l => l.trim() !== '')\n        .map(l => whitespacePrefixRe.exec(l)![0].length),\n    );\n    if (min) {\n      text = lines.map(line => line.substr(min)).join('\\n');\n    }\n  }\n  return {\n    text: text.trim(),\n    values,\n  };\n}\n"],"mappings":";;;;;AAcA,SAAgB,SAAS,KAAe;CACtC,MAAM,SAAS,IAAI,cAAc,yBAAyB;AAC1D,QAAO,IAAI,QAAQ,UAA8B,SAAS,OAAO,OAAO,CAAC;;AAG3E,SAAgB,wBAAwB,KAAe;CACrD,MAAM,SAAS,IAAI,iBAAiB,yBAAyB;AAC7D,QAAO,IAAI,QAAQ,UAA8B,SAAS,OAAO,OAAO,CAAC;;AAQ3E,IAAM,aAAa,OAAO,WAAW;AAuBrC,SAAS,aAAa,OAAwC;AAC5D,QAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,cAAc;;AAGtE,SAAgB,6BACd,OACU;CACV,MAAM,MAAqB;GACxB,aAAa;EACd,MAAM,UAAU,OAAO,SAAU,OAAO;EACxC;EACA,QAAQ;EACT;AACD,QAAO,IAAI,MAAM,IAAI;;AAGvB,SAAgB,2BACd,MACA,OACU;CACV,MAAM,MAAqB;GACxB,aAAa;EACd;EACA;EACA,QAAQ;EACT;AACD,QAAO,IAAI,MAAM,IAAI;;AAGvB,SAAgB,oBACd,oBACA,OACA,QACA,cACU;AACV,QAAO,IAAI,MAAM;GACd,aAAa;EACd,MAAM,mBAAmB;EACzB,QAAQ,mBAAmB;EAC3B;EACA,QAAQ,UAAU,mBAAmB;EACrC;EACD,CAAC;;AAGJ,IAAM,gBAAN,MAA4C;CAC1C,wBAAuC,IAAI,KAAK;CAChD;CAEA,YAAY,kBAA2C;AACrD,OAAK,mBAAmB;;CAG1B,eAAe,UAAmB;AAChC,MAAI,MAAA,KAAW,IAAI,MAAM,CACvB,QAAO;GACL,aAAa,IAAI,MAAA,KAAW,IAAI,MAAM;GACtC,OAAO;GACR;AAEH,QAAA,KAAW,IAAI,OAAO,MAAA,KAAW,OAAO,EAAE;AAC1C,SAAO;GAAC,aAAa,IAAI,MAAA,KAAW;GAAQ;GAAM;;;AAItD,SAAS,UAAU,KAAmC;AACpD,KAAI,IAAI,UAAU,KAChB,QAAO;AAET,KAAI,IAAI,OACN,QAAO,KAAK,UAAU,IAAI,MAAM;AAElC,KAAI,IAAI,gBAAgB,aAAa,IAAI,SAAS,SAChD,QAAO,IAAI;AAEb,KACE,IAAI,gBAAgB,aACnB,IAAI,UAAU,eAAe,IAAI,KAAK,EAEvC,QAAO,IAAI;AAEb,QAAO,KAAK,UAAU,IAAI,MAAM;;AAGlC,IAAM,mBAAN,MAA+C;CAC7C,wBAAoD,IAAI,KAAK;CAC7D,QAAQ;CACR;CAEA,YAAY,kBAA2C;AACrD,OAAK,mBAAmB;;CAG1B,eAAe,UAAmB;AAChC,SAAO,aAAa,MAAM,EAAE,+CAA+C;EAC3E,MAAM,SAAS,MAAA,KAAW,IAAI,MAAM,MAAM;AAC1C,MAAI,QAAQ,IAAI,MAAM,KAAK,CACzB,QAAO;GACL,aAAa,kBAAkB,OAAO,IAAI,MAAM,KAAK,EAAG,MAAM;GAC9D,OAAO;GACR;AAEH,QAAA;AACA,MAAI,OACF,QAAO,IAAI,MAAM,MAAM,MAAA,KAAW;MAElC,OAAA,KAAW,IAAI,MAAM,OAAO,IAAI,IAAI,CAAC,CAAC,MAAM,MAAM,MAAA,KAAW,CAAC,CAAC,CAAC;AAElE,SAAO;GACL,aAAa,kBAAkB,MAAA,MAAY,MAAM;GACjD,OAAO,UAAU,MAAM;GACxB;;;AAIL,SAAS,kBAAkB,OAAe,KAAoB;AAC5D,KAAI,IAAI,SAAS,QAAQ;AACvB,SAAO,IAAI,UAAU,MAAM,2CAA2C;AACtE,SAAO,CAAC,IAAI,QAAQ,yCAAyC;AAC7D,SAAO,IAAI;;AAGb,KAAI,IAAI,UAAU,QAAQ,IAAI,OAC5B,QAAO,IAAI;AAGb,KAAI,IAAI,gBAAgB,WAAW;EACjC,MAAM,EAAC,UAAS;AAChB,MAAI,MAAM,QAAQ,MAAM,CAEtB,QAAO,aAAa,OAAO,UADZ,qBAAqB,IAAI,KAAK,GACC;AAEhD,SAAO,IAAI,MAAM,UAAU,qBAAqB,IAAI,KAAK;;CAG3D,MAAM,SAAS,gCAAgC,OAAO,IAAI;AAC1D,QAAO,IAAI,SAAS,aAAa,OAAO,OAAO,GAAG;;AAGpD,SAAS,gCACP,OACA,KACA;CAOA,MAAM,mBAAmB,IAAI,SAAS,UAAU,IAAI;CACpD,IAAI,aAAa;AACjB,SAAQ,IAAI,MAAZ;EACE,KAAK;EAEL,KAAK,2BACH,cAAa;EAGf,KAAK;EACL,KAAK;EACL,KAAK,8BACH,QAAO,gBAAgB,iBAAiB,2BAA2B;EAErE,KAAK;EAEL,KAAK,sBACH,cAAa;EAGf,KAAK;EACL,KAAK,yBACH,QAAO,IAAI,iBAAiB,oCAAoC;EAGlE,KAAK,OACH,QAAO,GAAG,iBAAiB;;AAE/B,KAAI,IAAI,OACN,QAAO,GAAG,iBAAiB,WAAW,IAAI,KAAK;AAEjD,KAAI,eAAe,IAAI,KAAK,CAK1B,QAAO,IAAI,eACP,GAAG,iBAAiB,UACpB,GAAG,iBAAiB,UAAU,IAAI;AAExC,KAAI,eAAe,IAAI,KAAK,CAM1B,QAAO,IAAI,eACP,GAAG,iBAAiB,4BACpB,GAAG,iBAAiB,UAAU,IAAI;AAExC,QAAO,GAAG,iBAAiB,UAAU,IAAI;;AAG3C,SAAS,aAAa,OAAe,QAAgB;AACnD,QAAO;mBACU,OAAO,mCAAmC,MAAM;;;AAInE,SAAS,qBAAqB,MAAoC;AAChE,SAAQ,MAAR;EACE,KAAK,UACH,QAAO;EACT,KAAK,SAIH,QAAO;EACT,KAAK,SACH,QAAO;EACT,QACE,aAAY,KAAK;;;AAMvB,IAAM,wBAAwB,OAAO,wBAAwB;AAE7D,IAAM,qBAAqB;AAE3B,SAAS,SACP,OACA,EAAC,kBAAkB,eAInB;CAEA,IAAI,OAAO;CACX,MAAM,SAAS,EAAE;CAEjB,MAAM,mCAAmB,IAAI,KAAsB;AAEnD,MAAK,MAAM,QAAQ,MACjB,SAAQ,KAAK,MAAb;EAEE,KAAK,YAAY;AACf,WAAQ,KAAK;AACb;EAKF,KAAK,YAAY,OAAO;GACtB,MAAM,EAAC,aAAa,UAAS,YAAY,KAAK,OAAO,OAAO,OAAO;AACnE,WAAQ;AACR,OAAI,UAAU,sBACZ,QAAO,KAAK,MAAM;AAGpB;;EAKF,KAAK,YAAY,YAAY;GAK3B,MAAM,QACJ,KAAK,MAAM,WAAW,KACtB,OAAO,KAAK,MAAM,OAAO,YACzB,KAAK,MAAM,GAAG,SAAS,IAAI,GACvB,KAAK,MAAM,GAAG,MAAM,IAAI,GACxB,KAAK;AAEX,WAAQ,MACL,KAAK,SAAiB;AACrB,QAAI,OAAO,SAAS,SAAU,QAAO,iBAAiB,KAAK;AAE3D,QAAI,CAAC,iBAAiB,IAAI,KAAK,CAC7B,kBAAiB,IAAI,MAAM,WAAW,iBAAiB,KAAK,IAAI;AAGlE,WAAO,iBAAiB,iBAAiB,IAAI,KAAK,CAAE;KACpD,CACD,KAAK,IAAI;AACZ;;;AAKN,KAAI,KAAK,MAAM,EAAE;EACf,MAAM,QAAQ,KAAK,MAAM,KAAK;EAC9B,MAAM,MAAM,KAAK,IACf,GAAG,MACA,QAAO,MAAK,EAAE,MAAM,KAAK,GAAG,CAC5B,KAAI,MAAK,mBAAmB,KAAK,EAAE,CAAE,GAAG,OAAO,CACnD;AACD,MAAI,IACF,QAAO,MAAM,KAAI,SAAQ,KAAK,OAAO,IAAI,CAAC,CAAC,KAAK,KAAK;;AAGzD,QAAO;EACL,MAAM,KAAK,MAAM;EACjB;EACD"}