echarts 4.2.0-rc.2 → 4.2.1

package/lib/chart/map/MapView.js

@@ -44,6 +44,9 @@ var MapDraw = require("../../component/helper/MapDraw");
 * specific language governing permissions and limitations
 * under the License.
 */
+var HIGH_DOWN_PROP = '__seriesMapHighDown';
+var RECORD_VERSION_PROP = '__seriesMapCallKey';
+
 var _default = echarts.extendChartView({
   type: 'map',
   render: function (mapModel, ecModel, api, payload) {
@@ -90,12 +93,12 @@ var _default = echarts.extendChartView({
   _renderSymbols: function (mapModel, ecModel, api) {
     var originalData = mapModel.originalData;
     var group = this.group;
-    originalData.each(originalData.mapDimension('value'), function (value, idx) {
+    originalData.each(originalData.mapDimension('value'), function (value, originalDataIndex) {
       if (isNaN(value)) {
         return;
       }
 
-      var layout = originalData.getItemLayout(idx);
+      var layout = originalData.getItemLayout(originalDataIndex);
 
       if (!layout || !layout.point) {
         // Not exists in map
@@ -120,50 +123,57 @@ var _default = echarts.extendChartView({
         },
         silent: true,
         // Do not overlap the first series, on which labels are displayed.
-        z2: !offset ? 10 : 8
-      }); // First data on the same region
+        z2: 8 + (!offset ? graphic.Z2_EMPHASIS_LIFT + 1 : 0)
+      }); // Only the series that has the first value on the same region is in charge of rendering the label.
+      // But consider the case:
+      // series: [
+      //     {id: 'X', type: 'map', map: 'm', {data: [{name: 'A', value: 11}, {name: 'B', {value: 22}]},
+      //     {id: 'Y', type: 'map', map: 'm', {data: [{name: 'A', value: 21}, {name: 'C', {value: 33}]}
+      // ]
+      // The offset `0` of item `A` is at series `X`, but of item `C` is at series `Y`.
+      // For backward compatibility, we follow the rule that render label `A` by the
+      // settings on series `X` but render label `C` by the settings on series `Y`.
 
       if (!offset) {
         var fullData = mapModel.mainSeries.getData();
-        var name = originalData.getName(idx);
+        var name = originalData.getName(originalDataIndex);
         var fullIndex = fullData.indexOfName(name);
-        var itemModel = originalData.getItemModel(idx);
+        var itemModel = originalData.getItemModel(originalDataIndex);
         var labelModel = itemModel.getModel('label');
         var hoverLabelModel = itemModel.getModel('emphasis.label');
-        var polygonGroups = fullData.getItemGraphicEl(fullIndex);
-        var normalText = zrUtil.retrieve2(mapModel.getFormattedLabel(idx, 'normal'), name);
-        var emphasisText = zrUtil.retrieve2(mapModel.getFormattedLabel(idx, 'emphasis'), normalText);
-
-        var onEmphasis = function () {
-          var hoverStyle = graphic.setTextStyle({}, hoverLabelModel, {
-            text: hoverLabelModel.get('show') ? emphasisText : null
-          }, {
-            isRectText: true,
-            useInsideStyle: false
-          }, true);
-          circle.style.extendFrom(hoverStyle); // Make label upper than others if overlaps.
-
-          circle.__mapOriginalZ2 = circle.z2;
-          circle.z2 += 1;
-        };
-
-        var onNormal = function () {
-          graphic.setTextStyle(circle.style, labelModel, {
-            text: labelModel.get('show') ? normalText : null,
-            textPosition: labelModel.getShallow('position') || 'bottom'
-          }, {
-            isRectText: true,
-            useInsideStyle: false
-          });
-
-          if (circle.__mapOriginalZ2 != null) {
-            circle.z2 = circle.__mapOriginalZ2;
-            circle.__mapOriginalZ2 = null;
-          }
-        };
-
-        polygonGroups.on('mouseover', onEmphasis).on('mouseout', onNormal).on('emphasis', onEmphasis).on('normal', onNormal);
-        onNormal();
+        var regionGroup = fullData.getItemGraphicEl(fullIndex); // `getFormattedLabel` needs to use `getData` inside. Here
+        // `mapModel.getData()` is shallow cloned from `mainSeries.getData()`.
+        // FIXME
+        // If this is not the `mainSeries`, the item model (like label formatter)
+        // set on original data item will never get. But it has been working
+        // like that from the begining, and this scenario is rarely encountered.
+        // So it won't be fixed until have to.
+
+        var normalText = zrUtil.retrieve2(mapModel.getFormattedLabel(fullIndex, 'normal'), name);
+        var emphasisText = zrUtil.retrieve2(mapModel.getFormattedLabel(fullIndex, 'emphasis'), normalText);
+        var highDownRecord = regionGroup[HIGH_DOWN_PROP];
+        var recordVersion = Math.random(); // Prevent from register listeners duplicatedly when roaming.
+
+        if (!highDownRecord) {
+          highDownRecord = regionGroup[HIGH_DOWN_PROP] = {};
+          var onEmphasis = zrUtil.curry(onRegionHighDown, true);
+          var onNormal = zrUtil.curry(onRegionHighDown, false);
+          regionGroup.on('mouseover', onEmphasis).on('mouseout', onNormal).on('emphasis', onEmphasis).on('normal', onNormal);
+        } // Prevent removed regions effect current grapics.
+
+
+        regionGroup[RECORD_VERSION_PROP] = recordVersion;
+        zrUtil.extend(highDownRecord, {
+          recordVersion: recordVersion,
+          circle: circle,
+          labelModel: labelModel,
+          hoverLabelModel: hoverLabelModel,
+          emphasisText: emphasisText,
+          normalText: normalText
+        }); // FIXME
+        // Consider set option when emphasis.
+
+        enterRegionHighDown(highDownRecord, false);
       }
 
       group.add(circle);
@@ -171,4 +181,47 @@ var _default = echarts.extendChartView({
   }
 });
 
+function onRegionHighDown(toHighOrDown) {
+  var highDownRecord = this[HIGH_DOWN_PROP];
+
+  if (highDownRecord && highDownRecord.recordVersion === this[RECORD_VERSION_PROP]) {
+    enterRegionHighDown(highDownRecord, toHighOrDown);
+  }
+}
+
+function enterRegionHighDown(highDownRecord, toHighOrDown) {
+  var circle = highDownRecord.circle;
+  var labelModel = highDownRecord.labelModel;
+  var hoverLabelModel = highDownRecord.hoverLabelModel;
+  var emphasisText = highDownRecord.emphasisText;
+  var normalText = highDownRecord.normalText;
+
+  if (toHighOrDown) {
+    circle.style.extendFrom(graphic.setTextStyle({}, hoverLabelModel, {
+      text: hoverLabelModel.get('show') ? emphasisText : null
+    }, {
+      isRectText: true,
+      useInsideStyle: false
+    }, true)); // Make label upper than others if overlaps.
+
+    circle.__mapOriginalZ2 = circle.z2;
+    circle.z2 += graphic.Z2_EMPHASIS_LIFT;
+  } else {
+    graphic.setTextStyle(circle.style, labelModel, {
+      text: labelModel.get('show') ? normalText : null,
+      textPosition: labelModel.getShallow('position') || 'bottom'
+    }, {
+      isRectText: true,
+      useInsideStyle: false
+    }); // Trigger normalize style like padding.
+
+    circle.dirty(false);
+
+    if (circle.__mapOriginalZ2 != null) {
+      circle.z2 = circle.__mapOriginalZ2;
+      circle.__mapOriginalZ2 = null;
+    }
+  }
+}
+
 module.exports = _default;

package/lib/chart/pie/labelLayout.js

@@ -42,7 +42,7 @@ var textContain = require("zrender/lib/contain/text");
 function adjustSingleSide(list, cx, cy, r, dir, viewWidth, viewHeight) {
   list.sort(function (a, b) {
     return a.y - b.y;
-  }); // 压
+  });
 
   function shiftDown(start, end, delta, dir) {
     for (var j = start; j < end; j++) {
@@ -55,8 +55,7 @@ function adjustSingleSide(list, cx, cy, r, dir, viewWidth, viewHeight) {
     }
 
     shiftUp(end - 1, delta / 2);
-  } // 弹
-
+  }
 
   function shiftUp(end, delta) {
     for (var j = end; j >= 0; j--) {
@@ -69,31 +68,26 @@ function adjustSingleSide(list, cx, cy, r, dir, viewWidth, viewHeight) {
   }
 
   function changeX(list, isDownList, cx, cy, r, dir) {
-    var lastDeltaX = dir > 0 ? isDownList // 右侧
-    ? Number.MAX_VALUE // 下
-    : 0 // 上
-    : isDownList // 左侧
-    ? Number.MAX_VALUE // 下
-    : 0; // 上
+    var lastDeltaX = dir > 0 ? isDownList // right-side
+    ? Number.MAX_VALUE // down
+    : 0 // up
+    : isDownList // left-side
+    ? Number.MAX_VALUE // down
+    : 0; // up
 
     for (var i = 0, l = list.length; i < l; i++) {
-      // Not change x for center label
-      if (list[i].position === 'center') {
-        continue;
-      }
-
       var deltaY = Math.abs(list[i].y - cy);
       var length = list[i].len;
       var length2 = list[i].len2;
       var deltaX = deltaY < r + length ? Math.sqrt((r + length + length2) * (r + length + length2) - deltaY * deltaY) : Math.abs(list[i].x - cx);
 
       if (isDownList && deltaX >= lastDeltaX) {
-        // 右下，左下
+        // right-down, left-down
         deltaX = lastDeltaX - 10;
       }
 
       if (!isDownList && deltaX <= lastDeltaX) {
-        // 右上，左上
+        // right-up, left-up
         deltaX = lastDeltaX + 10;
       }
 
@@ -139,6 +133,10 @@ function avoidOverlap(labelLayoutList, cx, cy, r, viewWidth, viewHeight) {
   var rightList = [];
 
   for (var i = 0; i < labelLayoutList.length; i++) {
+    if (isPositionCenter(labelLayoutList[i])) {
+      continue;
+    }
+
     if (labelLayoutList[i].x < cx) {
       leftList.push(labelLayoutList[i]);
     } else {
@@ -150,6 +148,10 @@ function avoidOverlap(labelLayoutList, cx, cy, r, viewWidth, viewHeight) {
   adjustSingleSide(leftList, cx, cy, r, -1, viewWidth, viewHeight);
 
   for (var i = 0; i < labelLayoutList.length; i++) {
+    if (isPositionCenter(labelLayoutList[i])) {
+      continue;
+    }
+
     var linePoints = labelLayoutList[i].linePoints;
 
     if (linePoints) {
@@ -167,6 +169,11 @@ function avoidOverlap(labelLayoutList, cx, cy, r, viewWidth, viewHeight) {
   }
 }
 
+function isPositionCenter(layout) {
+  // Not change x for center label
+  return layout.position === 'center';
+}
+
 function _default(seriesModel, r, viewWidth, viewHeight) {
   var data = seriesModel.getData();
   var labelLayoutList = [];

package/lib/chart/sankey/sankeyLayout.js

@@ -20,10 +20,12 @@
 
 var layout = require("../../util/layout");
 
-var nest = require("../../util/nest");
-
 var zrUtil = require("zrender/lib/core/util");
 
+var _model = require("../../util/model");
+
+var groupData = _model.groupData;
+
 var _config = require("../../config");
 
 var __DEV__ = _config.__DEV__;
@@ -256,11 +258,7 @@ function scaleNodeBreadths(nodes, kx, orient) {
 
 
 function computeNodeDepths(nodes, edges, height, width, nodeGap, iterations, orient) {
-  var nodesByBreadth = nest().key(getKeyFunction(orient)).sortKeys(function (a, b) {
-    return a - b;
-  }).entries(nodes).map(function (d) {
-    return d.values;
-  });
+  var nodesByBreadth = prepareNodesByBreadth(nodes, orient);
   initializeNodeDepth(nodes, nodesByBreadth, edges, height, width, nodeGap, orient);
   resolveCollisions(nodesByBreadth, nodeGap, height, width, orient);
 
@@ -275,16 +273,19 @@ function computeNodeDepths(nodes, edges, height, width, nodeGap, iterations, ori
   }
 }
 
-function getKeyFunction(orient) {
-  if (orient === 'vertical') {
-    return function (d) {
-      return d.getLayout().y;
-    };
-  }
-
-  return function (d) {
-    return d.getLayout().x;
-  };
+function prepareNodesByBreadth(nodes, orient) {
+  var nodesByBreadth = [];
+  var keyAttr = orient === 'vertical' ? 'y' : 'x';
+  var groupResult = groupData(nodes, function (node) {
+    return node.getLayout()[keyAttr];
+  });
+  groupResult.keys.sort(function (a, b) {
+    return a - b;
+  });
+  zrUtil.each(groupResult.keys, function (key) {
+    nodesByBreadth.push(groupResult.buckets.get(key));
+  });
+  return nodesByBreadth;
 }
 /**
  * Compute the original y-position for each node

package/lib/chart/sunburst/SunburstPiece.js

@@ -90,15 +90,14 @@ SunburstPieceProto.updateData = function (firstCreate, node, state, seriesModel,
   var sector = this.childAt(0);
   sector.dataIndex = node.dataIndex;
   var itemModel = node.getModel();
-  var layout = node.getLayout();
-
-  if (!layout) {
-    console.log(node.getLayout());
-  }
+  var layout = node.getLayout(); // if (!layout) {
+  //     console.log(node.getLayout());
+  // }
 
   var sectorShape = zrUtil.extend({}, layout);
   sectorShape.label = null;
   var visualColor = getNodeColor(node, seriesModel, ecModel);
+  fillDefaultColor(node, seriesModel, visualColor);
   var normalStyle = itemModel.getModel('itemStyle').getItemStyle();
   var style;
 
@@ -381,6 +380,12 @@ function isNodeHighlighted(node, activeNode, policy) {
   } else {
     return node === activeNode || node.isDescendantOf(activeNode);
   }
+} // Fix tooltip callback function params.color incorrect when pick a default color
+
+
+function fillDefaultColor(node, seriesModel, color) {
+  var data = seriesModel.getData();
+  data.setItemVisual(node.dataIndex, 'color', color);
 }
 
 module.exports = _default;

package/lib/chart/themeRiver/ThemeRiverSeries.js

@@ -30,12 +30,14 @@ var List = require("../../data/List");
 
 var zrUtil = require("zrender/lib/core/util");
 
+var _model = require("../../util/model");
+
+var groupData = _model.groupData;
+
 var _format = require("../../util/format");
 
 var encodeHTML = _format.encodeHTML;
 
-var nest = require("../../util/nest");
-
 /*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
@@ -93,15 +95,15 @@ var ThemeRiverSeries = SeriesModel.extend({
   fixData: function (data) {
     var rawDataLength = data.length; // grouped data by name
 
-    var dataByName = nest().key(function (dataItem) {
-      return dataItem[2];
-    }).entries(data); // data group in each layer
-
-    var layData = zrUtil.map(dataByName, function (d) {
-      return {
-        name: d.key,
-        dataList: d.values
-      };
+    var groupResult = groupData(data, function (item) {
+      return item[2];
+    });
+    var layData = [];
+    groupResult.buckets.each(function (items, key) {
+      layData.push({
+        name: key,
+        dataList: items
+      });
     });
     var layerNum = layData.length;
     var largestLayer = -1;
@@ -218,28 +220,23 @@ var ThemeRiverSeries = SeriesModel.extend({
 
     for (var i = 0; i < lenCount; ++i) {
       indexArr[i] = i;
-    } // data group by name
+    }
 
+    var timeDim = data.mapDimension('single'); // data group by name
 
-    var dataByName = nest().key(function (index) {
+    var groupResult = groupData(indexArr, function (index) {
       return data.get('name', index);
-    }).entries(indexArr);
-    var layerSeries = zrUtil.map(dataByName, function (d) {
-      return {
-        name: d.key,
-        indices: d.values
-      };
     });
-    var timeDim = data.mapDimension('single');
-
-    for (var j = 0; j < layerSeries.length; ++j) {
-      layerSeries[j].indices.sort(comparer);
-    }
-
-    function comparer(index1, index2) {
-      return data.get(timeDim, index1) - data.get(timeDim, index2);
-    }
-
+    var layerSeries = [];
+    groupResult.buckets.each(function (items, key) {
+      items.sort(function (index1, index2) {
+        return data.get(timeDim, index1) - data.get(timeDim, index2);
+      });
+      layerSeries.push({
+        name: key,
+        indices: items
+      });
+    });
     return layerSeries;
   },
 

package/lib/chart/tree/layoutHelper.js

@@ -40,21 +40,25 @@ var layout = require("../../util/layout");
 */
 
 /*
-* The tree layout implementation references to d3.js
-* (https://github.com/d3/d3-hierarchy). The use of the source
-* code of this file is also subject to the terms and consitions
-* of its license (BSD-3Clause, see <echarts/src/licenses/LICENSE-d3>).
+* A third-party license is embeded for some of the code in this file:
+* The tree layoutHelper implementation was originally copied from
+* "d3.js"(https://github.com/d3/d3-hierarchy) with
+* some modifications made for this project.
+* (see more details in the comment of the specific method below.)
+* The use of the source code of this file is also subject to the terms
+* and consitions of the licence of "d3.js" (BSD-3Clause, see
+* </licenses/LICENSE-d3>).
 */
 
 /**
  * @file The layout algorithm of node-link tree diagrams. Here we using Reingold-Tilford algorithm to drawing
  *       the tree.
- * @see https://github.com/d3/d3-hierarchy
  */
 
 /**
- * Initialize all computational message for following algorithm
- * @param  {module:echarts/data/Tree~TreeNode} root   The virtual root of the tree
+ * Initialize all computational message for following algorithm.
+ *
+ * @param  {module:echarts/data/Tree~TreeNode} root   The virtual root of the tree.
  */
 function init(root) {
   root.hierNode = {
@@ -96,10 +100,16 @@ function init(root) {
   }
 }
 /**
+ * The implementation of this function was originally copied from "d3.js"
+ * <https://github.com/d3/d3-hierarchy/blob/4c1f038f2725d6eae2e49b61d01456400694bac4/src/tree.js>
+ * with some modifications made for this program.
+ * See the license statement at the head of this file.
+ *
  * Computes a preliminary x coordinate for node. Before that, this function is
  * applied recursively to the children of node, as well as the function
  * apportion(). After spacing out the children by calling executeShifts(), the
  * node is placed to the midpoint of its outermost children.
+ *
  * @param  {module:echarts/data/Tree~TreeNode} node
  * @param {Function} separation
  */
@@ -127,7 +137,13 @@ function firstWalk(node, separation) {
   node.parentNode.hierNode.defaultAncestor = apportion(node, subtreeW, node.parentNode.hierNode.defaultAncestor || siblings[0], separation);
 }
 /**
+ * The implementation of this function was originally copied from "d3.js"
+ * <https://github.com/d3/d3-hierarchy/blob/4c1f038f2725d6eae2e49b61d01456400694bac4/src/tree.js>
+ * with some modifications made for this program.
+ * See the license statement at the head of this file.
+ *
  * Computes all real x-coordinates by summing up the modifiers recursively.
+ *
  * @param  {module:echarts/data/Tree~TreeNode} node
  */
 
@@ -144,7 +160,8 @@ function separation(cb) {
   return arguments.length ? cb : defaultSeparation;
 }
 /**
- * Transform the common coordinate to radial coordinate
+ * Transform the common coordinate to radial coordinate.
+ *
  * @param  {number} x
  * @param  {number} y
  * @return {Object}
@@ -159,7 +176,8 @@ function radialCoordinate(x, y) {
   return radialCoor;
 }
 /**
- * Get the layout position of the whole view
+ * Get the layout position of the whole view.
+ *
  * @param {module:echarts/model/Series} seriesModel  the model object of sankey series
  * @param {module:echarts/ExtensionAPI} api  provide the API list that the developer can call
  * @return {module:zrender/core/BoundingRect}  size of rect to draw the sankey view
@@ -175,6 +193,12 @@ function getViewRect(seriesModel, api) {
 /**
  * All other shifts, applied to the smaller subtrees between w- and w+, are
  * performed by this function.
+ *
+ * The implementation of this function was originally copied from "d3.js"
+ * <https://github.com/d3/d3-hierarchy/blob/4c1f038f2725d6eae2e49b61d01456400694bac4/src/tree.js>
+ * with some modifications made for this program.
+ * See the license statement at the head of this file.
+ *
  * @param  {module:echarts/data/Tree~TreeNode} node
  */
 
@@ -194,6 +218,11 @@ function executeShifts(node) {
   }
 }
 /**
+ * The implementation of this function was originally copied from "d3.js"
+ * <https://github.com/d3/d3-hierarchy/blob/4c1f038f2725d6eae2e49b61d01456400694bac4/src/tree.js>
+ * with some modifications made for this program.
+ * See the license statement at the head of this file.
+ *
  * The core of the algorithm. Here, a new subtree is combined with the
  * previous subtrees. Threads are used to traverse the inside and outside
  * contours of the left and right subtree up to the highest common level.
@@ -201,6 +230,7 @@ function executeShifts(node) {
  * one of the greatest uncommon ancestors using the function nextAncestor()
  * and call moveSubtree() to shift the subtree and prepare the shifts of
  * smaller subtrees. Finally, we add a new thread (if necessary).
+ *
  * @param  {module:echarts/data/Tree~TreeNode} subtreeV
  * @param  {module:echarts/data/Tree~TreeNode} subtreeW
  * @param  {module:echarts/data/Tree~TreeNode} ancestor
@@ -256,6 +286,7 @@ function apportion(subtreeV, subtreeW, ancestor, separation) {
  * This function is used to traverse the right contour of a subtree.
  * It returns the rightmost child of node or the thread of node. The function
  * returns null if and only if node is on the highest depth of its subtree.
+ *
  * @param  {module:echarts/data/Tree~TreeNode} node
  * @return {module:echarts/data/Tree~TreeNode}
  */
@@ -269,6 +300,7 @@ function nextRight(node) {
  * This function is used to traverse the left contour of a subtree (or a subforest).
  * It returns the leftmost child of node or the thread of node. The function
  * returns null if and only if node is on the highest depth of its subtree.
+ *
  * @param  {module:echarts/data/Tree~TreeNode} node
  * @return {module:echarts/data/Tree~TreeNode}
  */
@@ -281,6 +313,7 @@ function nextLeft(node) {
 /**
  * If nodeInLeft’s ancestor is a sibling of node, returns nodeInLeft’s ancestor.
  * Otherwise, returns the specified ancestor.
+ *
  * @param  {module:echarts/data/Tree~TreeNode} nodeInLeft
  * @param  {module:echarts/data/Tree~TreeNode} node
  * @param  {module:echarts/data/Tree~TreeNode} ancestor
@@ -292,7 +325,14 @@ function nextAncestor(nodeInLeft, node, ancestor) {
   return nodeInLeft.hierNode.ancestor.parentNode === node.parentNode ? nodeInLeft.hierNode.ancestor : ancestor;
 }
 /**
- * Shifts the current subtree rooted at wr. This is done by increasing prelim(w+) and modifier(w+) by shift.
+ * The implementation of this function was originally copied from "d3.js"
+ * <https://github.com/d3/d3-hierarchy/blob/4c1f038f2725d6eae2e49b61d01456400694bac4/src/tree.js>
+ * with some modifications made for this program.
+ * See the license statement at the head of this file.
+ *
+ * Shifts the current subtree rooted at wr.
+ * This is done by increasing prelim(w+) and modifier(w+) by shift.
+ *
  * @param  {module:echarts/data/Tree~TreeNode} wl
  * @param  {module:echarts/data/Tree~TreeNode} wr
  * @param  {number} shift [description]
@@ -307,6 +347,13 @@ function moveSubtree(wl, wr, shift) {
   wr.hierNode.prelim += shift;
   wl.hierNode.change += change;
 }
+/**
+ * The implementation of this function was originally copied from "d3.js"
+ * <https://github.com/d3/d3-hierarchy/blob/4c1f038f2725d6eae2e49b61d01456400694bac4/src/tree.js>
+ * with some modifications made for this program.
+ * See the license statement at the head of this file.
+ */
+
 
 function defaultSeparation(node1, node2) {
   return node1.parentNode === node2.parentNode ? 1 : 2;

package/lib/chart/treemap/treemapLayout.js

@@ -51,11 +51,13 @@ var helper = require("../helper/treeHelper");
 */
 
 /*
-* The treemap layout implementation references to the treemap
-* layout of d3.js (d3/src/layout/treemap.js in v3). The use of
-* the source code of this file is also subject to the terms
-* and consitions of its license (BSD-3Clause, see
-* <echarts/src/licenses/LICENSE-d3>).
+* A third-party license is embeded for some of the code in this file:
+* The treemap layout implementation was originally copied from
+* "d3.js" with some modifications made for this project.
+* (See more details in the comment of the method "squarify" below.)
+* The use of the source code of this file is also subject to the terms
+* and consitions of the license of "d3.js" (BSD-3Clause, see
+* </licenses/LICENSE-d3>).
 */
 var mathMax = Math.max;
 var mathMin = Math.min;
@@ -144,8 +146,12 @@ var _default = {
 };
 /**
  * Layout treemap with squarify algorithm.
- * @see https://graphics.ethz.ch/teaching/scivis_common/Literature/squarifiedTreeMaps.pdf
- * The implementation references to the treemap layout of d3.js.
+ * The original presentation of this algorithm
+ * was made by Mark Bruls, Kees Huizing, and Jarke J. van Wijk
+ * <https://graphics.ethz.ch/teaching/scivis_common/Literature/squarifiedTreeMaps.pdf>.
+ * The implementation of this algorithm was originally copied from "d3.js"
+ * <https://github.com/d3/d3/blob/9cc9a875e636a1dcf36cc1e07bdf77e1ad6e2c74/src/layout/treemap.js>
+ * with some modifications made for this program.
  * See the license statement at the head of this file.
  *
  * @protected