@d3plus/core 3.0.16 → 3.1.1

package/es/src/charts/Treemap.js

@@ -1,3 +1,14 @@
+function _array_like_to_array(arr, len) {
+    if (len == null || len > arr.length) len = arr.length;
+    for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
+    return arr2;
+}
+function _array_with_holes(arr) {
+    if (Array.isArray(arr)) return arr;
+}
+function _array_without_holes(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array(arr);
+}
 function _assert_this_initialized(self) {
     if (self === void 0) {
         throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
@@ -62,6 +73,39 @@ function _inherits(subClass, superClass) {
     });
     if (superClass) _set_prototype_of(subClass, superClass);
 }
+function _iterable_to_array(iter) {
+    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
+}
+function _iterable_to_array_limit(arr, i) {
+    var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
+    if (_i == null) return;
+    var _arr = [];
+    var _n = true;
+    var _d = false;
+    var _s, _e;
+    try {
+        for(_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true){
+            _arr.push(_s.value);
+            if (i && _arr.length === i) break;
+        }
+    } catch (err) {
+        _d = true;
+        _e = err;
+    } finally{
+        try {
+            if (!_n && _i["return"] != null) _i["return"]();
+        } finally{
+            if (_d) throw _e;
+        }
+    }
+    return _arr;
+}
+function _non_iterable_rest() {
+    throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+function _non_iterable_spread() {
+    throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
 function _possible_constructor_return(self, call) {
     if (call && (_type_of(call) === "object" || typeof call === "function")) {
         return call;
@@ -75,6 +119,9 @@ function _set_prototype_of(o, p) {
     };
     return _set_prototype_of(o, p);
 }
+function _sliced_to_array(arr, i) {
+    return _array_with_holes(arr) || _iterable_to_array_limit(arr, i) || _unsupported_iterable_to_array(arr, i) || _non_iterable_rest();
+}
 function _super_prop_base(object, property) {
     while(!Object.prototype.hasOwnProperty.call(object, property)){
         object = _get_prototype_of(object);
@@ -82,10 +129,21 @@ function _super_prop_base(object, property) {
     }
     return object;
 }
+function _to_consumable_array(arr) {
+    return _array_without_holes(arr) || _iterable_to_array(arr) || _unsupported_iterable_to_array(arr) || _non_iterable_spread();
+}
 function _type_of(obj) {
     "@swc/helpers - typeof";
     return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
 }
+function _unsupported_iterable_to_array(o, minLen) {
+    if (!o) return;
+    if (typeof o === "string") return _array_like_to_array(o, minLen);
+    var n = Object.prototype.toString.call(o).slice(8, -1);
+    if (n === "Object" && o.constructor) n = o.constructor.name;
+    if (n === "Map" || n === "Set") return Array.from(n);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array(o, minLen);
+}
 function _is_native_reflect_construct() {
     try {
         var result = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function() {}));
@@ -94,8 +152,7 @@ function _is_native_reflect_construct() {
         return !!result;
     })();
 }
-import { sum } from "d3-array";
-import { nest } from "d3-collection";
+import { group, sum } from "d3-array";
 import { hierarchy, treemap } from "d3-hierarchy";
 import { treemapBinary, treemapDice, treemapSlice, treemapSliceDice, treemapSquarify, treemapResquarify } from "d3-hierarchy";
 var tileMethods = {
@@ -106,7 +163,7 @@ var tileMethods = {
     treemapSquarify: treemapSquarify,
     treemapResquarify: treemapResquarify
 };
-import { merge } from "@d3plus/data";
+import { merge, nestGroups } from "@d3plus/data";
 import { assign, elem } from "@d3plus/dom";
 import { formatAbbreviate } from "@d3plus/format";
 import { Rect } from "../shapes/index.js";
@@ -132,7 +189,7 @@ var Treemap = /*#__PURE__*/ function(Viz) {
             tbody: []
         });
         _this._shapeConfig = assign({}, _this._shapeConfig, {
-            ariaLabel: function(d, i) {
+            ariaLabel: function ariaLabel(d, i) {
                 var rank = _this._rankData ? "".concat(_this._rankData.indexOf(d) + 1, ". ") : "";
                 return "".concat(rank).concat(_this._drawLabel(d, i), ", ").concat(_this._sum(d, i), ".");
             },
@@ -164,24 +221,21 @@ var Treemap = /*#__PURE__*/ function(Viz) {
             ]
         });
         _this._treemap = treemap().round(true);
-        var isAggregated = function(leaf) {
+        var isAggregated = function isAggregated(leaf) {
             return leaf.children && leaf.children.length === 1 && leaf.children[0].data._isAggregation;
         };
         return _this;
     }
     _create_class(Treemap, [
         {
-            /**
-      @memberof Treemap
-      @desc Extends the draw behavior of the abstract Viz class.
-      @private
-  */ key: "_draw",
+            /**
+      Extends the draw behavior of the abstract Viz class.
+      @private
+*/ key: "_draw",
             value: function _draw(callback) {
                 var _this = this;
                 _get(_get_prototype_of(Treemap.prototype), "_draw", this).call(this, callback);
-                var nestedData = nest();
-                for(var i = 0; i <= this._drawDepth; i++)nestedData.key(this._groupBy[i]);
-                nestedData = nestedData.entries(this._filteredData);
+                var nestedData = nestGroups(this._filteredData, this._groupBy.slice(0, this._drawDepth + 1));
                 var tmapData = this._treemap.padding(this._layoutPadding).size([
                     this._width - this._margin.left - this._margin.right,
                     this._height - this._margin.top - this._margin.bottom
@@ -191,11 +245,10 @@ var Treemap = /*#__PURE__*/ function(Viz) {
                     return d.values;
                 }).sum(this._sum).sort(this._sort));
                 var shapeData = [], that = this;
-                /**
-        @memberof Treemap
-        @desc Flattens and merges treemap data.
-        @private
-    */ function extractLayout(children) {
+                /**
+        Flattens and merges treemap data.
+        @private
+*/ function extractLayout(children) {
                     for(var i = 0; i < children.length; i++){
                         var node = children[i];
                         if (node.depth <= that._drawDepth) extractLayout(node.children);
@@ -238,10 +291,10 @@ var Treemap = /*#__PURE__*/ function(Viz) {
                         transform: transform
                     }
                 }).node()).config({
-                    height: function(d) {
+                    height: function height(d) {
                         return d.y1 - d.y0;
                     },
-                    labelBounds: function(d, i, s) {
+                    labelBounds: function labelBounds(d, i, s) {
                         var h = s.height;
                         var sh = Math.min(fontMax, (h - padding * 2) * 0.5);
                         if (sh < fontMin) sh = 0;
@@ -261,7 +314,7 @@ var Treemap = /*#__PURE__*/ function(Viz) {
                         ];
                     },
                     labelConfig: {
-                        textAnchor: function(d, i, x) {
+                        textAnchor: function textAnchor(d, i, x) {
                             var line, parent = x;
                             while(typeof line === "undefined" && parent){
                                 if (typeof parent.l !== "undefined") line = parent.l;
@@ -269,7 +322,7 @@ var Treemap = /*#__PURE__*/ function(Viz) {
                             }
                             return line ? "middle" : "start";
                         },
-                        verticalAlign: function(d, i, x) {
+                        verticalAlign: function verticalAlign(d, i, x) {
                             var line, parent = x;
                             while(typeof line === "undefined" && parent){
                                 if (typeof parent.l !== "undefined") line = parent.l;
@@ -278,7 +331,7 @@ var Treemap = /*#__PURE__*/ function(Viz) {
                             return line ? "bottom" : "top";
                         }
                     },
-                    width: function(d) {
+                    width: function width(d) {
                         return d.x1 - d.x0;
                     }
                 }).config(rectConfig).render());
@@ -286,11 +339,11 @@ var Treemap = /*#__PURE__*/ function(Viz) {
             }
         },
         {
-            /**
-   * Applies the threshold algorithm for Treemaps.
-   * @param {Array} data The data to process.
-   * @private
-   */ key: "_thresholdFunction",
+            /**
+   * Applies the threshold algorithm for Treemaps.
+   * @param {Array} data The data to process.
+   * @private
+*/ key: "_thresholdFunction",
             value: function _thresholdFunction(data) {
                 var aggs = this._aggs;
                 var drawDepth = this._drawDepth;
@@ -301,16 +354,17 @@ var Treemap = /*#__PURE__*/ function(Viz) {
                 if (threshold && thresholdKey) {
                     return thresholdByDepth(data, 0);
                 }
-                /**
-     * @memberof Treemap
-     * @desc Explores the data tree recursively and merges elements under the indicated threshold.
-     * @param {object[]} branchData The current subset of the dataset to work on.
-     * @param {number} depth The depth of the current branch.
-     * @private
-     */ function thresholdByDepth(branchData, depth) {
+                /**
+        Explores the data tree recursively and merges elements under the indicated threshold.
+        @param branchData The current subset of the dataset to work on.
+        @param depth The depth of the current branch.
+        @private
+*/ function thresholdByDepth(branchData, depth) {
                     if (depth < drawDepth) {
-                        return nest().key(groupBy[depth]).entries(branchData).reduce(function(bulk, leaf) {
-                            var subBranchData = thresholdByDepth(leaf.values, depth + 1);
+                        return _to_consumable_array(group(branchData, groupBy[depth])).reduce(function(bulk, param) {
+                            var _param = _sliced_to_array(param, 2), values = _param[1];
+                            var _thresholdByDepth;
+                            var subBranchData = (_thresholdByDepth = thresholdByDepth(values, depth + 1)) !== null && _thresholdByDepth !== void 0 ? _thresholdByDepth : [];
                             return bulk.concat(subBranchData);
                         }, []);
                     }
@@ -343,39 +397,35 @@ var Treemap = /*#__PURE__*/ function(Viz) {
             }
         },
         {
-            /**
-      @memberof Treemap
-      @desc If *value* is specified, sets the inner and outer padding accessor to the specified function or number and returns the current class instance. If *value* is not specified, returns the current padding accessor.
-      @param {Function|Number} [*value*]
-  */ key: "layoutPadding",
+            /**
+      The inner and outer padding.
+*/ key: "layoutPadding",
             value: function layoutPadding(_) {
                 return arguments.length ? (this._layoutPadding = typeof _ === "function" ? _ : constant(_), this) : this._layoutPadding;
             }
         },
         {
-            /**
-      @memberof Treemap
-      @desc If *comparator* is specified, sets the sort order for the treemap using the specified comparator function. If *comparator* is not specified, returns the current group sort order, which defaults to descending order by the associated input data's numeric value attribute.
-      @param {Array} [*comparator*]
-      @example
-function comparator(a, b) {
-  return b.value - a.value;
-}
-  */ key: "sort",
+            /**
+      Sort comparator function for the treemap layout. Defaults to descending order by the associated input data's numeric value attribute.
+
+@example
+function comparator(a, b) {
+  return b.value - a.value;
+}
+*/ key: "sort",
             value: function sort(_) {
                 return arguments.length ? (this._sort = _, this) : this._sort;
             }
         },
         {
-            /**
-      @memberof Treemap
-      @desc If *value* is specified, sets the sum accessor to the specified function or number and returns the current class instance. If *value* is not specified, returns the current sum accessor.
-      @param {Function|Number} [*value*]
-      @example
-function sum(d) {
-  return d.sum;
-}
-  */ key: "sum",
+            /**
+      The sum accessor used for sizing each rectangle in the treemap.
+
+@example
+function sum(d) {
+  return d.sum;
+}
+*/ key: "sum",
             value: function sum(_) {
                 if (arguments.length) {
                     this._sum = typeof _ === "function" ? _ : accessor(_);
@@ -385,13 +435,11 @@ function sum(d) {
             }
         },
         {
-            /**
-      @memberof Treemap
-      @desc Sets the tiling method used when calcuating the size and position of the rectangles.
-
-Can either be a string referring to a d3-hierarchy [tiling method](https://github.com/d3/d3-hierarchy#treemap-tiling), or a custom function in the same format.
-      @param {String|Function} [*value* = "squarify"]
-  */ key: "tile",
+            /**
+      The tiling method used when calculating the size and position of the rectangles.
+
+Can either be a string referring to a d3-hierarchy [tiling method](https://github.com/d3/d3-hierarchy#treemap-tiling), or a custom function in the same format.
+*/ key: "tile",
             value: function tile(_) {
                 return arguments.length ? (this._tile = typeof _ === "string" ? tileMethods["treemap".concat(_.charAt(0).toUpperCase()).concat(_.slice(1))] || treemapSquarify : _, this) : this._tile;
             }
@@ -399,8 +447,6 @@ Can either be a string referring to a d3-hierarchy [tiling method](https://githu
     ]);
     return Treemap;
 }(Viz);
-/**
-    @class Treemap
-    @extends Viz
-    @desc Uses the [d3 treemap layout](https://github.com/mbostock/d3/wiki/Treemap-Layout) to creates SVG rectangles based on an array of data. See [this example](https://d3plus.org/examples/d3plus-hierarchy/getting-started/) for help getting started using the treemap generator.
+/**
+    Uses the [d3 treemap layout](https://github.com/mbostock/d3/wiki/Treemap-Layout) to creates SVG rectangles based on an array of data. See [this example](https://d3plus.org/examples/d3plus-hierarchy/getting-started/) for help getting started using the treemap generator.
 */ export { Treemap as default };