vitessce 2.0.3 → 3.0.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.
@@ -4,7 +4,16 @@ function oe(e) {
4
4
  for (; --i >= 0; )
5
5
  e[i] = 0;
6
6
  }
7
- const Ui = 0, ii = 1, Ci = 2, $i = 3, Fi = 258, ht = 29, Se = 256, we = Se + 1 + ht, re = 30, dt = 19, ni = 2 * we + 1, Q = 15, Ye = 16, Mi = 7, ct = 256, ai = 16, li = 17, ri = 18, rt = new Uint8Array([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]), Ue = new Uint8Array([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13]), Hi = new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7]), fi = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Bi = 512, B = new Array((we + 2) * 2);
7
+ const Ui = 0, ii = 1, Ci = 2, $i = 3, Fi = 258, ht = 29, Se = 256, we = Se + 1 + ht, re = 30, dt = 19, ni = 2 * we + 1, Q = 15, Ye = 16, Mi = 7, ct = 256, ai = 16, li = 17, ri = 18, rt = (
8
+ /* extra bits for each length code */
9
+ new Uint8Array([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])
10
+ ), Ue = (
11
+ /* extra bits for each distance code */
12
+ new Uint8Array([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13])
13
+ ), Hi = (
14
+ /* extra bits for each bit length code */
15
+ new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7])
16
+ ), fi = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Bi = 512, B = new Array((we + 2) * 2);
8
17
  oe(B);
9
18
  const se = new Array(re * 2);
10
19
  oe(se);
@@ -28,7 +37,12 @@ const di = (e) => e < 256 ? ge[e] : ge[256 + (e >>> 7)], xe = (e, i) => {
28
37
  }, N = (e, i, t) => {
29
38
  e.bi_valid > Ye - t ? (e.bi_buf |= i << e.bi_valid & 65535, xe(e, e.bi_buf), e.bi_buf = i >> Ye - e.bi_valid, e.bi_valid += t - Ye) : (e.bi_buf |= i << e.bi_valid & 65535, e.bi_valid += t);
30
39
  }, F = (e, i, t) => {
31
- N(e, t[i * 2], t[i * 2 + 1]);
40
+ N(
41
+ e,
42
+ t[i * 2],
43
+ t[i * 2 + 1]
44
+ /*.Len*/
45
+ );
32
46
  }, ci = (e, i) => {
33
47
  let t = 0;
34
48
  do
@@ -128,9 +142,34 @@ const di = (e) => e < 256 ? ge[e] : ge[256 + (e >>> 7)], xe = (e, i) => {
128
142
  We(e, t, o);
129
143
  r = l;
130
144
  do
131
- o = e.heap[1], e.heap[1] = e.heap[e.heap_len--], We(e, t, 1), f = e.heap[1], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = f, t[r * 2] = t[o * 2] + t[f * 2], e.depth[r] = (e.depth[o] >= e.depth[f] ? e.depth[o] : e.depth[f]) + 1, t[o * 2 + 1] = t[f * 2 + 1] = r, e.heap[1] = r++, We(e, t, 1);
145
+ o = e.heap[
146
+ 1
147
+ /*SMALLEST*/
148
+ ], e.heap[
149
+ 1
150
+ /*SMALLEST*/
151
+ ] = e.heap[e.heap_len--], We(
152
+ e,
153
+ t,
154
+ 1
155
+ /*SMALLEST*/
156
+ ), f = e.heap[
157
+ 1
158
+ /*SMALLEST*/
159
+ ], e.heap[--e.heap_max] = o, e.heap[--e.heap_max] = f, t[r * 2] = t[o * 2] + t[f * 2], e.depth[r] = (e.depth[o] >= e.depth[f] ? e.depth[o] : e.depth[f]) + 1, t[o * 2 + 1] = t[f * 2 + 1] = r, e.heap[
160
+ 1
161
+ /*SMALLEST*/
162
+ ] = r++, We(
163
+ e,
164
+ t,
165
+ 1
166
+ /*SMALLEST*/
167
+ );
132
168
  while (e.heap_len >= 2);
133
- e.heap[--e.heap_max] = e.heap[1], Pi(e, i), si(t, s, e.bl_count);
169
+ e.heap[--e.heap_max] = e.heap[
170
+ 1
171
+ /*SMALLEST*/
172
+ ], Pi(e, i), si(t, s, e.bl_count);
134
173
  }, kt = (e, i, t) => {
135
174
  let a, n = -1, l, o = i[0 * 2 + 1], f = 0, s = 7, r = 4;
136
175
  for (o === 0 && (s = 138, r = 3), i[(t + 1) * 2 + 1] = 65535, a = 0; a <= t; a++)
@@ -217,15 +256,25 @@ const on = () => {
217
256
  };
218
257
  var I = hn, fe = {
219
258
  2: "need dictionary",
259
+ /* Z_NEED_DICT 2 */
220
260
  1: "stream end",
261
+ /* Z_STREAM_END 1 */
221
262
  0: "",
263
+ /* Z_OK 0 */
222
264
  "-1": "file error",
265
+ /* Z_ERRNO (-1) */
223
266
  "-2": "stream error",
267
+ /* Z_STREAM_ERROR (-2) */
224
268
  "-3": "data error",
269
+ /* Z_DATA_ERROR (-3) */
225
270
  "-4": "insufficient memory",
271
+ /* Z_MEM_ERROR (-4) */
226
272
  "-5": "buffer error",
273
+ /* Z_BUF_ERROR (-5) */
227
274
  "-6": "incompatible version"
275
+ /* Z_VERSION_ERROR (-6) */
228
276
  }, Ae = {
277
+ /* Allowed flush values; see deflate() and inflate() below for details */
229
278
  Z_NO_FLUSH: 0,
230
279
  Z_PARTIAL_FLUSH: 1,
231
280
  Z_SYNC_FLUSH: 2,
@@ -233,6 +282,9 @@ var I = hn, fe = {
233
282
  Z_FINISH: 4,
234
283
  Z_BLOCK: 5,
235
284
  Z_TREES: 6,
285
+ /* Return codes for the compression/decompression functions. Negative values
286
+ * are errors, positive values are used for special but normal events.
287
+ */
236
288
  Z_OK: 0,
237
289
  Z_STREAM_END: 1,
238
290
  Z_NEED_DICT: 2,
@@ -241,6 +293,8 @@ var I = hn, fe = {
241
293
  Z_DATA_ERROR: -3,
242
294
  Z_MEM_ERROR: -4,
243
295
  Z_BUF_ERROR: -5,
296
+ //Z_VERSION_ERROR: -6,
297
+ /* compression levels */
244
298
  Z_NO_COMPRESSION: 0,
245
299
  Z_BEST_SPEED: 1,
246
300
  Z_BEST_COMPRESSION: 9,
@@ -250,10 +304,14 @@ var I = hn, fe = {
250
304
  Z_RLE: 3,
251
305
  Z_FIXED: 4,
252
306
  Z_DEFAULT_STRATEGY: 0,
307
+ /* Possible values of the data_type field (though see inflate()) */
253
308
  Z_BINARY: 0,
254
309
  Z_TEXT: 1,
310
+ //Z_ASCII: 1, // = Z_TEXT (deprecated)
255
311
  Z_UNKNOWN: 2,
312
+ /* The deflate compression method */
256
313
  Z_DEFLATED: 8
314
+ //Z_NULL: null // Use -1 or null inline, depending on var type
257
315
  };
258
316
  const { _tr_init: dn, _tr_stored_block: cn, _tr_flush_block: sn, _tr_tally: j, _tr_align: un } = rn, {
259
317
  Z_NO_FLUSH: ne,
@@ -433,16 +491,27 @@ function $(e, i, t, a, n) {
433
491
  this.good_length = e, this.max_lazy = i, this.nice_length = t, this.max_chain = a, this.func = n;
434
492
  }
435
493
  const ce = [
494
+ /* good lazy nice chain */
436
495
  new $(0, 0, 0, 0, Cn),
496
+ /* 0 store only */
437
497
  new $(4, 4, 8, 4, Je),
498
+ /* 1 max speed, no lazy matches */
438
499
  new $(4, 5, 16, 8, Je),
500
+ /* 2 */
439
501
  new $(4, 6, 32, 32, Je),
502
+ /* 3 */
440
503
  new $(4, 4, 16, 16, ae),
504
+ /* 4 lazy matches */
441
505
  new $(8, 16, 32, 32, ae),
506
+ /* 5 */
442
507
  new $(8, 16, 128, 128, ae),
508
+ /* 6 */
443
509
  new $(8, 32, 128, 256, ae),
510
+ /* 7 */
444
511
  new $(32, 128, 258, 1024, ae),
512
+ /* 8 */
445
513
  new $(32, 258, 258, 4096, ae)
514
+ /* 9 max compression */
446
515
  ], Mn = (e) => {
447
516
  e.window_size = 2 * e.w_size, X(e.head), e.max_lazy_match = ce[e.level].max_lazy, e.good_match = ce[e.level].good_length, e.nice_match = ce[e.level].nice_length, e.max_chain_length = ce[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = k - 1, e.match_available = 0, e.ins_h = 0;
448
517
  };
@@ -577,7 +646,7 @@ var na = function(e) {
577
646
  const i = Array.prototype.slice.call(arguments, 1);
578
647
  for (; i.length; ) {
579
648
  const t = i.shift();
580
- if (!!t) {
649
+ if (t) {
581
650
  if (typeof t != "object")
582
651
  throw new TypeError(t + "must be non-object");
583
652
  for (const a in t)
@@ -803,24 +872,26 @@ var xa = function(i, t) {
803
872
  while (S > 2);
804
873
  S && (g[l++] = g[b++], S > 1 && (g[l++] = g[b++]));
805
874
  }
806
- } else if ((d & 64) === 0) {
807
- x = v[(x & 65535) + (h & (1 << d) - 1)];
808
- continue i;
809
- } else {
875
+ } else if (d & 64) {
810
876
  i.msg = "invalid distance code", p.mode = Ie;
811
877
  break e;
878
+ } else {
879
+ x = v[(x & 65535) + (h & (1 << d) - 1)];
880
+ continue i;
812
881
  }
813
882
  break;
814
883
  }
815
- } else if ((d & 64) === 0) {
884
+ } else if (d & 64)
885
+ if (d & 32) {
886
+ p.mode = pa;
887
+ break e;
888
+ } else {
889
+ i.msg = "invalid literal/length code", p.mode = Ie;
890
+ break e;
891
+ }
892
+ else {
816
893
  x = m[(x & 65535) + (h & (1 << d) - 1)];
817
894
  continue t;
818
- } else if (d & 32) {
819
- p.mode = pa;
820
- break e;
821
- } else {
822
- i.msg = "invalid literal/length code", p.mode = Ie;
823
- break e;
824
895
  }
825
896
  break;
826
897
  }
@@ -828,6 +899,7 @@ var xa = function(i, t) {
828
899
  S = u >> 3, a -= S, u -= S << 3, h &= (1 << u) - 1, i.next_in = a, i.next_out = l, i.avail_in = a < n ? 5 + (n - a) : 5 - (a - n), i.avail_out = l < f ? 257 + (f - l) : 257 - (l - f), p.hold = h, p.bits = u;
829
900
  };
830
901
  const le = 15, Tt = 852, Rt = 592, zt = 0, Qe = 1, mt = 2, ka = new Uint16Array([
902
+ /* Length codes 257..285 base */
831
903
  3,
832
904
  4,
833
905
  5,
@@ -860,6 +932,7 @@ const le = 15, Tt = 852, Rt = 592, zt = 0, Qe = 1, mt = 2, ka = new Uint16Array(
860
932
  0,
861
933
  0
862
934
  ]), va = new Uint8Array([
935
+ /* Length codes 257..285 extra */
863
936
  16,
864
937
  16,
865
938
  16,
@@ -892,6 +965,7 @@ const le = 15, Tt = 852, Rt = 592, zt = 0, Qe = 1, mt = 2, ka = new Uint16Array(
892
965
  72,
893
966
  78
894
967
  ]), Ea = new Uint16Array([
968
+ /* Distance codes 0..29 base */
895
969
  1,
896
970
  2,
897
971
  3,
@@ -925,6 +999,7 @@ const le = 15, Tt = 852, Rt = 592, zt = 0, Qe = 1, mt = 2, ka = new Uint16Array(
925
999
  0,
926
1000
  0
927
1001
  ]), ya = new Uint8Array([
1002
+ /* Distance codes 0..29 extra */
928
1003
  16,
929
1004
  16,
930
1005
  16,
@@ -1072,7 +1147,10 @@ const Ca = (e) => {
1072
1147
  let t, a, n, l, o, f, s, r, _, E, c, h, u, m, v = 0, w, A, x, d, S, Z, b, R;
1073
1148
  const T = new Uint8Array(4);
1074
1149
  let g, p;
1075
- const J = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
1150
+ const J = (
1151
+ /* permutation of code lengths */
1152
+ new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15])
1153
+ );
1076
1154
  if (!e || !e.state || !e.output || !e.input && e.avail_in !== 0)
1077
1155
  return U;
1078
1156
  t = e.state, t.mode === H && (t.mode = qe), o = e.next_out, n = e.output, s = e.avail_out, l = e.next_in, a = e.input, f = e.avail_in, r = t.hold, _ = t.bits, E = f, c = s, R = ie;
@@ -1093,7 +1171,8 @@ const Ca = (e) => {
1093
1171
  t.check = 0, T[0] = r & 255, T[1] = r >>> 8 & 255, t.check = I(t.check, T, 2, 0), r = 0, _ = 0, t.mode = It;
1094
1172
  break;
1095
1173
  }
1096
- if (t.flags = 0, t.head && (t.head.done = !1), !(t.wrap & 1) || (((r & 255) << 8) + (r >> 8)) % 31) {
1174
+ if (t.flags = 0, t.head && (t.head.done = !1), !(t.wrap & 1) || /* check if zlib header allowed */
1175
+ (((r & 255) << 8) + (r >> 8)) % 31) {
1097
1176
  e.msg = "incorrect header check", t.mode = z;
1098
1177
  break;
1099
1178
  }
@@ -1153,8 +1232,11 @@ const Ca = (e) => {
1153
1232
  if (t.flags & 1024 && (h = t.length, h > f && (h = f), h && (t.head && (b = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(
1154
1233
  a.subarray(
1155
1234
  l,
1235
+ // extra field is limited to 65536 bytes
1236
+ // - no need for additional size check
1156
1237
  l + h
1157
1238
  ),
1239
+ /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
1158
1240
  b
1159
1241
  )), t.flags & 512 && (t.check = I(t.check, a, h, l)), f -= h, l += h, t.length -= h), t.length))
1160
1242
  break e;
@@ -1364,7 +1446,7 @@ const Ca = (e) => {
1364
1446
  break e;
1365
1447
  f--, r += a[l++] << _, _ += 8;
1366
1448
  }
1367
- if (A && (A & 240) === 0) {
1449
+ if (A && !(A & 240)) {
1368
1450
  for (d = w, S = A, Z = x; v = t.lencode[Z + ((r & (1 << d + S) - 1) >> d)], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(d + w <= _); ) {
1369
1451
  if (f === 0)
1370
1452
  break e;
@@ -1401,7 +1483,7 @@ const Ca = (e) => {
1401
1483
  break e;
1402
1484
  f--, r += a[l++] << _, _ += 8;
1403
1485
  }
1404
- if ((A & 240) === 0) {
1486
+ if (!(A & 240)) {
1405
1487
  for (d = w, S = A, Z = x; v = t.distcode[Z + ((r & (1 << d + S) - 1) >> d)], w = v >>> 24, A = v >>> 16 & 255, x = v & 65535, !(d + w <= _); ) {
1406
1488
  if (f === 0)
1407
1489
  break e;
@@ -1457,7 +1539,8 @@ const Ca = (e) => {
1457
1539
  break e;
1458
1540
  f--, r |= a[l++] << _, _ += 8;
1459
1541
  }
1460
- if (c -= s, e.total_out += c, t.total += c, c && (e.adler = t.check = t.flags ? I(t.check, n, c, o - c) : ke(t.check, n, c, o - c)), c = s, (t.flags ? r : qt(r)) !== t.check) {
1542
+ if (c -= s, e.total_out += c, t.total += c, c && (e.adler = t.check = /*UPDATE(state.check, put - _out, _out);*/
1543
+ t.flags ? I(t.check, n, c, o - c) : ke(t.check, n, c, o - c)), c = s, (t.flags ? r : qt(r)) !== t.check) {
1461
1544
  e.msg = "incorrect data check", t.mode = z;
1462
1545
  break;
1463
1546
  }
@@ -1490,7 +1573,8 @@ const Ca = (e) => {
1490
1573
  default:
1491
1574
  return U;
1492
1575
  }
1493
- return e.next_out = o, e.avail_out = s, e.next_in = l, e.avail_in = f, t.hold = r, t.bits = _, (t.wsize || c !== e.avail_out && t.mode < z && (t.mode < tt || i !== Dt)) && Ni(e, e.output, e.next_out, c - e.avail_out), E -= e.avail_in, c -= e.avail_out, e.total_in += E, e.total_out += c, t.total += c, t.wrap && c && (e.adler = t.check = t.flags ? I(t.check, n, c, e.next_out - c) : ke(t.check, n, c, e.next_out - c)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === H ? 128 : 0) + (t.mode === Ne || t.mode === et ? 256 : 0), (E === 0 && c === 0 || i === Dt) && R === ie && (R = ma), R;
1576
+ return e.next_out = o, e.avail_out = s, e.next_in = l, e.avail_in = f, t.hold = r, t.bits = _, (t.wsize || c !== e.avail_out && t.mode < z && (t.mode < tt || i !== Dt)) && Ni(e, e.output, e.next_out, c - e.avail_out), E -= e.avail_in, c -= e.avail_out, e.total_in += E, e.total_out += c, t.total += c, t.wrap && c && (e.adler = t.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
1577
+ t.flags ? I(t.check, n, c, e.next_out - c) : ke(t.check, n, c, e.next_out - c)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === H ? 128 : 0) + (t.mode === Ne || t.mode === et ? 256 : 0), (E === 0 && c === 0 || i === Dt) && R === ie && (R = ma), R;
1494
1578
  }, Fa = (e) => {
1495
1579
  if (!e || !e.state)
1496
1580
  return U;
@@ -1500,7 +1584,7 @@ const Ca = (e) => {
1500
1584
  if (!e || !e.state)
1501
1585
  return U;
1502
1586
  const t = e.state;
1503
- return (t.wrap & 2) === 0 ? U : (t.head = i, i.done = !1, ie);
1587
+ return t.wrap & 2 ? (t.head = i, i.done = !1, ie) : U;
1504
1588
  }, Ha = (e, i) => {
1505
1589
  const t = i.length;
1506
1590
  let a, n, l;
@@ -1539,7 +1623,7 @@ function Re(e) {
1539
1623
  to: ""
1540
1624
  }, e || {});
1541
1625
  const i = this.options;
1542
- i.raw && i.windowBits >= 0 && i.windowBits < 16 && (i.windowBits = -i.windowBits, i.windowBits === 0 && (i.windowBits = -15)), i.windowBits >= 0 && i.windowBits < 16 && !(e && e.windowBits) && (i.windowBits += 32), i.windowBits > 15 && i.windowBits < 48 && (i.windowBits & 15) === 0 && (i.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Ei(), this.strm.avail_out = 0;
1626
+ i.raw && i.windowBits >= 0 && i.windowBits < 16 && (i.windowBits = -i.windowBits, i.windowBits === 0 && (i.windowBits = -15)), i.windowBits >= 0 && i.windowBits < 16 && !(e && e.windowBits) && (i.windowBits += 32), i.windowBits > 15 && i.windowBits < 48 && (i.windowBits & 15 || (i.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Ei(), this.strm.avail_out = 0;
1543
1627
  let t = K.inflateInit2(
1544
1628
  this.strm,
1545
1629
  i.windowBits
@@ -1,4 +1,4 @@
1
- import { B as o } from "./index.a9498574.mjs";
1
+ import { B as o } from "./index-6ca034d3.js";
2
2
  import "react";
3
3
  import "react-dom";
4
4
  class s extends o {
@@ -1,17 +1,17 @@
1
- import { B as r } from "./index.a9498574.mjs";
1
+ import { B as r } from "./index-6ca034d3.js";
2
2
  import "react";
3
3
  import "react-dom";
4
4
  class m extends r {
5
5
  constructor() {
6
- if (super(), typeof createImageBitmap > "u")
6
+ if (super(), typeof createImageBitmap == "undefined")
7
7
  throw new Error("Cannot decode WebImage as `createImageBitmap` is not available");
8
- if (typeof document > "u" && typeof OffscreenCanvas > "u")
8
+ if (typeof document == "undefined" && typeof OffscreenCanvas == "undefined")
9
9
  throw new Error("Cannot decode WebImage as neither `document` nor `OffscreenCanvas` is not available");
10
10
  }
11
11
  async decode(d, n) {
12
12
  const o = new Blob([n]), e = await createImageBitmap(o);
13
13
  let t;
14
- typeof document < "u" ? (t = document.createElement("canvas"), t.width = e.width, t.height = e.height) : t = new OffscreenCanvas(e.width, e.height);
14
+ typeof document != "undefined" ? (t = document.createElement("canvas"), t.width = e.width, t.height = e.height) : t = new OffscreenCanvas(e.width, e.height);
15
15
  const a = t.getContext("2d");
16
16
  return a.drawImage(e, 0, 0), a.getImageData(0, 0, e.width, e.height).data.buffer;
17
17
  }
@@ -0,0 +1,5 @@
1
+ export * from "@vitessce/constants";
2
+ export * from "@vitessce/config";
3
+ export * from "@vitessce/all";
4
+ export { encodeConfInUrl, decodeURLParamsToConf } from "@vitessce/export-utils";
5
+ //# sourceMappingURL=index.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.js"],"names":[],"mappings":""}
@@ -0,0 +1,7 @@
1
+ // eslint-disable-next-line react-refresh/only-export-components
2
+ export * from '@vitessce/constants';
3
+ // eslint-disable-next-line react-refresh/only-export-components
4
+ export * from '@vitessce/config';
5
+ // eslint-disable-next-line react-refresh/only-export-components
6
+ export * from '@vitessce/all';
7
+ export { encodeConfInUrl, decodeURLParamsToConf, } from '@vitessce/export-utils';
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "vitessce",
3
- "version": "2.0.3",
3
+ "version": "3.0.1",
4
4
  "author": "Gehlenborg Lab",
5
5
  "homepage": "http://vitessce.io",
6
6
  "repository": {
@@ -8,23 +8,25 @@
8
8
  "url": "git+https://github.com/vitessce/vitessce.git"
9
9
  },
10
10
  "license": "MIT",
11
- "main": "dist/index.min.mjs",
11
+ "type": "module",
12
+ "main": "dist/index.min.js",
12
13
  "files": [
14
+ "src",
13
15
  "dist",
14
- "src"
16
+ "dist-tsc"
15
17
  ],
16
18
  "dependencies": {
17
- "@vitessce/all": "2.0.3",
18
- "@vitessce/config": "2.0.3",
19
- "@vitessce/constants": "2.0.3",
20
- "@vitessce/export-utils": "2.0.3"
19
+ "@vitessce/all": "3.0.1",
20
+ "@vitessce/config": "3.0.1",
21
+ "@vitessce/constants": "3.0.1",
22
+ "@vitessce/export-utils": "3.0.1"
21
23
  },
22
24
  "devDependencies": {
23
- "@vitejs/plugin-react": "^3.0.0-beta.0",
25
+ "@vitejs/plugin-react": "^4.0.0",
24
26
  "cross-env": "^7.0.0",
25
27
  "rimraf": "^3.0.2",
26
28
  "rollup-plugin-visualizer": "^5.8.3",
27
- "vite": "^3.0.0"
29
+ "vite": "^4.3.0"
28
30
  },
29
31
  "peerDependencies": {
30
32
  "react": "^16.8.0 || ^17.0.0 || ^18.0.0",
@@ -36,5 +38,11 @@
36
38
  "build-lib:prod": "cross-env APP_ENV=production vite build --mode lib",
37
39
  "build-lib:dev": "cross-env APP_ENV=development vite build --mode lib"
38
40
  },
39
- "browser": "dist/index.min.umd.js"
41
+ "module": "dist/index.min.js",
42
+ "exports": {
43
+ ".": {
44
+ "types": "./dist-tsc/index.d.ts",
45
+ "import": "./dist/index.min.js"
46
+ }
47
+ }
40
48
  }
package/src/index.js CHANGED
@@ -1,5 +1,8 @@
1
+ // eslint-disable-next-line react-refresh/only-export-components
1
2
  export * from '@vitessce/constants';
3
+ // eslint-disable-next-line react-refresh/only-export-components
2
4
  export * from '@vitessce/config';
5
+ // eslint-disable-next-line react-refresh/only-export-components
3
6
  export * from '@vitessce/all';
4
7
  export {
5
8
  encodeConfInUrl,