@datakable/core 1.0.0 → 1.0.1

package/dist/index.d.ts

@@ -1,15 +1,15 @@
-import { D as Diagnostic, c as DiagnosticCode, d as DiagnosticDetails, a as EmitOptions, T as Trigger, P as Phase, j as DiagnosticStateSummary, f as RedactLevel, k as RedactionOptions, l as DiagnosticDefinition, I as InvalidRowsMode, e as TableSchema, S as StandardSchemaV1, E as Emit } from './codes-BKdS9EiO.js';
-export { B as BadResponse, m as BuildInput, n as DK_UNSAFE_REDACTION, o as DatakableConfigError, p as DatakableError, q as DatakableSchemaError, r as DiagnosticCatalog, s as DiagnosticContext, t as DiagnosticLevel, u as DiagnosticMessages, v as DiagnosticMeta, w as DiagnosticText, x as FlaggedInvalidRow, F as FlaggedRow, h as InvalidRow, L as Location, y as REDACTED, z as RedactField, g as RedactFn, A as Redactor, b as Row, R as RowIssue, i as RowKey, C as SCHEMA_INGEST, G as SENSITIVE, H as SchemaIssueColumn, J as SchemaOutcome, K as SlotDefinition, M as SlotReturns, V as ValidRow, N as asyncDiagnostics, O as boundaryDiagnostics, Q as buildDiagnostic, U as columnFiltersDiagnostics, W as comparatorDiagnostics, X as coreDiagnostics, Y as dataCheckDiagnostics, Z as dataMutationDiagnostics, _ as defineDiagnostic, $ as defineSlot, a0 as describeReturn, a1 as describeValue, a2 as envDiagnostics, a3 as featureDiagnostics, a4 as fetchDiagnostics, a5 as formatSlot, a6 as formatWhere, a7 as getDiagnosticDefinition, a8 as getDiagnosticText, a9 as getSlot, aa as hasMessages, ab as hashRowKey, ac as installMessages, ad as isStandardSchema, ae as keepDiagnostics, af as listDiagnosticCodes, ag as matchesSlot, ah as optionDiagnostics, ai as paginationDiagnostics, aj as pipelineDiagnostics, ak as resolveRedaction, al as rowKeyDiagnostics, am as schemaDiagnostics, an as scrubError, ao as scrubSchemaIssue, ap as searchDiagnostics, aq as slotDiagnostics, ar as sortingDiagnostics, as as ssrDiagnostics, at as stepDiagnostics, au as tableDiagnostics, av as throwConfigError, aw as validityDiagnostics, ax as versioningDiagnostics } from './codes-BKdS9EiO.js';
-import { S as Stage, A as AnyFeature, I as InterceptorRuntime, a as Interceptor, F as Feature, b as FixedTypes, c as FeatureContext, R as RowModelContext, d as AnyRow, e as FeatureTypes, O as OpName, f as InterceptorContext, g as OpResult, T as TableState, h as TableOptions, i as ServerFetcher, j as TableStateFor, k as Table, l as ApiOf } from './explain-DcUZfFh5.js';
-export { m as AccessorColumn, n as Apply, B as BuiltinOperations, C as CELL_FALLBACK, o as CellContext, p as CellFailures, q as CellSlot, r as ColumnDef, s as ColumnValues, t as ContextBase, u as ContextPool, v as ControlledState, w as Core, E as ExplainStep, x as FetchOutcome, y as FetchParams, z as FetchResult, D as Fetcher, G as FilterFor, H as HotOpWarning, J as InterceptorRuntimeOptions, K as InvalidCellContext, L as IsAny, M as KeyColumn, N as Listener, P as LooseRow, Q as OpInput, U as OpKind, V as OpOutput, W as OpSpec, X as OperationInfo, Y as Operations, Z as OptionRule, _ as OptionType, $ as OptionsDefinition, a0 as OptionsSchema, a1 as Path, a2 as PathValue, a3 as Primitive, a4 as RenderReq, a5 as RowExplanation, a6 as RowModel, a7 as RowModelStatus, a8 as RowOf, a9 as RowStep, aa as RowStepOutcome, ab as SERVER_SOURCE, ac as SliceUpdater, ad as SortAlgorithm, ae as StateOf, af as TableDiagnosticsOptions, ag as TableExplanation, ah as UPDATE_DEPTH_LIMIT, ai as Updater, aj as createContext, ak as createContextPool, al as createInterceptorRuntime, am as defineInterceptor, an as defineOptions, ao as emitTableDiagnostic, ap as getOperation, aq as isOptionsDefinition, ar as listOperations, as as registerOperation, at as runCells } from './explain-DcUZfFh5.js';
+import { D as Diagnostic, c as DiagnosticCode, d as DiagnosticDetails, a as EmitOptions, T as Trigger, P as Phase, j as DiagnosticStateSummary, f as RedactLevel, k as RedactionOptions, l as DiagnosticDefinition, I as InvalidRowsMode, e as TableSchema, S as StandardSchemaV1, E as Emit } from './codes-OsjAR3Wz.js';
+export { B as BadResponse, m as BuildInput, n as DK_UNSAFE_REDACTION, o as DatakableConfigError, p as DatakableError, q as DatakableSchemaError, r as DiagnosticCatalog, s as DiagnosticContext, t as DiagnosticLevel, u as DiagnosticMessages, v as DiagnosticMeta, w as DiagnosticText, x as FlaggedInvalidRow, F as FlaggedRow, h as InvalidRow, L as Location, y as REDACTED, z as RedactField, g as RedactFn, A as Redactor, b as Row, R as RowIssue, i as RowKey, C as SCHEMA_INGEST, G as SENSITIVE, H as SchemaIssueColumn, J as SchemaOutcome, K as SlotDefinition, M as SlotReturns, V as ValidRow, N as asyncDiagnostics, O as boundaryDiagnostics, Q as buildDiagnostic, U as columnFiltersDiagnostics, W as comparatorDiagnostics, X as coreDiagnostics, Y as dataCheckDiagnostics, Z as dataMutationDiagnostics, _ as defineDiagnostic, $ as defineSlot, a0 as describeReturn, a1 as describeValue, a2 as envDiagnostics, a3 as featureDiagnostics, a4 as fetchDiagnostics, a5 as formatSlot, a6 as formatWhere, a7 as getDiagnosticDefinition, a8 as getDiagnosticText, a9 as getSlot, aa as hasMessages, ab as hashRowKey, ac as installMessages, ad as isStandardSchema, ae as keepDiagnostics, af as listDiagnosticCodes, ag as matchesSlot, ah as optionDiagnostics, ai as paginationDiagnostics, aj as pipelineDiagnostics, ak as resolveRedaction, al as rowKeyDiagnostics, am as schemaDiagnostics, an as scrubError, ao as scrubSchemaIssue, ap as searchDiagnostics, aq as slotDiagnostics, ar as sortingDiagnostics, as as ssrDiagnostics, at as stepDiagnostics, au as tableDiagnostics, av as throwConfigError, aw as validityDiagnostics, ax as versioningDiagnostics } from './codes-OsjAR3Wz.js';
+import { S as Stage, A as AnyFeature, I as InterceptorRuntime, a as Interceptor, F as Feature, b as FixedTypes, c as FeatureContext, R as RowModelContext, d as AnyRow, e as FeatureTypes, O as OpName, f as InterceptorContext, g as OpResult, T as TableState, h as TableOptions, i as ServerFetcher, j as TableStateFor, k as Table, l as ApiOf } from './explain-Dn99IQt0.js';
+export { m as AccessorColumn, n as Apply, B as BuiltinOperations, C as CELL_FALLBACK, o as CellContext, p as CellFailures, q as CellSlot, r as ColumnDef, s as ColumnValues, t as ContextBase, u as ContextPool, v as ControlledState, w as Core, E as ExplainStep, x as FetchOutcome, y as FetchParams, z as FetchResult, D as Fetcher, G as FilterFor, H as HotOpWarning, J as InterceptorRuntimeOptions, K as InvalidCellContext, L as IsAny, M as KeyColumn, N as Listener, P as LooseRow, Q as OpInput, U as OpKind, V as OpOutput, W as OpSpec, X as OperationInfo, Y as Operations, Z as OptionRule, _ as OptionType, $ as OptionsDefinition, a0 as OptionsSchema, a1 as Path, a2 as PathValue, a3 as Primitive, a4 as RenderReq, a5 as RowExplanation, a6 as RowModel, a7 as RowModelStatus, a8 as RowOf, a9 as RowStep, aa as RowStepOutcome, ab as SERVER_SOURCE, ac as SliceUpdater, ad as SortAlgorithm, ae as StateOf, af as TableDiagnosticsOptions, ag as TableExplanation, ah as UPDATE_DEPTH_LIMIT, ai as Updater, aj as createContext, ak as createContextPool, al as createInterceptorRuntime, am as defineInterceptor, an as defineOptions, ao as emitTableDiagnostic, ap as getOperation, aq as isOptionsDefinition, ar as listOperations, as as registerOperation, at as runCells } from './explain-Dn99IQt0.js';
 import { ColumnFiltersTypes } from './column-filters.js';
 export { ColumnFilter, ColumnFiltersApi, ColumnFiltersOptions, ColumnFiltersState, ContainsFilter, CustomFilter, EqualsFilter, InFilter, RangeFilter, RangeValue, columnFilters } from './column-filters.js';
 import { PaginationState, PaginationApi } from './pagination.js';
 export { PaginationOptions, pagination } from './pagination.js';
 import { SearchApi } from './search.js';
 export { SearchOptions, SearchTyping, SearchWait, search } from './search.js';
-import { S as SearchState } from './search-async-entry-BmQYT120.js';
-export { A as AsyncSearchFn, a as SEARCH_ENGINE, b as SearchFn, c as SearchFnContext, d as SearchOutcome, e as SearchResult, f as SearchStatus, w as withSearchFn } from './search-async-entry-BmQYT120.js';
+import { S as SearchState } from './search-async-entry-DGSw2pDL.js';
+export { A as AsyncSearchFn, a as SEARCH_ENGINE, b as SearchFn, c as SearchFnContext, d as SearchOutcome, e as SearchResult, f as SearchStatus, w as withSearchFn } from './search-async-entry-DGSw2pDL.js';
 import { SortingTypes } from './sorting.js';
 export { SortAlgorithmOption, SortDirection, SortEntry, SortingApi, SortingOptions, SortingState, compareValues, sorting, typeRank } from './sorting.js';
 import { ValidityState, ValidityApi } from './validity.js';
@@ -110,6 +110,7 @@ interface DiagnosticsOptions {
         max: number;
         windowMs: number;
     };
+    /** Clock (epoch ms) for `occurrences` and the rate limit. Default `wallClock` (never `Date`, #7). */
     now?: () => number;
 }
 interface Diagnostics {
@@ -157,7 +158,8 @@ interface FixedFeatureDefinition<Name extends string, S, A> extends Omit<Feature
     rowModel?: (indices: Uint32Array, state: S, ctx: RowModelContext<AnyRow>) => Uint32Array;
 }
 /**
- * Defines a feature (§3.3). Identity at runtime; it exists for typing.
+ * Defines a feature (§3.3). Returns `definition` as is (it exists for typing) and installs the
+ * feature runtime.
  *
  * Row-typed feature (all built-ins): declare the types interface and pass both type arguments.
  *

package/dist/intercept/cell-batch.cjs

@@ -25,7 +25,10 @@ __export(cell_batch_exports, {
   runCells: () => runCells
 });
 module.exports = __toCommonJS(cell_batch_exports);
+var import_catalog = require("../diagnostics/catalog.cjs");
 var import_classify = require("./classify.cjs");
+var import_codes = require("./codes.cjs");
+(0, import_catalog.keepDiagnostics)(import_codes.boundaryDiagnostics);
 var CELL_FALLBACK = {
   accessor: void 0,
   format: "",

package/dist/intercept/cell-batch.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/intercept/cell-batch.ts"],"sourcesContent":["import type { Emit, EmitOptions } from '../diagnostics/types'\nimport { errorName } from './classify'\n\n/** The cell slots of `column:batch`. */\nexport type CellSlot = 'accessor' | 'format' | 'filterFn' | 'sortBy'\n\n/**\n * Per failed cell (§3.4): `''` (format) / `undefined` (accessor) / non-matching (filter fn) /\n * `undefined`, sorted last as a missing value (sortBy).\n */\nexport const CELL_FALLBACK = {\n  accessor: undefined,\n  format: '',\n  filterFn: false,\n  sortBy: undefined,\n} as const\n\nconst CELL_FALLBACK_TEXT: Record<CellSlot, string> = {\n  accessor: 'the failed cells read as undefined',\n  format: \"the failed cells render ''\",\n  filterFn: 'the failed rows are treated as non-matching',\n  sortBy: 'the failed rows sort as missing values (last)',\n}\n\n/**\n * Failures of one column's cells in one pipeline run, recorded as numbers (§3.4): a count, the\n * first `sample` row indices and the first error. No per-cell allocation; `where` and text are\n * built only in {@link CellFailures.report}. Reuse one instance per column across runs.\n */\nexport class CellFailures {\n  count = 0\n  private first: unknown\n  private readonly rows: Uint32Array\n\n  constructor(sample = 5) {\n    this.rows = new Uint32Array(sample)\n  }\n\n  add(row: number, error: unknown): void {\n    if (this.count === 0) this.first = error\n    if (this.count < this.rows.length) this.rows[this.count] = row\n    this.count++\n  }\n\n  /** The recorded sample of failing row indices (a view; valid until the next reset). */\n  sample(): Uint32Array {\n    return this.rows.subarray(0, Math.min(this.count, this.rows.length))\n  }\n\n  reset(): void {\n    this.count = 0\n    this.first = undefined\n  }\n\n  /**\n   * Emits one `DK_CALLBACK_FAILED` for this column (if any cell failed), then resets. `where` is the\n   * slot path `columns[<index>].<slot>`; `field` replaces the slot name in that path when the\n   * failing column field differs (`key` for a key column whose getter threw).\n   */\n  report(\n    emit: Emit,\n    columnIndex: number,\n    columnId: string,\n    slot: CellSlot,\n    options?: EmitOptions,\n    field: string = slot,\n  ): void {\n    if (this.count === 0) return\n    const name = errorName(this.first)\n    emit(\n      'DK_CALLBACK_FAILED',\n      {\n        slot: `columns[${columnIndex}].${field}`,\n        column: columnId,\n        rows: Array.from(this.sample()),\n        count: this.count,\n        fallback: CELL_FALLBACK_TEXT[slot],\n        ...(name === undefined ? {} : { errorName: name }),\n      },\n      { ...options, cause: this.first },\n    )\n    this.reset()\n  }\n}\n\n/**\n * The body of a `column:batch`: runs `cell` for each row in `rows` and writes `out[row]`. A throwing\n * cell gets `fallback` and is recorded in `failures` — the loop never throws per cell and never\n * dispatches an interceptor per cell. Call `failures.report(...)` once after the loop.\n */\nexport function runCells<R>(\n  rows: Uint32Array,\n  cell: (row: number) => R,\n  out: { [row: number]: R },\n  fallback: R,\n  failures: CellFailures,\n): void {\n  for (let i = 0; i < rows.length; i++) {\n    const row = rows[i] as number\n    try {\n      out[row] = cell(row)\n    } catch (e) {\n      out[row] = fallback\n      failures.add(row, e)\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AACA,sBAA0B;AASnB,IAAM,gBAAgB;AAAA,EAC3B,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,QAAQ;AACV;AAEA,IAAM,qBAA+C;AAAA,EACnD,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,QAAQ;AACV;AAOO,IAAM,eAAN,MAAmB;AAAA,EAKxB,YAAY,SAAS,GAAG;AAJxB,iBAAQ;AAKN,SAAK,OAAO,IAAI,YAAY,MAAM;AAAA,EACpC;AAAA,EAEA,IAAI,KAAa,OAAsB;AACrC,QAAI,KAAK,UAAU,EAAG,MAAK,QAAQ;AACnC,QAAI,KAAK,QAAQ,KAAK,KAAK,OAAQ,MAAK,KAAK,KAAK,KAAK,IAAI;AAC3D,SAAK;AAAA,EACP;AAAA;AAAA,EAGA,SAAsB;AACpB,WAAO,KAAK,KAAK,SAAS,GAAG,KAAK,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,CAAC;AAAA,EACrE;AAAA,EAEA,QAAc;AACZ,SAAK,QAAQ;AACb,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OACE,MACA,aACA,UACA,MACA,SACA,QAAgB,MACV;AACN,QAAI,KAAK,UAAU,EAAG;AACtB,UAAM,WAAO,2BAAU,KAAK,KAAK;AACjC;AAAA,MACE;AAAA,MACA;AAAA,QACE,MAAM,WAAW,WAAW,KAAK,KAAK;AAAA,QACtC,QAAQ;AAAA,QACR,MAAM,MAAM,KAAK,KAAK,OAAO,CAAC;AAAA,QAC9B,OAAO,KAAK;AAAA,QACZ,UAAU,mBAAmB,IAAI;AAAA,QACjC,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,MAClD;AAAA,MACA,EAAE,GAAG,SAAS,OAAO,KAAK,MAAM;AAAA,IAClC;AACA,SAAK,MAAM;AAAA,EACb;AACF;AAOO,SAAS,SACd,MACA,MACA,KACA,UACA,UACM;AACN,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,MAAM,KAAK,CAAC;AAClB,QAAI;AACF,UAAI,GAAG,IAAI,KAAK,GAAG;AAAA,IACrB,SAAS,GAAG;AACV,UAAI,GAAG,IAAI;AACX,eAAS,IAAI,KAAK,CAAC;AAAA,IACrB;AAAA,EACF;AACF;","names":[]}
+{"version":3,"sources":["../../src/intercept/cell-batch.ts"],"sourcesContent":["import { keepDiagnostics } from '../diagnostics/catalog'\nimport type { Emit, EmitOptions } from '../diagnostics/types'\nimport { errorName } from './classify'\nimport { boundaryDiagnostics } from './codes'\n\n// CellFailures emits DK_CALLBACK_FAILED: keep its definition wherever this module is bundled (a\n// feature entry alone brings the feature runtime, and with it the column cache, #5).\nkeepDiagnostics(boundaryDiagnostics)\n\n/** The cell slots of `column:batch`. */\nexport type CellSlot = 'accessor' | 'format' | 'filterFn' | 'sortBy'\n\n/**\n * Per failed cell (§3.4): `''` (format) / `undefined` (accessor) / non-matching (filter fn) /\n * `undefined`, sorted last as a missing value (sortBy).\n */\nexport const CELL_FALLBACK = {\n  accessor: undefined,\n  format: '',\n  filterFn: false,\n  sortBy: undefined,\n} as const\n\nconst CELL_FALLBACK_TEXT: Record<CellSlot, string> = {\n  accessor: 'the failed cells read as undefined',\n  format: \"the failed cells render ''\",\n  filterFn: 'the failed rows are treated as non-matching',\n  sortBy: 'the failed rows sort as missing values (last)',\n}\n\n/**\n * Failures of one column's cells in one pipeline run, recorded as numbers (§3.4): a count, the\n * first `sample` row indices and the first error. No per-cell allocation; `where` and text are\n * built only in {@link CellFailures.report}. Reuse one instance per column across runs.\n */\nexport class CellFailures {\n  count = 0\n  private first: unknown\n  private readonly rows: Uint32Array\n\n  constructor(sample = 5) {\n    this.rows = new Uint32Array(sample)\n  }\n\n  add(row: number, error: unknown): void {\n    if (this.count === 0) this.first = error\n    if (this.count < this.rows.length) this.rows[this.count] = row\n    this.count++\n  }\n\n  /** The recorded sample of failing row indices (a view; valid until the next reset). */\n  sample(): Uint32Array {\n    return this.rows.subarray(0, Math.min(this.count, this.rows.length))\n  }\n\n  reset(): void {\n    this.count = 0\n    this.first = undefined\n  }\n\n  /**\n   * Emits one `DK_CALLBACK_FAILED` for this column (if any cell failed), then resets. `where` is the\n   * slot path `columns[<index>].<slot>`; `field` replaces the slot name in that path when the\n   * failing column field differs (`key` for a key column whose getter threw).\n   */\n  report(\n    emit: Emit,\n    columnIndex: number,\n    columnId: string,\n    slot: CellSlot,\n    options?: EmitOptions,\n    field: string = slot,\n  ): void {\n    if (this.count === 0) return\n    const name = errorName(this.first)\n    emit(\n      'DK_CALLBACK_FAILED',\n      {\n        slot: `columns[${columnIndex}].${field}`,\n        column: columnId,\n        rows: Array.from(this.sample()),\n        count: this.count,\n        fallback: CELL_FALLBACK_TEXT[slot],\n        ...(name === undefined ? {} : { errorName: name }),\n      },\n      { ...options, cause: this.first },\n    )\n    this.reset()\n  }\n}\n\n/**\n * The body of a `column:batch`: runs `cell` for each row in `rows` and writes `out[row]`. A throwing\n * cell gets `fallback` and is recorded in `failures` — the loop never throws per cell and never\n * dispatches an interceptor per cell. Call `failures.report(...)` once after the loop.\n */\nexport function runCells<R>(\n  rows: Uint32Array,\n  cell: (row: number) => R,\n  out: { [row: number]: R },\n  fallback: R,\n  failures: CellFailures,\n): void {\n  for (let i = 0; i < rows.length; i++) {\n    const row = rows[i] as number\n    try {\n      out[row] = cell(row)\n    } catch (e) {\n      out[row] = fallback\n      failures.add(row, e)\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,qBAAgC;AAEhC,sBAA0B;AAC1B,mBAAoC;AAAA,IAIpC,gCAAgB,gCAAmB;AAS5B,IAAM,gBAAgB;AAAA,EAC3B,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,QAAQ;AACV;AAEA,IAAM,qBAA+C;AAAA,EACnD,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,QAAQ;AACV;AAOO,IAAM,eAAN,MAAmB;AAAA,EAKxB,YAAY,SAAS,GAAG;AAJxB,iBAAQ;AAKN,SAAK,OAAO,IAAI,YAAY,MAAM;AAAA,EACpC;AAAA,EAEA,IAAI,KAAa,OAAsB;AACrC,QAAI,KAAK,UAAU,EAAG,MAAK,QAAQ;AACnC,QAAI,KAAK,QAAQ,KAAK,KAAK,OAAQ,MAAK,KAAK,KAAK,KAAK,IAAI;AAC3D,SAAK;AAAA,EACP;AAAA;AAAA,EAGA,SAAsB;AACpB,WAAO,KAAK,KAAK,SAAS,GAAG,KAAK,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,CAAC;AAAA,EACrE;AAAA,EAEA,QAAc;AACZ,SAAK,QAAQ;AACb,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OACE,MACA,aACA,UACA,MACA,SACA,QAAgB,MACV;AACN,QAAI,KAAK,UAAU,EAAG;AACtB,UAAM,WAAO,2BAAU,KAAK,KAAK;AACjC;AAAA,MACE;AAAA,MACA;AAAA,QACE,MAAM,WAAW,WAAW,KAAK,KAAK;AAAA,QACtC,QAAQ;AAAA,QACR,MAAM,MAAM,KAAK,KAAK,OAAO,CAAC;AAAA,QAC9B,OAAO,KAAK;AAAA,QACZ,UAAU,mBAAmB,IAAI;AAAA,QACjC,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,MAClD;AAAA,MACA,EAAE,GAAG,SAAS,OAAO,KAAK,MAAM;AAAA,IAClC;AACA,SAAK,MAAM;AAAA,EACb;AACF;AAOO,SAAS,SACd,MACA,MACA,KACA,UACA,UACM;AACN,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,MAAM,KAAK,CAAC;AAClB,QAAI;AACF,UAAI,GAAG,IAAI,KAAK,GAAG;AAAA,IACrB,SAAS,GAAG;AACV,UAAI,GAAG,IAAI;AACX,eAAS,IAAI,KAAK,CAAC;AAAA,IACrB;AAAA,EACF;AACF;","names":[]}

package/dist/intercept/cell-batch.js

@@ -1,5 +1,8 @@
 // src/intercept/cell-batch.ts
+import { keepDiagnostics } from "../diagnostics/catalog.js";
 import { errorName } from "./classify.js";
+import { boundaryDiagnostics } from "./codes.js";
+keepDiagnostics(boundaryDiagnostics);
 var CELL_FALLBACK = {
   accessor: void 0,
   format: "",

package/dist/intercept/cell-batch.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/intercept/cell-batch.ts"],"sourcesContent":["import type { Emit, EmitOptions } from '../diagnostics/types'\nimport { errorName } from './classify'\n\n/** The cell slots of `column:batch`. */\nexport type CellSlot = 'accessor' | 'format' | 'filterFn' | 'sortBy'\n\n/**\n * Per failed cell (§3.4): `''` (format) / `undefined` (accessor) / non-matching (filter fn) /\n * `undefined`, sorted last as a missing value (sortBy).\n */\nexport const CELL_FALLBACK = {\n  accessor: undefined,\n  format: '',\n  filterFn: false,\n  sortBy: undefined,\n} as const\n\nconst CELL_FALLBACK_TEXT: Record<CellSlot, string> = {\n  accessor: 'the failed cells read as undefined',\n  format: \"the failed cells render ''\",\n  filterFn: 'the failed rows are treated as non-matching',\n  sortBy: 'the failed rows sort as missing values (last)',\n}\n\n/**\n * Failures of one column's cells in one pipeline run, recorded as numbers (§3.4): a count, the\n * first `sample` row indices and the first error. No per-cell allocation; `where` and text are\n * built only in {@link CellFailures.report}. Reuse one instance per column across runs.\n */\nexport class CellFailures {\n  count = 0\n  private first: unknown\n  private readonly rows: Uint32Array\n\n  constructor(sample = 5) {\n    this.rows = new Uint32Array(sample)\n  }\n\n  add(row: number, error: unknown): void {\n    if (this.count === 0) this.first = error\n    if (this.count < this.rows.length) this.rows[this.count] = row\n    this.count++\n  }\n\n  /** The recorded sample of failing row indices (a view; valid until the next reset). */\n  sample(): Uint32Array {\n    return this.rows.subarray(0, Math.min(this.count, this.rows.length))\n  }\n\n  reset(): void {\n    this.count = 0\n    this.first = undefined\n  }\n\n  /**\n   * Emits one `DK_CALLBACK_FAILED` for this column (if any cell failed), then resets. `where` is the\n   * slot path `columns[<index>].<slot>`; `field` replaces the slot name in that path when the\n   * failing column field differs (`key` for a key column whose getter threw).\n   */\n  report(\n    emit: Emit,\n    columnIndex: number,\n    columnId: string,\n    slot: CellSlot,\n    options?: EmitOptions,\n    field: string = slot,\n  ): void {\n    if (this.count === 0) return\n    const name = errorName(this.first)\n    emit(\n      'DK_CALLBACK_FAILED',\n      {\n        slot: `columns[${columnIndex}].${field}`,\n        column: columnId,\n        rows: Array.from(this.sample()),\n        count: this.count,\n        fallback: CELL_FALLBACK_TEXT[slot],\n        ...(name === undefined ? {} : { errorName: name }),\n      },\n      { ...options, cause: this.first },\n    )\n    this.reset()\n  }\n}\n\n/**\n * The body of a `column:batch`: runs `cell` for each row in `rows` and writes `out[row]`. A throwing\n * cell gets `fallback` and is recorded in `failures` — the loop never throws per cell and never\n * dispatches an interceptor per cell. Call `failures.report(...)` once after the loop.\n */\nexport function runCells<R>(\n  rows: Uint32Array,\n  cell: (row: number) => R,\n  out: { [row: number]: R },\n  fallback: R,\n  failures: CellFailures,\n): void {\n  for (let i = 0; i < rows.length; i++) {\n    const row = rows[i] as number\n    try {\n      out[row] = cell(row)\n    } catch (e) {\n      out[row] = fallback\n      failures.add(row, e)\n    }\n  }\n}\n"],"mappings":";AACA,SAAS,iBAAiB;AASnB,IAAM,gBAAgB;AAAA,EAC3B,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,QAAQ;AACV;AAEA,IAAM,qBAA+C;AAAA,EACnD,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,QAAQ;AACV;AAOO,IAAM,eAAN,MAAmB;AAAA,EAKxB,YAAY,SAAS,GAAG;AAJxB,iBAAQ;AAKN,SAAK,OAAO,IAAI,YAAY,MAAM;AAAA,EACpC;AAAA,EAEA,IAAI,KAAa,OAAsB;AACrC,QAAI,KAAK,UAAU,EAAG,MAAK,QAAQ;AACnC,QAAI,KAAK,QAAQ,KAAK,KAAK,OAAQ,MAAK,KAAK,KAAK,KAAK,IAAI;AAC3D,SAAK;AAAA,EACP;AAAA;AAAA,EAGA,SAAsB;AACpB,WAAO,KAAK,KAAK,SAAS,GAAG,KAAK,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,CAAC;AAAA,EACrE;AAAA,EAEA,QAAc;AACZ,SAAK,QAAQ;AACb,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OACE,MACA,aACA,UACA,MACA,SACA,QAAgB,MACV;AACN,QAAI,KAAK,UAAU,EAAG;AACtB,UAAM,OAAO,UAAU,KAAK,KAAK;AACjC;AAAA,MACE;AAAA,MACA;AAAA,QACE,MAAM,WAAW,WAAW,KAAK,KAAK;AAAA,QACtC,QAAQ;AAAA,QACR,MAAM,MAAM,KAAK,KAAK,OAAO,CAAC;AAAA,QAC9B,OAAO,KAAK;AAAA,QACZ,UAAU,mBAAmB,IAAI;AAAA,QACjC,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,MAClD;AAAA,MACA,EAAE,GAAG,SAAS,OAAO,KAAK,MAAM;AAAA,IAClC;AACA,SAAK,MAAM;AAAA,EACb;AACF;AAOO,SAAS,SACd,MACA,MACA,KACA,UACA,UACM;AACN,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,MAAM,KAAK,CAAC;AAClB,QAAI;AACF,UAAI,GAAG,IAAI,KAAK,GAAG;AAAA,IACrB,SAAS,GAAG;AACV,UAAI,GAAG,IAAI;AACX,eAAS,IAAI,KAAK,CAAC;AAAA,IACrB;AAAA,EACF;AACF;","names":[]}
+{"version":3,"sources":["../../src/intercept/cell-batch.ts"],"sourcesContent":["import { keepDiagnostics } from '../diagnostics/catalog'\nimport type { Emit, EmitOptions } from '../diagnostics/types'\nimport { errorName } from './classify'\nimport { boundaryDiagnostics } from './codes'\n\n// CellFailures emits DK_CALLBACK_FAILED: keep its definition wherever this module is bundled (a\n// feature entry alone brings the feature runtime, and with it the column cache, #5).\nkeepDiagnostics(boundaryDiagnostics)\n\n/** The cell slots of `column:batch`. */\nexport type CellSlot = 'accessor' | 'format' | 'filterFn' | 'sortBy'\n\n/**\n * Per failed cell (§3.4): `''` (format) / `undefined` (accessor) / non-matching (filter fn) /\n * `undefined`, sorted last as a missing value (sortBy).\n */\nexport const CELL_FALLBACK = {\n  accessor: undefined,\n  format: '',\n  filterFn: false,\n  sortBy: undefined,\n} as const\n\nconst CELL_FALLBACK_TEXT: Record<CellSlot, string> = {\n  accessor: 'the failed cells read as undefined',\n  format: \"the failed cells render ''\",\n  filterFn: 'the failed rows are treated as non-matching',\n  sortBy: 'the failed rows sort as missing values (last)',\n}\n\n/**\n * Failures of one column's cells in one pipeline run, recorded as numbers (§3.4): a count, the\n * first `sample` row indices and the first error. No per-cell allocation; `where` and text are\n * built only in {@link CellFailures.report}. Reuse one instance per column across runs.\n */\nexport class CellFailures {\n  count = 0\n  private first: unknown\n  private readonly rows: Uint32Array\n\n  constructor(sample = 5) {\n    this.rows = new Uint32Array(sample)\n  }\n\n  add(row: number, error: unknown): void {\n    if (this.count === 0) this.first = error\n    if (this.count < this.rows.length) this.rows[this.count] = row\n    this.count++\n  }\n\n  /** The recorded sample of failing row indices (a view; valid until the next reset). */\n  sample(): Uint32Array {\n    return this.rows.subarray(0, Math.min(this.count, this.rows.length))\n  }\n\n  reset(): void {\n    this.count = 0\n    this.first = undefined\n  }\n\n  /**\n   * Emits one `DK_CALLBACK_FAILED` for this column (if any cell failed), then resets. `where` is the\n   * slot path `columns[<index>].<slot>`; `field` replaces the slot name in that path when the\n   * failing column field differs (`key` for a key column whose getter threw).\n   */\n  report(\n    emit: Emit,\n    columnIndex: number,\n    columnId: string,\n    slot: CellSlot,\n    options?: EmitOptions,\n    field: string = slot,\n  ): void {\n    if (this.count === 0) return\n    const name = errorName(this.first)\n    emit(\n      'DK_CALLBACK_FAILED',\n      {\n        slot: `columns[${columnIndex}].${field}`,\n        column: columnId,\n        rows: Array.from(this.sample()),\n        count: this.count,\n        fallback: CELL_FALLBACK_TEXT[slot],\n        ...(name === undefined ? {} : { errorName: name }),\n      },\n      { ...options, cause: this.first },\n    )\n    this.reset()\n  }\n}\n\n/**\n * The body of a `column:batch`: runs `cell` for each row in `rows` and writes `out[row]`. A throwing\n * cell gets `fallback` and is recorded in `failures` — the loop never throws per cell and never\n * dispatches an interceptor per cell. Call `failures.report(...)` once after the loop.\n */\nexport function runCells<R>(\n  rows: Uint32Array,\n  cell: (row: number) => R,\n  out: { [row: number]: R },\n  fallback: R,\n  failures: CellFailures,\n): void {\n  for (let i = 0; i < rows.length; i++) {\n    const row = rows[i] as number\n    try {\n      out[row] = cell(row)\n    } catch (e) {\n      out[row] = fallback\n      failures.add(row, e)\n    }\n  }\n}\n"],"mappings":";AAAA,SAAS,uBAAuB;AAEhC,SAAS,iBAAiB;AAC1B,SAAS,2BAA2B;AAIpC,gBAAgB,mBAAmB;AAS5B,IAAM,gBAAgB;AAAA,EAC3B,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,QAAQ;AACV;AAEA,IAAM,qBAA+C;AAAA,EACnD,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,QAAQ;AACV;AAOO,IAAM,eAAN,MAAmB;AAAA,EAKxB,YAAY,SAAS,GAAG;AAJxB,iBAAQ;AAKN,SAAK,OAAO,IAAI,YAAY,MAAM;AAAA,EACpC;AAAA,EAEA,IAAI,KAAa,OAAsB;AACrC,QAAI,KAAK,UAAU,EAAG,MAAK,QAAQ;AACnC,QAAI,KAAK,QAAQ,KAAK,KAAK,OAAQ,MAAK,KAAK,KAAK,KAAK,IAAI;AAC3D,SAAK;AAAA,EACP;AAAA;AAAA,EAGA,SAAsB;AACpB,WAAO,KAAK,KAAK,SAAS,GAAG,KAAK,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,CAAC;AAAA,EACrE;AAAA,EAEA,QAAc;AACZ,SAAK,QAAQ;AACb,SAAK,QAAQ;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OACE,MACA,aACA,UACA,MACA,SACA,QAAgB,MACV;AACN,QAAI,KAAK,UAAU,EAAG;AACtB,UAAM,OAAO,UAAU,KAAK,KAAK;AACjC;AAAA,MACE;AAAA,MACA;AAAA,QACE,MAAM,WAAW,WAAW,KAAK,KAAK;AAAA,QACtC,QAAQ;AAAA,QACR,MAAM,MAAM,KAAK,KAAK,OAAO,CAAC;AAAA,QAC9B,OAAO,KAAK;AAAA,QACZ,UAAU,mBAAmB,IAAI;AAAA,QACjC,GAAI,SAAS,SAAY,CAAC,IAAI,EAAE,WAAW,KAAK;AAAA,MAClD;AAAA,MACA,EAAE,GAAG,SAAS,OAAO,KAAK,MAAM;AAAA,IAClC;AACA,SAAK,MAAM;AAAA,EACb;AACF;AAOO,SAAS,SACd,MACA,MACA,KACA,UACA,UACM;AACN,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAM,MAAM,KAAK,CAAC;AAClB,QAAI;AACF,UAAI,GAAG,IAAI,KAAK,GAAG;AAAA,IACrB,SAAS,GAAG;AACV,UAAI,GAAG,IAAI;AACX,eAAS,IAAI,KAAK,CAAC;AAAA,IACrB;AAAA,EACF;AACF;","names":[]}

package/dist/pagination.d.cts

@@ -1,5 +1,5 @@
-export { ai as paginationDiagnostics } from './codes-BKdS9EiO.cjs';
-import { F as Feature, b as FixedTypes } from './explain-aagaYHcy.cjs';
+export { ai as paginationDiagnostics } from './codes-OsjAR3Wz.cjs';
+import { F as Feature, b as FixedTypes } from './explain-vkD2cewE.cjs';
 import { a as DataMode } from './mode-DFV8ryXo.cjs';
 
 interface PaginationState {

package/dist/pagination.d.ts

@@ -1,5 +1,5 @@
-export { ai as paginationDiagnostics } from './codes-BKdS9EiO.js';
-import { F as Feature, b as FixedTypes } from './explain-DcUZfFh5.js';
+export { ai as paginationDiagnostics } from './codes-OsjAR3Wz.js';
+import { F as Feature, b as FixedTypes } from './explain-Dn99IQt0.js';
 import { a as DataMode } from './mode-DFV8ryXo.js';
 
 interface PaginationState {

package/dist/pipeline/row.cjs

@@ -27,29 +27,30 @@ __export(row_exports, {
 });
 module.exports = __toCommonJS(row_exports);
 var NO_ISSUES = Object.freeze([]);
+var SOURCE = /* @__PURE__ */ Symbol();
+SOURCE;
 var Row = class {
-  #source;
   /** @internal Rows are created by the pipeline. */
   constructor(source, index, key, original) {
     this.key = key;
     this.index = index;
     this.original = original;
-    this.#source = source;
+    this[SOURCE] = source;
   }
   /** `false` for a row flagged by schema validation (`invalidRows: 'flag'`). */
   get valid() {
-    return this.#source.issues(this.index) === void 0;
+    return this[SOURCE].issues(this.index) === void 0;
   }
   /** The row's schema issues (empty for a valid row). */
   get issues() {
-    return this.#source.issues(this.index) ?? NO_ISSUES;
+    return this[SOURCE].issues(this.index) ?? NO_ISSUES;
   }
   /**
    * The value of column `id` for this row (`key` path or `accessor`); `undefined` for an unknown
    * column. Never throws: a throwing accessor reports `DK_CALLBACK_FAILED` and reads `undefined`.
    */
   getValue(id) {
-    return this.#source.value(this.index, this.original, id);
+    return this[SOURCE].value(this.index, this.original, id);
   }
   /**
    * The schema issues whose path points into column `id`, matched segment by segment: the issue
@@ -58,8 +59,8 @@ var Row = class {
    * so they get only those. Empty for a valid row or an unknown column.
    */
   getCellIssues(id) {
-    const issues = this.#source.issues(this.index);
-    return issues === void 0 ? NO_ISSUES : this.#source.cellIssues(issues, id);
+    const issues = this[SOURCE].issues(this.index);
+    return issues === void 0 ? NO_ISSUES : this[SOURCE].cellIssues(issues, id);
   }
 };
 function sparse(length) {

package/dist/pipeline/row.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/pipeline/row.ts"],"sourcesContent":["/** A row identity: the `rowKey` value, or the fallback (§5.2). */\nexport type RowKey = string | number\n\n/** A validation issue of a row (Standard Schema v1 issue shape, §5.1). */\nexport interface RowIssue {\n  readonly message: string\n  readonly path?: readonly (PropertyKey | { readonly key: PropertyKey })[] | undefined\n}\n\n/** What a {@link Row} reads its cells through (internal; one per `columns` reference). */\nexport interface RowSource {\n  value(index: number, original: unknown, id: string): unknown\n  /** Schema issues of a flagged row (`invalidRows: 'flag'`); `undefined` for a valid row. */\n  issues(index: number): readonly RowIssue[] | undefined\n  /** The issues of a flagged row that touch column `id` (`matchCellIssues`). */\n  cellIssues(issues: readonly RowIssue[], id: string): readonly RowIssue[]\n}\n\nexport const NO_ISSUES: readonly RowIssue[] = Object.freeze([])\n\n/**\n * One visible row (§6.6). Created only for the rows `getRowModel()` returns, never for the whole\n * data set (§9.1), and only when read ({@link lazyRows}); the methods live on the prototype, so a\n * row costs its four fields.\n */\nexport class Row<T = unknown> {\n  /** The row's `rowKey` value (the row index without `rowKey`). */\n  readonly key: RowKey\n  /** Position in the ingested data. */\n  readonly index: number\n  /** The row object as passed in `data`. */\n  readonly original: T\n  readonly #source: RowSource\n\n  /** @internal Rows are created by the pipeline. */\n  constructor(source: RowSource, index: number, key: RowKey, original: T) {\n    this.key = key\n    this.index = index\n    this.original = original\n    this.#source = source\n  }\n\n  /** `false` for a row flagged by schema validation (`invalidRows: 'flag'`). */\n  get valid(): boolean {\n    return this.#source.issues(this.index) === undefined\n  }\n\n  /** The row's schema issues (empty for a valid row). */\n  get issues(): readonly RowIssue[] {\n    return this.#source.issues(this.index) ?? NO_ISSUES\n  }\n\n  /**\n   * The value of column `id` for this row (`key` path or `accessor`); `undefined` for an unknown\n   * column. Never throws: a throwing accessor reports `DK_CALLBACK_FAILED` and reads `undefined`.\n   */\n  getValue(id: string): unknown {\n    return this.#source.value(this.index, this.original, id)\n  }\n\n  /**\n   * The schema issues whose path points into column `id`, matched segment by segment: the issue\n   * path equals the column key, or one contains the other (`address` ↔ `address.city`, never\n   * `addressLine`). Row-level issues (no path) count for every cell; accessor columns have no key,\n   * so they get only those. Empty for a valid row or an unknown column.\n   */\n  getCellIssues(id: string): readonly RowIssue[] {\n    const issues = this.#source.issues(this.index)\n    return issues === undefined ? NO_ISSUES : this.#source.cellIssues(issues, id)\n  }\n}\n\n/** A valid row under `invalidRows: 'flag'`: `original` is the schema output. */\nexport type ValidRow<T> = Row<T> & { readonly valid: true }\n\n/** A flagged row (`invalidRows: 'flag'`): `original` is the raw, unvalidated value. */\nexport type FlaggedInvalidRow = Row<unknown> & { readonly valid: false }\n\n/** `getRowModel().rows` under `invalidRows: 'flag'` (§5.1): narrow on `row.valid`. */\nexport type FlaggedRow<T> = ValidRow<T> | FlaggedInvalidRow\n\n/**\n * An empty array of `length` without a backing store: setting `length` (or `new Array(n)`)\n * allocates `n` slots; a write at `n - 1` then deleting it leaves sparse (dictionary) elements. V8\n * turns it back into a plain array once it is filled.\n */\nfunction sparse<R>(length: number): R[] {\n  const a: R[] = []\n  if (length > 0) {\n    a[length - 1] = undefined as R\n    delete a[length - 1]\n  }\n  return a\n}\n\n/** `p` as an index below `length` (a canonical array index string), else `-1`. */\nexport function arrayIndex(p: string | symbol, length: number): number {\n  const i = typeof p === 'string' ? Number(p) : -1\n  return i >= 0 && i < length && String(i) === p ? i : -1\n}\n\n/**\n * `RowModel.rows` without a `Row` per visible row up front (§9.3 memory: 90k rows unpaginated): a\n * real array (`Array.isArray`, `length`, index reads, iteration, every array method) over a sparse\n * target that builds row `i` with `make(i)` the first time it is read and keeps it, so identity is\n * stable. `Object.keys` / `ownKeys` build every row first.\n */\nexport function lazyRows<R>(length: number, make: (i: number) => R): R[] {\n  const t = sparse<R>(length)\n  /** Builds row `i` (an index from {@link arrayIndex}; `-1` is not one) unless it exists. */\n  const build = (i: number) => {\n    if (i >= 0 && !(i in t)) t[i] = make(i)\n  }\n  return new Proxy(t, {\n    get(_, p, receiver) {\n      build(arrayIndex(p, length))\n      return Reflect.get(t, p, receiver)\n    },\n    has: (_, p) => arrayIndex(p, length) >= 0 || Reflect.has(t, p),\n    getOwnPropertyDescriptor(_, p) {\n      build(arrayIndex(p, length))\n      return Reflect.getOwnPropertyDescriptor(t, p)\n    },\n    ownKeys() {\n      for (let i = 0; i < length; i++) build(i)\n      return Reflect.ownKeys(t)\n    },\n  })\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAkBO,IAAM,YAAiC,OAAO,OAAO,CAAC,CAAC;AAOvD,IAAM,MAAN,MAAuB;AAAA,EAOnB;AAAA;AAAA,EAGT,YAAY,QAAmB,OAAe,KAAa,UAAa;AACtE,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,WAAW;AAChB,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA,EAGA,IAAI,QAAiB;AACnB,WAAO,KAAK,QAAQ,OAAO,KAAK,KAAK,MAAM;AAAA,EAC7C;AAAA;AAAA,EAGA,IAAI,SAA8B;AAChC,WAAO,KAAK,QAAQ,OAAO,KAAK,KAAK,KAAK;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,IAAqB;AAC5B,WAAO,KAAK,QAAQ,MAAM,KAAK,OAAO,KAAK,UAAU,EAAE;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAc,IAAiC;AAC7C,UAAM,SAAS,KAAK,QAAQ,OAAO,KAAK,KAAK;AAC7C,WAAO,WAAW,SAAY,YAAY,KAAK,QAAQ,WAAW,QAAQ,EAAE;AAAA,EAC9E;AACF;AAgBA,SAAS,OAAU,QAAqB;AACtC,QAAM,IAAS,CAAC;AAChB,MAAI,SAAS,GAAG;AACd,MAAE,SAAS,CAAC,IAAI;AAChB,WAAO,EAAE,SAAS,CAAC;AAAA,EACrB;AACA,SAAO;AACT;AAGO,SAAS,WAAW,GAAoB,QAAwB;AACrE,QAAM,IAAI,OAAO,MAAM,WAAW,OAAO,CAAC,IAAI;AAC9C,SAAO,KAAK,KAAK,IAAI,UAAU,OAAO,CAAC,MAAM,IAAI,IAAI;AACvD;AAQO,SAAS,SAAY,QAAgB,MAA6B;AACvE,QAAM,IAAI,OAAU,MAAM;AAE1B,QAAM,QAAQ,CAAC,MAAc;AAC3B,QAAI,KAAK,KAAK,EAAE,KAAK,GAAI,GAAE,CAAC,IAAI,KAAK,CAAC;AAAA,EACxC;AACA,SAAO,IAAI,MAAM,GAAG;AAAA,IAClB,IAAI,GAAG,GAAG,UAAU;AAClB,YAAM,WAAW,GAAG,MAAM,CAAC;AAC3B,aAAO,QAAQ,IAAI,GAAG,GAAG,QAAQ;AAAA,IACnC;AAAA,IACA,KAAK,CAAC,GAAG,MAAM,WAAW,GAAG,MAAM,KAAK,KAAK,QAAQ,IAAI,GAAG,CAAC;AAAA,IAC7D,yBAAyB,GAAG,GAAG;AAC7B,YAAM,WAAW,GAAG,MAAM,CAAC;AAC3B,aAAO,QAAQ,yBAAyB,GAAG,CAAC;AAAA,IAC9C;AAAA,IACA,UAAU;AACR,eAAS,IAAI,GAAG,IAAI,QAAQ,IAAK,OAAM,CAAC;AACxC,aAAO,QAAQ,QAAQ,CAAC;AAAA,IAC1B;AAAA,EACF,CAAC;AACH;","names":[]}
+{"version":3,"sources":["../../src/pipeline/row.ts"],"sourcesContent":["/** A row identity: the `rowKey` value, or the fallback (§5.2). */\nexport type RowKey = string | number\n\n/** A validation issue of a row (Standard Schema v1 issue shape, §5.1). */\nexport interface RowIssue {\n  readonly message: string\n  readonly path?: readonly (PropertyKey | { readonly key: PropertyKey })[] | undefined\n}\n\n/** What a {@link Row} reads its cells through (internal; one per `columns` reference). */\nexport interface RowSource {\n  value(index: number, original: unknown, id: string): unknown\n  /** Schema issues of a flagged row (`invalidRows: 'flag'`); `undefined` for a valid row. */\n  issues(index: number): readonly RowIssue[] | undefined\n  /** The issues of a flagged row that touch column `id` (`matchCellIssues`). */\n  cellIssues(issues: readonly RowIssue[], id: string): readonly RowIssue[]\n}\n\nexport const NO_ISSUES: readonly RowIssue[] = Object.freeze([])\n\n/**\n * The key a {@link Row} keeps its {@link RowSource} under. A symbol, not a `#private` field: a\n * proxy-based store (Vue `ref` / `reactive`, Pinia, MobX) calls the getters and methods with\n * `this` = its proxy, which has no private slot, so `#source` threw there (#11). A symbol key\n * reads through any proxy, stays out of `Object.keys` and JSON, and is not exported.\n */\nconst SOURCE = Symbol()\n\n/**\n * One visible row (§6.6). Created only for the rows `getRowModel()` returns, never for the whole\n * data set (§9.1), and only when read ({@link lazyRows}); the methods live on the prototype, so a\n * row costs its four fields.\n */\nexport class Row<T = unknown> {\n  /** The row's `rowKey` value (the row index without `rowKey`). */\n  readonly key: RowKey\n  /** Position in the ingested data. */\n  readonly index: number\n  /** The row object as passed in `data`. */\n  readonly original: T\n  /** @internal */\n  private readonly [SOURCE]: RowSource\n\n  /** @internal Rows are created by the pipeline. */\n  constructor(source: RowSource, index: number, key: RowKey, original: T) {\n    this.key = key\n    this.index = index\n    this.original = original\n    this[SOURCE] = source\n  }\n\n  /** `false` for a row flagged by schema validation (`invalidRows: 'flag'`). */\n  get valid(): boolean {\n    return this[SOURCE].issues(this.index) === undefined\n  }\n\n  /** The row's schema issues (empty for a valid row). */\n  get issues(): readonly RowIssue[] {\n    return this[SOURCE].issues(this.index) ?? NO_ISSUES\n  }\n\n  /**\n   * The value of column `id` for this row (`key` path or `accessor`); `undefined` for an unknown\n   * column. Never throws: a throwing accessor reports `DK_CALLBACK_FAILED` and reads `undefined`.\n   */\n  getValue(id: string): unknown {\n    return this[SOURCE].value(this.index, this.original, id)\n  }\n\n  /**\n   * The schema issues whose path points into column `id`, matched segment by segment: the issue\n   * path equals the column key, or one contains the other (`address` ↔ `address.city`, never\n   * `addressLine`). Row-level issues (no path) count for every cell; accessor columns have no key,\n   * so they get only those. Empty for a valid row or an unknown column.\n   */\n  getCellIssues(id: string): readonly RowIssue[] {\n    const issues = this[SOURCE].issues(this.index)\n    return issues === undefined ? NO_ISSUES : this[SOURCE].cellIssues(issues, id)\n  }\n}\n\n/** A valid row under `invalidRows: 'flag'`: `original` is the schema output. */\nexport type ValidRow<T> = Row<T> & { readonly valid: true }\n\n/** A flagged row (`invalidRows: 'flag'`): `original` is the raw, unvalidated value. */\nexport type FlaggedInvalidRow = Row<unknown> & { readonly valid: false }\n\n/** `getRowModel().rows` under `invalidRows: 'flag'` (§5.1): narrow on `row.valid`. */\nexport type FlaggedRow<T> = ValidRow<T> | FlaggedInvalidRow\n\n/**\n * An empty array of `length` without a backing store: setting `length` (or `new Array(n)`)\n * allocates `n` slots; a write at `n - 1` then deleting it leaves sparse (dictionary) elements. V8\n * turns it back into a plain array once it is filled.\n */\nfunction sparse<R>(length: number): R[] {\n  const a: R[] = []\n  if (length > 0) {\n    a[length - 1] = undefined as R\n    delete a[length - 1]\n  }\n  return a\n}\n\n/** `p` as an index below `length` (a canonical array index string), else `-1`. */\nexport function arrayIndex(p: string | symbol, length: number): number {\n  const i = typeof p === 'string' ? Number(p) : -1\n  return i >= 0 && i < length && String(i) === p ? i : -1\n}\n\n/**\n * `RowModel.rows` without a `Row` per visible row up front (§9.3 memory: 90k rows unpaginated): a\n * real array (`Array.isArray`, `length`, index reads, iteration, every array method) over a sparse\n * target that builds row `i` with `make(i)` the first time it is read and keeps it, so identity is\n * stable. `Object.keys` / `ownKeys` build every row first.\n */\nexport function lazyRows<R>(length: number, make: (i: number) => R): R[] {\n  const t = sparse<R>(length)\n  /** Builds row `i` (an index from {@link arrayIndex}; `-1` is not one) unless it exists. */\n  const build = (i: number) => {\n    if (i >= 0 && !(i in t)) t[i] = make(i)\n  }\n  return new Proxy(t, {\n    get(_, p, receiver) {\n      build(arrayIndex(p, length))\n      return Reflect.get(t, p, receiver)\n    },\n    has: (_, p) => arrayIndex(p, length) >= 0 || Reflect.has(t, p),\n    getOwnPropertyDescriptor(_, p) {\n      build(arrayIndex(p, length))\n      return Reflect.getOwnPropertyDescriptor(t, p)\n    },\n    ownKeys() {\n      for (let i = 0; i < length; i++) build(i)\n      return Reflect.ownKeys(t)\n    },\n  })\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAkBO,IAAM,YAAiC,OAAO,OAAO,CAAC,CAAC;AAQ9D,IAAM,SAAS,uBAAO;AAeF;AARb,IAAM,MAAN,MAAuB;AAAA;AAAA,EAW5B,YAAY,QAAmB,OAAe,KAAa,UAAa;AACtE,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,WAAW;AAChB,SAAK,MAAM,IAAI;AAAA,EACjB;AAAA;AAAA,EAGA,IAAI,QAAiB;AACnB,WAAO,KAAK,MAAM,EAAE,OAAO,KAAK,KAAK,MAAM;AAAA,EAC7C;AAAA;AAAA,EAGA,IAAI,SAA8B;AAChC,WAAO,KAAK,MAAM,EAAE,OAAO,KAAK,KAAK,KAAK;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,IAAqB;AAC5B,WAAO,KAAK,MAAM,EAAE,MAAM,KAAK,OAAO,KAAK,UAAU,EAAE;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAc,IAAiC;AAC7C,UAAM,SAAS,KAAK,MAAM,EAAE,OAAO,KAAK,KAAK;AAC7C,WAAO,WAAW,SAAY,YAAY,KAAK,MAAM,EAAE,WAAW,QAAQ,EAAE;AAAA,EAC9E;AACF;AAgBA,SAAS,OAAU,QAAqB;AACtC,QAAM,IAAS,CAAC;AAChB,MAAI,SAAS,GAAG;AACd,MAAE,SAAS,CAAC,IAAI;AAChB,WAAO,EAAE,SAAS,CAAC;AAAA,EACrB;AACA,SAAO;AACT;AAGO,SAAS,WAAW,GAAoB,QAAwB;AACrE,QAAM,IAAI,OAAO,MAAM,WAAW,OAAO,CAAC,IAAI;AAC9C,SAAO,KAAK,KAAK,IAAI,UAAU,OAAO,CAAC,MAAM,IAAI,IAAI;AACvD;AAQO,SAAS,SAAY,QAAgB,MAA6B;AACvE,QAAM,IAAI,OAAU,MAAM;AAE1B,QAAM,QAAQ,CAAC,MAAc;AAC3B,QAAI,KAAK,KAAK,EAAE,KAAK,GAAI,GAAE,CAAC,IAAI,KAAK,CAAC;AAAA,EACxC;AACA,SAAO,IAAI,MAAM,GAAG;AAAA,IAClB,IAAI,GAAG,GAAG,UAAU;AAClB,YAAM,WAAW,GAAG,MAAM,CAAC;AAC3B,aAAO,QAAQ,IAAI,GAAG,GAAG,QAAQ;AAAA,IACnC;AAAA,IACA,KAAK,CAAC,GAAG,MAAM,WAAW,GAAG,MAAM,KAAK,KAAK,QAAQ,IAAI,GAAG,CAAC;AAAA,IAC7D,yBAAyB,GAAG,GAAG;AAC7B,YAAM,WAAW,GAAG,MAAM,CAAC;AAC3B,aAAO,QAAQ,yBAAyB,GAAG,CAAC;AAAA,IAC9C;AAAA,IACA,UAAU;AACR,eAAS,IAAI,GAAG,IAAI,QAAQ,IAAK,OAAM,CAAC;AACxC,aAAO,QAAQ,QAAQ,CAAC;AAAA,IAC1B;AAAA,EACF,CAAC;AACH;","names":[]}

package/dist/pipeline/row.js

@@ -1,28 +1,29 @@
 // src/pipeline/row.ts
 var NO_ISSUES = Object.freeze([]);
+var SOURCE = /* @__PURE__ */ Symbol();
+SOURCE;
 var Row = class {
-  #source;
   /** @internal Rows are created by the pipeline. */
   constructor(source, index, key, original) {
     this.key = key;
     this.index = index;
     this.original = original;
-    this.#source = source;
+    this[SOURCE] = source;
   }
   /** `false` for a row flagged by schema validation (`invalidRows: 'flag'`). */
   get valid() {
-    return this.#source.issues(this.index) === void 0;
+    return this[SOURCE].issues(this.index) === void 0;
   }
   /** The row's schema issues (empty for a valid row). */
   get issues() {
-    return this.#source.issues(this.index) ?? NO_ISSUES;
+    return this[SOURCE].issues(this.index) ?? NO_ISSUES;
   }
   /**
    * The value of column `id` for this row (`key` path or `accessor`); `undefined` for an unknown
    * column. Never throws: a throwing accessor reports `DK_CALLBACK_FAILED` and reads `undefined`.
    */
   getValue(id) {
-    return this.#source.value(this.index, this.original, id);
+    return this[SOURCE].value(this.index, this.original, id);
   }
   /**
    * The schema issues whose path points into column `id`, matched segment by segment: the issue
@@ -31,8 +32,8 @@ var Row = class {
    * so they get only those. Empty for a valid row or an unknown column.
    */
   getCellIssues(id) {
-    const issues = this.#source.issues(this.index);
-    return issues === void 0 ? NO_ISSUES : this.#source.cellIssues(issues, id);
+    const issues = this[SOURCE].issues(this.index);
+    return issues === void 0 ? NO_ISSUES : this[SOURCE].cellIssues(issues, id);
   }
 };
 function sparse(length) {

package/dist/pipeline/row.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/pipeline/row.ts"],"sourcesContent":["/** A row identity: the `rowKey` value, or the fallback (§5.2). */\nexport type RowKey = string | number\n\n/** A validation issue of a row (Standard Schema v1 issue shape, §5.1). */\nexport interface RowIssue {\n  readonly message: string\n  readonly path?: readonly (PropertyKey | { readonly key: PropertyKey })[] | undefined\n}\n\n/** What a {@link Row} reads its cells through (internal; one per `columns` reference). */\nexport interface RowSource {\n  value(index: number, original: unknown, id: string): unknown\n  /** Schema issues of a flagged row (`invalidRows: 'flag'`); `undefined` for a valid row. */\n  issues(index: number): readonly RowIssue[] | undefined\n  /** The issues of a flagged row that touch column `id` (`matchCellIssues`). */\n  cellIssues(issues: readonly RowIssue[], id: string): readonly RowIssue[]\n}\n\nexport const NO_ISSUES: readonly RowIssue[] = Object.freeze([])\n\n/**\n * One visible row (§6.6). Created only for the rows `getRowModel()` returns, never for the whole\n * data set (§9.1), and only when read ({@link lazyRows}); the methods live on the prototype, so a\n * row costs its four fields.\n */\nexport class Row<T = unknown> {\n  /** The row's `rowKey` value (the row index without `rowKey`). */\n  readonly key: RowKey\n  /** Position in the ingested data. */\n  readonly index: number\n  /** The row object as passed in `data`. */\n  readonly original: T\n  readonly #source: RowSource\n\n  /** @internal Rows are created by the pipeline. */\n  constructor(source: RowSource, index: number, key: RowKey, original: T) {\n    this.key = key\n    this.index = index\n    this.original = original\n    this.#source = source\n  }\n\n  /** `false` for a row flagged by schema validation (`invalidRows: 'flag'`). */\n  get valid(): boolean {\n    return this.#source.issues(this.index) === undefined\n  }\n\n  /** The row's schema issues (empty for a valid row). */\n  get issues(): readonly RowIssue[] {\n    return this.#source.issues(this.index) ?? NO_ISSUES\n  }\n\n  /**\n   * The value of column `id` for this row (`key` path or `accessor`); `undefined` for an unknown\n   * column. Never throws: a throwing accessor reports `DK_CALLBACK_FAILED` and reads `undefined`.\n   */\n  getValue(id: string): unknown {\n    return this.#source.value(this.index, this.original, id)\n  }\n\n  /**\n   * The schema issues whose path points into column `id`, matched segment by segment: the issue\n   * path equals the column key, or one contains the other (`address` ↔ `address.city`, never\n   * `addressLine`). Row-level issues (no path) count for every cell; accessor columns have no key,\n   * so they get only those. Empty for a valid row or an unknown column.\n   */\n  getCellIssues(id: string): readonly RowIssue[] {\n    const issues = this.#source.issues(this.index)\n    return issues === undefined ? NO_ISSUES : this.#source.cellIssues(issues, id)\n  }\n}\n\n/** A valid row under `invalidRows: 'flag'`: `original` is the schema output. */\nexport type ValidRow<T> = Row<T> & { readonly valid: true }\n\n/** A flagged row (`invalidRows: 'flag'`): `original` is the raw, unvalidated value. */\nexport type FlaggedInvalidRow = Row<unknown> & { readonly valid: false }\n\n/** `getRowModel().rows` under `invalidRows: 'flag'` (§5.1): narrow on `row.valid`. */\nexport type FlaggedRow<T> = ValidRow<T> | FlaggedInvalidRow\n\n/**\n * An empty array of `length` without a backing store: setting `length` (or `new Array(n)`)\n * allocates `n` slots; a write at `n - 1` then deleting it leaves sparse (dictionary) elements. V8\n * turns it back into a plain array once it is filled.\n */\nfunction sparse<R>(length: number): R[] {\n  const a: R[] = []\n  if (length > 0) {\n    a[length - 1] = undefined as R\n    delete a[length - 1]\n  }\n  return a\n}\n\n/** `p` as an index below `length` (a canonical array index string), else `-1`. */\nexport function arrayIndex(p: string | symbol, length: number): number {\n  const i = typeof p === 'string' ? Number(p) : -1\n  return i >= 0 && i < length && String(i) === p ? i : -1\n}\n\n/**\n * `RowModel.rows` without a `Row` per visible row up front (§9.3 memory: 90k rows unpaginated): a\n * real array (`Array.isArray`, `length`, index reads, iteration, every array method) over a sparse\n * target that builds row `i` with `make(i)` the first time it is read and keeps it, so identity is\n * stable. `Object.keys` / `ownKeys` build every row first.\n */\nexport function lazyRows<R>(length: number, make: (i: number) => R): R[] {\n  const t = sparse<R>(length)\n  /** Builds row `i` (an index from {@link arrayIndex}; `-1` is not one) unless it exists. */\n  const build = (i: number) => {\n    if (i >= 0 && !(i in t)) t[i] = make(i)\n  }\n  return new Proxy(t, {\n    get(_, p, receiver) {\n      build(arrayIndex(p, length))\n      return Reflect.get(t, p, receiver)\n    },\n    has: (_, p) => arrayIndex(p, length) >= 0 || Reflect.has(t, p),\n    getOwnPropertyDescriptor(_, p) {\n      build(arrayIndex(p, length))\n      return Reflect.getOwnPropertyDescriptor(t, p)\n    },\n    ownKeys() {\n      for (let i = 0; i < length; i++) build(i)\n      return Reflect.ownKeys(t)\n    },\n  })\n}\n"],"mappings":";AAkBO,IAAM,YAAiC,OAAO,OAAO,CAAC,CAAC;AAOvD,IAAM,MAAN,MAAuB;AAAA,EAOnB;AAAA;AAAA,EAGT,YAAY,QAAmB,OAAe,KAAa,UAAa;AACtE,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,WAAW;AAChB,SAAK,UAAU;AAAA,EACjB;AAAA;AAAA,EAGA,IAAI,QAAiB;AACnB,WAAO,KAAK,QAAQ,OAAO,KAAK,KAAK,MAAM;AAAA,EAC7C;AAAA;AAAA,EAGA,IAAI,SAA8B;AAChC,WAAO,KAAK,QAAQ,OAAO,KAAK,KAAK,KAAK;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,IAAqB;AAC5B,WAAO,KAAK,QAAQ,MAAM,KAAK,OAAO,KAAK,UAAU,EAAE;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAc,IAAiC;AAC7C,UAAM,SAAS,KAAK,QAAQ,OAAO,KAAK,KAAK;AAC7C,WAAO,WAAW,SAAY,YAAY,KAAK,QAAQ,WAAW,QAAQ,EAAE;AAAA,EAC9E;AACF;AAgBA,SAAS,OAAU,QAAqB;AACtC,QAAM,IAAS,CAAC;AAChB,MAAI,SAAS,GAAG;AACd,MAAE,SAAS,CAAC,IAAI;AAChB,WAAO,EAAE,SAAS,CAAC;AAAA,EACrB;AACA,SAAO;AACT;AAGO,SAAS,WAAW,GAAoB,QAAwB;AACrE,QAAM,IAAI,OAAO,MAAM,WAAW,OAAO,CAAC,IAAI;AAC9C,SAAO,KAAK,KAAK,IAAI,UAAU,OAAO,CAAC,MAAM,IAAI,IAAI;AACvD;AAQO,SAAS,SAAY,QAAgB,MAA6B;AACvE,QAAM,IAAI,OAAU,MAAM;AAE1B,QAAM,QAAQ,CAAC,MAAc;AAC3B,QAAI,KAAK,KAAK,EAAE,KAAK,GAAI,GAAE,CAAC,IAAI,KAAK,CAAC;AAAA,EACxC;AACA,SAAO,IAAI,MAAM,GAAG;AAAA,IAClB,IAAI,GAAG,GAAG,UAAU;AAClB,YAAM,WAAW,GAAG,MAAM,CAAC;AAC3B,aAAO,QAAQ,IAAI,GAAG,GAAG,QAAQ;AAAA,IACnC;AAAA,IACA,KAAK,CAAC,GAAG,MAAM,WAAW,GAAG,MAAM,KAAK,KAAK,QAAQ,IAAI,GAAG,CAAC;AAAA,IAC7D,yBAAyB,GAAG,GAAG;AAC7B,YAAM,WAAW,GAAG,MAAM,CAAC;AAC3B,aAAO,QAAQ,yBAAyB,GAAG,CAAC;AAAA,IAC9C;AAAA,IACA,UAAU;AACR,eAAS,IAAI,GAAG,IAAI,QAAQ,IAAK,OAAM,CAAC;AACxC,aAAO,QAAQ,QAAQ,CAAC;AAAA,IAC1B;AAAA,EACF,CAAC;AACH;","names":[]}
+{"version":3,"sources":["../../src/pipeline/row.ts"],"sourcesContent":["/** A row identity: the `rowKey` value, or the fallback (§5.2). */\nexport type RowKey = string | number\n\n/** A validation issue of a row (Standard Schema v1 issue shape, §5.1). */\nexport interface RowIssue {\n  readonly message: string\n  readonly path?: readonly (PropertyKey | { readonly key: PropertyKey })[] | undefined\n}\n\n/** What a {@link Row} reads its cells through (internal; one per `columns` reference). */\nexport interface RowSource {\n  value(index: number, original: unknown, id: string): unknown\n  /** Schema issues of a flagged row (`invalidRows: 'flag'`); `undefined` for a valid row. */\n  issues(index: number): readonly RowIssue[] | undefined\n  /** The issues of a flagged row that touch column `id` (`matchCellIssues`). */\n  cellIssues(issues: readonly RowIssue[], id: string): readonly RowIssue[]\n}\n\nexport const NO_ISSUES: readonly RowIssue[] = Object.freeze([])\n\n/**\n * The key a {@link Row} keeps its {@link RowSource} under. A symbol, not a `#private` field: a\n * proxy-based store (Vue `ref` / `reactive`, Pinia, MobX) calls the getters and methods with\n * `this` = its proxy, which has no private slot, so `#source` threw there (#11). A symbol key\n * reads through any proxy, stays out of `Object.keys` and JSON, and is not exported.\n */\nconst SOURCE = Symbol()\n\n/**\n * One visible row (§6.6). Created only for the rows `getRowModel()` returns, never for the whole\n * data set (§9.1), and only when read ({@link lazyRows}); the methods live on the prototype, so a\n * row costs its four fields.\n */\nexport class Row<T = unknown> {\n  /** The row's `rowKey` value (the row index without `rowKey`). */\n  readonly key: RowKey\n  /** Position in the ingested data. */\n  readonly index: number\n  /** The row object as passed in `data`. */\n  readonly original: T\n  /** @internal */\n  private readonly [SOURCE]: RowSource\n\n  /** @internal Rows are created by the pipeline. */\n  constructor(source: RowSource, index: number, key: RowKey, original: T) {\n    this.key = key\n    this.index = index\n    this.original = original\n    this[SOURCE] = source\n  }\n\n  /** `false` for a row flagged by schema validation (`invalidRows: 'flag'`). */\n  get valid(): boolean {\n    return this[SOURCE].issues(this.index) === undefined\n  }\n\n  /** The row's schema issues (empty for a valid row). */\n  get issues(): readonly RowIssue[] {\n    return this[SOURCE].issues(this.index) ?? NO_ISSUES\n  }\n\n  /**\n   * The value of column `id` for this row (`key` path or `accessor`); `undefined` for an unknown\n   * column. Never throws: a throwing accessor reports `DK_CALLBACK_FAILED` and reads `undefined`.\n   */\n  getValue(id: string): unknown {\n    return this[SOURCE].value(this.index, this.original, id)\n  }\n\n  /**\n   * The schema issues whose path points into column `id`, matched segment by segment: the issue\n   * path equals the column key, or one contains the other (`address` ↔ `address.city`, never\n   * `addressLine`). Row-level issues (no path) count for every cell; accessor columns have no key,\n   * so they get only those. Empty for a valid row or an unknown column.\n   */\n  getCellIssues(id: string): readonly RowIssue[] {\n    const issues = this[SOURCE].issues(this.index)\n    return issues === undefined ? NO_ISSUES : this[SOURCE].cellIssues(issues, id)\n  }\n}\n\n/** A valid row under `invalidRows: 'flag'`: `original` is the schema output. */\nexport type ValidRow<T> = Row<T> & { readonly valid: true }\n\n/** A flagged row (`invalidRows: 'flag'`): `original` is the raw, unvalidated value. */\nexport type FlaggedInvalidRow = Row<unknown> & { readonly valid: false }\n\n/** `getRowModel().rows` under `invalidRows: 'flag'` (§5.1): narrow on `row.valid`. */\nexport type FlaggedRow<T> = ValidRow<T> | FlaggedInvalidRow\n\n/**\n * An empty array of `length` without a backing store: setting `length` (or `new Array(n)`)\n * allocates `n` slots; a write at `n - 1` then deleting it leaves sparse (dictionary) elements. V8\n * turns it back into a plain array once it is filled.\n */\nfunction sparse<R>(length: number): R[] {\n  const a: R[] = []\n  if (length > 0) {\n    a[length - 1] = undefined as R\n    delete a[length - 1]\n  }\n  return a\n}\n\n/** `p` as an index below `length` (a canonical array index string), else `-1`. */\nexport function arrayIndex(p: string | symbol, length: number): number {\n  const i = typeof p === 'string' ? Number(p) : -1\n  return i >= 0 && i < length && String(i) === p ? i : -1\n}\n\n/**\n * `RowModel.rows` without a `Row` per visible row up front (§9.3 memory: 90k rows unpaginated): a\n * real array (`Array.isArray`, `length`, index reads, iteration, every array method) over a sparse\n * target that builds row `i` with `make(i)` the first time it is read and keeps it, so identity is\n * stable. `Object.keys` / `ownKeys` build every row first.\n */\nexport function lazyRows<R>(length: number, make: (i: number) => R): R[] {\n  const t = sparse<R>(length)\n  /** Builds row `i` (an index from {@link arrayIndex}; `-1` is not one) unless it exists. */\n  const build = (i: number) => {\n    if (i >= 0 && !(i in t)) t[i] = make(i)\n  }\n  return new Proxy(t, {\n    get(_, p, receiver) {\n      build(arrayIndex(p, length))\n      return Reflect.get(t, p, receiver)\n    },\n    has: (_, p) => arrayIndex(p, length) >= 0 || Reflect.has(t, p),\n    getOwnPropertyDescriptor(_, p) {\n      build(arrayIndex(p, length))\n      return Reflect.getOwnPropertyDescriptor(t, p)\n    },\n    ownKeys() {\n      for (let i = 0; i < length; i++) build(i)\n      return Reflect.ownKeys(t)\n    },\n  })\n}\n"],"mappings":";AAkBO,IAAM,YAAiC,OAAO,OAAO,CAAC,CAAC;AAQ9D,IAAM,SAAS,uBAAO;AAeF;AARb,IAAM,MAAN,MAAuB;AAAA;AAAA,EAW5B,YAAY,QAAmB,OAAe,KAAa,UAAa;AACtE,SAAK,MAAM;AACX,SAAK,QAAQ;AACb,SAAK,WAAW;AAChB,SAAK,MAAM,IAAI;AAAA,EACjB;AAAA;AAAA,EAGA,IAAI,QAAiB;AACnB,WAAO,KAAK,MAAM,EAAE,OAAO,KAAK,KAAK,MAAM;AAAA,EAC7C;AAAA;AAAA,EAGA,IAAI,SAA8B;AAChC,WAAO,KAAK,MAAM,EAAE,OAAO,KAAK,KAAK,KAAK;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS,IAAqB;AAC5B,WAAO,KAAK,MAAM,EAAE,MAAM,KAAK,OAAO,KAAK,UAAU,EAAE;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,cAAc,IAAiC;AAC7C,UAAM,SAAS,KAAK,MAAM,EAAE,OAAO,KAAK,KAAK;AAC7C,WAAO,WAAW,SAAY,YAAY,KAAK,MAAM,EAAE,WAAW,QAAQ,EAAE;AAAA,EAC9E;AACF;AAgBA,SAAS,OAAU,QAAqB;AACtC,QAAM,IAAS,CAAC;AAChB,MAAI,SAAS,GAAG;AACd,MAAE,SAAS,CAAC,IAAI;AAChB,WAAO,EAAE,SAAS,CAAC;AAAA,EACrB;AACA,SAAO;AACT;AAGO,SAAS,WAAW,GAAoB,QAAwB;AACrE,QAAM,IAAI,OAAO,MAAM,WAAW,OAAO,CAAC,IAAI;AAC9C,SAAO,KAAK,KAAK,IAAI,UAAU,OAAO,CAAC,MAAM,IAAI,IAAI;AACvD;AAQO,SAAS,SAAY,QAAgB,MAA6B;AACvE,QAAM,IAAI,OAAU,MAAM;AAE1B,QAAM,QAAQ,CAAC,MAAc;AAC3B,QAAI,KAAK,KAAK,EAAE,KAAK,GAAI,GAAE,CAAC,IAAI,KAAK,CAAC;AAAA,EACxC;AACA,SAAO,IAAI,MAAM,GAAG;AAAA,IAClB,IAAI,GAAG,GAAG,UAAU;AAClB,YAAM,WAAW,GAAG,MAAM,CAAC;AAC3B,aAAO,QAAQ,IAAI,GAAG,GAAG,QAAQ;AAAA,IACnC;AAAA,IACA,KAAK,CAAC,GAAG,MAAM,WAAW,GAAG,MAAM,KAAK,KAAK,QAAQ,IAAI,GAAG,CAAC;AAAA,IAC7D,yBAAyB,GAAG,GAAG;AAC7B,YAAM,WAAW,GAAG,MAAM,CAAC;AAC3B,aAAO,QAAQ,yBAAyB,GAAG,CAAC;AAAA,IAC9C;AAAA,IACA,UAAU;AACR,eAAS,IAAI,GAAG,IAAI,QAAQ,IAAK,OAAM,CAAC;AACxC,aAAO,QAAQ,QAAQ,CAAC;AAAA,IAC1B;AAAA,EACF,CAAC;AACH;","names":[]}

package/dist/schema.d.cts

@@ -1,5 +1,5 @@
-import { S as StandardSchemaV1, e as TableSchema } from './codes-BKdS9EiO.cjs';
-export { q as DatakableSchemaError, h as InvalidRow, I as InvalidRowsMode, C as SCHEMA_INGEST, H as SchemaIssueColumn, J as SchemaOutcome, ad as isStandardSchema, am as schemaDiagnostics } from './codes-BKdS9EiO.cjs';
+import { S as StandardSchemaV1, e as TableSchema } from './codes-OsjAR3Wz.cjs';
+export { q as DatakableSchemaError, h as InvalidRow, I as InvalidRowsMode, C as SCHEMA_INGEST, H as SchemaIssueColumn, J as SchemaOutcome, ad as isStandardSchema, am as schemaDiagnostics } from './codes-OsjAR3Wz.cjs';
 
 /**
  * Opts a Standard Schema v1 (zod, valibot, arktype, …) into table validation (§5.1):

package/dist/schema.d.ts

@@ -1,5 +1,5 @@
-import { S as StandardSchemaV1, e as TableSchema } from './codes-BKdS9EiO.js';
-export { q as DatakableSchemaError, h as InvalidRow, I as InvalidRowsMode, C as SCHEMA_INGEST, H as SchemaIssueColumn, J as SchemaOutcome, ad as isStandardSchema, am as schemaDiagnostics } from './codes-BKdS9EiO.js';
+import { S as StandardSchemaV1, e as TableSchema } from './codes-OsjAR3Wz.js';
+export { q as DatakableSchemaError, h as InvalidRow, I as InvalidRowsMode, C as SCHEMA_INGEST, H as SchemaIssueColumn, J as SchemaOutcome, ad as isStandardSchema, am as schemaDiagnostics } from './codes-OsjAR3Wz.js';
 
 /**
  * Opts a Standard Schema v1 (zod, valibot, arktype, …) into table validation (§5.1):

package/dist/{search-async-entry-BmQYT120.d.ts → search-async-entry-DGSw2pDL.d.ts}

@@ -1,5 +1,5 @@
-import { i as RowKey } from './codes-BKdS9EiO.js';
-import { R as RowModelContext, c as FeatureContext } from './explain-DcUZfFh5.js';
+import { i as RowKey } from './codes-OsjAR3Wz.js';
+import { R as RowModelContext, c as FeatureContext } from './explain-Dn99IQt0.js';
 
 /** What `setSearch` / `flushSearch` resolve to; they never reject. */
 interface SearchOutcome {

package/dist/{search-async-entry-C3mXxLP8.d.cts → search-async-entry-v5JdEk5Y.d.cts}

@@ -1,5 +1,5 @@
-import { i as RowKey } from './codes-BKdS9EiO.cjs';
-import { R as RowModelContext, c as FeatureContext } from './explain-aagaYHcy.cjs';
+import { i as RowKey } from './codes-OsjAR3Wz.cjs';
+import { R as RowModelContext, c as FeatureContext } from './explain-vkD2cewE.cjs';
 
 /** What `setSearch` / `flushSearch` resolve to; they never reject. */
 interface SearchOutcome {

package/dist/search-async.d.cts

@@ -1,3 +1,3 @@
-export { ap as searchDiagnostics } from './codes-BKdS9EiO.cjs';
-export { A as AsyncSearchFn, a as SEARCH_ENGINE, b as SearchFn, c as SearchFnContext, e as SearchResult, w as withSearchFn } from './search-async-entry-C3mXxLP8.cjs';
-import './explain-aagaYHcy.cjs';
+export { ap as searchDiagnostics } from './codes-OsjAR3Wz.cjs';
+export { A as AsyncSearchFn, a as SEARCH_ENGINE, b as SearchFn, c as SearchFnContext, e as SearchResult, w as withSearchFn } from './search-async-entry-v5JdEk5Y.cjs';
+import './explain-vkD2cewE.cjs';

package/dist/search-async.d.ts

@@ -1,3 +1,3 @@
-export { ap as searchDiagnostics } from './codes-BKdS9EiO.js';
-export { A as AsyncSearchFn, a as SEARCH_ENGINE, b as SearchFn, c as SearchFnContext, e as SearchResult, w as withSearchFn } from './search-async-entry-BmQYT120.js';
-import './explain-DcUZfFh5.js';
+export { ap as searchDiagnostics } from './codes-OsjAR3Wz.js';
+export { A as AsyncSearchFn, a as SEARCH_ENGINE, b as SearchFn, c as SearchFnContext, e as SearchResult, w as withSearchFn } from './search-async-entry-DGSw2pDL.js';
+import './explain-Dn99IQt0.js';

package/dist/search.d.cts

@@ -1,8 +1,8 @@
-export { ap as searchDiagnostics } from './codes-BKdS9EiO.cjs';
-import { d as AnyRow, F as Feature, b as FixedTypes } from './explain-aagaYHcy.cjs';
+export { ap as searchDiagnostics } from './codes-OsjAR3Wz.cjs';
+import { d as AnyRow, F as Feature, b as FixedTypes } from './explain-vkD2cewE.cjs';
 import { a as DataMode } from './mode-DFV8ryXo.cjs';
-import { d as SearchOutcome, A as AsyncSearchFn, S as SearchState } from './search-async-entry-C3mXxLP8.cjs';
-export { a as SEARCH_ENGINE, b as SearchFn, c as SearchFnContext, e as SearchResult, f as SearchStatus, w as withSearchFn } from './search-async-entry-C3mXxLP8.cjs';
+import { d as SearchOutcome, A as AsyncSearchFn, S as SearchState } from './search-async-entry-v5JdEk5Y.cjs';
+export { a as SEARCH_ENGINE, b as SearchFn, c as SearchFnContext, e as SearchResult, f as SearchStatus, w as withSearchFn } from './search-async-entry-v5JdEk5Y.cjs';
 
 interface SearchApi {
     /** Sets `input` (and `query`, with the client's immediate typing strategy). */

package/dist/search.d.ts

@@ -1,8 +1,8 @@
-export { ap as searchDiagnostics } from './codes-BKdS9EiO.js';
-import { d as AnyRow, F as Feature, b as FixedTypes } from './explain-DcUZfFh5.js';
+export { ap as searchDiagnostics } from './codes-OsjAR3Wz.js';
+import { d as AnyRow, F as Feature, b as FixedTypes } from './explain-Dn99IQt0.js';
 import { a as DataMode } from './mode-DFV8ryXo.js';
-import { d as SearchOutcome, A as AsyncSearchFn, S as SearchState } from './search-async-entry-BmQYT120.js';
-export { a as SEARCH_ENGINE, b as SearchFn, c as SearchFnContext, e as SearchResult, f as SearchStatus, w as withSearchFn } from './search-async-entry-BmQYT120.js';
+import { d as SearchOutcome, A as AsyncSearchFn, S as SearchState } from './search-async-entry-DGSw2pDL.js';
+export { a as SEARCH_ENGINE, b as SearchFn, c as SearchFnContext, e as SearchResult, f as SearchStatus, w as withSearchFn } from './search-async-entry-DGSw2pDL.js';
 
 interface SearchApi {
     /** Sets `input` (and `query`, with the client's immediate typing strategy). */

package/dist/server.d.cts

@@ -1,6 +1,6 @@
-import { a as Interceptor, D as Fetcher, i as ServerFetcher } from './explain-aagaYHcy.cjs';
-export { x as FetchOutcome, y as FetchParams, z as FetchResult, ab as SERVER_SOURCE } from './explain-aagaYHcy.cjs';
-export { B as BadResponse, N as asyncDiagnostics, a4 as fetchDiagnostics } from './codes-BKdS9EiO.cjs';
+import { a as Interceptor, D as Fetcher, i as ServerFetcher } from './explain-vkD2cewE.cjs';
+export { x as FetchOutcome, y as FetchParams, z as FetchResult, ab as SERVER_SOURCE } from './explain-vkD2cewE.cjs';
+export { B as BadResponse, N as asyncDiagnostics, a4 as fetchDiagnostics } from './codes-OsjAR3Wz.cjs';
 
 /** Spec §7.1: a request that has not settled after 30 s is aborted (`DK_ASYNC_TIMEOUT`). */
 declare const DEFAULT_ASYNC_TIMEOUT = 30000;

package/dist/server.d.ts

@@ -1,6 +1,6 @@
-import { a as Interceptor, D as Fetcher, i as ServerFetcher } from './explain-DcUZfFh5.js';
-export { x as FetchOutcome, y as FetchParams, z as FetchResult, ab as SERVER_SOURCE } from './explain-DcUZfFh5.js';
-export { B as BadResponse, N as asyncDiagnostics, a4 as fetchDiagnostics } from './codes-BKdS9EiO.js';
+import { a as Interceptor, D as Fetcher, i as ServerFetcher } from './explain-Dn99IQt0.js';
+export { x as FetchOutcome, y as FetchParams, z as FetchResult, ab as SERVER_SOURCE } from './explain-Dn99IQt0.js';
+export { B as BadResponse, N as asyncDiagnostics, a4 as fetchDiagnostics } from './codes-OsjAR3Wz.js';
 
 /** Spec §7.1: a request that has not settled after 30 s is aborted (`DK_ASYNC_TIMEOUT`). */
 declare const DEFAULT_ASYNC_TIMEOUT = 30000;

package/dist/sorting.d.cts

@@ -1,5 +1,5 @@
-export { W as comparatorDiagnostics, ar as sortingDiagnostics } from './codes-BKdS9EiO.cjs';
-import { ad as SortAlgorithm, a1 as Path, e as FeatureTypes, F as Feature } from './explain-aagaYHcy.cjs';
+export { W as comparatorDiagnostics, ar as sortingDiagnostics } from './codes-OsjAR3Wz.cjs';
+import { ad as SortAlgorithm, a1 as Path, e as FeatureTypes, F as Feature } from './explain-vkD2cewE.cjs';
 import { a as DataMode } from './mode-DFV8ryXo.cjs';
 
 /** The rank of `v` in {@link RANK}. */
@@ -47,7 +47,10 @@ interface SortingTypes extends FeatureTypes {
  */
 type SortAlgorithmOption = SortAlgorithm;
 interface SortingOptions {
-    /** Locale(s) of the string collator (`Intl.Collator(locale, { numeric: true })`); default: the runtime's. */
+    /**
+     * Locale(s) of the string collator (`Intl.Collator(locale, { numeric: true })`). Default `'en'`,
+     * not the runtime's: the server and the browser must sort alike (SSR hydration, #12).
+     */
     locale?: string | readonly string[];
     /** The sort algorithm (default `'auto'`); a column's `sortAlgorithm` takes precedence. */
     algorithm?: SortAlgorithmOption;

package/dist/sorting.d.ts

@@ -1,5 +1,5 @@
-export { W as comparatorDiagnostics, ar as sortingDiagnostics } from './codes-BKdS9EiO.js';
-import { ad as SortAlgorithm, a1 as Path, e as FeatureTypes, F as Feature } from './explain-DcUZfFh5.js';
+export { W as comparatorDiagnostics, ar as sortingDiagnostics } from './codes-OsjAR3Wz.js';
+import { ad as SortAlgorithm, a1 as Path, e as FeatureTypes, F as Feature } from './explain-Dn99IQt0.js';
 import { a as DataMode } from './mode-DFV8ryXo.js';
 
 /** The rank of `v` in {@link RANK}. */
@@ -47,7 +47,10 @@ interface SortingTypes extends FeatureTypes {
  */
 type SortAlgorithmOption = SortAlgorithm;
 interface SortingOptions {
-    /** Locale(s) of the string collator (`Intl.Collator(locale, { numeric: true })`); default: the runtime's. */
+    /**
+     * Locale(s) of the string collator (`Intl.Collator(locale, { numeric: true })`). Default `'en'`,
+     * not the runtime's: the server and the browser must sort alike (SSR hydration, #12).
+     */
     locale?: string | readonly string[];
     /** The sort algorithm (default `'auto'`); a column's `sortAlgorithm` takes precedence. */
     algorithm?: SortAlgorithmOption;

package/dist/validity.d.cts

@@ -1,5 +1,5 @@
-export { aw as validityDiagnostics } from './codes-BKdS9EiO.cjs';
-import { F as Feature, b as FixedTypes } from './explain-aagaYHcy.cjs';
+export { aw as validityDiagnostics } from './codes-OsjAR3Wz.cjs';
+import { F as Feature, b as FixedTypes } from './explain-vkD2cewE.cjs';
 
 /** Which rows the `validity` step keeps (§6.2). */
 type ValidityState = 'all' | 'valid' | 'invalid';

package/dist/validity.d.ts

@@ -1,5 +1,5 @@
-export { aw as validityDiagnostics } from './codes-BKdS9EiO.js';
-import { F as Feature, b as FixedTypes } from './explain-DcUZfFh5.js';
+export { aw as validityDiagnostics } from './codes-OsjAR3Wz.js';
+import { F as Feature, b as FixedTypes } from './explain-Dn99IQt0.js';
 
 /** Which rows the `validity` step keeps (§6.2). */
 type ValidityState = 'all' | 'valid' | 'invalid';

package/dist/version.cjs

@@ -25,7 +25,7 @@ __export(version_exports, {
 module.exports = __toCommonJS(version_exports);
 
 // package.json
-var version = "1.0.0";
+var version = "1.0.1";
 
 // src/version.ts
 var VERSION = version;

package/dist/version.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/version.ts","../package.json"],"sourcesContent":["// Read from package.json at build time (the bundler inlines the one field), so a release never\n// ships a stale hard-coded version.\nimport { version } from '../package.json'\n\n/** The `@datakable/core` version (`context.package`, docs URLs, the global version registry). */\nexport const VERSION: string = version\n","{\n  \"name\": \"@datakable/core\",\n  \"version\": \"1.0.0\",\n  \"description\": \"Headless, framework-agnostic core of DataKable \\u2014 table state, sorting, filtering and types.\",\n  \"license\": \"MIT\",\n  \"author\": \"Supakit Kitjanabumrungsak\",\n  \"repository\": {\n    \"type\": \"git\",\n    \"url\": \"git+https://github.com/Ink01101011/datakable.git\",\n    \"directory\": \"packages/core\"\n  },\n  \"homepage\": \"https://github.com/Ink01101011/datakable#readme\",\n  \"bugs\": \"https://github.com/Ink01101011/datakable/issues\",\n  \"keywords\": [\n    \"react\",\n    \"datatable\",\n    \"table\",\n    \"data-grid\",\n    \"typescript\",\n    \"type-safe\",\n    \"headless\"\n  ],\n  \"type\": \"module\",\n  \"sideEffects\": [\n    \"./dist/messages/index.js\",\n    \"./dist/messages/index.cjs\"\n  ],\n  \"main\": \"./dist/index.cjs\",\n  \"module\": \"./dist/index.js\",\n  \"types\": \"./dist/index.d.ts\",\n  \"exports\": {\n    \".\": {\n      \"import\": {\n        \"types\": \"./dist/index.d.ts\",\n        \"default\": \"./dist/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/index.d.cts\",\n        \"default\": \"./dist/index.cjs\"\n      }\n    },\n    \"./column-filters\": {\n      \"import\": {\n        \"types\": \"./dist/column-filters.d.ts\",\n        \"default\": \"./dist/features/column-filters/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/column-filters.d.cts\",\n        \"default\": \"./dist/features/column-filters/index.cjs\"\n      }\n    },\n    \"./validity\": {\n      \"import\": {\n        \"types\": \"./dist/validity.d.ts\",\n        \"default\": \"./dist/features/validity/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/validity.d.cts\",\n        \"default\": \"./dist/features/validity/index.cjs\"\n      }\n    },\n    \"./search\": {\n      \"import\": {\n        \"types\": \"./dist/search.d.ts\",\n        \"default\": \"./dist/features/search/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/search.d.cts\",\n        \"default\": \"./dist/features/search/index.cjs\"\n      }\n    },\n    \"./sorting\": {\n      \"import\": {\n        \"types\": \"./dist/sorting.d.ts\",\n        \"default\": \"./dist/features/sorting/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/sorting.d.cts\",\n        \"default\": \"./dist/features/sorting/index.cjs\"\n      }\n    },\n    \"./pagination\": {\n      \"import\": {\n        \"types\": \"./dist/pagination.d.ts\",\n        \"default\": \"./dist/features/pagination/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/pagination.d.cts\",\n        \"default\": \"./dist/features/pagination/index.cjs\"\n      }\n    },\n    \"./messages\": {\n      \"import\": {\n        \"types\": \"./dist/messages.d.ts\",\n        \"default\": \"./dist/messages/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/messages.d.cts\",\n        \"default\": \"./dist/messages/index.cjs\"\n      }\n    },\n    \"./schema\": {\n      \"import\": {\n        \"types\": \"./dist/schema.d.ts\",\n        \"default\": \"./dist/ingest/schema-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/schema.d.cts\",\n        \"default\": \"./dist/ingest/schema-entry.cjs\"\n      }\n    },\n    \"./search-async\": {\n      \"import\": {\n        \"types\": \"./dist/search-async.d.ts\",\n        \"default\": \"./dist/features/search/search-async-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/search-async.d.cts\",\n        \"default\": \"./dist/features/search/search-async-entry.cjs\"\n      }\n    },\n    \"./server\": {\n      \"import\": {\n        \"types\": \"./dist/server.d.ts\",\n        \"default\": \"./dist/source/server-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/server.d.cts\",\n        \"default\": \"./dist/source/server-entry.cjs\"\n      }\n    },\n    \"./package.json\": \"./package.json\"\n  },\n  \"files\": [\n    \"dist\"\n  ],\n  \"scripts\": {\n    \"build\": \"tsup && node scripts/postbuild.mjs\",\n    \"dev\": \"tsup --watch\",\n    \"typecheck\": \"tsc -p tsconfig.json\",\n    \"check:pkg\": \"publint --strict && attw --pack . --profile node16 && node scripts/check-catalog.mjs\",\n    \"check:catalog\": \"node scripts/check-catalog.mjs\"\n  },\n  \"dependencies\": {\n    \"ex-search\": \"1.1.1\",\n    \"exsorted\": \"1.2.3\",\n    \"kk-debounce\": \"1.1.0\"\n  },\n  \"devDependencies\": {\n    \"esbuild\": \"0.27.7\"\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACEE,cAAW;;;ADGN,IAAM,UAAkB;","names":[]}
+{"version":3,"sources":["../src/version.ts","../package.json"],"sourcesContent":["// Read from package.json at build time (the bundler inlines the one field), so a release never\n// ships a stale hard-coded version.\nimport { version } from '../package.json'\n\n/** The `@datakable/core` version (`context.package`, docs URLs, the global version registry). */\nexport const VERSION: string = version\n","{\n  \"name\": \"@datakable/core\",\n  \"version\": \"1.0.1\",\n  \"description\": \"Headless, framework-agnostic core of DataKable \\u2014 table state, sorting, filtering and types.\",\n  \"license\": \"MIT\",\n  \"author\": \"Supakit Kitjanabumrungsak\",\n  \"repository\": {\n    \"type\": \"git\",\n    \"url\": \"git+https://github.com/Ink01101011/datakable.git\",\n    \"directory\": \"packages/core\"\n  },\n  \"homepage\": \"https://github.com/Ink01101011/datakable#readme\",\n  \"bugs\": \"https://github.com/Ink01101011/datakable/issues\",\n  \"keywords\": [\n    \"react\",\n    \"datatable\",\n    \"table\",\n    \"data-grid\",\n    \"typescript\",\n    \"type-safe\",\n    \"headless\"\n  ],\n  \"type\": \"module\",\n  \"sideEffects\": [\n    \"./dist/messages/index.js\",\n    \"./dist/messages/index.cjs\"\n  ],\n  \"main\": \"./dist/index.cjs\",\n  \"module\": \"./dist/index.js\",\n  \"types\": \"./dist/index.d.ts\",\n  \"exports\": {\n    \".\": {\n      \"import\": {\n        \"types\": \"./dist/index.d.ts\",\n        \"default\": \"./dist/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/index.d.cts\",\n        \"default\": \"./dist/index.cjs\"\n      }\n    },\n    \"./column-filters\": {\n      \"import\": {\n        \"types\": \"./dist/column-filters.d.ts\",\n        \"default\": \"./dist/features/column-filters/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/column-filters.d.cts\",\n        \"default\": \"./dist/features/column-filters/index.cjs\"\n      }\n    },\n    \"./validity\": {\n      \"import\": {\n        \"types\": \"./dist/validity.d.ts\",\n        \"default\": \"./dist/features/validity/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/validity.d.cts\",\n        \"default\": \"./dist/features/validity/index.cjs\"\n      }\n    },\n    \"./search\": {\n      \"import\": {\n        \"types\": \"./dist/search.d.ts\",\n        \"default\": \"./dist/features/search/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/search.d.cts\",\n        \"default\": \"./dist/features/search/index.cjs\"\n      }\n    },\n    \"./sorting\": {\n      \"import\": {\n        \"types\": \"./dist/sorting.d.ts\",\n        \"default\": \"./dist/features/sorting/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/sorting.d.cts\",\n        \"default\": \"./dist/features/sorting/index.cjs\"\n      }\n    },\n    \"./pagination\": {\n      \"import\": {\n        \"types\": \"./dist/pagination.d.ts\",\n        \"default\": \"./dist/features/pagination/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/pagination.d.cts\",\n        \"default\": \"./dist/features/pagination/index.cjs\"\n      }\n    },\n    \"./messages\": {\n      \"import\": {\n        \"types\": \"./dist/messages.d.ts\",\n        \"default\": \"./dist/messages/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/messages.d.cts\",\n        \"default\": \"./dist/messages/index.cjs\"\n      }\n    },\n    \"./schema\": {\n      \"import\": {\n        \"types\": \"./dist/schema.d.ts\",\n        \"default\": \"./dist/ingest/schema-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/schema.d.cts\",\n        \"default\": \"./dist/ingest/schema-entry.cjs\"\n      }\n    },\n    \"./search-async\": {\n      \"import\": {\n        \"types\": \"./dist/search-async.d.ts\",\n        \"default\": \"./dist/features/search/search-async-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/search-async.d.cts\",\n        \"default\": \"./dist/features/search/search-async-entry.cjs\"\n      }\n    },\n    \"./server\": {\n      \"import\": {\n        \"types\": \"./dist/server.d.ts\",\n        \"default\": \"./dist/source/server-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/server.d.cts\",\n        \"default\": \"./dist/source/server-entry.cjs\"\n      }\n    },\n    \"./package.json\": \"./package.json\"\n  },\n  \"files\": [\n    \"dist\"\n  ],\n  \"scripts\": {\n    \"build\": \"tsup && node scripts/postbuild.mjs\",\n    \"dev\": \"tsup --watch\",\n    \"typecheck\": \"tsc -p tsconfig.json\",\n    \"check:pkg\": \"publint --strict && attw --pack . --profile node16 && node scripts/check-catalog.mjs\",\n    \"check:catalog\": \"node scripts/check-catalog.mjs\"\n  },\n  \"dependencies\": {\n    \"ex-search\": \"1.1.1\",\n    \"exsorted\": \"1.2.3\",\n    \"kk-debounce\": \"1.1.0\"\n  },\n  \"devDependencies\": {\n    \"esbuild\": \"0.27.7\"\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACEE,cAAW;;;ADGN,IAAM,UAAkB;","names":[]}

package/dist/version.js

@@ -1,5 +1,5 @@
 // package.json
-var version = "1.0.0";
+var version = "1.0.1";
 
 // src/version.ts
 var VERSION = version;

package/dist/version.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../package.json","../src/version.ts"],"sourcesContent":["{\n  \"name\": \"@datakable/core\",\n  \"version\": \"1.0.0\",\n  \"description\": \"Headless, framework-agnostic core of DataKable \\u2014 table state, sorting, filtering and types.\",\n  \"license\": \"MIT\",\n  \"author\": \"Supakit Kitjanabumrungsak\",\n  \"repository\": {\n    \"type\": \"git\",\n    \"url\": \"git+https://github.com/Ink01101011/datakable.git\",\n    \"directory\": \"packages/core\"\n  },\n  \"homepage\": \"https://github.com/Ink01101011/datakable#readme\",\n  \"bugs\": \"https://github.com/Ink01101011/datakable/issues\",\n  \"keywords\": [\n    \"react\",\n    \"datatable\",\n    \"table\",\n    \"data-grid\",\n    \"typescript\",\n    \"type-safe\",\n    \"headless\"\n  ],\n  \"type\": \"module\",\n  \"sideEffects\": [\n    \"./dist/messages/index.js\",\n    \"./dist/messages/index.cjs\"\n  ],\n  \"main\": \"./dist/index.cjs\",\n  \"module\": \"./dist/index.js\",\n  \"types\": \"./dist/index.d.ts\",\n  \"exports\": {\n    \".\": {\n      \"import\": {\n        \"types\": \"./dist/index.d.ts\",\n        \"default\": \"./dist/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/index.d.cts\",\n        \"default\": \"./dist/index.cjs\"\n      }\n    },\n    \"./column-filters\": {\n      \"import\": {\n        \"types\": \"./dist/column-filters.d.ts\",\n        \"default\": \"./dist/features/column-filters/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/column-filters.d.cts\",\n        \"default\": \"./dist/features/column-filters/index.cjs\"\n      }\n    },\n    \"./validity\": {\n      \"import\": {\n        \"types\": \"./dist/validity.d.ts\",\n        \"default\": \"./dist/features/validity/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/validity.d.cts\",\n        \"default\": \"./dist/features/validity/index.cjs\"\n      }\n    },\n    \"./search\": {\n      \"import\": {\n        \"types\": \"./dist/search.d.ts\",\n        \"default\": \"./dist/features/search/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/search.d.cts\",\n        \"default\": \"./dist/features/search/index.cjs\"\n      }\n    },\n    \"./sorting\": {\n      \"import\": {\n        \"types\": \"./dist/sorting.d.ts\",\n        \"default\": \"./dist/features/sorting/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/sorting.d.cts\",\n        \"default\": \"./dist/features/sorting/index.cjs\"\n      }\n    },\n    \"./pagination\": {\n      \"import\": {\n        \"types\": \"./dist/pagination.d.ts\",\n        \"default\": \"./dist/features/pagination/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/pagination.d.cts\",\n        \"default\": \"./dist/features/pagination/index.cjs\"\n      }\n    },\n    \"./messages\": {\n      \"import\": {\n        \"types\": \"./dist/messages.d.ts\",\n        \"default\": \"./dist/messages/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/messages.d.cts\",\n        \"default\": \"./dist/messages/index.cjs\"\n      }\n    },\n    \"./schema\": {\n      \"import\": {\n        \"types\": \"./dist/schema.d.ts\",\n        \"default\": \"./dist/ingest/schema-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/schema.d.cts\",\n        \"default\": \"./dist/ingest/schema-entry.cjs\"\n      }\n    },\n    \"./search-async\": {\n      \"import\": {\n        \"types\": \"./dist/search-async.d.ts\",\n        \"default\": \"./dist/features/search/search-async-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/search-async.d.cts\",\n        \"default\": \"./dist/features/search/search-async-entry.cjs\"\n      }\n    },\n    \"./server\": {\n      \"import\": {\n        \"types\": \"./dist/server.d.ts\",\n        \"default\": \"./dist/source/server-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/server.d.cts\",\n        \"default\": \"./dist/source/server-entry.cjs\"\n      }\n    },\n    \"./package.json\": \"./package.json\"\n  },\n  \"files\": [\n    \"dist\"\n  ],\n  \"scripts\": {\n    \"build\": \"tsup && node scripts/postbuild.mjs\",\n    \"dev\": \"tsup --watch\",\n    \"typecheck\": \"tsc -p tsconfig.json\",\n    \"check:pkg\": \"publint --strict && attw --pack . --profile node16 && node scripts/check-catalog.mjs\",\n    \"check:catalog\": \"node scripts/check-catalog.mjs\"\n  },\n  \"dependencies\": {\n    \"ex-search\": \"1.1.1\",\n    \"exsorted\": \"1.2.3\",\n    \"kk-debounce\": \"1.1.0\"\n  },\n  \"devDependencies\": {\n    \"esbuild\": \"0.27.7\"\n  }\n}\n","// Read from package.json at build time (the bundler inlines the one field), so a release never\n// ships a stale hard-coded version.\nimport { version } from '../package.json'\n\n/** The `@datakable/core` version (`context.package`, docs URLs, the global version registry). */\nexport const VERSION: string = version\n"],"mappings":";AAEE,cAAW;;;ACGN,IAAM,UAAkB;","names":[]}
+{"version":3,"sources":["../package.json","../src/version.ts"],"sourcesContent":["{\n  \"name\": \"@datakable/core\",\n  \"version\": \"1.0.1\",\n  \"description\": \"Headless, framework-agnostic core of DataKable \\u2014 table state, sorting, filtering and types.\",\n  \"license\": \"MIT\",\n  \"author\": \"Supakit Kitjanabumrungsak\",\n  \"repository\": {\n    \"type\": \"git\",\n    \"url\": \"git+https://github.com/Ink01101011/datakable.git\",\n    \"directory\": \"packages/core\"\n  },\n  \"homepage\": \"https://github.com/Ink01101011/datakable#readme\",\n  \"bugs\": \"https://github.com/Ink01101011/datakable/issues\",\n  \"keywords\": [\n    \"react\",\n    \"datatable\",\n    \"table\",\n    \"data-grid\",\n    \"typescript\",\n    \"type-safe\",\n    \"headless\"\n  ],\n  \"type\": \"module\",\n  \"sideEffects\": [\n    \"./dist/messages/index.js\",\n    \"./dist/messages/index.cjs\"\n  ],\n  \"main\": \"./dist/index.cjs\",\n  \"module\": \"./dist/index.js\",\n  \"types\": \"./dist/index.d.ts\",\n  \"exports\": {\n    \".\": {\n      \"import\": {\n        \"types\": \"./dist/index.d.ts\",\n        \"default\": \"./dist/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/index.d.cts\",\n        \"default\": \"./dist/index.cjs\"\n      }\n    },\n    \"./column-filters\": {\n      \"import\": {\n        \"types\": \"./dist/column-filters.d.ts\",\n        \"default\": \"./dist/features/column-filters/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/column-filters.d.cts\",\n        \"default\": \"./dist/features/column-filters/index.cjs\"\n      }\n    },\n    \"./validity\": {\n      \"import\": {\n        \"types\": \"./dist/validity.d.ts\",\n        \"default\": \"./dist/features/validity/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/validity.d.cts\",\n        \"default\": \"./dist/features/validity/index.cjs\"\n      }\n    },\n    \"./search\": {\n      \"import\": {\n        \"types\": \"./dist/search.d.ts\",\n        \"default\": \"./dist/features/search/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/search.d.cts\",\n        \"default\": \"./dist/features/search/index.cjs\"\n      }\n    },\n    \"./sorting\": {\n      \"import\": {\n        \"types\": \"./dist/sorting.d.ts\",\n        \"default\": \"./dist/features/sorting/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/sorting.d.cts\",\n        \"default\": \"./dist/features/sorting/index.cjs\"\n      }\n    },\n    \"./pagination\": {\n      \"import\": {\n        \"types\": \"./dist/pagination.d.ts\",\n        \"default\": \"./dist/features/pagination/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/pagination.d.cts\",\n        \"default\": \"./dist/features/pagination/index.cjs\"\n      }\n    },\n    \"./messages\": {\n      \"import\": {\n        \"types\": \"./dist/messages.d.ts\",\n        \"default\": \"./dist/messages/index.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/messages.d.cts\",\n        \"default\": \"./dist/messages/index.cjs\"\n      }\n    },\n    \"./schema\": {\n      \"import\": {\n        \"types\": \"./dist/schema.d.ts\",\n        \"default\": \"./dist/ingest/schema-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/schema.d.cts\",\n        \"default\": \"./dist/ingest/schema-entry.cjs\"\n      }\n    },\n    \"./search-async\": {\n      \"import\": {\n        \"types\": \"./dist/search-async.d.ts\",\n        \"default\": \"./dist/features/search/search-async-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/search-async.d.cts\",\n        \"default\": \"./dist/features/search/search-async-entry.cjs\"\n      }\n    },\n    \"./server\": {\n      \"import\": {\n        \"types\": \"./dist/server.d.ts\",\n        \"default\": \"./dist/source/server-entry.js\"\n      },\n      \"require\": {\n        \"types\": \"./dist/server.d.cts\",\n        \"default\": \"./dist/source/server-entry.cjs\"\n      }\n    },\n    \"./package.json\": \"./package.json\"\n  },\n  \"files\": [\n    \"dist\"\n  ],\n  \"scripts\": {\n    \"build\": \"tsup && node scripts/postbuild.mjs\",\n    \"dev\": \"tsup --watch\",\n    \"typecheck\": \"tsc -p tsconfig.json\",\n    \"check:pkg\": \"publint --strict && attw --pack . --profile node16 && node scripts/check-catalog.mjs\",\n    \"check:catalog\": \"node scripts/check-catalog.mjs\"\n  },\n  \"dependencies\": {\n    \"ex-search\": \"1.1.1\",\n    \"exsorted\": \"1.2.3\",\n    \"kk-debounce\": \"1.1.0\"\n  },\n  \"devDependencies\": {\n    \"esbuild\": \"0.27.7\"\n  }\n}\n","// Read from package.json at build time (the bundler inlines the one field), so a release never\n// ships a stale hard-coded version.\nimport { version } from '../package.json'\n\n/** The `@datakable/core` version (`context.package`, docs URLs, the global version registry). */\nexport const VERSION: string = version\n"],"mappings":";AAEE,cAAW;;;ACGN,IAAM,UAAkB;","names":[]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@datakable/core",
-  "version": "1.0.0",
+  "version": "1.0.1",
   "description": "Headless, framework-agnostic core of DataKable — table state, sorting, filtering and types.",
   "license": "MIT",
   "author": "Supakit Kitjanabumrungsak",