@datakable/core 1.0.0 → 1.1.0

package/dist/features/search/search-index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/features/search/search-index.ts"],"sourcesContent":["import { ExSearch } from 'ex-search'\nimport type { Emit } from '../../diagnostics/types'\nimport type { RowModelContext } from '../../feature/types'\nimport { resolveColumns } from '../../pipeline/columns'\nimport { arrayIndex } from '../../pipeline/row'\nimport { detectCapability, hasCapability } from '../../versioning/capability'\n\n/** Matcher settings (the client options of `search()`, defaults applied). */\nexport interface MatchConfig {\n  readonly threshold: number\n  readonly fuzzyMaxDistance: number\n  readonly caseSensitive: boolean\n}\n\n/**\n * One projected row as ex-search reads it: `i` is the row index (results map back by it, never by\n * identity: ex-search returns copies), `c0`, `c1`, … the formatted values of the searchable\n * columns. Flat keys also sidestep ex-search's top-level-key limitation for nested paths. Items\n * are built per chunk while matching and dropped after it (§9.3 memory): none is kept.\n */\nexport type Item = Record<string, string | number> & { readonly i: number }\n\n/** A match: the row index and its relevance (0–1, weight applied). */\nexport interface Hit {\n  readonly i: number\n  readonly score: number\n}\n\n/** The matcher of one (data, columns) pair: references to column values, no per-row copy. */\nexport interface SearchIndex {\n  /**\n   * A time-sliced job (§9.1) matching `query` (trimmed, non-blank) against the rows `rows` (row\n   * indices), in chunks: the hits in relevance order ({@link rankHits}).\n   */\n  match(rows: Uint32Array, query: string): Generator<undefined, Uint32Array, undefined>\n}\n\n/** Rows per chunk between two `yield`s of the matching job. */\nconst CHUNK = 4096\n\ninterface Key {\n  readonly name: string\n  readonly weight: number\n}\n\n/** The formatted value of row `r` of one searchable column. */\ntype Read = (r: number) => string\n\nconst hasExSearch = () =>\n  typeof ExSearch === 'function' &&\n  typeof ExSearch.prototype.search === 'function' &&\n  typeof ExSearch.prototype.setData === 'function'\n\n/** Feature-detects ex-search once (§8.5); `false` → the contains fallback. */\nexport function probeExSearch(emit: Emit): boolean {\n  // DK_DEP_INCOMPATIBLE is a development check (§8.5); the fallback is not.\n  return (process.env.NODE_ENV !== \"production\")\n    ? detectCapability(\n        hasExSearch,\n        {\n          feature: 'search',\n          dependency: 'ex-search',\n          capability: 'ExSearch',\n          supported: '^1.1.1',\n          fallback: 'case-insensitive exact / prefix / substring matching (no fuzzy matching)',\n        },\n        emit,\n      )\n    : hasCapability(hasExSearch)\n}\n\n/**\n * A numeric column's formatted value without the cached strings: `String(v)` is what the default\n * formatter shows for a number. Only when no value is `NaN` — a `NaN` cell is `null` / `undefined`\n * (shown as `''`) or a real `NaN` (shown as `'NaN'`), which only the formatted cache tells apart.\n */\nfunction numberReader(values: Float64Array): Read | undefined {\n  for (let r = 0; r < values.length; r++) if (Number.isNaN(values[r])) return undefined\n  return (r) => String(values[r])\n}\n\n/**\n * Builds the matcher over the formatted values of the searchable columns (what the user sees), once\n * per data + columns, as a time-sliced job (§9.1): one column read per slice. Searchable columns are\n * those with a `search` weight > 0; when no column declares `search`, every column is searchable at\n * weight 1. `null` when nothing is searchable. The values are read from the column cache, never\n * copied (§9.3 memory): a numeric column without `format` is stringified while matching, and the\n * case is folded per chunk while matching.\n */\nexport function* buildIndex(\n  ctx: RowModelContext,\n  config: MatchConfig,\n  useExSearch: boolean,\n): Generator<undefined, SearchIndex | null, undefined> {\n  const cols = resolveColumns(ctx.columns)\n  const declared = cols.list.some((c) => (c.def as { search?: unknown }).search !== undefined)\n  const keys: Key[] = []\n  const reads: Read[] = []\n  for (const col of cols.list) {\n    if (cols.byId.get(col.id) !== col) continue\n    const w = (col.def as { search?: unknown }).search\n    const weight = declared ? (typeof w === 'number' && w > 0 ? w : 0) : 1\n    if (weight === 0) continue\n    let read: Read | undefined\n    if (!col.format) {\n      const values = ctx.getColumnValues(col.id)\n      if (values instanceof Float64Array) read = numberReader(values)\n    }\n    if (!read) {\n      const formatted = ctx.getFormattedValues(col.id)\n      if (!formatted) continue\n      read = (r) => formatted[r] ?? ''\n    }\n    keys.push({ name: `c${keys.length}`, weight })\n    reads.push(read)\n    yield\n  }\n  if (keys.length === 0) return null\n  const fold = !config.caseSensitive\n  const at = (k: number, r: number) => {\n    const v = (reads[k] as Read)(r)\n    return fold ? v.toLowerCase() : v\n  }\n  return useExSearch\n    ? exSearchIndex(ctx.data.length, keys, at, config)\n    : containsIndex(keys, at, config)\n}\n\n/** Matches `rows` chunk by chunk (`score` decides alone, so chunks match like the whole). */\nfunction* chunked(\n  rows: Uint32Array,\n  matchChunk: (chunk: Uint32Array) => readonly Hit[],\n): Generator<undefined, Uint32Array, undefined> {\n  if (rows.length <= CHUNK) return rankHits(matchChunk(rows))\n  const hits: Hit[] = []\n  for (let k = 0; k < rows.length; k += CHUNK) {\n    for (const h of matchChunk(rows.subarray(k, k + CHUNK))) hits.push(h)\n    yield\n  }\n  return rankHits(hits)\n}\n\n/**\n * The projection as ex-search reads it: an array (iteration, `length`, index reads) of `{ i, c0, … }`\n * items, each built when read and not kept. It shows every row of `data` (`size`), or one chunk of\n * rows while that chunk is matched; ex-search holds this one view (`setData` once).\n */\nfunction projection(size: number, keys: readonly Key[], at: (k: number, r: number) => string) {\n  let rows: Uint32Array | undefined\n  // Never written, and its own `length` stays 0: `length` is read through the trap below (setting\n  // a large `length` would allocate a backing store).\n  const target: Item[] = []\n  const length = () => (rows ? rows.length : size)\n  const item = (j: number): Item => {\n    const r = rows ? (rows[j] as number) : j\n    const o = { i: r } as Record<string, string | number>\n    for (let k = 0; k < keys.length; k++) o[(keys[k] as Key).name] = at(k, r)\n    return o as Item\n  }\n  const items = new Proxy(target, {\n    get(t, p, receiver) {\n      if (p === 'length') return length()\n      const j = arrayIndex(p, length())\n      return j >= 0 ? item(j) : Reflect.get(t, p, receiver)\n    },\n    has: (t, p) => arrayIndex(p, length()) >= 0 || Reflect.has(t, p),\n  })\n  return {\n    items,\n    /** Shows `chunk` (row indices), or every row again (`undefined`). */\n    show(chunk: Uint32Array | undefined) {\n      rows = chunk\n    },\n  }\n}\n\nfunction exSearchIndex(\n  size: number,\n  keys: readonly Key[],\n  at: (k: number, r: number) => string,\n  config: MatchConfig,\n): SearchIndex {\n  // Values are folded per chunk when not case-sensitive (buildIndex), and so is the query below.\n  const engine = new ExSearch<Item>({\n    keys: keys.map((k) => ({ name: k.name, weight: k.weight })),\n    threshold: config.threshold,\n    fuzzyMaxDistance: config.fuzzyMaxDistance,\n    caseSensitive: true,\n    // DataKable re-ranks with exact scores and an index tie-break; tim keeps ex-search's own pass\n    // stable and avoids radix's score quantisation.\n    sortAlgorithm: 'tim',\n  })\n  const view = projection(size, keys, at)\n  engine.setData(view.items)\n  return {\n    match(rows, query) {\n      const q = config.caseSensitive ? query : query.toLowerCase()\n      return chunked(rows, (chunk) => {\n        view.show(chunk)\n        try {\n          // Results are copies of the items (`Omit<Item, …>` drops `i` from the type, not the value).\n          return engine.search(q) as unknown as readonly Hit[]\n        } finally {\n          view.show(undefined)\n        }\n      })\n    },\n  }\n}\n\n/** The fallback when ex-search is missing or incompatible: exact 1 · prefix 0.8 · substring 0.65. */\nfunction containsIndex(\n  keys: readonly Key[],\n  at: (k: number, r: number) => string,\n  config: MatchConfig,\n): SearchIndex {\n  return {\n    match(rows, query) {\n      // Values are folded per chunk (buildIndex).\n      const q = config.caseSensitive ? query : query.toLowerCase()\n      return chunked(rows, (chunk) => {\n        const hits: Hit[] = []\n        for (let j = 0; j < chunk.length; j++) {\n          const r = chunk[j] as number\n          let best = 0\n          for (let k = 0; k < keys.length; k++) {\n            const v = at(k, r)\n            const raw = v === q ? 1 : v.startsWith(q) ? 0.8 : v.includes(q) ? 0.65 : 0\n            const w = (keys[k] as Key).weight\n            if (raw * w > best) best = raw * w\n          }\n          if (best > 0 && best >= config.threshold) hits.push({ i: r, score: best })\n        }\n        return hits\n      })\n    },\n  }\n}\n\n/**\n * Hits in relevance order (§6.3): score descending, ties by original row index. Enforced here so\n * the order never depends on the matcher's own ranking.\n */\nexport function rankHits(hits: readonly Hit[]): Uint32Array {\n  const n = hits.length\n  const index = new Uint32Array(n)\n  const score = new Float64Array(n)\n  const order = new Uint32Array(n)\n  for (let k = 0; k < n; k++) {\n    const h = hits[k] as Hit\n    index[k] = h.i\n    score[k] = h.score\n    order[k] = k\n  }\n  order.sort(\n    (a, b) =>\n      (score[b] as number) - (score[a] as number) || (index[a] as number) - (index[b] as number),\n  )\n  const out = new Uint32Array(n)\n  for (let k = 0; k < n; k++) out[k] = index[order[k] as number] as number\n  return out\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uBAAyB;AAGzB,qBAA+B;AAC/B,iBAA2B;AAC3B,wBAAgD;AAiChD,IAAM,QAAQ;AAUd,IAAM,cAAc,MAClB,OAAO,8BAAa,cACpB,OAAO,0BAAS,UAAU,WAAW,cACrC,OAAO,0BAAS,UAAU,YAAY;AAGjC,SAAS,cAAc,MAAqB;AAEjD,SAAQ,QAAQ,IAAI,aAAa,mBAC7B;AAAA,IACE;AAAA,IACA;AAAA,MACE,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,UAAU;AAAA,IACZ;AAAA,IACA;AAAA,EACF,QACA,iCAAc,WAAW;AAC/B;AAOA,SAAS,aAAa,QAAwC;AAC5D,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,KAAI,OAAO,MAAM,OAAO,CAAC,CAAC,EAAG,QAAO;AAC5E,SAAO,CAAC,MAAM,OAAO,OAAO,CAAC,CAAC;AAChC;AAUO,UAAU,WACf,KACA,QACA,aACqD;AACrD,QAAM,WAAO,+BAAe,IAAI,OAAO;AACvC,QAAM,WAAW,KAAK,KAAK,KAAK,CAAC,MAAO,EAAE,IAA6B,WAAW,MAAS;AAC3F,QAAM,OAAc,CAAC;AACrB,QAAM,QAAgB,CAAC;AACvB,aAAW,OAAO,KAAK,MAAM;AAC3B,QAAI,KAAK,KAAK,IAAI,IAAI,EAAE,MAAM,IAAK;AACnC,UAAM,IAAK,IAAI,IAA6B;AAC5C,UAAM,SAAS,WAAY,OAAO,MAAM,YAAY,IAAI,IAAI,IAAI,IAAK;AACrE,QAAI,WAAW,EAAG;AAClB,QAAI;AACJ,QAAI,CAAC,IAAI,QAAQ;AACf,YAAM,SAAS,IAAI,gBAAgB,IAAI,EAAE;AACzC,UAAI,kBAAkB,aAAc,QAAO,aAAa,MAAM;AAAA,IAChE;AACA,QAAI,CAAC,MAAM;AACT,YAAM,YAAY,IAAI,mBAAmB,IAAI,EAAE;AAC/C,UAAI,CAAC,UAAW;AAChB,aAAO,CAAC,MAAM,UAAU,CAAC,KAAK;AAAA,IAChC;AACA,SAAK,KAAK,EAAE,MAAM,IAAI,KAAK,MAAM,IAAI,OAAO,CAAC;AAC7C,UAAM,KAAK,IAAI;AACf;AAAA,EACF;AACA,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,OAAO,CAAC,OAAO;AACrB,QAAM,KAAK,CAAC,GAAW,MAAc;AACnC,UAAM,IAAK,MAAM,CAAC,EAAW,CAAC;AAC9B,WAAO,OAAO,EAAE,YAAY,IAAI;AAAA,EAClC;AACA,SAAO,cACH,cAAc,IAAI,KAAK,QAAQ,MAAM,IAAI,MAAM,IAC/C,cAAc,MAAM,IAAI,MAAM;AACpC;AAGA,UAAU,QACR,MACA,YAC8C;AAC9C,MAAI,KAAK,UAAU,MAAO,QAAO,SAAS,WAAW,IAAI,CAAC;AAC1D,QAAM,OAAc,CAAC;AACrB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,OAAO;AAC3C,eAAW,KAAK,WAAW,KAAK,SAAS,GAAG,IAAI,KAAK,CAAC,EAAG,MAAK,KAAK,CAAC;AACpE;AAAA,EACF;AACA,SAAO,SAAS,IAAI;AACtB;AAOA,SAAS,WAAW,MAAc,MAAsB,IAAsC;AAC5F,MAAI;AAGJ,QAAM,SAAiB,CAAC;AACxB,QAAM,SAAS,MAAO,OAAO,KAAK,SAAS;AAC3C,QAAM,OAAO,CAAC,MAAoB;AAChC,UAAM,IAAI,OAAQ,KAAK,CAAC,IAAe;AACvC,UAAM,IAAI,EAAE,GAAG,EAAE;AACjB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,GAAG,KAAK,CAAC,EAAU,IAAI,IAAI,GAAG,GAAG,CAAC;AACxE,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,IAAI,MAAM,QAAQ;AAAA,IAC9B,IAAI,GAAG,GAAG,UAAU;AAClB,UAAI,MAAM,SAAU,QAAO,OAAO;AAClC,YAAM,QAAI,uBAAW,GAAG,OAAO,CAAC;AAChC,aAAO,KAAK,IAAI,KAAK,CAAC,IAAI,QAAQ,IAAI,GAAG,GAAG,QAAQ;AAAA,IACtD;AAAA,IACA,KAAK,CAAC,GAAG,UAAM,uBAAW,GAAG,OAAO,CAAC,KAAK,KAAK,QAAQ,IAAI,GAAG,CAAC;AAAA,EACjE,CAAC;AACD,SAAO;AAAA,IACL;AAAA;AAAA,IAEA,KAAK,OAAgC;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,cACP,MACA,MACA,IACA,QACa;AAEb,QAAM,SAAS,IAAI,0BAAe;AAAA,IAChC,MAAM,KAAK,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,EAAE,OAAO,EAAE;AAAA,IAC1D,WAAW,OAAO;AAAA,IAClB,kBAAkB,OAAO;AAAA,IACzB,eAAe;AAAA;AAAA;AAAA,IAGf,eAAe;AAAA,EACjB,CAAC;AACD,QAAM,OAAO,WAAW,MAAM,MAAM,EAAE;AACtC,SAAO,QAAQ,KAAK,KAAK;AACzB,SAAO;AAAA,IACL,MAAM,MAAM,OAAO;AACjB,YAAM,IAAI,OAAO,gBAAgB,QAAQ,MAAM,YAAY;AAC3D,aAAO,QAAQ,MAAM,CAAC,UAAU;AAC9B,aAAK,KAAK,KAAK;AACf,YAAI;AAEF,iBAAO,OAAO,OAAO,CAAC;AAAA,QACxB,UAAE;AACA,eAAK,KAAK,MAAS;AAAA,QACrB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAGA,SAAS,cACP,MACA,IACA,QACa;AACb,SAAO;AAAA,IACL,MAAM,MAAM,OAAO;AAEjB,YAAM,IAAI,OAAO,gBAAgB,QAAQ,MAAM,YAAY;AAC3D,aAAO,QAAQ,MAAM,CAAC,UAAU;AAC9B,cAAM,OAAc,CAAC;AACrB,iBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,gBAAM,IAAI,MAAM,CAAC;AACjB,cAAI,OAAO;AACX,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,kBAAM,IAAI,GAAG,GAAG,CAAC;AACjB,kBAAM,MAAM,MAAM,IAAI,IAAI,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE,SAAS,CAAC,IAAI,OAAO;AACzE,kBAAM,IAAK,KAAK,CAAC,EAAU;AAC3B,gBAAI,MAAM,IAAI,KAAM,QAAO,MAAM;AAAA,UACnC;AACA,cAAI,OAAO,KAAK,QAAQ,OAAO,UAAW,MAAK,KAAK,EAAE,GAAG,GAAG,OAAO,KAAK,CAAC;AAAA,QAC3E;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAMO,SAAS,SAAS,MAAmC;AAC1D,QAAM,IAAI,KAAK;AACf,QAAM,QAAQ,IAAI,YAAY,CAAC;AAC/B,QAAM,QAAQ,IAAI,aAAa,CAAC;AAChC,QAAM,QAAQ,IAAI,YAAY,CAAC;AAC/B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,IAAI,KAAK,CAAC;AAChB,UAAM,CAAC,IAAI,EAAE;AACb,UAAM,CAAC,IAAI,EAAE;AACb,UAAM,CAAC,IAAI;AAAA,EACb;AACA,QAAM;AAAA,IACJ,CAAC,GAAG,MACD,MAAM,CAAC,IAAgB,MAAM,CAAC,KAAiB,MAAM,CAAC,IAAgB,MAAM,CAAC;AAAA,EAClF;AACA,QAAM,MAAM,IAAI,YAAY,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,KAAI,CAAC,IAAI,MAAM,MAAM,CAAC,CAAW;AAC7D,SAAO;AACT;","names":[]}
+{"version":3,"sources":["../../../src/features/search/search-index.ts"],"sourcesContent":["import { ExSearch, Scorer } from 'ex-search'\nimport { getValue } from '../../column/get-value'\nimport '../../diagnostics/process-guard'\nimport type { Emit } from '../../diagnostics/types'\nimport type { RowModelContext } from '../../feature/types'\nimport { nullishOf, type SlicedFormatting } from '../../pipeline/column-cache'\nimport { resolveColumns } from '../../pipeline/columns'\nimport { arrayIndex } from '../../pipeline/row'\nimport { detectCapability, hasCapability } from '../../versioning/capability'\n\n/** Matcher settings (the client options of `search()`, defaults applied). */\nexport interface MatchConfig {\n  readonly threshold: number\n  readonly fuzzyMaxDistance: number\n  readonly caseSensitive: boolean\n}\n\n/**\n * One projected row as ex-search reads it: `i` is the row index (results map back by it, never by\n * identity: ex-search returns copies), `c0`, `c1`, … the formatted values of the searchable\n * columns. Flat keys also sidestep ex-search's top-level-key limitation for nested paths. Items\n * are built per chunk while matching and dropped after it (§9.3 memory): none is kept.\n */\nexport type Item = Record<string, string | number> & { readonly i: number }\n\n/** A match: the row index and its relevance (0–1, weight applied). */\nexport interface Hit {\n  readonly i: number\n  readonly score: number\n}\n\n/** The matcher of one (data, columns) pair: references to column values, no per-row copy. */\nexport interface SearchIndex {\n  /**\n   * A time-sliced job (§9.1) matching `query` (trimmed, non-blank) against the rows `rows` (row\n   * indices), in chunks: the hits in relevance order ({@link rankHits}).\n   */\n  match(rows: Uint32Array, query: string): Generator<undefined, Uint32Array, undefined>\n}\n\n/** Rows per chunk between two `yield`s of a scan (one value per row). */\nconst CHUNK = 4096\n\n/**\n * Cells (rows × searchable columns) matched per chunk between two `yield`s (#40): a table with\n * many searchable columns matches fewer rows per chunk, so a chunk stays a few milliseconds.\n */\nconst CELLS = 16_384\n\ninterface Key {\n  readonly name: string\n  readonly weight: number\n}\n\n/** The formatted value of row `r` of one searchable column. */\ntype Read = (r: number) => string\n\n// A throw (no `ExSearch`) counts as missing (hasCapability).\nconst hasExSearch = () =>\n  [ExSearch.prototype.search, ExSearch.prototype.setData, Scorer.fuzzy].every(\n    (f) => typeof f === 'function',\n  )\n\n/** Feature-detects ex-search once (§8.5); `false` → the contains fallback. */\nexport function probeExSearch(emit: Emit): boolean {\n  // DK_DEP_INCOMPATIBLE is a development check (§8.5); the fallback is not.\n  return (process.env.NODE_ENV !== \"production\")\n    ? detectCapability(\n        hasExSearch,\n        {\n          feature: 'search',\n          dependency: 'ex-search',\n          capability: 'ExSearch, Scorer.fuzzy',\n          supported: '^1.1.1',\n          fallback: 'case-insensitive exact / prefix / substring matching (no fuzzy matching)',\n        },\n        emit,\n      )\n    : hasCapability(hasExSearch)\n}\n\n/**\n * A numeric column's formatted value without cached strings (#27): what the default formatter\n * shows, `String(v)`, or `''` for a `null` / `undefined` cell (stored as `NaN`, like a real `NaN`,\n * which shows `'NaN'`).\n */\nfunction numberReader(values: Float64Array): Read {\n  const nullish = nullishOf(values)\n  return (r) => {\n    const v = values[r] as number\n    return !Number.isNaN(v) ? String(v) : nullish?.[r] ? '' : 'NaN'\n  }\n}\n\n/**\n * One pass over a column's values (`get(r)` per row, time-sliced by `CHUNK` rows): their text as\n * the default formatter shows a primitive (`String(v)`, `''` when nullish), read while matching\n * (#27: no formatted copy per row). `false` at the first object or function (a `Date`, an array):\n * the column cache formats those. `undefined` when a read throws. The values are read in NFC (#30),\n * normalised here, never per keystroke: the rows whose value is not NFC (rare: NFD input from\n * macOS, Thai or Vietnamese keyboards) keep their NFC form in a sparse map. Only values with a code\n * unit from U+0300 (combining marks and up) can change.\n */\nfunction* scan(\n  size: number,\n  get: (r: number) => unknown,\n): Generator<undefined, Read | false | undefined, undefined> {\n  const over = new Map<number, string>()\n  try {\n    for (let r = 0; r < size; r++) {\n      const v = get(r)\n      if (v !== null && (typeof v === 'object' || typeof v === 'function')) return false\n      if (typeof v === 'string' && /[\\u0300-\\uffff]/.test(v)) {\n        const n = v.normalize('NFC')\n        if (n !== v) over.set(r, n)\n      }\n      if (r % CHUNK === CHUNK - 1) yield\n    }\n  } catch {\n    return undefined\n  }\n  const read: Read = (r) => {\n    const v = get(r)\n    return v === null || v === undefined ? '' : String(v)\n  }\n  return over.size ? (r) => over.get(r) ?? read(r) : read\n}\n\n/**\n * Builds the matcher over the formatted values of the searchable columns (what the user sees), once\n * per data + columns, as a time-sliced job (§9.1): one column read per slice. Searchable columns are\n * those with a `search` weight > 0. When no column declares `search`, the columns of primitives\n * (strings, numbers, booleans, nullable) are searchable at weight 1, and a column of dates, arrays\n * or other objects is not (#27: it would keep a formatted string per row; it opts in with a\n * weight; `DK_SEARCH_COLUMN_SKIPPED` in development). `null` when nothing is searchable. Nothing\n * is copied per row (§9.3 memory): a key column of primitives without `format` is read from the\n * rows and stringified while matching (no values array, #27); an accessor column of primitives\n * reads the column cache's values the same way; only a column with `format` or an opted-in object\n * column (dates, arrays) keeps its formatted strings in the column cache. A key column whose read\n * throws goes through the column cache too, which reports it. The case is folded per chunk while\n * matching.\n */\nexport function* buildIndex(\n  ctx: RowModelContext,\n  config: MatchConfig,\n  useExSearch: boolean,\n): Generator<undefined, SearchIndex | null, undefined> {\n  const cols = resolveColumns(ctx.columns)\n  const declared = cols.list.some((c) => (c.def as { search?: unknown }).search !== undefined)\n  const data = ctx.data\n  const n = data.length\n  const keys: Key[] = []\n  const reads: Read[] = []\n  for (const col of cols.list) {\n    if (cols.byId.get(col.id) !== col) continue\n    const w = (col.def as { search?: unknown }).search\n    const weight = declared ? (typeof w === 'number' && w > 0 ? w : 0) : 1\n    if (weight === 0) continue\n    const path = col.format ? undefined : col.path\n    let failed = false\n    const onError = () => {\n      failed = true\n    }\n    let read = path ? yield* scan(n, (r) => getValue(data[r], path, onError)) : undefined\n    if (failed || (read === false && declared)) read = undefined\n    if (read === undefined) {\n      const values = ctx.getColumnValues(col.id)\n      if (!values) continue\n      yield // reading a column is a task of its own (#40)\n      const numbers = values instanceof Float64Array\n      if (numbers && !col.format) read = numberReader(values)\n      else {\n        // Zero-config: a column of objects is not searched, `format` or not (#27).\n        const own =\n          numbers || (declared && col.format) ? undefined : yield* scan(n, (r) => values[r])\n        if (own === false && !declared) read = false\n        else if (own && !col.format) read = own\n        else {\n          // Time-sliced in a table run (#40): dates or a heavy `format` are not one long task.\n          const sliced = (ctx as RowModelContext & SlicedFormatting).formattedSliced\n          const formatted = sliced ? yield* sliced(col.id) : ctx.getFormattedValues(col.id)\n          if (!formatted) continue\n          read = yield* scan(n, (r) => formatted[r])\n        }\n      }\n    }\n    if (!read) {\n      if ((process.env.NODE_ENV !== \"production\") && read === false) {\n        ctx.emit('DK_SEARCH_COLUMN_SKIPPED', { column: col.id, index: col.index })\n      }\n      continue\n    }\n    keys.push({ name: `c${keys.length}`, weight })\n    reads.push(read)\n    yield\n  }\n  if (keys.length === 0) return null\n  // Values (NFC already) are folded per chunk while matching; the query is normalised as well, so\n  // NFC and NFD spellings match each other like in the `contains` filter (#30).\n  const fold = (v: string) => (config.caseSensitive ? v : v.toLowerCase())\n  const foldQuery = (q: string) => fold(q.normalize('NFC'))\n  const at = (k: number, r: number) => fold((reads[k] as Read)(r))\n  return useExSearch\n    ? exSearchIndex(ctx.data.length, keys, at, foldQuery, config)\n    : containsIndex(keys, at, foldQuery, config)\n}\n\n/** Matches `rows` chunk by chunk (`score` decides alone, so chunks match like the whole). */\nfunction* chunked(\n  rows: Uint32Array,\n  columns: number,\n  matchChunk: (chunk: Uint32Array) => Hit[],\n): Generator<undefined, Uint32Array, undefined> {\n  const size = Math.max(256, Math.floor(CELLS / columns))\n  if (rows.length <= size) return rankHits(matchChunk(rows))\n  const hits: Hit[] = []\n  for (let k = 0; k < rows.length; k += size) {\n    for (const h of matchChunk(rows.subarray(k, k + size))) hits.push(h)\n    yield\n  }\n  return rankHits(hits)\n}\n\n/**\n * The projection as ex-search reads it: an array (iteration, `length`, index reads) of `{ i, c0, … }`\n * items, each built when read and not kept. It shows every row of `data` (`size`), or one chunk of\n * rows while that chunk is matched; ex-search holds this one view (`setData` once).\n */\nfunction projection(size: number, keys: readonly Key[], at: (k: number, r: number) => string) {\n  let rows: Uint32Array | undefined\n  // Never written, and its own `length` stays 0: `length` is read through the trap below (setting\n  // a large `length` would allocate a backing store).\n  const target: Item[] = []\n  const length = () => (rows ? rows.length : size)\n  const item = (j: number): Item => {\n    const r = rows ? (rows[j] as number) : j\n    const o = { i: r } as Record<string, string | number>\n    for (let k = 0; k < keys.length; k++) o[(keys[k] as Key).name] = at(k, r)\n    return o as Item\n  }\n  const items = new Proxy(target, {\n    get(t, p) {\n      if (p === 'length') return length()\n      const j = arrayIndex(p, length())\n      return j >= 0 ? item(j) : t[p as keyof Item[]]\n    },\n    has: (t, p) => arrayIndex(p, length()) >= 0 || p in t,\n  })\n  return {\n    items,\n    /** Shows `chunk` (row indices), or every row again (`undefined`). */\n    show(chunk: Uint32Array | undefined) {\n      rows = chunk\n    },\n  }\n}\n\nfunction exSearchIndex(\n  size: number,\n  keys: readonly Key[],\n  at: (k: number, r: number) => string,\n  fold: (v: string) => string,\n  config: MatchConfig,\n): SearchIndex {\n  // Values and query are folded already (buildIndex).\n  const engine = new ExSearch<Item>({\n    keys: keys as Key[],\n    ...config,\n    caseSensitive: true,\n    // DataKable re-ranks with exact scores and an index tie-break; tim keeps ex-search's own pass\n    // stable and avoids radix's score quantisation.\n    sortAlgorithm: 'tim',\n  })\n  // ex-search measures the edit distance to the whole value, so a typo of one word of a multi-word\n  // cell never matched (#10). For a one-word query, a value without it is shown as the best fuzzy\n  // match of itself and its words, or as '' (scores 0, as the value would). A value with the query\n  // stays whole for the exact / prefix / substring scores. Only strings within `max` of the query's\n  // length are measured (an edit distance is at least the length difference).\n  const max = config.fuzzyMaxDistance\n  let q = ''\n  const near = (k: number, r: number) => {\n    const v = at(k, r)\n    if (v.includes(q) || /\\s/.test(q)) return v\n    let best = ''\n    let top = 0\n    const words = v.split(/\\s+/)\n    for (const w of words[1] ? [v, ...words] : words) {\n      const s = Math.abs(w.length - q.length) > max ? 0 : Scorer.fuzzy(w, q, max, true)\n      if (s > top) {\n        best = w\n        top = s\n      }\n    }\n    return best\n  }\n  const view = projection(size, keys, near)\n  engine.setData(view.items)\n  return {\n    match(rows, query) {\n      const folded = fold(query)\n      return chunked(rows, keys.length, (chunk) => {\n        // Set per chunk, like the view: another job may have matched in between.\n        q = folded\n        view.show(chunk)\n        try {\n          // Results are copies of the items (`Omit<Item, …>` drops `i` from the type, not the value).\n          return engine.search(q) as unknown as Hit[]\n        } finally {\n          view.show(undefined)\n        }\n      })\n    },\n  }\n}\n\n/** The fallback when ex-search is missing or incompatible: exact 1 · prefix 0.8 · substring 0.65. */\nfunction containsIndex(\n  keys: readonly Key[],\n  at: (k: number, r: number) => string,\n  fold: (v: string) => string,\n  config: MatchConfig,\n): SearchIndex {\n  return {\n    match(rows, query) {\n      const q = fold(query)\n      return chunked(rows, keys.length, (chunk) => {\n        const hits: Hit[] = []\n        for (let j = 0; j < chunk.length; j++) {\n          const r = chunk[j] as number\n          let best = 0\n          for (let k = 0; k < keys.length; k++) {\n            const v = at(k, r)\n            const raw = v === q ? 1 : v.startsWith(q) ? 0.8 : v.includes(q) ? 0.65 : 0\n            const w = (keys[k] as Key).weight\n            if (raw * w > best) best = raw * w\n          }\n          if (best > 0 && best >= config.threshold) hits.push({ i: r, score: best })\n        }\n        return hits\n      })\n    },\n  }\n}\n\n/**\n * Hits in relevance order (§6.3): score descending, ties by original row index. Enforced here so\n * the order never depends on the matcher's own ranking. Sorts `hits` (a fresh array) in place.\n */\nexport function rankHits(hits: Hit[]): Uint32Array {\n  return Uint32Array.from(\n    hits.sort((a, b) => b.score - a.score || a.i - b.i),\n    (h) => h.i,\n  )\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uBAAiC;AACjC,uBAAyB;AACzB,2BAAO;AAGP,0BAAiD;AACjD,qBAA+B;AAC/B,iBAA2B;AAC3B,wBAAgD;AAiChD,IAAM,QAAQ;AAMd,IAAM,QAAQ;AAWd,IAAM,cAAc,MAClB,CAAC,0BAAS,UAAU,QAAQ,0BAAS,UAAU,SAAS,wBAAO,KAAK,EAAE;AAAA,EACpE,CAAC,MAAM,OAAO,MAAM;AACtB;AAGK,SAAS,cAAc,MAAqB;AAEjD,SAAQ,QAAQ,IAAI,aAAa,mBAC7B;AAAA,IACE;AAAA,IACA;AAAA,MACE,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,UAAU;AAAA,IACZ;AAAA,IACA;AAAA,EACF,QACA,iCAAc,WAAW;AAC/B;AAOA,SAAS,aAAa,QAA4B;AAChD,QAAM,cAAU,+BAAU,MAAM;AAChC,SAAO,CAAC,MAAM;AACZ,UAAM,IAAI,OAAO,CAAC;AAClB,WAAO,CAAC,OAAO,MAAM,CAAC,IAAI,OAAO,CAAC,IAAI,UAAU,CAAC,IAAI,KAAK;AAAA,EAC5D;AACF;AAWA,UAAU,KACR,MACA,KAC2D;AAC3D,QAAM,OAAO,oBAAI,IAAoB;AACrC,MAAI;AACF,aAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAM,IAAI,IAAI,CAAC;AACf,UAAI,MAAM,SAAS,OAAO,MAAM,YAAY,OAAO,MAAM,YAAa,QAAO;AAC7E,UAAI,OAAO,MAAM,YAAY,kBAAkB,KAAK,CAAC,GAAG;AACtD,cAAM,IAAI,EAAE,UAAU,KAAK;AAC3B,YAAI,MAAM,EAAG,MAAK,IAAI,GAAG,CAAC;AAAA,MAC5B;AACA,UAAI,IAAI,UAAU,QAAQ,EAAG;AAAA,IAC/B;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACA,QAAM,OAAa,CAAC,MAAM;AACxB,UAAM,IAAI,IAAI,CAAC;AACf,WAAO,MAAM,QAAQ,MAAM,SAAY,KAAK,OAAO,CAAC;AAAA,EACtD;AACA,SAAO,KAAK,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI;AACrD;AAgBO,UAAU,WACf,KACA,QACA,aACqD;AACrD,QAAM,WAAO,+BAAe,IAAI,OAAO;AACvC,QAAM,WAAW,KAAK,KAAK,KAAK,CAAC,MAAO,EAAE,IAA6B,WAAW,MAAS;AAC3F,QAAM,OAAO,IAAI;AACjB,QAAM,IAAI,KAAK;AACf,QAAM,OAAc,CAAC;AACrB,QAAM,QAAgB,CAAC;AACvB,aAAW,OAAO,KAAK,MAAM;AAC3B,QAAI,KAAK,KAAK,IAAI,IAAI,EAAE,MAAM,IAAK;AACnC,UAAM,IAAK,IAAI,IAA6B;AAC5C,UAAM,SAAS,WAAY,OAAO,MAAM,YAAY,IAAI,IAAI,IAAI,IAAK;AACrE,QAAI,WAAW,EAAG;AAClB,UAAM,OAAO,IAAI,SAAS,SAAY,IAAI;AAC1C,QAAI,SAAS;AACb,UAAM,UAAU,MAAM;AACpB,eAAS;AAAA,IACX;AACA,QAAI,OAAO,OAAO,OAAO,KAAK,GAAG,CAAC,UAAM,2BAAS,KAAK,CAAC,GAAG,MAAM,OAAO,CAAC,IAAI;AAC5E,QAAI,UAAW,SAAS,SAAS,SAAW,QAAO;AACnD,QAAI,SAAS,QAAW;AACtB,YAAM,SAAS,IAAI,gBAAgB,IAAI,EAAE;AACzC,UAAI,CAAC,OAAQ;AACb;AACA,YAAM,UAAU,kBAAkB;AAClC,UAAI,WAAW,CAAC,IAAI,OAAQ,QAAO,aAAa,MAAM;AAAA,WACjD;AAEH,cAAM,MACJ,WAAY,YAAY,IAAI,SAAU,SAAY,OAAO,KAAK,GAAG,CAAC,MAAM,OAAO,CAAC,CAAC;AACnF,YAAI,QAAQ,SAAS,CAAC,SAAU,QAAO;AAAA,iBAC9B,OAAO,CAAC,IAAI,OAAQ,QAAO;AAAA,aAC/B;AAEH,gBAAM,SAAU,IAA2C;AAC3D,gBAAM,YAAY,SAAS,OAAO,OAAO,IAAI,EAAE,IAAI,IAAI,mBAAmB,IAAI,EAAE;AAChF,cAAI,CAAC,UAAW;AAChB,iBAAO,OAAO,KAAK,GAAG,CAAC,MAAM,UAAU,CAAC,CAAC;AAAA,QAC3C;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,MAAM;AACT,UAAK,QAAQ,IAAI,aAAa,gBAAiB,SAAS,OAAO;AAC7D,YAAI,KAAK,4BAA4B,EAAE,QAAQ,IAAI,IAAI,OAAO,IAAI,MAAM,CAAC;AAAA,MAC3E;AACA;AAAA,IACF;AACA,SAAK,KAAK,EAAE,MAAM,IAAI,KAAK,MAAM,IAAI,OAAO,CAAC;AAC7C,UAAM,KAAK,IAAI;AACf;AAAA,EACF;AACA,MAAI,KAAK,WAAW,EAAG,QAAO;AAG9B,QAAM,OAAO,CAAC,MAAe,OAAO,gBAAgB,IAAI,EAAE,YAAY;AACtE,QAAM,YAAY,CAAC,MAAc,KAAK,EAAE,UAAU,KAAK,CAAC;AACxD,QAAM,KAAK,CAAC,GAAW,MAAc,KAAM,MAAM,CAAC,EAAW,CAAC,CAAC;AAC/D,SAAO,cACH,cAAc,IAAI,KAAK,QAAQ,MAAM,IAAI,WAAW,MAAM,IAC1D,cAAc,MAAM,IAAI,WAAW,MAAM;AAC/C;AAGA,UAAU,QACR,MACA,SACA,YAC8C;AAC9C,QAAM,OAAO,KAAK,IAAI,KAAK,KAAK,MAAM,QAAQ,OAAO,CAAC;AACtD,MAAI,KAAK,UAAU,KAAM,QAAO,SAAS,WAAW,IAAI,CAAC;AACzD,QAAM,OAAc,CAAC;AACrB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,MAAM;AAC1C,eAAW,KAAK,WAAW,KAAK,SAAS,GAAG,IAAI,IAAI,CAAC,EAAG,MAAK,KAAK,CAAC;AACnE;AAAA,EACF;AACA,SAAO,SAAS,IAAI;AACtB;AAOA,SAAS,WAAW,MAAc,MAAsB,IAAsC;AAC5F,MAAI;AAGJ,QAAM,SAAiB,CAAC;AACxB,QAAM,SAAS,MAAO,OAAO,KAAK,SAAS;AAC3C,QAAM,OAAO,CAAC,MAAoB;AAChC,UAAM,IAAI,OAAQ,KAAK,CAAC,IAAe;AACvC,UAAM,IAAI,EAAE,GAAG,EAAE;AACjB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,GAAG,KAAK,CAAC,EAAU,IAAI,IAAI,GAAG,GAAG,CAAC;AACxE,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,IAAI,MAAM,QAAQ;AAAA,IAC9B,IAAI,GAAG,GAAG;AACR,UAAI,MAAM,SAAU,QAAO,OAAO;AAClC,YAAM,QAAI,uBAAW,GAAG,OAAO,CAAC;AAChC,aAAO,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,CAAiB;AAAA,IAC/C;AAAA,IACA,KAAK,CAAC,GAAG,UAAM,uBAAW,GAAG,OAAO,CAAC,KAAK,KAAK,KAAK;AAAA,EACtD,CAAC;AACD,SAAO;AAAA,IACL;AAAA;AAAA,IAEA,KAAK,OAAgC;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,cACP,MACA,MACA,IACA,MACA,QACa;AAEb,QAAM,SAAS,IAAI,0BAAe;AAAA,IAChC;AAAA,IACA,GAAG;AAAA,IACH,eAAe;AAAA;AAAA;AAAA,IAGf,eAAe;AAAA,EACjB,CAAC;AAMD,QAAM,MAAM,OAAO;AACnB,MAAI,IAAI;AACR,QAAM,OAAO,CAAC,GAAW,MAAc;AACrC,UAAM,IAAI,GAAG,GAAG,CAAC;AACjB,QAAI,EAAE,SAAS,CAAC,KAAK,KAAK,KAAK,CAAC,EAAG,QAAO;AAC1C,QAAI,OAAO;AACX,QAAI,MAAM;AACV,UAAM,QAAQ,EAAE,MAAM,KAAK;AAC3B,eAAW,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,IAAI,OAAO;AAChD,YAAM,IAAI,KAAK,IAAI,EAAE,SAAS,EAAE,MAAM,IAAI,MAAM,IAAI,wBAAO,MAAM,GAAG,GAAG,KAAK,IAAI;AAChF,UAAI,IAAI,KAAK;AACX,eAAO;AACP,cAAM;AAAA,MACR;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,QAAM,OAAO,WAAW,MAAM,MAAM,IAAI;AACxC,SAAO,QAAQ,KAAK,KAAK;AACzB,SAAO;AAAA,IACL,MAAM,MAAM,OAAO;AACjB,YAAM,SAAS,KAAK,KAAK;AACzB,aAAO,QAAQ,MAAM,KAAK,QAAQ,CAAC,UAAU;AAE3C,YAAI;AACJ,aAAK,KAAK,KAAK;AACf,YAAI;AAEF,iBAAO,OAAO,OAAO,CAAC;AAAA,QACxB,UAAE;AACA,eAAK,KAAK,MAAS;AAAA,QACrB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAGA,SAAS,cACP,MACA,IACA,MACA,QACa;AACb,SAAO;AAAA,IACL,MAAM,MAAM,OAAO;AACjB,YAAM,IAAI,KAAK,KAAK;AACpB,aAAO,QAAQ,MAAM,KAAK,QAAQ,CAAC,UAAU;AAC3C,cAAM,OAAc,CAAC;AACrB,iBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,gBAAM,IAAI,MAAM,CAAC;AACjB,cAAI,OAAO;AACX,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,kBAAM,IAAI,GAAG,GAAG,CAAC;AACjB,kBAAM,MAAM,MAAM,IAAI,IAAI,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE,SAAS,CAAC,IAAI,OAAO;AACzE,kBAAM,IAAK,KAAK,CAAC,EAAU;AAC3B,gBAAI,MAAM,IAAI,KAAM,QAAO,MAAM;AAAA,UACnC;AACA,cAAI,OAAO,KAAK,QAAQ,OAAO,UAAW,MAAK,KAAK,EAAE,GAAG,GAAG,OAAO,KAAK,CAAC;AAAA,QAC3E;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAMO,SAAS,SAAS,MAA0B;AACjD,SAAO,YAAY;AAAA,IACjB,KAAK,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AAAA,IAClD,CAAC,MAAM,EAAE;AAAA,EACX;AACF;","names":[]}

package/dist/features/search/search-index.js

@@ -1,17 +1,23 @@
 // src/features/search/search-index.ts
-import { ExSearch } from "ex-search";
+import { ExSearch, Scorer } from "ex-search";
+import { getValue } from "../../column/get-value.js";
+import "../../diagnostics/process-guard.js";
+import { nullishOf } from "../../pipeline/column-cache.js";
 import { resolveColumns } from "../../pipeline/columns.js";
 import { arrayIndex } from "../../pipeline/row.js";
 import { detectCapability, hasCapability } from "../../versioning/capability.js";
 var CHUNK = 4096;
-var hasExSearch = () => typeof ExSearch === "function" && typeof ExSearch.prototype.search === "function" && typeof ExSearch.prototype.setData === "function";
+var CELLS = 16384;
+var hasExSearch = () => [ExSearch.prototype.search, ExSearch.prototype.setData, Scorer.fuzzy].every(
+  (f) => typeof f === "function"
+);
 function probeExSearch(emit) {
   return process.env.NODE_ENV !== "production" ? detectCapability(
     hasExSearch,
     {
       feature: "search",
       dependency: "ex-search",
-      capability: "ExSearch",
+      capability: "ExSearch, Scorer.fuzzy",
       supported: "^1.1.1",
       fallback: "case-insensitive exact / prefix / substring matching (no fuzzy matching)"
     },
@@ -19,12 +25,38 @@ function probeExSearch(emit) {
   ) : hasCapability(hasExSearch);
 }
 function numberReader(values) {
-  for (let r = 0; r < values.length; r++) if (Number.isNaN(values[r])) return void 0;
-  return (r) => String(values[r]);
+  const nullish = nullishOf(values);
+  return (r) => {
+    const v = values[r];
+    return !Number.isNaN(v) ? String(v) : nullish?.[r] ? "" : "NaN";
+  };
+}
+function* scan(size, get) {
+  const over = /* @__PURE__ */ new Map();
+  try {
+    for (let r = 0; r < size; r++) {
+      const v = get(r);
+      if (v !== null && (typeof v === "object" || typeof v === "function")) return false;
+      if (typeof v === "string" && /[\u0300-\uffff]/.test(v)) {
+        const n = v.normalize("NFC");
+        if (n !== v) over.set(r, n);
+      }
+      if (r % CHUNK === CHUNK - 1) yield;
+    }
+  } catch {
+    return void 0;
+  }
+  const read = (r) => {
+    const v = get(r);
+    return v === null || v === void 0 ? "" : String(v);
+  };
+  return over.size ? (r) => over.get(r) ?? read(r) : read;
 }
 function* buildIndex(ctx, config, useExSearch) {
   const cols = resolveColumns(ctx.columns);
   const declared = cols.list.some((c) => c.def.search !== void 0);
+  const data = ctx.data;
+  const n = data.length;
   const keys = [];
   const reads = [];
   for (const col of cols.list) {
@@ -32,33 +64,53 @@ function* buildIndex(ctx, config, useExSearch) {
     const w = col.def.search;
     const weight = declared ? typeof w === "number" && w > 0 ? w : 0 : 1;
     if (weight === 0) continue;
-    let read;
-    if (!col.format) {
+    const path = col.format ? void 0 : col.path;
+    let failed = false;
+    const onError = () => {
+      failed = true;
+    };
+    let read = path ? yield* scan(n, (r) => getValue(data[r], path, onError)) : void 0;
+    if (failed || read === false && declared) read = void 0;
+    if (read === void 0) {
       const values = ctx.getColumnValues(col.id);
-      if (values instanceof Float64Array) read = numberReader(values);
+      if (!values) continue;
+      yield;
+      const numbers = values instanceof Float64Array;
+      if (numbers && !col.format) read = numberReader(values);
+      else {
+        const own = numbers || declared && col.format ? void 0 : yield* scan(n, (r) => values[r]);
+        if (own === false && !declared) read = false;
+        else if (own && !col.format) read = own;
+        else {
+          const sliced = ctx.formattedSliced;
+          const formatted = sliced ? yield* sliced(col.id) : ctx.getFormattedValues(col.id);
+          if (!formatted) continue;
+          read = yield* scan(n, (r) => formatted[r]);
+        }
+      }
     }
     if (!read) {
-      const formatted = ctx.getFormattedValues(col.id);
-      if (!formatted) continue;
-      read = (r) => formatted[r] ?? "";
+      if (process.env.NODE_ENV !== "production" && read === false) {
+        ctx.emit("DK_SEARCH_COLUMN_SKIPPED", { column: col.id, index: col.index });
+      }
+      continue;
     }
     keys.push({ name: `c${keys.length}`, weight });
     reads.push(read);
     yield;
   }
   if (keys.length === 0) return null;
-  const fold = !config.caseSensitive;
-  const at = (k, r) => {
-    const v = reads[k](r);
-    return fold ? v.toLowerCase() : v;
-  };
-  return useExSearch ? exSearchIndex(ctx.data.length, keys, at, config) : containsIndex(keys, at, config);
+  const fold = (v) => config.caseSensitive ? v : v.toLowerCase();
+  const foldQuery = (q) => fold(q.normalize("NFC"));
+  const at = (k, r) => fold(reads[k](r));
+  return useExSearch ? exSearchIndex(ctx.data.length, keys, at, foldQuery, config) : containsIndex(keys, at, foldQuery, config);
 }
-function* chunked(rows, matchChunk) {
-  if (rows.length <= CHUNK) return rankHits(matchChunk(rows));
+function* chunked(rows, columns, matchChunk) {
+  const size = Math.max(256, Math.floor(CELLS / columns));
+  if (rows.length <= size) return rankHits(matchChunk(rows));
   const hits = [];
-  for (let k = 0; k < rows.length; k += CHUNK) {
-    for (const h of matchChunk(rows.subarray(k, k + CHUNK))) hits.push(h);
+  for (let k = 0; k < rows.length; k += size) {
+    for (const h of matchChunk(rows.subarray(k, k + size))) hits.push(h);
     yield;
   }
   return rankHits(hits);
@@ -74,12 +126,12 @@ function projection(size, keys, at) {
     return o;
   };
   const items = new Proxy(target, {
-    get(t, p, receiver) {
+    get(t, p) {
       if (p === "length") return length();
       const j = arrayIndex(p, length());
-      return j >= 0 ? item(j) : Reflect.get(t, p, receiver);
+      return j >= 0 ? item(j) : t[p];
     },
-    has: (t, p) => arrayIndex(p, length()) >= 0 || Reflect.has(t, p)
+    has: (t, p) => arrayIndex(p, length()) >= 0 || p in t
   });
   return {
     items,
@@ -89,22 +141,39 @@ function projection(size, keys, at) {
     }
   };
 }
-function exSearchIndex(size, keys, at, config) {
+function exSearchIndex(size, keys, at, fold, config) {
   const engine = new ExSearch({
-    keys: keys.map((k) => ({ name: k.name, weight: k.weight })),
-    threshold: config.threshold,
-    fuzzyMaxDistance: config.fuzzyMaxDistance,
+    keys,
+    ...config,
     caseSensitive: true,
     // DataKable re-ranks with exact scores and an index tie-break; tim keeps ex-search's own pass
     // stable and avoids radix's score quantisation.
     sortAlgorithm: "tim"
   });
-  const view = projection(size, keys, at);
+  const max = config.fuzzyMaxDistance;
+  let q = "";
+  const near = (k, r) => {
+    const v = at(k, r);
+    if (v.includes(q) || /\s/.test(q)) return v;
+    let best = "";
+    let top = 0;
+    const words = v.split(/\s+/);
+    for (const w of words[1] ? [v, ...words] : words) {
+      const s = Math.abs(w.length - q.length) > max ? 0 : Scorer.fuzzy(w, q, max, true);
+      if (s > top) {
+        best = w;
+        top = s;
+      }
+    }
+    return best;
+  };
+  const view = projection(size, keys, near);
   engine.setData(view.items);
   return {
     match(rows, query) {
-      const q = config.caseSensitive ? query : query.toLowerCase();
-      return chunked(rows, (chunk) => {
+      const folded = fold(query);
+      return chunked(rows, keys.length, (chunk) => {
+        q = folded;
         view.show(chunk);
         try {
           return engine.search(q);
@@ -115,11 +184,11 @@ function exSearchIndex(size, keys, at, config) {
     }
   };
 }
-function containsIndex(keys, at, config) {
+function containsIndex(keys, at, fold, config) {
   return {
     match(rows, query) {
-      const q = config.caseSensitive ? query : query.toLowerCase();
-      return chunked(rows, (chunk) => {
+      const q = fold(query);
+      return chunked(rows, keys.length, (chunk) => {
         const hits = [];
         for (let j = 0; j < chunk.length; j++) {
           const r = chunk[j];
@@ -138,22 +207,10 @@ function containsIndex(keys, at, config) {
   };
 }
 function rankHits(hits) {
-  const n = hits.length;
-  const index = new Uint32Array(n);
-  const score = new Float64Array(n);
-  const order = new Uint32Array(n);
-  for (let k = 0; k < n; k++) {
-    const h = hits[k];
-    index[k] = h.i;
-    score[k] = h.score;
-    order[k] = k;
-  }
-  order.sort(
-    (a, b) => score[b] - score[a] || index[a] - index[b]
+  return Uint32Array.from(
+    hits.sort((a, b) => b.score - a.score || a.i - b.i),
+    (h) => h.i
   );
-  const out = new Uint32Array(n);
-  for (let k = 0; k < n; k++) out[k] = index[order[k]];
-  return out;
 }
 export {
   buildIndex,

package/dist/features/search/search-index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/features/search/search-index.ts"],"sourcesContent":["import { ExSearch } from 'ex-search'\nimport type { Emit } from '../../diagnostics/types'\nimport type { RowModelContext } from '../../feature/types'\nimport { resolveColumns } from '../../pipeline/columns'\nimport { arrayIndex } from '../../pipeline/row'\nimport { detectCapability, hasCapability } from '../../versioning/capability'\n\n/** Matcher settings (the client options of `search()`, defaults applied). */\nexport interface MatchConfig {\n  readonly threshold: number\n  readonly fuzzyMaxDistance: number\n  readonly caseSensitive: boolean\n}\n\n/**\n * One projected row as ex-search reads it: `i` is the row index (results map back by it, never by\n * identity: ex-search returns copies), `c0`, `c1`, … the formatted values of the searchable\n * columns. Flat keys also sidestep ex-search's top-level-key limitation for nested paths. Items\n * are built per chunk while matching and dropped after it (§9.3 memory): none is kept.\n */\nexport type Item = Record<string, string | number> & { readonly i: number }\n\n/** A match: the row index and its relevance (0–1, weight applied). */\nexport interface Hit {\n  readonly i: number\n  readonly score: number\n}\n\n/** The matcher of one (data, columns) pair: references to column values, no per-row copy. */\nexport interface SearchIndex {\n  /**\n   * A time-sliced job (§9.1) matching `query` (trimmed, non-blank) against the rows `rows` (row\n   * indices), in chunks: the hits in relevance order ({@link rankHits}).\n   */\n  match(rows: Uint32Array, query: string): Generator<undefined, Uint32Array, undefined>\n}\n\n/** Rows per chunk between two `yield`s of the matching job. */\nconst CHUNK = 4096\n\ninterface Key {\n  readonly name: string\n  readonly weight: number\n}\n\n/** The formatted value of row `r` of one searchable column. */\ntype Read = (r: number) => string\n\nconst hasExSearch = () =>\n  typeof ExSearch === 'function' &&\n  typeof ExSearch.prototype.search === 'function' &&\n  typeof ExSearch.prototype.setData === 'function'\n\n/** Feature-detects ex-search once (§8.5); `false` → the contains fallback. */\nexport function probeExSearch(emit: Emit): boolean {\n  // DK_DEP_INCOMPATIBLE is a development check (§8.5); the fallback is not.\n  return (process.env.NODE_ENV !== \"production\")\n    ? detectCapability(\n        hasExSearch,\n        {\n          feature: 'search',\n          dependency: 'ex-search',\n          capability: 'ExSearch',\n          supported: '^1.1.1',\n          fallback: 'case-insensitive exact / prefix / substring matching (no fuzzy matching)',\n        },\n        emit,\n      )\n    : hasCapability(hasExSearch)\n}\n\n/**\n * A numeric column's formatted value without the cached strings: `String(v)` is what the default\n * formatter shows for a number. Only when no value is `NaN` — a `NaN` cell is `null` / `undefined`\n * (shown as `''`) or a real `NaN` (shown as `'NaN'`), which only the formatted cache tells apart.\n */\nfunction numberReader(values: Float64Array): Read | undefined {\n  for (let r = 0; r < values.length; r++) if (Number.isNaN(values[r])) return undefined\n  return (r) => String(values[r])\n}\n\n/**\n * Builds the matcher over the formatted values of the searchable columns (what the user sees), once\n * per data + columns, as a time-sliced job (§9.1): one column read per slice. Searchable columns are\n * those with a `search` weight > 0; when no column declares `search`, every column is searchable at\n * weight 1. `null` when nothing is searchable. The values are read from the column cache, never\n * copied (§9.3 memory): a numeric column without `format` is stringified while matching, and the\n * case is folded per chunk while matching.\n */\nexport function* buildIndex(\n  ctx: RowModelContext,\n  config: MatchConfig,\n  useExSearch: boolean,\n): Generator<undefined, SearchIndex | null, undefined> {\n  const cols = resolveColumns(ctx.columns)\n  const declared = cols.list.some((c) => (c.def as { search?: unknown }).search !== undefined)\n  const keys: Key[] = []\n  const reads: Read[] = []\n  for (const col of cols.list) {\n    if (cols.byId.get(col.id) !== col) continue\n    const w = (col.def as { search?: unknown }).search\n    const weight = declared ? (typeof w === 'number' && w > 0 ? w : 0) : 1\n    if (weight === 0) continue\n    let read: Read | undefined\n    if (!col.format) {\n      const values = ctx.getColumnValues(col.id)\n      if (values instanceof Float64Array) read = numberReader(values)\n    }\n    if (!read) {\n      const formatted = ctx.getFormattedValues(col.id)\n      if (!formatted) continue\n      read = (r) => formatted[r] ?? ''\n    }\n    keys.push({ name: `c${keys.length}`, weight })\n    reads.push(read)\n    yield\n  }\n  if (keys.length === 0) return null\n  const fold = !config.caseSensitive\n  const at = (k: number, r: number) => {\n    const v = (reads[k] as Read)(r)\n    return fold ? v.toLowerCase() : v\n  }\n  return useExSearch\n    ? exSearchIndex(ctx.data.length, keys, at, config)\n    : containsIndex(keys, at, config)\n}\n\n/** Matches `rows` chunk by chunk (`score` decides alone, so chunks match like the whole). */\nfunction* chunked(\n  rows: Uint32Array,\n  matchChunk: (chunk: Uint32Array) => readonly Hit[],\n): Generator<undefined, Uint32Array, undefined> {\n  if (rows.length <= CHUNK) return rankHits(matchChunk(rows))\n  const hits: Hit[] = []\n  for (let k = 0; k < rows.length; k += CHUNK) {\n    for (const h of matchChunk(rows.subarray(k, k + CHUNK))) hits.push(h)\n    yield\n  }\n  return rankHits(hits)\n}\n\n/**\n * The projection as ex-search reads it: an array (iteration, `length`, index reads) of `{ i, c0, … }`\n * items, each built when read and not kept. It shows every row of `data` (`size`), or one chunk of\n * rows while that chunk is matched; ex-search holds this one view (`setData` once).\n */\nfunction projection(size: number, keys: readonly Key[], at: (k: number, r: number) => string) {\n  let rows: Uint32Array | undefined\n  // Never written, and its own `length` stays 0: `length` is read through the trap below (setting\n  // a large `length` would allocate a backing store).\n  const target: Item[] = []\n  const length = () => (rows ? rows.length : size)\n  const item = (j: number): Item => {\n    const r = rows ? (rows[j] as number) : j\n    const o = { i: r } as Record<string, string | number>\n    for (let k = 0; k < keys.length; k++) o[(keys[k] as Key).name] = at(k, r)\n    return o as Item\n  }\n  const items = new Proxy(target, {\n    get(t, p, receiver) {\n      if (p === 'length') return length()\n      const j = arrayIndex(p, length())\n      return j >= 0 ? item(j) : Reflect.get(t, p, receiver)\n    },\n    has: (t, p) => arrayIndex(p, length()) >= 0 || Reflect.has(t, p),\n  })\n  return {\n    items,\n    /** Shows `chunk` (row indices), or every row again (`undefined`). */\n    show(chunk: Uint32Array | undefined) {\n      rows = chunk\n    },\n  }\n}\n\nfunction exSearchIndex(\n  size: number,\n  keys: readonly Key[],\n  at: (k: number, r: number) => string,\n  config: MatchConfig,\n): SearchIndex {\n  // Values are folded per chunk when not case-sensitive (buildIndex), and so is the query below.\n  const engine = new ExSearch<Item>({\n    keys: keys.map((k) => ({ name: k.name, weight: k.weight })),\n    threshold: config.threshold,\n    fuzzyMaxDistance: config.fuzzyMaxDistance,\n    caseSensitive: true,\n    // DataKable re-ranks with exact scores and an index tie-break; tim keeps ex-search's own pass\n    // stable and avoids radix's score quantisation.\n    sortAlgorithm: 'tim',\n  })\n  const view = projection(size, keys, at)\n  engine.setData(view.items)\n  return {\n    match(rows, query) {\n      const q = config.caseSensitive ? query : query.toLowerCase()\n      return chunked(rows, (chunk) => {\n        view.show(chunk)\n        try {\n          // Results are copies of the items (`Omit<Item, …>` drops `i` from the type, not the value).\n          return engine.search(q) as unknown as readonly Hit[]\n        } finally {\n          view.show(undefined)\n        }\n      })\n    },\n  }\n}\n\n/** The fallback when ex-search is missing or incompatible: exact 1 · prefix 0.8 · substring 0.65. */\nfunction containsIndex(\n  keys: readonly Key[],\n  at: (k: number, r: number) => string,\n  config: MatchConfig,\n): SearchIndex {\n  return {\n    match(rows, query) {\n      // Values are folded per chunk (buildIndex).\n      const q = config.caseSensitive ? query : query.toLowerCase()\n      return chunked(rows, (chunk) => {\n        const hits: Hit[] = []\n        for (let j = 0; j < chunk.length; j++) {\n          const r = chunk[j] as number\n          let best = 0\n          for (let k = 0; k < keys.length; k++) {\n            const v = at(k, r)\n            const raw = v === q ? 1 : v.startsWith(q) ? 0.8 : v.includes(q) ? 0.65 : 0\n            const w = (keys[k] as Key).weight\n            if (raw * w > best) best = raw * w\n          }\n          if (best > 0 && best >= config.threshold) hits.push({ i: r, score: best })\n        }\n        return hits\n      })\n    },\n  }\n}\n\n/**\n * Hits in relevance order (§6.3): score descending, ties by original row index. Enforced here so\n * the order never depends on the matcher's own ranking.\n */\nexport function rankHits(hits: readonly Hit[]): Uint32Array {\n  const n = hits.length\n  const index = new Uint32Array(n)\n  const score = new Float64Array(n)\n  const order = new Uint32Array(n)\n  for (let k = 0; k < n; k++) {\n    const h = hits[k] as Hit\n    index[k] = h.i\n    score[k] = h.score\n    order[k] = k\n  }\n  order.sort(\n    (a, b) =>\n      (score[b] as number) - (score[a] as number) || (index[a] as number) - (index[b] as number),\n  )\n  const out = new Uint32Array(n)\n  for (let k = 0; k < n; k++) out[k] = index[order[k] as number] as number\n  return out\n}\n"],"mappings":";AAAA,SAAS,gBAAgB;AAGzB,SAAS,sBAAsB;AAC/B,SAAS,kBAAkB;AAC3B,SAAS,kBAAkB,qBAAqB;AAiChD,IAAM,QAAQ;AAUd,IAAM,cAAc,MAClB,OAAO,aAAa,cACpB,OAAO,SAAS,UAAU,WAAW,cACrC,OAAO,SAAS,UAAU,YAAY;AAGjC,SAAS,cAAc,MAAqB;AAEjD,SAAQ,QAAQ,IAAI,aAAa,eAC7B;AAAA,IACE;AAAA,IACA;AAAA,MACE,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,UAAU;AAAA,IACZ;AAAA,IACA;AAAA,EACF,IACA,cAAc,WAAW;AAC/B;AAOA,SAAS,aAAa,QAAwC;AAC5D,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,KAAI,OAAO,MAAM,OAAO,CAAC,CAAC,EAAG,QAAO;AAC5E,SAAO,CAAC,MAAM,OAAO,OAAO,CAAC,CAAC;AAChC;AAUO,UAAU,WACf,KACA,QACA,aACqD;AACrD,QAAM,OAAO,eAAe,IAAI,OAAO;AACvC,QAAM,WAAW,KAAK,KAAK,KAAK,CAAC,MAAO,EAAE,IAA6B,WAAW,MAAS;AAC3F,QAAM,OAAc,CAAC;AACrB,QAAM,QAAgB,CAAC;AACvB,aAAW,OAAO,KAAK,MAAM;AAC3B,QAAI,KAAK,KAAK,IAAI,IAAI,EAAE,MAAM,IAAK;AACnC,UAAM,IAAK,IAAI,IAA6B;AAC5C,UAAM,SAAS,WAAY,OAAO,MAAM,YAAY,IAAI,IAAI,IAAI,IAAK;AACrE,QAAI,WAAW,EAAG;AAClB,QAAI;AACJ,QAAI,CAAC,IAAI,QAAQ;AACf,YAAM,SAAS,IAAI,gBAAgB,IAAI,EAAE;AACzC,UAAI,kBAAkB,aAAc,QAAO,aAAa,MAAM;AAAA,IAChE;AACA,QAAI,CAAC,MAAM;AACT,YAAM,YAAY,IAAI,mBAAmB,IAAI,EAAE;AAC/C,UAAI,CAAC,UAAW;AAChB,aAAO,CAAC,MAAM,UAAU,CAAC,KAAK;AAAA,IAChC;AACA,SAAK,KAAK,EAAE,MAAM,IAAI,KAAK,MAAM,IAAI,OAAO,CAAC;AAC7C,UAAM,KAAK,IAAI;AACf;AAAA,EACF;AACA,MAAI,KAAK,WAAW,EAAG,QAAO;AAC9B,QAAM,OAAO,CAAC,OAAO;AACrB,QAAM,KAAK,CAAC,GAAW,MAAc;AACnC,UAAM,IAAK,MAAM,CAAC,EAAW,CAAC;AAC9B,WAAO,OAAO,EAAE,YAAY,IAAI;AAAA,EAClC;AACA,SAAO,cACH,cAAc,IAAI,KAAK,QAAQ,MAAM,IAAI,MAAM,IAC/C,cAAc,MAAM,IAAI,MAAM;AACpC;AAGA,UAAU,QACR,MACA,YAC8C;AAC9C,MAAI,KAAK,UAAU,MAAO,QAAO,SAAS,WAAW,IAAI,CAAC;AAC1D,QAAM,OAAc,CAAC;AACrB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,OAAO;AAC3C,eAAW,KAAK,WAAW,KAAK,SAAS,GAAG,IAAI,KAAK,CAAC,EAAG,MAAK,KAAK,CAAC;AACpE;AAAA,EACF;AACA,SAAO,SAAS,IAAI;AACtB;AAOA,SAAS,WAAW,MAAc,MAAsB,IAAsC;AAC5F,MAAI;AAGJ,QAAM,SAAiB,CAAC;AACxB,QAAM,SAAS,MAAO,OAAO,KAAK,SAAS;AAC3C,QAAM,OAAO,CAAC,MAAoB;AAChC,UAAM,IAAI,OAAQ,KAAK,CAAC,IAAe;AACvC,UAAM,IAAI,EAAE,GAAG,EAAE;AACjB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,GAAG,KAAK,CAAC,EAAU,IAAI,IAAI,GAAG,GAAG,CAAC;AACxE,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,IAAI,MAAM,QAAQ;AAAA,IAC9B,IAAI,GAAG,GAAG,UAAU;AAClB,UAAI,MAAM,SAAU,QAAO,OAAO;AAClC,YAAM,IAAI,WAAW,GAAG,OAAO,CAAC;AAChC,aAAO,KAAK,IAAI,KAAK,CAAC,IAAI,QAAQ,IAAI,GAAG,GAAG,QAAQ;AAAA,IACtD;AAAA,IACA,KAAK,CAAC,GAAG,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,KAAK,QAAQ,IAAI,GAAG,CAAC;AAAA,EACjE,CAAC;AACD,SAAO;AAAA,IACL;AAAA;AAAA,IAEA,KAAK,OAAgC;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,cACP,MACA,MACA,IACA,QACa;AAEb,QAAM,SAAS,IAAI,SAAe;AAAA,IAChC,MAAM,KAAK,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,EAAE,OAAO,EAAE;AAAA,IAC1D,WAAW,OAAO;AAAA,IAClB,kBAAkB,OAAO;AAAA,IACzB,eAAe;AAAA;AAAA;AAAA,IAGf,eAAe;AAAA,EACjB,CAAC;AACD,QAAM,OAAO,WAAW,MAAM,MAAM,EAAE;AACtC,SAAO,QAAQ,KAAK,KAAK;AACzB,SAAO;AAAA,IACL,MAAM,MAAM,OAAO;AACjB,YAAM,IAAI,OAAO,gBAAgB,QAAQ,MAAM,YAAY;AAC3D,aAAO,QAAQ,MAAM,CAAC,UAAU;AAC9B,aAAK,KAAK,KAAK;AACf,YAAI;AAEF,iBAAO,OAAO,OAAO,CAAC;AAAA,QACxB,UAAE;AACA,eAAK,KAAK,MAAS;AAAA,QACrB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAGA,SAAS,cACP,MACA,IACA,QACa;AACb,SAAO;AAAA,IACL,MAAM,MAAM,OAAO;AAEjB,YAAM,IAAI,OAAO,gBAAgB,QAAQ,MAAM,YAAY;AAC3D,aAAO,QAAQ,MAAM,CAAC,UAAU;AAC9B,cAAM,OAAc,CAAC;AACrB,iBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,gBAAM,IAAI,MAAM,CAAC;AACjB,cAAI,OAAO;AACX,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,kBAAM,IAAI,GAAG,GAAG,CAAC;AACjB,kBAAM,MAAM,MAAM,IAAI,IAAI,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE,SAAS,CAAC,IAAI,OAAO;AACzE,kBAAM,IAAK,KAAK,CAAC,EAAU;AAC3B,gBAAI,MAAM,IAAI,KAAM,QAAO,MAAM;AAAA,UACnC;AACA,cAAI,OAAO,KAAK,QAAQ,OAAO,UAAW,MAAK,KAAK,EAAE,GAAG,GAAG,OAAO,KAAK,CAAC;AAAA,QAC3E;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAMO,SAAS,SAAS,MAAmC;AAC1D,QAAM,IAAI,KAAK;AACf,QAAM,QAAQ,IAAI,YAAY,CAAC;AAC/B,QAAM,QAAQ,IAAI,aAAa,CAAC;AAChC,QAAM,QAAQ,IAAI,YAAY,CAAC;AAC/B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,IAAI,KAAK,CAAC;AAChB,UAAM,CAAC,IAAI,EAAE;AACb,UAAM,CAAC,IAAI,EAAE;AACb,UAAM,CAAC,IAAI;AAAA,EACb;AACA,QAAM;AAAA,IACJ,CAAC,GAAG,MACD,MAAM,CAAC,IAAgB,MAAM,CAAC,KAAiB,MAAM,CAAC,IAAgB,MAAM,CAAC;AAAA,EAClF;AACA,QAAM,MAAM,IAAI,YAAY,CAAC;AAC7B,WAAS,IAAI,GAAG,IAAI,GAAG,IAAK,KAAI,CAAC,IAAI,MAAM,MAAM,CAAC,CAAW;AAC7D,SAAO;AACT;","names":[]}
+{"version":3,"sources":["../../../src/features/search/search-index.ts"],"sourcesContent":["import { ExSearch, Scorer } from 'ex-search'\nimport { getValue } from '../../column/get-value'\nimport '../../diagnostics/process-guard'\nimport type { Emit } from '../../diagnostics/types'\nimport type { RowModelContext } from '../../feature/types'\nimport { nullishOf, type SlicedFormatting } from '../../pipeline/column-cache'\nimport { resolveColumns } from '../../pipeline/columns'\nimport { arrayIndex } from '../../pipeline/row'\nimport { detectCapability, hasCapability } from '../../versioning/capability'\n\n/** Matcher settings (the client options of `search()`, defaults applied). */\nexport interface MatchConfig {\n  readonly threshold: number\n  readonly fuzzyMaxDistance: number\n  readonly caseSensitive: boolean\n}\n\n/**\n * One projected row as ex-search reads it: `i` is the row index (results map back by it, never by\n * identity: ex-search returns copies), `c0`, `c1`, … the formatted values of the searchable\n * columns. Flat keys also sidestep ex-search's top-level-key limitation for nested paths. Items\n * are built per chunk while matching and dropped after it (§9.3 memory): none is kept.\n */\nexport type Item = Record<string, string | number> & { readonly i: number }\n\n/** A match: the row index and its relevance (0–1, weight applied). */\nexport interface Hit {\n  readonly i: number\n  readonly score: number\n}\n\n/** The matcher of one (data, columns) pair: references to column values, no per-row copy. */\nexport interface SearchIndex {\n  /**\n   * A time-sliced job (§9.1) matching `query` (trimmed, non-blank) against the rows `rows` (row\n   * indices), in chunks: the hits in relevance order ({@link rankHits}).\n   */\n  match(rows: Uint32Array, query: string): Generator<undefined, Uint32Array, undefined>\n}\n\n/** Rows per chunk between two `yield`s of a scan (one value per row). */\nconst CHUNK = 4096\n\n/**\n * Cells (rows × searchable columns) matched per chunk between two `yield`s (#40): a table with\n * many searchable columns matches fewer rows per chunk, so a chunk stays a few milliseconds.\n */\nconst CELLS = 16_384\n\ninterface Key {\n  readonly name: string\n  readonly weight: number\n}\n\n/** The formatted value of row `r` of one searchable column. */\ntype Read = (r: number) => string\n\n// A throw (no `ExSearch`) counts as missing (hasCapability).\nconst hasExSearch = () =>\n  [ExSearch.prototype.search, ExSearch.prototype.setData, Scorer.fuzzy].every(\n    (f) => typeof f === 'function',\n  )\n\n/** Feature-detects ex-search once (§8.5); `false` → the contains fallback. */\nexport function probeExSearch(emit: Emit): boolean {\n  // DK_DEP_INCOMPATIBLE is a development check (§8.5); the fallback is not.\n  return (process.env.NODE_ENV !== \"production\")\n    ? detectCapability(\n        hasExSearch,\n        {\n          feature: 'search',\n          dependency: 'ex-search',\n          capability: 'ExSearch, Scorer.fuzzy',\n          supported: '^1.1.1',\n          fallback: 'case-insensitive exact / prefix / substring matching (no fuzzy matching)',\n        },\n        emit,\n      )\n    : hasCapability(hasExSearch)\n}\n\n/**\n * A numeric column's formatted value without cached strings (#27): what the default formatter\n * shows, `String(v)`, or `''` for a `null` / `undefined` cell (stored as `NaN`, like a real `NaN`,\n * which shows `'NaN'`).\n */\nfunction numberReader(values: Float64Array): Read {\n  const nullish = nullishOf(values)\n  return (r) => {\n    const v = values[r] as number\n    return !Number.isNaN(v) ? String(v) : nullish?.[r] ? '' : 'NaN'\n  }\n}\n\n/**\n * One pass over a column's values (`get(r)` per row, time-sliced by `CHUNK` rows): their text as\n * the default formatter shows a primitive (`String(v)`, `''` when nullish), read while matching\n * (#27: no formatted copy per row). `false` at the first object or function (a `Date`, an array):\n * the column cache formats those. `undefined` when a read throws. The values are read in NFC (#30),\n * normalised here, never per keystroke: the rows whose value is not NFC (rare: NFD input from\n * macOS, Thai or Vietnamese keyboards) keep their NFC form in a sparse map. Only values with a code\n * unit from U+0300 (combining marks and up) can change.\n */\nfunction* scan(\n  size: number,\n  get: (r: number) => unknown,\n): Generator<undefined, Read | false | undefined, undefined> {\n  const over = new Map<number, string>()\n  try {\n    for (let r = 0; r < size; r++) {\n      const v = get(r)\n      if (v !== null && (typeof v === 'object' || typeof v === 'function')) return false\n      if (typeof v === 'string' && /[\\u0300-\\uffff]/.test(v)) {\n        const n = v.normalize('NFC')\n        if (n !== v) over.set(r, n)\n      }\n      if (r % CHUNK === CHUNK - 1) yield\n    }\n  } catch {\n    return undefined\n  }\n  const read: Read = (r) => {\n    const v = get(r)\n    return v === null || v === undefined ? '' : String(v)\n  }\n  return over.size ? (r) => over.get(r) ?? read(r) : read\n}\n\n/**\n * Builds the matcher over the formatted values of the searchable columns (what the user sees), once\n * per data + columns, as a time-sliced job (§9.1): one column read per slice. Searchable columns are\n * those with a `search` weight > 0. When no column declares `search`, the columns of primitives\n * (strings, numbers, booleans, nullable) are searchable at weight 1, and a column of dates, arrays\n * or other objects is not (#27: it would keep a formatted string per row; it opts in with a\n * weight; `DK_SEARCH_COLUMN_SKIPPED` in development). `null` when nothing is searchable. Nothing\n * is copied per row (§9.3 memory): a key column of primitives without `format` is read from the\n * rows and stringified while matching (no values array, #27); an accessor column of primitives\n * reads the column cache's values the same way; only a column with `format` or an opted-in object\n * column (dates, arrays) keeps its formatted strings in the column cache. A key column whose read\n * throws goes through the column cache too, which reports it. The case is folded per chunk while\n * matching.\n */\nexport function* buildIndex(\n  ctx: RowModelContext,\n  config: MatchConfig,\n  useExSearch: boolean,\n): Generator<undefined, SearchIndex | null, undefined> {\n  const cols = resolveColumns(ctx.columns)\n  const declared = cols.list.some((c) => (c.def as { search?: unknown }).search !== undefined)\n  const data = ctx.data\n  const n = data.length\n  const keys: Key[] = []\n  const reads: Read[] = []\n  for (const col of cols.list) {\n    if (cols.byId.get(col.id) !== col) continue\n    const w = (col.def as { search?: unknown }).search\n    const weight = declared ? (typeof w === 'number' && w > 0 ? w : 0) : 1\n    if (weight === 0) continue\n    const path = col.format ? undefined : col.path\n    let failed = false\n    const onError = () => {\n      failed = true\n    }\n    let read = path ? yield* scan(n, (r) => getValue(data[r], path, onError)) : undefined\n    if (failed || (read === false && declared)) read = undefined\n    if (read === undefined) {\n      const values = ctx.getColumnValues(col.id)\n      if (!values) continue\n      yield // reading a column is a task of its own (#40)\n      const numbers = values instanceof Float64Array\n      if (numbers && !col.format) read = numberReader(values)\n      else {\n        // Zero-config: a column of objects is not searched, `format` or not (#27).\n        const own =\n          numbers || (declared && col.format) ? undefined : yield* scan(n, (r) => values[r])\n        if (own === false && !declared) read = false\n        else if (own && !col.format) read = own\n        else {\n          // Time-sliced in a table run (#40): dates or a heavy `format` are not one long task.\n          const sliced = (ctx as RowModelContext & SlicedFormatting).formattedSliced\n          const formatted = sliced ? yield* sliced(col.id) : ctx.getFormattedValues(col.id)\n          if (!formatted) continue\n          read = yield* scan(n, (r) => formatted[r])\n        }\n      }\n    }\n    if (!read) {\n      if ((process.env.NODE_ENV !== \"production\") && read === false) {\n        ctx.emit('DK_SEARCH_COLUMN_SKIPPED', { column: col.id, index: col.index })\n      }\n      continue\n    }\n    keys.push({ name: `c${keys.length}`, weight })\n    reads.push(read)\n    yield\n  }\n  if (keys.length === 0) return null\n  // Values (NFC already) are folded per chunk while matching; the query is normalised as well, so\n  // NFC and NFD spellings match each other like in the `contains` filter (#30).\n  const fold = (v: string) => (config.caseSensitive ? v : v.toLowerCase())\n  const foldQuery = (q: string) => fold(q.normalize('NFC'))\n  const at = (k: number, r: number) => fold((reads[k] as Read)(r))\n  return useExSearch\n    ? exSearchIndex(ctx.data.length, keys, at, foldQuery, config)\n    : containsIndex(keys, at, foldQuery, config)\n}\n\n/** Matches `rows` chunk by chunk (`score` decides alone, so chunks match like the whole). */\nfunction* chunked(\n  rows: Uint32Array,\n  columns: number,\n  matchChunk: (chunk: Uint32Array) => Hit[],\n): Generator<undefined, Uint32Array, undefined> {\n  const size = Math.max(256, Math.floor(CELLS / columns))\n  if (rows.length <= size) return rankHits(matchChunk(rows))\n  const hits: Hit[] = []\n  for (let k = 0; k < rows.length; k += size) {\n    for (const h of matchChunk(rows.subarray(k, k + size))) hits.push(h)\n    yield\n  }\n  return rankHits(hits)\n}\n\n/**\n * The projection as ex-search reads it: an array (iteration, `length`, index reads) of `{ i, c0, … }`\n * items, each built when read and not kept. It shows every row of `data` (`size`), or one chunk of\n * rows while that chunk is matched; ex-search holds this one view (`setData` once).\n */\nfunction projection(size: number, keys: readonly Key[], at: (k: number, r: number) => string) {\n  let rows: Uint32Array | undefined\n  // Never written, and its own `length` stays 0: `length` is read through the trap below (setting\n  // a large `length` would allocate a backing store).\n  const target: Item[] = []\n  const length = () => (rows ? rows.length : size)\n  const item = (j: number): Item => {\n    const r = rows ? (rows[j] as number) : j\n    const o = { i: r } as Record<string, string | number>\n    for (let k = 0; k < keys.length; k++) o[(keys[k] as Key).name] = at(k, r)\n    return o as Item\n  }\n  const items = new Proxy(target, {\n    get(t, p) {\n      if (p === 'length') return length()\n      const j = arrayIndex(p, length())\n      return j >= 0 ? item(j) : t[p as keyof Item[]]\n    },\n    has: (t, p) => arrayIndex(p, length()) >= 0 || p in t,\n  })\n  return {\n    items,\n    /** Shows `chunk` (row indices), or every row again (`undefined`). */\n    show(chunk: Uint32Array | undefined) {\n      rows = chunk\n    },\n  }\n}\n\nfunction exSearchIndex(\n  size: number,\n  keys: readonly Key[],\n  at: (k: number, r: number) => string,\n  fold: (v: string) => string,\n  config: MatchConfig,\n): SearchIndex {\n  // Values and query are folded already (buildIndex).\n  const engine = new ExSearch<Item>({\n    keys: keys as Key[],\n    ...config,\n    caseSensitive: true,\n    // DataKable re-ranks with exact scores and an index tie-break; tim keeps ex-search's own pass\n    // stable and avoids radix's score quantisation.\n    sortAlgorithm: 'tim',\n  })\n  // ex-search measures the edit distance to the whole value, so a typo of one word of a multi-word\n  // cell never matched (#10). For a one-word query, a value without it is shown as the best fuzzy\n  // match of itself and its words, or as '' (scores 0, as the value would). A value with the query\n  // stays whole for the exact / prefix / substring scores. Only strings within `max` of the query's\n  // length are measured (an edit distance is at least the length difference).\n  const max = config.fuzzyMaxDistance\n  let q = ''\n  const near = (k: number, r: number) => {\n    const v = at(k, r)\n    if (v.includes(q) || /\\s/.test(q)) return v\n    let best = ''\n    let top = 0\n    const words = v.split(/\\s+/)\n    for (const w of words[1] ? [v, ...words] : words) {\n      const s = Math.abs(w.length - q.length) > max ? 0 : Scorer.fuzzy(w, q, max, true)\n      if (s > top) {\n        best = w\n        top = s\n      }\n    }\n    return best\n  }\n  const view = projection(size, keys, near)\n  engine.setData(view.items)\n  return {\n    match(rows, query) {\n      const folded = fold(query)\n      return chunked(rows, keys.length, (chunk) => {\n        // Set per chunk, like the view: another job may have matched in between.\n        q = folded\n        view.show(chunk)\n        try {\n          // Results are copies of the items (`Omit<Item, …>` drops `i` from the type, not the value).\n          return engine.search(q) as unknown as Hit[]\n        } finally {\n          view.show(undefined)\n        }\n      })\n    },\n  }\n}\n\n/** The fallback when ex-search is missing or incompatible: exact 1 · prefix 0.8 · substring 0.65. */\nfunction containsIndex(\n  keys: readonly Key[],\n  at: (k: number, r: number) => string,\n  fold: (v: string) => string,\n  config: MatchConfig,\n): SearchIndex {\n  return {\n    match(rows, query) {\n      const q = fold(query)\n      return chunked(rows, keys.length, (chunk) => {\n        const hits: Hit[] = []\n        for (let j = 0; j < chunk.length; j++) {\n          const r = chunk[j] as number\n          let best = 0\n          for (let k = 0; k < keys.length; k++) {\n            const v = at(k, r)\n            const raw = v === q ? 1 : v.startsWith(q) ? 0.8 : v.includes(q) ? 0.65 : 0\n            const w = (keys[k] as Key).weight\n            if (raw * w > best) best = raw * w\n          }\n          if (best > 0 && best >= config.threshold) hits.push({ i: r, score: best })\n        }\n        return hits\n      })\n    },\n  }\n}\n\n/**\n * Hits in relevance order (§6.3): score descending, ties by original row index. Enforced here so\n * the order never depends on the matcher's own ranking. Sorts `hits` (a fresh array) in place.\n */\nexport function rankHits(hits: Hit[]): Uint32Array {\n  return Uint32Array.from(\n    hits.sort((a, b) => b.score - a.score || a.i - b.i),\n    (h) => h.i,\n  )\n}\n"],"mappings":";AAAA,SAAS,UAAU,cAAc;AACjC,SAAS,gBAAgB;AACzB,OAAO;AAGP,SAAS,iBAAwC;AACjD,SAAS,sBAAsB;AAC/B,SAAS,kBAAkB;AAC3B,SAAS,kBAAkB,qBAAqB;AAiChD,IAAM,QAAQ;AAMd,IAAM,QAAQ;AAWd,IAAM,cAAc,MAClB,CAAC,SAAS,UAAU,QAAQ,SAAS,UAAU,SAAS,OAAO,KAAK,EAAE;AAAA,EACpE,CAAC,MAAM,OAAO,MAAM;AACtB;AAGK,SAAS,cAAc,MAAqB;AAEjD,SAAQ,QAAQ,IAAI,aAAa,eAC7B;AAAA,IACE;AAAA,IACA;AAAA,MACE,SAAS;AAAA,MACT,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,UAAU;AAAA,IACZ;AAAA,IACA;AAAA,EACF,IACA,cAAc,WAAW;AAC/B;AAOA,SAAS,aAAa,QAA4B;AAChD,QAAM,UAAU,UAAU,MAAM;AAChC,SAAO,CAAC,MAAM;AACZ,UAAM,IAAI,OAAO,CAAC;AAClB,WAAO,CAAC,OAAO,MAAM,CAAC,IAAI,OAAO,CAAC,IAAI,UAAU,CAAC,IAAI,KAAK;AAAA,EAC5D;AACF;AAWA,UAAU,KACR,MACA,KAC2D;AAC3D,QAAM,OAAO,oBAAI,IAAoB;AACrC,MAAI;AACF,aAAS,IAAI,GAAG,IAAI,MAAM,KAAK;AAC7B,YAAM,IAAI,IAAI,CAAC;AACf,UAAI,MAAM,SAAS,OAAO,MAAM,YAAY,OAAO,MAAM,YAAa,QAAO;AAC7E,UAAI,OAAO,MAAM,YAAY,kBAAkB,KAAK,CAAC,GAAG;AACtD,cAAM,IAAI,EAAE,UAAU,KAAK;AAC3B,YAAI,MAAM,EAAG,MAAK,IAAI,GAAG,CAAC;AAAA,MAC5B;AACA,UAAI,IAAI,UAAU,QAAQ,EAAG;AAAA,IAC/B;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACA,QAAM,OAAa,CAAC,MAAM;AACxB,UAAM,IAAI,IAAI,CAAC;AACf,WAAO,MAAM,QAAQ,MAAM,SAAY,KAAK,OAAO,CAAC;AAAA,EACtD;AACA,SAAO,KAAK,OAAO,CAAC,MAAM,KAAK,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI;AACrD;AAgBO,UAAU,WACf,KACA,QACA,aACqD;AACrD,QAAM,OAAO,eAAe,IAAI,OAAO;AACvC,QAAM,WAAW,KAAK,KAAK,KAAK,CAAC,MAAO,EAAE,IAA6B,WAAW,MAAS;AAC3F,QAAM,OAAO,IAAI;AACjB,QAAM,IAAI,KAAK;AACf,QAAM,OAAc,CAAC;AACrB,QAAM,QAAgB,CAAC;AACvB,aAAW,OAAO,KAAK,MAAM;AAC3B,QAAI,KAAK,KAAK,IAAI,IAAI,EAAE,MAAM,IAAK;AACnC,UAAM,IAAK,IAAI,IAA6B;AAC5C,UAAM,SAAS,WAAY,OAAO,MAAM,YAAY,IAAI,IAAI,IAAI,IAAK;AACrE,QAAI,WAAW,EAAG;AAClB,UAAM,OAAO,IAAI,SAAS,SAAY,IAAI;AAC1C,QAAI,SAAS;AACb,UAAM,UAAU,MAAM;AACpB,eAAS;AAAA,IACX;AACA,QAAI,OAAO,OAAO,OAAO,KAAK,GAAG,CAAC,MAAM,SAAS,KAAK,CAAC,GAAG,MAAM,OAAO,CAAC,IAAI;AAC5E,QAAI,UAAW,SAAS,SAAS,SAAW,QAAO;AACnD,QAAI,SAAS,QAAW;AACtB,YAAM,SAAS,IAAI,gBAAgB,IAAI,EAAE;AACzC,UAAI,CAAC,OAAQ;AACb;AACA,YAAM,UAAU,kBAAkB;AAClC,UAAI,WAAW,CAAC,IAAI,OAAQ,QAAO,aAAa,MAAM;AAAA,WACjD;AAEH,cAAM,MACJ,WAAY,YAAY,IAAI,SAAU,SAAY,OAAO,KAAK,GAAG,CAAC,MAAM,OAAO,CAAC,CAAC;AACnF,YAAI,QAAQ,SAAS,CAAC,SAAU,QAAO;AAAA,iBAC9B,OAAO,CAAC,IAAI,OAAQ,QAAO;AAAA,aAC/B;AAEH,gBAAM,SAAU,IAA2C;AAC3D,gBAAM,YAAY,SAAS,OAAO,OAAO,IAAI,EAAE,IAAI,IAAI,mBAAmB,IAAI,EAAE;AAChF,cAAI,CAAC,UAAW;AAChB,iBAAO,OAAO,KAAK,GAAG,CAAC,MAAM,UAAU,CAAC,CAAC;AAAA,QAC3C;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,MAAM;AACT,UAAK,QAAQ,IAAI,aAAa,gBAAiB,SAAS,OAAO;AAC7D,YAAI,KAAK,4BAA4B,EAAE,QAAQ,IAAI,IAAI,OAAO,IAAI,MAAM,CAAC;AAAA,MAC3E;AACA;AAAA,IACF;AACA,SAAK,KAAK,EAAE,MAAM,IAAI,KAAK,MAAM,IAAI,OAAO,CAAC;AAC7C,UAAM,KAAK,IAAI;AACf;AAAA,EACF;AACA,MAAI,KAAK,WAAW,EAAG,QAAO;AAG9B,QAAM,OAAO,CAAC,MAAe,OAAO,gBAAgB,IAAI,EAAE,YAAY;AACtE,QAAM,YAAY,CAAC,MAAc,KAAK,EAAE,UAAU,KAAK,CAAC;AACxD,QAAM,KAAK,CAAC,GAAW,MAAc,KAAM,MAAM,CAAC,EAAW,CAAC,CAAC;AAC/D,SAAO,cACH,cAAc,IAAI,KAAK,QAAQ,MAAM,IAAI,WAAW,MAAM,IAC1D,cAAc,MAAM,IAAI,WAAW,MAAM;AAC/C;AAGA,UAAU,QACR,MACA,SACA,YAC8C;AAC9C,QAAM,OAAO,KAAK,IAAI,KAAK,KAAK,MAAM,QAAQ,OAAO,CAAC;AACtD,MAAI,KAAK,UAAU,KAAM,QAAO,SAAS,WAAW,IAAI,CAAC;AACzD,QAAM,OAAc,CAAC;AACrB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,MAAM;AAC1C,eAAW,KAAK,WAAW,KAAK,SAAS,GAAG,IAAI,IAAI,CAAC,EAAG,MAAK,KAAK,CAAC;AACnE;AAAA,EACF;AACA,SAAO,SAAS,IAAI;AACtB;AAOA,SAAS,WAAW,MAAc,MAAsB,IAAsC;AAC5F,MAAI;AAGJ,QAAM,SAAiB,CAAC;AACxB,QAAM,SAAS,MAAO,OAAO,KAAK,SAAS;AAC3C,QAAM,OAAO,CAAC,MAAoB;AAChC,UAAM,IAAI,OAAQ,KAAK,CAAC,IAAe;AACvC,UAAM,IAAI,EAAE,GAAG,EAAE;AACjB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,GAAG,KAAK,CAAC,EAAU,IAAI,IAAI,GAAG,GAAG,CAAC;AACxE,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,IAAI,MAAM,QAAQ;AAAA,IAC9B,IAAI,GAAG,GAAG;AACR,UAAI,MAAM,SAAU,QAAO,OAAO;AAClC,YAAM,IAAI,WAAW,GAAG,OAAO,CAAC;AAChC,aAAO,KAAK,IAAI,KAAK,CAAC,IAAI,EAAE,CAAiB;AAAA,IAC/C;AAAA,IACA,KAAK,CAAC,GAAG,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,KAAK,KAAK;AAAA,EACtD,CAAC;AACD,SAAO;AAAA,IACL;AAAA;AAAA,IAEA,KAAK,OAAgC;AACnC,aAAO;AAAA,IACT;AAAA,EACF;AACF;AAEA,SAAS,cACP,MACA,MACA,IACA,MACA,QACa;AAEb,QAAM,SAAS,IAAI,SAAe;AAAA,IAChC;AAAA,IACA,GAAG;AAAA,IACH,eAAe;AAAA;AAAA;AAAA,IAGf,eAAe;AAAA,EACjB,CAAC;AAMD,QAAM,MAAM,OAAO;AACnB,MAAI,IAAI;AACR,QAAM,OAAO,CAAC,GAAW,MAAc;AACrC,UAAM,IAAI,GAAG,GAAG,CAAC;AACjB,QAAI,EAAE,SAAS,CAAC,KAAK,KAAK,KAAK,CAAC,EAAG,QAAO;AAC1C,QAAI,OAAO;AACX,QAAI,MAAM;AACV,UAAM,QAAQ,EAAE,MAAM,KAAK;AAC3B,eAAW,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,IAAI,OAAO;AAChD,YAAM,IAAI,KAAK,IAAI,EAAE,SAAS,EAAE,MAAM,IAAI,MAAM,IAAI,OAAO,MAAM,GAAG,GAAG,KAAK,IAAI;AAChF,UAAI,IAAI,KAAK;AACX,eAAO;AACP,cAAM;AAAA,MACR;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACA,QAAM,OAAO,WAAW,MAAM,MAAM,IAAI;AACxC,SAAO,QAAQ,KAAK,KAAK;AACzB,SAAO;AAAA,IACL,MAAM,MAAM,OAAO;AACjB,YAAM,SAAS,KAAK,KAAK;AACzB,aAAO,QAAQ,MAAM,KAAK,QAAQ,CAAC,UAAU;AAE3C,YAAI;AACJ,aAAK,KAAK,KAAK;AACf,YAAI;AAEF,iBAAO,OAAO,OAAO,CAAC;AAAA,QACxB,UAAE;AACA,eAAK,KAAK,MAAS;AAAA,QACrB;AAAA,MACF,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAGA,SAAS,cACP,MACA,IACA,MACA,QACa;AACb,SAAO;AAAA,IACL,MAAM,MAAM,OAAO;AACjB,YAAM,IAAI,KAAK,KAAK;AACpB,aAAO,QAAQ,MAAM,KAAK,QAAQ,CAAC,UAAU;AAC3C,cAAM,OAAc,CAAC;AACrB,iBAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,gBAAM,IAAI,MAAM,CAAC;AACjB,cAAI,OAAO;AACX,mBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,kBAAM,IAAI,GAAG,GAAG,CAAC;AACjB,kBAAM,MAAM,MAAM,IAAI,IAAI,EAAE,WAAW,CAAC,IAAI,MAAM,EAAE,SAAS,CAAC,IAAI,OAAO;AACzE,kBAAM,IAAK,KAAK,CAAC,EAAU;AAC3B,gBAAI,MAAM,IAAI,KAAM,QAAO,MAAM;AAAA,UACnC;AACA,cAAI,OAAO,KAAK,QAAQ,OAAO,UAAW,MAAK,KAAK,EAAE,GAAG,GAAG,OAAO,KAAK,CAAC;AAAA,QAC3E;AACA,eAAO;AAAA,MACT,CAAC;AAAA,IACH;AAAA,EACF;AACF;AAMO,SAAS,SAAS,MAA0B;AACjD,SAAO,YAAY;AAAA,IACjB,KAAK,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AAAA,IAClD,CAAC,MAAM,EAAE;AAAA,EACX;AACF;","names":[]}

package/dist/features/search/search.cjs

@@ -23,19 +23,22 @@ __export(search_exports, {
   search: () => search
 });
 module.exports = __toCommonJS(search_exports);
+var import_debounce = require("kk-debounce/debounce");
 var import_debounceSignal = require("kk-debounce/debounceSignal");
 var import_throttle = require("kk-debounce/throttle");
 var import_codes = require("../../catalog/codes.cjs");
 var import_options = require("../../catalog/options.cjs");
 var import_build = require("../../diagnostics/build.cjs");
 var import_catalog = require("../../diagnostics/catalog.cjs");
+var import_process_guard = require("../../diagnostics/process-guard.cjs");
 var import_define = require("../../feature/define.cjs");
 var import_define2 = require("../../intercept/define.cjs");
 var import_slice = require("../../pipeline/slice.cjs");
 var import_mode = require("../../source/mode.cjs");
 var import_search_fn_brand = require("./search-fn-brand.cjs");
 var import_search_index = require("./search-index.cjs");
-(0, import_catalog.keepDiagnostics)(import_codes.optionDiagnostics);
+var import_skipped_codes = require("./skipped-codes.cjs");
+(0, import_catalog.keepDiagnostics)(import_codes.optionDiagnostics, import_skipped_codes.skippedColumnDiagnostics);
 var DEFAULT_WAIT = 300;
 var isDuration = (v) => {
   if (typeof v === "number") return Number.isFinite(v) && v >= 0;
@@ -90,7 +93,7 @@ var searchOptions = {
   }
 };
 var settledSuperseded = () => Promise.resolve(import_search_fn_brand.SUPERSEDED);
-var toText = (q) => typeof q === "string" ? q : q == null ? "" : String(q);
+var toText = (q) => q == null ? "" : String(q);
 var search = (opts = {}) => {
   const config = {
     threshold: opts.threshold ?? 0.3,
@@ -115,13 +118,17 @@ var search = (opts = {}) => {
     (0, import_build.throwConfigError)("DK_INVALID_OPTION", {
       path: "searchFn",
       feature: "search",
-      expected: "withSearchFn(searchFn)",
-      received: "searchFn",
+      expected: "wrapped|withSearchFn|searchFn|search-async",
+      // prose key (diagnostics/prose.ts)
+      received: typeof opts.searchFn,
       suggestions: [],
       phase: "init"
     });
   }
   const instances = /* @__PURE__ */ new WeakMap();
+  const resumes = /* @__PURE__ */ new WeakMap();
+  const ran = /* @__PURE__ */ new WeakMap();
+  let waited = false;
   function indexFor(ctx) {
     let byColumns = indexes.get(ctx.data);
     if (!byColumns) {
@@ -129,7 +136,7 @@ var search = (opts = {}) => {
       indexes.set(ctx.data, byColumns);
     }
     let key = byColumns.get(ctx.columns);
-    if (key === void 0) {
+    if (!key) {
       key = {};
       byColumns.set(ctx.columns, key);
     }
@@ -148,7 +155,10 @@ var search = (opts = {}) => {
     }
     return (0, import_slice.sliced)(ctx, matching2.key, () => index.match(rows, query));
   }
-  const standIn = (indices) => shown && shown.input === indices ? shown.output : indices;
+  const standIn = (indices) => {
+    waited = true;
+    return shown && shown.input === indices ? shown.output : indices;
+  };
   function step(indices, state, ctx) {
     const query = typeof state?.query === "string" ? state.query.trim() : "";
     if (query === "") return indices;
@@ -161,7 +171,7 @@ var search = (opts = {}) => {
         ctx.emit("DK_OPTION_NO_EFFECT", {
           path: "query",
           feature: "search",
-          reason: "no column is searchable: pass `columns` (give the columns to search a `search` weight, or omit it everywhere to search every column)",
+          reason: "not-searchable",
           once: false
         });
       }
@@ -190,14 +200,27 @@ var search = (opts = {}) => {
     interceptors: [
       (0, import_define2.defineInterceptor)({
         name: "search",
-        on: engine ? ["table:destroy", "pipeline:run"] : ["table:destroy"],
+        on: ["table:destroy", "pipeline:run", "table:init", "state:dispatch", "table:setOptions"],
         intercept(ctx, next) {
           const table = ctx.table;
           if (ctx.op === "table:destroy") {
             instances.get(table)?.();
             return next();
           }
-          return engine.run(table, next);
+          if (ctx.op !== "pipeline:run") {
+            const out = next();
+            resumes.get(table)?.();
+            return out;
+          }
+          const prev = waited;
+          waited = false;
+          try {
+            return engine ? engine.run(table, next) : next();
+          } finally {
+            const w = waited;
+            waited = prev;
+            ran.get(table)?.(w);
+          }
         }
       })
     ],
@@ -206,11 +229,12 @@ var search = (opts = {}) => {
       const write = (input2, query, status, error) => {
         const s = ctx.getState();
         if (status !== "error" && s?.input === input2 && s.query === query && s.status === status && !("error" in s)) {
-          return;
+          return false;
         }
         ctx.setState(
           status === "error" ? { input: input2, query, status, error } : { input: input2, query, status }
         );
+        return ctx.getState() !== s;
       };
       const applied = () => ctx.getState()?.query ?? "";
       const input = () => ctx.getState()?.input ?? "";
@@ -218,11 +242,6 @@ var search = (opts = {}) => {
       const waitFor = (query) => new Promise((resolve) => {
         waiting.push({ query, resolve });
       });
-      const settleWaiting = (query, outcome) => {
-        const list = waiting;
-        waiting = [];
-        for (const w of list) w.resolve(w.query === query ? outcome : import_search_fn_brand.SUPERSEDED);
-      };
       const replaceWaiting = (query) => {
         if (waiting.length === 0) return;
         const keep = [];
@@ -238,6 +257,22 @@ var search = (opts = {}) => {
         waiting = [];
         return keep;
       };
+      let held = [];
+      let busy = false;
+      const release = (outcome) => {
+        const list = held;
+        held = [];
+        for (const w of list) w.resolve(outcome);
+      };
+      const supersede = () => {
+        held = [...waiting, ...held];
+        waiting = [];
+        release(import_search_fn_brand.SUPERSEDED);
+      };
+      ran.set(table, (w) => {
+        busy = w;
+        if (!w) release(import_search_fn_brand.APPLIED);
+      });
       const session = engine?.session({
         ctx,
         write,
@@ -245,10 +280,13 @@ var search = (opts = {}) => {
         input,
         claim
       });
+      let scheduled = false;
       const applyQuery = (query, inp = input()) => {
+        scheduled = false;
         if (session?.apply(query, inp)) return;
-        write(inp, query, "idle");
-        settleWaiting(query, import_search_fn_brand.APPLIED);
+        if (held[0]?.query !== query) release(import_search_fn_brand.SUPERSEDED);
+        held.push(...claim(query));
+        if (!write(inp, query, "idle") && !busy) release(import_search_fn_brand.APPLIED);
       };
       let calling = false;
       let appliedNow;
@@ -258,10 +296,27 @@ var search = (opts = {}) => {
       };
       const timer = strategy === "debounce" ? (0, import_debounceSignal.debouncedSignal)(applied, apply, wait, { behavior: typing.behavior ?? "trailing" }) : strategy === "throttle" ? (0, import_throttle.throttle)(apply, wait) : void 0;
       const resting = () => session?.busy() ? "searching" : "idle";
-      instances.set(table, () => {
+      resumes.set(table, () => {
+        const s = ctx.getState();
+        const pending = s?.status === "pending";
+        if (pending ? !scheduled : s?.status === "searching" && !session?.busy()) {
+          const inp = toText(s.input);
+          write(inp, pending && strategy !== "enter" ? target(inp) : toText(s.query), resting());
+        }
+      });
+      const drop = (0, import_debounce.debounce)(() => {
+        const list = waiting;
+        waiting = [];
+        for (const w of list) w.resolve(import_search_fn_brand.SUPERSEDED);
+      }, wait);
+      const stop = () => {
         timer?.cancel();
+        drop.cancel();
+      };
+      instances.set(table, () => {
+        stop();
         session?.destroy();
-        settleWaiting("\0", import_search_fn_brand.SUPERSEDED);
+        supersede();
       });
       const commit = (next) => {
         const current = applied();
@@ -273,7 +328,7 @@ var search = (opts = {}) => {
           return p;
         }
         if (!timer || query === current) {
-          timer?.cancel();
+          stop();
           applyQuery(query, next);
           return p;
         }
@@ -290,13 +345,15 @@ var search = (opts = {}) => {
         }
         if (strategy === "debounce" && typing.behavior === "leading") {
           write(next, current, resting());
+          drop();
           return p;
         }
+        scheduled = true;
         write(next, current, "pending");
         return p;
       };
       const applyNow = (next) => {
-        timer?.cancel();
+        stop();
         const query = target(next);
         replaceWaiting(query);
         const p = waitFor(query);
@@ -307,12 +364,13 @@ var search = (opts = {}) => {
         setSearch: (query) => commit(toText(query)),
         flushSearch: () => applyNow(input()),
         cancelSearch: () => {
-          timer?.cancel();
+          scheduled = false;
+          stop();
           session?.abort();
-          settleWaiting("\0", import_search_fn_brand.SUPERSEDED);
+          supersede();
           const s = ctx.getState();
           if (s?.status === "pending" || s?.status === "searching") {
-            ctx.setState({ input: s.input, query: s.query, status: "idle" });
+            ctx.setState({ ...s, status: "idle" });
           }
         },
         clearSearch: () => {