plottable 3.13.0 → 4.0.0

package/build/src/utils/arrayUtils.js

@@ -4,8 +4,10 @@
  * @license MIT
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.createFilledArray = exports.flatten = exports.uniq = exports.add = void 0;
-var d3 = require("d3");
+exports.add = add;
+exports.uniq = uniq;
+exports.flatten = flatten;
+exports.createFilledArray = createFilledArray;
 var nativeArray = window.Array;
 /**
  * Takes two arrays of numbers and adds them together
@@ -20,7 +22,6 @@ function add(aList, bList) {
     }
     return aList.map(function (_, i) { return aList[i] + bList[i]; });
 }
-exports.add = add;
 /**
  * Take an array of values, and return the unique values.
  * Will work iff ∀ a, b, a.toString() == b.toString() => a == b; will break on Object inputs
@@ -29,7 +30,7 @@ exports.add = add;
  * @return {T[]} The unique values
  */
 function uniq(arr) {
-    var seen = d3.set();
+    var seen = new Set();
     var result = [];
     arr.forEach(function (x) {
         if (!seen.has(String(x))) {
@@ -39,7 +40,6 @@ function uniq(arr) {
     });
     return result;
 }
-exports.uniq = uniq;
 /**
  * @param {T[][]} a The 2D array that will have its elements joined together.
  * @return {T[]} Every array in a, concatenated together in the order they appear.
@@ -47,7 +47,6 @@ exports.uniq = uniq;
 function flatten(a) {
     return nativeArray.prototype.concat.apply([], a);
 }
-exports.flatten = flatten;
 /**
  * Creates an array of length `count`, filled with value or (if value is a function), value()
  *
@@ -62,4 +61,3 @@ function createFilledArray(value, count) {
     }
     return out;
 }
-exports.createFilledArray = createFilledArray;

package/build/src/utils/callbackSet.js

@@ -13,7 +13,7 @@ var set_1 = require("./set");
  * All callbacks should have the same signature.
  */
 var CallbackSet = /** @class */ (function (_super) {
-    (0, tslib_1.__extends)(CallbackSet, _super);
+    tslib_1.__extends(CallbackSet, _super);
     function CallbackSet() {
         return _super !== null && _super.apply(this, arguments) || this;
     }

package/build/src/utils/coerceD3.js

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.coerceExternalD3 = void 0;
+exports.coerceExternalD3 = coerceExternalD3;
 var d3 = require("d3");
 /**
  * Coerce possibly external d3 instance into our own instance of d3 so we can use d3-selection-multi.
@@ -28,4 +28,3 @@ function coerceExternalD3(externalD3Selection) {
         return externalD3Selection;
     }
 }
-exports.coerceExternalD3 = coerceExternalD3;

package/build/src/utils/colorUtils.js

@@ -4,7 +4,9 @@
  * @license MIT
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.colorTest = exports.lightenColor = exports.contrast = void 0;
+exports.contrast = contrast;
+exports.lightenColor = lightenColor;
+exports.colorTest = colorTest;
 var d3 = require("d3");
 var nativeMath = window.Math;
 /**
@@ -19,7 +21,6 @@ function contrast(a, b) {
     var l2 = luminance(b) + 0.05;
     return l1 > l2 ? l1 / l2 : l2 / l1;
 }
-exports.contrast = contrast;
 /**
  * Returns a brighter copy of this color. Each channel is multiplied by 0.7 ^ -factor.
  * Channel values are capped at the maximum value of 255, and the minimum value of 30.
@@ -28,7 +29,6 @@ function lightenColor(color, factor) {
     var brightened = d3.color(color).brighter(factor);
     return brightened.rgb().toString();
 }
-exports.lightenColor = lightenColor;
 /**
  * Gets the Hex Code of the color resulting by applying the className CSS class to the
  * colorTester selection. Returns null if the tester is transparent.
@@ -62,7 +62,6 @@ function colorTest(colorTester, className) {
     colorTester.classed(className, false);
     return hexCode;
 }
-exports.colorTest = colorTest;
 /**
  * Return relative luminance (defined here: http://www.w3.org/TR/2008/REC-WCAG20-20081211/#relativeluminancedef)
  * Based on implementation from chroma.js by Gregor Aisch (gka) (licensed under BSD)

package/build/src/utils/d3ShapeUtils.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Copyright 2014-present Palantir Technologies
+ * @license MIT
+ */
+/**
+ * Preserve full-precision SVG paths with d3-shape 3.2+, which rounds by default.
+ * Earlier versions have no digits() method and already use full precision.
+ */
+export declare function withFullPrecision<T extends {
+    digits?: (digits: number | null) => unknown;
+}>(generator: T): T;

package/build/src/utils/d3ShapeUtils.js

@@ -0,0 +1,17 @@
+"use strict";
+/**
+ * Copyright 2014-present Palantir Technologies
+ * @license MIT
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.withFullPrecision = withFullPrecision;
+/**
+ * Preserve full-precision SVG paths with d3-shape 3.2+, which rounds by default.
+ * Earlier versions have no digits() method and already use full precision.
+ */
+function withFullPrecision(generator) {
+    if (typeof generator.digits === "function") {
+        generator.digits(null);
+    }
+    return generator;
+}

package/build/src/utils/domUtils.js

@@ -4,7 +4,22 @@
  * @license MIT
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getElementTransform = exports.getHtmlElementAncestors = exports.intersectsBBox = exports.clientRectInside = exports.expandRect = exports.clientRectsOverlap = exports.getScaleValues = exports.getRotate = exports.getTranslateValues = exports.elementHeight = exports.elementWidth = exports.requestAnimationFramePolyfill = exports.SCREEN_REFRESH_RATE_MILLISECONDS = exports.entityBounds = exports.elementBBox = exports.contains = void 0;
+exports.SCREEN_REFRESH_RATE_MILLISECONDS = void 0;
+exports.contains = contains;
+exports.elementBBox = elementBBox;
+exports.entityBounds = entityBounds;
+exports.requestAnimationFramePolyfill = requestAnimationFramePolyfill;
+exports.elementWidth = elementWidth;
+exports.elementHeight = elementHeight;
+exports.getTranslateValues = getTranslateValues;
+exports.getRotate = getRotate;
+exports.getScaleValues = getScaleValues;
+exports.clientRectsOverlap = clientRectsOverlap;
+exports.expandRect = expandRect;
+exports.clientRectInside = clientRectInside;
+exports.intersectsBBox = intersectsBBox;
+exports.getHtmlElementAncestors = getHtmlElementAncestors;
+exports.getElementTransform = getElementTransform;
 var d3 = require("d3");
 var nativeMath = window.Math;
 /**
@@ -17,7 +32,6 @@ function contains(parent, child) {
     }
     return maybeParent === parent;
 }
-exports.contains = contains;
 /**
  * Gets the bounding box of an element.
  * @param {d3.Selection} element
@@ -34,7 +48,6 @@ function elementBBox(element) {
     }
     return bbox;
 }
-exports.elementBBox = elementBBox;
 function entityBounds(element) {
     if (element instanceof SVGElement) {
         return elementBBox(d3.select(element));
@@ -47,7 +60,6 @@ function entityBounds(element) {
         return { x: 0, y: 0, width: 0, height: 0 };
     }
 }
-exports.entityBounds = entityBounds;
 /**
  * Screen refresh rate which is assumed to be 60fps
  */
@@ -67,7 +79,6 @@ function requestAnimationFramePolyfill(callback) {
         setTimeout(callback, exports.SCREEN_REFRESH_RATE_MILLISECONDS);
     }
 }
-exports.requestAnimationFramePolyfill = requestAnimationFramePolyfill;
 /**
  * Calculates the width of the element.
  * The width includes the padding and the border on the element's left and right sides.
@@ -86,7 +97,6 @@ function elementWidth(elementOrSelection) {
         + _parseStyleValue(style, "border-left-width")
         + _parseStyleValue(style, "border-right-width");
 }
-exports.elementWidth = elementWidth;
 /**
  * Calculates the height of the element.
  * The height includes the padding the and the border on the element's top and bottom sides.
@@ -105,14 +115,13 @@ function elementHeight(elementOrSelection) {
         + _parseStyleValue(style, "border-top-width")
         + _parseStyleValue(style, "border-bottom-width");
 }
-exports.elementHeight = elementHeight;
 // taken from the BNF at https://www.w3.org/TR/SVG/coords.html
 var WSP = "\\s";
 var NUMBER = "(?:[-+]?[0-9]*\\.?[0-9]+)";
-var COMMA_WSP = "(?:(?:" + WSP + "+,?" + WSP + "*)|(?:," + WSP + "*))";
-var TRANSLATE_REGEX = new RegExp("translate" + WSP + "*\\(" + WSP + "*(" + NUMBER + ")(?:" + COMMA_WSP + "(" + NUMBER + "))?" + WSP + "*\\)");
-var ROTATE_REGEX = new RegExp("rotate" + WSP + "*\\(" + WSP + "*(" + NUMBER + ")" + WSP + "*\\)");
-var SCALE_REGEX = new RegExp("scale" + WSP + "*\\(" + WSP + "*(" + NUMBER + ")(?:" + COMMA_WSP + "(" + NUMBER + "))?" + WSP + "*\\)");
+var COMMA_WSP = "(?:(?:".concat(WSP, "+,?").concat(WSP, "*)|(?:,").concat(WSP, "*))");
+var TRANSLATE_REGEX = new RegExp("translate".concat(WSP, "*\\(").concat(WSP, "*(").concat(NUMBER, ")(?:").concat(COMMA_WSP, "(").concat(NUMBER, "))?").concat(WSP, "*\\)"));
+var ROTATE_REGEX = new RegExp("rotate".concat(WSP, "*\\(").concat(WSP, "*(").concat(NUMBER, ")").concat(WSP, "*\\)"));
+var SCALE_REGEX = new RegExp("scale".concat(WSP, "*\\(").concat(WSP, "*(").concat(NUMBER, ")(?:").concat(COMMA_WSP, "(").concat(NUMBER, "))?").concat(WSP, "*\\)"));
 /**
  * Accepts selections whose .transform contain a "translate(a, b)" and extracts the a and b
  */
@@ -126,7 +135,6 @@ function getTranslateValues(el) {
         return [0, 0];
     }
 }
-exports.getTranslateValues = getTranslateValues;
 /**
  * Accepts selections whose .transform contain a "rotate(angle)" and returns the angle
  */
@@ -140,7 +148,6 @@ function getRotate(el) {
         return 0;
     }
 }
-exports.getRotate = getRotate;
 function getScaleValues(el) {
     var match = SCALE_REGEX.exec(el.attr("transform"));
     if (match != null) {
@@ -151,7 +158,6 @@ function getScaleValues(el) {
         return [0, 0];
     }
 }
-exports.getScaleValues = getScaleValues;
 /**
  * Checks if the first ClientRect overlaps the second.
  *
@@ -174,7 +180,6 @@ function clientRectsOverlap(clientRectA, clientRectB) {
     }
     return true;
 }
-exports.clientRectsOverlap = clientRectsOverlap;
 /**
  * Return a new ClientRect that is the old ClientRect expanded by amount in all directions.
  * @param rect
@@ -190,7 +195,6 @@ function expandRect(rect, amount) {
         height: rect.height + amount * 2,
     };
 }
-exports.expandRect = expandRect;
 /**
  * Returns true if and only if innerClientRect is inside outerClientRect.
  *
@@ -204,7 +208,6 @@ function clientRectInside(innerClientRect, outerClientRect) {
         nativeMath.floor(innerClientRect.right) <= nativeMath.ceil(outerClientRect.right) &&
         nativeMath.floor(innerClientRect.bottom) <= nativeMath.ceil(outerClientRect.bottom));
 }
-exports.clientRectInside = clientRectInside;
 /**
  * Returns true if the supplied coordinates or Ranges intersect or are contained by bbox.
  *
@@ -230,7 +233,6 @@ function intersectsBBox(xValOrRange, yValOrRange, bbox, tolerance) {
         bbox.y + bbox.height >= yRange.min - tolerance &&
         bbox.y <= yRange.max + tolerance;
 }
-exports.intersectsBBox = intersectsBBox;
 /**
  * Create a Range from a number or an object with "min" and "max" defined.
  *
@@ -266,7 +268,6 @@ function getHtmlElementAncestors(elem) {
     }
     return elems;
 }
-exports.getHtmlElementAncestors = getHtmlElementAncestors;
 /**
  * Returns the `ICssTransformMatrix` of an element, if defined in its computed
  * style. Returns `null` if there is no transform on the element.
@@ -280,7 +281,6 @@ function getElementTransform(elem) {
         style.getPropertyValue("transform");
     return parseTransformMatrix(transform);
 }
-exports.getElementTransform = getElementTransform;
 var _MATRIX_REGEX = /^matrix\(([^)]+)\)$/;
 var _SPLIT_REGEX = /[, ]+/;
 /**

package/build/src/utils/index.js

@@ -20,11 +20,11 @@ var Stacking = require("./stackingUtils");
 exports.Stacking = Stacking;
 var Window = require("./windowUtils");
 exports.Window = Window;
-(0, tslib_1.__exportStar)(require("./bucket"), exports);
-(0, tslib_1.__exportStar)(require("./callbackSet"), exports);
-(0, tslib_1.__exportStar)(require("./coerceD3"), exports);
-(0, tslib_1.__exportStar)(require("./entityStore"), exports);
-(0, tslib_1.__exportStar)(require("./map"), exports);
-(0, tslib_1.__exportStar)(require("./objectUtils"), exports);
-(0, tslib_1.__exportStar)(require("./set"), exports);
-(0, tslib_1.__exportStar)(require("./transformAwareTranslator"), exports);
+tslib_1.__exportStar(require("./bucket"), exports);
+tslib_1.__exportStar(require("./callbackSet"), exports);
+tslib_1.__exportStar(require("./coerceD3"), exports);
+tslib_1.__exportStar(require("./entityStore"), exports);
+tslib_1.__exportStar(require("./map"), exports);
+tslib_1.__exportStar(require("./objectUtils"), exports);
+tslib_1.__exportStar(require("./set"), exports);
+tslib_1.__exportStar(require("./transformAwareTranslator"), exports);

package/build/src/utils/makeEnum.js

@@ -4,11 +4,10 @@
  * @license MIT
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.makeEnum = void 0;
+exports.makeEnum = makeEnum;
 function makeEnum(values) {
     return values.reduce(function (obj, v) {
         obj[v] = v;
         return obj;
     }, {});
 }
-exports.makeEnum = makeEnum;

package/build/src/utils/mathUtils.d.ts

@@ -19,8 +19,8 @@ import { Bounds, Point } from "../core/interfaces";
  *
  * https://developer.mozilla.org/en-US/docs/Web/CSS/transform-function/matrix
  */
-export declare type ICssTransformMatrix = [number, number, number, number, number, number];
-export declare type ITranslateVector = [number, number];
+export type ICssTransformMatrix = [number, number, number, number, number, number];
+export type ITranslateVector = [number, number];
 /**
  * Checks if x is between a and b.
  *

package/build/src/utils/mathUtils.js

@@ -4,7 +4,23 @@
  * @license MIT
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.applyTransform = exports.invertMatrix = exports.multiplyTranslate = exports.premultiplyTranslate = exports.multiplyMatrix = exports.getCumulativeTransform = exports.boundsIntersects = exports.within = exports.degreesToRadians = exports.distanceSquared = exports.range = exports.isValidNumber = exports.isNaN = exports.min = exports.max = exports.clamp = exports.inRange = void 0;
+exports.inRange = inRange;
+exports.clamp = clamp;
+exports.max = max;
+exports.min = min;
+exports.isNaN = isNaN;
+exports.isValidNumber = isValidNumber;
+exports.range = range;
+exports.distanceSquared = distanceSquared;
+exports.degreesToRadians = degreesToRadians;
+exports.within = within;
+exports.boundsIntersects = boundsIntersects;
+exports.getCumulativeTransform = getCumulativeTransform;
+exports.multiplyMatrix = multiplyMatrix;
+exports.premultiplyTranslate = premultiplyTranslate;
+exports.multiplyTranslate = multiplyTranslate;
+exports.invertMatrix = invertMatrix;
+exports.applyTransform = applyTransform;
 var d3 = require("d3");
 var domUtils_1 = require("./domUtils");
 var nativeMath = window.Math;
@@ -20,7 +36,6 @@ var _IDENTITY_TRANSFORM = [1, 0, 0, 1, 0, 0];
 function inRange(x, a, b) {
     return (nativeMath.min(a, b) <= x && x <= nativeMath.max(a, b));
 }
-exports.inRange = inRange;
 /**
  * Clamps x to the range [min, max].
  *
@@ -32,28 +47,24 @@ exports.inRange = inRange;
 function clamp(x, min, max) {
     return nativeMath.min(nativeMath.max(min, x), max);
 }
-exports.clamp = clamp;
 function max(array, firstArg, secondArg) {
     var accessor = typeof (firstArg) === "function" ? firstArg : null;
     var defaultValue = accessor == null ? firstArg : secondArg;
     var maxValue = accessor == null ? d3.max(array) : d3.max(array, accessor);
     return maxValue !== undefined ? maxValue : defaultValue;
 }
-exports.max = max;
 function min(array, firstArg, secondArg) {
     var accessor = typeof (firstArg) === "function" ? firstArg : null;
     var defaultValue = accessor == null ? firstArg : secondArg;
     var minValue = accessor == null ? d3.min(array) : d3.min(array, accessor);
     return minValue !== undefined ? minValue : defaultValue;
 }
-exports.min = min;
 /**
  * Returns true **only** if x is NaN
  */
 function isNaN(n) {
     return n !== n;
 }
-exports.isNaN = isNaN;
 /**
  * Returns true if the argument is a number, which is not NaN
  * Numbers represented as strings do not pass this function
@@ -61,7 +72,6 @@ exports.isNaN = isNaN;
 function isValidNumber(n) {
     return typeof n === "number" && n - n < 1;
 }
-exports.isValidNumber = isValidNumber;
 /**
  * Generates an array of consecutive, strictly increasing numbers
  * in the range [start, stop) separeted by step
@@ -78,7 +88,6 @@ function range(start, stop, step) {
     }
     return range;
 }
-exports.range = range;
 /**
  * Returns the square of the distance between two points
  *
@@ -89,11 +98,9 @@ exports.range = range;
 function distanceSquared(p1, p2) {
     return nativeMath.pow(p2.y - p1.y, 2) + nativeMath.pow(p2.x - p1.x, 2);
 }
-exports.distanceSquared = distanceSquared;
 function degreesToRadians(degree) {
     return degree / 360 * nativeMath.PI * 2;
 }
-exports.degreesToRadians = degreesToRadians;
 /**
  * Returns if the point is within the bounds. Points along
  * the bounds are considered "within" as well.
@@ -106,7 +113,6 @@ function within(p, bounds) {
         && bounds.topLeft.y <= p.y
         && bounds.bottomRight.y >= p.y;
 }
-exports.within = within;
 /**
  * Returns whether the first bounds intersects the second bounds.
  * Pass primitive numbers directly for performance.
@@ -119,7 +125,6 @@ function boundsIntersects(aX, aY, aWidth, aHeight, bX, bY, bWidth, bHeight) {
         aY <= bY + bHeight &&
         bY <= aY + aHeight;
 }
-exports.boundsIntersects = boundsIntersects;
 /**
  * Returns a `ICssTransformMatrix` representing the cumulative transformation of
  * the element and all its parents. This transform converts from top-level
@@ -160,7 +165,6 @@ function getCumulativeTransform(element) {
     }
     return transform;
 }
-exports.getCumulativeTransform = getCumulativeTransform;
 /**
  * Straightforward matrix multiplication of homogenized css transform matrices.
  */
@@ -174,7 +178,6 @@ function multiplyMatrix(a, b) {
         a[1] * b[4] + a[3] * b[5] + a[5],
     ];
 }
-exports.multiplyMatrix = multiplyMatrix;
 /**
  * Prepends translation to transformation matrix.
  *
@@ -187,7 +190,6 @@ function premultiplyTranslate(v, b) {
         b[5] + v[1],
     ];
 }
-exports.premultiplyTranslate = premultiplyTranslate;
 /**
  * Appends translation to transformation matrix.
  *
@@ -200,7 +202,6 @@ function multiplyTranslate(a, v) {
         a[1] * v[0] + a[3] * v[1] + a[5],
     ];
 }
-exports.multiplyTranslate = multiplyTranslate;
 /**
  * Analytical inverse of a `ICssTransformMatrix` analogous to a non-singular
  * homogenous 3x3 matrix.
@@ -223,7 +224,6 @@ function invertMatrix(a) {
         inverseDeterminant * (a[1] * a[4] + -a[0] * a[5]),
     ];
 }
-exports.invertMatrix = invertMatrix;
 /**
  * Applies the `ICssTransformMatrix` to the `Point`.
  *
@@ -235,4 +235,3 @@ function applyTransform(a, p) {
         y: a[1] * p.x + a[3] * p.y + a[5],
     };
 }
-exports.applyTransform = applyTransform;

package/build/src/utils/objectUtils.js

@@ -4,7 +4,7 @@
  * @license MIT
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.assign = void 0;
+exports.assign = assign;
 /**
  * Polyfill for Object.assign
  */
@@ -24,4 +24,3 @@ function assign() {
     }
     return result;
 }
-exports.assign = assign;

package/build/src/utils/rTree.d.ts

@@ -19,7 +19,7 @@ export declare enum QueryPredicateResult {
  * Returns the absolute distance to the nearest point on the edge of bounds or 0
  * if the point is in bounds.
  */
-export declare type IDistanceFunction = (bounds: RTreeBounds, p: Point) => number;
+export type IDistanceFunction = (bounds: RTreeBounds, p: Point) => number;
 /**
  * Creates a node predicate for use with `RTree.queryNodes`
  *

package/build/src/utils/rTree.js

@@ -4,7 +4,9 @@
  * @license MIT
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.RTreeBounds = exports.RTreeNode = exports.RTree = exports.createNodeSort = exports.createMinimizingNodePredicate = exports.QueryPredicateResult = void 0;
+exports.RTreeBounds = exports.RTreeNode = exports.RTree = exports.QueryPredicateResult = void 0;
+exports.createMinimizingNodePredicate = createMinimizingNodePredicate;
+exports.createNodeSort = createNodeSort;
 var rTreeSplitStrategies_1 = require("./rTreeSplitStrategies");
 /**
  * The maximum number of children in an r-tree node before we attempt to split.
@@ -28,7 +30,7 @@ var QueryPredicateResult;
     QueryPredicateResult[QueryPredicateResult["PASS"] = 0] = "PASS";
     QueryPredicateResult[QueryPredicateResult["FAIL"] = 1] = "FAIL";
     QueryPredicateResult[QueryPredicateResult["PASS_AND_OVERWRITE"] = 2] = "PASS_AND_OVERWRITE";
-})(QueryPredicateResult = exports.QueryPredicateResult || (exports.QueryPredicateResult = {}));
+})(QueryPredicateResult || (exports.QueryPredicateResult = QueryPredicateResult = {}));
 /**
  * Creates a node predicate for use with `RTree.queryNodes`
  *
@@ -72,7 +74,6 @@ function createMinimizingNodePredicate(point, nearFn, farFn) {
         }
     };
 }
-exports.createMinimizingNodePredicate = createMinimizingNodePredicate;
 /**
  * Create a `Array.sort` function from a query point and a distance function.
  */
@@ -81,7 +82,6 @@ function createNodeSort(point, distanceFn) {
         return distanceFn(b.bounds, point) - distanceFn(a.bounds, point);
     };
 }
-exports.createNodeSort = createNodeSort;
 /**
  * R-Tree is a multidimensional spatial region tree. It stores entries that have
  * arbitrarily overlapping bounding boxes and supports efficient point and

package/build/src/utils/rTreeSplitStrategies.d.ts

@@ -3,7 +3,7 @@
  * @license MIT
  */
 import { RTreeNode } from "./rTree";
-export declare type NodePair<T> = [RTreeNode<T>, RTreeNode<T>];
+export type NodePair<T> = [RTreeNode<T>, RTreeNode<T>];
 export interface IRTreeSplitStrategy {
     split: <T>(entries: RTreeNode<T>[], nodes: NodePair<T>) => void;
 }

package/build/src/utils/stackingUtils.d.ts

@@ -6,7 +6,7 @@ import { Dataset } from "../core/dataset";
 import { IAccessor } from "../core/interfaces";
 import type { MemoizedFunction } from "lodash";
 import * as Utils from "./";
-export declare type GenericStackedDatum<D> = {
+export type GenericStackedDatum<D> = {
     value: number;
     offset: number;
     axisValue: D;
@@ -14,12 +14,12 @@ export declare type GenericStackedDatum<D> = {
     originalIndex: number;
     originalDataset: Dataset;
 };
-export declare type StackExtent<D> = {
+export type StackExtent<D> = {
     extent: number;
     axisValue: D;
     stackedDatum: GenericStackedDatum<D>;
 };
-export declare type StackedDatum = GenericStackedDatum<string>;
+export type StackedDatum = GenericStackedDatum<string>;
 /**
  * Option type for stacking direction. By default, stacked bar and area charts
  * put the first data series at the bottom of the axis ("bottomup"), but this
@@ -30,13 +30,13 @@ export declare const IStackingOrder: {
     topdown: "topdown";
     bottomup: "bottomup";
 };
-export declare type IStackingOrder = keyof typeof IStackingOrder;
-export declare type GenericStackingResult<D> = Utils.Map<Dataset, Utils.Map<string | number, GenericStackedDatum<D>>>;
+export type IStackingOrder = keyof typeof IStackingOrder;
+export type GenericStackingResult<D> = Utils.Map<Dataset, Utils.Map<string | number, GenericStackedDatum<D>>>;
 /**
  * Map of Dataset to stacks.
  * @deprecated
  */
-export declare type StackingResult = GenericStackingResult<string>;
+export type StackingResult = GenericStackingResult<string>;
 /**
  * Computes the StackingResult (value and offset) for each data point in each Dataset.
  *

package/build/src/utils/stackingUtils.js

@@ -4,8 +4,10 @@
  * @license MIT
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.normalizeKey = exports.stackedExtent = exports.stackedExtents = exports.stack = exports.IStackingOrder = void 0;
-var d3 = require("d3");
+exports.normalizeKey = exports.IStackingOrder = void 0;
+exports.stack = stack;
+exports.stackedExtents = stackedExtents;
+exports.stackedExtent = stackedExtent;
 var memoize_1 = require("lodash-es/memoize");
 var Utils = require("./");
 var makeEnum_1 = require("./makeEnum");
@@ -28,8 +30,8 @@ var nativeMath = window.Math;
  */
 function stack(datasets, keyAccessor, valueAccessor, stackingOrder) {
     if (stackingOrder === void 0) { stackingOrder = "bottomup"; }
-    var positiveOffsets = d3.map();
-    var negativeOffsets = d3.map();
+    var positiveOffsets = new Map();
+    var negativeOffsets = new Map();
     var datasetToKeyToStackedDatum = new Utils.Map();
     if (stackingOrder === "topdown") {
         datasets = datasets.slice();
@@ -68,7 +70,6 @@ function stack(datasets, keyAccessor, valueAccessor, stackingOrder) {
     }
     return datasetToKeyToStackedDatum;
 }
-exports.stack = stack;
 /**
  * Computes the maximum and minimum extents of each stack individually.
  *
@@ -102,7 +103,6 @@ function stackedExtents(stackingResult) {
     });
     return { maximumExtents: maximumExtents, minimumExtents: minimumExtents };
 }
-exports.stackedExtents = stackedExtents;
 /**
  * Computes the total extent over all data points in all Datasets, taking stacking into consideration.
  *
@@ -129,7 +129,6 @@ function stackedExtent(stackingResult, keyAccessor, filter) {
     var minStackExtent = Utils.Math.min(extents, 0);
     return [nativeMath.min(minStackExtent, 0), nativeMath.max(0, maxStackExtent)];
 }
-exports.stackedExtent = stackedExtent;
 /**
  * Normalizes a key used for stacking
  *

package/build/src/utils/transformAwareTranslator.js

@@ -4,7 +4,8 @@
  * @license MIT
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.Translator = exports.getTranslator = void 0;
+exports.Translator = void 0;
+exports.getTranslator = getTranslator;
 var Utils = require("../utils");
 var _TRANSLATOR_KEY = "__Plottable_ClientTranslator";
 /**
@@ -19,7 +20,6 @@ function getTranslator(component) {
     }
     return translator;
 }
-exports.getTranslator = getTranslator;
 /**
  * The translator implements CSS transform aware position measuring. We manually
  * compute a cumulative CSS3 of the root element ancestors up to `<body>`.