comins-table 0.1.11 → 0.2.0

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 (132) hide show
  1. package/CHANGELOG.md +17 -1
  2. package/README.md +9 -7
  3. package/dist/browser/clipboard.d.ts +4 -0
  4. package/dist/browser/clipboard.d.ts.map +1 -0
  5. package/dist/browser/measurements.d.ts +28 -0
  6. package/dist/browser/measurements.d.ts.map +1 -0
  7. package/dist/browser/pointer.d.ts +25 -0
  8. package/dist/browser/pointer.d.ts.map +1 -0
  9. package/dist/browser/scroll.d.ts +9 -0
  10. package/dist/browser/scroll.d.ts.map +1 -0
  11. package/dist/browser/table-transfer.d.ts +38 -0
  12. package/dist/browser/table-transfer.d.ts.map +1 -0
  13. package/dist/browser/viewport-requests.d.ts +27 -0
  14. package/dist/browser/viewport-requests.d.ts.map +1 -0
  15. package/dist/cell-fill.d.ts +1 -1
  16. package/dist/cell-fill.d.ts.map +1 -1
  17. package/dist/clipboard-CNrbmDue.js +959 -0
  18. package/dist/clipboard-CNrbmDue.js.map +1 -0
  19. package/dist/clipboard.d.ts +2 -2
  20. package/dist/clipboard.d.ts.map +1 -1
  21. package/dist/clipboard.js +3 -2
  22. package/dist/column-layout.d.ts +24 -0
  23. package/dist/column-layout.d.ts.map +1 -0
  24. package/dist/component-renderer.d.ts +1 -1
  25. package/dist/component-renderer.d.ts.map +1 -1
  26. package/dist/core/editing/cells.d.ts +9 -0
  27. package/dist/core/editing/cells.d.ts.map +1 -0
  28. package/dist/core/editing/clipboard.d.ts +8 -0
  29. package/dist/core/editing/clipboard.d.ts.map +1 -0
  30. package/dist/core/editing/export.d.ts +4 -0
  31. package/dist/core/editing/export.d.ts.map +1 -0
  32. package/dist/core/layout/columns.d.ts +69 -0
  33. package/dist/core/layout/columns.d.ts.map +1 -0
  34. package/dist/core/layout/row-height.d.ts +25 -0
  35. package/dist/core/layout/row-height.d.ts.map +1 -0
  36. package/dist/core/layout/viewport.d.ts +21 -0
  37. package/dist/core/layout/viewport.d.ts.map +1 -0
  38. package/dist/core/layout/virtual.d.ts +119 -0
  39. package/dist/core/layout/virtual.d.ts.map +1 -0
  40. package/dist/core/model.d.ts +128 -0
  41. package/dist/core/model.d.ts.map +1 -0
  42. package/dist/core/rows/filtering.d.ts +45 -0
  43. package/dist/core/rows/filtering.d.ts.map +1 -0
  44. package/dist/core/rows/grouping.d.ts +97 -0
  45. package/dist/core/rows/grouping.d.ts.map +1 -0
  46. package/dist/core/rows/projection.d.ts +73 -0
  47. package/dist/core/rows/projection.d.ts.map +1 -0
  48. package/dist/core/rows/summary.d.ts +3 -0
  49. package/dist/core/rows/summary.d.ts.map +1 -0
  50. package/dist/core/selection/navigation.d.ts +49 -0
  51. package/dist/core/selection/navigation.d.ts.map +1 -0
  52. package/dist/core/selection/state.d.ts +131 -0
  53. package/dist/core/selection/state.d.ts.map +1 -0
  54. package/dist/core/state/access.d.ts +11 -0
  55. package/dist/core/state/access.d.ts.map +1 -0
  56. package/dist/core/state/changes.d.ts +14 -0
  57. package/dist/core/state/changes.d.ts.map +1 -0
  58. package/dist/core/state/reconcile.d.ts +18 -0
  59. package/dist/core/state/reconcile.d.ts.map +1 -0
  60. package/dist/core/state/table.d.ts +77 -0
  61. package/dist/core/state/table.d.ts.map +1 -0
  62. package/dist/core/transfer/policy.d.ts +116 -0
  63. package/dist/core/transfer/policy.d.ts.map +1 -0
  64. package/dist/core/viewport/data.d.ts +70 -0
  65. package/dist/core/viewport/data.d.ts.map +1 -0
  66. package/dist/core/viewport/requests.d.ts +19 -0
  67. package/dist/core/viewport/requests.d.ts.map +1 -0
  68. package/dist/core-compat-B4I2OHGY.js +391 -0
  69. package/dist/core-compat-B4I2OHGY.js.map +1 -0
  70. package/dist/core.d.ts +9 -714
  71. package/dist/core.d.ts.map +1 -1
  72. package/dist/core.js +3 -2
  73. package/dist/export-Cfk5Jz4a.js +37 -0
  74. package/dist/export-Cfk5Jz4a.js.map +1 -0
  75. package/dist/filtering.d.ts +8 -9
  76. package/dist/filtering.d.ts.map +1 -1
  77. package/dist/grouping.d.ts +11 -21
  78. package/dist/grouping.d.ts.map +1 -1
  79. package/dist/index.d.ts +11 -8
  80. package/dist/index.d.ts.map +1 -1
  81. package/dist/index.js +3202 -2694
  82. package/dist/index.js.map +1 -1
  83. package/dist/model.d.ts +140 -0
  84. package/dist/model.d.ts.map +1 -0
  85. package/dist/react/core-compat.d.ts +141 -0
  86. package/dist/react/core-compat.d.ts.map +1 -0
  87. package/dist/react/edit-policy.d.ts +9 -0
  88. package/dist/react/edit-policy.d.ts.map +1 -0
  89. package/dist/react/model.d.ts +14 -0
  90. package/dist/react/model.d.ts.map +1 -0
  91. package/dist/react/rows.d.ts +6 -0
  92. package/dist/react/rows.d.ts.map +1 -0
  93. package/dist/react/state.d.ts +43 -0
  94. package/dist/react/state.d.ts.map +1 -0
  95. package/dist/react/table-transfer.d.ts +55 -0
  96. package/dist/react/table-transfer.d.ts.map +1 -0
  97. package/dist/react/viewport.d.ts +10 -0
  98. package/dist/react/viewport.d.ts.map +1 -0
  99. package/dist/react-types.d.ts +292 -0
  100. package/dist/react-types.d.ts.map +1 -0
  101. package/dist/row-detail.d.ts +2 -0
  102. package/dist/row-detail.d.ts.map +1 -1
  103. package/dist/row-height.d.ts +1 -24
  104. package/dist/row-height.d.ts.map +1 -1
  105. package/dist/row-value.d.ts +2 -0
  106. package/dist/row-value.d.ts.map +1 -0
  107. package/dist/selection-data.d.ts +2 -1
  108. package/dist/selection-data.d.ts.map +1 -1
  109. package/dist/selection.d.ts +2 -2
  110. package/dist/selection.d.ts.map +1 -1
  111. package/dist/selection.js +2 -2
  112. package/dist/summary.d.ts +1 -1
  113. package/dist/summary.d.ts.map +1 -1
  114. package/dist/table-state.d.ts +24 -0
  115. package/dist/table-state.d.ts.map +1 -0
  116. package/dist/table-transfer.d.ts +1 -152
  117. package/dist/table-transfer.d.ts.map +1 -1
  118. package/dist/tree-drag.d.ts.map +1 -1
  119. package/dist/tree.d.ts +1 -1
  120. package/dist/tree.d.ts.map +1 -1
  121. package/dist/use-viewport.d.ts.map +1 -1
  122. package/dist/viewport-data.d.ts +8 -71
  123. package/dist/viewport-data.d.ts.map +1 -1
  124. package/dist/viewport-layout.d.ts +1 -20
  125. package/dist/viewport-layout.d.ts.map +1 -1
  126. package/dist/viewport-requests.d.ts +1 -8
  127. package/dist/viewport-requests.d.ts.map +1 -1
  128. package/dist/virtual-layout.d.ts +1 -118
  129. package/dist/virtual-layout.d.ts.map +1 -1
  130. package/package.json +5 -2
  131. package/dist/core-C1tlvY8Q.js +0 -963
  132. package/dist/core-C1tlvY8Q.js.map +0 -1
@@ -1,963 +0,0 @@
1
- function e(e) {
2
- if (e.length > 1e6) throw Error("Clipboard text exceeds 1000000 characters.");
3
- let t = [], n = [], r = "", i = !1, a = !1, o = 0, s = () => {
4
- if (++o > 1e5) throw Error("Clipboard exceeds 100000 cells.");
5
- n.push(r), r = "", a = !1;
6
- };
7
- for (let o = 0; o < e.length; o++) {
8
- let c = e[o];
9
- if (i) c === "\"" ? e[o + 1] === "\"" ? (r += "\"", o++) : (i = !1, a = !0) : r += c;
10
- else if (c === " " || c === "\r" || c === "\n") {
11
- if (s(), c !== " " && (t.push(n), n = [], c === "\r" && e[o + 1] === "\n" && o++, o === e.length - 1)) return t;
12
- } else if (a) throw Error("Unexpected text after a quoted clipboard cell.");
13
- else c === "\"" && r === "" ? i = !0 : r += c;
14
- }
15
- if (i) throw Error("Unclosed quoted clipboard cell.");
16
- return s(), t.push(n), t;
17
- }
18
- //#endregion
19
- //#region src/column-pinning.ts
20
- function t(e) {
21
- return e === "left" || e === "right" ? e : void 0;
22
- }
23
- function n(e, t) {
24
- let n = e.filter((e) => e.pinned === "left"), r = e.filter((e) => e.pinned === void 0), i = e.filter((e) => e.pinned === "right"), a = [], o = [], s = [...n], c = [...i], l = Number.isFinite(t) ? Math.max(0, t) : 0, u = l < 48 ? 0 : l - 48, d = (e) => e.reduce((e, t) => e + t.columnWidths.reduce((e, t) => e + Math.max(0, t), 0), 0);
25
- for (; d(s) + d(c) > u;) if (d(s) > d(c) && s.length > 0) a.unshift(s.pop());
26
- else if (c.length > 0) o.push(c.shift());
27
- else if (s.length > 0) a.unshift(s.pop());
28
- else break;
29
- let f = [
30
- ...s,
31
- ...a,
32
- ...r,
33
- ...o,
34
- ...c
35
- ], p = /* @__PURE__ */ new Map(), m = 0;
36
- for (let e of s) for (let t = 0; t < e.columnIds.length; t += 1) {
37
- let n = e.columnIds[t];
38
- p.set(n, {
39
- offset: m,
40
- pinned: "left"
41
- }), m += Math.max(0, e.columnWidths[t] ?? 0);
42
- }
43
- let h = s.at(-1)?.columnIds.at(-1);
44
- h && p.set(h, {
45
- ...p.get(h),
46
- boundary: !0
47
- });
48
- let g = 0;
49
- for (let e = c.length - 1; e >= 0; --e) {
50
- let t = c[e];
51
- for (let e = t.columnIds.length - 1; e >= 0; --e) {
52
- let n = t.columnIds[e];
53
- p.set(n, {
54
- offset: g,
55
- pinned: "right"
56
- }), g += Math.max(0, t.columnWidths[e] ?? 0);
57
- }
58
- }
59
- let _ = c[0]?.columnIds[0];
60
- _ && p.set(_, {
61
- ...p.get(_),
62
- boundary: !0
63
- });
64
- for (let e of [
65
- ...a,
66
- ...r,
67
- ...o
68
- ]) for (let t of e.columnIds) p.set(t, {});
69
- return {
70
- columns: p,
71
- orderedColumnIds: f.flatMap((e) => [...e.columnIds])
72
- };
73
- }
74
- function r(e, t, n, r, i = 48) {
75
- let a = e.find((e) => e.id === n);
76
- if (!a?.pinned || a.columnIds.length === 0 || a.columnIds.some((e) => t.columns.get(e)?.pinned !== a.pinned)) return;
77
- let o = e.reduce((e, n) => n.id === a.id || !n.pinned || n.columnIds.some((e) => t.columns.get(e)?.pinned !== n.pinned) ? e : e + n.columnWidths.reduce((e, t) => e + (Number.isFinite(t) ? Math.max(0, t) : 0), 0), 0);
78
- return Math.max(0, (Number.isFinite(r) ? Math.max(0, r) : 0) - (Number.isFinite(i) ? Math.max(0, i) : 48) - o);
79
- }
80
- function i(e, t, n) {
81
- let r = Math.min(e.orderedColumnIds.length, Math.max(t, t + Math.max(1, Math.floor(n)))), i = [];
82
- for (let n = Math.max(0, t); n < r; n += 1) {
83
- let t = e.orderedColumnIds[n], r = t ? e.columns.get(t) ?? {} : {}, a = i.at(-1);
84
- if (a && a.pinned === r.pinned) {
85
- a.colSpan += 1, r.pinned === "right" && (a.offset = r.offset);
86
- continue;
87
- }
88
- i.push({
89
- boundary: r.boundary,
90
- colSpan: 1,
91
- offset: r.offset,
92
- pinned: r.pinned,
93
- startIndex: n
94
- });
95
- }
96
- return i;
97
- }
98
- function a(e, t) {
99
- return t;
100
- }
101
- function o(e) {
102
- return e;
103
- }
104
- function s(e) {
105
- return e.map((e) => ({
106
- ...e,
107
- id: e.id ?? e.field
108
- }));
109
- }
110
- function c(e, t = []) {
111
- let n = new Set(e.map((e) => e.id)), r = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = [];
112
- for (let e of t) {
113
- if (i.has(e.id)) continue;
114
- let t = e.children.filter((e) => !n.has(e) || r.has(e) ? !1 : (r.add(e), !0));
115
- i.add(e.id), t.length !== 0 && a.push({
116
- ...e,
117
- children: t
118
- });
119
- }
120
- return a;
121
- }
122
- function l(e, n) {
123
- let r = {};
124
- for (let i of e) r[i.id] = {
125
- hidden: n?.columns?.[i.id]?.hidden ?? i.hidden,
126
- pinned: t(n === void 0 ? i.pinned : n.columns?.[i.id]?.pinned),
127
- width: n?.columns?.[i.id]?.width ?? i.width
128
- };
129
- return r;
130
- }
131
- function u(e, n) {
132
- let r = {};
133
- for (let i of e) r[i.id] = {
134
- hidden: n?.groups?.[i.id]?.hidden ?? i.hidden,
135
- pinned: t(n === void 0 ? i.pinned : n.groups?.[i.id]?.pinned)
136
- };
137
- return r;
138
- }
139
- function d(e) {
140
- let t = /* @__PURE__ */ new Map();
141
- for (let n of e) for (let e of n.children) t.set(e, n.id);
142
- return t;
143
- }
144
- function f(e, t) {
145
- return e.find((e) => e.id === t);
146
- }
147
- function p(e, n, r = []) {
148
- let i = new Set(e.map((e) => e.id)), a = (n?.order ?? []).filter((e) => i.has(e)), o = e.map((e) => e.id).filter((e) => !a.includes(e)), s = [...a, ...o], c = new Map(e.map((e) => [e.id, e])), l = d(r), u = new Map(r.map((e) => [e.id, e])), f = (e) => !l.has(e) && t(n === void 0 ? c.get(e)?.pinned : n.columns?.[e]?.pinned) !== void 0, p = (e) => t(n === void 0 ? u.get(e)?.pinned : n.groups?.[e]?.pinned) !== void 0, m = (e) => {
149
- let t = /* @__PURE__ */ new Set(), n = [];
150
- for (let r of e) {
151
- let i = l.get(r);
152
- if (!i) {
153
- n.push({
154
- columnIds: [r],
155
- key: `column:${r}`,
156
- locked: c.get(r)?.lockPosition === !0 || f(r)
157
- });
158
- continue;
159
- }
160
- if (t.has(i)) continue;
161
- let a = u.get(i);
162
- if (!a) {
163
- n.push({
164
- columnIds: [r],
165
- key: `column:${r}`,
166
- locked: c.get(r)?.lockPosition === !0 || f(r)
167
- });
168
- continue;
169
- }
170
- let o = e.filter((e) => a.children.includes(e));
171
- n.push({
172
- columnIds: o,
173
- key: `group:${i}`,
174
- locked: a.lockPosition || p(i) || o.some((e) => c.get(e)?.lockPosition === !0)
175
- }), t.add(i);
176
- }
177
- return n;
178
- }, h = m(e.map((e) => e.id)), g = m(s), _ = new Map(h.map((e) => [e.key, e])), v = /* @__PURE__ */ new Map(), y = 0;
179
- for (let e of h) v.set(e.key, y), e.locked && (y += 1);
180
- let b = Array.from({ length: y + 1 }, () => []), x = new Map(g.map((e) => [e.key, e]));
181
- for (let e of g) {
182
- let t = _.get(e.key);
183
- !t || t.locked || b[v.get(e.key) ?? 0]?.push(e);
184
- }
185
- let S = [], C = 0;
186
- for (let e of h) e.locked && (S.push(...b[C] ?? []), S.push(x.get(e.key) ?? e), C += 1);
187
- return S.push(...b[C] ?? []), S.flatMap((e) => {
188
- let t = _.get(e.key);
189
- if (!t || e.columnIds.length === 1) return e.columnIds;
190
- let n = new Set(t.columnIds.filter((e) => c.get(e)?.lockPosition));
191
- if (n.size === 0) return e.columnIds;
192
- let r = /* @__PURE__ */ new Map(), i = 0;
193
- for (let e of t.columnIds) r.set(e, i), n.has(e) && (i += 1);
194
- let a = Array.from({ length: i + 1 }, () => []);
195
- for (let t of e.columnIds) n.has(t) || a[r.get(t) ?? 0]?.push(t);
196
- let o = [], s = 0;
197
- for (let e of t.columnIds) n.has(e) && (o.push(...a[s] ?? []), o.push(e), s += 1);
198
- return o.push(...a[s] ?? []), o;
199
- });
200
- }
201
- function m() {
202
- return {
203
- cell: null,
204
- cells: [],
205
- range: null,
206
- rowIds: []
207
- };
208
- }
209
- function h(e, t) {
210
- return e.length === t.length && e.every((e, n) => e === t[n]);
211
- }
212
- function g(e, t, n = {}) {
213
- let r = t.map(e.getRowId), i = n.resetSelection === !0 || !h(e.rowIds, r);
214
- return {
215
- ...e,
216
- rowIds: r,
217
- rows: t,
218
- selection: i ? m() : e.selection
219
- };
220
- }
221
- function _(e, t) {
222
- return e.rowIds.findIndex((e) => e === t);
223
- }
224
- function v(e, t) {
225
- return e.columns.find((e) => e.id === t);
226
- }
227
- function y(e, t) {
228
- return e.length === t.length && e.every((e, n) => e.columnId === t[n]?.columnId && e.direction === t[n]?.direction);
229
- }
230
- function b(e, t) {
231
- let n = new Set(e.filter((e) => !!e.sort).map((e) => e.id)), r = /* @__PURE__ */ new Set(), i = [];
232
- for (let e of t) !n.has(e.columnId) || r.has(e.columnId) || e.direction !== "asc" && e.direction !== "desc" || (r.add(e.columnId), i.push({
233
- columnId: e.columnId,
234
- direction: e.direction
235
- }));
236
- return i;
237
- }
238
- function x(e, t) {
239
- return t.split(".").reduce((e, t) => {
240
- if (!(typeof e != "object" || !e)) return e[t];
241
- }, e);
242
- }
243
- function S(e, t, n) {
244
- if (!e || typeof e != "object") return e;
245
- let r = t.split("."), [i] = r;
246
- if (!i) return e;
247
- if (r.length === 1) return {
248
- ...e,
249
- [i]: n
250
- };
251
- let a = { ...e }, o = a;
252
- return r.slice(0, -1).forEach((e, t) => {
253
- let n = r[t + 1], i = o[e], a = i && typeof i == "object" && !Array.isArray(i) ? { ...i } : {};
254
- o[e] = a, n && (o = a);
255
- }), o[r.at(-1)] = n, a;
256
- }
257
- function C(e, t, n, r, i = e.rowIds.indexOf(n)) {
258
- return {
259
- column: {
260
- definition: r,
261
- field: r.field,
262
- id: r.id,
263
- index: e.columns.findIndex((e) => e.id === r.id),
264
- label: r.label
265
- },
266
- row: {
267
- data: t,
268
- dataIndex: i,
269
- disabled: !1,
270
- id: n,
271
- index: i,
272
- selected: e.selection.rowIds.includes(n)
273
- },
274
- selection: { selectedRowCount: e.selection.rowIds.length },
275
- value: J(e, t, r.id)
276
- };
277
- }
278
- function w(e, t) {
279
- return e === void 0 ? !0 : typeof e == "boolean" ? e : e(t);
280
- }
281
- function T(e, t, n, r) {
282
- let i = C(e, t, n, r), a = r.cell?.props;
283
- return typeof a == "function" ? a(i) : a;
284
- }
285
- function E(e, t, n = e.rowIds) {
286
- let r = K(e), i = n.indexOf(t.anchor.rowId), a = n.indexOf(t.focus.rowId), o = r.findIndex((e) => e.id === t.anchor.columnId), s = r.findIndex((e) => e.id === t.focus.columnId);
287
- return i < 0 || a < 0 || o < 0 || s < 0 ? null : {
288
- columnEnd: Math.max(o, s),
289
- columnStart: Math.min(o, s),
290
- rowEnd: Math.max(i, a),
291
- rowIds: n,
292
- rowStart: Math.min(i, a),
293
- visibleColumns: r
294
- };
295
- }
296
- function D(e, t) {
297
- return e && typeof e == "object" && "id" in e ? {
298
- ...e,
299
- id: t
300
- } : e;
301
- }
302
- function ee(e, t) {
303
- let n = 1, r = `${String(t)}-copy-${n}`, i = new Set(e.map(String));
304
- for (; i.has(r);) n += 1, r = `${String(t)}-copy-${n}`;
305
- return r;
306
- }
307
- function O(e, t, n, r, i, a = e.rowIds.indexOf(n)) {
308
- if (t === void 0) return !1;
309
- let o = C(e, t, n, r, a), s = r.cell?.props, c = typeof s == "function" ? s(o) : s;
310
- return c?.disabled !== void 0 && w(c.disabled, o) === !0 ? !1 : w(i === "copy" ? c?.copyable : c?.pasteable, o);
311
- }
312
- function k(e, t) {
313
- return typeof e == "number" && typeof t == "number" ? e - t : String(e ?? "").localeCompare(String(t ?? ""));
314
- }
315
- function te({ columnLayout: e, columnGroups: t, columns: n, getRowId: r = a, pagination: i, rows: d, showHeader: f = !0, sort: h = null, sortModel: g, theme: _ = {} }) {
316
- let v = o(d), y = s(n), x = c(y, t), S = b(y, g ?? (h ? [h] : []));
317
- return {
318
- columnOrder: p(y, e, x),
319
- columnGroups: x,
320
- columnGroupState: u(x, e),
321
- columns: y,
322
- columnState: l(y, e),
323
- getRowId: r,
324
- pagination: {
325
- pageIndex: i?.pageIndex ?? 0,
326
- pageSize: i?.pageSize ?? Math.max(v.length, 1)
327
- },
328
- rowIds: v.map(r),
329
- rows: v,
330
- selection: m(),
331
- showHeader: f,
332
- sort: S[0] ?? null,
333
- sortModel: S,
334
- theme: _
335
- };
336
- }
337
- function A(e, t) {
338
- return t ? e.rows.filter(t) : [...e.rows];
339
- }
340
- function ne(e, t) {
341
- return g(e, o(t), { resetSelection: !0 });
342
- }
343
- function j(e, t) {
344
- return g(e, [...e.rows, ...t]);
345
- }
346
- function M(e, t) {
347
- let n = new Map(t.map((e) => [e.id, e.patch]));
348
- return g(e, e.rows.map((t, r) => {
349
- let i = e.rowIds[r], a = i === void 0 ? void 0 : n.get(i);
350
- return a ? typeof a == "function" ? a(t) : {
351
- ...t,
352
- ...a
353
- } : t;
354
- }));
355
- }
356
- function re(e, t) {
357
- let n = new Set(t);
358
- return g(e, e.rows.filter((t, r) => {
359
- let i = e.rowIds[r];
360
- return i === void 0 || !n.has(i);
361
- }));
362
- }
363
- function ie(e, t) {
364
- return {
365
- ...e,
366
- theme: {
367
- ...e.theme,
368
- ...t
369
- }
370
- };
371
- }
372
- function ae(e, t) {
373
- return {
374
- ...e,
375
- showHeader: t
376
- };
377
- }
378
- function oe(e, t) {
379
- return {
380
- ...e,
381
- pagination: {
382
- pageIndex: t.pageIndex ?? e.pagination.pageIndex,
383
- pageSize: t.pageSize ?? e.pagination.pageSize
384
- }
385
- };
386
- }
387
- function N(e, t) {
388
- return P(e, t ? [t] : []);
389
- }
390
- function P(e, t) {
391
- let n = b(e.columns, t), r = n[0] ?? null;
392
- return y(e.sortModel, n) ? e : {
393
- ...e,
394
- sort: r,
395
- sortModel: n
396
- };
397
- }
398
- function se(e) {
399
- return P(e, []);
400
- }
401
- function ce(e, t, n) {
402
- return {
403
- ...e,
404
- columnState: {
405
- ...e.columnState,
406
- [t]: {
407
- ...e.columnState[t],
408
- width: n
409
- }
410
- }
411
- };
412
- }
413
- function le(e, t, n) {
414
- return {
415
- ...e,
416
- columnState: {
417
- ...e.columnState,
418
- [t]: {
419
- ...e.columnState[t],
420
- hidden: n
421
- }
422
- }
423
- };
424
- }
425
- function ue(e, t, n) {
426
- return f(e.columnGroups, t) ? {
427
- ...e,
428
- columnGroupState: {
429
- ...e.columnGroupState,
430
- [t]: {
431
- ...e.columnGroupState[t],
432
- hidden: n
433
- }
434
- }
435
- } : e;
436
- }
437
- function de(e, t) {
438
- return e.columnState[t.id]?.width ?? t.width ?? 100;
439
- }
440
- function F(e) {
441
- return Math.max(88, e.minWidth ?? 88);
442
- }
443
- function I(e) {
444
- return e.maxWidth ?? Infinity;
445
- }
446
- function L(e, t, n) {
447
- return Math.min(n, Math.max(t, e));
448
- }
449
- function R(e, t, n) {
450
- let r = t.map((t) => L(de(e, t), F(t), I(t))), i = new Set(t.map((e, t) => t)), a = t.map(F), o = t.map(I), s = L(n, a.reduce((e, t) => e + t, 0), o.reduce((e, t) => e + t, 0));
451
- for (; i.size > 0;) {
452
- let e = s - r.reduce((e, t) => e + t, 0);
453
- if (Math.abs(e) < .001) break;
454
- let t = [...i], n = t.reduce((e, t) => e + Math.max(r[t] ?? 0, 0), 0), c = !1;
455
- for (let s of t) {
456
- let l = r[s] ?? 0, u = l + e * (n > 0 ? l / n : 1 / t.length), d = L(u, a[s] ?? 0, o[s] ?? Infinity);
457
- r[s] = d, Math.abs(d - u) > .001 && (i.delete(s), c = !0);
458
- }
459
- if (!c) break;
460
- }
461
- return r;
462
- }
463
- function z(e, t, n) {
464
- let r = f(e.columnGroups, t);
465
- if (!r || e.columnGroupState[r.id]?.hidden === !0) return e;
466
- let i = r.children.map((t) => v(e, t)).filter((e) => !!e).filter((t) => e.columnState[t.id]?.hidden !== !0);
467
- if (i.length === 0) return e;
468
- let a = R(e, i, n), o = { ...e.columnState };
469
- return i.forEach((e, t) => {
470
- o[e.id] = {
471
- ...o[e.id],
472
- width: a[t]
473
- };
474
- }), {
475
- ...e,
476
- columnState: o
477
- };
478
- }
479
- function B(e, t) {
480
- let n = new Map(e.columnOrder.map((e, t) => [e, t])), r = new Map(t.map((e, t) => [e, t])), i = d(e.columnGroups);
481
- for (let t of e.columns) if ((t.lockPosition || !i.has(t.id) && e.columnState[t.id]?.pinned !== void 0) && n.get(t.id) !== r.get(t.id)) return !0;
482
- for (let t of e.columnGroups) {
483
- if (!t.lockPosition && e.columnGroupState[t.id]?.pinned === void 0) continue;
484
- let i = t.children.map((e) => n.get(e)).filter((e) => e !== void 0).sort((e, t) => e - t), a = t.children.map((e) => r.get(e)).filter((e) => e !== void 0).sort((e, t) => e - t);
485
- if (i.length !== a.length || i.some((e, t) => e !== a[t])) return !0;
486
- }
487
- return !1;
488
- }
489
- function V(e, t, n) {
490
- let r = v(e, t), i = d(e.columnGroups).get(t);
491
- if (!r || r.lockPosition || !i && e.columnState[t]?.pinned !== void 0) return e;
492
- d(e.columnGroups);
493
- let a = e.columnOrder.filter((e) => e !== t);
494
- if (a.length === e.columnOrder.length) return e;
495
- let o = Math.max(0, Math.min(n, a.length));
496
- if (i) {
497
- let t = f(e.columnGroups, i);
498
- if (!t) return e;
499
- let n = a.filter((e) => t.children.includes(e)), r = a.findIndex((e) => t.children.includes(e)), s = r + n.length;
500
- if (o < r || o > s) return e;
501
- } else if (e.columnGroups.length > 0) for (let t of e.columnGroups) {
502
- let n = a.filter((e) => t.children.includes(e));
503
- if (n.length === 0) continue;
504
- let r = a.findIndex((e) => t.children.includes(e)), i = r + n.length;
505
- if (o > r && o < i) return e;
506
- }
507
- return a.splice(o, 0, t), B(e, a) || a.every((t, n) => t === e.columnOrder[n]) ? e : {
508
- ...e,
509
- columnOrder: a
510
- };
511
- }
512
- function H(e, t, n) {
513
- let r = f(e.columnGroups, t);
514
- if (!r || r.lockPosition || e.columnGroupState[t]?.pinned !== void 0) return e;
515
- let i = e.columnOrder.filter((e) => r.children.includes(e));
516
- if (i.length === 0) return e;
517
- let a = e.columnOrder.filter((e) => !r.children.includes(e)), o = Math.max(0, Math.min(n, a.length)), s = [
518
- ...a.slice(0, o),
519
- ...i,
520
- ...a.slice(o)
521
- ];
522
- return B(e, s) || s.every((t, n) => t === e.columnOrder[n]) ? e : {
523
- ...e,
524
- columnOrder: s
525
- };
526
- }
527
- function fe(e) {
528
- let t = e.columnGroups.length === 0 ? void 0 : Object.fromEntries(e.columnGroups.map((t) => [t.id, { ...e.columnGroupState[t.id] }]));
529
- return {
530
- columns: { ...e.columnState },
531
- ...t ? { groups: t } : {},
532
- order: [...e.columnOrder]
533
- };
534
- }
535
- function pe(e, t) {
536
- return {
537
- ...e,
538
- columnOrder: p(e.columns, t, e.columnGroups),
539
- columnGroupState: u(e.columnGroups, t),
540
- columnState: l(e.columns, t)
541
- };
542
- }
543
- function me(e, t, n = {}) {
544
- let r = e.selection.rowIds, i = r.includes(t), a = n.multi ? n.toggle && i ? r.filter((e) => e !== t) : i ? r : [...r, t] : n.toggle && i ? [] : [t];
545
- return {
546
- ...e,
547
- selection: {
548
- ...e.selection,
549
- rowIds: a
550
- }
551
- };
552
- }
553
- function he(e, t) {
554
- return {
555
- ...e,
556
- selection: {
557
- ...e.selection,
558
- rowIds: [...t]
559
- }
560
- };
561
- }
562
- function U(e, t) {
563
- return e.rowId === t.rowId && e.columnId === t.columnId;
564
- }
565
- function ge(e, t, n = {}) {
566
- let r = e.selection.cells ?? (e.selection.cell ? [e.selection.cell] : []), i = r.some((e) => U(e, t)), a = n.multi ? n.toggle && i ? r.filter((e) => !U(e, t)) : i ? r : [...r, t] : n.toggle && i ? [] : [t], o = a.some((e) => U(e, t)) ? t : a.at(-1) ?? null;
567
- return {
568
- ...e,
569
- selection: {
570
- ...e.selection,
571
- cell: o,
572
- cells: a,
573
- range: null
574
- }
575
- };
576
- }
577
- function _e(e, t) {
578
- return {
579
- ...e,
580
- selection: {
581
- ...e.selection,
582
- cell: t.focus,
583
- cells: [],
584
- range: t
585
- }
586
- };
587
- }
588
- function ve(e) {
589
- return {
590
- ...e,
591
- selection: {
592
- ...e.selection,
593
- range: null
594
- }
595
- };
596
- }
597
- function ye(e) {
598
- return {
599
- ...e,
600
- selection: m()
601
- };
602
- }
603
- function be(e, t) {
604
- return e.selection.rowIds.includes(t);
605
- }
606
- function W(e, t) {
607
- let n = e.selection.cells;
608
- return n && n.length > 0 ? n.some((e) => U(e, t)) : e.selection.cell !== null && U(e.selection.cell, t);
609
- }
610
- function G(e, t = e.selection.range, n = e.rowIds) {
611
- if (!t) return [];
612
- let r = K(e), i = E(e, t, n);
613
- if (!i) return [];
614
- let a = [];
615
- for (let e = i.rowStart; e <= i.rowEnd; e += 1) {
616
- let t = i.rowIds[e];
617
- if (t !== void 0) for (let e = i.columnStart; e <= i.columnEnd; e += 1) {
618
- let n = r[e];
619
- n && a.push({
620
- columnId: n.id,
621
- rowId: t
622
- });
623
- }
624
- }
625
- return a;
626
- }
627
- function xe(e, t, n = e.rowIds) {
628
- return G(e, e.selection.range, n).some((e) => e.rowId === t.rowId && e.columnId === t.columnId);
629
- }
630
- function K(e) {
631
- let t = d(e.columnGroups), n = new Map(e.columnGroups.map((e) => [e.id, e])), r = /* @__PURE__ */ new Set(), i = [];
632
- for (let a of e.columnOrder) {
633
- let o = v(e, a);
634
- if (!o || e.columnState[o.id]?.hidden === !0) continue;
635
- let s = t.get(o.id);
636
- if (!s) {
637
- i.push({
638
- columns: [o],
639
- pinned: e.columnState[o.id]?.pinned
640
- });
641
- continue;
642
- }
643
- if (r.has(s) || e.columnGroupState[s]?.hidden === !0) continue;
644
- let c = n.get(s);
645
- if (!c) continue;
646
- let l = e.columnOrder.filter((e) => c.children.includes(e)).map((t) => v(e, t)).filter((t) => !!t && e.columnState[t.id]?.hidden !== !0);
647
- l.length > 0 && i.push({
648
- columns: l,
649
- pinned: e.columnGroupState[s]?.pinned
650
- }), r.add(s);
651
- }
652
- return [
653
- "left",
654
- void 0,
655
- "right"
656
- ].flatMap((e) => i.filter((t) => t.pinned === e).flatMap((e) => e.columns));
657
- }
658
- function Se(e) {
659
- let t = K(e);
660
- if (e.columnGroups.length === 0) return [t.map((e) => ({
661
- colSpan: 1,
662
- column: e,
663
- columnId: e.id,
664
- kind: "column",
665
- rowSpan: 1
666
- }))];
667
- new Set(t.map((e) => e.id));
668
- let n = d(e.columnGroups), r = new Map(e.columnGroups.map((e) => [e.id, e])), i = /* @__PURE__ */ new Set(), a = [], o = [];
669
- for (let e of t) {
670
- let s = e.id, c = n.get(s);
671
- if (!c) {
672
- a.push({
673
- colSpan: 1,
674
- column: e,
675
- columnId: e.id,
676
- kind: "column",
677
- rowSpan: 2
678
- });
679
- continue;
680
- }
681
- if (i.has(c)) continue;
682
- let l = r.get(c);
683
- if (!l) continue;
684
- let u = t.filter((e) => l.children.includes(e.id));
685
- if (u.length === 0) {
686
- i.add(c);
687
- continue;
688
- }
689
- a.push({
690
- colSpan: u.length,
691
- group: l,
692
- groupId: c,
693
- kind: "group",
694
- rowSpan: 1
695
- }), o.push(...u.map((e) => ({
696
- colSpan: 1,
697
- column: e,
698
- columnId: e.id,
699
- groupId: c,
700
- kind: "column",
701
- rowSpan: 1
702
- }))), i.add(c);
703
- }
704
- return [a, o];
705
- }
706
- function q(e, t = e.rows.map((e, t) => t)) {
707
- let n = [...t];
708
- return e.sortModel.length === 0 ? n : [...n].sort((t, n) => {
709
- let r = e.rows[t], i = e.rows[n];
710
- for (let t of e.sortModel) {
711
- let n = v(e, t.columnId);
712
- if (!n?.sort) continue;
713
- let a = J(e, r, n.id), o = J(e, i, n.id), s = typeof n.sort == "function" ? n.sort(a, o, r, i) : k(a, o);
714
- if (s !== 0) return t.direction === "desc" ? s * -1 : s;
715
- }
716
- return t - n;
717
- });
718
- }
719
- function Ce(e, t) {
720
- let n = N(e, t);
721
- return g(n, q(n).map((e) => n.rows[e]));
722
- }
723
- function we(e, t = {}) {
724
- let n = t.pageIndex ?? e.pagination.pageIndex, r = t.pageSize ?? e.pagination.pageSize, i = Math.max(0, n) * Math.max(1, r);
725
- return q(e).slice(i, i + Math.max(1, r)).map((t) => e.rows[t]);
726
- }
727
- function Te(e, { overscan: t = 2, rowHeight: n, scrollTop: r, viewportHeight: i }) {
728
- let a = Math.max(1, n), o = q(e), s = o.length, c = s * a, l = Math.max(0, Math.floor(Math.max(0, r) / a) - Math.max(0, t)), u = Math.min(s, Math.ceil((Math.max(0, r) + Math.max(0, i)) / a) + Math.max(0, t)), d = l * a;
729
- return {
730
- bottomSpacerHeight: Math.max(0, c - d - (u - l) * a),
731
- endIndex: u,
732
- rows: o.slice(l, u).map((t) => e.rows[t]),
733
- startIndex: l,
734
- topSpacerHeight: d,
735
- totalHeight: c
736
- };
737
- }
738
- function Ee(e, t, n) {
739
- let r = _(e, t);
740
- if (r < 0) return e;
741
- let i = [...e.rows], [a] = i.splice(r, 1);
742
- return a === void 0 ? e : (i.splice(Math.max(0, Math.min(n, i.length)), 0, a), g(e, i));
743
- }
744
- function De(e, t) {
745
- let n = _(e, t.sourceRowId), r = t.targetRowId === void 0 ? -1 : _(e, t.targetRowId);
746
- if (n < 0 || t.targetRowId === t.sourceRowId || t.targetRowId !== void 0 && r < 0) return e;
747
- let i = e.rows[n];
748
- if (i === void 0) return e;
749
- let a = t.getRowGroupId(i, n), o = a !== t.targetGroupId;
750
- if (o && typeof t.setRowGroupId != "function") return e;
751
- if (r >= 0) {
752
- let n = e.rows[r];
753
- if (n === void 0 || t.getRowGroupId(n, r) !== t.targetGroupId) return e;
754
- }
755
- let s = o ? t.setRowGroupId({
756
- fromGroupId: a,
757
- row: i,
758
- rowId: t.sourceRowId,
759
- toGroupId: t.targetGroupId
760
- }) : i, c = [...e.rows];
761
- c.splice(n, 1);
762
- let l;
763
- if (t.targetRowId !== void 0) l = Math.max(0, Math.min(r, c.length));
764
- else {
765
- let e = -1;
766
- c.forEach((n, r) => {
767
- t.getRowGroupId(n, r) === t.targetGroupId && (e = r);
768
- }), l = e < 0 ? c.length : e + 1;
769
- }
770
- return c.splice(l, 0, s), g(e, c);
771
- }
772
- function J(e, t, n) {
773
- let r = v(e, n);
774
- return r ? x(t, r.field) : void 0;
775
- }
776
- function Oe(e, t, n, r) {
777
- let i = J(e, t, r.id);
778
- return r.cell?.format ? r.cell.format(C(e, t, n, r)) : i == null ? "" : String(i);
779
- }
780
- function ke(e, t, n, r) {
781
- let i = T(e, t, n, r);
782
- return i?.disabled !== void 0 && w(i.disabled, C(e, t, n, r)) === !0;
783
- }
784
- function Ae(e, t, n, r) {
785
- let i = C(e, t, n, r), a = T(e, t, n, r)?.className;
786
- return typeof a == "function" ? a(i) : a;
787
- }
788
- function je(e, t, n, r) {
789
- let i = C(e, t, n, r), a = T(e, t, n, r)?.style;
790
- return typeof a == "function" ? a(i) : a;
791
- }
792
- function Me(e, t) {
793
- let n = e.rows[_(e, t)];
794
- if (n === void 0) throw Error(`Cannot copy missing row: ${String(t)}`);
795
- return {
796
- kind: "row",
797
- row: n,
798
- text: JSON.stringify(n)
799
- };
800
- }
801
- function Ne(e, t, n) {
802
- if (n.mode === "append") {
803
- let r = n.getNewRowId?.(t.row);
804
- return j(e, [r === void 0 ? t.row : D(t.row, r)]);
805
- }
806
- if (n.mode === "insert-after") {
807
- let r = _(e, n.targetRowId);
808
- if (r < 0) return e;
809
- let i = e.getRowId(t.row, r), a = n.getPastedRowId?.(t.row) ?? ee(e.rowIds, i), o = D(t.row, a), s = [...e.rows];
810
- return s.splice(r + 1, 0, o), g(e, s);
811
- }
812
- return M(e, [{
813
- id: n.targetRowId,
814
- patch: D(t.row, n.targetRowId)
815
- }]);
816
- }
817
- function Pe(e, { columnId: t, rowId: n }) {
818
- let r = e.rows[_(e, n)], i = v(e, t);
819
- if (!i || !O(e, r, n, i, "copy")) return null;
820
- let a = J(e, r, t);
821
- return {
822
- kind: "cell",
823
- text: a == null ? "" : String(a),
824
- value: a
825
- };
826
- }
827
- function Fe(e, { columnId: t, rowId: n }, r) {
828
- let i = v(e, t), a = e.rows[_(e, n)];
829
- return !r || !i || !O(e, a, n, i, "paste") ? e : M(e, [{
830
- id: n,
831
- patch: (e) => S(e, i.field, r.value)
832
- }]);
833
- }
834
- function Ie(e, t = e.selection.range, n = e.rowIds) {
835
- if (!t) return null;
836
- let r = E(e, t, n);
837
- if (!r) return null;
838
- let i = [];
839
- for (let t = r.rowStart; t <= r.rowEnd; t += 1) {
840
- let n = r.rowIds[t], a = n === void 0 ? -1 : _(e, n), o = e.rows[a], s = [];
841
- for (let t = r.columnStart; t <= r.columnEnd; t += 1) {
842
- let i = r.visibleColumns[t];
843
- if (o === void 0 || n === void 0 || !i || !O(e, o, n, i, "copy")) {
844
- s.push(null);
845
- continue;
846
- }
847
- let a = J(e, o, i.id);
848
- s.push({
849
- columnId: i.id,
850
- text: a == null ? "" : String(a),
851
- value: a
852
- });
853
- }
854
- i.push(s);
855
- }
856
- return {
857
- kind: "cell-range",
858
- rows: i,
859
- text: i.map((e) => e.map((e) => e?.text ?? "").join(" ")).join("\n")
860
- };
861
- }
862
- function Le(e, t, n, r = e.rowIds) {
863
- if (!n) return e;
864
- let i = K(e), a = r.indexOf(t.rowId), o = i.findIndex((e) => e.id === t.columnId), s = [...e.rows];
865
- if (a < 0 || o < 0) return e;
866
- let c = !1;
867
- return n.rows.forEach((t, n) => {
868
- let l = r[a + n], u = l === void 0 ? -1 : _(e, l), d = s[u];
869
- d !== void 0 && l !== void 0 && t.forEach((t, n) => {
870
- let r = i[o + n];
871
- !t || !r || !O(e, d, l, r, "paste") || (s[u] = S(s[u], r.field, t.value), c = !0);
872
- });
873
- }), c ? g(e, s) : e;
874
- }
875
- function Re(t, n, r, i = t.rowIds) {
876
- let a = e(r), o = K(t), s = i.indexOf(n.rowId), c = o.findIndex((e) => e.id === n.columnId);
877
- return s < 0 || c < 0 ? t : Y(t, i, s, c, a.length, a.reduce((e, t) => Math.max(e, t.length), 0), (e, n, r, i, o, s) => {
878
- let c = a[e]?.[n];
879
- if (c === void 0) return null;
880
- let l = C(t, i, o, r, s);
881
- return { value: r.cell?.parseClipboard ? r.cell.parseClipboard({
882
- ...l,
883
- text: c
884
- }) : c };
885
- });
886
- }
887
- function Y(e, t, n, r, i, a, o) {
888
- if (i * a > 1e5) throw Error("Clipboard exceeds 100000 cells.");
889
- let s = K(e), c = new Map(e.rowIds.map((e, t) => [e, t])), l = [...e.rows], u = !1;
890
- for (let d = 0; d < i && n + d < t.length; d++) {
891
- let i = t[n + d], f = c.get(i), p = f === void 0 ? void 0 : e.rows[f];
892
- if (f !== void 0 && p !== void 0) for (let t = 0; t < a && r + t < s.length; t++) {
893
- let n = s[r + t];
894
- if (!O(e, p, i, n, "paste", f)) continue;
895
- let a = o(d, t, n, p, i, f);
896
- !a || Object.is(x(l[f], n.field), a.value) || (l[f] = S(l[f], n.field, a.value), u = !0);
897
- }
898
- }
899
- return u ? g(e, l) : e;
900
- }
901
- function ze(e, { source: t, target: n }, r = e.rowIds) {
902
- let i = E(e, "anchor" in t ? t : {
903
- anchor: t,
904
- focus: t
905
- }, r), a = E(e, n, r);
906
- if (!i || !a) return e;
907
- let o = i.rowEnd - i.rowStart + 1, s = i.columnEnd - i.columnStart + 1;
908
- if (o * s > 1e5) throw Error("Clipboard exceeds 100000 cells.");
909
- let c = new Map(e.rowIds.map((e, t) => [e, t])), l = Array.from({ length: o }, (t, n) => {
910
- let a = r[i.rowStart + n], o = c.get(a), l = o === void 0 ? void 0 : e.rows[o];
911
- return Array.from({ length: s }, (t, n) => {
912
- let r = i.visibleColumns[i.columnStart + n];
913
- return l === void 0 || !O(e, l, a, r, "copy", o) ? null : { value: x(l, r.field) };
914
- });
915
- }), u = (e, t) => (e % t + t) % t;
916
- return Y(e, r, a.rowStart, a.columnStart, a.rowEnd - a.rowStart + 1, a.columnEnd - a.columnStart + 1, (t, n, r, c, d, f) => {
917
- let p = l[u(a.rowStart + t - i.rowStart, o)][u(a.columnStart + n - i.columnStart, s)];
918
- if (p && !Object.is(x(c, r.field), p.value) && r.cell?.validateFill) {
919
- let t = C(e, c, d, r, f);
920
- if (r.cell.validateFill({
921
- ...t,
922
- value: p.value
923
- }) === !1) throw Error(`Fill rejected for column "${r.id}".`);
924
- }
925
- return p;
926
- });
927
- }
928
- function X({ columnOrder: e, columns: t }) {
929
- if (!e?.length) return t;
930
- let n = new Map(t.map((e) => [e.id, e]));
931
- return e.map((e) => n.get(e)).filter((e) => !!e);
932
- }
933
- function Be(e) {
934
- return e == null ? "" : typeof e == "string" ? e : typeof e == "number" || typeof e == "boolean" || typeof e == "bigint" ? String(e) : JSON.stringify(e);
935
- }
936
- function Z(e) {
937
- let t = Be(e);
938
- return /[",\r\n]/u.test(t) ? `"${t.replaceAll("\"", "\"\"")}"` : t;
939
- }
940
- function Q(e, t) {
941
- return e.id && t?.[e.id] !== void 0 ? t[e.id] : e.label ?? e.id ?? "";
942
- }
943
- function $(e, t, n, r) {
944
- return r === "formatted" && e.format ? e.format(t, n) : e.value(t, n);
945
- }
946
- function Ve({ columnOrder: e, columns: t, headerOverrides: n, rows: r, valueSource: i = "raw" }) {
947
- let a = X({
948
- columnOrder: e,
949
- columns: t
950
- });
951
- return [a.map((e) => Z(Q(e, n))).join(","), ...r.map((e, t) => a.map((n) => Z($(n, e, t, i))).join(","))].join("\n");
952
- }
953
- function He({ columnOrder: e, columns: t, headerOverrides: n, rows: r, valueSource: i = "raw" }) {
954
- let a = X({
955
- columnOrder: e,
956
- columns: t
957
- }), o = r.map((e, t) => Object.fromEntries(a.map((r) => [Q(r, n), $(r, e, t, i)])));
958
- return JSON.stringify(o, null, 2);
959
- }
960
- //#endregion
961
- export { M as $, Ee as A, me as B, K as C, be as D, W as E, Re as F, le as G, fe as H, A as I, oe as J, ce as K, ne as L, Fe as M, Le as N, V as O, Ne as P, Ce as Q, ge as R, Te as S, xe as T, ue as U, he as V, z as W, N as X, P as Y, ie as Z, J as _, se as a, G as b, Me as c, Ve as d, i as et, He as f, je as g, Ae as h, ye as i, De as j, H as k, te as l, Oe as m, pe as n, n as nt, Pe as o, ze as p, ae as q, ve as r, e as rt, Ie as s, j as t, r as tt, re as u, Se as v, ke as w, q as x, we as y, _e as z };
962
-
963
- //# sourceMappingURL=core-C1tlvY8Q.js.map