vitessce 3.7.1 → 3.8.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.
package/dist/index.min.js CHANGED
@@ -1,4 +1,4 @@
1
- import { bS as i, bN as n, bL as s, bM as c, bW as t, bX as d, bO as r, c3 as p, c1 as b, b$ as l, c2 as C, c0 as u, bK as T, b_ as g, bP as y, bJ as S, bI as P, bU as I, bT as N, bV as m, bZ as _, bY as f, bR as F, c8 as V, cb as M, c5 as O, cc as x, cd as L, c6 as w, c9 as A, ca as E, c7 as H, bQ as U, c4 as Y } from "./index-9jvLjjzO.js";
1
+ import { b_ as i, bV as n, bT as s, bU as c, c2 as t, c3 as d, bW as r, cb as l, c9 as p, c7 as C, ca as u, c8 as T, bS as g, c6 as b, bX as y, bR as S, bQ as P, c0 as I, b$ as N, c1 as f, c5 as m, c4 as _, bZ as F, cg as V, cj as x, cd as M, ck as O, cl as w, ce as A, ch as E, ci as H, cf as L, bY as U, cc as Y } from "./index-4rGe9cKK.js";
2
2
  import "react";
3
3
  export {
4
4
  i as CoordinationLevel,
@@ -8,31 +8,31 @@ export {
8
8
  t as HINTS_CONFIG,
9
9
  d as HINT_TYPE_TO_FILE_TYPE_MAP,
10
10
  r as OldCoordinationType,
11
- p as PluginAsyncFunction,
12
- b as PluginCoordinationType,
13
- l as PluginFileType,
14
- C as PluginJointFileType,
15
- u as PluginViewType,
16
- T as ViewType,
17
- g as Vitessce,
11
+ l as PluginAsyncFunction,
12
+ p as PluginCoordinationType,
13
+ C as PluginFileType,
14
+ u as PluginJointFileType,
15
+ T as PluginViewType,
16
+ g as ViewType,
17
+ b as Vitessce,
18
18
  y as VitessceConfig,
19
19
  S as decodeURLParamsToConf,
20
20
  P as encodeConfInUrl,
21
21
  I as generateConfig,
22
22
  N as getCoordinationSpaceAndScopes,
23
- m as getHintOptions,
24
- _ as getInitialCoordinationScopeName,
25
- f as getInitialCoordinationScopePrefix,
23
+ f as getHintOptions,
24
+ m as getInitialCoordinationScopeName,
25
+ _ as getInitialCoordinationScopePrefix,
26
26
  F as hconcat,
27
27
  V as useComplexCoordination,
28
- M as useComplexCoordinationSecondary,
29
- O as useCoordination,
30
- x as useCoordinationScopes,
31
- L as useCoordinationScopesBy,
32
- w as useGridItemSize,
33
- A as useMultiCoordinationScopesNonNull,
34
- E as useMultiCoordinationScopesSecondaryNonNull,
35
- H as usePageModeView,
28
+ x as useComplexCoordinationSecondary,
29
+ M as useCoordination,
30
+ O as useCoordinationScopes,
31
+ w as useCoordinationScopesBy,
32
+ A as useGridItemSize,
33
+ E as useMultiCoordinationScopesNonNull,
34
+ H as useMultiCoordinationScopesSecondaryNonNull,
35
+ L as usePageModeView,
36
36
  U as vconcat,
37
37
  Y as z
38
38
  };
@@ -1,4 +1,4 @@
1
- import { aP as re } from "./index-9jvLjjzO.js";
1
+ import { aY as re } from "./index-4rGe9cKK.js";
2
2
  const O = new Int32Array([
3
3
  0,
4
4
  1,
@@ -64,7 +64,7 @@ const O = new Int32Array([
64
64
  55,
65
65
  62,
66
66
  63
67
- ]), Y = 4017, Z = 799, $ = 3406, N = 2276, Q = 1567, W = 3784, R = 5793, K = 2896;
67
+ ]), z = 4017, Z = 799, $ = 3406, N = 2276, Q = 1567, W = 3784, R = 5793, K = 2896;
68
68
  function ne(q, l) {
69
69
  let o = 0;
70
70
  const u = [];
@@ -125,21 +125,21 @@ function ce(q, l, o, u, T, w, C, t, h) {
125
125
  function A(a, f) {
126
126
  const p = x(a.huffmanTableDC), L = p === 0 ? 0 : k(p);
127
127
  a.pred += L, f[0] = a.pred;
128
- let v = 1;
129
- for (; v < 64; ) {
130
- const D = x(a.huffmanTableAC), y = D & 15, S = D >> 4;
128
+ let D = 1;
129
+ for (; D < 64; ) {
130
+ const P = x(a.huffmanTableAC), y = P & 15, S = P >> 4;
131
131
  if (y === 0) {
132
132
  if (S < 15)
133
133
  break;
134
- v += 16;
134
+ D += 16;
135
135
  } else {
136
- v += S;
137
- const I = O[v];
138
- f[I] = k(y), v++;
136
+ D += S;
137
+ const I = O[D];
138
+ f[I] = k(y), D++;
139
139
  }
140
140
  }
141
141
  }
142
- function P(a, f) {
142
+ function v(a, f) {
143
143
  const p = x(a.huffmanTableDC), L = p === 0 ? 0 : k(p) << h;
144
144
  a.pred += L, f[0] = a.pred;
145
145
  }
@@ -155,8 +155,8 @@ function ce(q, l, o, u, T, w, C, t, h) {
155
155
  let p = w;
156
156
  const L = C;
157
157
  for (; p <= L; ) {
158
- const v = x(a.huffmanTableAC), D = v & 15, y = v >> 4;
159
- if (D === 0) {
158
+ const D = x(a.huffmanTableAC), P = D & 15, y = D >> 4;
159
+ if (P === 0) {
160
160
  if (y < 15) {
161
161
  n = E(y) + (1 << y) - 1;
162
162
  break;
@@ -165,7 +165,7 @@ function ce(q, l, o, u, T, w, C, t, h) {
165
165
  } else {
166
166
  p += y;
167
167
  const S = O[p];
168
- f[S] = k(D) * (1 << h), p++;
168
+ f[S] = k(P) * (1 << h), p++;
169
169
  }
170
170
  }
171
171
  }
@@ -173,49 +173,49 @@ function ce(q, l, o, u, T, w, C, t, h) {
173
173
  function te(a, f) {
174
174
  let p = w;
175
175
  const L = C;
176
- let v = 0;
176
+ let D = 0;
177
177
  for (; p <= L; ) {
178
- const D = O[p], y = f[D] < 0 ? -1 : 1;
178
+ const P = O[p], y = f[P] < 0 ? -1 : 1;
179
179
  switch (e) {
180
180
  case 0: {
181
181
  const S = x(a.huffmanTableAC), I = S & 15;
182
- if (v = S >> 4, I === 0)
183
- v < 15 ? (n = E(v) + (1 << v), e = 4) : (v = 16, e = 1);
182
+ if (D = S >> 4, I === 0)
183
+ D < 15 ? (n = E(D) + (1 << D), e = 4) : (D = 16, e = 1);
184
184
  else {
185
185
  if (I !== 1)
186
186
  throw new Error("invalid ACn encoding");
187
- _ = k(I), e = v ? 2 : 3;
187
+ _ = k(I), e = D ? 2 : 3;
188
188
  }
189
189
  continue;
190
190
  }
191
191
  case 1:
192
192
  // skipping r zero items
193
193
  case 2:
194
- f[D] ? f[D] += (m() << h) * y : (v--, v === 0 && (e = e === 2 ? 3 : 0));
194
+ f[P] ? f[P] += (m() << h) * y : (D--, D === 0 && (e = e === 2 ? 3 : 0));
195
195
  break;
196
196
  case 3:
197
- f[D] ? f[D] += (m() << h) * y : (f[D] = _ << h, e = 0);
197
+ f[P] ? f[P] += (m() << h) * y : (f[P] = _ << h, e = 0);
198
198
  break;
199
199
  case 4:
200
- f[D] && (f[D] += (m() << h) * y);
200
+ f[P] && (f[P] += (m() << h) * y);
201
201
  break;
202
202
  }
203
203
  p++;
204
204
  }
205
205
  e === 4 && (n--, n === 0 && (e = 0));
206
206
  }
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;
207
+ function se(a, f, p, L, D) {
208
+ const P = p / F | 0, y = p % F, S = P * a.v + L, I = y * a.h + D;
209
209
  f(a, a.blocks[S][I]);
210
210
  }
211
211
  function oe(a, f, p) {
212
- const L = p / a.blocksPerLine | 0, v = p % a.blocksPerLine;
213
- f(a, a.blocks[L][v]);
212
+ const L = p / a.blocksPerLine | 0, D = p % a.blocksPerLine;
213
+ f(a, a.blocks[L][D]);
214
214
  }
215
215
  const V = u.length;
216
216
  let U, j, G, X, M, H;
217
- c ? w === 0 ? H = t === 0 ? P : s : H = t === 0 ? g : te : H = A;
218
- let B = 0, z, J;
217
+ c ? w === 0 ? H = t === 0 ? v : s : H = t === 0 ? g : te : H = A;
218
+ let B = 0, Y, J;
219
219
  V === 1 ? J = u[0].blocksPerLine * u[0].blocksPerColumn : J = F * o.mcusPerColumn;
220
220
  const ee = T || J;
221
221
  for (; B < J; ) {
@@ -236,9 +236,9 @@ function ce(q, l, o, u, T, w, C, t, h) {
236
236
  if (B++, B === J)
237
237
  break;
238
238
  }
239
- if (d = 0, z = q[b] << 8 | q[b + 1], z < 65280)
239
+ if (d = 0, Y = q[b] << 8 | q[b + 1], Y < 65280)
240
240
  throw new Error("marker was not found");
241
- if (z >= 65488 && z <= 65495)
241
+ if (Y >= 65488 && Y <= 65495)
242
242
  b += 2;
243
243
  else
244
244
  break;
@@ -249,7 +249,7 @@ function ie(q, l) {
249
249
  const o = [], { blocksPerLine: u, blocksPerColumn: T } = l, w = u << 3, C = new Int32Array(64), t = new Uint8Array(64);
250
250
  function h(F, c, r) {
251
251
  const b = l.quantizationTable;
252
- let i, d, m, x, E, k, A, P, s;
252
+ let i, d, m, x, E, k, A, v, s;
253
253
  const n = r;
254
254
  let g;
255
255
  for (g = 0; g < 64; g++)
@@ -260,7 +260,7 @@ function ie(q, l) {
260
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;
261
261
  continue;
262
262
  }
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;
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, 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 * 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 = 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 * N + v * $ + 2048 >> 12, E = E * $ - v * N + 2048 >> 12, v = s, s = k * Z + A * z + 2048 >> 12, k = k * z - A * Z + 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;
264
264
  }
265
265
  for (g = 0; g < 8; ++g) {
266
266
  const e = g;
@@ -268,7 +268,7 @@ function ie(q, l) {
268
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;
269
269
  continue;
270
270
  }
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;
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, 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 * 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 = 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 * N + v * $ + 2048 >> 12, E = E * $ - v * N + 2048 >> 12, v = s, s = k * Z + A * z + 2048 >> 12, k = k * z - A * Z + 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;
272
272
  }
273
273
  for (g = 0; g < 64; ++g) {
274
274
  const e = 128 + (n[g] + 8 >> 4);
@@ -319,10 +319,10 @@ class le {
319
319
  c = t.components[r];
320
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 = [];
321
321
  for (let A = 0; A < E; A++) {
322
- const P = [];
322
+ const v = [];
323
323
  for (let s = 0; s < x; s++)
324
- P.push(new Int32Array(64));
325
- k.push(P);
324
+ v.push(new Int32Array(64));
325
+ k.push(v);
326
326
  }
327
327
  c.blocksPerLine = d, c.blocksPerColumn = m, c.blocks = k;
328
328
  }
@@ -1,5 +1,5 @@
1
1
  import { i as sA } from "./pako.esm-D68R8YXe.js";
2
- import { g as DA, aP as nA, aQ as fA, aR as gA } from "./index-9jvLjjzO.js";
2
+ import { aH as DA, aY as nA, aZ as fA, a_ as gA } from "./index-4rGe9cKK.js";
3
3
  var BA = { exports: {} }, iA;
4
4
  function tA() {
5
5
  return iA || (iA = 1, function(j) {
@@ -1,4 +1,4 @@
1
- import { aP as k } from "./index-9jvLjjzO.js";
1
+ import { aY as k } from "./index-4rGe9cKK.js";
2
2
  const b = 9, E = 256, p = 257, x = 12;
3
3
  function A(c, o, r) {
4
4
  const i = o % 8, n = Math.floor(o / 8), h = 8 - i, g = o + r - (n + 1) * 8;
@@ -1,4 +1,4 @@
1
- import { aP as c } from "./index-9jvLjjzO.js";
1
+ import { aY as c } from "./index-4rGe9cKK.js";
2
2
  class l extends c {
3
3
  decodeBlock(r) {
4
4
  const a = new DataView(r), n = [];
@@ -1,4 +1,4 @@
1
- import { aP as a } from "./index-9jvLjjzO.js";
1
+ import { aY as a } from "./index-4rGe9cKK.js";
2
2
  class d extends a {
3
3
  decodeBlock(e) {
4
4
  return e;