@macrostrat/data-sheet 4.0.1 → 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 (83) hide show
  1. package/CHANGELOG.md +25 -0
  2. package/README.md +11 -1
  3. package/dist/actions/column-controls.cjs +102 -1
  4. package/dist/actions/column-controls.cjs.map +1 -1
  5. package/dist/actions/column-controls.js +104 -3
  6. package/dist/actions/column-controls.js.map +1 -1
  7. package/dist/actions/column-filter.cjs +48 -25
  8. package/dist/actions/column-filter.cjs.map +1 -1
  9. package/dist/actions/column-filter.js +50 -27
  10. package/dist/actions/column-filter.js.map +1 -1
  11. package/dist/actions/selection.cjs +2 -1
  12. package/dist/actions/selection.cjs.map +1 -1
  13. package/dist/actions/selection.js +2 -1
  14. package/dist/actions/selection.js.map +1 -1
  15. package/dist/actions/table-controls.cjs +21 -0
  16. package/dist/actions/table-controls.cjs.map +1 -1
  17. package/dist/actions/table-controls.d.ts +4 -0
  18. package/dist/actions/table-controls.js +21 -0
  19. package/dist/actions/table-controls.js.map +1 -1
  20. package/dist/actions/toolbar.cjs +34 -4
  21. package/dist/actions/toolbar.cjs.map +1 -1
  22. package/dist/actions/toolbar.js +35 -5
  23. package/dist/actions/toolbar.js.map +1 -1
  24. package/dist/actions/types.d.ts +9 -0
  25. package/dist/cell-renderer.cjs +9 -7
  26. package/dist/cell-renderer.cjs.map +1 -1
  27. package/dist/cell-renderer.js +9 -7
  28. package/dist/cell-renderer.js.map +1 -1
  29. package/dist/core.cjs +68 -9
  30. package/dist/core.cjs.map +1 -1
  31. package/dist/core.d.ts +32 -1
  32. package/dist/core.js +69 -10
  33. package/dist/core.js.map +1 -1
  34. package/dist/filters/operators.cjs +2 -2
  35. package/dist/filters/operators.cjs.map +1 -1
  36. package/dist/filters/operators.d.ts +1 -1
  37. package/dist/filters/operators.js +2 -2
  38. package/dist/filters/operators.js.map +1 -1
  39. package/dist/index.cjs +4 -2
  40. package/dist/index.cjs.map +1 -1
  41. package/dist/index.js +4 -2
  42. package/dist/postgrest-table/data-loaders.cjs +1 -8
  43. package/dist/postgrest-table/data-loaders.cjs.map +1 -1
  44. package/dist/postgrest-table/data-loaders.js +1 -8
  45. package/dist/postgrest-table/data-loaders.js.map +1 -1
  46. package/dist/provider.cjs +9 -3
  47. package/dist/provider.cjs.map +1 -1
  48. package/dist/provider.d.ts +2 -1
  49. package/dist/provider.js +9 -3
  50. package/dist/provider.js.map +1 -1
  51. package/dist/renderers/column-header-cell.cjs +33 -32
  52. package/dist/renderers/column-header-cell.cjs.map +1 -1
  53. package/dist/renderers/column-header-cell.d.ts +1 -2
  54. package/dist/renderers/column-header-cell.js +34 -33
  55. package/dist/renderers/column-header-cell.js.map +1 -1
  56. package/dist/types.cjs +11 -0
  57. package/dist/types.cjs.map +1 -1
  58. package/dist/types.d.ts +55 -2
  59. package/dist/types.js +11 -0
  60. package/dist/types.js.map +1 -1
  61. package/dist/utils/column-spec.cjs.map +1 -1
  62. package/dist/utils/column-spec.d.ts +8 -0
  63. package/dist/utils/column-spec.js.map +1 -1
  64. package/dist/zustand-store.cjs +7 -3
  65. package/dist/zustand-store.cjs.map +1 -1
  66. package/dist/zustand-store.js +8 -4
  67. package/dist/zustand-store.js.map +1 -1
  68. package/package.json +1 -1
  69. package/src/actions/column-controls.ts +133 -2
  70. package/src/actions/column-filter.ts +59 -30
  71. package/src/actions/selection.ts +1 -0
  72. package/src/actions/table-controls.ts +24 -0
  73. package/src/actions/toolbar.ts +61 -5
  74. package/src/actions/types.ts +10 -0
  75. package/src/cell-renderer.ts +23 -10
  76. package/src/core.ts +131 -13
  77. package/src/filters/operators.ts +5 -3
  78. package/src/postgrest-table/data-loaders.ts +6 -10
  79. package/src/provider.ts +22 -5
  80. package/src/renderers/column-header-cell.ts +51 -36
  81. package/src/types.ts +66 -2
  82. package/src/utils/column-spec.ts +8 -0
  83. package/src/zustand-store.ts +12 -5
@@ -1 +1 @@
1
- {"version":3,"file":"operators.cjs","sources":["../../src/filters/operators.ts"],"sourcesContent":["/**\n * The canonical column-filter operator vocabulary, shared by the client-side\n * predicate (in-memory tables) and the server-side descriptor (a provider\n * translates it to a query). Promoted to core from the PostgREST column header,\n * so there is one operator model, not two.\n */\nimport type { ColumnSpec } from \"../utils/column-spec\";\n\n/** Column-filter operators. A superset that covers both in-memory comparison\n * and common backend query operators (PostgREST maps onto these names). */\nexport type FilterOperator =\n | \"eq\"\n | \"neq\"\n | \"like\"\n | \"ilike\"\n | \"gt\"\n | \"lt\"\n | \"gte\"\n | \"lte\"\n | \"is\";\n\n/** Human-readable operator labels for menus and active-filter tags. */\nexport const OPERATOR_LABELS: Record<FilterOperator, string> = {\n eq: \"=\",\n neq: \"≠\",\n like: \"like\",\n ilike: \"contains\",\n gt: \">\",\n lt: \"<\",\n gte: \"≥\",\n lte: \"≤\",\n is: \"is\",\n};\n\nconst STRING_OPERATORS: FilterOperator[] = [\"eq\", \"neq\", \"ilike\"];\nconst NUMERIC_OPERATORS: FilterOperator[] = [\n \"eq\",\n \"neq\",\n \"gt\",\n \"lt\",\n \"gte\",\n \"lte\",\n];\nconst BOOLEAN_OPERATORS: FilterOperator[] = [\"eq\", \"neq\"];\n\n/** Fallback when the column has no type information. */\nexport const DEFAULT_FILTER_OPERATORS: FilterOperator[] = [\n \"eq\",\n \"neq\",\n \"ilike\",\n \"gt\",\n \"lt\",\n \"gte\",\n \"lte\",\n];\n\nconst OPERATORS_BY_TYPE: Record<string, FilterOperator[]> = {\n string: STRING_OPERATORS,\n number: NUMERIC_OPERATORS,\n integer: NUMERIC_OPERATORS,\n boolean: BOOLEAN_OPERATORS,\n};\n\n/** Resolve the operators offered for a column: explicit `filterable.operators`\n * first, else inferred from `dataType`, else the defaults. */\nexport function getOperatorsForColumn(col: ColumnSpec): FilterOperator[] {\n if (typeof col.filterable === \"object\" && col.filterable.operators?.length) {\n return col.filterable.operators as FilterOperator[];\n }\n if (col.dataType != null) {\n return OPERATORS_BY_TYPE[col.dataType] ?? DEFAULT_FILTER_OPERATORS;\n }\n return DEFAULT_FILTER_OPERATORS;\n}\n\nfunction looseEq(a: any, b: any): boolean {\n if (a == null) return b == null || b === \"\";\n // Compare numerically when both look numeric, else as strings.\n const an = Number(a);\n const bn = Number(b);\n if (!Number.isNaN(an) && !Number.isNaN(bn) && String(a).trim() !== \"\") {\n return an === bn;\n }\n return String(a).toLowerCase() === String(b).toLowerCase();\n}\n\n/**\n * The client-side predicate for a `{ operator, value }` column filter — the\n * in-memory equivalent of what a backend applies server-side. An empty filter\n * value is treated as \"no constraint\" (matches everything).\n */\nexport function testFilterOperator(\n cellValue: any,\n operator: FilterOperator,\n filterValue: any,\n): boolean {\n if (filterValue === \"\" || filterValue == null) return true;\n switch (operator) {\n case \"eq\":\n return looseEq(cellValue, filterValue);\n case \"neq\":\n return !looseEq(cellValue, filterValue);\n case \"gt\":\n return Number(cellValue) > Number(filterValue);\n case \"lt\":\n return Number(cellValue) < Number(filterValue);\n case \"gte\":\n return Number(cellValue) >= Number(filterValue);\n case \"lte\":\n return Number(cellValue) <= Number(filterValue);\n case \"like\":\n return String(cellValue ?? \"\").includes(String(filterValue));\n case \"ilike\":\n return String(cellValue ?? \"\")\n .toLowerCase()\n .includes(String(filterValue).toLowerCase());\n case \"is\": {\n const v = String(filterValue).toLowerCase();\n if (v === \"null\") return cellValue == null;\n if (v === \"true\") return cellValue === true;\n if (v === \"false\") return cellValue === false;\n return looseEq(cellValue, filterValue);\n }\n default:\n return true;\n }\n}\n"],"names":[],"mappings":";;AAsBO,MAAM,kBAAkD;AAAA,EAC7D,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,KAAK;AAAA,EACL,IAAI;AACN;AAEA,MAAM,mBAAqC,CAAC,MAAM,OAAO,OAAO;AAChE,MAAM,oBAAsC;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,oBAAsC,CAAC,MAAM,KAAK;AAGjD,MAAM,2BAA6C;AAAA,EACxD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,MAAM,oBAAsD;AAAA,EAC1D,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AACX;AAIO,SAAS,sBAAsB,KAAmC;AACvE,MAAI,OAAO,IAAI,eAAe,YAAY,IAAI,WAAW,WAAW,QAAQ;AAC1E,WAAO,IAAI,WAAW;AAAA,EACxB;AACA,MAAI,IAAI,YAAY,MAAM;AACxB,WAAO,kBAAkB,IAAI,QAAQ,KAAK;AAAA,EAC5C;AACA,SAAO;AACT;AAEA,SAAS,QAAQ,GAAQ,GAAiB;AACxC,MAAI,KAAK,KAAM,QAAO,KAAK,QAAQ,MAAM;AAEzC,QAAM,KAAK,OAAO,CAAC;AACnB,QAAM,KAAK,OAAO,CAAC;AACnB,MAAI,CAAC,OAAO,MAAM,EAAE,KAAK,CAAC,OAAO,MAAM,EAAE,KAAK,OAAO,CAAC,EAAE,KAAA,MAAW,IAAI;AACrE,WAAO,OAAO;AAAA,EAChB;AACA,SAAO,OAAO,CAAC,EAAE,YAAA,MAAkB,OAAO,CAAC,EAAE,YAAA;AAC/C;AAOO,SAAS,mBACd,WACA,UACA,aACS;AACT,MAAI,gBAAgB,MAAM,eAAe,KAAM,QAAO;AACtD,UAAQ,UAAA;AAAA,IACN,KAAK;AACH,aAAO,QAAQ,WAAW,WAAW;AAAA,IACvC,KAAK;AACH,aAAO,CAAC,QAAQ,WAAW,WAAW;AAAA,IACxC,KAAK;AACH,aAAO,OAAO,SAAS,IAAI,OAAO,WAAW;AAAA,IAC/C,KAAK;AACH,aAAO,OAAO,SAAS,IAAI,OAAO,WAAW;AAAA,IAC/C,KAAK;AACH,aAAO,OAAO,SAAS,KAAK,OAAO,WAAW;AAAA,IAChD,KAAK;AACH,aAAO,OAAO,SAAS,KAAK,OAAO,WAAW;AAAA,IAChD,KAAK;AACH,aAAO,OAAO,aAAa,EAAE,EAAE,SAAS,OAAO,WAAW,CAAC;AAAA,IAC7D,KAAK;AACH,aAAO,OAAO,aAAa,EAAE,EAC1B,YAAA,EACA,SAAS,OAAO,WAAW,EAAE,aAAa;AAAA,IAC/C,KAAK,MAAM;AACT,YAAM,IAAI,OAAO,WAAW,EAAE,YAAA;AAC9B,UAAI,MAAM,OAAQ,QAAO,aAAa;AACtC,UAAI,MAAM,OAAQ,QAAO,cAAc;AACvC,UAAI,MAAM,QAAS,QAAO,cAAc;AACxC,aAAO,QAAQ,WAAW,WAAW;AAAA,IACvC;AAAA,IACA;AACE,aAAO;AAAA,EAAA;AAEb;;;;;"}
1
+ {"version":3,"file":"operators.cjs","sources":["../../src/filters/operators.ts"],"sourcesContent":["/**\n * The canonical column-filter operator vocabulary, shared by the client-side\n * predicate (in-memory tables) and the server-side descriptor (a provider\n * translates it to a query). Promoted to core from the PostgREST column header,\n * so there is one operator model, not two.\n */\nimport type { ColumnSpec } from \"../utils/column-spec\";\n\n/** Column-filter operators. A superset that covers both in-memory comparison\n * and common backend query operators (PostgREST maps onto these names). */\nexport type FilterOperator =\n | \"eq\"\n | \"neq\"\n | \"like\"\n | \"ilike\"\n | \"gt\"\n | \"lt\"\n | \"gte\"\n | \"lte\"\n | \"is\";\n\n/** Human-readable operator labels for menus and active-filter tags. */\nexport const OPERATOR_LABELS: Record<FilterOperator, string> = {\n eq: \"=\",\n neq: \"≠\",\n like: \"like\",\n ilike: \"contains\",\n gt: \">\",\n lt: \"<\",\n gte: \"≥\",\n lte: \"≤\",\n is: \"is\",\n};\n\n// \"contains\" (`ilike`) leads for text, so it's the default operator — the most\n// common intent when filtering a string column.\nconst STRING_OPERATORS: FilterOperator[] = [\"ilike\", \"eq\", \"neq\"];\nconst NUMERIC_OPERATORS: FilterOperator[] = [\n \"eq\",\n \"neq\",\n \"gt\",\n \"lt\",\n \"gte\",\n \"lte\",\n];\nconst BOOLEAN_OPERATORS: FilterOperator[] = [\"eq\", \"neq\"];\n\n/** Fallback when the column has no type information. Leads with \"contains\". */\nexport const DEFAULT_FILTER_OPERATORS: FilterOperator[] = [\n \"ilike\",\n \"eq\",\n \"neq\",\n \"gt\",\n \"lt\",\n \"gte\",\n \"lte\",\n];\n\nconst OPERATORS_BY_TYPE: Record<string, FilterOperator[]> = {\n string: STRING_OPERATORS,\n number: NUMERIC_OPERATORS,\n integer: NUMERIC_OPERATORS,\n boolean: BOOLEAN_OPERATORS,\n};\n\n/** Resolve the operators offered for a column: explicit `filterable.operators`\n * first, else inferred from `dataType`, else the defaults. */\nexport function getOperatorsForColumn(col: ColumnSpec): FilterOperator[] {\n if (typeof col.filterable === \"object\" && col.filterable.operators?.length) {\n return col.filterable.operators as FilterOperator[];\n }\n if (col.dataType != null) {\n return OPERATORS_BY_TYPE[col.dataType] ?? DEFAULT_FILTER_OPERATORS;\n }\n return DEFAULT_FILTER_OPERATORS;\n}\n\nfunction looseEq(a: any, b: any): boolean {\n if (a == null) return b == null || b === \"\";\n // Compare numerically when both look numeric, else as strings.\n const an = Number(a);\n const bn = Number(b);\n if (!Number.isNaN(an) && !Number.isNaN(bn) && String(a).trim() !== \"\") {\n return an === bn;\n }\n return String(a).toLowerCase() === String(b).toLowerCase();\n}\n\n/**\n * The client-side predicate for a `{ operator, value }` column filter — the\n * in-memory equivalent of what a backend applies server-side. An empty filter\n * value is treated as \"no constraint\" (matches everything).\n */\nexport function testFilterOperator(\n cellValue: any,\n operator: FilterOperator,\n filterValue: any,\n): boolean {\n if (filterValue === \"\" || filterValue == null) return true;\n switch (operator) {\n case \"eq\":\n return looseEq(cellValue, filterValue);\n case \"neq\":\n return !looseEq(cellValue, filterValue);\n case \"gt\":\n return Number(cellValue) > Number(filterValue);\n case \"lt\":\n return Number(cellValue) < Number(filterValue);\n case \"gte\":\n return Number(cellValue) >= Number(filterValue);\n case \"lte\":\n return Number(cellValue) <= Number(filterValue);\n case \"like\":\n return String(cellValue ?? \"\").includes(String(filterValue));\n case \"ilike\":\n return String(cellValue ?? \"\")\n .toLowerCase()\n .includes(String(filterValue).toLowerCase());\n case \"is\": {\n const v = String(filterValue).toLowerCase();\n if (v === \"null\") return cellValue == null;\n if (v === \"true\") return cellValue === true;\n if (v === \"false\") return cellValue === false;\n return looseEq(cellValue, filterValue);\n }\n default:\n return true;\n }\n}\n"],"names":[],"mappings":";;AAsBO,MAAM,kBAAkD;AAAA,EAC7D,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,KAAK;AAAA,EACL,IAAI;AACN;AAIA,MAAM,mBAAqC,CAAC,SAAS,MAAM,KAAK;AAChE,MAAM,oBAAsC;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,oBAAsC,CAAC,MAAM,KAAK;AAGjD,MAAM,2BAA6C;AAAA,EACxD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,MAAM,oBAAsD;AAAA,EAC1D,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AACX;AAIO,SAAS,sBAAsB,KAAmC;AACvE,MAAI,OAAO,IAAI,eAAe,YAAY,IAAI,WAAW,WAAW,QAAQ;AAC1E,WAAO,IAAI,WAAW;AAAA,EACxB;AACA,MAAI,IAAI,YAAY,MAAM;AACxB,WAAO,kBAAkB,IAAI,QAAQ,KAAK;AAAA,EAC5C;AACA,SAAO;AACT;AAEA,SAAS,QAAQ,GAAQ,GAAiB;AACxC,MAAI,KAAK,KAAM,QAAO,KAAK,QAAQ,MAAM;AAEzC,QAAM,KAAK,OAAO,CAAC;AACnB,QAAM,KAAK,OAAO,CAAC;AACnB,MAAI,CAAC,OAAO,MAAM,EAAE,KAAK,CAAC,OAAO,MAAM,EAAE,KAAK,OAAO,CAAC,EAAE,KAAA,MAAW,IAAI;AACrE,WAAO,OAAO;AAAA,EAChB;AACA,SAAO,OAAO,CAAC,EAAE,YAAA,MAAkB,OAAO,CAAC,EAAE,YAAA;AAC/C;AAOO,SAAS,mBACd,WACA,UACA,aACS;AACT,MAAI,gBAAgB,MAAM,eAAe,KAAM,QAAO;AACtD,UAAQ,UAAA;AAAA,IACN,KAAK;AACH,aAAO,QAAQ,WAAW,WAAW;AAAA,IACvC,KAAK;AACH,aAAO,CAAC,QAAQ,WAAW,WAAW;AAAA,IACxC,KAAK;AACH,aAAO,OAAO,SAAS,IAAI,OAAO,WAAW;AAAA,IAC/C,KAAK;AACH,aAAO,OAAO,SAAS,IAAI,OAAO,WAAW;AAAA,IAC/C,KAAK;AACH,aAAO,OAAO,SAAS,KAAK,OAAO,WAAW;AAAA,IAChD,KAAK;AACH,aAAO,OAAO,SAAS,KAAK,OAAO,WAAW;AAAA,IAChD,KAAK;AACH,aAAO,OAAO,aAAa,EAAE,EAAE,SAAS,OAAO,WAAW,CAAC;AAAA,IAC7D,KAAK;AACH,aAAO,OAAO,aAAa,EAAE,EAC1B,YAAA,EACA,SAAS,OAAO,WAAW,EAAE,aAAa;AAAA,IAC/C,KAAK,MAAM;AACT,YAAM,IAAI,OAAO,WAAW,EAAE,YAAA;AAC9B,UAAI,MAAM,OAAQ,QAAO,aAAa;AACtC,UAAI,MAAM,OAAQ,QAAO,cAAc;AACvC,UAAI,MAAM,QAAS,QAAO,cAAc;AACxC,aAAO,QAAQ,WAAW,WAAW;AAAA,IACvC;AAAA,IACA;AACE,aAAO;AAAA,EAAA;AAEb;;;;;"}
@@ -4,7 +4,7 @@ import { ColumnSpec } from '../utils/column-spec';
4
4
  export type FilterOperator = "eq" | "neq" | "like" | "ilike" | "gt" | "lt" | "gte" | "lte" | "is";
5
5
  /** Human-readable operator labels for menus and active-filter tags. */
6
6
  export declare const OPERATOR_LABELS: Record<FilterOperator, string>;
7
- /** Fallback when the column has no type information. */
7
+ /** Fallback when the column has no type information. Leads with "contains". */
8
8
  export declare const DEFAULT_FILTER_OPERATORS: FilterOperator[];
9
9
  /** Resolve the operators offered for a column: explicit `filterable.operators`
10
10
  * first, else inferred from `dataType`, else the defaults. */
@@ -9,7 +9,7 @@ const OPERATOR_LABELS = {
9
9
  lte: "≤",
10
10
  is: "is"
11
11
  };
12
- const STRING_OPERATORS = ["eq", "neq", "ilike"];
12
+ const STRING_OPERATORS = ["ilike", "eq", "neq"];
13
13
  const NUMERIC_OPERATORS = [
14
14
  "eq",
15
15
  "neq",
@@ -20,9 +20,9 @@ const NUMERIC_OPERATORS = [
20
20
  ];
21
21
  const BOOLEAN_OPERATORS = ["eq", "neq"];
22
22
  const DEFAULT_FILTER_OPERATORS = [
23
+ "ilike",
23
24
  "eq",
24
25
  "neq",
25
- "ilike",
26
26
  "gt",
27
27
  "lt",
28
28
  "gte",
@@ -1 +1 @@
1
- {"version":3,"file":"operators.js","sources":["../../src/filters/operators.ts"],"sourcesContent":["/**\n * The canonical column-filter operator vocabulary, shared by the client-side\n * predicate (in-memory tables) and the server-side descriptor (a provider\n * translates it to a query). Promoted to core from the PostgREST column header,\n * so there is one operator model, not two.\n */\nimport type { ColumnSpec } from \"../utils/column-spec\";\n\n/** Column-filter operators. A superset that covers both in-memory comparison\n * and common backend query operators (PostgREST maps onto these names). */\nexport type FilterOperator =\n | \"eq\"\n | \"neq\"\n | \"like\"\n | \"ilike\"\n | \"gt\"\n | \"lt\"\n | \"gte\"\n | \"lte\"\n | \"is\";\n\n/** Human-readable operator labels for menus and active-filter tags. */\nexport const OPERATOR_LABELS: Record<FilterOperator, string> = {\n eq: \"=\",\n neq: \"≠\",\n like: \"like\",\n ilike: \"contains\",\n gt: \">\",\n lt: \"<\",\n gte: \"≥\",\n lte: \"≤\",\n is: \"is\",\n};\n\nconst STRING_OPERATORS: FilterOperator[] = [\"eq\", \"neq\", \"ilike\"];\nconst NUMERIC_OPERATORS: FilterOperator[] = [\n \"eq\",\n \"neq\",\n \"gt\",\n \"lt\",\n \"gte\",\n \"lte\",\n];\nconst BOOLEAN_OPERATORS: FilterOperator[] = [\"eq\", \"neq\"];\n\n/** Fallback when the column has no type information. */\nexport const DEFAULT_FILTER_OPERATORS: FilterOperator[] = [\n \"eq\",\n \"neq\",\n \"ilike\",\n \"gt\",\n \"lt\",\n \"gte\",\n \"lte\",\n];\n\nconst OPERATORS_BY_TYPE: Record<string, FilterOperator[]> = {\n string: STRING_OPERATORS,\n number: NUMERIC_OPERATORS,\n integer: NUMERIC_OPERATORS,\n boolean: BOOLEAN_OPERATORS,\n};\n\n/** Resolve the operators offered for a column: explicit `filterable.operators`\n * first, else inferred from `dataType`, else the defaults. */\nexport function getOperatorsForColumn(col: ColumnSpec): FilterOperator[] {\n if (typeof col.filterable === \"object\" && col.filterable.operators?.length) {\n return col.filterable.operators as FilterOperator[];\n }\n if (col.dataType != null) {\n return OPERATORS_BY_TYPE[col.dataType] ?? DEFAULT_FILTER_OPERATORS;\n }\n return DEFAULT_FILTER_OPERATORS;\n}\n\nfunction looseEq(a: any, b: any): boolean {\n if (a == null) return b == null || b === \"\";\n // Compare numerically when both look numeric, else as strings.\n const an = Number(a);\n const bn = Number(b);\n if (!Number.isNaN(an) && !Number.isNaN(bn) && String(a).trim() !== \"\") {\n return an === bn;\n }\n return String(a).toLowerCase() === String(b).toLowerCase();\n}\n\n/**\n * The client-side predicate for a `{ operator, value }` column filter — the\n * in-memory equivalent of what a backend applies server-side. An empty filter\n * value is treated as \"no constraint\" (matches everything).\n */\nexport function testFilterOperator(\n cellValue: any,\n operator: FilterOperator,\n filterValue: any,\n): boolean {\n if (filterValue === \"\" || filterValue == null) return true;\n switch (operator) {\n case \"eq\":\n return looseEq(cellValue, filterValue);\n case \"neq\":\n return !looseEq(cellValue, filterValue);\n case \"gt\":\n return Number(cellValue) > Number(filterValue);\n case \"lt\":\n return Number(cellValue) < Number(filterValue);\n case \"gte\":\n return Number(cellValue) >= Number(filterValue);\n case \"lte\":\n return Number(cellValue) <= Number(filterValue);\n case \"like\":\n return String(cellValue ?? \"\").includes(String(filterValue));\n case \"ilike\":\n return String(cellValue ?? \"\")\n .toLowerCase()\n .includes(String(filterValue).toLowerCase());\n case \"is\": {\n const v = String(filterValue).toLowerCase();\n if (v === \"null\") return cellValue == null;\n if (v === \"true\") return cellValue === true;\n if (v === \"false\") return cellValue === false;\n return looseEq(cellValue, filterValue);\n }\n default:\n return true;\n }\n}\n"],"names":[],"mappings":"AAsBO,MAAM,kBAAkD;AAAA,EAC7D,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,KAAK;AAAA,EACL,IAAI;AACN;AAEA,MAAM,mBAAqC,CAAC,MAAM,OAAO,OAAO;AAChE,MAAM,oBAAsC;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,oBAAsC,CAAC,MAAM,KAAK;AAGjD,MAAM,2BAA6C;AAAA,EACxD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,MAAM,oBAAsD;AAAA,EAC1D,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AACX;AAIO,SAAS,sBAAsB,KAAmC;AACvE,MAAI,OAAO,IAAI,eAAe,YAAY,IAAI,WAAW,WAAW,QAAQ;AAC1E,WAAO,IAAI,WAAW;AAAA,EACxB;AACA,MAAI,IAAI,YAAY,MAAM;AACxB,WAAO,kBAAkB,IAAI,QAAQ,KAAK;AAAA,EAC5C;AACA,SAAO;AACT;AAEA,SAAS,QAAQ,GAAQ,GAAiB;AACxC,MAAI,KAAK,KAAM,QAAO,KAAK,QAAQ,MAAM;AAEzC,QAAM,KAAK,OAAO,CAAC;AACnB,QAAM,KAAK,OAAO,CAAC;AACnB,MAAI,CAAC,OAAO,MAAM,EAAE,KAAK,CAAC,OAAO,MAAM,EAAE,KAAK,OAAO,CAAC,EAAE,KAAA,MAAW,IAAI;AACrE,WAAO,OAAO;AAAA,EAChB;AACA,SAAO,OAAO,CAAC,EAAE,YAAA,MAAkB,OAAO,CAAC,EAAE,YAAA;AAC/C;AAOO,SAAS,mBACd,WACA,UACA,aACS;AACT,MAAI,gBAAgB,MAAM,eAAe,KAAM,QAAO;AACtD,UAAQ,UAAA;AAAA,IACN,KAAK;AACH,aAAO,QAAQ,WAAW,WAAW;AAAA,IACvC,KAAK;AACH,aAAO,CAAC,QAAQ,WAAW,WAAW;AAAA,IACxC,KAAK;AACH,aAAO,OAAO,SAAS,IAAI,OAAO,WAAW;AAAA,IAC/C,KAAK;AACH,aAAO,OAAO,SAAS,IAAI,OAAO,WAAW;AAAA,IAC/C,KAAK;AACH,aAAO,OAAO,SAAS,KAAK,OAAO,WAAW;AAAA,IAChD,KAAK;AACH,aAAO,OAAO,SAAS,KAAK,OAAO,WAAW;AAAA,IAChD,KAAK;AACH,aAAO,OAAO,aAAa,EAAE,EAAE,SAAS,OAAO,WAAW,CAAC;AAAA,IAC7D,KAAK;AACH,aAAO,OAAO,aAAa,EAAE,EAC1B,YAAA,EACA,SAAS,OAAO,WAAW,EAAE,aAAa;AAAA,IAC/C,KAAK,MAAM;AACT,YAAM,IAAI,OAAO,WAAW,EAAE,YAAA;AAC9B,UAAI,MAAM,OAAQ,QAAO,aAAa;AACtC,UAAI,MAAM,OAAQ,QAAO,cAAc;AACvC,UAAI,MAAM,QAAS,QAAO,cAAc;AACxC,aAAO,QAAQ,WAAW,WAAW;AAAA,IACvC;AAAA,IACA;AACE,aAAO;AAAA,EAAA;AAEb;"}
1
+ {"version":3,"file":"operators.js","sources":["../../src/filters/operators.ts"],"sourcesContent":["/**\n * The canonical column-filter operator vocabulary, shared by the client-side\n * predicate (in-memory tables) and the server-side descriptor (a provider\n * translates it to a query). Promoted to core from the PostgREST column header,\n * so there is one operator model, not two.\n */\nimport type { ColumnSpec } from \"../utils/column-spec\";\n\n/** Column-filter operators. A superset that covers both in-memory comparison\n * and common backend query operators (PostgREST maps onto these names). */\nexport type FilterOperator =\n | \"eq\"\n | \"neq\"\n | \"like\"\n | \"ilike\"\n | \"gt\"\n | \"lt\"\n | \"gte\"\n | \"lte\"\n | \"is\";\n\n/** Human-readable operator labels for menus and active-filter tags. */\nexport const OPERATOR_LABELS: Record<FilterOperator, string> = {\n eq: \"=\",\n neq: \"≠\",\n like: \"like\",\n ilike: \"contains\",\n gt: \">\",\n lt: \"<\",\n gte: \"≥\",\n lte: \"≤\",\n is: \"is\",\n};\n\n// \"contains\" (`ilike`) leads for text, so it's the default operator — the most\n// common intent when filtering a string column.\nconst STRING_OPERATORS: FilterOperator[] = [\"ilike\", \"eq\", \"neq\"];\nconst NUMERIC_OPERATORS: FilterOperator[] = [\n \"eq\",\n \"neq\",\n \"gt\",\n \"lt\",\n \"gte\",\n \"lte\",\n];\nconst BOOLEAN_OPERATORS: FilterOperator[] = [\"eq\", \"neq\"];\n\n/** Fallback when the column has no type information. Leads with \"contains\". */\nexport const DEFAULT_FILTER_OPERATORS: FilterOperator[] = [\n \"ilike\",\n \"eq\",\n \"neq\",\n \"gt\",\n \"lt\",\n \"gte\",\n \"lte\",\n];\n\nconst OPERATORS_BY_TYPE: Record<string, FilterOperator[]> = {\n string: STRING_OPERATORS,\n number: NUMERIC_OPERATORS,\n integer: NUMERIC_OPERATORS,\n boolean: BOOLEAN_OPERATORS,\n};\n\n/** Resolve the operators offered for a column: explicit `filterable.operators`\n * first, else inferred from `dataType`, else the defaults. */\nexport function getOperatorsForColumn(col: ColumnSpec): FilterOperator[] {\n if (typeof col.filterable === \"object\" && col.filterable.operators?.length) {\n return col.filterable.operators as FilterOperator[];\n }\n if (col.dataType != null) {\n return OPERATORS_BY_TYPE[col.dataType] ?? DEFAULT_FILTER_OPERATORS;\n }\n return DEFAULT_FILTER_OPERATORS;\n}\n\nfunction looseEq(a: any, b: any): boolean {\n if (a == null) return b == null || b === \"\";\n // Compare numerically when both look numeric, else as strings.\n const an = Number(a);\n const bn = Number(b);\n if (!Number.isNaN(an) && !Number.isNaN(bn) && String(a).trim() !== \"\") {\n return an === bn;\n }\n return String(a).toLowerCase() === String(b).toLowerCase();\n}\n\n/**\n * The client-side predicate for a `{ operator, value }` column filter — the\n * in-memory equivalent of what a backend applies server-side. An empty filter\n * value is treated as \"no constraint\" (matches everything).\n */\nexport function testFilterOperator(\n cellValue: any,\n operator: FilterOperator,\n filterValue: any,\n): boolean {\n if (filterValue === \"\" || filterValue == null) return true;\n switch (operator) {\n case \"eq\":\n return looseEq(cellValue, filterValue);\n case \"neq\":\n return !looseEq(cellValue, filterValue);\n case \"gt\":\n return Number(cellValue) > Number(filterValue);\n case \"lt\":\n return Number(cellValue) < Number(filterValue);\n case \"gte\":\n return Number(cellValue) >= Number(filterValue);\n case \"lte\":\n return Number(cellValue) <= Number(filterValue);\n case \"like\":\n return String(cellValue ?? \"\").includes(String(filterValue));\n case \"ilike\":\n return String(cellValue ?? \"\")\n .toLowerCase()\n .includes(String(filterValue).toLowerCase());\n case \"is\": {\n const v = String(filterValue).toLowerCase();\n if (v === \"null\") return cellValue == null;\n if (v === \"true\") return cellValue === true;\n if (v === \"false\") return cellValue === false;\n return looseEq(cellValue, filterValue);\n }\n default:\n return true;\n }\n}\n"],"names":[],"mappings":"AAsBO,MAAM,kBAAkD;AAAA,EAC7D,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,MAAM;AAAA,EACN,OAAO;AAAA,EACP,IAAI;AAAA,EACJ,IAAI;AAAA,EACJ,KAAK;AAAA,EACL,KAAK;AAAA,EACL,IAAI;AACN;AAIA,MAAM,mBAAqC,CAAC,SAAS,MAAM,KAAK;AAChE,MAAM,oBAAsC;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,oBAAsC,CAAC,MAAM,KAAK;AAGjD,MAAM,2BAA6C;AAAA,EACxD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,MAAM,oBAAsD;AAAA,EAC1D,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AACX;AAIO,SAAS,sBAAsB,KAAmC;AACvE,MAAI,OAAO,IAAI,eAAe,YAAY,IAAI,WAAW,WAAW,QAAQ;AAC1E,WAAO,IAAI,WAAW;AAAA,EACxB;AACA,MAAI,IAAI,YAAY,MAAM;AACxB,WAAO,kBAAkB,IAAI,QAAQ,KAAK;AAAA,EAC5C;AACA,SAAO;AACT;AAEA,SAAS,QAAQ,GAAQ,GAAiB;AACxC,MAAI,KAAK,KAAM,QAAO,KAAK,QAAQ,MAAM;AAEzC,QAAM,KAAK,OAAO,CAAC;AACnB,QAAM,KAAK,OAAO,CAAC;AACnB,MAAI,CAAC,OAAO,MAAM,EAAE,KAAK,CAAC,OAAO,MAAM,EAAE,KAAK,OAAO,CAAC,EAAE,KAAA,MAAW,IAAI;AACrE,WAAO,OAAO;AAAA,EAChB;AACA,SAAO,OAAO,CAAC,EAAE,YAAA,MAAkB,OAAO,CAAC,EAAE,YAAA;AAC/C;AAOO,SAAS,mBACd,WACA,UACA,aACS;AACT,MAAI,gBAAgB,MAAM,eAAe,KAAM,QAAO;AACtD,UAAQ,UAAA;AAAA,IACN,KAAK;AACH,aAAO,QAAQ,WAAW,WAAW;AAAA,IACvC,KAAK;AACH,aAAO,CAAC,QAAQ,WAAW,WAAW;AAAA,IACxC,KAAK;AACH,aAAO,OAAO,SAAS,IAAI,OAAO,WAAW;AAAA,IAC/C,KAAK;AACH,aAAO,OAAO,SAAS,IAAI,OAAO,WAAW;AAAA,IAC/C,KAAK;AACH,aAAO,OAAO,SAAS,KAAK,OAAO,WAAW;AAAA,IAChD,KAAK;AACH,aAAO,OAAO,SAAS,KAAK,OAAO,WAAW;AAAA,IAChD,KAAK;AACH,aAAO,OAAO,aAAa,EAAE,EAAE,SAAS,OAAO,WAAW,CAAC;AAAA,IAC7D,KAAK;AACH,aAAO,OAAO,aAAa,EAAE,EAC1B,YAAA,EACA,SAAS,OAAO,WAAW,EAAE,aAAa;AAAA,IAC/C,KAAK,MAAM;AACT,YAAM,IAAI,OAAO,WAAW,EAAE,YAAA;AAC9B,UAAI,MAAM,OAAQ,QAAO,aAAa;AACtC,UAAI,MAAM,OAAQ,QAAO,cAAc;AACvC,UAAI,MAAM,QAAS,QAAO,cAAc;AACxC,aAAO,QAAQ,WAAW,WAAW;AAAA,IACvC;AAAA,IACA;AACE,aAAO;AAAA,EAAA;AAEb;"}
package/dist/index.cjs CHANGED
@@ -20,12 +20,12 @@ const clipboard = require("./actions/clipboard.cjs");
20
20
  const builtin = require("./actions/builtin.cjs");
21
21
  const dataLoaders = require("./postgrest-table/data-loaders.cjs");
22
22
  const selection = require("./actions/selection.cjs");
23
+ const tableControls = require("./actions/table-controls.cjs");
23
24
  const validation = require("./utils/validation.cjs");
24
25
  const columnControls = require("./actions/column-controls.cjs");
25
26
  const columnFilter = require("./actions/column-filter.cjs");
26
27
  const keyHandling = require("./utils/key-handling.cjs");
27
28
  const columnSpec = require("./utils/column-spec.cjs");
28
- const tableControls = require("./actions/table-controls.cjs");
29
29
  exports.DataSheet = core.DataSheet;
30
30
  exports.DataSheetDensity = core.DataSheetDensity;
31
31
  exports.getRowsToDelete = core.getRowsToDelete;
@@ -49,6 +49,7 @@ exports.tableDataAtom = provider.tableDataAtom;
49
49
  exports.useSelector = provider.useSelector;
50
50
  exports.useStoreAPI = provider.useStoreAPI;
51
51
  exports.range = index$1.range;
52
+ exports.DEFAULT_ROW_STATUS_STYLES = types.DEFAULT_ROW_STATUS_STYLES;
52
53
  exports.DS_ROW_ID = types.DS_ROW_ID;
53
54
  exports.TableElementStatus = types.TableElementStatus;
54
55
  exports.DEFAULT_FILTER_OPERATORS = operators.DEFAULT_FILTER_OPERATORS;
@@ -104,6 +105,8 @@ exports.getSelectedColumnKeys = selection.getSelectedColumnKeys;
104
105
  exports.getSelectedRowIndices = selection.getSelectedRowIndices;
105
106
  exports.getSelectionCardinality = selection.getSelectionCardinality;
106
107
  exports.mergeColumnActions = selection.mergeColumnActions;
108
+ exports.clearSelectionAction = tableControls.clearSelectionAction;
109
+ exports.scrollToRowAction = tableControls.scrollToRowAction;
107
110
  exports.collectValidationErrors = validation.collectValidationErrors;
108
111
  exports.validateCell = validation.validateCell;
109
112
  exports.columnControlActions = columnControls.columnControlActions;
@@ -117,5 +120,4 @@ exports.multiLineTextKeyHandler = keyHandling.multiLineTextKeyHandler;
117
120
  exports.tableHotkeysAtom = keyHandling.tableHotkeysAtom;
118
121
  exports.generateColumnSpec = columnSpec.generateColumnSpec;
119
122
  exports.generateDefaultColumnSpec = columnSpec.generateDefaultColumnSpec;
120
- exports.scrollToRowAction = tableControls.scrollToRowAction;
121
123
  //# sourceMappingURL=index.cjs.map
@@ -1 +1 @@
1
- {"version":3,"file":"index.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
1
+ {"version":3,"file":"index.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
package/dist/index.js CHANGED
@@ -2,7 +2,7 @@ import { DataSheet, DataSheetDensity, getRowsToDelete } from "./core.js";
2
2
  import { ExpandedLithologies, IntervalCell, LongTextViewer, PostgRESTTableView, SearchAction, fullTextSearchAction, lithologyRenderer, notifyOnError, wrapWithErrorHandling } from "./postgrest-table/index.js";
3
3
  import { DataSheetProvider, DataSheetProviderInner, columnSpecAtom, ctx, storeAPIAtom, storeAtom, tableActionsAtom, tableDataAtom, useSelector, useStoreAPI } from "./provider.js";
4
4
  import { range } from "./utils/index.js";
5
- import { DS_ROW_ID, TableElementStatus } from "./types.js";
5
+ import { DEFAULT_ROW_STATUS_STYLES, DS_ROW_ID, TableElementStatus } from "./types.js";
6
6
  import { DEFAULT_FILTER_OPERATORS, OPERATOR_LABELS, getOperatorsForColumn, testFilterOperator } from "./filters/operators.js";
7
7
  import { Cell } from "@blueprintjs/table";
8
8
  import { ALL_CARDINALITIES, createSaveAction, hasPendingChanges } from "./actions/edit-actions.js";
@@ -18,12 +18,12 @@ import { PasteShape, clipboardActions, copyAction, cutAction, pasteAction, seria
18
18
  import { addRowAction, defaultTableActions, deleteRowsAction, resetChangesAction } from "./actions/builtin.js";
19
19
  import { applyColumnFilters, chunkPageAtom, compareRowsBySorts, createLocalProvider, createPostgRESTFetchChunk, createPostgRESTProvider, dataRefreshTokenAtom, standardizeFilter, tableFooterAtom, useDataLoader, useScrollHandler, viewInfoAtom } from "./postgrest-table/data-loaders.js";
20
20
  import { buildActionContext, collectAllFilters, computeFilteredRowIndices, computeSelectionShape, getApplicableActions, getSelectedColumnKeys, getSelectedRowIndices, getSelectionCardinality, mergeColumnActions } from "./actions/selection.js";
21
+ import { clearSelectionAction, scrollToRowAction } from "./actions/table-controls.js";
21
22
  import { collectValidationErrors, validateCell } from "./utils/validation.js";
22
23
  import { columnControlActions, columnFilterAction, columnSortAction, isColumnFilterable } from "./actions/column-controls.js";
23
24
  import { columnFilter, columnFilterId } from "./actions/column-filter.js";
24
25
  import { editorKeyHandlerAtom, multiLineTextKeyHandler, tableHotkeysAtom } from "./utils/key-handling.js";
25
26
  import { generateColumnSpec, generateDefaultColumnSpec } from "./utils/column-spec.js";
26
- import { scrollToRowAction } from "./actions/table-controls.js";
27
27
  export {
28
28
  ALL_CARDINALITIES,
29
29
  ActionsToolbar,
@@ -33,6 +33,7 @@ export {
33
33
  ColorCell,
34
34
  ColorPicker,
35
35
  DEFAULT_FILTER_OPERATORS,
36
+ DEFAULT_ROW_STATUS_STYLES,
36
37
  DS_ROW_ID,
37
38
  DataSheet,
38
39
  DataSheetDensity,
@@ -54,6 +55,7 @@ export {
54
55
  applyColumnFilters,
55
56
  buildActionContext,
56
57
  chunkPageAtom,
58
+ clearSelectionAction,
57
59
  clipboardActions,
58
60
  collectAllFilters,
59
61
  collectValidationErrors,
@@ -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;"}