@macrostrat/data-sheet 4.1.0 → 4.1.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (69) hide show
  1. package/CHANGELOG.md +6 -0
  2. package/dist/actions/column-controls.cjs +17 -5
  3. package/dist/actions/column-controls.cjs.map +1 -1
  4. package/dist/actions/column-controls.js +18 -6
  5. package/dist/actions/column-controls.js.map +1 -1
  6. package/dist/actions/column-filter.cjs +48 -25
  7. package/dist/actions/column-filter.cjs.map +1 -1
  8. package/dist/actions/column-filter.js +50 -27
  9. package/dist/actions/column-filter.js.map +1 -1
  10. package/dist/actions/table-controls.cjs +4 -0
  11. package/dist/actions/table-controls.cjs.map +1 -1
  12. package/dist/actions/table-controls.js +4 -0
  13. package/dist/actions/table-controls.js.map +1 -1
  14. package/dist/actions/toolbar.cjs +19 -5
  15. package/dist/actions/toolbar.cjs.map +1 -1
  16. package/dist/actions/toolbar.js +20 -6
  17. package/dist/actions/toolbar.js.map +1 -1
  18. package/dist/cell-renderer.cjs +1 -1
  19. package/dist/cell-renderer.cjs.map +1 -1
  20. package/dist/cell-renderer.js +1 -1
  21. package/dist/cell-renderer.js.map +1 -1
  22. package/dist/core.cjs +11 -2
  23. package/dist/core.cjs.map +1 -1
  24. package/dist/core.d.ts +4 -0
  25. package/dist/core.js +11 -2
  26. package/dist/core.js.map +1 -1
  27. package/dist/filters/operators.cjs +2 -2
  28. package/dist/filters/operators.cjs.map +1 -1
  29. package/dist/filters/operators.d.ts +1 -1
  30. package/dist/filters/operators.js +2 -2
  31. package/dist/filters/operators.js.map +1 -1
  32. package/dist/postgrest-table/data-loaders.cjs +1 -8
  33. package/dist/postgrest-table/data-loaders.cjs.map +1 -1
  34. package/dist/postgrest-table/data-loaders.js +1 -8
  35. package/dist/postgrest-table/data-loaders.js.map +1 -1
  36. package/dist/provider.cjs +9 -3
  37. package/dist/provider.cjs.map +1 -1
  38. package/dist/provider.d.ts +2 -1
  39. package/dist/provider.js +9 -3
  40. package/dist/provider.js.map +1 -1
  41. package/dist/renderers/column-header-cell.cjs +19 -4
  42. package/dist/renderers/column-header-cell.cjs.map +1 -1
  43. package/dist/renderers/column-header-cell.d.ts +1 -2
  44. package/dist/renderers/column-header-cell.js +20 -5
  45. package/dist/renderers/column-header-cell.js.map +1 -1
  46. package/dist/types.cjs.map +1 -1
  47. package/dist/types.d.ts +10 -1
  48. package/dist/types.js.map +1 -1
  49. package/dist/utils/column-spec.cjs.map +1 -1
  50. package/dist/utils/column-spec.d.ts +4 -0
  51. package/dist/utils/column-spec.js.map +1 -1
  52. package/dist/zustand-store.cjs +1 -0
  53. package/dist/zustand-store.cjs.map +1 -1
  54. package/dist/zustand-store.js +1 -0
  55. package/dist/zustand-store.js.map +1 -1
  56. package/package.json +1 -1
  57. package/src/actions/column-controls.ts +24 -7
  58. package/src/actions/column-filter.ts +59 -30
  59. package/src/actions/table-controls.ts +4 -0
  60. package/src/actions/toolbar.ts +39 -11
  61. package/src/cell-renderer.ts +6 -1
  62. package/src/core.ts +26 -3
  63. package/src/filters/operators.ts +5 -3
  64. package/src/postgrest-table/data-loaders.ts +6 -10
  65. package/src/provider.ts +22 -5
  66. package/src/renderers/column-header-cell.ts +31 -4
  67. package/src/types.ts +10 -1
  68. package/src/utils/column-spec.ts +4 -0
  69. package/src/zustand-store.ts +1 -0
@@ -61,17 +61,10 @@ function lazyLoadingReducer(state, action) {
61
61
  fetchMode: action.fetchMode,
62
62
  pageSize: action.pageSize
63
63
  };
64
- case "start-reload":
65
- return {
66
- ...state,
67
- data: new Array(state.data.length).fill(null),
68
- loading: true,
69
- initialized: false
70
- };
71
64
  case "reset":
72
65
  return {
73
66
  visibleRegion: defaultVisibleRegion,
74
- data: [],
67
+ data: new Array(Math.max(state.pageSize, 0)).fill(null),
75
68
  loading: false,
76
69
  error: null,
77
70
  initialized: false,
@@ -1 +1 @@
1
- {"version":3,"file":"data-loaders.cjs","sources":["../../src/postgrest-table/data-loaders.ts"],"sourcesContent":["/** Lazy loading of data from a PostgREST endpoint */\n\nimport { useAsyncEffect } from \"@macrostrat/ui-components\";\nimport { debounce, range } from \"underscore\";\nimport { useCallback, useEffect, useMemo, useRef } from \"react\";\nimport update, { Spec } from \"immutability-helper\";\nimport {\n PostgrestClient,\n PostgrestFilterBuilder,\n PostgrestQueryBuilder,\n} from \"@supabase/postgrest-js\";\nimport { adjustArraySize, RowRegion } from \"./loading-utils.ts\";\nimport { ctx, tableDataAtom, useSelector } from \"../provider.ts\";\nimport { atom } from \"jotai\";\nimport type { ColumnSort } from \"../types.ts\";\n\nexport type FetchMode = \"scroll\" | \"paged\";\n\ninterface LazyLoaderStateCore<T> {\n loading: boolean;\n error: Error | null;\n initialized: boolean;\n /** Reported source length when known (null = unknown / not reported). */\n totalCount: number | null;\n /** Windowing style: infinite-scroll windows, or one fixed page at a time. */\n fetchMode: FetchMode;\n /** Rows per chunk/page. */\n pageSize: number;\n}\n\ninterface LazyLoaderState<T> extends LazyLoaderStateCore<T> {\n data: (T | null)[];\n visibleRegion: RowRegion;\n}\n\nexport interface PostgrestOrder<T> {\n key: string;\n ascending?: boolean;\n nullsFirst?: boolean;\n}\n\n/** Operators available for server-side column filtering via PostgREST. */\nexport type PostgrestFilterOperator =\n | \"eq\"\n | \"neq\"\n | \"like\"\n | \"ilike\"\n | \"gt\"\n | \"lt\"\n | \"gte\"\n | \"lte\"\n | \"is\";\n\n/** A single column sort entry. */\nexport interface ColumnSortEntry {\n key: string;\n ascending: boolean;\n}\n\n/** A single column filter entry. */\nexport interface PostgrestColumnFilter {\n key: string;\n operator: PostgrestFilterOperator;\n value: string;\n}\n\nexport interface PostgrestFilter {\n type: \"filter\";\n apply(\n req: PostgrestFilterBuilder<any, any, any, any>,\n ): PostgrestFilterBuilder<any, any, any, any>;\n}\n\nexport function standardizeFilter(\n columnFilter: PostgrestColumnFilter,\n): PostgrestFilter {\n return {\n type: \"filter\",\n apply(req) {\n return applyColumnFilters(req, [columnFilter]);\n },\n };\n}\n\nexport function applyColumnFilters(\n req: PostgrestFilterBuilder<any, any, any, any>,\n filters: PostgrestColumnFilter[],\n) {\n for (const cf of filters) {\n if (cf.value === \"\" || cf.value == null) continue;\n const val =\n cf.operator === \"like\" || cf.operator === \"ilike\"\n ? `*${cf.value}*`\n : cf.value;\n req = req.filter(cf.key, cf.operator, val);\n }\n return req;\n}\n\ntype LazyLoaderAction<T> =\n | { type: \"start-loading\" }\n | {\n type: \"loaded\";\n data: T[];\n offset: number;\n totalSize: number;\n totalCount?: number | null;\n }\n | { type: \"error\"; error: Error }\n | { type: \"update-data\"; changes: Spec<T[]> }\n | { type: \"reset\" }\n | { type: \"start-reload\" }\n | { type: \"configure\"; fetchMode: FetchMode; pageSize: number };\n\nfunction lazyLoadingReducer<T>(\n state: LazyLoaderState<T>,\n action: LazyLoaderAction<T>,\n): LazyLoaderState<T> {\n switch (action.type) {\n case \"start-loading\":\n return {\n ...state,\n loading: true,\n initialized: true,\n };\n case \"update-data\":\n return {\n ...state,\n loading: false,\n data: update(state.data, action.changes),\n };\n case \"loaded\":\n let data = adjustArraySize(state.data, action.totalSize);\n const newData = action.data ?? [];\n const offset = action.offset ?? 0;\n data = [\n ...data.slice(0, offset),\n ...newData,\n ...data.slice(offset + newData.length),\n ];\n return {\n ...state,\n data,\n loading: false,\n totalCount:\n action.totalCount !== undefined\n ? action.totalCount\n : state.totalCount,\n };\n case \"configure\":\n return {\n ...state,\n fetchMode: action.fetchMode,\n pageSize: action.pageSize,\n };\n case \"start-reload\":\n // Preserve the table dimensions but show ghost/skeleton cells\n return {\n ...state,\n data: new Array(state.data.length).fill(null),\n loading: true,\n initialized: false,\n };\n case \"reset\":\n return {\n visibleRegion: defaultVisibleRegion,\n data: [],\n loading: false,\n error: null,\n initialized: false,\n totalCount: null,\n fetchMode: state.fetchMode,\n pageSize: state.pageSize,\n };\n case \"error\":\n return {\n ...state,\n error: action.error,\n loading: false,\n };\n default:\n return state;\n }\n}\n\ntype SortAndFilterOptions = {\n /** Column-level sort state, managed externally. When provided, overrides\n * the `order` prop for query building. */\n order?: PostgrestOrder<any>[];\n filters?: PostgrestFilter[];\n};\n\ninterface QueryConfig extends SortAndFilterOptions {\n columns?: string | string[];\n count?: \"exact\" | \"estimated\";\n limit?: number;\n identityKey: string;\n lastLoadedRow?: any;\n lastLoadedRowIndex: number;\n}\n\nfunction buildQuery<T>(\n client: PostgrestQueryBuilder<T, any, any>,\n config: QueryConfig,\n) {\n const { columns = \"*\", count, lastLoadedRowIndex } = config;\n const opts = { count };\n\n let cols: string;\n if (Array.isArray(columns)) {\n cols = columns.join(\", \");\n } else {\n cols = columns ?? \"*\";\n }\n\n let query = client.select(cols, opts);\n\n const filters = config.filters ?? [];\n for (const filter of filters) {\n query = filter.apply(query);\n }\n\n const orderClauses = buildPostgrestOrderClauses(\n config.order ?? [],\n config.identityKey,\n );\n\n let hasOrdering = false;\n for (const clause of orderClauses) {\n query = query.order(clause.key, clause);\n if (config.lastLoadedRow != null) {\n const op = (clause.ascending ?? true) ? \"gt\" : \"lt\";\n const value = config.lastLoadedRow[clause.key];\n query = query[op](clause.key, value);\n }\n hasOrdering = true;\n }\n\n let offset = null;\n if (!hasOrdering && lastLoadedRowIndex > 0) {\n // We need to load based on offsets\n offset = lastLoadedRowIndex + 1;\n }\n\n if (config.limit != null) {\n if (offset != null) {\n query = query.range(offset, offset + config.limit - 1);\n console.log(`Random seek from ${offset}, this will be slow`);\n } else {\n query = query.limit(config.limit);\n }\n }\n\n console.log(\"query\", query.url.search);\n return query;\n}\n\nconst defaultVisibleRegion: RowRegion = {\n rowIndexStart: 0,\n rowIndexEnd: 0,\n};\n\n/** Atom to house the current visible region of the table */\nconst visibleRegionAtom = atom<RowRegion>(defaultVisibleRegion);\n\nconst lazyLoaderCoreStateAtom = atom<LazyLoaderStateCore<any>>({\n loading: false,\n error: null,\n initialized: false,\n totalCount: null,\n fetchMode: \"scroll\",\n pageSize: 100,\n});\n\n/** Current page index (0-based) for paged fetch mode. */\nexport const chunkPageAtom = atom(0);\n\n/** Bump this to force the active chunk loader to reset and re-fetch from\n * scratch — e.g. after a mutation (save/delete) that invalidates loaded rows. */\nexport const dataRefreshTokenAtom = atom(0);\n\n/** Footer state for the optional bottom-of-table indicator: rows loaded, the\n * source total when known, load status, and — in paged mode — the current\n * page and total pages. */\nexport interface TableFooterInfo {\n mode: FetchMode;\n loaded: number;\n total: number | null;\n loading: boolean;\n page: number;\n pageSize: number;\n totalPages: number | null;\n}\n\nexport const tableFooterAtom = atom<TableFooterInfo>((get) => {\n const core = get(lazyLoaderCoreStateAtom);\n const data = get(tableDataAtom) ?? [];\n let loaded = 0;\n let hasGaps = false;\n for (const row of data) {\n if (row != null) loaded++;\n else hasGaps = true;\n }\n // Total is known when the source reported it, or (scroll mode) when the array\n // is fully populated — otherwise it's still being discovered.\n const total = core.totalCount ?? (hasGaps ? null : data.length);\n const totalPages =\n core.totalCount != null ? Math.ceil(core.totalCount / core.pageSize) : null;\n return {\n mode: core.fetchMode,\n loaded,\n total,\n loading: core.loading,\n page: get(chunkPageAtom),\n pageSize: core.pageSize,\n totalPages,\n };\n});\n\nexport interface ViewInfo {\n visibleRegion: RowRegion;\n totalCount: number | null;\n loading: boolean;\n error: Error | null;\n}\n\nexport const viewInfoAtom = atom<ViewInfo>((get) => {\n const state = get(lazyLoaderStateAtom);\n return {\n visibleRegion: state.visibleRegion,\n loading: state.loading,\n error: state.error,\n totalCount: state.data.length,\n };\n});\n\n/** Temporary passthrough atom to allow visible region to be separated from the rest\n * of the lazy loader state\n */\nconst lazyLoaderStateAtom = atom(\n (get): LazyLoaderState<any> => {\n const core = get(lazyLoaderCoreStateAtom);\n const data = get(tableDataAtom);\n const visibleRegion = get(visibleRegionAtom);\n return {\n ...core,\n data,\n visibleRegion,\n };\n },\n (get, set, update: any) => {\n // Split the state between several places\n if (typeof update === \"function\") {\n update = update(get(lazyLoaderStateAtom));\n }\n const { visibleRegion, data, ...rest } = update;\n if (visibleRegion != null) {\n set(visibleRegionAtom, visibleRegion);\n }\n // Propagate the data array even when empty — a `reset` (view change) must\n // clear the stale rows so the re-fetch rebuilds a correctly-sized array\n // (otherwise a filtered/sorted result splices over a stale, larger array).\n if (data != null) {\n set(tableDataAtom, data);\n }\n if (Object.keys(rest).length > 1) {\n set(lazyLoaderCoreStateAtom, (v) => ({ ...v, ...rest }));\n }\n },\n);\n\nfunction useLazyLoaderReducer() {\n const [state, setState] = ctx.use(lazyLoaderStateAtom);\n const dispatch = useCallback(\n (action: LazyLoaderAction<any>) =>\n setState((prev) => lazyLoadingReducer(prev, action)),\n [setState],\n );\n return [state, dispatch] as const;\n}\n\nfunction buildPostgrestOrderClauses(\n sorts: (ColumnSortEntry | PostgrestOrder<any>)[],\n identityOrder: PostgrestOrder<any> | string,\n): PostgrestOrder<any>[] {\n // Clause to build ordering for a Postgrest table.\n // There must be an ordering by identity key, and it must be last...\n const identitySort =\n typeof identityOrder == \"string\"\n ? { key: identityOrder, ascending: true }\n : identityOrder;\n const identityKey = identitySort.key;\n const clauses: PostgrestOrder<any>[] = sorts.map((sort) => {\n return {\n key: sort.key,\n ascending: sort.ascending,\n nullsFirst: \"nullsFirst\" in sort ? sort.nullsFirst : false,\n };\n });\n // sort the clauses so the identity clause is last\n const hasIdentityClause = clauses.some((d) => d.key === identityKey);\n if (hasIdentityClause) {\n clauses.sort((a, b) => {\n if (a.key === identityKey) return 1;\n if (b.key === identityKey) return -1;\n return 0;\n });\n } else {\n clauses.push(identitySort);\n }\n return clauses;\n}\n\nexport function useScrollHandler() {\n /** A standardized approach to holding onto the scroll position for the table */\n // Reference to hold onto the scroll position\n const ref = useRef<RowRegion>(null);\n\n const setVisibleRegion = ctx.useSet(visibleRegionAtom);\n\n return useCallback(\n debounce((visibleCells: RowRegion) => {\n if (\n visibleCells.rowIndexEnd == ref.current?.rowIndexEnd &&\n visibleCells.rowIndexStart == ref.current?.rowIndexStart\n ) {\n return;\n }\n setVisibleRegion(visibleCells);\n ref.current = visibleCells;\n }, 500),\n [setVisibleRegion],\n );\n}\n\n/** The active view state (a filter's id / column / config), passed to a\n * `fetchChunk`. A server provider translates `columnKey` + `state` into a\n * query; a local (in-memory) provider applies `predicate` directly. Both come\n * from the same `TableFilter`, so one filter definition serves either target. */\nexport interface FetchDataFilter {\n id: string;\n columnKey?: string;\n state: any;\n /** Client-side row predicate (from the `TableFilter`). Server providers\n * ignore it and translate `columnKey` + `state` instead. */\n predicate?: (row: any, state: any) => boolean;\n}\n\n/** Parameters passed to a `fetchChunk` implementation for one window. */\nexport interface FetchDataParams {\n /** Row offset of the requested chunk (chunk-aligned). */\n offset: number;\n /** Maximum rows to return. */\n limit: number;\n /** Aborts when the request is superseded (view change / unmount). */\n signal: AbortSignal;\n /** Active sorts, in priority order. */\n sorts: ColumnSort[];\n /** Active filters (id + column + config). */\n filters: FetchDataFilter[];\n /** In scroll mode, the already-loaded row immediately before this chunk\n * (and its data-array index), or `null` at the start / in paged mode. Keyset\n * sources can page from this cursor (e.g. `WHERE key > cursor`) instead of a\n * slow `OFFSET`; offset-based sources can ignore it. */\n cursor?: { row: any; index: number } | null;\n}\n\n/** Result of a `fetchChunk` call. `totalCount` reports the source length when\n * known (drives sparse-array pre-sizing and a proportional scrollbar); omit it\n * for unknown-length sources (the array grows as chunks arrive). */\nexport interface FetchDataResult<T = any> {\n rows: T[];\n totalCount?: number | null;\n}\n\nexport type FetchData<T = any> = (\n params: FetchDataParams,\n) => Promise<FetchDataResult<T>>;\n\n/**\n * A table's data source, addressed uniformly whether it's an in-memory array or\n * a remote backend. `fetchChunk` returns a window with the active sorts/filters\n * already applied (in memory by the local provider, in SQL by a server one);\n * `identity` addresses a row for edits/mutations — stable across re-sorts,\n * unlike an array index. The mutation ops are present only for editable /\n * persisting sources. The in-memory case (`createLocalProvider`) is just the\n * degenerate implementation, so local and server tables share one path.\n */\nexport interface TableDataProvider<T = any> {\n fetchData(params: FetchDataParams): Promise<FetchDataResult<T>>;\n identity(row: T): string | number;\n saveRows?(rows: T[]): Promise<void>;\n deleteRows?(ids: Array<string | number>): Promise<void>;\n insertRow?(row: Partial<T>): Promise<void>;\n}\n\n/**\n * The degenerate provider: an in-memory array. `fetchChunk` applies the active\n * filter predicates and sorts over the array and returns the requested slice\n * plus the (fully-known) total — the same view engine used for client-side\n * tables, expressed as a provider.\n */\nexport function createLocalProvider<T = any>(\n data: T[],\n options: { identity?: (row: T) => string | number } = {},\n): TableDataProvider<T> {\n const identity: (row: T) => string | number =\n options.identity ?? defaultLocalIdentity;\n return {\n identity,\n async fetchData({ offset, limit, sorts, filters }) {\n let rows = data;\n if (filters != null && filters.length > 0) {\n rows = rows.filter((row) =>\n filters.every((f) =>\n f.predicate != null ? f.predicate(row, f.state) : true,\n ),\n );\n }\n if (sorts != null && sorts.length > 0) {\n rows = [...rows].sort(compareRowsBySorts(sorts));\n }\n return {\n rows: rows.slice(offset, offset + limit),\n totalCount: rows.length,\n };\n },\n };\n}\n\n// Stable synthetic identity for in-memory rows lacking a natural `id`. Keyed by\n// object reference (a local data array keeps the same row objects across\n// re-sorts), so edits survive re-ordering even without an id field.\nconst _syntheticRowIds = new WeakMap<object, string>();\nlet _syntheticRowCounter = 0;\nfunction defaultLocalIdentity(row: any): string | number | undefined {\n if (row == null) return undefined;\n if (row.id != null) return row.id;\n if (typeof row !== \"object\") return row;\n let id = _syntheticRowIds.get(row);\n if (id == null) {\n id = `__row_${_syntheticRowCounter++}`;\n _syntheticRowIds.set(row, id);\n }\n return id;\n}\n\n/** Multi-key row comparator (priority order; nulls first when ascending),\n * shared by the local provider and any other in-memory sort. */\nexport function compareRowsBySorts(sorts: ColumnSort[]) {\n return (a: any, b: any): number => {\n for (const sort of sorts) {\n const av = a?.[sort.key];\n const bv = b?.[sort.key];\n if (av == null && bv == null) continue;\n if (av == null) return sort.ascending ? -1 : 1;\n if (bv == null) return sort.ascending ? 1 : -1;\n const cmp = av < bv ? -1 : av > bv ? 1 : 0;\n if (cmp !== 0) return sort.ascending ? cmp : -cmp;\n }\n return 0;\n };\n}\n\nexport interface FetchDataOptions {\n pageSize?: number;\n fetchMode?: FetchMode;\n}\n\n/**\n * A generic, backend-agnostic windowed data source. Give it a `fetchChunk`\n * function and it drives the sheet's lazy loading: it loads the chunk covering\n * the first unloaded visible row, pre-sizes the sparse array from `totalCount`,\n * threads the active sorts/filters through so the source can apply them\n * server-side, and re-fetches from scratch when the view state changes. This\n * is the unified seam that upstreams bespoke loaders (`fetchChunk` receives the\n * view state; there's no separate adapter object).\n *\n * Call it from a component rendered inside `DataSheet` (see `ChunkLoaderManager`).\n */\nexport function useDataLoader<T = any>(\n fetchChunk: FetchData<T>,\n options: FetchDataOptions = {},\n) {\n const { pageSize = 100, fetchMode = \"scroll\" } = options;\n const [state, dispatch] = useLazyLoaderReducer();\n const visibleRegion = ctx.useValue(visibleRegionAtom);\n const page = ctx.useValue(chunkPageAtom);\n const setPage = ctx.useSet(chunkPageAtom);\n const refreshToken = ctx.useValue(dataRefreshTokenAtom);\n const columnSorts = useSelector((s) => s.columnSorts);\n const activeFilters = useSelector((s) => s.activeFilters);\n const abortRef = useRef<AbortController | null>(null);\n // Tracks the (page, viewKey) already loaded in paged mode, so the effect\n // doesn't re-fetch on unrelated re-renders.\n const loadedRef = useRef<{ page: number; viewKey: string }>({\n page: -1,\n viewKey: \"\",\n });\n\n const filters: FetchDataFilter[] = useMemo(\n () =>\n (Array.from(activeFilters.entries()) as [any, any][]).map(\n ([id, entry]) => ({\n id,\n columnKey: entry.filter?.columnKey,\n state: entry.state,\n predicate: entry.filter?.predicate,\n }),\n ),\n [activeFilters],\n );\n\n // Publish the windowing config so the footer/pager can read it.\n useEffect(() => {\n dispatch({ type: \"configure\", fetchMode, pageSize: pageSize });\n }, [fetchMode, pageSize]);\n\n // Reset (re-fetch from scratch) when sorts/filters change, or when the fetch\n // mode switches (paged holds a dense page; scroll needs to re-initialize and\n // pre-size) — so a table can flip between modes cleanly.\n const viewKey = useMemo(\n () => JSON.stringify({ sorts: columnSorts, filters }),\n [columnSorts, filters],\n );\n useEffect(() => {\n dispatch({ type: \"reset\" });\n setPage(0);\n }, [viewKey, fetchMode, refreshToken]);\n\n useAsyncEffect(async () => {\n if (state.loading) return;\n\n // Determine the chunk offset to fetch, and (scroll mode) a keyset cursor:\n // the already-loaded row just before the chunk, so keyset sources can page\n // from it instead of a slow OFFSET.\n let offset: number;\n let cursor: { row: any; index: number } | null = null;\n if (fetchMode === \"paged\") {\n // Fetch the current page once; skip if already loaded for this view.\n if (\n loadedRef.current.page === page &&\n loadedRef.current.viewKey === viewKey\n ) {\n return;\n }\n offset = page * pageSize;\n } else {\n const rowIndex = indexOfFirstNullInRegion(state.data, visibleRegion);\n if (rowIndex == null && state.initialized) return;\n offset = Math.floor((rowIndex ?? 0) / pageSize) * pageSize;\n const prev = offset > 0 ? state.data[offset - 1] : null;\n if (prev != null) cursor = { row: prev, index: offset - 1 };\n }\n\n abortRef.current?.abort();\n const controller = new AbortController();\n abortRef.current = controller;\n\n dispatch({ type: \"start-loading\" });\n try {\n const result = await fetchChunk({\n offset,\n limit: pageSize,\n signal: controller.signal,\n sorts: columnSorts,\n filters,\n cursor,\n });\n if (controller.signal.aborted) return;\n const rows = result.rows ?? [];\n if (fetchMode === \"paged\") {\n loadedRef.current = { page, viewKey };\n // The sheet shows just this page's rows (dense, from index 0); the\n // real source length is tracked separately for the pager.\n dispatch({\n type: \"loaded\",\n data: rows,\n offset: 0,\n totalSize: rows.length,\n totalCount: result.totalCount ?? null,\n });\n } else {\n // Size the (sparse) array. With a known total, size to it. Without one\n // (keyset / infinite scroll), use the short-chunk heuristic: a chunk\n // smaller than the page size means we've hit the end — size exactly to\n // the loaded rows; otherwise pad one more page of nulls so scrolling\n // into them triggers the next fetch. So an unknown-length source never\n // needs a count — it grows a page at a time until a short chunk.\n const loadedEnd = offset + rows.length;\n let totalSize: number;\n if (result.totalCount != null) {\n totalSize = result.totalCount;\n } else {\n const reachedEnd = rows.length < pageSize;\n totalSize = reachedEnd ? loadedEnd : loadedEnd + pageSize;\n }\n dispatch({\n type: \"loaded\",\n data: rows,\n offset,\n totalSize,\n // Preserve a previously-known total when a chunk omits it (undefined):\n // keyset pages can't re-count (the cursor filter would skew it), so\n // only the initial cursorless fetch reports the total.\n totalCount: result.totalCount,\n });\n }\n } catch (err) {\n if (!controller.signal.aborted) {\n dispatch({ type: \"error\", error: err as Error });\n }\n }\n }, [state.data, visibleRegion, viewKey, page, fetchMode]);\n\n return { data: state.data, loading: state.loading, error: state.error };\n}\n\n/**\n * Build a `fetchChunk` backed by a PostgREST endpoint, for use with\n * `useChunkLoader` / `ChunkLoaderManager`. It reuses `buildQuery`, so it pages\n * with **keyset pagination** (via the loader's `cursor`) whenever the query is\n * ordered — falling back to `OFFSET` only when it isn't — and threads the\n * active store sorts/filters into the query. The total count is requested only\n * on the initial (cursorless) fetch, since a keyset cursor filter would skew it.\n */\nexport function createPostgRESTFetchChunk<T = any>(config: {\n endpoint: string;\n table: string;\n identityKey: string;\n columns?: string | string[];\n /** Order applied before the active column sorts (identity key appended last). */\n baseOrder?: PostgrestOrder<any>[];\n /** A transform over the query builder, applied as a base filter (the `filter` prop). */\n baseFilter?: (\n q: PostgrestFilterBuilder<any, any, any, any>,\n ) => PostgrestFilterBuilder<any, any, any, any>;\n /** Translate a stored filter entry to a `PostgrestFilter` (return `null` to\n * skip). Defaults to the `{ key, operator, value }` column-filter shape. */\n translateFilter?: (f: FetchDataFilter) => PostgrestFilter | null;\n}): FetchData<T> {\n const translate = config.translateFilter ?? standardColumnFilter;\n return async ({ limit, signal, sorts, filters, cursor }) => {\n const client = new PostgrestClient(config.endpoint).from(config.table);\n\n const order: PostgrestOrder<any>[] = [\n ...(config.baseOrder ?? []),\n ...sorts.map((s) => ({ key: s.key, ascending: s.ascending })),\n ];\n\n const pgFilters: PostgrestFilter[] = [];\n if (config.baseFilter != null) {\n const apply = config.baseFilter;\n pgFilters.push({ type: \"filter\", apply });\n }\n for (const f of filters) {\n const pf = translate(f);\n if (pf != null) pgFilters.push(pf);\n }\n\n const query = buildQuery(client, {\n columns: config.columns,\n // Only the initial (cursorless) fetch reports an accurate total.\n count: cursor == null ? \"exact\" : undefined,\n limit,\n identityKey: config.identityKey,\n order,\n filters: pgFilters,\n lastLoadedRow: cursor?.row ?? null,\n lastLoadedRowIndex: cursor?.index ?? -1,\n });\n\n const res: any = await query;\n if (signal.aborted) return { rows: [] };\n if (res?.error != null) throw res.error;\n const rows = res?.data ?? [];\n return res?.count != null ? { rows, totalCount: res.count } : { rows };\n };\n}\n\n/**\n * A full PostgREST `TableDataProvider`: the read side (`fetchData` + row\n * `identity`) plus persistence — `saveRows` (upsert) and `deleteRows` (by\n * identity). Pass it to `DataSheet`'s `provider` prop. The mutation methods\n * throw on error so the Save action surfaces it.\n */\nexport function createPostgRESTProvider<T = any>(config: {\n endpoint: string;\n table: string;\n identityKey: string;\n columns?: string | string[];\n baseOrder?: PostgrestOrder<any>[];\n baseFilter?: (\n q: PostgrestFilterBuilder<any, any, any, any>,\n ) => PostgrestFilterBuilder<any, any, any, any>;\n translateFilter?: (f: FetchDataFilter) => PostgrestFilter | null;\n}): TableDataProvider<T> {\n const from = () => new PostgrestClient(config.endpoint).from(config.table);\n return {\n fetchData: createPostgRESTFetchChunk<T>(config),\n identity: (row: any) => row?.[config.identityKey],\n async saveRows(rows) {\n const res: any = await from().upsert(rows as any[], {\n defaultToNull: false,\n });\n if (res?.error != null) throw res.error;\n },\n async deleteRows(ids) {\n const res: any = await from().delete().in(config.identityKey, ids);\n if (res?.error != null) throw res.error;\n },\n };\n}\n\n/** Default filter translation for the built-in operator `columnFilter`: its\n * column is `f.columnKey`, its state is `{ operator, value }`. (Also accepts a\n * `key` in state for hand-rolled filters.) */\nfunction standardColumnFilter(f: FetchDataFilter): PostgrestFilter | null {\n const s = f.state;\n if (s == null) return null;\n const key = f.columnKey ?? s.key;\n if (key != null && s.operator != null && s.value != null && s.value !== \"\") {\n return standardizeFilter({ key, operator: s.operator, value: s.value });\n }\n return null;\n}\n\nfunction indexOfFirstNullInRegion(\n data: any[],\n region: RowRegion,\n): number | null {\n for (let i = region.rowIndexStart; i < region.rowIndexEnd; i++) {\n if (data[i] == null) {\n return i;\n }\n }\n return null;\n}\n"],"names":["update","adjustArraySize","atom","tableDataAtom","ctx","useCallback","useRef","debounce","useSelector","useMemo","useEffect","useAsyncEffect","PostgrestClient"],"mappings":";;;;;;;;;;;;AAyEO,SAAS,kBACd,cACiB;AACjB,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,KAAK;AACT,aAAO,mBAAmB,KAAK,CAAC,YAAY,CAAC;AAAA,IAC/C;AAAA,EAAA;AAEJ;AAEO,SAAS,mBACd,KACA,SACA;AACA,aAAW,MAAM,SAAS;AACxB,QAAI,GAAG,UAAU,MAAM,GAAG,SAAS,KAAM;AACzC,UAAM,MACJ,GAAG,aAAa,UAAU,GAAG,aAAa,UACtC,IAAI,GAAG,KAAK,MACZ,GAAG;AACT,UAAM,IAAI,OAAO,GAAG,KAAK,GAAG,UAAU,GAAG;AAAA,EAC3C;AACA,SAAO;AACT;AAiBA,SAAS,mBACP,OACA,QACoB;AACpB,UAAQ,OAAO,MAAA;AAAA,IACb,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,SAAS;AAAA,QACT,aAAa;AAAA,MAAA;AAAA,IAEjB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,SAAS;AAAA,QACT,MAAMA,gBAAAA,QAAO,MAAM,MAAM,OAAO,OAAO;AAAA,MAAA;AAAA,IAE3C,KAAK;AACH,UAAI,OAAOC,aAAAA,gBAAgB,MAAM,MAAM,OAAO,SAAS;AACvD,YAAM,UAAU,OAAO,QAAQ,CAAA;AAC/B,YAAM,SAAS,OAAO,UAAU;AAChC,aAAO;AAAA,QACL,GAAG,KAAK,MAAM,GAAG,MAAM;AAAA,QACvB,GAAG;AAAA,QACH,GAAG,KAAK,MAAM,SAAS,QAAQ,MAAM;AAAA,MAAA;AAEvC,aAAO;AAAA,QACL,GAAG;AAAA,QACH;AAAA,QACA,SAAS;AAAA,QACT,YACE,OAAO,eAAe,SAClB,OAAO,aACP,MAAM;AAAA,MAAA;AAAA,IAEhB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,WAAW,OAAO;AAAA,QAClB,UAAU,OAAO;AAAA,MAAA;AAAA,IAErB,KAAK;AAEH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,MAAM,IAAI,MAAM,MAAM,KAAK,MAAM,EAAE,KAAK,IAAI;AAAA,QAC5C,SAAS;AAAA,QACT,aAAa;AAAA,MAAA;AAAA,IAEjB,KAAK;AACH,aAAO;AAAA,QACL,eAAe;AAAA,QACf,MAAM,CAAA;AAAA,QACN,SAAS;AAAA,QACT,OAAO;AAAA,QACP,aAAa;AAAA,QACb,YAAY;AAAA,QACZ,WAAW,MAAM;AAAA,QACjB,UAAU,MAAM;AAAA,MAAA;AAAA,IAEpB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,OAAO,OAAO;AAAA,QACd,SAAS;AAAA,MAAA;AAAA,IAEb;AACE,aAAO;AAAA,EAAA;AAEb;AAkBA,SAAS,WACP,QACA,QACA;AACA,QAAM,EAAE,UAAU,KAAK,OAAO,uBAAuB;AACrD,QAAM,OAAO,EAAE,MAAA;AAEf,MAAI;AACJ,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,WAAO,QAAQ,KAAK,IAAI;AAAA,EAC1B,OAAO;AACL,WAAO,WAAW;AAAA,EACpB;AAEA,MAAI,QAAQ,OAAO,OAAO,MAAM,IAAI;AAEpC,QAAM,UAAU,OAAO,WAAW,CAAA;AAClC,aAAW,UAAU,SAAS;AAC5B,YAAQ,OAAO,MAAM,KAAK;AAAA,EAC5B;AAEA,QAAM,eAAe;AAAA,IACnB,OAAO,SAAS,CAAA;AAAA,IAChB,OAAO;AAAA,EAAA;AAGT,MAAI,cAAc;AAClB,aAAW,UAAU,cAAc;AACjC,YAAQ,MAAM,MAAM,OAAO,KAAK,MAAM;AACtC,QAAI,OAAO,iBAAiB,MAAM;AAChC,YAAM,KAAM,OAAO,aAAa,OAAQ,OAAO;AAC/C,YAAM,QAAQ,OAAO,cAAc,OAAO,GAAG;AAC7C,cAAQ,MAAM,EAAE,EAAE,OAAO,KAAK,KAAK;AAAA,IACrC;AACA,kBAAc;AAAA,EAChB;AAEA,MAAI,SAAS;AACb,MAAI,CAAC,eAAe,qBAAqB,GAAG;AAE1C,aAAS,qBAAqB;AAAA,EAChC;AAEA,MAAI,OAAO,SAAS,MAAM;AACxB,QAAI,UAAU,MAAM;AAClB,cAAQ,MAAM,MAAM,QAAQ,SAAS,OAAO,QAAQ,CAAC;AACrD,cAAQ,IAAI,oBAAoB,MAAM,qBAAqB;AAAA,IAC7D,OAAO;AACL,cAAQ,MAAM,MAAM,OAAO,KAAK;AAAA,IAClC;AAAA,EACF;AAEA,UAAQ,IAAI,SAAS,MAAM,IAAI,MAAM;AACrC,SAAO;AACT;AAEA,MAAM,uBAAkC;AAAA,EACtC,eAAe;AAAA,EACf,aAAa;AACf;AAGA,MAAM,oBAAoBC,MAAAA,KAAgB,oBAAoB;AAE9D,MAAM,0BAA0BA,MAAAA,KAA+B;AAAA,EAC7D,SAAS;AAAA,EACT,OAAO;AAAA,EACP,aAAa;AAAA,EACb,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,UAAU;AACZ,CAAC;AAGM,MAAM,gBAAgBA,MAAAA,KAAK,CAAC;AAI5B,MAAM,uBAAuBA,MAAAA,KAAK,CAAC;AAenC,MAAM,kBAAkBA,MAAAA,KAAsB,CAAC,QAAQ;AAC5D,QAAM,OAAO,IAAI,uBAAuB;AACxC,QAAM,OAAO,IAAIC,SAAAA,aAAa,KAAK,CAAA;AACnC,MAAI,SAAS;AACb,MAAI,UAAU;AACd,aAAW,OAAO,MAAM;AACtB,QAAI,OAAO,KAAM;AAAA,QACZ,WAAU;AAAA,EACjB;AAGA,QAAM,QAAQ,KAAK,eAAe,UAAU,OAAO,KAAK;AACxD,QAAM,aACJ,KAAK,cAAc,OAAO,KAAK,KAAK,KAAK,aAAa,KAAK,QAAQ,IAAI;AACzE,SAAO;AAAA,IACL,MAAM,KAAK;AAAA,IACX;AAAA,IACA;AAAA,IACA,SAAS,KAAK;AAAA,IACd,MAAM,IAAI,aAAa;AAAA,IACvB,UAAU,KAAK;AAAA,IACf;AAAA,EAAA;AAEJ,CAAC;AASM,MAAM,eAAeD,MAAAA,KAAe,CAAC,QAAQ;AAClD,QAAM,QAAQ,IAAI,mBAAmB;AACrC,SAAO;AAAA,IACL,eAAe,MAAM;AAAA,IACrB,SAAS,MAAM;AAAA,IACf,OAAO,MAAM;AAAA,IACb,YAAY,MAAM,KAAK;AAAA,EAAA;AAE3B,CAAC;AAKD,MAAM,sBAAsBA,MAAAA;AAAAA,EAC1B,CAAC,QAA8B;AAC7B,UAAM,OAAO,IAAI,uBAAuB;AACxC,UAAM,OAAO,IAAIC,sBAAa;AAC9B,UAAM,gBAAgB,IAAI,iBAAiB;AAC3C,WAAO;AAAA,MACL,GAAG;AAAA,MACH;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAAA,EACA,CAAC,KAAK,KAAKH,YAAgB;AAEzB,QAAI,OAAOA,YAAW,YAAY;AAChCA,gBAASA,QAAO,IAAI,mBAAmB,CAAC;AAAA,IAC1C;AACA,UAAM,EAAE,eAAe,MAAM,GAAG,SAASA;AACzC,QAAI,iBAAiB,MAAM;AACzB,UAAI,mBAAmB,aAAa;AAAA,IACtC;AAIA,QAAI,QAAQ,MAAM;AAChB,UAAIG,SAAAA,eAAe,IAAI;AAAA,IACzB;AACA,QAAI,OAAO,KAAK,IAAI,EAAE,SAAS,GAAG;AAChC,UAAI,yBAAyB,CAAC,OAAO,EAAE,GAAG,GAAG,GAAG,OAAO;AAAA,IACzD;AAAA,EACF;AACF;AAEA,SAAS,uBAAuB;AAC9B,QAAM,CAAC,OAAO,QAAQ,IAAIC,SAAAA,IAAI,IAAI,mBAAmB;AACrD,QAAM,WAAWC,MAAAA;AAAAA,IACf,CAAC,WACC,SAAS,CAAC,SAAS,mBAAmB,MAAM,MAAM,CAAC;AAAA,IACrD,CAAC,QAAQ;AAAA,EAAA;AAEX,SAAO,CAAC,OAAO,QAAQ;AACzB;AAEA,SAAS,2BACP,OACA,eACuB;AAGvB,QAAM,eACJ,OAAO,iBAAiB,WACpB,EAAE,KAAK,eAAe,WAAW,KAAA,IACjC;AACN,QAAM,cAAc,aAAa;AACjC,QAAM,UAAiC,MAAM,IAAI,CAAC,SAAS;AACzD,WAAO;AAAA,MACL,KAAK,KAAK;AAAA,MACV,WAAW,KAAK;AAAA,MAChB,YAAY,gBAAgB,OAAO,KAAK,aAAa;AAAA,IAAA;AAAA,EAEzD,CAAC;AAED,QAAM,oBAAoB,QAAQ,KAAK,CAAC,MAAM,EAAE,QAAQ,WAAW;AACnE,MAAI,mBAAmB;AACrB,YAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,UAAI,EAAE,QAAQ,YAAa,QAAO;AAClC,UAAI,EAAE,QAAQ,YAAa,QAAO;AAClC,aAAO;AAAA,IACT,CAAC;AAAA,EACH,OAAO;AACL,YAAQ,KAAK,YAAY;AAAA,EAC3B;AACA,SAAO;AACT;AAEO,SAAS,mBAAmB;AAGjC,QAAM,MAAMC,MAAAA,OAAkB,IAAI;AAElC,QAAM,mBAAmBF,SAAAA,IAAI,OAAO,iBAAiB;AAErD,SAAOC,MAAAA;AAAAA,IACLE,WAAAA,SAAS,CAAC,iBAA4B;AACpC,UACE,aAAa,eAAe,IAAI,SAAS,eACzC,aAAa,iBAAiB,IAAI,SAAS,eAC3C;AACA;AAAA,MACF;AACA,uBAAiB,YAAY;AAC7B,UAAI,UAAU;AAAA,IAChB,GAAG,GAAG;AAAA,IACN,CAAC,gBAAgB;AAAA,EAAA;AAErB;AAqEO,SAAS,oBACd,MACA,UAAsD,IAChC;AACtB,QAAM,WACJ,QAAQ,YAAY;AACtB,SAAO;AAAA,IACL;AAAA,IACA,MAAM,UAAU,EAAE,QAAQ,OAAO,OAAO,WAAW;AACjD,UAAI,OAAO;AACX,UAAI,WAAW,QAAQ,QAAQ,SAAS,GAAG;AACzC,eAAO,KAAK;AAAA,UAAO,CAAC,QAClB,QAAQ;AAAA,YAAM,CAAC,MACb,EAAE,aAAa,OAAO,EAAE,UAAU,KAAK,EAAE,KAAK,IAAI;AAAA,UAAA;AAAA,QACpD;AAAA,MAEJ;AACA,UAAI,SAAS,QAAQ,MAAM,SAAS,GAAG;AACrC,eAAO,CAAC,GAAG,IAAI,EAAE,KAAK,mBAAmB,KAAK,CAAC;AAAA,MACjD;AACA,aAAO;AAAA,QACL,MAAM,KAAK,MAAM,QAAQ,SAAS,KAAK;AAAA,QACvC,YAAY,KAAK;AAAA,MAAA;AAAA,IAErB;AAAA,EAAA;AAEJ;AAKA,MAAM,uCAAuB,QAAA;AAC7B,IAAI,uBAAuB;AAC3B,SAAS,qBAAqB,KAAuC;AACnE,MAAI,OAAO,KAAM,QAAO;AACxB,MAAI,IAAI,MAAM,KAAM,QAAO,IAAI;AAC/B,MAAI,OAAO,QAAQ,SAAU,QAAO;AACpC,MAAI,KAAK,iBAAiB,IAAI,GAAG;AACjC,MAAI,MAAM,MAAM;AACd,SAAK,SAAS,sBAAsB;AACpC,qBAAiB,IAAI,KAAK,EAAE;AAAA,EAC9B;AACA,SAAO;AACT;AAIO,SAAS,mBAAmB,OAAqB;AACtD,SAAO,CAAC,GAAQ,MAAmB;AACjC,eAAW,QAAQ,OAAO;AACxB,YAAM,KAAK,IAAI,KAAK,GAAG;AACvB,YAAM,KAAK,IAAI,KAAK,GAAG;AACvB,UAAI,MAAM,QAAQ,MAAM,KAAM;AAC9B,UAAI,MAAM,KAAM,QAAO,KAAK,YAAY,KAAK;AAC7C,UAAI,MAAM,KAAM,QAAO,KAAK,YAAY,IAAI;AAC5C,YAAM,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AACzC,UAAI,QAAQ,EAAG,QAAO,KAAK,YAAY,MAAM,CAAC;AAAA,IAChD;AACA,WAAO;AAAA,EACT;AACF;AAkBO,SAAS,cACd,YACA,UAA4B,IAC5B;AACA,QAAM,EAAE,WAAW,KAAK,YAAY,aAAa;AACjD,QAAM,CAAC,OAAO,QAAQ,IAAI,qBAAA;AAC1B,QAAM,gBAAgBH,SAAAA,IAAI,SAAS,iBAAiB;AACpD,QAAM,OAAOA,SAAAA,IAAI,SAAS,aAAa;AACvC,QAAM,UAAUA,SAAAA,IAAI,OAAO,aAAa;AACxC,QAAM,eAAeA,SAAAA,IAAI,SAAS,oBAAoB;AACtD,QAAM,cAAcI,SAAAA,YAAY,CAAC,MAAM,EAAE,WAAW;AACpD,QAAM,gBAAgBA,SAAAA,YAAY,CAAC,MAAM,EAAE,aAAa;AACxD,QAAM,WAAWF,MAAAA,OAA+B,IAAI;AAGpD,QAAM,YAAYA,MAAAA,OAA0C;AAAA,IAC1D,MAAM;AAAA,IACN,SAAS;AAAA,EAAA,CACV;AAED,QAAM,UAA6BG,MAAAA;AAAAA,IACjC,MACG,MAAM,KAAK,cAAc,QAAA,CAAS,EAAmB;AAAA,MACpD,CAAC,CAAC,IAAI,KAAK,OAAO;AAAA,QAChB;AAAA,QACA,WAAW,MAAM,QAAQ;AAAA,QACzB,OAAO,MAAM;AAAA,QACb,WAAW,MAAM,QAAQ;AAAA,MAAA;AAAA,IAC3B;AAAA,IAEJ,CAAC,aAAa;AAAA,EAAA;AAIhBC,QAAAA,UAAU,MAAM;AACd,aAAS,EAAE,MAAM,aAAa,WAAW,UAAoB;AAAA,EAC/D,GAAG,CAAC,WAAW,QAAQ,CAAC;AAKxB,QAAM,UAAUD,MAAAA;AAAAA,IACd,MAAM,KAAK,UAAU,EAAE,OAAO,aAAa,SAAS;AAAA,IACpD,CAAC,aAAa,OAAO;AAAA,EAAA;AAEvBC,QAAAA,UAAU,MAAM;AACd,aAAS,EAAE,MAAM,SAAS;AAC1B,YAAQ,CAAC;AAAA,EACX,GAAG,CAAC,SAAS,WAAW,YAAY,CAAC;AAErCC,eAAAA,eAAe,YAAY;AACzB,QAAI,MAAM,QAAS;AAKnB,QAAI;AACJ,QAAI,SAA6C;AACjD,QAAI,cAAc,SAAS;AAEzB,UACE,UAAU,QAAQ,SAAS,QAC3B,UAAU,QAAQ,YAAY,SAC9B;AACA;AAAA,MACF;AACA,eAAS,OAAO;AAAA,IAClB,OAAO;AACL,YAAM,WAAW,yBAAyB,MAAM,MAAM,aAAa;AACnE,UAAI,YAAY,QAAQ,MAAM,YAAa;AAC3C,eAAS,KAAK,OAAO,YAAY,KAAK,QAAQ,IAAI;AAClD,YAAM,OAAO,SAAS,IAAI,MAAM,KAAK,SAAS,CAAC,IAAI;AACnD,UAAI,QAAQ,KAAM,UAAS,EAAE,KAAK,MAAM,OAAO,SAAS,EAAA;AAAA,IAC1D;AAEA,aAAS,SAAS,MAAA;AAClB,UAAM,aAAa,IAAI,gBAAA;AACvB,aAAS,UAAU;AAEnB,aAAS,EAAE,MAAM,iBAAiB;AAClC,QAAI;AACF,YAAM,SAAS,MAAM,WAAW;AAAA,QAC9B;AAAA,QACA,OAAO;AAAA,QACP,QAAQ,WAAW;AAAA,QACnB,OAAO;AAAA,QACP;AAAA,QACA;AAAA,MAAA,CACD;AACD,UAAI,WAAW,OAAO,QAAS;AAC/B,YAAM,OAAO,OAAO,QAAQ,CAAA;AAC5B,UAAI,cAAc,SAAS;AACzB,kBAAU,UAAU,EAAE,MAAM,QAAA;AAG5B,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,WAAW,KAAK;AAAA,UAChB,YAAY,OAAO,cAAc;AAAA,QAAA,CAClC;AAAA,MACH,OAAO;AAOL,cAAM,YAAY,SAAS,KAAK;AAChC,YAAI;AACJ,YAAI,OAAO,cAAc,MAAM;AAC7B,sBAAY,OAAO;AAAA,QACrB,OAAO;AACL,gBAAM,aAAa,KAAK,SAAS;AACjC,sBAAY,aAAa,YAAY,YAAY;AAAA,QACnD;AACA,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,MAAM;AAAA,UACN;AAAA,UACA;AAAA;AAAA;AAAA;AAAA,UAIA,YAAY,OAAO;AAAA,QAAA,CACpB;AAAA,MACH;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,CAAC,WAAW,OAAO,SAAS;AAC9B,iBAAS,EAAE,MAAM,SAAS,OAAO,KAAc;AAAA,MACjD;AAAA,IACF;AAAA,EACF,GAAG,CAAC,MAAM,MAAM,eAAe,SAAS,MAAM,SAAS,CAAC;AAExD,SAAO,EAAE,MAAM,MAAM,MAAM,SAAS,MAAM,SAAS,OAAO,MAAM,MAAA;AAClE;AAUO,SAAS,0BAAmC,QAclC;AACf,QAAM,YAAY,OAAO,mBAAmB;AAC5C,SAAO,OAAO,EAAE,OAAO,QAAQ,OAAO,SAAS,aAAa;AAC1D,UAAM,SAAS,IAAIC,YAAAA,gBAAgB,OAAO,QAAQ,EAAE,KAAK,OAAO,KAAK;AAErE,UAAM,QAA+B;AAAA,MACnC,GAAI,OAAO,aAAa,CAAA;AAAA,MACxB,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,WAAW,EAAE,UAAA,EAAY;AAAA,IAAA;AAG9D,UAAM,YAA+B,CAAA;AACrC,QAAI,OAAO,cAAc,MAAM;AAC7B,YAAM,QAAQ,OAAO;AACrB,gBAAU,KAAK,EAAE,MAAM,UAAU,OAAO;AAAA,IAC1C;AACA,eAAW,KAAK,SAAS;AACvB,YAAM,KAAK,UAAU,CAAC;AACtB,UAAI,MAAM,KAAM,WAAU,KAAK,EAAE;AAAA,IACnC;AAEA,UAAM,QAAQ,WAAW,QAAQ;AAAA,MAC/B,SAAS,OAAO;AAAA;AAAA,MAEhB,OAAO,UAAU,OAAO,UAAU;AAAA,MAClC;AAAA,MACA,aAAa,OAAO;AAAA,MACpB;AAAA,MACA,SAAS;AAAA,MACT,eAAe,QAAQ,OAAO;AAAA,MAC9B,oBAAoB,QAAQ,SAAS;AAAA,IAAA,CACtC;AAED,UAAM,MAAW,MAAM;AACvB,QAAI,OAAO,QAAS,QAAO,EAAE,MAAM,CAAA,EAAC;AACpC,QAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAClC,UAAM,OAAO,KAAK,QAAQ,CAAA;AAC1B,WAAO,KAAK,SAAS,OAAO,EAAE,MAAM,YAAY,IAAI,UAAU,EAAE,KAAA;AAAA,EAClE;AACF;AAQO,SAAS,wBAAiC,QAUxB;AACvB,QAAM,OAAO,MAAM,IAAIA,4BAAgB,OAAO,QAAQ,EAAE,KAAK,OAAO,KAAK;AACzE,SAAO;AAAA,IACL,WAAW,0BAA6B,MAAM;AAAA,IAC9C,UAAU,CAAC,QAAa,MAAM,OAAO,WAAW;AAAA,IAChD,MAAM,SAAS,MAAM;AACnB,YAAM,MAAW,MAAM,OAAO,OAAO,MAAe;AAAA,QAClD,eAAe;AAAA,MAAA,CAChB;AACD,UAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAAA,IACpC;AAAA,IACA,MAAM,WAAW,KAAK;AACpB,YAAM,MAAW,MAAM,OAAO,SAAS,GAAG,OAAO,aAAa,GAAG;AACjE,UAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAAA,IACpC;AAAA,EAAA;AAEJ;AAKA,SAAS,qBAAqB,GAA4C;AACxE,QAAM,IAAI,EAAE;AACZ,MAAI,KAAK,KAAM,QAAO;AACtB,QAAM,MAAM,EAAE,aAAa,EAAE;AAC7B,MAAI,OAAO,QAAQ,EAAE,YAAY,QAAQ,EAAE,SAAS,QAAQ,EAAE,UAAU,IAAI;AAC1E,WAAO,kBAAkB,EAAE,KAAK,UAAU,EAAE,UAAU,OAAO,EAAE,OAAO;AAAA,EACxE;AACA,SAAO;AACT;AAEA,SAAS,yBACP,MACA,QACe;AACf,WAAS,IAAI,OAAO,eAAe,IAAI,OAAO,aAAa,KAAK;AAC9D,QAAI,KAAK,CAAC,KAAK,MAAM;AACnB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;;;;;;;;;;;;;"}
1
+ {"version":3,"file":"data-loaders.cjs","sources":["../../src/postgrest-table/data-loaders.ts"],"sourcesContent":["/** Lazy loading of data from a PostgREST endpoint */\n\nimport { useAsyncEffect } from \"@macrostrat/ui-components\";\nimport { debounce, range } from \"underscore\";\nimport { useCallback, useEffect, useMemo, useRef } from \"react\";\nimport update, { Spec } from \"immutability-helper\";\nimport {\n PostgrestClient,\n PostgrestFilterBuilder,\n PostgrestQueryBuilder,\n} from \"@supabase/postgrest-js\";\nimport { adjustArraySize, RowRegion } from \"./loading-utils.ts\";\nimport { ctx, tableDataAtom, useSelector } from \"../provider.ts\";\nimport { atom } from \"jotai\";\nimport type { ColumnSort } from \"../types.ts\";\n\nexport type FetchMode = \"scroll\" | \"paged\";\n\ninterface LazyLoaderStateCore<T> {\n loading: boolean;\n error: Error | null;\n initialized: boolean;\n /** Reported source length when known (null = unknown / not reported). */\n totalCount: number | null;\n /** Windowing style: infinite-scroll windows, or one fixed page at a time. */\n fetchMode: FetchMode;\n /** Rows per chunk/page. */\n pageSize: number;\n}\n\ninterface LazyLoaderState<T> extends LazyLoaderStateCore<T> {\n data: (T | null)[];\n visibleRegion: RowRegion;\n}\n\nexport interface PostgrestOrder<T> {\n key: string;\n ascending?: boolean;\n nullsFirst?: boolean;\n}\n\n/** Operators available for server-side column filtering via PostgREST. */\nexport type PostgrestFilterOperator =\n | \"eq\"\n | \"neq\"\n | \"like\"\n | \"ilike\"\n | \"gt\"\n | \"lt\"\n | \"gte\"\n | \"lte\"\n | \"is\";\n\n/** A single column sort entry. */\nexport interface ColumnSortEntry {\n key: string;\n ascending: boolean;\n}\n\n/** A single column filter entry. */\nexport interface PostgrestColumnFilter {\n key: string;\n operator: PostgrestFilterOperator;\n value: string;\n}\n\nexport interface PostgrestFilter {\n type: \"filter\";\n apply(\n req: PostgrestFilterBuilder<any, any, any, any>,\n ): PostgrestFilterBuilder<any, any, any, any>;\n}\n\nexport function standardizeFilter(\n columnFilter: PostgrestColumnFilter,\n): PostgrestFilter {\n return {\n type: \"filter\",\n apply(req) {\n return applyColumnFilters(req, [columnFilter]);\n },\n };\n}\n\nexport function applyColumnFilters(\n req: PostgrestFilterBuilder<any, any, any, any>,\n filters: PostgrestColumnFilter[],\n) {\n for (const cf of filters) {\n if (cf.value === \"\" || cf.value == null) continue;\n const val =\n cf.operator === \"like\" || cf.operator === \"ilike\"\n ? `*${cf.value}*`\n : cf.value;\n req = req.filter(cf.key, cf.operator, val);\n }\n return req;\n}\n\ntype LazyLoaderAction<T> =\n | { type: \"start-loading\" }\n | {\n type: \"loaded\";\n data: T[];\n offset: number;\n totalSize: number;\n totalCount?: number | null;\n }\n | { type: \"error\"; error: Error }\n | { type: \"update-data\"; changes: Spec<T[]> }\n | { type: \"reset\" }\n | { type: \"configure\"; fetchMode: FetchMode; pageSize: number };\n\nfunction lazyLoadingReducer<T>(\n state: LazyLoaderState<T>,\n action: LazyLoaderAction<T>,\n): LazyLoaderState<T> {\n switch (action.type) {\n case \"start-loading\":\n return {\n ...state,\n loading: true,\n initialized: true,\n };\n case \"update-data\":\n return {\n ...state,\n loading: false,\n data: update(state.data, action.changes),\n };\n case \"loaded\":\n let data = adjustArraySize(state.data, action.totalSize);\n const newData = action.data ?? [];\n const offset = action.offset ?? 0;\n data = [\n ...data.slice(0, offset),\n ...newData,\n ...data.slice(offset + newData.length),\n ];\n return {\n ...state,\n data,\n loading: false,\n totalCount:\n action.totalCount !== undefined\n ? action.totalCount\n : state.totalCount,\n };\n case \"configure\":\n return {\n ...state,\n fetchMode: action.fetchMode,\n pageSize: action.pageSize,\n };\n case \"reset\":\n // A view change (or initial load) re-fetches from scratch. Rather than\n // blanking the table (which reads as a jarring empty flash while the\n // request is in flight — very visible on sort/filter), pre-size to a page\n // of `null` ghost/skeleton rows so the body stays populated and the load\n // is legible. `loaded` then adjusts the array to the real size.\n return {\n visibleRegion: defaultVisibleRegion,\n data: new Array(Math.max(state.pageSize, 0)).fill(null),\n loading: false,\n error: null,\n initialized: false,\n totalCount: null,\n fetchMode: state.fetchMode,\n pageSize: state.pageSize,\n };\n case \"error\":\n return {\n ...state,\n error: action.error,\n loading: false,\n };\n default:\n return state;\n }\n}\n\ntype SortAndFilterOptions = {\n /** Column-level sort state, managed externally. When provided, overrides\n * the `order` prop for query building. */\n order?: PostgrestOrder<any>[];\n filters?: PostgrestFilter[];\n};\n\ninterface QueryConfig extends SortAndFilterOptions {\n columns?: string | string[];\n count?: \"exact\" | \"estimated\";\n limit?: number;\n identityKey: string;\n lastLoadedRow?: any;\n lastLoadedRowIndex: number;\n}\n\nfunction buildQuery<T>(\n client: PostgrestQueryBuilder<T, any, any>,\n config: QueryConfig,\n) {\n const { columns = \"*\", count, lastLoadedRowIndex } = config;\n const opts = { count };\n\n let cols: string;\n if (Array.isArray(columns)) {\n cols = columns.join(\", \");\n } else {\n cols = columns ?? \"*\";\n }\n\n let query = client.select(cols, opts);\n\n const filters = config.filters ?? [];\n for (const filter of filters) {\n query = filter.apply(query);\n }\n\n const orderClauses = buildPostgrestOrderClauses(\n config.order ?? [],\n config.identityKey,\n );\n\n let hasOrdering = false;\n for (const clause of orderClauses) {\n query = query.order(clause.key, clause);\n if (config.lastLoadedRow != null) {\n const op = (clause.ascending ?? true) ? \"gt\" : \"lt\";\n const value = config.lastLoadedRow[clause.key];\n query = query[op](clause.key, value);\n }\n hasOrdering = true;\n }\n\n let offset = null;\n if (!hasOrdering && lastLoadedRowIndex > 0) {\n // We need to load based on offsets\n offset = lastLoadedRowIndex + 1;\n }\n\n if (config.limit != null) {\n if (offset != null) {\n query = query.range(offset, offset + config.limit - 1);\n console.log(`Random seek from ${offset}, this will be slow`);\n } else {\n query = query.limit(config.limit);\n }\n }\n\n console.log(\"query\", query.url.search);\n return query;\n}\n\nconst defaultVisibleRegion: RowRegion = {\n rowIndexStart: 0,\n rowIndexEnd: 0,\n};\n\n/** Atom to house the current visible region of the table */\nconst visibleRegionAtom = atom<RowRegion>(defaultVisibleRegion);\n\nconst lazyLoaderCoreStateAtom = atom<LazyLoaderStateCore<any>>({\n loading: false,\n error: null,\n initialized: false,\n totalCount: null,\n fetchMode: \"scroll\",\n pageSize: 100,\n});\n\n/** Current page index (0-based) for paged fetch mode. */\nexport const chunkPageAtom = atom(0);\n\n/** Bump this to force the active chunk loader to reset and re-fetch from\n * scratch — e.g. after a mutation (save/delete) that invalidates loaded rows. */\nexport const dataRefreshTokenAtom = atom(0);\n\n/** Footer state for the optional bottom-of-table indicator: rows loaded, the\n * source total when known, load status, and — in paged mode — the current\n * page and total pages. */\nexport interface TableFooterInfo {\n mode: FetchMode;\n loaded: number;\n total: number | null;\n loading: boolean;\n page: number;\n pageSize: number;\n totalPages: number | null;\n}\n\nexport const tableFooterAtom = atom<TableFooterInfo>((get) => {\n const core = get(lazyLoaderCoreStateAtom);\n const data = get(tableDataAtom) ?? [];\n let loaded = 0;\n let hasGaps = false;\n for (const row of data) {\n if (row != null) loaded++;\n else hasGaps = true;\n }\n // Total is known when the source reported it, or (scroll mode) when the array\n // is fully populated — otherwise it's still being discovered.\n const total = core.totalCount ?? (hasGaps ? null : data.length);\n const totalPages =\n core.totalCount != null ? Math.ceil(core.totalCount / core.pageSize) : null;\n return {\n mode: core.fetchMode,\n loaded,\n total,\n loading: core.loading,\n page: get(chunkPageAtom),\n pageSize: core.pageSize,\n totalPages,\n };\n});\n\nexport interface ViewInfo {\n visibleRegion: RowRegion;\n totalCount: number | null;\n loading: boolean;\n error: Error | null;\n}\n\nexport const viewInfoAtom = atom<ViewInfo>((get) => {\n const state = get(lazyLoaderStateAtom);\n return {\n visibleRegion: state.visibleRegion,\n loading: state.loading,\n error: state.error,\n totalCount: state.data.length,\n };\n});\n\n/** Temporary passthrough atom to allow visible region to be separated from the rest\n * of the lazy loader state\n */\nconst lazyLoaderStateAtom = atom(\n (get): LazyLoaderState<any> => {\n const core = get(lazyLoaderCoreStateAtom);\n const data = get(tableDataAtom);\n const visibleRegion = get(visibleRegionAtom);\n return {\n ...core,\n data,\n visibleRegion,\n };\n },\n (get, set, update: any) => {\n // Split the state between several places\n if (typeof update === \"function\") {\n update = update(get(lazyLoaderStateAtom));\n }\n const { visibleRegion, data, ...rest } = update;\n if (visibleRegion != null) {\n set(visibleRegionAtom, visibleRegion);\n }\n // Propagate the data array even when empty — a `reset` (view change) must\n // clear the stale rows so the re-fetch rebuilds a correctly-sized array\n // (otherwise a filtered/sorted result splices over a stale, larger array).\n if (data != null) {\n set(tableDataAtom, data);\n }\n if (Object.keys(rest).length > 1) {\n set(lazyLoaderCoreStateAtom, (v) => ({ ...v, ...rest }));\n }\n },\n);\n\nfunction useLazyLoaderReducer() {\n const [state, setState] = ctx.use(lazyLoaderStateAtom);\n const dispatch = useCallback(\n (action: LazyLoaderAction<any>) =>\n setState((prev) => lazyLoadingReducer(prev, action)),\n [setState],\n );\n return [state, dispatch] as const;\n}\n\nfunction buildPostgrestOrderClauses(\n sorts: (ColumnSortEntry | PostgrestOrder<any>)[],\n identityOrder: PostgrestOrder<any> | string,\n): PostgrestOrder<any>[] {\n // Clause to build ordering for a Postgrest table.\n // There must be an ordering by identity key, and it must be last...\n const identitySort =\n typeof identityOrder == \"string\"\n ? { key: identityOrder, ascending: true }\n : identityOrder;\n const identityKey = identitySort.key;\n const clauses: PostgrestOrder<any>[] = sorts.map((sort) => {\n return {\n key: sort.key,\n ascending: sort.ascending,\n nullsFirst: \"nullsFirst\" in sort ? sort.nullsFirst : false,\n };\n });\n // sort the clauses so the identity clause is last\n const hasIdentityClause = clauses.some((d) => d.key === identityKey);\n if (hasIdentityClause) {\n clauses.sort((a, b) => {\n if (a.key === identityKey) return 1;\n if (b.key === identityKey) return -1;\n return 0;\n });\n } else {\n clauses.push(identitySort);\n }\n return clauses;\n}\n\nexport function useScrollHandler() {\n /** A standardized approach to holding onto the scroll position for the table */\n // Reference to hold onto the scroll position\n const ref = useRef<RowRegion>(null);\n\n const setVisibleRegion = ctx.useSet(visibleRegionAtom);\n\n return useCallback(\n debounce((visibleCells: RowRegion) => {\n if (\n visibleCells.rowIndexEnd == ref.current?.rowIndexEnd &&\n visibleCells.rowIndexStart == ref.current?.rowIndexStart\n ) {\n return;\n }\n setVisibleRegion(visibleCells);\n ref.current = visibleCells;\n }, 500),\n [setVisibleRegion],\n );\n}\n\n/** The active view state (a filter's id / column / config), passed to a\n * `fetchChunk`. A server provider translates `columnKey` + `state` into a\n * query; a local (in-memory) provider applies `predicate` directly. Both come\n * from the same `TableFilter`, so one filter definition serves either target. */\nexport interface FetchDataFilter {\n id: string;\n columnKey?: string;\n state: any;\n /** Client-side row predicate (from the `TableFilter`). Server providers\n * ignore it and translate `columnKey` + `state` instead. */\n predicate?: (row: any, state: any) => boolean;\n}\n\n/** Parameters passed to a `fetchChunk` implementation for one window. */\nexport interface FetchDataParams {\n /** Row offset of the requested chunk (chunk-aligned). */\n offset: number;\n /** Maximum rows to return. */\n limit: number;\n /** Aborts when the request is superseded (view change / unmount). */\n signal: AbortSignal;\n /** Active sorts, in priority order. */\n sorts: ColumnSort[];\n /** Active filters (id + column + config). */\n filters: FetchDataFilter[];\n /** In scroll mode, the already-loaded row immediately before this chunk\n * (and its data-array index), or `null` at the start / in paged mode. Keyset\n * sources can page from this cursor (e.g. `WHERE key > cursor`) instead of a\n * slow `OFFSET`; offset-based sources can ignore it. */\n cursor?: { row: any; index: number } | null;\n}\n\n/** Result of a `fetchChunk` call. `totalCount` reports the source length when\n * known (drives sparse-array pre-sizing and a proportional scrollbar); omit it\n * for unknown-length sources (the array grows as chunks arrive). */\nexport interface FetchDataResult<T = any> {\n rows: T[];\n totalCount?: number | null;\n}\n\nexport type FetchData<T = any> = (\n params: FetchDataParams,\n) => Promise<FetchDataResult<T>>;\n\n/**\n * A table's data source, addressed uniformly whether it's an in-memory array or\n * a remote backend. `fetchChunk` returns a window with the active sorts/filters\n * already applied (in memory by the local provider, in SQL by a server one);\n * `identity` addresses a row for edits/mutations — stable across re-sorts,\n * unlike an array index. The mutation ops are present only for editable /\n * persisting sources. The in-memory case (`createLocalProvider`) is just the\n * degenerate implementation, so local and server tables share one path.\n */\nexport interface TableDataProvider<T = any> {\n fetchData(params: FetchDataParams): Promise<FetchDataResult<T>>;\n identity(row: T): string | number;\n saveRows?(rows: T[]): Promise<void>;\n deleteRows?(ids: Array<string | number>): Promise<void>;\n insertRow?(row: Partial<T>): Promise<void>;\n}\n\n/**\n * The degenerate provider: an in-memory array. `fetchChunk` applies the active\n * filter predicates and sorts over the array and returns the requested slice\n * plus the (fully-known) total — the same view engine used for client-side\n * tables, expressed as a provider.\n */\nexport function createLocalProvider<T = any>(\n data: T[],\n options: { identity?: (row: T) => string | number } = {},\n): TableDataProvider<T> {\n const identity: (row: T) => string | number =\n options.identity ?? defaultLocalIdentity;\n return {\n identity,\n async fetchData({ offset, limit, sorts, filters }) {\n let rows = data;\n if (filters != null && filters.length > 0) {\n rows = rows.filter((row) =>\n filters.every((f) =>\n f.predicate != null ? f.predicate(row, f.state) : true,\n ),\n );\n }\n if (sorts != null && sorts.length > 0) {\n rows = [...rows].sort(compareRowsBySorts(sorts));\n }\n return {\n rows: rows.slice(offset, offset + limit),\n totalCount: rows.length,\n };\n },\n };\n}\n\n// Stable synthetic identity for in-memory rows lacking a natural `id`. Keyed by\n// object reference (a local data array keeps the same row objects across\n// re-sorts), so edits survive re-ordering even without an id field.\nconst _syntheticRowIds = new WeakMap<object, string>();\nlet _syntheticRowCounter = 0;\nfunction defaultLocalIdentity(row: any): string | number | undefined {\n if (row == null) return undefined;\n if (row.id != null) return row.id;\n if (typeof row !== \"object\") return row;\n let id = _syntheticRowIds.get(row);\n if (id == null) {\n id = `__row_${_syntheticRowCounter++}`;\n _syntheticRowIds.set(row, id);\n }\n return id;\n}\n\n/** Multi-key row comparator (priority order; nulls first when ascending),\n * shared by the local provider and any other in-memory sort. */\nexport function compareRowsBySorts(sorts: ColumnSort[]) {\n return (a: any, b: any): number => {\n for (const sort of sorts) {\n const av = a?.[sort.key];\n const bv = b?.[sort.key];\n if (av == null && bv == null) continue;\n if (av == null) return sort.ascending ? -1 : 1;\n if (bv == null) return sort.ascending ? 1 : -1;\n const cmp = av < bv ? -1 : av > bv ? 1 : 0;\n if (cmp !== 0) return sort.ascending ? cmp : -cmp;\n }\n return 0;\n };\n}\n\nexport interface FetchDataOptions {\n pageSize?: number;\n fetchMode?: FetchMode;\n}\n\n/**\n * A generic, backend-agnostic windowed data source. Give it a `fetchChunk`\n * function and it drives the sheet's lazy loading: it loads the chunk covering\n * the first unloaded visible row, pre-sizes the sparse array from `totalCount`,\n * threads the active sorts/filters through so the source can apply them\n * server-side, and re-fetches from scratch when the view state changes. This\n * is the unified seam that upstreams bespoke loaders (`fetchChunk` receives the\n * view state; there's no separate adapter object).\n *\n * Call it from a component rendered inside `DataSheet` (see `ChunkLoaderManager`).\n */\nexport function useDataLoader<T = any>(\n fetchChunk: FetchData<T>,\n options: FetchDataOptions = {},\n) {\n const { pageSize = 100, fetchMode = \"scroll\" } = options;\n const [state, dispatch] = useLazyLoaderReducer();\n const visibleRegion = ctx.useValue(visibleRegionAtom);\n const page = ctx.useValue(chunkPageAtom);\n const setPage = ctx.useSet(chunkPageAtom);\n const refreshToken = ctx.useValue(dataRefreshTokenAtom);\n const columnSorts = useSelector((s) => s.columnSorts);\n const activeFilters = useSelector((s) => s.activeFilters);\n const abortRef = useRef<AbortController | null>(null);\n // Tracks the (page, viewKey) already loaded in paged mode, so the effect\n // doesn't re-fetch on unrelated re-renders.\n const loadedRef = useRef<{ page: number; viewKey: string }>({\n page: -1,\n viewKey: \"\",\n });\n\n const filters: FetchDataFilter[] = useMemo(\n () =>\n (Array.from(activeFilters.entries()) as [any, any][]).map(\n ([id, entry]) => ({\n id,\n columnKey: entry.filter?.columnKey,\n state: entry.state,\n predicate: entry.filter?.predicate,\n }),\n ),\n [activeFilters],\n );\n\n // Publish the windowing config so the footer/pager can read it.\n useEffect(() => {\n dispatch({ type: \"configure\", fetchMode, pageSize: pageSize });\n }, [fetchMode, pageSize]);\n\n // Reset (re-fetch from scratch) when sorts/filters change, or when the fetch\n // mode switches (paged holds a dense page; scroll needs to re-initialize and\n // pre-size) — so a table can flip between modes cleanly.\n const viewKey = useMemo(\n () => JSON.stringify({ sorts: columnSorts, filters }),\n [columnSorts, filters],\n );\n useEffect(() => {\n dispatch({ type: \"reset\" });\n setPage(0);\n }, [viewKey, fetchMode, refreshToken]);\n\n useAsyncEffect(async () => {\n if (state.loading) return;\n\n // Determine the chunk offset to fetch, and (scroll mode) a keyset cursor:\n // the already-loaded row just before the chunk, so keyset sources can page\n // from it instead of a slow OFFSET.\n let offset: number;\n let cursor: { row: any; index: number } | null = null;\n if (fetchMode === \"paged\") {\n // Fetch the current page once; skip if already loaded for this view.\n if (\n loadedRef.current.page === page &&\n loadedRef.current.viewKey === viewKey\n ) {\n return;\n }\n offset = page * pageSize;\n } else {\n const rowIndex = indexOfFirstNullInRegion(state.data, visibleRegion);\n if (rowIndex == null && state.initialized) return;\n offset = Math.floor((rowIndex ?? 0) / pageSize) * pageSize;\n const prev = offset > 0 ? state.data[offset - 1] : null;\n if (prev != null) cursor = { row: prev, index: offset - 1 };\n }\n\n abortRef.current?.abort();\n const controller = new AbortController();\n abortRef.current = controller;\n\n dispatch({ type: \"start-loading\" });\n try {\n const result = await fetchChunk({\n offset,\n limit: pageSize,\n signal: controller.signal,\n sorts: columnSorts,\n filters,\n cursor,\n });\n if (controller.signal.aborted) return;\n const rows = result.rows ?? [];\n if (fetchMode === \"paged\") {\n loadedRef.current = { page, viewKey };\n // The sheet shows just this page's rows (dense, from index 0); the\n // real source length is tracked separately for the pager.\n dispatch({\n type: \"loaded\",\n data: rows,\n offset: 0,\n totalSize: rows.length,\n totalCount: result.totalCount ?? null,\n });\n } else {\n // Size the (sparse) array. With a known total, size to it. Without one\n // (keyset / infinite scroll), use the short-chunk heuristic: a chunk\n // smaller than the page size means we've hit the end — size exactly to\n // the loaded rows; otherwise pad one more page of nulls so scrolling\n // into them triggers the next fetch. So an unknown-length source never\n // needs a count — it grows a page at a time until a short chunk.\n const loadedEnd = offset + rows.length;\n let totalSize: number;\n if (result.totalCount != null) {\n totalSize = result.totalCount;\n } else {\n const reachedEnd = rows.length < pageSize;\n totalSize = reachedEnd ? loadedEnd : loadedEnd + pageSize;\n }\n dispatch({\n type: \"loaded\",\n data: rows,\n offset,\n totalSize,\n // Preserve a previously-known total when a chunk omits it (undefined):\n // keyset pages can't re-count (the cursor filter would skew it), so\n // only the initial cursorless fetch reports the total.\n totalCount: result.totalCount,\n });\n }\n } catch (err) {\n if (!controller.signal.aborted) {\n dispatch({ type: \"error\", error: err as Error });\n }\n }\n }, [state.data, visibleRegion, viewKey, page, fetchMode]);\n\n return { data: state.data, loading: state.loading, error: state.error };\n}\n\n/**\n * Build a `fetchChunk` backed by a PostgREST endpoint, for use with\n * `useChunkLoader` / `ChunkLoaderManager`. It reuses `buildQuery`, so it pages\n * with **keyset pagination** (via the loader's `cursor`) whenever the query is\n * ordered — falling back to `OFFSET` only when it isn't — and threads the\n * active store sorts/filters into the query. The total count is requested only\n * on the initial (cursorless) fetch, since a keyset cursor filter would skew it.\n */\nexport function createPostgRESTFetchChunk<T = any>(config: {\n endpoint: string;\n table: string;\n identityKey: string;\n columns?: string | string[];\n /** Order applied before the active column sorts (identity key appended last). */\n baseOrder?: PostgrestOrder<any>[];\n /** A transform over the query builder, applied as a base filter (the `filter` prop). */\n baseFilter?: (\n q: PostgrestFilterBuilder<any, any, any, any>,\n ) => PostgrestFilterBuilder<any, any, any, any>;\n /** Translate a stored filter entry to a `PostgrestFilter` (return `null` to\n * skip). Defaults to the `{ key, operator, value }` column-filter shape. */\n translateFilter?: (f: FetchDataFilter) => PostgrestFilter | null;\n}): FetchData<T> {\n const translate = config.translateFilter ?? standardColumnFilter;\n return async ({ limit, signal, sorts, filters, cursor }) => {\n const client = new PostgrestClient(config.endpoint).from(config.table);\n\n const order: PostgrestOrder<any>[] = [\n ...(config.baseOrder ?? []),\n ...sorts.map((s) => ({ key: s.key, ascending: s.ascending })),\n ];\n\n const pgFilters: PostgrestFilter[] = [];\n if (config.baseFilter != null) {\n const apply = config.baseFilter;\n pgFilters.push({ type: \"filter\", apply });\n }\n for (const f of filters) {\n const pf = translate(f);\n if (pf != null) pgFilters.push(pf);\n }\n\n const query = buildQuery(client, {\n columns: config.columns,\n // Only the initial (cursorless) fetch reports an accurate total.\n count: cursor == null ? \"exact\" : undefined,\n limit,\n identityKey: config.identityKey,\n order,\n filters: pgFilters,\n lastLoadedRow: cursor?.row ?? null,\n lastLoadedRowIndex: cursor?.index ?? -1,\n });\n\n const res: any = await query;\n if (signal.aborted) return { rows: [] };\n if (res?.error != null) throw res.error;\n const rows = res?.data ?? [];\n return res?.count != null ? { rows, totalCount: res.count } : { rows };\n };\n}\n\n/**\n * A full PostgREST `TableDataProvider`: the read side (`fetchData` + row\n * `identity`) plus persistence — `saveRows` (upsert) and `deleteRows` (by\n * identity). Pass it to `DataSheet`'s `provider` prop. The mutation methods\n * throw on error so the Save action surfaces it.\n */\nexport function createPostgRESTProvider<T = any>(config: {\n endpoint: string;\n table: string;\n identityKey: string;\n columns?: string | string[];\n baseOrder?: PostgrestOrder<any>[];\n baseFilter?: (\n q: PostgrestFilterBuilder<any, any, any, any>,\n ) => PostgrestFilterBuilder<any, any, any, any>;\n translateFilter?: (f: FetchDataFilter) => PostgrestFilter | null;\n}): TableDataProvider<T> {\n const from = () => new PostgrestClient(config.endpoint).from(config.table);\n return {\n fetchData: createPostgRESTFetchChunk<T>(config),\n identity: (row: any) => row?.[config.identityKey],\n async saveRows(rows) {\n const res: any = await from().upsert(rows as any[], {\n defaultToNull: false,\n });\n if (res?.error != null) throw res.error;\n },\n async deleteRows(ids) {\n const res: any = await from().delete().in(config.identityKey, ids);\n if (res?.error != null) throw res.error;\n },\n };\n}\n\n/** Default filter translation for the built-in operator `columnFilter`: its\n * column is `f.columnKey`, its state is `{ operator, value }`. (Also accepts a\n * `key` in state for hand-rolled filters.) */\nfunction standardColumnFilter(f: FetchDataFilter): PostgrestFilter | null {\n const s = f.state;\n if (s == null) return null;\n const key = f.columnKey ?? s.key;\n if (key != null && s.operator != null && s.value != null && s.value !== \"\") {\n return standardizeFilter({ key, operator: s.operator, value: s.value });\n }\n return null;\n}\n\nfunction indexOfFirstNullInRegion(\n data: any[],\n region: RowRegion,\n): number | null {\n for (let i = region.rowIndexStart; i < region.rowIndexEnd; i++) {\n if (data[i] == null) {\n return i;\n }\n }\n return null;\n}\n"],"names":["update","adjustArraySize","atom","tableDataAtom","ctx","useCallback","useRef","debounce","useSelector","useMemo","useEffect","useAsyncEffect","PostgrestClient"],"mappings":";;;;;;;;;;;;AAyEO,SAAS,kBACd,cACiB;AACjB,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,KAAK;AACT,aAAO,mBAAmB,KAAK,CAAC,YAAY,CAAC;AAAA,IAC/C;AAAA,EAAA;AAEJ;AAEO,SAAS,mBACd,KACA,SACA;AACA,aAAW,MAAM,SAAS;AACxB,QAAI,GAAG,UAAU,MAAM,GAAG,SAAS,KAAM;AACzC,UAAM,MACJ,GAAG,aAAa,UAAU,GAAG,aAAa,UACtC,IAAI,GAAG,KAAK,MACZ,GAAG;AACT,UAAM,IAAI,OAAO,GAAG,KAAK,GAAG,UAAU,GAAG;AAAA,EAC3C;AACA,SAAO;AACT;AAgBA,SAAS,mBACP,OACA,QACoB;AACpB,UAAQ,OAAO,MAAA;AAAA,IACb,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,SAAS;AAAA,QACT,aAAa;AAAA,MAAA;AAAA,IAEjB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,SAAS;AAAA,QACT,MAAMA,gBAAAA,QAAO,MAAM,MAAM,OAAO,OAAO;AAAA,MAAA;AAAA,IAE3C,KAAK;AACH,UAAI,OAAOC,aAAAA,gBAAgB,MAAM,MAAM,OAAO,SAAS;AACvD,YAAM,UAAU,OAAO,QAAQ,CAAA;AAC/B,YAAM,SAAS,OAAO,UAAU;AAChC,aAAO;AAAA,QACL,GAAG,KAAK,MAAM,GAAG,MAAM;AAAA,QACvB,GAAG;AAAA,QACH,GAAG,KAAK,MAAM,SAAS,QAAQ,MAAM;AAAA,MAAA;AAEvC,aAAO;AAAA,QACL,GAAG;AAAA,QACH;AAAA,QACA,SAAS;AAAA,QACT,YACE,OAAO,eAAe,SAClB,OAAO,aACP,MAAM;AAAA,MAAA;AAAA,IAEhB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,WAAW,OAAO;AAAA,QAClB,UAAU,OAAO;AAAA,MAAA;AAAA,IAErB,KAAK;AAMH,aAAO;AAAA,QACL,eAAe;AAAA,QACf,MAAM,IAAI,MAAM,KAAK,IAAI,MAAM,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,QACtD,SAAS;AAAA,QACT,OAAO;AAAA,QACP,aAAa;AAAA,QACb,YAAY;AAAA,QACZ,WAAW,MAAM;AAAA,QACjB,UAAU,MAAM;AAAA,MAAA;AAAA,IAEpB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,OAAO,OAAO;AAAA,QACd,SAAS;AAAA,MAAA;AAAA,IAEb;AACE,aAAO;AAAA,EAAA;AAEb;AAkBA,SAAS,WACP,QACA,QACA;AACA,QAAM,EAAE,UAAU,KAAK,OAAO,uBAAuB;AACrD,QAAM,OAAO,EAAE,MAAA;AAEf,MAAI;AACJ,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,WAAO,QAAQ,KAAK,IAAI;AAAA,EAC1B,OAAO;AACL,WAAO,WAAW;AAAA,EACpB;AAEA,MAAI,QAAQ,OAAO,OAAO,MAAM,IAAI;AAEpC,QAAM,UAAU,OAAO,WAAW,CAAA;AAClC,aAAW,UAAU,SAAS;AAC5B,YAAQ,OAAO,MAAM,KAAK;AAAA,EAC5B;AAEA,QAAM,eAAe;AAAA,IACnB,OAAO,SAAS,CAAA;AAAA,IAChB,OAAO;AAAA,EAAA;AAGT,MAAI,cAAc;AAClB,aAAW,UAAU,cAAc;AACjC,YAAQ,MAAM,MAAM,OAAO,KAAK,MAAM;AACtC,QAAI,OAAO,iBAAiB,MAAM;AAChC,YAAM,KAAM,OAAO,aAAa,OAAQ,OAAO;AAC/C,YAAM,QAAQ,OAAO,cAAc,OAAO,GAAG;AAC7C,cAAQ,MAAM,EAAE,EAAE,OAAO,KAAK,KAAK;AAAA,IACrC;AACA,kBAAc;AAAA,EAChB;AAEA,MAAI,SAAS;AACb,MAAI,CAAC,eAAe,qBAAqB,GAAG;AAE1C,aAAS,qBAAqB;AAAA,EAChC;AAEA,MAAI,OAAO,SAAS,MAAM;AACxB,QAAI,UAAU,MAAM;AAClB,cAAQ,MAAM,MAAM,QAAQ,SAAS,OAAO,QAAQ,CAAC;AACrD,cAAQ,IAAI,oBAAoB,MAAM,qBAAqB;AAAA,IAC7D,OAAO;AACL,cAAQ,MAAM,MAAM,OAAO,KAAK;AAAA,IAClC;AAAA,EACF;AAEA,UAAQ,IAAI,SAAS,MAAM,IAAI,MAAM;AACrC,SAAO;AACT;AAEA,MAAM,uBAAkC;AAAA,EACtC,eAAe;AAAA,EACf,aAAa;AACf;AAGA,MAAM,oBAAoBC,MAAAA,KAAgB,oBAAoB;AAE9D,MAAM,0BAA0BA,MAAAA,KAA+B;AAAA,EAC7D,SAAS;AAAA,EACT,OAAO;AAAA,EACP,aAAa;AAAA,EACb,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,UAAU;AACZ,CAAC;AAGM,MAAM,gBAAgBA,MAAAA,KAAK,CAAC;AAI5B,MAAM,uBAAuBA,MAAAA,KAAK,CAAC;AAenC,MAAM,kBAAkBA,MAAAA,KAAsB,CAAC,QAAQ;AAC5D,QAAM,OAAO,IAAI,uBAAuB;AACxC,QAAM,OAAO,IAAIC,SAAAA,aAAa,KAAK,CAAA;AACnC,MAAI,SAAS;AACb,MAAI,UAAU;AACd,aAAW,OAAO,MAAM;AACtB,QAAI,OAAO,KAAM;AAAA,QACZ,WAAU;AAAA,EACjB;AAGA,QAAM,QAAQ,KAAK,eAAe,UAAU,OAAO,KAAK;AACxD,QAAM,aACJ,KAAK,cAAc,OAAO,KAAK,KAAK,KAAK,aAAa,KAAK,QAAQ,IAAI;AACzE,SAAO;AAAA,IACL,MAAM,KAAK;AAAA,IACX;AAAA,IACA;AAAA,IACA,SAAS,KAAK;AAAA,IACd,MAAM,IAAI,aAAa;AAAA,IACvB,UAAU,KAAK;AAAA,IACf;AAAA,EAAA;AAEJ,CAAC;AASM,MAAM,eAAeD,MAAAA,KAAe,CAAC,QAAQ;AAClD,QAAM,QAAQ,IAAI,mBAAmB;AACrC,SAAO;AAAA,IACL,eAAe,MAAM;AAAA,IACrB,SAAS,MAAM;AAAA,IACf,OAAO,MAAM;AAAA,IACb,YAAY,MAAM,KAAK;AAAA,EAAA;AAE3B,CAAC;AAKD,MAAM,sBAAsBA,MAAAA;AAAAA,EAC1B,CAAC,QAA8B;AAC7B,UAAM,OAAO,IAAI,uBAAuB;AACxC,UAAM,OAAO,IAAIC,sBAAa;AAC9B,UAAM,gBAAgB,IAAI,iBAAiB;AAC3C,WAAO;AAAA,MACL,GAAG;AAAA,MACH;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAAA,EACA,CAAC,KAAK,KAAKH,YAAgB;AAEzB,QAAI,OAAOA,YAAW,YAAY;AAChCA,gBAASA,QAAO,IAAI,mBAAmB,CAAC;AAAA,IAC1C;AACA,UAAM,EAAE,eAAe,MAAM,GAAG,SAASA;AACzC,QAAI,iBAAiB,MAAM;AACzB,UAAI,mBAAmB,aAAa;AAAA,IACtC;AAIA,QAAI,QAAQ,MAAM;AAChB,UAAIG,SAAAA,eAAe,IAAI;AAAA,IACzB;AACA,QAAI,OAAO,KAAK,IAAI,EAAE,SAAS,GAAG;AAChC,UAAI,yBAAyB,CAAC,OAAO,EAAE,GAAG,GAAG,GAAG,OAAO;AAAA,IACzD;AAAA,EACF;AACF;AAEA,SAAS,uBAAuB;AAC9B,QAAM,CAAC,OAAO,QAAQ,IAAIC,SAAAA,IAAI,IAAI,mBAAmB;AACrD,QAAM,WAAWC,MAAAA;AAAAA,IACf,CAAC,WACC,SAAS,CAAC,SAAS,mBAAmB,MAAM,MAAM,CAAC;AAAA,IACrD,CAAC,QAAQ;AAAA,EAAA;AAEX,SAAO,CAAC,OAAO,QAAQ;AACzB;AAEA,SAAS,2BACP,OACA,eACuB;AAGvB,QAAM,eACJ,OAAO,iBAAiB,WACpB,EAAE,KAAK,eAAe,WAAW,KAAA,IACjC;AACN,QAAM,cAAc,aAAa;AACjC,QAAM,UAAiC,MAAM,IAAI,CAAC,SAAS;AACzD,WAAO;AAAA,MACL,KAAK,KAAK;AAAA,MACV,WAAW,KAAK;AAAA,MAChB,YAAY,gBAAgB,OAAO,KAAK,aAAa;AAAA,IAAA;AAAA,EAEzD,CAAC;AAED,QAAM,oBAAoB,QAAQ,KAAK,CAAC,MAAM,EAAE,QAAQ,WAAW;AACnE,MAAI,mBAAmB;AACrB,YAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,UAAI,EAAE,QAAQ,YAAa,QAAO;AAClC,UAAI,EAAE,QAAQ,YAAa,QAAO;AAClC,aAAO;AAAA,IACT,CAAC;AAAA,EACH,OAAO;AACL,YAAQ,KAAK,YAAY;AAAA,EAC3B;AACA,SAAO;AACT;AAEO,SAAS,mBAAmB;AAGjC,QAAM,MAAMC,MAAAA,OAAkB,IAAI;AAElC,QAAM,mBAAmBF,SAAAA,IAAI,OAAO,iBAAiB;AAErD,SAAOC,MAAAA;AAAAA,IACLE,WAAAA,SAAS,CAAC,iBAA4B;AACpC,UACE,aAAa,eAAe,IAAI,SAAS,eACzC,aAAa,iBAAiB,IAAI,SAAS,eAC3C;AACA;AAAA,MACF;AACA,uBAAiB,YAAY;AAC7B,UAAI,UAAU;AAAA,IAChB,GAAG,GAAG;AAAA,IACN,CAAC,gBAAgB;AAAA,EAAA;AAErB;AAqEO,SAAS,oBACd,MACA,UAAsD,IAChC;AACtB,QAAM,WACJ,QAAQ,YAAY;AACtB,SAAO;AAAA,IACL;AAAA,IACA,MAAM,UAAU,EAAE,QAAQ,OAAO,OAAO,WAAW;AACjD,UAAI,OAAO;AACX,UAAI,WAAW,QAAQ,QAAQ,SAAS,GAAG;AACzC,eAAO,KAAK;AAAA,UAAO,CAAC,QAClB,QAAQ;AAAA,YAAM,CAAC,MACb,EAAE,aAAa,OAAO,EAAE,UAAU,KAAK,EAAE,KAAK,IAAI;AAAA,UAAA;AAAA,QACpD;AAAA,MAEJ;AACA,UAAI,SAAS,QAAQ,MAAM,SAAS,GAAG;AACrC,eAAO,CAAC,GAAG,IAAI,EAAE,KAAK,mBAAmB,KAAK,CAAC;AAAA,MACjD;AACA,aAAO;AAAA,QACL,MAAM,KAAK,MAAM,QAAQ,SAAS,KAAK;AAAA,QACvC,YAAY,KAAK;AAAA,MAAA;AAAA,IAErB;AAAA,EAAA;AAEJ;AAKA,MAAM,uCAAuB,QAAA;AAC7B,IAAI,uBAAuB;AAC3B,SAAS,qBAAqB,KAAuC;AACnE,MAAI,OAAO,KAAM,QAAO;AACxB,MAAI,IAAI,MAAM,KAAM,QAAO,IAAI;AAC/B,MAAI,OAAO,QAAQ,SAAU,QAAO;AACpC,MAAI,KAAK,iBAAiB,IAAI,GAAG;AACjC,MAAI,MAAM,MAAM;AACd,SAAK,SAAS,sBAAsB;AACpC,qBAAiB,IAAI,KAAK,EAAE;AAAA,EAC9B;AACA,SAAO;AACT;AAIO,SAAS,mBAAmB,OAAqB;AACtD,SAAO,CAAC,GAAQ,MAAmB;AACjC,eAAW,QAAQ,OAAO;AACxB,YAAM,KAAK,IAAI,KAAK,GAAG;AACvB,YAAM,KAAK,IAAI,KAAK,GAAG;AACvB,UAAI,MAAM,QAAQ,MAAM,KAAM;AAC9B,UAAI,MAAM,KAAM,QAAO,KAAK,YAAY,KAAK;AAC7C,UAAI,MAAM,KAAM,QAAO,KAAK,YAAY,IAAI;AAC5C,YAAM,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AACzC,UAAI,QAAQ,EAAG,QAAO,KAAK,YAAY,MAAM,CAAC;AAAA,IAChD;AACA,WAAO;AAAA,EACT;AACF;AAkBO,SAAS,cACd,YACA,UAA4B,IAC5B;AACA,QAAM,EAAE,WAAW,KAAK,YAAY,aAAa;AACjD,QAAM,CAAC,OAAO,QAAQ,IAAI,qBAAA;AAC1B,QAAM,gBAAgBH,SAAAA,IAAI,SAAS,iBAAiB;AACpD,QAAM,OAAOA,SAAAA,IAAI,SAAS,aAAa;AACvC,QAAM,UAAUA,SAAAA,IAAI,OAAO,aAAa;AACxC,QAAM,eAAeA,SAAAA,IAAI,SAAS,oBAAoB;AACtD,QAAM,cAAcI,SAAAA,YAAY,CAAC,MAAM,EAAE,WAAW;AACpD,QAAM,gBAAgBA,SAAAA,YAAY,CAAC,MAAM,EAAE,aAAa;AACxD,QAAM,WAAWF,MAAAA,OAA+B,IAAI;AAGpD,QAAM,YAAYA,MAAAA,OAA0C;AAAA,IAC1D,MAAM;AAAA,IACN,SAAS;AAAA,EAAA,CACV;AAED,QAAM,UAA6BG,MAAAA;AAAAA,IACjC,MACG,MAAM,KAAK,cAAc,QAAA,CAAS,EAAmB;AAAA,MACpD,CAAC,CAAC,IAAI,KAAK,OAAO;AAAA,QAChB;AAAA,QACA,WAAW,MAAM,QAAQ;AAAA,QACzB,OAAO,MAAM;AAAA,QACb,WAAW,MAAM,QAAQ;AAAA,MAAA;AAAA,IAC3B;AAAA,IAEJ,CAAC,aAAa;AAAA,EAAA;AAIhBC,QAAAA,UAAU,MAAM;AACd,aAAS,EAAE,MAAM,aAAa,WAAW,UAAoB;AAAA,EAC/D,GAAG,CAAC,WAAW,QAAQ,CAAC;AAKxB,QAAM,UAAUD,MAAAA;AAAAA,IACd,MAAM,KAAK,UAAU,EAAE,OAAO,aAAa,SAAS;AAAA,IACpD,CAAC,aAAa,OAAO;AAAA,EAAA;AAEvBC,QAAAA,UAAU,MAAM;AACd,aAAS,EAAE,MAAM,SAAS;AAC1B,YAAQ,CAAC;AAAA,EACX,GAAG,CAAC,SAAS,WAAW,YAAY,CAAC;AAErCC,eAAAA,eAAe,YAAY;AACzB,QAAI,MAAM,QAAS;AAKnB,QAAI;AACJ,QAAI,SAA6C;AACjD,QAAI,cAAc,SAAS;AAEzB,UACE,UAAU,QAAQ,SAAS,QAC3B,UAAU,QAAQ,YAAY,SAC9B;AACA;AAAA,MACF;AACA,eAAS,OAAO;AAAA,IAClB,OAAO;AACL,YAAM,WAAW,yBAAyB,MAAM,MAAM,aAAa;AACnE,UAAI,YAAY,QAAQ,MAAM,YAAa;AAC3C,eAAS,KAAK,OAAO,YAAY,KAAK,QAAQ,IAAI;AAClD,YAAM,OAAO,SAAS,IAAI,MAAM,KAAK,SAAS,CAAC,IAAI;AACnD,UAAI,QAAQ,KAAM,UAAS,EAAE,KAAK,MAAM,OAAO,SAAS,EAAA;AAAA,IAC1D;AAEA,aAAS,SAAS,MAAA;AAClB,UAAM,aAAa,IAAI,gBAAA;AACvB,aAAS,UAAU;AAEnB,aAAS,EAAE,MAAM,iBAAiB;AAClC,QAAI;AACF,YAAM,SAAS,MAAM,WAAW;AAAA,QAC9B;AAAA,QACA,OAAO;AAAA,QACP,QAAQ,WAAW;AAAA,QACnB,OAAO;AAAA,QACP;AAAA,QACA;AAAA,MAAA,CACD;AACD,UAAI,WAAW,OAAO,QAAS;AAC/B,YAAM,OAAO,OAAO,QAAQ,CAAA;AAC5B,UAAI,cAAc,SAAS;AACzB,kBAAU,UAAU,EAAE,MAAM,QAAA;AAG5B,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,WAAW,KAAK;AAAA,UAChB,YAAY,OAAO,cAAc;AAAA,QAAA,CAClC;AAAA,MACH,OAAO;AAOL,cAAM,YAAY,SAAS,KAAK;AAChC,YAAI;AACJ,YAAI,OAAO,cAAc,MAAM;AAC7B,sBAAY,OAAO;AAAA,QACrB,OAAO;AACL,gBAAM,aAAa,KAAK,SAAS;AACjC,sBAAY,aAAa,YAAY,YAAY;AAAA,QACnD;AACA,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,MAAM;AAAA,UACN;AAAA,UACA;AAAA;AAAA;AAAA;AAAA,UAIA,YAAY,OAAO;AAAA,QAAA,CACpB;AAAA,MACH;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,CAAC,WAAW,OAAO,SAAS;AAC9B,iBAAS,EAAE,MAAM,SAAS,OAAO,KAAc;AAAA,MACjD;AAAA,IACF;AAAA,EACF,GAAG,CAAC,MAAM,MAAM,eAAe,SAAS,MAAM,SAAS,CAAC;AAExD,SAAO,EAAE,MAAM,MAAM,MAAM,SAAS,MAAM,SAAS,OAAO,MAAM,MAAA;AAClE;AAUO,SAAS,0BAAmC,QAclC;AACf,QAAM,YAAY,OAAO,mBAAmB;AAC5C,SAAO,OAAO,EAAE,OAAO,QAAQ,OAAO,SAAS,aAAa;AAC1D,UAAM,SAAS,IAAIC,YAAAA,gBAAgB,OAAO,QAAQ,EAAE,KAAK,OAAO,KAAK;AAErE,UAAM,QAA+B;AAAA,MACnC,GAAI,OAAO,aAAa,CAAA;AAAA,MACxB,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,WAAW,EAAE,UAAA,EAAY;AAAA,IAAA;AAG9D,UAAM,YAA+B,CAAA;AACrC,QAAI,OAAO,cAAc,MAAM;AAC7B,YAAM,QAAQ,OAAO;AACrB,gBAAU,KAAK,EAAE,MAAM,UAAU,OAAO;AAAA,IAC1C;AACA,eAAW,KAAK,SAAS;AACvB,YAAM,KAAK,UAAU,CAAC;AACtB,UAAI,MAAM,KAAM,WAAU,KAAK,EAAE;AAAA,IACnC;AAEA,UAAM,QAAQ,WAAW,QAAQ;AAAA,MAC/B,SAAS,OAAO;AAAA;AAAA,MAEhB,OAAO,UAAU,OAAO,UAAU;AAAA,MAClC;AAAA,MACA,aAAa,OAAO;AAAA,MACpB;AAAA,MACA,SAAS;AAAA,MACT,eAAe,QAAQ,OAAO;AAAA,MAC9B,oBAAoB,QAAQ,SAAS;AAAA,IAAA,CACtC;AAED,UAAM,MAAW,MAAM;AACvB,QAAI,OAAO,QAAS,QAAO,EAAE,MAAM,CAAA,EAAC;AACpC,QAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAClC,UAAM,OAAO,KAAK,QAAQ,CAAA;AAC1B,WAAO,KAAK,SAAS,OAAO,EAAE,MAAM,YAAY,IAAI,UAAU,EAAE,KAAA;AAAA,EAClE;AACF;AAQO,SAAS,wBAAiC,QAUxB;AACvB,QAAM,OAAO,MAAM,IAAIA,4BAAgB,OAAO,QAAQ,EAAE,KAAK,OAAO,KAAK;AACzE,SAAO;AAAA,IACL,WAAW,0BAA6B,MAAM;AAAA,IAC9C,UAAU,CAAC,QAAa,MAAM,OAAO,WAAW;AAAA,IAChD,MAAM,SAAS,MAAM;AACnB,YAAM,MAAW,MAAM,OAAO,OAAO,MAAe;AAAA,QAClD,eAAe;AAAA,MAAA,CAChB;AACD,UAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAAA,IACpC;AAAA,IACA,MAAM,WAAW,KAAK;AACpB,YAAM,MAAW,MAAM,OAAO,SAAS,GAAG,OAAO,aAAa,GAAG;AACjE,UAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAAA,IACpC;AAAA,EAAA;AAEJ;AAKA,SAAS,qBAAqB,GAA4C;AACxE,QAAM,IAAI,EAAE;AACZ,MAAI,KAAK,KAAM,QAAO;AACtB,QAAM,MAAM,EAAE,aAAa,EAAE;AAC7B,MAAI,OAAO,QAAQ,EAAE,YAAY,QAAQ,EAAE,SAAS,QAAQ,EAAE,UAAU,IAAI;AAC1E,WAAO,kBAAkB,EAAE,KAAK,UAAU,EAAE,UAAU,OAAO,EAAE,OAAO;AAAA,EACxE;AACA,SAAO;AACT;AAEA,SAAS,yBACP,MACA,QACe;AACf,WAAS,IAAI,OAAO,eAAe,IAAI,OAAO,aAAa,KAAK;AAC9D,QAAI,KAAK,CAAC,KAAK,MAAM;AACnB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;;;;;;;;;;;;;"}
@@ -57,17 +57,10 @@ function lazyLoadingReducer(state, action) {
57
57
  fetchMode: action.fetchMode,
58
58
  pageSize: action.pageSize
59
59
  };
60
- case "start-reload":
61
- return {
62
- ...state,
63
- data: new Array(state.data.length).fill(null),
64
- loading: true,
65
- initialized: false
66
- };
67
60
  case "reset":
68
61
  return {
69
62
  visibleRegion: defaultVisibleRegion,
70
- data: [],
63
+ data: new Array(Math.max(state.pageSize, 0)).fill(null),
71
64
  loading: false,
72
65
  error: null,
73
66
  initialized: false,
@@ -1 +1 @@
1
- {"version":3,"file":"data-loaders.js","sources":["../../src/postgrest-table/data-loaders.ts"],"sourcesContent":["/** Lazy loading of data from a PostgREST endpoint */\n\nimport { useAsyncEffect } from \"@macrostrat/ui-components\";\nimport { debounce, range } from \"underscore\";\nimport { useCallback, useEffect, useMemo, useRef } from \"react\";\nimport update, { Spec } from \"immutability-helper\";\nimport {\n PostgrestClient,\n PostgrestFilterBuilder,\n PostgrestQueryBuilder,\n} from \"@supabase/postgrest-js\";\nimport { adjustArraySize, RowRegion } from \"./loading-utils.ts\";\nimport { ctx, tableDataAtom, useSelector } from \"../provider.ts\";\nimport { atom } from \"jotai\";\nimport type { ColumnSort } from \"../types.ts\";\n\nexport type FetchMode = \"scroll\" | \"paged\";\n\ninterface LazyLoaderStateCore<T> {\n loading: boolean;\n error: Error | null;\n initialized: boolean;\n /** Reported source length when known (null = unknown / not reported). */\n totalCount: number | null;\n /** Windowing style: infinite-scroll windows, or one fixed page at a time. */\n fetchMode: FetchMode;\n /** Rows per chunk/page. */\n pageSize: number;\n}\n\ninterface LazyLoaderState<T> extends LazyLoaderStateCore<T> {\n data: (T | null)[];\n visibleRegion: RowRegion;\n}\n\nexport interface PostgrestOrder<T> {\n key: string;\n ascending?: boolean;\n nullsFirst?: boolean;\n}\n\n/** Operators available for server-side column filtering via PostgREST. */\nexport type PostgrestFilterOperator =\n | \"eq\"\n | \"neq\"\n | \"like\"\n | \"ilike\"\n | \"gt\"\n | \"lt\"\n | \"gte\"\n | \"lte\"\n | \"is\";\n\n/** A single column sort entry. */\nexport interface ColumnSortEntry {\n key: string;\n ascending: boolean;\n}\n\n/** A single column filter entry. */\nexport interface PostgrestColumnFilter {\n key: string;\n operator: PostgrestFilterOperator;\n value: string;\n}\n\nexport interface PostgrestFilter {\n type: \"filter\";\n apply(\n req: PostgrestFilterBuilder<any, any, any, any>,\n ): PostgrestFilterBuilder<any, any, any, any>;\n}\n\nexport function standardizeFilter(\n columnFilter: PostgrestColumnFilter,\n): PostgrestFilter {\n return {\n type: \"filter\",\n apply(req) {\n return applyColumnFilters(req, [columnFilter]);\n },\n };\n}\n\nexport function applyColumnFilters(\n req: PostgrestFilterBuilder<any, any, any, any>,\n filters: PostgrestColumnFilter[],\n) {\n for (const cf of filters) {\n if (cf.value === \"\" || cf.value == null) continue;\n const val =\n cf.operator === \"like\" || cf.operator === \"ilike\"\n ? `*${cf.value}*`\n : cf.value;\n req = req.filter(cf.key, cf.operator, val);\n }\n return req;\n}\n\ntype LazyLoaderAction<T> =\n | { type: \"start-loading\" }\n | {\n type: \"loaded\";\n data: T[];\n offset: number;\n totalSize: number;\n totalCount?: number | null;\n }\n | { type: \"error\"; error: Error }\n | { type: \"update-data\"; changes: Spec<T[]> }\n | { type: \"reset\" }\n | { type: \"start-reload\" }\n | { type: \"configure\"; fetchMode: FetchMode; pageSize: number };\n\nfunction lazyLoadingReducer<T>(\n state: LazyLoaderState<T>,\n action: LazyLoaderAction<T>,\n): LazyLoaderState<T> {\n switch (action.type) {\n case \"start-loading\":\n return {\n ...state,\n loading: true,\n initialized: true,\n };\n case \"update-data\":\n return {\n ...state,\n loading: false,\n data: update(state.data, action.changes),\n };\n case \"loaded\":\n let data = adjustArraySize(state.data, action.totalSize);\n const newData = action.data ?? [];\n const offset = action.offset ?? 0;\n data = [\n ...data.slice(0, offset),\n ...newData,\n ...data.slice(offset + newData.length),\n ];\n return {\n ...state,\n data,\n loading: false,\n totalCount:\n action.totalCount !== undefined\n ? action.totalCount\n : state.totalCount,\n };\n case \"configure\":\n return {\n ...state,\n fetchMode: action.fetchMode,\n pageSize: action.pageSize,\n };\n case \"start-reload\":\n // Preserve the table dimensions but show ghost/skeleton cells\n return {\n ...state,\n data: new Array(state.data.length).fill(null),\n loading: true,\n initialized: false,\n };\n case \"reset\":\n return {\n visibleRegion: defaultVisibleRegion,\n data: [],\n loading: false,\n error: null,\n initialized: false,\n totalCount: null,\n fetchMode: state.fetchMode,\n pageSize: state.pageSize,\n };\n case \"error\":\n return {\n ...state,\n error: action.error,\n loading: false,\n };\n default:\n return state;\n }\n}\n\ntype SortAndFilterOptions = {\n /** Column-level sort state, managed externally. When provided, overrides\n * the `order` prop for query building. */\n order?: PostgrestOrder<any>[];\n filters?: PostgrestFilter[];\n};\n\ninterface QueryConfig extends SortAndFilterOptions {\n columns?: string | string[];\n count?: \"exact\" | \"estimated\";\n limit?: number;\n identityKey: string;\n lastLoadedRow?: any;\n lastLoadedRowIndex: number;\n}\n\nfunction buildQuery<T>(\n client: PostgrestQueryBuilder<T, any, any>,\n config: QueryConfig,\n) {\n const { columns = \"*\", count, lastLoadedRowIndex } = config;\n const opts = { count };\n\n let cols: string;\n if (Array.isArray(columns)) {\n cols = columns.join(\", \");\n } else {\n cols = columns ?? \"*\";\n }\n\n let query = client.select(cols, opts);\n\n const filters = config.filters ?? [];\n for (const filter of filters) {\n query = filter.apply(query);\n }\n\n const orderClauses = buildPostgrestOrderClauses(\n config.order ?? [],\n config.identityKey,\n );\n\n let hasOrdering = false;\n for (const clause of orderClauses) {\n query = query.order(clause.key, clause);\n if (config.lastLoadedRow != null) {\n const op = (clause.ascending ?? true) ? \"gt\" : \"lt\";\n const value = config.lastLoadedRow[clause.key];\n query = query[op](clause.key, value);\n }\n hasOrdering = true;\n }\n\n let offset = null;\n if (!hasOrdering && lastLoadedRowIndex > 0) {\n // We need to load based on offsets\n offset = lastLoadedRowIndex + 1;\n }\n\n if (config.limit != null) {\n if (offset != null) {\n query = query.range(offset, offset + config.limit - 1);\n console.log(`Random seek from ${offset}, this will be slow`);\n } else {\n query = query.limit(config.limit);\n }\n }\n\n console.log(\"query\", query.url.search);\n return query;\n}\n\nconst defaultVisibleRegion: RowRegion = {\n rowIndexStart: 0,\n rowIndexEnd: 0,\n};\n\n/** Atom to house the current visible region of the table */\nconst visibleRegionAtom = atom<RowRegion>(defaultVisibleRegion);\n\nconst lazyLoaderCoreStateAtom = atom<LazyLoaderStateCore<any>>({\n loading: false,\n error: null,\n initialized: false,\n totalCount: null,\n fetchMode: \"scroll\",\n pageSize: 100,\n});\n\n/** Current page index (0-based) for paged fetch mode. */\nexport const chunkPageAtom = atom(0);\n\n/** Bump this to force the active chunk loader to reset and re-fetch from\n * scratch — e.g. after a mutation (save/delete) that invalidates loaded rows. */\nexport const dataRefreshTokenAtom = atom(0);\n\n/** Footer state for the optional bottom-of-table indicator: rows loaded, the\n * source total when known, load status, and — in paged mode — the current\n * page and total pages. */\nexport interface TableFooterInfo {\n mode: FetchMode;\n loaded: number;\n total: number | null;\n loading: boolean;\n page: number;\n pageSize: number;\n totalPages: number | null;\n}\n\nexport const tableFooterAtom = atom<TableFooterInfo>((get) => {\n const core = get(lazyLoaderCoreStateAtom);\n const data = get(tableDataAtom) ?? [];\n let loaded = 0;\n let hasGaps = false;\n for (const row of data) {\n if (row != null) loaded++;\n else hasGaps = true;\n }\n // Total is known when the source reported it, or (scroll mode) when the array\n // is fully populated — otherwise it's still being discovered.\n const total = core.totalCount ?? (hasGaps ? null : data.length);\n const totalPages =\n core.totalCount != null ? Math.ceil(core.totalCount / core.pageSize) : null;\n return {\n mode: core.fetchMode,\n loaded,\n total,\n loading: core.loading,\n page: get(chunkPageAtom),\n pageSize: core.pageSize,\n totalPages,\n };\n});\n\nexport interface ViewInfo {\n visibleRegion: RowRegion;\n totalCount: number | null;\n loading: boolean;\n error: Error | null;\n}\n\nexport const viewInfoAtom = atom<ViewInfo>((get) => {\n const state = get(lazyLoaderStateAtom);\n return {\n visibleRegion: state.visibleRegion,\n loading: state.loading,\n error: state.error,\n totalCount: state.data.length,\n };\n});\n\n/** Temporary passthrough atom to allow visible region to be separated from the rest\n * of the lazy loader state\n */\nconst lazyLoaderStateAtom = atom(\n (get): LazyLoaderState<any> => {\n const core = get(lazyLoaderCoreStateAtom);\n const data = get(tableDataAtom);\n const visibleRegion = get(visibleRegionAtom);\n return {\n ...core,\n data,\n visibleRegion,\n };\n },\n (get, set, update: any) => {\n // Split the state between several places\n if (typeof update === \"function\") {\n update = update(get(lazyLoaderStateAtom));\n }\n const { visibleRegion, data, ...rest } = update;\n if (visibleRegion != null) {\n set(visibleRegionAtom, visibleRegion);\n }\n // Propagate the data array even when empty — a `reset` (view change) must\n // clear the stale rows so the re-fetch rebuilds a correctly-sized array\n // (otherwise a filtered/sorted result splices over a stale, larger array).\n if (data != null) {\n set(tableDataAtom, data);\n }\n if (Object.keys(rest).length > 1) {\n set(lazyLoaderCoreStateAtom, (v) => ({ ...v, ...rest }));\n }\n },\n);\n\nfunction useLazyLoaderReducer() {\n const [state, setState] = ctx.use(lazyLoaderStateAtom);\n const dispatch = useCallback(\n (action: LazyLoaderAction<any>) =>\n setState((prev) => lazyLoadingReducer(prev, action)),\n [setState],\n );\n return [state, dispatch] as const;\n}\n\nfunction buildPostgrestOrderClauses(\n sorts: (ColumnSortEntry | PostgrestOrder<any>)[],\n identityOrder: PostgrestOrder<any> | string,\n): PostgrestOrder<any>[] {\n // Clause to build ordering for a Postgrest table.\n // There must be an ordering by identity key, and it must be last...\n const identitySort =\n typeof identityOrder == \"string\"\n ? { key: identityOrder, ascending: true }\n : identityOrder;\n const identityKey = identitySort.key;\n const clauses: PostgrestOrder<any>[] = sorts.map((sort) => {\n return {\n key: sort.key,\n ascending: sort.ascending,\n nullsFirst: \"nullsFirst\" in sort ? sort.nullsFirst : false,\n };\n });\n // sort the clauses so the identity clause is last\n const hasIdentityClause = clauses.some((d) => d.key === identityKey);\n if (hasIdentityClause) {\n clauses.sort((a, b) => {\n if (a.key === identityKey) return 1;\n if (b.key === identityKey) return -1;\n return 0;\n });\n } else {\n clauses.push(identitySort);\n }\n return clauses;\n}\n\nexport function useScrollHandler() {\n /** A standardized approach to holding onto the scroll position for the table */\n // Reference to hold onto the scroll position\n const ref = useRef<RowRegion>(null);\n\n const setVisibleRegion = ctx.useSet(visibleRegionAtom);\n\n return useCallback(\n debounce((visibleCells: RowRegion) => {\n if (\n visibleCells.rowIndexEnd == ref.current?.rowIndexEnd &&\n visibleCells.rowIndexStart == ref.current?.rowIndexStart\n ) {\n return;\n }\n setVisibleRegion(visibleCells);\n ref.current = visibleCells;\n }, 500),\n [setVisibleRegion],\n );\n}\n\n/** The active view state (a filter's id / column / config), passed to a\n * `fetchChunk`. A server provider translates `columnKey` + `state` into a\n * query; a local (in-memory) provider applies `predicate` directly. Both come\n * from the same `TableFilter`, so one filter definition serves either target. */\nexport interface FetchDataFilter {\n id: string;\n columnKey?: string;\n state: any;\n /** Client-side row predicate (from the `TableFilter`). Server providers\n * ignore it and translate `columnKey` + `state` instead. */\n predicate?: (row: any, state: any) => boolean;\n}\n\n/** Parameters passed to a `fetchChunk` implementation for one window. */\nexport interface FetchDataParams {\n /** Row offset of the requested chunk (chunk-aligned). */\n offset: number;\n /** Maximum rows to return. */\n limit: number;\n /** Aborts when the request is superseded (view change / unmount). */\n signal: AbortSignal;\n /** Active sorts, in priority order. */\n sorts: ColumnSort[];\n /** Active filters (id + column + config). */\n filters: FetchDataFilter[];\n /** In scroll mode, the already-loaded row immediately before this chunk\n * (and its data-array index), or `null` at the start / in paged mode. Keyset\n * sources can page from this cursor (e.g. `WHERE key > cursor`) instead of a\n * slow `OFFSET`; offset-based sources can ignore it. */\n cursor?: { row: any; index: number } | null;\n}\n\n/** Result of a `fetchChunk` call. `totalCount` reports the source length when\n * known (drives sparse-array pre-sizing and a proportional scrollbar); omit it\n * for unknown-length sources (the array grows as chunks arrive). */\nexport interface FetchDataResult<T = any> {\n rows: T[];\n totalCount?: number | null;\n}\n\nexport type FetchData<T = any> = (\n params: FetchDataParams,\n) => Promise<FetchDataResult<T>>;\n\n/**\n * A table's data source, addressed uniformly whether it's an in-memory array or\n * a remote backend. `fetchChunk` returns a window with the active sorts/filters\n * already applied (in memory by the local provider, in SQL by a server one);\n * `identity` addresses a row for edits/mutations — stable across re-sorts,\n * unlike an array index. The mutation ops are present only for editable /\n * persisting sources. The in-memory case (`createLocalProvider`) is just the\n * degenerate implementation, so local and server tables share one path.\n */\nexport interface TableDataProvider<T = any> {\n fetchData(params: FetchDataParams): Promise<FetchDataResult<T>>;\n identity(row: T): string | number;\n saveRows?(rows: T[]): Promise<void>;\n deleteRows?(ids: Array<string | number>): Promise<void>;\n insertRow?(row: Partial<T>): Promise<void>;\n}\n\n/**\n * The degenerate provider: an in-memory array. `fetchChunk` applies the active\n * filter predicates and sorts over the array and returns the requested slice\n * plus the (fully-known) total — the same view engine used for client-side\n * tables, expressed as a provider.\n */\nexport function createLocalProvider<T = any>(\n data: T[],\n options: { identity?: (row: T) => string | number } = {},\n): TableDataProvider<T> {\n const identity: (row: T) => string | number =\n options.identity ?? defaultLocalIdentity;\n return {\n identity,\n async fetchData({ offset, limit, sorts, filters }) {\n let rows = data;\n if (filters != null && filters.length > 0) {\n rows = rows.filter((row) =>\n filters.every((f) =>\n f.predicate != null ? f.predicate(row, f.state) : true,\n ),\n );\n }\n if (sorts != null && sorts.length > 0) {\n rows = [...rows].sort(compareRowsBySorts(sorts));\n }\n return {\n rows: rows.slice(offset, offset + limit),\n totalCount: rows.length,\n };\n },\n };\n}\n\n// Stable synthetic identity for in-memory rows lacking a natural `id`. Keyed by\n// object reference (a local data array keeps the same row objects across\n// re-sorts), so edits survive re-ordering even without an id field.\nconst _syntheticRowIds = new WeakMap<object, string>();\nlet _syntheticRowCounter = 0;\nfunction defaultLocalIdentity(row: any): string | number | undefined {\n if (row == null) return undefined;\n if (row.id != null) return row.id;\n if (typeof row !== \"object\") return row;\n let id = _syntheticRowIds.get(row);\n if (id == null) {\n id = `__row_${_syntheticRowCounter++}`;\n _syntheticRowIds.set(row, id);\n }\n return id;\n}\n\n/** Multi-key row comparator (priority order; nulls first when ascending),\n * shared by the local provider and any other in-memory sort. */\nexport function compareRowsBySorts(sorts: ColumnSort[]) {\n return (a: any, b: any): number => {\n for (const sort of sorts) {\n const av = a?.[sort.key];\n const bv = b?.[sort.key];\n if (av == null && bv == null) continue;\n if (av == null) return sort.ascending ? -1 : 1;\n if (bv == null) return sort.ascending ? 1 : -1;\n const cmp = av < bv ? -1 : av > bv ? 1 : 0;\n if (cmp !== 0) return sort.ascending ? cmp : -cmp;\n }\n return 0;\n };\n}\n\nexport interface FetchDataOptions {\n pageSize?: number;\n fetchMode?: FetchMode;\n}\n\n/**\n * A generic, backend-agnostic windowed data source. Give it a `fetchChunk`\n * function and it drives the sheet's lazy loading: it loads the chunk covering\n * the first unloaded visible row, pre-sizes the sparse array from `totalCount`,\n * threads the active sorts/filters through so the source can apply them\n * server-side, and re-fetches from scratch when the view state changes. This\n * is the unified seam that upstreams bespoke loaders (`fetchChunk` receives the\n * view state; there's no separate adapter object).\n *\n * Call it from a component rendered inside `DataSheet` (see `ChunkLoaderManager`).\n */\nexport function useDataLoader<T = any>(\n fetchChunk: FetchData<T>,\n options: FetchDataOptions = {},\n) {\n const { pageSize = 100, fetchMode = \"scroll\" } = options;\n const [state, dispatch] = useLazyLoaderReducer();\n const visibleRegion = ctx.useValue(visibleRegionAtom);\n const page = ctx.useValue(chunkPageAtom);\n const setPage = ctx.useSet(chunkPageAtom);\n const refreshToken = ctx.useValue(dataRefreshTokenAtom);\n const columnSorts = useSelector((s) => s.columnSorts);\n const activeFilters = useSelector((s) => s.activeFilters);\n const abortRef = useRef<AbortController | null>(null);\n // Tracks the (page, viewKey) already loaded in paged mode, so the effect\n // doesn't re-fetch on unrelated re-renders.\n const loadedRef = useRef<{ page: number; viewKey: string }>({\n page: -1,\n viewKey: \"\",\n });\n\n const filters: FetchDataFilter[] = useMemo(\n () =>\n (Array.from(activeFilters.entries()) as [any, any][]).map(\n ([id, entry]) => ({\n id,\n columnKey: entry.filter?.columnKey,\n state: entry.state,\n predicate: entry.filter?.predicate,\n }),\n ),\n [activeFilters],\n );\n\n // Publish the windowing config so the footer/pager can read it.\n useEffect(() => {\n dispatch({ type: \"configure\", fetchMode, pageSize: pageSize });\n }, [fetchMode, pageSize]);\n\n // Reset (re-fetch from scratch) when sorts/filters change, or when the fetch\n // mode switches (paged holds a dense page; scroll needs to re-initialize and\n // pre-size) — so a table can flip between modes cleanly.\n const viewKey = useMemo(\n () => JSON.stringify({ sorts: columnSorts, filters }),\n [columnSorts, filters],\n );\n useEffect(() => {\n dispatch({ type: \"reset\" });\n setPage(0);\n }, [viewKey, fetchMode, refreshToken]);\n\n useAsyncEffect(async () => {\n if (state.loading) return;\n\n // Determine the chunk offset to fetch, and (scroll mode) a keyset cursor:\n // the already-loaded row just before the chunk, so keyset sources can page\n // from it instead of a slow OFFSET.\n let offset: number;\n let cursor: { row: any; index: number } | null = null;\n if (fetchMode === \"paged\") {\n // Fetch the current page once; skip if already loaded for this view.\n if (\n loadedRef.current.page === page &&\n loadedRef.current.viewKey === viewKey\n ) {\n return;\n }\n offset = page * pageSize;\n } else {\n const rowIndex = indexOfFirstNullInRegion(state.data, visibleRegion);\n if (rowIndex == null && state.initialized) return;\n offset = Math.floor((rowIndex ?? 0) / pageSize) * pageSize;\n const prev = offset > 0 ? state.data[offset - 1] : null;\n if (prev != null) cursor = { row: prev, index: offset - 1 };\n }\n\n abortRef.current?.abort();\n const controller = new AbortController();\n abortRef.current = controller;\n\n dispatch({ type: \"start-loading\" });\n try {\n const result = await fetchChunk({\n offset,\n limit: pageSize,\n signal: controller.signal,\n sorts: columnSorts,\n filters,\n cursor,\n });\n if (controller.signal.aborted) return;\n const rows = result.rows ?? [];\n if (fetchMode === \"paged\") {\n loadedRef.current = { page, viewKey };\n // The sheet shows just this page's rows (dense, from index 0); the\n // real source length is tracked separately for the pager.\n dispatch({\n type: \"loaded\",\n data: rows,\n offset: 0,\n totalSize: rows.length,\n totalCount: result.totalCount ?? null,\n });\n } else {\n // Size the (sparse) array. With a known total, size to it. Without one\n // (keyset / infinite scroll), use the short-chunk heuristic: a chunk\n // smaller than the page size means we've hit the end — size exactly to\n // the loaded rows; otherwise pad one more page of nulls so scrolling\n // into them triggers the next fetch. So an unknown-length source never\n // needs a count — it grows a page at a time until a short chunk.\n const loadedEnd = offset + rows.length;\n let totalSize: number;\n if (result.totalCount != null) {\n totalSize = result.totalCount;\n } else {\n const reachedEnd = rows.length < pageSize;\n totalSize = reachedEnd ? loadedEnd : loadedEnd + pageSize;\n }\n dispatch({\n type: \"loaded\",\n data: rows,\n offset,\n totalSize,\n // Preserve a previously-known total when a chunk omits it (undefined):\n // keyset pages can't re-count (the cursor filter would skew it), so\n // only the initial cursorless fetch reports the total.\n totalCount: result.totalCount,\n });\n }\n } catch (err) {\n if (!controller.signal.aborted) {\n dispatch({ type: \"error\", error: err as Error });\n }\n }\n }, [state.data, visibleRegion, viewKey, page, fetchMode]);\n\n return { data: state.data, loading: state.loading, error: state.error };\n}\n\n/**\n * Build a `fetchChunk` backed by a PostgREST endpoint, for use with\n * `useChunkLoader` / `ChunkLoaderManager`. It reuses `buildQuery`, so it pages\n * with **keyset pagination** (via the loader's `cursor`) whenever the query is\n * ordered — falling back to `OFFSET` only when it isn't — and threads the\n * active store sorts/filters into the query. The total count is requested only\n * on the initial (cursorless) fetch, since a keyset cursor filter would skew it.\n */\nexport function createPostgRESTFetchChunk<T = any>(config: {\n endpoint: string;\n table: string;\n identityKey: string;\n columns?: string | string[];\n /** Order applied before the active column sorts (identity key appended last). */\n baseOrder?: PostgrestOrder<any>[];\n /** A transform over the query builder, applied as a base filter (the `filter` prop). */\n baseFilter?: (\n q: PostgrestFilterBuilder<any, any, any, any>,\n ) => PostgrestFilterBuilder<any, any, any, any>;\n /** Translate a stored filter entry to a `PostgrestFilter` (return `null` to\n * skip). Defaults to the `{ key, operator, value }` column-filter shape. */\n translateFilter?: (f: FetchDataFilter) => PostgrestFilter | null;\n}): FetchData<T> {\n const translate = config.translateFilter ?? standardColumnFilter;\n return async ({ limit, signal, sorts, filters, cursor }) => {\n const client = new PostgrestClient(config.endpoint).from(config.table);\n\n const order: PostgrestOrder<any>[] = [\n ...(config.baseOrder ?? []),\n ...sorts.map((s) => ({ key: s.key, ascending: s.ascending })),\n ];\n\n const pgFilters: PostgrestFilter[] = [];\n if (config.baseFilter != null) {\n const apply = config.baseFilter;\n pgFilters.push({ type: \"filter\", apply });\n }\n for (const f of filters) {\n const pf = translate(f);\n if (pf != null) pgFilters.push(pf);\n }\n\n const query = buildQuery(client, {\n columns: config.columns,\n // Only the initial (cursorless) fetch reports an accurate total.\n count: cursor == null ? \"exact\" : undefined,\n limit,\n identityKey: config.identityKey,\n order,\n filters: pgFilters,\n lastLoadedRow: cursor?.row ?? null,\n lastLoadedRowIndex: cursor?.index ?? -1,\n });\n\n const res: any = await query;\n if (signal.aborted) return { rows: [] };\n if (res?.error != null) throw res.error;\n const rows = res?.data ?? [];\n return res?.count != null ? { rows, totalCount: res.count } : { rows };\n };\n}\n\n/**\n * A full PostgREST `TableDataProvider`: the read side (`fetchData` + row\n * `identity`) plus persistence — `saveRows` (upsert) and `deleteRows` (by\n * identity). Pass it to `DataSheet`'s `provider` prop. The mutation methods\n * throw on error so the Save action surfaces it.\n */\nexport function createPostgRESTProvider<T = any>(config: {\n endpoint: string;\n table: string;\n identityKey: string;\n columns?: string | string[];\n baseOrder?: PostgrestOrder<any>[];\n baseFilter?: (\n q: PostgrestFilterBuilder<any, any, any, any>,\n ) => PostgrestFilterBuilder<any, any, any, any>;\n translateFilter?: (f: FetchDataFilter) => PostgrestFilter | null;\n}): TableDataProvider<T> {\n const from = () => new PostgrestClient(config.endpoint).from(config.table);\n return {\n fetchData: createPostgRESTFetchChunk<T>(config),\n identity: (row: any) => row?.[config.identityKey],\n async saveRows(rows) {\n const res: any = await from().upsert(rows as any[], {\n defaultToNull: false,\n });\n if (res?.error != null) throw res.error;\n },\n async deleteRows(ids) {\n const res: any = await from().delete().in(config.identityKey, ids);\n if (res?.error != null) throw res.error;\n },\n };\n}\n\n/** Default filter translation for the built-in operator `columnFilter`: its\n * column is `f.columnKey`, its state is `{ operator, value }`. (Also accepts a\n * `key` in state for hand-rolled filters.) */\nfunction standardColumnFilter(f: FetchDataFilter): PostgrestFilter | null {\n const s = f.state;\n if (s == null) return null;\n const key = f.columnKey ?? s.key;\n if (key != null && s.operator != null && s.value != null && s.value !== \"\") {\n return standardizeFilter({ key, operator: s.operator, value: s.value });\n }\n return null;\n}\n\nfunction indexOfFirstNullInRegion(\n data: any[],\n region: RowRegion,\n): number | null {\n for (let i = region.rowIndexStart; i < region.rowIndexEnd; i++) {\n if (data[i] == null) {\n return i;\n }\n }\n return null;\n}\n"],"names":["update"],"mappings":";;;;;;;;AAyEO,SAAS,kBACd,cACiB;AACjB,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,KAAK;AACT,aAAO,mBAAmB,KAAK,CAAC,YAAY,CAAC;AAAA,IAC/C;AAAA,EAAA;AAEJ;AAEO,SAAS,mBACd,KACA,SACA;AACA,aAAW,MAAM,SAAS;AACxB,QAAI,GAAG,UAAU,MAAM,GAAG,SAAS,KAAM;AACzC,UAAM,MACJ,GAAG,aAAa,UAAU,GAAG,aAAa,UACtC,IAAI,GAAG,KAAK,MACZ,GAAG;AACT,UAAM,IAAI,OAAO,GAAG,KAAK,GAAG,UAAU,GAAG;AAAA,EAC3C;AACA,SAAO;AACT;AAiBA,SAAS,mBACP,OACA,QACoB;AACpB,UAAQ,OAAO,MAAA;AAAA,IACb,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,SAAS;AAAA,QACT,aAAa;AAAA,MAAA;AAAA,IAEjB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,SAAS;AAAA,QACT,MAAM,OAAO,MAAM,MAAM,OAAO,OAAO;AAAA,MAAA;AAAA,IAE3C,KAAK;AACH,UAAI,OAAO,gBAAgB,MAAM,MAAM,OAAO,SAAS;AACvD,YAAM,UAAU,OAAO,QAAQ,CAAA;AAC/B,YAAM,SAAS,OAAO,UAAU;AAChC,aAAO;AAAA,QACL,GAAG,KAAK,MAAM,GAAG,MAAM;AAAA,QACvB,GAAG;AAAA,QACH,GAAG,KAAK,MAAM,SAAS,QAAQ,MAAM;AAAA,MAAA;AAEvC,aAAO;AAAA,QACL,GAAG;AAAA,QACH;AAAA,QACA,SAAS;AAAA,QACT,YACE,OAAO,eAAe,SAClB,OAAO,aACP,MAAM;AAAA,MAAA;AAAA,IAEhB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,WAAW,OAAO;AAAA,QAClB,UAAU,OAAO;AAAA,MAAA;AAAA,IAErB,KAAK;AAEH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,MAAM,IAAI,MAAM,MAAM,KAAK,MAAM,EAAE,KAAK,IAAI;AAAA,QAC5C,SAAS;AAAA,QACT,aAAa;AAAA,MAAA;AAAA,IAEjB,KAAK;AACH,aAAO;AAAA,QACL,eAAe;AAAA,QACf,MAAM,CAAA;AAAA,QACN,SAAS;AAAA,QACT,OAAO;AAAA,QACP,aAAa;AAAA,QACb,YAAY;AAAA,QACZ,WAAW,MAAM;AAAA,QACjB,UAAU,MAAM;AAAA,MAAA;AAAA,IAEpB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,OAAO,OAAO;AAAA,QACd,SAAS;AAAA,MAAA;AAAA,IAEb;AACE,aAAO;AAAA,EAAA;AAEb;AAkBA,SAAS,WACP,QACA,QACA;AACA,QAAM,EAAE,UAAU,KAAK,OAAO,uBAAuB;AACrD,QAAM,OAAO,EAAE,MAAA;AAEf,MAAI;AACJ,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,WAAO,QAAQ,KAAK,IAAI;AAAA,EAC1B,OAAO;AACL,WAAO,WAAW;AAAA,EACpB;AAEA,MAAI,QAAQ,OAAO,OAAO,MAAM,IAAI;AAEpC,QAAM,UAAU,OAAO,WAAW,CAAA;AAClC,aAAW,UAAU,SAAS;AAC5B,YAAQ,OAAO,MAAM,KAAK;AAAA,EAC5B;AAEA,QAAM,eAAe;AAAA,IACnB,OAAO,SAAS,CAAA;AAAA,IAChB,OAAO;AAAA,EAAA;AAGT,MAAI,cAAc;AAClB,aAAW,UAAU,cAAc;AACjC,YAAQ,MAAM,MAAM,OAAO,KAAK,MAAM;AACtC,QAAI,OAAO,iBAAiB,MAAM;AAChC,YAAM,KAAM,OAAO,aAAa,OAAQ,OAAO;AAC/C,YAAM,QAAQ,OAAO,cAAc,OAAO,GAAG;AAC7C,cAAQ,MAAM,EAAE,EAAE,OAAO,KAAK,KAAK;AAAA,IACrC;AACA,kBAAc;AAAA,EAChB;AAEA,MAAI,SAAS;AACb,MAAI,CAAC,eAAe,qBAAqB,GAAG;AAE1C,aAAS,qBAAqB;AAAA,EAChC;AAEA,MAAI,OAAO,SAAS,MAAM;AACxB,QAAI,UAAU,MAAM;AAClB,cAAQ,MAAM,MAAM,QAAQ,SAAS,OAAO,QAAQ,CAAC;AACrD,cAAQ,IAAI,oBAAoB,MAAM,qBAAqB;AAAA,IAC7D,OAAO;AACL,cAAQ,MAAM,MAAM,OAAO,KAAK;AAAA,IAClC;AAAA,EACF;AAEA,UAAQ,IAAI,SAAS,MAAM,IAAI,MAAM;AACrC,SAAO;AACT;AAEA,MAAM,uBAAkC;AAAA,EACtC,eAAe;AAAA,EACf,aAAa;AACf;AAGA,MAAM,oBAAoB,KAAgB,oBAAoB;AAE9D,MAAM,0BAA0B,KAA+B;AAAA,EAC7D,SAAS;AAAA,EACT,OAAO;AAAA,EACP,aAAa;AAAA,EACb,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,UAAU;AACZ,CAAC;AAGM,MAAM,gBAAgB,KAAK,CAAC;AAI5B,MAAM,uBAAuB,KAAK,CAAC;AAenC,MAAM,kBAAkB,KAAsB,CAAC,QAAQ;AAC5D,QAAM,OAAO,IAAI,uBAAuB;AACxC,QAAM,OAAO,IAAI,aAAa,KAAK,CAAA;AACnC,MAAI,SAAS;AACb,MAAI,UAAU;AACd,aAAW,OAAO,MAAM;AACtB,QAAI,OAAO,KAAM;AAAA,QACZ,WAAU;AAAA,EACjB;AAGA,QAAM,QAAQ,KAAK,eAAe,UAAU,OAAO,KAAK;AACxD,QAAM,aACJ,KAAK,cAAc,OAAO,KAAK,KAAK,KAAK,aAAa,KAAK,QAAQ,IAAI;AACzE,SAAO;AAAA,IACL,MAAM,KAAK;AAAA,IACX;AAAA,IACA;AAAA,IACA,SAAS,KAAK;AAAA,IACd,MAAM,IAAI,aAAa;AAAA,IACvB,UAAU,KAAK;AAAA,IACf;AAAA,EAAA;AAEJ,CAAC;AASM,MAAM,eAAe,KAAe,CAAC,QAAQ;AAClD,QAAM,QAAQ,IAAI,mBAAmB;AACrC,SAAO;AAAA,IACL,eAAe,MAAM;AAAA,IACrB,SAAS,MAAM;AAAA,IACf,OAAO,MAAM;AAAA,IACb,YAAY,MAAM,KAAK;AAAA,EAAA;AAE3B,CAAC;AAKD,MAAM,sBAAsB;AAAA,EAC1B,CAAC,QAA8B;AAC7B,UAAM,OAAO,IAAI,uBAAuB;AACxC,UAAM,OAAO,IAAI,aAAa;AAC9B,UAAM,gBAAgB,IAAI,iBAAiB;AAC3C,WAAO;AAAA,MACL,GAAG;AAAA,MACH;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAAA,EACA,CAAC,KAAK,KAAKA,YAAgB;AAEzB,QAAI,OAAOA,YAAW,YAAY;AAChCA,gBAASA,QAAO,IAAI,mBAAmB,CAAC;AAAA,IAC1C;AACA,UAAM,EAAE,eAAe,MAAM,GAAG,SAASA;AACzC,QAAI,iBAAiB,MAAM;AACzB,UAAI,mBAAmB,aAAa;AAAA,IACtC;AAIA,QAAI,QAAQ,MAAM;AAChB,UAAI,eAAe,IAAI;AAAA,IACzB;AACA,QAAI,OAAO,KAAK,IAAI,EAAE,SAAS,GAAG;AAChC,UAAI,yBAAyB,CAAC,OAAO,EAAE,GAAG,GAAG,GAAG,OAAO;AAAA,IACzD;AAAA,EACF;AACF;AAEA,SAAS,uBAAuB;AAC9B,QAAM,CAAC,OAAO,QAAQ,IAAI,IAAI,IAAI,mBAAmB;AACrD,QAAM,WAAW;AAAA,IACf,CAAC,WACC,SAAS,CAAC,SAAS,mBAAmB,MAAM,MAAM,CAAC;AAAA,IACrD,CAAC,QAAQ;AAAA,EAAA;AAEX,SAAO,CAAC,OAAO,QAAQ;AACzB;AAEA,SAAS,2BACP,OACA,eACuB;AAGvB,QAAM,eACJ,OAAO,iBAAiB,WACpB,EAAE,KAAK,eAAe,WAAW,KAAA,IACjC;AACN,QAAM,cAAc,aAAa;AACjC,QAAM,UAAiC,MAAM,IAAI,CAAC,SAAS;AACzD,WAAO;AAAA,MACL,KAAK,KAAK;AAAA,MACV,WAAW,KAAK;AAAA,MAChB,YAAY,gBAAgB,OAAO,KAAK,aAAa;AAAA,IAAA;AAAA,EAEzD,CAAC;AAED,QAAM,oBAAoB,QAAQ,KAAK,CAAC,MAAM,EAAE,QAAQ,WAAW;AACnE,MAAI,mBAAmB;AACrB,YAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,UAAI,EAAE,QAAQ,YAAa,QAAO;AAClC,UAAI,EAAE,QAAQ,YAAa,QAAO;AAClC,aAAO;AAAA,IACT,CAAC;AAAA,EACH,OAAO;AACL,YAAQ,KAAK,YAAY;AAAA,EAC3B;AACA,SAAO;AACT;AAEO,SAAS,mBAAmB;AAGjC,QAAM,MAAM,OAAkB,IAAI;AAElC,QAAM,mBAAmB,IAAI,OAAO,iBAAiB;AAErD,SAAO;AAAA,IACL,SAAS,CAAC,iBAA4B;AACpC,UACE,aAAa,eAAe,IAAI,SAAS,eACzC,aAAa,iBAAiB,IAAI,SAAS,eAC3C;AACA;AAAA,MACF;AACA,uBAAiB,YAAY;AAC7B,UAAI,UAAU;AAAA,IAChB,GAAG,GAAG;AAAA,IACN,CAAC,gBAAgB;AAAA,EAAA;AAErB;AAqEO,SAAS,oBACd,MACA,UAAsD,IAChC;AACtB,QAAM,WACJ,QAAQ,YAAY;AACtB,SAAO;AAAA,IACL;AAAA,IACA,MAAM,UAAU,EAAE,QAAQ,OAAO,OAAO,WAAW;AACjD,UAAI,OAAO;AACX,UAAI,WAAW,QAAQ,QAAQ,SAAS,GAAG;AACzC,eAAO,KAAK;AAAA,UAAO,CAAC,QAClB,QAAQ;AAAA,YAAM,CAAC,MACb,EAAE,aAAa,OAAO,EAAE,UAAU,KAAK,EAAE,KAAK,IAAI;AAAA,UAAA;AAAA,QACpD;AAAA,MAEJ;AACA,UAAI,SAAS,QAAQ,MAAM,SAAS,GAAG;AACrC,eAAO,CAAC,GAAG,IAAI,EAAE,KAAK,mBAAmB,KAAK,CAAC;AAAA,MACjD;AACA,aAAO;AAAA,QACL,MAAM,KAAK,MAAM,QAAQ,SAAS,KAAK;AAAA,QACvC,YAAY,KAAK;AAAA,MAAA;AAAA,IAErB;AAAA,EAAA;AAEJ;AAKA,MAAM,uCAAuB,QAAA;AAC7B,IAAI,uBAAuB;AAC3B,SAAS,qBAAqB,KAAuC;AACnE,MAAI,OAAO,KAAM,QAAO;AACxB,MAAI,IAAI,MAAM,KAAM,QAAO,IAAI;AAC/B,MAAI,OAAO,QAAQ,SAAU,QAAO;AACpC,MAAI,KAAK,iBAAiB,IAAI,GAAG;AACjC,MAAI,MAAM,MAAM;AACd,SAAK,SAAS,sBAAsB;AACpC,qBAAiB,IAAI,KAAK,EAAE;AAAA,EAC9B;AACA,SAAO;AACT;AAIO,SAAS,mBAAmB,OAAqB;AACtD,SAAO,CAAC,GAAQ,MAAmB;AACjC,eAAW,QAAQ,OAAO;AACxB,YAAM,KAAK,IAAI,KAAK,GAAG;AACvB,YAAM,KAAK,IAAI,KAAK,GAAG;AACvB,UAAI,MAAM,QAAQ,MAAM,KAAM;AAC9B,UAAI,MAAM,KAAM,QAAO,KAAK,YAAY,KAAK;AAC7C,UAAI,MAAM,KAAM,QAAO,KAAK,YAAY,IAAI;AAC5C,YAAM,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AACzC,UAAI,QAAQ,EAAG,QAAO,KAAK,YAAY,MAAM,CAAC;AAAA,IAChD;AACA,WAAO;AAAA,EACT;AACF;AAkBO,SAAS,cACd,YACA,UAA4B,IAC5B;AACA,QAAM,EAAE,WAAW,KAAK,YAAY,aAAa;AACjD,QAAM,CAAC,OAAO,QAAQ,IAAI,qBAAA;AAC1B,QAAM,gBAAgB,IAAI,SAAS,iBAAiB;AACpD,QAAM,OAAO,IAAI,SAAS,aAAa;AACvC,QAAM,UAAU,IAAI,OAAO,aAAa;AACxC,QAAM,eAAe,IAAI,SAAS,oBAAoB;AACtD,QAAM,cAAc,YAAY,CAAC,MAAM,EAAE,WAAW;AACpD,QAAM,gBAAgB,YAAY,CAAC,MAAM,EAAE,aAAa;AACxD,QAAM,WAAW,OAA+B,IAAI;AAGpD,QAAM,YAAY,OAA0C;AAAA,IAC1D,MAAM;AAAA,IACN,SAAS;AAAA,EAAA,CACV;AAED,QAAM,UAA6B;AAAA,IACjC,MACG,MAAM,KAAK,cAAc,QAAA,CAAS,EAAmB;AAAA,MACpD,CAAC,CAAC,IAAI,KAAK,OAAO;AAAA,QAChB;AAAA,QACA,WAAW,MAAM,QAAQ;AAAA,QACzB,OAAO,MAAM;AAAA,QACb,WAAW,MAAM,QAAQ;AAAA,MAAA;AAAA,IAC3B;AAAA,IAEJ,CAAC,aAAa;AAAA,EAAA;AAIhB,YAAU,MAAM;AACd,aAAS,EAAE,MAAM,aAAa,WAAW,UAAoB;AAAA,EAC/D,GAAG,CAAC,WAAW,QAAQ,CAAC;AAKxB,QAAM,UAAU;AAAA,IACd,MAAM,KAAK,UAAU,EAAE,OAAO,aAAa,SAAS;AAAA,IACpD,CAAC,aAAa,OAAO;AAAA,EAAA;AAEvB,YAAU,MAAM;AACd,aAAS,EAAE,MAAM,SAAS;AAC1B,YAAQ,CAAC;AAAA,EACX,GAAG,CAAC,SAAS,WAAW,YAAY,CAAC;AAErC,iBAAe,YAAY;AACzB,QAAI,MAAM,QAAS;AAKnB,QAAI;AACJ,QAAI,SAA6C;AACjD,QAAI,cAAc,SAAS;AAEzB,UACE,UAAU,QAAQ,SAAS,QAC3B,UAAU,QAAQ,YAAY,SAC9B;AACA;AAAA,MACF;AACA,eAAS,OAAO;AAAA,IAClB,OAAO;AACL,YAAM,WAAW,yBAAyB,MAAM,MAAM,aAAa;AACnE,UAAI,YAAY,QAAQ,MAAM,YAAa;AAC3C,eAAS,KAAK,OAAO,YAAY,KAAK,QAAQ,IAAI;AAClD,YAAM,OAAO,SAAS,IAAI,MAAM,KAAK,SAAS,CAAC,IAAI;AACnD,UAAI,QAAQ,KAAM,UAAS,EAAE,KAAK,MAAM,OAAO,SAAS,EAAA;AAAA,IAC1D;AAEA,aAAS,SAAS,MAAA;AAClB,UAAM,aAAa,IAAI,gBAAA;AACvB,aAAS,UAAU;AAEnB,aAAS,EAAE,MAAM,iBAAiB;AAClC,QAAI;AACF,YAAM,SAAS,MAAM,WAAW;AAAA,QAC9B;AAAA,QACA,OAAO;AAAA,QACP,QAAQ,WAAW;AAAA,QACnB,OAAO;AAAA,QACP;AAAA,QACA;AAAA,MAAA,CACD;AACD,UAAI,WAAW,OAAO,QAAS;AAC/B,YAAM,OAAO,OAAO,QAAQ,CAAA;AAC5B,UAAI,cAAc,SAAS;AACzB,kBAAU,UAAU,EAAE,MAAM,QAAA;AAG5B,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,WAAW,KAAK;AAAA,UAChB,YAAY,OAAO,cAAc;AAAA,QAAA,CAClC;AAAA,MACH,OAAO;AAOL,cAAM,YAAY,SAAS,KAAK;AAChC,YAAI;AACJ,YAAI,OAAO,cAAc,MAAM;AAC7B,sBAAY,OAAO;AAAA,QACrB,OAAO;AACL,gBAAM,aAAa,KAAK,SAAS;AACjC,sBAAY,aAAa,YAAY,YAAY;AAAA,QACnD;AACA,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,MAAM;AAAA,UACN;AAAA,UACA;AAAA;AAAA;AAAA;AAAA,UAIA,YAAY,OAAO;AAAA,QAAA,CACpB;AAAA,MACH;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,CAAC,WAAW,OAAO,SAAS;AAC9B,iBAAS,EAAE,MAAM,SAAS,OAAO,KAAc;AAAA,MACjD;AAAA,IACF;AAAA,EACF,GAAG,CAAC,MAAM,MAAM,eAAe,SAAS,MAAM,SAAS,CAAC;AAExD,SAAO,EAAE,MAAM,MAAM,MAAM,SAAS,MAAM,SAAS,OAAO,MAAM,MAAA;AAClE;AAUO,SAAS,0BAAmC,QAclC;AACf,QAAM,YAAY,OAAO,mBAAmB;AAC5C,SAAO,OAAO,EAAE,OAAO,QAAQ,OAAO,SAAS,aAAa;AAC1D,UAAM,SAAS,IAAI,gBAAgB,OAAO,QAAQ,EAAE,KAAK,OAAO,KAAK;AAErE,UAAM,QAA+B;AAAA,MACnC,GAAI,OAAO,aAAa,CAAA;AAAA,MACxB,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,WAAW,EAAE,UAAA,EAAY;AAAA,IAAA;AAG9D,UAAM,YAA+B,CAAA;AACrC,QAAI,OAAO,cAAc,MAAM;AAC7B,YAAM,QAAQ,OAAO;AACrB,gBAAU,KAAK,EAAE,MAAM,UAAU,OAAO;AAAA,IAC1C;AACA,eAAW,KAAK,SAAS;AACvB,YAAM,KAAK,UAAU,CAAC;AACtB,UAAI,MAAM,KAAM,WAAU,KAAK,EAAE;AAAA,IACnC;AAEA,UAAM,QAAQ,WAAW,QAAQ;AAAA,MAC/B,SAAS,OAAO;AAAA;AAAA,MAEhB,OAAO,UAAU,OAAO,UAAU;AAAA,MAClC;AAAA,MACA,aAAa,OAAO;AAAA,MACpB;AAAA,MACA,SAAS;AAAA,MACT,eAAe,QAAQ,OAAO;AAAA,MAC9B,oBAAoB,QAAQ,SAAS;AAAA,IAAA,CACtC;AAED,UAAM,MAAW,MAAM;AACvB,QAAI,OAAO,QAAS,QAAO,EAAE,MAAM,CAAA,EAAC;AACpC,QAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAClC,UAAM,OAAO,KAAK,QAAQ,CAAA;AAC1B,WAAO,KAAK,SAAS,OAAO,EAAE,MAAM,YAAY,IAAI,UAAU,EAAE,KAAA;AAAA,EAClE;AACF;AAQO,SAAS,wBAAiC,QAUxB;AACvB,QAAM,OAAO,MAAM,IAAI,gBAAgB,OAAO,QAAQ,EAAE,KAAK,OAAO,KAAK;AACzE,SAAO;AAAA,IACL,WAAW,0BAA6B,MAAM;AAAA,IAC9C,UAAU,CAAC,QAAa,MAAM,OAAO,WAAW;AAAA,IAChD,MAAM,SAAS,MAAM;AACnB,YAAM,MAAW,MAAM,OAAO,OAAO,MAAe;AAAA,QAClD,eAAe;AAAA,MAAA,CAChB;AACD,UAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAAA,IACpC;AAAA,IACA,MAAM,WAAW,KAAK;AACpB,YAAM,MAAW,MAAM,OAAO,SAAS,GAAG,OAAO,aAAa,GAAG;AACjE,UAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAAA,IACpC;AAAA,EAAA;AAEJ;AAKA,SAAS,qBAAqB,GAA4C;AACxE,QAAM,IAAI,EAAE;AACZ,MAAI,KAAK,KAAM,QAAO;AACtB,QAAM,MAAM,EAAE,aAAa,EAAE;AAC7B,MAAI,OAAO,QAAQ,EAAE,YAAY,QAAQ,EAAE,SAAS,QAAQ,EAAE,UAAU,IAAI;AAC1E,WAAO,kBAAkB,EAAE,KAAK,UAAU,EAAE,UAAU,OAAO,EAAE,OAAO;AAAA,EACxE;AACA,SAAO;AACT;AAEA,SAAS,yBACP,MACA,QACe;AACf,WAAS,IAAI,OAAO,eAAe,IAAI,OAAO,aAAa,KAAK;AAC9D,QAAI,KAAK,CAAC,KAAK,MAAM;AACnB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;"}
1
+ {"version":3,"file":"data-loaders.js","sources":["../../src/postgrest-table/data-loaders.ts"],"sourcesContent":["/** Lazy loading of data from a PostgREST endpoint */\n\nimport { useAsyncEffect } from \"@macrostrat/ui-components\";\nimport { debounce, range } from \"underscore\";\nimport { useCallback, useEffect, useMemo, useRef } from \"react\";\nimport update, { Spec } from \"immutability-helper\";\nimport {\n PostgrestClient,\n PostgrestFilterBuilder,\n PostgrestQueryBuilder,\n} from \"@supabase/postgrest-js\";\nimport { adjustArraySize, RowRegion } from \"./loading-utils.ts\";\nimport { ctx, tableDataAtom, useSelector } from \"../provider.ts\";\nimport { atom } from \"jotai\";\nimport type { ColumnSort } from \"../types.ts\";\n\nexport type FetchMode = \"scroll\" | \"paged\";\n\ninterface LazyLoaderStateCore<T> {\n loading: boolean;\n error: Error | null;\n initialized: boolean;\n /** Reported source length when known (null = unknown / not reported). */\n totalCount: number | null;\n /** Windowing style: infinite-scroll windows, or one fixed page at a time. */\n fetchMode: FetchMode;\n /** Rows per chunk/page. */\n pageSize: number;\n}\n\ninterface LazyLoaderState<T> extends LazyLoaderStateCore<T> {\n data: (T | null)[];\n visibleRegion: RowRegion;\n}\n\nexport interface PostgrestOrder<T> {\n key: string;\n ascending?: boolean;\n nullsFirst?: boolean;\n}\n\n/** Operators available for server-side column filtering via PostgREST. */\nexport type PostgrestFilterOperator =\n | \"eq\"\n | \"neq\"\n | \"like\"\n | \"ilike\"\n | \"gt\"\n | \"lt\"\n | \"gte\"\n | \"lte\"\n | \"is\";\n\n/** A single column sort entry. */\nexport interface ColumnSortEntry {\n key: string;\n ascending: boolean;\n}\n\n/** A single column filter entry. */\nexport interface PostgrestColumnFilter {\n key: string;\n operator: PostgrestFilterOperator;\n value: string;\n}\n\nexport interface PostgrestFilter {\n type: \"filter\";\n apply(\n req: PostgrestFilterBuilder<any, any, any, any>,\n ): PostgrestFilterBuilder<any, any, any, any>;\n}\n\nexport function standardizeFilter(\n columnFilter: PostgrestColumnFilter,\n): PostgrestFilter {\n return {\n type: \"filter\",\n apply(req) {\n return applyColumnFilters(req, [columnFilter]);\n },\n };\n}\n\nexport function applyColumnFilters(\n req: PostgrestFilterBuilder<any, any, any, any>,\n filters: PostgrestColumnFilter[],\n) {\n for (const cf of filters) {\n if (cf.value === \"\" || cf.value == null) continue;\n const val =\n cf.operator === \"like\" || cf.operator === \"ilike\"\n ? `*${cf.value}*`\n : cf.value;\n req = req.filter(cf.key, cf.operator, val);\n }\n return req;\n}\n\ntype LazyLoaderAction<T> =\n | { type: \"start-loading\" }\n | {\n type: \"loaded\";\n data: T[];\n offset: number;\n totalSize: number;\n totalCount?: number | null;\n }\n | { type: \"error\"; error: Error }\n | { type: \"update-data\"; changes: Spec<T[]> }\n | { type: \"reset\" }\n | { type: \"configure\"; fetchMode: FetchMode; pageSize: number };\n\nfunction lazyLoadingReducer<T>(\n state: LazyLoaderState<T>,\n action: LazyLoaderAction<T>,\n): LazyLoaderState<T> {\n switch (action.type) {\n case \"start-loading\":\n return {\n ...state,\n loading: true,\n initialized: true,\n };\n case \"update-data\":\n return {\n ...state,\n loading: false,\n data: update(state.data, action.changes),\n };\n case \"loaded\":\n let data = adjustArraySize(state.data, action.totalSize);\n const newData = action.data ?? [];\n const offset = action.offset ?? 0;\n data = [\n ...data.slice(0, offset),\n ...newData,\n ...data.slice(offset + newData.length),\n ];\n return {\n ...state,\n data,\n loading: false,\n totalCount:\n action.totalCount !== undefined\n ? action.totalCount\n : state.totalCount,\n };\n case \"configure\":\n return {\n ...state,\n fetchMode: action.fetchMode,\n pageSize: action.pageSize,\n };\n case \"reset\":\n // A view change (or initial load) re-fetches from scratch. Rather than\n // blanking the table (which reads as a jarring empty flash while the\n // request is in flight — very visible on sort/filter), pre-size to a page\n // of `null` ghost/skeleton rows so the body stays populated and the load\n // is legible. `loaded` then adjusts the array to the real size.\n return {\n visibleRegion: defaultVisibleRegion,\n data: new Array(Math.max(state.pageSize, 0)).fill(null),\n loading: false,\n error: null,\n initialized: false,\n totalCount: null,\n fetchMode: state.fetchMode,\n pageSize: state.pageSize,\n };\n case \"error\":\n return {\n ...state,\n error: action.error,\n loading: false,\n };\n default:\n return state;\n }\n}\n\ntype SortAndFilterOptions = {\n /** Column-level sort state, managed externally. When provided, overrides\n * the `order` prop for query building. */\n order?: PostgrestOrder<any>[];\n filters?: PostgrestFilter[];\n};\n\ninterface QueryConfig extends SortAndFilterOptions {\n columns?: string | string[];\n count?: \"exact\" | \"estimated\";\n limit?: number;\n identityKey: string;\n lastLoadedRow?: any;\n lastLoadedRowIndex: number;\n}\n\nfunction buildQuery<T>(\n client: PostgrestQueryBuilder<T, any, any>,\n config: QueryConfig,\n) {\n const { columns = \"*\", count, lastLoadedRowIndex } = config;\n const opts = { count };\n\n let cols: string;\n if (Array.isArray(columns)) {\n cols = columns.join(\", \");\n } else {\n cols = columns ?? \"*\";\n }\n\n let query = client.select(cols, opts);\n\n const filters = config.filters ?? [];\n for (const filter of filters) {\n query = filter.apply(query);\n }\n\n const orderClauses = buildPostgrestOrderClauses(\n config.order ?? [],\n config.identityKey,\n );\n\n let hasOrdering = false;\n for (const clause of orderClauses) {\n query = query.order(clause.key, clause);\n if (config.lastLoadedRow != null) {\n const op = (clause.ascending ?? true) ? \"gt\" : \"lt\";\n const value = config.lastLoadedRow[clause.key];\n query = query[op](clause.key, value);\n }\n hasOrdering = true;\n }\n\n let offset = null;\n if (!hasOrdering && lastLoadedRowIndex > 0) {\n // We need to load based on offsets\n offset = lastLoadedRowIndex + 1;\n }\n\n if (config.limit != null) {\n if (offset != null) {\n query = query.range(offset, offset + config.limit - 1);\n console.log(`Random seek from ${offset}, this will be slow`);\n } else {\n query = query.limit(config.limit);\n }\n }\n\n console.log(\"query\", query.url.search);\n return query;\n}\n\nconst defaultVisibleRegion: RowRegion = {\n rowIndexStart: 0,\n rowIndexEnd: 0,\n};\n\n/** Atom to house the current visible region of the table */\nconst visibleRegionAtom = atom<RowRegion>(defaultVisibleRegion);\n\nconst lazyLoaderCoreStateAtom = atom<LazyLoaderStateCore<any>>({\n loading: false,\n error: null,\n initialized: false,\n totalCount: null,\n fetchMode: \"scroll\",\n pageSize: 100,\n});\n\n/** Current page index (0-based) for paged fetch mode. */\nexport const chunkPageAtom = atom(0);\n\n/** Bump this to force the active chunk loader to reset and re-fetch from\n * scratch — e.g. after a mutation (save/delete) that invalidates loaded rows. */\nexport const dataRefreshTokenAtom = atom(0);\n\n/** Footer state for the optional bottom-of-table indicator: rows loaded, the\n * source total when known, load status, and — in paged mode — the current\n * page and total pages. */\nexport interface TableFooterInfo {\n mode: FetchMode;\n loaded: number;\n total: number | null;\n loading: boolean;\n page: number;\n pageSize: number;\n totalPages: number | null;\n}\n\nexport const tableFooterAtom = atom<TableFooterInfo>((get) => {\n const core = get(lazyLoaderCoreStateAtom);\n const data = get(tableDataAtom) ?? [];\n let loaded = 0;\n let hasGaps = false;\n for (const row of data) {\n if (row != null) loaded++;\n else hasGaps = true;\n }\n // Total is known when the source reported it, or (scroll mode) when the array\n // is fully populated — otherwise it's still being discovered.\n const total = core.totalCount ?? (hasGaps ? null : data.length);\n const totalPages =\n core.totalCount != null ? Math.ceil(core.totalCount / core.pageSize) : null;\n return {\n mode: core.fetchMode,\n loaded,\n total,\n loading: core.loading,\n page: get(chunkPageAtom),\n pageSize: core.pageSize,\n totalPages,\n };\n});\n\nexport interface ViewInfo {\n visibleRegion: RowRegion;\n totalCount: number | null;\n loading: boolean;\n error: Error | null;\n}\n\nexport const viewInfoAtom = atom<ViewInfo>((get) => {\n const state = get(lazyLoaderStateAtom);\n return {\n visibleRegion: state.visibleRegion,\n loading: state.loading,\n error: state.error,\n totalCount: state.data.length,\n };\n});\n\n/** Temporary passthrough atom to allow visible region to be separated from the rest\n * of the lazy loader state\n */\nconst lazyLoaderStateAtom = atom(\n (get): LazyLoaderState<any> => {\n const core = get(lazyLoaderCoreStateAtom);\n const data = get(tableDataAtom);\n const visibleRegion = get(visibleRegionAtom);\n return {\n ...core,\n data,\n visibleRegion,\n };\n },\n (get, set, update: any) => {\n // Split the state between several places\n if (typeof update === \"function\") {\n update = update(get(lazyLoaderStateAtom));\n }\n const { visibleRegion, data, ...rest } = update;\n if (visibleRegion != null) {\n set(visibleRegionAtom, visibleRegion);\n }\n // Propagate the data array even when empty — a `reset` (view change) must\n // clear the stale rows so the re-fetch rebuilds a correctly-sized array\n // (otherwise a filtered/sorted result splices over a stale, larger array).\n if (data != null) {\n set(tableDataAtom, data);\n }\n if (Object.keys(rest).length > 1) {\n set(lazyLoaderCoreStateAtom, (v) => ({ ...v, ...rest }));\n }\n },\n);\n\nfunction useLazyLoaderReducer() {\n const [state, setState] = ctx.use(lazyLoaderStateAtom);\n const dispatch = useCallback(\n (action: LazyLoaderAction<any>) =>\n setState((prev) => lazyLoadingReducer(prev, action)),\n [setState],\n );\n return [state, dispatch] as const;\n}\n\nfunction buildPostgrestOrderClauses(\n sorts: (ColumnSortEntry | PostgrestOrder<any>)[],\n identityOrder: PostgrestOrder<any> | string,\n): PostgrestOrder<any>[] {\n // Clause to build ordering for a Postgrest table.\n // There must be an ordering by identity key, and it must be last...\n const identitySort =\n typeof identityOrder == \"string\"\n ? { key: identityOrder, ascending: true }\n : identityOrder;\n const identityKey = identitySort.key;\n const clauses: PostgrestOrder<any>[] = sorts.map((sort) => {\n return {\n key: sort.key,\n ascending: sort.ascending,\n nullsFirst: \"nullsFirst\" in sort ? sort.nullsFirst : false,\n };\n });\n // sort the clauses so the identity clause is last\n const hasIdentityClause = clauses.some((d) => d.key === identityKey);\n if (hasIdentityClause) {\n clauses.sort((a, b) => {\n if (a.key === identityKey) return 1;\n if (b.key === identityKey) return -1;\n return 0;\n });\n } else {\n clauses.push(identitySort);\n }\n return clauses;\n}\n\nexport function useScrollHandler() {\n /** A standardized approach to holding onto the scroll position for the table */\n // Reference to hold onto the scroll position\n const ref = useRef<RowRegion>(null);\n\n const setVisibleRegion = ctx.useSet(visibleRegionAtom);\n\n return useCallback(\n debounce((visibleCells: RowRegion) => {\n if (\n visibleCells.rowIndexEnd == ref.current?.rowIndexEnd &&\n visibleCells.rowIndexStart == ref.current?.rowIndexStart\n ) {\n return;\n }\n setVisibleRegion(visibleCells);\n ref.current = visibleCells;\n }, 500),\n [setVisibleRegion],\n );\n}\n\n/** The active view state (a filter's id / column / config), passed to a\n * `fetchChunk`. A server provider translates `columnKey` + `state` into a\n * query; a local (in-memory) provider applies `predicate` directly. Both come\n * from the same `TableFilter`, so one filter definition serves either target. */\nexport interface FetchDataFilter {\n id: string;\n columnKey?: string;\n state: any;\n /** Client-side row predicate (from the `TableFilter`). Server providers\n * ignore it and translate `columnKey` + `state` instead. */\n predicate?: (row: any, state: any) => boolean;\n}\n\n/** Parameters passed to a `fetchChunk` implementation for one window. */\nexport interface FetchDataParams {\n /** Row offset of the requested chunk (chunk-aligned). */\n offset: number;\n /** Maximum rows to return. */\n limit: number;\n /** Aborts when the request is superseded (view change / unmount). */\n signal: AbortSignal;\n /** Active sorts, in priority order. */\n sorts: ColumnSort[];\n /** Active filters (id + column + config). */\n filters: FetchDataFilter[];\n /** In scroll mode, the already-loaded row immediately before this chunk\n * (and its data-array index), or `null` at the start / in paged mode. Keyset\n * sources can page from this cursor (e.g. `WHERE key > cursor`) instead of a\n * slow `OFFSET`; offset-based sources can ignore it. */\n cursor?: { row: any; index: number } | null;\n}\n\n/** Result of a `fetchChunk` call. `totalCount` reports the source length when\n * known (drives sparse-array pre-sizing and a proportional scrollbar); omit it\n * for unknown-length sources (the array grows as chunks arrive). */\nexport interface FetchDataResult<T = any> {\n rows: T[];\n totalCount?: number | null;\n}\n\nexport type FetchData<T = any> = (\n params: FetchDataParams,\n) => Promise<FetchDataResult<T>>;\n\n/**\n * A table's data source, addressed uniformly whether it's an in-memory array or\n * a remote backend. `fetchChunk` returns a window with the active sorts/filters\n * already applied (in memory by the local provider, in SQL by a server one);\n * `identity` addresses a row for edits/mutations — stable across re-sorts,\n * unlike an array index. The mutation ops are present only for editable /\n * persisting sources. The in-memory case (`createLocalProvider`) is just the\n * degenerate implementation, so local and server tables share one path.\n */\nexport interface TableDataProvider<T = any> {\n fetchData(params: FetchDataParams): Promise<FetchDataResult<T>>;\n identity(row: T): string | number;\n saveRows?(rows: T[]): Promise<void>;\n deleteRows?(ids: Array<string | number>): Promise<void>;\n insertRow?(row: Partial<T>): Promise<void>;\n}\n\n/**\n * The degenerate provider: an in-memory array. `fetchChunk` applies the active\n * filter predicates and sorts over the array and returns the requested slice\n * plus the (fully-known) total — the same view engine used for client-side\n * tables, expressed as a provider.\n */\nexport function createLocalProvider<T = any>(\n data: T[],\n options: { identity?: (row: T) => string | number } = {},\n): TableDataProvider<T> {\n const identity: (row: T) => string | number =\n options.identity ?? defaultLocalIdentity;\n return {\n identity,\n async fetchData({ offset, limit, sorts, filters }) {\n let rows = data;\n if (filters != null && filters.length > 0) {\n rows = rows.filter((row) =>\n filters.every((f) =>\n f.predicate != null ? f.predicate(row, f.state) : true,\n ),\n );\n }\n if (sorts != null && sorts.length > 0) {\n rows = [...rows].sort(compareRowsBySorts(sorts));\n }\n return {\n rows: rows.slice(offset, offset + limit),\n totalCount: rows.length,\n };\n },\n };\n}\n\n// Stable synthetic identity for in-memory rows lacking a natural `id`. Keyed by\n// object reference (a local data array keeps the same row objects across\n// re-sorts), so edits survive re-ordering even without an id field.\nconst _syntheticRowIds = new WeakMap<object, string>();\nlet _syntheticRowCounter = 0;\nfunction defaultLocalIdentity(row: any): string | number | undefined {\n if (row == null) return undefined;\n if (row.id != null) return row.id;\n if (typeof row !== \"object\") return row;\n let id = _syntheticRowIds.get(row);\n if (id == null) {\n id = `__row_${_syntheticRowCounter++}`;\n _syntheticRowIds.set(row, id);\n }\n return id;\n}\n\n/** Multi-key row comparator (priority order; nulls first when ascending),\n * shared by the local provider and any other in-memory sort. */\nexport function compareRowsBySorts(sorts: ColumnSort[]) {\n return (a: any, b: any): number => {\n for (const sort of sorts) {\n const av = a?.[sort.key];\n const bv = b?.[sort.key];\n if (av == null && bv == null) continue;\n if (av == null) return sort.ascending ? -1 : 1;\n if (bv == null) return sort.ascending ? 1 : -1;\n const cmp = av < bv ? -1 : av > bv ? 1 : 0;\n if (cmp !== 0) return sort.ascending ? cmp : -cmp;\n }\n return 0;\n };\n}\n\nexport interface FetchDataOptions {\n pageSize?: number;\n fetchMode?: FetchMode;\n}\n\n/**\n * A generic, backend-agnostic windowed data source. Give it a `fetchChunk`\n * function and it drives the sheet's lazy loading: it loads the chunk covering\n * the first unloaded visible row, pre-sizes the sparse array from `totalCount`,\n * threads the active sorts/filters through so the source can apply them\n * server-side, and re-fetches from scratch when the view state changes. This\n * is the unified seam that upstreams bespoke loaders (`fetchChunk` receives the\n * view state; there's no separate adapter object).\n *\n * Call it from a component rendered inside `DataSheet` (see `ChunkLoaderManager`).\n */\nexport function useDataLoader<T = any>(\n fetchChunk: FetchData<T>,\n options: FetchDataOptions = {},\n) {\n const { pageSize = 100, fetchMode = \"scroll\" } = options;\n const [state, dispatch] = useLazyLoaderReducer();\n const visibleRegion = ctx.useValue(visibleRegionAtom);\n const page = ctx.useValue(chunkPageAtom);\n const setPage = ctx.useSet(chunkPageAtom);\n const refreshToken = ctx.useValue(dataRefreshTokenAtom);\n const columnSorts = useSelector((s) => s.columnSorts);\n const activeFilters = useSelector((s) => s.activeFilters);\n const abortRef = useRef<AbortController | null>(null);\n // Tracks the (page, viewKey) already loaded in paged mode, so the effect\n // doesn't re-fetch on unrelated re-renders.\n const loadedRef = useRef<{ page: number; viewKey: string }>({\n page: -1,\n viewKey: \"\",\n });\n\n const filters: FetchDataFilter[] = useMemo(\n () =>\n (Array.from(activeFilters.entries()) as [any, any][]).map(\n ([id, entry]) => ({\n id,\n columnKey: entry.filter?.columnKey,\n state: entry.state,\n predicate: entry.filter?.predicate,\n }),\n ),\n [activeFilters],\n );\n\n // Publish the windowing config so the footer/pager can read it.\n useEffect(() => {\n dispatch({ type: \"configure\", fetchMode, pageSize: pageSize });\n }, [fetchMode, pageSize]);\n\n // Reset (re-fetch from scratch) when sorts/filters change, or when the fetch\n // mode switches (paged holds a dense page; scroll needs to re-initialize and\n // pre-size) — so a table can flip between modes cleanly.\n const viewKey = useMemo(\n () => JSON.stringify({ sorts: columnSorts, filters }),\n [columnSorts, filters],\n );\n useEffect(() => {\n dispatch({ type: \"reset\" });\n setPage(0);\n }, [viewKey, fetchMode, refreshToken]);\n\n useAsyncEffect(async () => {\n if (state.loading) return;\n\n // Determine the chunk offset to fetch, and (scroll mode) a keyset cursor:\n // the already-loaded row just before the chunk, so keyset sources can page\n // from it instead of a slow OFFSET.\n let offset: number;\n let cursor: { row: any; index: number } | null = null;\n if (fetchMode === \"paged\") {\n // Fetch the current page once; skip if already loaded for this view.\n if (\n loadedRef.current.page === page &&\n loadedRef.current.viewKey === viewKey\n ) {\n return;\n }\n offset = page * pageSize;\n } else {\n const rowIndex = indexOfFirstNullInRegion(state.data, visibleRegion);\n if (rowIndex == null && state.initialized) return;\n offset = Math.floor((rowIndex ?? 0) / pageSize) * pageSize;\n const prev = offset > 0 ? state.data[offset - 1] : null;\n if (prev != null) cursor = { row: prev, index: offset - 1 };\n }\n\n abortRef.current?.abort();\n const controller = new AbortController();\n abortRef.current = controller;\n\n dispatch({ type: \"start-loading\" });\n try {\n const result = await fetchChunk({\n offset,\n limit: pageSize,\n signal: controller.signal,\n sorts: columnSorts,\n filters,\n cursor,\n });\n if (controller.signal.aborted) return;\n const rows = result.rows ?? [];\n if (fetchMode === \"paged\") {\n loadedRef.current = { page, viewKey };\n // The sheet shows just this page's rows (dense, from index 0); the\n // real source length is tracked separately for the pager.\n dispatch({\n type: \"loaded\",\n data: rows,\n offset: 0,\n totalSize: rows.length,\n totalCount: result.totalCount ?? null,\n });\n } else {\n // Size the (sparse) array. With a known total, size to it. Without one\n // (keyset / infinite scroll), use the short-chunk heuristic: a chunk\n // smaller than the page size means we've hit the end — size exactly to\n // the loaded rows; otherwise pad one more page of nulls so scrolling\n // into them triggers the next fetch. So an unknown-length source never\n // needs a count — it grows a page at a time until a short chunk.\n const loadedEnd = offset + rows.length;\n let totalSize: number;\n if (result.totalCount != null) {\n totalSize = result.totalCount;\n } else {\n const reachedEnd = rows.length < pageSize;\n totalSize = reachedEnd ? loadedEnd : loadedEnd + pageSize;\n }\n dispatch({\n type: \"loaded\",\n data: rows,\n offset,\n totalSize,\n // Preserve a previously-known total when a chunk omits it (undefined):\n // keyset pages can't re-count (the cursor filter would skew it), so\n // only the initial cursorless fetch reports the total.\n totalCount: result.totalCount,\n });\n }\n } catch (err) {\n if (!controller.signal.aborted) {\n dispatch({ type: \"error\", error: err as Error });\n }\n }\n }, [state.data, visibleRegion, viewKey, page, fetchMode]);\n\n return { data: state.data, loading: state.loading, error: state.error };\n}\n\n/**\n * Build a `fetchChunk` backed by a PostgREST endpoint, for use with\n * `useChunkLoader` / `ChunkLoaderManager`. It reuses `buildQuery`, so it pages\n * with **keyset pagination** (via the loader's `cursor`) whenever the query is\n * ordered — falling back to `OFFSET` only when it isn't — and threads the\n * active store sorts/filters into the query. The total count is requested only\n * on the initial (cursorless) fetch, since a keyset cursor filter would skew it.\n */\nexport function createPostgRESTFetchChunk<T = any>(config: {\n endpoint: string;\n table: string;\n identityKey: string;\n columns?: string | string[];\n /** Order applied before the active column sorts (identity key appended last). */\n baseOrder?: PostgrestOrder<any>[];\n /** A transform over the query builder, applied as a base filter (the `filter` prop). */\n baseFilter?: (\n q: PostgrestFilterBuilder<any, any, any, any>,\n ) => PostgrestFilterBuilder<any, any, any, any>;\n /** Translate a stored filter entry to a `PostgrestFilter` (return `null` to\n * skip). Defaults to the `{ key, operator, value }` column-filter shape. */\n translateFilter?: (f: FetchDataFilter) => PostgrestFilter | null;\n}): FetchData<T> {\n const translate = config.translateFilter ?? standardColumnFilter;\n return async ({ limit, signal, sorts, filters, cursor }) => {\n const client = new PostgrestClient(config.endpoint).from(config.table);\n\n const order: PostgrestOrder<any>[] = [\n ...(config.baseOrder ?? []),\n ...sorts.map((s) => ({ key: s.key, ascending: s.ascending })),\n ];\n\n const pgFilters: PostgrestFilter[] = [];\n if (config.baseFilter != null) {\n const apply = config.baseFilter;\n pgFilters.push({ type: \"filter\", apply });\n }\n for (const f of filters) {\n const pf = translate(f);\n if (pf != null) pgFilters.push(pf);\n }\n\n const query = buildQuery(client, {\n columns: config.columns,\n // Only the initial (cursorless) fetch reports an accurate total.\n count: cursor == null ? \"exact\" : undefined,\n limit,\n identityKey: config.identityKey,\n order,\n filters: pgFilters,\n lastLoadedRow: cursor?.row ?? null,\n lastLoadedRowIndex: cursor?.index ?? -1,\n });\n\n const res: any = await query;\n if (signal.aborted) return { rows: [] };\n if (res?.error != null) throw res.error;\n const rows = res?.data ?? [];\n return res?.count != null ? { rows, totalCount: res.count } : { rows };\n };\n}\n\n/**\n * A full PostgREST `TableDataProvider`: the read side (`fetchData` + row\n * `identity`) plus persistence — `saveRows` (upsert) and `deleteRows` (by\n * identity). Pass it to `DataSheet`'s `provider` prop. The mutation methods\n * throw on error so the Save action surfaces it.\n */\nexport function createPostgRESTProvider<T = any>(config: {\n endpoint: string;\n table: string;\n identityKey: string;\n columns?: string | string[];\n baseOrder?: PostgrestOrder<any>[];\n baseFilter?: (\n q: PostgrestFilterBuilder<any, any, any, any>,\n ) => PostgrestFilterBuilder<any, any, any, any>;\n translateFilter?: (f: FetchDataFilter) => PostgrestFilter | null;\n}): TableDataProvider<T> {\n const from = () => new PostgrestClient(config.endpoint).from(config.table);\n return {\n fetchData: createPostgRESTFetchChunk<T>(config),\n identity: (row: any) => row?.[config.identityKey],\n async saveRows(rows) {\n const res: any = await from().upsert(rows as any[], {\n defaultToNull: false,\n });\n if (res?.error != null) throw res.error;\n },\n async deleteRows(ids) {\n const res: any = await from().delete().in(config.identityKey, ids);\n if (res?.error != null) throw res.error;\n },\n };\n}\n\n/** Default filter translation for the built-in operator `columnFilter`: its\n * column is `f.columnKey`, its state is `{ operator, value }`. (Also accepts a\n * `key` in state for hand-rolled filters.) */\nfunction standardColumnFilter(f: FetchDataFilter): PostgrestFilter | null {\n const s = f.state;\n if (s == null) return null;\n const key = f.columnKey ?? s.key;\n if (key != null && s.operator != null && s.value != null && s.value !== \"\") {\n return standardizeFilter({ key, operator: s.operator, value: s.value });\n }\n return null;\n}\n\nfunction indexOfFirstNullInRegion(\n data: any[],\n region: RowRegion,\n): number | null {\n for (let i = region.rowIndexStart; i < region.rowIndexEnd; i++) {\n if (data[i] == null) {\n return i;\n }\n }\n return null;\n}\n"],"names":["update"],"mappings":";;;;;;;;AAyEO,SAAS,kBACd,cACiB;AACjB,SAAO;AAAA,IACL,MAAM;AAAA,IACN,MAAM,KAAK;AACT,aAAO,mBAAmB,KAAK,CAAC,YAAY,CAAC;AAAA,IAC/C;AAAA,EAAA;AAEJ;AAEO,SAAS,mBACd,KACA,SACA;AACA,aAAW,MAAM,SAAS;AACxB,QAAI,GAAG,UAAU,MAAM,GAAG,SAAS,KAAM;AACzC,UAAM,MACJ,GAAG,aAAa,UAAU,GAAG,aAAa,UACtC,IAAI,GAAG,KAAK,MACZ,GAAG;AACT,UAAM,IAAI,OAAO,GAAG,KAAK,GAAG,UAAU,GAAG;AAAA,EAC3C;AACA,SAAO;AACT;AAgBA,SAAS,mBACP,OACA,QACoB;AACpB,UAAQ,OAAO,MAAA;AAAA,IACb,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,SAAS;AAAA,QACT,aAAa;AAAA,MAAA;AAAA,IAEjB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,SAAS;AAAA,QACT,MAAM,OAAO,MAAM,MAAM,OAAO,OAAO;AAAA,MAAA;AAAA,IAE3C,KAAK;AACH,UAAI,OAAO,gBAAgB,MAAM,MAAM,OAAO,SAAS;AACvD,YAAM,UAAU,OAAO,QAAQ,CAAA;AAC/B,YAAM,SAAS,OAAO,UAAU;AAChC,aAAO;AAAA,QACL,GAAG,KAAK,MAAM,GAAG,MAAM;AAAA,QACvB,GAAG;AAAA,QACH,GAAG,KAAK,MAAM,SAAS,QAAQ,MAAM;AAAA,MAAA;AAEvC,aAAO;AAAA,QACL,GAAG;AAAA,QACH;AAAA,QACA,SAAS;AAAA,QACT,YACE,OAAO,eAAe,SAClB,OAAO,aACP,MAAM;AAAA,MAAA;AAAA,IAEhB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,WAAW,OAAO;AAAA,QAClB,UAAU,OAAO;AAAA,MAAA;AAAA,IAErB,KAAK;AAMH,aAAO;AAAA,QACL,eAAe;AAAA,QACf,MAAM,IAAI,MAAM,KAAK,IAAI,MAAM,UAAU,CAAC,CAAC,EAAE,KAAK,IAAI;AAAA,QACtD,SAAS;AAAA,QACT,OAAO;AAAA,QACP,aAAa;AAAA,QACb,YAAY;AAAA,QACZ,WAAW,MAAM;AAAA,QACjB,UAAU,MAAM;AAAA,MAAA;AAAA,IAEpB,KAAK;AACH,aAAO;AAAA,QACL,GAAG;AAAA,QACH,OAAO,OAAO;AAAA,QACd,SAAS;AAAA,MAAA;AAAA,IAEb;AACE,aAAO;AAAA,EAAA;AAEb;AAkBA,SAAS,WACP,QACA,QACA;AACA,QAAM,EAAE,UAAU,KAAK,OAAO,uBAAuB;AACrD,QAAM,OAAO,EAAE,MAAA;AAEf,MAAI;AACJ,MAAI,MAAM,QAAQ,OAAO,GAAG;AAC1B,WAAO,QAAQ,KAAK,IAAI;AAAA,EAC1B,OAAO;AACL,WAAO,WAAW;AAAA,EACpB;AAEA,MAAI,QAAQ,OAAO,OAAO,MAAM,IAAI;AAEpC,QAAM,UAAU,OAAO,WAAW,CAAA;AAClC,aAAW,UAAU,SAAS;AAC5B,YAAQ,OAAO,MAAM,KAAK;AAAA,EAC5B;AAEA,QAAM,eAAe;AAAA,IACnB,OAAO,SAAS,CAAA;AAAA,IAChB,OAAO;AAAA,EAAA;AAGT,MAAI,cAAc;AAClB,aAAW,UAAU,cAAc;AACjC,YAAQ,MAAM,MAAM,OAAO,KAAK,MAAM;AACtC,QAAI,OAAO,iBAAiB,MAAM;AAChC,YAAM,KAAM,OAAO,aAAa,OAAQ,OAAO;AAC/C,YAAM,QAAQ,OAAO,cAAc,OAAO,GAAG;AAC7C,cAAQ,MAAM,EAAE,EAAE,OAAO,KAAK,KAAK;AAAA,IACrC;AACA,kBAAc;AAAA,EAChB;AAEA,MAAI,SAAS;AACb,MAAI,CAAC,eAAe,qBAAqB,GAAG;AAE1C,aAAS,qBAAqB;AAAA,EAChC;AAEA,MAAI,OAAO,SAAS,MAAM;AACxB,QAAI,UAAU,MAAM;AAClB,cAAQ,MAAM,MAAM,QAAQ,SAAS,OAAO,QAAQ,CAAC;AACrD,cAAQ,IAAI,oBAAoB,MAAM,qBAAqB;AAAA,IAC7D,OAAO;AACL,cAAQ,MAAM,MAAM,OAAO,KAAK;AAAA,IAClC;AAAA,EACF;AAEA,UAAQ,IAAI,SAAS,MAAM,IAAI,MAAM;AACrC,SAAO;AACT;AAEA,MAAM,uBAAkC;AAAA,EACtC,eAAe;AAAA,EACf,aAAa;AACf;AAGA,MAAM,oBAAoB,KAAgB,oBAAoB;AAE9D,MAAM,0BAA0B,KAA+B;AAAA,EAC7D,SAAS;AAAA,EACT,OAAO;AAAA,EACP,aAAa;AAAA,EACb,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,UAAU;AACZ,CAAC;AAGM,MAAM,gBAAgB,KAAK,CAAC;AAI5B,MAAM,uBAAuB,KAAK,CAAC;AAenC,MAAM,kBAAkB,KAAsB,CAAC,QAAQ;AAC5D,QAAM,OAAO,IAAI,uBAAuB;AACxC,QAAM,OAAO,IAAI,aAAa,KAAK,CAAA;AACnC,MAAI,SAAS;AACb,MAAI,UAAU;AACd,aAAW,OAAO,MAAM;AACtB,QAAI,OAAO,KAAM;AAAA,QACZ,WAAU;AAAA,EACjB;AAGA,QAAM,QAAQ,KAAK,eAAe,UAAU,OAAO,KAAK;AACxD,QAAM,aACJ,KAAK,cAAc,OAAO,KAAK,KAAK,KAAK,aAAa,KAAK,QAAQ,IAAI;AACzE,SAAO;AAAA,IACL,MAAM,KAAK;AAAA,IACX;AAAA,IACA;AAAA,IACA,SAAS,KAAK;AAAA,IACd,MAAM,IAAI,aAAa;AAAA,IACvB,UAAU,KAAK;AAAA,IACf;AAAA,EAAA;AAEJ,CAAC;AASM,MAAM,eAAe,KAAe,CAAC,QAAQ;AAClD,QAAM,QAAQ,IAAI,mBAAmB;AACrC,SAAO;AAAA,IACL,eAAe,MAAM;AAAA,IACrB,SAAS,MAAM;AAAA,IACf,OAAO,MAAM;AAAA,IACb,YAAY,MAAM,KAAK;AAAA,EAAA;AAE3B,CAAC;AAKD,MAAM,sBAAsB;AAAA,EAC1B,CAAC,QAA8B;AAC7B,UAAM,OAAO,IAAI,uBAAuB;AACxC,UAAM,OAAO,IAAI,aAAa;AAC9B,UAAM,gBAAgB,IAAI,iBAAiB;AAC3C,WAAO;AAAA,MACL,GAAG;AAAA,MACH;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAAA,EACA,CAAC,KAAK,KAAKA,YAAgB;AAEzB,QAAI,OAAOA,YAAW,YAAY;AAChCA,gBAASA,QAAO,IAAI,mBAAmB,CAAC;AAAA,IAC1C;AACA,UAAM,EAAE,eAAe,MAAM,GAAG,SAASA;AACzC,QAAI,iBAAiB,MAAM;AACzB,UAAI,mBAAmB,aAAa;AAAA,IACtC;AAIA,QAAI,QAAQ,MAAM;AAChB,UAAI,eAAe,IAAI;AAAA,IACzB;AACA,QAAI,OAAO,KAAK,IAAI,EAAE,SAAS,GAAG;AAChC,UAAI,yBAAyB,CAAC,OAAO,EAAE,GAAG,GAAG,GAAG,OAAO;AAAA,IACzD;AAAA,EACF;AACF;AAEA,SAAS,uBAAuB;AAC9B,QAAM,CAAC,OAAO,QAAQ,IAAI,IAAI,IAAI,mBAAmB;AACrD,QAAM,WAAW;AAAA,IACf,CAAC,WACC,SAAS,CAAC,SAAS,mBAAmB,MAAM,MAAM,CAAC;AAAA,IACrD,CAAC,QAAQ;AAAA,EAAA;AAEX,SAAO,CAAC,OAAO,QAAQ;AACzB;AAEA,SAAS,2BACP,OACA,eACuB;AAGvB,QAAM,eACJ,OAAO,iBAAiB,WACpB,EAAE,KAAK,eAAe,WAAW,KAAA,IACjC;AACN,QAAM,cAAc,aAAa;AACjC,QAAM,UAAiC,MAAM,IAAI,CAAC,SAAS;AACzD,WAAO;AAAA,MACL,KAAK,KAAK;AAAA,MACV,WAAW,KAAK;AAAA,MAChB,YAAY,gBAAgB,OAAO,KAAK,aAAa;AAAA,IAAA;AAAA,EAEzD,CAAC;AAED,QAAM,oBAAoB,QAAQ,KAAK,CAAC,MAAM,EAAE,QAAQ,WAAW;AACnE,MAAI,mBAAmB;AACrB,YAAQ,KAAK,CAAC,GAAG,MAAM;AACrB,UAAI,EAAE,QAAQ,YAAa,QAAO;AAClC,UAAI,EAAE,QAAQ,YAAa,QAAO;AAClC,aAAO;AAAA,IACT,CAAC;AAAA,EACH,OAAO;AACL,YAAQ,KAAK,YAAY;AAAA,EAC3B;AACA,SAAO;AACT;AAEO,SAAS,mBAAmB;AAGjC,QAAM,MAAM,OAAkB,IAAI;AAElC,QAAM,mBAAmB,IAAI,OAAO,iBAAiB;AAErD,SAAO;AAAA,IACL,SAAS,CAAC,iBAA4B;AACpC,UACE,aAAa,eAAe,IAAI,SAAS,eACzC,aAAa,iBAAiB,IAAI,SAAS,eAC3C;AACA;AAAA,MACF;AACA,uBAAiB,YAAY;AAC7B,UAAI,UAAU;AAAA,IAChB,GAAG,GAAG;AAAA,IACN,CAAC,gBAAgB;AAAA,EAAA;AAErB;AAqEO,SAAS,oBACd,MACA,UAAsD,IAChC;AACtB,QAAM,WACJ,QAAQ,YAAY;AACtB,SAAO;AAAA,IACL;AAAA,IACA,MAAM,UAAU,EAAE,QAAQ,OAAO,OAAO,WAAW;AACjD,UAAI,OAAO;AACX,UAAI,WAAW,QAAQ,QAAQ,SAAS,GAAG;AACzC,eAAO,KAAK;AAAA,UAAO,CAAC,QAClB,QAAQ;AAAA,YAAM,CAAC,MACb,EAAE,aAAa,OAAO,EAAE,UAAU,KAAK,EAAE,KAAK,IAAI;AAAA,UAAA;AAAA,QACpD;AAAA,MAEJ;AACA,UAAI,SAAS,QAAQ,MAAM,SAAS,GAAG;AACrC,eAAO,CAAC,GAAG,IAAI,EAAE,KAAK,mBAAmB,KAAK,CAAC;AAAA,MACjD;AACA,aAAO;AAAA,QACL,MAAM,KAAK,MAAM,QAAQ,SAAS,KAAK;AAAA,QACvC,YAAY,KAAK;AAAA,MAAA;AAAA,IAErB;AAAA,EAAA;AAEJ;AAKA,MAAM,uCAAuB,QAAA;AAC7B,IAAI,uBAAuB;AAC3B,SAAS,qBAAqB,KAAuC;AACnE,MAAI,OAAO,KAAM,QAAO;AACxB,MAAI,IAAI,MAAM,KAAM,QAAO,IAAI;AAC/B,MAAI,OAAO,QAAQ,SAAU,QAAO;AACpC,MAAI,KAAK,iBAAiB,IAAI,GAAG;AACjC,MAAI,MAAM,MAAM;AACd,SAAK,SAAS,sBAAsB;AACpC,qBAAiB,IAAI,KAAK,EAAE;AAAA,EAC9B;AACA,SAAO;AACT;AAIO,SAAS,mBAAmB,OAAqB;AACtD,SAAO,CAAC,GAAQ,MAAmB;AACjC,eAAW,QAAQ,OAAO;AACxB,YAAM,KAAK,IAAI,KAAK,GAAG;AACvB,YAAM,KAAK,IAAI,KAAK,GAAG;AACvB,UAAI,MAAM,QAAQ,MAAM,KAAM;AAC9B,UAAI,MAAM,KAAM,QAAO,KAAK,YAAY,KAAK;AAC7C,UAAI,MAAM,KAAM,QAAO,KAAK,YAAY,IAAI;AAC5C,YAAM,MAAM,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI;AACzC,UAAI,QAAQ,EAAG,QAAO,KAAK,YAAY,MAAM,CAAC;AAAA,IAChD;AACA,WAAO;AAAA,EACT;AACF;AAkBO,SAAS,cACd,YACA,UAA4B,IAC5B;AACA,QAAM,EAAE,WAAW,KAAK,YAAY,aAAa;AACjD,QAAM,CAAC,OAAO,QAAQ,IAAI,qBAAA;AAC1B,QAAM,gBAAgB,IAAI,SAAS,iBAAiB;AACpD,QAAM,OAAO,IAAI,SAAS,aAAa;AACvC,QAAM,UAAU,IAAI,OAAO,aAAa;AACxC,QAAM,eAAe,IAAI,SAAS,oBAAoB;AACtD,QAAM,cAAc,YAAY,CAAC,MAAM,EAAE,WAAW;AACpD,QAAM,gBAAgB,YAAY,CAAC,MAAM,EAAE,aAAa;AACxD,QAAM,WAAW,OAA+B,IAAI;AAGpD,QAAM,YAAY,OAA0C;AAAA,IAC1D,MAAM;AAAA,IACN,SAAS;AAAA,EAAA,CACV;AAED,QAAM,UAA6B;AAAA,IACjC,MACG,MAAM,KAAK,cAAc,QAAA,CAAS,EAAmB;AAAA,MACpD,CAAC,CAAC,IAAI,KAAK,OAAO;AAAA,QAChB;AAAA,QACA,WAAW,MAAM,QAAQ;AAAA,QACzB,OAAO,MAAM;AAAA,QACb,WAAW,MAAM,QAAQ;AAAA,MAAA;AAAA,IAC3B;AAAA,IAEJ,CAAC,aAAa;AAAA,EAAA;AAIhB,YAAU,MAAM;AACd,aAAS,EAAE,MAAM,aAAa,WAAW,UAAoB;AAAA,EAC/D,GAAG,CAAC,WAAW,QAAQ,CAAC;AAKxB,QAAM,UAAU;AAAA,IACd,MAAM,KAAK,UAAU,EAAE,OAAO,aAAa,SAAS;AAAA,IACpD,CAAC,aAAa,OAAO;AAAA,EAAA;AAEvB,YAAU,MAAM;AACd,aAAS,EAAE,MAAM,SAAS;AAC1B,YAAQ,CAAC;AAAA,EACX,GAAG,CAAC,SAAS,WAAW,YAAY,CAAC;AAErC,iBAAe,YAAY;AACzB,QAAI,MAAM,QAAS;AAKnB,QAAI;AACJ,QAAI,SAA6C;AACjD,QAAI,cAAc,SAAS;AAEzB,UACE,UAAU,QAAQ,SAAS,QAC3B,UAAU,QAAQ,YAAY,SAC9B;AACA;AAAA,MACF;AACA,eAAS,OAAO;AAAA,IAClB,OAAO;AACL,YAAM,WAAW,yBAAyB,MAAM,MAAM,aAAa;AACnE,UAAI,YAAY,QAAQ,MAAM,YAAa;AAC3C,eAAS,KAAK,OAAO,YAAY,KAAK,QAAQ,IAAI;AAClD,YAAM,OAAO,SAAS,IAAI,MAAM,KAAK,SAAS,CAAC,IAAI;AACnD,UAAI,QAAQ,KAAM,UAAS,EAAE,KAAK,MAAM,OAAO,SAAS,EAAA;AAAA,IAC1D;AAEA,aAAS,SAAS,MAAA;AAClB,UAAM,aAAa,IAAI,gBAAA;AACvB,aAAS,UAAU;AAEnB,aAAS,EAAE,MAAM,iBAAiB;AAClC,QAAI;AACF,YAAM,SAAS,MAAM,WAAW;AAAA,QAC9B;AAAA,QACA,OAAO;AAAA,QACP,QAAQ,WAAW;AAAA,QACnB,OAAO;AAAA,QACP;AAAA,QACA;AAAA,MAAA,CACD;AACD,UAAI,WAAW,OAAO,QAAS;AAC/B,YAAM,OAAO,OAAO,QAAQ,CAAA;AAC5B,UAAI,cAAc,SAAS;AACzB,kBAAU,UAAU,EAAE,MAAM,QAAA;AAG5B,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,WAAW,KAAK;AAAA,UAChB,YAAY,OAAO,cAAc;AAAA,QAAA,CAClC;AAAA,MACH,OAAO;AAOL,cAAM,YAAY,SAAS,KAAK;AAChC,YAAI;AACJ,YAAI,OAAO,cAAc,MAAM;AAC7B,sBAAY,OAAO;AAAA,QACrB,OAAO;AACL,gBAAM,aAAa,KAAK,SAAS;AACjC,sBAAY,aAAa,YAAY,YAAY;AAAA,QACnD;AACA,iBAAS;AAAA,UACP,MAAM;AAAA,UACN,MAAM;AAAA,UACN;AAAA,UACA;AAAA;AAAA;AAAA;AAAA,UAIA,YAAY,OAAO;AAAA,QAAA,CACpB;AAAA,MACH;AAAA,IACF,SAAS,KAAK;AACZ,UAAI,CAAC,WAAW,OAAO,SAAS;AAC9B,iBAAS,EAAE,MAAM,SAAS,OAAO,KAAc;AAAA,MACjD;AAAA,IACF;AAAA,EACF,GAAG,CAAC,MAAM,MAAM,eAAe,SAAS,MAAM,SAAS,CAAC;AAExD,SAAO,EAAE,MAAM,MAAM,MAAM,SAAS,MAAM,SAAS,OAAO,MAAM,MAAA;AAClE;AAUO,SAAS,0BAAmC,QAclC;AACf,QAAM,YAAY,OAAO,mBAAmB;AAC5C,SAAO,OAAO,EAAE,OAAO,QAAQ,OAAO,SAAS,aAAa;AAC1D,UAAM,SAAS,IAAI,gBAAgB,OAAO,QAAQ,EAAE,KAAK,OAAO,KAAK;AAErE,UAAM,QAA+B;AAAA,MACnC,GAAI,OAAO,aAAa,CAAA;AAAA,MACxB,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,WAAW,EAAE,UAAA,EAAY;AAAA,IAAA;AAG9D,UAAM,YAA+B,CAAA;AACrC,QAAI,OAAO,cAAc,MAAM;AAC7B,YAAM,QAAQ,OAAO;AACrB,gBAAU,KAAK,EAAE,MAAM,UAAU,OAAO;AAAA,IAC1C;AACA,eAAW,KAAK,SAAS;AACvB,YAAM,KAAK,UAAU,CAAC;AACtB,UAAI,MAAM,KAAM,WAAU,KAAK,EAAE;AAAA,IACnC;AAEA,UAAM,QAAQ,WAAW,QAAQ;AAAA,MAC/B,SAAS,OAAO;AAAA;AAAA,MAEhB,OAAO,UAAU,OAAO,UAAU;AAAA,MAClC;AAAA,MACA,aAAa,OAAO;AAAA,MACpB;AAAA,MACA,SAAS;AAAA,MACT,eAAe,QAAQ,OAAO;AAAA,MAC9B,oBAAoB,QAAQ,SAAS;AAAA,IAAA,CACtC;AAED,UAAM,MAAW,MAAM;AACvB,QAAI,OAAO,QAAS,QAAO,EAAE,MAAM,CAAA,EAAC;AACpC,QAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAClC,UAAM,OAAO,KAAK,QAAQ,CAAA;AAC1B,WAAO,KAAK,SAAS,OAAO,EAAE,MAAM,YAAY,IAAI,UAAU,EAAE,KAAA;AAAA,EAClE;AACF;AAQO,SAAS,wBAAiC,QAUxB;AACvB,QAAM,OAAO,MAAM,IAAI,gBAAgB,OAAO,QAAQ,EAAE,KAAK,OAAO,KAAK;AACzE,SAAO;AAAA,IACL,WAAW,0BAA6B,MAAM;AAAA,IAC9C,UAAU,CAAC,QAAa,MAAM,OAAO,WAAW;AAAA,IAChD,MAAM,SAAS,MAAM;AACnB,YAAM,MAAW,MAAM,OAAO,OAAO,MAAe;AAAA,QAClD,eAAe;AAAA,MAAA,CAChB;AACD,UAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAAA,IACpC;AAAA,IACA,MAAM,WAAW,KAAK;AACpB,YAAM,MAAW,MAAM,OAAO,SAAS,GAAG,OAAO,aAAa,GAAG;AACjE,UAAI,KAAK,SAAS,KAAM,OAAM,IAAI;AAAA,IACpC;AAAA,EAAA;AAEJ;AAKA,SAAS,qBAAqB,GAA4C;AACxE,QAAM,IAAI,EAAE;AACZ,MAAI,KAAK,KAAM,QAAO;AACtB,QAAM,MAAM,EAAE,aAAa,EAAE;AAC7B,MAAI,OAAO,QAAQ,EAAE,YAAY,QAAQ,EAAE,SAAS,QAAQ,EAAE,UAAU,IAAI;AAC1E,WAAO,kBAAkB,EAAE,KAAK,UAAU,EAAE,UAAU,OAAO,EAAE,OAAO;AAAA,EACxE;AACA,SAAO;AACT;AAEA,SAAS,yBACP,MACA,QACe;AACf,WAAS,IAAI,OAAO,eAAe,IAAI,OAAO,aAAa,KAAK;AAC9D,QAAI,KAAK,CAAC,KAAK,MAAM;AACnB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;"}
package/dist/provider.cjs CHANGED
@@ -37,6 +37,7 @@ const storeAtom = jotai.atom(
37
37
  return set(storeWrapper, action);
38
38
  }
39
39
  );
40
+ const EMPTY_SPEC = [];
40
41
  const initializeStoreAtom = jotai.atom(
41
42
  null,
42
43
  (get, set, payload) => {
@@ -76,16 +77,21 @@ function DataSheetProviderInner({
76
77
  }) {
77
78
  const tableRef = react.useRef(null);
78
79
  const initializeStore = ctx.useSet(initializeStoreAtom);
80
+ const isFnSpec = typeof columnSpec$1 === "function";
81
+ const staticSpec = isFnSpec ? EMPTY_SPEC : columnSpec$1;
79
82
  react.useEffect(() => {
80
83
  initializeStore({
81
- columnSpec: columnSpec$1 ?? columnSpec.generateColumnSpec(data, columnSpecOptions),
84
+ columnSpec: staticSpec ?? columnSpec.generateColumnSpec(data, columnSpecOptions),
85
+ // A function spec is derived from the loaded rows in `_DataSheet`; tell
86
+ // the loader not to auto-generate a plain spec from the first chunk.
87
+ deferColumnSpec: isFnSpec,
82
88
  editable,
83
89
  enableColumnReordering,
84
90
  data,
85
91
  defaultColumnWidth,
86
92
  tableRef
87
93
  });
88
- }, [data, editable, columnSpec$1, columnSpecOptions, enableColumnReordering]);
94
+ }, [data, editable, staticSpec, isFnSpec, columnSpecOptions, enableColumnReordering]);
89
95
  return children;
90
96
  }
91
97
  function useStoreAPI() {
@@ -107,7 +113,7 @@ const tableDataAtom = jotai.atom(
107
113
  (get, set, newData) => {
108
114
  set(storeAtom, (state) => {
109
115
  let next = { ...state, data: newData };
110
- if (state.data.length == 0 && newData.length > 0 && state.columnSpec.length == 0) {
116
+ if (state.data.length == 0 && newData.length > 0 && state.columnSpec.length == 0 && !state.deferColumnSpec) {
111
117
  next.columnSpec = columnSpec.generateColumnSpec(newData, state.columnSpecOptions);
112
118
  }
113
119
  if (!state.controlledOverlay) {
@@ -1 +1 @@
1
- {"version":3,"file":"provider.cjs","sources":["../src/provider.ts"],"sourcesContent":["import { SetStateAction, useEffect, useRef, useState } from \"react\";\nimport h from \"@macrostrat/hyper\";\nimport { createStore, StoreApi, useStore } from \"zustand\";\nimport type { Table } from \"@blueprintjs/table\";\nimport { generateColumnSpec } from \"./utils\";\nimport { createScopedStore } from \"@macrostrat/data-components\";\nimport {\n DataSheetProviderProps,\n DataSheetState,\n DataSheetStore,\n DS_ROW_ID,\n TableElementStatus,\n} from \"./types.ts\";\nimport { createZustandStore } from \"./zustand-store.ts\";\nimport { atomWithStore } from \"jotai-zustand\";\nimport { toasterAtom } from \"./notifications.ts\";\nimport { TableAction } from \"./actions\";\nimport { atom } from \"jotai\";\n\n/** Create a Jotai scoped store */\nexport const ctx = createScopedStore();\n\nexport const storeAPIAtom = atom<StoreApi<DataSheetStore<any>>>();\n\nconst storeWrapperAtom = atom((get) => {\n const _storeAPIAtom = get(storeAPIAtom);\n if (_storeAPIAtom == null) {\n return undefined;\n }\n return atomWithStore(_storeAPIAtom);\n});\n\n/** This is the basis for all other atoms that manipulate the store. */\nexport const storeAtom = atom(\n (get) => {\n const storeWrapper = get(storeWrapperAtom);\n if (storeWrapper == null) {\n return undefined;\n }\n return get(storeWrapper);\n },\n (get, set, action: SetStateAction<T>) => {\n const storeWrapper = get(storeWrapperAtom);\n if (storeWrapper == null) {\n throw new Error(\"Missing DataSheetProvider\");\n }\n return set(storeWrapper, action);\n },\n);\n\nconst initializeStoreAtom = atom(\n null,\n (get, set, payload: Partial<DataSheetStore<T>>) => {\n set(storeAtom, (state) => {\n return {\n ...state,\n ...payload,\n };\n });\n },\n);\n\nexport const tableActionsAtom = atom<TableAction[]>([]);\n\nexport function DataSheetProvider<T>(props: DataSheetProviderProps<T>) {\n const { toaster, ...rest } = props;\n const [store] = useState(() => {\n return createStore<DataSheetStore<T>>(createZustandStore);\n });\n return h(\n ctx.Provider,\n {\n atoms: [\n [storeAPIAtom, store],\n [toasterAtom, toaster],\n ],\n },\n h(DataSheetProviderInner, rest),\n );\n}\n\nexport function DataSheetProviderInner<T>({\n children,\n data,\n columnSpec,\n columnSpecOptions,\n editable,\n enableColumnReordering,\n defaultColumnWidth = 150,\n}: DataSheetProviderProps<T>) {\n const tableRef = useRef<Table>(null);\n\n const initializeStore = ctx.useSet(initializeStoreAtom);\n\n // Not sure how required this initialization is\n useEffect(() => {\n initializeStore({\n columnSpec: columnSpec ?? generateColumnSpec(data, columnSpecOptions),\n editable,\n enableColumnReordering,\n data,\n defaultColumnWidth,\n tableRef,\n });\n }, [data, editable, columnSpec, columnSpecOptions, enableColumnReordering]);\n\n return children;\n}\n\nexport function useStoreAPI<T>(): StoreApi<DataSheetStore<T>> {\n const store = ctx.useValue(storeAPIAtom);\n if (!store) {\n throw new Error(\"Missing DataSheetProvider\");\n }\n return store;\n}\n\nexport function useSelector<T = any, A = any>(\n selector: (state: DataSheetStore<T> & DataSheetComputedVals) => A,\n): A {\n const store = useStoreAPI<T>();\n return useStore(store, selector);\n}\n/** Atoms for efficient sub-selection of state */\n\nexport const columnSpecAtom = atom((get) => get(storeAtom)?.columnSpec ?? []);\n\nexport const tableDataAtom = atom(\n (get) => {\n return get(storeAtom)?.data ?? [];\n },\n (get, set, newData: any[]) => {\n set(storeAtom, (state: DataSheetState<any>): DataSheetState<any> => {\n let next: DataSheetState<any> = { ...state, data: newData };\n if (\n state.data.length == 0 &&\n newData.length > 0 &&\n state.columnSpec.length == 0\n ) {\n // We haven't yet generated the column spec, and we need to do so.\n next.columnSpec = generateColumnSpec(newData, state.columnSpecOptions);\n }\n\n // Re-attach the edit overlay by identity. The loader replaces `data` with\n // re-ordered windows on sort/filter, so an index-keyed overlay would\n // smear; keying by identity keeps edits (and deletes) on their rows, holds\n // edits for not-yet-loaded rows, and re-appends locally-added rows (which\n // aren't in the provider's data) after it. Skipped when the consumer\n // controls the overlay (they own reconciliation).\n if (!state.controlledOverlay) {\n const remap = remapOverlayByIdentity(state, newData);\n next.data = remap.data;\n next.updatedData = remap.updatedData;\n next.rowStatus = remap.rowStatus;\n next.pendingOverlayById = remap.pending;\n }\n\n return next;\n });\n },\n);\n\ntype OverlayEntry = { edit?: any; status?: any };\n\n/** Row identity used by the overlay: an in-table-added row's synthetic id\n * (stable across its edits), else the provider/consumer `identity`. */\nfunction overlayIdentity(\n state: DataSheetState<any>,\n row: any,\n): string | number | null | undefined {\n if (row == null) return undefined;\n const added = row[DS_ROW_ID];\n if (added != null) return added;\n return state.identity(row);\n}\n\n/** Re-project the (index-keyed) edit overlay from the old `data` order onto a\n * new one, matching rows by identity. Edits/statuses whose row is absent from\n * `newData` are held in `pending` and re-applied when the row loads; rows added\n * in-table (status `ADDED`) are re-appended after the provider data (they have\n * no provider row). Starts from the prior pending set so edits survive multiple\n * re-sorts. Returns the reconstructed data (provider rows + re-appended added\n * rows) alongside the re-aligned overlay. */\nfunction remapOverlayByIdentity(\n state: DataSheetState<any>,\n newData: any[],\n): {\n data: any[];\n updatedData: any[];\n rowStatus: any[];\n pending: Map<string | number, OverlayEntry>;\n} {\n const { data: oldData, updatedData, rowStatus } = state;\n\n // Collect current overlay entries by identity, seeded with prior pending.\n const byId = new Map<string | number, OverlayEntry>(state.pendingOverlayById);\n const n = Math.max(\n oldData.length,\n updatedData?.length ?? 0,\n rowStatus?.length ?? 0,\n );\n for (let i = 0; i < n; i++) {\n const row = oldData[i];\n if (row == null) continue;\n const id = overlayIdentity(state, row);\n if (id == null) continue;\n const edit = updatedData?.[i];\n const status = rowStatus?.[i];\n if (edit != null || status != null) byId.set(id, { edit, status });\n }\n\n // Project onto the new data order.\n const resultData = newData.slice();\n const nextUpdated: any[] = [];\n const nextStatus: any[] = [];\n const attached = new Set<string | number>();\n for (let j = 0; j < resultData.length; j++) {\n const row = resultData[j];\n if (row == null) continue;\n const id = overlayIdentity(state, row);\n if (id == null) continue;\n const entry = byId.get(id);\n if (entry == null) continue;\n if (entry.edit != null) nextUpdated[j] = entry.edit;\n if (entry.status != null) nextStatus[j] = entry.status;\n attached.add(id);\n }\n\n // Re-append in-table-added rows (not present in the provider data), then hold\n // anything still unattached (rows not currently loaded) as pending.\n const pending = new Map<string | number, OverlayEntry>();\n for (const [id, entry] of byId) {\n if (attached.has(id)) continue;\n if (entry.status === TableElementStatus.ADDED) {\n const idx = resultData.length;\n resultData.push(entry.edit ?? {});\n nextUpdated[idx] = entry.edit;\n nextStatus[idx] = entry.status;\n } else {\n pending.set(id, entry);\n }\n }\n\n return {\n data: resultData,\n updatedData: nextUpdated,\n rowStatus: nextStatus,\n pending,\n };\n}\n"],"names":["createScopedStore","atom","atomWithStore","useState","createStore","createZustandStore","h","toasterAtom","columnSpec","useRef","useEffect","generateColumnSpec","useStore","DS_ROW_ID","TableElementStatus"],"mappings":";;;;;;;;;;;;;;AAoBO,MAAM,MAAMA,eAAAA,kBAAA;AAEZ,MAAM,eAAeC,MAAAA,KAAA;AAE5B,MAAM,mBAAmBA,MAAAA,KAAK,CAAC,QAAQ;AACrC,QAAM,gBAAgB,IAAI,YAAY;AACtC,MAAI,iBAAiB,MAAM;AACzB,WAAO;AAAA,EACT;AACA,SAAOC,aAAAA,cAAc,aAAa;AACpC,CAAC;AAGM,MAAM,YAAYD,MAAAA;AAAAA,EACvB,CAAC,QAAQ;AACP,UAAM,eAAe,IAAI,gBAAgB;AACzC,QAAI,gBAAgB,MAAM;AACxB,aAAO;AAAA,IACT;AACA,WAAO,IAAI,YAAY;AAAA,EACzB;AAAA,EACA,CAAC,KAAK,KAAK,WAA8B;AACvC,UAAM,eAAe,IAAI,gBAAgB;AACzC,QAAI,gBAAgB,MAAM;AACxB,YAAM,IAAI,MAAM,2BAA2B;AAAA,IAC7C;AACA,WAAO,IAAI,cAAc,MAAM;AAAA,EACjC;AACF;AAEA,MAAM,sBAAsBA,MAAAA;AAAAA,EAC1B;AAAA,EACA,CAAC,KAAK,KAAK,YAAwC;AACjD,QAAI,WAAW,CAAC,UAAU;AACxB,aAAO;AAAA,QACL,GAAG;AAAA,QACH,GAAG;AAAA,MAAA;AAAA,IAEP,CAAC;AAAA,EACH;AACF;AAEO,MAAM,mBAAmBA,MAAAA,KAAoB,CAAA,CAAE;AAE/C,SAAS,kBAAqB,OAAkC;AACrE,QAAM,EAAE,SAAS,GAAG,KAAA,IAAS;AAC7B,QAAM,CAAC,KAAK,IAAIE,MAAAA,SAAS,MAAM;AAC7B,WAAOC,QAAAA,YAA+BC,aAAAA,kBAAkB;AAAA,EAC1D,CAAC;AACD,SAAOC,WAAAA;AAAAA,IACL,IAAI;AAAA,IACJ;AAAA,MACE,OAAO;AAAA,QACL,CAAC,cAAc,KAAK;AAAA,QACpB,CAACC,cAAAA,aAAa,OAAO;AAAA,MAAA;AAAA,IACvB;AAAA,IAEFD,WAAAA,QAAE,wBAAwB,IAAI;AAAA,EAAA;AAElC;AAEO,SAAS,uBAA0B;AAAA,EACxC;AAAA,EACA;AAAA,EAAA,YACAE;AAAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,qBAAqB;AACvB,GAA8B;AAC5B,QAAM,WAAWC,MAAAA,OAAc,IAAI;AAEnC,QAAM,kBAAkB,IAAI,OAAO,mBAAmB;AAGtDC,QAAAA,UAAU,MAAM;AACd,oBAAgB;AAAA,MACd,YAAYF,gBAAcG,8BAAmB,MAAM,iBAAiB;AAAA,MACpE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA,CACD;AAAA,EACH,GAAG,CAAC,MAAM,UAAUH,cAAY,mBAAmB,sBAAsB,CAAC;AAE1E,SAAO;AACT;AAEO,SAAS,cAA8C;AAC5D,QAAM,QAAQ,IAAI,SAAS,YAAY;AACvC,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,MAAM,2BAA2B;AAAA,EAC7C;AACA,SAAO;AACT;AAEO,SAAS,YACd,UACG;AACH,QAAM,QAAQ,YAAA;AACd,SAAOI,QAAAA,SAAS,OAAO,QAAQ;AACjC;AAGO,MAAM,iBAAiBX,MAAAA,KAAK,CAAC,QAAQ,IAAI,SAAS,GAAG,cAAc,CAAA,CAAE;AAErE,MAAM,gBAAgBA,MAAAA;AAAAA,EAC3B,CAAC,QAAQ;AACP,WAAO,IAAI,SAAS,GAAG,QAAQ,CAAA;AAAA,EACjC;AAAA,EACA,CAAC,KAAK,KAAK,YAAmB;AAC5B,QAAI,WAAW,CAAC,UAAoD;AAClE,UAAI,OAA4B,EAAE,GAAG,OAAO,MAAM,QAAA;AAClD,UACE,MAAM,KAAK,UAAU,KACrB,QAAQ,SAAS,KACjB,MAAM,WAAW,UAAU,GAC3B;AAEA,aAAK,aAAaU,WAAAA,mBAAmB,SAAS,MAAM,iBAAiB;AAAA,MACvE;AAQA,UAAI,CAAC,MAAM,mBAAmB;AAC5B,cAAM,QAAQ,uBAAuB,OAAO,OAAO;AACnD,aAAK,OAAO,MAAM;AAClB,aAAK,cAAc,MAAM;AACzB,aAAK,YAAY,MAAM;AACvB,aAAK,qBAAqB,MAAM;AAAA,MAClC;AAEA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AACF;AAMA,SAAS,gBACP,OACA,KACoC;AACpC,MAAI,OAAO,KAAM,QAAO;AACxB,QAAM,QAAQ,IAAIE,eAAS;AAC3B,MAAI,SAAS,KAAM,QAAO;AAC1B,SAAO,MAAM,SAAS,GAAG;AAC3B;AASA,SAAS,uBACP,OACA,SAMA;AACA,QAAM,EAAE,MAAM,SAAS,aAAa,cAAc;AAGlD,QAAM,OAAO,IAAI,IAAmC,MAAM,kBAAkB;AAC5E,QAAM,IAAI,KAAK;AAAA,IACb,QAAQ;AAAA,IACR,aAAa,UAAU;AAAA,IACvB,WAAW,UAAU;AAAA,EAAA;AAEvB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,MAAM,QAAQ,CAAC;AACrB,QAAI,OAAO,KAAM;AACjB,UAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,QAAI,MAAM,KAAM;AAChB,UAAM,OAAO,cAAc,CAAC;AAC5B,UAAM,SAAS,YAAY,CAAC;AAC5B,QAAI,QAAQ,QAAQ,UAAU,KAAM,MAAK,IAAI,IAAI,EAAE,MAAM,QAAQ;AAAA,EACnE;AAGA,QAAM,aAAa,QAAQ,MAAA;AAC3B,QAAM,cAAqB,CAAA;AAC3B,QAAM,aAAoB,CAAA;AAC1B,QAAM,+BAAe,IAAA;AACrB,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,UAAM,MAAM,WAAW,CAAC;AACxB,QAAI,OAAO,KAAM;AACjB,UAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,QAAI,MAAM,KAAM;AAChB,UAAM,QAAQ,KAAK,IAAI,EAAE;AACzB,QAAI,SAAS,KAAM;AACnB,QAAI,MAAM,QAAQ,KAAM,aAAY,CAAC,IAAI,MAAM;AAC/C,QAAI,MAAM,UAAU,KAAM,YAAW,CAAC,IAAI,MAAM;AAChD,aAAS,IAAI,EAAE;AAAA,EACjB;AAIA,QAAM,8BAAc,IAAA;AACpB,aAAW,CAAC,IAAI,KAAK,KAAK,MAAM;AAC9B,QAAI,SAAS,IAAI,EAAE,EAAG;AACtB,QAAI,MAAM,WAAWC,MAAAA,mBAAmB,OAAO;AAC7C,YAAM,MAAM,WAAW;AACvB,iBAAW,KAAK,MAAM,QAAQ,CAAA,CAAE;AAChC,kBAAY,GAAG,IAAI,MAAM;AACzB,iBAAW,GAAG,IAAI,MAAM;AAAA,IAC1B,OAAO;AACL,cAAQ,IAAI,IAAI,KAAK;AAAA,IACvB;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN,aAAa;AAAA,IACb,WAAW;AAAA,IACX;AAAA,EAAA;AAEJ;;;;;;;;;;;"}
1
+ {"version":3,"file":"provider.cjs","sources":["../src/provider.ts"],"sourcesContent":["import { SetStateAction, useEffect, useRef, useState } from \"react\";\nimport h from \"@macrostrat/hyper\";\nimport { createStore, StoreApi, useStore } from \"zustand\";\nimport type { Table } from \"@blueprintjs/table\";\nimport { generateColumnSpec, type ColumnSpec } from \"./utils\";\nimport { createScopedStore } from \"@macrostrat/data-components\";\nimport {\n DataSheetProviderProps,\n DataSheetState,\n DataSheetStore,\n DS_ROW_ID,\n TableElementStatus,\n} from \"./types.ts\";\nimport { createZustandStore } from \"./zustand-store.ts\";\nimport { atomWithStore } from \"jotai-zustand\";\nimport { toasterAtom } from \"./notifications.ts\";\nimport { TableAction } from \"./actions\";\nimport { atom } from \"jotai\";\n\n/** Create a Jotai scoped store */\nexport const ctx = createScopedStore();\n\nexport const storeAPIAtom = atom<StoreApi<DataSheetStore<any>>>();\n\nconst storeWrapperAtom = atom((get) => {\n const _storeAPIAtom = get(storeAPIAtom);\n if (_storeAPIAtom == null) {\n return undefined;\n }\n return atomWithStore(_storeAPIAtom);\n});\n\n/** This is the basis for all other atoms that manipulate the store. */\nexport const storeAtom = atom(\n (get) => {\n const storeWrapper = get(storeWrapperAtom);\n if (storeWrapper == null) {\n return undefined;\n }\n return get(storeWrapper);\n },\n (get, set, action: SetStateAction<T>) => {\n const storeWrapper = get(storeWrapperAtom);\n if (storeWrapper == null) {\n throw new Error(\"Missing DataSheetProvider\");\n }\n return set(storeWrapper, action);\n },\n);\n\n/** Stable empty spec so a function `columnSpec` yields a constant init value\n * (see `DataSheetProviderInner`). */\nconst EMPTY_SPEC: ColumnSpec[] = [];\n\nconst initializeStoreAtom = atom(\n null,\n (get, set, payload: Partial<DataSheetStore<T>>) => {\n set(storeAtom, (state) => {\n return {\n ...state,\n ...payload,\n };\n });\n },\n);\n\nexport const tableActionsAtom = atom<TableAction[]>([]);\n\nexport function DataSheetProvider<T>(props: DataSheetProviderProps<T>) {\n const { toaster, ...rest } = props;\n const [store] = useState(() => {\n return createStore<DataSheetStore<T>>(createZustandStore);\n });\n return h(\n ctx.Provider,\n {\n atoms: [\n [storeAPIAtom, store],\n [toasterAtom, toaster],\n ],\n },\n h(DataSheetProviderInner, rest),\n );\n}\n\nexport function DataSheetProviderInner<T>({\n children,\n data,\n columnSpec,\n columnSpecOptions,\n editable,\n enableColumnReordering,\n defaultColumnWidth = 150,\n}: DataSheetProviderProps<T>) {\n const tableRef = useRef<Table>(null);\n\n const initializeStore = ctx.useSet(initializeStoreAtom);\n\n // A function `columnSpec` is derived from the loaded rows later (in\n // `_DataSheet`), not here — start it empty. Crucially it's kept OUT of the\n // init effect's deps: re-running init also resets `data`, so re-initializing\n // when the function's identity changes (e.g. a consumer hiding a column)\n // would wipe the loaded rows. `staticSpec` is a stable value in that case.\n const isFnSpec = typeof columnSpec === \"function\";\n const staticSpec = isFnSpec ? EMPTY_SPEC : columnSpec;\n\n // Not sure how required this initialization is\n useEffect(() => {\n initializeStore({\n columnSpec: staticSpec ?? generateColumnSpec(data, columnSpecOptions),\n // A function spec is derived from the loaded rows in `_DataSheet`; tell\n // the loader not to auto-generate a plain spec from the first chunk.\n deferColumnSpec: isFnSpec,\n editable,\n enableColumnReordering,\n data,\n defaultColumnWidth,\n tableRef,\n });\n }, [data, editable, staticSpec, isFnSpec, columnSpecOptions, enableColumnReordering]);\n\n return children;\n}\n\nexport function useStoreAPI<T>(): StoreApi<DataSheetStore<T>> {\n const store = ctx.useValue(storeAPIAtom);\n if (!store) {\n throw new Error(\"Missing DataSheetProvider\");\n }\n return store;\n}\n\nexport function useSelector<T = any, A = any>(\n selector: (state: DataSheetStore<T> & DataSheetComputedVals) => A,\n): A {\n const store = useStoreAPI<T>();\n return useStore(store, selector);\n}\n/** Atoms for efficient sub-selection of state */\n\nexport const columnSpecAtom = atom((get) => get(storeAtom)?.columnSpec ?? []);\n\nexport const tableDataAtom = atom(\n (get) => {\n return get(storeAtom)?.data ?? [];\n },\n (get, set, newData: any[]) => {\n set(storeAtom, (state: DataSheetState<any>): DataSheetState<any> => {\n let next: DataSheetState<any> = { ...state, data: newData };\n if (\n state.data.length == 0 &&\n newData.length > 0 &&\n state.columnSpec.length == 0 &&\n !state.deferColumnSpec\n ) {\n // No spec yet and none deferred to a function — auto-generate a plain\n // spec from the first chunk. (A function spec is derived separately.)\n next.columnSpec = generateColumnSpec(newData, state.columnSpecOptions);\n }\n\n // Re-attach the edit overlay by identity. The loader replaces `data` with\n // re-ordered windows on sort/filter, so an index-keyed overlay would\n // smear; keying by identity keeps edits (and deletes) on their rows, holds\n // edits for not-yet-loaded rows, and re-appends locally-added rows (which\n // aren't in the provider's data) after it. Skipped when the consumer\n // controls the overlay (they own reconciliation).\n if (!state.controlledOverlay) {\n const remap = remapOverlayByIdentity(state, newData);\n next.data = remap.data;\n next.updatedData = remap.updatedData;\n next.rowStatus = remap.rowStatus;\n next.pendingOverlayById = remap.pending;\n }\n\n return next;\n });\n },\n);\n\ntype OverlayEntry = { edit?: any; status?: any };\n\n/** Row identity used by the overlay: an in-table-added row's synthetic id\n * (stable across its edits), else the provider/consumer `identity`. */\nfunction overlayIdentity(\n state: DataSheetState<any>,\n row: any,\n): string | number | null | undefined {\n if (row == null) return undefined;\n const added = row[DS_ROW_ID];\n if (added != null) return added;\n return state.identity(row);\n}\n\n/** Re-project the (index-keyed) edit overlay from the old `data` order onto a\n * new one, matching rows by identity. Edits/statuses whose row is absent from\n * `newData` are held in `pending` and re-applied when the row loads; rows added\n * in-table (status `ADDED`) are re-appended after the provider data (they have\n * no provider row). Starts from the prior pending set so edits survive multiple\n * re-sorts. Returns the reconstructed data (provider rows + re-appended added\n * rows) alongside the re-aligned overlay. */\nfunction remapOverlayByIdentity(\n state: DataSheetState<any>,\n newData: any[],\n): {\n data: any[];\n updatedData: any[];\n rowStatus: any[];\n pending: Map<string | number, OverlayEntry>;\n} {\n const { data: oldData, updatedData, rowStatus } = state;\n\n // Collect current overlay entries by identity, seeded with prior pending.\n const byId = new Map<string | number, OverlayEntry>(state.pendingOverlayById);\n const n = Math.max(\n oldData.length,\n updatedData?.length ?? 0,\n rowStatus?.length ?? 0,\n );\n for (let i = 0; i < n; i++) {\n const row = oldData[i];\n if (row == null) continue;\n const id = overlayIdentity(state, row);\n if (id == null) continue;\n const edit = updatedData?.[i];\n const status = rowStatus?.[i];\n if (edit != null || status != null) byId.set(id, { edit, status });\n }\n\n // Project onto the new data order.\n const resultData = newData.slice();\n const nextUpdated: any[] = [];\n const nextStatus: any[] = [];\n const attached = new Set<string | number>();\n for (let j = 0; j < resultData.length; j++) {\n const row = resultData[j];\n if (row == null) continue;\n const id = overlayIdentity(state, row);\n if (id == null) continue;\n const entry = byId.get(id);\n if (entry == null) continue;\n if (entry.edit != null) nextUpdated[j] = entry.edit;\n if (entry.status != null) nextStatus[j] = entry.status;\n attached.add(id);\n }\n\n // Re-append in-table-added rows (not present in the provider data), then hold\n // anything still unattached (rows not currently loaded) as pending.\n const pending = new Map<string | number, OverlayEntry>();\n for (const [id, entry] of byId) {\n if (attached.has(id)) continue;\n if (entry.status === TableElementStatus.ADDED) {\n const idx = resultData.length;\n resultData.push(entry.edit ?? {});\n nextUpdated[idx] = entry.edit;\n nextStatus[idx] = entry.status;\n } else {\n pending.set(id, entry);\n }\n }\n\n return {\n data: resultData,\n updatedData: nextUpdated,\n rowStatus: nextStatus,\n pending,\n };\n}\n"],"names":["createScopedStore","atom","atomWithStore","useState","createStore","createZustandStore","h","toasterAtom","columnSpec","useRef","useEffect","generateColumnSpec","useStore","DS_ROW_ID","TableElementStatus"],"mappings":";;;;;;;;;;;;;;AAoBO,MAAM,MAAMA,eAAAA,kBAAA;AAEZ,MAAM,eAAeC,MAAAA,KAAA;AAE5B,MAAM,mBAAmBA,MAAAA,KAAK,CAAC,QAAQ;AACrC,QAAM,gBAAgB,IAAI,YAAY;AACtC,MAAI,iBAAiB,MAAM;AACzB,WAAO;AAAA,EACT;AACA,SAAOC,aAAAA,cAAc,aAAa;AACpC,CAAC;AAGM,MAAM,YAAYD,MAAAA;AAAAA,EACvB,CAAC,QAAQ;AACP,UAAM,eAAe,IAAI,gBAAgB;AACzC,QAAI,gBAAgB,MAAM;AACxB,aAAO;AAAA,IACT;AACA,WAAO,IAAI,YAAY;AAAA,EACzB;AAAA,EACA,CAAC,KAAK,KAAK,WAA8B;AACvC,UAAM,eAAe,IAAI,gBAAgB;AACzC,QAAI,gBAAgB,MAAM;AACxB,YAAM,IAAI,MAAM,2BAA2B;AAAA,IAC7C;AACA,WAAO,IAAI,cAAc,MAAM;AAAA,EACjC;AACF;AAIA,MAAM,aAA2B,CAAA;AAEjC,MAAM,sBAAsBA,MAAAA;AAAAA,EAC1B;AAAA,EACA,CAAC,KAAK,KAAK,YAAwC;AACjD,QAAI,WAAW,CAAC,UAAU;AACxB,aAAO;AAAA,QACL,GAAG;AAAA,QACH,GAAG;AAAA,MAAA;AAAA,IAEP,CAAC;AAAA,EACH;AACF;AAEO,MAAM,mBAAmBA,MAAAA,KAAoB,CAAA,CAAE;AAE/C,SAAS,kBAAqB,OAAkC;AACrE,QAAM,EAAE,SAAS,GAAG,KAAA,IAAS;AAC7B,QAAM,CAAC,KAAK,IAAIE,MAAAA,SAAS,MAAM;AAC7B,WAAOC,QAAAA,YAA+BC,aAAAA,kBAAkB;AAAA,EAC1D,CAAC;AACD,SAAOC,WAAAA;AAAAA,IACL,IAAI;AAAA,IACJ;AAAA,MACE,OAAO;AAAA,QACL,CAAC,cAAc,KAAK;AAAA,QACpB,CAACC,cAAAA,aAAa,OAAO;AAAA,MAAA;AAAA,IACvB;AAAA,IAEFD,WAAAA,QAAE,wBAAwB,IAAI;AAAA,EAAA;AAElC;AAEO,SAAS,uBAA0B;AAAA,EACxC;AAAA,EACA;AAAA,EAAA,YACAE;AAAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA,qBAAqB;AACvB,GAA8B;AAC5B,QAAM,WAAWC,MAAAA,OAAc,IAAI;AAEnC,QAAM,kBAAkB,IAAI,OAAO,mBAAmB;AAOtD,QAAM,WAAW,OAAOD,iBAAe;AACvC,QAAM,aAAa,WAAW,aAAaA;AAG3CE,QAAAA,UAAU,MAAM;AACd,oBAAgB;AAAA,MACd,YAAY,cAAcC,8BAAmB,MAAM,iBAAiB;AAAA;AAAA;AAAA,MAGpE,iBAAiB;AAAA,MACjB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IAAA,CACD;AAAA,EACH,GAAG,CAAC,MAAM,UAAU,YAAY,UAAU,mBAAmB,sBAAsB,CAAC;AAEpF,SAAO;AACT;AAEO,SAAS,cAA8C;AAC5D,QAAM,QAAQ,IAAI,SAAS,YAAY;AACvC,MAAI,CAAC,OAAO;AACV,UAAM,IAAI,MAAM,2BAA2B;AAAA,EAC7C;AACA,SAAO;AACT;AAEO,SAAS,YACd,UACG;AACH,QAAM,QAAQ,YAAA;AACd,SAAOC,QAAAA,SAAS,OAAO,QAAQ;AACjC;AAGO,MAAM,iBAAiBX,MAAAA,KAAK,CAAC,QAAQ,IAAI,SAAS,GAAG,cAAc,CAAA,CAAE;AAErE,MAAM,gBAAgBA,MAAAA;AAAAA,EAC3B,CAAC,QAAQ;AACP,WAAO,IAAI,SAAS,GAAG,QAAQ,CAAA;AAAA,EACjC;AAAA,EACA,CAAC,KAAK,KAAK,YAAmB;AAC5B,QAAI,WAAW,CAAC,UAAoD;AAClE,UAAI,OAA4B,EAAE,GAAG,OAAO,MAAM,QAAA;AAClD,UACE,MAAM,KAAK,UAAU,KACrB,QAAQ,SAAS,KACjB,MAAM,WAAW,UAAU,KAC3B,CAAC,MAAM,iBACP;AAGA,aAAK,aAAaU,WAAAA,mBAAmB,SAAS,MAAM,iBAAiB;AAAA,MACvE;AAQA,UAAI,CAAC,MAAM,mBAAmB;AAC5B,cAAM,QAAQ,uBAAuB,OAAO,OAAO;AACnD,aAAK,OAAO,MAAM;AAClB,aAAK,cAAc,MAAM;AACzB,aAAK,YAAY,MAAM;AACvB,aAAK,qBAAqB,MAAM;AAAA,MAClC;AAEA,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AACF;AAMA,SAAS,gBACP,OACA,KACoC;AACpC,MAAI,OAAO,KAAM,QAAO;AACxB,QAAM,QAAQ,IAAIE,eAAS;AAC3B,MAAI,SAAS,KAAM,QAAO;AAC1B,SAAO,MAAM,SAAS,GAAG;AAC3B;AASA,SAAS,uBACP,OACA,SAMA;AACA,QAAM,EAAE,MAAM,SAAS,aAAa,cAAc;AAGlD,QAAM,OAAO,IAAI,IAAmC,MAAM,kBAAkB;AAC5E,QAAM,IAAI,KAAK;AAAA,IACb,QAAQ;AAAA,IACR,aAAa,UAAU;AAAA,IACvB,WAAW,UAAU;AAAA,EAAA;AAEvB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,MAAM,QAAQ,CAAC;AACrB,QAAI,OAAO,KAAM;AACjB,UAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,QAAI,MAAM,KAAM;AAChB,UAAM,OAAO,cAAc,CAAC;AAC5B,UAAM,SAAS,YAAY,CAAC;AAC5B,QAAI,QAAQ,QAAQ,UAAU,KAAM,MAAK,IAAI,IAAI,EAAE,MAAM,QAAQ;AAAA,EACnE;AAGA,QAAM,aAAa,QAAQ,MAAA;AAC3B,QAAM,cAAqB,CAAA;AAC3B,QAAM,aAAoB,CAAA;AAC1B,QAAM,+BAAe,IAAA;AACrB,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,UAAM,MAAM,WAAW,CAAC;AACxB,QAAI,OAAO,KAAM;AACjB,UAAM,KAAK,gBAAgB,OAAO,GAAG;AACrC,QAAI,MAAM,KAAM;AAChB,UAAM,QAAQ,KAAK,IAAI,EAAE;AACzB,QAAI,SAAS,KAAM;AACnB,QAAI,MAAM,QAAQ,KAAM,aAAY,CAAC,IAAI,MAAM;AAC/C,QAAI,MAAM,UAAU,KAAM,YAAW,CAAC,IAAI,MAAM;AAChD,aAAS,IAAI,EAAE;AAAA,EACjB;AAIA,QAAM,8BAAc,IAAA;AACpB,aAAW,CAAC,IAAI,KAAK,KAAK,MAAM;AAC9B,QAAI,SAAS,IAAI,EAAE,EAAG;AACtB,QAAI,MAAM,WAAWC,MAAAA,mBAAmB,OAAO;AAC7C,YAAM,MAAM,WAAW;AACvB,iBAAW,KAAK,MAAM,QAAQ,CAAA,CAAE;AAChC,kBAAY,GAAG,IAAI,MAAM;AACzB,iBAAW,GAAG,IAAI,MAAM;AAAA,IAC1B,OAAO;AACL,cAAQ,IAAI,IAAI,KAAK;AAAA,IACvB;AAAA,EACF;AAEA,SAAO;AAAA,IACL,MAAM;AAAA,IACN,aAAa;AAAA,IACb,WAAW;AAAA,IACX;AAAA,EAAA;AAEJ;;;;;;;;;;;"}
@@ -1,4 +1,5 @@
1
1
  import { StoreApi } from 'zustand';
2
+ import { ColumnSpec } from './utils';
2
3
  import { DataSheetProviderProps, DataSheetStore } from './types.ts';
3
4
  import { TableAction } from './actions';
4
5
  /** Create a Jotai scoped store */
@@ -21,5 +22,5 @@ export declare function DataSheetProviderInner<T>({ children, data, columnSpec,
21
22
  export declare function useStoreAPI<T>(): StoreApi<DataSheetStore<T>>;
22
23
  export declare function useSelector<T = any, A = any>(selector: (state: DataSheetStore<T> & DataSheetComputedVals) => A): A;
23
24
  /** Atoms for efficient sub-selection of state */
24
- export declare const columnSpecAtom: import('jotai').Atom<import('./utils').ColumnSpec[]>;
25
+ export declare const columnSpecAtom: import('jotai').Atom<ColumnSpec[]>;
25
26
  export declare const tableDataAtom: import('jotai').WritableAtom<any[], [newData: any[]], void>;
package/dist/provider.js CHANGED
@@ -33,6 +33,7 @@ const storeAtom = atom(
33
33
  return set(storeWrapper, action);
34
34
  }
35
35
  );
36
+ const EMPTY_SPEC = [];
36
37
  const initializeStoreAtom = atom(
37
38
  null,
38
39
  (get, set, payload) => {
@@ -72,16 +73,21 @@ function DataSheetProviderInner({
72
73
  }) {
73
74
  const tableRef = useRef(null);
74
75
  const initializeStore = ctx.useSet(initializeStoreAtom);
76
+ const isFnSpec = typeof columnSpec === "function";
77
+ const staticSpec = isFnSpec ? EMPTY_SPEC : columnSpec;
75
78
  useEffect(() => {
76
79
  initializeStore({
77
- columnSpec: columnSpec ?? generateColumnSpec(data, columnSpecOptions),
80
+ columnSpec: staticSpec ?? generateColumnSpec(data, columnSpecOptions),
81
+ // A function spec is derived from the loaded rows in `_DataSheet`; tell
82
+ // the loader not to auto-generate a plain spec from the first chunk.
83
+ deferColumnSpec: isFnSpec,
78
84
  editable,
79
85
  enableColumnReordering,
80
86
  data,
81
87
  defaultColumnWidth,
82
88
  tableRef
83
89
  });
84
- }, [data, editable, columnSpec, columnSpecOptions, enableColumnReordering]);
90
+ }, [data, editable, staticSpec, isFnSpec, columnSpecOptions, enableColumnReordering]);
85
91
  return children;
86
92
  }
87
93
  function useStoreAPI() {
@@ -103,7 +109,7 @@ const tableDataAtom = atom(
103
109
  (get, set, newData) => {
104
110
  set(storeAtom, (state) => {
105
111
  let next = { ...state, data: newData };
106
- if (state.data.length == 0 && newData.length > 0 && state.columnSpec.length == 0) {
112
+ if (state.data.length == 0 && newData.length > 0 && state.columnSpec.length == 0 && !state.deferColumnSpec) {
107
113
  next.columnSpec = generateColumnSpec(newData, state.columnSpecOptions);
108
114
  }
109
115
  if (!state.controlledOverlay) {