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