@vitessce/vega 3.1.3 → 3.2.0

package/dist/index.js

@@ -1158,10 +1158,10 @@ function compare$9(fields, orders, opt) {
   });
   return get3.length === 0 ? null : accessor(gen(get3, ord), Object.keys(fmap));
 }
-const ascending$3 = (u2, v) => (u2 < v || u2 == null) && v != null ? -1 : (u2 > v || v == null) && u2 != null ? 1 : (v = v instanceof Date ? +v : v, u2 = u2 instanceof Date ? +u2 : u2) !== u2 && v === v ? -1 : v !== v && u2 === u2 ? 1 : 0;
+const ascending$4 = (u2, v) => (u2 < v || u2 == null) && v != null ? -1 : (u2 > v || v == null) && u2 != null ? 1 : (v = v instanceof Date ? +v : v, u2 = u2 instanceof Date ? +u2 : u2) !== u2 && v === v ? -1 : v !== v && u2 === u2 ? 1 : 0;
 const comparator$1 = (fields, orders) => fields.length === 1 ? compare1(fields[0], orders[0]) : compareN(fields, orders, fields.length);
 const compare1 = (field2, order) => function(a2, b2) {
-  return ascending$3(field2(a2), field2(b2)) * order;
+  return ascending$4(field2(a2), field2(b2)) * order;
 };
 const compareN = (fields, orders, n) => {
   orders.push(0);
@@ -1169,7 +1169,7 @@ const compareN = (fields, orders, n) => {
     let f, c2 = 0, i = -1;
     while (c2 === 0 && ++i < n) {
       f = fields[i];
-      c2 = ascending$3(f(a2), f(b2));
+      c2 = ascending$4(f(a2), f(b2));
     }
     return c2 * orders[i];
   };
@@ -7775,20 +7775,20 @@ function extractArcs(topology, object2, filter2) {
   });
   return arcs;
 }
-function ascending$2(a2, b2) {
+function ascending$3(a2, b2) {
   return a2 == null || b2 == null ? NaN : a2 < b2 ? -1 : a2 > b2 ? 1 : a2 >= b2 ? 0 : NaN;
 }
 function descending$1(a2, b2) {
   return a2 == null || b2 == null ? NaN : b2 < a2 ? -1 : b2 > a2 ? 1 : b2 >= a2 ? 0 : NaN;
 }
-function bisector$1(f) {
+function bisector$2(f) {
   let compare12, compare2, delta;
   if (f.length !== 2) {
-    compare12 = ascending$2;
-    compare2 = (d, x2) => ascending$2(f(d), x2);
+    compare12 = ascending$3;
+    compare2 = (d, x2) => ascending$3(f(d), x2);
     delta = (d, x2) => f(d) - x2;
   } else {
-    compare12 = f === ascending$2 || f === descending$1 ? f : zero$3;
+    compare12 = f === ascending$3 || f === descending$1 ? f : zero$3;
     compare2 = f;
     delta = f;
   }
@@ -7829,7 +7829,7 @@ function bisector$1(f) {
 function zero$3() {
   return 0;
 }
-function number$6(x2) {
+function number$7(x2) {
   return x2 === null ? NaN : +x2;
 }
 function* numbers$2(values2, valueof) {
@@ -7848,11 +7848,11 @@ function* numbers$2(values2, valueof) {
     }
   }
 }
-const ascendingBisect = bisector$1(ascending$2);
-const bisectRight$1 = ascendingBisect.right;
-const bisectLeft$1 = ascendingBisect.left;
-bisector$1(number$6).center;
-const bisect$1 = bisectRight$1;
+const ascendingBisect$1 = bisector$2(ascending$3);
+const bisectRight$2 = ascendingBisect$1.right;
+const bisectLeft$1 = ascendingBisect$1.left;
+bisector$2(number$7).center;
+const bisect$2 = bisectRight$2;
 function variance(values2, valueof) {
   let count2 = 0;
   let delta;
@@ -7883,70 +7883,8 @@ function deviation(values2, valueof) {
   const v = variance(values2, valueof);
   return v ? Math.sqrt(v) : v;
 }
-class Adder {
-  constructor() {
-    this._partials = new Float64Array(32);
-    this._n = 0;
-  }
-  add(x2) {
-    const p = this._partials;
-    let i = 0;
-    for (let j = 0; j < this._n && j < 32; j++) {
-      const y2 = p[j], hi = x2 + y2, lo = Math.abs(x2) < Math.abs(y2) ? x2 - (hi - y2) : y2 - (hi - x2);
-      if (lo)
-        p[i++] = lo;
-      x2 = hi;
-    }
-    p[i] = x2;
-    this._n = i + 1;
-    return this;
-  }
-  valueOf() {
-    const p = this._partials;
-    let n = this._n, x2, y2, lo, hi = 0;
-    if (n > 0) {
-      hi = p[--n];
-      while (n > 0) {
-        x2 = hi;
-        y2 = p[--n];
-        hi = x2 + y2;
-        lo = y2 - (hi - x2);
-        if (lo)
-          break;
-      }
-      if (n > 0 && (lo < 0 && p[n - 1] < 0 || lo > 0 && p[n - 1] > 0)) {
-        y2 = lo * 2;
-        x2 = hi + y2;
-        if (y2 == x2 - hi)
-          hi = x2;
-      }
-    }
-    return hi;
-  }
-}
-class InternMap extends Map {
-  constructor(entries2, key = keyof) {
-    super();
-    Object.defineProperties(this, { _intern: { value: /* @__PURE__ */ new Map() }, _key: { value: key } });
-    if (entries2 != null)
-      for (const [key2, value2] of entries2)
-        this.set(key2, value2);
-  }
-  get(key) {
-    return super.get(intern_get(this, key));
-  }
-  has(key) {
-    return super.has(intern_get(this, key));
-  }
-  set(key, value2) {
-    return super.set(intern_set(this, key), value2);
-  }
-  delete(key) {
-    return super.delete(intern_delete(this, key));
-  }
-}
 class InternSet extends Set {
-  constructor(values2, key = keyof) {
+  constructor(values2, key = keyof$1) {
     super();
     Object.defineProperties(this, { _intern: { value: /* @__PURE__ */ new Map() }, _key: { value: key } });
     if (values2 != null)
@@ -7954,27 +7892,27 @@ class InternSet extends Set {
         this.add(value2);
   }
   has(value2) {
-    return super.has(intern_get(this, value2));
+    return super.has(intern_get$1(this, value2));
   }
   add(value2) {
-    return super.add(intern_set(this, value2));
+    return super.add(intern_set$1(this, value2));
   }
   delete(value2) {
-    return super.delete(intern_delete(this, value2));
+    return super.delete(intern_delete$1(this, value2));
   }
 }
-function intern_get({ _intern, _key }, value2) {
+function intern_get$1({ _intern, _key }, value2) {
   const key = _key(value2);
   return _intern.has(key) ? _intern.get(key) : value2;
 }
-function intern_set({ _intern, _key }, value2) {
+function intern_set$1({ _intern, _key }, value2) {
   const key = _key(value2);
   if (_intern.has(key))
     return _intern.get(key);
   _intern.set(key, value2);
   return value2;
 }
-function intern_delete({ _intern, _key }, value2) {
+function intern_delete$1({ _intern, _key }, value2) {
   const key = _key(value2);
   if (_intern.has(key)) {
     value2 = _intern.get(key);
@@ -7982,14 +7920,14 @@ function intern_delete({ _intern, _key }, value2) {
   }
   return value2;
 }
-function keyof(value2) {
+function keyof$1(value2) {
   return value2 !== null && typeof value2 === "object" ? value2.valueOf() : value2;
 }
 function permute(source2, keys2) {
   return Array.from(keys2, (key) => source2[key]);
 }
-function compareDefined(compare2 = ascending$2) {
-  if (compare2 === ascending$2)
+function compareDefined(compare2 = ascending$3) {
+  if (compare2 === ascending$3)
     return ascendingDefined;
   if (typeof compare2 !== "function")
     throw new TypeError("compare is not a function");
@@ -8003,51 +7941,14 @@ function compareDefined(compare2 = ascending$2) {
 function ascendingDefined(a2, b2) {
   return (a2 == null || !(a2 >= a2)) - (b2 == null || !(b2 >= b2)) || (a2 < b2 ? -1 : a2 > b2 ? 1 : 0);
 }
-var e10 = Math.sqrt(50), e5 = Math.sqrt(10), e2 = Math.sqrt(2);
-function ticks(start, stop3, count2) {
-  var reverse2, i = -1, n, ticks2, step;
-  stop3 = +stop3, start = +start, count2 = +count2;
-  if (start === stop3 && count2 > 0)
-    return [start];
-  if (reverse2 = stop3 < start)
-    n = start, start = stop3, stop3 = n;
-  if ((step = tickIncrement(start, stop3, count2)) === 0 || !isFinite(step))
-    return [];
-  if (step > 0) {
-    let r0 = Math.round(start / step), r1 = Math.round(stop3 / step);
-    if (r0 * step < start)
-      ++r0;
-    if (r1 * step > stop3)
-      --r1;
-    ticks2 = new Array(n = r1 - r0 + 1);
-    while (++i < n)
-      ticks2[i] = (r0 + i) * step;
-  } else {
-    step = -step;
-    let r0 = Math.round(start * step), r1 = Math.round(stop3 * step);
-    if (r0 / step < start)
-      ++r0;
-    if (r1 / step > stop3)
-      --r1;
-    ticks2 = new Array(n = r1 - r0 + 1);
-    while (++i < n)
-      ticks2[i] = (r0 + i) / step;
-  }
-  if (reverse2)
-    ticks2.reverse();
-  return ticks2;
-}
-function tickIncrement(start, stop3, count2) {
-  var step = (stop3 - start) / Math.max(0, count2), power = Math.floor(Math.log(step) / Math.LN10), error2 = step / Math.pow(10, power);
-  return power >= 0 ? (error2 >= e10 ? 10 : error2 >= e5 ? 5 : error2 >= e2 ? 2 : 1) * Math.pow(10, power) : -Math.pow(10, -power) / (error2 >= e10 ? 10 : error2 >= e5 ? 5 : error2 >= e2 ? 2 : 1);
-}
-function tickStep(start, stop3, count2) {
+var e10$1 = Math.sqrt(50), e5$1 = Math.sqrt(10), e2$1 = Math.sqrt(2);
+function tickStep$1(start, stop3, count2) {
   var step0 = Math.abs(stop3 - start) / Math.max(0, count2), step1 = Math.pow(10, Math.floor(Math.log(step0) / Math.LN10)), error2 = step0 / step1;
-  if (error2 >= e10)
+  if (error2 >= e10$1)
     step1 *= 10;
-  else if (error2 >= e5)
+  else if (error2 >= e5$1)
     step1 *= 5;
-  else if (error2 >= e2)
+  else if (error2 >= e2$1)
     step1 *= 2;
   return stop3 < start ? -step1 : step1;
 }
@@ -8140,7 +8041,7 @@ function quantile$1(values2, p, valueof) {
   var n, i = (n - 1) * p, i0 = Math.floor(i), value0 = max$2(quickselect(values2, i0).subarray(0, i0 + 1)), value1 = min$2(values2.subarray(i0 + 1));
   return value0 + (value1 - value0) * (i - i0);
 }
-function quantileSorted(values2, p, valueof = number$6) {
+function quantileSorted$1(values2, p, valueof = number$7) {
   if (!(n = values2.length))
     return;
   if ((p = +p) <= 0 || n < 2)
@@ -8173,15 +8074,7 @@ function mean(values2, valueof) {
 function median(values2, valueof) {
   return quantile$1(values2, 0.5, valueof);
 }
-function* flatten(arrays) {
-  for (const array2 of arrays) {
-    yield* array2;
-  }
-}
-function merge$2(arrays) {
-  return Array.from(flatten(arrays));
-}
-function range$4(start, stop3, step) {
+function range$5(start, stop3, step) {
   start = +start, stop3 = +stop3, step = (n = arguments.length) < 2 ? (stop3 = start, start = 0, 1) : n < 3 ? 1 : +step;
   var i = -1, n = Math.max(0, Math.ceil((stop3 - start) / step)) | 0, range2 = new Array(n);
   while (++i < n) {
@@ -8717,6 +8610,222 @@ utcYear.every = function(k) {
 };
 const utcYear$1 = utcYear;
 utcYear.range;
+function ascending$2(a2, b2) {
+  return a2 < b2 ? -1 : a2 > b2 ? 1 : a2 >= b2 ? 0 : NaN;
+}
+function bisector$1(f) {
+  let delta = f;
+  let compare2 = f;
+  if (f.length === 1) {
+    delta = (d, x2) => f(d) - x2;
+    compare2 = ascendingComparator(f);
+  }
+  function left(a2, x2, lo, hi) {
+    if (lo == null)
+      lo = 0;
+    if (hi == null)
+      hi = a2.length;
+    while (lo < hi) {
+      const mid = lo + hi >>> 1;
+      if (compare2(a2[mid], x2) < 0)
+        lo = mid + 1;
+      else
+        hi = mid;
+    }
+    return lo;
+  }
+  function right(a2, x2, lo, hi) {
+    if (lo == null)
+      lo = 0;
+    if (hi == null)
+      hi = a2.length;
+    while (lo < hi) {
+      const mid = lo + hi >>> 1;
+      if (compare2(a2[mid], x2) > 0)
+        hi = mid;
+      else
+        lo = mid + 1;
+    }
+    return lo;
+  }
+  function center(a2, x2, lo, hi) {
+    if (lo == null)
+      lo = 0;
+    if (hi == null)
+      hi = a2.length;
+    const i = left(a2, x2, lo, hi - 1);
+    return i > lo && delta(a2[i - 1], x2) > -delta(a2[i], x2) ? i - 1 : i;
+  }
+  return { left, center, right };
+}
+function ascendingComparator(f) {
+  return (d, x2) => ascending$2(f(d), x2);
+}
+function number$6(x2) {
+  return x2 === null ? NaN : +x2;
+}
+const ascendingBisect = bisector$1(ascending$2);
+const bisectRight$1 = ascendingBisect.right;
+bisector$1(number$6).center;
+const bisect$1 = bisectRight$1;
+class Adder {
+  constructor() {
+    this._partials = new Float64Array(32);
+    this._n = 0;
+  }
+  add(x2) {
+    const p = this._partials;
+    let i = 0;
+    for (let j = 0; j < this._n && j < 32; j++) {
+      const y2 = p[j], hi = x2 + y2, lo = Math.abs(x2) < Math.abs(y2) ? x2 - (hi - y2) : y2 - (hi - x2);
+      if (lo)
+        p[i++] = lo;
+      x2 = hi;
+    }
+    p[i] = x2;
+    this._n = i + 1;
+    return this;
+  }
+  valueOf() {
+    const p = this._partials;
+    let n = this._n, x2, y2, lo, hi = 0;
+    if (n > 0) {
+      hi = p[--n];
+      while (n > 0) {
+        x2 = hi;
+        y2 = p[--n];
+        hi = x2 + y2;
+        lo = y2 - (hi - x2);
+        if (lo)
+          break;
+      }
+      if (n > 0 && (lo < 0 && p[n - 1] < 0 || lo > 0 && p[n - 1] > 0)) {
+        y2 = lo * 2;
+        x2 = hi + y2;
+        if (y2 == x2 - hi)
+          hi = x2;
+      }
+    }
+    return hi;
+  }
+}
+class InternMap extends Map {
+  constructor(entries2, key = keyof) {
+    super();
+    Object.defineProperties(this, { _intern: { value: /* @__PURE__ */ new Map() }, _key: { value: key } });
+    if (entries2 != null)
+      for (const [key2, value2] of entries2)
+        this.set(key2, value2);
+  }
+  get(key) {
+    return super.get(intern_get(this, key));
+  }
+  has(key) {
+    return super.has(intern_get(this, key));
+  }
+  set(key, value2) {
+    return super.set(intern_set(this, key), value2);
+  }
+  delete(key) {
+    return super.delete(intern_delete(this, key));
+  }
+}
+function intern_get({ _intern, _key }, value2) {
+  const key = _key(value2);
+  return _intern.has(key) ? _intern.get(key) : value2;
+}
+function intern_set({ _intern, _key }, value2) {
+  const key = _key(value2);
+  if (_intern.has(key))
+    return _intern.get(key);
+  _intern.set(key, value2);
+  return value2;
+}
+function intern_delete({ _intern, _key }, value2) {
+  const key = _key(value2);
+  if (_intern.has(key)) {
+    value2 = _intern.get(value2);
+    _intern.delete(key);
+  }
+  return value2;
+}
+function keyof(value2) {
+  return value2 !== null && typeof value2 === "object" ? value2.valueOf() : value2;
+}
+var e10 = Math.sqrt(50), e5 = Math.sqrt(10), e2 = Math.sqrt(2);
+function ticks(start, stop3, count2) {
+  var reverse2, i = -1, n, ticks2, step;
+  stop3 = +stop3, start = +start, count2 = +count2;
+  if (start === stop3 && count2 > 0)
+    return [start];
+  if (reverse2 = stop3 < start)
+    n = start, start = stop3, stop3 = n;
+  if ((step = tickIncrement(start, stop3, count2)) === 0 || !isFinite(step))
+    return [];
+  if (step > 0) {
+    let r0 = Math.round(start / step), r1 = Math.round(stop3 / step);
+    if (r0 * step < start)
+      ++r0;
+    if (r1 * step > stop3)
+      --r1;
+    ticks2 = new Array(n = r1 - r0 + 1);
+    while (++i < n)
+      ticks2[i] = (r0 + i) * step;
+  } else {
+    step = -step;
+    let r0 = Math.round(start * step), r1 = Math.round(stop3 * step);
+    if (r0 / step < start)
+      ++r0;
+    if (r1 / step > stop3)
+      --r1;
+    ticks2 = new Array(n = r1 - r0 + 1);
+    while (++i < n)
+      ticks2[i] = (r0 + i) / step;
+  }
+  if (reverse2)
+    ticks2.reverse();
+  return ticks2;
+}
+function tickIncrement(start, stop3, count2) {
+  var step = (stop3 - start) / Math.max(0, count2), power = Math.floor(Math.log(step) / Math.LN10), error2 = step / Math.pow(10, power);
+  return power >= 0 ? (error2 >= e10 ? 10 : error2 >= e5 ? 5 : error2 >= e2 ? 2 : 1) * Math.pow(10, power) : -Math.pow(10, -power) / (error2 >= e10 ? 10 : error2 >= e5 ? 5 : error2 >= e2 ? 2 : 1);
+}
+function tickStep(start, stop3, count2) {
+  var step0 = Math.abs(stop3 - start) / Math.max(0, count2), step1 = Math.pow(10, Math.floor(Math.log(step0) / Math.LN10)), error2 = step0 / step1;
+  if (error2 >= e10)
+    step1 *= 10;
+  else if (error2 >= e5)
+    step1 *= 5;
+  else if (error2 >= e2)
+    step1 *= 2;
+  return stop3 < start ? -step1 : step1;
+}
+function quantileSorted(values2, p, valueof = number$6) {
+  if (!(n = values2.length))
+    return;
+  if ((p = +p) <= 0 || n < 2)
+    return +valueof(values2[0], 0, values2);
+  if (p >= 1)
+    return +valueof(values2[n - 1], n - 1, values2);
+  var n, i = (n - 1) * p, i0 = Math.floor(i), value0 = +valueof(values2[i0], i0, values2), value1 = +valueof(values2[i0 + 1], i0 + 1, values2);
+  return value0 + (value1 - value0) * (i - i0);
+}
+function* flatten(arrays) {
+  for (const array2 of arrays) {
+    yield* array2;
+  }
+}
+function merge$2(arrays) {
+  return Array.from(flatten(arrays));
+}
+function range$4(start, stop3, step) {
+  start = +start, stop3 = +stop3, step = (n = arguments.length) < 2 ? (stop3 = start, start = 0, 1) : n < 3 ? 1 : +step;
+  var i = -1, n = Math.max(0, Math.ceil((stop3 - start) / step)) | 0, range2 = new Array(n);
+  while (++i < n) {
+    range2[i] = start + i * step;
+  }
+  return range2;
+}
 function ticker(year2, month2, week2, day2, hour2, minute2) {
   const tickIntervals = [
     [utcSecond, 1, durationSecond$1],
@@ -8995,16 +9104,16 @@ const Milli = [YEAR, MONTH, DATE, HOURS, MINUTES, SECONDS, MILLISECONDS], Second
 const intervals = [[Seconds, 1, durationSecond], [Seconds, 5, 5 * durationSecond], [Seconds, 15, 15 * durationSecond], [Seconds, 30, 30 * durationSecond], [Minutes, 1, durationMinute], [Minutes, 5, 5 * durationMinute], [Minutes, 15, 15 * durationMinute], [Minutes, 30, 30 * durationMinute], [Hours, 1, durationHour], [Hours, 3, 3 * durationHour], [Hours, 6, 6 * durationHour], [Hours, 12, 12 * durationHour], [Day, 1, durationDay], [Week, 1, durationWeek], [Month, 1, durationMonth], [Month, 3, 3 * durationMonth], [Year, 1, durationYear]];
 function bin$2(opt) {
   const ext = opt.extent, max2 = opt.maxbins || 40, target2 = Math.abs(span(ext)) / max2;
-  let i = bisector$1((i2) => i2[2]).right(intervals, target2), units2, step;
+  let i = bisector$2((i2) => i2[2]).right(intervals, target2), units2, step;
   if (i === intervals.length) {
-    units2 = Year, step = tickStep(ext[0] / durationYear, ext[1] / durationYear, max2);
+    units2 = Year, step = tickStep$1(ext[0] / durationYear, ext[1] / durationYear, max2);
   } else if (i) {
     i = intervals[target2 / intervals[i - 1][2] < intervals[i][2] / target2 ? i - 1 : i];
     units2 = i[0];
     step = i[1];
   } else {
     units2 = Milli;
-    step = Math.max(tickStep(ext[0], ext[1], max2), 1);
+    step = Math.max(tickStep$1(ext[0], ext[1], max2), 1);
   }
   return {
     units: units2,
@@ -9643,7 +9752,7 @@ function numberLocale(locale2) {
     },
     formatSpan(start, stop3, count2, specifier) {
       specifier = formatSpecifier(specifier == null ? ",f" : specifier);
-      const step = tickStep(start, stop3, count2), value2 = Math.max(Math.abs(start), Math.abs(stop3));
+      const step = tickStep$1(start, stop3, count2), value2 = Math.max(Math.abs(start), Math.abs(stop3));
       let precision;
       if (specifier.precision == null) {
         switch (specifier.type) {
@@ -11575,8 +11684,8 @@ function* numbers$1(values2, valueof) {
 }
 function quantiles(array2, p, f) {
   const values2 = Float64Array.from(numbers$1(array2, f));
-  values2.sort(ascending$2);
-  return p.map((_) => quantileSorted(values2, _));
+  values2.sort(ascending$3);
+  return p.map((_) => quantileSorted$1(values2, _));
 }
 function quartiles(array2, f) {
   return quantiles(array2, [0.25, 0.5, 0.75], f);
@@ -11637,7 +11746,7 @@ function bootstrapCI(array2, samples, alpha, f) {
     }
     mu[j] = a2 / n;
   }
-  mu.sort(ascending$2);
+  mu.sort(ascending$3);
   return [quantile$1(mu, alpha / 2), quantile$1(mu, 1 - alpha / 2)];
 }
 function dotbin(array2, step, smooth, f) {
@@ -14545,7 +14654,7 @@ function pivotKeys(key, limit, pulse2) {
       list.push(k);
     }
   });
-  list.sort(ascending$3);
+  list.sort(ascending$4);
   return limit ? list.slice(0, limit) : list;
 }
 function PreFacet$1(params2) {
@@ -14683,7 +14792,7 @@ inherits(Quantile$1, Transform, {
       out.source = this.value;
       return out;
     }
-    const source2 = pulse2.materialize(pulse2.SOURCE).source, groups = partition$1$1(source2, _.groupby, _.field), names = (_.groupby || []).map(accessorName), values2 = [], step = _.step || 0.01, p = _.probs || range$4(step / 2, 1 - EPSILON$2, step), n = p.length;
+    const source2 = pulse2.materialize(pulse2.SOURCE).source, groups = partition$1$1(source2, _.groupby, _.field), names = (_.groupby || []).map(accessorName), values2 = [], step = _.step || 0.01, p = _.probs || range$5(step / 2, 1 - EPSILON$2, step), n = p.length;
     groups.forEach((g) => {
       const q = quantiles(g, p);
       for (let i = 0; i < n; ++i) {
@@ -14847,7 +14956,7 @@ inherits(Sequence, Transform, {
       return;
     const out = pulse2.materialize().fork(pulse2.MOD), as = _.as || "data";
     out.rem = this.value ? pulse2.rem.concat(this.value) : pulse2.rem;
-    this.value = range$4(_.start, _.stop, _.step || 1).map((v) => {
+    this.value = range$5(_.start, _.stop, _.step || 1).map((v) => {
       const t4 = {};
       t4[as] = v;
       return ingest$1(t4);
@@ -15331,7 +15440,7 @@ inherits(Window, Transform, {
   }
 });
 function processPartition(list, state, cmp2, _) {
-  const sort2 = _.sort, range2 = sort2 && !_.ignorePeers, frame2 = _.frame || [null, 0], data2 = list.data(cmp2), n = data2.length, b2 = range2 ? bisector$1(sort2) : null, w2 = {
+  const sort2 = _.sort, range2 = sort2 && !_.ignorePeers, frame2 = _.frame || [null, 0], data2 = list.data(cmp2), n = data2.length, b2 = range2 ? bisector$2(sort2) : null, w2 = {
     i0: 0,
     i1: 0,
     p0: 0,
@@ -18399,7 +18508,7 @@ function band() {
       start = Math.round(start);
       bandwidth2 = Math.round(bandwidth2);
     }
-    const values2 = range$4(n).map((i) => start + step * i);
+    const values2 = range$5(n).map((i) => start + step * i);
     return ordinalRange(reverse2 ? values2.reverse() : values2);
   }
   scale2.domain = function(_) {
@@ -18484,8 +18593,8 @@ function band() {
     }
     if (hi < values2[0] || lo > range$12[1 - reverse2])
       return;
-    a2 = Math.max(0, bisectRight$1(values2, lo) - 1);
-    b2 = lo === hi ? a2 : bisectRight$1(values2, hi) - 1;
+    a2 = Math.max(0, bisectRight$2(values2, lo) - 1);
+    b2 = lo === hi ? a2 : bisectRight$2(values2, hi) - 1;
     if (lo - values2[a2] > bandwidth2 + 1e-10)
       ++a2;
     if (reverse2) {
@@ -18524,7 +18633,7 @@ const slice$2 = Array.prototype.slice;
 function scaleBinOrdinal() {
   let domain2 = [], range2 = [];
   function scale2(x2) {
-    return x2 == null || x2 !== x2 ? void 0 : range2[(bisect$1(domain2, x2) - 1) % range2.length];
+    return x2 == null || x2 !== x2 ? void 0 : range2[(bisect$2(domain2, x2) - 1) % range2.length];
   }
   scale2.domain = function(_) {
     if (arguments.length) {
@@ -24433,7 +24542,7 @@ Pie.Definition = {
 };
 inherits(Pie, Transform, {
   transform(_, pulse2) {
-    var as = _.as || ["startAngle", "endAngle"], startAngle = as[0], endAngle = as[1], field2 = _.field || one$2, start = _.startAngle || 0, stop3 = _.endAngle != null ? _.endAngle : 2 * Math.PI, data2 = pulse2.source, values2 = data2.map(field2), n = values2.length, a2 = start, k = (stop3 - start) / sum$1(values2), index2 = range$4(n), i, t4, v;
+    var as = _.as || ["startAngle", "endAngle"], startAngle = as[0], endAngle = as[1], field2 = _.field || one$2, start = _.startAngle || 0, stop3 = _.endAngle != null ? _.endAngle : 2 * Math.PI, data2 = pulse2.source, values2 = data2.map(field2), n = values2.length, a2 = start, k = (stop3 - start) / sum$1(values2), index2 = range$5(n), i, t4, v;
     if (_.sort) {
       index2.sort((a3, b2) => values2[a3] - values2[b2]);
     }
@@ -24564,7 +24673,7 @@ function configureBins(scale2, _, count2) {
       start = step * Math.ceil(lo / step);
     if (stop3 > hi)
       stop3 = step * Math.floor(hi / step);
-    bins2 = range$4(start, stop3 + step / 2, step);
+    bins2 = range$5(start, stop3 + step / 2, step);
   }
   if (bins2) {
     scale2.bins = bins2;
@@ -27242,8 +27351,8 @@ function within(p, q, r3) {
 }
 function quantize(k, nice2, zero2) {
   return function(values2) {
-    var ex = extent(values2), start = zero2 ? Math.min(ex[0], 0) : ex[0], stop3 = ex[1], span2 = stop3 - start, step = nice2 ? tickStep(start, stop3, k) : span2 / (k + 1);
-    return range$4(start + step, stop3, step);
+    var ex = extent(values2), start = zero2 ? Math.min(ex[0], 0) : ex[0], stop3 = ex[1], span2 = stop3 - start, step = nice2 ? tickStep$1(start, stop3, k) : span2 / (k + 1);
+    return range$5(start + step, stop3, step);
   };
 }
 function Isocontour(params2) {
@@ -33541,7 +33650,7 @@ function SortedIndex() {
       array2 = value2;
       n = size;
     }
-    return [bisectLeft$1(array2, range2[0], 0, n), bisectRight$1(array2, range2[1], 0, n)];
+    return [bisectLeft$1(array2, range2[0], 0, n), bisectRight$2(array2, range2[1], 0, n)];
   }
   return {
     insert: insert2,
@@ -35949,7 +36058,7 @@ const functionContext = {
   hsl: hsl$2,
   luminance,
   contrast,
-  sequence: range$4,
+  sequence: range$5,
   format,
   utcFormat,
   utcParse,
@@ -36985,7 +37094,7 @@ function radio(bind2, el2, param2, value2) {
 }
 function range$1(bind2, el2, param2, value2) {
   value2 = value2 !== void 0 ? value2 : (+param2.max + +param2.min) / 2;
-  const max2 = param2.max != null ? param2.max : Math.max(100, +value2) || 100, min2 = param2.min || Math.min(0, max2, +value2) || 0, step = param2.step || tickStep(min2, max2, 100);
+  const max2 = param2.max != null ? param2.max : Math.max(100, +value2) || 100, min2 = param2.min || Math.min(0, max2, +value2) || 0, step = param2.step || tickStep$1(min2, max2, 100);
   const node = element("input", {
     type: "range",
     name: param2.signal,
@@ -40999,7 +41108,7 @@ const vegaImport = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.definePr
   accessorFields,
   accessorName,
   array: array$5,
-  ascending: ascending$3,
+  ascending: ascending$4,
   bandwidthNRD: estimateBandwidth,
   bin: bin$1,
   bootstrapCI,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@vitessce/vega",
-  "version": "3.1.3",
+  "version": "3.2.0",
   "author": "Gehlenborg Lab",
   "homepage": "http://vitessce.io",
   "repository": {
@@ -22,7 +22,7 @@
     "vega": "^5.21.0",
     "vega-lite": "^5.1.1",
     "vega-tooltip": "^0.27.0",
-    "@vitessce/tooltip": "3.1.3"
+    "@vitessce/tooltip": "3.2.0"
   },
   "devDependencies": {
     "react": "^18.0.0",