vitessce 3.5.12 → 3.6.1

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.
Files changed (33) hide show
  1. package/README.md +7 -1
  2. package/dist/blosc-DKW2fp0s.js +716 -0
  3. package/dist/browser-D0q2hNGi.js +524 -0
  4. package/dist/deflate-JIgkfrJp.js +10 -0
  5. package/dist/{gzip-61747bf5.js → gzip-Bo8P9Xuy.js} +2 -2
  6. package/dist/{higlass-e9622d39.js → higlass-DtQYm-cf.js} +22717 -22970
  7. package/dist/{index-0d803e7f.js → index-CGb9JHk9.js} +18924 -18896
  8. package/dist/{index-a280757a.js → index-NeyzZ285.js} +172194 -152097
  9. package/dist/{index-cbdc7956.js → index-axVzbAYY.js} +5538 -5935
  10. package/dist/index.min.js +26 -27
  11. package/dist/{jpeg-6c06bcde.js → jpeg-CpdHV9ON.js} +63 -47
  12. package/dist/lerc-CEsOhIb6.js +1032 -0
  13. package/dist/lz4-D5NbssRf.js +640 -0
  14. package/dist/lzw-CTsRA3aT.js +84 -0
  15. package/dist/packbits-BvYiWUAv.js +24 -0
  16. package/dist/pako.esm-D68R8YXe.js +1071 -0
  17. package/dist/raw-dTBk71WO.js +9 -0
  18. package/dist/{troika-three-text.esm-4798f478.js → troika-three-text.esm-C0dD1f80.js} +859 -1038
  19. package/dist/{webimage-5dc5b0d9.js → webimage-Djrqr9Ff.js} +4 -6
  20. package/dist/{zlib-99872a4e.js → zlib-cA2napA9.js} +2 -2
  21. package/dist/zstd-DoGJTjDa.js +603 -0
  22. package/package.json +10 -10
  23. package/dist/blosc-956db408.js +0 -716
  24. package/dist/browser-554eb095.js +0 -524
  25. package/dist/deflate-b472a529.js +0 -12
  26. package/dist/lerc-d288eed3.js +0 -1001
  27. package/dist/lz4-06c5cf38.js +0 -640
  28. package/dist/lzw-e58f776d.js +0 -86
  29. package/dist/packbits-980ba63d.js +0 -26
  30. package/dist/pako.esm-a0be47a3.js +0 -1692
  31. package/dist/raw-9c0043e8.js +0 -11
  32. package/dist/zstd-8d54964e.js +0 -603
  33. /package/dist/{chunk-INHXZS53-098e8433.js → chunk-INHXZS53-DiyuLb3Z.js} +0 -0
package/dist/index.min.js CHANGED
@@ -1,39 +1,38 @@
1
- import { bR as n, bM as s, bK as t, bL as c, bV as r, bW as d, bN as p, c2 as b, c0 as l, b_ as C, c1 as u, b$ as T, bJ as g, bZ as y, bO as S, bI as P, bH as I, bT as N, bS as m, bU as _, bY as f, bX as F, bQ as V, c7 as M, ca as O, c4 as x, cb as H, cc as L, c5 as w, c8 as A, c9 as E, c6 as U, bP as Y, c3 as v } from "./index-a280757a.js";
1
+ import { bT as i, bO as n, bM as s, bN as c, bX as t, bY as d, bP as r, c4 as p, c2 as l, c0 as C, c3 as b, c1 as u, bL as T, b$ as g, bQ as y, bK as S, bJ as P, bV as N, bU as I, bW as m, b_ as _, bZ as f, bS as F, c9 as V, cc as M, c6 as O, cd as x, ce as L, c7 as w, ca as A, cb as E, c8 as H, bR as U, c5 as Y } from "./index-NeyzZ285.js";
2
2
  import "react";
3
- import "react-dom";
4
3
  export {
5
- n as CoordinationLevel,
6
- s as CoordinationType,
7
- t as DataType,
4
+ i as CoordinationLevel,
5
+ n as CoordinationType,
6
+ s as DataType,
8
7
  c as FileType,
9
- r as HINTS_CONFIG,
8
+ t as HINTS_CONFIG,
10
9
  d as HINT_TYPE_TO_FILE_TYPE_MAP,
11
- p as OldCoordinationType,
12
- b as PluginAsyncFunction,
10
+ r as OldCoordinationType,
11
+ p as PluginAsyncFunction,
13
12
  l as PluginCoordinationType,
14
13
  C as PluginFileType,
15
- u as PluginJointFileType,
16
- T as PluginViewType,
17
- g as ViewType,
18
- y as Vitessce,
19
- S as VitessceConfig,
20
- P as decodeURLParamsToConf,
21
- I as encodeConfInUrl,
14
+ b as PluginJointFileType,
15
+ u as PluginViewType,
16
+ T as ViewType,
17
+ g as Vitessce,
18
+ y as VitessceConfig,
19
+ S as decodeURLParamsToConf,
20
+ P as encodeConfInUrl,
22
21
  N as generateConfig,
23
- m as getCoordinationSpaceAndScopes,
24
- _ as getHintOptions,
25
- f as getInitialCoordinationScopeName,
26
- F as getInitialCoordinationScopePrefix,
27
- V as hconcat,
28
- M as useComplexCoordination,
29
- O as useComplexCoordinationSecondary,
30
- x as useCoordination,
31
- H as useCoordinationScopes,
22
+ I as getCoordinationSpaceAndScopes,
23
+ m as getHintOptions,
24
+ _ as getInitialCoordinationScopeName,
25
+ f as getInitialCoordinationScopePrefix,
26
+ F as hconcat,
27
+ V as useComplexCoordination,
28
+ M as useComplexCoordinationSecondary,
29
+ O as useCoordination,
30
+ x as useCoordinationScopes,
32
31
  L as useCoordinationScopesBy,
33
32
  w as useGridItemSize,
34
33
  A as useMultiCoordinationScopesNonNull,
35
34
  E as useMultiCoordinationScopesSecondaryNonNull,
36
- U as usePageModeView,
37
- Y as vconcat,
38
- v as z
35
+ H as usePageModeView,
36
+ U as vconcat,
37
+ Y as z
39
38
  };
@@ -1,6 +1,4 @@
1
- import { aQ as re } from "./index-a280757a.js";
2
- import "react";
3
- import "react-dom";
1
+ import { aP as re } from "./index-NeyzZ285.js";
4
2
  const O = new Int32Array([
5
3
  0,
6
4
  1,
@@ -66,7 +64,7 @@ const O = new Int32Array([
66
64
  55,
67
65
  62,
68
66
  63
69
- ]), Q = 4017, Y = 799, Z = 3406, $ = 2276, N = 1567, W = 3784, R = 5793, K = 2896;
67
+ ]), Y = 4017, Z = 799, $ = 3406, N = 2276, Q = 1567, W = 3784, R = 5793, K = 2896;
70
68
  function ne(q, l) {
71
69
  let o = 0;
72
70
  const u = [];
@@ -127,21 +125,21 @@ function ce(q, l, o, u, T, w, C, t, h) {
127
125
  function A(a, f) {
128
126
  const p = x(a.huffmanTableDC), L = p === 0 ? 0 : k(p);
129
127
  a.pred += L, f[0] = a.pred;
130
- let D = 1;
131
- for (; D < 64; ) {
132
- const P = x(a.huffmanTableAC), y = P & 15, S = P >> 4;
128
+ let v = 1;
129
+ for (; v < 64; ) {
130
+ const D = x(a.huffmanTableAC), y = D & 15, S = D >> 4;
133
131
  if (y === 0) {
134
132
  if (S < 15)
135
133
  break;
136
- D += 16;
134
+ v += 16;
137
135
  } else {
138
- D += S;
139
- const I = O[D];
140
- f[I] = k(y), D++;
136
+ v += S;
137
+ const I = O[v];
138
+ f[I] = k(y), v++;
141
139
  }
142
140
  }
143
141
  }
144
- function v(a, f) {
142
+ function P(a, f) {
145
143
  const p = x(a.huffmanTableDC), L = p === 0 ? 0 : k(p) << h;
146
144
  a.pred += L, f[0] = a.pred;
147
145
  }
@@ -157,8 +155,8 @@ function ce(q, l, o, u, T, w, C, t, h) {
157
155
  let p = w;
158
156
  const L = C;
159
157
  for (; p <= L; ) {
160
- const D = x(a.huffmanTableAC), P = D & 15, y = D >> 4;
161
- if (P === 0) {
158
+ const v = x(a.huffmanTableAC), D = v & 15, y = v >> 4;
159
+ if (D === 0) {
162
160
  if (y < 15) {
163
161
  n = E(y) + (1 << y) - 1;
164
162
  break;
@@ -167,7 +165,7 @@ function ce(q, l, o, u, T, w, C, t, h) {
167
165
  } else {
168
166
  p += y;
169
167
  const S = O[p];
170
- f[S] = k(P) * (1 << h), p++;
168
+ f[S] = k(D) * (1 << h), p++;
171
169
  }
172
170
  }
173
171
  }
@@ -175,47 +173,48 @@ function ce(q, l, o, u, T, w, C, t, h) {
175
173
  function te(a, f) {
176
174
  let p = w;
177
175
  const L = C;
178
- let D = 0;
176
+ let v = 0;
179
177
  for (; p <= L; ) {
180
- const P = O[p], y = f[P] < 0 ? -1 : 1;
178
+ const D = O[p], y = f[D] < 0 ? -1 : 1;
181
179
  switch (e) {
182
180
  case 0: {
183
181
  const S = x(a.huffmanTableAC), I = S & 15;
184
- if (D = S >> 4, I === 0)
185
- D < 15 ? (n = E(D) + (1 << D), e = 4) : (D = 16, e = 1);
182
+ if (v = S >> 4, I === 0)
183
+ v < 15 ? (n = E(v) + (1 << v), e = 4) : (v = 16, e = 1);
186
184
  else {
187
185
  if (I !== 1)
188
186
  throw new Error("invalid ACn encoding");
189
- _ = k(I), e = D ? 2 : 3;
187
+ _ = k(I), e = v ? 2 : 3;
190
188
  }
191
189
  continue;
192
190
  }
193
191
  case 1:
192
+ // skipping r zero items
194
193
  case 2:
195
- f[P] ? f[P] += (m() << h) * y : (D--, D === 0 && (e = e === 2 ? 3 : 0));
194
+ f[D] ? f[D] += (m() << h) * y : (v--, v === 0 && (e = e === 2 ? 3 : 0));
196
195
  break;
197
196
  case 3:
198
- f[P] ? f[P] += (m() << h) * y : (f[P] = _ << h, e = 0);
197
+ f[D] ? f[D] += (m() << h) * y : (f[D] = _ << h, e = 0);
199
198
  break;
200
199
  case 4:
201
- f[P] && (f[P] += (m() << h) * y);
200
+ f[D] && (f[D] += (m() << h) * y);
202
201
  break;
203
202
  }
204
203
  p++;
205
204
  }
206
205
  e === 4 && (n--, n === 0 && (e = 0));
207
206
  }
208
- function se(a, f, p, L, D) {
209
- const P = p / F | 0, y = p % F, S = P * a.v + L, I = y * a.h + D;
207
+ function se(a, f, p, L, v) {
208
+ const D = p / F | 0, y = p % F, S = D * a.v + L, I = y * a.h + v;
210
209
  f(a, a.blocks[S][I]);
211
210
  }
212
211
  function oe(a, f, p) {
213
- const L = p / a.blocksPerLine | 0, D = p % a.blocksPerLine;
214
- f(a, a.blocks[L][D]);
212
+ const L = p / a.blocksPerLine | 0, v = p % a.blocksPerLine;
213
+ f(a, a.blocks[L][v]);
215
214
  }
216
215
  const V = u.length;
217
216
  let U, j, G, X, M, H;
218
- c ? w === 0 ? H = t === 0 ? v : s : H = t === 0 ? g : te : H = A;
217
+ c ? w === 0 ? H = t === 0 ? P : s : H = t === 0 ? g : te : H = A;
219
218
  let B = 0, z, J;
220
219
  V === 1 ? J = u[0].blocksPerLine * u[0].blocksPerColumn : J = F * o.mcusPerColumn;
221
220
  const ee = T || J;
@@ -250,7 +249,7 @@ function ie(q, l) {
250
249
  const o = [], { blocksPerLine: u, blocksPerColumn: T } = l, w = u << 3, C = new Int32Array(64), t = new Uint8Array(64);
251
250
  function h(F, c, r) {
252
251
  const b = l.quantizationTable;
253
- let i, d, m, x, E, k, A, v, s;
252
+ let i, d, m, x, E, k, A, P, s;
254
253
  const n = r;
255
254
  let g;
256
255
  for (g = 0; g < 64; g++)
@@ -261,7 +260,7 @@ function ie(q, l) {
261
260
  s = R * n[0 + e] + 512 >> 10, n[0 + e] = s, n[1 + e] = s, n[2 + e] = s, n[3 + e] = s, n[4 + e] = s, n[5 + e] = s, n[6 + e] = s, n[7 + e] = s;
262
261
  continue;
263
262
  }
264
- i = R * n[0 + e] + 128 >> 8, d = R * n[4 + e] + 128 >> 8, m = n[2 + e], x = n[6 + e], E = K * (n[1 + e] - n[7 + e]) + 128 >> 8, v = K * (n[1 + e] + n[7 + e]) + 128 >> 8, k = n[3 + e] << 4, A = n[5 + e] << 4, s = i - d + 1 >> 1, i = i + d + 1 >> 1, d = s, s = m * W + x * N + 128 >> 8, m = m * N - x * W + 128 >> 8, x = s, s = E - A + 1 >> 1, E = E + A + 1 >> 1, A = s, s = v + k + 1 >> 1, k = v - k + 1 >> 1, v = s, s = i - x + 1 >> 1, i = i + x + 1 >> 1, x = s, s = d - m + 1 >> 1, d = d + m + 1 >> 1, m = s, s = E * $ + v * Z + 2048 >> 12, E = E * Z - v * $ + 2048 >> 12, v = s, s = k * Y + A * Q + 2048 >> 12, k = k * Q - A * Y + 2048 >> 12, A = s, n[0 + e] = i + v, n[7 + e] = i - v, n[1 + e] = d + A, n[6 + e] = d - A, n[2 + e] = m + k, n[5 + e] = m - k, n[3 + e] = x + E, n[4 + e] = x - E;
263
+ i = R * n[0 + e] + 128 >> 8, d = R * n[4 + e] + 128 >> 8, m = n[2 + e], x = n[6 + e], E = K * (n[1 + e] - n[7 + e]) + 128 >> 8, P = K * (n[1 + e] + n[7 + e]) + 128 >> 8, k = n[3 + e] << 4, A = n[5 + e] << 4, s = i - d + 1 >> 1, i = i + d + 1 >> 1, d = s, s = m * W + x * Q + 128 >> 8, m = m * Q - x * W + 128 >> 8, x = s, s = E - A + 1 >> 1, E = E + A + 1 >> 1, A = s, s = P + k + 1 >> 1, k = P - k + 1 >> 1, P = s, s = i - x + 1 >> 1, i = i + x + 1 >> 1, x = s, s = d - m + 1 >> 1, d = d + m + 1 >> 1, m = s, s = E * N + P * $ + 2048 >> 12, E = E * $ - P * N + 2048 >> 12, P = s, s = k * Z + A * Y + 2048 >> 12, k = k * Y - A * Z + 2048 >> 12, A = s, n[0 + e] = i + P, n[7 + e] = i - P, n[1 + e] = d + A, n[6 + e] = d - A, n[2 + e] = m + k, n[5 + e] = m - k, n[3 + e] = x + E, n[4 + e] = x - E;
265
264
  }
266
265
  for (g = 0; g < 8; ++g) {
267
266
  const e = g;
@@ -269,7 +268,7 @@ function ie(q, l) {
269
268
  s = R * r[g + 0] + 8192 >> 14, n[0 * 8 + e] = s, n[1 * 8 + e] = s, n[2 * 8 + e] = s, n[3 * 8 + e] = s, n[4 * 8 + e] = s, n[5 * 8 + e] = s, n[6 * 8 + e] = s, n[7 * 8 + e] = s;
270
269
  continue;
271
270
  }
272
- i = R * n[0 * 8 + e] + 2048 >> 12, d = R * n[4 * 8 + e] + 2048 >> 12, m = n[2 * 8 + e], x = n[6 * 8 + e], E = K * (n[1 * 8 + e] - n[7 * 8 + e]) + 2048 >> 12, v = K * (n[1 * 8 + e] + n[7 * 8 + e]) + 2048 >> 12, k = n[3 * 8 + e], A = n[5 * 8 + e], s = i - d + 1 >> 1, i = i + d + 1 >> 1, d = s, s = m * W + x * N + 2048 >> 12, m = m * N - x * W + 2048 >> 12, x = s, s = E - A + 1 >> 1, E = E + A + 1 >> 1, A = s, s = v + k + 1 >> 1, k = v - k + 1 >> 1, v = s, s = i - x + 1 >> 1, i = i + x + 1 >> 1, x = s, s = d - m + 1 >> 1, d = d + m + 1 >> 1, m = s, s = E * $ + v * Z + 2048 >> 12, E = E * Z - v * $ + 2048 >> 12, v = s, s = k * Y + A * Q + 2048 >> 12, k = k * Q - A * Y + 2048 >> 12, A = s, n[0 * 8 + e] = i + v, n[7 * 8 + e] = i - v, n[1 * 8 + e] = d + A, n[6 * 8 + e] = d - A, n[2 * 8 + e] = m + k, n[5 * 8 + e] = m - k, n[3 * 8 + e] = x + E, n[4 * 8 + e] = x - E;
271
+ i = R * n[0 * 8 + e] + 2048 >> 12, d = R * n[4 * 8 + e] + 2048 >> 12, m = n[2 * 8 + e], x = n[6 * 8 + e], E = K * (n[1 * 8 + e] - n[7 * 8 + e]) + 2048 >> 12, P = K * (n[1 * 8 + e] + n[7 * 8 + e]) + 2048 >> 12, k = n[3 * 8 + e], A = n[5 * 8 + e], s = i - d + 1 >> 1, i = i + d + 1 >> 1, d = s, s = m * W + x * Q + 2048 >> 12, m = m * Q - x * W + 2048 >> 12, x = s, s = E - A + 1 >> 1, E = E + A + 1 >> 1, A = s, s = P + k + 1 >> 1, k = P - k + 1 >> 1, P = s, s = i - x + 1 >> 1, i = i + x + 1 >> 1, x = s, s = d - m + 1 >> 1, d = d + m + 1 >> 1, m = s, s = E * N + P * $ + 2048 >> 12, E = E * $ - P * N + 2048 >> 12, P = s, s = k * Z + A * Y + 2048 >> 12, k = k * Y - A * Z + 2048 >> 12, A = s, n[0 * 8 + e] = i + P, n[7 * 8 + e] = i - P, n[1 * 8 + e] = d + A, n[6 * 8 + e] = d - A, n[2 * 8 + e] = m + k, n[5 * 8 + e] = m - k, n[3 * 8 + e] = x + E, n[4 * 8 + e] = x - E;
273
272
  }
274
273
  for (g = 0; g < 64; ++g) {
275
274
  const e = 128 + (n[g] + 8 >> 4);
@@ -320,10 +319,10 @@ class le {
320
319
  c = t.components[r];
321
320
  const d = Math.ceil(Math.ceil(t.samplesPerLine / 8) * c.h / h), m = Math.ceil(Math.ceil(t.scanLines / 8) * c.v / F), x = b * c.h, E = i * c.v, k = [];
322
321
  for (let A = 0; A < E; A++) {
323
- const v = [];
322
+ const P = [];
324
323
  for (let s = 0; s < x; s++)
325
- v.push(new Int32Array(64));
326
- k.push(v);
324
+ P.push(new Int32Array(64));
325
+ k.push(P);
327
326
  }
328
327
  c.blocksPerLine = d, c.blocksPerColumn = m, c.blocks = k;
329
328
  }
@@ -337,21 +336,37 @@ class le {
337
336
  case 65280:
338
337
  break;
339
338
  case 65504:
339
+ // APP0 (Application Specific)
340
340
  case 65505:
341
+ // APP1
341
342
  case 65506:
343
+ // APP2
342
344
  case 65507:
345
+ // APP3
343
346
  case 65508:
347
+ // APP4
344
348
  case 65509:
349
+ // APP5
345
350
  case 65510:
351
+ // APP6
346
352
  case 65511:
353
+ // APP7
347
354
  case 65512:
355
+ // APP8
348
356
  case 65513:
357
+ // APP9
349
358
  case 65514:
359
+ // APP10
350
360
  case 65515:
361
+ // APP11
351
362
  case 65516:
363
+ // APP12
352
364
  case 65517:
365
+ // APP13
353
366
  case 65518:
367
+ // APP14
354
368
  case 65519:
369
+ // APP15
355
370
  case 65534: {
356
371
  const t = T();
357
372
  C === 65504 && t[0] === 74 && t[1] === 70 && t[2] === 73 && t[3] === 70 && t[4] === 0 && (this.jfif = {
@@ -374,25 +389,26 @@ class le {
374
389
  const h = u() + o - 2;
375
390
  for (; o < h; ) {
376
391
  const F = l[o++], c = new Int32Array(64);
377
- if (F >> 4)
378
- if (F >> 4 === 1)
379
- for (let r = 0; r < 64; r++) {
380
- const b = O[r];
381
- c[b] = u();
382
- }
383
- else
384
- throw new Error("DQT: invalid table spec");
385
- else
392
+ if (F >> 4 === 0)
386
393
  for (let r = 0; r < 64; r++) {
387
394
  const b = O[r];
388
395
  c[b] = l[o++];
389
396
  }
397
+ else if (F >> 4 === 1)
398
+ for (let r = 0; r < 64; r++) {
399
+ const b = O[r];
400
+ c[b] = u();
401
+ }
402
+ else
403
+ throw new Error("DQT: invalid table spec");
390
404
  this.quantizationTables[F & 15] = c;
391
405
  }
392
406
  break;
393
407
  }
394
408
  case 65472:
409
+ // SOF0 (Start of Frame, Baseline DCT)
395
410
  case 65473:
411
+ // SOF1 (Start of Frame, Extended DCT)
396
412
  case 65474: {
397
413
  u();
398
414
  const t = {
@@ -427,10 +443,10 @@ class le {
427
443
  const b = new Uint8Array(r);
428
444
  for (let i = 0; i < r; i++, o++)
429
445
  b[i] = l[o];
430
- h += 17 + r, F >> 4 ? this.huffmanTablesAC[F & 15] = ne(
446
+ h += 17 + r, F >> 4 === 0 ? this.huffmanTablesDC[F & 15] = ne(
431
447
  c,
432
448
  b
433
- ) : this.huffmanTablesDC[F & 15] = ne(
449
+ ) : this.huffmanTablesAC[F & 15] = ne(
434
450
  c,
435
451
  b
436
452
  );
@@ -504,7 +520,7 @@ class le {
504
520
  return h;
505
521
  }
506
522
  }
507
- class he extends re {
523
+ class fe extends re {
508
524
  constructor(l) {
509
525
  super(), this.reader = new le(), l.JPEGTables && this.reader.parse(l.JPEGTables);
510
526
  }
@@ -513,5 +529,5 @@ class he extends re {
513
529
  }
514
530
  }
515
531
  export {
516
- he as default
532
+ fe as default
517
533
  };