@antv/hierarchy 0.6.13 → 0.7.0

package/lib/layout/hierarchy.js

@@ -1,184 +0,0 @@
-/* eslint-disable no-cond-assign */
-var util = require('../util');
-var PEM = 18;
-var DEFAULT_HEIGHT = PEM * 2;
-var DEFAULT_GAP = PEM;
-var DEFAULT_OPTIONS = {
-  getId: function getId(d) {
-    return d.id || d.name;
-  },
-  getPreH: function getPreH(d) {
-    return d.preH || 0;
-  },
-  getPreV: function getPreV(d) {
-    return d.preV || 0;
-  },
-  getHGap: function getHGap(d) {
-    return d.hgap || DEFAULT_GAP;
-  },
-  getVGap: function getVGap(d) {
-    return d.vgap || DEFAULT_GAP;
-  },
-  getChildren: function getChildren(d) {
-    return d.children;
-  },
-  getHeight: function getHeight(d) {
-    return d.height || DEFAULT_HEIGHT;
-  },
-  getWidth: function getWidth(d) {
-    var label = d.label || ' ';
-    return d.width || label.split('').length * PEM; // FIXME DO NOT get width like this
-  }
-};
-function Node(data, options) {
-  var me = this;
-  me.vgap = me.hgap = 0;
-  if (data instanceof Node) return data;
-  me.data = data;
-  /*
-   * Gaps: filling space between nodes
-   * (x, y) ----------------------
-   * |            vgap            |
-   * |    --------------------    h
-   * | h |                    |   e
-   * | g |                    |   i
-   * | a |                    |   g
-   * | p |                    |   h
-   * |   ---------------------    t
-   * |                            |
-   *  -----------width------------
-   */
-  var hgap = options.getHGap(data);
-  var vgap = options.getVGap(data);
-  me.preH = options.getPreH(data);
-  me.preV = options.getPreV(data);
-  me.width = options.getWidth(data);
-  me.height = options.getHeight(data);
-  me.width += me.preH;
-  me.height += me.preV;
-  me.id = options.getId(data);
-  me.x = me.y = 0;
-  me.depth = 0;
-  if (!me.children) {
-    me.children = [];
-  }
-  me.addGap(hgap, vgap);
-  return me;
-}
-util.assign(Node.prototype, {
-  isRoot: function isRoot() {
-    return this.depth === 0;
-  },
-  isLeaf: function isLeaf() {
-    return this.children.length === 0;
-  },
-  addGap: function addGap(hgap, vgap) {
-    var me = this;
-    me.hgap += hgap;
-    me.vgap += vgap;
-    me.width += 2 * hgap;
-    me.height += 2 * vgap;
-  },
-  eachNode: function eachNode(callback) {
-    // Depth First traverse
-    var me = this;
-    var nodes = [me];
-    var current;
-    while (current = nodes.shift()) {
-      callback(current);
-      nodes = current.children.concat(nodes);
-    }
-  },
-  DFTraverse: function DFTraverse(callback) {
-    // Depth First traverse
-    this.eachNode(callback);
-  },
-  BFTraverse: function BFTraverse(callback) {
-    // Breadth First traverse
-    var me = this;
-    var nodes = [me];
-    var current;
-    while (current = nodes.shift()) {
-      callback(current);
-      nodes = nodes.concat(current.children);
-    }
-  },
-  getBoundingBox: function getBoundingBox() {
-    // BBox for just one tree node
-    var bb = {
-      left: Number.MAX_VALUE,
-      top: Number.MAX_VALUE,
-      width: 0,
-      height: 0
-    };
-    this.eachNode(function (node) {
-      bb.left = Math.min(bb.left, node.x);
-      bb.top = Math.min(bb.top, node.y);
-      bb.width = Math.max(bb.width, node.x + node.width);
-      bb.height = Math.max(bb.height, node.y + node.height);
-    });
-    return bb;
-  },
-  // translate
-  translate: function translate(tx, ty) {
-    if (tx === void 0) {
-      tx = 0;
-    }
-    if (ty === void 0) {
-      ty = 0;
-    }
-    this.eachNode(function (node) {
-      node.x += tx;
-      node.y += ty;
-      node.x += node.preH;
-      node.y += node.preV;
-    });
-  },
-  right2left: function right2left() {
-    var me = this;
-    var bb = me.getBoundingBox();
-    me.eachNode(function (node) {
-      node.x = node.x - (node.x - bb.left) * 2 - node.width;
-      // node.x = - node.x;
-    });
-    me.translate(bb.width, 0);
-  },
-  bottom2top: function bottom2top() {
-    var me = this;
-    var bb = me.getBoundingBox();
-    me.eachNode(function (node) {
-      node.y = node.y - (node.y - bb.top) * 2 - node.height;
-      // node.y = - node.y;
-    });
-    me.translate(0, bb.height);
-  }
-});
-function hierarchy(data, options, isolated) {
-  if (options === void 0) {
-    options = {};
-  }
-  options = util.assign({}, DEFAULT_OPTIONS, options);
-  var root = new Node(data, options);
-  var nodes = [root];
-  var node;
-  if (!isolated && !data.collapsed) {
-    while (node = nodes.shift()) {
-      if (!node.data.collapsed) {
-        var children = options.getChildren(node.data);
-        var length = children ? children.length : 0;
-        node.children = new Array(length);
-        if (children && length) {
-          for (var i = 0; i < length; i++) {
-            var child = new Node(children[i], options);
-            node.children[i] = child;
-            nodes.push(child);
-            child.parent = node;
-            child.depth = node.depth + 1;
-          }
-        }
-      }
-    }
-  }
-  return root;
-}
-module.exports = hierarchy;

package/lib/layout/indented.js

@@ -1,36 +0,0 @@
-var util = require("../util");
-function positionNode(node, previousNode, indent, dropCap, align) {
-  //  caculate the node's horizontal offset DX, dx's type might be number or function
-  var displacementX = typeof indent === "function" ? indent(node) : indent * node.depth;
-  if (!dropCap) {
-    try {
-      if (node.id === node.parent.children[0].id) {
-        node.x += displacementX;
-        node.y = previousNode ? previousNode.y : 0;
-        return;
-      }
-    } catch (e) {
-      // skip to normal when a node has no parent
-    }
-  }
-  node.x += displacementX;
-  if (previousNode) {
-    node.y = previousNode.y + util.getHeight(previousNode, node, align);
-    if (previousNode.parent && node.parent.id !== previousNode.parent.id) {
-      // previous node has different parent
-      var prevParent = previousNode.parent;
-      var preY = prevParent.y + util.getHeight(prevParent, node, align);
-      node.y = preY > node.y ? preY : node.y;
-    }
-  } else {
-    node.y = 0;
-  }
-  return;
-}
-module.exports = function (root, indent, dropCap, align) {
-  var previousNode = null;
-  root.eachNode(function (node) {
-    positionNode(node, previousNode, indent, dropCap, align);
-    previousNode = node;
-  });
-};

package/lib/layout/mindmap.js

@@ -1,92 +0,0 @@
-var util = require('../util');
-function secondWalk(node, options) {
-  var totalHeight = 0;
-  if (!node.children.length) {
-    totalHeight = node.height;
-  } else {
-    node.children.forEach(function (c) {
-      totalHeight += secondWalk(c, options);
-    });
-  }
-  node._subTreeSep = options.getSubTreeSep(node.data);
-  node.totalHeight = Math.max(node.height, totalHeight) + 2 * node._subTreeSep;
-  return node.totalHeight;
-}
-function thirdWalk(node) {
-  var children = node.children;
-  var len = children.length;
-  if (len) {
-    children.forEach(function (c) {
-      thirdWalk(c);
-    });
-    var first = children[0];
-    var last = children[len - 1];
-    var childrenHeight = last.y - first.y + last.height;
-    var childrenTotalHeight = 0;
-    children.forEach(function (child) {
-      childrenTotalHeight += child.totalHeight;
-    });
-    if (childrenHeight > node.height) {
-      // 当子节点总高度大于父节点高度
-      node.y = first.y + childrenHeight / 2 - node.height / 2;
-    } else if (children.length !== 1 || node.height > childrenTotalHeight) {
-      // 多于一个子节点或者父节点大于所有子节点的总高度
-      var offset = node.y + (node.height - childrenHeight) / 2 - first.y;
-      children.forEach(function (c) {
-        c.translate(0, offset);
-      });
-    } else {
-      // 只有一个子节点
-      node.y = (first.y + first.height / 2 + last.y + last.height / 2) / 2 - node.height / 2;
-    }
-  }
-}
-var DEFAULT_OPTIONS = {
-  getSubTreeSep: function getSubTreeSep() {
-    return 0;
-  }
-};
-module.exports = function (root, options) {
-  if (options === void 0) {
-    options = {};
-  }
-  options = util.assign({}, DEFAULT_OPTIONS, options);
-  root.parent = {
-    x: 0,
-    width: 0,
-    height: 0,
-    y: 0
-  };
-  // first walk
-  root.BFTraverse(function (node) {
-    node.x = node.parent.x + node.parent.width; // simply get x
-  });
-  root.parent = null;
-  // second walk
-  secondWalk(root, options); // assign sub tree totalHeight
-  // adjusting
-  // separating nodes
-  root.startY = 0;
-  root.y = root.totalHeight / 2 - root.height / 2;
-  root.eachNode(function (node) {
-    var children = node.children;
-    var len = children.length;
-    if (len) {
-      var first = children[0];
-      first.startY = node.startY + node._subTreeSep;
-      if (len === 1) {
-        first.y = node.y + node.height / 2 - first.height / 2;
-      } else {
-        first.y = first.startY + first.totalHeight / 2 - first.height / 2;
-        for (var i = 1; i < len; i++) {
-          var c = children[i];
-          c.startY = children[i - 1].startY + children[i - 1].totalHeight;
-          c.y = c.startY + c.totalHeight / 2 - c.height / 2;
-        }
-      }
-    }
-  });
-
-  // third walk
-  thirdWalk(root);
-};

package/lib/layout/non-layered-tidy.js

@@ -1,236 +0,0 @@
-// wrap tree node
-function WrappedTree(w, h, y, c) {
-  if (c === void 0) {
-    c = [];
-  }
-  var me = this;
-  // size
-  me.w = w || 0;
-  me.h = h || 0;
-
-  // position
-  me.y = y || 0;
-  me.x = 0;
-
-  // children
-  me.c = c || [];
-  me.cs = c.length;
-
-  // modified
-  me.prelim = 0;
-  me.mod = 0;
-  me.shift = 0;
-  me.change = 0;
-
-  // left/right tree
-  me.tl = null;
-  me.tr = null;
-
-  // extreme left/right tree
-  me.el = null;
-  me.er = null;
-
-  // modified left/right tree
-  me.msel = 0;
-  me.mser = 0;
-}
-WrappedTree.fromNode = function (root, isHorizontal) {
-  if (!root) return null;
-  var children = [];
-  root.children.forEach(function (child) {
-    children.push(WrappedTree.fromNode(child, isHorizontal));
-  });
-  if (isHorizontal) return new WrappedTree(root.height, root.width, root.x, children);
-  return new WrappedTree(root.width, root.height, root.y, children);
-};
-
-// node utils
-function moveRight(node, move, isHorizontal) {
-  if (isHorizontal) {
-    node.y += move;
-  } else {
-    node.x += move;
-  }
-  node.children.forEach(function (child) {
-    moveRight(child, move, isHorizontal);
-  });
-}
-function getMin(node, isHorizontal) {
-  var res = isHorizontal ? node.y : node.x;
-  node.children.forEach(function (child) {
-    res = Math.min(getMin(child, isHorizontal), res);
-  });
-  return res;
-}
-function normalize(node, isHorizontal) {
-  var min = getMin(node, isHorizontal);
-  moveRight(node, -min, isHorizontal);
-}
-function convertBack(converted /* WrappedTree */, root /* TreeNode */, isHorizontal) {
-  if (isHorizontal) {
-    root.y = converted.x;
-  } else {
-    root.x = converted.x;
-  }
-  converted.c.forEach(function (child, i) {
-    convertBack(child, root.children[i], isHorizontal);
-  });
-}
-function layer(node, isHorizontal, d) {
-  if (d === void 0) {
-    d = 0;
-  }
-  if (isHorizontal) {
-    node.x = d;
-    d += node.width;
-  } else {
-    node.y = d;
-    d += node.height;
-  }
-  node.children.forEach(function (child) {
-    layer(child, isHorizontal, d);
-  });
-}
-module.exports = function (root, options) {
-  if (options === void 0) {
-    options = {};
-  }
-  var isHorizontal = options.isHorizontal;
-  function firstWalk(t) {
-    if (t.cs === 0) {
-      setExtremes(t);
-      return;
-    }
-    firstWalk(t.c[0]);
-    var ih = updateIYL(bottom(t.c[0].el), 0, null);
-    for (var i = 1; i < t.cs; ++i) {
-      firstWalk(t.c[i]);
-      var min = bottom(t.c[i].er);
-      separate(t, i, ih);
-      ih = updateIYL(min, i, ih);
-    }
-    positionRoot(t);
-    setExtremes(t);
-  }
-  function setExtremes(t) {
-    if (t.cs === 0) {
-      t.el = t;
-      t.er = t;
-      t.msel = t.mser = 0;
-    } else {
-      t.el = t.c[0].el;
-      t.msel = t.c[0].msel;
-      t.er = t.c[t.cs - 1].er;
-      t.mser = t.c[t.cs - 1].mser;
-    }
-  }
-  function separate(t, i, ih) {
-    var sr = t.c[i - 1];
-    var mssr = sr.mod;
-    var cl = t.c[i];
-    var mscl = cl.mod;
-    while (sr !== null && cl !== null) {
-      if (bottom(sr) > ih.low) ih = ih.nxt;
-      var dist = mssr + sr.prelim + sr.w - (mscl + cl.prelim);
-      if (dist > 0) {
-        mscl += dist;
-        moveSubtree(t, i, ih.index, dist);
-      }
-      var sy = bottom(sr);
-      var cy = bottom(cl);
-      if (sy <= cy) {
-        sr = nextRightContour(sr);
-        if (sr !== null) mssr += sr.mod;
-      }
-      if (sy >= cy) {
-        cl = nextLeftContour(cl);
-        if (cl !== null) mscl += cl.mod;
-      }
-    }
-    if (!sr && !!cl) {
-      setLeftThread(t, i, cl, mscl);
-    } else if (!!sr && !cl) {
-      setRightThread(t, i, sr, mssr);
-    }
-  }
-  function moveSubtree(t, i, si, dist) {
-    t.c[i].mod += dist;
-    t.c[i].msel += dist;
-    t.c[i].mser += dist;
-    distributeExtra(t, i, si, dist);
-  }
-  function nextLeftContour(t) {
-    return t.cs === 0 ? t.tl : t.c[0];
-  }
-  function nextRightContour(t) {
-    return t.cs === 0 ? t.tr : t.c[t.cs - 1];
-  }
-  function bottom(t) {
-    return t.y + t.h;
-  }
-  function setLeftThread(t, i, cl, modsumcl) {
-    var li = t.c[0].el;
-    li.tl = cl;
-    var diff = modsumcl - cl.mod - t.c[0].msel;
-    li.mod += diff;
-    li.prelim -= diff;
-    t.c[0].el = t.c[i].el;
-    t.c[0].msel = t.c[i].msel;
-  }
-  function setRightThread(t, i, sr, modsumsr) {
-    var ri = t.c[i].er;
-    ri.tr = sr;
-    var diff = modsumsr - sr.mod - t.c[i].mser;
-    ri.mod += diff;
-    ri.prelim -= diff;
-    t.c[i].er = t.c[i - 1].er;
-    t.c[i].mser = t.c[i - 1].mser;
-  }
-  function positionRoot(t) {
-    t.prelim = (t.c[0].prelim + t.c[0].mod + t.c[t.cs - 1].mod + t.c[t.cs - 1].prelim + t.c[t.cs - 1].w) / 2 - t.w / 2;
-  }
-  function secondWalk(t, modsum) {
-    modsum += t.mod;
-    t.x = t.prelim + modsum;
-    addChildSpacing(t);
-    for (var i = 0; i < t.cs; i++) {
-      secondWalk(t.c[i], modsum);
-    }
-  }
-  function distributeExtra(t, i, si, dist) {
-    if (si !== i - 1) {
-      var nr = i - si;
-      t.c[si + 1].shift += dist / nr;
-      t.c[i].shift -= dist / nr;
-      t.c[i].change -= dist - dist / nr;
-    }
-  }
-  function addChildSpacing(t) {
-    var d = 0;
-    var modsumdelta = 0;
-    for (var i = 0; i < t.cs; i++) {
-      d += t.c[i].shift;
-      modsumdelta += d + t.c[i].change;
-      t.c[i].mod += modsumdelta;
-    }
-  }
-  function updateIYL(low, index, ih) {
-    while (ih !== null && low >= ih.low) {
-      ih = ih.nxt;
-    }
-    return {
-      low: low,
-      index: index,
-      nxt: ih
-    };
-  }
-
-  // do layout
-  layer(root, isHorizontal);
-  var wt = WrappedTree.fromNode(root, isHorizontal);
-  firstWalk(wt);
-  secondWalk(wt, 0);
-  convertBack(wt, root, isHorizontal);
-  normalize(root, isHorizontal);
-  return root;
-};

package/lib/layout/separate-root.js

@@ -1,39 +0,0 @@
-var hierarchy = require('./hierarchy');
-module.exports = function (root, options) {
-  // separate into left and right trees
-  var left = hierarchy(root.data, options, true); // root only
-  var right = hierarchy(root.data, options, true); // root only
-  // automatically
-  var treeSize = root.children.length;
-  var rightTreeSize = Math.round(treeSize / 2);
-  // separate left and right tree by meta data
-  var getSide = options.getSide || function (child, index) {
-    if (index < rightTreeSize) {
-      return 'right';
-    }
-    return 'left';
-  };
-  for (var i = 0; i < treeSize; i++) {
-    var child = root.children[i];
-    var side = getSide(child, i);
-    if (side === 'right') {
-      right.children.push(child);
-    } else {
-      left.children.push(child);
-    }
-  }
-  left.eachNode(function (node) {
-    if (!node.isRoot()) {
-      node.side = 'left';
-    }
-  });
-  right.eachNode(function (node) {
-    if (!node.isRoot()) {
-      node.side = 'right';
-    }
-  });
-  return {
-    left: left,
-    right: right
-  };
-};

package/lib/mindmap.js

@@ -1,24 +0,0 @@
-function _inheritsLoose(t, o) { t.prototype = Object.create(o.prototype), t.prototype.constructor = t, _setPrototypeOf(t, o); }
-function _setPrototypeOf(t, e) { return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) { return t.__proto__ = e, t; }, _setPrototypeOf(t, e); }
-var TreeLayout = require('./layout/base');
-var mindmap = require('./layout/mindmap');
-var doTreeLayout = require('./layout/do-layout');
-var util = require('./util');
-var MindmapLayout = /*#__PURE__*/function (_TreeLayout) {
-  function MindmapLayout() {
-    return _TreeLayout.apply(this, arguments) || this;
-  }
-  _inheritsLoose(MindmapLayout, _TreeLayout);
-  var _proto = MindmapLayout.prototype;
-  _proto.execute = function execute() {
-    var me = this;
-    return doTreeLayout(me.rootNode, me.options, mindmap);
-  };
-  return MindmapLayout;
-}(TreeLayout);
-var DEFAULT_OPTIONS = {};
-function mindmapLayout(root, options) {
-  options = util.assign({}, DEFAULT_OPTIONS, options);
-  return new MindmapLayout(root, options).execute();
-}
-module.exports = mindmapLayout;

package/lib/util.js

@@ -1,18 +0,0 @@
-/**
- * Get average height or height for node's position calculation, according to align.
- * @param {*} preNode previous node
- * @param {*} node current node, whose position is going to be calculated
- * @param {'center' | undefined} align 'center' means nodes align at the center, other value means align at the left-top
- * @param {string} heightField field name for height value on preNode and node
- * @return {number} the height for calculation
- */
-function getHeight(preNode, node, align, heightField) {
-  if (heightField === void 0) {
-    heightField = 'height';
-  }
-  return align === 'center' ? (preNode[heightField] + node[heightField]) / 2 : preNode.height;
-}
-module.exports = {
-  assign: Object.assign,
-  getHeight: getHeight
-};

package/src/compact-box.js

@@ -1,21 +0,0 @@
-const TreeLayout = require('./layout/base');
-const nonLayeredTidyTree = require('./layout/non-layered-tidy');
-const doTreeLayout = require('./layout/do-layout');
-const util = require('./util');
-
-class CompactBoxTreeLayout extends TreeLayout {
-  execute() {
-    const me = this;
-    return doTreeLayout(me.rootNode, me.options, nonLayeredTidyTree);
-  }
-}
-
-const DEFAULT_OPTIONS = {
-};
-
-function compactBoxLayout(root, options) {
-  options = util.assign({}, DEFAULT_OPTIONS, options);
-  return new CompactBoxTreeLayout(root, options).execute();
-}
-
-module.exports = compactBoxLayout;

package/src/dendrogram.js

@@ -1,22 +0,0 @@
-const TreeLayout = require('./layout/base');
-const dendrogram = require('./layout/dendrogram');
-const doTreeLayout = require('./layout/do-layout');
-const util = require('./util');
-
-class DendrogramLayout extends TreeLayout {
-  execute() {
-    const me = this;
-    me.rootNode.width = 0;
-    return doTreeLayout(me.rootNode, me.options, dendrogram);
-  }
-}
-
-const DEFAULT_OPTIONS = {
-};
-
-function dendrogramLayout(root, options) {
-  options = util.assign({}, DEFAULT_OPTIONS, options);
-  return new DendrogramLayout(root, options).execute();
-}
-
-module.exports = dendrogramLayout;