victory-vendor 36.4.0 → 36.6.0

package/CHANGELOG.md

@@ -0,0 +1,11 @@
+# victory-vendor
+
+## 36.6.0
+
+### Patch Changes
+
+- Update source code with minor lint-based improvements (see [#2236](https://github.com/FormidableLabs/victory/issues/2236)). ([#2403](https://github.com/FormidableLabs/victory/pull/2403))
+
+## 36.5.3 and earlier
+
+Change history for version 36.5.3 and earlier can be found in our root [CHANGELOG.md](https://github.com/FormidableLabs/victory/blob/main/CHANGELOG.md).

package/d3-array.d.ts

@@ -0,0 +1,5 @@
+
+// `victory-vendor/d3-array` (TypeScript)
+//
+// Export the type definitions for this package:
+export * from "@types/d3-array";

package/d3-ease.d.ts

@@ -0,0 +1,5 @@
+
+// `victory-vendor/d3-ease` (TypeScript)
+//
+// Export the type definitions for this package:
+export * from "@types/d3-ease";

package/d3-interpolate.d.ts

@@ -0,0 +1,5 @@
+
+// `victory-vendor/d3-interpolate` (TypeScript)
+//
+// Export the type definitions for this package:
+export * from "@types/d3-interpolate";

package/d3-scale.d.ts

@@ -0,0 +1,5 @@
+
+// `victory-vendor/d3-scale` (TypeScript)
+//
+// Export the type definitions for this package:
+export * from "@types/d3-scale";

package/d3-shape.d.ts

@@ -0,0 +1,5 @@
+
+// `victory-vendor/d3-shape` (TypeScript)
+//
+// Export the type definitions for this package:
+export * from "@types/d3-shape";

package/d3-time.d.ts

@@ -0,0 +1,5 @@
+
+// `victory-vendor/d3-time` (TypeScript)
+//
+// Export the type definitions for this package:
+export * from "@types/d3-time";

package/d3-timer.d.ts

@@ -0,0 +1,5 @@
+
+// `victory-vendor/d3-timer` (TypeScript)
+//
+// Export the type definitions for this package:
+export * from "@types/d3-timer";

package/es/d3-voronoi.js

@@ -0,0 +1,6 @@
+
+// `victory-vendor/d3-voronoi` (ESM)
+// See upstream license: https://github.com/d3/d3-voronoi/blob/main/LICENSE
+//
+// Our ESM package uses the underlying installed dependencies of `node_modules/d3-voronoi`
+export * from "d3-voronoi";

package/lib/d3-voronoi.js

@@ -0,0 +1,6 @@
+
+// `victory-vendor/d3-voronoi` (CommonJS)
+// See upstream license: https://github.com/d3/d3-voronoi/blob/main/LICENSE
+//
+// Our CommonJS package relies on transpiled vendor files in `lib-vendor/d3-voronoi`
+module.exports = require("../lib-vendor/d3-voronoi/src/index.js");

package/lib-vendor/d3-voronoi/LICENSE

@@ -0,0 +1,50 @@
+Copyright 2010-2016 Mike Bostock
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+* Neither the name of the author nor the names of contributors may be used to
+  endorse or promote products derived from this software without specific prior
+  written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+Copyright (C) 2010-2013 Raymond Hill
+https://github.com/gorhill/Javascript-Voronoi
+
+Licensed under The MIT License
+http://en.wikipedia.org/wiki/MIT_License
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/lib-vendor/d3-voronoi/src/Beach.js

@@ -0,0 +1,197 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addBeach = addBeach;
+exports.removeBeach = removeBeach;
+
+var _RedBlackTree = require("./RedBlackTree");
+
+var _Cell = require("./Cell");
+
+var _Circle = require("./Circle");
+
+var _Edge = require("./Edge");
+
+var _Diagram = require("./Diagram");
+
+var beachPool = [];
+
+function Beach() {
+  (0, _RedBlackTree.RedBlackNode)(this);
+  this.edge = this.site = this.circle = null;
+}
+
+function createBeach(site) {
+  var beach = beachPool.pop() || new Beach();
+  beach.site = site;
+  return beach;
+}
+
+function detachBeach(beach) {
+  (0, _Circle.detachCircle)(beach);
+
+  _Diagram.beaches.remove(beach);
+
+  beachPool.push(beach);
+  (0, _RedBlackTree.RedBlackNode)(beach);
+}
+
+function removeBeach(beach) {
+  var circle = beach.circle,
+      x = circle.x,
+      y = circle.cy,
+      vertex = [x, y],
+      previous = beach.P,
+      next = beach.N,
+      disappearing = [beach];
+  detachBeach(beach);
+  var lArc = previous;
+
+  while (lArc.circle && Math.abs(x - lArc.circle.x) < _Diagram.epsilon && Math.abs(y - lArc.circle.cy) < _Diagram.epsilon) {
+    previous = lArc.P;
+    disappearing.unshift(lArc);
+    detachBeach(lArc);
+    lArc = previous;
+  }
+
+  disappearing.unshift(lArc);
+  (0, _Circle.detachCircle)(lArc);
+  var rArc = next;
+
+  while (rArc.circle && Math.abs(x - rArc.circle.x) < _Diagram.epsilon && Math.abs(y - rArc.circle.cy) < _Diagram.epsilon) {
+    next = rArc.N;
+    disappearing.push(rArc);
+    detachBeach(rArc);
+    rArc = next;
+  }
+
+  disappearing.push(rArc);
+  (0, _Circle.detachCircle)(rArc);
+  var nArcs = disappearing.length,
+      iArc;
+
+  for (iArc = 1; iArc < nArcs; ++iArc) {
+    rArc = disappearing[iArc];
+    lArc = disappearing[iArc - 1];
+    (0, _Edge.setEdgeEnd)(rArc.edge, lArc.site, rArc.site, vertex);
+  }
+
+  lArc = disappearing[0];
+  rArc = disappearing[nArcs - 1];
+  rArc.edge = (0, _Edge.createEdge)(lArc.site, rArc.site, null, vertex);
+  (0, _Circle.attachCircle)(lArc);
+  (0, _Circle.attachCircle)(rArc);
+}
+
+function addBeach(site) {
+  var x = site[0],
+      directrix = site[1],
+      lArc,
+      rArc,
+      dxl,
+      dxr,
+      node = _Diagram.beaches._;
+
+  while (node) {
+    dxl = leftBreakPoint(node, directrix) - x;
+    if (dxl > _Diagram.epsilon) node = node.L;else {
+      dxr = x - rightBreakPoint(node, directrix);
+
+      if (dxr > _Diagram.epsilon) {
+        if (!node.R) {
+          lArc = node;
+          break;
+        }
+
+        node = node.R;
+      } else {
+        if (dxl > -_Diagram.epsilon) {
+          lArc = node.P;
+          rArc = node;
+        } else if (dxr > -_Diagram.epsilon) {
+          lArc = node;
+          rArc = node.N;
+        } else {
+          lArc = rArc = node;
+        }
+
+        break;
+      }
+    }
+  }
+
+  (0, _Cell.createCell)(site);
+  var newArc = createBeach(site);
+
+  _Diagram.beaches.insert(lArc, newArc);
+
+  if (!lArc && !rArc) return;
+
+  if (lArc === rArc) {
+    (0, _Circle.detachCircle)(lArc);
+    rArc = createBeach(lArc.site);
+
+    _Diagram.beaches.insert(newArc, rArc);
+
+    newArc.edge = rArc.edge = (0, _Edge.createEdge)(lArc.site, newArc.site);
+    (0, _Circle.attachCircle)(lArc);
+    (0, _Circle.attachCircle)(rArc);
+    return;
+  }
+
+  if (!rArc) {
+    // && lArc
+    newArc.edge = (0, _Edge.createEdge)(lArc.site, newArc.site);
+    return;
+  } // else lArc !== rArc
+
+
+  (0, _Circle.detachCircle)(lArc);
+  (0, _Circle.detachCircle)(rArc);
+  var lSite = lArc.site,
+      ax = lSite[0],
+      ay = lSite[1],
+      bx = site[0] - ax,
+      by = site[1] - ay,
+      rSite = rArc.site,
+      cx = rSite[0] - ax,
+      cy = rSite[1] - ay,
+      d = 2 * (bx * cy - by * cx),
+      hb = bx * bx + by * by,
+      hc = cx * cx + cy * cy,
+      vertex = [(cy * hb - by * hc) / d + ax, (bx * hc - cx * hb) / d + ay];
+  (0, _Edge.setEdgeEnd)(rArc.edge, lSite, rSite, vertex);
+  newArc.edge = (0, _Edge.createEdge)(lSite, site, null, vertex);
+  rArc.edge = (0, _Edge.createEdge)(site, rSite, null, vertex);
+  (0, _Circle.attachCircle)(lArc);
+  (0, _Circle.attachCircle)(rArc);
+}
+
+function leftBreakPoint(arc, directrix) {
+  var site = arc.site,
+      rfocx = site[0],
+      rfocy = site[1],
+      pby2 = rfocy - directrix;
+  if (!pby2) return rfocx;
+  var lArc = arc.P;
+  if (!lArc) return -Infinity;
+  site = lArc.site;
+  var lfocx = site[0],
+      lfocy = site[1],
+      plby2 = lfocy - directrix;
+  if (!plby2) return lfocx;
+  var hl = lfocx - rfocx,
+      aby2 = 1 / pby2 - 1 / plby2,
+      b = hl / plby2;
+  if (aby2) return (-b + Math.sqrt(b * b - 2 * aby2 * (hl * hl / (-2 * plby2) - lfocy + plby2 / 2 + rfocy - pby2 / 2))) / aby2 + rfocx;
+  return (rfocx + lfocx) / 2;
+}
+
+function rightBreakPoint(arc, directrix) {
+  var rArc = arc.N;
+  if (rArc) return leftBreakPoint(rArc, directrix);
+  var site = arc.site;
+  return site[1] === directrix ? site[0] : Infinity;
+}

package/lib-vendor/d3-voronoi/src/Cell.js

@@ -0,0 +1,140 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cellHalfedgeEnd = cellHalfedgeEnd;
+exports.cellHalfedgeStart = cellHalfedgeStart;
+exports.clipCells = clipCells;
+exports.createCell = createCell;
+exports.sortCellHalfedges = sortCellHalfedges;
+
+var _Edge = require("./Edge");
+
+var _Diagram = require("./Diagram");
+
+function createCell(site) {
+  return _Diagram.cells[site.index] = {
+    site: site,
+    halfedges: []
+  };
+}
+
+function cellHalfedgeAngle(cell, edge) {
+  var site = cell.site,
+      va = edge.left,
+      vb = edge.right;
+  if (site === vb) vb = va, va = site;
+  if (vb) return Math.atan2(vb[1] - va[1], vb[0] - va[0]);
+  if (site === va) va = edge[1], vb = edge[0];else va = edge[0], vb = edge[1];
+  return Math.atan2(va[0] - vb[0], vb[1] - va[1]);
+}
+
+function cellHalfedgeStart(cell, edge) {
+  return edge[+(edge.left !== cell.site)];
+}
+
+function cellHalfedgeEnd(cell, edge) {
+  return edge[+(edge.left === cell.site)];
+}
+
+function sortCellHalfedges() {
+  for (var i = 0, n = _Diagram.cells.length, cell, halfedges, j, m; i < n; ++i) {
+    if ((cell = _Diagram.cells[i]) && (m = (halfedges = cell.halfedges).length)) {
+      var index = new Array(m),
+          array = new Array(m);
+
+      for (j = 0; j < m; ++j) index[j] = j, array[j] = cellHalfedgeAngle(cell, _Diagram.edges[halfedges[j]]);
+
+      index.sort(function (i, j) {
+        return array[j] - array[i];
+      });
+
+      for (j = 0; j < m; ++j) array[j] = halfedges[index[j]];
+
+      for (j = 0; j < m; ++j) halfedges[j] = array[j];
+    }
+  }
+}
+
+function clipCells(x0, y0, x1, y1) {
+  var nCells = _Diagram.cells.length,
+      iCell,
+      cell,
+      site,
+      iHalfedge,
+      halfedges,
+      nHalfedges,
+      start,
+      startX,
+      startY,
+      end,
+      endX,
+      endY,
+      cover = true;
+
+  for (iCell = 0; iCell < nCells; ++iCell) {
+    if (cell = _Diagram.cells[iCell]) {
+      site = cell.site;
+      halfedges = cell.halfedges;
+      iHalfedge = halfedges.length; // Remove any dangling clipped edges.
+
+      while (iHalfedge--) {
+        if (!_Diagram.edges[halfedges[iHalfedge]]) {
+          halfedges.splice(iHalfedge, 1);
+        }
+      } // Insert any border edges as necessary.
+
+
+      iHalfedge = 0, nHalfedges = halfedges.length;
+
+      while (iHalfedge < nHalfedges) {
+        end = cellHalfedgeEnd(cell, _Diagram.edges[halfedges[iHalfedge]]), endX = end[0], endY = end[1];
+        start = cellHalfedgeStart(cell, _Diagram.edges[halfedges[++iHalfedge % nHalfedges]]), startX = start[0], startY = start[1];
+
+        if (Math.abs(endX - startX) > _Diagram.epsilon || Math.abs(endY - startY) > _Diagram.epsilon) {
+          halfedges.splice(iHalfedge, 0, _Diagram.edges.push((0, _Edge.createBorderEdge)(site, end, Math.abs(endX - x0) < _Diagram.epsilon && y1 - endY > _Diagram.epsilon ? [x0, Math.abs(startX - x0) < _Diagram.epsilon ? startY : y1] : Math.abs(endY - y1) < _Diagram.epsilon && x1 - endX > _Diagram.epsilon ? [Math.abs(startY - y1) < _Diagram.epsilon ? startX : x1, y1] : Math.abs(endX - x1) < _Diagram.epsilon && endY - y0 > _Diagram.epsilon ? [x1, Math.abs(startX - x1) < _Diagram.epsilon ? startY : y0] : Math.abs(endY - y0) < _Diagram.epsilon && endX - x0 > _Diagram.epsilon ? [Math.abs(startY - y0) < _Diagram.epsilon ? startX : x0, y0] : null)) - 1);
+          ++nHalfedges;
+        }
+      }
+
+      if (nHalfedges) cover = false;
+    }
+  } // If there weren’t any edges, have the closest site cover the extent.
+  // It doesn’t matter which corner of the extent we measure!
+
+
+  if (cover) {
+    var dx,
+        dy,
+        d2,
+        dc = Infinity;
+
+    for (iCell = 0, cover = null; iCell < nCells; ++iCell) {
+      if (cell = _Diagram.cells[iCell]) {
+        site = cell.site;
+        dx = site[0] - x0;
+        dy = site[1] - y0;
+        d2 = dx * dx + dy * dy;
+        if (d2 < dc) dc = d2, cover = cell;
+      }
+    }
+
+    if (cover) {
+      var v00 = [x0, y0],
+          v01 = [x0, y1],
+          v11 = [x1, y1],
+          v10 = [x1, y0];
+      cover.halfedges.push(_Diagram.edges.push((0, _Edge.createBorderEdge)(site = cover.site, v00, v01)) - 1, _Diagram.edges.push((0, _Edge.createBorderEdge)(site, v01, v11)) - 1, _Diagram.edges.push((0, _Edge.createBorderEdge)(site, v11, v10)) - 1, _Diagram.edges.push((0, _Edge.createBorderEdge)(site, v10, v00)) - 1);
+    }
+  } // Lastly delete any cells with no edges; these were entirely clipped.
+
+
+  for (iCell = 0; iCell < nCells; ++iCell) {
+    if (cell = _Diagram.cells[iCell]) {
+      if (!cell.halfedges.length) {
+        delete _Diagram.cells[iCell];
+      }
+    }
+  }
+}

package/lib-vendor/d3-voronoi/src/Circle.js

@@ -0,0 +1,84 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.attachCircle = attachCircle;
+exports.detachCircle = detachCircle;
+exports.firstCircle = void 0;
+
+var _RedBlackTree = require("./RedBlackTree");
+
+var _Diagram = require("./Diagram");
+
+var circlePool = [];
+var firstCircle;
+exports.firstCircle = firstCircle;
+
+function Circle() {
+  (0, _RedBlackTree.RedBlackNode)(this);
+  this.x = this.y = this.arc = this.site = this.cy = null;
+}
+
+function attachCircle(arc) {
+  var lArc = arc.P,
+      rArc = arc.N;
+  if (!lArc || !rArc) return;
+  var lSite = lArc.site,
+      cSite = arc.site,
+      rSite = rArc.site;
+  if (lSite === rSite) return;
+  var bx = cSite[0],
+      by = cSite[1],
+      ax = lSite[0] - bx,
+      ay = lSite[1] - by,
+      cx = rSite[0] - bx,
+      cy = rSite[1] - by;
+  var d = 2 * (ax * cy - ay * cx);
+  if (d >= -_Diagram.epsilon2) return;
+  var ha = ax * ax + ay * ay,
+      hc = cx * cx + cy * cy,
+      x = (cy * ha - ay * hc) / d,
+      y = (ax * hc - cx * ha) / d;
+  var circle = circlePool.pop() || new Circle();
+  circle.arc = arc;
+  circle.site = cSite;
+  circle.x = x + bx;
+  circle.y = (circle.cy = y + by) + Math.sqrt(x * x + y * y); // y bottom
+
+  arc.circle = circle;
+  var before = null,
+      node = _Diagram.circles._;
+
+  while (node) {
+    if (circle.y < node.y || circle.y === node.y && circle.x <= node.x) {
+      if (node.L) node = node.L;else {
+        before = node.P;
+        break;
+      }
+    } else {
+      if (node.R) node = node.R;else {
+        before = node;
+        break;
+      }
+    }
+  }
+
+  _Diagram.circles.insert(before, circle);
+
+  if (!before) exports.firstCircle = firstCircle = circle;
+}
+
+function detachCircle(arc) {
+  var circle = arc.circle;
+
+  if (circle) {
+    if (!circle.P) exports.firstCircle = firstCircle = circle.N;
+
+    _Diagram.circles.remove(circle);
+
+    circlePool.push(circle);
+    (0, _RedBlackTree.RedBlackNode)(circle);
+    arc.circle = null;
+  }
+}