useblocks 1.1.43 → 1.1.44

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.
@@ -1,17 +1,17 @@
1
- __useblocks__.define("static/core/db330968.js", [
1
+ __useblocks__.define("static/core/d2b26db6.js", [
2
2
  "require",
3
3
  "exports",
4
4
  "module",
5
5
  "static/core/bd36b180.js",
6
6
  "static/core/bb774fb9.js",
7
7
  "static/core/04557bf3.js",
8
- "static/core/f99bda3c.js",
9
- "static/core/e97665732.js",
8
+ "static/core/94f2c0df.js",
9
+ "static/core/a59902082.js",
10
10
  "react",
11
11
  "react-router-dom"
12
12
  ], function(Be, be, An) {
13
- const bt = Be("./bd36b180.js"), Ee = Be("./bb774fb9.js"), Lt = Be("./04557bf3.js"), st = Be("./f99bda3c.js"), wt = Be("./e97665732.js");
14
- let Ot = Be("react"), kt = Be("react-router-dom");
13
+ const bt = Be("./bd36b180.js"), Ee = Be("./bb774fb9.js"), Ot = Be("./04557bf3.js"), st = Be("./94f2c0df.js"), wt = Be("./a59902082.js");
14
+ let Lt = Be("react"), kt = Be("react-router-dom");
15
15
  var Bt = () => Ee.di.useInstance(Ee.COOKIE_MANAGER_ID);
16
16
  function ft(_, R) {
17
17
  if (_) {
@@ -297,10 +297,10 @@ __useblocks__.define("static/core/db330968.js", [
297
297
  m += 4, m = h;
298
298
  for (var E = 0; E < n; E++) {
299
299
  a(r, m), m += 4, m += 4, m += 4, a(r, m += 4), s = a(r, m += 4);
300
- var x = a(r, m += 4), b = u(r, m += 4), D = u(r, m + 2), L = u(r, m + 4);
300
+ var x = a(r, m += 4), b = u(r, m += 4), D = u(r, m + 2), O = u(r, m + 4);
301
301
  m += 6;
302
302
  var M = a(r, m += 8);
303
- m += 4, m += b + D + L, d._readLocal(r, M, A, s, x, t);
303
+ m += 4, m += b + D + O, d._readLocal(r, M, A, s, x, t);
304
304
  }
305
305
  return A;
306
306
  }, d._readLocal = function(e, t, u, a, m, A) {
@@ -357,10 +357,10 @@ __useblocks__.define("static/core/db330968.js", [
357
357
  var b = A[r];
358
358
  x.push(E), E = d._writeHeader(h, E, r, b, 0);
359
359
  }
360
- var D = 0, L = E;
360
+ var D = 0, O = E;
361
361
  for (var r in A) b = A[r], x.push(E), E = d._writeHeader(h, E, r, b, 1, x[D++]);
362
- var M = E - L;
363
- 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;
362
+ var M = E - O;
363
+ 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, O), E += 4, E += 2, h.buffer;
364
364
  }, d._noNeed = function(e) {
365
365
  var t = e.split(".").pop().toLowerCase();
366
366
  return "png,jpg,jpeg,zip".indexOf(t) != -1;
@@ -525,7 +525,7 @@ __useblocks__.define("static/core/db330968.js", [
525
525
  for (; n < E;) i(t, s, n + (y = Math.min(65535, E - n)) == E ? 1 : 0), s = d.F._copyExact(e, n, y, t, s + 8), n += y;
526
526
  return s >>> 3;
527
527
  }
528
- var x = A.lits, b = A.strt, D = A.prev, L = 0, M = 0, B = 0, g = 0, C = 0, c = 0;
528
+ var x = A.lits, b = A.strt, D = A.prev, O = 0, M = 0, B = 0, g = 0, C = 0, c = 0;
529
529
  for (E > 2 && (b[c = d.F._hash(e, 0)] = 0), n = 0; n < E; n++) {
530
530
  if (C = c, n + 1 < E - 2) {
531
531
  c = d.F._hash(e, n + 1);
@@ -533,7 +533,7 @@ __useblocks__.define("static/core/db330968.js", [
533
533
  D[f] = b[c], b[c] = f;
534
534
  }
535
535
  if (h <= n) {
536
- (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);
536
+ (O > 14e3 || M > 26697) && E - n > 100 && (h < n && (x[O] = n - h, O += 2, h = n), s = d.F._writeBlock(n == E - 1 || h == E ? 1 : 0, x, O, g, e, B, n - B, t, s), O = M = g = 0, B = n);
537
537
  var v = 0;
538
538
  n < E - 2 && (v = d.F._bestMatch(e, n, D, C, Math.min(m[2], E - n), m[3]));
539
539
  var y = v >>> 16, w = 65535 & v;
@@ -542,12 +542,12 @@ __useblocks__.define("static/core/db330968.js", [
542
542
  var U = r(y = v >>> 16, A.of0);
543
543
  A.lhst[257 + U]++;
544
544
  var p = r(w, A.df0);
545
- A.dhst[p]++, g += A.exb[U] + A.dxb[p], x[L] = y << 23 | n - h, x[L + 1] = w << 16 | U << 8 | p, L += 2, h = n + y;
545
+ A.dhst[p]++, g += A.exb[U] + A.dxb[p], x[O] = y << 23 | n - h, x[O + 1] = w << 16 | U << 8 | p, O += 2, h = n + y;
546
546
  } else A.lhst[e[n]]++;
547
547
  M++;
548
548
  }
549
549
  }
550
- 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++;
550
+ for (B == n && e.length != 0 || (h < n && (x[O] = n - h, O += 2, h = n), s = d.F._writeBlock(1, x, O, g, e, B, n - B, t, s), O = 0, M = 0, O = M = g = 0, B = n); (7 & s) != 0;) s++;
551
551
  return s >>> 3;
552
552
  }, d.F._bestMatch = function(e, t, u, a, m, A) {
553
553
  var r = 32767 & t, i = u[r], n = r - i + 32768 & 32767;
@@ -559,8 +559,8 @@ __useblocks__.define("static/core/db330968.js", [
559
559
  if (h = n, (s = x) >= m) break;
560
560
  n + 2 < x && (x = n + 2);
561
561
  for (var b = 0, D = 0; D < x - 2; D++) {
562
- var L = t - n + D + 32768 & 32767, M = L - u[L] + 32768 & 32767;
563
- M > b && (b = M, i = L);
562
+ var O = t - n + D + 32768 & 32767, M = O - u[O] + 32768 & 32767;
563
+ M > b && (b = M, i = O);
564
564
  }
565
565
  }
566
566
  }
@@ -575,10 +575,10 @@ __useblocks__.define("static/core/db330968.js", [
575
575
  }, d.F._hash = function(e, t) {
576
576
  return (e[t] << 8 | e[t + 1]) + (e[t + 2] << 4) & 65535;
577
577
  }, d.saved = 0, d.F._writeBlock = function(e, t, u, a, m, A, r, i, n) {
578
- var s, h, E, x, b, D, L, M, B, g = d.F.U, C = d.F._putsF, c = d.F._putsE;
579
- 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];
578
+ var s, h, E, x, b, D, O, M, B, g = d.F.U, C = d.F._putsF, c = d.F._putsE;
579
+ g.lhst[256]++, h = (s = d.F.getTrees())[0], E = s[1], x = s[2], b = s[3], D = s[4], O = s[5], M = s[6], B = s[7];
580
580
  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), y = a + d.F.contSize(g.ltree, g.lhst) + d.F.contSize(g.dtree, g.dhst);
581
- y += 14 + 3 * L + d.F.contSize(g.itree, g.ihst) + (2 * g.ihst[16] + 3 * g.ihst[17] + 7 * g.ihst[18]);
581
+ y += 14 + 3 * O + d.F.contSize(g.itree, g.ihst) + (2 * g.ihst[16] + 3 * g.ihst[17] + 7 * g.ihst[18]);
582
582
  for (var w = 0; w < 286; w++) g.lhst[w] = 0;
583
583
  for (w = 0; w < 30; w++) g.dhst[w] = 0;
584
584
  for (w = 0; w < 19; w++) g.ihst[w] = 0;
@@ -589,14 +589,14 @@ __useblocks__.define("static/core/db330968.js", [
589
589
  } else {
590
590
  var p, I;
591
591
  if (U == 1 && (p = g.fltree, I = g.fdtree), U == 2) {
592
- 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;
593
- for (var l = 0; l < L; l++) c(i, n + 3 * l, g.itree[1 + (g.ordr[l] << 1)]);
594
- n += 3 * L, n = d.F._codeTiny(M, g.itree, i, n), n = d.F._codeTiny(B, g.itree, i, n);
592
+ 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, O - 4), n += 4;
593
+ for (var l = 0; l < O; l++) c(i, n + 3 * l, g.itree[1 + (g.ordr[l] << 1)]);
594
+ n += 3 * O, n = d.F._codeTiny(M, g.itree, i, n), n = d.F._codeTiny(B, g.itree, i, n);
595
595
  }
596
- for (var o = A, O = 0; O < u; O += 2) {
597
- for (var F = t[O], k = F >>> 23, X = o + (8388607 & F); o < X;) n = d.F._writeLit(m[o++], p, i, n);
596
+ for (var o = A, L = 0; L < u; L += 2) {
597
+ for (var F = t[L], k = F >>> 23, X = o + (8388607 & F); o < X;) n = d.F._writeLit(m[o++], p, i, n);
598
598
  if (k != 0) {
599
- var z = t[O + 1], Q = z >> 16, j = z >> 8 & 255, S = 255 & z;
599
+ var z = t[L + 1], Q = z >> 16, j = z >> 8 & 255, S = 255 & z;
600
600
  c(i, n = d.F._writeLit(257 + j, p, i, n), k - g.of0[j]), n += g.exb[j], C(i, n = d.F._writeLit(S, I, i, n), Q - g.df0[S]), n += g.dxb[S], o += k;
601
601
  }
602
602
  }
@@ -680,9 +680,9 @@ __useblocks__.define("static/core/db330968.js", [
680
680
  l: h,
681
681
  r: E
682
682
  };
683
- var L = d.F.setDepth(a[b - 1], 0);
684
- 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;
685
- return L;
683
+ var O = d.F.setDepth(a[b - 1], 0);
684
+ for (O > u && (d.F.restrictDepth(n, u, O), O = u), r = 0; r < i; r++) t[1 + (n[r].lit << 1)] = n[r].d;
685
+ return O;
686
686
  }, d.F.setDepth = function(e, t) {
687
687
  return e.lit != -1 ? (e.d = t, t) : Math.max(d.F.setDepth(e.l, t + 1), d.F.setDepth(e.r, t + 1));
688
688
  }, d.F.restrictDepth = function(e, t, u) {
@@ -705,8 +705,8 @@ __useblocks__.define("static/core/db330968.js", [
705
705
  if (e[0] == 3 && e[1] == 0) return t || new u(0);
706
706
  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;
707
707
  E && (t = new u(e.length >>> 2 << 3));
708
- for (var x, b, D = 0, L = 0, M = 0, B = 0, g = 0, C = 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) {
709
- if (E && (t = d.F._check(t, f + (1 << 17))), L == 1 && (x = h.flmap, b = h.fdmap, C = 511, c = 31), L == 2) {
708
+ for (var x, b, D = 0, O = 0, M = 0, B = 0, g = 0, C = 0, c = 0, f = 0, v = 0; D == 0;) if (D = m(e, v, 1), O = m(e, v + 1, 2), v += 3, O != 0) {
709
+ if (E && (t = d.F._check(t, f + (1 << 17))), O == 1 && (x = h.flmap, b = h.fdmap, C = 511, c = 31), O == 2) {
710
710
  M = A(e, v, 5) + 257, B = A(e, v + 5, 5) + 1, g = A(e, v + 10, 4) + 4, v += 14;
711
711
  for (var y = 0; y < 38; y += 2) h.itree[y] = 0, h.itree[y + 1] = 0;
712
712
  var w = 1;
@@ -727,16 +727,16 @@ __useblocks__.define("static/core/db330968.js", [
727
727
  if (!(o >>> 8)) t[f++] = o;
728
728
  else {
729
729
  if (o == 256) break;
730
- var O = f + o - 254;
730
+ var L = f + o - 254;
731
731
  if (o > 264) {
732
732
  var F = h.ldef[o - 257];
733
- O = f + (F >>> 3) + A(e, v, 7 & F), v += 7 & F;
733
+ L = f + (F >>> 3) + A(e, v, 7 & F), v += 7 & F;
734
734
  }
735
735
  var k = b[s(e, v) & c];
736
736
  v += 15 & k;
737
737
  var X = k >>> 4, z = h.ddef[X], Q = (z >>> 4) + m(e, v, 15 & z);
738
- 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];
739
- f = O;
738
+ for (v += 15 & z, E && (t = d.F._check(t, f + (1 << 17))); f < L;) t[f] = t[f++ - Q], t[f] = t[f++ - Q], t[f] = t[f++ - Q], t[f] = t[f++ - Q];
739
+ f = L;
740
740
  }
741
741
  }
742
742
  } else {
@@ -1039,12 +1039,12 @@ __useblocks__.define("static/core/db330968.js", [
1039
1039
  }
1040
1040
  };
1041
1041
  function T(r, i, n, s) {
1042
- 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;
1043
- if (L == 6) {
1042
+ const h = i * n, E = t(s), x = Math.ceil(i * E / 8), b = new Uint8Array(4 * h), D = new Uint32Array(b.buffer), { ctype: O } = s, { depth: M } = s, B = P.readUshort;
1043
+ if (O == 6) {
1044
1044
  const F = h << 2;
1045
1045
  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];
1046
1046
  if (M == 16) for (g = 0; g < F; g++) b[g] = r[g << 1];
1047
- } else if (L == 2) {
1047
+ } else if (O == 2) {
1048
1048
  const F = s.tabs.tRNS;
1049
1049
  if (F == null) {
1050
1050
  if (M == 8) for (g = 0; g < h; g++) {
@@ -1061,7 +1061,7 @@ __useblocks__.define("static/core/db330968.js", [
1061
1061
  }
1062
1062
  if (M == 16) for (g = 0; g < h; g++) f = g << 2, C = 6 * g, D[g] = 255 << 24 | r[C + 4] << 16 | r[C + 2] << 8 | r[C], B(r, C) == c && B(r, C + 2) == k && B(r, C + 4) == X && (b[f + 3] = 0);
1063
1063
  }
1064
- } else if (L == 3) {
1064
+ } else if (O == 3) {
1065
1065
  const F = s.tabs.PLTE, k = s.tabs.tRNS, X = k ? k.length : 0;
1066
1066
  if (M == 1) for (var v = 0; v < n; v++) {
1067
1067
  var y = v * x, w = v * i;
@@ -1077,7 +1077,7 @@ __useblocks__.define("static/core/db330968.js", [
1077
1077
  var p;
1078
1078
  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;
1079
1079
  }
1080
- } else if (L == 4) {
1080
+ } else if (O == 4) {
1081
1081
  if (M == 8) for (g = 0; g < h; g++) {
1082
1082
  f = g << 2;
1083
1083
  var I = r[l = g << 1];
@@ -1087,23 +1087,23 @@ __useblocks__.define("static/core/db330968.js", [
1087
1087
  var l;
1088
1088
  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];
1089
1089
  }
1090
- } else if (L == 0) for (c = s.tabs.tRNS ? s.tabs.tRNS : -1, v = 0; v < n; v++) {
1090
+ } else if (O == 0) for (c = s.tabs.tRNS ? s.tabs.tRNS : -1, v = 0; v < n; v++) {
1091
1091
  const F = v * x, k = v * i;
1092
1092
  if (M == 1) for (var o = 0; o < i; o++) {
1093
- var O = (I = 255 * (r[F + (o >>> 3)] >>> 7 - (7 & o) & 1)) == 255 * c ? 0 : 255;
1094
- D[k + o] = O << 24 | I << 16 | I << 8 | I;
1093
+ var L = (I = 255 * (r[F + (o >>> 3)] >>> 7 - (7 & o) & 1)) == 255 * c ? 0 : 255;
1094
+ D[k + o] = L << 24 | I << 16 | I << 8 | I;
1095
1095
  }
1096
- 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;
1097
- 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;
1098
- 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;
1099
- 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;
1096
+ else if (M == 2) for (o = 0; o < i; o++) L = (I = 85 * (r[F + (o >>> 2)] >>> 6 - ((3 & o) << 1) & 3)) == 85 * c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
1097
+ else if (M == 4) for (o = 0; o < i; o++) L = (I = 17 * (r[F + (o >>> 1)] >>> 4 - ((1 & o) << 2) & 15)) == 17 * c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
1098
+ else if (M == 8) for (o = 0; o < i; o++) L = (I = r[F + o]) == c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
1099
+ else if (M == 16) for (o = 0; o < i; o++) I = r[F + (o << 1)], L = B(r, F + (o << 1)) == c ? 0 : 255, D[k + o] = L << 24 | I << 16 | I << 8 | I;
1100
1100
  }
1101
1101
  return b;
1102
1102
  }
1103
1103
  function H(r, i, n, s) {
1104
1104
  const h = t(r), E = Math.ceil(n * h / 8), x = new Uint8Array((E + 1 + r.interlace) * s);
1105
- 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) {
1106
- const M = L.width, B = L.height, g = t(L), C = g >> 3, c = Math.ceil(M * g / 8), f = new Uint8Array(B * c);
1105
+ 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, O) {
1106
+ const M = O.width, B = O.height, g = t(O), C = g >> 3, c = Math.ceil(M * g / 8), f = new Uint8Array(B * c);
1107
1107
  let v = 0;
1108
1108
  const y = [
1109
1109
  0,
@@ -1140,13 +1140,13 @@ __useblocks__.define("static/core/db330968.js", [
1140
1140
  ];
1141
1141
  let I = 0;
1142
1142
  for (; I < 7;) {
1143
- const o = U[I], O = p[I];
1143
+ const o = U[I], L = p[I];
1144
1144
  let F = 0, k = 0, X = y[I];
1145
1145
  for (; X < B;) X += o, k++;
1146
1146
  let z = w[I];
1147
- for (; z < M;) z += O, F++;
1147
+ for (; z < M;) z += L, F++;
1148
1148
  const Q = Math.ceil(F * g / 8);
1149
- u(D, L, v, F, k);
1149
+ u(D, O, v, F, k);
1150
1150
  let j = 0, S = y[I];
1151
1151
  for (; S < B;) {
1152
1152
  let q = w[I], oe = v + j * Q << 3;
@@ -1156,7 +1156,7 @@ __useblocks__.define("static/core/db330968.js", [
1156
1156
  const te = S * c + q * C;
1157
1157
  for (let J = 0; J < C; J++) f[te + J] = D[(oe >> 3) + J];
1158
1158
  }
1159
- oe += g, q += O;
1159
+ oe += g, q += L;
1160
1160
  }
1161
1161
  j++, S += o;
1162
1162
  }
@@ -1172,22 +1172,22 @@ __useblocks__.define("static/core/db330968.js", [
1172
1172
  const r = { H: {} };
1173
1173
  return r.H.N = function(i, n) {
1174
1174
  const s = Uint8Array;
1175
- let h, E, x = 0, b = 0, D = 0, L = 0, M = 0, B = 0, g = 0, C = 0, c = 0;
1175
+ let h, E, x = 0, b = 0, D = 0, O = 0, M = 0, B = 0, g = 0, C = 0, c = 0;
1176
1176
  if (i[0] == 3 && i[1] == 0) return n || new s(0);
1177
1177
  const f = r.H, v = f.b, y = f.e, w = f.R, U = f.n, p = f.A, I = f.Z, l = f.m, o = n == null;
1178
1178
  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) {
1179
1179
  if (o && (n = r.H.W(n, C + (1 << 17))), b == 1 && (h = l.J, E = l.h, B = 511, g = 31), b == 2) {
1180
- D = y(i, c, 5) + 257, L = y(i, c + 5, 5) + 1, M = y(i, c + 10, 4) + 4, c += 14;
1180
+ D = y(i, c, 5) + 257, O = y(i, c + 5, 5) + 1, M = y(i, c + 10, 4) + 4, c += 14;
1181
1181
  let F = 1;
1182
- for (var O = 0; O < 38; O += 2) l.Q[O] = 0, l.Q[O + 1] = 0;
1183
- for (O = 0; O < M; O++) {
1184
- const z = y(i, c + 3 * O, 3);
1185
- l.Q[1 + (l.X[O] << 1)] = z, z > F && (F = z);
1182
+ for (var L = 0; L < 38; L += 2) l.Q[L] = 0, l.Q[L + 1] = 0;
1183
+ for (L = 0; L < M; L++) {
1184
+ const z = y(i, c + 3 * L, 3);
1185
+ l.Q[1 + (l.X[L] << 1)] = z, z > F && (F = z);
1186
1186
  }
1187
- c += 3 * M, U(l.Q, F), p(l.Q, F, l.u), h = l.w, E = l.d, c = w(l.u, (1 << F) - 1, D + L, i, c, l.v);
1187
+ c += 3 * M, U(l.Q, F), p(l.Q, F, l.u), h = l.w, E = l.d, c = w(l.u, (1 << F) - 1, D + O, i, c, l.v);
1188
1188
  const k = f.V(l.v, 0, D, l.C);
1189
1189
  B = (1 << k) - 1;
1190
- const X = f.V(l.v, D, L, l.D);
1190
+ const X = f.V(l.v, D, O, l.D);
1191
1191
  g = (1 << X) - 1, U(l.C, k), p(l.C, k, h), U(l.D, X), p(l.D, X, E);
1192
1192
  }
1193
1193
  for (;;) {
@@ -1224,17 +1224,17 @@ __useblocks__.define("static/core/db330968.js", [
1224
1224
  return h.set(i, 0), h;
1225
1225
  }, r.H.R = function(i, n, s, h, E, x) {
1226
1226
  const b = r.H.e, D = r.H.Z;
1227
- let L = 0;
1228
- for (; L < s;) {
1227
+ let O = 0;
1228
+ for (; O < s;) {
1229
1229
  const M = i[D(h, E) & n];
1230
1230
  E += 15 & M;
1231
1231
  const B = M >>> 4;
1232
- if (B <= 15) x[L] = B, L++;
1232
+ if (B <= 15) x[O] = B, O++;
1233
1233
  else {
1234
1234
  let g = 0, C = 0;
1235
- B == 16 ? (C = 3 + b(h, E, 2), E += 2, g = x[L - 1]) : B == 17 ? (C = 3 + b(h, E, 3), E += 3) : B == 18 && (C = 11 + b(h, E, 7), E += 7);
1236
- const c = L + C;
1237
- for (; L < c;) x[L] = g, L++;
1235
+ B == 16 ? (C = 3 + b(h, E, 2), E += 2, g = x[O - 1]) : B == 17 ? (C = 3 + b(h, E, 3), E += 3) : B == 18 && (C = 11 + b(h, E, 7), E += 7);
1236
+ const c = O + C;
1237
+ for (; O < c;) x[O] = g, O++;
1238
1238
  }
1239
1239
  }
1240
1240
  return E;
@@ -1250,19 +1250,19 @@ __useblocks__.define("static/core/db330968.js", [
1250
1250
  }, r.H.n = function(i, n) {
1251
1251
  const s = r.H.m, h = i.length;
1252
1252
  let E, x, b, D;
1253
- const L = s.j;
1254
- for (var M = 0; M <= n; M++) L[M] = 0;
1255
- for (M = 1; M < h; M += 2) L[i[M]]++;
1253
+ const O = s.j;
1254
+ for (var M = 0; M <= n; M++) O[M] = 0;
1255
+ for (M = 1; M < h; M += 2) O[i[M]]++;
1256
1256
  const B = s.K;
1257
- for (E = 0, L[0] = 0, x = 1; x <= n; x++) E = E + L[x - 1] << 1, B[x] = E;
1257
+ for (E = 0, O[0] = 0, x = 1; x <= n; x++) E = E + O[x - 1] << 1, B[x] = E;
1258
1258
  for (b = 0; b < h; b += 2) D = i[b + 1], D != 0 && (i[b] = B[D], B[D]++);
1259
1259
  }, r.H.A = function(i, n, s) {
1260
1260
  const h = i.length, E = r.H.m.r;
1261
1261
  for (let x = 0; x < h; x += 2) if (i[x + 1] != 0) {
1262
- const b = x >> 1, D = i[x + 1], L = b << 4 | D, M = n - D;
1262
+ const b = x >> 1, D = i[x + 1], O = b << 4 | D, M = n - D;
1263
1263
  let B = i[x] << M;
1264
1264
  const g = B + (1 << M);
1265
- for (; B != g;) s[E[B] >>> 15 - n] = L, B++;
1265
+ for (; B != g;) s[E[B] >>> 15 - n] = O, B++;
1266
1266
  }
1267
1267
  }, r.H.l = function(i, n) {
1268
1268
  const s = r.H.m.r, h = 15 - n;
@@ -1495,18 +1495,18 @@ __useblocks__.define("static/core/db330968.js", [
1495
1495
  const x = Math.ceil(s * E / 8);
1496
1496
  let b, D;
1497
1497
  E = Math.ceil(E / 8);
1498
- let L = r[n], M = 0;
1499
- if (L > 1 && (r[n] = [
1498
+ let O = r[n], M = 0;
1499
+ if (O > 1 && (r[n] = [
1500
1500
  0,
1501
1501
  0,
1502
1502
  1
1503
- ][L - 2]), L == 3) for (M = E; M < x; M++) r[M + 1] = r[M + 1] + (r[M + 1 - E] >>> 1) & 255;
1504
- 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];
1505
- else if (L == 1) {
1503
+ ][O - 2]), O == 3) for (M = E; M < x; M++) r[M + 1] = r[M + 1] + (r[M + 1 - E] >>> 1) & 255;
1504
+ for (let B = 0; B < h; B++) if (b = n + B * x, D = b + B + 1, O = r[D - 1], M = 0, O == 0) for (; M < x; M++) r[b + M] = r[D + M];
1505
+ else if (O == 1) {
1506
1506
  for (; M < E; M++) r[b + M] = r[D + M];
1507
1507
  for (; M < x; M++) r[b + M] = r[D + M] + r[b + M - E];
1508
- } else if (L == 2) for (; M < x; M++) r[b + M] = r[D + M] + r[b + M - x];
1509
- else if (L == 3) {
1508
+ } else if (O == 2) for (; M < x; M++) r[b + M] = r[D + M] + r[b + M - x];
1509
+ else if (O == 3) {
1510
1510
  for (; M < E; M++) r[b + M] = r[D + M] + (r[b + M - x] >>> 1);
1511
1511
  for (; M < x; M++) r[b + M] = r[D + M] + (r[b + M - x] + r[b + M - E] >>> 1);
1512
1512
  } else {
@@ -1523,13 +1523,13 @@ __useblocks__.define("static/core/db330968.js", [
1523
1523
  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++;
1524
1524
  }
1525
1525
  function A(r, i, n, s, h, E, x, b, D) {
1526
- const L = Math.min(i, h), M = Math.min(n, E);
1526
+ const O = Math.min(i, h), M = Math.min(n, E);
1527
1527
  let B = 0, g = 0;
1528
- 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];
1528
+ for (let I = 0; I < M; I++) for (let l = 0; l < O; 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];
1529
1529
  else if (D == 1) {
1530
1530
  var C = r[B + 3] * .00392156862745098, c = r[B] * C, f = r[B + 1] * C, v = r[B + 2] * C, y = s[g + 3] * (1 / 255), w = s[g] * y, U = s[g + 1] * y, p = s[g + 2] * y;
1531
- const o = 1 - C, O = C + y * o, F = O == 0 ? 0 : 1 / O;
1532
- s[g + 3] = 255 * O, s[g + 0] = (c + w * o) * F, s[g + 1] = (f + U * o) * F, s[g + 2] = (v + p * o) * F;
1531
+ const o = 1 - C, L = C + y * o, F = L == 0 ? 0 : 1 / L;
1532
+ s[g + 3] = 255 * L, s[g + 0] = (c + w * o) * F, s[g + 1] = (f + U * o) * F, s[g + 2] = (v + p * o) * F;
1533
1533
  } else if (D == 2) C = r[B + 3], c = r[B], f = r[B + 1], v = r[B + 2], y = s[g + 3], w = s[g], U = s[g + 1], p = s[g + 2], C == y && c == w && 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] = C);
1534
1534
  else if (D == 3) {
1535
1535
  if (C = r[B + 3], c = r[B], f = r[B + 1], v = r[B + 2], y = s[g + 3], w = s[g], U = s[g + 1], p = s[g + 2], C == y && c == w && f == U && v == p) continue;
@@ -1545,7 +1545,7 @@ __useblocks__.define("static/core/db330968.js", [
1545
1545
  tabs: {},
1546
1546
  frames: []
1547
1547
  }, D = new Uint8Array(n.length);
1548
- let L, M = 0, B = 0;
1548
+ let O, M = 0, B = 0;
1549
1549
  const g = [
1550
1550
  137,
1551
1551
  80,
@@ -1566,13 +1566,13 @@ __useblocks__.define("static/core/db330968.js", [
1566
1566
  for (var c = s; n[c] != 0;) c++;
1567
1567
  h.readASCII(n, s, c - s), n[c + 1];
1568
1568
  const o = n.slice(c + 2, s + I);
1569
- let O = null;
1569
+ let L = null;
1570
1570
  try {
1571
- O = d(o);
1571
+ L = d(o);
1572
1572
  } catch {
1573
- O = e(o);
1573
+ L = e(o);
1574
1574
  }
1575
- b.tabs[l] = O;
1575
+ b.tabs[l] = L;
1576
1576
  } else if (l == "CgBI") b.tabs[l] = n.slice(s, s + 4);
1577
1577
  else if (l == "IDAT") {
1578
1578
  for (C = 0; C < I; C++) D[M + C] = n[s + C];
@@ -1580,26 +1580,26 @@ __useblocks__.define("static/core/db330968.js", [
1580
1580
  } else if (l == "acTL") b.tabs[l] = {
1581
1581
  num_frames: x(n, s),
1582
1582
  num_plays: x(n, s + 4)
1583
- }, L = new Uint8Array(n.length);
1583
+ }, O = new Uint8Array(n.length);
1584
1584
  else if (l == "fcTL") {
1585
- B != 0 && ((p = b.frames[b.frames.length - 1]).data = H(b, L.slice(0, B), p.rect.width, p.rect.height), B = 0);
1585
+ B != 0 && ((p = b.frames[b.frames.length - 1]).data = H(b, O.slice(0, B), p.rect.width, p.rect.height), B = 0);
1586
1586
  const o = {
1587
1587
  x: x(n, s + 12),
1588
1588
  y: x(n, s + 16),
1589
1589
  width: x(n, s + 4),
1590
1590
  height: x(n, s + 8)
1591
1591
  };
1592
- let O = E(n, s + 22);
1593
- O = E(n, s + 20) / (O == 0 ? 100 : O);
1592
+ let L = E(n, s + 22);
1593
+ L = E(n, s + 20) / (L == 0 ? 100 : L);
1594
1594
  const F = {
1595
1595
  rect: o,
1596
- delay: Math.round(1e3 * O),
1596
+ delay: Math.round(1e3 * L),
1597
1597
  dispose: n[s + 24],
1598
1598
  blend: n[s + 25]
1599
1599
  };
1600
1600
  b.frames.push(F);
1601
1601
  } else if (l == "fdAT") {
1602
- for (C = 0; C < I - 4; C++) L[B + C] = n[s + C + 4];
1602
+ for (C = 0; C < I - 4; C++) O[B + C] = n[s + C + 4];
1603
1603
  B += I - 4;
1604
1604
  } else if (l == "pHYs") b.tabs[l] = [
1605
1605
  h.readUint(n, s),
@@ -1641,7 +1641,7 @@ __useblocks__.define("static/core/db330968.js", [
1641
1641
  s += I, h.readUint(n, s), s += 4;
1642
1642
  }
1643
1643
  var p;
1644
- 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;
1644
+ return B != 0 && ((p = b.frames[b.frames.length - 1]).data = H(b, O.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;
1645
1645
  },
1646
1646
  toRGBA8: function(i) {
1647
1647
  const n = i.width, s = i.height;
@@ -1651,10 +1651,10 @@ __useblocks__.define("static/core/db330968.js", [
1651
1651
  const E = n * s * 4, x = new Uint8Array(E), b = new Uint8Array(E), D = new Uint8Array(E);
1652
1652
  for (let M = 0; M < i.frames.length; M++) {
1653
1653
  const B = i.frames[M], g = B.rect.x, C = B.rect.y, c = B.rect.width, f = B.rect.height, v = T(B.data, c, f, i);
1654
- if (M != 0) for (var L = 0; L < E; L++) D[L] = x[L];
1654
+ if (M != 0) for (var O = 0; O < E; O++) D[O] = x[O];
1655
1655
  if (B.blend == 0 ? A(v, c, f, x, n, s, g, C, 0) : B.blend == 1 && A(v, c, f, x, n, s, g, C, 1), h.push(x.buffer.slice(0)), B.dispose != 0) {
1656
1656
  if (B.dispose == 1) A(b, c, f, x, n, s, g, C, 0);
1657
- else if (B.dispose == 2) for (L = 0; L < E; L++) x[L] = D[L];
1657
+ else if (B.dispose == 2) for (O = 0; O < E; O++) x[O] = D[O];
1658
1658
  }
1659
1659
  }
1660
1660
  return h;
@@ -1706,9 +1706,9 @@ __useblocks__.define("static/core/db330968.js", [
1706
1706
  }
1707
1707
  for (o = 0; o < I; o++) {
1708
1708
  let S = 4294967295;
1709
- for (var O = 0, F = 0; F < I; F++) {
1709
+ for (var L = 0, F = 0; F < I; F++) {
1710
1710
  var k = u(l[o], l[F]);
1711
- F != o && k < S && (S = k, O = F);
1711
+ F != o && k < S && (S = k, L = F);
1712
1712
  }
1713
1713
  }
1714
1714
  const X = new Uint32Array(w.buffer), z = new Int16Array(f * v * 4), Q = [
@@ -1742,32 +1742,32 @@ __useblocks__.define("static/core/db330968.js", [
1742
1742
  t(c[o + 1] + k),
1743
1743
  t(c[o + 2] + k),
1744
1744
  t(c[o + 3] + k)
1745
- ]), O = 0;
1745
+ ]), L = 0;
1746
1746
  let oe = 16777215;
1747
1747
  for (F = 0; F < I; F++) {
1748
1748
  const re = u(j, l[F]);
1749
- re < oe && (oe = re, O = F);
1749
+ re < oe && (oe = re, L = F);
1750
1750
  }
1751
- const te = l[O], J = [
1751
+ const te = l[L], J = [
1752
1752
  j[0] - te[0],
1753
1753
  j[1] - te[1],
1754
1754
  j[2] - te[2],
1755
1755
  j[3] - te[3]
1756
1756
  ];
1757
- p == 1 && (q != f - 1 && e(J, z, o + 4, 7), S != 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] = y[O];
1757
+ p == 1 && (q != f - 1 && e(J, z, o + 4, 7), S != 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] = L, X[o >> 2] = y[L];
1758
1758
  }
1759
1759
  }
1760
1760
  function m(c, f, v, y, w) {
1761
1761
  w ??= {};
1762
1762
  const { crc: U } = d, p = T.writeUint, I = T.writeUshort, l = T.writeASCII;
1763
1763
  let o = 8;
1764
- const O = c.frames.length > 1;
1765
- let F, k = !1, X = 33 + (O ? 20 : 0);
1764
+ const L = c.frames.length > 1;
1765
+ let F, k = !1, X = 33 + (L ? 20 : 0);
1766
1766
  if (w.sRGB != null && (X += 13), w.pHYs != null && (X += 21), w.iCCP != null && (F = pako.deflate(w.iCCP), X += 21 + F.length + 4), c.ctype == 3) {
1767
1767
  for (var z = c.plte.length, Q = 0; Q < z; Q++) c.plte[Q] >>> 24 != 255 && (k = !0);
1768
1768
  X += 8 + 3 * z + 4 + (k ? 8 + 1 * z + 4 : 0);
1769
1769
  }
1770
- for (var j = 0; j < c.frames.length; j++) O && (X += 38), X += (te = c.frames[j]).cimg.length + 12, j != 0 && (X += 4);
1770
+ for (var j = 0; j < c.frames.length; j++) L && (X += 38), X += (te = c.frames[j]).cimg.length + 12, j != 0 && (X += 4);
1771
1771
  X += 12;
1772
1772
  const S = new Uint8Array(X), q = [
1773
1773
  137,
@@ -1784,7 +1784,7 @@ __useblocks__.define("static/core/db330968.js", [
1784
1784
  const J = 13 + F.length;
1785
1785
  p(S, o, J), o += 4, l(S, o, "iCCP"), o += 4, l(S, o, "ICC profile"), o += 11, o += 2, S.set(F, o), o += F.length, p(S, o, U(S, o - (J + 4), J + 4)), o += 4;
1786
1786
  }
1787
- if (w.pHYs != null && (p(S, o, 9), o += 4, l(S, o, "pHYs"), o += 4, p(S, o, w.pHYs[0]), o += 4, p(S, o, w.pHYs[1]), o += 4, S[o] = w.pHYs[2], o++, p(S, o, U(S, o - 13, 13)), o += 4), O && (p(S, o, 8), o += 4, l(S, o, "acTL"), o += 4, p(S, o, c.frames.length), o += 4, p(S, o, w.loop != null ? w.loop : 0), o += 4, p(S, o, U(S, o - 12, 12)), o += 4), c.ctype == 3) {
1787
+ if (w.pHYs != null && (p(S, o, 9), o += 4, l(S, o, "pHYs"), o += 4, p(S, o, w.pHYs[0]), o += 4, p(S, o, w.pHYs[1]), o += 4, S[o] = w.pHYs[2], o++, p(S, o, U(S, o - 13, 13)), o += 4), L && (p(S, o, 8), o += 4, l(S, o, "acTL"), o += 4, p(S, o, c.frames.length), o += 4, p(S, o, w.loop != null ? w.loop : 0), o += 4, p(S, o, U(S, o - 12, 12)), o += 4), c.ctype == 3) {
1788
1788
  for (p(S, o, 3 * (z = c.plte.length)), o += 4, l(S, o, "PLTE"), o += 4, Q = 0; Q < z; Q++) {
1789
1789
  const J = 3 * Q, re = c.plte[Q], fe = 255 & re, ce = re >>> 8 & 255, je = re >>> 16 & 255;
1790
1790
  S[o + J + 0] = fe, S[o + J + 1] = ce, S[o + J + 2] = je;
@@ -1797,7 +1797,7 @@ __useblocks__.define("static/core/db330968.js", [
1797
1797
  let oe = 0;
1798
1798
  for (j = 0; j < c.frames.length; j++) {
1799
1799
  var te = c.frames[j];
1800
- O && (p(S, o, 26), o += 4, l(S, o, "fcTL"), o += 4, p(S, o, oe++), o += 4, p(S, o, te.rect.width), o += 4, p(S, o, te.rect.height), o += 4, p(S, o, te.rect.x), o += 4, p(S, o, te.rect.y), o += 4, I(S, o, y[j]), o += 2, I(S, o, 1e3), o += 2, S[o] = te.dispose, o++, S[o] = te.blend, o++, p(S, o, U(S, o - 30, 30)), o += 4);
1800
+ L && (p(S, o, 26), o += 4, l(S, o, "fcTL"), o += 4, p(S, o, oe++), o += 4, p(S, o, te.rect.width), o += 4, p(S, o, te.rect.height), o += 4, p(S, o, te.rect.x), o += 4, p(S, o, te.rect.y), o += 4, I(S, o, y[j]), o += 2, I(S, o, 1e3), o += 2, S[o] = te.dispose, o++, S[o] = te.blend, o++, p(S, o, U(S, o - 30, 30)), o += 4);
1801
1801
  const J = te.cimg;
1802
1802
  p(S, o, (z = J.length) + (j == 0 ? 0 : 4)), o += 4;
1803
1803
  const re = o;
@@ -1814,7 +1814,7 @@ __useblocks__.define("static/core/db330968.js", [
1814
1814
  }
1815
1815
  }
1816
1816
  function r(c, f, v, y, w) {
1817
- const U = w[0], p = w[1], I = w[2], l = w[3], o = w[4], O = w[5];
1817
+ const U = w[0], p = w[1], I = w[2], l = w[3], o = w[4], L = w[5];
1818
1818
  let F = 6, k = 8, X = 255;
1819
1819
  for (var z = 0; z < c.length; z++) {
1820
1820
  const ve = new Uint8Array(c[z]);
@@ -1832,11 +1832,11 @@ __useblocks__.define("static/core/db330968.js", [
1832
1832
  for (let Je = 0; Je < wn; Je++) {
1833
1833
  var Ye = new Uint8Array(ne[ie - 1 - Je]);
1834
1834
  const yn = new Uint32Array(ne[ie - 1 - Je]);
1835
- let Oe = ae, ke = le, Ze = -1, et = -1;
1836
- for (let We = 0; We < le; We++) for (let Qe = 0; Qe < ae; Qe++) Fe[Le = We * ae + Qe] != yn[Le] && (Qe < Oe && (Oe = Qe), Qe > Ze && (Ze = Qe), We < ke && (ke = We), We > et && (et = We));
1837
- Ze == -1 && (Oe = ke = Ze = et = 0), we && ((1 & Oe) == 1 && Oe--, (1 & ke) == 1 && ke--);
1838
- const Tt = (Ze - Oe + 1) * (et - ke + 1);
1839
- Tt < Pt && (Pt = Tt, vt = Je, Re = Oe, Pe = ke, xe = Ze - Oe + 1, ze = et - ke + 1);
1835
+ let Le = ae, ke = le, Ze = -1, et = -1;
1836
+ for (let We = 0; We < le; We++) for (let Qe = 0; Qe < ae; Qe++) Fe[Oe = We * ae + Qe] != yn[Oe] && (Qe < Le && (Le = Qe), Qe > Ze && (Ze = Qe), We < ke && (ke = We), We > et && (et = We));
1837
+ Ze == -1 && (Le = ke = Ze = et = 0), we && ((1 & Le) == 1 && Le--, (1 & ke) == 1 && ke--);
1838
+ const Tt = (Ze - Le + 1) * (et - ke + 1);
1839
+ Tt < Pt && (Pt = Tt, vt = Je, Re = Le, Pe = ke, xe = Ze - Le + 1, ze = et - ke + 1);
1840
1840
  }
1841
1841
  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(ye, ae, le, _e, xe, ze, -Re, -Pe, 3) ? 1 : 0, pt == 1 ? n(ye, ae, le, _e, {
1842
1842
  x: Re,
@@ -1868,9 +1868,9 @@ __useblocks__.define("static/core/db330968.js", [
1868
1868
  he[ie - 1].dispose = 1, ie - 1 != 0 && i(ne, ae, le, he, ie - 1, xe, we), i(ne, ae, le, he, ie, xe, we);
1869
1869
  }
1870
1870
  let Ue = 0;
1871
- if (ne.length != 1) for (var Le = 0; Le < he.length; Le++) {
1871
+ if (ne.length != 1) for (var Oe = 0; Oe < he.length; Oe++) {
1872
1872
  var Ne;
1873
- Ue += (Ne = he[Le]).rect.width * Ne.rect.height;
1873
+ Ue += (Ne = he[Oe]).rect.width * Ne.rect.height;
1874
1874
  }
1875
1875
  return he;
1876
1876
  })(c, f, v, U, p, I), oe = {}, te = [], J = [];
@@ -1885,9 +1885,9 @@ __useblocks__.define("static/core/db330968.js", [
1885
1885
  for (de = 0; de < ue.length; de++) {
1886
1886
  const _e = new Uint8Array(ue[de]), Ye = _e.length;
1887
1887
  for (let Ue = 0; Ue < Ye; Ue += 4) {
1888
- let Le = _e[Ue], Ne = _e[Ue + 1], ye = _e[Ue + 2];
1888
+ let Oe = _e[Ue], Ne = _e[Ue + 1], ye = _e[Ue + 2];
1889
1889
  const Fe = _e[Ue + 3];
1890
- Fe == 0 && (Le = Ne = ye = 0), he[ie + Ue] = Le, he[ie + Ue + 1] = Ne, he[ie + Ue + 2] = ye, he[ie + Ue + 3] = Fe;
1890
+ Fe == 0 && (Oe = Ne = ye = 0), he[ie + Ue] = Oe, he[ie + Ue + 1] = Ne, he[ie + Ue + 2] = ye, he[ie + Ue + 3] = Fe;
1891
1891
  }
1892
1892
  ie += Ye;
1893
1893
  }
@@ -1900,7 +1900,7 @@ __useblocks__.define("static/core/db330968.js", [
1900
1900
  var re = new Uint8Array(ne.inds.buffer, ae >> 2, le >> 2);
1901
1901
  J.push(re);
1902
1902
  const ue = new Uint8Array(ne.abuf, ae, le);
1903
- O && a(fe.img, fe.rect.width, fe.rect.height, te, ue, re), fe.img.set(ue), ae += le;
1903
+ L && a(fe.img, fe.rect.width, fe.rect.height, te, ue, re), fe.img.set(ue), ae += le;
1904
1904
  }
1905
1905
  } else for (z = 0; z < q.length; z++) {
1906
1906
  var fe = q[z];
@@ -1956,11 +1956,11 @@ __useblocks__.define("static/core/db330968.js", [
1956
1956
  };
1957
1957
  }
1958
1958
  function i(c, f, v, y, w, U, p) {
1959
- const I = Uint8Array, l = Uint32Array, o = new I(c[w - 1]), O = new l(c[w - 1]), F = w + 1 < c.length ? new I(c[w + 1]) : null, k = new I(c[w]), X = new l(k.buffer);
1959
+ const I = Uint8Array, l = Uint32Array, o = new I(c[w - 1]), L = new l(c[w - 1]), F = w + 1 < c.length ? new I(c[w + 1]) : null, k = new I(c[w]), X = new l(k.buffer);
1960
1960
  let z = f, Q = v, j = -1, S = -1;
1961
1961
  for (let oe = 0; oe < U.height; oe++) for (let te = 0; te < U.width; te++) {
1962
1962
  const J = U.x + te, re = U.y + oe, fe = re * f + J, ce = X[fe];
1963
- ce == 0 || y[w - 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 > S && (S = re));
1963
+ ce == 0 || y[w - 1].dispose == 0 && L[fe] == ce && (F == null || F[4 * fe + 3] != 0) || (J < z && (z = J), J > j && (j = J), re < Q && (Q = re), re > S && (S = re));
1964
1964
  }
1965
1965
  j == -1 && (z = Q = j = S = 0), p && ((1 & z) == 1 && z--, (1 & Q) == 1 && Q--), U = {
1966
1966
  x: z,
@@ -1984,10 +1984,10 @@ __useblocks__.define("static/core/db330968.js", [
1984
1984
  4
1985
1985
  ];
1986
1986
  U != -1 ? o = [U] : (f * y > 5e5 || v == 1) && (o = [0]), p && (l = { level: 0 });
1987
- const O = V;
1987
+ const L = V;
1988
1988
  for (var F = 0; F < o.length; F++) {
1989
1989
  for (let z = 0; z < f; z++) h(w, c, z, y, v, o[F]);
1990
- I.push(O.deflate(w, l));
1990
+ I.push(L.deflate(w, l));
1991
1991
  }
1992
1992
  let k, X = 1e9;
1993
1993
  for (F = 0; F < I.length; F++) I[F].length < X && (k = F, X = I[F].length);
@@ -2020,12 +2020,12 @@ __useblocks__.define("static/core/db330968.js", [
2020
2020
  }
2021
2021
  function E(c, f) {
2022
2022
  const v = new Uint8Array(c), y = v.slice(0), w = new Uint32Array(y.buffer), U = x(y, f), p = U[0], I = U[1], l = v.length, o = new Uint8Array(l >> 2);
2023
- let O;
2024
- 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, w[F >> 2] = O.est.rgba;
2023
+ let L;
2024
+ if (v.length < 2e7) for (var F = 0; F < l; F += 4) L = 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] = L.ind, w[F >> 2] = L.est.rgba;
2025
2025
  else for (F = 0; F < l; F += 4) {
2026
2026
  var k = v[F] * .00392156862745098, X = v[F + 1] * (1 / 255), z = v[F + 2] * (1 / 255), Q = v[F + 3] * (1 / 255);
2027
- for (O = p; O.left;) O = D(O.est, k, X, z, Q) <= 0 ? O.left : O.right;
2028
- o[F >> 2] = O.ind, w[F >> 2] = O.est.rgba;
2027
+ for (L = p; L.left;) L = D(L.est, k, X, z, Q) <= 0 ? L.left : L.right;
2028
+ o[F >> 2] = L.ind, w[F >> 2] = L.est.rgba;
2029
2029
  }
2030
2030
  return {
2031
2031
  abuf: y.buffer,
@@ -2050,14 +2050,14 @@ __useblocks__.define("static/core/db330968.js", [
2050
2050
  let I = 0, l = 0;
2051
2051
  for (var p = 0; p < U.length; p++) U[p].est.L > I && (I = U[p].est.L, l = p);
2052
2052
  if (I < v) break;
2053
- const o = U[l], O = L(c, y, o.i0, o.i1, o.est.e, o.est.eMq255);
2054
- if (o.i0 >= O || o.i1 <= O) {
2053
+ const o = U[l], L = O(c, y, o.i0, o.i1, o.est.e, o.est.eMq255);
2054
+ if (o.i0 >= L || o.i1 <= L) {
2055
2055
  o.est.L = 0;
2056
2056
  continue;
2057
2057
  }
2058
2058
  const F = {
2059
2059
  i0: o.i0,
2060
- i1: O,
2060
+ i1: L,
2061
2061
  bst: null,
2062
2062
  est: null,
2063
2063
  tdst: 0,
@@ -2066,7 +2066,7 @@ __useblocks__.define("static/core/db330968.js", [
2066
2066
  };
2067
2067
  F.bst = B(c, F.i0, F.i1), F.est = g(F.bst);
2068
2068
  const k = {
2069
- i0: O,
2069
+ i0: L,
2070
2070
  i1: o.i1,
2071
2071
  bst: null,
2072
2072
  est: null,
@@ -2102,7 +2102,7 @@ __useblocks__.define("static/core/db330968.js", [
2102
2102
  const { e: U } = c;
2103
2103
  return U[0] * f + U[1] * v + U[2] * y + U[3] * w - c.eMq;
2104
2104
  }
2105
- function L(c, f, v, y, w, U) {
2105
+ function O(c, f, v, y, w, U) {
2106
2106
  for (y -= 4; v < y;) {
2107
2107
  for (; M(c, v, w) <= U;) v += 4;
2108
2108
  for (; M(c, y, w) > U;) y -= 4;
@@ -2141,8 +2141,8 @@ __useblocks__.define("static/core/db330968.js", [
2141
2141
  0
2142
2142
  ], U = v - f >> 2;
2143
2143
  for (let p = f; p < v; p += 4) {
2144
- const I = c[p] * .00392156862745098, l = c[p + 1] * (1 / 255), o = c[p + 2] * (1 / 255), O = c[p + 3] * (1 / 255);
2145
- w[0] += I, w[1] += l, w[2] += o, w[3] += O, y[0] += I * I, y[1] += I * l, y[2] += I * o, y[3] += I * O, y[5] += l * l, y[6] += l * o, y[7] += l * O, y[10] += o * o, y[11] += o * O, y[15] += O * O;
2144
+ const I = c[p] * .00392156862745098, l = c[p + 1] * (1 / 255), o = c[p + 2] * (1 / 255), L = c[p + 3] * (1 / 255);
2145
+ w[0] += I, w[1] += l, w[2] += o, w[3] += L, y[0] += I * I, y[1] += I * l, y[2] += I * o, y[3] += I * L, y[5] += l * l, y[6] += l * o, y[7] += l * L, y[10] += o * o, y[11] += o * L, y[15] += L * L;
2146
2146
  }
2147
2147
  return y[4] = y[1], y[8] = y[2], y[9] = y[6], y[12] = y[3], y[13] = y[7], y[14] = y[11], {
2148
2148
  R: y,
@@ -2168,14 +2168,14 @@ __useblocks__.define("static/core/db330968.js", [
2168
2168
  f[13] - I * U * l,
2169
2169
  f[14] - I * p * l,
2170
2170
  f[15] - I * I * l
2171
- ], O = o, F = C;
2171
+ ], L = o, F = C;
2172
2172
  let k = [
2173
2173
  Math.random(),
2174
2174
  Math.random(),
2175
2175
  Math.random(),
2176
2176
  Math.random()
2177
2177
  ], X = 0, z = 0;
2178
- if (y != 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;
2178
+ if (y != 0) for (let j = 0; j < 16 && (k = F.multVec(L, 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;
2179
2179
  const Q = [
2180
2180
  w * l,
2181
2181
  U * l,
@@ -2223,7 +2223,7 @@ __useblocks__.define("static/core/db330968.js", [
2223
2223
  ctype: 0 + (w == 1 ? 0 : 2) + (U == 0 ? 0 : 4),
2224
2224
  depth: p,
2225
2225
  frames: []
2226
- }, O = (w + U) * p, F = O * v;
2226
+ }, L = (w + U) * p, F = L * v;
2227
2227
  for (let k = 0; k < f.length; k++) o.frames.push({
2228
2228
  rect: {
2229
2229
  x: 0,
@@ -2234,7 +2234,7 @@ __useblocks__.define("static/core/db330968.js", [
2234
2234
  img: new Uint8Array(f[k]),
2235
2235
  blend: 0,
2236
2236
  dispose: 1,
2237
- bpp: Math.ceil(O / 8),
2237
+ bpp: Math.ceil(L / 8),
2238
2238
  bpl: Math.ceil(F / 8)
2239
2239
  });
2240
2240
  return A(o, 0, !0), m(o, v, y, I, l);
@@ -2243,15 +2243,15 @@ __useblocks__.define("static/core/db330968.js", [
2243
2243
  const Y = {
2244
2244
  toArrayBuffer(P, T) {
2245
2245
  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;
2246
- let s, h, E, x, b = n, D = 0, L = 0, M = 0;
2246
+ let s, h, E, x, b = n, D = 0, O = 0, M = 0;
2247
2247
  function B(c) {
2248
- i.setUint16(L, c, !0), L += 2;
2248
+ i.setUint16(O, c, !0), O += 2;
2249
2249
  }
2250
2250
  function g(c) {
2251
- i.setUint32(L, c, !0), L += 4;
2251
+ i.setUint32(O, c, !0), O += 4;
2252
2252
  }
2253
2253
  function C(c) {
2254
- L += c;
2254
+ O += c;
2255
2255
  }
2256
2256
  B(19778), g(A), C(4), g(122), g(108), g(H), g(-d >>> 0), B(1), B(32), g(3), g(m), g(2835), g(2835), C(8), g(16711680), g(65280), g(255), g(4278190080), g(1466527264), (function c() {
2257
2257
  for (; D < d && b > 0;) {
@@ -2549,7 +2549,7 @@ __useblocks__.define("static/core/db330968.js", [
2549
2549
  }
2550
2550
  function Rt(P, T, H = 0) {
2551
2551
  return new Promise((function(d, e) {
2552
- let t, u, a, m, A, r, i, n, s, h, E, x, b, D, L, M, B, g, C, c;
2552
+ let t, u, a, m, A, r, i, n, s, h, E, x, b, D, O, M, B, g, C, c;
2553
2553
  function f(y = 5) {
2554
2554
  if (T.signal && T.signal.aborted) throw T.signal.reason;
2555
2555
  t += y, T.onProgress(Math.min(t, 100));
@@ -2581,11 +2581,11 @@ __useblocks__.define("static/core/db330968.js", [
2581
2581
  try {
2582
2582
  {
2583
2583
  let l = function() {
2584
- if (u-- && (L > a || L > b)) {
2585
- let O, F;
2586
- return O = c ? .95 * C.width : C.width, F = c ? .95 * C.height : C.height, [B, g] = He(O, F), g.drawImage(C, 0, 0, O, F), n *= s === "image/png" ? .85 : .95, at(B, s, P.name, P.lastModified, n).then((function(k) {
2584
+ if (u-- && (O > a || O > b)) {
2585
+ let L, F;
2586
+ return L = c ? .95 * C.width : C.width, F = c ? .95 * C.height : C.height, [B, g] = He(L, F), g.drawImage(C, 0, 0, L, F), n *= s === "image/png" ? .85 : .95, at(B, s, P.name, P.lastModified, n).then((function(k) {
2587
2587
  try {
2588
- return M = k, Ie(C), C = B, L = M.size, v(Math.min(99, Math.floor((D - L) / (D - a) * 100))), l;
2588
+ return M = k, Ie(C), C = B, O = M.size, v(Math.min(99, Math.floor((D - O) / (D - a) * 100))), l;
2589
2589
  } catch (X) {
2590
2590
  return e(X);
2591
2591
  }
@@ -2597,14 +2597,14 @@ __useblocks__.define("static/core/db330968.js", [
2597
2597
  };
2598
2598
  if (h = p, f(), E = h.size > a, x = h.size > P.size, !E && !x) return v(100), d(h);
2599
2599
  var I;
2600
- return b = P.size, D = h.size, L = D, C = i, c = !T.alwaysKeepResolution && E, (I = function(O) {
2601
- for (; O;) {
2602
- if (O.then) return void O.then(I, e);
2600
+ return b = P.size, D = h.size, O = D, C = i, c = !T.alwaysKeepResolution && E, (I = function(L) {
2601
+ for (; L;) {
2602
+ if (L.then) return void L.then(I, e);
2603
2603
  try {
2604
- if (O.pop) {
2605
- if (O.length) return O.pop() ? o.call(this) : O;
2606
- O = l;
2607
- } else O = O.call(this);
2604
+ if (L.pop) {
2605
+ if (L.length) return L.pop() ? o.call(this) : L;
2606
+ L = l;
2607
+ } else L = L.call(this);
2608
2608
  } catch (F) {
2609
2609
  return e(F);
2610
2610
  }
@@ -2925,7 +2925,7 @@ self.addEventListener('message', async (e) => {
2925
2925
  }
2926
2926
  var ln = "js/browser-image-compression.js";
2927
2927
  function Mt() {
2928
- return Lt.getBundledHostAssetUrl(ln);
2928
+ return Ot.getBundledHostAssetUrl(ln);
2929
2929
  }
2930
2930
  async function un(_, R, N = Mt()) {
2931
2931
  if (!Ut(_)) return _;
@@ -2980,7 +2980,7 @@ self.addEventListener('message', async (e) => {
2980
2980
  }
2981
2981
  function pn() {
2982
2982
  const _ = Ee.useAppConfig(), R = Ee.useIsStandalone(), N = Ee.useSelector(Ee.selectProject), { projectId: G } = (0, kt.useParams)(), K = N?.id !== void 0 ? String(N.id) : G || "", $ = Ee.useEventEmitter(Ee.events.FILE_PROXY_EVENT_ID), V = Ee.useEventEmitter(Ee.events.PROXY_URL_EVENT_ID);
2983
- return (0, Ot.useCallback)(async (Z, Y) => mn(Z, {
2983
+ return (0, Lt.useCallback)(async (Z, Y) => mn(Z, {
2984
2984
  appConfig: _,
2985
2985
  isStandalone: R,
2986
2986
  fireFileProxy: (W) => $.fire({