@datakable/core 1.0.1 → 1.1.0

package/dist/features/sorting/sorting.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/features/sorting/sorting.ts"],"sourcesContent":["import { optionDiagnostics } from '../../catalog/codes'\nimport { defineOptions } from '../../catalog/options'\nimport { describeReturn } from '../../catalog/slots'\nimport type { SortAlgorithm } from '../../column/column-def'\nimport { compilePath, getValue } from '../../column/get-value'\nimport type { Path } from '../../column/path'\nimport { keepDiagnostics } from '../../diagnostics/catalog'\nimport type { Emit } from '../../diagnostics/types'\nimport { defineFeature } from '../../feature/define'\nimport type { FeatureTypes, RowModelContext } from '../../feature/types'\nimport { CellFailures } from '../../intercept/cell-batch'\nimport { errorName } from '../../intercept/classify'\nimport { boundaryDiagnostics } from '../../intercept/codes'\nimport { type ResolvedColumn, resolveColumns } from '../../pipeline/columns'\nimport { envDiagnostics } from '../../pipeline/env-codes'\nimport { allRows } from '../../pipeline/indices'\nimport { sliced } from '../../pipeline/slice'\nimport type { ColumnValues } from '../../pipeline/types'\nimport { type DataMode, modeOption } from '../../source/mode'\nimport { detectCapability, hasCapability } from '../../versioning/capability'\nimport { comparatorDiagnostics, sortingDiagnostics } from './codes'\nimport {\n  defaultIndexComparator,\n  type IndexComparator,\n  RANK,\n  sortFnIndexComparator,\n  typeRank,\n} from './compare'\nimport { collationRanks } from './ranks'\nimport {\n  chooseAuto,\n  hasExsorted,\n  intKeys,\n  needsIntKeys,\n  sortIntKeys,\n  sortWithComparator,\n} from './strategy'\n\nkeepDiagnostics(\n  sortingDiagnostics,\n  comparatorDiagnostics,\n  boundaryDiagnostics,\n  optionDiagnostics,\n  envDiagnostics,\n)\n\n/** One sort key: a column id (a path of the row type) and its direction. */\nexport type SortEntry<T> = { id: Path<T>; desc: boolean }\n\n/** The `sorting` slice (§6.4): multi-column, earlier entries first. Empty = unsorted. */\nexport type SortingState<T> = { by: readonly SortEntry<T>[] }\n\nexport type SortDirection = 'asc' | 'desc'\n\nexport type SortingApi<T> = {\n  /**\n   * Cycles `id` asc → desc → none. Without `multi` the result is a single-column sort; with `multi`\n   * (Shift+click) `id` is appended, cycled in place or removed and the other entries are kept.\n   */\n  toggleSort(id: Path<T>, options?: { multi?: boolean }): void\n  /** Replaces the whole sort. */\n  setSorting(by: readonly SortEntry<T>[]): void\n  /** Removes every sort entry (input order). */\n  clearSorting(): void\n  /** `id`'s direction in the current sort, or `false` (for `aria-sort`). */\n  getSortDirection(id: Path<T>): SortDirection | false\n}\n\nexport interface SortingTypes extends FeatureTypes {\n  state: SortingState<this['T']>\n  api: SortingApi<this['T']>\n}\n\n/**\n * How rows are sorted (§6.4): `'auto'` (default) picks per sort from one O(n) scan — exsorted\n * tim / counting / radix for a single column of safe-integer keys (numbers, `Date`s), native\n * `Array.prototype.sort` otherwise. A built-in name forces that algorithm (radix / counting only\n * apply to safe-integer keys); a function sorts the row indices itself.\n */\nexport type SortAlgorithmOption = SortAlgorithm\n\nexport interface SortingOptions {\n  /**\n   * Locale(s) of the string collator (`Intl.Collator(locale, { numeric: true })`). Default `'en'`,\n   * not the runtime's: the server and the browser must sort alike (SSR hydration, #12).\n   */\n  locale?: string | readonly string[]\n  /** The sort algorithm (default `'auto'`); a column's `sortAlgorithm` takes precedence. */\n  algorithm?: SortAlgorithmOption\n  /** Reports the algorithm chosen for each sort, why, n and the time taken (`DK_SORT_STRATEGY`). */\n  debug?: boolean\n  /**\n   * `'server'`: the server sorts (its state goes to `options.fetcher`, or the app fetches); core\n   * skips this step (§7.1). Default `'client'`.\n   */\n  mode?: DataMode\n}\n\nconst validLocale = (v: unknown) => {\n  try {\n    Intl.getCanonicalLocales(v as string | string[])\n    return true\n  } catch {\n    return false\n  }\n}\n\nconst ALGORITHMS = ['auto', 'tim', 'radix', 'counting', 'native'] as const\n\nconst sortingOptions = {\n  locale: {\n    type: ['string', 'array'],\n    check: validLocale,\n    expected: 'a BCP 47 locale tag or a list of them, e.g. \"th\" or [\"th\", \"en\"]',\n  },\n  algorithm: {\n    type: ['string', 'function'],\n    oneOf: ALGORITHMS,\n    // A literal (not built from ALGORITHMS): a module-level call would keep the schema in production.\n    expected:\n      \"one of 'auto', 'tim', 'radix', 'counting', 'native', or (indices, compare) => indices\",\n  },\n  debug: { type: 'boolean' },\n  mode: modeOption,\n} as const\n\ntype CustomAlgorithm = Extract<SortAlgorithm, (...args: never[]) => unknown>\n\nconst now = () => (typeof performance === 'undefined' ? Date.now() : performance.now())\n\n/**\n * From this many rows, `auto` sorts a string column by precomputed collation ranks (§9.1): one\n * time-sliced job per column values, then integer-key sorts (a few ms at 100k rows) instead of a\n * collator call per comparison (~100–200 ms at 100k, one long task).\n */\nconst RANKS_MIN = 10_000\n\nconst missing = (v: unknown) => typeRank(v) === RANK.missing\n\n/**\n * Dev check of a column's `sortFn` (§8.3 `DK_SORT_COMPARATOR_INVALID`), sampled: up to 8 present\n * values spread over the input, every pair both ways. A throw gives no verdict (the sort reports\n * it as `DK_CALLBACK_FAILED`).\n */\nfunction checkSortFn(\n  fn: SortFn,\n  values: ColumnValues,\n  indices: Uint32Array,\n): { reason: 'nan' | 'not-number' | 'inconsistent'; received?: string } | undefined {\n  const sample: unknown[] = []\n  const step = Math.max(1, Math.floor(indices.length / 8))\n  for (let i = 0; i < indices.length && sample.length < 8; i += step) {\n    const v = values[indices[i] as number]\n    if (!missing(v)) sample.push(v)\n  }\n  try {\n    for (let i = 0; i < sample.length; i++) {\n      for (let j = i; j < sample.length; j++) {\n        const x = fn(sample[i], sample[j])\n        const y = fn(sample[j], sample[i])\n        for (const r of [x, y]) {\n          if (typeof r !== 'number') return { reason: 'not-number', received: describeReturn(r) }\n          if (Number.isNaN(r)) return { reason: 'nan' }\n        }\n        if (Math.sign(x) !== -Math.sign(y)) return { reason: 'inconsistent' }\n      }\n    }\n  } catch {\n    return undefined\n  }\n  return undefined\n}\n\ntype SortFn = (a: unknown, b: unknown) => number\ntype SortBy = (row: unknown) => unknown\n\nconst fnField = (def: object, field: 'sortFn' | 'sortBy') => {\n  const f = (def as Record<string, unknown>)[field]\n  return typeof f === 'function' ? f : undefined\n}\n\n/** Aborts a native sort when a column's `sortFn` throws (the entry then falls back). */\nclass SortFnFailed {\n  constructor(\n    readonly entry: number,\n    readonly error: unknown,\n  ) {}\n}\n\n/**\n * Sorting (§6.4): `toggleSort` (asc → desc → none, `multi`), stable sort of the row indices with\n * the default comparator — missing values (`null`, `undefined`, `NaN`, invalid `Date`) last in both\n * directions, mixed types by type rank, strings with one `Intl.Collator(locale, { numeric: true })`\n * — or a column's `sortFn` / `sortBy`. Never touches the data: a copy of the index array is sorted.\n *\n * `algorithm: 'auto'` (default) picks per sort from one O(n) scan (§6.4): exsorted tim / counting /\n * radix for a single column of safe-integer keys (numbers, `Date`s), native `Array.prototype.sort`\n * (stable) for strings, floats, multi-column and `sortFn`. Every choice gives the same stable order.\n * `sorting({ algorithm })` or a column's `sortAlgorithm` overrides it; `debug: true` reports each\n * choice (`DK_SORT_STRATEGY`).\n */\nexport const sorting = (opts: SortingOptions = {}) => {\n  let collator: Intl.Collator | undefined\n  /** The collator; `DK_ENV_FALLBACK` when the runtime supports none of the requested locales. */\n  const getCollator = (emit: Emit) => {\n    if (collator) return collator\n    const locale = (opts.locale ?? 'en') as string | string[]\n    let supported = true\n    try {\n      collator = new Intl.Collator(locale, { numeric: true })\n      supported = Intl.Collator.supportedLocalesOf(locale).length > 0\n    } catch {\n      collator = new Intl.Collator(undefined, { numeric: true })\n      supported = false\n    }\n    if (!supported) {\n      emit('DK_ENV_FALLBACK', {\n        api: 'Intl.Collator',\n        feature: 'sorting',\n        requested: ([] as string[]).concat(locale).join(', '),\n        fallback: `the runtime's collation for \"${collator.resolvedOptions().locale}\"`,\n      })\n    }\n    return collator\n  }\n\n  /** Values array → the key of its collation-ranks job (`ctx.slice`); released with the values. */\n  const rankKeys = new WeakMap<object, object>()\n  function ranksFor(ctx: RowModelContext, values: readonly unknown[]) {\n    let key = rankKeys.get(values)\n    if (!key) {\n      key = {}\n      rankKeys.set(values, key)\n    }\n    const c = getCollator(ctx.emit)\n    return sliced(ctx, key, () => collationRanks(values, c))\n  }\n  /** The last sorted output and its input: the stand-in while ranks are computed (§9.1). */\n  let shown: { input: Uint32Array; output: Uint32Array } | undefined\n\n  // Values that the column cache does not hold, per data reference (released with it).\n  const sortByCache = new WeakMap<readonly unknown[], WeakMap<object, unknown[]>>()\n  const pathCache = new WeakMap<readonly unknown[], Map<string, unknown[]>>()\n  /** exsorted feature detection (§8.5), once per feature instance, on the first sort needing it. */\n  let exsorted: boolean | undefined\n\n  /** `sortBy` failures (§3.4): numbers only; text is built only when a cell failed. */\n  const sortByFailures = new CellFailures()\n\n  /**\n   * `sortBy` is a cell slot: one `column:batch` per column per data reference, an inline\n   * `try/catch` per row. A failed row (or a batch an interceptor skipped) keys as `undefined`,\n   * which sorts last.\n   */\n  function sortByValues(ctx: RowModelContext, col: ResolvedColumn, sortBy: SortBy): unknown[] {\n    const data = ctx.data\n    let byDef = sortByCache.get(data)\n    if (!byDef) {\n      byDef = new WeakMap()\n      sortByCache.set(data, byDef)\n    }\n    let out = byDef.get(col.def)\n    if (out) return out\n    const values: unknown[] = new Array(data.length).fill(undefined)\n    const rows = allRows(data)\n    sortByFailures.reset()\n    ctx.batch(col.id, 'sortBy', rows, () => {\n      for (let i = 0; i < rows.length; i++) {\n        const r = rows[i] as number\n        try {\n          values[r] = sortBy(data[r])\n        } catch (e) {\n          sortByFailures.add(r, e)\n        }\n      }\n      sortByFailures.report(ctx.emit, col.index, col.id, 'sortBy')\n    })\n    sortByFailures.reset()\n    out = values\n    byDef.set(col.def, out)\n    return out\n  }\n\n  function pathValues(ctx: RowModelContext, id: string): unknown[] {\n    const data = ctx.data\n    let byId = pathCache.get(data)\n    if (!byId) {\n      byId = new Map()\n      pathCache.set(data, byId)\n    }\n    let out = byId.get(id)\n    if (out) return out\n    const path = compilePath(id)\n    out = new Array(data.length)\n    for (let r = 0; r < data.length; r++) out[r] = getValue(data[r], path)\n    byId.set(id, out)\n    return out\n  }\n\n  return defineFeature<'sorting', SortingTypes>({\n    name: 'sorting',\n    stage: 'sort',\n    mode: opts.mode ?? 'client',\n    options: defineOptions(\n      // The option validator runs in development only (§9.3): production drops the schema.\n      (process.env.NODE_ENV !== \"production\") ? sortingOptions : ({} as typeof sortingOptions),\n      opts,\n    ),\n    initialState: () => ({ by: [] }),\n    // After destroy(): still a declared value (`aria-sort` reads it during teardown renders).\n    destroyedResult: { getSortDirection: () => false },\n    createApi: (ctx) => ({\n      toggleSort: (id, options) =>\n        ctx.setState((s) => {\n          const by = s.by\n          const i = by.findIndex((e) => e.id === id)\n          const cur = by[i]\n          const next = !cur ? { id, desc: false } : cur.desc ? undefined : { id, desc: true }\n          if (!options?.multi) return { by: next ? [next] : [] }\n          if (!cur) return { by: [...by, next as SortEntry<unknown>] }\n          const out = by.slice()\n          if (next) out[i] = next\n          else out.splice(i, 1)\n          return { by: out }\n        }),\n      setSorting: (by) => ctx.setState({ by: by.slice() }),\n      clearSorting: () => ctx.setState({ by: [] }),\n      getSortDirection: (id) => {\n        const e = ctx.getState().by.find((x) => x.id === id)\n        return e ? (e.desc ? 'desc' : 'asc') : false\n      },\n    }),\n    rowModel: (indices, state, ctx) => {\n      const by = state?.by\n      if (!by || by.length === 0 || indices.length < 2) {\n        shown = undefined\n        return indices\n      }\n      const t0 = opts.debug ? now() : 0\n      const cols = resolveColumns(ctx.columns)\n      const entries = by.map((e) => {\n        const id = String(e.id)\n        const col = cols.byId.get(id)\n        const sortBy = col && (fnField(col.def, 'sortBy') as SortBy | undefined)\n        const values: ColumnValues = sortBy\n          ? sortByValues(ctx, col, sortBy)\n          : (ctx.getColumnValues(id) ?? pathValues(ctx, id))\n        const sortFn =\n          col && !sortBy ? (fnField(col.def, 'sortFn') as SortFn | undefined) : undefined\n        return { col, desc: e.desc === true, values, sortFn, ranked: false }\n      })\n\n      // Dev (§8.3): a sampled sortFn check; an invalid one falls back to the default comparator.\n      if ((process.env.NODE_ENV !== \"production\")) {\n        for (const e of entries) {\n          if (!e.sortFn) continue\n          const bad = checkSortFn(e.sortFn, e.values, indices)\n          if (!bad) continue\n          e.sortFn = undefined\n          const col = e.col as ResolvedColumn\n          ctx.emit('DK_SORT_COMPARATOR_INVALID', { column: col.id, index: col.index, ...bad })\n        }\n      }\n\n      // The requested algorithm: the primary column's `sortAlgorithm`, else the table's.\n      const primary = entries[0] as (typeof entries)[number]\n      const colAlgorithm =\n        primary.col && (primary.col.def as { sortAlgorithm?: unknown }).sortAlgorithm\n      const fromColumn = colAlgorithm !== undefined\n      let requested = (fromColumn ? colAlgorithm : (opts.algorithm ?? 'auto')) as SortAlgorithm\n      const noEffect = (reason: string) =>\n        ctx.emit(\n          'DK_OPTION_NO_EFFECT',\n          fromColumn\n            ? { path: `columns[${primary.col?.index}].sortAlgorithm`, reason, once: false }\n            : { path: 'algorithm', feature: 'sorting', reason, once: false },\n        )\n      if (\n        typeof requested !== 'function' &&\n        !(ALGORITHMS as readonly unknown[]).includes(requested)\n      ) {\n        noEffect(\n          `${JSON.stringify(requested)} is not a sort algorithm (accepted: ${ALGORITHMS.join(', ')}, ` +\n            'or a function); auto was used',\n        )\n        requested = 'auto'\n      }\n      if (requested !== 'native' && exsorted === undefined) {\n        // DK_DEP_INCOMPATIBLE is a development check (§8.5); the fallback is not.\n        exsorted = (process.env.NODE_ENV !== \"production\")\n          ? detectCapability(\n              hasExsorted,\n              {\n                feature: 'sorting',\n                dependency: 'exsorted',\n                capability: 'timSort / radixSort / countingSort',\n                supported: '^1.2.3',\n                fallback: 'Array.prototype.sort (native, stable)',\n              },\n              ctx.emit,\n            )\n          : hasCapability(hasExsorted)\n      }\n\n      // auto at large n (§9.1): string columns sort by collation ranks, computed by a sliced job.\n      if (requested === 'auto' && indices.length >= RANKS_MIN) {\n        let computing = false\n        for (const e of entries) {\n          if (e.sortFn || e.values instanceof Float64Array) continue\n          const ranks = ranksFor(ctx, e.values)\n          if (ranks === undefined) computing = true\n          else if (ranks) {\n            e.values = ranks\n            e.ranked = true\n          }\n        }\n        // Meanwhile: the previous order of these rows (or the input order); 'pending'.\n        if (computing) return shown && shown.input === indices ? shown.output : indices\n      }\n      const ranked = entries.some((e) => e.ranked)\n\n      const build = (): IndexComparator => {\n        const cmps = entries.map((e, k) => {\n          const fn = e.sortFn\n          if (!fn) return defaultIndexComparator(e.values, e.desc, getCollator(ctx.emit))\n          const guarded: SortFn = (a, b) => {\n            try {\n              return fn(a, b)\n            } catch (error) {\n              throw new SortFnFailed(k, error)\n            }\n          }\n          return sortFnIndexComparator(e.values, e.desc, guarded)\n        })\n        if (cmps.length === 1) return cmps[0] as IndexComparator\n        return (a, b) => {\n          for (let k = 0; k < cmps.length; k++) {\n            const c = (cmps[k] as IndexComparator)(a, b)\n            if (c !== 0) return c\n          }\n          return 0\n        }\n      }\n\n      let algorithm: string = 'native'\n      let reason = ''\n      /** One attempt; a throwing sortFn propagates as SortFnFailed (the loop below retries). */\n      const sortOnce = (): Uint32Array => {\n        const want = requested\n        if (typeof want === 'function') {\n          const custom = want as CustomAlgorithm\n          let res: unknown\n          try {\n            res = custom(indices.slice(), build())\n          } catch (error) {\n            if (error instanceof SortFnFailed) throw error\n            reportCustom(true, error)\n            return native('the custom algorithm threw')\n          }\n          if (res instanceof Uint32Array && res.length === indices.length) {\n            algorithm = 'custom'\n            reason = fromColumn ? 'column sortAlgorithm' : 'sorting({ algorithm })'\n            return res\n          }\n          reportCustom(false, res)\n          return native('the custom algorithm returned a bad value')\n        }\n        if (exsorted === false) return native('exsorted unavailable')\n        const by = fromColumn ? 'column sortAlgorithm' : 'sorting({ algorithm })'\n        // Integer keys: a single column with the default comparator (§6.4).\n        const single = entries.length === 1 && !primary.sortFn\n        const keys =\n          single && want !== 'native' ? intKeys(primary.values, indices, primary.desc) : undefined\n        if (want !== 'auto' && want !== 'native') {\n          if (keys) {\n            try {\n              const out = sortIntKeys(keys, want)\n              algorithm = want\n              reason = `${by}, safe-integer keys`\n              return out\n            } catch {\n              noEffect(\n                `exsorted ${want}Sort could not sort these keys` +\n                  (want === 'counting' ? ' (key range above 1,000,000)' : '') +\n                  '; auto was used',\n              )\n            }\n          } else if (needsIntKeys(want)) {\n            noEffect(\n              `${want} sorts a single column of safe integer keys (numbers or Dates, no sortFn); ` +\n                'auto was used',\n            )\n          } else {\n            algorithm = want\n            reason = by\n            return sortWithComparator(indices, build(), want as 'tim')\n          }\n        } else if (want === 'native') return native(by)\n        if (!keys) {\n          return native(\n            single\n              ? 'keys are not all safe integers'\n              : entries.length > 1\n                ? 'multi-column'\n                : 'custom sortFn',\n          )\n        }\n        const choice = chooseAuto(keys)\n        algorithm = choice.algorithm\n        reason = `auto: ${ranked ? 'collation ranks of a string column, ' : ''}${choice.reason}`\n        return sortIntKeys(keys, choice.algorithm)\n      }\n      const native = (why: string) => {\n        algorithm = 'native'\n        reason = ranked ? `${why}, strings as collation ranks` : why\n        return sortWithComparator(indices, build(), 'native')\n      }\n      /** A custom algorithm threw (`threw`, `value` = the error) or returned a bad `value`. */\n      const reportCustom = (threw: boolean, value: unknown) => {\n        const slot = fromColumn\n          ? `columns[${primary.col?.index}].sortAlgorithm`\n          : 'sorting.algorithm'\n        const fallback = 'the rows were sorted with the native algorithm'\n        if (!threw) {\n          // The slot contract check is dev only (§3.4 slotContract); the fallback applies always.\n          if ((process.env.NODE_ENV !== \"production\")) {\n            ctx.emit('DK_CALLBACK_BAD_RETURN', {\n              slot,\n              expected: `a Uint32Array of ${indices.length} row indices`,\n              received: describeReturn(value),\n              count: 1,\n              fallback,\n            })\n          }\n          return\n        }\n        const name = errorName(value)\n        ctx.emit(\n          'DK_CALLBACK_FAILED',\n          {\n            slot,\n            count: 1,\n            fallback,\n            ...(name === undefined ? {} : { errorName: name }),\n          },\n          { cause: value },\n        )\n      }\n\n      // At most one retry per entry: each failing sortFn falls back to the default comparator.\n      for (;;) {\n        try {\n          const out = sortOnce()\n          if (opts.debug) {\n            ctx.emit('DK_SORT_STRATEGY', {\n              algorithm,\n              reason,\n              n: indices.length,\n              ms: now() - t0,\n              by: by.map((e) => `${String(e.id)}:${e.desc ? 'desc' : 'asc'}`),\n              ...(primary.col ? { column: { index: primary.col.index, id: primary.col.id } } : {}),\n            })\n          }\n          shown = { input: indices, output: out }\n          return out\n        } catch (e) {\n          if (!(e instanceof SortFnFailed)) throw e\n          const entry = entries[e.entry] as (typeof entries)[number]\n          entry.sortFn = undefined\n          const col = entry.col as ResolvedColumn\n          const name = errorName(e.error)\n          ctx.emit(\n            'DK_CALLBACK_FAILED',\n            {\n              slot: `columns[${col.index}].sortFn`,\n              column: col.id,\n              count: 1,\n              fallback: 'the column was sorted with the default comparator',\n              ...(name === undefined ? {} : { errorName: name }),\n            },\n            { cause: e.error },\n          )\n        }\n      }\n    },\n  })\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mBAAkC;AAClC,qBAA8B;AAC9B,mBAA+B;AAE/B,uBAAsC;AAEtC,qBAAgC;AAEhC,oBAA8B;AAE9B,wBAA6B;AAC7B,sBAA0B;AAC1B,IAAAA,gBAAoC;AACpC,qBAAoD;AACpD,uBAA+B;AAC/B,qBAAwB;AACxB,mBAAuB;AAEvB,kBAA0C;AAC1C,wBAAgD;AAChD,IAAAA,gBAA0D;AAC1D,qBAMO;AACP,mBAA+B;AAC/B,sBAOO;AAAA,IAEP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAsDA,IAAM,cAAc,CAAC,MAAe;AAClC,MAAI;AACF,SAAK,oBAAoB,CAAsB;AAC/C,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,aAAa,CAAC,QAAQ,OAAO,SAAS,YAAY,QAAQ;AAEhE,IAAM,iBAAiB;AAAA,EACrB,QAAQ;AAAA,IACN,MAAM,CAAC,UAAU,OAAO;AAAA,IACxB,OAAO;AAAA,IACP,UAAU;AAAA,EACZ;AAAA,EACA,WAAW;AAAA,IACT,MAAM,CAAC,UAAU,UAAU;AAAA,IAC3B,OAAO;AAAA;AAAA,IAEP,UACE;AAAA,EACJ;AAAA,EACA,OAAO,EAAE,MAAM,UAAU;AAAA,EACzB,MAAM;AACR;AAIA,IAAM,MAAM,MAAO,OAAO,gBAAgB,cAAc,KAAK,IAAI,IAAI,YAAY,IAAI;AAOrF,IAAM,YAAY;AAElB,IAAM,UAAU,CAAC,UAAe,yBAAS,CAAC,MAAM,oBAAK;AAOrD,SAAS,YACP,IACA,QACA,SACkF;AAClF,QAAM,SAAoB,CAAC;AAC3B,QAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,SAAS,CAAC,CAAC;AACvD,WAAS,IAAI,GAAG,IAAI,QAAQ,UAAU,OAAO,SAAS,GAAG,KAAK,MAAM;AAClE,UAAM,IAAI,OAAO,QAAQ,CAAC,CAAW;AACrC,QAAI,CAAC,QAAQ,CAAC,EAAG,QAAO,KAAK,CAAC;AAAA,EAChC;AACA,MAAI;AACF,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,cAAM,IAAI,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACjC,cAAM,IAAI,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACjC,mBAAW,KAAK,CAAC,GAAG,CAAC,GAAG;AACtB,cAAI,OAAO,MAAM,SAAU,QAAO,EAAE,QAAQ,cAAc,cAAU,6BAAe,CAAC,EAAE;AACtF,cAAI,OAAO,MAAM,CAAC,EAAG,QAAO,EAAE,QAAQ,MAAM;AAAA,QAC9C;AACA,YAAI,KAAK,KAAK,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,EAAG,QAAO,EAAE,QAAQ,eAAe;AAAA,MACtE;AAAA,IACF;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAKA,IAAM,UAAU,CAAC,KAAa,UAA+B;AAC3D,QAAM,IAAK,IAAgC,KAAK;AAChD,SAAO,OAAO,MAAM,aAAa,IAAI;AACvC;AAGA,IAAM,eAAN,MAAmB;AAAA,EACjB,YACW,OACA,OACT;AAFS;AACA;AAAA,EACR;AACL;AAcO,IAAM,UAAU,CAAC,OAAuB,CAAC,MAAM;AACpD,MAAI;AAEJ,QAAM,cAAc,CAAC,SAAe;AAClC,QAAI,SAAU,QAAO;AACrB,UAAM,SAAU,KAAK,UAAU;AAC/B,QAAI,YAAY;AAChB,QAAI;AACF,iBAAW,IAAI,KAAK,SAAS,QAAQ,EAAE,SAAS,KAAK,CAAC;AACtD,kBAAY,KAAK,SAAS,mBAAmB,MAAM,EAAE,SAAS;AAAA,IAChE,QAAQ;AACN,iBAAW,IAAI,KAAK,SAAS,QAAW,EAAE,SAAS,KAAK,CAAC;AACzD,kBAAY;AAAA,IACd;AACA,QAAI,CAAC,WAAW;AACd,WAAK,mBAAmB;AAAA,QACtB,KAAK;AAAA,QACL,SAAS;AAAA,QACT,WAAY,CAAC,EAAe,OAAO,MAAM,EAAE,KAAK,IAAI;AAAA,QACpD,UAAU,gCAAgC,SAAS,gBAAgB,EAAE,MAAM;AAAA,MAC7E,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAGA,QAAM,WAAW,oBAAI,QAAwB;AAC7C,WAAS,SAAS,KAAsB,QAA4B;AAClE,QAAI,MAAM,SAAS,IAAI,MAAM;AAC7B,QAAI,CAAC,KAAK;AACR,YAAM,CAAC;AACP,eAAS,IAAI,QAAQ,GAAG;AAAA,IAC1B;AACA,UAAM,IAAI,YAAY,IAAI,IAAI;AAC9B,eAAO,qBAAO,KAAK,KAAK,UAAM,6BAAe,QAAQ,CAAC,CAAC;AAAA,EACzD;AAEA,MAAI;AAGJ,QAAM,cAAc,oBAAI,QAAwD;AAChF,QAAM,YAAY,oBAAI,QAAoD;AAE1E,MAAI;AAGJ,QAAM,iBAAiB,IAAI,+BAAa;AAOxC,WAAS,aAAa,KAAsB,KAAqB,QAA2B;AAC1F,UAAM,OAAO,IAAI;AACjB,QAAI,QAAQ,YAAY,IAAI,IAAI;AAChC,QAAI,CAAC,OAAO;AACV,cAAQ,oBAAI,QAAQ;AACpB,kBAAY,IAAI,MAAM,KAAK;AAAA,IAC7B;AACA,QAAI,MAAM,MAAM,IAAI,IAAI,GAAG;AAC3B,QAAI,IAAK,QAAO;AAChB,UAAM,SAAoB,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK,MAAS;AAC/D,UAAM,WAAO,wBAAQ,IAAI;AACzB,mBAAe,MAAM;AACrB,QAAI,MAAM,IAAI,IAAI,UAAU,MAAM,MAAM;AACtC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAM,IAAI,KAAK,CAAC;AAChB,YAAI;AACF,iBAAO,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC;AAAA,QAC5B,SAAS,GAAG;AACV,yBAAe,IAAI,GAAG,CAAC;AAAA,QACzB;AAAA,MACF;AACA,qBAAe,OAAO,IAAI,MAAM,IAAI,OAAO,IAAI,IAAI,QAAQ;AAAA,IAC7D,CAAC;AACD,mBAAe,MAAM;AACrB,UAAM;AACN,UAAM,IAAI,IAAI,KAAK,GAAG;AACtB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,KAAsB,IAAuB;AAC/D,UAAM,OAAO,IAAI;AACjB,QAAI,OAAO,UAAU,IAAI,IAAI;AAC7B,QAAI,CAAC,MAAM;AACT,aAAO,oBAAI,IAAI;AACf,gBAAU,IAAI,MAAM,IAAI;AAAA,IAC1B;AACA,QAAI,MAAM,KAAK,IAAI,EAAE;AACrB,QAAI,IAAK,QAAO;AAChB,UAAM,WAAO,8BAAY,EAAE;AAC3B,UAAM,IAAI,MAAM,KAAK,MAAM;AAC3B,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,KAAI,CAAC,QAAI,2BAAS,KAAK,CAAC,GAAG,IAAI;AACrE,SAAK,IAAI,IAAI,GAAG;AAChB,WAAO;AAAA,EACT;AAEA,aAAO,6BAAuC;AAAA,IAC5C,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM,KAAK,QAAQ;AAAA,IACnB,aAAS;AAAA;AAAA,MAEN,QAAQ,IAAI,aAAa,eAAgB,iBAAkB,CAAC;AAAA,MAC7D;AAAA,IACF;AAAA,IACA,cAAc,OAAO,EAAE,IAAI,CAAC,EAAE;AAAA;AAAA,IAE9B,iBAAiB,EAAE,kBAAkB,MAAM,MAAM;AAAA,IACjD,WAAW,CAAC,SAAS;AAAA,MACnB,YAAY,CAAC,IAAI,YACf,IAAI,SAAS,CAAC,MAAM;AAClB,cAAM,KAAK,EAAE;AACb,cAAM,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE;AACzC,cAAM,MAAM,GAAG,CAAC;AAChB,cAAM,OAAO,CAAC,MAAM,EAAE,IAAI,MAAM,MAAM,IAAI,IAAI,OAAO,SAAY,EAAE,IAAI,MAAM,KAAK;AAClF,YAAI,CAAC,SAAS,MAAO,QAAO,EAAE,IAAI,OAAO,CAAC,IAAI,IAAI,CAAC,EAAE;AACrD,YAAI,CAAC,IAAK,QAAO,EAAE,IAAI,CAAC,GAAG,IAAI,IAA0B,EAAE;AAC3D,cAAM,MAAM,GAAG,MAAM;AACrB,YAAI,KAAM,KAAI,CAAC,IAAI;AAAA,YACd,KAAI,OAAO,GAAG,CAAC;AACpB,eAAO,EAAE,IAAI,IAAI;AAAA,MACnB,CAAC;AAAA,MACH,YAAY,CAAC,OAAO,IAAI,SAAS,EAAE,IAAI,GAAG,MAAM,EAAE,CAAC;AAAA,MACnD,cAAc,MAAM,IAAI,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC;AAAA,MAC3C,kBAAkB,CAAC,OAAO;AACxB,cAAM,IAAI,IAAI,SAAS,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AACnD,eAAO,IAAK,EAAE,OAAO,SAAS,QAAS;AAAA,MACzC;AAAA,IACF;AAAA,IACA,UAAU,CAAC,SAAS,OAAO,QAAQ;AACjC,YAAM,KAAK,OAAO;AAClB,UAAI,CAAC,MAAM,GAAG,WAAW,KAAK,QAAQ,SAAS,GAAG;AAChD,gBAAQ;AACR,eAAO;AAAA,MACT;AACA,YAAM,KAAK,KAAK,QAAQ,IAAI,IAAI;AAChC,YAAM,WAAO,+BAAe,IAAI,OAAO;AACvC,YAAM,UAAU,GAAG,IAAI,CAAC,MAAM;AAC5B,cAAM,KAAK,OAAO,EAAE,EAAE;AACtB,cAAM,MAAM,KAAK,KAAK,IAAI,EAAE;AAC5B,cAAM,SAAS,OAAQ,QAAQ,IAAI,KAAK,QAAQ;AAChD,cAAM,SAAuB,SACzB,aAAa,KAAK,KAAK,MAAM,IAC5B,IAAI,gBAAgB,EAAE,KAAK,WAAW,KAAK,EAAE;AAClD,cAAM,SACJ,OAAO,CAAC,SAAU,QAAQ,IAAI,KAAK,QAAQ,IAA2B;AACxE,eAAO,EAAE,KAAK,MAAM,EAAE,SAAS,MAAM,QAAQ,QAAQ,QAAQ,MAAM;AAAA,MACrE,CAAC;AAGD,UAAK,QAAQ,IAAI,aAAa,cAAe;AAC3C,mBAAW,KAAK,SAAS;AACvB,cAAI,CAAC,EAAE,OAAQ;AACf,gBAAM,MAAM,YAAY,EAAE,QAAQ,EAAE,QAAQ,OAAO;AACnD,cAAI,CAAC,IAAK;AACV,YAAE,SAAS;AACX,gBAAM,MAAM,EAAE;AACd,cAAI,KAAK,8BAA8B,EAAE,QAAQ,IAAI,IAAI,OAAO,IAAI,OAAO,GAAG,IAAI,CAAC;AAAA,QACrF;AAAA,MACF;AAGA,YAAM,UAAU,QAAQ,CAAC;AACzB,YAAM,eACJ,QAAQ,OAAQ,QAAQ,IAAI,IAAoC;AAClE,YAAM,aAAa,iBAAiB;AACpC,UAAI,YAAa,aAAa,eAAgB,KAAK,aAAa;AAChE,YAAM,WAAW,CAACC,YAChB,IAAI;AAAA,QACF;AAAA,QACA,aACI,EAAE,MAAM,WAAW,QAAQ,KAAK,KAAK,mBAAmB,QAAAA,SAAQ,MAAM,MAAM,IAC5E,EAAE,MAAM,aAAa,SAAS,WAAW,QAAAA,SAAQ,MAAM,MAAM;AAAA,MACnE;AACF,UACE,OAAO,cAAc,cACrB,CAAE,WAAkC,SAAS,SAAS,GACtD;AACA;AAAA,UACE,GAAG,KAAK,UAAU,SAAS,CAAC,uCAAuC,WAAW,KAAK,IAAI,CAAC;AAAA,QAE1F;AACA,oBAAY;AAAA,MACd;AACA,UAAI,cAAc,YAAY,aAAa,QAAW;AAEpD,mBAAY,QAAQ,IAAI,aAAa,mBACjC;AAAA,UACE;AAAA,UACA;AAAA,YACE,SAAS;AAAA,YACT,YAAY;AAAA,YACZ,YAAY;AAAA,YACZ,WAAW;AAAA,YACX,UAAU;AAAA,UACZ;AAAA,UACA,IAAI;AAAA,QACN,QACA,iCAAc,2BAAW;AAAA,MAC/B;AAGA,UAAI,cAAc,UAAU,QAAQ,UAAU,WAAW;AACvD,YAAI,YAAY;AAChB,mBAAW,KAAK,SAAS;AACvB,cAAI,EAAE,UAAU,EAAE,kBAAkB,aAAc;AAClD,gBAAM,QAAQ,SAAS,KAAK,EAAE,MAAM;AACpC,cAAI,UAAU,OAAW,aAAY;AAAA,mBAC5B,OAAO;AACd,cAAE,SAAS;AACX,cAAE,SAAS;AAAA,UACb;AAAA,QACF;AAEA,YAAI,UAAW,QAAO,SAAS,MAAM,UAAU,UAAU,MAAM,SAAS;AAAA,MAC1E;AACA,YAAM,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,MAAM;AAE3C,YAAM,QAAQ,MAAuB;AACnC,cAAM,OAAO,QAAQ,IAAI,CAAC,GAAG,MAAM;AACjC,gBAAM,KAAK,EAAE;AACb,cAAI,CAAC,GAAI,YAAO,uCAAuB,EAAE,QAAQ,EAAE,MAAM,YAAY,IAAI,IAAI,CAAC;AAC9E,gBAAM,UAAkB,CAAC,GAAG,MAAM;AAChC,gBAAI;AACF,qBAAO,GAAG,GAAG,CAAC;AAAA,YAChB,SAAS,OAAO;AACd,oBAAM,IAAI,aAAa,GAAG,KAAK;AAAA,YACjC;AAAA,UACF;AACA,qBAAO,sCAAsB,EAAE,QAAQ,EAAE,MAAM,OAAO;AAAA,QACxD,CAAC;AACD,YAAI,KAAK,WAAW,EAAG,QAAO,KAAK,CAAC;AACpC,eAAO,CAAC,GAAG,MAAM;AACf,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,kBAAM,IAAK,KAAK,CAAC,EAAsB,GAAG,CAAC;AAC3C,gBAAI,MAAM,EAAG,QAAO;AAAA,UACtB;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,YAAoB;AACxB,UAAI,SAAS;AAEb,YAAM,WAAW,MAAmB;AAClC,cAAM,OAAO;AACb,YAAI,OAAO,SAAS,YAAY;AAC9B,gBAAM,SAAS;AACf,cAAI;AACJ,cAAI;AACF,kBAAM,OAAO,QAAQ,MAAM,GAAG,MAAM,CAAC;AAAA,UACvC,SAAS,OAAO;AACd,gBAAI,iBAAiB,aAAc,OAAM;AACzC,yBAAa,MAAM,KAAK;AACxB,mBAAO,OAAO,4BAA4B;AAAA,UAC5C;AACA,cAAI,eAAe,eAAe,IAAI,WAAW,QAAQ,QAAQ;AAC/D,wBAAY;AACZ,qBAAS,aAAa,yBAAyB;AAC/C,mBAAO;AAAA,UACT;AACA,uBAAa,OAAO,GAAG;AACvB,iBAAO,OAAO,2CAA2C;AAAA,QAC3D;AACA,YAAI,aAAa,MAAO,QAAO,OAAO,sBAAsB;AAC5D,cAAMC,MAAK,aAAa,yBAAyB;AAEjD,cAAM,SAAS,QAAQ,WAAW,KAAK,CAAC,QAAQ;AAChD,cAAM,OACJ,UAAU,SAAS,eAAW,yBAAQ,QAAQ,QAAQ,SAAS,QAAQ,IAAI,IAAI;AACjF,YAAI,SAAS,UAAU,SAAS,UAAU;AACxC,cAAI,MAAM;AACR,gBAAI;AACF,oBAAM,UAAM,6BAAY,MAAM,IAAI;AAClC,0BAAY;AACZ,uBAAS,GAAGA,GAAE;AACd,qBAAO;AAAA,YACT,QAAQ;AACN;AAAA,gBACE,YAAY,IAAI,oCACb,SAAS,aAAa,iCAAiC,MACxD;AAAA,cACJ;AAAA,YACF;AAAA,UACF,eAAW,8BAAa,IAAI,GAAG;AAC7B;AAAA,cACE,GAAG,IAAI;AAAA,YAET;AAAA,UACF,OAAO;AACL,wBAAY;AACZ,qBAASA;AACT,uBAAO,oCAAmB,SAAS,MAAM,GAAG,IAAa;AAAA,UAC3D;AAAA,QACF,WAAW,SAAS,SAAU,QAAO,OAAOA,GAAE;AAC9C,YAAI,CAAC,MAAM;AACT,iBAAO;AAAA,YACL,SACI,mCACA,QAAQ,SAAS,IACf,iBACA;AAAA,UACR;AAAA,QACF;AACA,cAAM,aAAS,4BAAW,IAAI;AAC9B,oBAAY,OAAO;AACnB,iBAAS,SAAS,SAAS,yCAAyC,EAAE,GAAG,OAAO,MAAM;AACtF,mBAAO,6BAAY,MAAM,OAAO,SAAS;AAAA,MAC3C;AACA,YAAM,SAAS,CAAC,QAAgB;AAC9B,oBAAY;AACZ,iBAAS,SAAS,GAAG,GAAG,iCAAiC;AACzD,mBAAO,oCAAmB,SAAS,MAAM,GAAG,QAAQ;AAAA,MACtD;AAEA,YAAM,eAAe,CAAC,OAAgB,UAAmB;AACvD,cAAM,OAAO,aACT,WAAW,QAAQ,KAAK,KAAK,oBAC7B;AACJ,cAAM,WAAW;AACjB,YAAI,CAAC,OAAO;AAEV,cAAK,QAAQ,IAAI,aAAa,cAAe;AAC3C,gBAAI,KAAK,0BAA0B;AAAA,cACjC;AAAA,cACA,UAAU,oBAAoB,QAAQ,MAAM;AAAA,cAC5C,cAAU,6BAAe,KAAK;AAAA,cAC9B,OAAO;AAAA,cACP;AAAA,YACF,CAAC;AAAA,UACH;AACA;AAAA,QACF;AACA,cAAM,WAAO,2BAAU,KAAK;AAC5B,YAAI;AAAA,UACF;AAAA,UACA;AAAA,YACE;AAAA,YACA,OAAO;AAAA,YACP;AAAA,YACA,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,UAClD;AAAA,UACA,EAAE,OAAO,MAAM;AAAA,QACjB;AAAA,MACF;AAGA,iBAAS;AACP,YAAI;AACF,gBAAM,MAAM,SAAS;AACrB,cAAI,KAAK,OAAO;AACd,gBAAI,KAAK,oBAAoB;AAAA,cAC3B;AAAA,cACA;AAAA,cACA,GAAG,QAAQ;AAAA,cACX,IAAI,IAAI,IAAI;AAAA,cACZ,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,OAAO,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,SAAS,KAAK,EAAE;AAAA,cAC9D,GAAI,QAAQ,MAAM,EAAE,QAAQ,EAAE,OAAO,QAAQ,IAAI,OAAO,IAAI,QAAQ,IAAI,GAAG,EAAE,IAAI,CAAC;AAAA,YACpF,CAAC;AAAA,UACH;AACA,kBAAQ,EAAE,OAAO,SAAS,QAAQ,IAAI;AACtC,iBAAO;AAAA,QACT,SAAS,GAAG;AACV,cAAI,EAAE,aAAa,cAAe,OAAM;AACxC,gBAAM,QAAQ,QAAQ,EAAE,KAAK;AAC7B,gBAAM,SAAS;AACf,gBAAM,MAAM,MAAM;AAClB,gBAAM,WAAO,2BAAU,EAAE,KAAK;AAC9B,cAAI;AAAA,YACF;AAAA,YACA;AAAA,cACE,MAAM,WAAW,IAAI,KAAK;AAAA,cAC1B,QAAQ,IAAI;AAAA,cACZ,OAAO;AAAA,cACP,UAAU;AAAA,cACV,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,YAClD;AAAA,YACA,EAAE,OAAO,EAAE,MAAM;AAAA,UACnB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACH;","names":["import_codes","reason","by"]}
+{"version":3,"sources":["../../../src/features/sorting/sorting.ts"],"sourcesContent":["import { optionDiagnostics } from '../../catalog/codes'\nimport { defineOptions } from '../../catalog/options'\nimport { describeReturn } from '../../catalog/slots'\nimport type { SortAlgorithm } from '../../column/column-def'\nimport { compilePath, getValue } from '../../column/get-value'\nimport type { Path } from '../../column/path'\nimport { keepDiagnostics } from '../../diagnostics/catalog'\nimport '../../diagnostics/process-guard'\nimport type { Emit } from '../../diagnostics/types'\nimport { defineFeature } from '../../feature/define'\nimport type { FeatureTypes, RowModelContext } from '../../feature/types'\nimport { CellFailures } from '../../intercept/cell-batch'\nimport { errorName } from '../../intercept/classify'\nimport { boundaryDiagnostics } from '../../intercept/codes'\nimport { type ResolvedColumn, resolveColumns } from '../../pipeline/columns'\nimport { envDiagnostics } from '../../pipeline/env-codes'\nimport { allRows } from '../../pipeline/indices'\nimport { sliced } from '../../pipeline/slice'\nimport type { ColumnValues } from '../../pipeline/types'\nimport { type DataMode, modeOption } from '../../source/mode'\nimport { detectCapability, hasCapability } from '../../versioning/capability'\nimport { comparatorDiagnostics, sortingDiagnostics } from './codes'\nimport {\n  defaultIndexComparator,\n  type IndexComparator,\n  RANK,\n  sortFnIndexComparator,\n  typeRank,\n} from './compare'\nimport { collationRanks } from './ranks'\nimport {\n  chooseAuto,\n  hasExsorted,\n  intKeys,\n  needsIntKeys,\n  sortIntKeys,\n  sortWithComparator,\n} from './strategy'\n\nkeepDiagnostics(\n  sortingDiagnostics,\n  comparatorDiagnostics,\n  boundaryDiagnostics,\n  optionDiagnostics,\n  envDiagnostics,\n)\n\n/** One sort key: a column id (a path of the row type) and its direction. */\nexport type SortEntry<T> = { id: Path<T>; desc: boolean }\n\n/** The `sorting` slice (§6.4): multi-column, earlier entries first. Empty = unsorted. */\nexport type SortingState<T> = { by: readonly SortEntry<T>[] }\n\nexport type SortDirection = 'asc' | 'desc'\n\n/** Replaces the sort; an equal one keeps the slice (same reference, no notification, #21). */\nconst setSort = (\n  ctx: { setState(u: (s: SortingState<unknown>) => SortingState<unknown>): void },\n  by: readonly SortEntry<unknown>[],\n) => ctx.setState((s) => (JSON.stringify(s.by) === JSON.stringify(by) ? s : { by: by.slice() }))\n\nexport type SortingApi<T> = {\n  /**\n   * Cycles `id` asc → desc → none. Without `multi` the result is a single-column sort; with `multi`\n   * (Shift+click) `id` is appended, cycled in place or removed and the other entries are kept.\n   */\n  toggleSort(id: Path<T>, options?: { multi?: boolean }): void\n  /** Replaces the whole sort. */\n  setSorting(by: readonly SortEntry<T>[]): void\n  /** Removes every sort entry (input order). */\n  clearSorting(): void\n  /** `id`'s direction in the current sort, or `false` (for `aria-sort`). */\n  getSortDirection(id: Path<T>): SortDirection | false\n}\n\nexport interface SortingTypes extends FeatureTypes {\n  state: SortingState<this['T']>\n  api: SortingApi<this['T']>\n}\n\n/**\n * How rows are sorted (§6.4): `'auto'` (default) picks per sort from one O(n) scan — exsorted\n * tim / counting / radix for a single column of safe-integer keys (numbers, `Date`s), native\n * `Array.prototype.sort` otherwise. A built-in name forces that algorithm (radix / counting only\n * apply to safe-integer keys); a function sorts the row indices itself.\n */\nexport type SortAlgorithmOption = SortAlgorithm\n\nexport interface SortingOptions {\n  /**\n   * Locale(s) of the string collator (`Intl.Collator(locale, { numeric: true })`). Default `'en'`,\n   * not the runtime's: the server and the browser must sort alike (SSR hydration, #12).\n   */\n  locale?: string | readonly string[]\n  /** The sort algorithm (default `'auto'`); a column's `sortAlgorithm` takes precedence. */\n  algorithm?: SortAlgorithmOption\n  /** Reports the algorithm chosen for each sort, why, n and the time taken (`DK_SORT_STRATEGY`). */\n  debug?: boolean\n  /**\n   * `'server'`: the server sorts (its state goes to `options.fetcher`, or the app fetches); core\n   * skips this step (§7.1). Default `'client'`.\n   */\n  mode?: DataMode\n}\n\nconst validLocale = (v: unknown) => {\n  try {\n    Intl.getCanonicalLocales(v as string | string[])\n    return true\n  } catch {\n    return false\n  }\n}\n\nconst ALGORITHMS = ['auto', 'tim', 'radix', 'counting', 'native'] as const\n\nconst sortingOptions = {\n  locale: {\n    type: ['string', 'array'],\n    check: validLocale,\n    expected: 'a BCP 47 locale tag or a list of them, e.g. \"th\" or [\"th\", \"en\"]',\n  },\n  algorithm: {\n    type: ['string', 'function'],\n    oneOf: ALGORITHMS,\n    // A literal (not built from ALGORITHMS): a module-level call would keep the schema in production.\n    expected:\n      \"one of 'auto', 'tim', 'radix', 'counting', 'native', or (indices, compare) => indices\",\n  },\n  debug: { type: 'boolean' },\n  mode: modeOption,\n} as const\n\ntype CustomAlgorithm = Extract<SortAlgorithm, (...args: never[]) => unknown>\n\nconst now = () => (typeof performance === 'undefined' ? Date.now() : performance.now())\n\n/**\n * From this many rows, `auto` sorts a string column by precomputed collation ranks (§9.1): one\n * time-sliced job per column values, then integer-key sorts (a few ms at 100k rows) instead of a\n * collator call per comparison (~100–200 ms at 100k, one long task).\n */\nconst RANKS_MIN = 10_000\n\nconst missing = (v: unknown) => typeRank(v) === RANK.missing\n\n/**\n * Dev check of a column's `sortFn` (§8.3 `DK_SORT_COMPARATOR_INVALID`), sampled: up to 8 present\n * values spread over the input, every pair both ways. A throw gives no verdict (the sort reports\n * it as `DK_CALLBACK_FAILED`).\n */\nfunction checkSortFn(\n  fn: SortFn,\n  values: ColumnValues,\n  indices: Uint32Array,\n): { reason: 'nan' | 'not-number' | 'inconsistent'; received?: string } | undefined {\n  const sample: unknown[] = []\n  const step = Math.max(1, Math.floor(indices.length / 8))\n  for (let i = 0; i < indices.length && sample.length < 8; i += step) {\n    const v = values[indices[i] as number]\n    if (!missing(v)) sample.push(v)\n  }\n  try {\n    for (let i = 0; i < sample.length; i++) {\n      for (let j = i; j < sample.length; j++) {\n        const x = fn(sample[i], sample[j])\n        const y = fn(sample[j], sample[i])\n        for (const r of [x, y]) {\n          if (typeof r !== 'number') return { reason: 'not-number', received: describeReturn(r) }\n          if (Number.isNaN(r)) return { reason: 'nan' }\n        }\n        if (Math.sign(x) !== -Math.sign(y)) return { reason: 'inconsistent' }\n      }\n    }\n  } catch {\n    return undefined\n  }\n  return undefined\n}\n\ntype SortFn = (a: unknown, b: unknown) => number\ntype SortBy = (row: unknown) => unknown\n\nconst fnField = (def: object, field: 'sortFn' | 'sortBy') => {\n  const f = (def as Record<string, unknown>)[field]\n  return typeof f === 'function' ? f : undefined\n}\n\n/** Aborts a native sort when a column's `sortFn` throws (the entry then falls back). */\nclass SortFnFailed {\n  constructor(\n    readonly entry: number,\n    readonly error: unknown,\n  ) {}\n}\n\n/**\n * Sorting (§6.4): `toggleSort` (asc → desc → none, `multi`), stable sort of the row indices with\n * the default comparator — missing values (`null`, `undefined`, `NaN`, invalid `Date`) last in both\n * directions, mixed types by type rank, strings with one `Intl.Collator(locale, { numeric: true })`\n * — or a column's `sortFn` / `sortBy`. Never touches the data: a copy of the index array is sorted.\n *\n * `algorithm: 'auto'` (default) picks per sort from one O(n) scan (§6.4): exsorted tim / counting /\n * radix for a single column of safe-integer keys (numbers, `Date`s), native `Array.prototype.sort`\n * (stable) for strings, floats, multi-column and `sortFn`. Every choice gives the same stable order.\n * `sorting({ algorithm })` or a column's `sortAlgorithm` overrides it; `debug: true` reports each\n * choice (`DK_SORT_STRATEGY`).\n */\nexport const sorting = (opts: SortingOptions = {}) => {\n  let collator: Intl.Collator | undefined\n  /** The collator; `DK_ENV_FALLBACK` when the runtime supports none of the requested locales. */\n  const getCollator = (emit: Emit) => {\n    if (collator) return collator\n    const locale = (opts.locale ?? 'en') as string | string[]\n    let supported = true\n    try {\n      collator = new Intl.Collator(locale, { numeric: true })\n      supported = Intl.Collator.supportedLocalesOf(locale).length > 0\n    } catch {\n      collator = new Intl.Collator(undefined, { numeric: true })\n      supported = false\n    }\n    if (!supported) {\n      emit('DK_ENV_FALLBACK', {\n        api: 'Intl.Collator',\n        feature: 'sorting',\n        requested: ([] as string[]).concat(locale).join(', '),\n        fallback: `collation|${collator.resolvedOptions().locale}`,\n      })\n    }\n    return collator\n  }\n\n  /** Values array → the key of its collation-ranks job (`ctx.slice`); released with the values. */\n  const rankKeys = new WeakMap<object, object>()\n  function ranksFor(ctx: RowModelContext, values: readonly unknown[]) {\n    let key = rankKeys.get(values)\n    if (!key) {\n      key = {}\n      rankKeys.set(values, key)\n    }\n    const c = getCollator(ctx.emit)\n    return sliced(ctx, key, () => collationRanks(values, c))\n  }\n  /** The last sorted output and its input: the stand-in while ranks are computed (§9.1). */\n  let shown: { input: Uint32Array; output: Uint32Array } | undefined\n\n  // Values that the column cache does not hold, per data reference (released with it).\n  const sortByCache = new WeakMap<readonly unknown[], WeakMap<object, unknown[]>>()\n  const pathCache = new WeakMap<readonly unknown[], Map<string, unknown[]>>()\n  /** exsorted feature detection (§8.5), once per feature instance, on the first sort needing it. */\n  let exsorted: boolean | undefined\n\n  /** `sortBy` failures (§3.4): numbers only; text is built only when a cell failed. */\n  const sortByFailures = new CellFailures()\n\n  /**\n   * `sortBy` is a cell slot: one `column:batch` per column per data reference, an inline\n   * `try/catch` per row. A failed row (or a batch an interceptor skipped) keys as `undefined`,\n   * which sorts last.\n   */\n  function sortByValues(ctx: RowModelContext, col: ResolvedColumn, sortBy: SortBy): unknown[] {\n    const data = ctx.data\n    let byDef = sortByCache.get(data)\n    if (!byDef) {\n      byDef = new WeakMap()\n      sortByCache.set(data, byDef)\n    }\n    let out = byDef.get(col.def)\n    if (out) return out\n    const values: unknown[] = new Array(data.length).fill(undefined)\n    const rows = allRows(data)\n    sortByFailures.reset()\n    ctx.batch(col.id, 'sortBy', rows, () => {\n      for (let i = 0; i < rows.length; i++) {\n        const r = rows[i] as number\n        try {\n          values[r] = sortBy(data[r])\n        } catch (e) {\n          sortByFailures.add(r, e)\n        }\n      }\n      sortByFailures.report(ctx.emit, col.index, col.id, 'sortBy')\n    })\n    sortByFailures.reset()\n    out = values\n    byDef.set(col.def, out)\n    return out\n  }\n\n  function pathValues(ctx: RowModelContext, id: string): unknown[] {\n    const data = ctx.data\n    let byId = pathCache.get(data)\n    if (!byId) {\n      byId = new Map()\n      pathCache.set(data, byId)\n    }\n    let out = byId.get(id)\n    if (out) return out\n    const path = compilePath(id)\n    out = new Array(data.length)\n    for (let r = 0; r < data.length; r++) out[r] = getValue(data[r], path)\n    byId.set(id, out)\n    return out\n  }\n\n  return defineFeature<'sorting', SortingTypes>({\n    name: 'sorting',\n    stage: 'sort',\n    mode: opts.mode ?? 'client',\n    options: defineOptions(\n      // The option validator runs in development only (§9.3): production drops the schema.\n      (process.env.NODE_ENV !== \"production\") ? sortingOptions : ({} as typeof sortingOptions),\n      opts,\n    ),\n    initialState: () => ({ by: [] }),\n    // After destroy(): still a declared value (`aria-sort` reads it during teardown renders).\n    destroyedResult: { getSortDirection: () => false },\n    createApi: (ctx) => ({\n      toggleSort: (id, options) =>\n        ctx.setState((s) => {\n          const by = s.by\n          const i = by.findIndex((e) => e.id === id)\n          const cur = by[i]\n          const next = !cur ? { id, desc: false } : cur.desc ? undefined : { id, desc: true }\n          if (!options?.multi) return { by: next ? [next] : [] }\n          if (!cur) return { by: [...by, next as SortEntry<unknown>] }\n          const out = by.slice()\n          if (next) out[i] = next\n          else out.splice(i, 1)\n          return { by: out }\n        }),\n      setSorting: (by) => setSort(ctx, by),\n      clearSorting: () => setSort(ctx, []),\n      getSortDirection: (id) => {\n        const e = ctx.getState().by.find((x) => x.id === id)\n        return e ? (e.desc ? 'desc' : 'asc') : false\n      },\n    }),\n    rowModel: (indices, state, ctx) => {\n      const by = state?.by\n      if (!by || by.length === 0 || indices.length < 2) {\n        shown = undefined\n        return indices\n      }\n      const t0 = opts.debug ? now() : 0\n      const cols = resolveColumns(ctx.columns)\n      const entries = by.map((e) => {\n        const id = String(e.id)\n        const col = cols.byId.get(id)\n        const sortBy = col && (fnField(col.def, 'sortBy') as SortBy | undefined)\n        const values: ColumnValues = sortBy\n          ? sortByValues(ctx, col, sortBy)\n          : (ctx.getColumnValues(id) ?? pathValues(ctx, id))\n        const sortFn =\n          col && !sortBy ? (fnField(col.def, 'sortFn') as SortFn | undefined) : undefined\n        return { col, desc: e.desc === true, values, sortFn, ranked: false }\n      })\n\n      // Dev (§8.3): a sampled sortFn check; an invalid one falls back to the default comparator.\n      if ((process.env.NODE_ENV !== \"production\")) {\n        for (const e of entries) {\n          if (!e.sortFn) continue\n          const bad = checkSortFn(e.sortFn, e.values, indices)\n          if (!bad) continue\n          e.sortFn = undefined\n          const col = e.col as ResolvedColumn\n          ctx.emit('DK_SORT_COMPARATOR_INVALID', { column: col.id, index: col.index, ...bad })\n        }\n      }\n\n      // The requested algorithm: the primary column's `sortAlgorithm`, else the table's.\n      const primary = entries[0] as (typeof entries)[number]\n      const colAlgorithm =\n        primary.col && (primary.col.def as { sortAlgorithm?: unknown }).sortAlgorithm\n      const fromColumn = colAlgorithm !== undefined\n      let requested = (fromColumn ? colAlgorithm : (opts.algorithm ?? 'auto')) as SortAlgorithm\n      const noEffect = (reason: string) =>\n        ctx.emit(\n          'DK_OPTION_NO_EFFECT',\n          fromColumn\n            ? { path: `columns[${primary.col?.index}].sortAlgorithm`, reason, once: false }\n            : { path: 'algorithm', feature: 'sorting', reason, once: false },\n        )\n      if (\n        typeof requested !== 'function' &&\n        !(ALGORITHMS as readonly unknown[]).includes(requested)\n      ) {\n        noEffect(`not-algorithm|${JSON.stringify(requested)}`)\n        requested = 'auto'\n      }\n      if (requested !== 'native' && exsorted === undefined) {\n        // DK_DEP_INCOMPATIBLE is a development check (§8.5); the fallback is not.\n        exsorted = (process.env.NODE_ENV !== \"production\")\n          ? detectCapability(\n              hasExsorted,\n              {\n                feature: 'sorting',\n                dependency: 'exsorted',\n                capability: 'timSort / radixSort / countingSort',\n                supported: '^1.2.3',\n                fallback: 'Array.prototype.sort (native, stable)',\n              },\n              ctx.emit,\n            )\n          : hasCapability(hasExsorted)\n      }\n\n      // auto at large n (§9.1): string columns sort by collation ranks, computed by a sliced job.\n      if (requested === 'auto' && indices.length >= RANKS_MIN) {\n        let computing = false\n        for (const e of entries) {\n          if (e.sortFn || e.values instanceof Float64Array) continue\n          const ranks = ranksFor(ctx, e.values)\n          if (ranks === undefined) computing = true\n          else if (ranks) {\n            e.values = ranks\n            e.ranked = true\n          }\n        }\n        // Meanwhile: the previous order of these rows (or the input order); 'pending'.\n        if (computing) return shown && shown.input === indices ? shown.output : indices\n      }\n      const ranked = entries.some((e) => e.ranked)\n\n      const build = (): IndexComparator => {\n        const cmps = entries.map((e, k) => {\n          const fn = e.sortFn\n          if (!fn) return defaultIndexComparator(e.values, e.desc, getCollator(ctx.emit))\n          const guarded: SortFn = (a, b) => {\n            try {\n              return fn(a, b)\n            } catch (error) {\n              throw new SortFnFailed(k, error)\n            }\n          }\n          return sortFnIndexComparator(e.values, e.desc, guarded)\n        })\n        if (cmps.length === 1) return cmps[0] as IndexComparator\n        return (a, b) => {\n          for (let k = 0; k < cmps.length; k++) {\n            const c = (cmps[k] as IndexComparator)(a, b)\n            if (c !== 0) return c\n          }\n          return 0\n        }\n      }\n\n      let algorithm: string = 'native'\n      let reason = ''\n      /** One attempt; a throwing sortFn propagates as SortFnFailed (the loop below retries). */\n      const sortOnce = (): Uint32Array => {\n        const want = requested\n        if (typeof want === 'function') {\n          const custom = want as CustomAlgorithm\n          let res: unknown\n          try {\n            res = custom(indices.slice(), build())\n          } catch (error) {\n            if (error instanceof SortFnFailed) throw error\n            reportCustom(true, error)\n            return native('custom-threw')\n          }\n          if (res instanceof Uint32Array && res.length === indices.length) {\n            algorithm = 'custom'\n            reason = fromColumn ? 'column sortAlgorithm' : 'sorting({ algorithm })'\n            return res\n          }\n          reportCustom(false, res)\n          return native('custom-bad')\n        }\n        if (exsorted === false) return native('exsorted unavailable')\n        const by = fromColumn ? 'column sortAlgorithm' : 'sorting({ algorithm })'\n        // Integer keys: a single column with the default comparator (§6.4).\n        const single = entries.length === 1 && !primary.sortFn\n        const keys =\n          single && want !== 'native' ? intKeys(primary.values, indices, primary.desc) : undefined\n        if (want !== 'auto' && want !== 'native') {\n          if (keys) {\n            try {\n              const out = sortIntKeys(keys, want)\n              algorithm = want\n              reason = `int-keys|${by}`\n              return out\n            } catch {\n              noEffect(`exsorted-${want === 'counting' ? 'range' : 'failed'}|${want}`)\n            }\n          } else if (needsIntKeys(want)) {\n            noEffect(`needs-int-keys|${want}`)\n          } else {\n            algorithm = want\n            reason = by\n            return sortWithComparator(indices, build(), want as 'tim')\n          }\n        } else if (want === 'native') return native(by)\n        if (!keys) {\n          return native(\n            single ? 'not-safe-int' : entries.length > 1 ? 'multi-column' : 'custom sortFn',\n          )\n        }\n        const choice = chooseAuto(keys)\n        algorithm = choice.algorithm\n        reason = `auto-${ranked ? 'ranked-' : ''}${choice.reason}`\n        return sortIntKeys(keys, choice.algorithm)\n      }\n      const native = (why: string) => {\n        algorithm = 'native'\n        reason = ranked ? `ranks|${why}` : why\n        return sortWithComparator(indices, build(), 'native')\n      }\n      /** A custom algorithm threw (`threw`, `value` = the error) or returned a bad `value`. */\n      const reportCustom = (threw: boolean, value: unknown) => {\n        const slot = fromColumn\n          ? `columns[${primary.col?.index}].sortAlgorithm`\n          : 'sorting.algorithm'\n        const fallback = 'sorted-native'\n        if (!threw) {\n          // The slot contract check is dev only (§3.4 slotContract); the fallback applies always.\n          if ((process.env.NODE_ENV !== \"production\")) {\n            ctx.emit('DK_CALLBACK_BAD_RETURN', {\n              slot,\n              expected: `a Uint32Array of ${indices.length} row indices`,\n              received: describeReturn(value),\n              count: 1,\n              fallback,\n            })\n          }\n          return\n        }\n        const name = errorName(value)\n        ctx.emit(\n          'DK_CALLBACK_FAILED',\n          {\n            slot,\n            count: 1,\n            fallback,\n            ...(name === undefined ? {} : { errorName: name }),\n          },\n          { cause: value },\n        )\n      }\n\n      // At most one retry per entry: each failing sortFn falls back to the default comparator.\n      for (;;) {\n        try {\n          const out = sortOnce()\n          if (opts.debug) {\n            ctx.emit('DK_SORT_STRATEGY', {\n              algorithm,\n              reason,\n              n: indices.length,\n              ms: now() - t0,\n              by: by.map((e) => `${String(e.id)}:${e.desc ? 'desc' : 'asc'}`),\n              ...(primary.col ? { column: { index: primary.col.index, id: primary.col.id } } : {}),\n            })\n          }\n          shown = { input: indices, output: out }\n          return out\n        } catch (e) {\n          if (!(e instanceof SortFnFailed)) throw e\n          const entry = entries[e.entry] as (typeof entries)[number]\n          entry.sortFn = undefined\n          const col = entry.col as ResolvedColumn\n          const name = errorName(e.error)\n          ctx.emit(\n            'DK_CALLBACK_FAILED',\n            {\n              slot: `columns[${col.index}].sortFn`,\n              column: col.id,\n              count: 1,\n              fallback: 'sorted-default',\n              ...(name === undefined ? {} : { errorName: name }),\n            },\n            { cause: e.error },\n          )\n        }\n      }\n    },\n  })\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mBAAkC;AAClC,qBAA8B;AAC9B,mBAA+B;AAE/B,uBAAsC;AAEtC,qBAAgC;AAChC,2BAAO;AAEP,oBAA8B;AAE9B,wBAA6B;AAC7B,sBAA0B;AAC1B,IAAAA,gBAAoC;AACpC,qBAAoD;AACpD,uBAA+B;AAC/B,qBAAwB;AACxB,mBAAuB;AAEvB,kBAA0C;AAC1C,wBAAgD;AAChD,IAAAA,gBAA0D;AAC1D,qBAMO;AACP,mBAA+B;AAC/B,sBAOO;AAAA,IAEP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAWA,IAAM,UAAU,CACd,KACA,OACG,IAAI,SAAS,CAAC,MAAO,KAAK,UAAU,EAAE,EAAE,MAAM,KAAK,UAAU,EAAE,IAAI,IAAI,EAAE,IAAI,GAAG,MAAM,EAAE,CAAE;AA8C/F,IAAM,cAAc,CAAC,MAAe;AAClC,MAAI;AACF,SAAK,oBAAoB,CAAsB;AAC/C,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,aAAa,CAAC,QAAQ,OAAO,SAAS,YAAY,QAAQ;AAEhE,IAAM,iBAAiB;AAAA,EACrB,QAAQ;AAAA,IACN,MAAM,CAAC,UAAU,OAAO;AAAA,IACxB,OAAO;AAAA,IACP,UAAU;AAAA,EACZ;AAAA,EACA,WAAW;AAAA,IACT,MAAM,CAAC,UAAU,UAAU;AAAA,IAC3B,OAAO;AAAA;AAAA,IAEP,UACE;AAAA,EACJ;AAAA,EACA,OAAO,EAAE,MAAM,UAAU;AAAA,EACzB,MAAM;AACR;AAIA,IAAM,MAAM,MAAO,OAAO,gBAAgB,cAAc,KAAK,IAAI,IAAI,YAAY,IAAI;AAOrF,IAAM,YAAY;AAElB,IAAM,UAAU,CAAC,UAAe,yBAAS,CAAC,MAAM,oBAAK;AAOrD,SAAS,YACP,IACA,QACA,SACkF;AAClF,QAAM,SAAoB,CAAC;AAC3B,QAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,SAAS,CAAC,CAAC;AACvD,WAAS,IAAI,GAAG,IAAI,QAAQ,UAAU,OAAO,SAAS,GAAG,KAAK,MAAM;AAClE,UAAM,IAAI,OAAO,QAAQ,CAAC,CAAW;AACrC,QAAI,CAAC,QAAQ,CAAC,EAAG,QAAO,KAAK,CAAC;AAAA,EAChC;AACA,MAAI;AACF,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,cAAM,IAAI,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACjC,cAAM,IAAI,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACjC,mBAAW,KAAK,CAAC,GAAG,CAAC,GAAG;AACtB,cAAI,OAAO,MAAM,SAAU,QAAO,EAAE,QAAQ,cAAc,cAAU,6BAAe,CAAC,EAAE;AACtF,cAAI,OAAO,MAAM,CAAC,EAAG,QAAO,EAAE,QAAQ,MAAM;AAAA,QAC9C;AACA,YAAI,KAAK,KAAK,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,EAAG,QAAO,EAAE,QAAQ,eAAe;AAAA,MACtE;AAAA,IACF;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAKA,IAAM,UAAU,CAAC,KAAa,UAA+B;AAC3D,QAAM,IAAK,IAAgC,KAAK;AAChD,SAAO,OAAO,MAAM,aAAa,IAAI;AACvC;AAGA,IAAM,eAAN,MAAmB;AAAA,EACjB,YACW,OACA,OACT;AAFS;AACA;AAAA,EACR;AACL;AAcO,IAAM,UAAU,CAAC,OAAuB,CAAC,MAAM;AACpD,MAAI;AAEJ,QAAM,cAAc,CAAC,SAAe;AAClC,QAAI,SAAU,QAAO;AACrB,UAAM,SAAU,KAAK,UAAU;AAC/B,QAAI,YAAY;AAChB,QAAI;AACF,iBAAW,IAAI,KAAK,SAAS,QAAQ,EAAE,SAAS,KAAK,CAAC;AACtD,kBAAY,KAAK,SAAS,mBAAmB,MAAM,EAAE,SAAS;AAAA,IAChE,QAAQ;AACN,iBAAW,IAAI,KAAK,SAAS,QAAW,EAAE,SAAS,KAAK,CAAC;AACzD,kBAAY;AAAA,IACd;AACA,QAAI,CAAC,WAAW;AACd,WAAK,mBAAmB;AAAA,QACtB,KAAK;AAAA,QACL,SAAS;AAAA,QACT,WAAY,CAAC,EAAe,OAAO,MAAM,EAAE,KAAK,IAAI;AAAA,QACpD,UAAU,aAAa,SAAS,gBAAgB,EAAE,MAAM;AAAA,MAC1D,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAGA,QAAM,WAAW,oBAAI,QAAwB;AAC7C,WAAS,SAAS,KAAsB,QAA4B;AAClE,QAAI,MAAM,SAAS,IAAI,MAAM;AAC7B,QAAI,CAAC,KAAK;AACR,YAAM,CAAC;AACP,eAAS,IAAI,QAAQ,GAAG;AAAA,IAC1B;AACA,UAAM,IAAI,YAAY,IAAI,IAAI;AAC9B,eAAO,qBAAO,KAAK,KAAK,UAAM,6BAAe,QAAQ,CAAC,CAAC;AAAA,EACzD;AAEA,MAAI;AAGJ,QAAM,cAAc,oBAAI,QAAwD;AAChF,QAAM,YAAY,oBAAI,QAAoD;AAE1E,MAAI;AAGJ,QAAM,iBAAiB,IAAI,+BAAa;AAOxC,WAAS,aAAa,KAAsB,KAAqB,QAA2B;AAC1F,UAAM,OAAO,IAAI;AACjB,QAAI,QAAQ,YAAY,IAAI,IAAI;AAChC,QAAI,CAAC,OAAO;AACV,cAAQ,oBAAI,QAAQ;AACpB,kBAAY,IAAI,MAAM,KAAK;AAAA,IAC7B;AACA,QAAI,MAAM,MAAM,IAAI,IAAI,GAAG;AAC3B,QAAI,IAAK,QAAO;AAChB,UAAM,SAAoB,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK,MAAS;AAC/D,UAAM,WAAO,wBAAQ,IAAI;AACzB,mBAAe,MAAM;AACrB,QAAI,MAAM,IAAI,IAAI,UAAU,MAAM,MAAM;AACtC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAM,IAAI,KAAK,CAAC;AAChB,YAAI;AACF,iBAAO,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC;AAAA,QAC5B,SAAS,GAAG;AACV,yBAAe,IAAI,GAAG,CAAC;AAAA,QACzB;AAAA,MACF;AACA,qBAAe,OAAO,IAAI,MAAM,IAAI,OAAO,IAAI,IAAI,QAAQ;AAAA,IAC7D,CAAC;AACD,mBAAe,MAAM;AACrB,UAAM;AACN,UAAM,IAAI,IAAI,KAAK,GAAG;AACtB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,KAAsB,IAAuB;AAC/D,UAAM,OAAO,IAAI;AACjB,QAAI,OAAO,UAAU,IAAI,IAAI;AAC7B,QAAI,CAAC,MAAM;AACT,aAAO,oBAAI,IAAI;AACf,gBAAU,IAAI,MAAM,IAAI;AAAA,IAC1B;AACA,QAAI,MAAM,KAAK,IAAI,EAAE;AACrB,QAAI,IAAK,QAAO;AAChB,UAAM,WAAO,8BAAY,EAAE;AAC3B,UAAM,IAAI,MAAM,KAAK,MAAM;AAC3B,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,KAAI,CAAC,QAAI,2BAAS,KAAK,CAAC,GAAG,IAAI;AACrE,SAAK,IAAI,IAAI,GAAG;AAChB,WAAO;AAAA,EACT;AAEA,aAAO,6BAAuC;AAAA,IAC5C,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM,KAAK,QAAQ;AAAA,IACnB,aAAS;AAAA;AAAA,MAEN,QAAQ,IAAI,aAAa,eAAgB,iBAAkB,CAAC;AAAA,MAC7D;AAAA,IACF;AAAA,IACA,cAAc,OAAO,EAAE,IAAI,CAAC,EAAE;AAAA;AAAA,IAE9B,iBAAiB,EAAE,kBAAkB,MAAM,MAAM;AAAA,IACjD,WAAW,CAAC,SAAS;AAAA,MACnB,YAAY,CAAC,IAAI,YACf,IAAI,SAAS,CAAC,MAAM;AAClB,cAAM,KAAK,EAAE;AACb,cAAM,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE;AACzC,cAAM,MAAM,GAAG,CAAC;AAChB,cAAM,OAAO,CAAC,MAAM,EAAE,IAAI,MAAM,MAAM,IAAI,IAAI,OAAO,SAAY,EAAE,IAAI,MAAM,KAAK;AAClF,YAAI,CAAC,SAAS,MAAO,QAAO,EAAE,IAAI,OAAO,CAAC,IAAI,IAAI,CAAC,EAAE;AACrD,YAAI,CAAC,IAAK,QAAO,EAAE,IAAI,CAAC,GAAG,IAAI,IAA0B,EAAE;AAC3D,cAAM,MAAM,GAAG,MAAM;AACrB,YAAI,KAAM,KAAI,CAAC,IAAI;AAAA,YACd,KAAI,OAAO,GAAG,CAAC;AACpB,eAAO,EAAE,IAAI,IAAI;AAAA,MACnB,CAAC;AAAA,MACH,YAAY,CAAC,OAAO,QAAQ,KAAK,EAAE;AAAA,MACnC,cAAc,MAAM,QAAQ,KAAK,CAAC,CAAC;AAAA,MACnC,kBAAkB,CAAC,OAAO;AACxB,cAAM,IAAI,IAAI,SAAS,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AACnD,eAAO,IAAK,EAAE,OAAO,SAAS,QAAS;AAAA,MACzC;AAAA,IACF;AAAA,IACA,UAAU,CAAC,SAAS,OAAO,QAAQ;AACjC,YAAM,KAAK,OAAO;AAClB,UAAI,CAAC,MAAM,GAAG,WAAW,KAAK,QAAQ,SAAS,GAAG;AAChD,gBAAQ;AACR,eAAO;AAAA,MACT;AACA,YAAM,KAAK,KAAK,QAAQ,IAAI,IAAI;AAChC,YAAM,WAAO,+BAAe,IAAI,OAAO;AACvC,YAAM,UAAU,GAAG,IAAI,CAAC,MAAM;AAC5B,cAAM,KAAK,OAAO,EAAE,EAAE;AACtB,cAAM,MAAM,KAAK,KAAK,IAAI,EAAE;AAC5B,cAAM,SAAS,OAAQ,QAAQ,IAAI,KAAK,QAAQ;AAChD,cAAM,SAAuB,SACzB,aAAa,KAAK,KAAK,MAAM,IAC5B,IAAI,gBAAgB,EAAE,KAAK,WAAW,KAAK,EAAE;AAClD,cAAM,SACJ,OAAO,CAAC,SAAU,QAAQ,IAAI,KAAK,QAAQ,IAA2B;AACxE,eAAO,EAAE,KAAK,MAAM,EAAE,SAAS,MAAM,QAAQ,QAAQ,QAAQ,MAAM;AAAA,MACrE,CAAC;AAGD,UAAK,QAAQ,IAAI,aAAa,cAAe;AAC3C,mBAAW,KAAK,SAAS;AACvB,cAAI,CAAC,EAAE,OAAQ;AACf,gBAAM,MAAM,YAAY,EAAE,QAAQ,EAAE,QAAQ,OAAO;AACnD,cAAI,CAAC,IAAK;AACV,YAAE,SAAS;AACX,gBAAM,MAAM,EAAE;AACd,cAAI,KAAK,8BAA8B,EAAE,QAAQ,IAAI,IAAI,OAAO,IAAI,OAAO,GAAG,IAAI,CAAC;AAAA,QACrF;AAAA,MACF;AAGA,YAAM,UAAU,QAAQ,CAAC;AACzB,YAAM,eACJ,QAAQ,OAAQ,QAAQ,IAAI,IAAoC;AAClE,YAAM,aAAa,iBAAiB;AACpC,UAAI,YAAa,aAAa,eAAgB,KAAK,aAAa;AAChE,YAAM,WAAW,CAACC,YAChB,IAAI;AAAA,QACF;AAAA,QACA,aACI,EAAE,MAAM,WAAW,QAAQ,KAAK,KAAK,mBAAmB,QAAAA,SAAQ,MAAM,MAAM,IAC5E,EAAE,MAAM,aAAa,SAAS,WAAW,QAAAA,SAAQ,MAAM,MAAM;AAAA,MACnE;AACF,UACE,OAAO,cAAc,cACrB,CAAE,WAAkC,SAAS,SAAS,GACtD;AACA,iBAAS,iBAAiB,KAAK,UAAU,SAAS,CAAC,EAAE;AACrD,oBAAY;AAAA,MACd;AACA,UAAI,cAAc,YAAY,aAAa,QAAW;AAEpD,mBAAY,QAAQ,IAAI,aAAa,mBACjC;AAAA,UACE;AAAA,UACA;AAAA,YACE,SAAS;AAAA,YACT,YAAY;AAAA,YACZ,YAAY;AAAA,YACZ,WAAW;AAAA,YACX,UAAU;AAAA,UACZ;AAAA,UACA,IAAI;AAAA,QACN,QACA,iCAAc,2BAAW;AAAA,MAC/B;AAGA,UAAI,cAAc,UAAU,QAAQ,UAAU,WAAW;AACvD,YAAI,YAAY;AAChB,mBAAW,KAAK,SAAS;AACvB,cAAI,EAAE,UAAU,EAAE,kBAAkB,aAAc;AAClD,gBAAM,QAAQ,SAAS,KAAK,EAAE,MAAM;AACpC,cAAI,UAAU,OAAW,aAAY;AAAA,mBAC5B,OAAO;AACd,cAAE,SAAS;AACX,cAAE,SAAS;AAAA,UACb;AAAA,QACF;AAEA,YAAI,UAAW,QAAO,SAAS,MAAM,UAAU,UAAU,MAAM,SAAS;AAAA,MAC1E;AACA,YAAM,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,MAAM;AAE3C,YAAM,QAAQ,MAAuB;AACnC,cAAM,OAAO,QAAQ,IAAI,CAAC,GAAG,MAAM;AACjC,gBAAM,KAAK,EAAE;AACb,cAAI,CAAC,GAAI,YAAO,uCAAuB,EAAE,QAAQ,EAAE,MAAM,YAAY,IAAI,IAAI,CAAC;AAC9E,gBAAM,UAAkB,CAAC,GAAG,MAAM;AAChC,gBAAI;AACF,qBAAO,GAAG,GAAG,CAAC;AAAA,YAChB,SAAS,OAAO;AACd,oBAAM,IAAI,aAAa,GAAG,KAAK;AAAA,YACjC;AAAA,UACF;AACA,qBAAO,sCAAsB,EAAE,QAAQ,EAAE,MAAM,OAAO;AAAA,QACxD,CAAC;AACD,YAAI,KAAK,WAAW,EAAG,QAAO,KAAK,CAAC;AACpC,eAAO,CAAC,GAAG,MAAM;AACf,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,kBAAM,IAAK,KAAK,CAAC,EAAsB,GAAG,CAAC;AAC3C,gBAAI,MAAM,EAAG,QAAO;AAAA,UACtB;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,YAAoB;AACxB,UAAI,SAAS;AAEb,YAAM,WAAW,MAAmB;AAClC,cAAM,OAAO;AACb,YAAI,OAAO,SAAS,YAAY;AAC9B,gBAAM,SAAS;AACf,cAAI;AACJ,cAAI;AACF,kBAAM,OAAO,QAAQ,MAAM,GAAG,MAAM,CAAC;AAAA,UACvC,SAAS,OAAO;AACd,gBAAI,iBAAiB,aAAc,OAAM;AACzC,yBAAa,MAAM,KAAK;AACxB,mBAAO,OAAO,cAAc;AAAA,UAC9B;AACA,cAAI,eAAe,eAAe,IAAI,WAAW,QAAQ,QAAQ;AAC/D,wBAAY;AACZ,qBAAS,aAAa,yBAAyB;AAC/C,mBAAO;AAAA,UACT;AACA,uBAAa,OAAO,GAAG;AACvB,iBAAO,OAAO,YAAY;AAAA,QAC5B;AACA,YAAI,aAAa,MAAO,QAAO,OAAO,sBAAsB;AAC5D,cAAMC,MAAK,aAAa,yBAAyB;AAEjD,cAAM,SAAS,QAAQ,WAAW,KAAK,CAAC,QAAQ;AAChD,cAAM,OACJ,UAAU,SAAS,eAAW,yBAAQ,QAAQ,QAAQ,SAAS,QAAQ,IAAI,IAAI;AACjF,YAAI,SAAS,UAAU,SAAS,UAAU;AACxC,cAAI,MAAM;AACR,gBAAI;AACF,oBAAM,UAAM,6BAAY,MAAM,IAAI;AAClC,0BAAY;AACZ,uBAAS,YAAYA,GAAE;AACvB,qBAAO;AAAA,YACT,QAAQ;AACN,uBAAS,YAAY,SAAS,aAAa,UAAU,QAAQ,IAAI,IAAI,EAAE;AAAA,YACzE;AAAA,UACF,eAAW,8BAAa,IAAI,GAAG;AAC7B,qBAAS,kBAAkB,IAAI,EAAE;AAAA,UACnC,OAAO;AACL,wBAAY;AACZ,qBAASA;AACT,uBAAO,oCAAmB,SAAS,MAAM,GAAG,IAAa;AAAA,UAC3D;AAAA,QACF,WAAW,SAAS,SAAU,QAAO,OAAOA,GAAE;AAC9C,YAAI,CAAC,MAAM;AACT,iBAAO;AAAA,YACL,SAAS,iBAAiB,QAAQ,SAAS,IAAI,iBAAiB;AAAA,UAClE;AAAA,QACF;AACA,cAAM,aAAS,4BAAW,IAAI;AAC9B,oBAAY,OAAO;AACnB,iBAAS,QAAQ,SAAS,YAAY,EAAE,GAAG,OAAO,MAAM;AACxD,mBAAO,6BAAY,MAAM,OAAO,SAAS;AAAA,MAC3C;AACA,YAAM,SAAS,CAAC,QAAgB;AAC9B,oBAAY;AACZ,iBAAS,SAAS,SAAS,GAAG,KAAK;AACnC,mBAAO,oCAAmB,SAAS,MAAM,GAAG,QAAQ;AAAA,MACtD;AAEA,YAAM,eAAe,CAAC,OAAgB,UAAmB;AACvD,cAAM,OAAO,aACT,WAAW,QAAQ,KAAK,KAAK,oBAC7B;AACJ,cAAM,WAAW;AACjB,YAAI,CAAC,OAAO;AAEV,cAAK,QAAQ,IAAI,aAAa,cAAe;AAC3C,gBAAI,KAAK,0BAA0B;AAAA,cACjC;AAAA,cACA,UAAU,oBAAoB,QAAQ,MAAM;AAAA,cAC5C,cAAU,6BAAe,KAAK;AAAA,cAC9B,OAAO;AAAA,cACP;AAAA,YACF,CAAC;AAAA,UACH;AACA;AAAA,QACF;AACA,cAAM,WAAO,2BAAU,KAAK;AAC5B,YAAI;AAAA,UACF;AAAA,UACA;AAAA,YACE;AAAA,YACA,OAAO;AAAA,YACP;AAAA,YACA,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,UAClD;AAAA,UACA,EAAE,OAAO,MAAM;AAAA,QACjB;AAAA,MACF;AAGA,iBAAS;AACP,YAAI;AACF,gBAAM,MAAM,SAAS;AACrB,cAAI,KAAK,OAAO;AACd,gBAAI,KAAK,oBAAoB;AAAA,cAC3B;AAAA,cACA;AAAA,cACA,GAAG,QAAQ;AAAA,cACX,IAAI,IAAI,IAAI;AAAA,cACZ,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,OAAO,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,SAAS,KAAK,EAAE;AAAA,cAC9D,GAAI,QAAQ,MAAM,EAAE,QAAQ,EAAE,OAAO,QAAQ,IAAI,OAAO,IAAI,QAAQ,IAAI,GAAG,EAAE,IAAI,CAAC;AAAA,YACpF,CAAC;AAAA,UACH;AACA,kBAAQ,EAAE,OAAO,SAAS,QAAQ,IAAI;AACtC,iBAAO;AAAA,QACT,SAAS,GAAG;AACV,cAAI,EAAE,aAAa,cAAe,OAAM;AACxC,gBAAM,QAAQ,QAAQ,EAAE,KAAK;AAC7B,gBAAM,SAAS;AACf,gBAAM,MAAM,MAAM;AAClB,gBAAM,WAAO,2BAAU,EAAE,KAAK;AAC9B,cAAI;AAAA,YACF;AAAA,YACA;AAAA,cACE,MAAM,WAAW,IAAI,KAAK;AAAA,cAC1B,QAAQ,IAAI;AAAA,cACZ,OAAO;AAAA,cACP,UAAU;AAAA,cACV,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,YAClD;AAAA,YACA,EAAE,OAAO,EAAE,MAAM;AAAA,UACnB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACH;","names":["import_codes","reason","by"]}

package/dist/features/sorting/sorting.js

@@ -4,6 +4,7 @@ import { defineOptions } from "../../catalog/options.js";
 import { describeReturn } from "../../catalog/slots.js";
 import { compilePath, getValue } from "../../column/get-value.js";
 import { keepDiagnostics } from "../../diagnostics/catalog.js";
+import "../../diagnostics/process-guard.js";
 import { defineFeature } from "../../feature/define.js";
 import { CellFailures } from "../../intercept/cell-batch.js";
 import { errorName } from "../../intercept/classify.js";
@@ -37,6 +38,7 @@ keepDiagnostics(
   optionDiagnostics,
   envDiagnostics
 );
+var setSort = (ctx, by) => ctx.setState((s) => JSON.stringify(s.by) === JSON.stringify(by) ? s : { by: by.slice() });
 var validLocale = (v) => {
   try {
     Intl.getCanonicalLocales(v);
@@ -116,7 +118,7 @@ var sorting = (opts = {}) => {
         api: "Intl.Collator",
         feature: "sorting",
         requested: [].concat(locale).join(", "),
-        fallback: `the runtime's collation for "${collator.resolvedOptions().locale}"`
+        fallback: `collation|${collator.resolvedOptions().locale}`
       });
     }
     return collator;
@@ -204,8 +206,8 @@ var sorting = (opts = {}) => {
         else out.splice(i, 1);
         return { by: out };
       }),
-      setSorting: (by) => ctx.setState({ by: by.slice() }),
-      clearSorting: () => ctx.setState({ by: [] }),
+      setSorting: (by) => setSort(ctx, by),
+      clearSorting: () => setSort(ctx, []),
       getSortDirection: (id) => {
         const e = ctx.getState().by.find((x) => x.id === id);
         return e ? e.desc ? "desc" : "asc" : false;
@@ -246,9 +248,7 @@ var sorting = (opts = {}) => {
         fromColumn ? { path: `columns[${primary.col?.index}].sortAlgorithm`, reason: reason2, once: false } : { path: "algorithm", feature: "sorting", reason: reason2, once: false }
       );
       if (typeof requested !== "function" && !ALGORITHMS.includes(requested)) {
-        noEffect(
-          `${JSON.stringify(requested)} is not a sort algorithm (accepted: ${ALGORITHMS.join(", ")}, or a function); auto was used`
-        );
+        noEffect(`not-algorithm|${JSON.stringify(requested)}`);
         requested = "auto";
       }
       if (requested !== "native" && exsorted === void 0) {
@@ -312,7 +312,7 @@ var sorting = (opts = {}) => {
           } catch (error) {
             if (error instanceof SortFnFailed) throw error;
             reportCustom(true, error);
-            return native("the custom algorithm threw");
+            return native("custom-threw");
           }
           if (res instanceof Uint32Array && res.length === indices.length) {
             algorithm = "custom";
@@ -320,7 +320,7 @@ var sorting = (opts = {}) => {
             return res;
           }
           reportCustom(false, res);
-          return native("the custom algorithm returned a bad value");
+          return native("custom-bad");
         }
         if (exsorted === false) return native("exsorted unavailable");
         const by2 = fromColumn ? "column sortAlgorithm" : "sorting({ algorithm })";
@@ -331,17 +331,13 @@ var sorting = (opts = {}) => {
             try {
               const out = sortIntKeys(keys, want);
               algorithm = want;
-              reason = `${by2}, safe-integer keys`;
+              reason = `int-keys|${by2}`;
               return out;
             } catch {
-              noEffect(
-                `exsorted ${want}Sort could not sort these keys` + (want === "counting" ? " (key range above 1,000,000)" : "") + "; auto was used"
-              );
+              noEffect(`exsorted-${want === "counting" ? "range" : "failed"}|${want}`);
             }
           } else if (needsIntKeys(want)) {
-            noEffect(
-              `${want} sorts a single column of safe integer keys (numbers or Dates, no sortFn); auto was used`
-            );
+            noEffect(`needs-int-keys|${want}`);
           } else {
             algorithm = want;
             reason = by2;
@@ -350,22 +346,22 @@ var sorting = (opts = {}) => {
         } else if (want === "native") return native(by2);
         if (!keys) {
           return native(
-            single ? "keys are not all safe integers" : entries.length > 1 ? "multi-column" : "custom sortFn"
+            single ? "not-safe-int" : entries.length > 1 ? "multi-column" : "custom sortFn"
           );
         }
         const choice = chooseAuto(keys);
         algorithm = choice.algorithm;
-        reason = `auto: ${ranked ? "collation ranks of a string column, " : ""}${choice.reason}`;
+        reason = `auto-${ranked ? "ranked-" : ""}${choice.reason}`;
         return sortIntKeys(keys, choice.algorithm);
       };
       const native = (why) => {
         algorithm = "native";
-        reason = ranked ? `${why}, strings as collation ranks` : why;
+        reason = ranked ? `ranks|${why}` : why;
         return sortWithComparator(indices, build(), "native");
       };
       const reportCustom = (threw, value) => {
         const slot = fromColumn ? `columns[${primary.col?.index}].sortAlgorithm` : "sorting.algorithm";
-        const fallback = "the rows were sorted with the native algorithm";
+        const fallback = "sorted-native";
         if (!threw) {
           if (process.env.NODE_ENV !== "production") {
             ctx.emit("DK_CALLBACK_BAD_RETURN", {
@@ -417,7 +413,7 @@ var sorting = (opts = {}) => {
               slot: `columns[${col.index}].sortFn`,
               column: col.id,
               count: 1,
-              fallback: "the column was sorted with the default comparator",
+              fallback: "sorted-default",
               ...name === void 0 ? {} : { errorName: name }
             },
             { cause: e.error }

package/dist/features/sorting/sorting.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/features/sorting/sorting.ts"],"sourcesContent":["import { optionDiagnostics } from '../../catalog/codes'\nimport { defineOptions } from '../../catalog/options'\nimport { describeReturn } from '../../catalog/slots'\nimport type { SortAlgorithm } from '../../column/column-def'\nimport { compilePath, getValue } from '../../column/get-value'\nimport type { Path } from '../../column/path'\nimport { keepDiagnostics } from '../../diagnostics/catalog'\nimport type { Emit } from '../../diagnostics/types'\nimport { defineFeature } from '../../feature/define'\nimport type { FeatureTypes, RowModelContext } from '../../feature/types'\nimport { CellFailures } from '../../intercept/cell-batch'\nimport { errorName } from '../../intercept/classify'\nimport { boundaryDiagnostics } from '../../intercept/codes'\nimport { type ResolvedColumn, resolveColumns } from '../../pipeline/columns'\nimport { envDiagnostics } from '../../pipeline/env-codes'\nimport { allRows } from '../../pipeline/indices'\nimport { sliced } from '../../pipeline/slice'\nimport type { ColumnValues } from '../../pipeline/types'\nimport { type DataMode, modeOption } from '../../source/mode'\nimport { detectCapability, hasCapability } from '../../versioning/capability'\nimport { comparatorDiagnostics, sortingDiagnostics } from './codes'\nimport {\n  defaultIndexComparator,\n  type IndexComparator,\n  RANK,\n  sortFnIndexComparator,\n  typeRank,\n} from './compare'\nimport { collationRanks } from './ranks'\nimport {\n  chooseAuto,\n  hasExsorted,\n  intKeys,\n  needsIntKeys,\n  sortIntKeys,\n  sortWithComparator,\n} from './strategy'\n\nkeepDiagnostics(\n  sortingDiagnostics,\n  comparatorDiagnostics,\n  boundaryDiagnostics,\n  optionDiagnostics,\n  envDiagnostics,\n)\n\n/** One sort key: a column id (a path of the row type) and its direction. */\nexport type SortEntry<T> = { id: Path<T>; desc: boolean }\n\n/** The `sorting` slice (§6.4): multi-column, earlier entries first. Empty = unsorted. */\nexport type SortingState<T> = { by: readonly SortEntry<T>[] }\n\nexport type SortDirection = 'asc' | 'desc'\n\nexport type SortingApi<T> = {\n  /**\n   * Cycles `id` asc → desc → none. Without `multi` the result is a single-column sort; with `multi`\n   * (Shift+click) `id` is appended, cycled in place or removed and the other entries are kept.\n   */\n  toggleSort(id: Path<T>, options?: { multi?: boolean }): void\n  /** Replaces the whole sort. */\n  setSorting(by: readonly SortEntry<T>[]): void\n  /** Removes every sort entry (input order). */\n  clearSorting(): void\n  /** `id`'s direction in the current sort, or `false` (for `aria-sort`). */\n  getSortDirection(id: Path<T>): SortDirection | false\n}\n\nexport interface SortingTypes extends FeatureTypes {\n  state: SortingState<this['T']>\n  api: SortingApi<this['T']>\n}\n\n/**\n * How rows are sorted (§6.4): `'auto'` (default) picks per sort from one O(n) scan — exsorted\n * tim / counting / radix for a single column of safe-integer keys (numbers, `Date`s), native\n * `Array.prototype.sort` otherwise. A built-in name forces that algorithm (radix / counting only\n * apply to safe-integer keys); a function sorts the row indices itself.\n */\nexport type SortAlgorithmOption = SortAlgorithm\n\nexport interface SortingOptions {\n  /**\n   * Locale(s) of the string collator (`Intl.Collator(locale, { numeric: true })`). Default `'en'`,\n   * not the runtime's: the server and the browser must sort alike (SSR hydration, #12).\n   */\n  locale?: string | readonly string[]\n  /** The sort algorithm (default `'auto'`); a column's `sortAlgorithm` takes precedence. */\n  algorithm?: SortAlgorithmOption\n  /** Reports the algorithm chosen for each sort, why, n and the time taken (`DK_SORT_STRATEGY`). */\n  debug?: boolean\n  /**\n   * `'server'`: the server sorts (its state goes to `options.fetcher`, or the app fetches); core\n   * skips this step (§7.1). Default `'client'`.\n   */\n  mode?: DataMode\n}\n\nconst validLocale = (v: unknown) => {\n  try {\n    Intl.getCanonicalLocales(v as string | string[])\n    return true\n  } catch {\n    return false\n  }\n}\n\nconst ALGORITHMS = ['auto', 'tim', 'radix', 'counting', 'native'] as const\n\nconst sortingOptions = {\n  locale: {\n    type: ['string', 'array'],\n    check: validLocale,\n    expected: 'a BCP 47 locale tag or a list of them, e.g. \"th\" or [\"th\", \"en\"]',\n  },\n  algorithm: {\n    type: ['string', 'function'],\n    oneOf: ALGORITHMS,\n    // A literal (not built from ALGORITHMS): a module-level call would keep the schema in production.\n    expected:\n      \"one of 'auto', 'tim', 'radix', 'counting', 'native', or (indices, compare) => indices\",\n  },\n  debug: { type: 'boolean' },\n  mode: modeOption,\n} as const\n\ntype CustomAlgorithm = Extract<SortAlgorithm, (...args: never[]) => unknown>\n\nconst now = () => (typeof performance === 'undefined' ? Date.now() : performance.now())\n\n/**\n * From this many rows, `auto` sorts a string column by precomputed collation ranks (§9.1): one\n * time-sliced job per column values, then integer-key sorts (a few ms at 100k rows) instead of a\n * collator call per comparison (~100–200 ms at 100k, one long task).\n */\nconst RANKS_MIN = 10_000\n\nconst missing = (v: unknown) => typeRank(v) === RANK.missing\n\n/**\n * Dev check of a column's `sortFn` (§8.3 `DK_SORT_COMPARATOR_INVALID`), sampled: up to 8 present\n * values spread over the input, every pair both ways. A throw gives no verdict (the sort reports\n * it as `DK_CALLBACK_FAILED`).\n */\nfunction checkSortFn(\n  fn: SortFn,\n  values: ColumnValues,\n  indices: Uint32Array,\n): { reason: 'nan' | 'not-number' | 'inconsistent'; received?: string } | undefined {\n  const sample: unknown[] = []\n  const step = Math.max(1, Math.floor(indices.length / 8))\n  for (let i = 0; i < indices.length && sample.length < 8; i += step) {\n    const v = values[indices[i] as number]\n    if (!missing(v)) sample.push(v)\n  }\n  try {\n    for (let i = 0; i < sample.length; i++) {\n      for (let j = i; j < sample.length; j++) {\n        const x = fn(sample[i], sample[j])\n        const y = fn(sample[j], sample[i])\n        for (const r of [x, y]) {\n          if (typeof r !== 'number') return { reason: 'not-number', received: describeReturn(r) }\n          if (Number.isNaN(r)) return { reason: 'nan' }\n        }\n        if (Math.sign(x) !== -Math.sign(y)) return { reason: 'inconsistent' }\n      }\n    }\n  } catch {\n    return undefined\n  }\n  return undefined\n}\n\ntype SortFn = (a: unknown, b: unknown) => number\ntype SortBy = (row: unknown) => unknown\n\nconst fnField = (def: object, field: 'sortFn' | 'sortBy') => {\n  const f = (def as Record<string, unknown>)[field]\n  return typeof f === 'function' ? f : undefined\n}\n\n/** Aborts a native sort when a column's `sortFn` throws (the entry then falls back). */\nclass SortFnFailed {\n  constructor(\n    readonly entry: number,\n    readonly error: unknown,\n  ) {}\n}\n\n/**\n * Sorting (§6.4): `toggleSort` (asc → desc → none, `multi`), stable sort of the row indices with\n * the default comparator — missing values (`null`, `undefined`, `NaN`, invalid `Date`) last in both\n * directions, mixed types by type rank, strings with one `Intl.Collator(locale, { numeric: true })`\n * — or a column's `sortFn` / `sortBy`. Never touches the data: a copy of the index array is sorted.\n *\n * `algorithm: 'auto'` (default) picks per sort from one O(n) scan (§6.4): exsorted tim / counting /\n * radix for a single column of safe-integer keys (numbers, `Date`s), native `Array.prototype.sort`\n * (stable) for strings, floats, multi-column and `sortFn`. Every choice gives the same stable order.\n * `sorting({ algorithm })` or a column's `sortAlgorithm` overrides it; `debug: true` reports each\n * choice (`DK_SORT_STRATEGY`).\n */\nexport const sorting = (opts: SortingOptions = {}) => {\n  let collator: Intl.Collator | undefined\n  /** The collator; `DK_ENV_FALLBACK` when the runtime supports none of the requested locales. */\n  const getCollator = (emit: Emit) => {\n    if (collator) return collator\n    const locale = (opts.locale ?? 'en') as string | string[]\n    let supported = true\n    try {\n      collator = new Intl.Collator(locale, { numeric: true })\n      supported = Intl.Collator.supportedLocalesOf(locale).length > 0\n    } catch {\n      collator = new Intl.Collator(undefined, { numeric: true })\n      supported = false\n    }\n    if (!supported) {\n      emit('DK_ENV_FALLBACK', {\n        api: 'Intl.Collator',\n        feature: 'sorting',\n        requested: ([] as string[]).concat(locale).join(', '),\n        fallback: `the runtime's collation for \"${collator.resolvedOptions().locale}\"`,\n      })\n    }\n    return collator\n  }\n\n  /** Values array → the key of its collation-ranks job (`ctx.slice`); released with the values. */\n  const rankKeys = new WeakMap<object, object>()\n  function ranksFor(ctx: RowModelContext, values: readonly unknown[]) {\n    let key = rankKeys.get(values)\n    if (!key) {\n      key = {}\n      rankKeys.set(values, key)\n    }\n    const c = getCollator(ctx.emit)\n    return sliced(ctx, key, () => collationRanks(values, c))\n  }\n  /** The last sorted output and its input: the stand-in while ranks are computed (§9.1). */\n  let shown: { input: Uint32Array; output: Uint32Array } | undefined\n\n  // Values that the column cache does not hold, per data reference (released with it).\n  const sortByCache = new WeakMap<readonly unknown[], WeakMap<object, unknown[]>>()\n  const pathCache = new WeakMap<readonly unknown[], Map<string, unknown[]>>()\n  /** exsorted feature detection (§8.5), once per feature instance, on the first sort needing it. */\n  let exsorted: boolean | undefined\n\n  /** `sortBy` failures (§3.4): numbers only; text is built only when a cell failed. */\n  const sortByFailures = new CellFailures()\n\n  /**\n   * `sortBy` is a cell slot: one `column:batch` per column per data reference, an inline\n   * `try/catch` per row. A failed row (or a batch an interceptor skipped) keys as `undefined`,\n   * which sorts last.\n   */\n  function sortByValues(ctx: RowModelContext, col: ResolvedColumn, sortBy: SortBy): unknown[] {\n    const data = ctx.data\n    let byDef = sortByCache.get(data)\n    if (!byDef) {\n      byDef = new WeakMap()\n      sortByCache.set(data, byDef)\n    }\n    let out = byDef.get(col.def)\n    if (out) return out\n    const values: unknown[] = new Array(data.length).fill(undefined)\n    const rows = allRows(data)\n    sortByFailures.reset()\n    ctx.batch(col.id, 'sortBy', rows, () => {\n      for (let i = 0; i < rows.length; i++) {\n        const r = rows[i] as number\n        try {\n          values[r] = sortBy(data[r])\n        } catch (e) {\n          sortByFailures.add(r, e)\n        }\n      }\n      sortByFailures.report(ctx.emit, col.index, col.id, 'sortBy')\n    })\n    sortByFailures.reset()\n    out = values\n    byDef.set(col.def, out)\n    return out\n  }\n\n  function pathValues(ctx: RowModelContext, id: string): unknown[] {\n    const data = ctx.data\n    let byId = pathCache.get(data)\n    if (!byId) {\n      byId = new Map()\n      pathCache.set(data, byId)\n    }\n    let out = byId.get(id)\n    if (out) return out\n    const path = compilePath(id)\n    out = new Array(data.length)\n    for (let r = 0; r < data.length; r++) out[r] = getValue(data[r], path)\n    byId.set(id, out)\n    return out\n  }\n\n  return defineFeature<'sorting', SortingTypes>({\n    name: 'sorting',\n    stage: 'sort',\n    mode: opts.mode ?? 'client',\n    options: defineOptions(\n      // The option validator runs in development only (§9.3): production drops the schema.\n      (process.env.NODE_ENV !== \"production\") ? sortingOptions : ({} as typeof sortingOptions),\n      opts,\n    ),\n    initialState: () => ({ by: [] }),\n    // After destroy(): still a declared value (`aria-sort` reads it during teardown renders).\n    destroyedResult: { getSortDirection: () => false },\n    createApi: (ctx) => ({\n      toggleSort: (id, options) =>\n        ctx.setState((s) => {\n          const by = s.by\n          const i = by.findIndex((e) => e.id === id)\n          const cur = by[i]\n          const next = !cur ? { id, desc: false } : cur.desc ? undefined : { id, desc: true }\n          if (!options?.multi) return { by: next ? [next] : [] }\n          if (!cur) return { by: [...by, next as SortEntry<unknown>] }\n          const out = by.slice()\n          if (next) out[i] = next\n          else out.splice(i, 1)\n          return { by: out }\n        }),\n      setSorting: (by) => ctx.setState({ by: by.slice() }),\n      clearSorting: () => ctx.setState({ by: [] }),\n      getSortDirection: (id) => {\n        const e = ctx.getState().by.find((x) => x.id === id)\n        return e ? (e.desc ? 'desc' : 'asc') : false\n      },\n    }),\n    rowModel: (indices, state, ctx) => {\n      const by = state?.by\n      if (!by || by.length === 0 || indices.length < 2) {\n        shown = undefined\n        return indices\n      }\n      const t0 = opts.debug ? now() : 0\n      const cols = resolveColumns(ctx.columns)\n      const entries = by.map((e) => {\n        const id = String(e.id)\n        const col = cols.byId.get(id)\n        const sortBy = col && (fnField(col.def, 'sortBy') as SortBy | undefined)\n        const values: ColumnValues = sortBy\n          ? sortByValues(ctx, col, sortBy)\n          : (ctx.getColumnValues(id) ?? pathValues(ctx, id))\n        const sortFn =\n          col && !sortBy ? (fnField(col.def, 'sortFn') as SortFn | undefined) : undefined\n        return { col, desc: e.desc === true, values, sortFn, ranked: false }\n      })\n\n      // Dev (§8.3): a sampled sortFn check; an invalid one falls back to the default comparator.\n      if ((process.env.NODE_ENV !== \"production\")) {\n        for (const e of entries) {\n          if (!e.sortFn) continue\n          const bad = checkSortFn(e.sortFn, e.values, indices)\n          if (!bad) continue\n          e.sortFn = undefined\n          const col = e.col as ResolvedColumn\n          ctx.emit('DK_SORT_COMPARATOR_INVALID', { column: col.id, index: col.index, ...bad })\n        }\n      }\n\n      // The requested algorithm: the primary column's `sortAlgorithm`, else the table's.\n      const primary = entries[0] as (typeof entries)[number]\n      const colAlgorithm =\n        primary.col && (primary.col.def as { sortAlgorithm?: unknown }).sortAlgorithm\n      const fromColumn = colAlgorithm !== undefined\n      let requested = (fromColumn ? colAlgorithm : (opts.algorithm ?? 'auto')) as SortAlgorithm\n      const noEffect = (reason: string) =>\n        ctx.emit(\n          'DK_OPTION_NO_EFFECT',\n          fromColumn\n            ? { path: `columns[${primary.col?.index}].sortAlgorithm`, reason, once: false }\n            : { path: 'algorithm', feature: 'sorting', reason, once: false },\n        )\n      if (\n        typeof requested !== 'function' &&\n        !(ALGORITHMS as readonly unknown[]).includes(requested)\n      ) {\n        noEffect(\n          `${JSON.stringify(requested)} is not a sort algorithm (accepted: ${ALGORITHMS.join(', ')}, ` +\n            'or a function); auto was used',\n        )\n        requested = 'auto'\n      }\n      if (requested !== 'native' && exsorted === undefined) {\n        // DK_DEP_INCOMPATIBLE is a development check (§8.5); the fallback is not.\n        exsorted = (process.env.NODE_ENV !== \"production\")\n          ? detectCapability(\n              hasExsorted,\n              {\n                feature: 'sorting',\n                dependency: 'exsorted',\n                capability: 'timSort / radixSort / countingSort',\n                supported: '^1.2.3',\n                fallback: 'Array.prototype.sort (native, stable)',\n              },\n              ctx.emit,\n            )\n          : hasCapability(hasExsorted)\n      }\n\n      // auto at large n (§9.1): string columns sort by collation ranks, computed by a sliced job.\n      if (requested === 'auto' && indices.length >= RANKS_MIN) {\n        let computing = false\n        for (const e of entries) {\n          if (e.sortFn || e.values instanceof Float64Array) continue\n          const ranks = ranksFor(ctx, e.values)\n          if (ranks === undefined) computing = true\n          else if (ranks) {\n            e.values = ranks\n            e.ranked = true\n          }\n        }\n        // Meanwhile: the previous order of these rows (or the input order); 'pending'.\n        if (computing) return shown && shown.input === indices ? shown.output : indices\n      }\n      const ranked = entries.some((e) => e.ranked)\n\n      const build = (): IndexComparator => {\n        const cmps = entries.map((e, k) => {\n          const fn = e.sortFn\n          if (!fn) return defaultIndexComparator(e.values, e.desc, getCollator(ctx.emit))\n          const guarded: SortFn = (a, b) => {\n            try {\n              return fn(a, b)\n            } catch (error) {\n              throw new SortFnFailed(k, error)\n            }\n          }\n          return sortFnIndexComparator(e.values, e.desc, guarded)\n        })\n        if (cmps.length === 1) return cmps[0] as IndexComparator\n        return (a, b) => {\n          for (let k = 0; k < cmps.length; k++) {\n            const c = (cmps[k] as IndexComparator)(a, b)\n            if (c !== 0) return c\n          }\n          return 0\n        }\n      }\n\n      let algorithm: string = 'native'\n      let reason = ''\n      /** One attempt; a throwing sortFn propagates as SortFnFailed (the loop below retries). */\n      const sortOnce = (): Uint32Array => {\n        const want = requested\n        if (typeof want === 'function') {\n          const custom = want as CustomAlgorithm\n          let res: unknown\n          try {\n            res = custom(indices.slice(), build())\n          } catch (error) {\n            if (error instanceof SortFnFailed) throw error\n            reportCustom(true, error)\n            return native('the custom algorithm threw')\n          }\n          if (res instanceof Uint32Array && res.length === indices.length) {\n            algorithm = 'custom'\n            reason = fromColumn ? 'column sortAlgorithm' : 'sorting({ algorithm })'\n            return res\n          }\n          reportCustom(false, res)\n          return native('the custom algorithm returned a bad value')\n        }\n        if (exsorted === false) return native('exsorted unavailable')\n        const by = fromColumn ? 'column sortAlgorithm' : 'sorting({ algorithm })'\n        // Integer keys: a single column with the default comparator (§6.4).\n        const single = entries.length === 1 && !primary.sortFn\n        const keys =\n          single && want !== 'native' ? intKeys(primary.values, indices, primary.desc) : undefined\n        if (want !== 'auto' && want !== 'native') {\n          if (keys) {\n            try {\n              const out = sortIntKeys(keys, want)\n              algorithm = want\n              reason = `${by}, safe-integer keys`\n              return out\n            } catch {\n              noEffect(\n                `exsorted ${want}Sort could not sort these keys` +\n                  (want === 'counting' ? ' (key range above 1,000,000)' : '') +\n                  '; auto was used',\n              )\n            }\n          } else if (needsIntKeys(want)) {\n            noEffect(\n              `${want} sorts a single column of safe integer keys (numbers or Dates, no sortFn); ` +\n                'auto was used',\n            )\n          } else {\n            algorithm = want\n            reason = by\n            return sortWithComparator(indices, build(), want as 'tim')\n          }\n        } else if (want === 'native') return native(by)\n        if (!keys) {\n          return native(\n            single\n              ? 'keys are not all safe integers'\n              : entries.length > 1\n                ? 'multi-column'\n                : 'custom sortFn',\n          )\n        }\n        const choice = chooseAuto(keys)\n        algorithm = choice.algorithm\n        reason = `auto: ${ranked ? 'collation ranks of a string column, ' : ''}${choice.reason}`\n        return sortIntKeys(keys, choice.algorithm)\n      }\n      const native = (why: string) => {\n        algorithm = 'native'\n        reason = ranked ? `${why}, strings as collation ranks` : why\n        return sortWithComparator(indices, build(), 'native')\n      }\n      /** A custom algorithm threw (`threw`, `value` = the error) or returned a bad `value`. */\n      const reportCustom = (threw: boolean, value: unknown) => {\n        const slot = fromColumn\n          ? `columns[${primary.col?.index}].sortAlgorithm`\n          : 'sorting.algorithm'\n        const fallback = 'the rows were sorted with the native algorithm'\n        if (!threw) {\n          // The slot contract check is dev only (§3.4 slotContract); the fallback applies always.\n          if ((process.env.NODE_ENV !== \"production\")) {\n            ctx.emit('DK_CALLBACK_BAD_RETURN', {\n              slot,\n              expected: `a Uint32Array of ${indices.length} row indices`,\n              received: describeReturn(value),\n              count: 1,\n              fallback,\n            })\n          }\n          return\n        }\n        const name = errorName(value)\n        ctx.emit(\n          'DK_CALLBACK_FAILED',\n          {\n            slot,\n            count: 1,\n            fallback,\n            ...(name === undefined ? {} : { errorName: name }),\n          },\n          { cause: value },\n        )\n      }\n\n      // At most one retry per entry: each failing sortFn falls back to the default comparator.\n      for (;;) {\n        try {\n          const out = sortOnce()\n          if (opts.debug) {\n            ctx.emit('DK_SORT_STRATEGY', {\n              algorithm,\n              reason,\n              n: indices.length,\n              ms: now() - t0,\n              by: by.map((e) => `${String(e.id)}:${e.desc ? 'desc' : 'asc'}`),\n              ...(primary.col ? { column: { index: primary.col.index, id: primary.col.id } } : {}),\n            })\n          }\n          shown = { input: indices, output: out }\n          return out\n        } catch (e) {\n          if (!(e instanceof SortFnFailed)) throw e\n          const entry = entries[e.entry] as (typeof entries)[number]\n          entry.sortFn = undefined\n          const col = entry.col as ResolvedColumn\n          const name = errorName(e.error)\n          ctx.emit(\n            'DK_CALLBACK_FAILED',\n            {\n              slot: `columns[${col.index}].sortFn`,\n              column: col.id,\n              count: 1,\n              fallback: 'the column was sorted with the default comparator',\n              ...(name === undefined ? {} : { errorName: name }),\n            },\n            { cause: e.error },\n          )\n        }\n      }\n    },\n  })\n}\n"],"mappings":";AAAA,SAAS,yBAAyB;AAClC,SAAS,qBAAqB;AAC9B,SAAS,sBAAsB;AAE/B,SAAS,aAAa,gBAAgB;AAEtC,SAAS,uBAAuB;AAEhC,SAAS,qBAAqB;AAE9B,SAAS,oBAAoB;AAC7B,SAAS,iBAAiB;AAC1B,SAAS,2BAA2B;AACpC,SAA8B,sBAAsB;AACpD,SAAS,sBAAsB;AAC/B,SAAS,eAAe;AACxB,SAAS,cAAc;AAEvB,SAAwB,kBAAkB;AAC1C,SAAS,kBAAkB,qBAAqB;AAChD,SAAS,uBAAuB,0BAA0B;AAC1D;AAAA,EACE;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,sBAAsB;AAC/B;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAEP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAsDA,IAAM,cAAc,CAAC,MAAe;AAClC,MAAI;AACF,SAAK,oBAAoB,CAAsB;AAC/C,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,aAAa,CAAC,QAAQ,OAAO,SAAS,YAAY,QAAQ;AAEhE,IAAM,iBAAiB;AAAA,EACrB,QAAQ;AAAA,IACN,MAAM,CAAC,UAAU,OAAO;AAAA,IACxB,OAAO;AAAA,IACP,UAAU;AAAA,EACZ;AAAA,EACA,WAAW;AAAA,IACT,MAAM,CAAC,UAAU,UAAU;AAAA,IAC3B,OAAO;AAAA;AAAA,IAEP,UACE;AAAA,EACJ;AAAA,EACA,OAAO,EAAE,MAAM,UAAU;AAAA,EACzB,MAAM;AACR;AAIA,IAAM,MAAM,MAAO,OAAO,gBAAgB,cAAc,KAAK,IAAI,IAAI,YAAY,IAAI;AAOrF,IAAM,YAAY;AAElB,IAAM,UAAU,CAAC,MAAe,SAAS,CAAC,MAAM,KAAK;AAOrD,SAAS,YACP,IACA,QACA,SACkF;AAClF,QAAM,SAAoB,CAAC;AAC3B,QAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,SAAS,CAAC,CAAC;AACvD,WAAS,IAAI,GAAG,IAAI,QAAQ,UAAU,OAAO,SAAS,GAAG,KAAK,MAAM;AAClE,UAAM,IAAI,OAAO,QAAQ,CAAC,CAAW;AACrC,QAAI,CAAC,QAAQ,CAAC,EAAG,QAAO,KAAK,CAAC;AAAA,EAChC;AACA,MAAI;AACF,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,cAAM,IAAI,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACjC,cAAM,IAAI,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACjC,mBAAW,KAAK,CAAC,GAAG,CAAC,GAAG;AACtB,cAAI,OAAO,MAAM,SAAU,QAAO,EAAE,QAAQ,cAAc,UAAU,eAAe,CAAC,EAAE;AACtF,cAAI,OAAO,MAAM,CAAC,EAAG,QAAO,EAAE,QAAQ,MAAM;AAAA,QAC9C;AACA,YAAI,KAAK,KAAK,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,EAAG,QAAO,EAAE,QAAQ,eAAe;AAAA,MACtE;AAAA,IACF;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAKA,IAAM,UAAU,CAAC,KAAa,UAA+B;AAC3D,QAAM,IAAK,IAAgC,KAAK;AAChD,SAAO,OAAO,MAAM,aAAa,IAAI;AACvC;AAGA,IAAM,eAAN,MAAmB;AAAA,EACjB,YACW,OACA,OACT;AAFS;AACA;AAAA,EACR;AACL;AAcO,IAAM,UAAU,CAAC,OAAuB,CAAC,MAAM;AACpD,MAAI;AAEJ,QAAM,cAAc,CAAC,SAAe;AAClC,QAAI,SAAU,QAAO;AACrB,UAAM,SAAU,KAAK,UAAU;AAC/B,QAAI,YAAY;AAChB,QAAI;AACF,iBAAW,IAAI,KAAK,SAAS,QAAQ,EAAE,SAAS,KAAK,CAAC;AACtD,kBAAY,KAAK,SAAS,mBAAmB,MAAM,EAAE,SAAS;AAAA,IAChE,QAAQ;AACN,iBAAW,IAAI,KAAK,SAAS,QAAW,EAAE,SAAS,KAAK,CAAC;AACzD,kBAAY;AAAA,IACd;AACA,QAAI,CAAC,WAAW;AACd,WAAK,mBAAmB;AAAA,QACtB,KAAK;AAAA,QACL,SAAS;AAAA,QACT,WAAY,CAAC,EAAe,OAAO,MAAM,EAAE,KAAK,IAAI;AAAA,QACpD,UAAU,gCAAgC,SAAS,gBAAgB,EAAE,MAAM;AAAA,MAC7E,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAGA,QAAM,WAAW,oBAAI,QAAwB;AAC7C,WAAS,SAAS,KAAsB,QAA4B;AAClE,QAAI,MAAM,SAAS,IAAI,MAAM;AAC7B,QAAI,CAAC,KAAK;AACR,YAAM,CAAC;AACP,eAAS,IAAI,QAAQ,GAAG;AAAA,IAC1B;AACA,UAAM,IAAI,YAAY,IAAI,IAAI;AAC9B,WAAO,OAAO,KAAK,KAAK,MAAM,eAAe,QAAQ,CAAC,CAAC;AAAA,EACzD;AAEA,MAAI;AAGJ,QAAM,cAAc,oBAAI,QAAwD;AAChF,QAAM,YAAY,oBAAI,QAAoD;AAE1E,MAAI;AAGJ,QAAM,iBAAiB,IAAI,aAAa;AAOxC,WAAS,aAAa,KAAsB,KAAqB,QAA2B;AAC1F,UAAM,OAAO,IAAI;AACjB,QAAI,QAAQ,YAAY,IAAI,IAAI;AAChC,QAAI,CAAC,OAAO;AACV,cAAQ,oBAAI,QAAQ;AACpB,kBAAY,IAAI,MAAM,KAAK;AAAA,IAC7B;AACA,QAAI,MAAM,MAAM,IAAI,IAAI,GAAG;AAC3B,QAAI,IAAK,QAAO;AAChB,UAAM,SAAoB,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK,MAAS;AAC/D,UAAM,OAAO,QAAQ,IAAI;AACzB,mBAAe,MAAM;AACrB,QAAI,MAAM,IAAI,IAAI,UAAU,MAAM,MAAM;AACtC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAM,IAAI,KAAK,CAAC;AAChB,YAAI;AACF,iBAAO,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC;AAAA,QAC5B,SAAS,GAAG;AACV,yBAAe,IAAI,GAAG,CAAC;AAAA,QACzB;AAAA,MACF;AACA,qBAAe,OAAO,IAAI,MAAM,IAAI,OAAO,IAAI,IAAI,QAAQ;AAAA,IAC7D,CAAC;AACD,mBAAe,MAAM;AACrB,UAAM;AACN,UAAM,IAAI,IAAI,KAAK,GAAG;AACtB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,KAAsB,IAAuB;AAC/D,UAAM,OAAO,IAAI;AACjB,QAAI,OAAO,UAAU,IAAI,IAAI;AAC7B,QAAI,CAAC,MAAM;AACT,aAAO,oBAAI,IAAI;AACf,gBAAU,IAAI,MAAM,IAAI;AAAA,IAC1B;AACA,QAAI,MAAM,KAAK,IAAI,EAAE;AACrB,QAAI,IAAK,QAAO;AAChB,UAAM,OAAO,YAAY,EAAE;AAC3B,UAAM,IAAI,MAAM,KAAK,MAAM;AAC3B,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,KAAI,CAAC,IAAI,SAAS,KAAK,CAAC,GAAG,IAAI;AACrE,SAAK,IAAI,IAAI,GAAG;AAChB,WAAO;AAAA,EACT;AAEA,SAAO,cAAuC;AAAA,IAC5C,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM,KAAK,QAAQ;AAAA,IACnB,SAAS;AAAA;AAAA,MAEN,QAAQ,IAAI,aAAa,eAAgB,iBAAkB,CAAC;AAAA,MAC7D;AAAA,IACF;AAAA,IACA,cAAc,OAAO,EAAE,IAAI,CAAC,EAAE;AAAA;AAAA,IAE9B,iBAAiB,EAAE,kBAAkB,MAAM,MAAM;AAAA,IACjD,WAAW,CAAC,SAAS;AAAA,MACnB,YAAY,CAAC,IAAI,YACf,IAAI,SAAS,CAAC,MAAM;AAClB,cAAM,KAAK,EAAE;AACb,cAAM,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE;AACzC,cAAM,MAAM,GAAG,CAAC;AAChB,cAAM,OAAO,CAAC,MAAM,EAAE,IAAI,MAAM,MAAM,IAAI,IAAI,OAAO,SAAY,EAAE,IAAI,MAAM,KAAK;AAClF,YAAI,CAAC,SAAS,MAAO,QAAO,EAAE,IAAI,OAAO,CAAC,IAAI,IAAI,CAAC,EAAE;AACrD,YAAI,CAAC,IAAK,QAAO,EAAE,IAAI,CAAC,GAAG,IAAI,IAA0B,EAAE;AAC3D,cAAM,MAAM,GAAG,MAAM;AACrB,YAAI,KAAM,KAAI,CAAC,IAAI;AAAA,YACd,KAAI,OAAO,GAAG,CAAC;AACpB,eAAO,EAAE,IAAI,IAAI;AAAA,MACnB,CAAC;AAAA,MACH,YAAY,CAAC,OAAO,IAAI,SAAS,EAAE,IAAI,GAAG,MAAM,EAAE,CAAC;AAAA,MACnD,cAAc,MAAM,IAAI,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC;AAAA,MAC3C,kBAAkB,CAAC,OAAO;AACxB,cAAM,IAAI,IAAI,SAAS,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AACnD,eAAO,IAAK,EAAE,OAAO,SAAS,QAAS;AAAA,MACzC;AAAA,IACF;AAAA,IACA,UAAU,CAAC,SAAS,OAAO,QAAQ;AACjC,YAAM,KAAK,OAAO;AAClB,UAAI,CAAC,MAAM,GAAG,WAAW,KAAK,QAAQ,SAAS,GAAG;AAChD,gBAAQ;AACR,eAAO;AAAA,MACT;AACA,YAAM,KAAK,KAAK,QAAQ,IAAI,IAAI;AAChC,YAAM,OAAO,eAAe,IAAI,OAAO;AACvC,YAAM,UAAU,GAAG,IAAI,CAAC,MAAM;AAC5B,cAAM,KAAK,OAAO,EAAE,EAAE;AACtB,cAAM,MAAM,KAAK,KAAK,IAAI,EAAE;AAC5B,cAAM,SAAS,OAAQ,QAAQ,IAAI,KAAK,QAAQ;AAChD,cAAM,SAAuB,SACzB,aAAa,KAAK,KAAK,MAAM,IAC5B,IAAI,gBAAgB,EAAE,KAAK,WAAW,KAAK,EAAE;AAClD,cAAM,SACJ,OAAO,CAAC,SAAU,QAAQ,IAAI,KAAK,QAAQ,IAA2B;AACxE,eAAO,EAAE,KAAK,MAAM,EAAE,SAAS,MAAM,QAAQ,QAAQ,QAAQ,MAAM;AAAA,MACrE,CAAC;AAGD,UAAK,QAAQ,IAAI,aAAa,cAAe;AAC3C,mBAAW,KAAK,SAAS;AACvB,cAAI,CAAC,EAAE,OAAQ;AACf,gBAAM,MAAM,YAAY,EAAE,QAAQ,EAAE,QAAQ,OAAO;AACnD,cAAI,CAAC,IAAK;AACV,YAAE,SAAS;AACX,gBAAM,MAAM,EAAE;AACd,cAAI,KAAK,8BAA8B,EAAE,QAAQ,IAAI,IAAI,OAAO,IAAI,OAAO,GAAG,IAAI,CAAC;AAAA,QACrF;AAAA,MACF;AAGA,YAAM,UAAU,QAAQ,CAAC;AACzB,YAAM,eACJ,QAAQ,OAAQ,QAAQ,IAAI,IAAoC;AAClE,YAAM,aAAa,iBAAiB;AACpC,UAAI,YAAa,aAAa,eAAgB,KAAK,aAAa;AAChE,YAAM,WAAW,CAACA,YAChB,IAAI;AAAA,QACF;AAAA,QACA,aACI,EAAE,MAAM,WAAW,QAAQ,KAAK,KAAK,mBAAmB,QAAAA,SAAQ,MAAM,MAAM,IAC5E,EAAE,MAAM,aAAa,SAAS,WAAW,QAAAA,SAAQ,MAAM,MAAM;AAAA,MACnE;AACF,UACE,OAAO,cAAc,cACrB,CAAE,WAAkC,SAAS,SAAS,GACtD;AACA;AAAA,UACE,GAAG,KAAK,UAAU,SAAS,CAAC,uCAAuC,WAAW,KAAK,IAAI,CAAC;AAAA,QAE1F;AACA,oBAAY;AAAA,MACd;AACA,UAAI,cAAc,YAAY,aAAa,QAAW;AAEpD,mBAAY,QAAQ,IAAI,aAAa,eACjC;AAAA,UACE;AAAA,UACA;AAAA,YACE,SAAS;AAAA,YACT,YAAY;AAAA,YACZ,YAAY;AAAA,YACZ,WAAW;AAAA,YACX,UAAU;AAAA,UACZ;AAAA,UACA,IAAI;AAAA,QACN,IACA,cAAc,WAAW;AAAA,MAC/B;AAGA,UAAI,cAAc,UAAU,QAAQ,UAAU,WAAW;AACvD,YAAI,YAAY;AAChB,mBAAW,KAAK,SAAS;AACvB,cAAI,EAAE,UAAU,EAAE,kBAAkB,aAAc;AAClD,gBAAM,QAAQ,SAAS,KAAK,EAAE,MAAM;AACpC,cAAI,UAAU,OAAW,aAAY;AAAA,mBAC5B,OAAO;AACd,cAAE,SAAS;AACX,cAAE,SAAS;AAAA,UACb;AAAA,QACF;AAEA,YAAI,UAAW,QAAO,SAAS,MAAM,UAAU,UAAU,MAAM,SAAS;AAAA,MAC1E;AACA,YAAM,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,MAAM;AAE3C,YAAM,QAAQ,MAAuB;AACnC,cAAM,OAAO,QAAQ,IAAI,CAAC,GAAG,MAAM;AACjC,gBAAM,KAAK,EAAE;AACb,cAAI,CAAC,GAAI,QAAO,uBAAuB,EAAE,QAAQ,EAAE,MAAM,YAAY,IAAI,IAAI,CAAC;AAC9E,gBAAM,UAAkB,CAAC,GAAG,MAAM;AAChC,gBAAI;AACF,qBAAO,GAAG,GAAG,CAAC;AAAA,YAChB,SAAS,OAAO;AACd,oBAAM,IAAI,aAAa,GAAG,KAAK;AAAA,YACjC;AAAA,UACF;AACA,iBAAO,sBAAsB,EAAE,QAAQ,EAAE,MAAM,OAAO;AAAA,QACxD,CAAC;AACD,YAAI,KAAK,WAAW,EAAG,QAAO,KAAK,CAAC;AACpC,eAAO,CAAC,GAAG,MAAM;AACf,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,kBAAM,IAAK,KAAK,CAAC,EAAsB,GAAG,CAAC;AAC3C,gBAAI,MAAM,EAAG,QAAO;AAAA,UACtB;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,YAAoB;AACxB,UAAI,SAAS;AAEb,YAAM,WAAW,MAAmB;AAClC,cAAM,OAAO;AACb,YAAI,OAAO,SAAS,YAAY;AAC9B,gBAAM,SAAS;AACf,cAAI;AACJ,cAAI;AACF,kBAAM,OAAO,QAAQ,MAAM,GAAG,MAAM,CAAC;AAAA,UACvC,SAAS,OAAO;AACd,gBAAI,iBAAiB,aAAc,OAAM;AACzC,yBAAa,MAAM,KAAK;AACxB,mBAAO,OAAO,4BAA4B;AAAA,UAC5C;AACA,cAAI,eAAe,eAAe,IAAI,WAAW,QAAQ,QAAQ;AAC/D,wBAAY;AACZ,qBAAS,aAAa,yBAAyB;AAC/C,mBAAO;AAAA,UACT;AACA,uBAAa,OAAO,GAAG;AACvB,iBAAO,OAAO,2CAA2C;AAAA,QAC3D;AACA,YAAI,aAAa,MAAO,QAAO,OAAO,sBAAsB;AAC5D,cAAMC,MAAK,aAAa,yBAAyB;AAEjD,cAAM,SAAS,QAAQ,WAAW,KAAK,CAAC,QAAQ;AAChD,cAAM,OACJ,UAAU,SAAS,WAAW,QAAQ,QAAQ,QAAQ,SAAS,QAAQ,IAAI,IAAI;AACjF,YAAI,SAAS,UAAU,SAAS,UAAU;AACxC,cAAI,MAAM;AACR,gBAAI;AACF,oBAAM,MAAM,YAAY,MAAM,IAAI;AAClC,0BAAY;AACZ,uBAAS,GAAGA,GAAE;AACd,qBAAO;AAAA,YACT,QAAQ;AACN;AAAA,gBACE,YAAY,IAAI,oCACb,SAAS,aAAa,iCAAiC,MACxD;AAAA,cACJ;AAAA,YACF;AAAA,UACF,WAAW,aAAa,IAAI,GAAG;AAC7B;AAAA,cACE,GAAG,IAAI;AAAA,YAET;AAAA,UACF,OAAO;AACL,wBAAY;AACZ,qBAASA;AACT,mBAAO,mBAAmB,SAAS,MAAM,GAAG,IAAa;AAAA,UAC3D;AAAA,QACF,WAAW,SAAS,SAAU,QAAO,OAAOA,GAAE;AAC9C,YAAI,CAAC,MAAM;AACT,iBAAO;AAAA,YACL,SACI,mCACA,QAAQ,SAAS,IACf,iBACA;AAAA,UACR;AAAA,QACF;AACA,cAAM,SAAS,WAAW,IAAI;AAC9B,oBAAY,OAAO;AACnB,iBAAS,SAAS,SAAS,yCAAyC,EAAE,GAAG,OAAO,MAAM;AACtF,eAAO,YAAY,MAAM,OAAO,SAAS;AAAA,MAC3C;AACA,YAAM,SAAS,CAAC,QAAgB;AAC9B,oBAAY;AACZ,iBAAS,SAAS,GAAG,GAAG,iCAAiC;AACzD,eAAO,mBAAmB,SAAS,MAAM,GAAG,QAAQ;AAAA,MACtD;AAEA,YAAM,eAAe,CAAC,OAAgB,UAAmB;AACvD,cAAM,OAAO,aACT,WAAW,QAAQ,KAAK,KAAK,oBAC7B;AACJ,cAAM,WAAW;AACjB,YAAI,CAAC,OAAO;AAEV,cAAK,QAAQ,IAAI,aAAa,cAAe;AAC3C,gBAAI,KAAK,0BAA0B;AAAA,cACjC;AAAA,cACA,UAAU,oBAAoB,QAAQ,MAAM;AAAA,cAC5C,UAAU,eAAe,KAAK;AAAA,cAC9B,OAAO;AAAA,cACP;AAAA,YACF,CAAC;AAAA,UACH;AACA;AAAA,QACF;AACA,cAAM,OAAO,UAAU,KAAK;AAC5B,YAAI;AAAA,UACF;AAAA,UACA;AAAA,YACE;AAAA,YACA,OAAO;AAAA,YACP;AAAA,YACA,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,UAClD;AAAA,UACA,EAAE,OAAO,MAAM;AAAA,QACjB;AAAA,MACF;AAGA,iBAAS;AACP,YAAI;AACF,gBAAM,MAAM,SAAS;AACrB,cAAI,KAAK,OAAO;AACd,gBAAI,KAAK,oBAAoB;AAAA,cAC3B;AAAA,cACA;AAAA,cACA,GAAG,QAAQ;AAAA,cACX,IAAI,IAAI,IAAI;AAAA,cACZ,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,OAAO,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,SAAS,KAAK,EAAE;AAAA,cAC9D,GAAI,QAAQ,MAAM,EAAE,QAAQ,EAAE,OAAO,QAAQ,IAAI,OAAO,IAAI,QAAQ,IAAI,GAAG,EAAE,IAAI,CAAC;AAAA,YACpF,CAAC;AAAA,UACH;AACA,kBAAQ,EAAE,OAAO,SAAS,QAAQ,IAAI;AACtC,iBAAO;AAAA,QACT,SAAS,GAAG;AACV,cAAI,EAAE,aAAa,cAAe,OAAM;AACxC,gBAAM,QAAQ,QAAQ,EAAE,KAAK;AAC7B,gBAAM,SAAS;AACf,gBAAM,MAAM,MAAM;AAClB,gBAAM,OAAO,UAAU,EAAE,KAAK;AAC9B,cAAI;AAAA,YACF;AAAA,YACA;AAAA,cACE,MAAM,WAAW,IAAI,KAAK;AAAA,cAC1B,QAAQ,IAAI;AAAA,cACZ,OAAO;AAAA,cACP,UAAU;AAAA,cACV,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,YAClD;AAAA,YACA,EAAE,OAAO,EAAE,MAAM;AAAA,UACnB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACH;","names":["reason","by"]}
+{"version":3,"sources":["../../../src/features/sorting/sorting.ts"],"sourcesContent":["import { optionDiagnostics } from '../../catalog/codes'\nimport { defineOptions } from '../../catalog/options'\nimport { describeReturn } from '../../catalog/slots'\nimport type { SortAlgorithm } from '../../column/column-def'\nimport { compilePath, getValue } from '../../column/get-value'\nimport type { Path } from '../../column/path'\nimport { keepDiagnostics } from '../../diagnostics/catalog'\nimport '../../diagnostics/process-guard'\nimport type { Emit } from '../../diagnostics/types'\nimport { defineFeature } from '../../feature/define'\nimport type { FeatureTypes, RowModelContext } from '../../feature/types'\nimport { CellFailures } from '../../intercept/cell-batch'\nimport { errorName } from '../../intercept/classify'\nimport { boundaryDiagnostics } from '../../intercept/codes'\nimport { type ResolvedColumn, resolveColumns } from '../../pipeline/columns'\nimport { envDiagnostics } from '../../pipeline/env-codes'\nimport { allRows } from '../../pipeline/indices'\nimport { sliced } from '../../pipeline/slice'\nimport type { ColumnValues } from '../../pipeline/types'\nimport { type DataMode, modeOption } from '../../source/mode'\nimport { detectCapability, hasCapability } from '../../versioning/capability'\nimport { comparatorDiagnostics, sortingDiagnostics } from './codes'\nimport {\n  defaultIndexComparator,\n  type IndexComparator,\n  RANK,\n  sortFnIndexComparator,\n  typeRank,\n} from './compare'\nimport { collationRanks } from './ranks'\nimport {\n  chooseAuto,\n  hasExsorted,\n  intKeys,\n  needsIntKeys,\n  sortIntKeys,\n  sortWithComparator,\n} from './strategy'\n\nkeepDiagnostics(\n  sortingDiagnostics,\n  comparatorDiagnostics,\n  boundaryDiagnostics,\n  optionDiagnostics,\n  envDiagnostics,\n)\n\n/** One sort key: a column id (a path of the row type) and its direction. */\nexport type SortEntry<T> = { id: Path<T>; desc: boolean }\n\n/** The `sorting` slice (§6.4): multi-column, earlier entries first. Empty = unsorted. */\nexport type SortingState<T> = { by: readonly SortEntry<T>[] }\n\nexport type SortDirection = 'asc' | 'desc'\n\n/** Replaces the sort; an equal one keeps the slice (same reference, no notification, #21). */\nconst setSort = (\n  ctx: { setState(u: (s: SortingState<unknown>) => SortingState<unknown>): void },\n  by: readonly SortEntry<unknown>[],\n) => ctx.setState((s) => (JSON.stringify(s.by) === JSON.stringify(by) ? s : { by: by.slice() }))\n\nexport type SortingApi<T> = {\n  /**\n   * Cycles `id` asc → desc → none. Without `multi` the result is a single-column sort; with `multi`\n   * (Shift+click) `id` is appended, cycled in place or removed and the other entries are kept.\n   */\n  toggleSort(id: Path<T>, options?: { multi?: boolean }): void\n  /** Replaces the whole sort. */\n  setSorting(by: readonly SortEntry<T>[]): void\n  /** Removes every sort entry (input order). */\n  clearSorting(): void\n  /** `id`'s direction in the current sort, or `false` (for `aria-sort`). */\n  getSortDirection(id: Path<T>): SortDirection | false\n}\n\nexport interface SortingTypes extends FeatureTypes {\n  state: SortingState<this['T']>\n  api: SortingApi<this['T']>\n}\n\n/**\n * How rows are sorted (§6.4): `'auto'` (default) picks per sort from one O(n) scan — exsorted\n * tim / counting / radix for a single column of safe-integer keys (numbers, `Date`s), native\n * `Array.prototype.sort` otherwise. A built-in name forces that algorithm (radix / counting only\n * apply to safe-integer keys); a function sorts the row indices itself.\n */\nexport type SortAlgorithmOption = SortAlgorithm\n\nexport interface SortingOptions {\n  /**\n   * Locale(s) of the string collator (`Intl.Collator(locale, { numeric: true })`). Default `'en'`,\n   * not the runtime's: the server and the browser must sort alike (SSR hydration, #12).\n   */\n  locale?: string | readonly string[]\n  /** The sort algorithm (default `'auto'`); a column's `sortAlgorithm` takes precedence. */\n  algorithm?: SortAlgorithmOption\n  /** Reports the algorithm chosen for each sort, why, n and the time taken (`DK_SORT_STRATEGY`). */\n  debug?: boolean\n  /**\n   * `'server'`: the server sorts (its state goes to `options.fetcher`, or the app fetches); core\n   * skips this step (§7.1). Default `'client'`.\n   */\n  mode?: DataMode\n}\n\nconst validLocale = (v: unknown) => {\n  try {\n    Intl.getCanonicalLocales(v as string | string[])\n    return true\n  } catch {\n    return false\n  }\n}\n\nconst ALGORITHMS = ['auto', 'tim', 'radix', 'counting', 'native'] as const\n\nconst sortingOptions = {\n  locale: {\n    type: ['string', 'array'],\n    check: validLocale,\n    expected: 'a BCP 47 locale tag or a list of them, e.g. \"th\" or [\"th\", \"en\"]',\n  },\n  algorithm: {\n    type: ['string', 'function'],\n    oneOf: ALGORITHMS,\n    // A literal (not built from ALGORITHMS): a module-level call would keep the schema in production.\n    expected:\n      \"one of 'auto', 'tim', 'radix', 'counting', 'native', or (indices, compare) => indices\",\n  },\n  debug: { type: 'boolean' },\n  mode: modeOption,\n} as const\n\ntype CustomAlgorithm = Extract<SortAlgorithm, (...args: never[]) => unknown>\n\nconst now = () => (typeof performance === 'undefined' ? Date.now() : performance.now())\n\n/**\n * From this many rows, `auto` sorts a string column by precomputed collation ranks (§9.1): one\n * time-sliced job per column values, then integer-key sorts (a few ms at 100k rows) instead of a\n * collator call per comparison (~100–200 ms at 100k, one long task).\n */\nconst RANKS_MIN = 10_000\n\nconst missing = (v: unknown) => typeRank(v) === RANK.missing\n\n/**\n * Dev check of a column's `sortFn` (§8.3 `DK_SORT_COMPARATOR_INVALID`), sampled: up to 8 present\n * values spread over the input, every pair both ways. A throw gives no verdict (the sort reports\n * it as `DK_CALLBACK_FAILED`).\n */\nfunction checkSortFn(\n  fn: SortFn,\n  values: ColumnValues,\n  indices: Uint32Array,\n): { reason: 'nan' | 'not-number' | 'inconsistent'; received?: string } | undefined {\n  const sample: unknown[] = []\n  const step = Math.max(1, Math.floor(indices.length / 8))\n  for (let i = 0; i < indices.length && sample.length < 8; i += step) {\n    const v = values[indices[i] as number]\n    if (!missing(v)) sample.push(v)\n  }\n  try {\n    for (let i = 0; i < sample.length; i++) {\n      for (let j = i; j < sample.length; j++) {\n        const x = fn(sample[i], sample[j])\n        const y = fn(sample[j], sample[i])\n        for (const r of [x, y]) {\n          if (typeof r !== 'number') return { reason: 'not-number', received: describeReturn(r) }\n          if (Number.isNaN(r)) return { reason: 'nan' }\n        }\n        if (Math.sign(x) !== -Math.sign(y)) return { reason: 'inconsistent' }\n      }\n    }\n  } catch {\n    return undefined\n  }\n  return undefined\n}\n\ntype SortFn = (a: unknown, b: unknown) => number\ntype SortBy = (row: unknown) => unknown\n\nconst fnField = (def: object, field: 'sortFn' | 'sortBy') => {\n  const f = (def as Record<string, unknown>)[field]\n  return typeof f === 'function' ? f : undefined\n}\n\n/** Aborts a native sort when a column's `sortFn` throws (the entry then falls back). */\nclass SortFnFailed {\n  constructor(\n    readonly entry: number,\n    readonly error: unknown,\n  ) {}\n}\n\n/**\n * Sorting (§6.4): `toggleSort` (asc → desc → none, `multi`), stable sort of the row indices with\n * the default comparator — missing values (`null`, `undefined`, `NaN`, invalid `Date`) last in both\n * directions, mixed types by type rank, strings with one `Intl.Collator(locale, { numeric: true })`\n * — or a column's `sortFn` / `sortBy`. Never touches the data: a copy of the index array is sorted.\n *\n * `algorithm: 'auto'` (default) picks per sort from one O(n) scan (§6.4): exsorted tim / counting /\n * radix for a single column of safe-integer keys (numbers, `Date`s), native `Array.prototype.sort`\n * (stable) for strings, floats, multi-column and `sortFn`. Every choice gives the same stable order.\n * `sorting({ algorithm })` or a column's `sortAlgorithm` overrides it; `debug: true` reports each\n * choice (`DK_SORT_STRATEGY`).\n */\nexport const sorting = (opts: SortingOptions = {}) => {\n  let collator: Intl.Collator | undefined\n  /** The collator; `DK_ENV_FALLBACK` when the runtime supports none of the requested locales. */\n  const getCollator = (emit: Emit) => {\n    if (collator) return collator\n    const locale = (opts.locale ?? 'en') as string | string[]\n    let supported = true\n    try {\n      collator = new Intl.Collator(locale, { numeric: true })\n      supported = Intl.Collator.supportedLocalesOf(locale).length > 0\n    } catch {\n      collator = new Intl.Collator(undefined, { numeric: true })\n      supported = false\n    }\n    if (!supported) {\n      emit('DK_ENV_FALLBACK', {\n        api: 'Intl.Collator',\n        feature: 'sorting',\n        requested: ([] as string[]).concat(locale).join(', '),\n        fallback: `collation|${collator.resolvedOptions().locale}`,\n      })\n    }\n    return collator\n  }\n\n  /** Values array → the key of its collation-ranks job (`ctx.slice`); released with the values. */\n  const rankKeys = new WeakMap<object, object>()\n  function ranksFor(ctx: RowModelContext, values: readonly unknown[]) {\n    let key = rankKeys.get(values)\n    if (!key) {\n      key = {}\n      rankKeys.set(values, key)\n    }\n    const c = getCollator(ctx.emit)\n    return sliced(ctx, key, () => collationRanks(values, c))\n  }\n  /** The last sorted output and its input: the stand-in while ranks are computed (§9.1). */\n  let shown: { input: Uint32Array; output: Uint32Array } | undefined\n\n  // Values that the column cache does not hold, per data reference (released with it).\n  const sortByCache = new WeakMap<readonly unknown[], WeakMap<object, unknown[]>>()\n  const pathCache = new WeakMap<readonly unknown[], Map<string, unknown[]>>()\n  /** exsorted feature detection (§8.5), once per feature instance, on the first sort needing it. */\n  let exsorted: boolean | undefined\n\n  /** `sortBy` failures (§3.4): numbers only; text is built only when a cell failed. */\n  const sortByFailures = new CellFailures()\n\n  /**\n   * `sortBy` is a cell slot: one `column:batch` per column per data reference, an inline\n   * `try/catch` per row. A failed row (or a batch an interceptor skipped) keys as `undefined`,\n   * which sorts last.\n   */\n  function sortByValues(ctx: RowModelContext, col: ResolvedColumn, sortBy: SortBy): unknown[] {\n    const data = ctx.data\n    let byDef = sortByCache.get(data)\n    if (!byDef) {\n      byDef = new WeakMap()\n      sortByCache.set(data, byDef)\n    }\n    let out = byDef.get(col.def)\n    if (out) return out\n    const values: unknown[] = new Array(data.length).fill(undefined)\n    const rows = allRows(data)\n    sortByFailures.reset()\n    ctx.batch(col.id, 'sortBy', rows, () => {\n      for (let i = 0; i < rows.length; i++) {\n        const r = rows[i] as number\n        try {\n          values[r] = sortBy(data[r])\n        } catch (e) {\n          sortByFailures.add(r, e)\n        }\n      }\n      sortByFailures.report(ctx.emit, col.index, col.id, 'sortBy')\n    })\n    sortByFailures.reset()\n    out = values\n    byDef.set(col.def, out)\n    return out\n  }\n\n  function pathValues(ctx: RowModelContext, id: string): unknown[] {\n    const data = ctx.data\n    let byId = pathCache.get(data)\n    if (!byId) {\n      byId = new Map()\n      pathCache.set(data, byId)\n    }\n    let out = byId.get(id)\n    if (out) return out\n    const path = compilePath(id)\n    out = new Array(data.length)\n    for (let r = 0; r < data.length; r++) out[r] = getValue(data[r], path)\n    byId.set(id, out)\n    return out\n  }\n\n  return defineFeature<'sorting', SortingTypes>({\n    name: 'sorting',\n    stage: 'sort',\n    mode: opts.mode ?? 'client',\n    options: defineOptions(\n      // The option validator runs in development only (§9.3): production drops the schema.\n      (process.env.NODE_ENV !== \"production\") ? sortingOptions : ({} as typeof sortingOptions),\n      opts,\n    ),\n    initialState: () => ({ by: [] }),\n    // After destroy(): still a declared value (`aria-sort` reads it during teardown renders).\n    destroyedResult: { getSortDirection: () => false },\n    createApi: (ctx) => ({\n      toggleSort: (id, options) =>\n        ctx.setState((s) => {\n          const by = s.by\n          const i = by.findIndex((e) => e.id === id)\n          const cur = by[i]\n          const next = !cur ? { id, desc: false } : cur.desc ? undefined : { id, desc: true }\n          if (!options?.multi) return { by: next ? [next] : [] }\n          if (!cur) return { by: [...by, next as SortEntry<unknown>] }\n          const out = by.slice()\n          if (next) out[i] = next\n          else out.splice(i, 1)\n          return { by: out }\n        }),\n      setSorting: (by) => setSort(ctx, by),\n      clearSorting: () => setSort(ctx, []),\n      getSortDirection: (id) => {\n        const e = ctx.getState().by.find((x) => x.id === id)\n        return e ? (e.desc ? 'desc' : 'asc') : false\n      },\n    }),\n    rowModel: (indices, state, ctx) => {\n      const by = state?.by\n      if (!by || by.length === 0 || indices.length < 2) {\n        shown = undefined\n        return indices\n      }\n      const t0 = opts.debug ? now() : 0\n      const cols = resolveColumns(ctx.columns)\n      const entries = by.map((e) => {\n        const id = String(e.id)\n        const col = cols.byId.get(id)\n        const sortBy = col && (fnField(col.def, 'sortBy') as SortBy | undefined)\n        const values: ColumnValues = sortBy\n          ? sortByValues(ctx, col, sortBy)\n          : (ctx.getColumnValues(id) ?? pathValues(ctx, id))\n        const sortFn =\n          col && !sortBy ? (fnField(col.def, 'sortFn') as SortFn | undefined) : undefined\n        return { col, desc: e.desc === true, values, sortFn, ranked: false }\n      })\n\n      // Dev (§8.3): a sampled sortFn check; an invalid one falls back to the default comparator.\n      if ((process.env.NODE_ENV !== \"production\")) {\n        for (const e of entries) {\n          if (!e.sortFn) continue\n          const bad = checkSortFn(e.sortFn, e.values, indices)\n          if (!bad) continue\n          e.sortFn = undefined\n          const col = e.col as ResolvedColumn\n          ctx.emit('DK_SORT_COMPARATOR_INVALID', { column: col.id, index: col.index, ...bad })\n        }\n      }\n\n      // The requested algorithm: the primary column's `sortAlgorithm`, else the table's.\n      const primary = entries[0] as (typeof entries)[number]\n      const colAlgorithm =\n        primary.col && (primary.col.def as { sortAlgorithm?: unknown }).sortAlgorithm\n      const fromColumn = colAlgorithm !== undefined\n      let requested = (fromColumn ? colAlgorithm : (opts.algorithm ?? 'auto')) as SortAlgorithm\n      const noEffect = (reason: string) =>\n        ctx.emit(\n          'DK_OPTION_NO_EFFECT',\n          fromColumn\n            ? { path: `columns[${primary.col?.index}].sortAlgorithm`, reason, once: false }\n            : { path: 'algorithm', feature: 'sorting', reason, once: false },\n        )\n      if (\n        typeof requested !== 'function' &&\n        !(ALGORITHMS as readonly unknown[]).includes(requested)\n      ) {\n        noEffect(`not-algorithm|${JSON.stringify(requested)}`)\n        requested = 'auto'\n      }\n      if (requested !== 'native' && exsorted === undefined) {\n        // DK_DEP_INCOMPATIBLE is a development check (§8.5); the fallback is not.\n        exsorted = (process.env.NODE_ENV !== \"production\")\n          ? detectCapability(\n              hasExsorted,\n              {\n                feature: 'sorting',\n                dependency: 'exsorted',\n                capability: 'timSort / radixSort / countingSort',\n                supported: '^1.2.3',\n                fallback: 'Array.prototype.sort (native, stable)',\n              },\n              ctx.emit,\n            )\n          : hasCapability(hasExsorted)\n      }\n\n      // auto at large n (§9.1): string columns sort by collation ranks, computed by a sliced job.\n      if (requested === 'auto' && indices.length >= RANKS_MIN) {\n        let computing = false\n        for (const e of entries) {\n          if (e.sortFn || e.values instanceof Float64Array) continue\n          const ranks = ranksFor(ctx, e.values)\n          if (ranks === undefined) computing = true\n          else if (ranks) {\n            e.values = ranks\n            e.ranked = true\n          }\n        }\n        // Meanwhile: the previous order of these rows (or the input order); 'pending'.\n        if (computing) return shown && shown.input === indices ? shown.output : indices\n      }\n      const ranked = entries.some((e) => e.ranked)\n\n      const build = (): IndexComparator => {\n        const cmps = entries.map((e, k) => {\n          const fn = e.sortFn\n          if (!fn) return defaultIndexComparator(e.values, e.desc, getCollator(ctx.emit))\n          const guarded: SortFn = (a, b) => {\n            try {\n              return fn(a, b)\n            } catch (error) {\n              throw new SortFnFailed(k, error)\n            }\n          }\n          return sortFnIndexComparator(e.values, e.desc, guarded)\n        })\n        if (cmps.length === 1) return cmps[0] as IndexComparator\n        return (a, b) => {\n          for (let k = 0; k < cmps.length; k++) {\n            const c = (cmps[k] as IndexComparator)(a, b)\n            if (c !== 0) return c\n          }\n          return 0\n        }\n      }\n\n      let algorithm: string = 'native'\n      let reason = ''\n      /** One attempt; a throwing sortFn propagates as SortFnFailed (the loop below retries). */\n      const sortOnce = (): Uint32Array => {\n        const want = requested\n        if (typeof want === 'function') {\n          const custom = want as CustomAlgorithm\n          let res: unknown\n          try {\n            res = custom(indices.slice(), build())\n          } catch (error) {\n            if (error instanceof SortFnFailed) throw error\n            reportCustom(true, error)\n            return native('custom-threw')\n          }\n          if (res instanceof Uint32Array && res.length === indices.length) {\n            algorithm = 'custom'\n            reason = fromColumn ? 'column sortAlgorithm' : 'sorting({ algorithm })'\n            return res\n          }\n          reportCustom(false, res)\n          return native('custom-bad')\n        }\n        if (exsorted === false) return native('exsorted unavailable')\n        const by = fromColumn ? 'column sortAlgorithm' : 'sorting({ algorithm })'\n        // Integer keys: a single column with the default comparator (§6.4).\n        const single = entries.length === 1 && !primary.sortFn\n        const keys =\n          single && want !== 'native' ? intKeys(primary.values, indices, primary.desc) : undefined\n        if (want !== 'auto' && want !== 'native') {\n          if (keys) {\n            try {\n              const out = sortIntKeys(keys, want)\n              algorithm = want\n              reason = `int-keys|${by}`\n              return out\n            } catch {\n              noEffect(`exsorted-${want === 'counting' ? 'range' : 'failed'}|${want}`)\n            }\n          } else if (needsIntKeys(want)) {\n            noEffect(`needs-int-keys|${want}`)\n          } else {\n            algorithm = want\n            reason = by\n            return sortWithComparator(indices, build(), want as 'tim')\n          }\n        } else if (want === 'native') return native(by)\n        if (!keys) {\n          return native(\n            single ? 'not-safe-int' : entries.length > 1 ? 'multi-column' : 'custom sortFn',\n          )\n        }\n        const choice = chooseAuto(keys)\n        algorithm = choice.algorithm\n        reason = `auto-${ranked ? 'ranked-' : ''}${choice.reason}`\n        return sortIntKeys(keys, choice.algorithm)\n      }\n      const native = (why: string) => {\n        algorithm = 'native'\n        reason = ranked ? `ranks|${why}` : why\n        return sortWithComparator(indices, build(), 'native')\n      }\n      /** A custom algorithm threw (`threw`, `value` = the error) or returned a bad `value`. */\n      const reportCustom = (threw: boolean, value: unknown) => {\n        const slot = fromColumn\n          ? `columns[${primary.col?.index}].sortAlgorithm`\n          : 'sorting.algorithm'\n        const fallback = 'sorted-native'\n        if (!threw) {\n          // The slot contract check is dev only (§3.4 slotContract); the fallback applies always.\n          if ((process.env.NODE_ENV !== \"production\")) {\n            ctx.emit('DK_CALLBACK_BAD_RETURN', {\n              slot,\n              expected: `a Uint32Array of ${indices.length} row indices`,\n              received: describeReturn(value),\n              count: 1,\n              fallback,\n            })\n          }\n          return\n        }\n        const name = errorName(value)\n        ctx.emit(\n          'DK_CALLBACK_FAILED',\n          {\n            slot,\n            count: 1,\n            fallback,\n            ...(name === undefined ? {} : { errorName: name }),\n          },\n          { cause: value },\n        )\n      }\n\n      // At most one retry per entry: each failing sortFn falls back to the default comparator.\n      for (;;) {\n        try {\n          const out = sortOnce()\n          if (opts.debug) {\n            ctx.emit('DK_SORT_STRATEGY', {\n              algorithm,\n              reason,\n              n: indices.length,\n              ms: now() - t0,\n              by: by.map((e) => `${String(e.id)}:${e.desc ? 'desc' : 'asc'}`),\n              ...(primary.col ? { column: { index: primary.col.index, id: primary.col.id } } : {}),\n            })\n          }\n          shown = { input: indices, output: out }\n          return out\n        } catch (e) {\n          if (!(e instanceof SortFnFailed)) throw e\n          const entry = entries[e.entry] as (typeof entries)[number]\n          entry.sortFn = undefined\n          const col = entry.col as ResolvedColumn\n          const name = errorName(e.error)\n          ctx.emit(\n            'DK_CALLBACK_FAILED',\n            {\n              slot: `columns[${col.index}].sortFn`,\n              column: col.id,\n              count: 1,\n              fallback: 'sorted-default',\n              ...(name === undefined ? {} : { errorName: name }),\n            },\n            { cause: e.error },\n          )\n        }\n      }\n    },\n  })\n}\n"],"mappings":";AAAA,SAAS,yBAAyB;AAClC,SAAS,qBAAqB;AAC9B,SAAS,sBAAsB;AAE/B,SAAS,aAAa,gBAAgB;AAEtC,SAAS,uBAAuB;AAChC,OAAO;AAEP,SAAS,qBAAqB;AAE9B,SAAS,oBAAoB;AAC7B,SAAS,iBAAiB;AAC1B,SAAS,2BAA2B;AACpC,SAA8B,sBAAsB;AACpD,SAAS,sBAAsB;AAC/B,SAAS,eAAe;AACxB,SAAS,cAAc;AAEvB,SAAwB,kBAAkB;AAC1C,SAAS,kBAAkB,qBAAqB;AAChD,SAAS,uBAAuB,0BAA0B;AAC1D;AAAA,EACE;AAAA,EAEA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,SAAS,sBAAsB;AAC/B;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAEP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAWA,IAAM,UAAU,CACd,KACA,OACG,IAAI,SAAS,CAAC,MAAO,KAAK,UAAU,EAAE,EAAE,MAAM,KAAK,UAAU,EAAE,IAAI,IAAI,EAAE,IAAI,GAAG,MAAM,EAAE,CAAE;AA8C/F,IAAM,cAAc,CAAC,MAAe;AAClC,MAAI;AACF,SAAK,oBAAoB,CAAsB;AAC/C,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,IAAM,aAAa,CAAC,QAAQ,OAAO,SAAS,YAAY,QAAQ;AAEhE,IAAM,iBAAiB;AAAA,EACrB,QAAQ;AAAA,IACN,MAAM,CAAC,UAAU,OAAO;AAAA,IACxB,OAAO;AAAA,IACP,UAAU;AAAA,EACZ;AAAA,EACA,WAAW;AAAA,IACT,MAAM,CAAC,UAAU,UAAU;AAAA,IAC3B,OAAO;AAAA;AAAA,IAEP,UACE;AAAA,EACJ;AAAA,EACA,OAAO,EAAE,MAAM,UAAU;AAAA,EACzB,MAAM;AACR;AAIA,IAAM,MAAM,MAAO,OAAO,gBAAgB,cAAc,KAAK,IAAI,IAAI,YAAY,IAAI;AAOrF,IAAM,YAAY;AAElB,IAAM,UAAU,CAAC,MAAe,SAAS,CAAC,MAAM,KAAK;AAOrD,SAAS,YACP,IACA,QACA,SACkF;AAClF,QAAM,SAAoB,CAAC;AAC3B,QAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,SAAS,CAAC,CAAC;AACvD,WAAS,IAAI,GAAG,IAAI,QAAQ,UAAU,OAAO,SAAS,GAAG,KAAK,MAAM;AAClE,UAAM,IAAI,OAAO,QAAQ,CAAC,CAAW;AACrC,QAAI,CAAC,QAAQ,CAAC,EAAG,QAAO,KAAK,CAAC;AAAA,EAChC;AACA,MAAI;AACF,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,cAAM,IAAI,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACjC,cAAM,IAAI,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACjC,mBAAW,KAAK,CAAC,GAAG,CAAC,GAAG;AACtB,cAAI,OAAO,MAAM,SAAU,QAAO,EAAE,QAAQ,cAAc,UAAU,eAAe,CAAC,EAAE;AACtF,cAAI,OAAO,MAAM,CAAC,EAAG,QAAO,EAAE,QAAQ,MAAM;AAAA,QAC9C;AACA,YAAI,KAAK,KAAK,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,EAAG,QAAO,EAAE,QAAQ,eAAe;AAAA,MACtE;AAAA,IACF;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAKA,IAAM,UAAU,CAAC,KAAa,UAA+B;AAC3D,QAAM,IAAK,IAAgC,KAAK;AAChD,SAAO,OAAO,MAAM,aAAa,IAAI;AACvC;AAGA,IAAM,eAAN,MAAmB;AAAA,EACjB,YACW,OACA,OACT;AAFS;AACA;AAAA,EACR;AACL;AAcO,IAAM,UAAU,CAAC,OAAuB,CAAC,MAAM;AACpD,MAAI;AAEJ,QAAM,cAAc,CAAC,SAAe;AAClC,QAAI,SAAU,QAAO;AACrB,UAAM,SAAU,KAAK,UAAU;AAC/B,QAAI,YAAY;AAChB,QAAI;AACF,iBAAW,IAAI,KAAK,SAAS,QAAQ,EAAE,SAAS,KAAK,CAAC;AACtD,kBAAY,KAAK,SAAS,mBAAmB,MAAM,EAAE,SAAS;AAAA,IAChE,QAAQ;AACN,iBAAW,IAAI,KAAK,SAAS,QAAW,EAAE,SAAS,KAAK,CAAC;AACzD,kBAAY;AAAA,IACd;AACA,QAAI,CAAC,WAAW;AACd,WAAK,mBAAmB;AAAA,QACtB,KAAK;AAAA,QACL,SAAS;AAAA,QACT,WAAY,CAAC,EAAe,OAAO,MAAM,EAAE,KAAK,IAAI;AAAA,QACpD,UAAU,aAAa,SAAS,gBAAgB,EAAE,MAAM;AAAA,MAC1D,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAGA,QAAM,WAAW,oBAAI,QAAwB;AAC7C,WAAS,SAAS,KAAsB,QAA4B;AAClE,QAAI,MAAM,SAAS,IAAI,MAAM;AAC7B,QAAI,CAAC,KAAK;AACR,YAAM,CAAC;AACP,eAAS,IAAI,QAAQ,GAAG;AAAA,IAC1B;AACA,UAAM,IAAI,YAAY,IAAI,IAAI;AAC9B,WAAO,OAAO,KAAK,KAAK,MAAM,eAAe,QAAQ,CAAC,CAAC;AAAA,EACzD;AAEA,MAAI;AAGJ,QAAM,cAAc,oBAAI,QAAwD;AAChF,QAAM,YAAY,oBAAI,QAAoD;AAE1E,MAAI;AAGJ,QAAM,iBAAiB,IAAI,aAAa;AAOxC,WAAS,aAAa,KAAsB,KAAqB,QAA2B;AAC1F,UAAM,OAAO,IAAI;AACjB,QAAI,QAAQ,YAAY,IAAI,IAAI;AAChC,QAAI,CAAC,OAAO;AACV,cAAQ,oBAAI,QAAQ;AACpB,kBAAY,IAAI,MAAM,KAAK;AAAA,IAC7B;AACA,QAAI,MAAM,MAAM,IAAI,IAAI,GAAG;AAC3B,QAAI,IAAK,QAAO;AAChB,UAAM,SAAoB,IAAI,MAAM,KAAK,MAAM,EAAE,KAAK,MAAS;AAC/D,UAAM,OAAO,QAAQ,IAAI;AACzB,mBAAe,MAAM;AACrB,QAAI,MAAM,IAAI,IAAI,UAAU,MAAM,MAAM;AACtC,eAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,cAAM,IAAI,KAAK,CAAC;AAChB,YAAI;AACF,iBAAO,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC;AAAA,QAC5B,SAAS,GAAG;AACV,yBAAe,IAAI,GAAG,CAAC;AAAA,QACzB;AAAA,MACF;AACA,qBAAe,OAAO,IAAI,MAAM,IAAI,OAAO,IAAI,IAAI,QAAQ;AAAA,IAC7D,CAAC;AACD,mBAAe,MAAM;AACrB,UAAM;AACN,UAAM,IAAI,IAAI,KAAK,GAAG;AACtB,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,KAAsB,IAAuB;AAC/D,UAAM,OAAO,IAAI;AACjB,QAAI,OAAO,UAAU,IAAI,IAAI;AAC7B,QAAI,CAAC,MAAM;AACT,aAAO,oBAAI,IAAI;AACf,gBAAU,IAAI,MAAM,IAAI;AAAA,IAC1B;AACA,QAAI,MAAM,KAAK,IAAI,EAAE;AACrB,QAAI,IAAK,QAAO;AAChB,UAAM,OAAO,YAAY,EAAE;AAC3B,UAAM,IAAI,MAAM,KAAK,MAAM;AAC3B,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,KAAI,CAAC,IAAI,SAAS,KAAK,CAAC,GAAG,IAAI;AACrE,SAAK,IAAI,IAAI,GAAG;AAChB,WAAO;AAAA,EACT;AAEA,SAAO,cAAuC;AAAA,IAC5C,MAAM;AAAA,IACN,OAAO;AAAA,IACP,MAAM,KAAK,QAAQ;AAAA,IACnB,SAAS;AAAA;AAAA,MAEN,QAAQ,IAAI,aAAa,eAAgB,iBAAkB,CAAC;AAAA,MAC7D;AAAA,IACF;AAAA,IACA,cAAc,OAAO,EAAE,IAAI,CAAC,EAAE;AAAA;AAAA,IAE9B,iBAAiB,EAAE,kBAAkB,MAAM,MAAM;AAAA,IACjD,WAAW,CAAC,SAAS;AAAA,MACnB,YAAY,CAAC,IAAI,YACf,IAAI,SAAS,CAAC,MAAM;AAClB,cAAM,KAAK,EAAE;AACb,cAAM,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE;AACzC,cAAM,MAAM,GAAG,CAAC;AAChB,cAAM,OAAO,CAAC,MAAM,EAAE,IAAI,MAAM,MAAM,IAAI,IAAI,OAAO,SAAY,EAAE,IAAI,MAAM,KAAK;AAClF,YAAI,CAAC,SAAS,MAAO,QAAO,EAAE,IAAI,OAAO,CAAC,IAAI,IAAI,CAAC,EAAE;AACrD,YAAI,CAAC,IAAK,QAAO,EAAE,IAAI,CAAC,GAAG,IAAI,IAA0B,EAAE;AAC3D,cAAM,MAAM,GAAG,MAAM;AACrB,YAAI,KAAM,KAAI,CAAC,IAAI;AAAA,YACd,KAAI,OAAO,GAAG,CAAC;AACpB,eAAO,EAAE,IAAI,IAAI;AAAA,MACnB,CAAC;AAAA,MACH,YAAY,CAAC,OAAO,QAAQ,KAAK,EAAE;AAAA,MACnC,cAAc,MAAM,QAAQ,KAAK,CAAC,CAAC;AAAA,MACnC,kBAAkB,CAAC,OAAO;AACxB,cAAM,IAAI,IAAI,SAAS,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE;AACnD,eAAO,IAAK,EAAE,OAAO,SAAS,QAAS;AAAA,MACzC;AAAA,IACF;AAAA,IACA,UAAU,CAAC,SAAS,OAAO,QAAQ;AACjC,YAAM,KAAK,OAAO;AAClB,UAAI,CAAC,MAAM,GAAG,WAAW,KAAK,QAAQ,SAAS,GAAG;AAChD,gBAAQ;AACR,eAAO;AAAA,MACT;AACA,YAAM,KAAK,KAAK,QAAQ,IAAI,IAAI;AAChC,YAAM,OAAO,eAAe,IAAI,OAAO;AACvC,YAAM,UAAU,GAAG,IAAI,CAAC,MAAM;AAC5B,cAAM,KAAK,OAAO,EAAE,EAAE;AACtB,cAAM,MAAM,KAAK,KAAK,IAAI,EAAE;AAC5B,cAAM,SAAS,OAAQ,QAAQ,IAAI,KAAK,QAAQ;AAChD,cAAM,SAAuB,SACzB,aAAa,KAAK,KAAK,MAAM,IAC5B,IAAI,gBAAgB,EAAE,KAAK,WAAW,KAAK,EAAE;AAClD,cAAM,SACJ,OAAO,CAAC,SAAU,QAAQ,IAAI,KAAK,QAAQ,IAA2B;AACxE,eAAO,EAAE,KAAK,MAAM,EAAE,SAAS,MAAM,QAAQ,QAAQ,QAAQ,MAAM;AAAA,MACrE,CAAC;AAGD,UAAK,QAAQ,IAAI,aAAa,cAAe;AAC3C,mBAAW,KAAK,SAAS;AACvB,cAAI,CAAC,EAAE,OAAQ;AACf,gBAAM,MAAM,YAAY,EAAE,QAAQ,EAAE,QAAQ,OAAO;AACnD,cAAI,CAAC,IAAK;AACV,YAAE,SAAS;AACX,gBAAM,MAAM,EAAE;AACd,cAAI,KAAK,8BAA8B,EAAE,QAAQ,IAAI,IAAI,OAAO,IAAI,OAAO,GAAG,IAAI,CAAC;AAAA,QACrF;AAAA,MACF;AAGA,YAAM,UAAU,QAAQ,CAAC;AACzB,YAAM,eACJ,QAAQ,OAAQ,QAAQ,IAAI,IAAoC;AAClE,YAAM,aAAa,iBAAiB;AACpC,UAAI,YAAa,aAAa,eAAgB,KAAK,aAAa;AAChE,YAAM,WAAW,CAACA,YAChB,IAAI;AAAA,QACF;AAAA,QACA,aACI,EAAE,MAAM,WAAW,QAAQ,KAAK,KAAK,mBAAmB,QAAAA,SAAQ,MAAM,MAAM,IAC5E,EAAE,MAAM,aAAa,SAAS,WAAW,QAAAA,SAAQ,MAAM,MAAM;AAAA,MACnE;AACF,UACE,OAAO,cAAc,cACrB,CAAE,WAAkC,SAAS,SAAS,GACtD;AACA,iBAAS,iBAAiB,KAAK,UAAU,SAAS,CAAC,EAAE;AACrD,oBAAY;AAAA,MACd;AACA,UAAI,cAAc,YAAY,aAAa,QAAW;AAEpD,mBAAY,QAAQ,IAAI,aAAa,eACjC;AAAA,UACE;AAAA,UACA;AAAA,YACE,SAAS;AAAA,YACT,YAAY;AAAA,YACZ,YAAY;AAAA,YACZ,WAAW;AAAA,YACX,UAAU;AAAA,UACZ;AAAA,UACA,IAAI;AAAA,QACN,IACA,cAAc,WAAW;AAAA,MAC/B;AAGA,UAAI,cAAc,UAAU,QAAQ,UAAU,WAAW;AACvD,YAAI,YAAY;AAChB,mBAAW,KAAK,SAAS;AACvB,cAAI,EAAE,UAAU,EAAE,kBAAkB,aAAc;AAClD,gBAAM,QAAQ,SAAS,KAAK,EAAE,MAAM;AACpC,cAAI,UAAU,OAAW,aAAY;AAAA,mBAC5B,OAAO;AACd,cAAE,SAAS;AACX,cAAE,SAAS;AAAA,UACb;AAAA,QACF;AAEA,YAAI,UAAW,QAAO,SAAS,MAAM,UAAU,UAAU,MAAM,SAAS;AAAA,MAC1E;AACA,YAAM,SAAS,QAAQ,KAAK,CAAC,MAAM,EAAE,MAAM;AAE3C,YAAM,QAAQ,MAAuB;AACnC,cAAM,OAAO,QAAQ,IAAI,CAAC,GAAG,MAAM;AACjC,gBAAM,KAAK,EAAE;AACb,cAAI,CAAC,GAAI,QAAO,uBAAuB,EAAE,QAAQ,EAAE,MAAM,YAAY,IAAI,IAAI,CAAC;AAC9E,gBAAM,UAAkB,CAAC,GAAG,MAAM;AAChC,gBAAI;AACF,qBAAO,GAAG,GAAG,CAAC;AAAA,YAChB,SAAS,OAAO;AACd,oBAAM,IAAI,aAAa,GAAG,KAAK;AAAA,YACjC;AAAA,UACF;AACA,iBAAO,sBAAsB,EAAE,QAAQ,EAAE,MAAM,OAAO;AAAA,QACxD,CAAC;AACD,YAAI,KAAK,WAAW,EAAG,QAAO,KAAK,CAAC;AACpC,eAAO,CAAC,GAAG,MAAM;AACf,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,kBAAM,IAAK,KAAK,CAAC,EAAsB,GAAG,CAAC;AAC3C,gBAAI,MAAM,EAAG,QAAO;AAAA,UACtB;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,UAAI,YAAoB;AACxB,UAAI,SAAS;AAEb,YAAM,WAAW,MAAmB;AAClC,cAAM,OAAO;AACb,YAAI,OAAO,SAAS,YAAY;AAC9B,gBAAM,SAAS;AACf,cAAI;AACJ,cAAI;AACF,kBAAM,OAAO,QAAQ,MAAM,GAAG,MAAM,CAAC;AAAA,UACvC,SAAS,OAAO;AACd,gBAAI,iBAAiB,aAAc,OAAM;AACzC,yBAAa,MAAM,KAAK;AACxB,mBAAO,OAAO,cAAc;AAAA,UAC9B;AACA,cAAI,eAAe,eAAe,IAAI,WAAW,QAAQ,QAAQ;AAC/D,wBAAY;AACZ,qBAAS,aAAa,yBAAyB;AAC/C,mBAAO;AAAA,UACT;AACA,uBAAa,OAAO,GAAG;AACvB,iBAAO,OAAO,YAAY;AAAA,QAC5B;AACA,YAAI,aAAa,MAAO,QAAO,OAAO,sBAAsB;AAC5D,cAAMC,MAAK,aAAa,yBAAyB;AAEjD,cAAM,SAAS,QAAQ,WAAW,KAAK,CAAC,QAAQ;AAChD,cAAM,OACJ,UAAU,SAAS,WAAW,QAAQ,QAAQ,QAAQ,SAAS,QAAQ,IAAI,IAAI;AACjF,YAAI,SAAS,UAAU,SAAS,UAAU;AACxC,cAAI,MAAM;AACR,gBAAI;AACF,oBAAM,MAAM,YAAY,MAAM,IAAI;AAClC,0BAAY;AACZ,uBAAS,YAAYA,GAAE;AACvB,qBAAO;AAAA,YACT,QAAQ;AACN,uBAAS,YAAY,SAAS,aAAa,UAAU,QAAQ,IAAI,IAAI,EAAE;AAAA,YACzE;AAAA,UACF,WAAW,aAAa,IAAI,GAAG;AAC7B,qBAAS,kBAAkB,IAAI,EAAE;AAAA,UACnC,OAAO;AACL,wBAAY;AACZ,qBAASA;AACT,mBAAO,mBAAmB,SAAS,MAAM,GAAG,IAAa;AAAA,UAC3D;AAAA,QACF,WAAW,SAAS,SAAU,QAAO,OAAOA,GAAE;AAC9C,YAAI,CAAC,MAAM;AACT,iBAAO;AAAA,YACL,SAAS,iBAAiB,QAAQ,SAAS,IAAI,iBAAiB;AAAA,UAClE;AAAA,QACF;AACA,cAAM,SAAS,WAAW,IAAI;AAC9B,oBAAY,OAAO;AACnB,iBAAS,QAAQ,SAAS,YAAY,EAAE,GAAG,OAAO,MAAM;AACxD,eAAO,YAAY,MAAM,OAAO,SAAS;AAAA,MAC3C;AACA,YAAM,SAAS,CAAC,QAAgB;AAC9B,oBAAY;AACZ,iBAAS,SAAS,SAAS,GAAG,KAAK;AACnC,eAAO,mBAAmB,SAAS,MAAM,GAAG,QAAQ;AAAA,MACtD;AAEA,YAAM,eAAe,CAAC,OAAgB,UAAmB;AACvD,cAAM,OAAO,aACT,WAAW,QAAQ,KAAK,KAAK,oBAC7B;AACJ,cAAM,WAAW;AACjB,YAAI,CAAC,OAAO;AAEV,cAAK,QAAQ,IAAI,aAAa,cAAe;AAC3C,gBAAI,KAAK,0BAA0B;AAAA,cACjC;AAAA,cACA,UAAU,oBAAoB,QAAQ,MAAM;AAAA,cAC5C,UAAU,eAAe,KAAK;AAAA,cAC9B,OAAO;AAAA,cACP;AAAA,YACF,CAAC;AAAA,UACH;AACA;AAAA,QACF;AACA,cAAM,OAAO,UAAU,KAAK;AAC5B,YAAI;AAAA,UACF;AAAA,UACA;AAAA,YACE;AAAA,YACA,OAAO;AAAA,YACP;AAAA,YACA,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,UAClD;AAAA,UACA,EAAE,OAAO,MAAM;AAAA,QACjB;AAAA,MACF;AAGA,iBAAS;AACP,YAAI;AACF,gBAAM,MAAM,SAAS;AACrB,cAAI,KAAK,OAAO;AACd,gBAAI,KAAK,oBAAoB;AAAA,cAC3B;AAAA,cACA;AAAA,cACA,GAAG,QAAQ;AAAA,cACX,IAAI,IAAI,IAAI;AAAA,cACZ,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,OAAO,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,SAAS,KAAK,EAAE;AAAA,cAC9D,GAAI,QAAQ,MAAM,EAAE,QAAQ,EAAE,OAAO,QAAQ,IAAI,OAAO,IAAI,QAAQ,IAAI,GAAG,EAAE,IAAI,CAAC;AAAA,YACpF,CAAC;AAAA,UACH;AACA,kBAAQ,EAAE,OAAO,SAAS,QAAQ,IAAI;AACtC,iBAAO;AAAA,QACT,SAAS,GAAG;AACV,cAAI,EAAE,aAAa,cAAe,OAAM;AACxC,gBAAM,QAAQ,QAAQ,EAAE,KAAK;AAC7B,gBAAM,SAAS;AACf,gBAAM,MAAM,MAAM;AAClB,gBAAM,OAAO,UAAU,EAAE,KAAK;AAC9B,cAAI;AAAA,YACF;AAAA,YACA;AAAA,cACE,MAAM,WAAW,IAAI,KAAK;AAAA,cAC1B,QAAQ,IAAI;AAAA,cACZ,OAAO;AAAA,cACP,UAAU;AAAA,cACV,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,YAClD;AAAA,YACA,EAAE,OAAO,EAAE,MAAM;AAAA,UACnB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF,CAAC;AACH;","names":["reason","by"]}

package/dist/features/sorting/strategy.cjs

@@ -85,13 +85,13 @@ function chooseAuto(k) {
   const m = k.present;
   const range = m > 0 ? k.max - k.min + 1 : 0;
   if (k.descents * 64 <= m) {
-    return { algorithm: "tim", reason: `safe integers, nearly sorted (${k.descents} descents)` };
+    return { algorithm: "tim", reason: `nearly|${k.descents}` };
   }
   if (range <= 4 * m && range <= COUNTING_MAX_RANGE) {
-    return { algorithm: "counting", reason: `safe integers, key range ${range} \u2264 4n` };
+    return { algorithm: "counting", reason: `range|${range}` };
   }
-  if (m >= 1e4) return { algorithm: "radix", reason: `safe integers, wide range, n \u2265 10k` };
-  return { algorithm: "tim", reason: "safe integers, wide range, n < 10k" };
+  if (m >= 1e4) return { algorithm: "radix", reason: "wide" };
+  return { algorithm: "tim", reason: "wide-small" };
 }
 function sortIntKeys(k, algorithm) {
   const { rows, present, keys } = k;

package/dist/features/sorting/strategy.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/features/sorting/strategy.ts"],"sourcesContent":["import { countingSort } from 'exsorted/counting'\nimport { radixSort } from 'exsorted/radix'\nimport { timSort } from 'exsorted/tim'\nimport type { ColumnValues } from '../../pipeline/types'\nimport type { IndexComparator } from './compare'\n\n/** The built-in algorithms of `sorting({ algorithm })` / a column's `sortAlgorithm` (§6.4). */\nexport type BuiltinAlgorithm = 'tim' | 'radix' | 'counting' | 'native'\n\n/** Algorithms that need safe-integer keys (they ignore comparators). */\nexport const needsIntKeys = (a: string) => a === 'radix' || a === 'counting'\n\n/**\n * exsorted's `countingSort` refuses a key range above this (it throws `RangeError`); `auto` never\n * picks it beyond.\n */\nconst COUNTING_MAX_RANGE = 1_000_000\n\n/**\n * The integer keys of a single-column sort, from one O(n) scan over the input indices (§6.4).\n * Rows with a missing key (`null`, `undefined`, `NaN`, invalid `Date`) are split off: they go last\n * in input order whatever the direction.\n */\nexport interface IntKeys {\n  /** `rows[0..present)`: rows with a key, in input order; `rows[present..)`: missing, reversed. */\n  readonly rows: Uint32Array\n  readonly present: number\n  /** `keys[p]`: the key of `rows[p]`, negated for `desc` (ascending order of keys = output order). */\n  readonly keys: Float64Array\n  readonly min: number\n  readonly max: number\n  /** Adjacent pairs out of order (`keys[p] < keys[p - 1]`). */\n  readonly descents: number\n}\n\n/**\n * Scans `values` at `indices`: every non-missing key must be a safe integer of one kind (numbers,\n * or `Date`s by `getTime()`), else `undefined` (the caller sorts with a comparator). Stops at the\n * first non-integer, so strings and floats cost one read.\n */\nexport function intKeys(\n  values: ColumnValues,\n  indices: Uint32Array,\n  desc: boolean,\n): IntKeys | undefined {\n  const n = indices.length\n  const numeric = values instanceof Float64Array\n  const rows = new Uint32Array(n)\n  const keys = new Float64Array(n)\n  const sign = desc ? -1 : 1\n  let present = 0\n  let back = n\n  let kind = 0 // 1 = number, 2 = Date\n  let min = Number.POSITIVE_INFINITY\n  let max = Number.NEGATIVE_INFINITY\n  let descents = 0\n  let prev = 0\n  for (let i = 0; i < n; i++) {\n    const r = indices[i] as number\n    let k: number\n    if (numeric) {\n      k = values[r] as number\n    } else {\n      const v = (values as readonly unknown[])[r]\n      if (typeof v === 'number') {\n        if (kind === 2) return undefined\n        kind = 1\n        k = v\n      } else if (v instanceof Date) {\n        if (kind === 1) return undefined\n        kind = 2\n        k = v.getTime()\n      } else if (v === null || v === undefined) {\n        rows[--back] = r\n        continue\n      } else return undefined\n    }\n    if (Number.isNaN(k)) {\n      rows[--back] = r\n      continue\n    }\n    if (!Number.isSafeInteger(k)) return undefined\n    k *= sign\n    if (k < min) min = k\n    if (k > max) max = k\n    if (present > 0 && k < prev) descents++\n    prev = k\n    rows[present] = r\n    keys[present++] = k\n  }\n  return { rows, present, keys, min, max, descents }\n}\n\n/** `auto`'s choice for integer keys (§6.4 table), with the reason (DK_SORT_STRATEGY). */\nexport function chooseAuto(k: IntKeys): { algorithm: BuiltinAlgorithm; reason: string } {\n  const m = k.present\n  const range = m > 0 ? k.max - k.min + 1 : 0\n  // Nearly sorted: natural runs average ≥ 64 keys, so tim merges few runs (~O(n)).\n  if (k.descents * 64 <= m) {\n    return { algorithm: 'tim', reason: `safe integers, nearly sorted (${k.descents} descents)` }\n  }\n  if (range <= 4 * m && range <= COUNTING_MAX_RANGE) {\n    return { algorithm: 'counting', reason: `safe integers, key range ${range} ≤ 4n` }\n  }\n  if (m >= 10_000) return { algorithm: 'radix', reason: `safe integers, wide range, n ≥ 10k` }\n  return { algorithm: 'tim', reason: 'safe integers, wide range, n < 10k' }\n}\n\n/**\n * Sorts integer keys with `algorithm` (any built-in but `native`): exsorted works on a plain array\n * of positions (radix / counting require `Array.isArray`), never on the caller's indices. Missing\n * rows are appended in input order. exsorted throws on keys it cannot take (e.g. counting over a\n * range above 1e6): the caller falls back.\n */\nexport function sortIntKeys(k: IntKeys, algorithm: BuiltinAlgorithm): Uint32Array {\n  const { rows, present, keys } = k\n  const n = rows.length\n  const pos = new Array<number>(present)\n  for (let p = 0; p < present; p++) pos[p] = p\n  const key = (p: number) => keys[p] as number\n  const cmp = (a: number, b: number) => (keys[a] as number) - (keys[b] as number)\n  const order =\n    algorithm === 'radix'\n      ? radixSort(pos, key)\n      : algorithm === 'counting'\n        ? countingSort(pos, key)\n        : algorithm === 'tim'\n          ? timSort(pos, cmp)\n          : pos.sort(cmp)\n  const out = new Uint32Array(n)\n  for (let j = 0; j < present; j++) out[j] = rows[order[j] as number] as number\n  for (let j = present, b = n - 1; j < n; j++, b--) out[j] = rows[b] as number\n  return out\n}\n\n/** Sorts a copy of `indices` with a comparator: native, or exsorted tim (stable). */\nexport function sortWithComparator(\n  indices: Uint32Array,\n  cmp: IndexComparator,\n  algorithm: 'tim' | 'native',\n): Uint32Array {\n  if (algorithm === 'native') return indices.slice().sort(cmp)\n  return Uint32Array.from(timSort(Array.from(indices), cmp))\n}\n\n/** exsorted's algorithms are usable (§8.5): checked once per feature instance. */\nexport const hasExsorted = () =>\n  typeof timSort === 'function' &&\n  typeof radixSort === 'function' &&\n  typeof countingSort === 'function'\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,sBAA6B;AAC7B,mBAA0B;AAC1B,iBAAwB;AAQjB,IAAM,eAAe,CAAC,MAAc,MAAM,WAAW,MAAM;AAMlE,IAAM,qBAAqB;AAwBpB,SAAS,QACd,QACA,SACA,MACqB;AACrB,QAAM,IAAI,QAAQ;AAClB,QAAM,UAAU,kBAAkB;AAClC,QAAM,OAAO,IAAI,YAAY,CAAC;AAC9B,QAAM,OAAO,IAAI,aAAa,CAAC;AAC/B,QAAM,OAAO,OAAO,KAAK;AACzB,MAAI,UAAU;AACd,MAAI,OAAO;AACX,MAAI,OAAO;AACX,MAAI,MAAM,OAAO;AACjB,MAAI,MAAM,OAAO;AACjB,MAAI,WAAW;AACf,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,IAAI,QAAQ,CAAC;AACnB,QAAI;AACJ,QAAI,SAAS;AACX,UAAI,OAAO,CAAC;AAAA,IACd,OAAO;AACL,YAAM,IAAK,OAA8B,CAAC;AAC1C,UAAI,OAAO,MAAM,UAAU;AACzB,YAAI,SAAS,EAAG,QAAO;AACvB,eAAO;AACP,YAAI;AAAA,MACN,WAAW,aAAa,MAAM;AAC5B,YAAI,SAAS,EAAG,QAAO;AACvB,eAAO;AACP,YAAI,EAAE,QAAQ;AAAA,MAChB,WAAW,MAAM,QAAQ,MAAM,QAAW;AACxC,aAAK,EAAE,IAAI,IAAI;AACf;AAAA,MACF,MAAO,QAAO;AAAA,IAChB;AACA,QAAI,OAAO,MAAM,CAAC,GAAG;AACnB,WAAK,EAAE,IAAI,IAAI;AACf;AAAA,IACF;AACA,QAAI,CAAC,OAAO,cAAc,CAAC,EAAG,QAAO;AACrC,SAAK;AACL,QAAI,IAAI,IAAK,OAAM;AACnB,QAAI,IAAI,IAAK,OAAM;AACnB,QAAI,UAAU,KAAK,IAAI,KAAM;AAC7B,WAAO;AACP,SAAK,OAAO,IAAI;AAChB,SAAK,SAAS,IAAI;AAAA,EACpB;AACA,SAAO,EAAE,MAAM,SAAS,MAAM,KAAK,KAAK,SAAS;AACnD;AAGO,SAAS,WAAW,GAA6D;AACtF,QAAM,IAAI,EAAE;AACZ,QAAM,QAAQ,IAAI,IAAI,EAAE,MAAM,EAAE,MAAM,IAAI;AAE1C,MAAI,EAAE,WAAW,MAAM,GAAG;AACxB,WAAO,EAAE,WAAW,OAAO,QAAQ,iCAAiC,EAAE,QAAQ,aAAa;AAAA,EAC7F;AACA,MAAI,SAAS,IAAI,KAAK,SAAS,oBAAoB;AACjD,WAAO,EAAE,WAAW,YAAY,QAAQ,4BAA4B,KAAK,aAAQ;AAAA,EACnF;AACA,MAAI,KAAK,IAAQ,QAAO,EAAE,WAAW,SAAS,QAAQ,0CAAqC;AAC3F,SAAO,EAAE,WAAW,OAAO,QAAQ,qCAAqC;AAC1E;AAQO,SAAS,YAAY,GAAY,WAA0C;AAChF,QAAM,EAAE,MAAM,SAAS,KAAK,IAAI;AAChC,QAAM,IAAI,KAAK;AACf,QAAM,MAAM,IAAI,MAAc,OAAO;AACrC,WAAS,IAAI,GAAG,IAAI,SAAS,IAAK,KAAI,CAAC,IAAI;AAC3C,QAAM,MAAM,CAAC,MAAc,KAAK,CAAC;AACjC,QAAM,MAAM,CAAC,GAAW,MAAe,KAAK,CAAC,IAAgB,KAAK,CAAC;AACnE,QAAM,QACJ,cAAc,cACV,wBAAU,KAAK,GAAG,IAClB,cAAc,iBACZ,8BAAa,KAAK,GAAG,IACrB,cAAc,YACZ,oBAAQ,KAAK,GAAG,IAChB,IAAI,KAAK,GAAG;AACtB,QAAM,MAAM,IAAI,YAAY,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,SAAS,IAAK,KAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAW;AAClE,WAAS,IAAI,SAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAK,KAAI,CAAC,IAAI,KAAK,CAAC;AACjE,SAAO;AACT;AAGO,SAAS,mBACd,SACA,KACA,WACa;AACb,MAAI,cAAc,SAAU,QAAO,QAAQ,MAAM,EAAE,KAAK,GAAG;AAC3D,SAAO,YAAY,SAAK,oBAAQ,MAAM,KAAK,OAAO,GAAG,GAAG,CAAC;AAC3D;AAGO,IAAM,cAAc,MACzB,OAAO,uBAAY,cACnB,OAAO,2BAAc,cACrB,OAAO,iCAAiB;","names":[]}
+{"version":3,"sources":["../../../src/features/sorting/strategy.ts"],"sourcesContent":["import { countingSort } from 'exsorted/counting'\nimport { radixSort } from 'exsorted/radix'\nimport { timSort } from 'exsorted/tim'\nimport type { ColumnValues } from '../../pipeline/types'\nimport type { IndexComparator } from './compare'\n\n/** The built-in algorithms of `sorting({ algorithm })` / a column's `sortAlgorithm` (§6.4). */\nexport type BuiltinAlgorithm = 'tim' | 'radix' | 'counting' | 'native'\n\n/** Algorithms that need safe-integer keys (they ignore comparators). */\nexport const needsIntKeys = (a: string) => a === 'radix' || a === 'counting'\n\n/**\n * exsorted's `countingSort` refuses a key range above this (it throws `RangeError`); `auto` never\n * picks it beyond.\n */\nconst COUNTING_MAX_RANGE = 1_000_000\n\n/**\n * The integer keys of a single-column sort, from one O(n) scan over the input indices (§6.4).\n * Rows with a missing key (`null`, `undefined`, `NaN`, invalid `Date`) are split off: they go last\n * in input order whatever the direction.\n */\nexport interface IntKeys {\n  /** `rows[0..present)`: rows with a key, in input order; `rows[present..)`: missing, reversed. */\n  readonly rows: Uint32Array\n  readonly present: number\n  /** `keys[p]`: the key of `rows[p]`, negated for `desc` (ascending order of keys = output order). */\n  readonly keys: Float64Array\n  readonly min: number\n  readonly max: number\n  /** Adjacent pairs out of order (`keys[p] < keys[p - 1]`). */\n  readonly descents: number\n}\n\n/**\n * Scans `values` at `indices`: every non-missing key must be a safe integer of one kind (numbers,\n * or `Date`s by `getTime()`), else `undefined` (the caller sorts with a comparator). Stops at the\n * first non-integer, so strings and floats cost one read.\n */\nexport function intKeys(\n  values: ColumnValues,\n  indices: Uint32Array,\n  desc: boolean,\n): IntKeys | undefined {\n  const n = indices.length\n  const numeric = values instanceof Float64Array\n  const rows = new Uint32Array(n)\n  const keys = new Float64Array(n)\n  const sign = desc ? -1 : 1\n  let present = 0\n  let back = n\n  let kind = 0 // 1 = number, 2 = Date\n  let min = Number.POSITIVE_INFINITY\n  let max = Number.NEGATIVE_INFINITY\n  let descents = 0\n  let prev = 0\n  for (let i = 0; i < n; i++) {\n    const r = indices[i] as number\n    let k: number\n    if (numeric) {\n      k = values[r] as number\n    } else {\n      const v = (values as readonly unknown[])[r]\n      if (typeof v === 'number') {\n        if (kind === 2) return undefined\n        kind = 1\n        k = v\n      } else if (v instanceof Date) {\n        if (kind === 1) return undefined\n        kind = 2\n        k = v.getTime()\n      } else if (v === null || v === undefined) {\n        rows[--back] = r\n        continue\n      } else return undefined\n    }\n    if (Number.isNaN(k)) {\n      rows[--back] = r\n      continue\n    }\n    if (!Number.isSafeInteger(k)) return undefined\n    k *= sign\n    if (k < min) min = k\n    if (k > max) max = k\n    if (present > 0 && k < prev) descents++\n    prev = k\n    rows[present] = r\n    keys[present++] = k\n  }\n  return { rows, present, keys, min, max, descents }\n}\n\n/**\n * `auto`'s choice for integer keys (§6.4 table), with the reason (DK_SORT_STRATEGY): the end of a\n * prose key, `auto-<reason>` (diagnostics/prose.ts).\n */\nexport function chooseAuto(k: IntKeys): { algorithm: BuiltinAlgorithm; reason: string } {\n  const m = k.present\n  const range = m > 0 ? k.max - k.min + 1 : 0\n  // Nearly sorted: natural runs average ≥ 64 keys, so tim merges few runs (~O(n)).\n  if (k.descents * 64 <= m) {\n    return { algorithm: 'tim', reason: `nearly|${k.descents}` }\n  }\n  if (range <= 4 * m && range <= COUNTING_MAX_RANGE) {\n    return { algorithm: 'counting', reason: `range|${range}` }\n  }\n  if (m >= 10_000) return { algorithm: 'radix', reason: 'wide' }\n  return { algorithm: 'tim', reason: 'wide-small' }\n}\n\n/**\n * Sorts integer keys with `algorithm` (any built-in but `native`): exsorted works on a plain array\n * of positions (radix / counting require `Array.isArray`), never on the caller's indices. Missing\n * rows are appended in input order. exsorted throws on keys it cannot take (e.g. counting over a\n * range above 1e6): the caller falls back.\n */\nexport function sortIntKeys(k: IntKeys, algorithm: BuiltinAlgorithm): Uint32Array {\n  const { rows, present, keys } = k\n  const n = rows.length\n  const pos = new Array<number>(present)\n  for (let p = 0; p < present; p++) pos[p] = p\n  const key = (p: number) => keys[p] as number\n  const cmp = (a: number, b: number) => (keys[a] as number) - (keys[b] as number)\n  const order =\n    algorithm === 'radix'\n      ? radixSort(pos, key)\n      : algorithm === 'counting'\n        ? countingSort(pos, key)\n        : algorithm === 'tim'\n          ? timSort(pos, cmp)\n          : pos.sort(cmp)\n  const out = new Uint32Array(n)\n  for (let j = 0; j < present; j++) out[j] = rows[order[j] as number] as number\n  for (let j = present, b = n - 1; j < n; j++, b--) out[j] = rows[b] as number\n  return out\n}\n\n/** Sorts a copy of `indices` with a comparator: native, or exsorted tim (stable). */\nexport function sortWithComparator(\n  indices: Uint32Array,\n  cmp: IndexComparator,\n  algorithm: 'tim' | 'native',\n): Uint32Array {\n  if (algorithm === 'native') return indices.slice().sort(cmp)\n  return Uint32Array.from(timSort(Array.from(indices), cmp))\n}\n\n/** exsorted's algorithms are usable (§8.5): checked once per feature instance. */\nexport const hasExsorted = () =>\n  typeof timSort === 'function' &&\n  typeof radixSort === 'function' &&\n  typeof countingSort === 'function'\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,sBAA6B;AAC7B,mBAA0B;AAC1B,iBAAwB;AAQjB,IAAM,eAAe,CAAC,MAAc,MAAM,WAAW,MAAM;AAMlE,IAAM,qBAAqB;AAwBpB,SAAS,QACd,QACA,SACA,MACqB;AACrB,QAAM,IAAI,QAAQ;AAClB,QAAM,UAAU,kBAAkB;AAClC,QAAM,OAAO,IAAI,YAAY,CAAC;AAC9B,QAAM,OAAO,IAAI,aAAa,CAAC;AAC/B,QAAM,OAAO,OAAO,KAAK;AACzB,MAAI,UAAU;AACd,MAAI,OAAO;AACX,MAAI,OAAO;AACX,MAAI,MAAM,OAAO;AACjB,MAAI,MAAM,OAAO;AACjB,MAAI,WAAW;AACf,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,IAAI,QAAQ,CAAC;AACnB,QAAI;AACJ,QAAI,SAAS;AACX,UAAI,OAAO,CAAC;AAAA,IACd,OAAO;AACL,YAAM,IAAK,OAA8B,CAAC;AAC1C,UAAI,OAAO,MAAM,UAAU;AACzB,YAAI,SAAS,EAAG,QAAO;AACvB,eAAO;AACP,YAAI;AAAA,MACN,WAAW,aAAa,MAAM;AAC5B,YAAI,SAAS,EAAG,QAAO;AACvB,eAAO;AACP,YAAI,EAAE,QAAQ;AAAA,MAChB,WAAW,MAAM,QAAQ,MAAM,QAAW;AACxC,aAAK,EAAE,IAAI,IAAI;AACf;AAAA,MACF,MAAO,QAAO;AAAA,IAChB;AACA,QAAI,OAAO,MAAM,CAAC,GAAG;AACnB,WAAK,EAAE,IAAI,IAAI;AACf;AAAA,IACF;AACA,QAAI,CAAC,OAAO,cAAc,CAAC,EAAG,QAAO;AACrC,SAAK;AACL,QAAI,IAAI,IAAK,OAAM;AACnB,QAAI,IAAI,IAAK,OAAM;AACnB,QAAI,UAAU,KAAK,IAAI,KAAM;AAC7B,WAAO;AACP,SAAK,OAAO,IAAI;AAChB,SAAK,SAAS,IAAI;AAAA,EACpB;AACA,SAAO,EAAE,MAAM,SAAS,MAAM,KAAK,KAAK,SAAS;AACnD;AAMO,SAAS,WAAW,GAA6D;AACtF,QAAM,IAAI,EAAE;AACZ,QAAM,QAAQ,IAAI,IAAI,EAAE,MAAM,EAAE,MAAM,IAAI;AAE1C,MAAI,EAAE,WAAW,MAAM,GAAG;AACxB,WAAO,EAAE,WAAW,OAAO,QAAQ,UAAU,EAAE,QAAQ,GAAG;AAAA,EAC5D;AACA,MAAI,SAAS,IAAI,KAAK,SAAS,oBAAoB;AACjD,WAAO,EAAE,WAAW,YAAY,QAAQ,SAAS,KAAK,GAAG;AAAA,EAC3D;AACA,MAAI,KAAK,IAAQ,QAAO,EAAE,WAAW,SAAS,QAAQ,OAAO;AAC7D,SAAO,EAAE,WAAW,OAAO,QAAQ,aAAa;AAClD;AAQO,SAAS,YAAY,GAAY,WAA0C;AAChF,QAAM,EAAE,MAAM,SAAS,KAAK,IAAI;AAChC,QAAM,IAAI,KAAK;AACf,QAAM,MAAM,IAAI,MAAc,OAAO;AACrC,WAAS,IAAI,GAAG,IAAI,SAAS,IAAK,KAAI,CAAC,IAAI;AAC3C,QAAM,MAAM,CAAC,MAAc,KAAK,CAAC;AACjC,QAAM,MAAM,CAAC,GAAW,MAAe,KAAK,CAAC,IAAgB,KAAK,CAAC;AACnE,QAAM,QACJ,cAAc,cACV,wBAAU,KAAK,GAAG,IAClB,cAAc,iBACZ,8BAAa,KAAK,GAAG,IACrB,cAAc,YACZ,oBAAQ,KAAK,GAAG,IAChB,IAAI,KAAK,GAAG;AACtB,QAAM,MAAM,IAAI,YAAY,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,SAAS,IAAK,KAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAW;AAClE,WAAS,IAAI,SAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAK,KAAI,CAAC,IAAI,KAAK,CAAC;AACjE,SAAO;AACT;AAGO,SAAS,mBACd,SACA,KACA,WACa;AACb,MAAI,cAAc,SAAU,QAAO,QAAQ,MAAM,EAAE,KAAK,GAAG;AAC3D,SAAO,YAAY,SAAK,oBAAQ,MAAM,KAAK,OAAO,GAAG,GAAG,CAAC;AAC3D;AAGO,IAAM,cAAc,MACzB,OAAO,uBAAY,cACnB,OAAO,2BAAc,cACrB,OAAO,iCAAiB;","names":[]}

package/dist/features/sorting/strategy.js

@@ -56,13 +56,13 @@ function chooseAuto(k) {
   const m = k.present;
   const range = m > 0 ? k.max - k.min + 1 : 0;
   if (k.descents * 64 <= m) {
-    return { algorithm: "tim", reason: `safe integers, nearly sorted (${k.descents} descents)` };
+    return { algorithm: "tim", reason: `nearly|${k.descents}` };
   }
   if (range <= 4 * m && range <= COUNTING_MAX_RANGE) {
-    return { algorithm: "counting", reason: `safe integers, key range ${range} \u2264 4n` };
+    return { algorithm: "counting", reason: `range|${range}` };
   }
-  if (m >= 1e4) return { algorithm: "radix", reason: `safe integers, wide range, n \u2265 10k` };
-  return { algorithm: "tim", reason: "safe integers, wide range, n < 10k" };
+  if (m >= 1e4) return { algorithm: "radix", reason: "wide" };
+  return { algorithm: "tim", reason: "wide-small" };
 }
 function sortIntKeys(k, algorithm) {
   const { rows, present, keys } = k;

package/dist/features/sorting/strategy.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/features/sorting/strategy.ts"],"sourcesContent":["import { countingSort } from 'exsorted/counting'\nimport { radixSort } from 'exsorted/radix'\nimport { timSort } from 'exsorted/tim'\nimport type { ColumnValues } from '../../pipeline/types'\nimport type { IndexComparator } from './compare'\n\n/** The built-in algorithms of `sorting({ algorithm })` / a column's `sortAlgorithm` (§6.4). */\nexport type BuiltinAlgorithm = 'tim' | 'radix' | 'counting' | 'native'\n\n/** Algorithms that need safe-integer keys (they ignore comparators). */\nexport const needsIntKeys = (a: string) => a === 'radix' || a === 'counting'\n\n/**\n * exsorted's `countingSort` refuses a key range above this (it throws `RangeError`); `auto` never\n * picks it beyond.\n */\nconst COUNTING_MAX_RANGE = 1_000_000\n\n/**\n * The integer keys of a single-column sort, from one O(n) scan over the input indices (§6.4).\n * Rows with a missing key (`null`, `undefined`, `NaN`, invalid `Date`) are split off: they go last\n * in input order whatever the direction.\n */\nexport interface IntKeys {\n  /** `rows[0..present)`: rows with a key, in input order; `rows[present..)`: missing, reversed. */\n  readonly rows: Uint32Array\n  readonly present: number\n  /** `keys[p]`: the key of `rows[p]`, negated for `desc` (ascending order of keys = output order). */\n  readonly keys: Float64Array\n  readonly min: number\n  readonly max: number\n  /** Adjacent pairs out of order (`keys[p] < keys[p - 1]`). */\n  readonly descents: number\n}\n\n/**\n * Scans `values` at `indices`: every non-missing key must be a safe integer of one kind (numbers,\n * or `Date`s by `getTime()`), else `undefined` (the caller sorts with a comparator). Stops at the\n * first non-integer, so strings and floats cost one read.\n */\nexport function intKeys(\n  values: ColumnValues,\n  indices: Uint32Array,\n  desc: boolean,\n): IntKeys | undefined {\n  const n = indices.length\n  const numeric = values instanceof Float64Array\n  const rows = new Uint32Array(n)\n  const keys = new Float64Array(n)\n  const sign = desc ? -1 : 1\n  let present = 0\n  let back = n\n  let kind = 0 // 1 = number, 2 = Date\n  let min = Number.POSITIVE_INFINITY\n  let max = Number.NEGATIVE_INFINITY\n  let descents = 0\n  let prev = 0\n  for (let i = 0; i < n; i++) {\n    const r = indices[i] as number\n    let k: number\n    if (numeric) {\n      k = values[r] as number\n    } else {\n      const v = (values as readonly unknown[])[r]\n      if (typeof v === 'number') {\n        if (kind === 2) return undefined\n        kind = 1\n        k = v\n      } else if (v instanceof Date) {\n        if (kind === 1) return undefined\n        kind = 2\n        k = v.getTime()\n      } else if (v === null || v === undefined) {\n        rows[--back] = r\n        continue\n      } else return undefined\n    }\n    if (Number.isNaN(k)) {\n      rows[--back] = r\n      continue\n    }\n    if (!Number.isSafeInteger(k)) return undefined\n    k *= sign\n    if (k < min) min = k\n    if (k > max) max = k\n    if (present > 0 && k < prev) descents++\n    prev = k\n    rows[present] = r\n    keys[present++] = k\n  }\n  return { rows, present, keys, min, max, descents }\n}\n\n/** `auto`'s choice for integer keys (§6.4 table), with the reason (DK_SORT_STRATEGY). */\nexport function chooseAuto(k: IntKeys): { algorithm: BuiltinAlgorithm; reason: string } {\n  const m = k.present\n  const range = m > 0 ? k.max - k.min + 1 : 0\n  // Nearly sorted: natural runs average ≥ 64 keys, so tim merges few runs (~O(n)).\n  if (k.descents * 64 <= m) {\n    return { algorithm: 'tim', reason: `safe integers, nearly sorted (${k.descents} descents)` }\n  }\n  if (range <= 4 * m && range <= COUNTING_MAX_RANGE) {\n    return { algorithm: 'counting', reason: `safe integers, key range ${range} ≤ 4n` }\n  }\n  if (m >= 10_000) return { algorithm: 'radix', reason: `safe integers, wide range, n ≥ 10k` }\n  return { algorithm: 'tim', reason: 'safe integers, wide range, n < 10k' }\n}\n\n/**\n * Sorts integer keys with `algorithm` (any built-in but `native`): exsorted works on a plain array\n * of positions (radix / counting require `Array.isArray`), never on the caller's indices. Missing\n * rows are appended in input order. exsorted throws on keys it cannot take (e.g. counting over a\n * range above 1e6): the caller falls back.\n */\nexport function sortIntKeys(k: IntKeys, algorithm: BuiltinAlgorithm): Uint32Array {\n  const { rows, present, keys } = k\n  const n = rows.length\n  const pos = new Array<number>(present)\n  for (let p = 0; p < present; p++) pos[p] = p\n  const key = (p: number) => keys[p] as number\n  const cmp = (a: number, b: number) => (keys[a] as number) - (keys[b] as number)\n  const order =\n    algorithm === 'radix'\n      ? radixSort(pos, key)\n      : algorithm === 'counting'\n        ? countingSort(pos, key)\n        : algorithm === 'tim'\n          ? timSort(pos, cmp)\n          : pos.sort(cmp)\n  const out = new Uint32Array(n)\n  for (let j = 0; j < present; j++) out[j] = rows[order[j] as number] as number\n  for (let j = present, b = n - 1; j < n; j++, b--) out[j] = rows[b] as number\n  return out\n}\n\n/** Sorts a copy of `indices` with a comparator: native, or exsorted tim (stable). */\nexport function sortWithComparator(\n  indices: Uint32Array,\n  cmp: IndexComparator,\n  algorithm: 'tim' | 'native',\n): Uint32Array {\n  if (algorithm === 'native') return indices.slice().sort(cmp)\n  return Uint32Array.from(timSort(Array.from(indices), cmp))\n}\n\n/** exsorted's algorithms are usable (§8.5): checked once per feature instance. */\nexport const hasExsorted = () =>\n  typeof timSort === 'function' &&\n  typeof radixSort === 'function' &&\n  typeof countingSort === 'function'\n"],"mappings":";AAAA,SAAS,oBAAoB;AAC7B,SAAS,iBAAiB;AAC1B,SAAS,eAAe;AAQjB,IAAM,eAAe,CAAC,MAAc,MAAM,WAAW,MAAM;AAMlE,IAAM,qBAAqB;AAwBpB,SAAS,QACd,QACA,SACA,MACqB;AACrB,QAAM,IAAI,QAAQ;AAClB,QAAM,UAAU,kBAAkB;AAClC,QAAM,OAAO,IAAI,YAAY,CAAC;AAC9B,QAAM,OAAO,IAAI,aAAa,CAAC;AAC/B,QAAM,OAAO,OAAO,KAAK;AACzB,MAAI,UAAU;AACd,MAAI,OAAO;AACX,MAAI,OAAO;AACX,MAAI,MAAM,OAAO;AACjB,MAAI,MAAM,OAAO;AACjB,MAAI,WAAW;AACf,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,IAAI,QAAQ,CAAC;AACnB,QAAI;AACJ,QAAI,SAAS;AACX,UAAI,OAAO,CAAC;AAAA,IACd,OAAO;AACL,YAAM,IAAK,OAA8B,CAAC;AAC1C,UAAI,OAAO,MAAM,UAAU;AACzB,YAAI,SAAS,EAAG,QAAO;AACvB,eAAO;AACP,YAAI;AAAA,MACN,WAAW,aAAa,MAAM;AAC5B,YAAI,SAAS,EAAG,QAAO;AACvB,eAAO;AACP,YAAI,EAAE,QAAQ;AAAA,MAChB,WAAW,MAAM,QAAQ,MAAM,QAAW;AACxC,aAAK,EAAE,IAAI,IAAI;AACf;AAAA,MACF,MAAO,QAAO;AAAA,IAChB;AACA,QAAI,OAAO,MAAM,CAAC,GAAG;AACnB,WAAK,EAAE,IAAI,IAAI;AACf;AAAA,IACF;AACA,QAAI,CAAC,OAAO,cAAc,CAAC,EAAG,QAAO;AACrC,SAAK;AACL,QAAI,IAAI,IAAK,OAAM;AACnB,QAAI,IAAI,IAAK,OAAM;AACnB,QAAI,UAAU,KAAK,IAAI,KAAM;AAC7B,WAAO;AACP,SAAK,OAAO,IAAI;AAChB,SAAK,SAAS,IAAI;AAAA,EACpB;AACA,SAAO,EAAE,MAAM,SAAS,MAAM,KAAK,KAAK,SAAS;AACnD;AAGO,SAAS,WAAW,GAA6D;AACtF,QAAM,IAAI,EAAE;AACZ,QAAM,QAAQ,IAAI,IAAI,EAAE,MAAM,EAAE,MAAM,IAAI;AAE1C,MAAI,EAAE,WAAW,MAAM,GAAG;AACxB,WAAO,EAAE,WAAW,OAAO,QAAQ,iCAAiC,EAAE,QAAQ,aAAa;AAAA,EAC7F;AACA,MAAI,SAAS,IAAI,KAAK,SAAS,oBAAoB;AACjD,WAAO,EAAE,WAAW,YAAY,QAAQ,4BAA4B,KAAK,aAAQ;AAAA,EACnF;AACA,MAAI,KAAK,IAAQ,QAAO,EAAE,WAAW,SAAS,QAAQ,0CAAqC;AAC3F,SAAO,EAAE,WAAW,OAAO,QAAQ,qCAAqC;AAC1E;AAQO,SAAS,YAAY,GAAY,WAA0C;AAChF,QAAM,EAAE,MAAM,SAAS,KAAK,IAAI;AAChC,QAAM,IAAI,KAAK;AACf,QAAM,MAAM,IAAI,MAAc,OAAO;AACrC,WAAS,IAAI,GAAG,IAAI,SAAS,IAAK,KAAI,CAAC,IAAI;AAC3C,QAAM,MAAM,CAAC,MAAc,KAAK,CAAC;AACjC,QAAM,MAAM,CAAC,GAAW,MAAe,KAAK,CAAC,IAAgB,KAAK,CAAC;AACnE,QAAM,QACJ,cAAc,UACV,UAAU,KAAK,GAAG,IAClB,cAAc,aACZ,aAAa,KAAK,GAAG,IACrB,cAAc,QACZ,QAAQ,KAAK,GAAG,IAChB,IAAI,KAAK,GAAG;AACtB,QAAM,MAAM,IAAI,YAAY,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,SAAS,IAAK,KAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAW;AAClE,WAAS,IAAI,SAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAK,KAAI,CAAC,IAAI,KAAK,CAAC;AACjE,SAAO;AACT;AAGO,SAAS,mBACd,SACA,KACA,WACa;AACb,MAAI,cAAc,SAAU,QAAO,QAAQ,MAAM,EAAE,KAAK,GAAG;AAC3D,SAAO,YAAY,KAAK,QAAQ,MAAM,KAAK,OAAO,GAAG,GAAG,CAAC;AAC3D;AAGO,IAAM,cAAc,MACzB,OAAO,YAAY,cACnB,OAAO,cAAc,cACrB,OAAO,iBAAiB;","names":[]}
+{"version":3,"sources":["../../../src/features/sorting/strategy.ts"],"sourcesContent":["import { countingSort } from 'exsorted/counting'\nimport { radixSort } from 'exsorted/radix'\nimport { timSort } from 'exsorted/tim'\nimport type { ColumnValues } from '../../pipeline/types'\nimport type { IndexComparator } from './compare'\n\n/** The built-in algorithms of `sorting({ algorithm })` / a column's `sortAlgorithm` (§6.4). */\nexport type BuiltinAlgorithm = 'tim' | 'radix' | 'counting' | 'native'\n\n/** Algorithms that need safe-integer keys (they ignore comparators). */\nexport const needsIntKeys = (a: string) => a === 'radix' || a === 'counting'\n\n/**\n * exsorted's `countingSort` refuses a key range above this (it throws `RangeError`); `auto` never\n * picks it beyond.\n */\nconst COUNTING_MAX_RANGE = 1_000_000\n\n/**\n * The integer keys of a single-column sort, from one O(n) scan over the input indices (§6.4).\n * Rows with a missing key (`null`, `undefined`, `NaN`, invalid `Date`) are split off: they go last\n * in input order whatever the direction.\n */\nexport interface IntKeys {\n  /** `rows[0..present)`: rows with a key, in input order; `rows[present..)`: missing, reversed. */\n  readonly rows: Uint32Array\n  readonly present: number\n  /** `keys[p]`: the key of `rows[p]`, negated for `desc` (ascending order of keys = output order). */\n  readonly keys: Float64Array\n  readonly min: number\n  readonly max: number\n  /** Adjacent pairs out of order (`keys[p] < keys[p - 1]`). */\n  readonly descents: number\n}\n\n/**\n * Scans `values` at `indices`: every non-missing key must be a safe integer of one kind (numbers,\n * or `Date`s by `getTime()`), else `undefined` (the caller sorts with a comparator). Stops at the\n * first non-integer, so strings and floats cost one read.\n */\nexport function intKeys(\n  values: ColumnValues,\n  indices: Uint32Array,\n  desc: boolean,\n): IntKeys | undefined {\n  const n = indices.length\n  const numeric = values instanceof Float64Array\n  const rows = new Uint32Array(n)\n  const keys = new Float64Array(n)\n  const sign = desc ? -1 : 1\n  let present = 0\n  let back = n\n  let kind = 0 // 1 = number, 2 = Date\n  let min = Number.POSITIVE_INFINITY\n  let max = Number.NEGATIVE_INFINITY\n  let descents = 0\n  let prev = 0\n  for (let i = 0; i < n; i++) {\n    const r = indices[i] as number\n    let k: number\n    if (numeric) {\n      k = values[r] as number\n    } else {\n      const v = (values as readonly unknown[])[r]\n      if (typeof v === 'number') {\n        if (kind === 2) return undefined\n        kind = 1\n        k = v\n      } else if (v instanceof Date) {\n        if (kind === 1) return undefined\n        kind = 2\n        k = v.getTime()\n      } else if (v === null || v === undefined) {\n        rows[--back] = r\n        continue\n      } else return undefined\n    }\n    if (Number.isNaN(k)) {\n      rows[--back] = r\n      continue\n    }\n    if (!Number.isSafeInteger(k)) return undefined\n    k *= sign\n    if (k < min) min = k\n    if (k > max) max = k\n    if (present > 0 && k < prev) descents++\n    prev = k\n    rows[present] = r\n    keys[present++] = k\n  }\n  return { rows, present, keys, min, max, descents }\n}\n\n/**\n * `auto`'s choice for integer keys (§6.4 table), with the reason (DK_SORT_STRATEGY): the end of a\n * prose key, `auto-<reason>` (diagnostics/prose.ts).\n */\nexport function chooseAuto(k: IntKeys): { algorithm: BuiltinAlgorithm; reason: string } {\n  const m = k.present\n  const range = m > 0 ? k.max - k.min + 1 : 0\n  // Nearly sorted: natural runs average ≥ 64 keys, so tim merges few runs (~O(n)).\n  if (k.descents * 64 <= m) {\n    return { algorithm: 'tim', reason: `nearly|${k.descents}` }\n  }\n  if (range <= 4 * m && range <= COUNTING_MAX_RANGE) {\n    return { algorithm: 'counting', reason: `range|${range}` }\n  }\n  if (m >= 10_000) return { algorithm: 'radix', reason: 'wide' }\n  return { algorithm: 'tim', reason: 'wide-small' }\n}\n\n/**\n * Sorts integer keys with `algorithm` (any built-in but `native`): exsorted works on a plain array\n * of positions (radix / counting require `Array.isArray`), never on the caller's indices. Missing\n * rows are appended in input order. exsorted throws on keys it cannot take (e.g. counting over a\n * range above 1e6): the caller falls back.\n */\nexport function sortIntKeys(k: IntKeys, algorithm: BuiltinAlgorithm): Uint32Array {\n  const { rows, present, keys } = k\n  const n = rows.length\n  const pos = new Array<number>(present)\n  for (let p = 0; p < present; p++) pos[p] = p\n  const key = (p: number) => keys[p] as number\n  const cmp = (a: number, b: number) => (keys[a] as number) - (keys[b] as number)\n  const order =\n    algorithm === 'radix'\n      ? radixSort(pos, key)\n      : algorithm === 'counting'\n        ? countingSort(pos, key)\n        : algorithm === 'tim'\n          ? timSort(pos, cmp)\n          : pos.sort(cmp)\n  const out = new Uint32Array(n)\n  for (let j = 0; j < present; j++) out[j] = rows[order[j] as number] as number\n  for (let j = present, b = n - 1; j < n; j++, b--) out[j] = rows[b] as number\n  return out\n}\n\n/** Sorts a copy of `indices` with a comparator: native, or exsorted tim (stable). */\nexport function sortWithComparator(\n  indices: Uint32Array,\n  cmp: IndexComparator,\n  algorithm: 'tim' | 'native',\n): Uint32Array {\n  if (algorithm === 'native') return indices.slice().sort(cmp)\n  return Uint32Array.from(timSort(Array.from(indices), cmp))\n}\n\n/** exsorted's algorithms are usable (§8.5): checked once per feature instance. */\nexport const hasExsorted = () =>\n  typeof timSort === 'function' &&\n  typeof radixSort === 'function' &&\n  typeof countingSort === 'function'\n"],"mappings":";AAAA,SAAS,oBAAoB;AAC7B,SAAS,iBAAiB;AAC1B,SAAS,eAAe;AAQjB,IAAM,eAAe,CAAC,MAAc,MAAM,WAAW,MAAM;AAMlE,IAAM,qBAAqB;AAwBpB,SAAS,QACd,QACA,SACA,MACqB;AACrB,QAAM,IAAI,QAAQ;AAClB,QAAM,UAAU,kBAAkB;AAClC,QAAM,OAAO,IAAI,YAAY,CAAC;AAC9B,QAAM,OAAO,IAAI,aAAa,CAAC;AAC/B,QAAM,OAAO,OAAO,KAAK;AACzB,MAAI,UAAU;AACd,MAAI,OAAO;AACX,MAAI,OAAO;AACX,MAAI,MAAM,OAAO;AACjB,MAAI,MAAM,OAAO;AACjB,MAAI,WAAW;AACf,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,IAAI,QAAQ,CAAC;AACnB,QAAI;AACJ,QAAI,SAAS;AACX,UAAI,OAAO,CAAC;AAAA,IACd,OAAO;AACL,YAAM,IAAK,OAA8B,CAAC;AAC1C,UAAI,OAAO,MAAM,UAAU;AACzB,YAAI,SAAS,EAAG,QAAO;AACvB,eAAO;AACP,YAAI;AAAA,MACN,WAAW,aAAa,MAAM;AAC5B,YAAI,SAAS,EAAG,QAAO;AACvB,eAAO;AACP,YAAI,EAAE,QAAQ;AAAA,MAChB,WAAW,MAAM,QAAQ,MAAM,QAAW;AACxC,aAAK,EAAE,IAAI,IAAI;AACf;AAAA,MACF,MAAO,QAAO;AAAA,IAChB;AACA,QAAI,OAAO,MAAM,CAAC,GAAG;AACnB,WAAK,EAAE,IAAI,IAAI;AACf;AAAA,IACF;AACA,QAAI,CAAC,OAAO,cAAc,CAAC,EAAG,QAAO;AACrC,SAAK;AACL,QAAI,IAAI,IAAK,OAAM;AACnB,QAAI,IAAI,IAAK,OAAM;AACnB,QAAI,UAAU,KAAK,IAAI,KAAM;AAC7B,WAAO;AACP,SAAK,OAAO,IAAI;AAChB,SAAK,SAAS,IAAI;AAAA,EACpB;AACA,SAAO,EAAE,MAAM,SAAS,MAAM,KAAK,KAAK,SAAS;AACnD;AAMO,SAAS,WAAW,GAA6D;AACtF,QAAM,IAAI,EAAE;AACZ,QAAM,QAAQ,IAAI,IAAI,EAAE,MAAM,EAAE,MAAM,IAAI;AAE1C,MAAI,EAAE,WAAW,MAAM,GAAG;AACxB,WAAO,EAAE,WAAW,OAAO,QAAQ,UAAU,EAAE,QAAQ,GAAG;AAAA,EAC5D;AACA,MAAI,SAAS,IAAI,KAAK,SAAS,oBAAoB;AACjD,WAAO,EAAE,WAAW,YAAY,QAAQ,SAAS,KAAK,GAAG;AAAA,EAC3D;AACA,MAAI,KAAK,IAAQ,QAAO,EAAE,WAAW,SAAS,QAAQ,OAAO;AAC7D,SAAO,EAAE,WAAW,OAAO,QAAQ,aAAa;AAClD;AAQO,SAAS,YAAY,GAAY,WAA0C;AAChF,QAAM,EAAE,MAAM,SAAS,KAAK,IAAI;AAChC,QAAM,IAAI,KAAK;AACf,QAAM,MAAM,IAAI,MAAc,OAAO;AACrC,WAAS,IAAI,GAAG,IAAI,SAAS,IAAK,KAAI,CAAC,IAAI;AAC3C,QAAM,MAAM,CAAC,MAAc,KAAK,CAAC;AACjC,QAAM,MAAM,CAAC,GAAW,MAAe,KAAK,CAAC,IAAgB,KAAK,CAAC;AACnE,QAAM,QACJ,cAAc,UACV,UAAU,KAAK,GAAG,IAClB,cAAc,aACZ,aAAa,KAAK,GAAG,IACrB,cAAc,QACZ,QAAQ,KAAK,GAAG,IAChB,IAAI,KAAK,GAAG;AACtB,QAAM,MAAM,IAAI,YAAY,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,SAAS,IAAK,KAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAW;AAClE,WAAS,IAAI,SAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAK,KAAI,CAAC,IAAI,KAAK,CAAC;AACjE,SAAO;AACT;AAGO,SAAS,mBACd,SACA,KACA,WACa;AACb,MAAI,cAAc,SAAU,QAAO,QAAQ,MAAM,EAAE,KAAK,GAAG;AAC3D,SAAO,YAAY,KAAK,QAAQ,MAAM,KAAK,OAAO,GAAG,GAAG,CAAC;AAC3D;AAGO,IAAM,cAAc,MACzB,OAAO,YAAY,cACnB,OAAO,cAAc,cACrB,OAAO,iBAAiB;","names":[]}

package/dist/features/validity/codes.cjs

@@ -25,6 +25,7 @@ __export(codes_exports, {
 });
 module.exports = __toCommonJS(codes_exports);
 var import_catalog = require("../../diagnostics/catalog.cjs");
+var import_process_guard = require("../../diagnostics/process-guard.cjs");
 var ACCEPTED = "'all' | 'valid' | 'invalid'";
 var validityMessages = {
   DK_INVALID_VALIDITY: {

package/dist/features/validity/codes.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/features/validity/codes.ts"],"sourcesContent":["import { type DiagnosticMessages, defineDiagnostic } from '../../diagnostics/catalog'\n\ndeclare module '../../diagnostics/catalog' {\n  interface DiagnosticCatalog {\n    DK_INVALID_VALIDITY: {\n      /** The API method that received the value, or `'state'` for a slice written to the store. */\n      source: 'setValidity' | 'state'\n      /** A short constant (`\"broken\"`) or the value's type only. */\n      received: string\n      /** What was done instead. */\n      fallback: string\n    }\n  }\n}\n\nconst ACCEPTED = \"'all' | 'valid' | 'invalid'\"\n\n/** Message text (§8.2): development builds, or production via `@datakable/core/messages`. */\nexport const validityMessages: DiagnosticMessages<'DK_INVALID_VALIDITY'> = {\n  DK_INVALID_VALIDITY: {\n    problem: (d) =>\n      d.source === 'state'\n        ? `the validity state is ${d.received}; it must be ${ACCEPTED}`\n        : `setValidity() received ${d.received}; it must be ${ACCEPTED}`,\n    impact: (d) => d.fallback,\n    fix: (d) => [\n      d.source === 'state'\n        ? `write validity as ${ACCEPTED} (check initialState, setState and the controlled ` +\n          'options.state)'\n        : `pass ${ACCEPTED} to setValidity()`,\n    ],\n  },\n}\n\n/** Codes owned by the `validity` feature (§6.2). */\nexport const validityDiagnostics = [\n  defineDiagnostic(\n    {\n      code: 'DK_INVALID_VALIDITY',\n      level: 'warn',\n      where: (d) =>\n        d.source === 'state'\n          ? { kind: 'option', path: 'state.validity' }\n          : { kind: 'operation', op: 'table.setValidity' },\n    },\n    (process.env.NODE_ENV !== \"production\") && validityMessages.DK_INVALID_VALIDITY,\n  ),\n]\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,qBAA0D;AAe1D,IAAM,WAAW;AAGV,IAAM,mBAA8D;AAAA,EACzE,qBAAqB;AAAA,IACnB,SAAS,CAAC,MACR,EAAE,WAAW,UACT,yBAAyB,EAAE,QAAQ,gBAAgB,QAAQ,KAC3D,0BAA0B,EAAE,QAAQ,gBAAgB,QAAQ;AAAA,IAClE,QAAQ,CAAC,MAAM,EAAE;AAAA,IACjB,KAAK,CAAC,MAAM;AAAA,MACV,EAAE,WAAW,UACT,qBAAqB,QAAQ,qEAE7B,QAAQ,QAAQ;AAAA,IACtB;AAAA,EACF;AACF;AAGO,IAAM,sBAAsB;AAAA,MACjC;AAAA,IACE;AAAA,MACE,MAAM;AAAA,MACN,OAAO;AAAA,MACP,OAAO,CAAC,MACN,EAAE,WAAW,UACT,EAAE,MAAM,UAAU,MAAM,iBAAiB,IACzC,EAAE,MAAM,aAAa,IAAI,oBAAoB;AAAA,IACrD;AAAA,IACC,QAAQ,IAAI,aAAa,gBAAiB,iBAAiB;AAAA,EAC9D;AACF;","names":[]}
+{"version":3,"sources":["../../../src/features/validity/codes.ts"],"sourcesContent":["import { type DiagnosticMessages, defineDiagnostic } from '../../diagnostics/catalog'\nimport '../../diagnostics/process-guard'\n\ndeclare module '../../diagnostics/catalog' {\n  interface DiagnosticCatalog {\n    DK_INVALID_VALIDITY: {\n      /** The API method that received the value, or `'state'` for a slice written to the store. */\n      source: 'setValidity' | 'state'\n      /** A short constant (`\"broken\"`) or the value's type only. */\n      received: string\n      /** What was done instead. */\n      fallback: string\n    }\n  }\n}\n\nconst ACCEPTED = \"'all' | 'valid' | 'invalid'\"\n\n/** Message text (§8.2): development builds, or production via `@datakable/core/messages`. */\nexport const validityMessages: DiagnosticMessages<'DK_INVALID_VALIDITY'> = {\n  DK_INVALID_VALIDITY: {\n    problem: (d) =>\n      d.source === 'state'\n        ? `the validity state is ${d.received}; it must be ${ACCEPTED}`\n        : `setValidity() received ${d.received}; it must be ${ACCEPTED}`,\n    impact: (d) => d.fallback,\n    fix: (d) => [\n      d.source === 'state'\n        ? `write validity as ${ACCEPTED} (check initialState, setState and the controlled ` +\n          'options.state)'\n        : `pass ${ACCEPTED} to setValidity()`,\n    ],\n  },\n}\n\n/** Codes owned by the `validity` feature (§6.2). */\nexport const validityDiagnostics = [\n  defineDiagnostic(\n    {\n      code: 'DK_INVALID_VALIDITY',\n      level: 'warn',\n      where: (d) =>\n        d.source === 'state'\n          ? { kind: 'option', path: 'state.validity' }\n          : { kind: 'operation', op: 'table.setValidity' },\n    },\n    (process.env.NODE_ENV !== \"production\") && validityMessages.DK_INVALID_VALIDITY,\n  ),\n]\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,qBAA0D;AAC1D,2BAAO;AAeP,IAAM,WAAW;AAGV,IAAM,mBAA8D;AAAA,EACzE,qBAAqB;AAAA,IACnB,SAAS,CAAC,MACR,EAAE,WAAW,UACT,yBAAyB,EAAE,QAAQ,gBAAgB,QAAQ,KAC3D,0BAA0B,EAAE,QAAQ,gBAAgB,QAAQ;AAAA,IAClE,QAAQ,CAAC,MAAM,EAAE;AAAA,IACjB,KAAK,CAAC,MAAM;AAAA,MACV,EAAE,WAAW,UACT,qBAAqB,QAAQ,qEAE7B,QAAQ,QAAQ;AAAA,IACtB;AAAA,EACF;AACF;AAGO,IAAM,sBAAsB;AAAA,MACjC;AAAA,IACE;AAAA,MACE,MAAM;AAAA,MACN,OAAO;AAAA,MACP,OAAO,CAAC,MACN,EAAE,WAAW,UACT,EAAE,MAAM,UAAU,MAAM,iBAAiB,IACzC,EAAE,MAAM,aAAa,IAAI,oBAAoB;AAAA,IACrD;AAAA,IACC,QAAQ,IAAI,aAAa,gBAAiB,iBAAiB;AAAA,EAC9D;AACF;","names":[]}