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