@shopware-ag/dive 2.0.1-beta.2 → 2.0.1-beta.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/build/chunks/FileTypes-DuVGjbcR.mjs +36 -0
- package/build/chunks/FileTypes-DzVpDu_p.cjs +1 -0
- package/build/chunks/fflate.module-DHdJvhNh.cjs +6 -0
- package/build/chunks/fflate.module-xyO_T3Zm.mjs +602 -0
- package/build/chunks/index-C7Wx_9uY.mjs +33 -0
- package/build/chunks/index-MNP0K5dt.cjs +1 -0
- package/build/chunks/{package-CgUmyOWW.mjs → package-C16N_5TP.mjs} +1 -1
- package/build/chunks/{package-BVRC9JGj.cjs → package-CafekLb8.cjs} +1 -1
- package/build/chunks/parse-error-BFRJyIxM.mjs +14 -0
- package/build/chunks/parse-error-Bd09D_1L.cjs +1 -0
- package/build/dive.cjs +2 -2
- package/build/dive.mjs +61 -46
- package/build/src/index.d.ts +4 -4
- package/build/src/modules/ar/ARSystem.cjs +1 -1
- package/build/src/modules/ar/ARSystem.mjs +2 -2
- package/build/src/modules/asset/exporter/AssetExporter.cjs +24 -24
- package/build/src/modules/asset/exporter/AssetExporter.mjs +4 -3
- package/build/src/modules/asset/loader/AssetLoader.cjs +4 -4
- package/build/src/modules/asset/loader/AssetLoader.mjs +85 -89
- package/build/src/modules/systeminfo/SystemInfo.cjs +1 -1
- package/build/src/modules/systeminfo/SystemInfo.mjs +112 -3
- package/package.json +1 -1
- package/build/chunks/FileTypes-BjZ0rrIV.cjs +0 -1
- package/build/chunks/FileTypes-qgYnI0Jg.mjs +0 -30
- package/build/chunks/SystemInfo-DPAQG-S5.mjs +0 -139
- package/build/chunks/SystemInfo-oX-NNneO.cjs +0 -1
- package/build/chunks/index-C_uFFwT2.mjs +0 -5
- package/build/chunks/index-DAwIH9xh.cjs +0 -1
- package/build/chunks/parse-error-2f5qpXP5.cjs +0 -6
- package/build/chunks/parse-error-DRBVHL9E.mjs +0 -614
|
@@ -1,614 +0,0 @@
|
|
|
1
|
-
/*!
|
|
2
|
-
fflate - fast JavaScript compression/decompression
|
|
3
|
-
<https://101arrowz.github.io/fflate>
|
|
4
|
-
Licensed under MIT. https://github.com/101arrowz/fflate/blob/master/LICENSE
|
|
5
|
-
version 0.8.2
|
|
6
|
-
*/
|
|
7
|
-
var z = Uint8Array, R = Uint16Array, Tr = Int32Array, gr = new z([
|
|
8
|
-
0,
|
|
9
|
-
0,
|
|
10
|
-
0,
|
|
11
|
-
0,
|
|
12
|
-
0,
|
|
13
|
-
0,
|
|
14
|
-
0,
|
|
15
|
-
0,
|
|
16
|
-
1,
|
|
17
|
-
1,
|
|
18
|
-
1,
|
|
19
|
-
1,
|
|
20
|
-
2,
|
|
21
|
-
2,
|
|
22
|
-
2,
|
|
23
|
-
2,
|
|
24
|
-
3,
|
|
25
|
-
3,
|
|
26
|
-
3,
|
|
27
|
-
3,
|
|
28
|
-
4,
|
|
29
|
-
4,
|
|
30
|
-
4,
|
|
31
|
-
4,
|
|
32
|
-
5,
|
|
33
|
-
5,
|
|
34
|
-
5,
|
|
35
|
-
5,
|
|
36
|
-
0,
|
|
37
|
-
/* unused */
|
|
38
|
-
0,
|
|
39
|
-
0,
|
|
40
|
-
/* impossible */
|
|
41
|
-
0
|
|
42
|
-
]), cr = new z([
|
|
43
|
-
0,
|
|
44
|
-
0,
|
|
45
|
-
0,
|
|
46
|
-
0,
|
|
47
|
-
1,
|
|
48
|
-
1,
|
|
49
|
-
2,
|
|
50
|
-
2,
|
|
51
|
-
3,
|
|
52
|
-
3,
|
|
53
|
-
4,
|
|
54
|
-
4,
|
|
55
|
-
5,
|
|
56
|
-
5,
|
|
57
|
-
6,
|
|
58
|
-
6,
|
|
59
|
-
7,
|
|
60
|
-
7,
|
|
61
|
-
8,
|
|
62
|
-
8,
|
|
63
|
-
9,
|
|
64
|
-
9,
|
|
65
|
-
10,
|
|
66
|
-
10,
|
|
67
|
-
11,
|
|
68
|
-
11,
|
|
69
|
-
12,
|
|
70
|
-
12,
|
|
71
|
-
13,
|
|
72
|
-
13,
|
|
73
|
-
/* unused */
|
|
74
|
-
0,
|
|
75
|
-
0
|
|
76
|
-
]), Cr = new z([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Ir = function(r, e) {
|
|
77
|
-
for (var n = new R(31), a = 0; a < 31; ++a)
|
|
78
|
-
n[a] = e += 1 << r[a - 1];
|
|
79
|
-
for (var v = new Tr(n[30]), a = 1; a < 30; ++a)
|
|
80
|
-
for (var f = n[a]; f < n[a + 1]; ++f)
|
|
81
|
-
v[f] = f - n[a] << 5 | a;
|
|
82
|
-
return { b: n, r: v };
|
|
83
|
-
}, Hr = Ir(gr, 2), Or = Hr.b, Fr = Hr.r;
|
|
84
|
-
Or[28] = 258, Fr[258] = 28;
|
|
85
|
-
var Yr = Ir(cr, 0), Qr = Yr.b, mr = Yr.r, Sr = new R(32768);
|
|
86
|
-
for (var C = 0; C < 32768; ++C) {
|
|
87
|
-
var b = (C & 43690) >> 1 | (C & 21845) << 1;
|
|
88
|
-
b = (b & 52428) >> 2 | (b & 13107) << 2, b = (b & 61680) >> 4 | (b & 3855) << 4, Sr[C] = ((b & 65280) >> 8 | (b & 255) << 8) >> 1;
|
|
89
|
-
}
|
|
90
|
-
var j = function(r, e, n) {
|
|
91
|
-
for (var a = r.length, v = 0, f = new R(e); v < a; ++v)
|
|
92
|
-
r[v] && ++f[r[v] - 1];
|
|
93
|
-
var l = new R(e);
|
|
94
|
-
for (v = 1; v < e; ++v)
|
|
95
|
-
l[v] = l[v - 1] + f[v - 1] << 1;
|
|
96
|
-
var u;
|
|
97
|
-
if (n) {
|
|
98
|
-
u = new R(1 << e);
|
|
99
|
-
var t = 15 - e;
|
|
100
|
-
for (v = 0; v < a; ++v)
|
|
101
|
-
if (r[v])
|
|
102
|
-
for (var g = v << 4 | r[v], o = e - r[v], i = l[r[v] - 1]++ << o, h = i | (1 << o) - 1; i <= h; ++i)
|
|
103
|
-
u[Sr[i] >> t] = g;
|
|
104
|
-
} else
|
|
105
|
-
for (u = new R(a), v = 0; v < a; ++v)
|
|
106
|
-
r[v] && (u[v] = Sr[l[r[v] - 1]++] >> 15 - r[v]);
|
|
107
|
-
return u;
|
|
108
|
-
}, d = new z(288);
|
|
109
|
-
for (var C = 0; C < 144; ++C)
|
|
110
|
-
d[C] = 8;
|
|
111
|
-
for (var C = 144; C < 256; ++C)
|
|
112
|
-
d[C] = 9;
|
|
113
|
-
for (var C = 256; C < 280; ++C)
|
|
114
|
-
d[C] = 7;
|
|
115
|
-
for (var C = 280; C < 288; ++C)
|
|
116
|
-
d[C] = 8;
|
|
117
|
-
var or = new z(32);
|
|
118
|
-
for (var C = 0; C < 32; ++C)
|
|
119
|
-
or[C] = 5;
|
|
120
|
-
var Rr = /* @__PURE__ */ j(d, 9, 0), Vr = /* @__PURE__ */ j(d, 9, 1), Wr = /* @__PURE__ */ j(or, 5, 0), Xr = /* @__PURE__ */ j(or, 5, 1), sr = function(r) {
|
|
121
|
-
for (var e = r[0], n = 1; n < r.length; ++n)
|
|
122
|
-
r[n] > e && (e = r[n]);
|
|
123
|
-
return e;
|
|
124
|
-
}, W = function(r, e, n) {
|
|
125
|
-
var a = e / 8 | 0;
|
|
126
|
-
return (r[a] | r[a + 1] << 8) >> (e & 7) & n;
|
|
127
|
-
}, xr = function(r, e) {
|
|
128
|
-
var n = e / 8 | 0;
|
|
129
|
-
return (r[n] | r[n + 1] << 8 | r[n + 2] << 16) >> (e & 7);
|
|
130
|
-
}, kr = function(r) {
|
|
131
|
-
return (r + 7) / 8 | 0;
|
|
132
|
-
}, tr = function(r, e, n) {
|
|
133
|
-
return (e == null || e < 0) && (e = 0), (n == null || n > r.length) && (n = r.length), new z(r.subarray(e, n));
|
|
134
|
-
}, Zr = [
|
|
135
|
-
"unexpected EOF",
|
|
136
|
-
"invalid block type",
|
|
137
|
-
"invalid length/literal",
|
|
138
|
-
"invalid distance",
|
|
139
|
-
"stream finished",
|
|
140
|
-
"no stream handler",
|
|
141
|
-
,
|
|
142
|
-
"no callback",
|
|
143
|
-
"invalid UTF-8 data",
|
|
144
|
-
"extra field too long",
|
|
145
|
-
"date not in range 1980-2099",
|
|
146
|
-
"filename too long",
|
|
147
|
-
"stream finishing",
|
|
148
|
-
"invalid zip data"
|
|
149
|
-
// determined by unknown compression method
|
|
150
|
-
], O = function(r, e, n) {
|
|
151
|
-
var a = new Error(e || Zr[r]);
|
|
152
|
-
if (a.code = r, Error.captureStackTrace && Error.captureStackTrace(a, O), !n)
|
|
153
|
-
throw a;
|
|
154
|
-
return a;
|
|
155
|
-
}, $r = function(r, e, n, a) {
|
|
156
|
-
var v = r.length, f = a ? a.length : 0;
|
|
157
|
-
if (!v || e.f && !e.l)
|
|
158
|
-
return n || new z(0);
|
|
159
|
-
var l = !n, u = l || e.i != 2, t = e.i;
|
|
160
|
-
l && (n = new z(v * 3));
|
|
161
|
-
var g = function(vr) {
|
|
162
|
-
var fr = n.length;
|
|
163
|
-
if (vr > fr) {
|
|
164
|
-
var nr = new z(Math.max(fr * 2, vr));
|
|
165
|
-
nr.set(n), n = nr;
|
|
166
|
-
}
|
|
167
|
-
}, o = e.f || 0, i = e.p || 0, h = e.b || 0, w = e.l, y = e.d, x = e.m, M = e.n, Y = v * 8;
|
|
168
|
-
do {
|
|
169
|
-
if (!w) {
|
|
170
|
-
o = W(r, i, 1);
|
|
171
|
-
var I = W(r, i + 1, 3);
|
|
172
|
-
if (i += 3, I)
|
|
173
|
-
if (I == 1)
|
|
174
|
-
w = Vr, y = Xr, x = 9, M = 5;
|
|
175
|
-
else if (I == 2) {
|
|
176
|
-
var B = W(r, i, 31) + 257, T = W(r, i + 10, 15) + 4, s = B + W(r, i + 5, 31) + 1;
|
|
177
|
-
i += 14;
|
|
178
|
-
for (var c = new z(s), U = new z(19), k = 0; k < T; ++k)
|
|
179
|
-
U[Cr[k]] = W(r, i + k * 3, 7);
|
|
180
|
-
i += T * 3;
|
|
181
|
-
for (var H = sr(U), p = (1 << H) - 1, K = j(U, H, 1), k = 0; k < s; ) {
|
|
182
|
-
var G = K[W(r, i, p)];
|
|
183
|
-
i += G & 15;
|
|
184
|
-
var A = G >> 4;
|
|
185
|
-
if (A < 16)
|
|
186
|
-
c[k++] = A;
|
|
187
|
-
else {
|
|
188
|
-
var D = 0, F = 0;
|
|
189
|
-
for (A == 16 ? (F = 3 + W(r, i, 3), i += 2, D = c[k - 1]) : A == 17 ? (F = 3 + W(r, i, 7), i += 3) : A == 18 && (F = 11 + W(r, i, 127), i += 7); F--; )
|
|
190
|
-
c[k++] = D;
|
|
191
|
-
}
|
|
192
|
-
}
|
|
193
|
-
var J = c.subarray(0, B), P = c.subarray(B);
|
|
194
|
-
x = sr(J), M = sr(P), w = j(J, x, 1), y = j(P, M, 1);
|
|
195
|
-
} else
|
|
196
|
-
O(1);
|
|
197
|
-
else {
|
|
198
|
-
var A = kr(i) + 4, E = r[A - 4] | r[A - 3] << 8, m = A + E;
|
|
199
|
-
if (m > v) {
|
|
200
|
-
t && O(0);
|
|
201
|
-
break;
|
|
202
|
-
}
|
|
203
|
-
u && g(h + E), n.set(r.subarray(A, m), h), e.b = h += E, e.p = i = m * 8, e.f = o;
|
|
204
|
-
continue;
|
|
205
|
-
}
|
|
206
|
-
if (i > Y) {
|
|
207
|
-
t && O(0);
|
|
208
|
-
break;
|
|
209
|
-
}
|
|
210
|
-
}
|
|
211
|
-
u && g(h + 131072);
|
|
212
|
-
for (var ar = (1 << x) - 1, V = (1 << M) - 1, L = i; ; L = i) {
|
|
213
|
-
var D = w[xr(r, i) & ar], N = D >> 4;
|
|
214
|
-
if (i += D & 15, i > Y) {
|
|
215
|
-
t && O(0);
|
|
216
|
-
break;
|
|
217
|
-
}
|
|
218
|
-
if (D || O(2), N < 256)
|
|
219
|
-
n[h++] = N;
|
|
220
|
-
else if (N == 256) {
|
|
221
|
-
L = i, w = null;
|
|
222
|
-
break;
|
|
223
|
-
} else {
|
|
224
|
-
var Q = N - 254;
|
|
225
|
-
if (N > 264) {
|
|
226
|
-
var k = N - 257, S = gr[k];
|
|
227
|
-
Q = W(r, i, (1 << S) - 1) + Or[k], i += S;
|
|
228
|
-
}
|
|
229
|
-
var Z = y[xr(r, i) & V], rr = Z >> 4;
|
|
230
|
-
Z || O(3), i += Z & 15;
|
|
231
|
-
var P = Qr[rr];
|
|
232
|
-
if (rr > 3) {
|
|
233
|
-
var S = cr[rr];
|
|
234
|
-
P += xr(r, i) & (1 << S) - 1, i += S;
|
|
235
|
-
}
|
|
236
|
-
if (i > Y) {
|
|
237
|
-
t && O(0);
|
|
238
|
-
break;
|
|
239
|
-
}
|
|
240
|
-
u && g(h + 131072);
|
|
241
|
-
var er = h + Q;
|
|
242
|
-
if (h < P) {
|
|
243
|
-
var ur = f - P, hr = Math.min(P, er);
|
|
244
|
-
for (ur + h < 0 && O(3); h < hr; ++h)
|
|
245
|
-
n[h] = a[ur + h];
|
|
246
|
-
}
|
|
247
|
-
for (; h < er; ++h)
|
|
248
|
-
n[h] = n[h - P];
|
|
249
|
-
}
|
|
250
|
-
}
|
|
251
|
-
e.l = w, e.p = L, e.b = h, e.f = o, w && (o = 1, e.m = x, e.d = y, e.n = M);
|
|
252
|
-
} while (!o);
|
|
253
|
-
return h != n.length && l ? tr(n, 0, h) : n.subarray(0, h);
|
|
254
|
-
}, _ = function(r, e, n) {
|
|
255
|
-
n <<= e & 7;
|
|
256
|
-
var a = e / 8 | 0;
|
|
257
|
-
r[a] |= n, r[a + 1] |= n >> 8;
|
|
258
|
-
}, ir = function(r, e, n) {
|
|
259
|
-
n <<= e & 7;
|
|
260
|
-
var a = e / 8 | 0;
|
|
261
|
-
r[a] |= n, r[a + 1] |= n >> 8, r[a + 2] |= n >> 16;
|
|
262
|
-
}, yr = function(r, e) {
|
|
263
|
-
for (var n = [], a = 0; a < r.length; ++a)
|
|
264
|
-
r[a] && n.push({ s: a, f: r[a] });
|
|
265
|
-
var v = n.length, f = n.slice();
|
|
266
|
-
if (!v)
|
|
267
|
-
return { t: Jr, l: 0 };
|
|
268
|
-
if (v == 1) {
|
|
269
|
-
var l = new z(n[0].s + 1);
|
|
270
|
-
return l[n[0].s] = 1, { t: l, l: 1 };
|
|
271
|
-
}
|
|
272
|
-
n.sort(function(m, B) {
|
|
273
|
-
return m.f - B.f;
|
|
274
|
-
}), n.push({ s: -1, f: 25001 });
|
|
275
|
-
var u = n[0], t = n[1], g = 0, o = 1, i = 2;
|
|
276
|
-
for (n[0] = { s: -1, f: u.f + t.f, l: u, r: t }; o != v - 1; )
|
|
277
|
-
u = n[n[g].f < n[i].f ? g++ : i++], t = n[g != o && n[g].f < n[i].f ? g++ : i++], n[o++] = { s: -1, f: u.f + t.f, l: u, r: t };
|
|
278
|
-
for (var h = f[0].s, a = 1; a < v; ++a)
|
|
279
|
-
f[a].s > h && (h = f[a].s);
|
|
280
|
-
var w = new R(h + 1), y = zr(n[o - 1], w, 0);
|
|
281
|
-
if (y > e) {
|
|
282
|
-
var a = 0, x = 0, M = y - e, Y = 1 << M;
|
|
283
|
-
for (f.sort(function(B, T) {
|
|
284
|
-
return w[T.s] - w[B.s] || B.f - T.f;
|
|
285
|
-
}); a < v; ++a) {
|
|
286
|
-
var I = f[a].s;
|
|
287
|
-
if (w[I] > e)
|
|
288
|
-
x += Y - (1 << y - w[I]), w[I] = e;
|
|
289
|
-
else
|
|
290
|
-
break;
|
|
291
|
-
}
|
|
292
|
-
for (x >>= M; x > 0; ) {
|
|
293
|
-
var A = f[a].s;
|
|
294
|
-
w[A] < e ? x -= 1 << e - w[A]++ - 1 : ++a;
|
|
295
|
-
}
|
|
296
|
-
for (; a >= 0 && x; --a) {
|
|
297
|
-
var E = f[a].s;
|
|
298
|
-
w[E] == e && (--w[E], ++x);
|
|
299
|
-
}
|
|
300
|
-
y = e;
|
|
301
|
-
}
|
|
302
|
-
return { t: new z(w), l: y };
|
|
303
|
-
}, zr = function(r, e, n) {
|
|
304
|
-
return r.s == -1 ? Math.max(zr(r.l, e, n + 1), zr(r.r, e, n + 1)) : e[r.s] = n;
|
|
305
|
-
}, Br = function(r) {
|
|
306
|
-
for (var e = r.length; e && !r[--e]; )
|
|
307
|
-
;
|
|
308
|
-
for (var n = new R(++e), a = 0, v = r[0], f = 1, l = function(t) {
|
|
309
|
-
n[a++] = t;
|
|
310
|
-
}, u = 1; u <= e; ++u)
|
|
311
|
-
if (r[u] == v && u != e)
|
|
312
|
-
++f;
|
|
313
|
-
else {
|
|
314
|
-
if (!v && f > 2) {
|
|
315
|
-
for (; f > 138; f -= 138)
|
|
316
|
-
l(32754);
|
|
317
|
-
f > 2 && (l(f > 10 ? f - 11 << 5 | 28690 : f - 3 << 5 | 12305), f = 0);
|
|
318
|
-
} else if (f > 3) {
|
|
319
|
-
for (l(v), --f; f > 6; f -= 6)
|
|
320
|
-
l(8304);
|
|
321
|
-
f > 2 && (l(f - 3 << 5 | 8208), f = 0);
|
|
322
|
-
}
|
|
323
|
-
for (; f--; )
|
|
324
|
-
l(v);
|
|
325
|
-
f = 1, v = r[u];
|
|
326
|
-
}
|
|
327
|
-
return { c: n.subarray(0, a), n: e };
|
|
328
|
-
}, lr = function(r, e) {
|
|
329
|
-
for (var n = 0, a = 0; a < e.length; ++a)
|
|
330
|
-
n += r[a] * e[a];
|
|
331
|
-
return n;
|
|
332
|
-
}, Gr = function(r, e, n) {
|
|
333
|
-
var a = n.length, v = kr(e + 2);
|
|
334
|
-
r[v] = a & 255, r[v + 1] = a >> 8, r[v + 2] = r[v] ^ 255, r[v + 3] = r[v + 1] ^ 255;
|
|
335
|
-
for (var f = 0; f < a; ++f)
|
|
336
|
-
r[v + f + 4] = n[f];
|
|
337
|
-
return (v + 4 + a) * 8;
|
|
338
|
-
}, Ur = function(r, e, n, a, v, f, l, u, t, g, o) {
|
|
339
|
-
_(e, o++, n), ++v[256];
|
|
340
|
-
for (var i = yr(v, 15), h = i.t, w = i.l, y = yr(f, 15), x = y.t, M = y.l, Y = Br(h), I = Y.c, A = Y.n, E = Br(x), m = E.c, B = E.n, T = new R(19), s = 0; s < I.length; ++s)
|
|
341
|
-
++T[I[s] & 31];
|
|
342
|
-
for (var s = 0; s < m.length; ++s)
|
|
343
|
-
++T[m[s] & 31];
|
|
344
|
-
for (var c = yr(T, 7), U = c.t, k = c.l, H = 19; H > 4 && !U[Cr[H - 1]]; --H)
|
|
345
|
-
;
|
|
346
|
-
var p = g + 5 << 3, K = lr(v, d) + lr(f, or) + l, G = lr(v, h) + lr(f, x) + l + 14 + 3 * H + lr(T, U) + 2 * T[16] + 3 * T[17] + 7 * T[18];
|
|
347
|
-
if (t >= 0 && p <= K && p <= G)
|
|
348
|
-
return Gr(e, o, r.subarray(t, t + g));
|
|
349
|
-
var D, F, J, P;
|
|
350
|
-
if (_(e, o, 1 + (G < K)), o += 2, G < K) {
|
|
351
|
-
D = j(h, w, 0), F = h, J = j(x, M, 0), P = x;
|
|
352
|
-
var ar = j(U, k, 0);
|
|
353
|
-
_(e, o, A - 257), _(e, o + 5, B - 1), _(e, o + 10, H - 4), o += 14;
|
|
354
|
-
for (var s = 0; s < H; ++s)
|
|
355
|
-
_(e, o + 3 * s, U[Cr[s]]);
|
|
356
|
-
o += 3 * H;
|
|
357
|
-
for (var V = [I, m], L = 0; L < 2; ++L)
|
|
358
|
-
for (var N = V[L], s = 0; s < N.length; ++s) {
|
|
359
|
-
var Q = N[s] & 31;
|
|
360
|
-
_(e, o, ar[Q]), o += U[Q], Q > 15 && (_(e, o, N[s] >> 5 & 127), o += N[s] >> 12);
|
|
361
|
-
}
|
|
362
|
-
} else
|
|
363
|
-
D = Rr, F = d, J = Wr, P = or;
|
|
364
|
-
for (var s = 0; s < u; ++s) {
|
|
365
|
-
var S = a[s];
|
|
366
|
-
if (S > 255) {
|
|
367
|
-
var Q = S >> 18 & 31;
|
|
368
|
-
ir(e, o, D[Q + 257]), o += F[Q + 257], Q > 7 && (_(e, o, S >> 23 & 31), o += gr[Q]);
|
|
369
|
-
var Z = S & 31;
|
|
370
|
-
ir(e, o, J[Z]), o += P[Z], Z > 3 && (ir(e, o, S >> 5 & 8191), o += cr[Z]);
|
|
371
|
-
} else
|
|
372
|
-
ir(e, o, D[S]), o += F[S];
|
|
373
|
-
}
|
|
374
|
-
return ir(e, o, D[256]), o + F[256];
|
|
375
|
-
}, jr = /* @__PURE__ */ new Tr([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]), Jr = /* @__PURE__ */ new z(0), Lr = function(r, e, n, a, v, f) {
|
|
376
|
-
var l = f.z || r.length, u = new z(a + l + 5 * (1 + Math.ceil(l / 7e3)) + v), t = u.subarray(a, u.length - v), g = f.l, o = (f.r || 0) & 7;
|
|
377
|
-
if (e) {
|
|
378
|
-
o && (t[0] = f.r >> 3);
|
|
379
|
-
for (var i = jr[e - 1], h = i >> 13, w = i & 8191, y = (1 << n) - 1, x = f.p || new R(32768), M = f.h || new R(y + 1), Y = Math.ceil(n / 3), I = 2 * Y, A = function(wr) {
|
|
380
|
-
return (r[wr] ^ r[wr + 1] << Y ^ r[wr + 2] << I) & y;
|
|
381
|
-
}, E = new Tr(25e3), m = new R(288), B = new R(32), T = 0, s = 0, c = f.i || 0, U = 0, k = f.w || 0, H = 0; c + 2 < l; ++c) {
|
|
382
|
-
var p = A(c), K = c & 32767, G = M[p];
|
|
383
|
-
if (x[K] = G, M[p] = K, k <= c) {
|
|
384
|
-
var D = l - c;
|
|
385
|
-
if ((T > 7e3 || U > 24576) && (D > 423 || !g)) {
|
|
386
|
-
o = Ur(r, t, 0, E, m, B, s, U, H, c - H, o), U = T = s = 0, H = c;
|
|
387
|
-
for (var F = 0; F < 286; ++F)
|
|
388
|
-
m[F] = 0;
|
|
389
|
-
for (var F = 0; F < 30; ++F)
|
|
390
|
-
B[F] = 0;
|
|
391
|
-
}
|
|
392
|
-
var J = 2, P = 0, ar = w, V = K - G & 32767;
|
|
393
|
-
if (D > 2 && p == A(c - V))
|
|
394
|
-
for (var L = Math.min(h, D) - 1, N = Math.min(32767, c), Q = Math.min(258, D); V <= N && --ar && K != G; ) {
|
|
395
|
-
if (r[c + J] == r[c + J - V]) {
|
|
396
|
-
for (var S = 0; S < Q && r[c + S] == r[c + S - V]; ++S)
|
|
397
|
-
;
|
|
398
|
-
if (S > J) {
|
|
399
|
-
if (J = S, P = V, S > L)
|
|
400
|
-
break;
|
|
401
|
-
for (var Z = Math.min(V, S - 2), rr = 0, F = 0; F < Z; ++F) {
|
|
402
|
-
var er = c - V + F & 32767, ur = x[er], hr = er - ur & 32767;
|
|
403
|
-
hr > rr && (rr = hr, G = er);
|
|
404
|
-
}
|
|
405
|
-
}
|
|
406
|
-
}
|
|
407
|
-
K = G, G = x[K], V += K - G & 32767;
|
|
408
|
-
}
|
|
409
|
-
if (P) {
|
|
410
|
-
E[U++] = 268435456 | Fr[J] << 18 | mr[P];
|
|
411
|
-
var vr = Fr[J] & 31, fr = mr[P] & 31;
|
|
412
|
-
s += gr[vr] + cr[fr], ++m[257 + vr], ++B[fr], k = c + J, ++T;
|
|
413
|
-
} else
|
|
414
|
-
E[U++] = r[c], ++m[r[c]];
|
|
415
|
-
}
|
|
416
|
-
}
|
|
417
|
-
for (c = Math.max(c, k); c < l; ++c)
|
|
418
|
-
E[U++] = r[c], ++m[r[c]];
|
|
419
|
-
o = Ur(r, t, g, E, m, B, s, U, H, c - H, o), g || (f.r = o & 7 | t[o / 8 | 0] << 3, o -= 7, f.h = M, f.p = x, f.i = c, f.w = k);
|
|
420
|
-
} else {
|
|
421
|
-
for (var c = f.w || 0; c < l + g; c += 65535) {
|
|
422
|
-
var nr = c + 65535;
|
|
423
|
-
nr >= l && (t[o / 8 | 0] = g, nr = l), o = Gr(t, o + 1, r.subarray(c, nr));
|
|
424
|
-
}
|
|
425
|
-
f.i = l;
|
|
426
|
-
}
|
|
427
|
-
return tr(u, 0, a + kr(o) + v);
|
|
428
|
-
}, _r = /* @__PURE__ */ function() {
|
|
429
|
-
for (var r = new Int32Array(256), e = 0; e < 256; ++e) {
|
|
430
|
-
for (var n = e, a = 9; --a; )
|
|
431
|
-
n = (n & 1 && -306674912) ^ n >>> 1;
|
|
432
|
-
r[e] = n;
|
|
433
|
-
}
|
|
434
|
-
return r;
|
|
435
|
-
}(), pr = function() {
|
|
436
|
-
var r = -1;
|
|
437
|
-
return {
|
|
438
|
-
p: function(e) {
|
|
439
|
-
for (var n = r, a = 0; a < e.length; ++a)
|
|
440
|
-
n = _r[n & 255 ^ e[a]] ^ n >>> 8;
|
|
441
|
-
r = n;
|
|
442
|
-
},
|
|
443
|
-
d: function() {
|
|
444
|
-
return ~r;
|
|
445
|
-
}
|
|
446
|
-
};
|
|
447
|
-
}, br = function(r, e, n, a, v) {
|
|
448
|
-
if (!v && (v = { l: 1 }, e.dictionary)) {
|
|
449
|
-
var f = e.dictionary.subarray(-32768), l = new z(f.length + r.length);
|
|
450
|
-
l.set(f), l.set(r, f.length), r = l, v.w = f.length;
|
|
451
|
-
}
|
|
452
|
-
return Lr(r, e.level == null ? 6 : e.level, e.mem == null ? v.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(r.length))) * 1.5) : 20 : 12 + e.mem, n, a, v);
|
|
453
|
-
}, Kr = function(r, e) {
|
|
454
|
-
var n = {};
|
|
455
|
-
for (var a in r)
|
|
456
|
-
n[a] = r[a];
|
|
457
|
-
for (var a in e)
|
|
458
|
-
n[a] = e[a];
|
|
459
|
-
return n;
|
|
460
|
-
}, $ = function(r, e) {
|
|
461
|
-
return r[e] | r[e + 1] << 8;
|
|
462
|
-
}, X = function(r, e) {
|
|
463
|
-
return (r[e] | r[e + 1] << 8 | r[e + 2] << 16 | r[e + 3] << 24) >>> 0;
|
|
464
|
-
}, Mr = function(r, e) {
|
|
465
|
-
return X(r, e) + X(r, e + 4) * 4294967296;
|
|
466
|
-
}, q = function(r, e, n) {
|
|
467
|
-
for (; n; ++e)
|
|
468
|
-
r[e] = n, n >>>= 8;
|
|
469
|
-
};
|
|
470
|
-
function dr(r, e) {
|
|
471
|
-
return br(r, e || {}, 0, 0);
|
|
472
|
-
}
|
|
473
|
-
function re(r, e) {
|
|
474
|
-
return $r(r, { i: 2 }, e && e.out, e && e.dictionary);
|
|
475
|
-
}
|
|
476
|
-
var Nr = function(r, e, n, a) {
|
|
477
|
-
for (var v in r) {
|
|
478
|
-
var f = r[v], l = e + v, u = a;
|
|
479
|
-
Array.isArray(f) && (u = Kr(a, f[1]), f = f[0]), f instanceof z ? n[l] = [f, u] : (n[l += "/"] = [new z(0), u], Nr(f, l, n, a));
|
|
480
|
-
}
|
|
481
|
-
}, Dr = typeof TextEncoder < "u" && /* @__PURE__ */ new TextEncoder(), Ar = typeof TextDecoder < "u" && /* @__PURE__ */ new TextDecoder(), ee = 0;
|
|
482
|
-
try {
|
|
483
|
-
Ar.decode(Jr, { stream: !0 }), ee = 1;
|
|
484
|
-
} catch {
|
|
485
|
-
}
|
|
486
|
-
var ne = function(r) {
|
|
487
|
-
for (var e = "", n = 0; ; ) {
|
|
488
|
-
var a = r[n++], v = (a > 127) + (a > 223) + (a > 239);
|
|
489
|
-
if (n + v > r.length)
|
|
490
|
-
return { s: e, r: tr(r, n - 1) };
|
|
491
|
-
v ? v == 3 ? (a = ((a & 15) << 18 | (r[n++] & 63) << 12 | (r[n++] & 63) << 6 | r[n++] & 63) - 65536, e += String.fromCharCode(55296 | a >> 10, 56320 | a & 1023)) : v & 1 ? e += String.fromCharCode((a & 31) << 6 | r[n++] & 63) : e += String.fromCharCode((a & 15) << 12 | (r[n++] & 63) << 6 | r[n++] & 63) : e += String.fromCharCode(a);
|
|
492
|
-
}
|
|
493
|
-
};
|
|
494
|
-
function Pr(r, e) {
|
|
495
|
-
var n;
|
|
496
|
-
if (Dr)
|
|
497
|
-
return Dr.encode(r);
|
|
498
|
-
for (var a = r.length, v = new z(r.length + (r.length >> 1)), f = 0, l = function(g) {
|
|
499
|
-
v[f++] = g;
|
|
500
|
-
}, n = 0; n < a; ++n) {
|
|
501
|
-
if (f + 5 > v.length) {
|
|
502
|
-
var u = new z(f + 8 + (a - n << 1));
|
|
503
|
-
u.set(v), v = u;
|
|
504
|
-
}
|
|
505
|
-
var t = r.charCodeAt(n);
|
|
506
|
-
t < 128 || e ? l(t) : t < 2048 ? (l(192 | t >> 6), l(128 | t & 63)) : t > 55295 && t < 57344 ? (t = 65536 + (t & 1047552) | r.charCodeAt(++n) & 1023, l(240 | t >> 18), l(128 | t >> 12 & 63), l(128 | t >> 6 & 63), l(128 | t & 63)) : (l(224 | t >> 12), l(128 | t >> 6 & 63), l(128 | t & 63));
|
|
507
|
-
}
|
|
508
|
-
return tr(v, 0, f);
|
|
509
|
-
}
|
|
510
|
-
function ae(r, e) {
|
|
511
|
-
if (e) {
|
|
512
|
-
for (var n = "", a = 0; a < r.length; a += 16384)
|
|
513
|
-
n += String.fromCharCode.apply(null, r.subarray(a, a + 16384));
|
|
514
|
-
return n;
|
|
515
|
-
} else {
|
|
516
|
-
if (Ar)
|
|
517
|
-
return Ar.decode(r);
|
|
518
|
-
var v = ne(r), f = v.s, n = v.r;
|
|
519
|
-
return n.length && O(8), f;
|
|
520
|
-
}
|
|
521
|
-
}
|
|
522
|
-
var ve = function(r, e) {
|
|
523
|
-
return e + 30 + $(r, e + 26) + $(r, e + 28);
|
|
524
|
-
}, fe = function(r, e, n) {
|
|
525
|
-
var a = $(r, e + 28), v = ae(r.subarray(e + 46, e + 46 + a), !($(r, e + 8) & 2048)), f = e + 46 + a, l = X(r, e + 20), u = n && l == 4294967295 ? ie(r, f) : [l, X(r, e + 24), X(r, e + 42)], t = u[0], g = u[1], o = u[2];
|
|
526
|
-
return [$(r, e + 10), t, g, v, f + $(r, e + 30) + $(r, e + 32), o];
|
|
527
|
-
}, ie = function(r, e) {
|
|
528
|
-
for (; $(r, e) != 1; e += 4 + $(r, e + 2))
|
|
529
|
-
;
|
|
530
|
-
return [Mr(r, e + 12), Mr(r, e + 4), Mr(r, e + 20)];
|
|
531
|
-
}, Er = function(r) {
|
|
532
|
-
var e = 0;
|
|
533
|
-
if (r)
|
|
534
|
-
for (var n in r) {
|
|
535
|
-
var a = r[n].length;
|
|
536
|
-
a > 65535 && O(9), e += a + 4;
|
|
537
|
-
}
|
|
538
|
-
return e;
|
|
539
|
-
}, qr = function(r, e, n, a, v, f, l, u) {
|
|
540
|
-
var t = a.length, g = n.extra, o = u && u.length, i = Er(g);
|
|
541
|
-
q(r, e, l != null ? 33639248 : 67324752), e += 4, l != null && (r[e++] = 20, r[e++] = n.os), r[e] = 20, e += 2, r[e++] = n.flag << 1 | (f < 0 && 8), r[e++] = v && 8, r[e++] = n.compression & 255, r[e++] = n.compression >> 8;
|
|
542
|
-
var h = new Date(n.mtime == null ? Date.now() : n.mtime), w = h.getFullYear() - 1980;
|
|
543
|
-
if ((w < 0 || w > 119) && O(10), q(r, e, w << 25 | h.getMonth() + 1 << 21 | h.getDate() << 16 | h.getHours() << 11 | h.getMinutes() << 5 | h.getSeconds() >> 1), e += 4, f != -1 && (q(r, e, n.crc), q(r, e + 4, f < 0 ? -f - 2 : f), q(r, e + 8, n.size)), q(r, e + 12, t), q(r, e + 14, i), e += 16, l != null && (q(r, e, o), q(r, e + 6, n.attrs), q(r, e + 10, l), e += 14), r.set(a, e), e += t, i)
|
|
544
|
-
for (var y in g) {
|
|
545
|
-
var x = g[y], M = x.length;
|
|
546
|
-
q(r, e, +y), q(r, e + 2, M), r.set(x, e + 4), e += 4 + M;
|
|
547
|
-
}
|
|
548
|
-
return o && (r.set(u, e), e += o), e;
|
|
549
|
-
}, le = function(r, e, n, a, v) {
|
|
550
|
-
q(r, e, 101010256), q(r, e + 8, n), q(r, e + 10, n), q(r, e + 12, a), q(r, e + 16, v);
|
|
551
|
-
};
|
|
552
|
-
function oe(r, e) {
|
|
553
|
-
e || (e = {});
|
|
554
|
-
var n = {}, a = [];
|
|
555
|
-
Nr(r, "", n, e);
|
|
556
|
-
var v = 0, f = 0;
|
|
557
|
-
for (var l in n) {
|
|
558
|
-
var u = n[l], t = u[0], g = u[1], o = g.level == 0 ? 0 : 8, i = Pr(l), h = i.length, w = g.comment, y = w && Pr(w), x = y && y.length, M = Er(g.extra);
|
|
559
|
-
h > 65535 && O(11);
|
|
560
|
-
var Y = o ? dr(t, g) : t, I = Y.length, A = pr();
|
|
561
|
-
A.p(t), a.push(Kr(g, {
|
|
562
|
-
size: t.length,
|
|
563
|
-
crc: A.d(),
|
|
564
|
-
c: Y,
|
|
565
|
-
f: i,
|
|
566
|
-
m: y,
|
|
567
|
-
u: h != l.length || y && w.length != x,
|
|
568
|
-
o: v,
|
|
569
|
-
compression: o
|
|
570
|
-
})), v += 30 + h + M + I, f += 76 + 2 * (h + M) + (x || 0) + I;
|
|
571
|
-
}
|
|
572
|
-
for (var E = new z(f + 22), m = v, B = f - v, T = 0; T < a.length; ++T) {
|
|
573
|
-
var i = a[T];
|
|
574
|
-
qr(E, i.o, i, i.f, i.u, i.c.length);
|
|
575
|
-
var s = 30 + i.f.length + Er(i.extra);
|
|
576
|
-
E.set(i.c, i.o + s), qr(E, v, i, i.f, i.u, i.c.length, i.o, i.m), v += 16 + s + (i.m ? i.m.length : 0);
|
|
577
|
-
}
|
|
578
|
-
return le(E, v, a.length, B, m), E;
|
|
579
|
-
}
|
|
580
|
-
function te(r, e) {
|
|
581
|
-
for (var n = {}, a = r.length - 22; X(r, a) != 101010256; --a)
|
|
582
|
-
(!a || r.length - a > 65558) && O(13);
|
|
583
|
-
var v = $(r, a + 8);
|
|
584
|
-
if (!v)
|
|
585
|
-
return {};
|
|
586
|
-
var f = X(r, a + 16), l = f == 4294967295 || v == 65535;
|
|
587
|
-
if (l) {
|
|
588
|
-
var u = X(r, a - 12);
|
|
589
|
-
l = X(r, u) == 101075792, l && (v = X(r, u + 32), f = X(r, u + 48));
|
|
590
|
-
}
|
|
591
|
-
for (var t = 0; t < v; ++t) {
|
|
592
|
-
var g = fe(r, f, l), o = g[0], i = g[1], h = g[2], w = g[3], y = g[4], x = g[5], M = ve(r, x);
|
|
593
|
-
f = y, o ? o == 8 ? n[w] = re(r.subarray(M, M + i), { out: new z(h) }) : O(14, "unknown compression type " + o) : n[w] = tr(r, M, M + i);
|
|
594
|
-
}
|
|
595
|
-
return n;
|
|
596
|
-
}
|
|
597
|
-
class ue extends Error {
|
|
598
|
-
constructor(e, n) {
|
|
599
|
-
super(e), this.requestedFileType = n, this.name = "FileTypeError";
|
|
600
|
-
}
|
|
601
|
-
}
|
|
602
|
-
class he extends Error {
|
|
603
|
-
constructor(e, n) {
|
|
604
|
-
super(e), this.cause = n, this.name = "ParseError";
|
|
605
|
-
}
|
|
606
|
-
}
|
|
607
|
-
export {
|
|
608
|
-
ue as F,
|
|
609
|
-
he as P,
|
|
610
|
-
ae as a,
|
|
611
|
-
Pr as s,
|
|
612
|
-
te as u,
|
|
613
|
-
oe as z
|
|
614
|
-
};
|