@svgrid/grid 3.0.7 → 3.0.9
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/README.md +1 -1
- package/dist/GridMenus.svelte +3 -2
- package/dist/SvGrid.controller.svelte.d.ts +60 -8
- package/dist/SvGrid.controller.svelte.js +490 -114
- package/dist/SvGrid.css +186 -3
- package/dist/SvGrid.svelte +285 -164
- package/dist/SvGrid.types.d.ts +24 -7
- package/dist/cdn/{GridMenus-CcwU8I4t.js → GridMenus-B1sipj6y.js} +165 -165
- package/dist/cdn/{GridMenus-BgUS-W3o.js → GridMenus-DlAzfHLk.js} +201 -201
- package/dist/cdn/server-block-cache-Dj-KPqEQ.js +1289 -0
- package/dist/cdn/{src-kE9B98r6.js → src-BYsa66I0.js} +9747 -10178
- package/dist/cdn/{src-25JmJ_7g.js → src-pA4RroLV.js} +10709 -11140
- package/dist/cdn/svgrid.js +27 -27
- package/dist/cdn/svgrid.svelte-external.js +27 -27
- package/dist/cdn/validate-XuMe4_KR.js +80 -0
- package/dist/cell-render.js +25 -3
- package/dist/columns.js +16 -1
- package/dist/conditional-formatting.js +9 -2
- package/dist/core.d.ts +93 -0
- package/dist/core.js +313 -47
- package/dist/filtering/excel-filters.js +41 -6
- package/dist/headless.d.ts +1 -1
- package/dist/headless.js +1 -1
- package/dist/index.d.ts +2 -1
- package/dist/index.js +2 -1
- package/dist/keyboard-handlers.js +5 -1
- package/dist/selection.d.ts +2 -2
- package/dist/selection.js +46 -12
- package/dist/server-block-cache.d.ts +7 -32
- package/dist/server-block-cache.js +21 -12
- package/dist/server-data-source.js +3 -1
- package/dist/server.d.ts +1 -0
- package/dist/server.js +1 -0
- package/dist/spreadsheet.js +7 -0
- package/dist/{subscribe.js → subscribe.svelte.js} +5 -1
- package/dist/validate.js +13 -14
- package/dist/virtualization/column-virtualizer.d.ts +4 -0
- package/dist/virtualization/column-virtualizer.js +2 -0
- package/dist/virtualization/types.d.ts +20 -0
- package/dist/virtualization/virtualizer.js +90 -24
- package/dist/windowed-brand.d.ts +22 -0
- package/dist/windowed-brand.js +60 -0
- package/dist/windowed-data.d.ts +6 -0
- package/dist/windowed-data.js +34 -0
- package/dist/windowed-row-model.d.ts +1 -0
- package/dist/windowed-row-model.js +97 -0
- package/package.json +1 -1
- package/src/GridMenus.svelte +3 -2
- package/src/SvGrid.controller.svelte.ts +483 -122
- package/src/SvGrid.css +186 -3
- package/src/SvGrid.svelte +285 -164
- package/src/SvGrid.types.ts +24 -7
- package/src/cell-render.ts +24 -2
- package/src/columns.ts +16 -1
- package/src/conditional-formatting.ts +6 -4
- package/src/core.sort.test.ts +61 -0
- package/src/core.ts +309 -49
- package/src/counting-cell.test.svelte +11 -0
- package/src/filtering/excel-filters.ts +39 -6
- package/src/headless.reactivity.svelte.test.ts +89 -0
- package/src/headless.ts +1 -1
- package/src/index.ts +7 -1
- package/src/keyboard-handlers.ts +5 -1
- package/src/new-features.test.ts +24 -0
- package/src/selection.test.ts +51 -0
- package/src/selection.ts +47 -14
- package/src/server-block-cache.ts +27 -10
- package/src/server-data-source.ts +3 -1
- package/src/server.ts +6 -0
- package/src/spreadsheet.ts +6 -0
- package/src/{subscribe.test.ts → subscribe.svelte.test.ts} +1 -1
- package/src/{subscribe.ts → subscribe.svelte.ts} +5 -1
- package/src/svgrid.behavior.test.ts +58 -0
- package/src/svgrid.column-cell-recycling.test.ts +120 -0
- package/src/svgrid.interaction.test.ts +4 -1
- package/src/svgrid.new-features.wrapper.test.ts +5 -4
- package/src/svgrid.pinned-column-virtualization.test.ts +162 -0
- package/src/svgrid.row-model-prop.svelte.test.ts +15 -3
- package/src/validate.test.ts +20 -4
- package/src/validate.ts +13 -16
- package/src/virtualization/column-virtualizer.ts +6 -0
- package/src/virtualization/types.ts +20 -0
- package/src/virtualization/virtualizer.test.ts +152 -0
- package/src/virtualization/virtualizer.ts +93 -27
- package/src/windowed-brand.ts +67 -0
- package/src/windowed-data.test.ts +105 -0
- package/src/windowed-data.ts +36 -0
- package/src/windowed-row-model.ts +113 -0
- package/dist/cdn/server-block-cache-DIqb3VZn.js +0 -241
- package/dist/cdn/validate-AZoD8BoR.js +0 -80
- /package/dist/{subscribe.d.ts → subscribe.svelte.d.ts} +0 -0
|
@@ -1,241 +0,0 @@
|
|
|
1
|
-
//#region src/server-block-cache.ts
|
|
2
|
-
var e = Symbol.for("svgrid.rowPlaceholder"), t = Object.freeze({ [e]: "loading" }), n = Object.freeze({ [e]: "failed" });
|
|
3
|
-
function r(t) {
|
|
4
|
-
if (typeof t != "object" || !t) return null;
|
|
5
|
-
let n = t[e];
|
|
6
|
-
return n === "loading" || n === "failed" ? n : null;
|
|
7
|
-
}
|
|
8
|
-
function i(t, n) {
|
|
9
|
-
return Object.freeze({
|
|
10
|
-
...n,
|
|
11
|
-
[e]: t
|
|
12
|
-
});
|
|
13
|
-
}
|
|
14
|
-
var a = (e) => {
|
|
15
|
-
Promise.resolve().then(e);
|
|
16
|
-
};
|
|
17
|
-
function o(e) {
|
|
18
|
-
let r = Math.max(1, e.blockSize ?? 100), i = e.maxBlocksInCache ?? Infinity, o = Math.max(1, e.maxConcurrentRequests ?? 2), s = Math.max(0, e.blockLoadDebounceMs ?? 0), c = Math.max(0, e.initialRowCount ?? 1), l = Math.max(0, e.overflowRows ?? 1), u = e.schedule ?? a, d = /* @__PURE__ */ new Map(), f = [], p = 0, m = 0, h = null, g = !1, _ = !1, v = 0, y = 0, b = null, x = !1, S = null, C = (e) => Math.floor(e / r), w = (e) => e * r;
|
|
19
|
-
function T() {
|
|
20
|
-
if (g && h != null) return h;
|
|
21
|
-
let e = 0, t = !1;
|
|
22
|
-
for (let e of d.values()) e.status !== "loading" && (t = !0);
|
|
23
|
-
for (let [n, i] of d) {
|
|
24
|
-
let a = i.status === "loaded" ? w(n) + i.rows.length : i.status === "failed" ? n === 0 ? 0 : w(n) + r : t ? w(n) + r : 0;
|
|
25
|
-
a > e && (e = a);
|
|
26
|
-
}
|
|
27
|
-
return t ? Math.max(c, e + l) : c;
|
|
28
|
-
}
|
|
29
|
-
function E() {
|
|
30
|
-
let e = [];
|
|
31
|
-
for (let [t, n] of d) n.status === "failed" && e.push(t);
|
|
32
|
-
return {
|
|
33
|
-
rowCount: g ? h : null,
|
|
34
|
-
lastRowKnown: g,
|
|
35
|
-
loading: p > 0,
|
|
36
|
-
failedBlocks: e.sort((e, t) => e - t)
|
|
37
|
-
};
|
|
38
|
-
}
|
|
39
|
-
function D() {
|
|
40
|
-
S = null, !(_ || x) && (x = !0, u(() => {
|
|
41
|
-
x = !1, !_ && e.onChange(E());
|
|
42
|
-
}));
|
|
43
|
-
}
|
|
44
|
-
function O(e) {
|
|
45
|
-
_ || d.get(e) || f.includes(e) || (f.push(e), k());
|
|
46
|
-
}
|
|
47
|
-
function k() {
|
|
48
|
-
for (; !_ && p < o && f.length > 0;) {
|
|
49
|
-
let e = f.shift();
|
|
50
|
-
d.has(e) || A(e);
|
|
51
|
-
}
|
|
52
|
-
}
|
|
53
|
-
async function A(t) {
|
|
54
|
-
let n = new AbortController(), i = {
|
|
55
|
-
status: "loading",
|
|
56
|
-
rows: [],
|
|
57
|
-
lastTouched: m += 1,
|
|
58
|
-
controller: n
|
|
59
|
-
};
|
|
60
|
-
d.set(t, i), p += 1, D();
|
|
61
|
-
let a = w(t), o = a + r;
|
|
62
|
-
try {
|
|
63
|
-
let r = await e.fetch(a, o, n.signal);
|
|
64
|
-
if (_ || n.signal.aborted || d.get(t) !== i) return;
|
|
65
|
-
i.rows = [...r.rows], i.status = "loaded", i.controller = null, j(t, i.rows.length, r.rowCount), M();
|
|
66
|
-
} catch {
|
|
67
|
-
if (_ || n.signal.aborted || d.get(t) !== i) return;
|
|
68
|
-
i.status = "failed", i.rows = [], i.controller = null;
|
|
69
|
-
} finally {
|
|
70
|
-
!_ && !n.signal.aborted && (--p, D(), k());
|
|
71
|
-
}
|
|
72
|
-
}
|
|
73
|
-
function j(e, t, n) {
|
|
74
|
-
if (typeof n == "number" && n >= 0) {
|
|
75
|
-
h = n, g = !0;
|
|
76
|
-
return;
|
|
77
|
-
}
|
|
78
|
-
t < r && (h = w(e) + t, g = !0);
|
|
79
|
-
}
|
|
80
|
-
function M() {
|
|
81
|
-
if (!Number.isFinite(i)) return;
|
|
82
|
-
let e = C(v), t = C(Math.max(v, y)), n = [...d.entries()].filter(([n, r]) => r.status === "loaded" && (n < e || n > t)).sort((e, t) => e[1].lastTouched - t[1].lastTouched), r = 0;
|
|
83
|
-
for (let e of d.values()) e.status === "loaded" && (r += 1);
|
|
84
|
-
for (let [e] of n) {
|
|
85
|
-
if (r <= i) break;
|
|
86
|
-
d.delete(e), --r;
|
|
87
|
-
}
|
|
88
|
-
}
|
|
89
|
-
function N() {
|
|
90
|
-
if (_) return;
|
|
91
|
-
let e = C(v), t = C(Math.max(v, y));
|
|
92
|
-
for (let n = e; n <= t; n += 1) {
|
|
93
|
-
let e = d.get(n);
|
|
94
|
-
e ? e.lastTouched = m += 1 : O(n);
|
|
95
|
-
}
|
|
96
|
-
}
|
|
97
|
-
function P() {
|
|
98
|
-
for (let e of d.values()) e.controller?.abort();
|
|
99
|
-
p = 0, f.length = 0;
|
|
100
|
-
}
|
|
101
|
-
return {
|
|
102
|
-
setViewport(e, t) {
|
|
103
|
-
if (!_) {
|
|
104
|
-
if (v = Math.max(0, e), y = Math.max(v, t), s === 0) {
|
|
105
|
-
N();
|
|
106
|
-
return;
|
|
107
|
-
}
|
|
108
|
-
b && clearTimeout(b), b = setTimeout(() => {
|
|
109
|
-
b = null, N();
|
|
110
|
-
}, s);
|
|
111
|
-
}
|
|
112
|
-
},
|
|
113
|
-
rows() {
|
|
114
|
-
if (S) return S;
|
|
115
|
-
let e = T(), i = Array(e);
|
|
116
|
-
i.fill(t);
|
|
117
|
-
for (let [t, a] of d) {
|
|
118
|
-
let o = w(t);
|
|
119
|
-
if (!(o >= e)) {
|
|
120
|
-
if (a.status === "failed") {
|
|
121
|
-
let t = Math.min(o + r, e);
|
|
122
|
-
for (let e = o; e < t; e += 1) i[e] = n;
|
|
123
|
-
continue;
|
|
124
|
-
}
|
|
125
|
-
for (let t = 0; t < a.rows.length && o + t < e; t += 1) i[o + t] = a.rows[t];
|
|
126
|
-
}
|
|
127
|
-
}
|
|
128
|
-
return S = i, i;
|
|
129
|
-
},
|
|
130
|
-
getRow(e) {
|
|
131
|
-
let r = d.get(C(e));
|
|
132
|
-
return r ? r.status === "failed" ? n : r.rows[e - w(C(e))] ?? t : t;
|
|
133
|
-
},
|
|
134
|
-
rowCount: () => g ? h : null,
|
|
135
|
-
lastRowKnown: () => g,
|
|
136
|
-
retryFailed() {
|
|
137
|
-
let e = !1;
|
|
138
|
-
for (let [t, n] of [...d]) n.status === "failed" && (d.delete(t), O(t), e = !0);
|
|
139
|
-
e && D();
|
|
140
|
-
},
|
|
141
|
-
retryFailedAt(e) {
|
|
142
|
-
let t = C(Math.max(0, e));
|
|
143
|
-
d.get(t)?.status === "failed" && (d.delete(t), O(t), D());
|
|
144
|
-
},
|
|
145
|
-
refresh() {
|
|
146
|
-
for (let [e, t] of [...d]) t.controller?.abort(), d.delete(e), O(e);
|
|
147
|
-
D();
|
|
148
|
-
},
|
|
149
|
-
purge() {
|
|
150
|
-
P(), d.clear(), h = null, g = !1, S = null, N(), D();
|
|
151
|
-
},
|
|
152
|
-
setRowCount(e, t = e != null) {
|
|
153
|
-
h = e, g = t && e != null, D();
|
|
154
|
-
},
|
|
155
|
-
applyRows(e, t, n) {
|
|
156
|
-
if (e % r !== 0) throw Error(`createBlockCache.applyRows: startRow ${e} is not a multiple of blockSize ${r}`);
|
|
157
|
-
let i = C(e), a = Math.ceil(t.length / r);
|
|
158
|
-
for (let e = 0; e < a; e += 1) {
|
|
159
|
-
let n = i + e;
|
|
160
|
-
d.get(n)?.controller?.abort(), d.set(n, {
|
|
161
|
-
status: "loaded",
|
|
162
|
-
rows: t.slice(e * r, (e + 1) * r),
|
|
163
|
-
lastTouched: m += 1,
|
|
164
|
-
controller: null
|
|
165
|
-
});
|
|
166
|
-
}
|
|
167
|
-
let o = d.get(i + a - 1);
|
|
168
|
-
o ? j(i + a - 1, o.rows.length, n) : typeof n == "number" && n >= 0 && (h = n, g = !0), D();
|
|
169
|
-
},
|
|
170
|
-
patch(e, t) {
|
|
171
|
-
let n = d.get(C(e));
|
|
172
|
-
if (!n || n.status !== "loaded") return !1;
|
|
173
|
-
let r = e - w(C(e));
|
|
174
|
-
return r < 0 || r >= n.rows.length ? !1 : (n.rows[r] = t, D(), !0);
|
|
175
|
-
},
|
|
176
|
-
findIndex(e) {
|
|
177
|
-
for (let [t, n] of d) {
|
|
178
|
-
if (n.status !== "loaded") continue;
|
|
179
|
-
let r = w(t);
|
|
180
|
-
for (let t = 0; t < n.rows.length; t += 1) if (e(n.rows[t], r + t)) return r + t;
|
|
181
|
-
}
|
|
182
|
-
return -1;
|
|
183
|
-
},
|
|
184
|
-
insert(e, t) {
|
|
185
|
-
if (t.length === 0) return !1;
|
|
186
|
-
let n = Math.max(0, Math.min(e, T())), r = F(n);
|
|
187
|
-
return r ? (r.flat.splice(n - w(r.startBlock), 0, ...t), I(r.startBlock, r.flat)) : L(C(n)), g && h != null && (h += t.length), D(), r != null;
|
|
188
|
-
},
|
|
189
|
-
remove(e, t = 1) {
|
|
190
|
-
if (t <= 0) return 0;
|
|
191
|
-
let n = F(e);
|
|
192
|
-
if (!n) return 0;
|
|
193
|
-
let r = n.flat.splice(e - w(n.startBlock), t).length;
|
|
194
|
-
return I(n.startBlock, n.flat), g && h != null && (h = Math.max(0, h - r)), D(), r;
|
|
195
|
-
},
|
|
196
|
-
getCacheState() {
|
|
197
|
-
return [...d.entries()].map(([e, t]) => ({
|
|
198
|
-
blockIndex: e,
|
|
199
|
-
startRow: w(e),
|
|
200
|
-
endRow: w(e) + r,
|
|
201
|
-
status: t.status,
|
|
202
|
-
lastTouched: t.lastTouched
|
|
203
|
-
})).sort((e, t) => e.blockIndex - t.blockIndex);
|
|
204
|
-
},
|
|
205
|
-
dispose() {
|
|
206
|
-
_ = !0, b && clearTimeout(b), b = null, P(), d.clear();
|
|
207
|
-
}
|
|
208
|
-
};
|
|
209
|
-
function F(e) {
|
|
210
|
-
let t = C(e);
|
|
211
|
-
if (d.get(t)?.status !== "loaded") return null;
|
|
212
|
-
let n = t;
|
|
213
|
-
for (; d.get(n - 1)?.status === "loaded";) --n;
|
|
214
|
-
let i = [];
|
|
215
|
-
for (let e = n;; e += 1) {
|
|
216
|
-
let t = d.get(e);
|
|
217
|
-
if (!t || t.status !== "loaded" || (i.push(...t.rows), t.rows.length < r)) break;
|
|
218
|
-
}
|
|
219
|
-
return {
|
|
220
|
-
startBlock: n,
|
|
221
|
-
flat: i
|
|
222
|
-
};
|
|
223
|
-
}
|
|
224
|
-
function I(e, t) {
|
|
225
|
-
let n = Math.ceil(t.length / r);
|
|
226
|
-
L(e);
|
|
227
|
-
for (let i = 0; i < n; i += 1) d.set(e + i, {
|
|
228
|
-
status: "loaded",
|
|
229
|
-
rows: t.slice(i * r, (i + 1) * r),
|
|
230
|
-
lastTouched: m += 1,
|
|
231
|
-
controller: null
|
|
232
|
-
});
|
|
233
|
-
S = null;
|
|
234
|
-
}
|
|
235
|
-
function L(e) {
|
|
236
|
-
for (let [t, n] of [...d]) t < e || (n.controller?.abort(), d.delete(t));
|
|
237
|
-
S = null;
|
|
238
|
-
}
|
|
239
|
-
}
|
|
240
|
-
//#endregion
|
|
241
|
-
export { i as n, r, o as t };
|
|
@@ -1,80 +0,0 @@
|
|
|
1
|
-
import { r as e } from "./server-block-cache-DIqb3VZn.js";
|
|
2
|
-
//#region src/validate.ts
|
|
3
|
-
var t = 10, n = "https://svgrid.com/docs/getting-started/3-data-and-columns/";
|
|
4
|
-
function r(e, t = []) {
|
|
5
|
-
for (let n of e) n.columns?.length ? r(n.columns, t) : t.push(n);
|
|
6
|
-
return t;
|
|
7
|
-
}
|
|
8
|
-
function i(i) {
|
|
9
|
-
let o = [], s = r(i.columns ?? []), c = [];
|
|
10
|
-
for (let n of i.data ?? []) {
|
|
11
|
-
if (c.length >= t) break;
|
|
12
|
-
e(n) || c.push(n);
|
|
13
|
-
}
|
|
14
|
-
if (c.length && !i.serverGroup) {
|
|
15
|
-
let e = /* @__PURE__ */ new Set();
|
|
16
|
-
for (let t of c) if (t && typeof t == "object") for (let n of Object.keys(t)) e.add(n);
|
|
17
|
-
for (let t of s) {
|
|
18
|
-
let r = t.field;
|
|
19
|
-
if (!r || t.fieldFn || e.has(r)) continue;
|
|
20
|
-
let i = a(r, [...e]);
|
|
21
|
-
o.push(`[svgrid] Column field "${r}" does not exist on your row data, so that column renders empty.${i ? ` Did you mean "${i}"?` : ""} Available keys: ${[...e].slice(0, 12).join(", ")}. See ${n}`);
|
|
22
|
-
}
|
|
23
|
-
}
|
|
24
|
-
let l = /* @__PURE__ */ new Map();
|
|
25
|
-
for (let e of s) {
|
|
26
|
-
let t = e.id ?? e.field;
|
|
27
|
-
t && l.set(t, (l.get(t) ?? 0) + 1);
|
|
28
|
-
}
|
|
29
|
-
for (let [e, t] of l) t > 1 && o.push(`[svgrid] ${t} columns share the id "${e}". Column state (sorting, filtering, pinning, width) is keyed by id, so they will act as one. Give each an explicit \`id\`. See ${n}`);
|
|
30
|
-
let u = i.pageable === void 0 && i.showPagination === void 0;
|
|
31
|
-
i.pageSize !== void 0 && u && o.push("[svgrid] `pageSize` is set but pagination was never turned on, so it has no effect and every row renders. Add `pageable` to switch the pager on."), !(i.sortable === !0 || i.features?.rowSortingFeature) && s.some((e) => e.sortable === !0) && o.push("[svgrid] A column sets `sortable: true`, but sorting is not enabled on the grid, so its header does nothing. Add `sortable` to <SvGrid> (it registers the sorting feature for you).");
|
|
32
|
-
let d = /* @__PURE__ */ new Set();
|
|
33
|
-
for (let e of s) {
|
|
34
|
-
let t = e.id ?? e.field;
|
|
35
|
-
t && d.add(t);
|
|
36
|
-
}
|
|
37
|
-
for (let e of i.groupBy ?? []) {
|
|
38
|
-
if (d.has(e)) continue;
|
|
39
|
-
let t = a(e, [...d]);
|
|
40
|
-
o.push(`[svgrid] \`groupBy\` refers to column "${e}", which does not exist, so that grouping level is ignored.${t ? ` Did you mean "${t}"?` : ""} Column ids: ${[...d].slice(0, 12).join(", ")}`);
|
|
41
|
-
}
|
|
42
|
-
let f = i.treeData?.column;
|
|
43
|
-
if (f && !d.has(f) && o.push(`[svgrid] \`treeData.column\` refers to column "${f}", which does not exist, so the expander falls back to the first visible column.`), c.length && i.treeData) {
|
|
44
|
-
let e = /* @__PURE__ */ new Set();
|
|
45
|
-
for (let t of c) if (t && typeof t == "object") for (let n of Object.keys(t)) e.add(n);
|
|
46
|
-
let t = i.treeData.parentField;
|
|
47
|
-
if (t && !e.has(t)) {
|
|
48
|
-
let n = a(t, [...e]);
|
|
49
|
-
o.push(`[svgrid] \`treeData.parentField\` is "${t}", which is not on your row data, so every row becomes a root and no hierarchy appears.${n ? ` Did you mean "${n}"?` : ""}`);
|
|
50
|
-
}
|
|
51
|
-
let n = i.treeData.idField;
|
|
52
|
-
n && !e.has(n) && o.push(`[svgrid] \`treeData.idField\` is "${n}", which is not on your row data, so parent lookups cannot match and the tree stays flat.`);
|
|
53
|
-
}
|
|
54
|
-
return i.gantt && i.treeData && o.push("[svgrid] `gantt` and `treeData` are both set. The Gantt builds its own work-breakdown tree from `gantt.parentField` and needs every descendant row, but `treeData` hides collapsed children from the view, so summary bars will under-report. Remove `treeData` and set `gantt.parentField` instead."), (i.initialColumnPinning?.left?.length ?? 0) + (i.initialColumnPinning?.right?.length ?? 0) > 0 && i.columnVirtualization !== !1 && o.push("[svgrid] `initialColumnPinning` is set while column virtualization is on (its default), so the pinned columns will not stick - the virtualizer recycles column nodes. Add `columnVirtualization={false}`."), i.externalPagination === !0 && i.rowCount === void 0 && o.push("[svgrid] `externalPagination` is on but `rowCount` is not set, so the pager cannot know how many pages exist. Pass the server total as `rowCount`."), i.externalSort === !0 && !i.onSortingChange && o.push("[svgrid] `externalSort` is on but there is no `onSortingChange` handler, so clicking a header changes nothing - the grid stopped sorting and nobody is listening. Add `onSortingChange` and re-fetch in your handler."), i.externalFilter === !0 && !i.onFiltersChange && o.push("[svgrid] `externalFilter` is on but there is no `onFiltersChange` handler, so filtering the grid changes nothing. Add `onFiltersChange` and re-fetch in your handler."), o;
|
|
55
|
-
}
|
|
56
|
-
function a(e, t) {
|
|
57
|
-
let n, r = Infinity;
|
|
58
|
-
for (let i of t) {
|
|
59
|
-
let t = o(e.toLowerCase(), i.toLowerCase());
|
|
60
|
-
t < r && (r = t, n = i);
|
|
61
|
-
}
|
|
62
|
-
let i = Math.min(3, Math.floor(e.length / 3) + 1);
|
|
63
|
-
return r <= i ? n : void 0;
|
|
64
|
-
}
|
|
65
|
-
function o(e, t) {
|
|
66
|
-
if (e === t) return 0;
|
|
67
|
-
let n = Array(t.length + 1);
|
|
68
|
-
for (let e = 0; e <= t.length; e++) n[e] = e;
|
|
69
|
-
for (let r = 1; r <= e.length; r++) {
|
|
70
|
-
let i = n[0];
|
|
71
|
-
n[0] = r;
|
|
72
|
-
for (let a = 1; a <= t.length; a++) {
|
|
73
|
-
let o = Math.min(n[a] + 1, n[a - 1] + 1, i + (e[r - 1] === t[a - 1] ? 0 : 1));
|
|
74
|
-
i = n[a], n[a] = o;
|
|
75
|
-
}
|
|
76
|
-
}
|
|
77
|
-
return n[t.length];
|
|
78
|
-
}
|
|
79
|
-
//#endregion
|
|
80
|
-
export { i as validateGridConfig };
|
|
File without changes
|