@vitessce/all 3.6.5 → 3.6.7
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/{ReactNeuroglancer-DM-j5wp8.js → ReactNeuroglancer-ByNTvs8S.js} +1 -1
- package/dist/{deflate-DbVS0Rsl.js → deflate-DeB7w2U5.js} +1 -1
- package/dist/{higlass-CKSIGAax.js → higlass-CDi6EYpj.js} +86946 -101122
- package/dist/{index-3bN3qWOg.js → index-CtqCS3uD.js} +2 -2
- package/dist/{index-BdXLWi-Y.js → index-DC7r29QD.js} +815 -2243
- package/dist/index.js +1 -1
- package/dist/{jpeg-Cme28dbT.js → jpeg-DNI-WseC.js} +1 -1
- package/dist/{lerc-h4DF1MKc.js → lerc-DxNR6M7w.js} +1 -1
- package/dist/{lzw-h5wVE82e.js → lzw-KwO5Ne_b.js} +1 -1
- package/dist/{packbits-PnonD8Iv.js → packbits-XVxuFt5L.js} +1 -1
- package/dist/{raw-D2g6FVg4.js → raw-DwJw-iyd.js} +1 -1
- package/dist/{troika-three-text.esm-C3yFpL6B.js → troika-three-text.esm-DEclBFBv.js} +1 -1
- package/dist/{webimage-D3CXqES4.js → webimage-CJom0KqV.js} +1 -1
- package/package.json +31 -31
- package/dist/browser-CwsEWr7C.js +0 -784
- package/dist/gzip-BcpOCWcu.js +0 -27
- package/dist/zlib-ZTk3sZPP.js +0 -27
package/dist/browser-CwsEWr7C.js
DELETED
@@ -1,784 +0,0 @@
|
|
1
|
-
var u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;
|
2
|
-
var fleb = new u8([
|
3
|
-
0,
|
4
|
-
0,
|
5
|
-
0,
|
6
|
-
0,
|
7
|
-
0,
|
8
|
-
0,
|
9
|
-
0,
|
10
|
-
0,
|
11
|
-
1,
|
12
|
-
1,
|
13
|
-
1,
|
14
|
-
1,
|
15
|
-
2,
|
16
|
-
2,
|
17
|
-
2,
|
18
|
-
2,
|
19
|
-
3,
|
20
|
-
3,
|
21
|
-
3,
|
22
|
-
3,
|
23
|
-
4,
|
24
|
-
4,
|
25
|
-
4,
|
26
|
-
4,
|
27
|
-
5,
|
28
|
-
5,
|
29
|
-
5,
|
30
|
-
5,
|
31
|
-
0,
|
32
|
-
/* unused */
|
33
|
-
0,
|
34
|
-
0,
|
35
|
-
/* impossible */
|
36
|
-
0
|
37
|
-
]);
|
38
|
-
var fdeb = new u8([
|
39
|
-
0,
|
40
|
-
0,
|
41
|
-
0,
|
42
|
-
0,
|
43
|
-
1,
|
44
|
-
1,
|
45
|
-
2,
|
46
|
-
2,
|
47
|
-
3,
|
48
|
-
3,
|
49
|
-
4,
|
50
|
-
4,
|
51
|
-
5,
|
52
|
-
5,
|
53
|
-
6,
|
54
|
-
6,
|
55
|
-
7,
|
56
|
-
7,
|
57
|
-
8,
|
58
|
-
8,
|
59
|
-
9,
|
60
|
-
9,
|
61
|
-
10,
|
62
|
-
10,
|
63
|
-
11,
|
64
|
-
11,
|
65
|
-
12,
|
66
|
-
12,
|
67
|
-
13,
|
68
|
-
13,
|
69
|
-
/* unused */
|
70
|
-
0,
|
71
|
-
0
|
72
|
-
]);
|
73
|
-
var clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
|
74
|
-
var freb = function(eb, start) {
|
75
|
-
var b = new u16(31);
|
76
|
-
for (var i = 0; i < 31; ++i) {
|
77
|
-
b[i] = start += 1 << eb[i - 1];
|
78
|
-
}
|
79
|
-
var r = new i32(b[30]);
|
80
|
-
for (var i = 1; i < 30; ++i) {
|
81
|
-
for (var j = b[i]; j < b[i + 1]; ++j) {
|
82
|
-
r[j] = j - b[i] << 5 | i;
|
83
|
-
}
|
84
|
-
}
|
85
|
-
return { b, r };
|
86
|
-
};
|
87
|
-
var _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;
|
88
|
-
fl[28] = 258, revfl[258] = 28;
|
89
|
-
var _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;
|
90
|
-
var rev = new u16(32768);
|
91
|
-
for (var i = 0; i < 32768; ++i) {
|
92
|
-
var x = (i & 43690) >> 1 | (i & 21845) << 1;
|
93
|
-
x = (x & 52428) >> 2 | (x & 13107) << 2;
|
94
|
-
x = (x & 61680) >> 4 | (x & 3855) << 4;
|
95
|
-
rev[i] = ((x & 65280) >> 8 | (x & 255) << 8) >> 1;
|
96
|
-
}
|
97
|
-
var hMap = function(cd, mb, r) {
|
98
|
-
var s = cd.length;
|
99
|
-
var i = 0;
|
100
|
-
var l = new u16(mb);
|
101
|
-
for (; i < s; ++i) {
|
102
|
-
if (cd[i])
|
103
|
-
++l[cd[i] - 1];
|
104
|
-
}
|
105
|
-
var le = new u16(mb);
|
106
|
-
for (i = 1; i < mb; ++i) {
|
107
|
-
le[i] = le[i - 1] + l[i - 1] << 1;
|
108
|
-
}
|
109
|
-
var co;
|
110
|
-
if (r) {
|
111
|
-
co = new u16(1 << mb);
|
112
|
-
var rvb = 15 - mb;
|
113
|
-
for (i = 0; i < s; ++i) {
|
114
|
-
if (cd[i]) {
|
115
|
-
var sv = i << 4 | cd[i];
|
116
|
-
var r_1 = mb - cd[i];
|
117
|
-
var v = le[cd[i] - 1]++ << r_1;
|
118
|
-
for (var m = v | (1 << r_1) - 1; v <= m; ++v) {
|
119
|
-
co[rev[v] >> rvb] = sv;
|
120
|
-
}
|
121
|
-
}
|
122
|
-
}
|
123
|
-
} else {
|
124
|
-
co = new u16(s);
|
125
|
-
for (i = 0; i < s; ++i) {
|
126
|
-
if (cd[i]) {
|
127
|
-
co[i] = rev[le[cd[i] - 1]++] >> 15 - cd[i];
|
128
|
-
}
|
129
|
-
}
|
130
|
-
}
|
131
|
-
return co;
|
132
|
-
};
|
133
|
-
var flt = new u8(288);
|
134
|
-
for (var i = 0; i < 144; ++i)
|
135
|
-
flt[i] = 8;
|
136
|
-
for (var i = 144; i < 256; ++i)
|
137
|
-
flt[i] = 9;
|
138
|
-
for (var i = 256; i < 280; ++i)
|
139
|
-
flt[i] = 7;
|
140
|
-
for (var i = 280; i < 288; ++i)
|
141
|
-
flt[i] = 8;
|
142
|
-
var fdt = new u8(32);
|
143
|
-
for (var i = 0; i < 32; ++i)
|
144
|
-
fdt[i] = 5;
|
145
|
-
var flm = /* @__PURE__ */ hMap(flt, 9, 0), flrm = /* @__PURE__ */ hMap(flt, 9, 1);
|
146
|
-
var fdm = /* @__PURE__ */ hMap(fdt, 5, 0), fdrm = /* @__PURE__ */ hMap(fdt, 5, 1);
|
147
|
-
var max = function(a) {
|
148
|
-
var m = a[0];
|
149
|
-
for (var i = 1; i < a.length; ++i) {
|
150
|
-
if (a[i] > m)
|
151
|
-
m = a[i];
|
152
|
-
}
|
153
|
-
return m;
|
154
|
-
};
|
155
|
-
var bits = function(d, p, m) {
|
156
|
-
var o = p / 8 | 0;
|
157
|
-
return (d[o] | d[o + 1] << 8) >> (p & 7) & m;
|
158
|
-
};
|
159
|
-
var bits16 = function(d, p) {
|
160
|
-
var o = p / 8 | 0;
|
161
|
-
return (d[o] | d[o + 1] << 8 | d[o + 2] << 16) >> (p & 7);
|
162
|
-
};
|
163
|
-
var shft = function(p) {
|
164
|
-
return (p + 7) / 8 | 0;
|
165
|
-
};
|
166
|
-
var slc = function(v, s, e) {
|
167
|
-
if (e == null || e > v.length)
|
168
|
-
e = v.length;
|
169
|
-
return new u8(v.subarray(s, e));
|
170
|
-
};
|
171
|
-
var ec = [
|
172
|
-
"unexpected EOF",
|
173
|
-
"invalid block type",
|
174
|
-
"invalid length/literal",
|
175
|
-
"invalid distance",
|
176
|
-
"stream finished",
|
177
|
-
"no stream handler",
|
178
|
-
,
|
179
|
-
"no callback",
|
180
|
-
"invalid UTF-8 data",
|
181
|
-
"extra field too long",
|
182
|
-
"date not in range 1980-2099",
|
183
|
-
"filename too long",
|
184
|
-
"stream finishing",
|
185
|
-
"invalid zip data"
|
186
|
-
// determined by unknown compression method
|
187
|
-
];
|
188
|
-
var err = function(ind, msg, nt) {
|
189
|
-
var e = new Error(msg || ec[ind]);
|
190
|
-
e.code = ind;
|
191
|
-
if (Error.captureStackTrace)
|
192
|
-
Error.captureStackTrace(e, err);
|
193
|
-
if (!nt)
|
194
|
-
throw e;
|
195
|
-
return e;
|
196
|
-
};
|
197
|
-
var inflt = function(dat, st, buf, dict) {
|
198
|
-
var sl = dat.length, dl = 0;
|
199
|
-
if (!sl || st.f && !st.l)
|
200
|
-
return buf || new u8(0);
|
201
|
-
var noBuf = !buf;
|
202
|
-
var resize = noBuf || st.i != 2;
|
203
|
-
var noSt = st.i;
|
204
|
-
if (noBuf)
|
205
|
-
buf = new u8(sl * 3);
|
206
|
-
var cbuf = function(l2) {
|
207
|
-
var bl = buf.length;
|
208
|
-
if (l2 > bl) {
|
209
|
-
var nbuf = new u8(Math.max(bl * 2, l2));
|
210
|
-
nbuf.set(buf);
|
211
|
-
buf = nbuf;
|
212
|
-
}
|
213
|
-
};
|
214
|
-
var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;
|
215
|
-
var tbts = sl * 8;
|
216
|
-
do {
|
217
|
-
if (!lm) {
|
218
|
-
final = bits(dat, pos, 1);
|
219
|
-
var type = bits(dat, pos + 1, 3);
|
220
|
-
pos += 3;
|
221
|
-
if (!type) {
|
222
|
-
var s = shft(pos) + 4, l = dat[s - 4] | dat[s - 3] << 8, t = s + l;
|
223
|
-
if (t > sl) {
|
224
|
-
if (noSt)
|
225
|
-
err(0);
|
226
|
-
break;
|
227
|
-
}
|
228
|
-
if (resize)
|
229
|
-
cbuf(bt + l);
|
230
|
-
buf.set(dat.subarray(s, t), bt);
|
231
|
-
st.b = bt += l, st.p = pos = t * 8, st.f = final;
|
232
|
-
continue;
|
233
|
-
} else if (type == 1)
|
234
|
-
lm = flrm, dm = fdrm, lbt = 9, dbt = 5;
|
235
|
-
else if (type == 2) {
|
236
|
-
var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;
|
237
|
-
var tl = hLit + bits(dat, pos + 5, 31) + 1;
|
238
|
-
pos += 14;
|
239
|
-
var ldt = new u8(tl);
|
240
|
-
var clt = new u8(19);
|
241
|
-
for (var i = 0; i < hcLen; ++i) {
|
242
|
-
clt[clim[i]] = bits(dat, pos + i * 3, 7);
|
243
|
-
}
|
244
|
-
pos += hcLen * 3;
|
245
|
-
var clb = max(clt), clbmsk = (1 << clb) - 1;
|
246
|
-
var clm = hMap(clt, clb, 1);
|
247
|
-
for (var i = 0; i < tl; ) {
|
248
|
-
var r = clm[bits(dat, pos, clbmsk)];
|
249
|
-
pos += r & 15;
|
250
|
-
var s = r >> 4;
|
251
|
-
if (s < 16) {
|
252
|
-
ldt[i++] = s;
|
253
|
-
} else {
|
254
|
-
var c = 0, n = 0;
|
255
|
-
if (s == 16)
|
256
|
-
n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];
|
257
|
-
else if (s == 17)
|
258
|
-
n = 3 + bits(dat, pos, 7), pos += 3;
|
259
|
-
else if (s == 18)
|
260
|
-
n = 11 + bits(dat, pos, 127), pos += 7;
|
261
|
-
while (n--)
|
262
|
-
ldt[i++] = c;
|
263
|
-
}
|
264
|
-
}
|
265
|
-
var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);
|
266
|
-
lbt = max(lt);
|
267
|
-
dbt = max(dt);
|
268
|
-
lm = hMap(lt, lbt, 1);
|
269
|
-
dm = hMap(dt, dbt, 1);
|
270
|
-
} else
|
271
|
-
err(1);
|
272
|
-
if (pos > tbts) {
|
273
|
-
if (noSt)
|
274
|
-
err(0);
|
275
|
-
break;
|
276
|
-
}
|
277
|
-
}
|
278
|
-
if (resize)
|
279
|
-
cbuf(bt + 131072);
|
280
|
-
var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;
|
281
|
-
var lpos = pos;
|
282
|
-
for (; ; lpos = pos) {
|
283
|
-
var c = lm[bits16(dat, pos) & lms], sym = c >> 4;
|
284
|
-
pos += c & 15;
|
285
|
-
if (pos > tbts) {
|
286
|
-
if (noSt)
|
287
|
-
err(0);
|
288
|
-
break;
|
289
|
-
}
|
290
|
-
if (!c)
|
291
|
-
err(2);
|
292
|
-
if (sym < 256)
|
293
|
-
buf[bt++] = sym;
|
294
|
-
else if (sym == 256) {
|
295
|
-
lpos = pos, lm = null;
|
296
|
-
break;
|
297
|
-
} else {
|
298
|
-
var add = sym - 254;
|
299
|
-
if (sym > 264) {
|
300
|
-
var i = sym - 257, b = fleb[i];
|
301
|
-
add = bits(dat, pos, (1 << b) - 1) + fl[i];
|
302
|
-
pos += b;
|
303
|
-
}
|
304
|
-
var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;
|
305
|
-
if (!d)
|
306
|
-
err(3);
|
307
|
-
pos += d & 15;
|
308
|
-
var dt = fd[dsym];
|
309
|
-
if (dsym > 3) {
|
310
|
-
var b = fdeb[dsym];
|
311
|
-
dt += bits16(dat, pos) & (1 << b) - 1, pos += b;
|
312
|
-
}
|
313
|
-
if (pos > tbts) {
|
314
|
-
if (noSt)
|
315
|
-
err(0);
|
316
|
-
break;
|
317
|
-
}
|
318
|
-
if (resize)
|
319
|
-
cbuf(bt + 131072);
|
320
|
-
var end = bt + add;
|
321
|
-
if (bt < dt) {
|
322
|
-
var shift = dl - dt, dend = Math.min(dt, end);
|
323
|
-
if (shift + bt < 0)
|
324
|
-
err(3);
|
325
|
-
for (; bt < dend; ++bt)
|
326
|
-
buf[bt] = dict[shift + bt];
|
327
|
-
}
|
328
|
-
for (; bt < end; ++bt)
|
329
|
-
buf[bt] = buf[bt - dt];
|
330
|
-
}
|
331
|
-
}
|
332
|
-
st.l = lm, st.p = lpos, st.b = bt, st.f = final;
|
333
|
-
if (lm)
|
334
|
-
final = 1, st.m = lbt, st.d = dm, st.n = dbt;
|
335
|
-
} while (!final);
|
336
|
-
return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);
|
337
|
-
};
|
338
|
-
var wbits = function(d, p, v) {
|
339
|
-
v <<= p & 7;
|
340
|
-
var o = p / 8 | 0;
|
341
|
-
d[o] |= v;
|
342
|
-
d[o + 1] |= v >> 8;
|
343
|
-
};
|
344
|
-
var wbits16 = function(d, p, v) {
|
345
|
-
v <<= p & 7;
|
346
|
-
var o = p / 8 | 0;
|
347
|
-
d[o] |= v;
|
348
|
-
d[o + 1] |= v >> 8;
|
349
|
-
d[o + 2] |= v >> 16;
|
350
|
-
};
|
351
|
-
var hTree = function(d, mb) {
|
352
|
-
var t = [];
|
353
|
-
for (var i = 0; i < d.length; ++i) {
|
354
|
-
if (d[i])
|
355
|
-
t.push({ s: i, f: d[i] });
|
356
|
-
}
|
357
|
-
var s = t.length;
|
358
|
-
var t2 = t.slice();
|
359
|
-
if (!s)
|
360
|
-
return { t: et, l: 0 };
|
361
|
-
if (s == 1) {
|
362
|
-
var v = new u8(t[0].s + 1);
|
363
|
-
v[t[0].s] = 1;
|
364
|
-
return { t: v, l: 1 };
|
365
|
-
}
|
366
|
-
t.sort(function(a, b) {
|
367
|
-
return a.f - b.f;
|
368
|
-
});
|
369
|
-
t.push({ s: -1, f: 25001 });
|
370
|
-
var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;
|
371
|
-
t[0] = { s: -1, f: l.f + r.f, l, r };
|
372
|
-
while (i1 != s - 1) {
|
373
|
-
l = t[t[i0].f < t[i2].f ? i0++ : i2++];
|
374
|
-
r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];
|
375
|
-
t[i1++] = { s: -1, f: l.f + r.f, l, r };
|
376
|
-
}
|
377
|
-
var maxSym = t2[0].s;
|
378
|
-
for (var i = 1; i < s; ++i) {
|
379
|
-
if (t2[i].s > maxSym)
|
380
|
-
maxSym = t2[i].s;
|
381
|
-
}
|
382
|
-
var tr = new u16(maxSym + 1);
|
383
|
-
var mbt = ln(t[i1 - 1], tr, 0);
|
384
|
-
if (mbt > mb) {
|
385
|
-
var i = 0, dt = 0;
|
386
|
-
var lft = mbt - mb, cst = 1 << lft;
|
387
|
-
t2.sort(function(a, b) {
|
388
|
-
return tr[b.s] - tr[a.s] || a.f - b.f;
|
389
|
-
});
|
390
|
-
for (; i < s; ++i) {
|
391
|
-
var i2_1 = t2[i].s;
|
392
|
-
if (tr[i2_1] > mb) {
|
393
|
-
dt += cst - (1 << mbt - tr[i2_1]);
|
394
|
-
tr[i2_1] = mb;
|
395
|
-
} else
|
396
|
-
break;
|
397
|
-
}
|
398
|
-
dt >>= lft;
|
399
|
-
while (dt > 0) {
|
400
|
-
var i2_2 = t2[i].s;
|
401
|
-
if (tr[i2_2] < mb)
|
402
|
-
dt -= 1 << mb - tr[i2_2]++ - 1;
|
403
|
-
else
|
404
|
-
++i;
|
405
|
-
}
|
406
|
-
for (; i >= 0 && dt; --i) {
|
407
|
-
var i2_3 = t2[i].s;
|
408
|
-
if (tr[i2_3] == mb) {
|
409
|
-
--tr[i2_3];
|
410
|
-
++dt;
|
411
|
-
}
|
412
|
-
}
|
413
|
-
mbt = mb;
|
414
|
-
}
|
415
|
-
return { t: new u8(tr), l: mbt };
|
416
|
-
};
|
417
|
-
var ln = function(n, l, d) {
|
418
|
-
return n.s == -1 ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1)) : l[n.s] = d;
|
419
|
-
};
|
420
|
-
var lc = function(c) {
|
421
|
-
var s = c.length;
|
422
|
-
while (s && !c[--s])
|
423
|
-
;
|
424
|
-
var cl = new u16(++s);
|
425
|
-
var cli = 0, cln = c[0], cls = 1;
|
426
|
-
var w = function(v) {
|
427
|
-
cl[cli++] = v;
|
428
|
-
};
|
429
|
-
for (var i = 1; i <= s; ++i) {
|
430
|
-
if (c[i] == cln && i != s)
|
431
|
-
++cls;
|
432
|
-
else {
|
433
|
-
if (!cln && cls > 2) {
|
434
|
-
for (; cls > 138; cls -= 138)
|
435
|
-
w(32754);
|
436
|
-
if (cls > 2) {
|
437
|
-
w(cls > 10 ? cls - 11 << 5 | 28690 : cls - 3 << 5 | 12305);
|
438
|
-
cls = 0;
|
439
|
-
}
|
440
|
-
} else if (cls > 3) {
|
441
|
-
w(cln), --cls;
|
442
|
-
for (; cls > 6; cls -= 6)
|
443
|
-
w(8304);
|
444
|
-
if (cls > 2)
|
445
|
-
w(cls - 3 << 5 | 8208), cls = 0;
|
446
|
-
}
|
447
|
-
while (cls--)
|
448
|
-
w(cln);
|
449
|
-
cls = 1;
|
450
|
-
cln = c[i];
|
451
|
-
}
|
452
|
-
}
|
453
|
-
return { c: cl.subarray(0, cli), n: s };
|
454
|
-
};
|
455
|
-
var clen = function(cf, cl) {
|
456
|
-
var l = 0;
|
457
|
-
for (var i = 0; i < cl.length; ++i)
|
458
|
-
l += cf[i] * cl[i];
|
459
|
-
return l;
|
460
|
-
};
|
461
|
-
var wfblk = function(out, pos, dat) {
|
462
|
-
var s = dat.length;
|
463
|
-
var o = shft(pos + 2);
|
464
|
-
out[o] = s & 255;
|
465
|
-
out[o + 1] = s >> 8;
|
466
|
-
out[o + 2] = out[o] ^ 255;
|
467
|
-
out[o + 3] = out[o + 1] ^ 255;
|
468
|
-
for (var i = 0; i < s; ++i)
|
469
|
-
out[o + i + 4] = dat[i];
|
470
|
-
return (o + 4 + s) * 8;
|
471
|
-
};
|
472
|
-
var wblk = function(dat, out, final, syms, lf, df, eb, li, bs, bl, p) {
|
473
|
-
wbits(out, p++, final);
|
474
|
-
++lf[256];
|
475
|
-
var _a2 = hTree(lf, 15), dlt = _a2.t, mlb = _a2.l;
|
476
|
-
var _b2 = hTree(df, 15), ddt = _b2.t, mdb = _b2.l;
|
477
|
-
var _c = lc(dlt), lclt = _c.c, nlc = _c.n;
|
478
|
-
var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;
|
479
|
-
var lcfreq = new u16(19);
|
480
|
-
for (var i = 0; i < lclt.length; ++i)
|
481
|
-
++lcfreq[lclt[i] & 31];
|
482
|
-
for (var i = 0; i < lcdt.length; ++i)
|
483
|
-
++lcfreq[lcdt[i] & 31];
|
484
|
-
var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;
|
485
|
-
var nlcc = 19;
|
486
|
-
for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)
|
487
|
-
;
|
488
|
-
var flen = bl + 5 << 3;
|
489
|
-
var ftlen = clen(lf, flt) + clen(df, fdt) + eb;
|
490
|
-
var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];
|
491
|
-
if (bs >= 0 && flen <= ftlen && flen <= dtlen)
|
492
|
-
return wfblk(out, p, dat.subarray(bs, bs + bl));
|
493
|
-
var lm, ll, dm, dl;
|
494
|
-
wbits(out, p, 1 + (dtlen < ftlen)), p += 2;
|
495
|
-
if (dtlen < ftlen) {
|
496
|
-
lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;
|
497
|
-
var llm = hMap(lct, mlcb, 0);
|
498
|
-
wbits(out, p, nlc - 257);
|
499
|
-
wbits(out, p + 5, ndc - 1);
|
500
|
-
wbits(out, p + 10, nlcc - 4);
|
501
|
-
p += 14;
|
502
|
-
for (var i = 0; i < nlcc; ++i)
|
503
|
-
wbits(out, p + 3 * i, lct[clim[i]]);
|
504
|
-
p += 3 * nlcc;
|
505
|
-
var lcts = [lclt, lcdt];
|
506
|
-
for (var it = 0; it < 2; ++it) {
|
507
|
-
var clct = lcts[it];
|
508
|
-
for (var i = 0; i < clct.length; ++i) {
|
509
|
-
var len = clct[i] & 31;
|
510
|
-
wbits(out, p, llm[len]), p += lct[len];
|
511
|
-
if (len > 15)
|
512
|
-
wbits(out, p, clct[i] >> 5 & 127), p += clct[i] >> 12;
|
513
|
-
}
|
514
|
-
}
|
515
|
-
} else {
|
516
|
-
lm = flm, ll = flt, dm = fdm, dl = fdt;
|
517
|
-
}
|
518
|
-
for (var i = 0; i < li; ++i) {
|
519
|
-
var sym = syms[i];
|
520
|
-
if (sym > 255) {
|
521
|
-
var len = sym >> 18 & 31;
|
522
|
-
wbits16(out, p, lm[len + 257]), p += ll[len + 257];
|
523
|
-
if (len > 7)
|
524
|
-
wbits(out, p, sym >> 23 & 31), p += fleb[len];
|
525
|
-
var dst = sym & 31;
|
526
|
-
wbits16(out, p, dm[dst]), p += dl[dst];
|
527
|
-
if (dst > 3)
|
528
|
-
wbits16(out, p, sym >> 5 & 8191), p += fdeb[dst];
|
529
|
-
} else {
|
530
|
-
wbits16(out, p, lm[sym]), p += ll[sym];
|
531
|
-
}
|
532
|
-
}
|
533
|
-
wbits16(out, p, lm[256]);
|
534
|
-
return p + ll[256];
|
535
|
-
};
|
536
|
-
var deo = /* @__PURE__ */ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);
|
537
|
-
var et = /* @__PURE__ */ new u8(0);
|
538
|
-
var dflt = function(dat, lvl, plvl, pre, post, st) {
|
539
|
-
var s = st.z || dat.length;
|
540
|
-
var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7e3)) + post);
|
541
|
-
var w = o.subarray(pre, o.length - post);
|
542
|
-
var lst = st.l;
|
543
|
-
var pos = (st.r || 0) & 7;
|
544
|
-
if (lvl) {
|
545
|
-
if (pos)
|
546
|
-
w[0] = st.r >> 3;
|
547
|
-
var opt = deo[lvl - 1];
|
548
|
-
var n = opt >> 13, c = opt & 8191;
|
549
|
-
var msk_1 = (1 << plvl) - 1;
|
550
|
-
var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);
|
551
|
-
var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;
|
552
|
-
var hsh = function(i2) {
|
553
|
-
return (dat[i2] ^ dat[i2 + 1] << bs1_1 ^ dat[i2 + 2] << bs2_1) & msk_1;
|
554
|
-
};
|
555
|
-
var syms = new i32(25e3);
|
556
|
-
var lf = new u16(288), df = new u16(32);
|
557
|
-
var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;
|
558
|
-
for (; i + 2 < s; ++i) {
|
559
|
-
var hv = hsh(i);
|
560
|
-
var imod = i & 32767, pimod = head[hv];
|
561
|
-
prev[imod] = pimod;
|
562
|
-
head[hv] = imod;
|
563
|
-
if (wi <= i) {
|
564
|
-
var rem = s - i;
|
565
|
-
if ((lc_1 > 7e3 || li > 24576) && (rem > 423 || !lst)) {
|
566
|
-
pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);
|
567
|
-
li = lc_1 = eb = 0, bs = i;
|
568
|
-
for (var j = 0; j < 286; ++j)
|
569
|
-
lf[j] = 0;
|
570
|
-
for (var j = 0; j < 30; ++j)
|
571
|
-
df[j] = 0;
|
572
|
-
}
|
573
|
-
var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;
|
574
|
-
if (rem > 2 && hv == hsh(i - dif)) {
|
575
|
-
var maxn = Math.min(n, rem) - 1;
|
576
|
-
var maxd = Math.min(32767, i);
|
577
|
-
var ml = Math.min(258, rem);
|
578
|
-
while (dif <= maxd && --ch_1 && imod != pimod) {
|
579
|
-
if (dat[i + l] == dat[i + l - dif]) {
|
580
|
-
var nl = 0;
|
581
|
-
for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)
|
582
|
-
;
|
583
|
-
if (nl > l) {
|
584
|
-
l = nl, d = dif;
|
585
|
-
if (nl > maxn)
|
586
|
-
break;
|
587
|
-
var mmd = Math.min(dif, nl - 2);
|
588
|
-
var md = 0;
|
589
|
-
for (var j = 0; j < mmd; ++j) {
|
590
|
-
var ti = i - dif + j & 32767;
|
591
|
-
var pti = prev[ti];
|
592
|
-
var cd = ti - pti & 32767;
|
593
|
-
if (cd > md)
|
594
|
-
md = cd, pimod = ti;
|
595
|
-
}
|
596
|
-
}
|
597
|
-
}
|
598
|
-
imod = pimod, pimod = prev[imod];
|
599
|
-
dif += imod - pimod & 32767;
|
600
|
-
}
|
601
|
-
}
|
602
|
-
if (d) {
|
603
|
-
syms[li++] = 268435456 | revfl[l] << 18 | revfd[d];
|
604
|
-
var lin = revfl[l] & 31, din = revfd[d] & 31;
|
605
|
-
eb += fleb[lin] + fdeb[din];
|
606
|
-
++lf[257 + lin];
|
607
|
-
++df[din];
|
608
|
-
wi = i + l;
|
609
|
-
++lc_1;
|
610
|
-
} else {
|
611
|
-
syms[li++] = dat[i];
|
612
|
-
++lf[dat[i]];
|
613
|
-
}
|
614
|
-
}
|
615
|
-
}
|
616
|
-
for (i = Math.max(i, wi); i < s; ++i) {
|
617
|
-
syms[li++] = dat[i];
|
618
|
-
++lf[dat[i]];
|
619
|
-
}
|
620
|
-
pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);
|
621
|
-
if (!lst) {
|
622
|
-
st.r = pos & 7 | w[pos / 8 | 0] << 3;
|
623
|
-
pos -= 7;
|
624
|
-
st.h = head, st.p = prev, st.i = i, st.w = wi;
|
625
|
-
}
|
626
|
-
} else {
|
627
|
-
for (var i = st.w || 0; i < s + lst; i += 65535) {
|
628
|
-
var e = i + 65535;
|
629
|
-
if (e >= s) {
|
630
|
-
w[pos / 8 | 0] = lst;
|
631
|
-
e = s;
|
632
|
-
}
|
633
|
-
pos = wfblk(w, pos + 1, dat.subarray(i, e));
|
634
|
-
}
|
635
|
-
st.i = s;
|
636
|
-
}
|
637
|
-
return slc(o, 0, pre + shft(pos) + post);
|
638
|
-
};
|
639
|
-
var crct = /* @__PURE__ */ function() {
|
640
|
-
var t = new Int32Array(256);
|
641
|
-
for (var i = 0; i < 256; ++i) {
|
642
|
-
var c = i, k = 9;
|
643
|
-
while (--k)
|
644
|
-
c = (c & 1 && -306674912) ^ c >>> 1;
|
645
|
-
t[i] = c;
|
646
|
-
}
|
647
|
-
return t;
|
648
|
-
}();
|
649
|
-
var crc = function() {
|
650
|
-
var c = -1;
|
651
|
-
return {
|
652
|
-
p: function(d) {
|
653
|
-
var cr = c;
|
654
|
-
for (var i = 0; i < d.length; ++i)
|
655
|
-
cr = crct[cr & 255 ^ d[i]] ^ cr >>> 8;
|
656
|
-
c = cr;
|
657
|
-
},
|
658
|
-
d: function() {
|
659
|
-
return ~c;
|
660
|
-
}
|
661
|
-
};
|
662
|
-
};
|
663
|
-
var adler = function() {
|
664
|
-
var a = 1, b = 0;
|
665
|
-
return {
|
666
|
-
p: function(d) {
|
667
|
-
var n = a, m = b;
|
668
|
-
var l = d.length | 0;
|
669
|
-
for (var i = 0; i != l; ) {
|
670
|
-
var e = Math.min(i + 2655, l);
|
671
|
-
for (; i < e; ++i)
|
672
|
-
m += n += d[i];
|
673
|
-
n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);
|
674
|
-
}
|
675
|
-
a = n, b = m;
|
676
|
-
},
|
677
|
-
d: function() {
|
678
|
-
a %= 65521, b %= 65521;
|
679
|
-
return (a & 255) << 24 | (a & 65280) << 8 | (b & 255) << 8 | b >> 8;
|
680
|
-
}
|
681
|
-
};
|
682
|
-
};
|
683
|
-
var dopt = function(dat, opt, pre, post, st) {
|
684
|
-
if (!st) {
|
685
|
-
st = { l: 1 };
|
686
|
-
if (opt.dictionary) {
|
687
|
-
var dict = opt.dictionary.subarray(-32768);
|
688
|
-
var newDat = new u8(dict.length + dat.length);
|
689
|
-
newDat.set(dict);
|
690
|
-
newDat.set(dat, dict.length);
|
691
|
-
dat = newDat;
|
692
|
-
st.w = dict.length;
|
693
|
-
}
|
694
|
-
}
|
695
|
-
return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20 : 12 + opt.mem, pre, post, st);
|
696
|
-
};
|
697
|
-
var wbytes = function(d, b, v) {
|
698
|
-
for (; v; ++b)
|
699
|
-
d[b] = v, v >>>= 8;
|
700
|
-
};
|
701
|
-
var gzh = function(c, o) {
|
702
|
-
var fn = o.filename;
|
703
|
-
c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3;
|
704
|
-
if (o.mtime != 0)
|
705
|
-
wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1e3));
|
706
|
-
if (fn) {
|
707
|
-
c[3] = 8;
|
708
|
-
for (var i = 0; i <= fn.length; ++i)
|
709
|
-
c[i + 10] = fn.charCodeAt(i);
|
710
|
-
}
|
711
|
-
};
|
712
|
-
var gzs = function(d) {
|
713
|
-
if (d[0] != 31 || d[1] != 139 || d[2] != 8)
|
714
|
-
err(6, "invalid gzip data");
|
715
|
-
var flg = d[3];
|
716
|
-
var st = 10;
|
717
|
-
if (flg & 4)
|
718
|
-
st += (d[10] | d[11] << 8) + 2;
|
719
|
-
for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])
|
720
|
-
;
|
721
|
-
return st + (flg & 2);
|
722
|
-
};
|
723
|
-
var gzl = function(d) {
|
724
|
-
var l = d.length;
|
725
|
-
return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;
|
726
|
-
};
|
727
|
-
var gzhl = function(o) {
|
728
|
-
return 10 + (o.filename ? o.filename.length + 1 : 0);
|
729
|
-
};
|
730
|
-
var zlh = function(c, o) {
|
731
|
-
var lv = o.level, fl2 = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;
|
732
|
-
c[0] = 120, c[1] = fl2 << 6 | (o.dictionary && 32);
|
733
|
-
c[1] |= 31 - (c[0] << 8 | c[1]) % 31;
|
734
|
-
if (o.dictionary) {
|
735
|
-
var h = adler();
|
736
|
-
h.p(o.dictionary);
|
737
|
-
wbytes(c, 2, h.d());
|
738
|
-
}
|
739
|
-
};
|
740
|
-
var zls = function(d, dict) {
|
741
|
-
if ((d[0] & 15) != 8 || d[0] >> 4 > 7 || (d[0] << 8 | d[1]) % 31)
|
742
|
-
err(6, "invalid zlib data");
|
743
|
-
if ((d[1] >> 5 & 1) == 1)
|
744
|
-
err(6, "invalid zlib data: " + (d[1] & 32 ? "need" : "unexpected") + " dictionary");
|
745
|
-
return (d[1] >> 3 & 4) + 2;
|
746
|
-
};
|
747
|
-
function gzipSync(data, opts) {
|
748
|
-
if (!opts)
|
749
|
-
opts = {};
|
750
|
-
var c = crc(), l = data.length;
|
751
|
-
c.p(data);
|
752
|
-
var d = dopt(data, opts, gzhl(opts), 8), s = d.length;
|
753
|
-
return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;
|
754
|
-
}
|
755
|
-
function gunzipSync(data, opts) {
|
756
|
-
var st = gzs(data);
|
757
|
-
if (st + 8 > data.length)
|
758
|
-
err(6, "invalid gzip data");
|
759
|
-
return inflt(data.subarray(st, -8), { i: 2 }, new u8(gzl(data)), opts);
|
760
|
-
}
|
761
|
-
function zlibSync(data, opts) {
|
762
|
-
if (!opts)
|
763
|
-
opts = {};
|
764
|
-
var a = adler();
|
765
|
-
a.p(data);
|
766
|
-
var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);
|
767
|
-
return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;
|
768
|
-
}
|
769
|
-
function unzlibSync(data, opts) {
|
770
|
-
return inflt(data.subarray(zls(data), -4), { i: 2 }, opts, opts);
|
771
|
-
}
|
772
|
-
var td = typeof TextDecoder != "undefined" && /* @__PURE__ */ new TextDecoder();
|
773
|
-
var tds = 0;
|
774
|
-
try {
|
775
|
-
td.decode(et, { stream: true });
|
776
|
-
tds = 1;
|
777
|
-
} catch (e) {
|
778
|
-
}
|
779
|
-
export {
|
780
|
-
gunzipSync as a,
|
781
|
-
gzipSync as g,
|
782
|
-
unzlibSync as u,
|
783
|
-
zlibSync as z
|
784
|
-
};
|