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