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

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

@@ -1 +0,0 @@
-{"version":3,"file":"logging.js","names":[],"sources":["../../../../shared/src/logging.ts"],"sourcesContent":["import {pid} from 'node:process';\nimport {styleText} from 'node:util';\n/* oxlint-disable no-console */\nimport {\n  type Context,\n  LogContext,\n  type LogLevel,\n  type LogSink,\n} from '@rocicorp/logger';\nimport {stringify} from './bigint-json.ts';\n\nexport type LogConfig = {\n  level: LogLevel;\n  format: 'text' | 'json';\n};\n\nfunction style(color: 'gray' | 'yellow' | 'red', args: unknown[]) {\n  return styleText(color, args.join(' '));\n}\n\nconst COLOR_DEBUG = 'gray';\nconst COLOR_WARN = 'yellow';\nconst COLOR_ERROR = 'red';\n\n/**\n * Returns an object for writing colorized output to a provided console.\n * Note this should only be used when console is a TTY (i.e., Node).\n */\nexport const colorConsole = {\n  log: (...args: unknown[]) => {\n    console.log(...args);\n  },\n  debug: (...args: unknown[]) => {\n    console.debug(style(COLOR_DEBUG, args));\n  },\n  info: (...args: unknown[]) => {\n    console.info(...args);\n  },\n  warn: (...args: unknown[]) => {\n    console.warn(style(COLOR_WARN, args));\n  },\n  error: (...args: unknown[]) => {\n    console.error(style(COLOR_ERROR, args));\n  },\n};\n\nexport const consoleSink: LogSink = {\n  log(level, context, ...args) {\n    colorConsole[level](\n      toLocalIsoString(),\n      stringifyContext(context),\n      ...args.map(stringifyValue),\n    );\n  },\n};\n\nfunction toLocalIsoString(date = new Date()) {\n  const tzo = -date.getTimezoneOffset();\n  const sign = tzo >= 0 ? '+' : '-';\n  const pad = (n: number, len = 2) => String(Math.abs(n)).padStart(len, '0');\n\n  return (\n    date.getFullYear() +\n    '-' +\n    pad(date.getMonth() + 1) +\n    '-' +\n    pad(date.getDate()) +\n    'T' +\n    pad(date.getHours()) +\n    ':' +\n    pad(date.getMinutes()) +\n    ':' +\n    pad(date.getSeconds()) +\n    '.' +\n    pad(date.getMilliseconds(), 3) +\n    sign +\n    pad(tzo / 60) +\n    ':' +\n    pad(tzo % 60)\n  );\n}\n\nexport function getLogSink(config: LogConfig): LogSink {\n  return config.format === 'json' ? consoleJsonLogSink : consoleSink;\n}\n\nexport function createLogContext(\n  {log}: {log: LogConfig},\n  context = {},\n  sink = getLogSink(log),\n): LogContext {\n  const ctx = {pid, ...context};\n  const lc = new LogContext(log.level, ctx, sink);\n  // Emit a blank line to absorb random ANSI control code garbage that\n  // for some reason gets prepended to the first log line in CloudWatch.\n  lc.info?.('');\n  return lc;\n}\n\nconst consoleJsonLogSink: LogSink = {\n  log(level: LogLevel, context: Context | undefined, ...args: unknown[]): void {\n    // If the last arg is an object or an Error, combine those fields into the message.\n    const lastObj = errorOrObject(args.at(-1));\n    if (lastObj) {\n      args.pop();\n    }\n    const message = args.length\n      ? {\n          message: args.map(stringifyValue).join(' '),\n        }\n      : undefined;\n\n    console[level](\n      stringify({\n        level: level.toUpperCase(),\n        ...context,\n        ...lastObj,\n        ...message,\n      }),\n    );\n  },\n};\n\nexport function errorOrObject(v: unknown): object | undefined {\n  if (v instanceof Error) {\n    return toErrorLogObject(v);\n  }\n  if (v && typeof v === 'object') {\n    return v;\n  }\n  return undefined;\n}\n\nfunction toErrorLogObject(v: Error) {\n  return {\n    ...v, // some properties of Error subclasses may be enumerable\n    name: v.name,\n    errorMsg: v.message,\n    stack: v.stack,\n    ...('cause' in v ? {cause: errorOrObject(v.cause)} : null),\n  };\n}\n\nfunction stringifyContext(context: Context | undefined): unknown[] {\n  const args = [];\n  for (const [k, v] of Object.entries(context ?? {})) {\n    const arg = v === undefined ? k : `${k}=${v}`;\n    args.push(arg);\n  }\n  return args;\n}\n\nfunction stringifyValue(v: unknown) {\n  if (typeof v === 'string') {\n    return v;\n  }\n  if (v instanceof Error) {\n    return stringify(toErrorLogObject(v));\n  }\n  return stringify(v);\n}\n"],"mappings":";;;;;AAgBA,SAAS,MAAM,OAAkC,MAAiB;AAChE,QAAO,UAAU,OAAO,KAAK,KAAK,IAAI,CAAC;;AAGzC,IAAM,cAAc;AACpB,IAAM,aAAa;AACnB,IAAM,cAAc;;;;;AAMpB,IAAa,eAAe;CAC1B,MAAM,GAAG,SAAoB;AAC3B,UAAQ,IAAI,GAAG,KAAK;;CAEtB,QAAQ,GAAG,SAAoB;AAC7B,UAAQ,MAAM,MAAM,aAAa,KAAK,CAAC;;CAEzC,OAAO,GAAG,SAAoB;AAC5B,UAAQ,KAAK,GAAG,KAAK;;CAEvB,OAAO,GAAG,SAAoB;AAC5B,UAAQ,KAAK,MAAM,YAAY,KAAK,CAAC;;CAEvC,QAAQ,GAAG,SAAoB;AAC7B,UAAQ,MAAM,MAAM,aAAa,KAAK,CAAC;;CAE1C;AAED,IAAa,cAAuB,EAClC,IAAI,OAAO,SAAS,GAAG,MAAM;AAC3B,cAAa,OACX,kBAAkB,EAClB,iBAAiB,QAAQ,EACzB,GAAG,KAAK,IAAI,eAAe,CAC5B;GAEJ;AAED,SAAS,iBAAiB,uBAAO,IAAI,MAAM,EAAE;CAC3C,MAAM,MAAM,CAAC,KAAK,mBAAmB;CACrC,MAAM,OAAO,OAAO,IAAI,MAAM;CAC9B,MAAM,OAAO,GAAW,MAAM,MAAM,OAAO,KAAK,IAAI,EAAE,CAAC,CAAC,SAAS,KAAK,IAAI;AAE1E,QACE,KAAK,aAAa,GAClB,MACA,IAAI,KAAK,UAAU,GAAG,EAAE,GACxB,MACA,IAAI,KAAK,SAAS,CAAC,GACnB,MACA,IAAI,KAAK,UAAU,CAAC,GACpB,MACA,IAAI,KAAK,YAAY,CAAC,GACtB,MACA,IAAI,KAAK,YAAY,CAAC,GACtB,MACA,IAAI,KAAK,iBAAiB,EAAE,EAAE,GAC9B,OACA,IAAI,MAAM,GAAG,GACb,MACA,IAAI,MAAM,GAAG;;AAIjB,SAAgB,WAAW,QAA4B;AACrD,QAAO,OAAO,WAAW,SAAS,qBAAqB;;AAGzD,SAAgB,iBACd,EAAC,OACD,UAAU,EAAE,EACZ,OAAO,WAAW,IAAI,EACV;CACZ,MAAM,MAAM;EAAC;EAAK,GAAG;EAAQ;CAC7B,MAAM,KAAK,IAAI,WAAW,IAAI,OAAO,KAAK,KAAK;AAG/C,IAAG,OAAO,GAAG;AACb,QAAO;;AAGT,IAAM,qBAA8B,EAClC,IAAI,OAAiB,SAA8B,GAAG,MAAuB;CAE3E,MAAM,UAAU,cAAc,KAAK,GAAG,GAAG,CAAC;AAC1C,KAAI,QACF,MAAK,KAAK;CAEZ,MAAM,UAAU,KAAK,SACjB,EACE,SAAS,KAAK,IAAI,eAAe,CAAC,KAAK,IAAI,EAC5C,GACD,KAAA;AAEJ,SAAQ,OACN,UAAU;EACR,OAAO,MAAM,aAAa;EAC1B,GAAG;EACH,GAAG;EACH,GAAG;EACJ,CAAC,CACH;GAEJ;AAED,SAAgB,cAAc,GAAgC;AAC5D,KAAI,aAAa,MACf,QAAO,iBAAiB,EAAE;AAE5B,KAAI,KAAK,OAAO,MAAM,SACpB,QAAO;;AAKX,SAAS,iBAAiB,GAAU;AAClC,QAAO;EACL,GAAG;EACH,MAAM,EAAE;EACR,UAAU,EAAE;EACZ,OAAO,EAAE;EACT,GAAI,WAAW,IAAI,EAAC,OAAO,cAAc,EAAE,MAAM,EAAC,GAAG;EACtD;;AAGH,SAAS,iBAAiB,SAAyC;CACjE,MAAM,OAAO,EAAE;AACf,MAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,WAAW,EAAE,CAAC,EAAE;EAClD,MAAM,MAAM,MAAM,KAAA,IAAY,IAAI,GAAG,EAAE,GAAG;AAC1C,OAAK,KAAK,IAAI;;AAEhB,QAAO;;AAGT,SAAS,eAAe,GAAY;AAClC,KAAI,OAAO,MAAM,SACf,QAAO;AAET,KAAI,aAAa,MACf,QAAO,UAAU,iBAAiB,EAAE,CAAC;AAEvC,QAAO,UAAU,EAAE"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"must.js","names":[],"sources":["../../../../shared/src/must.ts"],"sourcesContent":["export function must<T>(v: T | undefined | null, msg?: string): T {\n  // oxlint-disable-next-line eqeqeq\n  if (v == null) {\n    throw new Error(msg ?? `Unexpected ${v} value`);\n  }\n  return v;\n}\n"],"mappings":";AAAA,SAAgB,KAAQ,GAAyB,KAAiB;AAEhE,KAAI,KAAK,KACP,OAAM,IAAI,MAAM,OAAO,cAAc,EAAE,QAAQ;AAEjD,QAAO"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"navigator.js","names":[],"sources":["../../../../shared/src/navigator.ts"],"sourcesContent":["type Navigator = {\n  onLine: boolean;\n  userAgent: string;\n  // add more as needed\n};\n\nconst localNavigator: Navigator | undefined =\n  typeof navigator !== 'undefined' ? navigator : undefined;\n\nexport {localNavigator as navigator};\n"],"mappings":";AAMA,IAAM,iBACJ,OAAO,cAAc,cAAc,YAAY,KAAA"}

package/out/shared/src/object-traversal.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"object-traversal.js","names":[],"sources":["../../../../shared/src/object-traversal.ts"],"sourcesContent":["type Split<\n  S extends string,\n  Sep extends string,\n> = S extends `${infer Head}${Sep}${infer Tail}`\n  ? [Head, ...Split<Tail, Sep>]\n  : S extends ''\n    ? []\n    : [S];\n\ntype GetAtPath<T, Parts extends readonly string[]> = Parts extends readonly [\n  infer Head extends string,\n  ...infer Tail extends readonly string[],\n]\n  ? Head extends keyof T\n    ? GetAtPath<T[Head], Tail>\n    : undefined\n  : T;\n\ntype ValueAtPath<Path extends string, T, Sep extends string> = GetAtPath<\n  T,\n  Split<Path, Sep>\n>;\n\nexport function getValueAtPath(obj: object, path: string, sep: RegExp): unknown;\nexport function getValueAtPath<\n  const Path extends string,\n  const T extends object,\n  const Sep extends string,\n>(obj: T, path: Path, sep: Sep): ValueAtPath<Path, T, Sep>;\nexport function getValueAtPath(\n  obj: object,\n  path: string,\n  sep: string | RegExp,\n): unknown {\n  const parts = path.split(sep);\n  let current: unknown = obj;\n  for (const part of parts) {\n    if (current && typeof current === 'object' && part in current) {\n      current = (current as Record<string, unknown>)[part];\n    } else {\n      return undefined;\n    }\n  }\n  return current;\n}\n\n/**\n * Recursively iterates over all leaf values in a nested object tree.\n * A value is considered a leaf if `isLeaf(value)` returns true,\n * or if it's not a plain object.\n *\n * @param obj - The object to iterate over\n * @param isLeaf - A function that returns true if a value should be yielded as a leaf\n */\nexport function* iterateLeaves<T>(\n  obj: object,\n  isLeaf: (value: unknown) => value is T,\n): Iterable<T> {\n  for (const key of Object.keys(obj)) {\n    const value = (obj as Record<string, unknown>)[key];\n    if (isLeaf(value)) {\n      yield value;\n    } else if (value && typeof value === 'object') {\n      yield* iterateLeaves(value, isLeaf);\n    }\n  }\n}\n"],"mappings":";AA6BA,SAAgB,eACd,KACA,MACA,KACS;CACT,MAAM,QAAQ,KAAK,MAAM,IAAI;CAC7B,IAAI,UAAmB;AACvB,MAAK,MAAM,QAAQ,MACjB,KAAI,WAAW,OAAO,YAAY,YAAY,QAAQ,QACpD,WAAW,QAAoC;KAE/C;AAGJ,QAAO;;;;;;;;;;AAWT,UAAiB,cACf,KACA,QACa;AACb,MAAK,MAAM,OAAO,OAAO,KAAK,IAAI,EAAE;EAClC,MAAM,QAAS,IAAgC;AAC/C,MAAI,OAAO,MAAM,CACf,OAAM;WACG,SAAS,OAAO,UAAU,SACnC,QAAO,cAAc,OAAO,OAAO"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"objects.js","names":[],"sources":["../../../../shared/src/objects.ts"],"sourcesContent":["export function mapValues<T extends Record<string, unknown>, U>(\n  input: T,\n  mapper: (value: T[keyof T]) => U,\n): {[K in keyof T]: U} {\n  return mapEntries(input, (k, v) => [k, mapper(v as T[keyof T])]) as {\n    [K in keyof T]: U;\n  };\n}\n\nexport function mapEntries<T, U>(\n  input: Record<string, T>,\n  mapper: (key: string, val: T) => [key: string, val: U],\n): Record<string, U> {\n  // Direct assignment is faster than Object.fromEntries()\n  // https://github.com/rocicorp/mono/pull/3927#issuecomment-2706059475\n  const output: Record<string, U> = {};\n\n  // In chrome Object.entries is faster than for-in (13x) or Object.keys (15x)\n  // https://gist.github.com/arv/1b4e113724f6a14e2d4742bcc760d1fa\n  for (const entry of Object.entries(input)) {\n    const mapped = mapper(entry[0], entry[1]);\n    output[mapped[0]] = mapped[1];\n  }\n  return output;\n}\n\nexport function mapAllEntries<T, U>(\n  input: Record<string, T>,\n  mapper: (entries: [key: string, val: T][]) => [key: string, val: U][],\n): Record<string, U> {\n  // Direct assignment is faster than Object.fromEntries()\n  // https://github.com/rocicorp/mono/pull/3927#issuecomment-2706059475\n  const output: Record<string, U> = {};\n  for (const mapped of mapper(Object.entries(input))) {\n    output[mapped[0]] = mapped[1];\n  }\n  return output;\n}\n"],"mappings":";AAAA,SAAgB,UACd,OACA,QACqB;AACrB,QAAO,WAAW,QAAQ,GAAG,MAAM,CAAC,GAAG,OAAO,EAAgB,CAAC,CAAC;;AAKlE,SAAgB,WACd,OACA,QACmB;CAGnB,MAAM,SAA4B,EAAE;AAIpC,MAAK,MAAM,SAAS,OAAO,QAAQ,MAAM,EAAE;EACzC,MAAM,SAAS,OAAO,MAAM,IAAI,MAAM,GAAG;AACzC,SAAO,OAAO,MAAM,OAAO;;AAE7B,QAAO;;AAGT,SAAgB,cACd,OACA,QACmB;CAGnB,MAAM,SAA4B,EAAE;AACpC,MAAK,MAAM,UAAU,OAAO,OAAO,QAAQ,MAAM,CAAC,CAChD,QAAO,OAAO,MAAM,OAAO;AAE7B,QAAO"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"options.js","names":[],"sources":["../../../../shared/src/options.ts"],"sourcesContent":["import {stripVTControlCharacters as stripAnsi} from 'node:util';\nimport type {OptionalLogger} from '@rocicorp/logger';\nimport {template} from 'chalk-template';\nimport type {OptionDefinition} from 'command-line-args';\nimport commandLineArgs from 'command-line-args';\nimport commandLineUsage, {type Section} from 'command-line-usage';\nimport {createDefu} from 'defu';\nimport {toKebabCase, toSnakeCase} from 'kasi';\nimport {assert} from './asserts.ts';\nimport {must} from './must.ts';\nimport type {\n  Config,\n  Group,\n  Option,\n  Options,\n  WrappedOptionType,\n} from './options-types.ts';\nimport * as v from './valita.ts';\n\nexport type {Config, Group, Option, Options, WrappedOptionType};\n\ntype Primitive = number | string | boolean;\ntype Value = Primitive | Array<Primitive>;\n\ntype RequiredOptionType =\n  | v.Type<string>\n  | v.Type<number>\n  | v.Type<boolean>\n  | v.Type<string[]>\n  | v.Type<number[]>\n  | v.Type<boolean[]>;\n\ntype OptionalOptionType =\n  | v.Optional<string>\n  | v.Optional<number>\n  | v.Optional<boolean>\n  | v.Optional<string[]>\n  | v.Optional<number[]>\n  | v.Optional<boolean[]>;\n\ntype OptionType = RequiredOptionType | OptionalOptionType;\n\n/**\n * Creates a defu instance that overrides arrays instead of merging them.\n */\nconst defu = createDefu((obj, key, value) => {\n  if (!Array.isArray(value)) return;\n\n  obj[key] = value;\n  return true;\n});\n\n/**\n * Converts an Options instance into its corresponding {@link Config} schema.\n */\nfunction configSchema<T extends Options>(\n  options: T,\n  envNamePrefix: string,\n): v.Type<Config<T>> {\n  function makeObjectType(options: Options | Group, group?: string) {\n    return v.object(\n      Object.fromEntries(\n        Object.entries(options).map(\n          ([name, value]): [string, OptionType | v.Type] => {\n            const addErrorMessage = (t: OptionType) => {\n              const {required} = getRequiredOrDefault(t);\n              if (required) {\n                // Adds an error message for required options that includes the\n                // actual name of the option.\n                const optionName = toSnakeCase(\n                  `${envNamePrefix}${group ? group + '_' : ''}${name}`,\n                ).toUpperCase();\n                return (t as v.Type<string>)\n                  .optional()\n                  .assert(\n                    val => val !== undefined,\n                    `Missing required option ${optionName}`,\n                  );\n              }\n              return t;\n            };\n            // OptionType\n            if (v.instanceOfAbstractType(value)) {\n              return [name, addErrorMessage(value)];\n            }\n            // WrappedOptionType\n            const {type} = value;\n            if (v.instanceOfAbstractType(type)) {\n              return [name, addErrorMessage(type)];\n            }\n            // OptionGroup\n            return [name, makeObjectType(value as Group, name)];\n          },\n        ),\n      ),\n    );\n  }\n  return makeObjectType(options) as v.Type<Config<T>>;\n}\n\n/**\n * Converts an Options instance into an \"env schema\", which is an object with\n * ENV names as its keys, mapped to optional or required string values\n * (corresponding to the optionality of the corresponding options).\n *\n * This is used as a format for encoding options for a multi-tenant version\n * of an app, with an envSchema for each tenant.\n */\nexport function envSchema<T extends Options>(options: T, envNamePrefix = '') {\n  const fields: [string, v.Type<string> | v.Optional<string>][] = [];\n\n  function addField(name: string, type: OptionType, group?: string) {\n    const flag = group ? `${group}_${name}` : name;\n    const env = toSnakeCase(`${envNamePrefix}${flag}`).toUpperCase();\n\n    const {required} = getRequiredOrDefault(type);\n    fields.push([env, required ? v.string() : v.string().optional()]);\n  }\n\n  function addFields(o: Options | Group, group?: string) {\n    Object.entries(o).forEach(([name, value]) => {\n      // OptionType\n      if (v.instanceOfAbstractType(value)) {\n        addField(name, value, group);\n        return;\n      }\n      // WrappedOptionType\n      const {type} = value;\n      if (v.instanceOfAbstractType(type)) {\n        addField(name, type, group);\n        return;\n      }\n      // OptionGroup\n      addFields(value as Group, name);\n    });\n  }\n\n  addFields(options);\n\n  return v.object(Object.fromEntries(fields));\n}\n\n// type TerminalType is not exported from badrap/valita\ntype TerminalType = Parameters<\n  Parameters<v.Type<unknown>['toTerminals']>[0]\n>[0];\n\nfunction getRequiredOrDefault(type: OptionType) {\n  const defaultResult = v.testOptional<Value>(undefined, type);\n  return {\n    required: !defaultResult.ok,\n    defaultValue: defaultResult.ok ? defaultResult.value : undefined,\n  };\n}\n\nexport type ParseOptions = {\n  /** Defaults to process.argv.slice(2) */\n  argv?: string[];\n\n  envNamePrefix?: string;\n\n  description?: {header: string; content: string}[];\n\n  /** Defaults to `false` */\n  allowUnknown?: boolean;\n\n  /** Defaults to `false` */\n  allowPartial?: boolean;\n\n  /** Defaults to `process.env`. */\n  env?: NodeJS.ProcessEnv;\n\n  /** Defaults to `true`. */\n  emitDeprecationWarnings?: boolean;\n\n  /** Defaults to `true`. When false, excludes default values from both config and env return values. */\n  includeDefaults?: boolean;\n\n  /** Defaults to `console` */\n  logger?: OptionalLogger;\n\n  /** Defaults to `process.exit` */\n  exit?: (code?: number | string | null) => never;\n};\n\nexport function parseOptions<T extends Options>(\n  appOptions: T,\n  opts: ParseOptions = {},\n): Config<T> {\n  return parseOptionsAdvanced(appOptions, opts).config;\n}\n\nexport function parseOptionsAdvanced<T extends Options>(\n  appOptions: T,\n  opts: ParseOptions = {},\n): {config: Config<T>; env: Record<string, string>; unknown?: string[]} {\n  const {\n    argv = process.argv.slice(2),\n    envNamePrefix = '',\n    description = [],\n    allowUnknown = false,\n    allowPartial = false,\n    env: processEnv = process.env,\n    emitDeprecationWarnings = true,\n    includeDefaults = true,\n    logger = console,\n    exit = process.exit,\n  } = opts;\n  // The main logic for converting a valita Type spec to an Option (i.e. flag) spec.\n  function addOption(field: string, option: WrappedOptionType, group?: string) {\n    const {type, desc = [], deprecated, alias, hidden} = option;\n\n    // The group name is prepended to the flag name.\n    const flag = group ? toKebabCase(`${group}-${field}`) : toKebabCase(field);\n\n    const {required, defaultValue} = getRequiredOrDefault(type);\n    let multiple = type.name === 'array';\n    const literals = new Set<string>();\n    const terminalTypes = new Set<string>();\n\n    type.toTerminals(getTerminalTypes);\n\n    function getTerminalTypes(t: TerminalType) {\n      switch (t.name) {\n        case 'undefined':\n        case 'optional':\n          break;\n        case 'array': {\n          multiple = true;\n          t.prefix.forEach(t => t.toTerminals(getTerminalTypes));\n          t.rest?.toTerminals(getTerminalTypes);\n          t.suffix.forEach(t => t.toTerminals(getTerminalTypes));\n          break;\n        }\n        case 'literal':\n          literals.add(String(t.value));\n          terminalTypes.add(typeof t.value);\n          break;\n        default:\n          terminalTypes.add(t.name);\n          break;\n      }\n    }\n    const env = toSnakeCase(`${envNamePrefix}${flag}`).toUpperCase();\n    if (terminalTypes.size > 1) {\n      throw new TypeError(`${env} has mixed types ${[...terminalTypes]}`);\n    }\n    assert(terminalTypes.size === 1, 'Expected exactly one terminal type');\n    const terminalType = [...terminalTypes][0];\n\n    if (processEnv[env]) {\n      if (multiple) {\n        // Technically not water-tight; assumes values for the string[] flag don't contain commas.\n        envArgv.push(`--${flag}`, ...processEnv[env].split(','));\n      } else {\n        envArgv.push(`--${flag}`, processEnv[env]);\n      }\n    }\n    names.set(flag, {field, env});\n\n    const spec = [\n      (required\n        ? '{italic required}'\n        : defaultValue !== undefined\n          ? `default: ${JSON.stringify(defaultValue)}`\n          : 'optional') + '\\n',\n    ];\n    if (desc) {\n      spec.push(...desc);\n    }\n\n    const typeLabel = [\n      literals.size\n        ? String(Array.from(literals, l => `{underline ${l}}`))\n        : multiple\n          ? `{underline ${terminalType}[]}`\n          : `{underline ${terminalType}}`,\n      `  ${env} env`,\n    ];\n\n    const opt = {\n      name: flag,\n      alias,\n      type: valueParser(\n        env,\n        terminalType,\n        logger,\n        emitDeprecationWarnings ? deprecated : undefined,\n      ),\n      multiple,\n      group,\n      description: spec.join('\\n') + '\\n',\n      typeLabel: typeLabel.join('\\n') + '\\n',\n      hidden: hidden === undefined ? deprecated !== undefined : hidden,\n    };\n    optsWithoutDefaults.push(opt);\n    optsWithDefaults.push({...opt, defaultValue});\n  }\n\n  const names = new Map<string, {field: string; env: string}>();\n  const optsWithDefaults: DescribedOptionDefinition[] = [];\n  const optsWithoutDefaults: DescribedOptionDefinition[] = [];\n  const envArgv: string[] = [];\n\n  try {\n    for (const [name, val] of Object.entries(appOptions)) {\n      const {type} = val as {type: unknown};\n      if (v.instanceOfAbstractType(val)) {\n        addOption(name, {type: val});\n      } else if (v.instanceOfAbstractType(type)) {\n        addOption(name, val as WrappedOptionType);\n      } else {\n        const group = name;\n        for (const [name, option] of Object.entries(val as Group)) {\n          const wrapped = v.instanceOfAbstractType(option)\n            ? {type: option}\n            : option;\n          addOption(name, wrapped, group);\n        }\n      }\n    }\n\n    const [defaults, env1, unknown] = parseArgs(optsWithDefaults, argv, names);\n    const [fromEnv, env2] = parseArgs(optsWithoutDefaults, envArgv, names);\n    const [withoutDefaults, env3] = parseArgs(optsWithoutDefaults, argv, names);\n\n    switch (unknown?.[0]) {\n      case undefined:\n        break;\n      case '--help':\n      case '-h':\n        showUsage(optsWithDefaults, description, logger);\n        exit(0);\n        break;\n      default:\n        if (!allowUnknown) {\n          logger.error?.('Invalid arguments:', unknown);\n          showUsage(optsWithDefaults, description, logger);\n          exit(0);\n        }\n        break;\n    }\n\n    const parsedArgs = includeDefaults\n      ? defu(withoutDefaults, fromEnv, defaults)\n      : defu(withoutDefaults, fromEnv);\n    const env = includeDefaults\n      ? {...env1, ...env2, ...env3}\n      : {...env2, ...env3};\n\n    let schema = configSchema(appOptions, envNamePrefix);\n    if (allowPartial || !includeDefaults) {\n      // TODO: Type configSchema() to return a v.ObjectType<...>\n      schema = v.deepPartial(schema as v.ObjectType) as v.Type<Config<T>>;\n    }\n    return {\n      config: v.parse(parsedArgs, schema),\n      env,\n      ...(unknown ? {unknown} : {}),\n    };\n  } catch (e) {\n    logger.error?.(String(e));\n    showUsage(optsWithDefaults, description, logger);\n    throw e;\n  }\n}\n\nfunction valueParser(\n  optionName: string,\n  typeName: string,\n  logger: OptionalLogger,\n  deprecated: string[] | undefined,\n) {\n  return (input: string) => {\n    if (deprecated) {\n      logger.warn?.(\n        template(\n          `\\n${optionName} is deprecated:\\n` + deprecated.join('\\n') + '\\n',\n        ),\n      );\n    }\n    switch (typeName) {\n      case 'string':\n        return input;\n      case 'boolean':\n        return parseBoolean(optionName, input);\n      case 'number': {\n        const val = Number(input);\n        if (Number.isNaN(val)) {\n          throw new TypeError(`Invalid input for ${optionName}: \"${input}\"`);\n        }\n        return val;\n      }\n      default:\n        // Should be impossible given the constraints of `Option`\n        throw new TypeError(\n          `${optionName} option has unsupported type ${typeName}`,\n        );\n    }\n  };\n}\n\nfunction parseArgs(\n  optionDefs: DescribedOptionDefinition[],\n  argv: string[],\n  names: Map<string, {field: string; env: string}>,\n) {\n  function normalizeFlagValue(value: unknown) {\n    // A --flag without value is parsed by commandLineArgs() to `null`,\n    // but this is a common convention to set a boolean flag to true.\n    return value === null ? true : value;\n  }\n\n  const {\n    _all,\n    _none: ungrouped,\n    _unknown: unknown,\n    ...config\n  } = commandLineArgs(optionDefs, {\n    argv,\n    partial: true,\n  });\n\n  // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n  const result: Record<string, any> = {};\n  const envObj: Record<string, string> = {};\n\n  function addFlag(flagName: string, value: unknown, group?: string) {\n    const {field, env} = must(names.get(flagName));\n    const normalized = normalizeFlagValue(value);\n    if (group) {\n      result[group][field] = normalized;\n    } else {\n      result[field] = normalized;\n    }\n    envObj[env] = String(normalized);\n  }\n\n  for (const [flagName, value] of Object.entries(ungrouped ?? {})) {\n    addFlag(flagName, value);\n  }\n\n  // Then handle (potentially) grouped flags\n  for (const [name, value] of Object.entries(config)) {\n    if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n      addFlag(name, value); // Flag, not a group\n    } else {\n      const group = name;\n      result[group] = {};\n      for (const [flagName, flagValue] of Object.entries(value)) {\n        addFlag(flagName, flagValue, group);\n      }\n    }\n  }\n\n  return [result, envObj, unknown] as const;\n}\n\nexport function flagToEnv(prefix: string, flag: string): string {\n  return toSnakeCase(prefix + flag).toUpperCase();\n}\n\nexport function parseBoolean(optionName: string, input: string) {\n  const bool = input.toLowerCase();\n  if (['true', '1'].includes(bool)) {\n    return true;\n  } else if (['false', '0'].includes(bool)) {\n    return false;\n  }\n  throw new TypeError(`Invalid input for ${optionName}: \"${input}\"`);\n}\n\nfunction showUsage(\n  optionList: DescribedOptionDefinition[],\n  description: {header: string; content: string}[] = [],\n  logger: OptionalLogger = console,\n) {\n  const hide: string[] = [];\n  let leftWidth = 35;\n  let rightWidth = 70;\n  optionList.forEach(({name, typeLabel, description, hidden}) => {\n    if (hidden) {\n      hide.push(name);\n    }\n    const text = template(`${name} ${typeLabel ?? ''}`);\n    const lines = stripAnsi(text).split('\\n');\n    for (const l of lines) {\n      leftWidth = Math.max(leftWidth, l.length + 2);\n    }\n    const desc = stripAnsi(template(description ?? '')).split('\\n');\n    for (const l of desc) {\n      rightWidth = Math.max(rightWidth, l.length + 2);\n    }\n  });\n\n  const sections: Section[] = [\n    {\n      optionList,\n      reverseNameOrder: true, // Display --flag-name before -alias\n      hide,\n      tableOptions: {\n        columns: [\n          {name: 'option', width: leftWidth},\n          {name: 'description', width: rightWidth},\n        ],\n        noTrim: true,\n      },\n    },\n  ];\n\n  if (description) {\n    sections.unshift(...description);\n  }\n\n  logger.info?.(commandLineUsage(sections));\n}\n\ntype DescribedOptionDefinition = OptionDefinition & {\n  // Additional fields recognized by command-line-usage\n  description?: string;\n  typeLabel?: string | undefined;\n  hidden?: boolean | undefined;\n};\n"],"mappings":";;;;;;;;;;;;;AA6CA,IAAM,SAAO,YAAY,KAAK,KAAK,UAAU;AAC3C,KAAI,CAAC,MAAM,QAAQ,MAAM,CAAE;AAE3B,KAAI,OAAO;AACX,QAAO;EACP;;;;AAKF,SAAS,aACP,SACA,eACmB;CACnB,SAAS,eAAe,SAA0B,OAAgB;AAChE,SAAO,eAAE,OACP,OAAO,YACL,OAAO,QAAQ,QAAQ,CAAC,KACrB,CAAC,MAAM,WAA0C;GAChD,MAAM,mBAAmB,MAAkB;IACzC,MAAM,EAAC,aAAY,qBAAqB,EAAE;AAC1C,QAAI,UAAU;KAGZ,MAAM,aAAa,YACjB,GAAG,gBAAgB,QAAQ,QAAQ,MAAM,KAAK,OAC/C,CAAC,aAAa;AACf,YAAQ,EACL,UAAU,CACV,QACC,QAAO,QAAQ,KAAA,GACf,2BAA2B,aAC5B;;AAEL,WAAO;;AAGT,OAAI,uBAAyB,MAAM,CACjC,QAAO,CAAC,MAAM,gBAAgB,MAAM,CAAC;GAGvC,MAAM,EAAC,SAAQ;AACf,OAAI,uBAAyB,KAAK,CAChC,QAAO,CAAC,MAAM,gBAAgB,KAAK,CAAC;AAGtC,UAAO,CAAC,MAAM,eAAe,OAAgB,KAAK,CAAC;IAEtD,CACF,CACF;;AAEH,QAAO,eAAe,QAAQ;;AAkDhC,SAAS,qBAAqB,MAAkB;CAC9C,MAAM,gBAAgB,aAAsB,KAAA,GAAW,KAAK;AAC5D,QAAO;EACL,UAAU,CAAC,cAAc;EACzB,cAAc,cAAc,KAAK,cAAc,QAAQ,KAAA;EACxD;;AAiCH,SAAgB,aACd,YACA,OAAqB,EAAE,EACZ;AACX,QAAO,qBAAqB,YAAY,KAAK,CAAC;;AAGhD,SAAgB,qBACd,YACA,OAAqB,EAAE,EAC+C;CACtE,MAAM,EACJ,OAAO,QAAQ,KAAK,MAAM,EAAE,EAC5B,gBAAgB,IAChB,cAAc,EAAE,EAChB,eAAe,OACf,eAAe,OACf,KAAK,aAAa,QAAQ,KAC1B,0BAA0B,MAC1B,kBAAkB,MAClB,SAAS,SACT,OAAO,QAAQ,SACb;CAEJ,SAAS,UAAU,OAAe,QAA2B,OAAgB;EAC3E,MAAM,EAAC,MAAM,OAAO,EAAE,EAAE,YAAY,OAAO,WAAU;EAGrD,MAAM,OAAO,QAAQ,YAAY,GAAG,MAAM,GAAG,QAAQ,GAAG,YAAY,MAAM;EAE1E,MAAM,EAAC,UAAU,iBAAgB,qBAAqB,KAAK;EAC3D,IAAI,WAAW,KAAK,SAAS;EAC7B,MAAM,2BAAW,IAAI,KAAa;EAClC,MAAM,gCAAgB,IAAI,KAAa;AAEvC,OAAK,YAAY,iBAAiB;EAElC,SAAS,iBAAiB,GAAiB;AACzC,WAAQ,EAAE,MAAV;IACE,KAAK;IACL,KAAK,WACH;IACF,KAAK;AACH,gBAAW;AACX,OAAE,OAAO,SAAQ,MAAK,EAAE,YAAY,iBAAiB,CAAC;AACtD,OAAE,MAAM,YAAY,iBAAiB;AACrC,OAAE,OAAO,SAAQ,MAAK,EAAE,YAAY,iBAAiB,CAAC;AACtD;IAEF,KAAK;AACH,cAAS,IAAI,OAAO,EAAE,MAAM,CAAC;AAC7B,mBAAc,IAAI,OAAO,EAAE,MAAM;AACjC;IACF;AACE,mBAAc,IAAI,EAAE,KAAK;AACzB;;;EAGN,MAAM,MAAM,YAAY,GAAG,gBAAgB,OAAO,CAAC,aAAa;AAChE,MAAI,cAAc,OAAO,EACvB,OAAM,IAAI,UAAU,GAAG,IAAI,mBAAmB,CAAC,GAAG,cAAc,GAAG;AAErE,SAAO,cAAc,SAAS,GAAG,qCAAqC;EACtE,MAAM,eAAe,CAAC,GAAG,cAAc,CAAC;AAExC,MAAI,WAAW,KACb,KAAI,SAEF,SAAQ,KAAK,KAAK,QAAQ,GAAG,WAAW,KAAK,MAAM,IAAI,CAAC;MAExD,SAAQ,KAAK,KAAK,QAAQ,WAAW,KAAK;AAG9C,QAAM,IAAI,MAAM;GAAC;GAAO;GAAI,CAAC;EAE7B,MAAM,OAAO,EACV,WACG,sBACA,iBAAiB,KAAA,IACf,YAAY,KAAK,UAAU,aAAa,KACxC,cAAc,KACrB;AACD,MAAI,KACF,MAAK,KAAK,GAAG,KAAK;EAGpB,MAAM,YAAY,CAChB,SAAS,OACL,OAAO,MAAM,KAAK,WAAU,MAAK,cAAc,EAAE,GAAG,CAAC,GACrD,WACE,cAAc,aAAa,OAC3B,cAAc,aAAa,IACjC,KAAK,IAAI,MACV;EAED,MAAM,MAAM;GACV,MAAM;GACN;GACA,MAAM,YACJ,KACA,cACA,QACA,0BAA0B,aAAa,KAAA,EACxC;GACD;GACA;GACA,aAAa,KAAK,KAAK,KAAK,GAAG;GAC/B,WAAW,UAAU,KAAK,KAAK,GAAG;GAClC,QAAQ,WAAW,KAAA,IAAY,eAAe,KAAA,IAAY;GAC3D;AACD,sBAAoB,KAAK,IAAI;AAC7B,mBAAiB,KAAK;GAAC,GAAG;GAAK;GAAa,CAAC;;CAG/C,MAAM,wBAAQ,IAAI,KAA2C;CAC7D,MAAM,mBAAgD,EAAE;CACxD,MAAM,sBAAmD,EAAE;CAC3D,MAAM,UAAoB,EAAE;AAE5B,KAAI;AACF,OAAK,MAAM,CAAC,MAAM,QAAQ,OAAO,QAAQ,WAAW,EAAE;GACpD,MAAM,EAAC,SAAQ;AACf,OAAI,uBAAyB,IAAI,CAC/B,WAAU,MAAM,EAAC,MAAM,KAAI,CAAC;YACnB,uBAAyB,KAAK,CACvC,WAAU,MAAM,IAAyB;QACpC;IACL,MAAM,QAAQ;AACd,SAAK,MAAM,CAAC,MAAM,WAAW,OAAO,QAAQ,IAAa,CAIvD,WAAU,MAHM,uBAAyB,OAAO,GAC5C,EAAC,MAAM,QAAO,GACd,QACqB,MAAM;;;EAKrC,MAAM,CAAC,UAAU,MAAM,WAAW,UAAU,kBAAkB,MAAM,MAAM;EAC1E,MAAM,CAAC,SAAS,QAAQ,UAAU,qBAAqB,SAAS,MAAM;EACtE,MAAM,CAAC,iBAAiB,QAAQ,UAAU,qBAAqB,MAAM,MAAM;AAE3E,UAAQ,UAAU,IAAlB;GACE,KAAK,KAAA,EACH;GACF,KAAK;GACL,KAAK;AACH,cAAU,kBAAkB,aAAa,OAAO;AAChD,SAAK,EAAE;AACP;GACF;AACE,QAAI,CAAC,cAAc;AACjB,YAAO,QAAQ,sBAAsB,QAAQ;AAC7C,eAAU,kBAAkB,aAAa,OAAO;AAChD,UAAK,EAAE;;AAET;;EAGJ,MAAM,aAAa,kBACf,OAAK,iBAAiB,SAAS,SAAS,GACxC,OAAK,iBAAiB,QAAQ;EAClC,MAAM,MAAM,kBACR;GAAC,GAAG;GAAM,GAAG;GAAM,GAAG;GAAK,GAC3B;GAAC,GAAG;GAAM,GAAG;GAAK;EAEtB,IAAI,SAAS,aAAa,YAAY,cAAc;AACpD,MAAI,gBAAgB,CAAC,gBAEnB,UAAS,YAAc,OAAuB;AAEhD,SAAO;GACL,QAAQ,MAAQ,YAAY,OAAO;GACnC;GACA,GAAI,UAAU,EAAC,SAAQ,GAAG,EAAE;GAC7B;UACM,GAAG;AACV,SAAO,QAAQ,OAAO,EAAE,CAAC;AACzB,YAAU,kBAAkB,aAAa,OAAO;AAChD,QAAM;;;AAIV,SAAS,YACP,YACA,UACA,QACA,YACA;AACA,SAAQ,UAAkB;AACxB,MAAI,WACF,QAAO,OACL,SACE,KAAK,WAAW,qBAAqB,WAAW,KAAK,KAAK,GAAG,KAC9D,CACF;AAEH,UAAQ,UAAR;GACE,KAAK,SACH,QAAO;GACT,KAAK,UACH,QAAO,aAAa,YAAY,MAAM;GACxC,KAAK,UAAU;IACb,MAAM,MAAM,OAAO,MAAM;AACzB,QAAI,OAAO,MAAM,IAAI,CACnB,OAAM,IAAI,UAAU,qBAAqB,WAAW,KAAK,MAAM,GAAG;AAEpE,WAAO;;GAET,QAEE,OAAM,IAAI,UACR,GAAG,WAAW,+BAA+B,WAC9C;;;;AAKT,SAAS,UACP,YACA,MACA,OACA;CACA,SAAS,mBAAmB,OAAgB;AAG1C,SAAO,UAAU,OAAO,OAAO;;CAGjC,MAAM,EACJ,MACA,OAAO,WACP,UAAU,SACV,GAAG,WACD,gBAAgB,YAAY;EAC9B;EACA,SAAS;EACV,CAAC;CAGF,MAAM,SAA8B,EAAE;CACtC,MAAM,SAAiC,EAAE;CAEzC,SAAS,QAAQ,UAAkB,OAAgB,OAAgB;EACjE,MAAM,EAAC,OAAO,QAAO,KAAK,MAAM,IAAI,SAAS,CAAC;EAC9C,MAAM,aAAa,mBAAmB,MAAM;AAC5C,MAAI,MACF,QAAO,OAAO,SAAS;MAEvB,QAAO,SAAS;AAElB,SAAO,OAAO,OAAO,WAAW;;AAGlC,MAAK,MAAM,CAAC,UAAU,UAAU,OAAO,QAAQ,aAAa,EAAE,CAAC,CAC7D,SAAQ,UAAU,MAAM;AAI1B,MAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,OAAO,CAChD,KAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,MAAM,CACrE,SAAQ,MAAM,MAAM;MACf;EACL,MAAM,QAAQ;AACd,SAAO,SAAS,EAAE;AAClB,OAAK,MAAM,CAAC,UAAU,cAAc,OAAO,QAAQ,MAAM,CACvD,SAAQ,UAAU,WAAW,MAAM;;AAKzC,QAAO;EAAC;EAAQ;EAAQ;EAAQ;;AAGlC,SAAgB,UAAU,QAAgB,MAAsB;AAC9D,QAAO,YAAY,SAAS,KAAK,CAAC,aAAa;;AAGjD,SAAgB,aAAa,YAAoB,OAAe;CAC9D,MAAM,OAAO,MAAM,aAAa;AAChC,KAAI,CAAC,QAAQ,IAAI,CAAC,SAAS,KAAK,CAC9B,QAAO;UACE,CAAC,SAAS,IAAI,CAAC,SAAS,KAAK,CACtC,QAAO;AAET,OAAM,IAAI,UAAU,qBAAqB,WAAW,KAAK,MAAM,GAAG;;AAGpE,SAAS,UACP,YACA,cAAmD,EAAE,EACrD,SAAyB,SACzB;CACA,MAAM,OAAiB,EAAE;CACzB,IAAI,YAAY;CAChB,IAAI,aAAa;AACjB,YAAW,SAAS,EAAC,MAAM,WAAW,aAAa,aAAY;AAC7D,MAAI,OACF,MAAK,KAAK,KAAK;EAGjB,MAAM,QAAQ,yBADD,SAAS,GAAG,KAAK,GAAG,aAAa,KAAK,CACtB,CAAC,MAAM,KAAK;AACzC,OAAK,MAAM,KAAK,MACd,aAAY,KAAK,IAAI,WAAW,EAAE,SAAS,EAAE;EAE/C,MAAM,OAAO,yBAAU,SAAS,eAAe,GAAG,CAAC,CAAC,MAAM,KAAK;AAC/D,OAAK,MAAM,KAAK,KACd,cAAa,KAAK,IAAI,YAAY,EAAE,SAAS,EAAE;GAEjD;CAEF,MAAM,WAAsB,CAC1B;EACE;EACA,kBAAkB;EAClB;EACA,cAAc;GACZ,SAAS,CACP;IAAC,MAAM;IAAU,OAAO;IAAU,EAClC;IAAC,MAAM;IAAe,OAAO;IAAW,CACzC;GACD,QAAQ;GACT;EACF,CACF;AAED,KAAI,YACF,UAAS,QAAQ,GAAG,YAAY;AAGlC,QAAO,OAAO,iBAAiB,SAAS,CAAC"}

package/out/shared/src/parse-big-int.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parse-big-int.js","names":[],"sources":["../../../../shared/src/parse-big-int.ts"],"sourcesContent":["// Until there's BigInt.fromString(val, radix) ... https://github.com/tc39/proposal-number-fromstring\nexport function parseBigInt(val: string, radix: number): bigint {\n  const base = BigInt(radix);\n  let result = 0n;\n  for (let i = 0; i < val.length; i++) {\n    result *= base;\n    result += BigInt(parseInt(val[i], radix));\n  }\n  return result;\n}\n"],"mappings":";AACA,SAAgB,YAAY,KAAa,OAAuB;CAC9D,MAAM,OAAO,OAAO,MAAM;CAC1B,IAAI,SAAS;AACb,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,YAAU;AACV,YAAU,OAAO,SAAS,IAAI,IAAI,MAAM,CAAC;;AAE3C,QAAO"}

package/out/shared/src/promise-race.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"promise-race.js","names":[],"sources":["../../../../shared/src/promise-race.ts"],"sourcesContent":["type PromiseRaceResult<T extends Record<string, PromiseLike<unknown>>> = {\n  [K in Extract<keyof T, string>]: {\n    key: K;\n    status: 'fulfilled';\n    result: Awaited<T[K]>;\n  };\n}[Extract<keyof T, string>];\n\nconst NO_PROMISES_MESSAGE = 'No promises to race';\n\nconst wrapPromise = <K extends string, V>(\n  key: K,\n  promise: PromiseLike<V>,\n): Promise<{key: K; status: 'fulfilled'; result: V}> =>\n  Promise.resolve(promise).then(result => ({\n    key,\n    status: 'fulfilled' as const,\n    result,\n  }));\n\n/**\n * Race a record of promises and resolve with the first resolved entry.\n *\n * @param promises Record of promises to race.\n * @returns Promise resolving to a discriminated union of key/result pairs.\n * @throws An error if the record is empty or if a promise is rejected.\n */\nexport async function promiseRace<\n  T extends Record<string, PromiseLike<unknown>>,\n>(promises: T): Promise<PromiseRaceResult<T> & {}> {\n  const keys = Object.keys(promises) as Array<Extract<keyof T, string>>;\n\n  if (keys.length === 0) {\n    throw new Error(NO_PROMISES_MESSAGE);\n  }\n\n  const wrapped = keys.map(key =>\n    wrapPromise(key, promises[key] as PromiseLike<Awaited<T[typeof key]>>),\n  );\n\n  return await Promise.race(wrapped);\n}\n"],"mappings":";AAQA,IAAM,sBAAsB;AAE5B,IAAM,eACJ,KACA,YAEA,QAAQ,QAAQ,QAAQ,CAAC,MAAK,YAAW;CACvC;CACA,QAAQ;CACR;CACD,EAAE;;;;;;;;AASL,eAAsB,YAEpB,UAAiD;CACjD,MAAM,OAAO,OAAO,KAAK,SAAS;AAElC,KAAI,KAAK,WAAW,EAClB,OAAM,IAAI,MAAM,oBAAoB;CAGtC,MAAM,UAAU,KAAK,KAAI,QACvB,YAAY,KAAK,SAAS,KAA4C,CACvE;AAED,QAAO,MAAM,QAAQ,KAAK,QAAQ"}

package/out/shared/src/queue.js

@@ -1,126 +0,0 @@
-import { assert } from "./asserts.js";
-import { resolver } from "@rocicorp/resolver";
-//#region ../shared/src/queue.ts
-/**
-* A Queue allows the consumers to await (possibly future) values,
-* and producers to await the consumption of their values.
-*/
-var Queue = class {
-	#consumers = [];
-	#produced = [];
-	enqueue(value) {
-		const consumer = this.#consumers.shift();
-		if (consumer) {
-			consumer.resolver.resolve(value);
-			clearTimeout(consumer.timeoutID);
-			return;
-		}
-		this.#produced.push({ value });
-	}
-	enqueueRejection(reason) {
-		const consumer = this.#consumers.shift();
-		if (consumer) {
-			consumer.resolver.reject(reason);
-			clearTimeout(consumer.timeoutID);
-			return;
-		}
-		this.#produced.push({ rejection: reason });
-	}
-	/**
-	* Deletes all unconsumed entries matching the specified `value` based on identity equality.
-	* The consumed callback(s) are resolved as if the values were dequeued.
-	*
-	* Note: deletion of `undefined` values is not supported. This method will assert
-	* if `value` is undefined.
-	*
-	* @returns The number of entries deleted.
-	*/
-	delete(value) {
-		assert(value !== void 0, "Queue delete value must not be undefined");
-		let count = 0;
-		for (let i = this.#produced.length - 1; i >= 0; i--) if (this.#produced[i].value === value) {
-			this.#produced.splice(i, 1);
-			count++;
-		}
-		return count;
-	}
-	/**
-	* @param timeoutValue An optional value to resolve if `timeoutMs` is reached.
-	* @param timeoutMs The milliseconds after which the `timeoutValue` is resolved
-	*                  if nothing is produced for the consumer.
-	* @returns A Promise that resolves to the next enqueued value.
-	*/
-	dequeue(timeoutValue, timeoutMs = 0) {
-		const produced = this.#produced.shift();
-		if (produced) return produced.value ?? Promise.reject(produced.rejection);
-		const r = resolver();
-		const timeoutID = timeoutValue === void 0 ? void 0 : setTimeout(() => {
-			const i = this.#consumers.findIndex((c) => c.resolver === r);
-			if (i >= 0) {
-				const [consumer] = this.#consumers.splice(i, 1);
-				consumer.resolver.resolve(timeoutValue);
-			}
-		}, timeoutMs);
-		this.#consumers.push({
-			resolver: r,
-			timeoutID
-		});
-		return r.promise;
-	}
-	/**
-	* Drains the entire queue.
-	*
-	* Usage example:
-	* ```ts
-	* // A consumer that, when awoken, drains
-	* // all entries in the queue in order to
-	* // process them in a batch.
-	* for (;;) {
-	*   const value = await queue.dequeue();
-	*   const rest = queue.drain();
-	* }
-	* ```
-	*/
-	drain() {
-		const ret = [];
-		for (const p of this.#produced) ret.push(p.value);
-		this.#produced.length = 0;
-		return ret;
-	}
-	/**
-	* @returns The instantaneous number of outstanding values waiting to be
-	*          dequeued. Note that if a value was enqueued while a consumer
-	*          was waiting (with `await dequeue()`), the value is immediately
-	*          handed to the consumer and the Queue's size remains 0.
-	*/
-	size() {
-		return this.#produced.length;
-	}
-	asAsyncIterable(cleanup = NOOP) {
-		return { [Symbol.asyncIterator]: () => this.asAsyncIterator(cleanup) };
-	}
-	asAsyncIterator(cleanup = NOOP) {
-		return {
-			next: async () => {
-				try {
-					return { value: await this.dequeue() };
-				} catch (e) {
-					cleanup();
-					throw e;
-				}
-			},
-			return: (value) => {
-				cleanup();
-				return Promise.resolve({
-					value,
-					done: true
-				});
-			}
-		};
-	}
-};
-var NOOP = () => {};
-//#endregion
-export { Queue };
-
-//# sourceMappingURL=queue.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"queue.js","names":["#consumers","#produced"],"sources":["../../../../shared/src/queue.ts"],"sourcesContent":["import {resolver, type Resolver} from '@rocicorp/resolver';\nimport {assert} from './asserts.ts';\n\n/**\n * A Queue allows the consumers to await (possibly future) values,\n * and producers to await the consumption of their values.\n */\nexport class Queue<T> {\n  // Consumers waiting for entries to be produced.\n  readonly #consumers: Consumer<T>[] = [];\n  // Produced entries waiting to be consumed.\n  readonly #produced: Produced<T>[] = [];\n\n  enqueue(value: T): void {\n    const consumer = this.#consumers.shift();\n    if (consumer) {\n      consumer.resolver.resolve(value);\n      clearTimeout(consumer.timeoutID);\n      return;\n    }\n    this.#produced.push({value});\n  }\n\n  enqueueRejection(reason?: unknown): void {\n    const consumer = this.#consumers.shift();\n    if (consumer) {\n      consumer.resolver.reject(reason);\n      clearTimeout(consumer.timeoutID);\n      return;\n    }\n    this.#produced.push({rejection: reason});\n  }\n\n  /**\n   * Deletes all unconsumed entries matching the specified `value` based on identity equality.\n   * The consumed callback(s) are resolved as if the values were dequeued.\n   *\n   * Note: deletion of `undefined` values is not supported. This method will assert\n   * if `value` is undefined.\n   *\n   * @returns The number of entries deleted.\n   */\n  delete(value: T): number {\n    assert(value !== undefined, 'Queue delete value must not be undefined');\n\n    let count = 0;\n    for (let i = this.#produced.length - 1; i >= 0; i--) {\n      const p = this.#produced[i];\n      if (p.value === value) {\n        this.#produced.splice(i, 1);\n        count++;\n      }\n    }\n    return count;\n  }\n\n  /**\n   * @param timeoutValue An optional value to resolve if `timeoutMs` is reached.\n   * @param timeoutMs The milliseconds after which the `timeoutValue` is resolved\n   *                  if nothing is produced for the consumer.\n   * @returns A Promise that resolves to the next enqueued value.\n   */\n  dequeue(timeoutValue?: T, timeoutMs: number = 0): Promise<T> | T {\n    const produced = this.#produced.shift();\n    if (produced) {\n      return produced.value ?? Promise.reject(produced.rejection);\n    }\n    const r = resolver<T>();\n    const timeoutID =\n      timeoutValue === undefined\n        ? undefined\n        : setTimeout(() => {\n            const i = this.#consumers.findIndex(c => c.resolver === r);\n            if (i >= 0) {\n              const [consumer] = this.#consumers.splice(i, 1);\n              consumer.resolver.resolve(timeoutValue);\n            }\n          }, timeoutMs);\n    this.#consumers.push({resolver: r, timeoutID});\n    return r.promise;\n  }\n\n  /**\n   * Drains the entire queue.\n   *\n   * Usage example:\n   * ```ts\n   * // A consumer that, when awoken, drains\n   * // all entries in the queue in order to\n   * // process them in a batch.\n   * for (;;) {\n   *   const value = await queue.dequeue();\n   *   const rest = queue.drain();\n   * }\n   * ```\n   */\n  drain(): (T | undefined)[] {\n    const ret: (T | undefined)[] = [];\n    for (const p of this.#produced) {\n      ret.push(p.value);\n    }\n    this.#produced.length = 0;\n\n    return ret;\n  }\n\n  /**\n   * @returns The instantaneous number of outstanding values waiting to be\n   *          dequeued. Note that if a value was enqueued while a consumer\n   *          was waiting (with `await dequeue()`), the value is immediately\n   *          handed to the consumer and the Queue's size remains 0.\n   */\n  size(): number {\n    return this.#produced.length;\n  }\n\n  asAsyncIterable(cleanup = NOOP): AsyncIterable<T> {\n    return {[Symbol.asyncIterator]: () => this.asAsyncIterator(cleanup)};\n  }\n\n  asAsyncIterator(cleanup = NOOP): AsyncIterator<T> {\n    return {\n      next: async () => {\n        try {\n          const value = await this.dequeue();\n          return {value};\n        } catch (e) {\n          cleanup();\n          throw e;\n        }\n      },\n      return: value => {\n        cleanup();\n        return Promise.resolve({value, done: true});\n      },\n    };\n  }\n}\n\nconst NOOP = () => {};\n\ntype Consumer<T> = {\n  resolver: Resolver<T>;\n  timeoutID: ReturnType<typeof setTimeout> | undefined;\n};\n\ntype Produced<T> =\n  | {value: T; rejection?: undefined}\n  | {value?: undefined; rejection: unknown};\n"],"mappings":";;;;;;;AAOA,IAAa,QAAb,MAAsB;CAEpB,aAAqC,EAAE;CAEvC,YAAoC,EAAE;CAEtC,QAAQ,OAAgB;EACtB,MAAM,WAAW,MAAA,UAAgB,OAAO;AACxC,MAAI,UAAU;AACZ,YAAS,SAAS,QAAQ,MAAM;AAChC,gBAAa,SAAS,UAAU;AAChC;;AAEF,QAAA,SAAe,KAAK,EAAC,OAAM,CAAC;;CAG9B,iBAAiB,QAAwB;EACvC,MAAM,WAAW,MAAA,UAAgB,OAAO;AACxC,MAAI,UAAU;AACZ,YAAS,SAAS,OAAO,OAAO;AAChC,gBAAa,SAAS,UAAU;AAChC;;AAEF,QAAA,SAAe,KAAK,EAAC,WAAW,QAAO,CAAC;;;;;;;;;;;CAY1C,OAAO,OAAkB;AACvB,SAAO,UAAU,KAAA,GAAW,2CAA2C;EAEvE,IAAI,QAAQ;AACZ,OAAK,IAAI,IAAI,MAAA,SAAe,SAAS,GAAG,KAAK,GAAG,IAE9C,KADU,MAAA,SAAe,GACnB,UAAU,OAAO;AACrB,SAAA,SAAe,OAAO,GAAG,EAAE;AAC3B;;AAGJ,SAAO;;;;;;;;CAST,QAAQ,cAAkB,YAAoB,GAAmB;EAC/D,MAAM,WAAW,MAAA,SAAe,OAAO;AACvC,MAAI,SACF,QAAO,SAAS,SAAS,QAAQ,OAAO,SAAS,UAAU;EAE7D,MAAM,IAAI,UAAa;EACvB,MAAM,YACJ,iBAAiB,KAAA,IACb,KAAA,IACA,iBAAiB;GACf,MAAM,IAAI,MAAA,UAAgB,WAAU,MAAK,EAAE,aAAa,EAAE;AAC1D,OAAI,KAAK,GAAG;IACV,MAAM,CAAC,YAAY,MAAA,UAAgB,OAAO,GAAG,EAAE;AAC/C,aAAS,SAAS,QAAQ,aAAa;;KAExC,UAAU;AACnB,QAAA,UAAgB,KAAK;GAAC,UAAU;GAAG;GAAU,CAAC;AAC9C,SAAO,EAAE;;;;;;;;;;;;;;;;CAiBX,QAA2B;EACzB,MAAM,MAAyB,EAAE;AACjC,OAAK,MAAM,KAAK,MAAA,SACd,KAAI,KAAK,EAAE,MAAM;AAEnB,QAAA,SAAe,SAAS;AAExB,SAAO;;;;;;;;CAST,OAAe;AACb,SAAO,MAAA,SAAe;;CAGxB,gBAAgB,UAAU,MAAwB;AAChD,SAAO,GAAE,OAAO,sBAAsB,KAAK,gBAAgB,QAAQ,EAAC;;CAGtE,gBAAgB,UAAU,MAAwB;AAChD,SAAO;GACL,MAAM,YAAY;AAChB,QAAI;AAEF,YAAO,EAAC,OADM,MAAM,KAAK,SAAS,EACpB;aACP,GAAG;AACV,cAAS;AACT,WAAM;;;GAGV,SAAQ,UAAS;AACf,aAAS;AACT,WAAO,QAAQ,QAAQ;KAAC;KAAO,MAAM;KAAK,CAAC;;GAE9C;;;AAIL,IAAM,aAAa"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"rand.js","names":[],"sources":["../../../../shared/src/rand.ts"],"sourcesContent":["/**\n * @param min Inclusive minimum of the result.\n * @param max Inclusive maximum of the result.\n * @returns A random integer in the (inclusive) range of [`min`, `max`].\n */\nexport function randInt(min: number, max: number) {\n  min = Math.ceil(min);\n  max = Math.floor(max);\n  return Math.floor(Math.random() * (max - min + 1) + min);\n}\n"],"mappings":";;;;;;AAKA,SAAgB,QAAQ,KAAa,KAAa;AAChD,OAAM,KAAK,KAAK,IAAI;AACpB,OAAM,KAAK,MAAM,IAAI;AACrB,QAAO,KAAK,MAAM,KAAK,QAAQ,IAAI,MAAM,MAAM,KAAK,IAAI"}

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

@@ -1 +0,0 @@
-{"version":3,"file":"random-uint64.js","names":[],"sources":["../../../../shared/src/random-uint64.ts"],"sourcesContent":["export function randomUint64(): bigint {\n  // Generate two random 32-bit unsigned integers using Math.random()\n  const high = Math.floor(Math.random() * 0xffffffff); // High 32 bits\n  const low = Math.floor(Math.random() * 0xffffffff); // Low 32 bits\n\n  // Combine the high and low parts to form a 64-bit unsigned integer\n  return (BigInt(high) << 32n) | BigInt(low);\n}\n"],"mappings":";AAAA,SAAgB,eAAuB;CAErC,MAAM,OAAO,KAAK,MAAM,KAAK,QAAQ,GAAG,WAAW;CACnD,MAAM,MAAM,KAAK,MAAM,KAAK,QAAQ,GAAG,WAAW;AAGlD,QAAQ,OAAO,KAAK,IAAI,MAAO,OAAO,IAAI"}

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"}