ods-component-lib 1.23.2 → 1.23.3
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/dist/components/devextreme/DataGrid/hooks/useBodyClasses.js +1 -1
- package/dist/components/devextreme/OdsBasicDataGrid/OdsBasicDataGrid.js +7 -7
- package/dist/components/devextreme/OdsDataGrid.Legacy.js +3 -3
- package/dist/components/devextreme/OdsRemoteDataGrid.js +1 -1
- package/dist/index.js +5 -5
- package/dist/node_modules/canvg/lib/index.es.js +84 -84
- package/dist/node_modules/canvg/lib/index.es.js.map +1 -1
- package/dist/node_modules/core-js/internals/advance-string-index.js +1 -1
- package/dist/node_modules/core-js/internals/advance-string-index.js.map +1 -1
- package/dist/node_modules/core-js/internals/environment-is-ios.js +5 -5
- package/dist/node_modules/core-js/internals/environment-is-ios.js.map +1 -1
- package/dist/node_modules/core-js/internals/function-bind-native.js +2 -2
- package/dist/node_modules/core-js/internals/function-bind-native.js.map +1 -1
- package/dist/node_modules/core-js/internals/function-name.js +2 -2
- package/dist/node_modules/core-js/internals/function-name.js.map +1 -1
- package/dist/node_modules/core-js/internals/iterate.js +38 -35
- package/dist/node_modules/core-js/internals/iterate.js.map +1 -1
- package/dist/node_modules/core-js/internals/regexp-exec.js +29 -20
- package/dist/node_modules/core-js/internals/regexp-exec.js.map +1 -1
- package/dist/node_modules/core-js/internals/shared-store.js +8 -8
- package/dist/node_modules/core-js/internals/shared-store.js.map +1 -1
- package/dist/node_modules/core-js/modules/es.string.ends-with.js +2 -2
- package/dist/node_modules/core-js/modules/es.string.ends-with.js.map +1 -1
- package/dist/node_modules/core-js/modules/es.string.match.js +12 -12
- package/dist/node_modules/core-js/modules/es.string.match.js.map +1 -1
- package/dist/node_modules/core-js/modules/es.string.replace.js +33 -33
- package/dist/node_modules/core-js/modules/es.string.replace.js.map +1 -1
- package/dist/node_modules/core-js/modules/es.string.split.js +55 -52
- package/dist/node_modules/core-js/modules/es.string.split.js.map +1 -1
- package/dist/node_modules/core-js/modules/es.string.starts-with.js +2 -2
- package/dist/node_modules/core-js/modules/es.string.starts-with.js.map +1 -1
- package/dist/node_modules/dompurify/dist/purify.es.js +223 -217
- package/dist/node_modules/dompurify/dist/purify.es.js.map +1 -1
- package/dist/node_modules/fflate/esm/browser.js +335 -295
- package/dist/node_modules/fflate/esm/browser.js.map +1 -1
- package/dist/node_modules/jspdf/dist/jspdf.es.min.js +1781 -1771
- package/dist/node_modules/jspdf/dist/jspdf.es.min.js.map +1 -1
- package/dist/node_modules/lodash/lodash.js +1169 -1154
- package/dist/node_modules/lodash/lodash.js.map +1 -1
- package/dist/node_modules/uuid/dist/esm-browser/native.js +7 -0
- package/dist/node_modules/uuid/dist/esm-browser/native.js.map +1 -0
- package/dist/node_modules/uuid/dist/esm-browser/rng.js +3 -2
- package/dist/node_modules/uuid/dist/esm-browser/rng.js.map +1 -1
- package/dist/node_modules/uuid/dist/esm-browser/stringify.js +6 -10
- package/dist/node_modules/uuid/dist/esm-browser/stringify.js.map +1 -1
- package/dist/node_modules/uuid/dist/esm-browser/v4.js +9 -6
- package/dist/node_modules/uuid/dist/esm-browser/v4.js.map +1 -1
- package/dist/providers/OdsConfigProvider.js +6 -7
- package/package.json +3 -3
- package/dist/node_modules/uuid/dist/esm-browser/regex.js +0 -5
- package/dist/node_modules/uuid/dist/esm-browser/regex.js.map +0 -1
- package/dist/node_modules/uuid/dist/esm-browser/validate.js +0 -8
- package/dist/node_modules/uuid/dist/esm-browser/validate.js.map +0 -1
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
var
|
|
1
|
+
var q = Uint8Array, J = Uint16Array, kr = Int32Array, lr = new q([
|
|
2
2
|
0,
|
|
3
3
|
0,
|
|
4
4
|
0,
|
|
@@ -33,7 +33,7 @@ var D = Uint8Array, U = Uint16Array, rr = Uint32Array, nr = new D([
|
|
|
33
33
|
0,
|
|
34
34
|
/* impossible */
|
|
35
35
|
0
|
|
36
|
-
]),
|
|
36
|
+
]), ir = new q([
|
|
37
37
|
0,
|
|
38
38
|
0,
|
|
39
39
|
0,
|
|
@@ -67,368 +67,408 @@ var D = Uint8Array, U = Uint16Array, rr = Uint32Array, nr = new D([
|
|
|
67
67
|
/* unused */
|
|
68
68
|
0,
|
|
69
69
|
0
|
|
70
|
-
]),
|
|
71
|
-
for (var
|
|
72
|
-
|
|
73
|
-
for (var f = new
|
|
74
|
-
for (var
|
|
75
|
-
f[
|
|
76
|
-
return
|
|
77
|
-
},
|
|
78
|
-
|
|
79
|
-
var
|
|
70
|
+
]), gr = new q([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Tr = function(r, a) {
|
|
71
|
+
for (var n = new J(31), e = 0; e < 31; ++e)
|
|
72
|
+
n[e] = a += 1 << r[e - 1];
|
|
73
|
+
for (var f = new kr(n[30]), e = 1; e < 30; ++e)
|
|
74
|
+
for (var l = n[e]; l < n[e + 1]; ++l)
|
|
75
|
+
f[l] = l - n[e] << 5 | e;
|
|
76
|
+
return { b: n, r: f };
|
|
77
|
+
}, Sr = Tr(lr, 2), Cr = Sr.b, Mr = Sr.r;
|
|
78
|
+
Cr[28] = 258, Mr[258] = 28;
|
|
79
|
+
var Er = Tr(ir, 0), Dr = Er.b, yr = Er.r, xr = new J(32768);
|
|
80
80
|
for (var t = 0; t < 32768; ++t) {
|
|
81
|
-
var
|
|
82
|
-
|
|
81
|
+
var j = (t & 43690) >> 1 | (t & 21845) << 1;
|
|
82
|
+
j = (j & 52428) >> 2 | (j & 13107) << 2, j = (j & 61680) >> 4 | (j & 3855) << 4, xr[t] = ((j & 65280) >> 8 | (j & 255) << 8) >> 1;
|
|
83
83
|
}
|
|
84
|
-
var Y = (function(r, a,
|
|
85
|
-
for (var
|
|
86
|
-
++
|
|
87
|
-
var
|
|
88
|
-
for (f =
|
|
89
|
-
|
|
90
|
-
var
|
|
91
|
-
if (
|
|
92
|
-
|
|
93
|
-
var
|
|
94
|
-
for (f = 0; f <
|
|
84
|
+
var Y = (function(r, a, n) {
|
|
85
|
+
for (var e = r.length, f = 0, l = new J(a); f < e; ++f)
|
|
86
|
+
r[f] && ++l[r[f] - 1];
|
|
87
|
+
var i = new J(a);
|
|
88
|
+
for (f = 1; f < a; ++f)
|
|
89
|
+
i[f] = i[f - 1] + l[f - 1] << 1;
|
|
90
|
+
var h;
|
|
91
|
+
if (n) {
|
|
92
|
+
h = new J(1 << a);
|
|
93
|
+
var g = 15 - a;
|
|
94
|
+
for (f = 0; f < e; ++f)
|
|
95
95
|
if (r[f])
|
|
96
|
-
for (var
|
|
97
|
-
|
|
96
|
+
for (var M = f << 4 | r[f], v = a - r[f], u = i[r[f] - 1]++ << v, b = u | (1 << v) - 1; u <= b; ++u)
|
|
97
|
+
h[xr[u] >> g] = M;
|
|
98
98
|
} else
|
|
99
|
-
for (
|
|
100
|
-
|
|
101
|
-
return
|
|
102
|
-
}),
|
|
99
|
+
for (h = new J(e), f = 0; f < e; ++f)
|
|
100
|
+
r[f] && (h[f] = xr[i[r[f] - 1]++] >> 15 - r[f]);
|
|
101
|
+
return h;
|
|
102
|
+
}), L = new q(288);
|
|
103
103
|
for (var t = 0; t < 144; ++t)
|
|
104
|
-
|
|
104
|
+
L[t] = 8;
|
|
105
105
|
for (var t = 144; t < 256; ++t)
|
|
106
|
-
|
|
106
|
+
L[t] = 9;
|
|
107
107
|
for (var t = 256; t < 280; ++t)
|
|
108
|
-
|
|
108
|
+
L[t] = 7;
|
|
109
109
|
for (var t = 280; t < 288; ++t)
|
|
110
|
-
|
|
111
|
-
var
|
|
110
|
+
L[t] = 8;
|
|
111
|
+
var fr = new q(32);
|
|
112
112
|
for (var t = 0; t < 32; ++t)
|
|
113
|
-
|
|
114
|
-
var
|
|
115
|
-
for (var a = r[0],
|
|
116
|
-
r[
|
|
113
|
+
fr[t] = 5;
|
|
114
|
+
var Gr = /* @__PURE__ */ Y(L, 9, 0), Hr = /* @__PURE__ */ Y(L, 9, 1), Jr = /* @__PURE__ */ Y(fr, 5, 0), Kr = /* @__PURE__ */ Y(fr, 5, 1), hr = function(r) {
|
|
115
|
+
for (var a = r[0], n = 1; n < r.length; ++n)
|
|
116
|
+
r[n] > a && (a = r[n]);
|
|
117
117
|
return a;
|
|
118
|
-
},
|
|
119
|
-
var
|
|
120
|
-
return (r[
|
|
121
|
-
},
|
|
122
|
-
var
|
|
123
|
-
return (r[
|
|
124
|
-
},
|
|
125
|
-
return (r / 8
|
|
126
|
-
},
|
|
127
|
-
(
|
|
128
|
-
|
|
129
|
-
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
|
|
136
|
-
|
|
137
|
-
|
|
118
|
+
}, R = function(r, a, n) {
|
|
119
|
+
var e = a / 8 | 0;
|
|
120
|
+
return (r[e] | r[e + 1] << 8) >> (a & 7) & n;
|
|
121
|
+
}, wr = function(r, a) {
|
|
122
|
+
var n = a / 8 | 0;
|
|
123
|
+
return (r[n] | r[n + 1] << 8 | r[n + 2] << 16) >> (a & 7);
|
|
124
|
+
}, Fr = function(r) {
|
|
125
|
+
return (r + 7) / 8 | 0;
|
|
126
|
+
}, Ur = function(r, a, n) {
|
|
127
|
+
return (n == null || n > r.length) && (n = r.length), new q(r.subarray(a, n));
|
|
128
|
+
}, Nr = [
|
|
129
|
+
"unexpected EOF",
|
|
130
|
+
"invalid block type",
|
|
131
|
+
"invalid length/literal",
|
|
132
|
+
"invalid distance",
|
|
133
|
+
"stream finished",
|
|
134
|
+
"no stream handler",
|
|
135
|
+
,
|
|
136
|
+
"no callback",
|
|
137
|
+
"invalid UTF-8 data",
|
|
138
|
+
"extra field too long",
|
|
139
|
+
"date not in range 1980-2099",
|
|
140
|
+
"filename too long",
|
|
141
|
+
"stream finishing",
|
|
142
|
+
"invalid zip data"
|
|
143
|
+
// determined by unknown compression method
|
|
144
|
+
], V = function(r, a, n) {
|
|
145
|
+
var e = new Error(a || Nr[r]);
|
|
146
|
+
if (e.code = r, Error.captureStackTrace && Error.captureStackTrace(e, V), !n)
|
|
147
|
+
throw e;
|
|
148
|
+
return e;
|
|
149
|
+
}, Pr = function(r, a, n, e) {
|
|
150
|
+
var f = r.length, l = 0;
|
|
151
|
+
if (!f || a.f && !a.l)
|
|
152
|
+
return n || new q(0);
|
|
153
|
+
var i = !n, h = i || a.i != 2;
|
|
154
|
+
i && (n = new q(f * 3));
|
|
155
|
+
var g = function(rr) {
|
|
156
|
+
var ar = n.length;
|
|
157
|
+
if (rr > ar) {
|
|
158
|
+
var nr = new q(Math.max(ar * 2, rr));
|
|
159
|
+
nr.set(n), n = nr;
|
|
138
160
|
}
|
|
139
|
-
},
|
|
161
|
+
}, M = a.f || 0, v = a.p || 0, u = a.b || 0, b = a.l, k = a.d, S = a.m, x = a.n, K = f * 8;
|
|
140
162
|
do {
|
|
141
|
-
if (!
|
|
142
|
-
|
|
143
|
-
var
|
|
144
|
-
if (
|
|
145
|
-
if (
|
|
146
|
-
|
|
147
|
-
else if (
|
|
148
|
-
var
|
|
149
|
-
|
|
150
|
-
for (var
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
var
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
var E = j[Q(r, l, B)];
|
|
158
|
-
l += E & 15;
|
|
159
|
-
var F = E >>> 4;
|
|
163
|
+
if (!b) {
|
|
164
|
+
M = R(r, v, 1);
|
|
165
|
+
var P = R(r, v + 1, 3);
|
|
166
|
+
if (v += 3, P)
|
|
167
|
+
if (P == 1)
|
|
168
|
+
b = Hr, k = Kr, S = 9, x = 5;
|
|
169
|
+
else if (P == 2) {
|
|
170
|
+
var E = R(r, v, 31) + 257, D = R(r, v + 10, 15) + 4, C = E + R(r, v + 5, 31) + 1;
|
|
171
|
+
v += 14;
|
|
172
|
+
for (var c = new q(C), o = new q(19), w = 0; w < D; ++w)
|
|
173
|
+
o[gr[w]] = R(r, v + w * 3, 7);
|
|
174
|
+
v += D * 3;
|
|
175
|
+
for (var Z = hr(o), I = (1 << Z) - 1, _ = Y(o, Z, 1), w = 0; w < C; ) {
|
|
176
|
+
var G = _[R(r, v, I)];
|
|
177
|
+
v += G & 15;
|
|
178
|
+
var F = G >> 4;
|
|
160
179
|
if (F < 16)
|
|
161
|
-
|
|
180
|
+
c[w++] = F;
|
|
162
181
|
else {
|
|
163
|
-
var
|
|
164
|
-
for (F == 16 ? (O = 3 +
|
|
165
|
-
|
|
182
|
+
var T = 0, O = 0;
|
|
183
|
+
for (F == 16 ? (O = 3 + R(r, v, 3), v += 2, T = c[w - 1]) : F == 17 ? (O = 3 + R(r, v, 7), v += 3) : F == 18 && (O = 11 + R(r, v, 127), v += 7); O--; )
|
|
184
|
+
c[w++] = T;
|
|
166
185
|
}
|
|
167
186
|
}
|
|
168
|
-
var
|
|
169
|
-
|
|
187
|
+
var y = c.subarray(0, E), z = c.subarray(E);
|
|
188
|
+
S = hr(y), x = hr(z), b = Y(y, S, 1), k = Y(z, x, 1);
|
|
170
189
|
} else
|
|
171
|
-
|
|
190
|
+
V(1);
|
|
172
191
|
else {
|
|
173
|
-
var F =
|
|
174
|
-
if (
|
|
175
|
-
|
|
176
|
-
throw "unexpected EOF";
|
|
192
|
+
var F = Fr(v) + 4, Q = r[F - 4] | r[F - 3] << 8, B = F + Q;
|
|
193
|
+
if (B > f) {
|
|
194
|
+
V(0);
|
|
177
195
|
break;
|
|
178
196
|
}
|
|
179
|
-
|
|
197
|
+
h && g(u + Q), n.set(r.subarray(F, B), u), a.b = u += Q, a.p = v = B * 8, a.f = M;
|
|
180
198
|
continue;
|
|
181
199
|
}
|
|
182
|
-
if (
|
|
183
|
-
|
|
200
|
+
if (v > K) {
|
|
201
|
+
V(0);
|
|
202
|
+
break;
|
|
203
|
+
}
|
|
184
204
|
}
|
|
185
|
-
|
|
186
|
-
for (var
|
|
187
|
-
var
|
|
188
|
-
if (
|
|
189
|
-
|
|
190
|
-
|
|
191
|
-
|
|
192
|
-
if (
|
|
193
|
-
|
|
194
|
-
else if (
|
|
195
|
-
|
|
205
|
+
h && g(u + 131072);
|
|
206
|
+
for (var W = (1 << S) - 1, p = (1 << x) - 1, H = v; ; H = v) {
|
|
207
|
+
var T = b[wr(r, v) & W], N = T >> 4;
|
|
208
|
+
if (v += T & 15, v > K) {
|
|
209
|
+
V(0);
|
|
210
|
+
break;
|
|
211
|
+
}
|
|
212
|
+
if (T || V(2), N < 256)
|
|
213
|
+
n[u++] = N;
|
|
214
|
+
else if (N == 256) {
|
|
215
|
+
H = v, b = null;
|
|
196
216
|
break;
|
|
197
217
|
} else {
|
|
198
|
-
var
|
|
199
|
-
if (
|
|
200
|
-
var
|
|
201
|
-
|
|
218
|
+
var $ = N - 254;
|
|
219
|
+
if (N > 264) {
|
|
220
|
+
var w = N - 257, U = lr[w];
|
|
221
|
+
$ = R(r, v, (1 << U) - 1) + Cr[w], v += U;
|
|
222
|
+
}
|
|
223
|
+
var A = k[wr(r, v) & p], X = A >> 4;
|
|
224
|
+
A || V(3), v += A & 15;
|
|
225
|
+
var z = Dr[X];
|
|
226
|
+
if (X > 3) {
|
|
227
|
+
var U = ir[X];
|
|
228
|
+
z += wr(r, v) & (1 << U) - 1, v += U;
|
|
229
|
+
}
|
|
230
|
+
if (v > K) {
|
|
231
|
+
V(0);
|
|
232
|
+
break;
|
|
202
233
|
}
|
|
203
|
-
|
|
204
|
-
|
|
205
|
-
|
|
206
|
-
|
|
207
|
-
|
|
208
|
-
|
|
209
|
-
var P = er[y];
|
|
210
|
-
x += lr(r, l) & (1 << P) - 1, l += P;
|
|
234
|
+
h && g(u + 131072);
|
|
235
|
+
var d = u + $;
|
|
236
|
+
if (u < z) {
|
|
237
|
+
var m = l - z, or = Math.min(z, d);
|
|
238
|
+
for (m + u < 0 && V(3); u < or; ++u)
|
|
239
|
+
n[u] = e[m + u];
|
|
211
240
|
}
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
f && h(w + 131072);
|
|
215
|
-
for (var S = w + I; w < S; w += 4)
|
|
216
|
-
a[w] = a[w - x], a[w + 1] = a[w + 1 - x], a[w + 2] = a[w + 2 - x], a[w + 3] = a[w + 3 - x];
|
|
217
|
-
w = S;
|
|
241
|
+
for (; u < d; ++u)
|
|
242
|
+
n[u] = n[u - z];
|
|
218
243
|
}
|
|
219
244
|
}
|
|
220
|
-
|
|
221
|
-
} while (!
|
|
222
|
-
return
|
|
223
|
-
},
|
|
224
|
-
|
|
225
|
-
var
|
|
226
|
-
r[
|
|
227
|
-
},
|
|
228
|
-
|
|
229
|
-
var
|
|
230
|
-
r[
|
|
231
|
-
},
|
|
232
|
-
for (var
|
|
233
|
-
r[
|
|
234
|
-
var f =
|
|
245
|
+
a.l = b, a.p = H, a.b = u, a.f = M, b && (M = 1, a.m = S, a.d = k, a.n = x);
|
|
246
|
+
} while (!M);
|
|
247
|
+
return u != n.length && i ? Ur(n, 0, u) : n.subarray(0, u);
|
|
248
|
+
}, s = function(r, a, n) {
|
|
249
|
+
n <<= a & 7;
|
|
250
|
+
var e = a / 8 | 0;
|
|
251
|
+
r[e] |= n, r[e + 1] |= n >> 8;
|
|
252
|
+
}, er = function(r, a, n) {
|
|
253
|
+
n <<= a & 7;
|
|
254
|
+
var e = a / 8 | 0;
|
|
255
|
+
r[e] |= n, r[e + 1] |= n >> 8, r[e + 2] |= n >> 16;
|
|
256
|
+
}, tr = function(r, a) {
|
|
257
|
+
for (var n = [], e = 0; e < r.length; ++e)
|
|
258
|
+
r[e] && n.push({ s: e, f: r[e] });
|
|
259
|
+
var f = n.length, l = n.slice();
|
|
235
260
|
if (!f)
|
|
236
|
-
return
|
|
261
|
+
return { t: Br, l: 0 };
|
|
237
262
|
if (f == 1) {
|
|
238
|
-
var
|
|
239
|
-
return
|
|
263
|
+
var i = new q(n[0].s + 1);
|
|
264
|
+
return i[n[0].s] = 1, { t: i, l: 1 };
|
|
240
265
|
}
|
|
241
|
-
|
|
242
|
-
return
|
|
243
|
-
}),
|
|
244
|
-
var
|
|
245
|
-
for (
|
|
246
|
-
|
|
247
|
-
for (var
|
|
248
|
-
|
|
249
|
-
var
|
|
250
|
-
if (
|
|
251
|
-
var
|
|
252
|
-
for (
|
|
253
|
-
return
|
|
254
|
-
});
|
|
255
|
-
var
|
|
256
|
-
if (
|
|
257
|
-
|
|
266
|
+
n.sort(function(E, D) {
|
|
267
|
+
return E.f - D.f;
|
|
268
|
+
}), n.push({ s: -1, f: 25001 });
|
|
269
|
+
var h = n[0], g = n[1], M = 0, v = 1, u = 2;
|
|
270
|
+
for (n[0] = { s: -1, f: h.f + g.f, l: h, r: g }; v != f - 1; )
|
|
271
|
+
h = n[n[M].f < n[u].f ? M++ : u++], g = n[M != v && n[M].f < n[u].f ? M++ : u++], n[v++] = { s: -1, f: h.f + g.f, l: h, r: g };
|
|
272
|
+
for (var b = l[0].s, e = 1; e < f; ++e)
|
|
273
|
+
l[e].s > b && (b = l[e].s);
|
|
274
|
+
var k = new J(b + 1), S = br(n[v - 1], k, 0);
|
|
275
|
+
if (S > a) {
|
|
276
|
+
var e = 0, x = 0, K = S - a, P = 1 << K;
|
|
277
|
+
for (l.sort(function(D, C) {
|
|
278
|
+
return k[C.s] - k[D.s] || D.f - C.f;
|
|
279
|
+
}); e < f; ++e) {
|
|
280
|
+
var F = l[e].s;
|
|
281
|
+
if (k[F] > a)
|
|
282
|
+
x += P - (1 << S - k[F]), k[F] = a;
|
|
258
283
|
else
|
|
259
284
|
break;
|
|
260
285
|
}
|
|
261
|
-
for (
|
|
262
|
-
var
|
|
263
|
-
|
|
286
|
+
for (x >>= K; x > 0; ) {
|
|
287
|
+
var Q = l[e].s;
|
|
288
|
+
k[Q] < a ? x -= 1 << a - k[Q]++ - 1 : ++e;
|
|
264
289
|
}
|
|
265
|
-
for (;
|
|
266
|
-
var
|
|
267
|
-
|
|
290
|
+
for (; e >= 0 && x; --e) {
|
|
291
|
+
var B = l[e].s;
|
|
292
|
+
k[B] == a && (--k[B], ++x);
|
|
268
293
|
}
|
|
269
|
-
|
|
294
|
+
S = a;
|
|
270
295
|
}
|
|
271
|
-
return
|
|
272
|
-
},
|
|
273
|
-
return r.s == -1 ? Math.max(
|
|
274
|
-
},
|
|
296
|
+
return { t: new q(k), l: S };
|
|
297
|
+
}, br = function(r, a, n) {
|
|
298
|
+
return r.s == -1 ? Math.max(br(r.l, a, n + 1), br(r.r, a, n + 1)) : a[r.s] = n;
|
|
299
|
+
}, zr = function(r) {
|
|
275
300
|
for (var a = r.length; a && !r[--a]; )
|
|
276
301
|
;
|
|
277
|
-
for (var
|
|
278
|
-
|
|
279
|
-
},
|
|
280
|
-
if (r[
|
|
281
|
-
++
|
|
302
|
+
for (var n = new J(++a), e = 0, f = r[0], l = 1, i = function(g) {
|
|
303
|
+
n[e++] = g;
|
|
304
|
+
}, h = 1; h <= a; ++h)
|
|
305
|
+
if (r[h] == f && h != a)
|
|
306
|
+
++l;
|
|
282
307
|
else {
|
|
283
|
-
if (!f &&
|
|
284
|
-
for (;
|
|
285
|
-
|
|
286
|
-
|
|
287
|
-
} else if (
|
|
288
|
-
for (
|
|
289
|
-
|
|
290
|
-
|
|
308
|
+
if (!f && l > 2) {
|
|
309
|
+
for (; l > 138; l -= 138)
|
|
310
|
+
i(32754);
|
|
311
|
+
l > 2 && (i(l > 10 ? l - 11 << 5 | 28690 : l - 3 << 5 | 12305), l = 0);
|
|
312
|
+
} else if (l > 3) {
|
|
313
|
+
for (i(f), --l; l > 6; l -= 6)
|
|
314
|
+
i(8304);
|
|
315
|
+
l > 2 && (i(l - 3 << 5 | 8208), l = 0);
|
|
291
316
|
}
|
|
292
|
-
for (;
|
|
293
|
-
|
|
294
|
-
|
|
317
|
+
for (; l--; )
|
|
318
|
+
i(f);
|
|
319
|
+
l = 1, f = r[h];
|
|
295
320
|
}
|
|
296
|
-
return
|
|
297
|
-
},
|
|
298
|
-
for (var
|
|
299
|
-
|
|
300
|
-
return
|
|
301
|
-
},
|
|
302
|
-
var
|
|
303
|
-
r[f] =
|
|
304
|
-
for (var
|
|
305
|
-
r[f +
|
|
306
|
-
return (f + 4 +
|
|
307
|
-
}, Ar = function(r, a,
|
|
308
|
-
|
|
309
|
-
for (var
|
|
310
|
-
|
|
311
|
-
for (var
|
|
312
|
-
|
|
313
|
-
for (var
|
|
321
|
+
return { c: n.subarray(0, e), n: a };
|
|
322
|
+
}, vr = function(r, a) {
|
|
323
|
+
for (var n = 0, e = 0; e < a.length; ++e)
|
|
324
|
+
n += r[e] * a[e];
|
|
325
|
+
return n;
|
|
326
|
+
}, qr = function(r, a, n) {
|
|
327
|
+
var e = n.length, f = Fr(a + 2);
|
|
328
|
+
r[f] = e & 255, r[f + 1] = e >> 8, r[f + 2] = r[f] ^ 255, r[f + 3] = r[f + 1] ^ 255;
|
|
329
|
+
for (var l = 0; l < e; ++l)
|
|
330
|
+
r[f + l + 4] = n[l];
|
|
331
|
+
return (f + 4 + e) * 8;
|
|
332
|
+
}, Ar = function(r, a, n, e, f, l, i, h, g, M, v) {
|
|
333
|
+
s(a, v++, n), ++f[256];
|
|
334
|
+
for (var u = tr(f, 15), b = u.t, k = u.l, S = tr(l, 15), x = S.t, K = S.l, P = zr(b), F = P.c, Q = P.n, B = zr(x), E = B.c, D = B.n, C = new J(19), c = 0; c < F.length; ++c)
|
|
335
|
+
++C[F[c] & 31];
|
|
336
|
+
for (var c = 0; c < E.length; ++c)
|
|
337
|
+
++C[E[c] & 31];
|
|
338
|
+
for (var o = tr(C, 7), w = o.t, Z = o.l, I = 19; I > 4 && !w[gr[I - 1]]; --I)
|
|
314
339
|
;
|
|
315
|
-
var
|
|
316
|
-
if (
|
|
317
|
-
return
|
|
318
|
-
var
|
|
319
|
-
if (
|
|
320
|
-
|
|
321
|
-
var
|
|
322
|
-
|
|
323
|
-
for (var
|
|
324
|
-
|
|
325
|
-
|
|
326
|
-
for (var
|
|
327
|
-
for (var
|
|
328
|
-
var
|
|
329
|
-
|
|
340
|
+
var _ = M + 5 << 3, G = vr(f, L) + vr(l, fr) + i, T = vr(f, b) + vr(l, x) + i + 14 + 3 * I + vr(C, w) + 2 * C[16] + 3 * C[17] + 7 * C[18];
|
|
341
|
+
if (g >= 0 && _ <= G && _ <= T)
|
|
342
|
+
return qr(a, v, r.subarray(g, g + M));
|
|
343
|
+
var O, y, z, W;
|
|
344
|
+
if (s(a, v, 1 + (T < G)), v += 2, T < G) {
|
|
345
|
+
O = Y(b, k, 0), y = b, z = Y(x, K, 0), W = x;
|
|
346
|
+
var p = Y(w, Z, 0);
|
|
347
|
+
s(a, v, Q - 257), s(a, v + 5, D - 1), s(a, v + 10, I - 4), v += 14;
|
|
348
|
+
for (var c = 0; c < I; ++c)
|
|
349
|
+
s(a, v + 3 * c, w[gr[c]]);
|
|
350
|
+
v += 3 * I;
|
|
351
|
+
for (var H = [F, E], N = 0; N < 2; ++N)
|
|
352
|
+
for (var $ = H[N], c = 0; c < $.length; ++c) {
|
|
353
|
+
var U = $[c] & 31;
|
|
354
|
+
s(a, v, p[U]), v += w[U], U > 15 && (s(a, v, $[c] >> 5 & 127), v += $[c] >> 12);
|
|
330
355
|
}
|
|
331
356
|
} else
|
|
332
|
-
|
|
333
|
-
for (var
|
|
334
|
-
|
|
335
|
-
|
|
336
|
-
|
|
337
|
-
|
|
338
|
-
|
|
357
|
+
O = Gr, y = L, z = Jr, W = fr;
|
|
358
|
+
for (var c = 0; c < h; ++c) {
|
|
359
|
+
var A = e[c];
|
|
360
|
+
if (A > 255) {
|
|
361
|
+
var U = A >> 18 & 31;
|
|
362
|
+
er(a, v, O[U + 257]), v += y[U + 257], U > 7 && (s(a, v, A >> 23 & 31), v += lr[U]);
|
|
363
|
+
var X = A & 31;
|
|
364
|
+
er(a, v, z[X]), v += W[X], X > 3 && (er(a, v, A >> 5 & 8191), v += ir[X]);
|
|
339
365
|
} else
|
|
340
|
-
|
|
341
|
-
|
|
342
|
-
|
|
343
|
-
|
|
344
|
-
|
|
345
|
-
|
|
346
|
-
|
|
347
|
-
|
|
348
|
-
|
|
349
|
-
|
|
350
|
-
|
|
351
|
-
|
|
352
|
-
|
|
353
|
-
|
|
354
|
-
|
|
355
|
-
|
|
356
|
-
|
|
357
|
-
|
|
358
|
-
|
|
359
|
-
z[k] = 0;
|
|
360
|
-
for (var k = 0; k < 30; ++k)
|
|
361
|
-
s[k] = 0;
|
|
366
|
+
er(a, v, O[A]), v += y[A];
|
|
367
|
+
}
|
|
368
|
+
return er(a, v, O[256]), v + y[256];
|
|
369
|
+
}, Qr = /* @__PURE__ */ new kr([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]), Br = /* @__PURE__ */ new q(0), Rr = function(r, a, n, e, f, l) {
|
|
370
|
+
var i = l.z || r.length, h = new q(e + i + 5 * (1 + Math.ceil(i / 7e3)) + f), g = h.subarray(e, h.length - f), M = l.l, v = (l.r || 0) & 7;
|
|
371
|
+
if (a) {
|
|
372
|
+
v && (g[0] = l.r >> 3);
|
|
373
|
+
for (var u = Qr[a - 1], b = u >> 13, k = u & 8191, S = (1 << n) - 1, x = l.p || new J(32768), K = l.h || new J(S + 1), P = Math.ceil(n / 3), F = 2 * P, Q = function(cr) {
|
|
374
|
+
return (r[cr] ^ r[cr + 1] << P ^ r[cr + 2] << F) & S;
|
|
375
|
+
}, B = new kr(25e3), E = new J(288), D = new J(32), C = 0, c = 0, o = l.i || 0, w = 0, Z = l.w || 0, I = 0; o + 2 < i; ++o) {
|
|
376
|
+
var _ = Q(o), G = o & 32767, T = K[_];
|
|
377
|
+
if (x[G] = T, K[_] = G, Z <= o) {
|
|
378
|
+
var O = i - o;
|
|
379
|
+
if ((C > 7e3 || w > 24576) && (O > 423 || !M)) {
|
|
380
|
+
v = Ar(r, g, 0, B, E, D, c, w, I, o - I, v), w = C = c = 0, I = o;
|
|
381
|
+
for (var y = 0; y < 286; ++y)
|
|
382
|
+
E[y] = 0;
|
|
383
|
+
for (var y = 0; y < 30; ++y)
|
|
384
|
+
D[y] = 0;
|
|
362
385
|
}
|
|
363
|
-
var
|
|
364
|
-
if (
|
|
365
|
-
for (var
|
|
366
|
-
if (r[
|
|
367
|
-
for (var
|
|
386
|
+
var z = 2, W = 0, p = k, H = G - T & 32767;
|
|
387
|
+
if (O > 2 && _ == Q(o - H))
|
|
388
|
+
for (var N = Math.min(b, O) - 1, $ = Math.min(32767, o), U = Math.min(258, O); H <= $ && --p && G != T; ) {
|
|
389
|
+
if (r[o + z] == r[o + z - H]) {
|
|
390
|
+
for (var A = 0; A < U && r[o + A] == r[o + A - H]; ++A)
|
|
368
391
|
;
|
|
369
|
-
if (
|
|
370
|
-
if (
|
|
392
|
+
if (A > z) {
|
|
393
|
+
if (z = A, W = H, A > N)
|
|
371
394
|
break;
|
|
372
|
-
for (var
|
|
373
|
-
var
|
|
374
|
-
|
|
395
|
+
for (var X = Math.min(H, A - 2), d = 0, y = 0; y < X; ++y) {
|
|
396
|
+
var m = o - H + y & 32767, or = x[m], rr = m - or & 32767;
|
|
397
|
+
rr > d && (d = rr, T = m);
|
|
375
398
|
}
|
|
376
399
|
}
|
|
377
400
|
}
|
|
378
|
-
|
|
401
|
+
G = T, T = x[G], H += G - T & 32767;
|
|
379
402
|
}
|
|
380
|
-
if (
|
|
381
|
-
|
|
382
|
-
var
|
|
383
|
-
|
|
403
|
+
if (W) {
|
|
404
|
+
B[w++] = 268435456 | Mr[z] << 18 | yr[W];
|
|
405
|
+
var ar = Mr[z] & 31, nr = yr[W] & 31;
|
|
406
|
+
c += lr[ar] + ir[nr], ++E[257 + ar], ++D[nr], Z = o + z, ++C;
|
|
384
407
|
} else
|
|
385
|
-
|
|
408
|
+
B[w++] = r[o], ++E[r[o]];
|
|
386
409
|
}
|
|
387
410
|
}
|
|
388
|
-
|
|
411
|
+
for (o = Math.max(o, Z); o < i; ++o)
|
|
412
|
+
B[w++] = r[o], ++E[r[o]];
|
|
413
|
+
v = Ar(r, g, M, B, E, D, c, w, I, o - I, v), M || (l.r = v & 7 | g[v / 8 | 0] << 3, v -= 7, l.h = K, l.p = x, l.i = o, l.w = Z);
|
|
414
|
+
} else {
|
|
415
|
+
for (var o = l.w || 0; o < i + M; o += 65535) {
|
|
416
|
+
var ur = o + 65535;
|
|
417
|
+
ur >= i && (g[v / 8 | 0] = M, ur = i), v = qr(g, v + 1, r.subarray(o, ur));
|
|
418
|
+
}
|
|
419
|
+
l.i = i;
|
|
389
420
|
}
|
|
390
|
-
return
|
|
421
|
+
return Ur(h, 0, e + Fr(v) + f);
|
|
391
422
|
}, Ir = function() {
|
|
392
423
|
var r = 1, a = 0;
|
|
393
424
|
return {
|
|
394
|
-
p: function(
|
|
395
|
-
for (var
|
|
396
|
-
for (var
|
|
397
|
-
|
|
398
|
-
|
|
425
|
+
p: function(n) {
|
|
426
|
+
for (var e = r, f = a, l = n.length | 0, i = 0; i != l; ) {
|
|
427
|
+
for (var h = Math.min(i + 2655, l); i < h; ++i)
|
|
428
|
+
f += e += n[i];
|
|
429
|
+
e = (e & 65535) + 15 * (e >> 16), f = (f & 65535) + 15 * (f >> 16);
|
|
399
430
|
}
|
|
400
|
-
r =
|
|
431
|
+
r = e, a = f;
|
|
401
432
|
},
|
|
402
433
|
d: function() {
|
|
403
|
-
return
|
|
434
|
+
return r %= 65521, a %= 65521, (r & 255) << 24 | (r & 65280) << 8 | (a & 255) << 8 | a >> 8;
|
|
404
435
|
}
|
|
405
436
|
};
|
|
406
|
-
},
|
|
407
|
-
|
|
408
|
-
|
|
409
|
-
|
|
410
|
-
|
|
411
|
-
|
|
412
|
-
|
|
413
|
-
|
|
414
|
-
|
|
415
|
-
|
|
416
|
-
|
|
417
|
-
if (r[1]
|
|
418
|
-
|
|
437
|
+
}, Vr = function(r, a, n, e, f) {
|
|
438
|
+
if (!f && (f = { l: 1 }, a.dictionary)) {
|
|
439
|
+
var l = a.dictionary.subarray(-32768), i = new q(l.length + r.length);
|
|
440
|
+
i.set(l), i.set(r, l.length), r = i, f.w = l.length;
|
|
441
|
+
}
|
|
442
|
+
return Rr(r, a.level == null ? 6 : a.level, a.mem == null ? f.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(r.length))) * 1.5) : 20 : 12 + a.mem, n, e, f);
|
|
443
|
+
}, Or = function(r, a, n) {
|
|
444
|
+
for (; n; ++a)
|
|
445
|
+
r[a] = n, n >>>= 8;
|
|
446
|
+
}, Wr = function(r, a) {
|
|
447
|
+
var n = a.level, e = n == 0 ? 0 : n < 6 ? 1 : n == 9 ? 3 : 2;
|
|
448
|
+
if (r[0] = 120, r[1] = e << 6 | (a.dictionary && 32), r[1] |= 31 - (r[0] << 8 | r[1]) % 31, a.dictionary) {
|
|
449
|
+
var f = Ir();
|
|
450
|
+
f.p(a.dictionary), Or(r, 2, f.d());
|
|
451
|
+
}
|
|
452
|
+
}, Xr = function(r, a) {
|
|
453
|
+
return ((r[0] & 15) != 8 || r[0] >> 4 > 7 || (r[0] << 8 | r[1]) % 31) && V(6, "invalid zlib data"), (r[1] >> 5 & 1) == 1 && V(6, "invalid zlib data: " + (r[1] & 32 ? "need" : "unexpected") + " dictionary"), (r[1] >> 3 & 4) + 2;
|
|
419
454
|
};
|
|
420
|
-
function
|
|
421
|
-
a
|
|
422
|
-
var
|
|
423
|
-
|
|
424
|
-
var
|
|
425
|
-
return
|
|
455
|
+
function $r(r, a) {
|
|
456
|
+
a || (a = {});
|
|
457
|
+
var n = Ir();
|
|
458
|
+
n.p(r);
|
|
459
|
+
var e = Vr(r, a, a.dictionary ? 6 : 2, 4);
|
|
460
|
+
return Wr(e, a), Or(e, e.length - 4, n.d()), e;
|
|
461
|
+
}
|
|
462
|
+
function sr(r, a) {
|
|
463
|
+
return Pr(r.subarray(Xr(r), -4), { i: 2 }, a, a);
|
|
426
464
|
}
|
|
427
|
-
|
|
428
|
-
|
|
465
|
+
var Yr = typeof TextDecoder < "u" && /* @__PURE__ */ new TextDecoder(), Zr = 0;
|
|
466
|
+
try {
|
|
467
|
+
Yr.decode(Br, { stream: !0 }), Zr = 1;
|
|
468
|
+
} catch {
|
|
429
469
|
}
|
|
430
470
|
export {
|
|
431
|
-
|
|
432
|
-
|
|
471
|
+
sr as unzlibSync,
|
|
472
|
+
$r as zlibSync
|
|
433
473
|
};
|
|
434
474
|
//# sourceMappingURL=browser.js.map
|