{"version":3,"file":"hierarchy.js","sources":["webpack:///webpack/universalModuleDefinition","webpack:///webpack/bootstrap e4292a3fad3b97831f28","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-array.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-array-like.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-function.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-type.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-string.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-number.js","webpack:///./src/util.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-nil.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/each.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/to-string.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-plain-object.js","webpack:///./src/layout/base.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-object.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/contains.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-object-like.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/values.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/mix.js","webpack:///./src/layout/do-layout.js","webpack:///./src/layout/hierarchy.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/filter.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-match.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/keys.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/max.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/min.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/pull-at.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/reduce.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/uniq.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/group-to-map.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/group-by.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/has.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/get-type.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-prototype.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/memoize.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-equal.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/measure-text-width.js","webpack:///./src/layout/separate-root.js","webpack:///./src/index.js","webpack:///./src/compact-box.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/index.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/difference.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/find.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/find-index.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/first-value.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/flatten.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/flatten-deep.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/get-range.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/pull.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/remove.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/sort-by.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/union.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/values-of-key.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/head.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/last.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/starts-with.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/ends-with.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/every.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/some.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/group.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/get-wrap-behavior.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/wrap-behavior.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/number2color.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/parse-radius.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/clamp.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/fixed-base.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-decimal.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-even.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-integer.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-negative.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-number-equal.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-odd.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-positive.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/max-by.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/min-by.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/mod.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/to-degree.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/to-integer.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/to-radian.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/for-in.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/has-key.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/has-value.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/lower-case.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/lower-first.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/substitute.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/upper-case.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/upper-first.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-arguments.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-boolean.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-date.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-error.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-finite.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-null.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-reg-exp.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-undefined.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-element.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/request-animation-frame.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/clear-animation-frame.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/augment.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/clone.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/debounce.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/deep-mix.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/extend.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/index-of.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-empty.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-equal-with.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/map.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/map-values.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/get.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/set.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/pick.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/omit.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/throttle.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/to-array.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/unique-id.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/noop.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/identity.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/size.js","webpack:///./node_modules/_tslib@2.5.0@tslib/tslib.es6.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/get-ellipsis-text.js","webpack:///./node_modules/_@antv_util@2.0.17@@antv/util/esm/cache.js","webpack:///./src/layout/non-layered-tidy.js","webpack:///./src/dendrogram.js","webpack:///./src/layout/dendrogram.js","webpack:///./src/indented.js","webpack:///./src/layout/indented.js","webpack:///./src/mindmap.js","webpack:///./src/layout/mindmap.js"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Hierarchy\"] = factory();\n\telse\n\t\troot[\"Hierarchy\"] = factory();\n})(typeof self !== 'undefined' ? self : this, function() {\nreturn \n\n\n// WEBPACK FOOTER //\n// webpack/universalModuleDefinition"," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, {\n \t\t\t\tconfigurable: false,\n \t\t\t\tenumerable: true,\n \t\t\t\tget: getter\n \t\t\t});\n \t\t}\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"\";\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = 36);\n\n\n\n// WEBPACK FOOTER //\n// webpack/bootstrap e4292a3fad3b97831f28","import isType from './is-type';\nexport default (function (value) {\n  return Array.isArray ? Array.isArray(value) : isType(value, 'Array');\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-array.js\n// module id = 0\n// module chunks = 0","var isArrayLike = function (value) {\n  /**\n   * isArrayLike([1, 2, 3]) => true\n   * isArrayLike(document.body.children) => true\n   * isArrayLike('abc') => true\n   * isArrayLike(Function) => false\n   */\n  return value !== null && typeof value !== 'function' && isFinite(value.length);\n};\nexport default isArrayLike;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-array-like.js\n// module id = 1\n// module chunks = 0","/**\n * 是否为函数\n * @param  {*} fn 对象\n * @return {Boolean}  是否函数\n */\nimport isType from './is-type';\nexport default (function (value) {\n  return isType(value, 'Function');\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-function.js\n// module id = 2\n// module chunks = 0","var toString = {}.toString;\nvar isType = function (value, type) {\n  return toString.call(value) === '[object ' + type + ']';\n};\nexport default isType;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-type.js\n// module id = 3\n// module chunks = 0","import isType from './is-type';\nexport default (function (str) {\n  return isType(str, 'String');\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-string.js\n// module id = 4\n// module chunks = 0","/**\n * 判断是否数字\n * @return {Boolean} 是否数字\n */\nimport isType from './is-type';\nvar isNumber = function (value) {\n  return isType(value, 'Number');\n};\nexport default isNumber;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-number.js\n// module id = 5\n// module chunks = 0","var _require = require('@antv/util'),\n  mix = _require.mix;\n\n/**\n * Get average height or height for node's position calculation, according to align.\n * @param {*} preNode previous node\n * @param {*} node current node, whose position is going to be calculated\n * @param {'center' | undefined} align 'center' means nodes align at the center, other value means align at the left-top\n * @param {string} heightField field name for height value on preNode and node\n * @return {number} the height for calculation\n */\nfunction getHeight(preNode, node, align, heightField) {\n  if (heightField === void 0) {\n    heightField = 'height';\n  }\n  return align === 'center' ? (preNode[heightField] + node[heightField]) / 2 : preNode.height;\n}\nmodule.exports = {\n  assign: mix,\n  getHeight: getHeight\n};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/util.js\n// module id = 6\n// module chunks = 0","// isFinite,\nvar isNil = function (value) {\n  /**\n   * isNil(null) => true\n   * isNil() => true\n   */\n  return value === null || value === undefined;\n};\nexport default isNil;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-nil.js\n// module id = 7\n// module chunks = 0","import isArray from './is-array';\nimport isObject from './is-object';\nfunction each(elements, func) {\n  if (!elements) {\n    return;\n  }\n  var rst;\n  if (isArray(elements)) {\n    for (var i = 0, len = elements.length; i < len; i++) {\n      rst = func(elements[i], i);\n      if (rst === false) {\n        break;\n      }\n    }\n  } else if (isObject(elements)) {\n    for (var k in elements) {\n      if (elements.hasOwnProperty(k)) {\n        rst = func(elements[k], k);\n        if (rst === false) {\n          break;\n        }\n      }\n    }\n  }\n}\nexport default each;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/each.js\n// module id = 8\n// module chunks = 0","import isNil from './is-nil';\nexport default (function (value) {\n  if (isNil(value)) return '';\n  return value.toString();\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/to-string.js\n// module id = 9\n// module chunks = 0","import isObjectLike from './is-object-like';\nimport isType from './is-type';\nvar isPlainObject = function (value) {\n  /**\n   * isObjectLike(new Foo) => false\n   * isObjectLike([1, 2, 3]) => false\n   * isObjectLike({ x: 0, y: 0 }) => true\n   * isObjectLike(Object.create(null)) => true\n   */\n  if (!isObjectLike(value) || !isType(value, 'Object')) {\n    return false;\n  }\n  if (Object.getPrototypeOf(value) === null) {\n    return true;\n  }\n  var proto = value;\n  while (Object.getPrototypeOf(proto) !== null) {\n    proto = Object.getPrototypeOf(proto);\n  }\n  return Object.getPrototypeOf(value) === proto;\n};\nexport default isPlainObject;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-plain-object.js\n// module id = 10\n// module chunks = 0","var hierarchy = require('./hierarchy');\nvar Layout = /*#__PURE__*/function () {\n  function Layout(root, options) {\n    if (options === void 0) {\n      options = {};\n    }\n    var me = this;\n    me.options = options;\n    me.rootNode = hierarchy(root, options);\n  }\n  var _proto = Layout.prototype;\n  _proto.execute = function execute() {\n    throw new Error('please override this method');\n  };\n  return Layout;\n}();\nmodule.exports = Layout;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/layout/base.js\n// module id = 11\n// module chunks = 0","export default (function (value) {\n  /**\n   * isObject({}) => true\n   * isObject([1, 2, 3]) => true\n   * isObject(Function) => true\n   * isObject(null) => false\n   */\n  var type = typeof value;\n  return value !== null && type === 'object' || type === 'function';\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-object.js\n// module id = 12\n// module chunks = 0","import isArrayLike from './is-array-like';\nvar contains = function (arr, value) {\n  if (!isArrayLike(arr)) {\n    return false;\n  }\n  return arr.indexOf(value) > -1;\n};\nexport default contains;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/contains.js\n// module id = 13\n// module chunks = 0","var isObjectLike = function (value) {\n  /**\n   * isObjectLike({}) => true\n   * isObjectLike([1, 2, 3]) => true\n   * isObjectLike(Function) => false\n   * isObjectLike(null) => false\n   */\n  return typeof value === 'object' && value !== null;\n};\nexport default isObjectLike;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-object-like.js\n// module id = 14\n// module chunks = 0","import each from './each';\nimport isFunction from './is-function';\n// @ts-ignore\nvar values = Object.values ? function (obj) {\n  return Object.values(obj);\n} : function (obj) {\n  var result = [];\n  each(obj, function (value, key) {\n    if (!(isFunction(obj) && key === 'prototype')) {\n      result.push(value);\n    }\n  });\n  return result;\n};\nexport default values;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/values.js\n// module id = 15\n// module chunks = 0","// FIXME: Mutable param should be forbidden in static lang.\nfunction _mix(dist, obj) {\n  for (var key in obj) {\n    if (obj.hasOwnProperty(key) && key !== 'constructor' && obj[key] !== undefined) {\n      dist[key] = obj[key];\n    }\n  }\n}\nexport default function mix(dist, src1, src2, src3) {\n  if (src1) _mix(dist, src1);\n  if (src2) _mix(dist, src2);\n  if (src3) _mix(dist, src3);\n  return dist;\n}\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/mix.js\n// module id = 16\n// module chunks = 0","var separateTree = require('./separate-root');\nvar VALID_DIRECTIONS = ['LR',\n// left to right\n'RL',\n// right to left\n'TB',\n// top to bottom\n'BT',\n// bottom to top\n'H',\n// horizontal\n'V' // vertical\n];\n\nvar HORIZONTAL_DIRECTIONS = ['LR', 'RL', 'H'];\nvar isHorizontal = function isHorizontal(direction) {\n  return HORIZONTAL_DIRECTIONS.indexOf(direction) > -1;\n};\nvar DEFAULT_DIRECTION = VALID_DIRECTIONS[0];\nmodule.exports = function (root, options, layoutAlgrithm) {\n  var direction = options.direction || DEFAULT_DIRECTION;\n  options.isHorizontal = isHorizontal(direction);\n  if (direction && VALID_DIRECTIONS.indexOf(direction) === -1) {\n    throw new TypeError(\"Invalid direction: \" + direction);\n  }\n  if (direction === VALID_DIRECTIONS[0]) {\n    // LR\n    layoutAlgrithm(root, options);\n  } else if (direction === VALID_DIRECTIONS[1]) {\n    // RL\n    layoutAlgrithm(root, options);\n    root.right2left();\n  } else if (direction === VALID_DIRECTIONS[2]) {\n    // TB\n    layoutAlgrithm(root, options);\n  } else if (direction === VALID_DIRECTIONS[3]) {\n    // BT\n    layoutAlgrithm(root, options);\n    root.bottom2top();\n  } else if (direction === VALID_DIRECTIONS[4] || direction === VALID_DIRECTIONS[5]) {\n    // H or V\n    // separate into left and right trees\n    var _separateTree = separateTree(root, options),\n      left = _separateTree.left,\n      right = _separateTree.right;\n    // do layout for left and right trees\n    layoutAlgrithm(left, options);\n    layoutAlgrithm(right, options);\n    options.isHorizontal ? left.right2left() : left.bottom2top();\n    // combine left and right trees\n    right.translate(left.x - right.x, left.y - right.y);\n    // translate root\n    root.x = left.x;\n    root.y = right.y;\n    var bb = root.getBoundingBox();\n    if (options.isHorizontal) {\n      if (bb.top < 0) {\n        root.translate(0, -bb.top);\n      }\n    } else {\n      if (bb.left < 0) {\n        root.translate(-bb.left, 0);\n      }\n    }\n  }\n  // fixed root position, default value is true\n  var fixedRoot = options.fixedRoot;\n  if (fixedRoot === undefined) fixedRoot = true;\n  if (fixedRoot) {\n    root.translate(-(root.x + root.width / 2 + root.hgap), -(root.y + root.height / 2 + root.vgap));\n  }\n  return root;\n};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/layout/do-layout.js\n// module id = 17\n// module chunks = 0","/* eslint-disable no-cond-assign */\nvar util = require('../util');\nvar PEM = 18;\nvar DEFAULT_HEIGHT = PEM * 2;\nvar DEFAULT_GAP = PEM;\nvar DEFAULT_OPTIONS = {\n  getId: function getId(d) {\n    return d.id || d.name;\n  },\n  getPreH: function getPreH(d) {\n    return d.preH || 0;\n  },\n  getPreV: function getPreV(d) {\n    return d.preV || 0;\n  },\n  getHGap: function getHGap(d) {\n    return d.hgap || DEFAULT_GAP;\n  },\n  getVGap: function getVGap(d) {\n    return d.vgap || DEFAULT_GAP;\n  },\n  getChildren: function getChildren(d) {\n    return d.children;\n  },\n  getHeight: function getHeight(d) {\n    return d.height || DEFAULT_HEIGHT;\n  },\n  getWidth: function getWidth(d) {\n    var label = d.label || ' ';\n    return d.width || label.split('').length * PEM; // FIXME DO NOT get width like this\n  }\n};\n\nfunction Node(data, options) {\n  var me = this;\n  me.vgap = me.hgap = 0;\n  if (data instanceof Node) return data;\n  me.data = data;\n  /*\n   * Gaps: filling space between nodes\n   * (x, y) ----------------------\n   * |            vgap            |\n   * |    --------------------    h\n   * | h |                    |   e\n   * | g |                    |   i\n   * | a |                    |   g\n   * | p |                    |   h\n   * |   ---------------------    t\n   * |                            |\n   *  -----------width------------\n   */\n  var hgap = options.getHGap(data);\n  var vgap = options.getVGap(data);\n  me.preH = options.getPreH(data);\n  me.preV = options.getPreV(data);\n  me.width = options.getWidth(data);\n  me.height = options.getHeight(data);\n  me.width += me.preH;\n  me.height += me.preV;\n  me.id = options.getId(data);\n  me.x = me.y = 0;\n  me.depth = 0;\n  if (!me.children) {\n    me.children = [];\n  }\n  me.addGap(hgap, vgap);\n  return me;\n}\nutil.assign(Node.prototype, {\n  isRoot: function isRoot() {\n    return this.depth === 0;\n  },\n  isLeaf: function isLeaf() {\n    return this.children.length === 0;\n  },\n  addGap: function addGap(hgap, vgap) {\n    var me = this;\n    me.hgap += hgap;\n    me.vgap += vgap;\n    me.width += 2 * hgap;\n    me.height += 2 * vgap;\n  },\n  eachNode: function eachNode(callback) {\n    // Depth First traverse\n    var me = this;\n    var nodes = [me];\n    var current;\n    while (current = nodes.shift()) {\n      callback(current);\n      nodes = current.children.concat(nodes);\n    }\n  },\n  DFTraverse: function DFTraverse(callback) {\n    // Depth First traverse\n    this.eachNode(callback);\n  },\n  BFTraverse: function BFTraverse(callback) {\n    // Breadth First traverse\n    var me = this;\n    var nodes = [me];\n    var current;\n    while (current = nodes.shift()) {\n      callback(current);\n      nodes = nodes.concat(current.children);\n    }\n  },\n  getBoundingBox: function getBoundingBox() {\n    // BBox for just one tree node\n    var bb = {\n      left: Number.MAX_VALUE,\n      top: Number.MAX_VALUE,\n      width: 0,\n      height: 0\n    };\n    this.eachNode(function (node) {\n      bb.left = Math.min(bb.left, node.x);\n      bb.top = Math.min(bb.top, node.y);\n      bb.width = Math.max(bb.width, node.x + node.width);\n      bb.height = Math.max(bb.height, node.y + node.height);\n    });\n    return bb;\n  },\n  // translate\n  translate: function translate(tx, ty) {\n    if (tx === void 0) {\n      tx = 0;\n    }\n    if (ty === void 0) {\n      ty = 0;\n    }\n    this.eachNode(function (node) {\n      node.x += tx;\n      node.y += ty;\n      node.x += node.preH;\n      node.y += node.preV;\n    });\n  },\n  right2left: function right2left() {\n    var me = this;\n    var bb = me.getBoundingBox();\n    me.eachNode(function (node) {\n      node.x = node.x - (node.x - bb.left) * 2 - node.width;\n      // node.x = - node.x;\n    });\n\n    me.translate(bb.width, 0);\n  },\n  bottom2top: function bottom2top() {\n    var me = this;\n    var bb = me.getBoundingBox();\n    me.eachNode(function (node) {\n      node.y = node.y - (node.y - bb.top) * 2 - node.height;\n      // node.y = - node.y;\n    });\n\n    me.translate(0, bb.height);\n  }\n});\nfunction hierarchy(data, options, isolated) {\n  if (options === void 0) {\n    options = {};\n  }\n  options = util.assign({}, DEFAULT_OPTIONS, options);\n  var root = new Node(data, options);\n  var nodes = [root];\n  var node;\n  if (!isolated && !data.collapsed) {\n    while (node = nodes.shift()) {\n      if (!node.data.collapsed) {\n        var children = options.getChildren(node.data);\n        var length = children ? children.length : 0;\n        node.children = new Array(length);\n        if (children && length) {\n          for (var i = 0; i < length; i++) {\n            var child = new Node(children[i], options);\n            node.children[i] = child;\n            nodes.push(child);\n            child.parent = node;\n            child.depth = node.depth + 1;\n          }\n        }\n      }\n    }\n  }\n  return root;\n}\nmodule.exports = hierarchy;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/layout/hierarchy.js\n// module id = 18\n// module chunks = 0","import isArrayLike from './is-array-like';\nvar filter = function (arr, func) {\n  if (!isArrayLike(arr)) {\n    return arr;\n  }\n  var result = [];\n  for (var index = 0; index < arr.length; index++) {\n    var value = arr[index];\n    if (func(value, index)) {\n      result.push(value);\n    }\n  }\n  return result;\n};\nexport default filter;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/filter.js\n// module id = 19\n// module chunks = 0","import isNil from './is-nil';\nimport keys from './keys';\nfunction isMatch(obj, attrs) {\n  var _keys = keys(attrs);\n  var length = _keys.length;\n  if (isNil(obj)) return !length;\n  for (var i = 0; i < length; i += 1) {\n    var key = _keys[i];\n    if (attrs[key] !== obj[key] || !(key in obj)) {\n      return false;\n    }\n  }\n  return true;\n}\nexport default isMatch;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-match.js\n// module id = 20\n// module chunks = 0","import each from './each';\nimport isFunction from './is-function';\nvar keys = Object.keys ? function (obj) {\n  return Object.keys(obj);\n} : function (obj) {\n  var result = [];\n  each(obj, function (value, key) {\n    if (!(isFunction(obj) && key === 'prototype')) {\n      result.push(key);\n    }\n  });\n  return result;\n};\nexport default keys;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/keys.js\n// module id = 21\n// module chunks = 0","import isArray from './is-array';\n/**\n * @param {Array} arr The array to iterate over.\n * @return {*} Returns the maximum value.\n * @example\n *\n * max([1, 2]);\n * // => 2\n *\n * max([]);\n * // => undefined\n *\n * const data = new Array(1250010).fill(1).map((d,idx) => idx);\n *\n * max(data);\n * // => 1250010\n * // Math.max(...data) will encounter \"Maximum call stack size exceeded\" error\n */\nexport default (function (arr) {\n  if (!isArray(arr)) {\n    return undefined;\n  }\n  return arr.reduce(function (prev, curr) {\n    return Math.max(prev, curr);\n  }, arr[0]);\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/max.js\n// module id = 22\n// module chunks = 0","import isArray from './is-array';\n/**\n * @param {Array} arr The array to iterate over.\n * @return {*} Returns the minimum value.\n * @example\n *\n * min([1, 2]);\n * // => 1\n *\n * min([]);\n * // => undefined\n *\n * const data = new Array(1250010).fill(1).map((d,idx) => idx);\n *\n * min(data);\n * // => 1250010\n * // Math.min(...data) will encounter \"Maximum call stack size exceeded\" error\n */\nexport default (function (arr) {\n  if (!isArray(arr)) {\n    return undefined;\n  }\n  return arr.reduce(function (prev, curr) {\n    return Math.min(prev, curr);\n  }, arr[0]);\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/min.js\n// module id = 23\n// module chunks = 0","import isArrayLike from './is-array-like';\nvar splice = Array.prototype.splice;\nvar pullAt = function pullAt(arr, indexes) {\n  if (!isArrayLike(arr)) {\n    return [];\n  }\n  var length = arr ? indexes.length : 0;\n  var last = length - 1;\n  while (length--) {\n    var previous = void 0;\n    var index = indexes[length];\n    if (length === last || index !== previous) {\n      previous = index;\n      splice.call(arr, index, 1);\n    }\n  }\n  return arr;\n};\nexport default pullAt;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/pull-at.js\n// module id = 24\n// module chunks = 0","import each from './each';\nimport isArray from './is-array';\nimport isPlainObject from './is-plain-object';\nvar reduce = function (arr, fn, init) {\n  if (!isArray(arr) && !isPlainObject(arr)) {\n    return arr;\n  }\n  var result = init;\n  each(arr, function (data, i) {\n    result = fn(result, data, i);\n  });\n  return result;\n};\nexport default reduce;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/reduce.js\n// module id = 25\n// module chunks = 0","export default function uniq(arr, cache) {\n  if (cache === void 0) {\n    cache = new Map();\n  }\n  var r = [];\n  if (Array.isArray(arr)) {\n    for (var i = 0, len = arr.length; i < len; i++) {\n      var item = arr[i];\n      // 加一个 cache，提升性能\n      if (!cache.has(item)) {\n        r.push(item);\n        cache.set(item, true);\n      }\n    }\n  }\n  return r;\n}\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/uniq.js\n// module id = 26\n// module chunks = 0","import isArray from './is-array';\nimport isFunction from './is-function';\nimport groupBy from './group-by';\n/**\n * 将数据分组成 map\n * @param data\n * @param condition\n */\nexport default function groupToMap(data, condition) {\n  if (!condition) {\n    return {\n      0: data\n    };\n  }\n  if (!isFunction(condition)) {\n    // 如果是字符串，则按照 a*b 风格成数组\n    var paramscondition_1 = isArray(condition) ? condition : condition.replace(/\\s+/g, '').split('*');\n    condition = function (row) {\n      var unique = '_'; // 避免出现数字作为Key的情况，会进行按照数字的排序\n      // 根据字段列表的值，拼接成 key\n      for (var i = 0, l = paramscondition_1.length; i < l; i++) {\n        unique += row[paramscondition_1[i]] && row[paramscondition_1[i]].toString();\n      }\n      return unique;\n    };\n  }\n  return groupBy(data, condition);\n}\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/group-to-map.js\n// module id = 27\n// module chunks = 0","import isArray from './is-array';\nimport isFunction from './is-function';\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nfunction groupBy(data, condition) {\n  if (!condition || !isArray(data)) {\n    return {};\n  }\n  var result = {};\n  // 兼容方法和 字符串的写法\n  var predicate = isFunction(condition) ? condition : function (item) {\n    return item[condition];\n  };\n  var key;\n  for (var i = 0; i < data.length; i++) {\n    var item = data[i];\n    key = predicate(item);\n    if (hasOwnProperty.call(result, key)) {\n      result[key].push(item);\n    } else {\n      result[key] = [item];\n    }\n  }\n  return result;\n}\nexport default groupBy;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/group-by.js\n// module id = 28\n// module chunks = 0","export default (function (obj, key) {\n  return obj.hasOwnProperty(key);\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/has.js\n// module id = 29\n// module chunks = 0","var toString = {}.toString;\nvar getType = function (value) {\n  return toString.call(value).replace(/^\\[object /, '').replace(/]$/, '');\n};\nexport default getType;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/get-type.js\n// module id = 30\n// module chunks = 0","var objectProto = Object.prototype;\nvar isPrototype = function (value) {\n  var Ctor = value && value.constructor;\n  var proto = typeof Ctor === 'function' && Ctor.prototype || objectProto;\n  return value === proto;\n};\nexport default isPrototype;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-prototype.js\n// module id = 31\n// module chunks = 0","import isFunction from './is-function';\n/**\n * _.memoize(calColor);\n * _.memoize(calColor, (...args) => args[0]);\n * @param f\n * @param resolver\n */\nexport default (function (f, resolver) {\n  if (!isFunction(f)) {\n    throw new TypeError('Expected a function');\n  }\n  var memoized = function () {\n    var args = [];\n    for (var _i = 0; _i < arguments.length; _i++) {\n      args[_i] = arguments[_i];\n    }\n    // 使用方法构造 key，如果不存在 resolver，则直接取第一个参数作为 key\n    var key = resolver ? resolver.apply(this, args) : args[0];\n    var cache = memoized.cache;\n    if (cache.has(key)) {\n      return cache.get(key);\n    }\n    var result = f.apply(this, args);\n    // 缓存起来\n    cache.set(key, result);\n    return result;\n  };\n  memoized.cache = new Map();\n  return memoized;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/memoize.js\n// module id = 32\n// module chunks = 0","import isObjectLike from './is-object-like';\nimport isArrayLike from './is-array-like';\nimport isString from './is-string';\nvar isEqual = function (value, other) {\n  if (value === other) {\n    return true;\n  }\n  if (!value || !other) {\n    return false;\n  }\n  if (isString(value) || isString(other)) {\n    return false;\n  }\n  if (isArrayLike(value) || isArrayLike(other)) {\n    if (value.length !== other.length) {\n      return false;\n    }\n    var rst = true;\n    for (var i = 0; i < value.length; i++) {\n      rst = isEqual(value[i], other[i]);\n      if (!rst) {\n        break;\n      }\n    }\n    return rst;\n  }\n  if (isObjectLike(value) || isObjectLike(other)) {\n    var valueKeys = Object.keys(value);\n    var otherKeys = Object.keys(other);\n    if (valueKeys.length !== otherKeys.length) {\n      return false;\n    }\n    var rst = true;\n    for (var i = 0; i < valueKeys.length; i++) {\n      rst = isEqual(value[valueKeys[i]], other[valueKeys[i]]);\n      if (!rst) {\n        break;\n      }\n    }\n    return rst;\n  }\n  return false;\n};\nexport default isEqual;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-equal.js\n// module id = 33\n// module chunks = 0","import { __spreadArrays } from \"tslib\";\nimport values from './values';\nimport memoize from './memoize';\nimport isString from './is-string';\nvar ctx;\n/**\n * 计算文本的宽度\n */\nexport default memoize(function (text, font) {\n  if (font === void 0) {\n    font = {};\n  }\n  var fontSize = font.fontSize,\n    fontFamily = font.fontFamily,\n    fontWeight = font.fontWeight,\n    fontStyle = font.fontStyle,\n    fontVariant = font.fontVariant;\n  if (!ctx) {\n    ctx = document.createElement('canvas').getContext('2d');\n  }\n  ctx.font = [fontStyle, fontVariant, fontWeight, fontSize + \"px\", fontFamily].join(' ');\n  return ctx.measureText(isString(text) ? text : '').width;\n}, function (text, font) {\n  if (font === void 0) {\n    font = {};\n  }\n  return __spreadArrays([text], values(font)).join('');\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/measure-text-width.js\n// module id = 34\n// module chunks = 0","var hierarchy = require('./hierarchy');\nmodule.exports = function (root, options) {\n  // separate into left and right trees\n  var left = hierarchy(root.data, options, true); // root only\n  var right = hierarchy(root.data, options, true); // root only\n  // automatically\n  var treeSize = root.children.length;\n  var rightTreeSize = Math.round(treeSize / 2);\n  // separate left and right tree by meta data\n  var getSide = options.getSide || function (child, index) {\n    if (index < rightTreeSize) {\n      return 'right';\n    }\n    return 'left';\n  };\n  for (var i = 0; i < treeSize; i++) {\n    var child = root.children[i];\n    var side = getSide(child, i);\n    if (side === 'right') {\n      right.children.push(child);\n    } else {\n      left.children.push(child);\n    }\n  }\n  left.eachNode(function (node) {\n    if (!node.isRoot()) {\n      node.side = 'left';\n    }\n  });\n  right.eachNode(function (node) {\n    if (!node.isRoot()) {\n      node.side = 'right';\n    }\n  });\n  return {\n    left: left,\n    right: right\n  };\n};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/layout/separate-root.js\n// module id = 35\n// module chunks = 0","var hierarchy = {\n  compactBox: require('./compact-box'),\n  dendrogram: require('./dendrogram'),\n  indented: require('./indented'),\n  mindmap: require('./mindmap')\n};\nmodule.exports = hierarchy;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/index.js\n// module id = 36\n// module chunks = 0","function _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar TreeLayout = require('./layout/base');\nvar nonLayeredTidyTree = require('./layout/non-layered-tidy');\nvar doTreeLayout = require('./layout/do-layout');\nvar util = require('./util');\nvar CompactBoxTreeLayout = /*#__PURE__*/function (_TreeLayout) {\n  _inheritsLoose(CompactBoxTreeLayout, _TreeLayout);\n  function CompactBoxTreeLayout() {\n    return _TreeLayout.apply(this, arguments) || this;\n  }\n  var _proto = CompactBoxTreeLayout.prototype;\n  _proto.execute = function execute() {\n    var me = this;\n    return doTreeLayout(me.rootNode, me.options, nonLayeredTidyTree);\n  };\n  return CompactBoxTreeLayout;\n}(TreeLayout);\nvar DEFAULT_OPTIONS = {};\nfunction compactBoxLayout(root, options) {\n  options = util.assign({}, DEFAULT_OPTIONS, options);\n  return new CompactBoxTreeLayout(root, options).execute();\n}\nmodule.exports = compactBoxLayout;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/compact-box.js\n// module id = 37\n// module chunks = 0","// array\nexport { default as contains, default as includes } from './contains';\nexport { default as difference } from './difference';\nexport { default as find } from './find';\nexport { default as findIndex } from './find-index';\nexport { default as firstValue } from './first-value';\nexport { default as flatten } from './flatten';\nexport { default as flattenDeep } from './flatten-deep';\nexport { default as getRange } from './get-range';\nexport { default as pull } from './pull';\nexport { default as pullAt } from './pull-at';\nexport { default as reduce } from './reduce';\nexport { default as remove } from './remove';\nexport { default as sortBy } from './sort-by';\nexport { default as union } from './union';\nexport { default as uniq } from './uniq';\nexport { default as valuesOfKey } from './values-of-key';\nexport { default as head } from './head';\nexport { default as last } from './last';\nexport { default as startsWith } from './starts-with';\nexport { default as endsWith } from './ends-with';\nexport { default as filter } from './filter';\nexport { default as every } from './every';\nexport { default as some } from './some';\nexport { default as group } from './group';\nexport { default as groupBy } from './group-by';\nexport { default as groupToMap } from './group-to-map';\n// event\nexport { default as getWrapBehavior } from './get-wrap-behavior';\nexport { default as wrapBehavior } from './wrap-behavior';\n// format\nexport { default as number2color } from './number2color';\nexport { default as parseRadius } from './parse-radius';\n// math\nexport { default as clamp } from './clamp';\nexport { default as fixedBase } from './fixed-base';\nexport { default as isDecimal } from './is-decimal';\nexport { default as isEven } from './is-even';\nexport { default as isInteger } from './is-integer';\nexport { default as isNegative } from './is-negative';\nexport { default as isNumberEqual } from './is-number-equal';\nexport { default as isOdd } from './is-odd';\nexport { default as isPositive } from './is-positive';\nexport { default as max } from './max';\nexport { default as maxBy } from './max-by';\nexport { default as min } from './min';\nexport { default as minBy } from './min-by';\nexport { default as mod } from './mod';\nexport { default as toDegree } from './to-degree';\nexport { default as toInteger } from './to-integer';\nexport { default as toRadian } from './to-radian';\n// object\nexport { default as forIn } from './for-in';\nexport { default as has } from './has';\nexport { default as hasKey } from './has-key';\nexport { default as hasValue } from './has-value';\nexport { default as keys } from './keys';\nexport { default as isMatch } from './is-match';\nexport { default as values } from './values';\n// string\nexport { default as lowerCase } from './lower-case';\nexport { default as lowerFirst } from './lower-first';\nexport { default as substitute } from './substitute';\nexport { default as upperCase } from './upper-case';\nexport { default as upperFirst } from './upper-first';\n// type\nexport { default as getType } from './get-type';\nexport { default as isArguments } from './is-arguments';\nexport { default as isArray } from './is-array';\nexport { default as isArrayLike } from './is-array-like';\nexport { default as isBoolean } from './is-boolean';\nexport { default as isDate } from './is-date';\nexport { default as isError } from './is-error';\nexport { default as isFunction } from './is-function';\nexport { default as isFinite } from './is-finite';\nexport { default as isNil } from './is-nil';\nexport { default as isNull } from './is-null';\nexport { default as isNumber } from './is-number';\nexport { default as isObject } from './is-object';\nexport { default as isObjectLike } from './is-object-like';\nexport { default as isPlainObject } from './is-plain-object';\nexport { default as isPrototype } from './is-prototype';\nexport { default as isRegExp } from './is-reg-exp';\nexport { default as isString } from './is-string';\nexport { default as isType } from './is-type';\nexport { default as isUndefined } from './is-undefined';\nexport { default as isElement } from './is-element';\nexport { default as requestAnimationFrame } from './request-animation-frame';\nexport { default as clearAnimationFrame } from './clear-animation-frame';\n// other\nexport { default as augment } from './augment';\nexport { default as clone } from './clone';\nexport { default as debounce } from './debounce';\nexport { default as memoize } from './memoize';\nexport { default as deepMix } from './deep-mix';\nexport { default as each } from './each';\nexport { default as extend } from './extend';\nexport { default as indexOf } from './index-of';\nexport { default as isEmpty } from './is-empty';\nexport { default as isEqual } from './is-equal';\nexport { default as isEqualWith } from './is-equal-with';\nexport { default as map } from './map';\nexport { default as mapValues } from './map-values';\nexport { default as mix, default as assign } from './mix';\nexport { default as get } from './get';\nexport { default as set } from './set';\nexport { default as pick } from './pick';\nexport { default as omit } from './omit';\nexport { default as throttle } from './throttle';\nexport { default as toArray } from './to-array';\nexport { default as toString } from './to-string';\nexport { default as uniqueId } from './unique-id';\nexport { default as noop } from './noop';\nexport { default as identity } from './identity';\nexport { default as size } from './size';\n// text\nexport { default as measureTextWidth } from './measure-text-width';\nexport { default as getEllipsisText } from './get-ellipsis-text';\n// 不知道为什么，需要把这个 export，不然 ts 会报类型错误\nexport { default as Cache } from './cache';\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/index.js\n// module id = 38\n// module chunks = 0","import filter from './filter';\nimport contains from './contains';\n/**\n * Flattens `array` a single level deep.\n *\n * @param {Array} arr The array to inspect.\n * @param {Array} values The values to exclude.\n * @return {Array} Returns the new array of filtered values.\n * @example\n * difference([2, 1], [2, 3]);  // => [1]\n */\nvar difference = function (arr, values) {\n  if (values === void 0) {\n    values = [];\n  }\n  return filter(arr, function (value) {\n    return !contains(values, value);\n  });\n};\nexport default difference;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/difference.js\n// module id = 39\n// module chunks = 0","import isFunction from './is-function';\nimport isMatch from './is-match';\nimport isArray from './is-array';\nimport isPlainObject from './is-plain-object';\nfunction find(arr, predicate) {\n  if (!isArray(arr)) return null;\n  var _predicate;\n  if (isFunction(predicate)) {\n    _predicate = predicate;\n  }\n  if (isPlainObject(predicate)) {\n    _predicate = function (a) {\n      return isMatch(a, predicate);\n    };\n  }\n  if (_predicate) {\n    for (var i = 0; i < arr.length; i += 1) {\n      if (_predicate(arr[i])) {\n        return arr[i];\n      }\n    }\n  }\n  return null;\n}\nexport default find;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/find.js\n// module id = 40\n// module chunks = 0","function findIndex(arr, predicate, fromIndex) {\n  if (fromIndex === void 0) {\n    fromIndex = 0;\n  }\n  for (var i = fromIndex; i < arr.length; i++) {\n    if (predicate(arr[i], i)) {\n      // 找到终止循环\n      return i;\n    }\n  }\n  return -1;\n}\nexport default findIndex;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/find-index.js\n// module id = 41\n// module chunks = 0","import isNil from './is-nil';\nimport isArray from './is-array';\nvar firstValue = function (data, name) {\n  var rst = null;\n  for (var i = 0; i < data.length; i++) {\n    var obj = data[i];\n    var value = obj[name];\n    if (!isNil(value)) {\n      if (isArray(value)) {\n        rst = value[0]; // todo 这里是否应该使用递归，调用 firstValue @绝云\n      } else {\n        rst = value;\n      }\n      break;\n    }\n  }\n  return rst;\n};\nexport default firstValue;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/first-value.js\n// module id = 42\n// module chunks = 0","import isArray from './is-array';\n/**\n * Flattens `array` a single level deep.\n *\n * @param {Array} arr The array to flatten.\n * @return {Array} Returns the new flattened array.\n * @example\n *\n * flatten([1, [2, [3, [4]], 5]]);  // => [1, 2, [3, [4]], 5]\n */\nvar flatten = function (arr) {\n  if (!isArray(arr)) {\n    return [];\n  }\n  var rst = [];\n  for (var i = 0; i < arr.length; i++) {\n    rst = rst.concat(arr[i]);\n  }\n  return rst;\n};\nexport default flatten;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/flatten.js\n// module id = 43\n// module chunks = 0","import isArray from './is-array';\n/**\n * Flattens `array` a single level deep.\n *\n * @param {Array} arr The array to flatten.\n * @param {Array} result The array to return.\n * @return {Array} Returns the new flattened array.\n * @example\n *\n * flattenDeep([1, [2, [3, [4]], 5]]);  // => [1, 2, 3, 4, 5]\n */\nvar flattenDeep = function (arr, result) {\n  if (result === void 0) {\n    result = [];\n  }\n  if (!isArray(arr)) {\n    result.push(arr);\n  } else {\n    for (var i = 0; i < arr.length; i += 1) {\n      flattenDeep(arr[i], result);\n    }\n  }\n  return result;\n};\nexport default flattenDeep;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/flatten-deep.js\n// module id = 44\n// module chunks = 0","import isArray from './is-array';\nimport { default as getMax } from './max';\nimport { default as getMin } from './min';\nvar getRange = function (values) {\n  // 存在 NaN 时，min,max 判定会出问题\n  var filterValues = values.filter(function (v) {\n    return !isNaN(v);\n  });\n  if (!filterValues.length) {\n    // 如果没有数值则直接返回0\n    return {\n      min: 0,\n      max: 0\n    };\n  }\n  if (isArray(values[0])) {\n    var tmp = [];\n    for (var i = 0; i < values.length; i++) {\n      tmp = tmp.concat(values[i]);\n    }\n    filterValues = tmp;\n  }\n  var max = getMax(filterValues);\n  var min = getMin(filterValues);\n  return {\n    min: min,\n    max: max\n  };\n};\nexport default getRange;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/get-range.js\n// module id = 45\n// module chunks = 0","var arrPrototype = Array.prototype;\nvar splice = arrPrototype.splice;\nvar indexOf = arrPrototype.indexOf;\nvar pull = function (arr) {\n  var values = [];\n  for (var _i = 1; _i < arguments.length; _i++) {\n    values[_i - 1] = arguments[_i];\n  }\n  for (var i = 0; i < values.length; i++) {\n    var value = values[i];\n    var fromIndex = -1;\n    while ((fromIndex = indexOf.call(arr, value)) > -1) {\n      splice.call(arr, fromIndex, 1);\n    }\n  }\n  return arr;\n};\nexport default pull;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/pull.js\n// module id = 46\n// module chunks = 0","import isArrayLike from './is-array-like';\nimport pullAt from './pull-at';\nvar remove = function (arr, predicate) {\n  /**\n   * const arr = [1, 2, 3, 4]\n   * const evens = remove(arr, n => n % 2 == 0)\n   * console.log(arr) // => [1, 3]\n   * console.log(evens) // => [2, 4]\n   */\n  var result = [];\n  if (!isArrayLike(arr)) {\n    return result;\n  }\n  var i = -1;\n  var indexes = [];\n  var length = arr.length;\n  while (++i < length) {\n    var value = arr[i];\n    if (predicate(value, i, arr)) {\n      result.push(value);\n      indexes.push(i);\n    }\n  }\n  pullAt(arr, indexes);\n  return result;\n};\nexport default remove;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/remove.js\n// module id = 47\n// module chunks = 0","import isArray from './is-array';\nimport isString from './is-string';\nimport isFunction from './is-function';\nfunction sortBy(arr, key) {\n  var comparer;\n  if (isFunction(key)) {\n    comparer = function (a, b) {\n      return key(a) - key(b);\n    };\n  } else {\n    var keys_1 = [];\n    if (isString(key)) {\n      keys_1.push(key);\n    } else if (isArray(key)) {\n      keys_1 = key;\n    }\n    comparer = function (a, b) {\n      for (var i = 0; i < keys_1.length; i += 1) {\n        var prop = keys_1[i];\n        if (a[prop] > b[prop]) {\n          return 1;\n        }\n        if (a[prop] < b[prop]) {\n          return -1;\n        }\n      }\n      return 0;\n    };\n  }\n  arr.sort(comparer);\n  return arr;\n}\nexport default sortBy;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/sort-by.js\n// module id = 48\n// module chunks = 0","import uniq from './uniq';\nvar union = function () {\n  var sources = [];\n  for (var _i = 0; _i < arguments.length; _i++) {\n    sources[_i] = arguments[_i];\n  }\n  return uniq([].concat.apply([], sources));\n};\nexport default union;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/union.js\n// module id = 49\n// module chunks = 0","import isArray from './is-array';\nimport isNil from './is-nil';\nexport default (function (data, name) {\n  var rst = [];\n  var tmpMap = {};\n  for (var i = 0; i < data.length; i++) {\n    var obj = data[i];\n    var value = obj[name];\n    if (!isNil(value)) {\n      // flatten\n      if (!isArray(value)) {\n        value = [value];\n      }\n      for (var j = 0; j < value.length; j++) {\n        var val = value[j];\n        // unique\n        if (!tmpMap[val]) {\n          rst.push(val);\n          tmpMap[val] = true;\n        }\n      }\n    }\n  }\n  return rst;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/values-of-key.js\n// module id = 50\n// module chunks = 0","import isArrayLike from './is-array-like';\nexport default function head(o) {\n  if (isArrayLike(o)) {\n    return o[0];\n  }\n  return undefined;\n}\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/head.js\n// module id = 51\n// module chunks = 0","import isArrayLike from './is-array-like';\nexport default function last(o) {\n  if (isArrayLike(o)) {\n    var arr = o;\n    return arr[arr.length - 1];\n  }\n  return undefined;\n}\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/last.js\n// module id = 52\n// module chunks = 0","import isArray from './is-array';\nimport isString from './is-string';\nfunction startsWith(arr, e) {\n  return isArray(arr) || isString(arr) ? arr[0] === e : false;\n}\nexport default startsWith;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/starts-with.js\n// module id = 53\n// module chunks = 0","import isArray from './is-array';\nimport isString from './is-string';\nfunction endsWith(arr, e) {\n  return isArray(arr) || isString(arr) ? arr[arr.length - 1] === e : false;\n}\nexport default endsWith;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/ends-with.js\n// module id = 54\n// module chunks = 0","/**\n * 只要有一个不满足条件就返回 false\n * @param arr\n * @param func\n */\nvar every = function (arr, func) {\n  for (var i = 0; i < arr.length; i++) {\n    if (!func(arr[i], i)) return false;\n  }\n  return true;\n};\nexport default every;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/every.js\n// module id = 55\n// module chunks = 0","/**\n * 只要有一个满足条件就返回 true\n * @param arr\n * @param func\n */\nvar some = function (arr, func) {\n  for (var i = 0; i < arr.length; i++) {\n    if (func(arr[i], i)) return true;\n  }\n  return false;\n};\nexport default some;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/some.js\n// module id = 56\n// module chunks = 0","import groupToMap from './group-to-map';\nexport default (function (data, condition) {\n  if (!condition) {\n    // 没有条件，则自身改成数组\n    return [data];\n  }\n  var groups = groupToMap(data, condition);\n  var array = [];\n  for (var i in groups) {\n    array.push(groups[i]);\n  }\n  return array;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/group.js\n// module id = 57\n// module chunks = 0","/**\n * 获取封装的事件\n * @protected\n * @param  {Object} obj   对象\n * @param  {String} action 事件名称\n * @return {Function}        返回事件处理函数\n */\nfunction getWrapBehavior(obj, action) {\n  return obj['_wrap_' + action];\n}\nexport default getWrapBehavior;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/get-wrap-behavior.js\n// module id = 58\n// module chunks = 0","/**\n * 封装事件，便于使用上下文this,和便于解除事件时使用\n * @protected\n * @param  {Object} obj   对象\n * @param  {String} action 事件名称\n * @return {Function}        返回事件处理函数\n */\nfunction wrapBehavior(obj, action) {\n  if (obj['_wrap_' + action]) {\n    return obj['_wrap_' + action];\n  }\n  var method = function (e) {\n    obj[action](e);\n  };\n  obj['_wrap_' + action] = method;\n  return method;\n}\nexport default wrapBehavior;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/wrap-behavior.js\n// module id = 59\n// module chunks = 0","var numColorCache = {};\nfunction numberToColor(num) {\n  // 增加缓存\n  var color = numColorCache[num];\n  if (!color) {\n    var str = num.toString(16);\n    for (var i = str.length; i < 6; i++) {\n      str = '0' + str;\n    }\n    color = '#' + str;\n    numColorCache[num] = color;\n  }\n  return color;\n}\nexport default numberToColor;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/number2color.js\n// module id = 60\n// module chunks = 0","import isArray from './is-array';\nfunction parseRadius(radius) {\n  var r1 = 0,\n    r2 = 0,\n    r3 = 0,\n    r4 = 0;\n  if (isArray(radius)) {\n    if (radius.length === 1) {\n      r1 = r2 = r3 = r4 = radius[0];\n    } else if (radius.length === 2) {\n      r1 = r3 = radius[0];\n      r2 = r4 = radius[1];\n    } else if (radius.length === 3) {\n      r1 = radius[0];\n      r2 = r4 = radius[1];\n      r3 = radius[2];\n    } else {\n      r1 = radius[0];\n      r2 = radius[1];\n      r3 = radius[2];\n      r4 = radius[3];\n    }\n  } else {\n    r1 = r2 = r3 = r4 = radius;\n  }\n  return {\n    r1: r1,\n    r2: r2,\n    r3: r3,\n    r4: r4\n  };\n}\nexport default parseRadius;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/parse-radius.js\n// module id = 61\n// module chunks = 0","var clamp = function (a, min, max) {\n  if (a < min) {\n    return min;\n  } else if (a > max) {\n    return max;\n  }\n  return a;\n};\nexport default clamp;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/clamp.js\n// module id = 62\n// module chunks = 0","var fixedBase = function (v, base) {\n  var str = base.toString();\n  var index = str.indexOf('.');\n  if (index === -1) {\n    return Math.round(v);\n  }\n  var length = str.substr(index + 1).length;\n  if (length > 20) {\n    length = 20;\n  }\n  return parseFloat(v.toFixed(length));\n};\nexport default fixedBase;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/fixed-base.js\n// module id = 63\n// module chunks = 0","import isNumber from './is-number';\nvar isDecimal = function (num) {\n  return isNumber(num) && num % 1 !== 0;\n};\nexport default isDecimal;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-decimal.js\n// module id = 64\n// module chunks = 0","import isNumber from './is-number';\nvar isEven = function (num) {\n  return isNumber(num) && num % 2 === 0;\n};\nexport default isEven;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-even.js\n// module id = 65\n// module chunks = 0","import isNumber from './is-number';\nvar isInteger = Number.isInteger ? Number.isInteger : function (num) {\n  return isNumber(num) && num % 1 === 0;\n};\nexport default isInteger;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-integer.js\n// module id = 66\n// module chunks = 0","import isNumber from './is-number';\nvar isNegative = function (num) {\n  return isNumber(num) && num < 0;\n};\nexport default isNegative;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-negative.js\n// module id = 67\n// module chunks = 0","var PRECISION = 0.00001; // numbers less than this is considered as 0\nexport default function isNumberEqual(a, b, precision) {\n  if (precision === void 0) {\n    precision = PRECISION;\n  }\n  return Math.abs(a - b) < precision;\n}\n;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-number-equal.js\n// module id = 68\n// module chunks = 0","import isNumber from './is-number';\nvar isOdd = function (num) {\n  return isNumber(num) && num % 2 !== 0;\n};\nexport default isOdd;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-odd.js\n// module id = 69\n// module chunks = 0","import isNumber from './is-number';\nvar isPositive = function (num) {\n  return isNumber(num) && num > 0;\n};\nexport default isPositive;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-positive.js\n// module id = 70\n// module chunks = 0","import isArray from './is-array';\nimport isFunction from './is-function';\n/**\n * @param {Array} arr The array to iterate over.\n * @param {Function} [fn] The iteratee invoked per element.\n * @return {*} Returns the maximum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * maxBy(objects, function(o) { return o.n; });\n * // => { 'n': 2 }\n *\n * maxBy(objects, 'n');\n * // => { 'n': 2 }\n */\nexport default (function (arr, fn) {\n  if (!isArray(arr)) {\n    return undefined;\n  }\n  var maxItem;\n  var max = -Infinity;\n  for (var i = 0; i < arr.length; i++) {\n    var item = arr[i];\n    var v = isFunction(fn) ? fn(item) : item[fn];\n    if (v > max) {\n      maxItem = item;\n      max = v;\n    }\n  }\n  return maxItem;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/max-by.js\n// module id = 71\n// module chunks = 0","import isArray from './is-array';\nimport isFunction from './is-function';\n/**\n * @param {Array} arr The array to iterate over.\n * @param {Function} [fn] The iteratee invoked per element.\n * @return {*} Returns the minimum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n *\n * minBy(objects, 'n');\n * // => { 'n': 1 }\n */\nexport default (function (arr, fn) {\n  if (!isArray(arr)) {\n    return undefined;\n  }\n  var minItem;\n  var min = Infinity;\n  for (var i = 0; i < arr.length; i++) {\n    var item = arr[i];\n    var v = isFunction(fn) ? fn(item) : item[fn];\n    if (v < min) {\n      minItem = item;\n      min = v;\n    }\n  }\n  return minItem;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/min-by.js\n// module id = 72\n// module chunks = 0","var mod = function (n, m) {\n  return (n % m + m) % m;\n};\nexport default mod;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/mod.js\n// module id = 73\n// module chunks = 0","var DEGREE = 180 / Math.PI;\nvar toDegree = function (radian) {\n  return DEGREE * radian;\n};\nexport default toDegree;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/to-degree.js\n// module id = 74\n// module chunks = 0","export default parseInt;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/to-integer.js\n// module id = 75\n// module chunks = 0","var RADIAN = Math.PI / 180;\nvar toRadian = function (degree) {\n  return RADIAN * degree;\n};\nexport default toRadian;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/to-radian.js\n// module id = 76\n// module chunks = 0","import each from './each';\nexport default each;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/for-in.js\n// module id = 77\n// module chunks = 0","import has from './has';\nexport default has;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/has-key.js\n// module id = 78\n// module chunks = 0","import contains from './contains';\nimport values from './values';\nexport default (function (obj, value) {\n  return contains(values(obj), value);\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/has-value.js\n// module id = 79\n// module chunks = 0","import toString from './to-string';\nvar lowerCase = function (str) {\n  return toString(str).toLowerCase();\n};\nexport default lowerCase;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/lower-case.js\n// module id = 80\n// module chunks = 0","import toString from './to-string';\nvar lowerFirst = function (value) {\n  var str = toString(value);\n  return str.charAt(0).toLowerCase() + str.substring(1);\n};\nexport default lowerFirst;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/lower-first.js\n// module id = 81\n// module chunks = 0","function substitute(str, o) {\n  if (!str || !o) {\n    return str;\n  }\n  return str.replace(/\\\\?\\{([^{}]+)\\}/g, function (match, name) {\n    if (match.charAt(0) === '\\\\') {\n      return match.slice(1);\n    }\n    return o[name] === undefined ? '' : o[name];\n  });\n}\nexport default substitute;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/substitute.js\n// module id = 82\n// module chunks = 0","import toString from './to-string';\nvar upperCase = function (str) {\n  return toString(str).toUpperCase();\n};\nexport default upperCase;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/upper-case.js\n// module id = 83\n// module chunks = 0","import toString from './to-string';\nvar upperFirst = function (value) {\n  var str = toString(value);\n  return str.charAt(0).toUpperCase() + str.substring(1);\n};\nexport default upperFirst;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/upper-first.js\n// module id = 84\n// module chunks = 0","/**\n * 是否是参数类型\n *\n * @param {Object} value 测试的值\n * @return {Boolean}\n */\nimport isType from './is-type';\nvar isArguments = function (value) {\n  return isType(value, 'Arguments');\n};\nexport default isArguments;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-arguments.js\n// module id = 85\n// module chunks = 0","/**\n * 是否是布尔类型\n *\n * @param {Object} value 测试的值\n * @return {Boolean}\n */\nimport isType from './is-type';\nvar isBoolean = function (value) {\n  return isType(value, 'Boolean');\n};\nexport default isBoolean;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-boolean.js\n// module id = 86\n// module chunks = 0","import isType from './is-type';\nvar isDate = function (value) {\n  return isType(value, 'Date');\n};\nexport default isDate;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-date.js\n// module id = 87\n// module chunks = 0","/**\n * 是否是参数类型\n *\n * @param {Object} value 测试的值\n * @return {Boolean}\n */\nimport isType from './is-type';\nvar isError = function (value) {\n  return isType(value, 'Error');\n};\nexport default isError;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-error.js\n// module id = 88\n// module chunks = 0","/**\n * 判断是否为有限数\n * @return {Boolean}\n */\nimport isNumber from './is-number';\nexport default function (value) {\n  return isNumber(value) && isFinite(value);\n}\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-finite.js\n// module id = 89\n// module chunks = 0","var isNull = function (value) {\n  return value === null;\n};\nexport default isNull;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-null.js\n// module id = 90\n// module chunks = 0","import isType from './is-type';\nvar isRegExp = function (str) {\n  return isType(str, 'RegExp');\n};\nexport default isRegExp;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-reg-exp.js\n// module id = 91\n// module chunks = 0","var isUndefined = function (value) {\n  return value === undefined;\n};\nexport default isUndefined;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-undefined.js\n// module id = 92\n// module chunks = 0","/**\n * 判断是否HTML元素\n * @return {Boolean} 是否HTML元素\n */\nvar isElement = function (o) {\n  return o instanceof Element || o instanceof HTMLDocument;\n};\nexport default isElement;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-element.js\n// module id = 93\n// module chunks = 0","export default function requestAnimationFrame(fn) {\n  var method = window.requestAnimationFrame || window.webkitRequestAnimationFrame ||\n  // @ts-ignore\n  window.mozRequestAnimationFrame ||\n  // @ts-ignore\n  window.msRequestAnimationFrame || function (f) {\n    return setTimeout(f, 16);\n  };\n  return method(fn);\n}\n;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/request-animation-frame.js\n// module id = 94\n// module chunks = 0","export default function cancelAnimationFrame(handler) {\n  var method = window.cancelAnimationFrame || window.webkitCancelAnimationFrame ||\n  // @ts-ignore\n  window.mozCancelAnimationFrame ||\n  // @ts-ignore\n  window.msCancelAnimationFrame || clearTimeout;\n  method(handler);\n}\n;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/clear-animation-frame.js\n// module id = 95\n// module chunks = 0","import mix from './mix';\nimport isFunction from './is-function';\nvar augment = function () {\n  var args = [];\n  for (var _i = 0; _i < arguments.length; _i++) {\n    args[_i] = arguments[_i];\n  }\n  var c = args[0];\n  for (var i = 1; i < args.length; i++) {\n    var obj = args[i];\n    if (isFunction(obj)) {\n      obj = obj.prototype;\n    }\n    mix(c.prototype, obj);\n  }\n};\nexport default augment;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/augment.js\n// module id = 96\n// module chunks = 0","import isArray from './is-array';\nvar clone = function (obj) {\n  if (typeof obj !== 'object' || obj === null) {\n    return obj;\n  }\n  var rst;\n  if (isArray(obj)) {\n    rst = [];\n    for (var i = 0, l = obj.length; i < l; i++) {\n      if (typeof obj[i] === 'object' && obj[i] != null) {\n        rst[i] = clone(obj[i]);\n      } else {\n        rst[i] = obj[i];\n      }\n    }\n  } else {\n    rst = {};\n    for (var k in obj) {\n      if (typeof obj[k] === 'object' && obj[k] != null) {\n        rst[k] = clone(obj[k]);\n      } else {\n        rst[k] = obj[k];\n      }\n    }\n  }\n  return rst;\n};\nexport default clone;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/clone.js\n// module id = 97\n// module chunks = 0","function debounce(func, wait, immediate) {\n  var timeout;\n  return function () {\n    var context = this,\n      args = arguments;\n    var later = function () {\n      timeout = null;\n      if (!immediate) {\n        func.apply(context, args);\n      }\n    };\n    var callNow = immediate && !timeout;\n    clearTimeout(timeout);\n    timeout = setTimeout(later, wait);\n    if (callNow) {\n      func.apply(context, args);\n    }\n  };\n}\nexport default debounce;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/debounce.js\n// module id = 98\n// module chunks = 0","import isArray from './is-array';\nimport isPlainObject from './is-plain-object';\nvar MAX_MIX_LEVEL = 5;\nfunction _deepMix(dist, src, level, maxLevel) {\n  level = level || 0;\n  maxLevel = maxLevel || MAX_MIX_LEVEL;\n  for (var key in src) {\n    if (src.hasOwnProperty(key)) {\n      var value = src[key];\n      if (value !== null && isPlainObject(value)) {\n        if (!isPlainObject(dist[key])) {\n          dist[key] = {};\n        }\n        if (level < maxLevel) {\n          _deepMix(dist[key], value, level + 1, maxLevel);\n        } else {\n          dist[key] = src[key];\n        }\n      } else if (isArray(value)) {\n        dist[key] = [];\n        dist[key] = dist[key].concat(value);\n      } else if (value !== undefined) {\n        dist[key] = value;\n      }\n    }\n  }\n}\n// todo 重写\nvar deepMix = function (rst) {\n  var args = [];\n  for (var _i = 1; _i < arguments.length; _i++) {\n    args[_i - 1] = arguments[_i];\n  }\n  for (var i = 0; i < args.length; i += 1) {\n    _deepMix(rst, args[i]);\n  }\n  return rst;\n};\nexport default deepMix;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/deep-mix.js\n// module id = 99\n// module chunks = 0","import mix from './mix';\nimport isFunction from './is-function';\nvar extend = function (subclass, superclass, overrides, staticOverrides) {\n  // 如果只提供父类构造函数，则自动生成子类构造函数\n  if (!isFunction(superclass)) {\n    overrides = superclass;\n    superclass = subclass;\n    subclass = function () {};\n  }\n  var create = Object.create ? function (proto, c) {\n    return Object.create(proto, {\n      constructor: {\n        value: c\n      }\n    });\n  } : function (proto, c) {\n    function Tmp() {}\n    Tmp.prototype = proto;\n    var o = new Tmp();\n    o.constructor = c;\n    return o;\n  };\n  var superObj = create(superclass.prototype, subclass); // new superclass(),//实例化父类作为子类的prototype\n  subclass.prototype = mix(superObj, subclass.prototype); // 指定子类的prototype\n  subclass.superclass = create(superclass.prototype, superclass);\n  mix(superObj, overrides);\n  mix(subclass, staticOverrides);\n  return subclass;\n};\nexport default extend;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/extend.js\n// module id = 100\n// module chunks = 0","import isArrayLike from './is-array-like';\nvar indexOf = function (arr, obj) {\n  if (!isArrayLike(arr)) {\n    return -1;\n  }\n  var m = Array.prototype.indexOf;\n  if (m) {\n    return m.call(arr, obj);\n  }\n  var index = -1;\n  for (var i = 0; i < arr.length; i++) {\n    if (arr[i] === obj) {\n      index = i;\n      break;\n    }\n  }\n  return index;\n};\nexport default indexOf;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/index-of.js\n// module id = 101\n// module chunks = 0","import isNil from './is-nil';\nimport isArrayLike from './is-array-like';\nimport getType from './get-type';\nimport isPrototype from './is-prototype';\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nfunction isEmpty(value) {\n  /**\n   * isEmpty(null) => true\n   * isEmpty() => true\n   * isEmpty(true) => true\n   * isEmpty(1) => true\n   * isEmpty([1, 2, 3]) => false\n   * isEmpty('abc') => false\n   * isEmpty({ a: 1 }) => false\n   */\n  if (isNil(value)) {\n    return true;\n  }\n  if (isArrayLike(value)) {\n    return !value.length;\n  }\n  var type = getType(value);\n  if (type === 'Map' || type === 'Set') {\n    return !value.size;\n  }\n  if (isPrototype(value)) {\n    return !Object.keys(value).length;\n  }\n  for (var key in value) {\n    if (hasOwnProperty.call(value, key)) {\n      return false;\n    }\n  }\n  return true;\n}\nexport default isEmpty;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-empty.js\n// module id = 102\n// module chunks = 0","import isFunction from './is-function';\nimport isEqual from './is-equal';\n/**\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {Function} [fn] The function to customize comparisons.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * function isGreeting(value) {\n *   return /^h(?:i|ello)$/.test(value);\n * }\n *\n * function customizer(objValue, othValue) {\n *   if (isGreeting(objValue) && isGreeting(othValue)) {\n *     return true;\n *   }\n * }\n *\n * var array = ['hello', 'goodbye'];\n * var other = ['hi', 'goodbye'];\n *\n * isEqualWith(array, other, customizer);  // => true\n */\nexport default (function (value, other, fn) {\n  if (!isFunction(fn)) {\n    return isEqual(value, other);\n  }\n  return !!fn(value, other);\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/is-equal-with.js\n// module id = 103\n// module chunks = 0","import isArrayLike from './is-array-like';\nvar map = function (arr, func) {\n  if (!isArrayLike(arr)) {\n    // @ts-ignore\n    return arr;\n  }\n  var result = [];\n  for (var index = 0; index < arr.length; index++) {\n    var value = arr[index];\n    result.push(func(value, index));\n  }\n  return result;\n};\nexport default map;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/map.js\n// module id = 104\n// module chunks = 0","import isNil from './is-nil';\nimport isObject from './is-object';\nvar identity = function (v) {\n  return v;\n};\nexport default (function (object, func) {\n  if (func === void 0) {\n    func = identity;\n  }\n  var r = {};\n  if (isObject(object) && !isNil(object)) {\n    Object.keys(object).forEach(function (key) {\n      // @ts-ignore\n      r[key] = func(object[key], key);\n    });\n  }\n  return r;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/map-values.js\n// module id = 105\n// module chunks = 0","import isString from './is-string';\n/**\n * https://github.com/developit/dlv/blob/master/index.js\n * @param obj\n * @param key\n * @param defaultValue\n */\nexport default (function (obj, key, defaultValue) {\n  var p = 0;\n  var keyArr = isString(key) ? key.split('.') : key;\n  while (obj && p < keyArr.length) {\n    obj = obj[keyArr[p++]];\n  }\n  return obj === undefined || p < keyArr.length ? defaultValue : obj;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/get.js\n// module id = 106\n// module chunks = 0","import isObject from './is-object';\nimport isString from './is-string';\nimport isNumber from './is-number';\n/**\n * https://github.com/developit/dlv/blob/master/index.js\n * @param obj\n * @param path\n * @param value\n */\nexport default (function (obj, path, value) {\n  var o = obj;\n  var keyArr = isString(path) ? path.split('.') : path;\n  keyArr.forEach(function (key, idx) {\n    // 不是最后一个\n    if (idx < keyArr.length - 1) {\n      if (!isObject(o[key])) {\n        o[key] = isNumber(keyArr[idx + 1]) ? [] : {};\n      }\n      o = o[key];\n    } else {\n      o[key] = value;\n    }\n  });\n  return obj;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/set.js\n// module id = 107\n// module chunks = 0","import each from './each';\nimport isPlainObject from './is-plain-object';\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\nexport default (function (object, keys) {\n  if (object === null || !isPlainObject(object)) {\n    return {};\n  }\n  var result = {};\n  each(keys, function (key) {\n    if (hasOwnProperty.call(object, key)) {\n      result[key] = object[key];\n    }\n  });\n  return result;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/pick.js\n// module id = 108\n// module chunks = 0","import reduce from './reduce';\nexport default (function (obj, keys) {\n  return reduce(obj, function (r, curr, key) {\n    if (!keys.includes(key)) {\n      r[key] = curr;\n    }\n    return r;\n  }, {});\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/omit.js\n// module id = 109\n// module chunks = 0","export default (function (func, wait, options) {\n  var timeout, context, args, result;\n  var previous = 0;\n  if (!options) options = {};\n  var later = function () {\n    previous = options.leading === false ? 0 : Date.now();\n    timeout = null;\n    result = func.apply(context, args);\n    if (!timeout) context = args = null;\n  };\n  var throttled = function () {\n    var now = Date.now();\n    if (!previous && options.leading === false) previous = now;\n    var remaining = wait - (now - previous);\n    context = this;\n    args = arguments;\n    if (remaining <= 0 || remaining > wait) {\n      if (timeout) {\n        clearTimeout(timeout);\n        timeout = null;\n      }\n      previous = now;\n      result = func.apply(context, args);\n      if (!timeout) context = args = null;\n    } else if (!timeout && options.trailing !== false) {\n      timeout = setTimeout(later, remaining);\n    }\n    return result;\n  };\n  throttled.cancel = function () {\n    clearTimeout(timeout);\n    previous = 0;\n    timeout = context = args = null;\n  };\n  return throttled;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/throttle.js\n// module id = 110\n// module chunks = 0","import isArrayLike from './is-array-like';\nexport default (function (value) {\n  return isArrayLike(value) ? Array.prototype.slice.call(value) : [];\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/to-array.js\n// module id = 111\n// module chunks = 0","var map = {};\nexport default (function (prefix) {\n  prefix = prefix || 'g';\n  if (!map[prefix]) {\n    map[prefix] = 1;\n  } else {\n    map[prefix] += 1;\n  }\n  return prefix + map[prefix];\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/unique-id.js\n// module id = 112\n// module chunks = 0","export default (function () {});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/noop.js\n// module id = 113\n// module chunks = 0","export default (function (v) {\n  return v;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/identity.js\n// module id = 114\n// module chunks = 0","import isNil from './is-nil';\nimport isArraylike from './is-array-like';\nexport default function size(o) {\n  if (isNil(o)) {\n    return 0;\n  }\n  if (isArraylike(o)) {\n    return o.length;\n  }\n  return Object.keys(o).length;\n}\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/size.js\n// module id = 115\n// module chunks = 0","/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\n/* global Reflect, Promise */\n\nvar extendStatics = function (d, b) {\n  extendStatics = Object.setPrototypeOf || {\n    __proto__: []\n  } instanceof Array && function (d, b) {\n    d.__proto__ = b;\n  } || function (d, b) {\n    for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p];\n  };\n  return extendStatics(d, b);\n};\nexport function __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null) throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() {\n    this.constructor = d;\n  }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\nexport var __assign = function () {\n  __assign = Object.assign || function __assign(t) {\n    for (var s, i = 1, n = arguments.length; i < n; i++) {\n      s = arguments[i];\n      for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n    }\n    return t;\n  };\n  return __assign.apply(this, arguments);\n};\nexport function __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0) t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\") for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n    if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i])) t[p[i]] = s[p[i]];\n  }\n  return t;\n}\nexport function __decorate(decorators, target, key, desc) {\n  var c = arguments.length,\n    r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc,\n    d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\nexport function __param(paramIndex, decorator) {\n  return function (target, key) {\n    decorator(target, key, paramIndex);\n  };\n}\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) {\n    if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\");\n    return f;\n  }\n  var kind = contextIn.kind,\n    key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _,\n    done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n    var context = {};\n    for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n    for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n    context.addInitializer = function (f) {\n      if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\");\n      extraInitializers.push(accept(f || null));\n    };\n    var result = (0, decorators[i])(kind === \"accessor\" ? {\n      get: descriptor.get,\n      set: descriptor.set\n    } : descriptor[key], context);\n    if (kind === \"accessor\") {\n      if (result === void 0) continue;\n      if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n      if (_ = accept(result.get)) descriptor.get = _;\n      if (_ = accept(result.set)) descriptor.set = _;\n      if (_ = accept(result.init)) initializers.push(_);\n    } else if (_ = accept(result)) {\n      if (kind === \"field\") initializers.push(_);else descriptor[key] = _;\n    }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n}\n;\nexport function __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n    value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n}\n;\nexport function __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n}\n;\nexport function __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", {\n    configurable: true,\n    value: prefix ? \"\".concat(prefix, \" \", name) : name\n  });\n}\n;\nexport function __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\nexport function __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) {\n    return value instanceof P ? value : new P(function (resolve) {\n      resolve(value);\n    });\n  }\n  return new (P || (P = Promise))(function (resolve, reject) {\n    function fulfilled(value) {\n      try {\n        step(generator.next(value));\n      } catch (e) {\n        reject(e);\n      }\n    }\n    function rejected(value) {\n      try {\n        step(generator[\"throw\"](value));\n      } catch (e) {\n        reject(e);\n      }\n    }\n    function step(result) {\n      result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected);\n    }\n    step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\nexport function __generator(thisArg, body) {\n  var _ = {\n      label: 0,\n      sent: function () {\n        if (t[0] & 1) throw t[1];\n        return t[1];\n      },\n      trys: [],\n      ops: []\n    },\n    f,\n    y,\n    t,\n    g;\n  return g = {\n    next: verb(0),\n    \"throw\": verb(1),\n    \"return\": verb(2)\n  }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function () {\n    return this;\n  }), g;\n  function verb(n) {\n    return function (v) {\n      return step([n, v]);\n    };\n  }\n  function step(op) {\n    if (f) throw new TypeError(\"Generator is already executing.\");\n    while (g && (g = 0, op[0] && (_ = 0)), _) try {\n      if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n      if (y = 0, t) op = [op[0] & 2, t.value];\n      switch (op[0]) {\n        case 0:\n        case 1:\n          t = op;\n          break;\n        case 4:\n          _.label++;\n          return {\n            value: op[1],\n            done: false\n          };\n        case 5:\n          _.label++;\n          y = op[1];\n          op = [0];\n          continue;\n        case 7:\n          op = _.ops.pop();\n          _.trys.pop();\n          continue;\n        default:\n          if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {\n            _ = 0;\n            continue;\n          }\n          if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {\n            _.label = op[1];\n            break;\n          }\n          if (op[0] === 6 && _.label < t[1]) {\n            _.label = t[1];\n            t = op;\n            break;\n          }\n          if (t && _.label < t[2]) {\n            _.label = t[2];\n            _.ops.push(op);\n            break;\n          }\n          if (t[2]) _.ops.pop();\n          _.trys.pop();\n          continue;\n      }\n      op = body.call(thisArg, _);\n    } catch (e) {\n      op = [6, e];\n      y = 0;\n    } finally {\n      f = t = 0;\n    }\n    if (op[0] & 5) throw op[1];\n    return {\n      value: op[0] ? op[1] : void 0,\n      done: true\n    };\n  }\n}\nexport var __createBinding = Object.create ? function (o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n    desc = {\n      enumerable: true,\n      get: function () {\n        return m[k];\n      }\n    };\n  }\n  Object.defineProperty(o, k2, desc);\n} : function (o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n};\nexport function __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\nexport function __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator,\n    m = s && o[s],\n    i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n    next: function () {\n      if (o && i >= o.length) o = void 0;\n      return {\n        value: o && o[i++],\n        done: !o\n      };\n    }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\nexport function __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o),\n    r,\n    ar = [],\n    e;\n  try {\n    while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  } catch (error) {\n    e = {\n      error: error\n    };\n  } finally {\n    try {\n      if (r && !r.done && (m = i[\"return\"])) m.call(i);\n    } finally {\n      if (e) throw e.error;\n    }\n  }\n  return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++) ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++) for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++) r[k] = a[j];\n  return r;\n}\nexport function __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n    if (ar || !(i in from)) {\n      if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n      ar[i] = from[i];\n    }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\nexport function __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []),\n    i,\n    q = [];\n  return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () {\n    return this;\n  }, i;\n  function verb(n) {\n    if (g[n]) i[n] = function (v) {\n      return new Promise(function (a, b) {\n        q.push([n, v, a, b]) > 1 || resume(n, v);\n      });\n    };\n  }\n  function resume(n, v) {\n    try {\n      step(g[n](v));\n    } catch (e) {\n      settle(q[0][3], e);\n    }\n  }\n  function step(r) {\n    r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r);\n  }\n  function fulfill(value) {\n    resume(\"next\", value);\n  }\n  function reject(value) {\n    resume(\"throw\", value);\n  }\n  function settle(f, v) {\n    if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]);\n  }\n}\nexport function __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) {\n    throw e;\n  }), verb(\"return\"), i[Symbol.iterator] = function () {\n    return this;\n  }, i;\n  function verb(n, f) {\n    i[n] = o[n] ? function (v) {\n      return (p = !p) ? {\n        value: __await(o[n](v)),\n        done: false\n      } : f ? f(v) : v;\n    } : f;\n  }\n}\nexport function __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator],\n    i;\n  return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () {\n    return this;\n  }, i);\n  function verb(n) {\n    i[n] = o[n] && function (v) {\n      return new Promise(function (resolve, reject) {\n        v = o[n](v), settle(resolve, reject, v.done, v.value);\n      });\n    };\n  }\n  function settle(resolve, reject, d, v) {\n    Promise.resolve(v).then(function (v) {\n      resolve({\n        value: v,\n        done: d\n      });\n    }, reject);\n  }\n}\nexport function __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) {\n    Object.defineProperty(cooked, \"raw\", {\n      value: raw\n    });\n  } else {\n    cooked.raw = raw;\n  }\n  return cooked;\n}\n;\nvar __setModuleDefault = Object.create ? function (o, v) {\n  Object.defineProperty(o, \"default\", {\n    enumerable: true,\n    value: v\n  });\n} : function (o, v) {\n  o[\"default\"] = v;\n};\nexport function __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n  __setModuleDefault(result, mod);\n  return result;\n}\nexport function __importDefault(mod) {\n  return mod && mod.__esModule ? mod : {\n    default: mod\n  };\n}\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n  return kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value), value;\n}\nexport function __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || typeof receiver !== \"object\" && typeof receiver !== \"function\") throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_tslib@2.5.0@tslib/tslib.es6.js\n// module id = 116\n// module chunks = 0","import isString from './is-string';\nimport toString from './to-string';\nimport { default as measureTextWidth } from './measure-text-width';\n/**\n * 获取文本的 ... 文本。\n * 算法（减少每次 measureText 的长度，measureText 的性能跟字符串时间相关）：\n * 1. 先通过 STEP 逐步计算，找到最后一个小于 maxWidth 的字符串\n * 2. 然后对最后这个字符串二分计算\n * @param text 需要计算的文本, 由于历史原因 除了支持string，还支持空值,number和数组等\n * @param maxWidth 最大宽度\n * @param font 字体\n * @param str 要替换的文本\n */\nexport default (function (text, maxWidth, font, str) {\n  if (str === void 0) {\n    str = '...';\n  }\n  var STEP = 16; // 每次 16，调参工程师\n  var PLACEHOLDER_WIDTH = measureTextWidth(str, font);\n  var leftText = !isString(text) ? toString(text) : text;\n  var leftWidth = maxWidth;\n  var r = []; // 最终的分段字符串\n  var currentText;\n  var currentWidth;\n  if (measureTextWidth(text, font) <= maxWidth) {\n    return text;\n  }\n  // 首先通过 step 计算，找出最大的未超出长度的\n  // eslint-disable-next-line no-constant-condition\n  while (true) {\n    // 更新字符串\n    currentText = leftText.substr(0, STEP);\n    // 计算宽度\n    currentWidth = measureTextWidth(currentText, font);\n    // 超出剩余宽度，则停止\n    if (currentWidth + PLACEHOLDER_WIDTH > leftWidth) {\n      if (currentWidth > leftWidth) {\n        break;\n      }\n    }\n    r.push(currentText);\n    // 没有超出，则计算剩余宽度\n    leftWidth -= currentWidth;\n    leftText = leftText.substr(STEP);\n    // 字符串整体没有超出\n    if (!leftText) {\n      return r.join('');\n    }\n  }\n  // 最下的最后一个 STEP，使用 1 递增（用二分效果更高）\n  // eslint-disable-next-line no-constant-condition\n  while (true) {\n    // 更新字符串\n    currentText = leftText.substr(0, 1);\n    // 计算宽度\n    currentWidth = measureTextWidth(currentText, font);\n    // 超出剩余宽度，则停止\n    if (currentWidth + PLACEHOLDER_WIDTH > leftWidth) {\n      break;\n    }\n    r.push(currentText);\n    // 没有超出，则计算剩余宽度\n    leftWidth -= currentWidth;\n    leftText = leftText.substr(1);\n    if (!leftText) {\n      return r.join('');\n    }\n  }\n  return \"\" + r.join('') + str;\n});\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/get-ellipsis-text.js\n// module id = 117\n// module chunks = 0","/**\n * k-v 存储\n */\nvar default_1 = /** @class */function () {\n  function default_1() {\n    this.map = {};\n  }\n  default_1.prototype.has = function (key) {\n    return this.map[key] !== undefined;\n  };\n  default_1.prototype.get = function (key, def) {\n    var v = this.map[key];\n    return v === undefined ? def : v;\n  };\n  default_1.prototype.set = function (key, value) {\n    this.map[key] = value;\n  };\n  default_1.prototype.clear = function () {\n    this.map = {};\n  };\n  default_1.prototype.delete = function (key) {\n    delete this.map[key];\n  };\n  default_1.prototype.size = function () {\n    return Object.keys(this.map).length;\n  };\n  return default_1;\n}();\nexport default default_1;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./node_modules/_@antv_util@2.0.17@@antv/util/esm/cache.js\n// module id = 118\n// module chunks = 0","// wrap tree node\nfunction WrappedTree(w, h, y, c) {\n  if (c === void 0) {\n    c = [];\n  }\n  var me = this;\n  // size\n  me.w = w || 0;\n  me.h = h || 0;\n\n  // position\n  me.y = y || 0;\n  me.x = 0;\n\n  // children\n  me.c = c || [];\n  me.cs = c.length;\n\n  // modified\n  me.prelim = 0;\n  me.mod = 0;\n  me.shift = 0;\n  me.change = 0;\n\n  // left/right tree\n  me.tl = null;\n  me.tr = null;\n\n  // extreme left/right tree\n  me.el = null;\n  me.er = null;\n\n  // modified left/right tree\n  me.msel = 0;\n  me.mser = 0;\n}\nWrappedTree.fromNode = function (root, isHorizontal) {\n  if (!root) return null;\n  var children = [];\n  root.children.forEach(function (child) {\n    children.push(WrappedTree.fromNode(child, isHorizontal));\n  });\n  if (isHorizontal) return new WrappedTree(root.height, root.width, root.x, children);\n  return new WrappedTree(root.width, root.height, root.y, children);\n};\n\n// node utils\nfunction moveRight(node, move, isHorizontal) {\n  if (isHorizontal) {\n    node.y += move;\n  } else {\n    node.x += move;\n  }\n  node.children.forEach(function (child) {\n    moveRight(child, move, isHorizontal);\n  });\n}\nfunction getMin(node, isHorizontal) {\n  var res = isHorizontal ? node.y : node.x;\n  node.children.forEach(function (child) {\n    res = Math.min(getMin(child, isHorizontal), res);\n  });\n  return res;\n}\nfunction normalize(node, isHorizontal) {\n  var min = getMin(node, isHorizontal);\n  moveRight(node, -min, isHorizontal);\n}\nfunction convertBack(converted /* WrappedTree */, root /* TreeNode */, isHorizontal) {\n  if (isHorizontal) {\n    root.y = converted.x;\n  } else {\n    root.x = converted.x;\n  }\n  converted.c.forEach(function (child, i) {\n    convertBack(child, root.children[i], isHorizontal);\n  });\n}\nfunction layer(node, isHorizontal, d) {\n  if (d === void 0) {\n    d = 0;\n  }\n  if (isHorizontal) {\n    node.x = d;\n    d += node.width;\n  } else {\n    node.y = d;\n    d += node.height;\n  }\n  node.children.forEach(function (child) {\n    layer(child, isHorizontal, d);\n  });\n}\nmodule.exports = function (root, options) {\n  if (options === void 0) {\n    options = {};\n  }\n  var isHorizontal = options.isHorizontal;\n  function firstWalk(t) {\n    if (t.cs === 0) {\n      setExtremes(t);\n      return;\n    }\n    firstWalk(t.c[0]);\n    var ih = updateIYL(bottom(t.c[0].el), 0, null);\n    for (var i = 1; i < t.cs; ++i) {\n      firstWalk(t.c[i]);\n      var min = bottom(t.c[i].er);\n      separate(t, i, ih);\n      ih = updateIYL(min, i, ih);\n    }\n    positionRoot(t);\n    setExtremes(t);\n  }\n  function setExtremes(t) {\n    if (t.cs === 0) {\n      t.el = t;\n      t.er = t;\n      t.msel = t.mser = 0;\n    } else {\n      t.el = t.c[0].el;\n      t.msel = t.c[0].msel;\n      t.er = t.c[t.cs - 1].er;\n      t.mser = t.c[t.cs - 1].mser;\n    }\n  }\n  function separate(t, i, ih) {\n    var sr = t.c[i - 1];\n    var mssr = sr.mod;\n    var cl = t.c[i];\n    var mscl = cl.mod;\n    while (sr !== null && cl !== null) {\n      if (bottom(sr) > ih.low) ih = ih.nxt;\n      var dist = mssr + sr.prelim + sr.w - (mscl + cl.prelim);\n      if (dist > 0) {\n        mscl += dist;\n        moveSubtree(t, i, ih.index, dist);\n      }\n      var sy = bottom(sr);\n      var cy = bottom(cl);\n      if (sy <= cy) {\n        sr = nextRightContour(sr);\n        if (sr !== null) mssr += sr.mod;\n      }\n      if (sy >= cy) {\n        cl = nextLeftContour(cl);\n        if (cl !== null) mscl += cl.mod;\n      }\n    }\n    if (!sr && !!cl) {\n      setLeftThread(t, i, cl, mscl);\n    } else if (!!sr && !cl) {\n      setRightThread(t, i, sr, mssr);\n    }\n  }\n  function moveSubtree(t, i, si, dist) {\n    t.c[i].mod += dist;\n    t.c[i].msel += dist;\n    t.c[i].mser += dist;\n    distributeExtra(t, i, si, dist);\n  }\n  function nextLeftContour(t) {\n    return t.cs === 0 ? t.tl : t.c[0];\n  }\n  function nextRightContour(t) {\n    return t.cs === 0 ? t.tr : t.c[t.cs - 1];\n  }\n  function bottom(t) {\n    return t.y + t.h;\n  }\n  function setLeftThread(t, i, cl, modsumcl) {\n    var li = t.c[0].el;\n    li.tl = cl;\n    var diff = modsumcl - cl.mod - t.c[0].msel;\n    li.mod += diff;\n    li.prelim -= diff;\n    t.c[0].el = t.c[i].el;\n    t.c[0].msel = t.c[i].msel;\n  }\n  function setRightThread(t, i, sr, modsumsr) {\n    var ri = t.c[i].er;\n    ri.tr = sr;\n    var diff = modsumsr - sr.mod - t.c[i].mser;\n    ri.mod += diff;\n    ri.prelim -= diff;\n    t.c[i].er = t.c[i - 1].er;\n    t.c[i].mser = t.c[i - 1].mser;\n  }\n  function positionRoot(t) {\n    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;\n  }\n  function secondWalk(t, modsum) {\n    modsum += t.mod;\n    t.x = t.prelim + modsum;\n    addChildSpacing(t);\n    for (var i = 0; i < t.cs; i++) {\n      secondWalk(t.c[i], modsum);\n    }\n  }\n  function distributeExtra(t, i, si, dist) {\n    if (si !== i - 1) {\n      var nr = i - si;\n      t.c[si + 1].shift += dist / nr;\n      t.c[i].shift -= dist / nr;\n      t.c[i].change -= dist - dist / nr;\n    }\n  }\n  function addChildSpacing(t) {\n    var d = 0;\n    var modsumdelta = 0;\n    for (var i = 0; i < t.cs; i++) {\n      d += t.c[i].shift;\n      modsumdelta += d + t.c[i].change;\n      t.c[i].mod += modsumdelta;\n    }\n  }\n  function updateIYL(low, index, ih) {\n    while (ih !== null && low >= ih.low) {\n      ih = ih.nxt;\n    }\n    return {\n      low: low,\n      index: index,\n      nxt: ih\n    };\n  }\n\n  // do layout\n  layer(root, isHorizontal);\n  var wt = WrappedTree.fromNode(root, isHorizontal);\n  firstWalk(wt);\n  secondWalk(wt, 0);\n  convertBack(wt, root, isHorizontal);\n  normalize(root, isHorizontal);\n  return root;\n};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/layout/non-layered-tidy.js\n// module id = 119\n// module chunks = 0","function _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar TreeLayout = require('./layout/base');\nvar dendrogram = require('./layout/dendrogram');\nvar doTreeLayout = require('./layout/do-layout');\nvar util = require('./util');\nvar DendrogramLayout = /*#__PURE__*/function (_TreeLayout) {\n  _inheritsLoose(DendrogramLayout, _TreeLayout);\n  function DendrogramLayout() {\n    return _TreeLayout.apply(this, arguments) || this;\n  }\n  var _proto = DendrogramLayout.prototype;\n  _proto.execute = function execute() {\n    var me = this;\n    me.rootNode.width = 0;\n    return doTreeLayout(me.rootNode, me.options, dendrogram);\n  };\n  return DendrogramLayout;\n}(TreeLayout);\nvar DEFAULT_OPTIONS = {};\nfunction dendrogramLayout(root, options) {\n  options = util.assign({}, DEFAULT_OPTIONS, options);\n  return new DendrogramLayout(root, options).execute();\n}\nmodule.exports = dendrogramLayout;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/dendrogram.js\n// module id = 120\n// module chunks = 0","// wrap tree node\n// TODO considering size\nvar util = require('../util');\nfunction WrappedTree(height, children) {\n  if (height === void 0) {\n    height = 0;\n  }\n  if (children === void 0) {\n    children = [];\n  }\n  var me = this;\n  me.x = me.y = 0;\n  me.leftChild = me.rightChild = null;\n  me.height = 0;\n  me.children = children;\n}\nvar DEFAULT_OPTIONS = {\n  isHorizontal: true,\n  nodeSep: 20,\n  nodeSize: 20,\n  rankSep: 200,\n  subTreeSep: 10\n};\nfunction convertBack(converted /* WrappedTree */, root /* TreeNode */, isHorizontal) {\n  if (isHorizontal) {\n    root.x = converted.x;\n    root.y = converted.y;\n  } else {\n    root.x = converted.y;\n    root.y = converted.x;\n  }\n  converted.children.forEach(function (child, i) {\n    convertBack(child, root.children[i], isHorizontal);\n  });\n}\nmodule.exports = function (root, options) {\n  if (options === void 0) {\n    options = {};\n  }\n  options = util.assign({}, DEFAULT_OPTIONS, options);\n  var maxDepth = 0;\n  function wrappedTreeFromNode(n) {\n    if (!n) return null;\n    n.width = 0;\n    if (n.depth && n.depth > maxDepth) {\n      maxDepth = n.depth; // get the max depth\n    }\n\n    var children = n.children;\n    var childrenCount = children.length;\n    var t = new WrappedTree(n.height, []);\n    children.forEach(function (child, i) {\n      var childWT = wrappedTreeFromNode(child);\n      t.children.push(childWT);\n      if (i === 0) {\n        // t.leftChild = childWT.leftChild ? childWT.leftChild : childWT\n        t.leftChild = childWT;\n      }\n      if (i === childrenCount - 1) {\n        // t.rightChild = childWT.rightChild ? childWT.rightChild : childWT\n        t.rightChild = childWT;\n      }\n    });\n    t.originNode = n;\n    t.isLeaf = n.isLeaf();\n    return t;\n  }\n  function getDrawingDepth(t) {\n    if (t.isLeaf || t.children.length === 0) {\n      t.drawingDepth = maxDepth;\n    } else {\n      var depths = t.children.map(function (child) {\n        return getDrawingDepth(child);\n      });\n      var minChildDepth = Math.min.apply(null, depths);\n      t.drawingDepth = minChildDepth - 1;\n    }\n    return t.drawingDepth;\n  }\n  var prevLeaf;\n  function position(t) {\n    t.x = t.drawingDepth * options.rankSep;\n    if (t.isLeaf) {\n      t.y = 0;\n      if (prevLeaf) {\n        t.y = prevLeaf.y + prevLeaf.height + options.nodeSep;\n        if (t.originNode.parent !== prevLeaf.originNode.parent) {\n          t.y += options.subTreeSep;\n        }\n      }\n      prevLeaf = t;\n    } else {\n      t.children.forEach(function (child) {\n        position(child);\n      });\n      t.y = (t.leftChild.y + t.rightChild.y) / 2;\n    }\n  }\n\n  // wrap node\n  var wt = wrappedTreeFromNode(root);\n  // get depth for drawing\n  getDrawingDepth(wt);\n  // get position\n  position(wt);\n  // get x, y\n  convertBack(wt, root, options.isHorizontal);\n  return root;\n};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/layout/dendrogram.js\n// module id = 121\n// module chunks = 0","function _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar TreeLayout = require('./layout/base');\nvar indentedTree = require('./layout/indented');\nvar separateTree = require('./layout/separate-root');\nvar util = require('./util');\nvar VALID_DIRECTIONS = ['LR',\n// left to right\n'RL',\n// right to left\n'H' // horizontal\n];\n\nvar DEFAULT_DIRECTION = VALID_DIRECTIONS[0];\nvar IndentedLayout = /*#__PURE__*/function (_TreeLayout) {\n  _inheritsLoose(IndentedLayout, _TreeLayout);\n  function IndentedLayout() {\n    return _TreeLayout.apply(this, arguments) || this;\n  }\n  var _proto = IndentedLayout.prototype;\n  _proto.execute = function execute() {\n    var me = this;\n    var options = me.options;\n    var root = me.rootNode;\n    options.isHorizontal = true;\n    // default indent 20 and sink first children;\n    var _options$indent = options.indent,\n      indent = _options$indent === void 0 ? 20 : _options$indent,\n      _options$dropCap = options.dropCap,\n      dropCap = _options$dropCap === void 0 ? true : _options$dropCap,\n      _options$direction = options.direction,\n      direction = _options$direction === void 0 ? DEFAULT_DIRECTION : _options$direction,\n      align = options.align;\n    if (direction && VALID_DIRECTIONS.indexOf(direction) === -1) {\n      throw new TypeError(\"Invalid direction: \" + direction);\n    }\n    if (direction === VALID_DIRECTIONS[0]) {\n      // LR\n      indentedTree(root, indent, dropCap, align);\n    } else if (direction === VALID_DIRECTIONS[1]) {\n      // RL\n      indentedTree(root, indent, dropCap, align);\n      root.right2left();\n    } else if (direction === VALID_DIRECTIONS[2]) {\n      // H\n      // separate into left and right trees\n      var _separateTree = separateTree(root, options),\n        left = _separateTree.left,\n        right = _separateTree.right;\n      indentedTree(left, indent, dropCap, align);\n      left.right2left();\n      indentedTree(right, indent, dropCap, align);\n      var bbox = left.getBoundingBox();\n      right.translate(bbox.width, 0);\n      root.x = right.x - root.width / 2;\n    }\n    return root;\n  };\n  return IndentedLayout;\n}(TreeLayout);\nvar DEFAULT_OPTIONS = {};\nfunction indentedLayout(root, options) {\n  options = util.assign({}, DEFAULT_OPTIONS, options);\n  return new IndentedLayout(root, options).execute();\n}\nmodule.exports = indentedLayout;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/indented.js\n// module id = 122\n// module chunks = 0","var util = require(\"../util\");\nfunction positionNode(node, previousNode, indent, dropCap, align) {\n  //  caculate the node's horizontal offset DX, dx's type might be number or function\n  var displacementX = typeof indent === \"function\" ? indent(node) : indent * node.depth;\n  if (!dropCap) {\n    try {\n      if (node.id === node.parent.children[0].id) {\n        node.x += displacementX;\n        node.y = previousNode ? previousNode.y : 0;\n        return;\n      }\n    } catch (e) {\n      // skip to normal when a node has no parent\n    }\n  }\n  node.x += displacementX;\n  if (previousNode) {\n    node.y = previousNode.y + util.getHeight(previousNode, node, align);\n    if (previousNode.parent && node.parent.id !== previousNode.parent.id) {\n      // previous node has different parent\n      var prevParent = previousNode.parent;\n      var preY = prevParent.y + util.getHeight(prevParent, node, align);\n      node.y = preY > node.y ? preY : node.y;\n    }\n  } else {\n    node.y = 0;\n  }\n  return;\n}\nmodule.exports = function (root, indent, dropCap, align) {\n  var previousNode = null;\n  root.eachNode(function (node) {\n    positionNode(node, previousNode, indent, dropCap, align);\n    previousNode = node;\n  });\n};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/layout/indented.js\n// module id = 123\n// module chunks = 0","function _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; _setPrototypeOf(subClass, superClass); }\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\nvar TreeLayout = require('./layout/base');\nvar mindmap = require('./layout/mindmap');\nvar doTreeLayout = require('./layout/do-layout');\nvar util = require('./util');\nvar MindmapLayout = /*#__PURE__*/function (_TreeLayout) {\n  _inheritsLoose(MindmapLayout, _TreeLayout);\n  function MindmapLayout() {\n    return _TreeLayout.apply(this, arguments) || this;\n  }\n  var _proto = MindmapLayout.prototype;\n  _proto.execute = function execute() {\n    var me = this;\n    return doTreeLayout(me.rootNode, me.options, mindmap);\n  };\n  return MindmapLayout;\n}(TreeLayout);\nvar DEFAULT_OPTIONS = {};\nfunction mindmapLayout(root, options) {\n  options = util.assign({}, DEFAULT_OPTIONS, options);\n  return new MindmapLayout(root, options).execute();\n}\nmodule.exports = mindmapLayout;\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/mindmap.js\n// module id = 124\n// module chunks = 0","var util = require('../util');\nfunction secondWalk(node, options) {\n  var totalHeight = 0;\n  if (!node.children.length) {\n    totalHeight = node.height;\n  } else {\n    node.children.forEach(function (c) {\n      totalHeight += secondWalk(c, options);\n    });\n  }\n  node._subTreeSep = options.getSubTreeSep(node.data);\n  node.totalHeight = Math.max(node.height, totalHeight) + 2 * node._subTreeSep;\n  return node.totalHeight;\n}\nfunction thirdWalk(node) {\n  var children = node.children;\n  var len = children.length;\n  if (len) {\n    children.forEach(function (c) {\n      thirdWalk(c);\n    });\n    var first = children[0];\n    var last = children[len - 1];\n    var childrenHeight = last.y - first.y + last.height;\n    var childrenTotalHeight = 0;\n    children.forEach(function (child) {\n      childrenTotalHeight += child.totalHeight;\n    });\n    if (childrenHeight > node.height) {\n      // 当子节点总高度大于父节点高度\n      node.y = first.y + childrenHeight / 2 - node.height / 2;\n    } else if (children.length !== 1 || node.height > childrenTotalHeight) {\n      // 多于一个子节点或者父节点大于所有子节点的总高度\n      var offset = node.y + (node.height - childrenHeight) / 2 - first.y;\n      children.forEach(function (c) {\n        c.translate(0, offset);\n      });\n    } else {\n      // 只有一个子节点\n      node.y = (first.y + first.height / 2 + last.y + last.height / 2) / 2 - node.height / 2;\n    }\n  }\n}\nvar DEFAULT_OPTIONS = {\n  getSubTreeSep: function getSubTreeSep() {\n    return 0;\n  }\n};\nmodule.exports = function (root, options) {\n  if (options === void 0) {\n    options = {};\n  }\n  options = util.assign({}, DEFAULT_OPTIONS, options);\n  root.parent = {\n    x: 0,\n    width: 0,\n    height: 0,\n    y: 0\n  };\n  // first walk\n  root.BFTraverse(function (node) {\n    node.x = node.parent.x + node.parent.width; // simply get x\n  });\n\n  root.parent = null;\n  // second walk\n  secondWalk(root, options); // assign sub tree totalHeight\n  // adjusting\n  // separating nodes\n  root.startY = 0;\n  root.y = root.totalHeight / 2 - root.height / 2;\n  root.eachNode(function (node) {\n    var children = node.children;\n    var len = children.length;\n    if (len) {\n      var first = children[0];\n      first.startY = node.startY + node._subTreeSep;\n      if (len === 1) {\n        first.y = node.y + node.height / 2 - first.height / 2;\n      } else {\n        first.y = first.startY + first.totalHeight / 2 - first.height / 2;\n        for (var i = 1; i < len; i++) {\n          var c = children[i];\n          c.startY = children[i - 1].startY + children[i - 1].totalHeight;\n          c.y = c.startY + c.totalHeight / 2 - c.height / 2;\n        }\n      }\n    }\n  });\n\n  // third walk\n  thirdWalk(root);\n};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./src/layout/mindmap.js\n// module id = 125\n// module chunks = 0"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;ACVA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;AC7DA;AAAA;AACA;AACA;AACA;;;;;;;ACHA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACTA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACRA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AACA;AACA;AACA;;;;;;;ACHA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;ACRA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACpBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACRA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACzBA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;ACrBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AChBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACTA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACPA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACTA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACdA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;ACbA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;ACxEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC1LA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACdA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACdA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACbA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACzBA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACzBA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AClBA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACbA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AChBA;AAAA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC3BA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACxBA;AACA;AACA;;;;;;;ACFA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACNA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC7BA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC3CA;AAAA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;AC3BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;ACtCA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;ACNA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACvBA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;ACtHA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACnBA;AAAA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACxBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACZA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AClBA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACpBA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACxBA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC7BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACjBA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC1BA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AChCA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACRA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACxBA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACNA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACPA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACLA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACXA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACXA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACVA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACjBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACdA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AChCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACRA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACZA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACPA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC/BA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC/BA;AACA;AACA;AACA;;;;;;;ACHA;AACA;AACA;AACA;AACA;;;;;;;ACJA;;;;;;;ACAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AACA;;;;;;;ACDA;AAAA;AACA;;;;;;;ACDA;AAAA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACXA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACLA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACVA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACVA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACVA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACPA;AACA;AACA;AACA;;;;;;;ACHA;AAAA;AACA;AACA;AACA;AACA;;;;;;;ACJA;AACA;AACA;AACA;;;;;;;ACHA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACPA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACVA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACRA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AChBA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC3BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACnBA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACtCA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC7BA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AClBA;AAAA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACnCA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;AC7BA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACbA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACjBA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACdA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACxBA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACdA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACRA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACnCA;AAAA;AACA;AACA;AACA;;;;;;;ACHA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACTA;;;;;;;ACAA;AACA;AACA;;;;;;;ACFA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACVA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACxbA;AAAA;AAAA;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;ACrEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;AC5BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;AC3OA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;ACxBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;AC5GA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;ACjEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;ACnCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;ACvBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;A","sourceRoot":""}