@genome-spy/app 0.58.3 → 0.60.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/{index-DwLfOHEk.js → index-5ajWdKly.js} +1 -1
- package/dist/{index-vgGDWUPz.js → index-B03-Om4z.js} +1 -1
- package/dist/index-Bg7C4Xat.js +2750 -0
- package/dist/{index-CalimFw3.js → index-C3QR8Lv6.js} +79 -79
- package/dist/{index-DKe9Bhvi.js → index-g8iXgW0W.js} +1 -1
- package/dist/index.es.js +9756 -8985
- package/dist/index.js +575 -370
- package/dist/{long-BviWyoZx.js → long-B-FASCSo.js} +45 -45
- package/package.json +3 -3
- package/dist/index-DS2hvLgl.js +0 -3425
@@ -63,7 +63,7 @@ function Dt() {
|
|
63
63
|
for (var b = a.length; --b >= 0; )
|
64
64
|
a[b] = 0;
|
65
65
|
}
|
66
|
-
var c = 0, s = 1, o = 2, D = 3, y = 258, N = 29, m = 256, T = m + 1 + N, C = 30,
|
66
|
+
var c = 0, s = 1, o = 2, D = 3, y = 258, N = 29, m = 256, T = m + 1 + N, C = 30, J = 19, M = 2 * T + 1, A = 15, q = 16, I = 7, Y = 256, X = 16, K = 17, z = 18, H = (
|
67
67
|
/* extra bits for each length code */
|
68
68
|
[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0]
|
69
69
|
), v = (
|
@@ -167,7 +167,7 @@ function Dt() {
|
|
167
167
|
F[a * 2 + 1] = 8, a++, d[8]++;
|
168
168
|
for (me(F, T + 1, d), a = 0; a < C; a++)
|
169
169
|
G[a * 2 + 1] = 5, G[a * 2] = fe(a, 5);
|
170
|
-
re = new V(F, H, m + 1, T, A), oe = new V(G, v, 0, C, A), ee = new V(new Array(0), _, 0,
|
170
|
+
re = new V(F, H, m + 1, T, A), oe = new V(G, v, 0, C, A), ee = new V(new Array(0), _, 0, J, I);
|
171
171
|
}
|
172
172
|
function ke(a) {
|
173
173
|
var b;
|
@@ -175,7 +175,7 @@ function Dt() {
|
|
175
175
|
a.dyn_ltree[b * 2] = 0;
|
176
176
|
for (b = 0; b < C; b++)
|
177
177
|
a.dyn_dtree[b * 2] = 0;
|
178
|
-
for (b = 0; b <
|
178
|
+
for (b = 0; b < J; b++)
|
179
179
|
a.bl_tree[b * 2] = 0;
|
180
180
|
a.dyn_ltree[Y * 2] = 1, a.opt_len = a.static_len = 0, a.last_lit = a.matches = 0;
|
181
181
|
}
|
@@ -194,7 +194,7 @@ function Dt() {
|
|
194
194
|
a.heap[E] = a.heap[f], E = f, f <<= 1;
|
195
195
|
a.heap[E] = Z;
|
196
196
|
}
|
197
|
-
function
|
197
|
+
function $(a, b, E) {
|
198
198
|
var Z, f, d = 0, t, p;
|
199
199
|
if (a.last_lit !== 0)
|
200
200
|
do
|
@@ -260,7 +260,7 @@ function Dt() {
|
|
260
260
|
}
|
261
261
|
function ze(a) {
|
262
262
|
var b;
|
263
|
-
for (Ke(a, a.dyn_ltree, a.l_desc.max_code), Ke(a, a.dyn_dtree, a.d_desc.max_code), Te(a, a.bl_desc), b =
|
263
|
+
for (Ke(a, a.dyn_ltree, a.l_desc.max_code), Ke(a, a.dyn_dtree, a.d_desc.max_code), Te(a, a.bl_desc), b = J - 1; b >= 3 && a.bl_tree[r[b] * 2 + 1] === 0; b--)
|
264
264
|
;
|
265
265
|
return a.opt_len += 3 * (b + 1) + 5 + 5 + 4, b;
|
266
266
|
}
|
@@ -294,7 +294,7 @@ function Dt() {
|
|
294
294
|
}
|
295
295
|
function Ie(a, b, E, Z) {
|
296
296
|
var f, d, t = 0;
|
297
|
-
a.level > 0 ? (a.strm.data_type === P && (a.strm.data_type = Ce(a)), Te(a, a.l_desc), Te(a, a.d_desc), t = ze(a), f = a.opt_len + 3 + 7 >>> 3, d = a.static_len + 3 + 7 >>> 3, d <= f && (f = d)) : f = d = E + 5, E + 4 <= f && b !== -1 ? Ue(a, b, E, Z) : a.strategy === S || d === f ? (he(a, (s << 1) + (Z ? 1 : 0), 3),
|
297
|
+
a.level > 0 ? (a.strm.data_type === P && (a.strm.data_type = Ce(a)), Te(a, a.l_desc), Te(a, a.d_desc), t = ze(a), f = a.opt_len + 3 + 7 >>> 3, d = a.static_len + 3 + 7 >>> 3, d <= f && (f = d)) : f = d = E + 5, E + 4 <= f && b !== -1 ? Ue(a, b, E, Z) : a.strategy === S || d === f ? (he(a, (s << 1) + (Z ? 1 : 0), 3), $(a, F, G)) : (he(a, (o << 1) + (Z ? 1 : 0), 3), Ye(a, a.l_desc.max_code + 1, a.d_desc.max_code + 1, t + 1), $(a, a.dyn_ltree, a.dyn_dtree)), ke(a), Z && He(a);
|
298
298
|
}
|
299
299
|
function Ge(a, b, E) {
|
300
300
|
return a.pending_buf[a.d_buf + a.last_lit * 2] = b >>> 8 & 255, a.pending_buf[a.d_buf + a.last_lit * 2 + 1] = b & 255, a.pending_buf[a.l_buf + a.last_lit] = E & 255, a.last_lit++, b === 0 ? a.dyn_ltree[E * 2]++ : (a.matches++, b--, a.dyn_ltree[(Q[E] + m + 1) * 2]++, a.dyn_dtree[se(b) * 2]++), a.last_lit === a.lit_bufsize - 1;
|
@@ -367,7 +367,7 @@ var wt;
|
|
367
367
|
function Bt() {
|
368
368
|
if (wt) return Oe;
|
369
369
|
wt = 1;
|
370
|
-
var x = Me(), S = Dt(), L = At(), w = Rt(), P = ut(), g = 0, c = 1, s = 3, o = 4, D = 5, y = 0, N = 1, m = -2, T = -3, C = -5,
|
370
|
+
var x = Me(), S = Dt(), L = At(), w = Rt(), P = ut(), g = 0, c = 1, s = 3, o = 4, D = 5, y = 0, N = 1, m = -2, T = -3, C = -5, J = -1, M = 1, A = 2, q = 3, I = 4, Y = 0, X = 2, K = 8, z = 9, H = 15, v = 8, _ = 29, r = 256, k = r + 1 + _, F = 30, G = 19, j = 2 * k + 1, Q = 15, B = 3, ae = 258, V = ae + B + 1, re = 32, oe = 42, ee = 69, te = 73, se = 91, ge = 103, he = 113, _e = 666, fe = 1, be = 2, ye = 3, me = 4, le = 3;
|
371
371
|
function ke(e, l) {
|
372
372
|
return e.msg = P[l], l;
|
373
373
|
}
|
@@ -385,7 +385,7 @@ function Bt() {
|
|
385
385
|
function ue(e, l) {
|
386
386
|
S._tr_flush_block(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, l), e.block_start = e.strstart, Se(e.strm);
|
387
387
|
}
|
388
|
-
function
|
388
|
+
function $(e, l) {
|
389
389
|
e.pending_buf[e.pending++] = l;
|
390
390
|
}
|
391
391
|
function Te(e, l) {
|
@@ -577,7 +577,7 @@ function Bt() {
|
|
577
577
|
if (!e)
|
578
578
|
return m;
|
579
579
|
var U = 1;
|
580
|
-
if (l ===
|
580
|
+
if (l === J && (l = 6), i < 0 ? (U = 0, i = -i) : i > 15 && (U = 2, i -= 16), n < 1 || n > z || u !== K || i < 8 || i > 15 || l < 0 || l > 9 || h < 0 || h > I)
|
581
581
|
return ke(e, m);
|
582
582
|
i === 8 && (i = 9);
|
583
583
|
var R = new a();
|
@@ -594,10 +594,10 @@ function Bt() {
|
|
594
594
|
return ke(e, e.avail_out === 0 ? C : m);
|
595
595
|
if (i.strm = e, u = i.last_flush, i.last_flush = l, i.status === oe)
|
596
596
|
if (i.wrap === 2)
|
597
|
-
e.adler = 0,
|
597
|
+
e.adler = 0, $(i, 31), $(i, 139), $(i, 8), i.gzhead ? ($(
|
598
598
|
i,
|
599
599
|
(i.gzhead.text ? 1 : 0) + (i.gzhead.hcrc ? 2 : 0) + (i.gzhead.extra ? 4 : 0) + (i.gzhead.name ? 8 : 0) + (i.gzhead.comment ? 16 : 0)
|
600
|
-
),
|
600
|
+
), $(i, i.gzhead.time & 255), $(i, i.gzhead.time >> 8 & 255), $(i, i.gzhead.time >> 16 & 255), $(i, i.gzhead.time >> 24 & 255), $(i, i.level === 9 ? 2 : i.strategy >= A || i.level < 2 ? 4 : 0), $(i, i.gzhead.os & 255), i.gzhead.extra && i.gzhead.extra.length && ($(i, i.gzhead.extra.length & 255), $(i, i.gzhead.extra.length >> 8 & 255)), i.gzhead.hcrc && (e.adler = w(e.adler, i.pending_buf, i.pending, 0)), i.gzindex = 0, i.status = ee) : ($(i, 0), $(i, 0), $(i, 0), $(i, 0), $(i, 0), $(i, i.level === 9 ? 2 : i.strategy >= A || i.level < 2 ? 4 : 0), $(i, le), i.status = he);
|
601
601
|
else {
|
602
602
|
var U = K + (i.w_bits - 8 << 4) << 8, R = -1;
|
603
603
|
i.strategy >= A || i.level < 2 ? R = 0 : i.level < 6 ? R = 1 : i.level === 6 ? R = 2 : R = 3, U |= R << 6, i.strstart !== 0 && (U |= re), U += 31 - U % 31, i.status = he, Te(i, U), i.strstart !== 0 && (Te(i, e.adler >>> 16), Te(i, e.adler & 65535)), e.adler = 1;
|
@@ -605,7 +605,7 @@ function Bt() {
|
|
605
605
|
if (i.status === ee)
|
606
606
|
if (i.gzhead.extra) {
|
607
607
|
for (n = i.pending; i.gzindex < (i.gzhead.extra.length & 65535) && !(i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > n && (e.adler = w(e.adler, i.pending_buf, i.pending - n, n)), Se(e), n = i.pending, i.pending === i.pending_buf_size)); )
|
608
|
-
|
608
|
+
$(i, i.gzhead.extra[i.gzindex] & 255), i.gzindex++;
|
609
609
|
i.gzhead.hcrc && i.pending > n && (e.adler = w(e.adler, i.pending_buf, i.pending - n, n)), i.gzindex === i.gzhead.extra.length && (i.gzindex = 0, i.status = te);
|
610
610
|
} else
|
611
611
|
i.status = te;
|
@@ -617,7 +617,7 @@ function Bt() {
|
|
617
617
|
h = 1;
|
618
618
|
break;
|
619
619
|
}
|
620
|
-
i.gzindex < i.gzhead.name.length ? h = i.gzhead.name.charCodeAt(i.gzindex++) & 255 : h = 0,
|
620
|
+
i.gzindex < i.gzhead.name.length ? h = i.gzhead.name.charCodeAt(i.gzindex++) & 255 : h = 0, $(i, h);
|
621
621
|
} while (h !== 0);
|
622
622
|
i.gzhead.hcrc && i.pending > n && (e.adler = w(e.adler, i.pending_buf, i.pending - n, n)), h === 0 && (i.gzindex = 0, i.status = se);
|
623
623
|
} else
|
@@ -630,12 +630,12 @@ function Bt() {
|
|
630
630
|
h = 1;
|
631
631
|
break;
|
632
632
|
}
|
633
|
-
i.gzindex < i.gzhead.comment.length ? h = i.gzhead.comment.charCodeAt(i.gzindex++) & 255 : h = 0,
|
633
|
+
i.gzindex < i.gzhead.comment.length ? h = i.gzhead.comment.charCodeAt(i.gzindex++) & 255 : h = 0, $(i, h);
|
634
634
|
} while (h !== 0);
|
635
635
|
i.gzhead.hcrc && i.pending > n && (e.adler = w(e.adler, i.pending_buf, i.pending - n, n)), h === 0 && (i.status = ge);
|
636
636
|
} else
|
637
637
|
i.status = ge;
|
638
|
-
if (i.status === ge && (i.gzhead.hcrc ? (i.pending + 2 > i.pending_buf_size && Se(e), i.pending + 2 <= i.pending_buf_size && (
|
638
|
+
if (i.status === ge && (i.gzhead.hcrc ? (i.pending + 2 > i.pending_buf_size && Se(e), i.pending + 2 <= i.pending_buf_size && ($(i, e.adler & 255), $(i, e.adler >> 8 & 255), e.adler = 0, i.status = he)) : i.status = he), i.pending !== 0) {
|
639
639
|
if (Se(e), e.avail_out === 0)
|
640
640
|
return i.last_flush = -1, y;
|
641
641
|
} else if (e.avail_in === 0 && He(l) <= He(u) && l !== o)
|
@@ -649,7 +649,7 @@ function Bt() {
|
|
649
649
|
if (O === be && (l === c ? S._tr_align(i) : l !== D && (S._tr_stored_block(i, 0, 0, !1), l === s && (Fe(i.head), i.lookahead === 0 && (i.strstart = 0, i.block_start = 0, i.insert = 0))), Se(e), e.avail_out === 0))
|
650
650
|
return i.last_flush = -1, y;
|
651
651
|
}
|
652
|
-
return l !== o ? y : i.wrap <= 0 ? N : (i.wrap === 2 ? (
|
652
|
+
return l !== o ? y : i.wrap <= 0 ? N : (i.wrap === 2 ? ($(i, e.adler & 255), $(i, e.adler >> 8 & 255), $(i, e.adler >> 16 & 255), $(i, e.adler >> 24 & 255), $(i, e.total_in & 255), $(i, e.total_in >> 8 & 255), $(i, e.total_in >> 16 & 255), $(i, e.total_in >> 24 & 255)) : (Te(i, e.adler >>> 16), Te(i, e.adler & 65535)), Se(e), i.wrap > 0 && (i.wrap = -i.wrap), i.pending !== 0 ? y : N);
|
653
653
|
}
|
654
654
|
function p(e) {
|
655
655
|
var l;
|
@@ -795,19 +795,19 @@ function Ct() {
|
|
795
795
|
}, C.prototype.onEnd = function(q) {
|
796
796
|
q === o && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = S.flattenChunks(this.chunks)), this.chunks = [], this.err = q, this.msg = this.strm.msg;
|
797
797
|
};
|
798
|
-
function
|
798
|
+
function J(q, I) {
|
799
799
|
var Y = new C(I);
|
800
800
|
if (Y.push(q, !0), Y.err)
|
801
801
|
throw Y.msg || w[Y.err];
|
802
802
|
return Y.result;
|
803
803
|
}
|
804
804
|
function M(q, I) {
|
805
|
-
return I = I || {}, I.raw = !0,
|
805
|
+
return I = I || {}, I.raw = !0, J(q, I);
|
806
806
|
}
|
807
807
|
function A(q, I) {
|
808
|
-
return I = I || {}, I.gzip = !0,
|
808
|
+
return I = I || {}, I.gzip = !0, J(q, I);
|
809
809
|
}
|
810
|
-
return We.Deflate = C, We.deflate =
|
810
|
+
return We.Deflate = C, We.deflate = J, We.deflateRaw = M, We.gzip = A, We;
|
811
811
|
}
|
812
812
|
var je = {}, Ae = {}, rt, kt;
|
813
813
|
function Ut() {
|
@@ -815,8 +815,8 @@ function Ut() {
|
|
815
815
|
kt = 1;
|
816
816
|
var x = 30, S = 12;
|
817
817
|
return rt = function(w, P) {
|
818
|
-
var g, c, s, o, D, y, N, m, T, C,
|
819
|
-
g = w.state, c = w.next_in, k = w.input, s = c + (w.avail_in - 5), o = w.next_out, F = w.output, D = o - (P - w.avail_out), y = o + (w.avail_out - 257), N = g.dmax, m = g.wsize, T = g.whave, C = g.wnext,
|
818
|
+
var g, c, s, o, D, y, N, m, T, C, J, M, A, q, I, Y, X, K, z, H, v, _, r, k, F;
|
819
|
+
g = w.state, c = w.next_in, k = w.input, s = c + (w.avail_in - 5), o = w.next_out, F = w.output, D = o - (P - w.avail_out), y = o + (w.avail_out - 257), N = g.dmax, m = g.wsize, T = g.whave, C = g.wnext, J = g.window, M = g.hold, A = g.bits, q = g.lencode, I = g.distcode, Y = (1 << g.lenbits) - 1, X = (1 << g.distbits) - 1;
|
820
820
|
e:
|
821
821
|
do {
|
822
822
|
A < 15 && (M += k[c++] << A, A += 8, M += k[c++] << A, A += 8), K = q[M & Y];
|
@@ -838,11 +838,11 @@ function Ut() {
|
|
838
838
|
w.msg = "invalid distance too far back", g.mode = x;
|
839
839
|
break e;
|
840
840
|
}
|
841
|
-
if (_ = 0, r =
|
841
|
+
if (_ = 0, r = J, C === 0) {
|
842
842
|
if (_ += m - z, z < H) {
|
843
843
|
H -= z;
|
844
844
|
do
|
845
|
-
F[o++] =
|
845
|
+
F[o++] = J[_++];
|
846
846
|
while (--z);
|
847
847
|
_ = o - v, r = F;
|
848
848
|
}
|
@@ -850,12 +850,12 @@ function Ut() {
|
|
850
850
|
if (_ += m + C - z, z -= C, z < H) {
|
851
851
|
H -= z;
|
852
852
|
do
|
853
|
-
F[o++] =
|
853
|
+
F[o++] = J[_++];
|
854
854
|
while (--z);
|
855
855
|
if (_ = 0, C < H) {
|
856
856
|
z = C, H -= z;
|
857
857
|
do
|
858
|
-
F[o++] =
|
858
|
+
F[o++] = J[_++];
|
859
859
|
while (--z);
|
860
860
|
_ = o - v, r = F;
|
861
861
|
}
|
@@ -863,7 +863,7 @@ function Ut() {
|
|
863
863
|
} else if (_ += C - z, z < H) {
|
864
864
|
H -= z;
|
865
865
|
do
|
866
|
-
F[o++] =
|
866
|
+
F[o++] = J[_++];
|
867
867
|
while (--z);
|
868
868
|
_ = o - v, r = F;
|
869
869
|
}
|
@@ -1043,11 +1043,11 @@ function Mt() {
|
|
1043
1043
|
64,
|
1044
1044
|
64
|
1045
1045
|
];
|
1046
|
-
return nt = function(m, T, C,
|
1046
|
+
return nt = function(m, T, C, J, M, A, q, I) {
|
1047
1047
|
var Y = I.bits, X = 0, K = 0, z = 0, H = 0, v = 0, _ = 0, r = 0, k = 0, F = 0, G = 0, j, Q, B, ae, V, re = null, oe = 0, ee, te = new x.Buf16(S + 1), se = new x.Buf16(S + 1), ge = null, he = 0, _e, fe, be;
|
1048
1048
|
for (X = 0; X <= S; X++)
|
1049
1049
|
te[X] = 0;
|
1050
|
-
for (K = 0; K <
|
1050
|
+
for (K = 0; K < J; K++)
|
1051
1051
|
te[T[C + K]]++;
|
1052
1052
|
for (v = Y, H = S; H >= 1 && te[H] === 0; H--)
|
1053
1053
|
;
|
@@ -1062,7 +1062,7 @@ function Mt() {
|
|
1062
1062
|
return -1;
|
1063
1063
|
for (se[1] = 0, X = 1; X < S; X++)
|
1064
1064
|
se[X + 1] = se[X] + te[X];
|
1065
|
-
for (K = 0; K <
|
1065
|
+
for (K = 0; K < J; K++)
|
1066
1066
|
T[C + K] !== 0 && (q[se[T[C + K]]++] = K);
|
1067
1067
|
if (m === P ? (re = ge = q, ee = 19) : m === g ? (re = s, oe -= 257, ge = o, he -= 257, ee = 256) : (re = D, ge = y, ee = -1), G = 0, K = 0, X = z, V = A, _ = v, r = 0, B = -1, F = 1 << v, ae = F - 1, m === g && F > L || m === c && F > w)
|
1068
1068
|
return 1;
|
@@ -1093,7 +1093,7 @@ var St;
|
|
1093
1093
|
function Ht() {
|
1094
1094
|
if (St) return Ae;
|
1095
1095
|
St = 1;
|
1096
|
-
var x = Me(), S = At(), L = Rt(), w = Ut(), P = Mt(), g = 0, c = 1, s = 2, o = 4, D = 5, y = 6, N = 0, m = 1, T = 2, C = -2,
|
1096
|
+
var x = Me(), S = At(), L = Rt(), w = Ut(), P = Mt(), g = 0, c = 1, s = 2, o = 4, D = 5, y = 6, N = 0, m = 1, T = 2, C = -2, J = -3, M = -4, A = -5, q = 8, I = 1, Y = 2, X = 3, K = 4, z = 5, H = 6, v = 7, _ = 8, r = 9, k = 10, F = 11, G = 12, j = 13, Q = 14, B = 15, ae = 16, V = 17, re = 18, oe = 19, ee = 20, te = 21, se = 22, ge = 23, he = 24, _e = 25, fe = 26, be = 27, ye = 28, me = 29, le = 30, ke = 31, He = 32, Fe = 852, Se = 592, ue = 15, $ = ue;
|
1097
1097
|
function Te(f) {
|
1098
1098
|
return (f >>> 24 & 255) + (f >>> 8 & 65280) + ((f & 65280) << 8) + ((f & 255) << 24);
|
1099
1099
|
}
|
@@ -1117,7 +1117,7 @@ function Ht() {
|
|
1117
1117
|
return f ? (p = new Ke(), f.state = p, p.window = null, t = Ye(f, d), t !== N && (f.state = null), t) : C;
|
1118
1118
|
}
|
1119
1119
|
function Re(f) {
|
1120
|
-
return Ce(f,
|
1120
|
+
return Ce(f, $);
|
1121
1121
|
}
|
1122
1122
|
var Xe = !0, Ue, pe;
|
1123
1123
|
function Ie(f) {
|
@@ -1579,7 +1579,7 @@ function Ht() {
|
|
1579
1579
|
Ne = m;
|
1580
1580
|
break e;
|
1581
1581
|
case le:
|
1582
|
-
Ne =
|
1582
|
+
Ne = J;
|
1583
1583
|
break e;
|
1584
1584
|
case ke:
|
1585
1585
|
return M;
|
@@ -1603,7 +1603,7 @@ function Ht() {
|
|
1603
1603
|
}
|
1604
1604
|
function Z(f, d) {
|
1605
1605
|
var t = d.length, p, W, e;
|
1606
|
-
return !f || !f.state || (p = f.state, p.wrap !== 0 && p.mode !== F) ? C : p.mode === F && (W = 1, W = S(W, d, t, 0), W !== p.check) ?
|
1606
|
+
return !f || !f.state || (p = f.state, p.wrap !== 0 && p.mode !== F) ? C : p.mode === F && (W = 1, W = S(W, d, t, 0), W !== p.check) ? J : (e = Ge(f, d, t, t), e ? (p.mode = ke, M) : (p.havedict = 1, N));
|
1607
1607
|
}
|
1608
1608
|
return Ae.inflateReset = ze, Ae.inflateReset2 = Ye, Ae.inflateResetKeep = Be, Ae.inflateInit = Re, Ae.inflateInit2 = Ce, Ae.inflate = a, Ae.inflateEnd = b, Ae.inflateGetHeader = E, Ae.inflateSetDictionary = Z, Ae.inflateInfo = "pako inflate (from Nodeca project)", Ae;
|
1609
1609
|
}
|
@@ -1683,12 +1683,12 @@ function Pt() {
|
|
1683
1683
|
throw new Error(P[T]);
|
1684
1684
|
}
|
1685
1685
|
o.prototype.push = function(N, m) {
|
1686
|
-
var T = this.strm, C = this.options.chunkSize,
|
1686
|
+
var T = this.strm, C = this.options.chunkSize, J = this.options.dictionary, M, A, q, I, Y, X = !1;
|
1687
1687
|
if (this.ended)
|
1688
1688
|
return !1;
|
1689
1689
|
A = m === ~~m ? m : m === !0 ? w.Z_FINISH : w.Z_NO_FLUSH, typeof N == "string" ? T.input = L.binstring2buf(N) : s.call(N) === "[object ArrayBuffer]" ? T.input = new Uint8Array(N) : T.input = N, T.next_in = 0, T.avail_in = T.input.length;
|
1690
1690
|
do {
|
1691
|
-
if (T.avail_out === 0 && (T.output = new S.Buf8(C), T.next_out = 0, T.avail_out = C), M = x.inflate(T, w.Z_NO_FLUSH), M === w.Z_NEED_DICT &&
|
1691
|
+
if (T.avail_out === 0 && (T.output = new S.Buf8(C), T.next_out = 0, T.avail_out = C), M = x.inflate(T, w.Z_NO_FLUSH), M === w.Z_NEED_DICT && J && (M = x.inflateSetDictionary(this.strm, J)), M === w.Z_BUF_ERROR && X === !0 && (M = w.Z_OK, X = !1), M !== w.Z_STREAM_END && M !== w.Z_OK)
|
1692
1692
|
return this.onEnd(M), this.ended = !0, !1;
|
1693
1693
|
T.next_out && (T.avail_out === 0 || M === w.Z_STREAM_END || T.avail_in === 0 && (A === w.Z_FINISH || A === w.Z_SYNC_FLUSH)) && (this.options.to === "string" ? (q = L.utf8border(T.output, T.next_out), I = T.next_out - q, Y = L.buf2string(T.output, q), T.next_out = I, T.avail_out = C - I, I && S.arraySet(T.output, T.output, q, I, 0), this.onData(Y)) : this.onData(S.shrinkBuf(T.output, T.next_out))), T.avail_in === 0 && T.avail_out === 0 && (X = !0);
|
1694
1694
|
} while ((T.avail_in > 0 || T.avail_out === 0) && M !== w.Z_STREAM_END);
|
@@ -1744,10 +1744,10 @@ async function Vt(x, S) {
|
|
1744
1744
|
const s = [], o = [], D = [];
|
1745
1745
|
let y = 0, N = 0;
|
1746
1746
|
do {
|
1747
|
-
const C = x.subarray(g - w.blockPosition),
|
1748
|
-
if ({ strm: L } =
|
1749
|
-
throw new Error(
|
1750
|
-
const M =
|
1747
|
+
const C = x.subarray(g - w.blockPosition), J = new Je.Inflate();
|
1748
|
+
if ({ strm: L } = J, J.push(C, Je.Z_SYNC_FLUSH), J.err)
|
1749
|
+
throw new Error(J.msg);
|
1750
|
+
const M = J.result;
|
1751
1751
|
s.push(M);
|
1752
1752
|
let A = M.length;
|
1753
1753
|
o.push(g), D.push(c), s.length === 1 && w.dataPosition && (s[0] = s[0].subarray(w.dataPosition), A = s[0].length);
|
@@ -1759,8 +1759,8 @@ async function Vt(x, S) {
|
|
1759
1759
|
y += s[N].length, N++;
|
1760
1760
|
} while (L.avail_in);
|
1761
1761
|
const m = new Uint8Array(y);
|
1762
|
-
for (let C = 0,
|
1763
|
-
m.set(s[C],
|
1762
|
+
for (let C = 0, J = 0; C < s.length; C++)
|
1763
|
+
m.set(s[C], J), J += s[C].length;
|
1764
1764
|
return { buffer: Nt.Buffer.from(m), cpositions: o, dpositions: D };
|
1765
1765
|
} catch (L) {
|
1766
1766
|
throw /incorrect header check/.exec(`${L}`) ? new Error("problem decompressing block: incorrect gzip header check") : L;
|
@@ -2085,9 +2085,9 @@ function Yt() {
|
|
2085
2085
|
if (_ >= C)
|
2086
2086
|
return z;
|
2087
2087
|
} else {
|
2088
|
-
if (_ <=
|
2088
|
+
if (_ <= -9223372036854776e3)
|
2089
2089
|
return H;
|
2090
|
-
if (_ + 1 >=
|
2090
|
+
if (_ + 1 >= J)
|
2091
2091
|
return K;
|
2092
2092
|
}
|
2093
2093
|
return _ < 0 ? c(-_, r).neg() : s(_ % T | 0, _ / T | 0, r);
|
@@ -2125,7 +2125,7 @@ function Yt() {
|
|
2125
2125
|
return typeof _ == "number" ? c(_, r) : typeof _ == "string" ? D(_, r) : s(_.low, _.high, typeof r == "boolean" ? r : _.unsigned);
|
2126
2126
|
}
|
2127
2127
|
S.fromValue = y;
|
2128
|
-
var N = 65536, m = 1 << 24, T = N * N, C = T * T,
|
2128
|
+
var N = 65536, m = 1 << 24, T = N * N, C = T * T, J = C / 2, M = g(m), A = g(0);
|
2129
2129
|
S.ZERO = A;
|
2130
2130
|
var q = g(0, !0);
|
2131
2131
|
S.UZERO = q;
|
package/package.json
CHANGED
@@ -7,7 +7,7 @@
|
|
7
7
|
},
|
8
8
|
"contributors": [],
|
9
9
|
"license": "MIT",
|
10
|
-
"version": "0.
|
10
|
+
"version": "0.60.0",
|
11
11
|
"main": "dist/index.js",
|
12
12
|
"type": "module",
|
13
13
|
"files": [
|
@@ -29,7 +29,7 @@
|
|
29
29
|
"@fortawesome/fontawesome-free": "^6.4.2",
|
30
30
|
"@fortawesome/fontawesome-svg-core": "^6.4.2",
|
31
31
|
"@fortawesome/free-solid-svg-icons": "^6.4.2",
|
32
|
-
"@genome-spy/core": "^0.
|
32
|
+
"@genome-spy/core": "^0.60.0",
|
33
33
|
"@reduxjs/toolkit": "^1.8.4",
|
34
34
|
"idb": "^7.1.1",
|
35
35
|
"lit": "^3.1.2",
|
@@ -39,5 +39,5 @@
|
|
39
39
|
"redux-batched-actions": "^0.5.0",
|
40
40
|
"redux-undo": "^1.0.1"
|
41
41
|
},
|
42
|
-
"gitHead": "
|
42
|
+
"gitHead": "82948eadeadfedcb13e669f6664e163dac3a6a92"
|
43
43
|
}
|