useblocks 1.1.49 → 1.1.53
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/iframe/js/amp.BP7EklKo.js +1 -1
- package/iframe/js/iframe-eblock.js +1 -1
- package/iframe/js/iframe.js +1 -1
- package/iframe/js/rules.4N5s3OV-.js +1 -1
- package/npm-publish.manifest.json +7 -7
- package/package.json +1 -1
- package/runtime/THIRD_PARTY_LICENSES.txt +1 -1
- package/singlepage_headless_plugin.html +1 -1
- package/static/core/{8c81db36.js → 139e4380.js} +3 -3
- package/static/core/{1ca5f3772.js → 1995fb0a2.js} +10 -10
- package/static/core/{3b4845f7.js → 1f5e1fc9.js} +321 -321
- package/static/core/{59023866.js → 31e98e6e.js} +616 -611
- package/static/core/{13f581cc.js → 5318562c.js} +3 -3
- package/static/core/{386cf7b3.js → 75737a9d.js} +5156 -5116
- package/static/core/{11296a18.js → 9929a348.js} +107 -107
- package/static/core/{e7c24fe9.js → b408f33a.js} +179 -173
- package/static/core/{3dea3b87.js → bc7e3d2b.js} +7 -7
- package/static/core/{de79e0c5.js → c3058168.js} +524 -510
- package/static/core/ce0410b1.js +467 -0
- package/static/core/{339377b8.js → d1eb3c68.js} +13244 -13200
- package/static/core/{8e110c69.js → dc1f9e4f.js} +31 -31
- package/static/core/{7a229b90.js → e1d239ab.js} +41 -41
- package/static/core/{aacf134d.js → e5e07f1d.js} +514 -494
- package/static/core/{acb049cb.js → ebd852b6.js} +1267 -1265
- package/static/core/{c59f9731.js → ee0ddb51.js} +4036 -3900
- package/static/core/{13d197af.js → f3cff4c9.js} +169 -169
- package/two_step_headless_plugin.html +1 -1
- package/ui-kit/index.js +49 -47
- package/{useblocks-core.15a9129c.js → useblocks-core.2a5dade1.js} +6 -6
- package/useblocks-esm.js +3 -3
- package/useblocks.js +3 -3
- package/static/core/a11c28c2.js +0 -467
- /package/iframe/{iframe-eblock.15a9129c.html → iframe-eblock.2a5dade1.html} +0 -0
- /package/iframe/{iframe.15a9129c.html → iframe.2a5dade1.html} +0 -0
|
@@ -1,23 +1,23 @@
|
|
|
1
|
-
__useblocks__.define("static/core/
|
|
1
|
+
__useblocks__.define("static/core/1f5e1fc9.js", [
|
|
2
2
|
"require",
|
|
3
3
|
"exports",
|
|
4
4
|
"module",
|
|
5
5
|
"static/core/bd36b180.js",
|
|
6
|
-
"static/core/
|
|
7
|
-
"static/core/
|
|
8
|
-
"static/core/
|
|
9
|
-
"static/core/
|
|
6
|
+
"static/core/ee0ddb51.js",
|
|
7
|
+
"static/core/ebd852b6.js",
|
|
8
|
+
"static/core/75737a9d.js",
|
|
9
|
+
"static/core/1995fb0a2.js",
|
|
10
10
|
"react",
|
|
11
11
|
"react-router-dom"
|
|
12
12
|
], function(Be, ge, Un) {
|
|
13
|
-
const bt = Be("./bd36b180.js"), Ee = Be("./
|
|
13
|
+
const bt = Be("./bd36b180.js"), Ee = Be("./ee0ddb51.js"), Ot = Be("./ebd852b6.js"), st = Be("./75737a9d.js"), yt = Be("./1995fb0a2.js");
|
|
14
14
|
let kt = Be("react"), Bt = Be("react-router-dom");
|
|
15
15
|
var Dt = () => Ee.di.useInstance(Ee.COOKIE_MANAGER_ID);
|
|
16
|
-
function
|
|
16
|
+
function wt({ limitsInPlugin: _, hostedAiActive: S }) {
|
|
17
17
|
return _ && !S;
|
|
18
18
|
}
|
|
19
19
|
function Ht({ limitsInPlugin: _, hostedAiActive: S, counter: N, limit: G }) {
|
|
20
|
-
return
|
|
20
|
+
return wt({
|
|
21
21
|
limitsInPlugin: _,
|
|
22
22
|
hostedAiActive: S
|
|
23
23
|
}) ? G > 0 && N >= G : !1;
|
|
@@ -306,10 +306,10 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
306
306
|
m += 4, m = h;
|
|
307
307
|
for (var E = 0; E < n; E++) {
|
|
308
308
|
a(r, m), m += 4, m += 4, m += 4, a(r, m += 4), s = a(r, m += 4);
|
|
309
|
-
var x = a(r, m += 4), b = u(r, m += 4), D = u(r, m + 2),
|
|
309
|
+
var x = a(r, m += 4), b = u(r, m += 4), D = u(r, m + 2), L = u(r, m + 4);
|
|
310
310
|
m += 6;
|
|
311
311
|
var M = a(r, m += 8);
|
|
312
|
-
m += 4, m += b + D +
|
|
312
|
+
m += 4, m += b + D + L, d._readLocal(r, M, A, s, x, t);
|
|
313
313
|
}
|
|
314
314
|
return A;
|
|
315
315
|
}, d._readLocal = function(e, t, u, a, m, A) {
|
|
@@ -366,10 +366,10 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
366
366
|
var b = A[r];
|
|
367
367
|
x.push(E), E = d._writeHeader(h, E, r, b, 0);
|
|
368
368
|
}
|
|
369
|
-
var D = 0,
|
|
369
|
+
var D = 0, L = E;
|
|
370
370
|
for (var r in A) b = A[r], x.push(E), E = d._writeHeader(h, E, r, b, 1, x[D++]);
|
|
371
|
-
var M = E -
|
|
372
|
-
return a(h, E, 101010256), E += 4, m(h, E += 4, D), m(h, E += 2, D), a(h, E += 2, M), a(h, E += 4,
|
|
371
|
+
var M = E - L;
|
|
372
|
+
return a(h, E, 101010256), E += 4, m(h, E += 4, D), m(h, E += 2, D), a(h, E += 2, M), a(h, E += 4, L), E += 4, E += 2, h.buffer;
|
|
373
373
|
}, d._noNeed = function(e) {
|
|
374
374
|
var t = e.split(".").pop().toLowerCase();
|
|
375
375
|
return "png,jpg,jpeg,zip".indexOf(t) != -1;
|
|
@@ -531,10 +531,10 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
531
531
|
d.F._hash;
|
|
532
532
|
var i = d.F._putsE, n = 0, s = u << 3, h = 0, E = e.length;
|
|
533
533
|
if (a == 0) {
|
|
534
|
-
for (; n < E;) i(t, s, n + (
|
|
534
|
+
for (; n < E;) i(t, s, n + (w = Math.min(65535, E - n)) == E ? 1 : 0), s = d.F._copyExact(e, n, w, t, s + 8), n += w;
|
|
535
535
|
return s >>> 3;
|
|
536
536
|
}
|
|
537
|
-
var x = A.lits, b = A.strt, D = A.prev,
|
|
537
|
+
var x = A.lits, b = A.strt, D = A.prev, L = 0, M = 0, B = 0, g = 0, R = 0, c = 0;
|
|
538
538
|
for (E > 2 && (b[c = d.F._hash(e, 0)] = 0), n = 0; n < E; n++) {
|
|
539
539
|
if (R = c, n + 1 < E - 2) {
|
|
540
540
|
c = d.F._hash(e, n + 1);
|
|
@@ -542,21 +542,21 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
542
542
|
D[f] = b[c], b[c] = f;
|
|
543
543
|
}
|
|
544
544
|
if (h <= n) {
|
|
545
|
-
(
|
|
545
|
+
(L > 14e3 || M > 26697) && E - n > 100 && (h < n && (x[L] = n - h, L += 2, h = n), s = d.F._writeBlock(n == E - 1 || h == E ? 1 : 0, x, L, g, e, B, n - B, t, s), L = M = g = 0, B = n);
|
|
546
546
|
var v = 0;
|
|
547
547
|
n < E - 2 && (v = d.F._bestMatch(e, n, D, R, Math.min(m[2], E - n), m[3]));
|
|
548
|
-
var
|
|
548
|
+
var w = v >>> 16, y = 65535 & v;
|
|
549
549
|
if (v != 0) {
|
|
550
|
-
|
|
551
|
-
var U = r(
|
|
550
|
+
y = 65535 & v;
|
|
551
|
+
var U = r(w = v >>> 16, A.of0);
|
|
552
552
|
A.lhst[257 + U]++;
|
|
553
|
-
var p = r(
|
|
554
|
-
A.dhst[p]++, g += A.exb[U] + A.dxb[p], x[
|
|
553
|
+
var p = r(y, A.df0);
|
|
554
|
+
A.dhst[p]++, g += A.exb[U] + A.dxb[p], x[L] = w << 23 | n - h, x[L + 1] = y << 16 | U << 8 | p, L += 2, h = n + w;
|
|
555
555
|
} else A.lhst[e[n]]++;
|
|
556
556
|
M++;
|
|
557
557
|
}
|
|
558
558
|
}
|
|
559
|
-
for (B == n && e.length != 0 || (h < n && (x[
|
|
559
|
+
for (B == n && e.length != 0 || (h < n && (x[L] = n - h, L += 2, h = n), s = d.F._writeBlock(1, x, L, g, e, B, n - B, t, s), L = 0, M = 0, L = M = g = 0, B = n); (7 & s) != 0;) s++;
|
|
560
560
|
return s >>> 3;
|
|
561
561
|
}, d.F._bestMatch = function(e, t, u, a, m, A) {
|
|
562
562
|
var r = 32767 & t, i = u[r], n = r - i + 32768 & 32767;
|
|
@@ -568,8 +568,8 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
568
568
|
if (h = n, (s = x) >= m) break;
|
|
569
569
|
n + 2 < x && (x = n + 2);
|
|
570
570
|
for (var b = 0, D = 0; D < x - 2; D++) {
|
|
571
|
-
var
|
|
572
|
-
M > b && (b = M, i =
|
|
571
|
+
var L = t - n + D + 32768 & 32767, M = L - u[L] + 32768 & 32767;
|
|
572
|
+
M > b && (b = M, i = L);
|
|
573
573
|
}
|
|
574
574
|
}
|
|
575
575
|
}
|
|
@@ -584,28 +584,28 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
584
584
|
}, d.F._hash = function(e, t) {
|
|
585
585
|
return (e[t] << 8 | e[t + 1]) + (e[t + 2] << 4) & 65535;
|
|
586
586
|
}, d.saved = 0, d.F._writeBlock = function(e, t, u, a, m, A, r, i, n) {
|
|
587
|
-
var s, h, E, x, b, D,
|
|
588
|
-
g.lhst[256]++, h = (s = d.F.getTrees())[0], E = s[1], x = s[2], b = s[3], D = s[4],
|
|
589
|
-
var f = 32 + ((n + 3 & 7) == 0 ? 0 : 8 - (n + 3 & 7)) + (r << 3), v = a + d.F.contSize(g.fltree, g.lhst) + d.F.contSize(g.fdtree, g.dhst),
|
|
590
|
-
|
|
591
|
-
for (var
|
|
592
|
-
for (
|
|
593
|
-
for (
|
|
594
|
-
var U = f < v && f <
|
|
587
|
+
var s, h, E, x, b, D, L, M, B, g = d.F.U, R = d.F._putsF, c = d.F._putsE;
|
|
588
|
+
g.lhst[256]++, h = (s = d.F.getTrees())[0], E = s[1], x = s[2], b = s[3], D = s[4], L = s[5], M = s[6], B = s[7];
|
|
589
|
+
var f = 32 + ((n + 3 & 7) == 0 ? 0 : 8 - (n + 3 & 7)) + (r << 3), v = a + d.F.contSize(g.fltree, g.lhst) + d.F.contSize(g.fdtree, g.dhst), w = a + d.F.contSize(g.ltree, g.lhst) + d.F.contSize(g.dtree, g.dhst);
|
|
590
|
+
w += 14 + 3 * L + d.F.contSize(g.itree, g.ihst) + (2 * g.ihst[16] + 3 * g.ihst[17] + 7 * g.ihst[18]);
|
|
591
|
+
for (var y = 0; y < 286; y++) g.lhst[y] = 0;
|
|
592
|
+
for (y = 0; y < 30; y++) g.dhst[y] = 0;
|
|
593
|
+
for (y = 0; y < 19; y++) g.ihst[y] = 0;
|
|
594
|
+
var U = f < v && f < w ? 0 : v < w ? 1 : 2;
|
|
595
595
|
if (R(i, n, e), R(i, n + 1, U), n += 3, U == 0) {
|
|
596
596
|
for (; (7 & n) != 0;) n++;
|
|
597
597
|
n = d.F._copyExact(m, A, r, i, n);
|
|
598
598
|
} else {
|
|
599
599
|
var p, I;
|
|
600
600
|
if (U == 1 && (p = g.fltree, I = g.fdtree), U == 2) {
|
|
601
|
-
d.F.makeCodes(g.ltree, h), d.F.revCodes(g.ltree, h), d.F.makeCodes(g.dtree, E), d.F.revCodes(g.dtree, E), d.F.makeCodes(g.itree, x), d.F.revCodes(g.itree, x), p = g.ltree, I = g.dtree, c(i, n, b - 257), c(i, n += 5, D - 1), c(i, n += 5,
|
|
602
|
-
for (var l = 0; l <
|
|
603
|
-
n += 3 *
|
|
601
|
+
d.F.makeCodes(g.ltree, h), d.F.revCodes(g.ltree, h), d.F.makeCodes(g.dtree, E), d.F.revCodes(g.dtree, E), d.F.makeCodes(g.itree, x), d.F.revCodes(g.itree, x), p = g.ltree, I = g.dtree, c(i, n, b - 257), c(i, n += 5, D - 1), c(i, n += 5, L - 4), n += 4;
|
|
602
|
+
for (var l = 0; l < L; l++) c(i, n + 3 * l, g.itree[1 + (g.ordr[l] << 1)]);
|
|
603
|
+
n += 3 * L, n = d.F._codeTiny(M, g.itree, i, n), n = d.F._codeTiny(B, g.itree, i, n);
|
|
604
604
|
}
|
|
605
|
-
for (var o = A,
|
|
606
|
-
for (var F = t[
|
|
605
|
+
for (var o = A, O = 0; O < u; O += 2) {
|
|
606
|
+
for (var F = t[O], k = F >>> 23, X = o + (8388607 & F); o < X;) n = d.F._writeLit(m[o++], p, i, n);
|
|
607
607
|
if (k != 0) {
|
|
608
|
-
var z = t[
|
|
608
|
+
var z = t[O + 1], Q = z >> 16, j = z >> 8 & 255, C = 255 & z;
|
|
609
609
|
c(i, n = d.F._writeLit(257 + j, p, i, n), k - g.of0[j]), n += g.exb[j], R(i, n = d.F._writeLit(C, I, i, n), Q - g.df0[C]), n += g.dxb[C], o += k;
|
|
610
610
|
}
|
|
611
611
|
}
|
|
@@ -689,9 +689,9 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
689
689
|
l: h,
|
|
690
690
|
r: E
|
|
691
691
|
};
|
|
692
|
-
var
|
|
693
|
-
for (
|
|
694
|
-
return
|
|
692
|
+
var L = d.F.setDepth(a[b - 1], 0);
|
|
693
|
+
for (L > u && (d.F.restrictDepth(n, u, L), L = u), r = 0; r < i; r++) t[1 + (n[r].lit << 1)] = n[r].d;
|
|
694
|
+
return L;
|
|
695
695
|
}, d.F.setDepth = function(e, t) {
|
|
696
696
|
return e.lit != -1 ? (e.d = t, t) : Math.max(d.F.setDepth(e.l, t + 1), d.F.setDepth(e.r, t + 1));
|
|
697
697
|
}, d.F.restrictDepth = function(e, t, u) {
|
|
@@ -714,16 +714,16 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
714
714
|
if (e[0] == 3 && e[1] == 0) return t || new u(0);
|
|
715
715
|
var a = d.F, m = a._bitsF, A = a._bitsE, r = a._decodeTiny, i = a.makeCodes, n = a.codes2map, s = a._get17, h = a.U, E = t == null;
|
|
716
716
|
E && (t = new u(e.length >>> 2 << 3));
|
|
717
|
-
for (var x, b, D = 0,
|
|
718
|
-
if (E && (t = d.F._check(t, f + (1 << 17))),
|
|
717
|
+
for (var x, b, D = 0, L = 0, M = 0, B = 0, g = 0, R = 0, c = 0, f = 0, v = 0; D == 0;) if (D = m(e, v, 1), L = m(e, v + 1, 2), v += 3, L != 0) {
|
|
718
|
+
if (E && (t = d.F._check(t, f + (1 << 17))), L == 1 && (x = h.flmap, b = h.fdmap, R = 511, c = 31), L == 2) {
|
|
719
719
|
M = A(e, v, 5) + 257, B = A(e, v + 5, 5) + 1, g = A(e, v + 10, 4) + 4, v += 14;
|
|
720
|
-
for (var
|
|
721
|
-
var
|
|
722
|
-
for (
|
|
723
|
-
var U = A(e, v + 3 *
|
|
724
|
-
h.itree[1 + (h.ordr[
|
|
720
|
+
for (var w = 0; w < 38; w += 2) h.itree[w] = 0, h.itree[w + 1] = 0;
|
|
721
|
+
var y = 1;
|
|
722
|
+
for (w = 0; w < g; w++) {
|
|
723
|
+
var U = A(e, v + 3 * w, 3);
|
|
724
|
+
h.itree[1 + (h.ordr[w] << 1)] = U, U > y && (y = U);
|
|
725
725
|
}
|
|
726
|
-
v += 3 * g, i(h.itree,
|
|
726
|
+
v += 3 * g, i(h.itree, y), n(h.itree, y, h.imap), x = h.lmap, b = h.dmap, v = r(h.imap, (1 << y) - 1, M + B, e, v, h.ttree);
|
|
727
727
|
var p = a._copyOut(h.ttree, 0, M, h.ltree);
|
|
728
728
|
R = (1 << p) - 1;
|
|
729
729
|
var I = a._copyOut(h.ttree, M, B, h.dtree);
|
|
@@ -736,16 +736,16 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
736
736
|
if (!(o >>> 8)) t[f++] = o;
|
|
737
737
|
else {
|
|
738
738
|
if (o == 256) break;
|
|
739
|
-
var
|
|
739
|
+
var O = f + o - 254;
|
|
740
740
|
if (o > 264) {
|
|
741
741
|
var F = h.ldef[o - 257];
|
|
742
|
-
|
|
742
|
+
O = f + (F >>> 3) + A(e, v, 7 & F), v += 7 & F;
|
|
743
743
|
}
|
|
744
744
|
var k = b[s(e, v) & c];
|
|
745
745
|
v += 15 & k;
|
|
746
746
|
var X = k >>> 4, z = h.ddef[X], Q = (z >>> 4) + m(e, v, 15 & z);
|
|
747
|
-
for (v += 15 & z, E && (t = d.F._check(t, f + (1 << 17))); f <
|
|
748
|
-
f =
|
|
747
|
+
for (v += 15 & z, E && (t = d.F._check(t, f + (1 << 17))); f < O;) t[f] = t[f++ - Q], t[f] = t[f++ - Q], t[f] = t[f++ - Q], t[f] = t[f++ - Q];
|
|
748
|
+
f = O;
|
|
749
749
|
}
|
|
750
750
|
}
|
|
751
751
|
} else {
|
|
@@ -1048,12 +1048,12 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1048
1048
|
}
|
|
1049
1049
|
};
|
|
1050
1050
|
function T(r, i, n, s) {
|
|
1051
|
-
const h = i * n, E = t(s), x = Math.ceil(i * E / 8), b = new Uint8Array(4 * h), D = new Uint32Array(b.buffer), { ctype:
|
|
1052
|
-
if (
|
|
1051
|
+
const h = i * n, E = t(s), x = Math.ceil(i * E / 8), b = new Uint8Array(4 * h), D = new Uint32Array(b.buffer), { ctype: L } = s, { depth: M } = s, B = P.readUshort;
|
|
1052
|
+
if (L == 6) {
|
|
1053
1053
|
const F = h << 2;
|
|
1054
1054
|
if (M == 8) for (var g = 0; g < F; g += 4) b[g] = r[g], b[g + 1] = r[g + 1], b[g + 2] = r[g + 2], b[g + 3] = r[g + 3];
|
|
1055
1055
|
if (M == 16) for (g = 0; g < F; g++) b[g] = r[g << 1];
|
|
1056
|
-
} else if (
|
|
1056
|
+
} else if (L == 2) {
|
|
1057
1057
|
const F = s.tabs.tRNS;
|
|
1058
1058
|
if (F == null) {
|
|
1059
1059
|
if (M == 8) for (g = 0; g < h; g++) {
|
|
@@ -1070,23 +1070,23 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1070
1070
|
}
|
|
1071
1071
|
if (M == 16) for (g = 0; g < h; g++) f = g << 2, R = 6 * g, D[g] = 255 << 24 | r[R + 4] << 16 | r[R + 2] << 8 | r[R], B(r, R) == c && B(r, R + 2) == k && B(r, R + 4) == X && (b[f + 3] = 0);
|
|
1072
1072
|
}
|
|
1073
|
-
} else if (
|
|
1073
|
+
} else if (L == 3) {
|
|
1074
1074
|
const F = s.tabs.PLTE, k = s.tabs.tRNS, X = k ? k.length : 0;
|
|
1075
1075
|
if (M == 1) for (var v = 0; v < n; v++) {
|
|
1076
|
-
var
|
|
1076
|
+
var w = v * x, y = v * i;
|
|
1077
1077
|
for (g = 0; g < i; g++) {
|
|
1078
|
-
f =
|
|
1079
|
-
var U = 3 * (p = r[
|
|
1078
|
+
f = y + g << 2;
|
|
1079
|
+
var U = 3 * (p = r[w + (g >> 3)] >> 7 - ((7 & g) << 0) & 1);
|
|
1080
1080
|
b[f] = F[U], b[f + 1] = F[U + 1], b[f + 2] = F[U + 2], b[f + 3] = p < X ? k[p] : 255;
|
|
1081
1081
|
}
|
|
1082
1082
|
}
|
|
1083
|
-
if (M == 2) for (v = 0; v < n; v++) for (
|
|
1084
|
-
if (M == 4) for (v = 0; v < n; v++) for (
|
|
1083
|
+
if (M == 2) for (v = 0; v < n; v++) for (w = v * x, y = v * i, g = 0; g < i; g++) f = y + g << 2, U = 3 * (p = r[w + (g >> 2)] >> 6 - ((3 & g) << 1) & 3), b[f] = F[U], b[f + 1] = F[U + 1], b[f + 2] = F[U + 2], b[f + 3] = p < X ? k[p] : 255;
|
|
1084
|
+
if (M == 4) for (v = 0; v < n; v++) for (w = v * x, y = v * i, g = 0; g < i; g++) f = y + g << 2, U = 3 * (p = r[w + (g >> 1)] >> 4 - ((1 & g) << 2) & 15), b[f] = F[U], b[f + 1] = F[U + 1], b[f + 2] = F[U + 2], b[f + 3] = p < X ? k[p] : 255;
|
|
1085
1085
|
if (M == 8) for (g = 0; g < h; g++) {
|
|
1086
1086
|
var p;
|
|
1087
1087
|
f = g << 2, U = 3 * (p = r[g]), b[f] = F[U], b[f + 1] = F[U + 1], b[f + 2] = F[U + 2], b[f + 3] = p < X ? k[p] : 255;
|
|
1088
1088
|
}
|
|
1089
|
-
} else if (
|
|
1089
|
+
} else if (L == 4) {
|
|
1090
1090
|
if (M == 8) for (g = 0; g < h; g++) {
|
|
1091
1091
|
f = g << 2;
|
|
1092
1092
|
var I = r[l = g << 1];
|
|
@@ -1096,25 +1096,25 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1096
1096
|
var l;
|
|
1097
1097
|
f = g << 2, I = r[l = g << 2], b[f] = I, b[f + 1] = I, b[f + 2] = I, b[f + 3] = r[l + 2];
|
|
1098
1098
|
}
|
|
1099
|
-
} else if (
|
|
1099
|
+
} else if (L == 0) for (c = s.tabs.tRNS ? s.tabs.tRNS : -1, v = 0; v < n; v++) {
|
|
1100
1100
|
const F = v * x, k = v * i;
|
|
1101
1101
|
if (M == 1) for (var o = 0; o < i; o++) {
|
|
1102
|
-
var
|
|
1103
|
-
D[k + o] =
|
|
1102
|
+
var O = (I = 255 * (r[F + (o >>> 3)] >>> 7 - (7 & o) & 1)) == 255 * c ? 0 : 255;
|
|
1103
|
+
D[k + o] = O << 24 | I << 16 | I << 8 | I;
|
|
1104
1104
|
}
|
|
1105
|
-
else if (M == 2) for (o = 0; o < i; o++)
|
|
1106
|
-
else if (M == 4) for (o = 0; o < i; o++)
|
|
1107
|
-
else if (M == 8) for (o = 0; o < i; o++)
|
|
1108
|
-
else if (M == 16) for (o = 0; o < i; o++) I = r[F + (o << 1)],
|
|
1105
|
+
else if (M == 2) for (o = 0; o < i; o++) O = (I = 85 * (r[F + (o >>> 2)] >>> 6 - ((3 & o) << 1) & 3)) == 85 * c ? 0 : 255, D[k + o] = O << 24 | I << 16 | I << 8 | I;
|
|
1106
|
+
else if (M == 4) for (o = 0; o < i; o++) O = (I = 17 * (r[F + (o >>> 1)] >>> 4 - ((1 & o) << 2) & 15)) == 17 * c ? 0 : 255, D[k + o] = O << 24 | I << 16 | I << 8 | I;
|
|
1107
|
+
else if (M == 8) for (o = 0; o < i; o++) O = (I = r[F + o]) == c ? 0 : 255, D[k + o] = O << 24 | I << 16 | I << 8 | I;
|
|
1108
|
+
else if (M == 16) for (o = 0; o < i; o++) I = r[F + (o << 1)], O = B(r, F + (o << 1)) == c ? 0 : 255, D[k + o] = O << 24 | I << 16 | I << 8 | I;
|
|
1109
1109
|
}
|
|
1110
1110
|
return b;
|
|
1111
1111
|
}
|
|
1112
1112
|
function H(r, i, n, s) {
|
|
1113
1113
|
const h = t(r), E = Math.ceil(n * h / 8), x = new Uint8Array((E + 1 + r.interlace) * s);
|
|
1114
|
-
return i = r.tabs.CgBI ? e(i, x) : d(i, x), r.interlace == 0 ? i = u(i, r, 0, n, s) : r.interlace == 1 && (i = (function(D,
|
|
1115
|
-
const M =
|
|
1114
|
+
return i = r.tabs.CgBI ? e(i, x) : d(i, x), r.interlace == 0 ? i = u(i, r, 0, n, s) : r.interlace == 1 && (i = (function(D, L) {
|
|
1115
|
+
const M = L.width, B = L.height, g = t(L), R = g >> 3, c = Math.ceil(M * g / 8), f = new Uint8Array(B * c);
|
|
1116
1116
|
let v = 0;
|
|
1117
|
-
const
|
|
1117
|
+
const w = [
|
|
1118
1118
|
0,
|
|
1119
1119
|
0,
|
|
1120
1120
|
4,
|
|
@@ -1122,7 +1122,7 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1122
1122
|
2,
|
|
1123
1123
|
0,
|
|
1124
1124
|
1
|
|
1125
|
-
],
|
|
1125
|
+
], y = [
|
|
1126
1126
|
0,
|
|
1127
1127
|
4,
|
|
1128
1128
|
0,
|
|
@@ -1149,23 +1149,23 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1149
1149
|
];
|
|
1150
1150
|
let I = 0;
|
|
1151
1151
|
for (; I < 7;) {
|
|
1152
|
-
const o = U[I],
|
|
1153
|
-
let F = 0, k = 0, X =
|
|
1152
|
+
const o = U[I], O = p[I];
|
|
1153
|
+
let F = 0, k = 0, X = w[I];
|
|
1154
1154
|
for (; X < B;) X += o, k++;
|
|
1155
|
-
let z =
|
|
1156
|
-
for (; z < M;) z +=
|
|
1155
|
+
let z = y[I];
|
|
1156
|
+
for (; z < M;) z += O, F++;
|
|
1157
1157
|
const Q = Math.ceil(F * g / 8);
|
|
1158
|
-
u(D,
|
|
1159
|
-
let j = 0, C =
|
|
1158
|
+
u(D, L, v, F, k);
|
|
1159
|
+
let j = 0, C = w[I];
|
|
1160
1160
|
for (; C < B;) {
|
|
1161
|
-
let q =
|
|
1161
|
+
let q = y[I], oe = v + j * Q << 3;
|
|
1162
1162
|
for (; q < M;) {
|
|
1163
1163
|
var l;
|
|
1164
1164
|
if (g == 1 && (l = (l = D[oe >> 3]) >> 7 - (7 & oe) & 1, f[C * c + (q >> 3)] |= l << 7 - ((7 & q) << 0)), g == 2 && (l = (l = D[oe >> 3]) >> 6 - (7 & oe) & 3, f[C * c + (q >> 2)] |= l << 6 - ((3 & q) << 1)), g == 4 && (l = (l = D[oe >> 3]) >> 4 - (7 & oe) & 15, f[C * c + (q >> 1)] |= l << 4 - ((1 & q) << 2)), g >= 8) {
|
|
1165
1165
|
const te = C * c + q * R;
|
|
1166
1166
|
for (let J = 0; J < R; J++) f[te + J] = D[(oe >> 3) + J];
|
|
1167
1167
|
}
|
|
1168
|
-
oe += g, q +=
|
|
1168
|
+
oe += g, q += O;
|
|
1169
1169
|
}
|
|
1170
1170
|
j++, C += o;
|
|
1171
1171
|
}
|
|
@@ -1181,22 +1181,22 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1181
1181
|
const r = { H: {} };
|
|
1182
1182
|
return r.H.N = function(i, n) {
|
|
1183
1183
|
const s = Uint8Array;
|
|
1184
|
-
let h, E, x = 0, b = 0, D = 0,
|
|
1184
|
+
let h, E, x = 0, b = 0, D = 0, L = 0, M = 0, B = 0, g = 0, R = 0, c = 0;
|
|
1185
1185
|
if (i[0] == 3 && i[1] == 0) return n || new s(0);
|
|
1186
|
-
const f = r.H, v = f.b,
|
|
1186
|
+
const f = r.H, v = f.b, w = f.e, y = f.R, U = f.n, p = f.A, I = f.Z, l = f.m, o = n == null;
|
|
1187
1187
|
for (o && (n = new s(i.length >>> 2 << 5)); x == 0;) if (x = v(i, c, 1), b = v(i, c + 1, 2), c += 3, b != 0) {
|
|
1188
1188
|
if (o && (n = r.H.W(n, R + (1 << 17))), b == 1 && (h = l.J, E = l.h, B = 511, g = 31), b == 2) {
|
|
1189
|
-
D =
|
|
1189
|
+
D = w(i, c, 5) + 257, L = w(i, c + 5, 5) + 1, M = w(i, c + 10, 4) + 4, c += 14;
|
|
1190
1190
|
let F = 1;
|
|
1191
|
-
for (var
|
|
1192
|
-
for (
|
|
1193
|
-
const z =
|
|
1194
|
-
l.Q[1 + (l.X[
|
|
1191
|
+
for (var O = 0; O < 38; O += 2) l.Q[O] = 0, l.Q[O + 1] = 0;
|
|
1192
|
+
for (O = 0; O < M; O++) {
|
|
1193
|
+
const z = w(i, c + 3 * O, 3);
|
|
1194
|
+
l.Q[1 + (l.X[O] << 1)] = z, z > F && (F = z);
|
|
1195
1195
|
}
|
|
1196
|
-
c += 3 * M, U(l.Q, F), p(l.Q, F, l.u), h = l.w, E = l.d, c =
|
|
1196
|
+
c += 3 * M, U(l.Q, F), p(l.Q, F, l.u), h = l.w, E = l.d, c = y(l.u, (1 << F) - 1, D + L, i, c, l.v);
|
|
1197
1197
|
const k = f.V(l.v, 0, D, l.C);
|
|
1198
1198
|
B = (1 << k) - 1;
|
|
1199
|
-
const X = f.V(l.v, D,
|
|
1199
|
+
const X = f.V(l.v, D, L, l.D);
|
|
1200
1200
|
g = (1 << X) - 1, U(l.C, k), p(l.C, k, h), U(l.D, X), p(l.D, X, E);
|
|
1201
1201
|
}
|
|
1202
1202
|
for (;;) {
|
|
@@ -1210,7 +1210,7 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1210
1210
|
let X = R + k - 254;
|
|
1211
1211
|
if (k > 264) {
|
|
1212
1212
|
const q = l.q[k - 257];
|
|
1213
|
-
X = R + (q >>> 3) +
|
|
1213
|
+
X = R + (q >>> 3) + w(i, c, 7 & q), c += 7 & q;
|
|
1214
1214
|
}
|
|
1215
1215
|
const z = E[I(i, c) & g];
|
|
1216
1216
|
c += 15 & z;
|
|
@@ -1233,17 +1233,17 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1233
1233
|
return h.set(i, 0), h;
|
|
1234
1234
|
}, r.H.R = function(i, n, s, h, E, x) {
|
|
1235
1235
|
const b = r.H.e, D = r.H.Z;
|
|
1236
|
-
let
|
|
1237
|
-
for (;
|
|
1236
|
+
let L = 0;
|
|
1237
|
+
for (; L < s;) {
|
|
1238
1238
|
const M = i[D(h, E) & n];
|
|
1239
1239
|
E += 15 & M;
|
|
1240
1240
|
const B = M >>> 4;
|
|
1241
|
-
if (B <= 15) x[
|
|
1241
|
+
if (B <= 15) x[L] = B, L++;
|
|
1242
1242
|
else {
|
|
1243
1243
|
let g = 0, R = 0;
|
|
1244
|
-
B == 16 ? (R = 3 + b(h, E, 2), E += 2, g = x[
|
|
1245
|
-
const c =
|
|
1246
|
-
for (;
|
|
1244
|
+
B == 16 ? (R = 3 + b(h, E, 2), E += 2, g = x[L - 1]) : B == 17 ? (R = 3 + b(h, E, 3), E += 3) : B == 18 && (R = 11 + b(h, E, 7), E += 7);
|
|
1245
|
+
const c = L + R;
|
|
1246
|
+
for (; L < c;) x[L] = g, L++;
|
|
1247
1247
|
}
|
|
1248
1248
|
}
|
|
1249
1249
|
return E;
|
|
@@ -1259,19 +1259,19 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1259
1259
|
}, r.H.n = function(i, n) {
|
|
1260
1260
|
const s = r.H.m, h = i.length;
|
|
1261
1261
|
let E, x, b, D;
|
|
1262
|
-
const
|
|
1263
|
-
for (var M = 0; M <= n; M++)
|
|
1264
|
-
for (M = 1; M < h; M += 2)
|
|
1262
|
+
const L = s.j;
|
|
1263
|
+
for (var M = 0; M <= n; M++) L[M] = 0;
|
|
1264
|
+
for (M = 1; M < h; M += 2) L[i[M]]++;
|
|
1265
1265
|
const B = s.K;
|
|
1266
|
-
for (E = 0,
|
|
1266
|
+
for (E = 0, L[0] = 0, x = 1; x <= n; x++) E = E + L[x - 1] << 1, B[x] = E;
|
|
1267
1267
|
for (b = 0; b < h; b += 2) D = i[b + 1], D != 0 && (i[b] = B[D], B[D]++);
|
|
1268
1268
|
}, r.H.A = function(i, n, s) {
|
|
1269
1269
|
const h = i.length, E = r.H.m.r;
|
|
1270
1270
|
for (let x = 0; x < h; x += 2) if (i[x + 1] != 0) {
|
|
1271
|
-
const b = x >> 1, D = i[x + 1],
|
|
1271
|
+
const b = x >> 1, D = i[x + 1], L = b << 4 | D, M = n - D;
|
|
1272
1272
|
let B = i[x] << M;
|
|
1273
1273
|
const g = B + (1 << M);
|
|
1274
|
-
for (; B != g;) s[E[B] >>> 15 - n] =
|
|
1274
|
+
for (; B != g;) s[E[B] >>> 15 - n] = L, B++;
|
|
1275
1275
|
}
|
|
1276
1276
|
}, r.H.l = function(i, n) {
|
|
1277
1277
|
const s = r.H.m.r, h = 15 - n;
|
|
@@ -1504,18 +1504,18 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1504
1504
|
const x = Math.ceil(s * E / 8);
|
|
1505
1505
|
let b, D;
|
|
1506
1506
|
E = Math.ceil(E / 8);
|
|
1507
|
-
let
|
|
1508
|
-
if (
|
|
1507
|
+
let L = r[n], M = 0;
|
|
1508
|
+
if (L > 1 && (r[n] = [
|
|
1509
1509
|
0,
|
|
1510
1510
|
0,
|
|
1511
1511
|
1
|
|
1512
|
-
][
|
|
1513
|
-
for (let B = 0; B < h; B++) if (b = n + B * x, D = b + B + 1,
|
|
1514
|
-
else if (
|
|
1512
|
+
][L - 2]), L == 3) for (M = E; M < x; M++) r[M + 1] = r[M + 1] + (r[M + 1 - E] >>> 1) & 255;
|
|
1513
|
+
for (let B = 0; B < h; B++) if (b = n + B * x, D = b + B + 1, L = r[D - 1], M = 0, L == 0) for (; M < x; M++) r[b + M] = r[D + M];
|
|
1514
|
+
else if (L == 1) {
|
|
1515
1515
|
for (; M < E; M++) r[b + M] = r[D + M];
|
|
1516
1516
|
for (; M < x; M++) r[b + M] = r[D + M] + r[b + M - E];
|
|
1517
|
-
} else if (
|
|
1518
|
-
else if (
|
|
1517
|
+
} else if (L == 2) for (; M < x; M++) r[b + M] = r[D + M] + r[b + M - x];
|
|
1518
|
+
else if (L == 3) {
|
|
1519
1519
|
for (; M < E; M++) r[b + M] = r[D + M] + (r[b + M - x] >>> 1);
|
|
1520
1520
|
for (; M < x; M++) r[b + M] = r[D + M] + (r[b + M - x] + r[b + M - E] >>> 1);
|
|
1521
1521
|
} else {
|
|
@@ -1532,17 +1532,17 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1532
1532
|
n.width = P.readUint(r, i), i += 4, n.height = P.readUint(r, i), i += 4, n.depth = r[i], i++, n.ctype = r[i], i++, n.compress = r[i], i++, n.filter = r[i], i++, n.interlace = r[i], i++;
|
|
1533
1533
|
}
|
|
1534
1534
|
function A(r, i, n, s, h, E, x, b, D) {
|
|
1535
|
-
const
|
|
1535
|
+
const L = Math.min(i, h), M = Math.min(n, E);
|
|
1536
1536
|
let B = 0, g = 0;
|
|
1537
|
-
for (let I = 0; I < M; I++) for (let l = 0; l <
|
|
1537
|
+
for (let I = 0; I < M; I++) for (let l = 0; l < L; l++) if (x >= 0 && b >= 0 ? (B = I * i + l << 2, g = (b + I) * h + x + l << 2) : (B = (-b + I) * i - x + l << 2, g = I * h + l << 2), D == 0) s[g] = r[B], s[g + 1] = r[B + 1], s[g + 2] = r[B + 2], s[g + 3] = r[B + 3];
|
|
1538
1538
|
else if (D == 1) {
|
|
1539
|
-
var R = r[B + 3] * .00392156862745098, c = r[B] * R, f = r[B + 1] * R, v = r[B + 2] * R,
|
|
1540
|
-
const o = 1 - R,
|
|
1541
|
-
s[g + 3] = 255 *
|
|
1542
|
-
} else if (D == 2) R = r[B + 3], c = r[B], f = r[B + 1], v = r[B + 2],
|
|
1539
|
+
var R = r[B + 3] * .00392156862745098, c = r[B] * R, f = r[B + 1] * R, v = r[B + 2] * R, w = s[g + 3] * (1 / 255), y = s[g] * w, U = s[g + 1] * w, p = s[g + 2] * w;
|
|
1540
|
+
const o = 1 - R, O = R + w * o, F = O == 0 ? 0 : 1 / O;
|
|
1541
|
+
s[g + 3] = 255 * O, s[g + 0] = (c + y * o) * F, s[g + 1] = (f + U * o) * F, s[g + 2] = (v + p * o) * F;
|
|
1542
|
+
} else if (D == 2) R = r[B + 3], c = r[B], f = r[B + 1], v = r[B + 2], w = s[g + 3], y = s[g], U = s[g + 1], p = s[g + 2], R == w && c == y && f == U && v == p ? (s[g] = 0, s[g + 1] = 0, s[g + 2] = 0, s[g + 3] = 0) : (s[g] = c, s[g + 1] = f, s[g + 2] = v, s[g + 3] = R);
|
|
1543
1543
|
else if (D == 3) {
|
|
1544
|
-
if (R = r[B + 3], c = r[B], f = r[B + 1], v = r[B + 2],
|
|
1545
|
-
if (R < 220 &&
|
|
1544
|
+
if (R = r[B + 3], c = r[B], f = r[B + 1], v = r[B + 2], w = s[g + 3], y = s[g], U = s[g + 1], p = s[g + 2], R == w && c == y && f == U && v == p) continue;
|
|
1545
|
+
if (R < 220 && w > 20) return !1;
|
|
1546
1546
|
}
|
|
1547
1547
|
return !0;
|
|
1548
1548
|
}
|
|
@@ -1554,7 +1554,7 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1554
1554
|
tabs: {},
|
|
1555
1555
|
frames: []
|
|
1556
1556
|
}, D = new Uint8Array(n.length);
|
|
1557
|
-
let
|
|
1557
|
+
let L, M = 0, B = 0;
|
|
1558
1558
|
const g = [
|
|
1559
1559
|
137,
|
|
1560
1560
|
80,
|
|
@@ -1575,13 +1575,13 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1575
1575
|
for (var c = s; n[c] != 0;) c++;
|
|
1576
1576
|
h.readASCII(n, s, c - s), n[c + 1];
|
|
1577
1577
|
const o = n.slice(c + 2, s + I);
|
|
1578
|
-
let
|
|
1578
|
+
let O = null;
|
|
1579
1579
|
try {
|
|
1580
|
-
|
|
1580
|
+
O = d(o);
|
|
1581
1581
|
} catch {
|
|
1582
|
-
|
|
1582
|
+
O = e(o);
|
|
1583
1583
|
}
|
|
1584
|
-
b.tabs[l] =
|
|
1584
|
+
b.tabs[l] = O;
|
|
1585
1585
|
} else if (l == "CgBI") b.tabs[l] = n.slice(s, s + 4);
|
|
1586
1586
|
else if (l == "IDAT") {
|
|
1587
1587
|
for (R = 0; R < I; R++) D[M + R] = n[s + R];
|
|
@@ -1589,26 +1589,26 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1589
1589
|
} else if (l == "acTL") b.tabs[l] = {
|
|
1590
1590
|
num_frames: x(n, s),
|
|
1591
1591
|
num_plays: x(n, s + 4)
|
|
1592
|
-
},
|
|
1592
|
+
}, L = new Uint8Array(n.length);
|
|
1593
1593
|
else if (l == "fcTL") {
|
|
1594
|
-
B != 0 && ((p = b.frames[b.frames.length - 1]).data = H(b,
|
|
1594
|
+
B != 0 && ((p = b.frames[b.frames.length - 1]).data = H(b, L.slice(0, B), p.rect.width, p.rect.height), B = 0);
|
|
1595
1595
|
const o = {
|
|
1596
1596
|
x: x(n, s + 12),
|
|
1597
1597
|
y: x(n, s + 16),
|
|
1598
1598
|
width: x(n, s + 4),
|
|
1599
1599
|
height: x(n, s + 8)
|
|
1600
1600
|
};
|
|
1601
|
-
let
|
|
1602
|
-
|
|
1601
|
+
let O = E(n, s + 22);
|
|
1602
|
+
O = E(n, s + 20) / (O == 0 ? 100 : O);
|
|
1603
1603
|
const F = {
|
|
1604
1604
|
rect: o,
|
|
1605
|
-
delay: Math.round(1e3 *
|
|
1605
|
+
delay: Math.round(1e3 * O),
|
|
1606
1606
|
dispose: n[s + 24],
|
|
1607
1607
|
blend: n[s + 25]
|
|
1608
1608
|
};
|
|
1609
1609
|
b.frames.push(F);
|
|
1610
1610
|
} else if (l == "fdAT") {
|
|
1611
|
-
for (R = 0; R < I - 4; R++)
|
|
1611
|
+
for (R = 0; R < I - 4; R++) L[B + R] = n[s + R + 4];
|
|
1612
1612
|
B += I - 4;
|
|
1613
1613
|
} else if (l == "pHYs") b.tabs[l] = [
|
|
1614
1614
|
h.readUint(n, s),
|
|
@@ -1618,18 +1618,18 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1618
1618
|
else if (l == "cHRM") for (b.tabs[l] = [], R = 0; R < 8; R++) b.tabs[l].push(h.readUint(n, s + 4 * R));
|
|
1619
1619
|
else if (l == "tEXt" || l == "zTXt") {
|
|
1620
1620
|
b.tabs[l] ?? (b.tabs[l] = {});
|
|
1621
|
-
var f = h.nextZero(n, s), v = h.readASCII(n, s, f - s),
|
|
1622
|
-
if (l == "tEXt") U = h.readASCII(n, f + 1,
|
|
1621
|
+
var f = h.nextZero(n, s), v = h.readASCII(n, s, f - s), w = s + I - f - 1;
|
|
1622
|
+
if (l == "tEXt") U = h.readASCII(n, f + 1, w);
|
|
1623
1623
|
else {
|
|
1624
|
-
var
|
|
1625
|
-
U = h.readUTF8(
|
|
1624
|
+
var y = d(n.slice(f + 2, f + 2 + w));
|
|
1625
|
+
U = h.readUTF8(y, 0, y.length);
|
|
1626
1626
|
}
|
|
1627
1627
|
b.tabs[l][v] = U;
|
|
1628
1628
|
} else if (l == "iTXt") {
|
|
1629
1629
|
b.tabs[l] ?? (b.tabs[l] = {}), f = 0, c = s, f = h.nextZero(n, c), v = h.readASCII(n, c, f - c);
|
|
1630
1630
|
const o = n[c = f + 1];
|
|
1631
1631
|
var U;
|
|
1632
|
-
n[c + 1], c += 2, f = h.nextZero(n, c), h.readASCII(n, c, f - c), c = f + 1, f = h.nextZero(n, c), h.readUTF8(n, c, f - c),
|
|
1632
|
+
n[c + 1], c += 2, f = h.nextZero(n, c), h.readASCII(n, c, f - c), c = f + 1, f = h.nextZero(n, c), h.readUTF8(n, c, f - c), w = I - ((c = f + 1) - s), o == 0 ? U = h.readUTF8(n, c, w) : (y = d(n.slice(c, c + w)), U = h.readUTF8(y, 0, y.length)), b.tabs[l][v] = U;
|
|
1633
1633
|
} else if (l == "PLTE") b.tabs[l] = h.readBytes(n, s, I);
|
|
1634
1634
|
else if (l == "hIST") {
|
|
1635
1635
|
const o = b.tabs.PLTE.length / 3;
|
|
@@ -1650,7 +1650,7 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1650
1650
|
s += I, h.readUint(n, s), s += 4;
|
|
1651
1651
|
}
|
|
1652
1652
|
var p;
|
|
1653
|
-
return B != 0 && ((p = b.frames[b.frames.length - 1]).data = H(b,
|
|
1653
|
+
return B != 0 && ((p = b.frames[b.frames.length - 1]).data = H(b, L.slice(0, B), p.rect.width, p.rect.height)), b.data = H(b, D, b.width, b.height), delete b.compress, delete b.interlace, delete b.filter, b;
|
|
1654
1654
|
},
|
|
1655
1655
|
toRGBA8: function(i) {
|
|
1656
1656
|
const n = i.width, s = i.height;
|
|
@@ -1660,10 +1660,10 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1660
1660
|
const E = n * s * 4, x = new Uint8Array(E), b = new Uint8Array(E), D = new Uint8Array(E);
|
|
1661
1661
|
for (let M = 0; M < i.frames.length; M++) {
|
|
1662
1662
|
const B = i.frames[M], g = B.rect.x, R = B.rect.y, c = B.rect.width, f = B.rect.height, v = T(B.data, c, f, i);
|
|
1663
|
-
if (M != 0) for (var
|
|
1663
|
+
if (M != 0) for (var L = 0; L < E; L++) D[L] = x[L];
|
|
1664
1664
|
if (B.blend == 0 ? A(v, c, f, x, n, s, g, R, 0) : B.blend == 1 && A(v, c, f, x, n, s, g, R, 1), h.push(x.buffer.slice(0)), B.dispose != 0) {
|
|
1665
1665
|
if (B.dispose == 1) A(b, c, f, x, n, s, g, R, 0);
|
|
1666
|
-
else if (B.dispose == 2) for (
|
|
1666
|
+
else if (B.dispose == 2) for (L = 0; L < E; L++) x[L] = D[L];
|
|
1667
1667
|
}
|
|
1668
1668
|
}
|
|
1669
1669
|
return h;
|
|
@@ -1680,32 +1680,32 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1680
1680
|
const c = new Uint32Array(256);
|
|
1681
1681
|
for (let f = 0; f < 256; f++) {
|
|
1682
1682
|
let v = f;
|
|
1683
|
-
for (let
|
|
1683
|
+
for (let w = 0; w < 8; w++) 1 & v ? v = 3988292384 ^ v >>> 1 : v >>>= 1;
|
|
1684
1684
|
c[f] = v;
|
|
1685
1685
|
}
|
|
1686
1686
|
return c;
|
|
1687
1687
|
})(),
|
|
1688
|
-
update(c, f, v,
|
|
1689
|
-
for (let
|
|
1688
|
+
update(c, f, v, w) {
|
|
1689
|
+
for (let y = 0; y < w; y++) c = d.table[255 & (c ^ f[v + y])] ^ c >>> 8;
|
|
1690
1690
|
return c;
|
|
1691
1691
|
},
|
|
1692
1692
|
crc: (c, f, v) => 4294967295 ^ d.update(4294967295, c, f, v)
|
|
1693
1693
|
};
|
|
1694
|
-
function e(c, f, v,
|
|
1695
|
-
f[v] += c[0] *
|
|
1694
|
+
function e(c, f, v, w) {
|
|
1695
|
+
f[v] += c[0] * w >> 4, f[v + 1] += c[1] * w >> 4, f[v + 2] += c[2] * w >> 4, f[v + 3] += c[3] * w >> 4;
|
|
1696
1696
|
}
|
|
1697
1697
|
function t(c) {
|
|
1698
1698
|
return Math.max(0, Math.min(255, c));
|
|
1699
1699
|
}
|
|
1700
1700
|
function u(c, f) {
|
|
1701
|
-
const v = c[0] - f[0],
|
|
1702
|
-
return v * v +
|
|
1701
|
+
const v = c[0] - f[0], w = c[1] - f[1], y = c[2] - f[2], U = c[3] - f[3];
|
|
1702
|
+
return v * v + w * w + y * y + U * U;
|
|
1703
1703
|
}
|
|
1704
|
-
function a(c, f, v,
|
|
1704
|
+
function a(c, f, v, w, y, U, p) {
|
|
1705
1705
|
p ??= 1;
|
|
1706
|
-
const I =
|
|
1706
|
+
const I = w.length, l = [];
|
|
1707
1707
|
for (var o = 0; o < I; o++) {
|
|
1708
|
-
const C =
|
|
1708
|
+
const C = w[o];
|
|
1709
1709
|
l.push([
|
|
1710
1710
|
C >>> 0 & 255,
|
|
1711
1711
|
C >>> 8 & 255,
|
|
@@ -1715,12 +1715,12 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1715
1715
|
}
|
|
1716
1716
|
for (o = 0; o < I; o++) {
|
|
1717
1717
|
let C = 4294967295;
|
|
1718
|
-
for (var
|
|
1718
|
+
for (var O = 0, F = 0; F < I; F++) {
|
|
1719
1719
|
var k = u(l[o], l[F]);
|
|
1720
|
-
F != o && k < C && (C = k,
|
|
1720
|
+
F != o && k < C && (C = k, O = F);
|
|
1721
1721
|
}
|
|
1722
1722
|
}
|
|
1723
|
-
const X = new Uint32Array(
|
|
1723
|
+
const X = new Uint32Array(y.buffer), z = new Int16Array(f * v * 4), Q = [
|
|
1724
1724
|
0,
|
|
1725
1725
|
8,
|
|
1726
1726
|
2,
|
|
@@ -1751,32 +1751,32 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1751
1751
|
t(c[o + 1] + k),
|
|
1752
1752
|
t(c[o + 2] + k),
|
|
1753
1753
|
t(c[o + 3] + k)
|
|
1754
|
-
]),
|
|
1754
|
+
]), O = 0;
|
|
1755
1755
|
let oe = 16777215;
|
|
1756
1756
|
for (F = 0; F < I; F++) {
|
|
1757
1757
|
const re = u(j, l[F]);
|
|
1758
|
-
re < oe && (oe = re,
|
|
1758
|
+
re < oe && (oe = re, O = F);
|
|
1759
1759
|
}
|
|
1760
|
-
const te = l[
|
|
1760
|
+
const te = l[O], J = [
|
|
1761
1761
|
j[0] - te[0],
|
|
1762
1762
|
j[1] - te[1],
|
|
1763
1763
|
j[2] - te[2],
|
|
1764
1764
|
j[3] - te[3]
|
|
1765
1765
|
];
|
|
1766
|
-
p == 1 && (q != f - 1 && e(J, z, o + 4, 7), C != v - 1 && (q != 0 && e(J, z, o + 4 * f - 4, 3), e(J, z, o + 4 * f, 5), q != f - 1 && e(J, z, o + 4 * f + 4, 1))), U[o >> 2] =
|
|
1766
|
+
p == 1 && (q != f - 1 && e(J, z, o + 4, 7), C != v - 1 && (q != 0 && e(J, z, o + 4 * f - 4, 3), e(J, z, o + 4 * f, 5), q != f - 1 && e(J, z, o + 4 * f + 4, 1))), U[o >> 2] = O, X[o >> 2] = w[O];
|
|
1767
1767
|
}
|
|
1768
1768
|
}
|
|
1769
|
-
function m(c, f, v,
|
|
1770
|
-
|
|
1769
|
+
function m(c, f, v, w, y) {
|
|
1770
|
+
y ??= {};
|
|
1771
1771
|
const { crc: U } = d, p = T.writeUint, I = T.writeUshort, l = T.writeASCII;
|
|
1772
1772
|
let o = 8;
|
|
1773
|
-
const
|
|
1774
|
-
let F, k = !1, X = 33 + (
|
|
1775
|
-
if (
|
|
1773
|
+
const O = c.frames.length > 1;
|
|
1774
|
+
let F, k = !1, X = 33 + (O ? 20 : 0);
|
|
1775
|
+
if (y.sRGB != null && (X += 13), y.pHYs != null && (X += 21), y.iCCP != null && (F = pako.deflate(y.iCCP), X += 21 + F.length + 4), c.ctype == 3) {
|
|
1776
1776
|
for (var z = c.plte.length, Q = 0; Q < z; Q++) c.plte[Q] >>> 24 != 255 && (k = !0);
|
|
1777
1777
|
X += 8 + 3 * z + 4 + (k ? 8 + 1 * z + 4 : 0);
|
|
1778
1778
|
}
|
|
1779
|
-
for (var j = 0; j < c.frames.length; j++)
|
|
1779
|
+
for (var j = 0; j < c.frames.length; j++) O && (X += 38), X += (te = c.frames[j]).cimg.length + 12, j != 0 && (X += 4);
|
|
1780
1780
|
X += 12;
|
|
1781
1781
|
const C = new Uint8Array(X), q = [
|
|
1782
1782
|
137,
|
|
@@ -1789,11 +1789,11 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1789
1789
|
10
|
|
1790
1790
|
];
|
|
1791
1791
|
for (Q = 0; Q < 8; Q++) C[Q] = q[Q];
|
|
1792
|
-
if (p(C, o, 13), o += 4, l(C, o, "IHDR"), o += 4, p(C, o, f), o += 4, p(C, o, v), o += 4, C[o] = c.depth, o++, C[o] = c.ctype, o++, C[o] = 0, o++, C[o] = 0, o++, C[o] = 0, o++, p(C, o, U(C, o - 17, 17)), o += 4,
|
|
1792
|
+
if (p(C, o, 13), o += 4, l(C, o, "IHDR"), o += 4, p(C, o, f), o += 4, p(C, o, v), o += 4, C[o] = c.depth, o++, C[o] = c.ctype, o++, C[o] = 0, o++, C[o] = 0, o++, C[o] = 0, o++, p(C, o, U(C, o - 17, 17)), o += 4, y.sRGB != null && (p(C, o, 1), o += 4, l(C, o, "sRGB"), o += 4, C[o] = y.sRGB, o++, p(C, o, U(C, o - 5, 5)), o += 4), y.iCCP != null) {
|
|
1793
1793
|
const J = 13 + F.length;
|
|
1794
1794
|
p(C, o, J), o += 4, l(C, o, "iCCP"), o += 4, l(C, o, "ICC profile"), o += 11, o += 2, C.set(F, o), o += F.length, p(C, o, U(C, o - (J + 4), J + 4)), o += 4;
|
|
1795
1795
|
}
|
|
1796
|
-
if (
|
|
1796
|
+
if (y.pHYs != null && (p(C, o, 9), o += 4, l(C, o, "pHYs"), o += 4, p(C, o, y.pHYs[0]), o += 4, p(C, o, y.pHYs[1]), o += 4, C[o] = y.pHYs[2], o++, p(C, o, U(C, o - 13, 13)), o += 4), O && (p(C, o, 8), o += 4, l(C, o, "acTL"), o += 4, p(C, o, c.frames.length), o += 4, p(C, o, y.loop != null ? y.loop : 0), o += 4, p(C, o, U(C, o - 12, 12)), o += 4), c.ctype == 3) {
|
|
1797
1797
|
for (p(C, o, 3 * (z = c.plte.length)), o += 4, l(C, o, "PLTE"), o += 4, Q = 0; Q < z; Q++) {
|
|
1798
1798
|
const J = 3 * Q, re = c.plte[Q], fe = 255 & re, ce = re >>> 8 & 255, je = re >>> 16 & 255;
|
|
1799
1799
|
C[o + J + 0] = fe, C[o + J + 1] = ce, C[o + J + 2] = je;
|
|
@@ -1806,7 +1806,7 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1806
1806
|
let oe = 0;
|
|
1807
1807
|
for (j = 0; j < c.frames.length; j++) {
|
|
1808
1808
|
var te = c.frames[j];
|
|
1809
|
-
|
|
1809
|
+
O && (p(C, o, 26), o += 4, l(C, o, "fcTL"), o += 4, p(C, o, oe++), o += 4, p(C, o, te.rect.width), o += 4, p(C, o, te.rect.height), o += 4, p(C, o, te.rect.x), o += 4, p(C, o, te.rect.y), o += 4, I(C, o, w[j]), o += 2, I(C, o, 1e3), o += 2, C[o] = te.dispose, o++, C[o] = te.blend, o++, p(C, o, U(C, o - 30, 30)), o += 4);
|
|
1810
1810
|
const J = te.cimg;
|
|
1811
1811
|
p(C, o, (z = J.length) + (j == 0 ? 0 : 4)), o += 4;
|
|
1812
1812
|
const re = o;
|
|
@@ -1815,24 +1815,24 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1815
1815
|
return p(C, o, 0), o += 4, l(C, o, "IEND"), o += 4, p(C, o, U(C, o - 4, 4)), o += 4, C.buffer;
|
|
1816
1816
|
}
|
|
1817
1817
|
function A(c, f, v) {
|
|
1818
|
-
for (let
|
|
1819
|
-
const
|
|
1820
|
-
|
|
1821
|
-
const U =
|
|
1822
|
-
|
|
1818
|
+
for (let w = 0; w < c.frames.length; w++) {
|
|
1819
|
+
const y = c.frames[w];
|
|
1820
|
+
y.rect.width;
|
|
1821
|
+
const U = y.rect.height, p = new Uint8Array(U * y.bpl + U);
|
|
1822
|
+
y.cimg = s(y.img, U, y.bpp, y.bpl, p, f, v);
|
|
1823
1823
|
}
|
|
1824
1824
|
}
|
|
1825
|
-
function r(c, f, v,
|
|
1826
|
-
const U =
|
|
1825
|
+
function r(c, f, v, w, y) {
|
|
1826
|
+
const U = y[0], p = y[1], I = y[2], l = y[3], o = y[4], O = y[5];
|
|
1827
1827
|
let F = 6, k = 8, X = 255;
|
|
1828
1828
|
for (var z = 0; z < c.length; z++) {
|
|
1829
1829
|
const be = new Uint8Array(c[z]);
|
|
1830
1830
|
for (var Q = be.length, j = 0; j < Q; j += 4) X &= be[j + 3];
|
|
1831
1831
|
}
|
|
1832
|
-
const C = X != 255, q = (function(ne, ae, le, ue,
|
|
1832
|
+
const C = X != 255, q = (function(ne, ae, le, ue, ye, de) {
|
|
1833
1833
|
const he = [];
|
|
1834
1834
|
for (var ie = 0; ie < ne.length; ie++) {
|
|
1835
|
-
const
|
|
1835
|
+
const we = new Uint8Array(ne[ie]), Fe = new Uint32Array(we.buffer);
|
|
1836
1836
|
var _e;
|
|
1837
1837
|
let Re = 0, Pe = 0, xe = ae, ze = le, pt = ue ? 1 : 0;
|
|
1838
1838
|
if (ie != 0) {
|
|
@@ -1841,19 +1841,19 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1841
1841
|
for (let Je = 0; Je < An; Je++) {
|
|
1842
1842
|
var Ye = new Uint8Array(ne[ie - 1 - Je]);
|
|
1843
1843
|
const _n = new Uint32Array(ne[ie - 1 - Je]);
|
|
1844
|
-
let
|
|
1845
|
-
for (let We = 0; We < le; We++) for (let Qe = 0; Qe < ae; Qe++) Fe[
|
|
1846
|
-
Ze == -1 && (
|
|
1847
|
-
const
|
|
1848
|
-
|
|
1844
|
+
let Oe = ae, ke = le, Ze = -1, et = -1;
|
|
1845
|
+
for (let We = 0; We < le; We++) for (let Qe = 0; Qe < ae; Qe++) Fe[Le = We * ae + Qe] != _n[Le] && (Qe < Oe && (Oe = Qe), Qe > Ze && (Ze = Qe), We < ke && (ke = We), We > et && (et = We));
|
|
1846
|
+
Ze == -1 && (Oe = ke = Ze = et = 0), ye && ((1 & Oe) == 1 && Oe--, (1 & ke) == 1 && ke--);
|
|
1847
|
+
const Lt = (Ze - Oe + 1) * (et - ke + 1);
|
|
1848
|
+
Lt < Tt && (Tt = Lt, vt = Je, Re = Oe, Pe = ke, xe = Ze - Oe + 1, ze = et - ke + 1);
|
|
1849
1849
|
}
|
|
1850
|
-
Ye = new Uint8Array(ne[ie - 1 - vt]), vt == 1 && (he[ie - 1].dispose = 2), _e = new Uint8Array(xe * ze * 4), P(Ye, ae, le, _e, xe, ze, -Re, -Pe, 0), pt = P(
|
|
1850
|
+
Ye = new Uint8Array(ne[ie - 1 - vt]), vt == 1 && (he[ie - 1].dispose = 2), _e = new Uint8Array(xe * ze * 4), P(Ye, ae, le, _e, xe, ze, -Re, -Pe, 0), pt = P(we, ae, le, _e, xe, ze, -Re, -Pe, 3) ? 1 : 0, pt == 1 ? n(we, ae, le, _e, {
|
|
1851
1851
|
x: Re,
|
|
1852
1852
|
y: Pe,
|
|
1853
1853
|
width: xe,
|
|
1854
1854
|
height: ze
|
|
1855
|
-
}) : P(
|
|
1856
|
-
} else _e =
|
|
1855
|
+
}) : P(we, ae, le, _e, xe, ze, -Re, -Pe, 0);
|
|
1856
|
+
} else _e = we.slice(0);
|
|
1857
1857
|
he.push({
|
|
1858
1858
|
rect: {
|
|
1859
1859
|
x: Re,
|
|
@@ -1868,40 +1868,40 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1868
1868
|
}
|
|
1869
1869
|
if (ue) for (ie = 0; ie < he.length; ie++) {
|
|
1870
1870
|
if ((Ne = he[ie]).blend == 1) continue;
|
|
1871
|
-
const
|
|
1871
|
+
const we = Ne.rect, Fe = he[ie - 1].rect, Re = Math.min(we.x, Fe.x), Pe = Math.min(we.y, Fe.y), xe = {
|
|
1872
1872
|
x: Re,
|
|
1873
1873
|
y: Pe,
|
|
1874
|
-
width: Math.max(
|
|
1875
|
-
height: Math.max(
|
|
1874
|
+
width: Math.max(we.x + we.width, Fe.x + Fe.width) - Re,
|
|
1875
|
+
height: Math.max(we.y + we.height, Fe.y + Fe.height) - Pe
|
|
1876
1876
|
};
|
|
1877
|
-
he[ie - 1].dispose = 1, ie - 1 != 0 && i(ne, ae, le, he, ie - 1, xe,
|
|
1877
|
+
he[ie - 1].dispose = 1, ie - 1 != 0 && i(ne, ae, le, he, ie - 1, xe, ye), i(ne, ae, le, he, ie, xe, ye);
|
|
1878
1878
|
}
|
|
1879
1879
|
let Ue = 0;
|
|
1880
|
-
if (ne.length != 1) for (var
|
|
1880
|
+
if (ne.length != 1) for (var Le = 0; Le < he.length; Le++) {
|
|
1881
1881
|
var Ne;
|
|
1882
|
-
Ue += (Ne = he[
|
|
1882
|
+
Ue += (Ne = he[Le]).rect.width * Ne.rect.height;
|
|
1883
1883
|
}
|
|
1884
1884
|
return he;
|
|
1885
1885
|
})(c, f, v, U, p, I), oe = {}, te = [], J = [];
|
|
1886
|
-
if (
|
|
1886
|
+
if (w != 0) {
|
|
1887
1887
|
const be = [];
|
|
1888
1888
|
for (j = 0; j < q.length; j++) be.push(q[j].img.buffer);
|
|
1889
1889
|
const ne = E((function(ue) {
|
|
1890
|
-
let
|
|
1891
|
-
for (var de = 0; de < ue.length; de++)
|
|
1892
|
-
const he = new Uint8Array(
|
|
1890
|
+
let ye = 0;
|
|
1891
|
+
for (var de = 0; de < ue.length; de++) ye += ue[de].byteLength;
|
|
1892
|
+
const he = new Uint8Array(ye);
|
|
1893
1893
|
let ie = 0;
|
|
1894
1894
|
for (de = 0; de < ue.length; de++) {
|
|
1895
1895
|
const _e = new Uint8Array(ue[de]), Ye = _e.length;
|
|
1896
1896
|
for (let Ue = 0; Ue < Ye; Ue += 4) {
|
|
1897
|
-
let
|
|
1897
|
+
let Le = _e[Ue], Ne = _e[Ue + 1], we = _e[Ue + 2];
|
|
1898
1898
|
const Fe = _e[Ue + 3];
|
|
1899
|
-
Fe == 0 && (
|
|
1899
|
+
Fe == 0 && (Le = Ne = we = 0), he[ie + Ue] = Le, he[ie + Ue + 1] = Ne, he[ie + Ue + 2] = we, he[ie + Ue + 3] = Fe;
|
|
1900
1900
|
}
|
|
1901
1901
|
ie += Ye;
|
|
1902
1902
|
}
|
|
1903
1903
|
return he.buffer;
|
|
1904
|
-
})(be),
|
|
1904
|
+
})(be), w);
|
|
1905
1905
|
for (j = 0; j < ne.plte.length; j++) te.push(ne.plte[j].est.rgba);
|
|
1906
1906
|
let ae = 0;
|
|
1907
1907
|
for (j = 0; j < q.length; j++) {
|
|
@@ -1909,7 +1909,7 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1909
1909
|
var re = new Uint8Array(ne.inds.buffer, ae >> 2, le >> 2);
|
|
1910
1910
|
J.push(re);
|
|
1911
1911
|
const ue = new Uint8Array(ne.abuf, ae, le);
|
|
1912
|
-
|
|
1912
|
+
O && a(fe.img, fe.rect.width, fe.rect.height, te, ue, re), fe.img.set(ue), ae += le;
|
|
1913
1913
|
}
|
|
1914
1914
|
} else for (z = 0; z < q.length; z++) {
|
|
1915
1915
|
var fe = q[z];
|
|
@@ -1937,9 +1937,9 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1937
1937
|
ae = Math.ceil(k * ce / 8);
|
|
1938
1938
|
var Me = new Uint8Array(ae * be);
|
|
1939
1939
|
const ue = J[z];
|
|
1940
|
-
for (let
|
|
1941
|
-
j =
|
|
1942
|
-
const de =
|
|
1940
|
+
for (let ye = 0; ye < be; ye++) {
|
|
1941
|
+
j = ye * ae;
|
|
1942
|
+
const de = ye * ce;
|
|
1943
1943
|
if (k == 8) for (var se = 0; se < ce; se++) Me[j + se] = ue[de + se];
|
|
1944
1944
|
else if (k == 4) for (se = 0; se < ce; se++) Me[j + (se >> 1)] |= ue[de + se] << 4 - 4 * (1 & se);
|
|
1945
1945
|
else if (k == 2) for (se = 0; se < ce; se++) Me[j + (se >> 2)] |= ue[de + se] << 6 - 2 * (3 & se);
|
|
@@ -1950,8 +1950,8 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1950
1950
|
Me = new Uint8Array(ce * be * 3);
|
|
1951
1951
|
const ue = ce * be;
|
|
1952
1952
|
for (j = 0; j < ue; j++) {
|
|
1953
|
-
const
|
|
1954
|
-
Me[
|
|
1953
|
+
const ye = 3 * j, de = 4 * j;
|
|
1954
|
+
Me[ye] = ne[de], Me[ye + 1] = ne[de + 1], Me[ye + 2] = ne[de + 2];
|
|
1955
1955
|
}
|
|
1956
1956
|
ne = Me, F = 2, le = 3, ae = 3 * ce;
|
|
1957
1957
|
}
|
|
@@ -1964,12 +1964,12 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1964
1964
|
frames: q
|
|
1965
1965
|
};
|
|
1966
1966
|
}
|
|
1967
|
-
function i(c, f, v,
|
|
1968
|
-
const I = Uint8Array, l = Uint32Array, o = new I(c[
|
|
1967
|
+
function i(c, f, v, w, y, U, p) {
|
|
1968
|
+
const I = Uint8Array, l = Uint32Array, o = new I(c[y - 1]), O = new l(c[y - 1]), F = y + 1 < c.length ? new I(c[y + 1]) : null, k = new I(c[y]), X = new l(k.buffer);
|
|
1969
1969
|
let z = f, Q = v, j = -1, C = -1;
|
|
1970
1970
|
for (let oe = 0; oe < U.height; oe++) for (let te = 0; te < U.width; te++) {
|
|
1971
1971
|
const J = U.x + te, re = U.y + oe, fe = re * f + J, ce = X[fe];
|
|
1972
|
-
ce == 0 || y
|
|
1972
|
+
ce == 0 || w[y - 1].dispose == 0 && O[fe] == ce && (F == null || F[4 * fe + 3] != 0) || (J < z && (z = J), J > j && (j = J), re < Q && (Q = re), re > C && (C = re));
|
|
1973
1973
|
}
|
|
1974
1974
|
j == -1 && (z = Q = j = C = 0), p && ((1 & z) == 1 && z--, (1 & Q) == 1 && Q--), U = {
|
|
1975
1975
|
x: z,
|
|
@@ -1977,13 +1977,13 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1977
1977
|
width: j - z + 1,
|
|
1978
1978
|
height: C - Q + 1
|
|
1979
1979
|
};
|
|
1980
|
-
const q = y
|
|
1981
|
-
q.rect = U, q.blend = 1, q.img = new Uint8Array(U.width * U.height * 4), y
|
|
1980
|
+
const q = w[y];
|
|
1981
|
+
q.rect = U, q.blend = 1, q.img = new Uint8Array(U.width * U.height * 4), w[y - 1].dispose == 0 ? (P(o, f, v, q.img, U.width, U.height, -U.x, -U.y, 0), n(k, f, v, q.img, U)) : P(k, f, v, q.img, U.width, U.height, -U.x, -U.y, 0);
|
|
1982
1982
|
}
|
|
1983
|
-
function n(c, f, v,
|
|
1984
|
-
P(c, f, v,
|
|
1983
|
+
function n(c, f, v, w, y) {
|
|
1984
|
+
P(c, f, v, w, y.width, y.height, -y.x, -y.y, 2);
|
|
1985
1985
|
}
|
|
1986
|
-
function s(c, f, v,
|
|
1986
|
+
function s(c, f, v, w, y, U, p) {
|
|
1987
1987
|
const I = [];
|
|
1988
1988
|
let l, o = [
|
|
1989
1989
|
0,
|
|
@@ -1992,59 +1992,59 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
1992
1992
|
3,
|
|
1993
1993
|
4
|
|
1994
1994
|
];
|
|
1995
|
-
U != -1 ? o = [U] : (f *
|
|
1996
|
-
const
|
|
1995
|
+
U != -1 ? o = [U] : (f * w > 5e5 || v == 1) && (o = [0]), p && (l = { level: 0 });
|
|
1996
|
+
const O = V;
|
|
1997
1997
|
for (var F = 0; F < o.length; F++) {
|
|
1998
|
-
for (let z = 0; z < f; z++) h(
|
|
1999
|
-
I.push(
|
|
1998
|
+
for (let z = 0; z < f; z++) h(y, c, z, w, v, o[F]);
|
|
1999
|
+
I.push(O.deflate(y, l));
|
|
2000
2000
|
}
|
|
2001
2001
|
let k, X = 1e9;
|
|
2002
2002
|
for (F = 0; F < I.length; F++) I[F].length < X && (k = F, X = I[F].length);
|
|
2003
2003
|
return I[k];
|
|
2004
2004
|
}
|
|
2005
|
-
function h(c, f, v,
|
|
2006
|
-
const p = v *
|
|
2005
|
+
function h(c, f, v, w, y, U) {
|
|
2006
|
+
const p = v * w;
|
|
2007
2007
|
let I = p + v;
|
|
2008
|
-
if (c[I] = U, I++, U == 0) if (
|
|
2009
|
-
else c.set(new Uint8Array(f.buffer, p,
|
|
2008
|
+
if (c[I] = U, I++, U == 0) if (w < 500) for (var l = 0; l < w; l++) c[I + l] = f[p + l];
|
|
2009
|
+
else c.set(new Uint8Array(f.buffer, p, w), I);
|
|
2010
2010
|
else if (U == 1) {
|
|
2011
|
-
for (l = 0; l <
|
|
2012
|
-
for (l =
|
|
2011
|
+
for (l = 0; l < y; l++) c[I + l] = f[p + l];
|
|
2012
|
+
for (l = y; l < w; l++) c[I + l] = f[p + l] - f[p + l - y] + 256 & 255;
|
|
2013
2013
|
} else if (v == 0) {
|
|
2014
|
-
for (l = 0; l <
|
|
2015
|
-
if (U == 2) for (l =
|
|
2016
|
-
if (U == 3) for (l =
|
|
2017
|
-
if (U == 4) for (l =
|
|
2014
|
+
for (l = 0; l < y; l++) c[I + l] = f[p + l];
|
|
2015
|
+
if (U == 2) for (l = y; l < w; l++) c[I + l] = f[p + l];
|
|
2016
|
+
if (U == 3) for (l = y; l < w; l++) c[I + l] = f[p + l] - (f[p + l - y] >> 1) + 256 & 255;
|
|
2017
|
+
if (U == 4) for (l = y; l < w; l++) c[I + l] = f[p + l] - H(f[p + l - y], 0, 0) + 256 & 255;
|
|
2018
2018
|
} else {
|
|
2019
|
-
if (U == 2) for (l = 0; l <
|
|
2019
|
+
if (U == 2) for (l = 0; l < w; l++) c[I + l] = f[p + l] + 256 - f[p + l - w] & 255;
|
|
2020
2020
|
if (U == 3) {
|
|
2021
|
-
for (l = 0; l <
|
|
2022
|
-
for (l =
|
|
2021
|
+
for (l = 0; l < y; l++) c[I + l] = f[p + l] + 256 - (f[p + l - w] >> 1) & 255;
|
|
2022
|
+
for (l = y; l < w; l++) c[I + l] = f[p + l] + 256 - (f[p + l - w] + f[p + l - y] >> 1) & 255;
|
|
2023
2023
|
}
|
|
2024
2024
|
if (U == 4) {
|
|
2025
|
-
for (l = 0; l <
|
|
2026
|
-
for (l =
|
|
2025
|
+
for (l = 0; l < y; l++) c[I + l] = f[p + l] + 256 - H(0, f[p + l - w], 0) & 255;
|
|
2026
|
+
for (l = y; l < w; l++) c[I + l] = f[p + l] + 256 - H(f[p + l - y], f[p + l - w], f[p + l - y - w]) & 255;
|
|
2027
2027
|
}
|
|
2028
2028
|
}
|
|
2029
2029
|
}
|
|
2030
2030
|
function E(c, f) {
|
|
2031
|
-
const v = new Uint8Array(c),
|
|
2032
|
-
let
|
|
2033
|
-
if (v.length < 2e7) for (var F = 0; F < l; F += 4)
|
|
2031
|
+
const v = new Uint8Array(c), w = v.slice(0), y = new Uint32Array(w.buffer), U = x(w, f), p = U[0], I = U[1], l = v.length, o = new Uint8Array(l >> 2);
|
|
2032
|
+
let O;
|
|
2033
|
+
if (v.length < 2e7) for (var F = 0; F < l; F += 4) O = b(p, k = v[F] * (1 / 255), X = v[F + 1] * (1 / 255), z = v[F + 2] * (1 / 255), Q = v[F + 3] * (1 / 255)), o[F >> 2] = O.ind, y[F >> 2] = O.est.rgba;
|
|
2034
2034
|
else for (F = 0; F < l; F += 4) {
|
|
2035
2035
|
var k = v[F] * .00392156862745098, X = v[F + 1] * (1 / 255), z = v[F + 2] * (1 / 255), Q = v[F + 3] * (1 / 255);
|
|
2036
|
-
for (
|
|
2037
|
-
o[F >> 2] =
|
|
2036
|
+
for (O = p; O.left;) O = D(O.est, k, X, z, Q) <= 0 ? O.left : O.right;
|
|
2037
|
+
o[F >> 2] = O.ind, y[F >> 2] = O.est.rgba;
|
|
2038
2038
|
}
|
|
2039
2039
|
return {
|
|
2040
|
-
abuf:
|
|
2040
|
+
abuf: w.buffer,
|
|
2041
2041
|
inds: o,
|
|
2042
2042
|
plte: I
|
|
2043
2043
|
};
|
|
2044
2044
|
}
|
|
2045
2045
|
function x(c, f, v) {
|
|
2046
2046
|
v ??= 1e-4;
|
|
2047
|
-
const
|
|
2047
|
+
const w = new Uint32Array(c.buffer), y = {
|
|
2048
2048
|
i0: 0,
|
|
2049
2049
|
i1: c.length,
|
|
2050
2050
|
bst: null,
|
|
@@ -2053,20 +2053,20 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
2053
2053
|
left: null,
|
|
2054
2054
|
right: null
|
|
2055
2055
|
};
|
|
2056
|
-
|
|
2057
|
-
const U = [
|
|
2056
|
+
y.bst = B(c, y.i0, y.i1), y.est = g(y.bst);
|
|
2057
|
+
const U = [y];
|
|
2058
2058
|
for (; U.length < f;) {
|
|
2059
2059
|
let I = 0, l = 0;
|
|
2060
2060
|
for (var p = 0; p < U.length; p++) U[p].est.L > I && (I = U[p].est.L, l = p);
|
|
2061
2061
|
if (I < v) break;
|
|
2062
|
-
const o = U[l],
|
|
2063
|
-
if (o.i0 >=
|
|
2062
|
+
const o = U[l], O = L(c, w, o.i0, o.i1, o.est.e, o.est.eMq255);
|
|
2063
|
+
if (o.i0 >= O || o.i1 <= O) {
|
|
2064
2064
|
o.est.L = 0;
|
|
2065
2065
|
continue;
|
|
2066
2066
|
}
|
|
2067
2067
|
const F = {
|
|
2068
2068
|
i0: o.i0,
|
|
2069
|
-
i1:
|
|
2069
|
+
i1: O,
|
|
2070
2070
|
bst: null,
|
|
2071
2071
|
est: null,
|
|
2072
2072
|
tdst: 0,
|
|
@@ -2075,7 +2075,7 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
2075
2075
|
};
|
|
2076
2076
|
F.bst = B(c, F.i0, F.i1), F.est = g(F.bst);
|
|
2077
2077
|
const k = {
|
|
2078
|
-
i0:
|
|
2078
|
+
i0: O,
|
|
2079
2079
|
i1: o.i1,
|
|
2080
2080
|
bst: null,
|
|
2081
2081
|
est: null,
|
|
@@ -2092,41 +2092,41 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
2092
2092
|
k.est = g(k.bst), o.left = F, o.right = k, U[l] = F, U.push(k);
|
|
2093
2093
|
}
|
|
2094
2094
|
for (U.sort(((I, l) => l.bst.N - I.bst.N)), p = 0; p < U.length; p++) U[p].ind = p;
|
|
2095
|
-
return [
|
|
2095
|
+
return [y, U];
|
|
2096
2096
|
}
|
|
2097
|
-
function b(c, f, v,
|
|
2097
|
+
function b(c, f, v, w, y) {
|
|
2098
2098
|
if (c.left == null) return c.tdst = (function(F, k, X, z, Q) {
|
|
2099
2099
|
const j = k - F[0], C = X - F[1], q = z - F[2], oe = Q - F[3];
|
|
2100
2100
|
return j * j + C * C + q * q + oe * oe;
|
|
2101
|
-
})(c.est.q, f, v,
|
|
2102
|
-
const U = D(c.est, f, v,
|
|
2101
|
+
})(c.est.q, f, v, w, y), c;
|
|
2102
|
+
const U = D(c.est, f, v, w, y);
|
|
2103
2103
|
let p = c.left, I = c.right;
|
|
2104
2104
|
U > 0 && (p = c.right, I = c.left);
|
|
2105
|
-
const l = b(p, f, v,
|
|
2105
|
+
const l = b(p, f, v, w, y);
|
|
2106
2106
|
if (l.tdst <= U * U) return l;
|
|
2107
|
-
const o = b(I, f, v,
|
|
2107
|
+
const o = b(I, f, v, w, y);
|
|
2108
2108
|
return o.tdst < l.tdst ? o : l;
|
|
2109
2109
|
}
|
|
2110
|
-
function D(c, f, v,
|
|
2110
|
+
function D(c, f, v, w, y) {
|
|
2111
2111
|
const { e: U } = c;
|
|
2112
|
-
return U[0] * f + U[1] * v + U[2] *
|
|
2112
|
+
return U[0] * f + U[1] * v + U[2] * w + U[3] * y - c.eMq;
|
|
2113
2113
|
}
|
|
2114
|
-
function
|
|
2115
|
-
for (
|
|
2116
|
-
for (; M(c, v,
|
|
2117
|
-
for (; M(c,
|
|
2118
|
-
if (v >=
|
|
2114
|
+
function L(c, f, v, w, y, U) {
|
|
2115
|
+
for (w -= 4; v < w;) {
|
|
2116
|
+
for (; M(c, v, y) <= U;) v += 4;
|
|
2117
|
+
for (; M(c, w, y) > U;) w -= 4;
|
|
2118
|
+
if (v >= w) break;
|
|
2119
2119
|
const p = f[v >> 2];
|
|
2120
|
-
f[v >> 2] = f[
|
|
2120
|
+
f[v >> 2] = f[w >> 2], f[w >> 2] = p, v += 4, w -= 4;
|
|
2121
2121
|
}
|
|
2122
|
-
for (; M(c, v,
|
|
2122
|
+
for (; M(c, v, y) > U;) v -= 4;
|
|
2123
2123
|
return v + 4;
|
|
2124
2124
|
}
|
|
2125
2125
|
function M(c, f, v) {
|
|
2126
2126
|
return c[f] * v[0] + c[f + 1] * v[1] + c[f + 2] * v[2] + c[f + 3] * v[3];
|
|
2127
2127
|
}
|
|
2128
2128
|
function B(c, f, v) {
|
|
2129
|
-
const
|
|
2129
|
+
const w = [
|
|
2130
2130
|
0,
|
|
2131
2131
|
0,
|
|
2132
2132
|
0,
|
|
@@ -2143,50 +2143,50 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
2143
2143
|
0,
|
|
2144
2144
|
0,
|
|
2145
2145
|
0
|
|
2146
|
-
],
|
|
2146
|
+
], y = [
|
|
2147
2147
|
0,
|
|
2148
2148
|
0,
|
|
2149
2149
|
0,
|
|
2150
2150
|
0
|
|
2151
2151
|
], U = v - f >> 2;
|
|
2152
2152
|
for (let p = f; p < v; p += 4) {
|
|
2153
|
-
const I = c[p] * .00392156862745098, l = c[p + 1] * (1 / 255), o = c[p + 2] * (1 / 255),
|
|
2154
|
-
|
|
2153
|
+
const I = c[p] * .00392156862745098, l = c[p + 1] * (1 / 255), o = c[p + 2] * (1 / 255), O = c[p + 3] * (1 / 255);
|
|
2154
|
+
y[0] += I, y[1] += l, y[2] += o, y[3] += O, w[0] += I * I, w[1] += I * l, w[2] += I * o, w[3] += I * O, w[5] += l * l, w[6] += l * o, w[7] += l * O, w[10] += o * o, w[11] += o * O, w[15] += O * O;
|
|
2155
2155
|
}
|
|
2156
|
-
return
|
|
2157
|
-
R:
|
|
2158
|
-
m:
|
|
2156
|
+
return w[4] = w[1], w[8] = w[2], w[9] = w[6], w[12] = w[3], w[13] = w[7], w[14] = w[11], {
|
|
2157
|
+
R: w,
|
|
2158
|
+
m: y,
|
|
2159
2159
|
N: U
|
|
2160
2160
|
};
|
|
2161
2161
|
}
|
|
2162
2162
|
function g(c) {
|
|
2163
|
-
const { R: f } = c, { m: v } = c, { N:
|
|
2164
|
-
f[0] -
|
|
2165
|
-
f[1] -
|
|
2166
|
-
f[2] -
|
|
2167
|
-
f[3] -
|
|
2168
|
-
f[4] - U *
|
|
2163
|
+
const { R: f } = c, { m: v } = c, { N: w } = c, y = v[0], U = v[1], p = v[2], I = v[3], l = w == 0 ? 0 : 1 / w, o = [
|
|
2164
|
+
f[0] - y * y * l,
|
|
2165
|
+
f[1] - y * U * l,
|
|
2166
|
+
f[2] - y * p * l,
|
|
2167
|
+
f[3] - y * I * l,
|
|
2168
|
+
f[4] - U * y * l,
|
|
2169
2169
|
f[5] - U * U * l,
|
|
2170
2170
|
f[6] - U * p * l,
|
|
2171
2171
|
f[7] - U * I * l,
|
|
2172
|
-
f[8] - p *
|
|
2172
|
+
f[8] - p * y * l,
|
|
2173
2173
|
f[9] - p * U * l,
|
|
2174
2174
|
f[10] - p * p * l,
|
|
2175
2175
|
f[11] - p * I * l,
|
|
2176
|
-
f[12] - I *
|
|
2176
|
+
f[12] - I * y * l,
|
|
2177
2177
|
f[13] - I * U * l,
|
|
2178
2178
|
f[14] - I * p * l,
|
|
2179
2179
|
f[15] - I * I * l
|
|
2180
|
-
],
|
|
2180
|
+
], O = o, F = R;
|
|
2181
2181
|
let k = [
|
|
2182
2182
|
Math.random(),
|
|
2183
2183
|
Math.random(),
|
|
2184
2184
|
Math.random(),
|
|
2185
2185
|
Math.random()
|
|
2186
2186
|
], X = 0, z = 0;
|
|
2187
|
-
if (
|
|
2187
|
+
if (w != 0) for (let j = 0; j < 16 && (k = F.multVec(O, k), z = Math.sqrt(F.dot(k, k)), k = F.sml(1 / z, k), !(j != 0 && Math.abs(z - X) < 1e-9)); j++) X = z;
|
|
2188
2188
|
const Q = [
|
|
2189
|
-
|
|
2189
|
+
y * l,
|
|
2190
2190
|
U * l,
|
|
2191
2191
|
p * l,
|
|
2192
2192
|
I * l
|
|
@@ -2216,9 +2216,9 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
2216
2216
|
c * f[3]
|
|
2217
2217
|
]
|
|
2218
2218
|
};
|
|
2219
|
-
Z.encode = function(f, v,
|
|
2220
|
-
|
|
2221
|
-
const l = r(f, v,
|
|
2219
|
+
Z.encode = function(f, v, w, y, U, p, I) {
|
|
2220
|
+
y ??= 0, I ??= !1;
|
|
2221
|
+
const l = r(f, v, w, y, [
|
|
2222
2222
|
!1,
|
|
2223
2223
|
!1,
|
|
2224
2224
|
!1,
|
|
@@ -2226,41 +2226,41 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
2226
2226
|
I,
|
|
2227
2227
|
!1
|
|
2228
2228
|
]);
|
|
2229
|
-
return A(l, -1), m(l, v,
|
|
2230
|
-
}, Z.encodeLL = function(f, v,
|
|
2229
|
+
return A(l, -1), m(l, v, w, U, p);
|
|
2230
|
+
}, Z.encodeLL = function(f, v, w, y, U, p, I, l) {
|
|
2231
2231
|
const o = {
|
|
2232
|
-
ctype: 0 + (
|
|
2232
|
+
ctype: 0 + (y == 1 ? 0 : 2) + (U == 0 ? 0 : 4),
|
|
2233
2233
|
depth: p,
|
|
2234
2234
|
frames: []
|
|
2235
|
-
},
|
|
2235
|
+
}, O = (y + U) * p, F = O * v;
|
|
2236
2236
|
for (let k = 0; k < f.length; k++) o.frames.push({
|
|
2237
2237
|
rect: {
|
|
2238
2238
|
x: 0,
|
|
2239
2239
|
y: 0,
|
|
2240
2240
|
width: v,
|
|
2241
|
-
height:
|
|
2241
|
+
height: w
|
|
2242
2242
|
},
|
|
2243
2243
|
img: new Uint8Array(f[k]),
|
|
2244
2244
|
blend: 0,
|
|
2245
2245
|
dispose: 1,
|
|
2246
|
-
bpp: Math.ceil(
|
|
2246
|
+
bpp: Math.ceil(O / 8),
|
|
2247
2247
|
bpl: Math.ceil(F / 8)
|
|
2248
2248
|
});
|
|
2249
|
-
return A(o, 0, !0), m(o, v,
|
|
2249
|
+
return A(o, 0, !0), m(o, v, w, I, l);
|
|
2250
2250
|
}, Z.encode.compress = r, Z.encode.dither = a, Z.quantize = E, Z.quantize.getKDtree = x, Z.quantize.getNearest = b;
|
|
2251
2251
|
})();
|
|
2252
2252
|
const Y = {
|
|
2253
2253
|
toArrayBuffer(P, T) {
|
|
2254
2254
|
const H = P.width, d = P.height, e = H << 2, t = P.getContext("2d").getImageData(0, 0, H, d), u = new Uint32Array(t.data.buffer), a = (32 * H + 31) / 32 << 2, m = a * d, A = 122 + m, r = new ArrayBuffer(A), i = new DataView(r), n = 1 << 20;
|
|
2255
|
-
let s, h, E, x, b = n, D = 0,
|
|
2255
|
+
let s, h, E, x, b = n, D = 0, L = 0, M = 0;
|
|
2256
2256
|
function B(c) {
|
|
2257
|
-
i.setUint16(
|
|
2257
|
+
i.setUint16(L, c, !0), L += 2;
|
|
2258
2258
|
}
|
|
2259
2259
|
function g(c) {
|
|
2260
|
-
i.setUint32(
|
|
2260
|
+
i.setUint32(L, c, !0), L += 4;
|
|
2261
2261
|
}
|
|
2262
2262
|
function R(c) {
|
|
2263
|
-
|
|
2263
|
+
L += c;
|
|
2264
2264
|
}
|
|
2265
2265
|
B(19778), g(A), R(4), g(122), g(108), g(H), g(-d >>> 0), B(1), B(32), g(3), g(m), g(2835), g(2835), R(8), g(16711680), g(65280), g(255), g(4278190080), g(1466527264), (function c() {
|
|
2266
2266
|
for (; D < d && b > 0;) {
|
|
@@ -2558,18 +2558,18 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
2558
2558
|
}
|
|
2559
2559
|
function Pt(P, T, H = 0) {
|
|
2560
2560
|
return new Promise((function(d, e) {
|
|
2561
|
-
let t, u, a, m, A, r, i, n, s, h, E, x, b, D,
|
|
2562
|
-
function f(
|
|
2561
|
+
let t, u, a, m, A, r, i, n, s, h, E, x, b, D, L, M, B, g, R, c;
|
|
2562
|
+
function f(w = 5) {
|
|
2563
2563
|
if (T.signal && T.signal.aborted) throw T.signal.reason;
|
|
2564
|
-
t +=
|
|
2564
|
+
t += w, T.onProgress(Math.min(t, 100));
|
|
2565
2565
|
}
|
|
2566
|
-
function v(
|
|
2566
|
+
function v(w) {
|
|
2567
2567
|
if (T.signal && T.signal.aborted) throw T.signal.reason;
|
|
2568
|
-
t = Math.min(Math.max(
|
|
2568
|
+
t = Math.min(Math.max(w, t), 100), T.onProgress(t);
|
|
2569
2569
|
}
|
|
2570
|
-
return t = H, u = T.maxIteration || 10, a = 1024 * T.maxSizeMB * 1024, f(), ot(P, T).then(function(
|
|
2570
|
+
return t = H, u = T.maxIteration || 10, a = 1024 * T.maxSizeMB * 1024, f(), ot(P, T).then(function(w) {
|
|
2571
2571
|
try {
|
|
2572
|
-
return [, m] =
|
|
2572
|
+
return [, m] = w, f(), A = St(m, T), f(), new Promise((function(y, U) {
|
|
2573
2573
|
var p;
|
|
2574
2574
|
if (!(p = T.exifOrientation)) return Ct(P).then(function(l) {
|
|
2575
2575
|
try {
|
|
@@ -2579,22 +2579,22 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
2579
2579
|
}
|
|
2580
2580
|
}.bind(this), U);
|
|
2581
2581
|
function I() {
|
|
2582
|
-
return
|
|
2582
|
+
return y(p);
|
|
2583
2583
|
}
|
|
2584
2584
|
return I.call(this);
|
|
2585
|
-
})).then(function(
|
|
2585
|
+
})).then(function(y) {
|
|
2586
2586
|
try {
|
|
2587
|
-
return r =
|
|
2587
|
+
return r = y, f(), Ke().then(function(U) {
|
|
2588
2588
|
try {
|
|
2589
2589
|
return i = U ? A : Rt(A, r), f(), n = T.initialQuality || 1, s = T.fileType || P.type, at(i, s, P.name, P.lastModified, n).then(function(p) {
|
|
2590
2590
|
try {
|
|
2591
2591
|
{
|
|
2592
2592
|
let l = function() {
|
|
2593
|
-
if (u-- && (
|
|
2594
|
-
let
|
|
2595
|
-
return
|
|
2593
|
+
if (u-- && (L > a || L > b)) {
|
|
2594
|
+
let O, F;
|
|
2595
|
+
return O = c ? .95 * R.width : R.width, F = c ? .95 * R.height : R.height, [B, g] = He(O, F), g.drawImage(R, 0, 0, O, F), n *= s === "image/png" ? .85 : .95, at(B, s, P.name, P.lastModified, n).then((function(k) {
|
|
2596
2596
|
try {
|
|
2597
|
-
return M = k, Ie(R), R = B,
|
|
2597
|
+
return M = k, Ie(R), R = B, L = M.size, v(Math.min(99, Math.floor((D - L) / (D - a) * 100))), l;
|
|
2598
2598
|
} catch (X) {
|
|
2599
2599
|
return e(X);
|
|
2600
2600
|
}
|
|
@@ -2606,14 +2606,14 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
2606
2606
|
};
|
|
2607
2607
|
if (h = p, f(), E = h.size > a, x = h.size > P.size, !E && !x) return v(100), d(h);
|
|
2608
2608
|
var I;
|
|
2609
|
-
return b = P.size, D = h.size,
|
|
2610
|
-
for (;
|
|
2611
|
-
if (
|
|
2609
|
+
return b = P.size, D = h.size, L = D, R = i, c = !T.alwaysKeepResolution && E, (I = function(O) {
|
|
2610
|
+
for (; O;) {
|
|
2611
|
+
if (O.then) return void O.then(I, e);
|
|
2612
2612
|
try {
|
|
2613
|
-
if (
|
|
2614
|
-
if (
|
|
2615
|
-
|
|
2616
|
-
} else
|
|
2613
|
+
if (O.pop) {
|
|
2614
|
+
if (O.length) return O.pop() ? o.call(this) : O;
|
|
2615
|
+
O = l;
|
|
2616
|
+
} else O = O.call(this);
|
|
2617
2617
|
} catch (F) {
|
|
2618
2618
|
return e(F);
|
|
2619
2619
|
}
|
|
@@ -2632,13 +2632,13 @@ __useblocks__.define("static/core/3b4845f7.js", [
|
|
|
2632
2632
|
return e(U);
|
|
2633
2633
|
}
|
|
2634
2634
|
}.bind(this), e);
|
|
2635
|
-
} catch (
|
|
2636
|
-
return e(
|
|
2635
|
+
} catch (y) {
|
|
2636
|
+
return e(y);
|
|
2637
2637
|
}
|
|
2638
2638
|
}.bind(this), e);
|
|
2639
2639
|
}));
|
|
2640
2640
|
}
|
|
2641
|
-
const
|
|
2641
|
+
const yn = `
|
|
2642
2642
|
let scriptImported = false
|
|
2643
2643
|
self.addEventListener('message', async (e) => {
|
|
2644
2644
|
const { file, id, imageCompressionLibUrl, options } = e.data
|
|
@@ -2659,12 +2659,12 @@ self.addEventListener('message', async (e) => {
|
|
|
2659
2659
|
})
|
|
2660
2660
|
`;
|
|
2661
2661
|
let mt;
|
|
2662
|
-
function
|
|
2662
|
+
function wn(P, T) {
|
|
2663
2663
|
return new Promise(((H, d) => {
|
|
2664
2664
|
mt || (mt = (function(u) {
|
|
2665
2665
|
const a = [];
|
|
2666
2666
|
return typeof u == "function" ? a.push(`(${u})()`) : a.push(u), URL.createObjectURL(new Blob(a));
|
|
2667
|
-
})(
|
|
2667
|
+
})(yn));
|
|
2668
2668
|
const e = new Worker(mt);
|
|
2669
2669
|
e.addEventListener("message", (function(u) {
|
|
2670
2670
|
if (T.signal && T.signal.aborted) e.terminate();
|
|
@@ -2719,7 +2719,7 @@ self.addEventListener('message', async (e) => {
|
|
|
2719
2719
|
}
|
|
2720
2720
|
};
|
|
2721
2721
|
try {
|
|
2722
|
-
return e.libURL = e.libURL || "https://cdn.jsdelivr.net/npm/browser-image-compression@2.0.2/dist/browser-image-compression.js",
|
|
2722
|
+
return e.libURL = e.libURL || "https://cdn.jsdelivr.net/npm/browser-image-compression@2.0.2/dist/browser-image-compression.js", wn(P, e).then((function(s) {
|
|
2723
2723
|
try {
|
|
2724
2724
|
return t = s, r();
|
|
2725
2725
|
} catch {
|
|
@@ -2934,7 +2934,7 @@ self.addEventListener('message', async (e) => {
|
|
|
2934
2934
|
}
|
|
2935
2935
|
var dn = "js/browser-image-compression.js";
|
|
2936
2936
|
function xt() {
|
|
2937
|
-
return
|
|
2937
|
+
return Ot.getBundledHostAssetUrl(dn);
|
|
2938
2938
|
}
|
|
2939
2939
|
async function hn(_, S, N = xt()) {
|
|
2940
2940
|
if (!Et(_)) return _;
|
|
@@ -2960,9 +2960,9 @@ self.addEventListener('message', async (e) => {
|
|
|
2960
2960
|
} : null;
|
|
2961
2961
|
}
|
|
2962
2962
|
function mn(_) {
|
|
2963
|
-
if (!(_ instanceof Blob) || _.size === 0) throw new st.
|
|
2963
|
+
if (!(_ instanceof Blob) || _.size === 0) throw new st.Qn("Failed to download file from the URL.", "UploadUrlDownloadFailed");
|
|
2964
2964
|
const S = _.type?.split(";")[0]?.trim() || "image/png";
|
|
2965
|
-
if (!S.startsWith("image/")) throw new st.
|
|
2965
|
+
if (!S.startsWith("image/")) throw new st.Qn("Content type at the URL is not allowed.", "UploadUrlContentTypeNotAllowed");
|
|
2966
2966
|
return {
|
|
2967
2967
|
blob: _,
|
|
2968
2968
|
mimeType: S
|
|
@@ -2974,9 +2974,9 @@ self.addEventListener('message', async (e) => {
|
|
|
2974
2974
|
return N.blob();
|
|
2975
2975
|
}
|
|
2976
2976
|
async function vn(_, S, N) {
|
|
2977
|
-
const G = N ? { signal: N } : void 0, { blob: K } = await st.
|
|
2978
|
-
handleFileProxy: async ($) =>
|
|
2979
|
-
handleProxyUrl: async ($) =>
|
|
2977
|
+
const G = N ? { signal: N } : void 0, { blob: K } = await st.pi(_, {
|
|
2978
|
+
handleFileProxy: async ($) => yt.pickFileProxyBlobFromFireResults(await S.fireFileProxy($)) ?? null,
|
|
2979
|
+
handleProxyUrl: async ($) => yt.pickProxyUrlOverrideFromFireResults(await S.fireProxyUrl($), $),
|
|
2980
2980
|
fetchWithProxy: ($, V, Z) => Ee.fetchWithResourceProxy($, {
|
|
2981
2981
|
config: S.appConfig,
|
|
2982
2982
|
standalone: S.isStandalone,
|
|
@@ -3081,7 +3081,7 @@ self.addEventListener('message', async (e) => {
|
|
|
3081
3081
|
}), Object.defineProperty(ge, "shouldCountAiUsage", {
|
|
3082
3082
|
enumerable: !0,
|
|
3083
3083
|
get: function() {
|
|
3084
|
-
return
|
|
3084
|
+
return wt;
|
|
3085
3085
|
}
|
|
3086
3086
|
}), Object.defineProperty(ge, "useCookieManager", {
|
|
3087
3087
|
enumerable: !0,
|