office-viewer 0.3.13 → 0.3.14

package/esm/node_modules/echarts/lib/chart/tree/layoutHelper.js

@@ -1,234 +0,0 @@
-import { getLayoutRect } from '../../util/layout.js';
-
-/**
- * Initialize all computational message for following algorithm.
- */
-function init(inRoot) {
-  var root = inRoot;
-  root.hierNode = {
-    defaultAncestor: null,
-    ancestor: root,
-    prelim: 0,
-    modifier: 0,
-    change: 0,
-    shift: 0,
-    i: 0,
-    thread: null
-  };
-  var nodes = [root];
-  var node;
-  var children;
-  while (node = nodes.pop()) {
-    // jshint ignore:line
-    children = node.children;
-    if (node.isExpand && children.length) {
-      var n = children.length;
-      for (var i = n - 1; i >= 0; i--) {
-        var child = children[i];
-        child.hierNode = {
-          defaultAncestor: null,
-          ancestor: child,
-          prelim: 0,
-          modifier: 0,
-          change: 0,
-          shift: 0,
-          i: i,
-          thread: null
-        };
-        nodes.push(child);
-      }
-    }
-  }
-}
-/**
- * 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.
- */
-function firstWalk(node, separation) {
-  var children = node.isExpand ? node.children : [];
-  var siblings = node.parentNode.children;
-  var subtreeW = node.hierNode.i ? siblings[node.hierNode.i - 1] : null;
-  if (children.length) {
-    executeShifts(node);
-    var midPoint = (children[0].hierNode.prelim + children[children.length - 1].hierNode.prelim) / 2;
-    if (subtreeW) {
-      node.hierNode.prelim = subtreeW.hierNode.prelim + separation(node, subtreeW);
-      node.hierNode.modifier = node.hierNode.prelim - midPoint;
-    } else {
-      node.hierNode.prelim = midPoint;
-    }
-  } else if (subtreeW) {
-    node.hierNode.prelim = subtreeW.hierNode.prelim + separation(node, subtreeW);
-  }
-  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.
- */
-function secondWalk(node) {
-  var nodeX = node.hierNode.prelim + node.parentNode.hierNode.modifier;
-  node.setLayout({
-    x: nodeX
-  }, true);
-  node.hierNode.modifier += node.parentNode.hierNode.modifier;
-}
-function separation(cb) {
-  return arguments.length ? cb : defaultSeparation;
-}
-/**
- * Transform the common coordinate to radial coordinate.
- */
-function radialCoordinate(rad, r) {
-  rad -= Math.PI / 2;
-  return {
-    x: r * Math.cos(rad),
-    y: r * Math.sin(rad)
-  };
-}
-/**
- * Get the layout position of the whole view.
- */
-function getViewRect(seriesModel, api) {
-  return getLayoutRect(seriesModel.getBoxLayoutParams(), {
-    width: api.getWidth(),
-    height: api.getHeight()
-  });
-}
-/**
- * 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.
- */
-function executeShifts(node) {
-  var children = node.children;
-  var n = children.length;
-  var shift = 0;
-  var change = 0;
-  while (--n >= 0) {
-    var child = children[n];
-    child.hierNode.prelim += shift;
-    child.hierNode.modifier += shift;
-    change += child.hierNode.change;
-    shift += child.hierNode.shift + 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.
- *
- * 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.
- * Whenever two nodes of the inside contours conflict, we compute the left
- * 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).
- */
-function apportion(subtreeV, subtreeW, ancestor, separation) {
-  if (subtreeW) {
-    var nodeOutRight = subtreeV;
-    var nodeInRight = subtreeV;
-    var nodeOutLeft = nodeInRight.parentNode.children[0];
-    var nodeInLeft = subtreeW;
-    var sumOutRight = nodeOutRight.hierNode.modifier;
-    var sumInRight = nodeInRight.hierNode.modifier;
-    var sumOutLeft = nodeOutLeft.hierNode.modifier;
-    var sumInLeft = nodeInLeft.hierNode.modifier;
-    while (nodeInLeft = nextRight(nodeInLeft), nodeInRight = nextLeft(nodeInRight), nodeInLeft && nodeInRight) {
-      nodeOutRight = nextRight(nodeOutRight);
-      nodeOutLeft = nextLeft(nodeOutLeft);
-      nodeOutRight.hierNode.ancestor = subtreeV;
-      var shift = nodeInLeft.hierNode.prelim + sumInLeft - nodeInRight.hierNode.prelim - sumInRight + separation(nodeInLeft, nodeInRight);
-      if (shift > 0) {
-        moveSubtree(nextAncestor(nodeInLeft, subtreeV, ancestor), subtreeV, shift);
-        sumInRight += shift;
-        sumOutRight += shift;
-      }
-      sumInLeft += nodeInLeft.hierNode.modifier;
-      sumInRight += nodeInRight.hierNode.modifier;
-      sumOutRight += nodeOutRight.hierNode.modifier;
-      sumOutLeft += nodeOutLeft.hierNode.modifier;
-    }
-    if (nodeInLeft && !nextRight(nodeOutRight)) {
-      nodeOutRight.hierNode.thread = nodeInLeft;
-      nodeOutRight.hierNode.modifier += sumInLeft - sumOutRight;
-    }
-    if (nodeInRight && !nextLeft(nodeOutLeft)) {
-      nodeOutLeft.hierNode.thread = nodeInRight;
-      nodeOutLeft.hierNode.modifier += sumInRight - sumOutLeft;
-      ancestor = subtreeV;
-    }
-  }
-  return ancestor;
-}
-/**
- * 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.
- */
-function nextRight(node) {
-  var children = node.children;
-  return children.length && node.isExpand ? children[children.length - 1] : node.hierNode.thread;
-}
-/**
- * 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.
- */
-function nextLeft(node) {
-  var children = node.children;
-  return children.length && node.isExpand ? children[0] : node.hierNode.thread;
-}
-/**
- * If nodeInLeft’s ancestor is a sibling of node, returns nodeInLeft’s ancestor.
- * Otherwise, returns the specified ancestor.
- */
-function nextAncestor(nodeInLeft, node, ancestor) {
-  return nodeInLeft.hierNode.ancestor.parentNode === node.parentNode ? nodeInLeft.hierNode.ancestor : ancestor;
-}
-/**
- * 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.
- */
-function moveSubtree(wl, wr, shift) {
-  var change = shift / (wr.hierNode.i - wl.hierNode.i);
-  wr.hierNode.change -= change;
-  wr.hierNode.shift += shift;
-  wr.hierNode.modifier += 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;
-}
-
-export { firstWalk, getViewRect, init, radialCoordinate, secondWalk, separation };

package/esm/node_modules/echarts/lib/chart/tree/traversalHelper.js

@@ -1,87 +0,0 @@
-/*
-* Licensed to the Apache Software Foundation (ASF) under one
-* or more contributor license agreements.  See the NOTICE file
-* distributed with this work for additional information
-* regarding copyright ownership.  The ASF licenses this file
-* to you under the Apache License, Version 2.0 (the
-* "License"); you may not use this file except in compliance
-* with the License.  You may obtain a copy of the License at
-*
-*   http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing,
-* software distributed under the License is distributed on an
-* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
-* KIND, either express or implied.  See the License for the
-* specific language governing permissions and limitations
-* under the License.
-*/
-
-
-/**
- * AUTO-GENERATED FILE. DO NOT MODIFY.
- */
-
-/*
-* Licensed to the Apache Software Foundation (ASF) under one
-* or more contributor license agreements.  See the NOTICE file
-* distributed with this work for additional information
-* regarding copyright ownership.  The ASF licenses this file
-* to you under the Apache License, Version 2.0 (the
-* "License"); you may not use this file except in compliance
-* with the License.  You may obtain a copy of the License at
-*
-*   http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing,
-* software distributed under the License is distributed on an
-* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
-* KIND, either express or implied.  See the License for the
-* specific language governing permissions and limitations
-* under the License.
-*/
-/**
- * Traverse the tree from bottom to top and do something
- */
-function eachAfter(root, callback, separation) {
-  var nodes = [root];
-  var next = [];
-  var node;
-  while (node = nodes.pop()) {
-    // jshint ignore:line
-    next.push(node);
-    if (node.isExpand) {
-      var children = node.children;
-      if (children.length) {
-        for (var i = 0; i < children.length; i++) {
-          nodes.push(children[i]);
-        }
-      }
-    }
-  }
-  while (node = next.pop()) {
-    // jshint ignore:line
-    callback(node, separation);
-  }
-}
-/**
- * Traverse the tree from top to bottom and do something
- */
-function eachBefore(root, callback) {
-  var nodes = [root];
-  var node;
-  while (node = nodes.pop()) {
-    // jshint ignore:line
-    callback(node);
-    if (node.isExpand) {
-      var children = node.children;
-      if (children.length) {
-        for (var i = children.length - 1; i >= 0; i--) {
-          nodes.push(children[i]);
-        }
-      }
-    }
-  }
-}
-
-export { eachAfter, eachBefore };

package/esm/node_modules/echarts/lib/chart/tree/treeAction.js

@@ -1,42 +0,0 @@
-import { updateCenterAndZoom } from '../../action/roamHelper.js';
-
-function installTreeAction(registers) {
-  registers.registerAction({
-    type: 'treeExpandAndCollapse',
-    event: 'treeExpandAndCollapse',
-    update: 'update'
-  }, function (payload, ecModel) {
-    ecModel.eachComponent({
-      mainType: 'series',
-      subType: 'tree',
-      query: payload
-    }, function (seriesModel) {
-      var dataIndex = payload.dataIndex;
-      var tree = seriesModel.getData().tree;
-      var node = tree.getNodeByDataIndex(dataIndex);
-      node.isExpand = !node.isExpand;
-    });
-  });
-  registers.registerAction({
-    type: 'treeRoam',
-    event: 'treeRoam',
-    // Here we set 'none' instead of 'update', because roam action
-    // just need to update the transform matrix without having to recalculate
-    // the layout. So don't need to go through the whole update process, such
-    // as 'dataPrcocess', 'coordSystemUpdate', 'layout' and so on.
-    update: 'none'
-  }, function (payload, ecModel, api) {
-    ecModel.eachComponent({
-      mainType: 'series',
-      subType: 'tree',
-      query: payload
-    }, function (seriesModel) {
-      var coordSys = seriesModel.coordinateSystem;
-      var res = updateCenterAndZoom(coordSys, payload, undefined, api);
-      seriesModel.setCenter && seriesModel.setCenter(res.center);
-      seriesModel.setZoom && seriesModel.setZoom(res.zoom);
-    });
-  });
-}
-
-export { installTreeAction };

package/esm/node_modules/echarts/lib/chart/tree/treeLayout.js

@@ -1,99 +0,0 @@
-import { eachAfter, eachBefore } from './traversalHelper.js';
-import { getViewRect, init, separation, firstWalk, secondWalk, radialCoordinate } from './layoutHelper.js';
-
-function treeLayout(ecModel, api) {
-  ecModel.eachSeriesByType('tree', function (seriesModel) {
-    commonLayout(seriesModel, api);
-  });
-}
-function commonLayout(seriesModel, api) {
-  var layoutInfo = getViewRect(seriesModel, api);
-  seriesModel.layoutInfo = layoutInfo;
-  var layout = seriesModel.get('layout');
-  var width = 0;
-  var height = 0;
-  var separation$1 = null;
-  if (layout === 'radial') {
-    width = 2 * Math.PI;
-    height = Math.min(layoutInfo.height, layoutInfo.width) / 2;
-    separation$1 = separation(function (node1, node2) {
-      return (node1.parentNode === node2.parentNode ? 1 : 2) / node1.depth;
-    });
-  } else {
-    width = layoutInfo.width;
-    height = layoutInfo.height;
-    separation$1 = separation();
-  }
-  var virtualRoot = seriesModel.getData().tree.root;
-  var realRoot = virtualRoot.children[0];
-  if (realRoot) {
-    init(virtualRoot);
-    eachAfter(realRoot, firstWalk, separation$1);
-    virtualRoot.hierNode.modifier = -realRoot.hierNode.prelim;
-    eachBefore(realRoot, secondWalk);
-    var left_1 = realRoot;
-    var right_1 = realRoot;
-    var bottom_1 = realRoot;
-    eachBefore(realRoot, function (node) {
-      var x = node.getLayout().x;
-      if (x < left_1.getLayout().x) {
-        left_1 = node;
-      }
-      if (x > right_1.getLayout().x) {
-        right_1 = node;
-      }
-      if (node.depth > bottom_1.depth) {
-        bottom_1 = node;
-      }
-    });
-    var delta = left_1 === right_1 ? 1 : separation$1(left_1, right_1) / 2;
-    var tx_1 = delta - left_1.getLayout().x;
-    var kx_1 = 0;
-    var ky_1 = 0;
-    var coorX_1 = 0;
-    var coorY_1 = 0;
-    if (layout === 'radial') {
-      kx_1 = width / (right_1.getLayout().x + delta + tx_1);
-      // here we use (node.depth - 1), bucause the real root's depth is 1
-      ky_1 = height / (bottom_1.depth - 1 || 1);
-      eachBefore(realRoot, function (node) {
-        coorX_1 = (node.getLayout().x + tx_1) * kx_1;
-        coorY_1 = (node.depth - 1) * ky_1;
-        var finalCoor = radialCoordinate(coorX_1, coorY_1);
-        node.setLayout({
-          x: finalCoor.x,
-          y: finalCoor.y,
-          rawX: coorX_1,
-          rawY: coorY_1
-        }, true);
-      });
-    } else {
-      var orient_1 = seriesModel.getOrient();
-      if (orient_1 === 'RL' || orient_1 === 'LR') {
-        ky_1 = height / (right_1.getLayout().x + delta + tx_1);
-        kx_1 = width / (bottom_1.depth - 1 || 1);
-        eachBefore(realRoot, function (node) {
-          coorY_1 = (node.getLayout().x + tx_1) * ky_1;
-          coorX_1 = orient_1 === 'LR' ? (node.depth - 1) * kx_1 : width - (node.depth - 1) * kx_1;
-          node.setLayout({
-            x: coorX_1,
-            y: coorY_1
-          }, true);
-        });
-      } else if (orient_1 === 'TB' || orient_1 === 'BT') {
-        kx_1 = width / (right_1.getLayout().x + delta + tx_1);
-        ky_1 = height / (bottom_1.depth - 1 || 1);
-        eachBefore(realRoot, function (node) {
-          coorX_1 = (node.getLayout().x + tx_1) * kx_1;
-          coorY_1 = orient_1 === 'TB' ? (node.depth - 1) * ky_1 : height - (node.depth - 1) * ky_1;
-          node.setLayout({
-            x: coorX_1,
-            y: coorY_1
-          }, true);
-        });
-      }
-    }
-  }
-}
-
-export { treeLayout as default };

package/esm/node_modules/echarts/lib/chart/tree/treeVisual.js

@@ -1,17 +0,0 @@
-import { extend } from '../../../../zrender/lib/core/util.js';
-
-function treeVisual(ecModel) {
-  ecModel.eachSeriesByType('tree', function (seriesModel) {
-    var data = seriesModel.getData();
-    var tree = data.tree;
-    tree.eachNode(function (node) {
-      var model = node.getModel();
-      // TODO Optimize
-      var style = model.getModel('itemStyle').getItemStyle();
-      var existsStyle = data.ensureUniqueItemVisual(node.dataIndex, 'style');
-      extend(existsStyle, style);
-    });
-  });
-}
-
-export { treeVisual as default };

package/esm/node_modules/echarts/lib/chart/treemap/Breadcrumb.js

@@ -1,149 +0,0 @@
-import '../../util/graphic.js';
-import { getECData } from '../../util/innerStore.js';
-import { positionElement, getAvailableSize } from '../../util/layout.js';
-import { wrapTreePathInfo } from '../helper/treeHelper.js';
-import { defaults, curry } from '../../../../zrender/lib/core/util.js';
-import { convertOptionIdName } from '../../util/model.js';
-import { Z2_EMPHASIS_LIFT, toggleHoverEmphasis } from '../../util/states.js';
-import { createTextStyle } from '../../label/labelStyle.js';
-import Group from '../../../../zrender/lib/graphic/Group.js';
-import Polygon from '../../../../zrender/lib/graphic/shape/Polygon.js';
-import ZRText from '../../../../zrender/lib/graphic/Text.js';
-
-var TEXT_PADDING = 8;
-var ITEM_GAP = 8;
-var ARRAY_LENGTH = 5;
-var Breadcrumb = /** @class */function () {
-  function Breadcrumb(containerGroup) {
-    this.group = new Group();
-    containerGroup.add(this.group);
-  }
-  Breadcrumb.prototype.render = function (seriesModel, api, targetNode, onSelect) {
-    var model = seriesModel.getModel('breadcrumb');
-    var thisGroup = this.group;
-    thisGroup.removeAll();
-    if (!model.get('show') || !targetNode) {
-      return;
-    }
-    var normalStyleModel = model.getModel('itemStyle');
-    var emphasisModel = model.getModel('emphasis');
-    var textStyleModel = normalStyleModel.getModel('textStyle');
-    var emphasisTextStyleModel = emphasisModel.getModel(['itemStyle', 'textStyle']);
-    var layoutParam = {
-      pos: {
-        left: model.get('left'),
-        right: model.get('right'),
-        top: model.get('top'),
-        bottom: model.get('bottom')
-      },
-      box: {
-        width: api.getWidth(),
-        height: api.getHeight()
-      },
-      emptyItemWidth: model.get('emptyItemWidth'),
-      totalWidth: 0,
-      renderList: []
-    };
-    this._prepare(targetNode, layoutParam, textStyleModel);
-    this._renderContent(seriesModel, layoutParam, normalStyleModel, emphasisModel, textStyleModel, emphasisTextStyleModel, onSelect);
-    positionElement(thisGroup, layoutParam.pos, layoutParam.box);
-  };
-  /**
-   * Prepare render list and total width
-   * @private
-   */
-  Breadcrumb.prototype._prepare = function (targetNode, layoutParam, textStyleModel) {
-    for (var node = targetNode; node; node = node.parentNode) {
-      var text = convertOptionIdName(node.getModel().get('name'), '');
-      var textRect = textStyleModel.getTextRect(text);
-      var itemWidth = Math.max(textRect.width + TEXT_PADDING * 2, layoutParam.emptyItemWidth);
-      layoutParam.totalWidth += itemWidth + ITEM_GAP;
-      layoutParam.renderList.push({
-        node: node,
-        text: text,
-        width: itemWidth
-      });
-    }
-  };
-  /**
-   * @private
-   */
-  Breadcrumb.prototype._renderContent = function (seriesModel, layoutParam, normalStyleModel, emphasisModel, textStyleModel, emphasisTextStyleModel, onSelect) {
-    // Start rendering.
-    var lastX = 0;
-    var emptyItemWidth = layoutParam.emptyItemWidth;
-    var height = seriesModel.get(['breadcrumb', 'height']);
-    var availableSize = getAvailableSize(layoutParam.pos, layoutParam.box);
-    var totalWidth = layoutParam.totalWidth;
-    var renderList = layoutParam.renderList;
-    var emphasisItemStyle = emphasisModel.getModel('itemStyle').getItemStyle();
-    for (var i = renderList.length - 1; i >= 0; i--) {
-      var item = renderList[i];
-      var itemNode = item.node;
-      var itemWidth = item.width;
-      var text = item.text;
-      // Hdie text and shorten width if necessary.
-      if (totalWidth > availableSize.width) {
-        totalWidth -= itemWidth - emptyItemWidth;
-        itemWidth = emptyItemWidth;
-        text = null;
-      }
-      var el = new Polygon({
-        shape: {
-          points: makeItemPoints(lastX, 0, itemWidth, height, i === renderList.length - 1, i === 0)
-        },
-        style: defaults(normalStyleModel.getItemStyle(), {
-          lineJoin: 'bevel'
-        }),
-        textContent: new ZRText({
-          style: createTextStyle(textStyleModel, {
-            text: text
-          })
-        }),
-        textConfig: {
-          position: 'inside'
-        },
-        z2: Z2_EMPHASIS_LIFT * 1e4,
-        onclick: curry(onSelect, itemNode)
-      });
-      el.disableLabelAnimation = true;
-      el.getTextContent().ensureState('emphasis').style = createTextStyle(emphasisTextStyleModel, {
-        text: text
-      });
-      el.ensureState('emphasis').style = emphasisItemStyle;
-      toggleHoverEmphasis(el, emphasisModel.get('focus'), emphasisModel.get('blurScope'), emphasisModel.get('disabled'));
-      this.group.add(el);
-      packEventData(el, seriesModel, itemNode);
-      lastX += itemWidth + ITEM_GAP;
-    }
-  };
-  Breadcrumb.prototype.remove = function () {
-    this.group.removeAll();
-  };
-  return Breadcrumb;
-}();
-function makeItemPoints(x, y, itemWidth, itemHeight, head, tail) {
-  var points = [[head ? x : x - ARRAY_LENGTH, y], [x + itemWidth, y], [x + itemWidth, y + itemHeight], [head ? x : x - ARRAY_LENGTH, y + itemHeight]];
-  !tail && points.splice(2, 0, [x + itemWidth + ARRAY_LENGTH, y + itemHeight / 2]);
-  !head && points.push([x, y + itemHeight / 2]);
-  return points;
-}
-// Package custom mouse event.
-function packEventData(el, seriesModel, itemNode) {
-  getECData(el).eventData = {
-    componentType: 'series',
-    componentSubType: 'treemap',
-    componentIndex: seriesModel.componentIndex,
-    seriesIndex: seriesModel.seriesIndex,
-    seriesName: seriesModel.name,
-    seriesType: 'treemap',
-    selfType: 'breadcrumb',
-    nodeData: {
-      dataIndex: itemNode && itemNode.dataIndex,
-      name: itemNode && itemNode.name
-    },
-    treePathInfo: itemNode && wrapTreePathInfo(itemNode, seriesModel)
-  };
-}
-
-export { Breadcrumb as default };