victory-vendor 36.9.2 → 37.0.0

package/CHANGELOG.md

@@ -1,5 +1,11 @@
 # victory-vendor
 
+## 37.0.0
+
+### Major Changes
+
+- Upgrade babel dependencies and build target to modern browsers ([#2804](https://github.com/FormidableLabs/victory/pull/2804))
+
 ## 36.9.2
 
 ## 36.9.1

package/lib-vendor/d3-array/src/array.js

@@ -5,7 +5,5 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.slice = exports.map = void 0;
 var array = Array.prototype;
-var slice = array.slice;
-exports.slice = slice;
-var map = array.map;
-exports.map = map;
+var slice = exports.slice = array.slice;
+var map = exports.map = array.map;

package/lib-vendor/d3-array/src/ascending.js

@@ -4,7 +4,6 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = ascending;
-
 function ascending(a, b) {
   return a == null || b == null ? NaN : a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;
 }

package/lib-vendor/d3-array/src/bin.js

@@ -4,72 +4,59 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = bin;
-
 var _array = require("./array.js");
-
 var _bisect = _interopRequireDefault(require("./bisect.js"));
-
 var _constant = _interopRequireDefault(require("./constant.js"));
-
 var _extent = _interopRequireDefault(require("./extent.js"));
-
 var _identity = _interopRequireDefault(require("./identity.js"));
-
 var _nice = _interopRequireDefault(require("./nice.js"));
-
 var _ticks = _interopRequireWildcard(require("./ticks.js"));
-
 var _sturges = _interopRequireDefault(require("./threshold/sturges.js"));
-
-function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
-
-function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
-
+function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function (e) { return e ? t : r; })(e); }
+function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != typeof e && "function" != typeof e) return { default: e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n.default = e, t && t.set(e, n), n; }
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
 function bin() {
   var value = _identity.default,
-      domain = _extent.default,
-      threshold = _sturges.default;
-
+    domain = _extent.default,
+    threshold = _sturges.default;
   function histogram(data) {
     if (!Array.isArray(data)) data = Array.from(data);
     var i,
-        n = data.length,
-        x,
-        step,
-        values = new Array(n);
-
+      n = data.length,
+      x,
+      step,
+      values = new Array(n);
     for (i = 0; i < n; ++i) {
       values[i] = value(data[i], i, data);
     }
-
     var xz = domain(values),
-        x0 = xz[0],
-        x1 = xz[1],
-        tz = threshold(values, x0, x1); // Convert number of thresholds into uniform thresholds, and nice the
-    // default domain accordingly.
+      x0 = xz[0],
+      x1 = xz[1],
+      tz = threshold(values, x0, x1);
 
+    // Convert number of thresholds into uniform thresholds, and nice the
+    // default domain accordingly.
     if (!Array.isArray(tz)) {
       const max = x1,
-            tn = +tz;
+        tn = +tz;
       if (domain === _extent.default) [x0, x1] = (0, _nice.default)(x0, x1, tn);
-      tz = (0, _ticks.default)(x0, x1, tn); // If the domain is aligned with the first tick (which it will by
+      tz = (0, _ticks.default)(x0, x1, tn);
+
+      // If the domain is aligned with the first tick (which it will by
       // default), then we can use quantization rather than bisection to bin
       // values, which is substantially faster.
+      if (tz[0] <= x0) step = (0, _ticks.tickIncrement)(x0, x1, tn);
 
-      if (tz[0] <= x0) step = (0, _ticks.tickIncrement)(x0, x1, tn); // If the last threshold is coincident with the domain’s upper bound, the
+      // If the last threshold is coincident with the domain’s upper bound, the
       // last bin will be zero-width. If the default domain is used, and this
       // last threshold is coincident with the maximum input value, we can
       // extend the niced upper bound by one tick to ensure uniform bin widths;
       // otherwise, we simply remove the last threshold. Note that we don’t
       // coerce values or the domain to numbers, and thus must be careful to
       // compare order (>=) rather than strict equality (===)!
-
       if (tz[tz.length - 1] >= x1) {
         if (max >= x1 && domain === _extent.default) {
           const step = (0, _ticks.tickIncrement)(x0, x1, tn);
-
           if (isFinite(step)) {
             if (step > 0) {
               x1 = (Math.floor(x1 / step) + 1) * step;
@@ -81,25 +68,23 @@ function bin() {
           tz.pop();
         }
       }
-    } // Remove any thresholds outside the domain.
-
+    }
 
+    // Remove any thresholds outside the domain.
     var m = tz.length;
-
     while (tz[0] <= x0) tz.shift(), --m;
-
     while (tz[m - 1] > x1) tz.pop(), --m;
-
     var bins = new Array(m + 1),
-        bin; // Initialize bins.
+      bin;
 
+    // Initialize bins.
     for (i = 0; i <= m; ++i) {
       bin = bins[i] = [];
       bin.x0 = i > 0 ? tz[i - 1] : x0;
       bin.x1 = i < m ? tz[i] : x1;
-    } // Assign data to bins by value, ignoring any outside the domain.
-
+    }
 
+    // Assign data to bins by value, ignoring any outside the domain.
     if (isFinite(step)) {
       if (step > 0) {
         for (i = 0; i < n; ++i) {
@@ -122,21 +107,16 @@ function bin() {
         }
       }
     }
-
     return bins;
   }
-
   histogram.value = function (_) {
     return arguments.length ? (value = typeof _ === "function" ? _ : (0, _constant.default)(_), histogram) : value;
   };
-
   histogram.domain = function (_) {
     return arguments.length ? (domain = typeof _ === "function" ? _ : (0, _constant.default)([_[0], _[1]]), histogram) : domain;
   };
-
   histogram.thresholds = function (_) {
     return arguments.length ? (threshold = typeof _ === "function" ? _ : Array.isArray(_) ? (0, _constant.default)(_array.slice.call(_)) : (0, _constant.default)(_), histogram) : threshold;
   };
-
   return histogram;
 }

package/lib-vendor/d3-array/src/bisect.js

@@ -4,21 +4,12 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = exports.bisectRight = exports.bisectLeft = exports.bisectCenter = void 0;
-
 var _ascending = _interopRequireDefault(require("./ascending.js"));
-
 var _bisector = _interopRequireDefault(require("./bisector.js"));
-
 var _number = _interopRequireDefault(require("./number.js"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
 const ascendingBisect = (0, _bisector.default)(_ascending.default);
-const bisectRight = ascendingBisect.right;
-exports.bisectRight = bisectRight;
-const bisectLeft = ascendingBisect.left;
-exports.bisectLeft = bisectLeft;
-const bisectCenter = (0, _bisector.default)(_number.default).center;
-exports.bisectCenter = bisectCenter;
-var _default = bisectRight;
-exports.default = _default;
+const bisectRight = exports.bisectRight = ascendingBisect.right;
+const bisectLeft = exports.bisectLeft = ascendingBisect.left;
+const bisectCenter = exports.bisectCenter = (0, _bisector.default)(_number.default).center;
+var _default = exports.default = bisectRight;

package/lib-vendor/d3-array/src/bisector.js

@@ -4,70 +4,56 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = bisector;
-
 var _ascending = _interopRequireDefault(require("./ascending.js"));
-
 var _descending = _interopRequireDefault(require("./descending.js"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
 function bisector(f) {
-  let compare1, compare2, delta; // If an accessor is specified, promote it to a comparator. In this case we
+  let compare1, compare2, delta;
+
+  // If an accessor is specified, promote it to a comparator. In this case we
   // can test whether the search value is (self-) comparable. We can’t do this
   // for a comparator (except for specific, known comparators) because we can’t
   // tell if the comparator is symmetric, and an asymmetric comparator can’t be
   // used to test whether a single value is comparable.
-
   if (f.length !== 2) {
     compare1 = _ascending.default;
-
     compare2 = (d, x) => (0, _ascending.default)(f(d), x);
-
     delta = (d, x) => f(d) - x;
   } else {
     compare1 = f === _ascending.default || f === _descending.default ? f : zero;
     compare2 = f;
     delta = f;
   }
-
   function left(a, x, lo = 0, hi = a.length) {
     if (lo < hi) {
       if (compare1(x, x) !== 0) return hi;
-
       do {
         const mid = lo + hi >>> 1;
         if (compare2(a[mid], x) < 0) lo = mid + 1;else hi = mid;
       } while (lo < hi);
     }
-
     return lo;
   }
-
   function right(a, x, lo = 0, hi = a.length) {
     if (lo < hi) {
       if (compare1(x, x) !== 0) return hi;
-
       do {
         const mid = lo + hi >>> 1;
         if (compare2(a[mid], x) <= 0) lo = mid + 1;else hi = mid;
       } while (lo < hi);
     }
-
     return lo;
   }
-
   function center(a, x, lo = 0, hi = a.length) {
     const i = left(a, x, lo, hi - 1);
     return i > lo && delta(a[i - 1], x) > -delta(a[i], x) ? i - 1 : i;
   }
-
   return {
     left,
     center,
     right
   };
 }
-
 function zero() {
   return 0;
 }

package/lib-vendor/d3-array/src/constant.js

@@ -4,7 +4,6 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = constant;
-
 function constant(x) {
   return () => x;
 }

package/lib-vendor/d3-array/src/count.js

@@ -4,10 +4,8 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = count;
-
 function count(values, valueof) {
   let count = 0;
-
   if (valueof === undefined) {
     for (let value of values) {
       if (value != null && (value = +value) >= value) {
@@ -16,13 +14,11 @@ function count(values, valueof) {
     }
   } else {
     let index = -1;
-
     for (let value of values) {
       if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {
         ++count;
       }
     }
   }
-
   return count;
 }

package/lib-vendor/d3-array/src/cross.js

@@ -4,23 +4,18 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = cross;
-
 function length(array) {
   return array.length | 0;
 }
-
 function empty(length) {
   return !(length > 0);
 }
-
 function arrayify(values) {
   return typeof values !== "object" || "length" in values ? values : Array.from(values);
 }
-
 function reducer(reduce) {
   return values => reduce(...values);
 }
-
 function cross(...values) {
   const reduce = typeof values[values.length - 1] === "function" && reducer(values.pop());
   values = values.map(arrayify);
@@ -29,11 +24,9 @@ function cross(...values) {
   const index = new Array(j + 1).fill(0);
   const product = [];
   if (j < 0 || lengths.some(empty)) return product;
-
   while (true) {
     product.push(index.map((j, i) => values[i][j]));
     let i = j;
-
     while (++index[i] === lengths[i]) {
       if (i === 0) return reduce ? product.map(reduce) : product;
       index[i--] = 0;

package/lib-vendor/d3-array/src/cumsum.js

@@ -4,9 +4,8 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = cumsum;
-
 function cumsum(values, valueof) {
   var sum = 0,
-      index = 0;
+    index = 0;
   return Float64Array.from(values, valueof === undefined ? v => sum += +v || 0 : v => sum += +valueof(v, index++, values) || 0);
 }

package/lib-vendor/d3-array/src/descending.js

@@ -4,7 +4,6 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = descending;
-
 function descending(a, b) {
   return a == null || b == null ? NaN : b < a ? -1 : b > a ? 1 : b >= a ? 0 : NaN;
 }

package/lib-vendor/d3-array/src/deviation.js

@@ -4,11 +4,8 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = deviation;
-
 var _variance = _interopRequireDefault(require("./variance.js"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
 function deviation(values, valueof) {
   const v = (0, _variance.default)(values, valueof);
   return v ? Math.sqrt(v) : v;

package/lib-vendor/d3-array/src/difference.js

@@ -4,17 +4,13 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = difference;
-
 var _index = require("../../../lib-vendor/internmap/src/index.js");
-
 function difference(values, ...others) {
   values = new _index.InternSet(values);
-
   for (const other of others) {
     for (const value of other) {
       values.delete(value);
     }
   }
-
   return values;
 }

package/lib-vendor/d3-array/src/disjoint.js

@@ -4,17 +4,13 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = disjoint;
-
 var _index = require("../../../lib-vendor/internmap/src/index.js");
-
 function disjoint(values, other) {
   const iterator = other[Symbol.iterator](),
-        set = new _index.InternSet();
-
+    set = new _index.InternSet();
   for (const v of values) {
     if (set.has(v)) return false;
     let value, done;
-
     while (({
       value,
       done
@@ -24,6 +20,5 @@ function disjoint(values, other) {
       set.add(value);
     }
   }
-
   return true;
 }

package/lib-vendor/d3-array/src/every.js

@@ -4,16 +4,13 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = every;
-
 function every(values, test) {
   if (typeof test !== "function") throw new TypeError("test is not a function");
   let index = -1;
-
   for (const value of values) {
     if (!test(value, ++index, values)) {
       return false;
     }
   }
-
   return true;
 }

package/lib-vendor/d3-array/src/extent.js

@@ -4,11 +4,9 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = extent;
-
 function extent(values, valueof) {
   let min;
   let max;
-
   if (valueof === undefined) {
     for (const value of values) {
       if (value != null) {
@@ -22,7 +20,6 @@ function extent(values, valueof) {
     }
   } else {
     let index = -1;
-
     for (let value of values) {
       if ((value = valueof(value, ++index, values)) != null) {
         if (min === undefined) {
@@ -34,6 +31,5 @@ function extent(values, valueof) {
       }
     }
   }
-
   return [min, max];
 }

package/lib-vendor/d3-array/src/filter.js

@@ -4,17 +4,14 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = filter;
-
 function filter(values, test) {
   if (typeof test !== "function") throw new TypeError("test is not a function");
   const array = [];
   let index = -1;
-
   for (const value of values) {
     if (test(value, ++index, values)) {
       array.push(value);
     }
   }
-
   return array;
 }

package/lib-vendor/d3-array/src/fsum.js

@@ -6,42 +6,35 @@ Object.defineProperty(exports, "__esModule", {
 exports.Adder = void 0;
 exports.fcumsum = fcumsum;
 exports.fsum = fsum;
-
 // https://github.com/python/cpython/blob/a74eea238f5baba15797e2e8b570d153bc8690a7/Modules/mathmodule.c#L1423
 class Adder {
   constructor() {
     this._partials = new Float64Array(32);
     this._n = 0;
   }
-
   add(x) {
     const p = this._partials;
     let i = 0;
-
     for (let j = 0; j < this._n && j < 32; j++) {
       const y = p[j],
-            hi = x + y,
-            lo = Math.abs(x) < Math.abs(y) ? x - (hi - y) : y - (hi - x);
+        hi = x + y,
+        lo = Math.abs(x) < Math.abs(y) ? x - (hi - y) : y - (hi - x);
       if (lo) p[i++] = lo;
       x = hi;
     }
-
     p[i] = x;
     this._n = i + 1;
     return this;
   }
-
   valueOf() {
     const p = this._partials;
     let n = this._n,
-        x,
-        y,
-        lo,
-        hi = 0;
-
+      x,
+      y,
+      lo,
+      hi = 0;
     if (n > 0) {
       hi = p[--n];
-
       while (n > 0) {
         x = hi;
         y = p[--n];
@@ -49,24 +42,18 @@ class Adder {
         lo = y - (hi - x);
         if (lo) break;
       }
-
       if (n > 0 && (lo < 0 && p[n - 1] < 0 || lo > 0 && p[n - 1] > 0)) {
         y = lo * 2;
         x = hi + y;
         if (y == x - hi) hi = x;
       }
     }
-
     return hi;
   }
-
 }
-
 exports.Adder = Adder;
-
 function fsum(values, valueof) {
   const adder = new Adder();
-
   if (valueof === undefined) {
     for (let value of values) {
       if (value = +value) {
@@ -75,17 +62,14 @@ function fsum(values, valueof) {
     }
   } else {
     let index = -1;
-
     for (let value of values) {
       if (value = +valueof(value, ++index, values)) {
         adder.add(value);
       }
     }
   }
-
   return +adder;
 }
-
 function fcumsum(values, valueof) {
   const adder = new Adder();
   let index = -1;

package/lib-vendor/d3-array/src/greatest.js

@@ -4,21 +4,15 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = greatest;
-
 var _ascending = _interopRequireDefault(require("./ascending.js"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
 function greatest(values, compare = _ascending.default) {
   let max;
   let defined = false;
-
   if (compare.length === 1) {
     let maxValue;
-
     for (const element of values) {
       const value = compare(element);
-
       if (defined ? (0, _ascending.default)(value, maxValue) > 0 : (0, _ascending.default)(value, value) === 0) {
         max = element;
         maxValue = value;
@@ -33,6 +27,5 @@ function greatest(values, compare = _ascending.default) {
       }
     }
   }
-
   return max;
 }

package/lib-vendor/d3-array/src/greatestIndex.js

@@ -4,27 +4,20 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = greatestIndex;
-
 var _ascending = _interopRequireDefault(require("./ascending.js"));
-
 var _maxIndex = _interopRequireDefault(require("./maxIndex.js"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
 function greatestIndex(values, compare = _ascending.default) {
   if (compare.length === 1) return (0, _maxIndex.default)(values, compare);
   let maxValue;
   let max = -1;
   let index = -1;
-
   for (const value of values) {
     ++index;
-
     if (max < 0 ? compare(value, value) === 0 : compare(value, maxValue) > 0) {
       maxValue = value;
       max = index;
     }
   }
-
   return max;
 }