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