umwd-components 0.1.759 → 0.1.761

package/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/bin.js

@@ -1,144 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as bin$1 } from '../../../../../_virtual/bin.js';
-import './array.js';
-import './bisect.js';
-import './constant.js';
-import './extent.js';
-import './identity.js';
-import './nice.js';
-import './ticks.js';
-import './threshold/sturges.js';
-import { __exports as array } from '../../../../../_virtual/array2.js';
-import { __exports as identity } from '../../../../../_virtual/identity4.js';
-import { __exports as extent } from '../../../../../_virtual/extent.js';
-import { __exports as sturges } from '../../../../../_virtual/sturges.js';
-import { __exports as constant } from '../../../../../_virtual/constant3.js';
-import { __exports as nice } from '../../../../../_virtual/nice2.js';
-import { __exports as ticks } from '../../../../../_virtual/ticks.js';
-import { __exports as bisect } from '../../../../../_virtual/bisect.js';
-
-Object.defineProperty(bin$1, "__esModule", {
-  value: true
-});
-bin$1.default = bin;
-var _array = array;
-var _bisect = _interopRequireDefault(bisect);
-var _constant = _interopRequireDefault(constant);
-var _extent = _interopRequireDefault(extent);
-var _identity = _interopRequireDefault(identity);
-var _nice = _interopRequireDefault(nice);
-var _ticks = _interopRequireWildcard(ticks);
-var _sturges = _interopRequireDefault(sturges);
-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 (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;
-  function histogram(data) {
-    if (!Array.isArray(data)) data = Array.from(data);
-    var i,
-      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.
-    if (!Array.isArray(tz)) {
-      const max = x1,
-        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
-      // 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 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;
-            } else if (step < 0) {
-              x1 = (Math.ceil(x1 * -step) + 1) / -step;
-            }
-          }
-        } else {
-          tz.pop();
-        }
-      }
-    }
-
-    // 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.
-    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.
-    if (isFinite(step)) {
-      if (step > 0) {
-        for (i = 0; i < n; ++i) {
-          if ((x = values[i]) != null && x0 <= x && x <= x1) {
-            bins[Math.min(m, Math.floor((x - x0) / step))].push(data[i]);
-          }
-        }
-      } else if (step < 0) {
-        for (i = 0; i < n; ++i) {
-          if ((x = values[i]) != null && x0 <= x && x <= x1) {
-            const j = Math.floor((x0 - x) * step);
-            bins[Math.min(m, j + (tz[j] <= x))].push(data[i]); // handle off-by-one due to rounding
-          }
-        }
-      }
-    } else {
-      for (i = 0; i < n; ++i) {
-        if ((x = values[i]) != null && x0 <= x && x <= x1) {
-          bins[(0, _bisect.default)(tz, x, 0, m)].push(data[i]);
-        }
-      }
-    }
-    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/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/bisect.js

@@ -1,27 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as bisect } from '../../../../../_virtual/bisect.js';
-import './ascending.js';
-import './bisector.js';
-import './number.js';
-import { __exports as bisector } from '../../../../../_virtual/bisector.js';
-import { __exports as ascending } from '../../../../../_virtual/ascending2.js';
-import { __exports as number } from '../../../../../_virtual/number3.js';
-
-Object.defineProperty(bisect, "__esModule", {
-  value: true
-});
-bisect.default = bisect.bisectRight = bisect.bisectLeft = bisect.bisectCenter = void 0;
-var _ascending = _interopRequireDefault(ascending);
-var _bisector = _interopRequireDefault(bisector);
-var _number = _interopRequireDefault(number);
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-const ascendingBisect = (0, _bisector.default)(_ascending.default);
-const bisectRight = bisect.bisectRight = ascendingBisect.right;
-bisect.bisectLeft = ascendingBisect.left;
-bisect.bisectCenter = (0, _bisector.default)(_number.default).center;
-bisect.default = bisectRight;

package/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/bisector.js

@@ -1,69 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as bisector$1 } from '../../../../../_virtual/bisector.js';
-import './ascending.js';
-import './descending.js';
-import { __exports as ascending } from '../../../../../_virtual/ascending2.js';
-import { __exports as descending } from '../../../../../_virtual/descending3.js';
-
-Object.defineProperty(bisector$1, "__esModule", {
-  value: true
-});
-bisector$1.default = bisector;
-var _ascending = _interopRequireDefault(ascending);
-var _descending = _interopRequireDefault(descending);
-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
-  // 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/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/constant.js

@@ -1,15 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as constant$1 } from '../../../../../_virtual/constant3.js';
-
-Object.defineProperty(constant$1, "__esModule", {
-  value: true
-});
-constant$1.default = constant;
-function constant(x) {
-  return () => x;
-}

package/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/count.js

@@ -1,30 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as count$1 } from '../../../../../_virtual/count.js';
-
-Object.defineProperty(count$1, "__esModule", {
-  value: true
-});
-count$1.default = count;
-function count(values, valueof) {
-  let count = 0;
-  if (valueof === undefined) {
-    for (let value of values) {
-      if (value != null && (value = +value) >= value) {
-        ++count;
-      }
-    }
-  } else {
-    let index = -1;
-    for (let value of values) {
-      if ((value = valueof(value, ++index, values)) != null && (value = +value) >= value) {
-        ++count;
-      }
-    }
-  }
-  return count;
-}

package/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/cross.js

@@ -1,41 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as cross$1 } from '../../../../../_virtual/cross3.js';
-
-Object.defineProperty(cross$1, "__esModule", {
-  value: true
-});
-cross$1.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);
-  const lengths = values.map(length);
-  const j = values.length - 1;
-  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/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/cumsum.js

@@ -1,17 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as cumsum$1 } from '../../../../../_virtual/cumsum.js';
-
-Object.defineProperty(cumsum$1, "__esModule", {
-  value: true
-});
-cumsum$1.default = cumsum;
-function cumsum(values, valueof) {
-  var sum = 0,
-    index = 0;
-  return Float64Array.from(values, valueof === undefined ? v => sum += +v || 0 : v => sum += +valueof(v, index++, values) || 0);
-}

package/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/descending.js

@@ -1,15 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as descending$1 } from '../../../../../_virtual/descending3.js';
-
-Object.defineProperty(descending$1, "__esModule", {
-  value: true
-});
-descending$1.default = descending;
-function descending(a, b) {
-  return a == null || b == null ? NaN : b < a ? -1 : b > a ? 1 : b >= a ? 0 : NaN;
-}

package/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/deviation.js

@@ -1,20 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as deviation$1 } from '../../../../../_virtual/deviation.js';
-import './variance.js';
-import { __exports as variance } from '../../../../../_virtual/variance.js';
-
-Object.defineProperty(deviation$1, "__esModule", {
-  value: true
-});
-deviation$1.default = deviation;
-var _variance = _interopRequireDefault(variance);
-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/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/difference.js

@@ -1,24 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as difference$1 } from '../../../../../_virtual/difference.js';
-import '../../internmap/src/index.js';
-import { __exports as src } from '../../../../../_virtual/index19.js';
-
-Object.defineProperty(difference$1, "__esModule", {
-  value: true
-});
-difference$1.default = difference;
-var _index = src;
-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/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/disjoint.js

@@ -1,32 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as disjoint$1 } from '../../../../../_virtual/disjoint.js';
-import '../../internmap/src/index.js';
-import { __exports as src } from '../../../../../_virtual/index19.js';
-
-Object.defineProperty(disjoint$1, "__esModule", {
-  value: true
-});
-disjoint$1.default = disjoint;
-var _index = src;
-function disjoint(values, other) {
-  const iterator = other[Symbol.iterator](),
-    set = new _index.InternSet();
-  for (const v of values) {
-    if (set.has(v)) return false;
-    let value, done;
-    while (({
-      value,
-      done
-    } = iterator.next())) {
-      if (done) break;
-      if (Object.is(v, value)) return false;
-      set.add(value);
-    }
-  }
-  return true;
-}

package/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/every.js

@@ -1,22 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as every$1 } from '../../../../../_virtual/every.js';
-
-Object.defineProperty(every$1, "__esModule", {
-  value: true
-});
-every$1.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/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/extent.js

@@ -1,41 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as extent$1 } from '../../../../../_virtual/extent.js';
-
-Object.defineProperty(extent$1, "__esModule", {
-  value: true
-});
-extent$1.default = extent;
-function extent(values, valueof) {
-  let min;
-  let max;
-  if (valueof === undefined) {
-    for (const value of values) {
-      if (value != null) {
-        if (min === undefined) {
-          if (value >= value) min = max = value;
-        } else {
-          if (min > value) min = value;
-          if (max < value) max = value;
-        }
-      }
-    }
-  } else {
-    let index = -1;
-    for (let value of values) {
-      if ((value = valueof(value, ++index, values)) != null) {
-        if (min === undefined) {
-          if (value >= value) min = max = value;
-        } else {
-          if (min > value) min = value;
-          if (max < value) max = value;
-        }
-      }
-    }
-  }
-  return [min, max];
-}

package/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/filter.js

@@ -1,23 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as filter$1 } from '../../../../../_virtual/filter.js';
-
-Object.defineProperty(filter$1, "__esModule", {
-  value: true
-});
-filter$1.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/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/fsum.js

@@ -1,85 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as fsum$1 } from '../../../../../_virtual/fsum.js';
-
-Object.defineProperty(fsum$1, "__esModule", {
-  value: true
-});
-fsum$1.Adder = void 0;
-fsum$1.fcumsum = fcumsum;
-fsum$1.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);
-      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;
-    if (n > 0) {
-      hi = p[--n];
-      while (n > 0) {
-        x = hi;
-        y = p[--n];
-        hi = x + y;
-        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;
-  }
-}
-fsum$1.Adder = Adder;
-function fsum(values, valueof) {
-  const adder = new Adder();
-  if (valueof === undefined) {
-    for (let value of values) {
-      if (value = +value) {
-        adder.add(value);
-      }
-    }
-  } 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;
-  return Float64Array.from(values, valueof === undefined ? v => adder.add(+v || 0) : v => adder.add(+valueof(v, ++index, values) || 0));
-}
-
-export { fsum$1 as default };

package/dist/esm/node_modules/victory-vendor/lib-vendor/d3-array/src/greatest.js

@@ -1,39 +0,0 @@
-/*
- * UMWD-Components
- * @copyright Jelle Paulus
- * @license MIT
- */
-  
-import { __exports as greatest$1 } from '../../../../../_virtual/greatest.js';
-import './ascending.js';
-import { __exports as ascending } from '../../../../../_virtual/ascending2.js';
-
-Object.defineProperty(greatest$1, "__esModule", {
-  value: true
-});
-greatest$1.default = greatest;
-var _ascending = _interopRequireDefault(ascending);
-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;
-        defined = true;
-      }
-    }
-  } else {
-    for (const value of values) {
-      if (defined ? compare(value, max) > 0 : compare(value, value) === 0) {
-        max = value;
-        defined = true;
-      }
-    }
-  }
-  return max;
-}