@macrostrat/data-sheet 4.1.1 → 4.2.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 (304) hide show
  1. package/CHANGELOG.md +46 -0
  2. package/dist/actions/builtin.cjs +1 -1
  3. package/dist/actions/builtin.cjs.map +1 -1
  4. package/dist/actions/builtin.d.ts +0 -2
  5. package/dist/actions/builtin.js +1 -1
  6. package/dist/actions/builtin.js.map +1 -1
  7. package/dist/actions/clipboard.cjs +1 -1
  8. package/dist/actions/clipboard.cjs.map +1 -1
  9. package/dist/actions/clipboard.d.ts +3 -2
  10. package/dist/actions/clipboard.js +1 -1
  11. package/dist/actions/clipboard.js.map +1 -1
  12. package/dist/actions/column-controls.cjs +7 -196
  13. package/dist/actions/column-controls.cjs.map +1 -1
  14. package/dist/actions/column-controls.d.ts +1 -1
  15. package/dist/actions/column-controls.js +5 -194
  16. package/dist/actions/column-controls.js.map +1 -1
  17. package/dist/actions/column-filter.cjs +24 -73
  18. package/dist/actions/column-filter.cjs.map +1 -1
  19. package/dist/actions/column-filter.d.ts +6 -4
  20. package/dist/actions/column-filter.js +25 -74
  21. package/dist/actions/column-filter.js.map +1 -1
  22. package/dist/actions/context.cjs +147 -0
  23. package/dist/actions/context.cjs.map +1 -0
  24. package/dist/actions/context.d.ts +93 -0
  25. package/dist/actions/context.js +145 -0
  26. package/dist/actions/context.js.map +1 -0
  27. package/dist/actions/edit-actions.cjs.map +1 -1
  28. package/dist/actions/edit-actions.d.ts +3 -1
  29. package/dist/actions/edit-actions.js.map +1 -1
  30. package/dist/actions/index.d.ts +2 -3
  31. package/dist/actions/selection.cjs +70 -115
  32. package/dist/actions/selection.cjs.map +1 -1
  33. package/dist/actions/selection.d.ts +22 -12
  34. package/dist/actions/selection.js +71 -114
  35. package/dist/actions/selection.js.map +1 -1
  36. package/dist/actions/table-actions.cjs +41 -0
  37. package/dist/actions/table-actions.cjs.map +1 -0
  38. package/dist/actions/{table-controls.d.ts → table-actions.d.ts} +0 -4
  39. package/dist/actions/{table-controls.js → table-actions.js} +2 -23
  40. package/dist/actions/table-actions.js.map +1 -0
  41. package/dist/actions/types.d.ts +11 -89
  42. package/dist/components/cell-detail.cjs +6 -6
  43. package/dist/components/cell-detail.cjs.map +1 -1
  44. package/dist/components/cell-detail.js +1 -1
  45. package/dist/components/colors.cjs.map +1 -1
  46. package/dist/components/colors.js.map +1 -1
  47. package/dist/components/editor-popup.cjs +7 -7
  48. package/dist/components/editor-popup.cjs.map +1 -1
  49. package/dist/components/editor-popup.js +1 -1
  50. package/dist/components/index.d.ts +2 -1
  51. package/dist/components/indicators/filter-and-sort.cjs +378 -0
  52. package/dist/components/indicators/filter-and-sort.cjs.map +1 -0
  53. package/dist/components/indicators/filter-and-sort.d.ts +59 -0
  54. package/dist/components/indicators/filter-and-sort.js +376 -0
  55. package/dist/components/indicators/filter-and-sort.js.map +1 -0
  56. package/dist/components/indicators/filter-and-sort.module.sass.cjs +16 -0
  57. package/dist/components/indicators/filter-and-sort.module.sass.cjs.map +1 -0
  58. package/dist/components/indicators/filter-and-sort.module.sass.js +14 -0
  59. package/dist/components/indicators/filter-and-sort.module.sass.js.map +1 -0
  60. package/dist/components/indicators/index.d.ts +4 -0
  61. package/dist/components/indicators/selection.cjs +113 -0
  62. package/dist/components/indicators/selection.cjs.map +1 -0
  63. package/dist/components/indicators/selection.d.ts +3 -0
  64. package/dist/components/indicators/selection.js +111 -0
  65. package/dist/components/indicators/selection.js.map +1 -0
  66. package/dist/components/indicators/selection.module.sass.cjs +19 -0
  67. package/dist/components/indicators/selection.module.sass.cjs.map +1 -0
  68. package/dist/components/indicators/selection.module.sass.js +17 -0
  69. package/dist/components/indicators/selection.module.sass.js.map +1 -0
  70. package/dist/components/indicators/unified-filters.cjs +130 -0
  71. package/dist/components/indicators/unified-filters.cjs.map +1 -0
  72. package/dist/components/indicators/unified-filters.d.ts +10 -0
  73. package/dist/components/indicators/unified-filters.js +130 -0
  74. package/dist/components/indicators/unified-filters.js.map +1 -0
  75. package/dist/components/indicators/view-info.cjs +59 -0
  76. package/dist/components/indicators/view-info.cjs.map +1 -0
  77. package/dist/components/indicators/view-info.d.ts +11 -0
  78. package/dist/components/{view-info.js → indicators/view-info.js} +20 -16
  79. package/dist/components/indicators/view-info.js.map +1 -0
  80. package/dist/components/text-areas.cjs +5 -5
  81. package/dist/components/text-areas.cjs.map +1 -1
  82. package/dist/components/text-areas.js +1 -1
  83. package/dist/components/toolbars/actions-toolbar.cjs +185 -0
  84. package/dist/components/toolbars/actions-toolbar.cjs.map +1 -0
  85. package/dist/{actions/toolbar.d.ts → components/toolbars/actions-toolbar.d.ts} +9 -5
  86. package/dist/{actions/toolbar.js → components/toolbars/actions-toolbar.js} +37 -112
  87. package/dist/components/toolbars/actions-toolbar.js.map +1 -0
  88. package/dist/components/toolbars/actions-toolbar.module.sass.cjs +29 -0
  89. package/dist/components/toolbars/actions-toolbar.module.sass.cjs.map +1 -0
  90. package/dist/components/toolbars/actions-toolbar.module.sass.js +27 -0
  91. package/dist/components/toolbars/actions-toolbar.module.sass.js.map +1 -0
  92. package/dist/components/toolbars/active-filters.cjs +120 -0
  93. package/dist/components/toolbars/active-filters.cjs.map +1 -0
  94. package/dist/{actions/filters.d.ts → components/toolbars/active-filters.d.ts} +3 -3
  95. package/dist/components/toolbars/active-filters.js +120 -0
  96. package/dist/components/toolbars/active-filters.js.map +1 -0
  97. package/dist/components/toolbars/index.d.ts +2 -0
  98. package/dist/data-panel.cjs +291 -0
  99. package/dist/data-panel.cjs.map +1 -0
  100. package/dist/data-panel.d.ts +110 -0
  101. package/dist/data-panel.js +289 -0
  102. package/dist/data-panel.js.map +1 -0
  103. package/dist/data-panel.module.sass.cjs +40 -0
  104. package/dist/data-panel.module.sass.cjs.map +1 -0
  105. package/dist/data-panel.module.sass.js +38 -0
  106. package/dist/data-panel.module.sass.js.map +1 -0
  107. package/dist/{core.cjs → data-sheet.cjs} +126 -188
  108. package/dist/data-sheet.cjs.map +1 -0
  109. package/dist/data-sheet.css +241 -13
  110. package/dist/data-sheet.d.ts +16 -0
  111. package/dist/{core.js → data-sheet.js} +95 -157
  112. package/dist/data-sheet.js.map +1 -0
  113. package/dist/data-view.cjs +47 -0
  114. package/dist/data-view.cjs.map +1 -0
  115. package/dist/data-view.d.ts +15 -0
  116. package/dist/data-view.js +45 -0
  117. package/dist/data-view.js.map +1 -0
  118. package/dist/filters/operators.cjs +19 -2
  119. package/dist/filters/operators.cjs.map +1 -1
  120. package/dist/filters/operators.d.ts +4 -3
  121. package/dist/filters/operators.js +19 -2
  122. package/dist/filters/operators.js.map +1 -1
  123. package/dist/index.cjs +106 -47
  124. package/dist/index.cjs.map +1 -1
  125. package/dist/index.d.ts +4 -3
  126. package/dist/index.js +76 -17
  127. package/dist/index.js.map +1 -1
  128. package/dist/notifications.cjs +4 -4
  129. package/dist/notifications.cjs.map +1 -1
  130. package/dist/notifications.js +1 -1
  131. package/dist/postgrest-table/data-loaders.cjs +128 -95
  132. package/dist/postgrest-table/data-loaders.cjs.map +1 -1
  133. package/dist/postgrest-table/data-loaders.d.ts +52 -82
  134. package/dist/postgrest-table/data-loaders.js +109 -76
  135. package/dist/postgrest-table/data-loaders.js.map +1 -1
  136. package/dist/postgrest-table/index.cjs +18 -17
  137. package/dist/postgrest-table/index.cjs.map +1 -1
  138. package/dist/postgrest-table/index.d.ts +4 -3
  139. package/dist/postgrest-table/index.js +9 -8
  140. package/dist/postgrest-table/index.js.map +1 -1
  141. package/dist/{utils → provider}/column-spec.cjs +23 -9
  142. package/dist/provider/column-spec.cjs.map +1 -0
  143. package/dist/{utils → provider}/column-spec.d.ts +73 -2
  144. package/dist/{utils → provider}/column-spec.js +24 -10
  145. package/dist/provider/column-spec.js.map +1 -0
  146. package/dist/provider/core.cjs +382 -0
  147. package/dist/provider/core.cjs.map +1 -0
  148. package/dist/provider/core.d.ts +74 -0
  149. package/dist/provider/core.js +380 -0
  150. package/dist/provider/core.js.map +1 -0
  151. package/dist/provider/index.d.ts +7 -0
  152. package/dist/provider/interactions.cjs +128 -0
  153. package/dist/provider/interactions.cjs.map +1 -0
  154. package/dist/provider/interactions.d.ts +39 -0
  155. package/dist/provider/interactions.js +128 -0
  156. package/dist/provider/interactions.js.map +1 -0
  157. package/dist/provider/selection.cjs +29 -0
  158. package/dist/provider/selection.cjs.map +1 -0
  159. package/dist/provider/selection.d.ts +9 -0
  160. package/dist/provider/selection.js +29 -0
  161. package/dist/provider/selection.js.map +1 -0
  162. package/dist/provider/table-data.cjs +92 -0
  163. package/dist/provider/table-data.cjs.map +1 -0
  164. package/dist/provider/table-data.d.ts +81 -0
  165. package/dist/provider/table-data.js +92 -0
  166. package/dist/provider/table-data.js.map +1 -0
  167. package/dist/provider/types.cjs +22 -0
  168. package/dist/provider/types.cjs.map +1 -0
  169. package/dist/provider/types.d.ts +256 -0
  170. package/dist/provider/types.js +22 -0
  171. package/dist/provider/types.js.map +1 -0
  172. package/dist/{zustand-store.cjs → provider/zustand-store.cjs} +36 -23
  173. package/dist/provider/zustand-store.cjs.map +1 -0
  174. package/dist/{zustand-store.js → provider/zustand-store.js} +21 -8
  175. package/dist/provider/zustand-store.js.map +1 -0
  176. package/dist/{cell-renderer.cjs → renderers/cell-renderer.cjs} +67 -34
  177. package/dist/renderers/cell-renderer.cjs.map +1 -0
  178. package/dist/{cell-renderer.d.ts → renderers/cell-renderer.d.ts} +1 -2
  179. package/dist/{cell-renderer.js → renderers/cell-renderer.js} +65 -32
  180. package/dist/renderers/cell-renderer.js.map +1 -0
  181. package/dist/renderers/column-header-cell.cjs +21 -13
  182. package/dist/renderers/column-header-cell.cjs.map +1 -1
  183. package/dist/renderers/column-header-cell.d.ts +3 -2
  184. package/dist/renderers/column-header-cell.js +20 -12
  185. package/dist/renderers/column-header-cell.js.map +1 -1
  186. package/dist/renderers/index.d.ts +1 -0
  187. package/dist/types.cjs +7 -19
  188. package/dist/types.cjs.map +1 -1
  189. package/dist/types.d.ts +117 -229
  190. package/dist/types.js +7 -19
  191. package/dist/types.js.map +1 -1
  192. package/dist/utils/atoms.cjs +24 -0
  193. package/dist/utils/atoms.cjs.map +1 -0
  194. package/dist/utils/atoms.d.ts +4 -0
  195. package/dist/utils/atoms.js +24 -0
  196. package/dist/utils/atoms.js.map +1 -0
  197. package/dist/utils/debug-overlay.cjs.map +1 -1
  198. package/dist/utils/debug-overlay.js.map +1 -1
  199. package/dist/utils/index.d.ts +2 -3
  200. package/dist/utils/key-handling.cjs +140 -139
  201. package/dist/utils/key-handling.cjs.map +1 -1
  202. package/dist/utils/key-handling.d.ts +4 -2
  203. package/dist/utils/key-handling.js +136 -135
  204. package/dist/utils/key-handling.js.map +1 -1
  205. package/dist/utils/validation.cjs +6 -1
  206. package/dist/utils/validation.cjs.map +1 -1
  207. package/dist/utils/validation.d.ts +1 -1
  208. package/dist/utils/validation.js +6 -1
  209. package/dist/utils/validation.js.map +1 -1
  210. package/package.json +4 -3
  211. package/src/actions/builtin.ts +1 -4
  212. package/src/actions/clipboard.ts +4 -3
  213. package/src/actions/column-controls.ts +12 -245
  214. package/src/actions/column-filter.ts +28 -92
  215. package/src/actions/context.ts +299 -0
  216. package/src/actions/edit-actions.ts +3 -1
  217. package/src/actions/index.ts +2 -3
  218. package/src/actions/selection.ts +109 -156
  219. package/src/actions/{table-controls.ts → table-actions.ts} +0 -24
  220. package/src/actions/types.ts +17 -101
  221. package/src/components/colors.ts +1 -1
  222. package/src/components/index.ts +2 -1
  223. package/src/components/indicators/filter-and-sort.module.sass +13 -0
  224. package/src/components/indicators/filter-and-sort.ts +478 -0
  225. package/src/components/indicators/index.ts +4 -0
  226. package/src/components/indicators/selection.module.sass +22 -0
  227. package/src/components/indicators/selection.ts +141 -0
  228. package/src/components/indicators/unified-filters.ts +161 -0
  229. package/src/components/{view-info.ts → indicators/view-info.ts} +19 -30
  230. package/src/{actions/toolbar.module.sass → components/toolbars/actions-toolbar.module.sass} +17 -4
  231. package/src/{actions/toolbar.ts → components/toolbars/actions-toolbar.ts} +49 -150
  232. package/src/components/toolbars/active-filters.ts +150 -0
  233. package/src/components/toolbars/index.ts +2 -0
  234. package/src/data-panel.module.sass +185 -0
  235. package/src/data-panel.ts +556 -0
  236. package/src/{core.ts → data-sheet.ts} +156 -327
  237. package/src/data-view.ts +70 -0
  238. package/src/filters/operators.ts +33 -3
  239. package/src/index.ts +4 -3
  240. package/src/postgrest-table/data-loaders.ts +244 -171
  241. package/src/postgrest-table/index.ts +10 -9
  242. package/src/{utils → provider}/column-spec.ts +30 -15
  243. package/src/provider/core.ts +585 -0
  244. package/src/provider/index.ts +7 -0
  245. package/src/provider/interactions.ts +161 -0
  246. package/src/provider/selection.ts +31 -0
  247. package/src/provider/table-data.ts +178 -0
  248. package/src/provider/types.ts +273 -0
  249. package/src/{zustand-store.ts → provider/zustand-store.ts} +35 -14
  250. package/src/{cell-renderer.ts → renderers/cell-renderer.ts} +140 -57
  251. package/src/renderers/column-header-cell.ts +21 -14
  252. package/src/renderers/index.ts +1 -0
  253. package/src/types.ts +137 -239
  254. package/src/utils/atoms.ts +28 -0
  255. package/src/utils/debug-overlay.ts +1 -1
  256. package/src/utils/index.ts +2 -8
  257. package/src/utils/key-handling.ts +170 -164
  258. package/src/utils/validation.ts +7 -2
  259. package/dist/actions/filters.cjs +0 -139
  260. package/dist/actions/filters.cjs.map +0 -1
  261. package/dist/actions/filters.js +0 -139
  262. package/dist/actions/filters.js.map +0 -1
  263. package/dist/actions/table-controls.cjs +0 -62
  264. package/dist/actions/table-controls.cjs.map +0 -1
  265. package/dist/actions/table-controls.js.map +0 -1
  266. package/dist/actions/toolbar.cjs +0 -260
  267. package/dist/actions/toolbar.cjs.map +0 -1
  268. package/dist/actions/toolbar.js.map +0 -1
  269. package/dist/actions/toolbar.module.sass.cjs +0 -27
  270. package/dist/actions/toolbar.module.sass.cjs.map +0 -1
  271. package/dist/actions/toolbar.module.sass.js +0 -25
  272. package/dist/actions/toolbar.module.sass.js.map +0 -1
  273. package/dist/cell-renderer.cjs.map +0 -1
  274. package/dist/cell-renderer.js.map +0 -1
  275. package/dist/components/view-info.cjs +0 -55
  276. package/dist/components/view-info.cjs.map +0 -1
  277. package/dist/components/view-info.d.ts +0 -5
  278. package/dist/components/view-info.js.map +0 -1
  279. package/dist/core.cjs.map +0 -1
  280. package/dist/core.d.ts +0 -117
  281. package/dist/core.js.map +0 -1
  282. package/dist/provider.cjs +0 -197
  283. package/dist/provider.cjs.map +0 -1
  284. package/dist/provider.d.ts +0 -26
  285. package/dist/provider.js +0 -195
  286. package/dist/provider.js.map +0 -1
  287. package/dist/table-updates/data-parameter.d.ts +0 -14
  288. package/dist/table-updates/filter.d.ts +0 -16
  289. package/dist/table-updates/index.d.ts +0 -19
  290. package/dist/utils/column-spec.cjs.map +0 -1
  291. package/dist/utils/column-spec.js.map +0 -1
  292. package/dist/utils/index.cjs +0 -9
  293. package/dist/utils/index.cjs.map +0 -1
  294. package/dist/utils/index.js +0 -9
  295. package/dist/utils/index.js.map +0 -1
  296. package/dist/zustand-store.cjs.map +0 -1
  297. package/dist/zustand-store.js.map +0 -1
  298. package/src/actions/filters.ts +0 -176
  299. package/src/components/actions.module.sass +0 -8
  300. package/src/provider.ts +0 -267
  301. package/src/table-updates/data-parameter.ts +0 -44
  302. package/src/table-updates/filter.ts +0 -124
  303. package/src/table-updates/index.ts +0 -239
  304. /package/dist/{zustand-store.d.ts → provider/zustand-store.d.ts} +0 -0
@@ -1,15 +1,15 @@
1
1
  "use strict";
2
2
  Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
3
- const core = require("@blueprintjs/core");
3
+ const core$1 = require("@blueprintjs/core");
4
4
  const jotai = require("jotai");
5
- const provider = require("./provider.cjs");
6
5
  const react = require("react");
6
+ const core = require("./provider/core.cjs");
7
7
  const toasterAtom = jotai.atom(null);
8
8
  function useToaster(toaster) {
9
- const [toasterRef, setToasterRef] = provider.ctx.use(toasterAtom);
9
+ const [toasterRef, setToasterRef] = core.ctx.use(toasterAtom);
10
10
  react.useEffect(() => {
11
11
  {
12
- core.OverlayToaster.create().then((t) => setToasterRef(t));
12
+ core$1.OverlayToaster.create().then((t) => setToasterRef(t));
13
13
  }
14
14
  }, [toaster]);
15
15
  return toasterRef;
@@ -1 +1 @@
1
- {"version":3,"file":"notifications.cjs","sources":["../src/notifications.ts"],"sourcesContent":["import { OverlayToaster } from \"@blueprintjs/core\";\nimport { atom, useAtom } from \"jotai\";\nimport { ctx } from \"./provider\";\nimport { useEffect } from \"react\";\n\n/** Toaster access\n * Atom that stores a reference to a global or contextual toaster used by the\n * data sheet.\n * */\nexport const toasterAtom = atom(null);\n\nexport function useToaster(toaster?: OverlayToaster): OverlayToaster {\n const [toasterRef, setToasterRef] = ctx.use(toasterAtom);\n useEffect(() => {\n if (toaster != null) {\n setToasterRef(toaster);\n } else {\n OverlayToaster.create().then((t) => setToasterRef(t));\n }\n }, [toaster]);\n return toasterRef;\n}\n"],"names":["atom","ctx","useEffect","OverlayToaster"],"mappings":";;;;;;AASO,MAAM,cAAcA,MAAAA,KAAK,IAAI;AAE7B,SAAS,WAAW,SAA0C;AACnE,QAAM,CAAC,YAAY,aAAa,IAAIC,SAAAA,IAAI,IAAI,WAAW;AACvDC,QAAAA,UAAU,MAAM;AAGP;AACLC,WAAAA,eAAe,SAAS,KAAK,CAAC,MAAM,cAAc,CAAC,CAAC;AAAA,IACtD;AAAA,EACF,GAAG,CAAC,OAAO,CAAC;AACZ,SAAO;AACT;;;"}
1
+ {"version":3,"file":"notifications.cjs","sources":["../src/notifications.ts"],"sourcesContent":["import { OverlayToaster } from \"@blueprintjs/core\";\nimport { atom, useAtom } from \"jotai\";\nimport { ctx } from \"./provider\";\nimport { useEffect } from \"react\";\n\n/** Toaster access\n * Atom that stores a reference to a global or contextual toaster used by the\n * data sheet.\n * */\nexport const toasterAtom = atom(null);\n\nexport function useToaster(toaster?: OverlayToaster): OverlayToaster {\n const [toasterRef, setToasterRef] = ctx.use(toasterAtom);\n useEffect(() => {\n if (toaster != null) {\n setToasterRef(toaster);\n } else {\n OverlayToaster.create().then((t) => setToasterRef(t));\n }\n }, [toaster]);\n return toasterRef;\n}\n"],"names":["atom","ctx","useEffect","OverlayToaster"],"mappings":";;;;;;AASO,MAAM,cAAcA,MAAAA,KAAK,IAAI;AAE7B,SAAS,WAAW,SAA0C;AACnE,QAAM,CAAC,YAAY,aAAa,IAAIC,KAAAA,IAAI,IAAI,WAAW;AACvDC,QAAAA,UAAU,MAAM;AAGP;AACLC,aAAAA,eAAe,SAAS,KAAK,CAAC,MAAM,cAAc,CAAC,CAAC;AAAA,IACtD;AAAA,EACF,GAAG,CAAC,OAAO,CAAC;AACZ,SAAO;AACT;;;"}
@@ -1,7 +1,7 @@
1
1
  import { OverlayToaster } from "@blueprintjs/core";
2
2
  import { atom } from "jotai";
3
- import { ctx } from "./provider.js";
4
3
  import { useEffect } from "react";
4
+ import { ctx } from "./provider/core.js";
5
5
  const toasterAtom = atom(null);
6
6
  function useToaster(toaster) {
7
7
  const [toasterRef, setToasterRef] = ctx.use(toasterAtom);
@@ -6,8 +6,9 @@ const react = require("react");
6
6
  const update = require("immutability-helper");
7
7
  const postgrestJs = require("@supabase/postgrest-js");
8
8
  const loadingUtils = require("./loading-utils.cjs");
9
- const provider = require("../provider.cjs");
10
9
  const jotai = require("jotai");
10
+ const core = require("../provider/core.cjs");
11
+ const tableData = require("../provider/table-data.cjs");
11
12
  const _interopDefault = (e) => e && e.__esModule ? e : { default: e };
12
13
  const update__default = /* @__PURE__ */ _interopDefault(update);
13
14
  function standardizeFilter(columnFilter) {
@@ -21,11 +22,22 @@ function standardizeFilter(columnFilter) {
21
22
  function applyColumnFilters(req, filters) {
22
23
  for (const cf of filters) {
23
24
  if (cf.value === "" || cf.value == null) continue;
25
+ if (cf.operator === "cs") {
26
+ req = req.contains(cf.key, splitFilterList(cf.value));
27
+ continue;
28
+ }
29
+ if (cf.operator === "ov") {
30
+ req = req.overlaps(cf.key, splitFilterList(cf.value));
31
+ continue;
32
+ }
24
33
  const val = cf.operator === "like" || cf.operator === "ilike" ? `*${cf.value}*` : cf.value;
25
34
  req = req.filter(cf.key, cf.operator, val);
26
35
  }
27
36
  return req;
28
37
  }
38
+ function splitFilterList(value) {
39
+ return String(value).split(",").map((s) => s.trim()).filter((s) => s !== "");
40
+ }
29
41
  function lazyLoadingReducer(state, action) {
30
42
  switch (action.type) {
31
43
  case "start-loading":
@@ -82,6 +94,31 @@ function lazyLoadingReducer(state, action) {
82
94
  return state;
83
95
  }
84
96
  }
97
+ function formatKeysetValue(v) {
98
+ const s = String(v);
99
+ if (s === "" || /[,.:()"\\ ]/.test(s)) {
100
+ return `"${s.replace(/\\/g, "\\\\").replace(/"/g, '\\"')}"`;
101
+ }
102
+ return s;
103
+ }
104
+ function keysetEq(key, v) {
105
+ return v == null ? `${key}.is.null` : `${key}.eq.${formatKeysetValue(v)}`;
106
+ }
107
+ function buildKeysetPredicate(clauses, lastRow) {
108
+ const terms = [];
109
+ for (let i = 0; i < clauses.length; i++) {
110
+ const v = lastRow[clauses[i].key];
111
+ if (v == null) continue;
112
+ const conds = [];
113
+ for (let j = 0; j < i; j++) {
114
+ conds.push(keysetEq(clauses[j].key, lastRow[clauses[j].key]));
115
+ }
116
+ const op = clauses[i].ascending ?? true ? "gt" : "lt";
117
+ conds.push(`${clauses[i].key}.${op}.${formatKeysetValue(v)}`);
118
+ terms.push(conds.length === 1 ? conds[0] : `and(${conds.join(",")})`);
119
+ }
120
+ return terms.length > 0 ? terms.join(",") : null;
121
+ }
85
122
  function buildQuery(client, config) {
86
123
  const { columns = "*", count, lastLoadedRowIndex } = config;
87
124
  const opts = { count };
@@ -98,18 +135,17 @@ function buildQuery(client, config) {
98
135
  }
99
136
  const orderClauses = buildPostgrestOrderClauses(
100
137
  config.order ?? [],
101
- config.identityKey
138
+ config.identityOrder ?? config.identityKey
102
139
  );
103
140
  let hasOrdering = false;
104
141
  for (const clause of orderClauses) {
105
142
  query = query.order(clause.key, clause);
106
- if (config.lastLoadedRow != null) {
107
- const op = clause.ascending ?? true ? "gt" : "lt";
108
- const value = config.lastLoadedRow[clause.key];
109
- query = query[op](clause.key, value);
110
- }
111
143
  hasOrdering = true;
112
144
  }
145
+ if (config.lastLoadedRow != null && hasOrdering) {
146
+ const pred = buildKeysetPredicate(orderClauses, config.lastLoadedRow);
147
+ if (pred != null) query = query.or(pred);
148
+ }
113
149
  let offset = null;
114
150
  if (!hasOrdering && lastLoadedRowIndex > 0) {
115
151
  offset = lastLoadedRowIndex + 1;
@@ -122,7 +158,6 @@ function buildQuery(client, config) {
122
158
  query = query.limit(config.limit);
123
159
  }
124
160
  }
125
- console.log("query", query.url.search);
126
161
  return query;
127
162
  }
128
163
  const defaultVisibleRegion = {
@@ -139,28 +174,65 @@ const lazyLoaderCoreStateAtom = jotai.atom({
139
174
  pageSize: 100
140
175
  });
141
176
  const chunkPageAtom = jotai.atom(0);
142
- const dataRefreshTokenAtom = jotai.atom(0);
143
177
  const tableFooterAtom = jotai.atom((get) => {
144
- const core = get(lazyLoaderCoreStateAtom);
145
- const data = get(provider.tableDataAtom) ?? [];
178
+ const core$1 = get(lazyLoaderCoreStateAtom);
179
+ const data = get(core.tableDataAtom) ?? [];
146
180
  let loaded = 0;
147
181
  let hasGaps = false;
148
182
  for (const row of data) {
149
183
  if (row != null) loaded++;
150
184
  else hasGaps = true;
151
185
  }
152
- const total = core.totalCount ?? (hasGaps ? null : data.length);
153
- const totalPages = core.totalCount != null ? Math.ceil(core.totalCount / core.pageSize) : null;
186
+ const total = core$1.totalCount ?? (hasGaps ? null : data.length);
187
+ const totalPages = core$1.totalCount != null ? Math.ceil(core$1.totalCount / core$1.pageSize) : null;
154
188
  return {
155
- mode: core.fetchMode,
189
+ mode: core$1.fetchMode,
156
190
  loaded,
157
191
  total,
158
- loading: core.loading,
192
+ loading: core$1.loading,
159
193
  page: get(chunkPageAtom),
160
- pageSize: core.pageSize,
194
+ pageSize: core$1.pageSize,
161
195
  totalPages
162
196
  };
163
197
  });
198
+ const autoLoadPagesAtom = jotai.atom(null);
199
+ const resumeBaselineAtom = jotai.atom(0);
200
+ function useLoadControls() {
201
+ const footer = core.ctx.useValue(tableFooterAtom);
202
+ const data = core.ctx.useValue(core.tableDataAtom) ?? [];
203
+ const { isLocalProvider } = core.ctx.useValue(core.dataProviderAtom);
204
+ const resumeBaseline = core.ctx.useValue(resumeBaselineAtom);
205
+ const autoLoadPages = core.ctx.useValue(autoLoadPagesAtom);
206
+ const setResumeBaseline = core.ctx.useSet(resumeBaselineAtom);
207
+ const setVisibleRegion = core.ctx.useSet(visibleRegionAtom);
208
+ let loadedCount = 0;
209
+ for (const row of data) if (row != null) loadedCount++;
210
+ const pageSize = footer.pageSize || 100;
211
+ const dataLength = data.length;
212
+ const hasMore = !isLocalProvider && loadedCount < dataLength;
213
+ const paused = autoLoadPages != null && loadedCount - resumeBaseline >= autoLoadPages * pageSize;
214
+ const canLoadMore = hasMore && !footer.loading && !paused;
215
+ const advance = react.useCallback(() => {
216
+ setVisibleRegion({
217
+ rowIndexStart: 0,
218
+ rowIndexEnd: Math.min(loadedCount + pageSize, dataLength)
219
+ });
220
+ }, [setVisibleRegion, loadedCount, pageSize, dataLength]);
221
+ const loadMore = react.useCallback(() => {
222
+ setResumeBaseline(loadedCount);
223
+ advance();
224
+ }, [setResumeBaseline, loadedCount, advance]);
225
+ return {
226
+ loadMore,
227
+ loading: footer.loading,
228
+ hasMore,
229
+ loaded: footer.loaded,
230
+ total: footer.total,
231
+ paused,
232
+ canLoadMore,
233
+ advance
234
+ };
235
+ }
164
236
  const viewInfoAtom = jotai.atom((get) => {
165
237
  const state = get(lazyLoaderStateAtom);
166
238
  return {
@@ -172,11 +244,11 @@ const viewInfoAtom = jotai.atom((get) => {
172
244
  });
173
245
  const lazyLoaderStateAtom = jotai.atom(
174
246
  (get) => {
175
- const core = get(lazyLoaderCoreStateAtom);
176
- const data = get(provider.tableDataAtom);
247
+ const core$1 = get(lazyLoaderCoreStateAtom);
248
+ const data = get(core.tableDataAtom);
177
249
  const visibleRegion = get(visibleRegionAtom);
178
250
  return {
179
- ...core,
251
+ ...core$1,
180
252
  data,
181
253
  visibleRegion
182
254
  };
@@ -190,7 +262,7 @@ const lazyLoaderStateAtom = jotai.atom(
190
262
  set(visibleRegionAtom, visibleRegion);
191
263
  }
192
264
  if (data != null) {
193
- set(provider.tableDataAtom, data);
265
+ set(core.tableDataAtom, data);
194
266
  }
195
267
  if (Object.keys(rest).length > 1) {
196
268
  set(lazyLoaderCoreStateAtom, (v) => ({ ...v, ...rest }));
@@ -198,7 +270,7 @@ const lazyLoaderStateAtom = jotai.atom(
198
270
  }
199
271
  );
200
272
  function useLazyLoaderReducer() {
201
- const [state, setState] = provider.ctx.use(lazyLoaderStateAtom);
273
+ const [state, setState] = core.ctx.use(lazyLoaderStateAtom);
202
274
  const dispatch = react.useCallback(
203
275
  (action) => setState((prev) => lazyLoadingReducer(prev, action)),
204
276
  [setState]
@@ -208,28 +280,33 @@ function useLazyLoaderReducer() {
208
280
  function buildPostgrestOrderClauses(sorts, identityOrder) {
209
281
  const identitySort = typeof identityOrder == "string" ? { key: identityOrder, ascending: true } : identityOrder;
210
282
  const identityKey = identitySort.key;
211
- const clauses = sorts.map((sort) => {
212
- return {
283
+ const seen = /* @__PURE__ */ new Set();
284
+ const clauses = [];
285
+ for (const sort of sorts) {
286
+ if (seen.has(sort.key)) continue;
287
+ seen.add(sort.key);
288
+ clauses.push({
213
289
  key: sort.key,
214
290
  ascending: sort.ascending,
215
291
  nullsFirst: "nullsFirst" in sort ? sort.nullsFirst : false
216
- };
217
- });
218
- const hasIdentityClause = clauses.some((d) => d.key === identityKey);
219
- if (hasIdentityClause) {
220
- clauses.sort((a, b) => {
221
- if (a.key === identityKey) return 1;
222
- if (b.key === identityKey) return -1;
223
- return 0;
224
292
  });
293
+ }
294
+ if (seen.has(identityKey)) {
295
+ const idx = clauses.findIndex((c) => c.key === identityKey);
296
+ const [idClause] = clauses.splice(idx, 1);
297
+ clauses.push(idClause);
225
298
  } else {
226
- clauses.push(identitySort);
299
+ clauses.push({
300
+ key: identitySort.key,
301
+ ascending: identitySort.ascending ?? true,
302
+ nullsFirst: identitySort.nullsFirst ?? false
303
+ });
227
304
  }
228
305
  return clauses;
229
306
  }
230
307
  function useScrollHandler() {
231
308
  const ref = react.useRef(null);
232
- const setVisibleRegion = provider.ctx.useSet(visibleRegionAtom);
309
+ const setVisibleRegion = core.ctx.useSet(visibleRegionAtom);
233
310
  return react.useCallback(
234
311
  underscore.debounce((visibleCells) => {
235
312
  if (visibleCells.rowIndexEnd == ref.current?.rowIndexEnd && visibleCells.rowIndexStart == ref.current?.rowIndexStart) {
@@ -241,65 +318,16 @@ function useScrollHandler() {
241
318
  [setVisibleRegion]
242
319
  );
243
320
  }
244
- function createLocalProvider(data, options = {}) {
245
- const identity = options.identity ?? defaultLocalIdentity;
246
- return {
247
- identity,
248
- async fetchData({ offset, limit, sorts, filters }) {
249
- let rows = data;
250
- if (filters != null && filters.length > 0) {
251
- rows = rows.filter(
252
- (row) => filters.every(
253
- (f) => f.predicate != null ? f.predicate(row, f.state) : true
254
- )
255
- );
256
- }
257
- if (sorts != null && sorts.length > 0) {
258
- rows = [...rows].sort(compareRowsBySorts(sorts));
259
- }
260
- return {
261
- rows: rows.slice(offset, offset + limit),
262
- totalCount: rows.length
263
- };
264
- }
265
- };
266
- }
267
- const _syntheticRowIds = /* @__PURE__ */ new WeakMap();
268
- let _syntheticRowCounter = 0;
269
- function defaultLocalIdentity(row) {
270
- if (row == null) return void 0;
271
- if (row.id != null) return row.id;
272
- if (typeof row !== "object") return row;
273
- let id = _syntheticRowIds.get(row);
274
- if (id == null) {
275
- id = `__row_${_syntheticRowCounter++}`;
276
- _syntheticRowIds.set(row, id);
277
- }
278
- return id;
279
- }
280
- function compareRowsBySorts(sorts) {
281
- return (a, b) => {
282
- for (const sort of sorts) {
283
- const av = a?.[sort.key];
284
- const bv = b?.[sort.key];
285
- if (av == null && bv == null) continue;
286
- if (av == null) return sort.ascending ? -1 : 1;
287
- if (bv == null) return sort.ascending ? 1 : -1;
288
- const cmp = av < bv ? -1 : av > bv ? 1 : 0;
289
- if (cmp !== 0) return sort.ascending ? cmp : -cmp;
290
- }
291
- return 0;
292
- };
293
- }
294
321
  function useDataLoader(fetchChunk, options = {}) {
295
322
  const { pageSize = 100, fetchMode = "scroll" } = options;
296
323
  const [state, dispatch] = useLazyLoaderReducer();
297
- const visibleRegion = provider.ctx.useValue(visibleRegionAtom);
298
- const page = provider.ctx.useValue(chunkPageAtom);
299
- const setPage = provider.ctx.useSet(chunkPageAtom);
300
- const refreshToken = provider.ctx.useValue(dataRefreshTokenAtom);
301
- const columnSorts = provider.useSelector((s) => s.columnSorts);
302
- const activeFilters = provider.useSelector((s) => s.activeFilters);
324
+ const { isLocalProvider, provider } = core.ctx.useValue(core.dataProviderAtom);
325
+ const visibleRegion = core.ctx.useValue(visibleRegionAtom);
326
+ const page = core.ctx.useValue(chunkPageAtom);
327
+ const setPage = core.ctx.useSet(chunkPageAtom);
328
+ const refreshToken = core.ctx.useValue(tableData.dataRefreshTokenAtom);
329
+ const columnSorts = core.useSelector((s) => s.columnSorts);
330
+ const activeFilters = core.useSelector((s) => s.activeFilters);
303
331
  const abortRef = react.useRef(null);
304
332
  const loadedRef = react.useRef({
305
333
  page: -1,
@@ -400,8 +428,8 @@ function createPostgRESTFetchChunk(config) {
400
428
  return async ({ limit, signal, sorts, filters, cursor }) => {
401
429
  const client = new postgrestJs.PostgrestClient(config.endpoint).from(config.table);
402
430
  const order = [
403
- ...config.baseOrder ?? [],
404
- ...sorts.map((s) => ({ key: s.key, ascending: s.ascending }))
431
+ ...sorts.map((s) => ({ key: s.key, ascending: s.ascending })),
432
+ ...config.baseOrder ?? []
405
433
  ];
406
434
  const pgFilters = [];
407
435
  if (config.baseFilter != null) {
@@ -418,6 +446,10 @@ function createPostgRESTFetchChunk(config) {
418
446
  count: cursor == null ? "exact" : void 0,
419
447
  limit,
420
448
  identityKey: config.identityKey,
449
+ identityOrder: {
450
+ key: config.identityKey,
451
+ ascending: config.identityAscending ?? true
452
+ },
421
453
  order,
422
454
  filters: pgFilters,
423
455
  lastLoadedRow: cursor?.row ?? null,
@@ -457,7 +489,8 @@ function standardColumnFilter(f) {
457
489
  return null;
458
490
  }
459
491
  function indexOfFirstNullInRegion(data, region) {
460
- for (let i = region.rowIndexStart; i < region.rowIndexEnd; i++) {
492
+ const end = Math.min(region.rowIndexEnd, data.length);
493
+ for (let i = region.rowIndexStart; i < end; i++) {
461
494
  if (data[i] == null) {
462
495
  return i;
463
496
  }
@@ -465,15 +498,15 @@ function indexOfFirstNullInRegion(data, region) {
465
498
  return null;
466
499
  }
467
500
  exports.applyColumnFilters = applyColumnFilters;
501
+ exports.autoLoadPagesAtom = autoLoadPagesAtom;
468
502
  exports.chunkPageAtom = chunkPageAtom;
469
- exports.compareRowsBySorts = compareRowsBySorts;
470
- exports.createLocalProvider = createLocalProvider;
471
503
  exports.createPostgRESTFetchChunk = createPostgRESTFetchChunk;
472
504
  exports.createPostgRESTProvider = createPostgRESTProvider;
473
- exports.dataRefreshTokenAtom = dataRefreshTokenAtom;
505
+ exports.resumeBaselineAtom = resumeBaselineAtom;
474
506
  exports.standardizeFilter = standardizeFilter;
475
507
  exports.tableFooterAtom = tableFooterAtom;
476
508
  exports.useDataLoader = useDataLoader;
509
+ exports.useLoadControls = useLoadControls;
477
510
  exports.useScrollHandler = useScrollHandler;
478
511
  exports.viewInfoAtom = viewInfoAtom;
479
512
  //# sourceMappingURL=data-loaders.cjs.map
@@ -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: \"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;;;;;;;;;;;;;"}
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 } from \"underscore\";\nimport { useCallback, useEffect, useMemo, useRef } from \"react\";\nimport update, { Spec } from \"immutability-helper\";\nimport {\n ClientServerOptions,\n PostgrestClient,\n PostgrestFilterBuilder,\n PostgrestQueryBuilder,\n} from \"@supabase/postgrest-js\";\nimport { adjustArraySize, RowRegion } from \"./loading-utils.ts\";\nimport {\n ctx,\n dataProviderAtom,\n dataRefreshTokenAtom,\n FetchData,\n FetchDataFilter,\n tableDataAtom,\n TableDataProvider,\n useSelector,\n} from \"../provider\";\nimport { atom } from \"jotai\";\nimport { FetchDataOptions, FetchMode } from \"../types.ts\";\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.\n * `cs`/`ov` target array columns (contains / overlaps). */\nexport type PostgrestFilterOperator =\n | \"eq\"\n | \"neq\"\n | \"like\"\n | \"ilike\"\n | \"gt\"\n | \"lt\"\n | \"gte\"\n | \"lte\"\n | \"is\"\n | \"cs\"\n | \"ov\";\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 id?: string;\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 // Array-column operators need a list value and postgrest-js's dedicated\n // builders (which emit the `{…}` array literal), not a scalar `.filter`.\n if (cf.operator === \"cs\") {\n req = req.contains(cf.key, splitFilterList(cf.value));\n continue;\n }\n if (cf.operator === \"ov\") {\n req = req.overlaps(cf.key, splitFilterList(cf.value));\n continue;\n }\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\n/** Split a comma-separated filter value into trimmed, non-empty tokens (the set\n * for `cs`/`ov`); a single value yields a one-element list. */\nfunction splitFilterList(value: any): string[] {\n return String(value)\n .split(\",\")\n .map((s) => s.trim())\n .filter((s) => s !== \"\");\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 as any),\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 /** The identity column's default ordering (used when nothing in `order`\n * already sorts it). A string ⇒ ascending; pass a `PostgrestOrder` to set the\n * direction (e.g. `source_id` descending). */\n identityOrder?: PostgrestOrder<any>;\n lastLoadedRow?: any;\n lastLoadedRowIndex: number;\n}\n\n/** Format a value for a PostgREST logic-tree condition. Reserved characters\n * (`, . : ( )`), spaces, quotes, and backslashes require the value to be\n * double-quoted, with `\"` and `\\` backslash-escaped inside — otherwise a map\n * name containing a comma would break the `or=(...)` parse. */\nfunction formatKeysetValue(v: any): string {\n const s = String(v);\n if (s === \"\" || /[,.:()\"\\\\ ]/.test(s)) {\n return `\"${s.replace(/\\\\/g, \"\\\\\\\\\").replace(/\"/g, '\\\\\"')}\"`;\n }\n return s;\n}\n\n/** An equality condition for the cursor prefix (`col.eq.v`, or `col.is.null`). */\nfunction keysetEq(key: string, v: any): string {\n return v == null ? `${key}.is.null` : `${key}.eq.${formatKeysetValue(v)}`;\n}\n\n/**\n * Build the compound keyset predicate (the body of an `or=(...)`) selecting\n * rows strictly after `lastRow` under `clauses` (lexicographic, last clause is\n * the identity tiebreaker):\n *\n * (c1 OP1 v1)\n * OR (c1 = v1 AND c2 OP2 v2)\n * OR (c1 = v1 AND c2 = v2 AND c3 OP3 v3) …\n *\n * `OPi` is `gt` for an ascending clause, `lt` for descending. Nulls-last: a\n * null pivot value has no strictly-ordered non-null successor at its level, so\n * that term is skipped and the tie defers to deeper clauses (the identity key\n * is non-null, so at least its term is always emitted). Returns `null` if no\n * term applies. (Known limit: rows whose *sort* column is null aren't picked up\n * across the non-null→null boundary — an edge for nullable sort columns; the\n * non-null identity tiebreaker keeps pagination from stalling.)\n */\nfunction buildKeysetPredicate(\n clauses: PostgrestOrder<any>[],\n lastRow: any,\n): string | null {\n const terms: string[] = [];\n for (let i = 0; i < clauses.length; i++) {\n const v = lastRow[clauses[i].key];\n if (v == null) continue;\n const conds: string[] = [];\n for (let j = 0; j < i; j++) {\n conds.push(keysetEq(clauses[j].key, lastRow[clauses[j].key]));\n }\n const op = (clauses[i].ascending ?? true) ? \"gt\" : \"lt\";\n conds.push(`${clauses[i].key}.${op}.${formatKeysetValue(v)}`);\n terms.push(conds.length === 1 ? conds[0] : `and(${conds.join(\",\")})`);\n }\n return terms.length > 0 ? terms.join(\",\") : null;\n}\n\nfunction buildQuery<T>(\n client: PostgrestQueryBuilder<any, 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.identityOrder ?? config.identityKey,\n );\n\n let hasOrdering = false;\n for (const clause of orderClauses) {\n query = query.order(clause.key, clause);\n hasOrdering = true;\n }\n\n // Keyset cursor: rows strictly after the last loaded row under the active\n // ordering. This MUST be a compound predicate, not an independent `gt`/`lt`\n // per column: with a leading low-cardinality sort (e.g. `state`), a plain\n // `state.gt.X AND source_id.lt.Y` drops every row sharing the cursor's\n // `state` (`state.gt.X` is false for them). The lexicographic form keeps the\n // tie broken by the next column, ending on the non-null identity key.\n if (config.lastLoadedRow != null && hasOrdering) {\n const pred = buildKeysetPredicate(orderClauses, config.lastLoadedRow);\n if (pred != null) query = query.or(pred);\n }\n\n let offset: number | null = 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 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/** 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\n/** Auto-load this many pages per burst, then pause (null ⇒ unbounded). Set by\n * a consumer (e.g. `DataPanel`'s `autoLoadPages` prop). */\nexport const autoLoadPagesAtom = atom<number | null>(null);\n\n/** Row count at the last manual \"load more\" — the point auto-load resumes\n * counting a fresh burst from. */\nexport const resumeBaselineAtom = atom(0);\n\n/** Live loading controls, read from the store rather than passed down a\n * boundary contract. Any component inside the provider can call\n * `useLoadControls()` — a footer, a toolbar button, a status line — without the\n * renderer wiring a specific prop shape to it. */\nexport interface LoadControls {\n /** Load the next page and resume auto-loading (clears a paused state). */\n loadMore: () => void;\n /** A fetch is in flight. */\n loading: boolean;\n /** More rows remain to load. */\n hasMore: boolean;\n /** Rows loaded so far. */\n loaded: number;\n /** Source total when known, else `null`. */\n total: number | null;\n /** Auto-load is paused at the `autoLoadPages` checkpoint. */\n paused: boolean;\n /** Auto-load is currently permitted (`hasMore && !loading && !paused`) —\n * used to gate an infinite-scroll sentinel. */\n canLoadMore: boolean;\n /** Advance one page *without* resuming a paused auto-load (the sentinel\n * uses this; `loadMore` is the manual, un-pausing variant). */\n advance: () => void;\n}\n\n/** Store-managed load controls (see `LoadControls`). Reads the loader's footer\n * state, the loaded rows, and the pause atoms; `loadMore`/`advance` set the\n * visible region so the loader fetches the next chunk. */\nexport function useLoadControls(): LoadControls {\n const footer = ctx.useValue(tableFooterAtom);\n const data = ctx.useValue(tableDataAtom) ?? [];\n const { isLocalProvider } = ctx.useValue(dataProviderAtom);\n const resumeBaseline = ctx.useValue(resumeBaselineAtom);\n const autoLoadPages = ctx.useValue(autoLoadPagesAtom);\n const setResumeBaseline = ctx.useSet(resumeBaselineAtom);\n const setVisibleRegion = ctx.useSet(visibleRegionAtom);\n\n let loadedCount = 0;\n for (const row of data) if (row != null) loadedCount++;\n const pageSize = footer.pageSize || 100;\n const dataLength = data.length;\n const hasMore = !isLocalProvider && loadedCount < dataLength;\n const paused =\n autoLoadPages != null &&\n loadedCount - resumeBaseline >= autoLoadPages * pageSize;\n const canLoadMore = hasMore && !footer.loading && !paused;\n\n const advance = useCallback(() => {\n setVisibleRegion({\n rowIndexStart: 0,\n rowIndexEnd: Math.min(loadedCount + pageSize, dataLength),\n });\n }, [setVisibleRegion, loadedCount, pageSize, dataLength]);\n\n const loadMore = useCallback(() => {\n setResumeBaseline(loadedCount);\n advance();\n }, [setResumeBaseline, loadedCount, advance]);\n\n return {\n loadMore,\n loading: footer.loading,\n hasMore,\n loaded: footer.loaded,\n total: footer.total,\n paused,\n canLoadMore,\n advance,\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 // Build the ORDER BY for a PostgREST query. Two invariants:\n // 1. Each column appears at most once. Keyset pagination adds a `gt`/`lt`\n // cursor predicate per order clause, so a duplicated column (e.g. the\n // identity key present in both a base order and an active sort, with\n // opposite directions) would emit contradictory `col=lt.X&col=gt.X`\n // bounds that match nothing — an infinite empty-result reload. First\n // occurrence wins (active sorts should be passed ahead of base order).\n // 2. The identity key is ordered last (a stable tiebreaker for the cursor),\n // appended with its default direction only if no clause already sorts it.\n const identitySort =\n typeof identityOrder == \"string\"\n ? { key: identityOrder, ascending: true }\n : identityOrder;\n const identityKey = identitySort.key;\n\n const seen = new Set<string>();\n const clauses: PostgrestOrder<any>[] = [];\n for (const sort of sorts) {\n if (seen.has(sort.key)) continue;\n seen.add(sort.key);\n clauses.push({\n key: sort.key,\n ascending: sort.ascending,\n nullsFirst: \"nullsFirst\" in sort ? sort.nullsFirst : false,\n });\n }\n\n if (seen.has(identityKey)) {\n // Move the (already-deduped) identity clause to the end, keeping the\n // direction the active sort chose.\n const idx = clauses.findIndex((c) => c.key === identityKey);\n const [idClause] = clauses.splice(idx, 1);\n clauses.push(idClause);\n } else {\n clauses.push({\n key: identitySort.key,\n ascending: identitySort.ascending ?? true,\n nullsFirst: (identitySort as any).nullsFirst ?? false,\n });\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/**\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\n const { isLocalProvider, provider } = ctx.useValue(dataProviderAtom);\n\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 /** Default ordering direction of the identity key (applied when no active\n * sort targets it). `false` ⇒ the table defaults to identity-descending\n * (e.g. newest `source_id` first) without a redundant `baseOrder` entry that\n * would otherwise collide with the identity tiebreaker. Defaults to `true`. */\n identityAscending?: boolean;\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 // Active sorts first so they win the by-key dedupe in\n // `buildPostgrestOrderClauses` (a user sort on the identity column\n // overrides its default direction rather than colliding with it).\n const order: PostgrestOrder<any>[] = [\n ...sorts.map((s) => ({ key: s.key, ascending: s.ascending })),\n ...(config.baseOrder ?? []),\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 identityOrder: {\n key: config.identityKey,\n ascending: config.identityAscending ?? true,\n },\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 /** Default ordering direction of the identity key (see\n * `createPostgRESTFetchChunk`). `false` ⇒ identity-descending by default. */\n identityAscending?: boolean;\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 // Clamp to the array length: a visible region can outlast the data it was\n // set against (e.g. a keyset page hits the end of a filtered set and the\n // array shrinks below a region end set before the shrink). Scanning past\n // `data.length` reads `undefined` as a fillable null and re-fetches the same\n // now-out-of-range offset forever — the tail-of-filtered-set reload loop.\n const end = Math.min(region.rowIndexEnd, data.length);\n for (let i = region.rowIndexStart; i < end; i++) {\n if (data[i] == null) {\n return i;\n }\n }\n return null;\n}\n"],"names":["update","adjustArraySize","atom","core","tableDataAtom","ctx","dataProviderAtom","useCallback","useRef","debounce","dataRefreshTokenAtom","useSelector","useMemo","useEffect","useAsyncEffect","PostgrestClient"],"mappings":";;;;;;;;;;;;;AAqFO,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;AAGzC,QAAI,GAAG,aAAa,MAAM;AACxB,YAAM,IAAI,SAAS,GAAG,KAAK,gBAAgB,GAAG,KAAK,CAAC;AACpD;AAAA,IACF;AACA,QAAI,GAAG,aAAa,MAAM;AACxB,YAAM,IAAI,SAAS,GAAG,KAAK,gBAAgB,GAAG,KAAK,CAAC;AACpD;AAAA,IACF;AACA,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;AAIA,SAAS,gBAAgB,OAAsB;AAC7C,SAAO,OAAO,KAAK,EAChB,MAAM,GAAG,EACT,IAAI,CAAC,MAAM,EAAE,MAAM,EACnB,OAAO,CAAC,MAAM,MAAM,EAAE;AAC3B;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,OAAc;AAAA,MAAA;AAAA,IAElD,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;AA0BA,SAAS,kBAAkB,GAAgB;AACzC,QAAM,IAAI,OAAO,CAAC;AAClB,MAAI,MAAM,MAAM,cAAc,KAAK,CAAC,GAAG;AACrC,WAAO,IAAI,EAAE,QAAQ,OAAO,MAAM,EAAE,QAAQ,MAAM,KAAK,CAAC;AAAA,EAC1D;AACA,SAAO;AACT;AAGA,SAAS,SAAS,KAAa,GAAgB;AAC7C,SAAO,KAAK,OAAO,GAAG,GAAG,aAAa,GAAG,GAAG,OAAO,kBAAkB,CAAC,CAAC;AACzE;AAmBA,SAAS,qBACP,SACA,SACe;AACf,QAAM,QAAkB,CAAA;AACxB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,UAAM,IAAI,QAAQ,QAAQ,CAAC,EAAE,GAAG;AAChC,QAAI,KAAK,KAAM;AACf,UAAM,QAAkB,CAAA;AACxB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAM,KAAK,SAAS,QAAQ,CAAC,EAAE,KAAK,QAAQ,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC;AAAA,IAC9D;AACA,UAAM,KAAM,QAAQ,CAAC,EAAE,aAAa,OAAQ,OAAO;AACnD,UAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,GAAG,IAAI,EAAE,IAAI,kBAAkB,CAAC,CAAC,EAAE;AAC5D,UAAM,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI,OAAO,MAAM,KAAK,GAAG,CAAC,GAAG;AAAA,EACtE;AACA,SAAO,MAAM,SAAS,IAAI,MAAM,KAAK,GAAG,IAAI;AAC9C;AAEA,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,iBAAiB,OAAO;AAAA,EAAA;AAGjC,MAAI,cAAc;AAClB,aAAW,UAAU,cAAc;AACjC,YAAQ,MAAM,MAAM,OAAO,KAAK,MAAM;AACtC,kBAAc;AAAA,EAChB;AAQA,MAAI,OAAO,iBAAiB,QAAQ,aAAa;AAC/C,UAAM,OAAO,qBAAqB,cAAc,OAAO,aAAa;AACpE,QAAI,QAAQ,KAAM,SAAQ,MAAM,GAAG,IAAI;AAAA,EACzC;AAEA,MAAI,SAAwB;AAC5B,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,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;AAe5B,MAAM,kBAAkBA,MAAAA,KAAsB,CAAC,QAAQ;AAC5D,QAAMC,SAAO,IAAI,uBAAuB;AACxC,QAAM,OAAO,IAAIC,KAAAA,aAAa,KAAK,CAAA;AACnC,MAAI,SAAS;AACb,MAAI,UAAU;AACd,aAAW,OAAO,MAAM;AACtB,QAAI,OAAO,KAAM;AAAA,QACZ,WAAU;AAAA,EACjB;AAGA,QAAM,QAAQD,OAAK,eAAe,UAAU,OAAO,KAAK;AACxD,QAAM,aACJA,OAAK,cAAc,OAAO,KAAK,KAAKA,OAAK,aAAaA,OAAK,QAAQ,IAAI;AACzE,SAAO;AAAA,IACL,MAAMA,OAAK;AAAA,IACX;AAAA,IACA;AAAA,IACA,SAASA,OAAK;AAAA,IACd,MAAM,IAAI,aAAa;AAAA,IACvB,UAAUA,OAAK;AAAA,IACf;AAAA,EAAA;AAEJ,CAAC;AAIM,MAAM,oBAAoBD,MAAAA,KAAoB,IAAI;AAIlD,MAAM,qBAAqBA,MAAAA,KAAK,CAAC;AA8BjC,SAAS,kBAAgC;AAC9C,QAAM,SAASG,KAAAA,IAAI,SAAS,eAAe;AAC3C,QAAM,OAAOA,KAAAA,IAAI,SAASD,KAAAA,aAAa,KAAK,CAAA;AAC5C,QAAM,EAAE,gBAAA,IAAoBC,SAAI,SAASC,KAAAA,gBAAgB;AACzD,QAAM,iBAAiBD,KAAAA,IAAI,SAAS,kBAAkB;AACtD,QAAM,gBAAgBA,KAAAA,IAAI,SAAS,iBAAiB;AACpD,QAAM,oBAAoBA,KAAAA,IAAI,OAAO,kBAAkB;AACvD,QAAM,mBAAmBA,KAAAA,IAAI,OAAO,iBAAiB;AAErD,MAAI,cAAc;AAClB,aAAW,OAAO,KAAM,KAAI,OAAO,KAAM;AACzC,QAAM,WAAW,OAAO,YAAY;AACpC,QAAM,aAAa,KAAK;AACxB,QAAM,UAAU,CAAC,mBAAmB,cAAc;AAClD,QAAM,SACJ,iBAAiB,QACjB,cAAc,kBAAkB,gBAAgB;AAClD,QAAM,cAAc,WAAW,CAAC,OAAO,WAAW,CAAC;AAEnD,QAAM,UAAUE,MAAAA,YAAY,MAAM;AAChC,qBAAiB;AAAA,MACf,eAAe;AAAA,MACf,aAAa,KAAK,IAAI,cAAc,UAAU,UAAU;AAAA,IAAA,CACzD;AAAA,EACH,GAAG,CAAC,kBAAkB,aAAa,UAAU,UAAU,CAAC;AAExD,QAAM,WAAWA,MAAAA,YAAY,MAAM;AACjC,sBAAkB,WAAW;AAC7B,YAAA;AAAA,EACF,GAAG,CAAC,mBAAmB,aAAa,OAAO,CAAC;AAE5C,SAAO;AAAA,IACL;AAAA,IACA,SAAS,OAAO;AAAA,IAChB;AAAA,IACA,QAAQ,OAAO;AAAA,IACf,OAAO,OAAO;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,EAAA;AAEJ;AASO,MAAM,eAAeL,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,UAAMC,SAAO,IAAI,uBAAuB;AACxC,UAAM,OAAO,IAAIC,kBAAa;AAC9B,UAAM,gBAAgB,IAAI,iBAAiB;AAC3C,WAAO;AAAA,MACL,GAAGD;AAAAA,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,UAAII,KAAAA,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,KAAAA,IAAI,IAAI,mBAAmB;AACrD,QAAM,WAAWE,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;AAUvB,QAAM,eACJ,OAAO,iBAAiB,WACpB,EAAE,KAAK,eAAe,WAAW,KAAA,IACjC;AACN,QAAM,cAAc,aAAa;AAEjC,QAAM,2BAAW,IAAA;AACjB,QAAM,UAAiC,CAAA;AACvC,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,IAAI,KAAK,GAAG,EAAG;AACxB,SAAK,IAAI,KAAK,GAAG;AACjB,YAAQ,KAAK;AAAA,MACX,KAAK,KAAK;AAAA,MACV,WAAW,KAAK;AAAA,MAChB,YAAY,gBAAgB,OAAO,KAAK,aAAa;AAAA,IAAA,CACtD;AAAA,EACH;AAEA,MAAI,KAAK,IAAI,WAAW,GAAG;AAGzB,UAAM,MAAM,QAAQ,UAAU,CAAC,MAAM,EAAE,QAAQ,WAAW;AAC1D,UAAM,CAAC,QAAQ,IAAI,QAAQ,OAAO,KAAK,CAAC;AACxC,YAAQ,KAAK,QAAQ;AAAA,EACvB,OAAO;AACL,YAAQ,KAAK;AAAA,MACX,KAAK,aAAa;AAAA,MAClB,WAAW,aAAa,aAAa;AAAA,MACrC,YAAa,aAAqB,cAAc;AAAA,IAAA,CACjD;AAAA,EACH;AACA,SAAO;AACT;AAEO,SAAS,mBAAmB;AAGjC,QAAM,MAAMC,MAAAA,OAAkB,IAAI;AAElC,QAAM,mBAAmBH,KAAAA,IAAI,OAAO,iBAAiB;AAErD,SAAOE,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;AAaO,SAAS,cACd,YACA,UAA4B,IAC5B;AACA,QAAM,EAAE,WAAW,KAAK,YAAY,aAAa;AACjD,QAAM,CAAC,OAAO,QAAQ,IAAI,qBAAA;AAE1B,QAAM,EAAE,iBAAiB,SAAA,IAAaJ,KAAAA,IAAI,SAASC,KAAAA,gBAAgB;AAEnE,QAAM,gBAAgBD,KAAAA,IAAI,SAAS,iBAAiB;AACpD,QAAM,OAAOA,KAAAA,IAAI,SAAS,aAAa;AACvC,QAAM,UAAUA,KAAAA,IAAI,OAAO,aAAa;AACxC,QAAM,eAAeA,KAAAA,IAAI,SAASK,8BAAoB;AACtD,QAAM,cAAcC,KAAAA,YAAY,CAAC,MAAM,EAAE,WAAW;AACpD,QAAM,gBAAgBA,KAAAA,YAAY,CAAC,MAAM,EAAE,aAAa;AACxD,QAAM,WAAWH,MAAAA,OAA+B,IAAI;AAGpD,QAAM,YAAYA,MAAAA,OAA0C;AAAA,IAC1D,MAAM;AAAA,IACN,SAAS;AAAA,EAAA,CACV;AAED,QAAM,UAA6BI,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,QAmBlC;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;AAKrE,UAAM,QAA+B;AAAA,MACnC,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,WAAW,EAAE,UAAA,EAAY;AAAA,MAC5D,GAAI,OAAO,aAAa,CAAA;AAAA,IAAC;AAG3B,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,eAAe;AAAA,QACb,KAAK,OAAO;AAAA,QACZ,WAAW,OAAO,qBAAqB;AAAA,MAAA;AAAA,MAEzC;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,QAaxB;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;AAMf,QAAM,MAAM,KAAK,IAAI,OAAO,aAAa,KAAK,MAAM;AACpD,WAAS,IAAI,OAAO,eAAe,IAAI,KAAK,KAAK;AAC/C,QAAI,KAAK,CAAC,KAAK,MAAM;AACnB,aAAO;AAAA,IACT;AAAA,EACF;AACA,SAAO;AACT;;;;;;;;;;;;;"}