@ecan-bi/datav 1.0.61 → 1.0.64

package/es/node_modules/echarts/lib/util/model.js.map

@@ -1 +1 @@
-{"version":3,"file":"model.js","sources":["../../../../../node_modules/echarts/lib/util/model.js"],"sourcesContent":["\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\n\n\n/**\n * AUTO-GENERATED FILE. DO NOT MODIFY.\n */\n\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\nimport { each, isObject, isArray, createHashMap, map, assert, isString, indexOf, isStringSafe, isNumber } from 'zrender/lib/core/util.js';\nimport env from 'zrender/lib/core/env.js';\nimport { isNumeric, getRandomIdBase, getPrecision, round } from './number.js';\nimport { warn } from './log.js';\n\nfunction interpolateNumber(p0, p1, percent) {\n  return (p1 - p0) * percent + p0;\n}\n/**\n * Make the name displayable. But we should\n * make sure it is not duplicated with user\n * specified name, so use '\\0';\n */\n\n\nvar DUMMY_COMPONENT_NAME_PREFIX = 'series\\0';\nvar INTERNAL_COMPONENT_ID_PREFIX = '\\0_ec_\\0';\n/**\n * If value is not array, then translate it to array.\n * @param  {*} value\n * @return {Array} [value] or value\n */\n\nexport function normalizeToArray(value) {\n  return value instanceof Array ? value : value == null ? [] : [value];\n}\n/**\n * Sync default option between normal and emphasis like `position` and `show`\n * In case some one will write code like\n *     label: {\n *          show: false,\n *          position: 'outside',\n *          fontSize: 18\n *     },\n *     emphasis: {\n *          label: { show: true }\n *     }\n */\n\nexport function defaultEmphasis(opt, key, subOpts) {\n  // Caution: performance sensitive.\n  if (opt) {\n    opt[key] = opt[key] || {};\n    opt.emphasis = opt.emphasis || {};\n    opt.emphasis[key] = opt.emphasis[key] || {}; // Default emphasis option from normal\n\n    for (var i = 0, len = subOpts.length; i < len; i++) {\n      var subOptName = subOpts[i];\n\n      if (!opt.emphasis[key].hasOwnProperty(subOptName) && opt[key].hasOwnProperty(subOptName)) {\n        opt.emphasis[key][subOptName] = opt[key][subOptName];\n      }\n    }\n  }\n}\nexport var TEXT_STYLE_OPTIONS = ['fontStyle', 'fontWeight', 'fontSize', 'fontFamily', 'rich', 'tag', 'color', 'textBorderColor', 'textBorderWidth', 'width', 'height', 'lineHeight', 'align', 'verticalAlign', 'baseline', 'shadowColor', 'shadowBlur', 'shadowOffsetX', 'shadowOffsetY', 'textShadowColor', 'textShadowBlur', 'textShadowOffsetX', 'textShadowOffsetY', 'backgroundColor', 'borderColor', 'borderWidth', 'borderRadius', 'padding']; // modelUtil.LABEL_OPTIONS = modelUtil.TEXT_STYLE_OPTIONS.concat([\n//     'position', 'offset', 'rotate', 'origin', 'show', 'distance', 'formatter',\n//     'fontStyle', 'fontWeight', 'fontSize', 'fontFamily',\n//     // FIXME: deprecated, check and remove it.\n//     'textStyle'\n// ]);\n\n/**\n * The method do not ensure performance.\n * data could be [12, 2323, {value: 223}, [1221, 23], {value: [2, 23]}]\n * This helper method retieves value from data.\n */\n\nexport function getDataItemValue(dataItem) {\n  return isObject(dataItem) && !isArray(dataItem) && !(dataItem instanceof Date) ? dataItem.value : dataItem;\n}\n/**\n * data could be [12, 2323, {value: 223}, [1221, 23], {value: [2, 23]}]\n * This helper method determine if dataItem has extra option besides value\n */\n\nexport function isDataItemOption(dataItem) {\n  return isObject(dataItem) && !(dataItem instanceof Array); // // markLine data can be array\n  // && !(dataItem[0] && isObject(dataItem[0]) && !(dataItem[0] instanceof Array));\n}\n;\n/**\n * Mapping to existings for merge.\n *\n * Mode \"normalMege\":\n *     The mapping result (merge result) will keep the order of the existing\n *     component, rather than the order of new option. Because we should ensure\n *     some specified index reference (like xAxisIndex) keep work.\n *     And in most cases, \"merge option\" is used to update partial option but not\n *     be expected to change the order.\n *\n * Mode \"replaceMege\":\n *     (1) Only the id mapped components will be merged.\n *     (2) Other existing components (except internal compoonets) will be removed.\n *     (3) Other new options will be used to create new component.\n *     (4) The index of the existing compoents will not be modified.\n *     That means their might be \"hole\" after the removal.\n *     The new components are created first at those available index.\n *\n * Mode \"replaceAll\":\n *     This mode try to support that reproduce an echarts instance from another\n *     echarts instance (via `getOption`) in some simple cases.\n *     In this senario, the `result` index are exactly the consistent with the `newCmptOptions`,\n *     which ensures the compoennt index referring (like `xAxisIndex: ?`) corrent. That is,\n *     the \"hole\" in `newCmptOptions` will also be kept.\n *     On the contrary, other modes try best to eliminate holes.\n *     PENDING: This is an experimental mode yet.\n *\n * @return See the comment of <MappingResult>.\n */\n\nexport function mappingToExists(existings, newCmptOptions, mode) {\n  var isNormalMergeMode = mode === 'normalMerge';\n  var isReplaceMergeMode = mode === 'replaceMerge';\n  var isReplaceAllMode = mode === 'replaceAll';\n  existings = existings || [];\n  newCmptOptions = (newCmptOptions || []).slice();\n  var existingIdIdxMap = createHashMap(); // Validate id and name on user input option.\n\n  each(newCmptOptions, function (cmptOption, index) {\n    if (!isObject(cmptOption)) {\n      newCmptOptions[index] = null;\n      return;\n    }\n\n    if (process.env.NODE_ENV !== 'production') {\n      // There is some legacy case that name is set as `false`.\n      // But should work normally rather than throw error.\n      if (cmptOption.id != null && !isValidIdOrName(cmptOption.id)) {\n        warnInvalidateIdOrName(cmptOption.id);\n      }\n\n      if (cmptOption.name != null && !isValidIdOrName(cmptOption.name)) {\n        warnInvalidateIdOrName(cmptOption.name);\n      }\n    }\n  });\n  var result = prepareResult(existings, existingIdIdxMap, mode);\n\n  if (isNormalMergeMode || isReplaceMergeMode) {\n    mappingById(result, existings, existingIdIdxMap, newCmptOptions);\n  }\n\n  if (isNormalMergeMode) {\n    mappingByName(result, newCmptOptions);\n  }\n\n  if (isNormalMergeMode || isReplaceMergeMode) {\n    mappingByIndex(result, newCmptOptions, isReplaceMergeMode);\n  } else if (isReplaceAllMode) {\n    mappingInReplaceAllMode(result, newCmptOptions);\n  }\n\n  makeIdAndName(result); // The array `result` MUST NOT contain elided items, otherwise the\n  // forEach will ommit those items and result in incorrect result.\n\n  return result;\n}\n\nfunction prepareResult(existings, existingIdIdxMap, mode) {\n  var result = [];\n\n  if (mode === 'replaceAll') {\n    return result;\n  } // Do not use native `map` to in case that the array `existings`\n  // contains elided items, which will be ommited.\n\n\n  for (var index = 0; index < existings.length; index++) {\n    var existing = existings[index]; // Because of replaceMerge, `existing` may be null/undefined.\n\n    if (existing && existing.id != null) {\n      existingIdIdxMap.set(existing.id, index);\n    } // For non-internal-componnets:\n    //     Mode \"normalMerge\": all existings kept.\n    //     Mode \"replaceMerge\": all existing removed unless mapped by id.\n    // For internal-components:\n    //     go with \"replaceMerge\" approach in both mode.\n\n\n    result.push({\n      existing: mode === 'replaceMerge' || isComponentIdInternal(existing) ? null : existing,\n      newOption: null,\n      keyInfo: null,\n      brandNew: null\n    });\n  }\n\n  return result;\n}\n\nfunction mappingById(result, existings, existingIdIdxMap, newCmptOptions) {\n  // Mapping by id if specified.\n  each(newCmptOptions, function (cmptOption, index) {\n    if (!cmptOption || cmptOption.id == null) {\n      return;\n    }\n\n    var optionId = makeComparableKey(cmptOption.id);\n    var existingIdx = existingIdIdxMap.get(optionId);\n\n    if (existingIdx != null) {\n      var resultItem = result[existingIdx];\n      assert(!resultItem.newOption, 'Duplicated option on id \"' + optionId + '\".');\n      resultItem.newOption = cmptOption; // In both mode, if id matched, new option will be merged to\n      // the existings rather than creating new component model.\n\n      resultItem.existing = existings[existingIdx];\n      newCmptOptions[index] = null;\n    }\n  });\n}\n\nfunction mappingByName(result, newCmptOptions) {\n  // Mapping by name if specified.\n  each(newCmptOptions, function (cmptOption, index) {\n    if (!cmptOption || cmptOption.name == null) {\n      return;\n    }\n\n    for (var i = 0; i < result.length; i++) {\n      var existing = result[i].existing;\n\n      if (!result[i].newOption // Consider name: two map to one.\n      // Can not match when both ids existing but different.\n      && existing && (existing.id == null || cmptOption.id == null) && !isComponentIdInternal(cmptOption) && !isComponentIdInternal(existing) && keyExistAndEqual('name', existing, cmptOption)) {\n        result[i].newOption = cmptOption;\n        newCmptOptions[index] = null;\n        return;\n      }\n    }\n  });\n}\n\nfunction mappingByIndex(result, newCmptOptions, brandNew) {\n  each(newCmptOptions, function (cmptOption) {\n    if (!cmptOption) {\n      return;\n    } // Find the first place that not mapped by id and not internal component (consider the \"hole\").\n\n\n    var resultItem;\n    var nextIdx = 0;\n\n    while ( // Be `!resultItem` only when `nextIdx >= result.length`.\n    (resultItem = result[nextIdx]) && ( // (1) Existing models that already have id should be able to mapped to. Because\n    // after mapping performed, model will always be assigned with an id if user not given.\n    // After that all models have id.\n    // (2) If new option has id, it can only set to a hole or append to the last. It should\n    // not be merged to the existings with different id. Because id should not be overwritten.\n    // (3) Name can be overwritten, because axis use name as 'show label text'.\n    resultItem.newOption || isComponentIdInternal(resultItem.existing) || // In mode \"replaceMerge\", here no not-mapped-non-internal-existing.\n    resultItem.existing && cmptOption.id != null && !keyExistAndEqual('id', cmptOption, resultItem.existing))) {\n      nextIdx++;\n    }\n\n    if (resultItem) {\n      resultItem.newOption = cmptOption;\n      resultItem.brandNew = brandNew;\n    } else {\n      result.push({\n        newOption: cmptOption,\n        brandNew: brandNew,\n        existing: null,\n        keyInfo: null\n      });\n    }\n\n    nextIdx++;\n  });\n}\n\nfunction mappingInReplaceAllMode(result, newCmptOptions) {\n  each(newCmptOptions, function (cmptOption) {\n    // The feature \"reproduce\" requires \"hole\" will also reproduced\n    // in case that compoennt index referring are broken.\n    result.push({\n      newOption: cmptOption,\n      brandNew: true,\n      existing: null,\n      keyInfo: null\n    });\n  });\n}\n/**\n * Make id and name for mapping result (result of mappingToExists)\n * into `keyInfo` field.\n */\n\n\nfunction makeIdAndName(mapResult) {\n  // We use this id to hash component models and view instances\n  // in echarts. id can be specified by user, or auto generated.\n  // The id generation rule ensures new view instance are able\n  // to mapped to old instance when setOption are called in\n  // no-merge mode. So we generate model id by name and plus\n  // type in view id.\n  // name can be duplicated among components, which is convenient\n  // to specify multi components (like series) by one name.\n  // Ensure that each id is distinct.\n  var idMap = createHashMap();\n  each(mapResult, function (item) {\n    var existing = item.existing;\n    existing && idMap.set(existing.id, item);\n  });\n  each(mapResult, function (item) {\n    var opt = item.newOption; // Force ensure id not duplicated.\n\n    assert(!opt || opt.id == null || !idMap.get(opt.id) || idMap.get(opt.id) === item, 'id duplicates: ' + (opt && opt.id));\n    opt && opt.id != null && idMap.set(opt.id, item);\n    !item.keyInfo && (item.keyInfo = {});\n  }); // Make name and id.\n\n  each(mapResult, function (item, index) {\n    var existing = item.existing;\n    var opt = item.newOption;\n    var keyInfo = item.keyInfo;\n\n    if (!isObject(opt)) {\n      return;\n    } // name can be overwitten. Consider case: axis.name = '20km'.\n    // But id generated by name will not be changed, which affect\n    // only in that case: setOption with 'not merge mode' and view\n    // instance will be recreated, which can be accepted.\n\n\n    keyInfo.name = opt.name != null ? makeComparableKey(opt.name) : existing ? existing.name // Avoid diffferent series has the same name,\n    // because name may be used like in color pallet.\n    : DUMMY_COMPONENT_NAME_PREFIX + index;\n\n    if (existing) {\n      keyInfo.id = makeComparableKey(existing.id);\n    } else if (opt.id != null) {\n      keyInfo.id = makeComparableKey(opt.id);\n    } else {\n      // Consider this situatoin:\n      //  optionA: [{name: 'a'}, {name: 'a'}, {..}]\n      //  optionB [{..}, {name: 'a'}, {name: 'a'}]\n      // Series with the same name between optionA and optionB\n      // should be mapped.\n      var idNum = 0;\n\n      do {\n        keyInfo.id = '\\0' + keyInfo.name + '\\0' + idNum++;\n      } while (idMap.get(keyInfo.id));\n    }\n\n    idMap.set(keyInfo.id, item);\n  });\n}\n\nfunction keyExistAndEqual(attr, obj1, obj2) {\n  var key1 = convertOptionIdName(obj1[attr], null);\n  var key2 = convertOptionIdName(obj2[attr], null); // See `MappingExistingItem`. `id` and `name` trade string equals to number.\n\n  return key1 != null && key2 != null && key1 === key2;\n}\n/**\n * @return return null if not exist.\n */\n\n\nfunction makeComparableKey(val) {\n  if (process.env.NODE_ENV !== 'production') {\n    if (val == null) {\n      throw new Error();\n    }\n  }\n\n  return convertOptionIdName(val, '');\n}\n\nexport function convertOptionIdName(idOrName, defaultValue) {\n  if (idOrName == null) {\n    return defaultValue;\n  }\n\n  return isString(idOrName) ? idOrName : isNumber(idOrName) || isStringSafe(idOrName) ? idOrName + '' : defaultValue;\n}\n\nfunction warnInvalidateIdOrName(idOrName) {\n  if (process.env.NODE_ENV !== 'production') {\n    warn('`' + idOrName + '` is invalid id or name. Must be a string or number.');\n  }\n}\n\nfunction isValidIdOrName(idOrName) {\n  return isStringSafe(idOrName) || isNumeric(idOrName);\n}\n\nexport function isNameSpecified(componentModel) {\n  var name = componentModel.name; // Is specified when `indexOf` get -1 or > 0.\n\n  return !!(name && name.indexOf(DUMMY_COMPONENT_NAME_PREFIX));\n}\n/**\n * @public\n * @param {Object} cmptOption\n * @return {boolean}\n */\n\nexport function isComponentIdInternal(cmptOption) {\n  return cmptOption && cmptOption.id != null && makeComparableKey(cmptOption.id).indexOf(INTERNAL_COMPONENT_ID_PREFIX) === 0;\n}\nexport function makeInternalComponentId(idSuffix) {\n  return INTERNAL_COMPONENT_ID_PREFIX + idSuffix;\n}\nexport function setComponentTypeToKeyInfo(mappingResult, mainType, componentModelCtor) {\n  // Set mainType and complete subType.\n  each(mappingResult, function (item) {\n    var newOption = item.newOption;\n\n    if (isObject(newOption)) {\n      item.keyInfo.mainType = mainType;\n      item.keyInfo.subType = determineSubType(mainType, newOption, item.existing, componentModelCtor);\n    }\n  });\n}\n\nfunction determineSubType(mainType, newCmptOption, existComponent, componentModelCtor) {\n  var subType = newCmptOption.type ? newCmptOption.type : existComponent ? existComponent.subType // Use determineSubType only when there is no existComponent.\n  : componentModelCtor.determineSubType(mainType, newCmptOption); // tooltip, markline, markpoint may always has no subType\n\n  return subType;\n}\n/**\n * A helper for removing duplicate items between batchA and batchB,\n * and in themselves, and categorize by series.\n *\n * @param batchA Like: [{seriesId: 2, dataIndex: [32, 4, 5]}, ...]\n * @param batchB Like: [{seriesId: 2, dataIndex: [32, 4, 5]}, ...]\n * @return result: [resultBatchA, resultBatchB]\n */\n\n\nexport function compressBatches(batchA, batchB) {\n  var mapA = {};\n  var mapB = {};\n  makeMap(batchA || [], mapA);\n  makeMap(batchB || [], mapB, mapA);\n  return [mapToArray(mapA), mapToArray(mapB)];\n\n  function makeMap(sourceBatch, map, otherMap) {\n    for (var i = 0, len = sourceBatch.length; i < len; i++) {\n      var seriesId = convertOptionIdName(sourceBatch[i].seriesId, null);\n\n      if (seriesId == null) {\n        return;\n      }\n\n      var dataIndices = normalizeToArray(sourceBatch[i].dataIndex);\n      var otherDataIndices = otherMap && otherMap[seriesId];\n\n      for (var j = 0, lenj = dataIndices.length; j < lenj; j++) {\n        var dataIndex = dataIndices[j];\n\n        if (otherDataIndices && otherDataIndices[dataIndex]) {\n          otherDataIndices[dataIndex] = null;\n        } else {\n          (map[seriesId] || (map[seriesId] = {}))[dataIndex] = 1;\n        }\n      }\n    }\n  }\n\n  function mapToArray(map, isData) {\n    var result = [];\n\n    for (var i in map) {\n      if (map.hasOwnProperty(i) && map[i] != null) {\n        if (isData) {\n          result.push(+i);\n        } else {\n          var dataIndices = mapToArray(map[i], true);\n          dataIndices.length && result.push({\n            seriesId: i,\n            dataIndex: dataIndices\n          });\n        }\n      }\n    }\n\n    return result;\n  }\n}\n/**\n * @param payload Contains dataIndex (means rawIndex) / dataIndexInside / name\n *                         each of which can be Array or primary type.\n * @return dataIndex If not found, return undefined/null.\n */\n\nexport function queryDataIndex(data, payload) {\n  if (payload.dataIndexInside != null) {\n    return payload.dataIndexInside;\n  } else if (payload.dataIndex != null) {\n    return isArray(payload.dataIndex) ? map(payload.dataIndex, function (value) {\n      return data.indexOfRawIndex(value);\n    }) : data.indexOfRawIndex(payload.dataIndex);\n  } else if (payload.name != null) {\n    return isArray(payload.name) ? map(payload.name, function (value) {\n      return data.indexOfName(value);\n    }) : data.indexOfName(payload.name);\n  }\n}\n/**\n * Enable property storage to any host object.\n * Notice: Serialization is not supported.\n *\n * For example:\n * let inner = zrUitl.makeInner();\n *\n * function some1(hostObj) {\n *      inner(hostObj).someProperty = 1212;\n *      ...\n * }\n * function some2() {\n *      let fields = inner(this);\n *      fields.someProperty1 = 1212;\n *      fields.someProperty2 = 'xx';\n *      ...\n * }\n *\n * @return {Function}\n */\n\nexport function makeInner() {\n  var key = '__ec_inner_' + innerUniqueIndex++;\n  return function (hostObj) {\n    return hostObj[key] || (hostObj[key] = {});\n  };\n}\nvar innerUniqueIndex = getRandomIdBase();\n/**\n * The same behavior as `component.getReferringComponents`.\n */\n\nexport function parseFinder(ecModel, finderInput, opt) {\n  var _a = preParseFinder(finderInput, opt),\n      mainTypeSpecified = _a.mainTypeSpecified,\n      queryOptionMap = _a.queryOptionMap,\n      others = _a.others;\n\n  var result = others;\n  var defaultMainType = opt ? opt.defaultMainType : null;\n\n  if (!mainTypeSpecified && defaultMainType) {\n    queryOptionMap.set(defaultMainType, {});\n  }\n\n  queryOptionMap.each(function (queryOption, mainType) {\n    var queryResult = queryReferringComponents(ecModel, mainType, queryOption, {\n      useDefault: defaultMainType === mainType,\n      enableAll: opt && opt.enableAll != null ? opt.enableAll : true,\n      enableNone: opt && opt.enableNone != null ? opt.enableNone : true\n    });\n    result[mainType + 'Models'] = queryResult.models;\n    result[mainType + 'Model'] = queryResult.models[0];\n  });\n  return result;\n}\nexport function preParseFinder(finderInput, opt) {\n  var finder;\n\n  if (isString(finderInput)) {\n    var obj = {};\n    obj[finderInput + 'Index'] = 0;\n    finder = obj;\n  } else {\n    finder = finderInput;\n  }\n\n  var queryOptionMap = createHashMap();\n  var others = {};\n  var mainTypeSpecified = false;\n  each(finder, function (value, key) {\n    // Exclude 'dataIndex' and other illgal keys.\n    if (key === 'dataIndex' || key === 'dataIndexInside') {\n      others[key] = value;\n      return;\n    }\n\n    var parsedKey = key.match(/^(\\w+)(Index|Id|Name)$/) || [];\n    var mainType = parsedKey[1];\n    var queryType = (parsedKey[2] || '').toLowerCase();\n\n    if (!mainType || !queryType || opt && opt.includeMainTypes && indexOf(opt.includeMainTypes, mainType) < 0) {\n      return;\n    }\n\n    mainTypeSpecified = mainTypeSpecified || !!mainType;\n    var queryOption = queryOptionMap.get(mainType) || queryOptionMap.set(mainType, {});\n    queryOption[queryType] = value;\n  });\n  return {\n    mainTypeSpecified: mainTypeSpecified,\n    queryOptionMap: queryOptionMap,\n    others: others\n  };\n}\nexport var SINGLE_REFERRING = {\n  useDefault: true,\n  enableAll: false,\n  enableNone: false\n};\nexport var MULTIPLE_REFERRING = {\n  useDefault: false,\n  enableAll: true,\n  enableNone: true\n};\nexport function queryReferringComponents(ecModel, mainType, userOption, opt) {\n  opt = opt || SINGLE_REFERRING;\n  var indexOption = userOption.index;\n  var idOption = userOption.id;\n  var nameOption = userOption.name;\n  var result = {\n    models: null,\n    specified: indexOption != null || idOption != null || nameOption != null\n  };\n\n  if (!result.specified) {\n    // Use the first as default if `useDefault`.\n    var firstCmpt = void 0;\n    result.models = opt.useDefault && (firstCmpt = ecModel.getComponent(mainType)) ? [firstCmpt] : [];\n    return result;\n  }\n\n  if (indexOption === 'none' || indexOption === false) {\n    assert(opt.enableNone, '`\"none\"` or `false` is not a valid value on index option.');\n    result.models = [];\n    return result;\n  } // `queryComponents` will return all components if\n  // both all of index/id/name are null/undefined.\n\n\n  if (indexOption === 'all') {\n    assert(opt.enableAll, '`\"all\"` is not a valid value on index option.');\n    indexOption = idOption = nameOption = null;\n  }\n\n  result.models = ecModel.queryComponents({\n    mainType: mainType,\n    index: indexOption,\n    id: idOption,\n    name: nameOption\n  });\n  return result;\n}\nexport function setAttribute(dom, key, value) {\n  dom.setAttribute ? dom.setAttribute(key, value) : dom[key] = value;\n}\nexport function getAttribute(dom, key) {\n  return dom.getAttribute ? dom.getAttribute(key) : dom[key];\n}\nexport function getTooltipRenderMode(renderModeOption) {\n  if (renderModeOption === 'auto') {\n    // Using html when `document` exists, use richText otherwise\n    return env.domSupported ? 'html' : 'richText';\n  } else {\n    return renderModeOption || 'html';\n  }\n}\n/**\n * Group a list by key.\n */\n\nexport function groupData(array, getKey // return key\n) {\n  var buckets = createHashMap();\n  var keys = [];\n  each(array, function (item) {\n    var key = getKey(item);\n    (buckets.get(key) || (keys.push(key), buckets.set(key, []))).push(item);\n  });\n  return {\n    keys: keys,\n    buckets: buckets\n  };\n}\n/**\n * Interpolate raw values of a series with percent\n *\n * @param data         data\n * @param labelModel   label model of the text element\n * @param sourceValue  start value. May be null/undefined when init.\n * @param targetValue  end value\n * @param percent      0~1 percentage; 0 uses start value while 1 uses end value\n * @return             interpolated values\n *                     If `sourceValue` and `targetValue` are `number`, return `number`.\n *                     If `sourceValue` and `targetValue` are `string`, return `string`.\n *                     If `sourceValue` and `targetValue` are `(string | number)[]`, return `(string | number)[]`.\n *                     Other cases do not supported.\n */\n\nexport function interpolateRawValues(data, precision, sourceValue, targetValue, percent) {\n  var isAutoPrecision = precision == null || precision === 'auto';\n\n  if (targetValue == null) {\n    return targetValue;\n  }\n\n  if (isNumber(targetValue)) {\n    var value = interpolateNumber(sourceValue || 0, targetValue, percent);\n    return round(value, isAutoPrecision ? Math.max(getPrecision(sourceValue || 0), getPrecision(targetValue)) : precision);\n  } else if (isString(targetValue)) {\n    return percent < 1 ? sourceValue : targetValue;\n  } else {\n    var interpolated = [];\n    var leftArr = sourceValue;\n    var rightArr = targetValue;\n    var length_1 = Math.max(leftArr ? leftArr.length : 0, rightArr.length);\n\n    for (var i = 0; i < length_1; ++i) {\n      var info = data.getDimensionInfo(i); // Don't interpolate ordinal dims\n\n      if (info && info.type === 'ordinal') {\n        // In init, there is no `sourceValue`, but should better not to get undefined result.\n        interpolated[i] = (percent < 1 && leftArr ? leftArr : rightArr)[i];\n      } else {\n        var leftVal = leftArr && leftArr[i] ? leftArr[i] : 0;\n        var rightVal = rightArr[i];\n        var value = interpolateNumber(leftVal, rightVal, percent);\n        interpolated[i] = round(value, isAutoPrecision ? Math.max(getPrecision(leftVal), getPrecision(rightVal)) : precision);\n      }\n    }\n\n    return interpolated;\n  }\n}"],"names":[],"mappings":";;;AAgDA,2BAA2B,IAAI,IAAI,SAAS;AAC1C,SAAQ,MAAK,MAAM,UAAU;AAC/B;AAQA,IAAI,8BAA8B;AAClC,IAAI,+BAA+B;AAO5B,0BAA0B,OAAO;AACtC,SAAO,iBAAiB,QAAQ,QAAQ,SAAS,OAAO,CAAE,IAAG,CAAC,KAAK;AACrE;AAcO,yBAAyB,KAAK,KAAK,SAAS;AAEjD,MAAI,KAAK;AACP,QAAI,OAAO,IAAI,QAAQ,CAAA;AACvB,QAAI,WAAW,IAAI,YAAY,CAAA;AAC/B,QAAI,SAAS,OAAO,IAAI,SAAS,QAAQ;AAEzC,aAAS,IAAI,GAAG,MAAM,QAAQ,QAAQ,IAAI,KAAK,KAAK;AAClD,UAAI,aAAa,QAAQ;AAEzB,UAAI,CAAC,IAAI,SAAS,KAAK,eAAe,UAAU,KAAK,IAAI,KAAK,eAAe,UAAU,GAAG;AACxF,YAAI,SAAS,KAAK,cAAc,IAAI,KAAK;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AACH;AACU,IAAC,qBAAqB,CAAC,aAAa,cAAc,YAAY,cAAc,QAAQ,OAAO,SAAS,mBAAmB,mBAAmB,SAAS,UAAU,cAAc,SAAS,iBAAiB,YAAY,eAAe,cAAc,iBAAiB,iBAAiB,mBAAmB,kBAAkB,qBAAqB,qBAAqB,mBAAmB,eAAe,eAAe,gBAAgB,SAAS;AAa5a,0BAA0B,UAAU;AACzC,SAAO,SAAS,QAAQ,KAAK,CAAC,QAAQ,QAAQ,KAAK,CAAE,qBAAoB,QAAQ,SAAS,QAAQ;AACpG;AAMO,0BAA0B,UAAU;AACzC,SAAO,SAAS,QAAQ,KAAK,CAAE,qBAAoB;AAErD;AAgCO,yBAAyB,WAAW,gBAAgB,MAAM;AAC/D,MAAI,oBAAoB,SAAS;AACjC,MAAI,qBAAqB,SAAS;AAClC,MAAI,mBAAmB,SAAS;AAChC,cAAY,aAAa;AACzB,mBAAkB,mBAAkB,CAAE,GAAE,MAAK;AAC7C,MAAI,mBAAmB;AAEvB,OAAK,gBAAgB,SAAU,YAAY,OAAO;AAChD,QAAI,CAAC,SAAS,UAAU,GAAG;AACzB,qBAAe,SAAS;AACxB;AAAA,IACD;AAAA,EAaL,CAAG;AACD,MAAI,SAAS,cAAc,WAAW,kBAAkB,IAAI;AAE5D,MAAI,qBAAqB,oBAAoB;AAC3C,gBAAY,QAAQ,WAAW,kBAAkB,cAAc;AAAA,EAChE;AAED,MAAI,mBAAmB;AACrB,kBAAc,QAAQ,cAAc;AAAA,EACrC;AAED,MAAI,qBAAqB,oBAAoB;AAC3C,mBAAe,QAAQ,gBAAgB,kBAAkB;AAAA,EAC1D,WAAU,kBAAkB;AAC3B,4BAAwB,QAAQ,cAAc;AAAA,EAC/C;AAED,gBAAc,MAAM;AAGpB,SAAO;AACT;AAEA,uBAAuB,WAAW,kBAAkB,MAAM;AACxD,MAAI,SAAS,CAAA;AAEb,MAAI,SAAS,cAAc;AACzB,WAAO;AAAA,EACR;AAID,WAAS,QAAQ,GAAG,QAAQ,UAAU,QAAQ,SAAS;AACrD,QAAI,WAAW,UAAU;AAEzB,QAAI,YAAY,SAAS,MAAM,MAAM;AACnC,uBAAiB,IAAI,SAAS,IAAI,KAAK;AAAA,IACxC;AAOD,WAAO,KAAK;AAAA,MACV,UAAU,SAAS,kBAAkB,sBAAsB,QAAQ,IAAI,OAAO;AAAA,MAC9E,WAAW;AAAA,MACX,SAAS;AAAA,MACT,UAAU;AAAA,IAChB,CAAK;AAAA,EACF;AAED,SAAO;AACT;AAEA,qBAAqB,QAAQ,WAAW,kBAAkB,gBAAgB;AAExE,OAAK,gBAAgB,SAAU,YAAY,OAAO;AAChD,QAAI,CAAC,cAAc,WAAW,MAAM,MAAM;AACxC;AAAA,IACD;AAED,QAAI,WAAW,kBAAkB,WAAW,EAAE;AAC9C,QAAI,cAAc,iBAAiB,IAAI,QAAQ;AAE/C,QAAI,eAAe,MAAM;AACvB,UAAI,aAAa,OAAO;AACxB,aAAO,CAAC,WAAW,WAAW,8BAA8B,WAAW,IAAI;AAC3E,iBAAW,YAAY;AAGvB,iBAAW,WAAW,UAAU;AAChC,qBAAe,SAAS;AAAA,IACzB;AAAA,EACL,CAAG;AACH;AAEA,uBAAuB,QAAQ,gBAAgB;AAE7C,OAAK,gBAAgB,SAAU,YAAY,OAAO;AAChD,QAAI,CAAC,cAAc,WAAW,QAAQ,MAAM;AAC1C;AAAA,IACD;AAED,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAI,WAAW,OAAO,GAAG;AAEzB,UAAI,CAAC,OAAO,GAAG,aAEZ,YAAa,UAAS,MAAM,QAAQ,WAAW,MAAM,SAAS,CAAC,sBAAsB,UAAU,KAAK,CAAC,sBAAsB,QAAQ,KAAK,iBAAiB,QAAQ,UAAU,UAAU,GAAG;AACzL,eAAO,GAAG,YAAY;AACtB,uBAAe,SAAS;AACxB;AAAA,MACD;AAAA,IACF;AAAA,EACL,CAAG;AACH;AAEA,wBAAwB,QAAQ,gBAAgB,UAAU;AACxD,OAAK,gBAAgB,SAAU,YAAY;AACzC,QAAI,CAAC,YAAY;AACf;AAAA,IACD;AAGD,QAAI;AACJ,QAAI,UAAU;AAEd,WACC,cAAa,OAAO,aAMrB,YAAW,aAAa,sBAAsB,WAAW,QAAQ,KACjE,WAAW,YAAY,WAAW,MAAM,QAAQ,CAAC,iBAAiB,MAAM,YAAY,WAAW,QAAQ,IAAI;AACzG;AAAA,IACD;AAED,QAAI,YAAY;AACd,iBAAW,YAAY;AACvB,iBAAW,WAAW;AAAA,IAC5B,OAAW;AACL,aAAO,KAAK;AAAA,QACV,WAAW;AAAA,QACX;AAAA,QACA,UAAU;AAAA,QACV,SAAS;AAAA,MACjB,CAAO;AAAA,IACF;AAED;AAAA,EACJ,CAAG;AACH;AAEA,iCAAiC,QAAQ,gBAAgB;AACvD,OAAK,gBAAgB,SAAU,YAAY;AAGzC,WAAO,KAAK;AAAA,MACV,WAAW;AAAA,MACX,UAAU;AAAA,MACV,UAAU;AAAA,MACV,SAAS;AAAA,IACf,CAAK;AAAA,EACL,CAAG;AACH;AAOA,uBAAuB,WAAW;AAUhC,MAAI,QAAQ;AACZ,OAAK,WAAW,SAAU,MAAM;AAC9B,QAAI,WAAW,KAAK;AACpB,gBAAY,MAAM,IAAI,SAAS,IAAI,IAAI;AAAA,EAC3C,CAAG;AACD,OAAK,WAAW,SAAU,MAAM;AAC9B,QAAI,MAAM,KAAK;AAEf,WAAO,CAAC,OAAO,IAAI,MAAM,QAAQ,CAAC,MAAM,IAAI,IAAI,EAAE,KAAK,MAAM,IAAI,IAAI,EAAE,MAAM,MAAM,oBAAqB,QAAO,IAAI,GAAG;AACtH,WAAO,IAAI,MAAM,QAAQ,MAAM,IAAI,IAAI,IAAI,IAAI;AAC/C,KAAC,KAAK,WAAY,MAAK,UAAU,CAAE;AAAA,EACvC,CAAG;AAED,OAAK,WAAW,SAAU,MAAM,OAAO;AACrC,QAAI,WAAW,KAAK;AACpB,QAAI,MAAM,KAAK;AACf,QAAI,UAAU,KAAK;AAEnB,QAAI,CAAC,SAAS,GAAG,GAAG;AAClB;AAAA,IACD;AAMD,YAAQ,OAAO,IAAI,QAAQ,OAAO,kBAAkB,IAAI,IAAI,IAAI,WAAW,SAAS,OAElF,8BAA8B;AAEhC,QAAI,UAAU;AACZ,cAAQ,KAAK,kBAAkB,SAAS,EAAE;AAAA,IAChD,WAAe,IAAI,MAAM,MAAM;AACzB,cAAQ,KAAK,kBAAkB,IAAI,EAAE;AAAA,IAC3C,OAAW;AAML,UAAI,QAAQ;AAEZ,SAAG;AACD,gBAAQ,KAAK,OAAO,QAAQ,OAAO,OAAO;AAAA,MAC3C,SAAQ,MAAM,IAAI,QAAQ,EAAE;AAAA,IAC9B;AAED,UAAM,IAAI,QAAQ,IAAI,IAAI;AAAA,EAC9B,CAAG;AACH;AAEA,0BAA0B,MAAM,MAAM,MAAM;AAC1C,MAAI,OAAO,oBAAoB,KAAK,OAAO,IAAI;AAC/C,MAAI,OAAO,oBAAoB,KAAK,OAAO,IAAI;AAE/C,SAAO,QAAQ,QAAQ,QAAQ,QAAQ,SAAS;AAClD;AAMA,2BAA2B,KAAK;AAO9B,SAAO,oBAAoB,KAAK,EAAE;AACpC;AAEO,6BAA6B,UAAU,cAAc;AAC1D,MAAI,YAAY,MAAM;AACpB,WAAO;AAAA,EACR;AAED,SAAO,SAAS,QAAQ,IAAI,WAAW,SAAS,QAAQ,KAAK,aAAa,QAAQ,IAAI,WAAW,KAAK;AACxG;AAYO,yBAAyB,gBAAgB;AAC9C,MAAI,OAAO,eAAe;AAE1B,SAAO,CAAC,CAAE,SAAQ,KAAK,QAAQ,2BAA2B;AAC5D;AAOO,+BAA+B,YAAY;AAChD,SAAO,cAAc,WAAW,MAAM,QAAQ,kBAAkB,WAAW,EAAE,EAAE,QAAQ,4BAA4B,MAAM;AAC3H;AACO,iCAAiC,UAAU;AAChD,SAAO,+BAA+B;AACxC;AACO,mCAAmC,eAAe,UAAU,oBAAoB;AAErF,OAAK,eAAe,SAAU,MAAM;AAClC,QAAI,YAAY,KAAK;AAErB,QAAI,SAAS,SAAS,GAAG;AACvB,WAAK,QAAQ,WAAW;AACxB,WAAK,QAAQ,UAAU,iBAAiB,UAAU,WAAW,KAAK,UAAU,kBAAkB;AAAA,IAC/F;AAAA,EACL,CAAG;AACH;AAEA,0BAA0B,UAAU,eAAe,gBAAgB,oBAAoB;AACrF,MAAI,UAAU,cAAc,OAAO,cAAc,OAAO,iBAAiB,eAAe,UACtF,mBAAmB,iBAAiB,UAAU,aAAa;AAE7D,SAAO;AACT;AAWO,yBAAyB,QAAQ,QAAQ;AAC9C,MAAI,OAAO,CAAA;AACX,MAAI,OAAO,CAAA;AACX,UAAQ,UAAU,IAAI,IAAI;AAC1B,UAAQ,UAAU,CAAA,GAAI,MAAM,IAAI;AAChC,SAAO,CAAC,WAAW,IAAI,GAAG,WAAW,IAAI,CAAC;AAE1C,mBAAiB,aAAa,MAAK,UAAU;AAC3C,aAAS,IAAI,GAAG,MAAM,YAAY,QAAQ,IAAI,KAAK,KAAK;AACtD,UAAI,WAAW,oBAAoB,YAAY,GAAG,UAAU,IAAI;AAEhE,UAAI,YAAY,MAAM;AACpB;AAAA,MACD;AAED,UAAI,cAAc,iBAAiB,YAAY,GAAG,SAAS;AAC3D,UAAI,mBAAmB,YAAY,SAAS;AAE5C,eAAS,IAAI,GAAG,OAAO,YAAY,QAAQ,IAAI,MAAM,KAAK;AACxD,YAAI,YAAY,YAAY;AAE5B,YAAI,oBAAoB,iBAAiB,YAAY;AACnD,2BAAiB,aAAa;AAAA,QACxC,OAAe;AACL,UAAC,MAAI,aAAc,MAAI,YAAY,KAAK,aAAa;AAAA,QACtD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAED,sBAAoB,MAAK,QAAQ;AAC/B,QAAI,SAAS,CAAA;AAEb,aAAS,KAAK,MAAK;AACjB,UAAI,KAAI,eAAe,CAAC,KAAK,KAAI,MAAM,MAAM;AAC3C,YAAI,QAAQ;AACV,iBAAO,KAAK,CAAC,CAAC;AAAA,QACxB,OAAe;AACL,cAAI,cAAc,WAAW,KAAI,IAAI,IAAI;AACzC,sBAAY,UAAU,OAAO,KAAK;AAAA,YAChC,UAAU;AAAA,YACV,WAAW;AAAA,UACvB,CAAW;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAED,WAAO;AAAA,EACR;AACH;AAOO,wBAAwB,MAAM,SAAS;AAC5C,MAAI,QAAQ,mBAAmB,MAAM;AACnC,WAAO,QAAQ;AAAA,EACnB,WAAa,QAAQ,aAAa,MAAM;AACpC,WAAO,QAAQ,QAAQ,SAAS,IAAI,IAAI,QAAQ,WAAW,SAAU,OAAO;AAC1E,aAAO,KAAK,gBAAgB,KAAK;AAAA,IAClC,CAAA,IAAI,KAAK,gBAAgB,QAAQ,SAAS;AAAA,EAC/C,WAAa,QAAQ,QAAQ,MAAM;AAC/B,WAAO,QAAQ,QAAQ,IAAI,IAAI,IAAI,QAAQ,MAAM,SAAU,OAAO;AAChE,aAAO,KAAK,YAAY,KAAK;AAAA,IAC9B,CAAA,IAAI,KAAK,YAAY,QAAQ,IAAI;AAAA,EACnC;AACH;AAsBO,qBAAqB;AAC1B,MAAI,MAAM,gBAAgB;AAC1B,SAAO,SAAU,SAAS;AACxB,WAAO,QAAQ,QAAS,SAAQ,OAAO,CAAA;AAAA,EAC3C;AACA;AACA,IAAI,mBAAmB,gBAAe;AAK/B,qBAAqB,SAAS,aAAa,KAAK;AACrD,MAAI,KAAK,eAAe,aAAa,GAAG,GACpC,oBAAoB,GAAG,mBACvB,iBAAiB,GAAG,gBACpB,SAAS,GAAG;AAEhB,MAAI,SAAS;AACb,MAAI,kBAAkB,MAAM,IAAI,kBAAkB;AAElD,MAAI,CAAC,qBAAqB,iBAAiB;AACzC,mBAAe,IAAI,iBAAiB,CAAA,CAAE;AAAA,EACvC;AAED,iBAAe,KAAK,SAAU,aAAa,UAAU;AACnD,QAAI,cAAc,yBAAyB,SAAS,UAAU,aAAa;AAAA,MACzE,YAAY,oBAAoB;AAAA,MAChC,WAAW,OAAO,IAAI,aAAa,OAAO,IAAI,YAAY;AAAA,MAC1D,YAAY,OAAO,IAAI,cAAc,OAAO,IAAI,aAAa;AAAA,IACnE,CAAK;AACD,WAAO,WAAW,YAAY,YAAY;AAC1C,WAAO,WAAW,WAAW,YAAY,OAAO;AAAA,EACpD,CAAG;AACD,SAAO;AACT;AACO,wBAAwB,aAAa,KAAK;AAC/C,MAAI;AAEJ,MAAI,SAAS,WAAW,GAAG;AACzB,QAAI,MAAM,CAAA;AACV,QAAI,cAAc,WAAW;AAC7B,aAAS;AAAA,EACb,OAAS;AACL,aAAS;AAAA,EACV;AAED,MAAI,iBAAiB;AACrB,MAAI,SAAS,CAAA;AACb,MAAI,oBAAoB;AACxB,OAAK,QAAQ,SAAU,OAAO,KAAK;AAEjC,QAAI,QAAQ,eAAe,QAAQ,mBAAmB;AACpD,aAAO,OAAO;AACd;AAAA,IACD;AAED,QAAI,YAAY,IAAI,MAAM,wBAAwB,KAAK,CAAA;AACvD,QAAI,WAAW,UAAU;AACzB,QAAI,YAAa,WAAU,MAAM,IAAI;AAErC,QAAI,CAAC,YAAY,CAAC,aAAa,OAAO,IAAI,oBAAoB,QAAQ,IAAI,kBAAkB,QAAQ,IAAI,GAAG;AACzG;AAAA,IACD;AAED,wBAAoB,qBAAqB,CAAC,CAAC;AAC3C,QAAI,cAAc,eAAe,IAAI,QAAQ,KAAK,eAAe,IAAI,UAAU,CAAA,CAAE;AACjF,gBAAY,aAAa;AAAA,EAC7B,CAAG;AACD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AACA;AACU,IAAC,mBAAmB;AAAA,EAC5B,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,YAAY;AACd;AACU,IAAC,qBAAqB;AAAA,EAC9B,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,YAAY;AACd;AACO,kCAAkC,SAAS,UAAU,YAAY,KAAK;AAC3E,QAAM,OAAO;AACb,MAAI,cAAc,WAAW;AAC7B,MAAI,WAAW,WAAW;AAC1B,MAAI,aAAa,WAAW;AAC5B,MAAI,SAAS;AAAA,IACX,QAAQ;AAAA,IACR,WAAW,eAAe,QAAQ,YAAY,QAAQ,cAAc;AAAA,EACxE;AAEE,MAAI,CAAC,OAAO,WAAW;AAErB,QAAI,YAAY;AAChB,WAAO,SAAS,IAAI,cAAe,aAAY,QAAQ,aAAa,QAAQ,KAAK,CAAC,SAAS,IAAI,CAAA;AAC/F,WAAO;AAAA,EACR;AAED,MAAI,gBAAgB,UAAU,gBAAgB,OAAO;AACnD,WAAO,IAAI,YAAY,2DAA2D;AAClF,WAAO,SAAS;AAChB,WAAO;AAAA,EACR;AAID,MAAI,gBAAgB,OAAO;AACzB,WAAO,IAAI,WAAW,+CAA+C;AACrE,kBAAc,WAAW,aAAa;AAAA,EACvC;AAED,SAAO,SAAS,QAAQ,gBAAgB;AAAA,IACtC;AAAA,IACA,OAAO;AAAA,IACP,IAAI;AAAA,IACJ,MAAM;AAAA,EACV,CAAG;AACD,SAAO;AACT;AACO,sBAAsB,KAAK,KAAK,OAAO;AAC5C,MAAI,eAAe,IAAI,aAAa,KAAK,KAAK,IAAI,IAAI,OAAO;AAC/D;AACO,sBAAsB,KAAK,KAAK;AACrC,SAAO,IAAI,eAAe,IAAI,aAAa,GAAG,IAAI,IAAI;AACxD;AACO,8BAA8B,kBAAkB;AACrD,MAAI,qBAAqB,QAAQ;AAE/B,WAAO,IAAI,eAAe,SAAS;AAAA,EACvC,OAAS;AACL,WAAO,oBAAoB;AAAA,EAC5B;AACH;AAiCO,8BAA8B,MAAM,WAAW,aAAa,aAAa,SAAS;AACvF,MAAI,kBAAkB,aAAa,QAAQ,cAAc;AAEzD,MAAI,eAAe,MAAM;AACvB,WAAO;AAAA,EACR;AAED,MAAI,SAAS,WAAW,GAAG;AACzB,QAAI,QAAQ,kBAAkB,eAAe,GAAG,aAAa,OAAO;AACpE,WAAO,MAAM,OAAO,kBAAkB,KAAK,IAAI,aAAa,eAAe,CAAC,GAAG,aAAa,WAAW,CAAC,IAAI,SAAS;AAAA,EACzH,WAAa,SAAS,WAAW,GAAG;AAChC,WAAO,UAAU,IAAI,cAAc;AAAA,EACvC,OAAS;AACL,QAAI,eAAe,CAAA;AACnB,QAAI,UAAU;AACd,QAAI,WAAW;AACf,QAAI,WAAW,KAAK,IAAI,UAAU,QAAQ,SAAS,GAAG,SAAS,MAAM;AAErE,aAAS,IAAI,GAAG,IAAI,UAAU,EAAE,GAAG;AACjC,UAAI,OAAO,KAAK,iBAAiB,CAAC;AAElC,UAAI,QAAQ,KAAK,SAAS,WAAW;AAEnC,qBAAa,KAAM,WAAU,KAAK,UAAU,UAAU,UAAU;AAAA,MACxE,OAAa;AACL,YAAI,UAAU,WAAW,QAAQ,KAAK,QAAQ,KAAK;AACnD,YAAI,WAAW,SAAS;AACxB,YAAI,QAAQ,kBAAkB,SAAS,UAAU,OAAO;AACxD,qBAAa,KAAK,MAAM,OAAO,kBAAkB,KAAK,IAAI,aAAa,OAAO,GAAG,aAAa,QAAQ,CAAC,IAAI,SAAS;AAAA,MACrH;AAAA,IACF;AAED,WAAO;AAAA,EACR;AACH;;"}
+{"version":3,"file":"model.js","sources":["../../../../../node_modules/echarts/lib/util/model.js"],"sourcesContent":["\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\n\n\n/**\n * AUTO-GENERATED FILE. DO NOT MODIFY.\n */\n\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\nimport { each, isObject, isArray, createHashMap, map, assert, isString, indexOf, isStringSafe, isNumber } from 'zrender/lib/core/util.js';\nimport env from 'zrender/lib/core/env.js';\nimport { isNumeric, getRandomIdBase, getPrecision, round } from './number.js';\nimport { warn } from './log.js';\n\nfunction interpolateNumber(p0, p1, percent) {\n  return (p1 - p0) * percent + p0;\n}\n/**\n * Make the name displayable. But we should\n * make sure it is not duplicated with user\n * specified name, so use '\\0';\n */\n\n\nvar DUMMY_COMPONENT_NAME_PREFIX = 'series\\0';\nvar INTERNAL_COMPONENT_ID_PREFIX = '\\0_ec_\\0';\n/**\n * If value is not array, then translate it to array.\n * @param  {*} value\n * @return {Array} [value] or value\n */\n\nexport function normalizeToArray(value) {\n  return value instanceof Array ? value : value == null ? [] : [value];\n}\n/**\n * Sync default option between normal and emphasis like `position` and `show`\n * In case some one will write code like\n *     label: {\n *          show: false,\n *          position: 'outside',\n *          fontSize: 18\n *     },\n *     emphasis: {\n *          label: { show: true }\n *     }\n */\n\nexport function defaultEmphasis(opt, key, subOpts) {\n  // Caution: performance sensitive.\n  if (opt) {\n    opt[key] = opt[key] || {};\n    opt.emphasis = opt.emphasis || {};\n    opt.emphasis[key] = opt.emphasis[key] || {}; // Default emphasis option from normal\n\n    for (var i = 0, len = subOpts.length; i < len; i++) {\n      var subOptName = subOpts[i];\n\n      if (!opt.emphasis[key].hasOwnProperty(subOptName) && opt[key].hasOwnProperty(subOptName)) {\n        opt.emphasis[key][subOptName] = opt[key][subOptName];\n      }\n    }\n  }\n}\nexport var TEXT_STYLE_OPTIONS = ['fontStyle', 'fontWeight', 'fontSize', 'fontFamily', 'rich', 'tag', 'color', 'textBorderColor', 'textBorderWidth', 'width', 'height', 'lineHeight', 'align', 'verticalAlign', 'baseline', 'shadowColor', 'shadowBlur', 'shadowOffsetX', 'shadowOffsetY', 'textShadowColor', 'textShadowBlur', 'textShadowOffsetX', 'textShadowOffsetY', 'backgroundColor', 'borderColor', 'borderWidth', 'borderRadius', 'padding']; // modelUtil.LABEL_OPTIONS = modelUtil.TEXT_STYLE_OPTIONS.concat([\n//     'position', 'offset', 'rotate', 'origin', 'show', 'distance', 'formatter',\n//     'fontStyle', 'fontWeight', 'fontSize', 'fontFamily',\n//     // FIXME: deprecated, check and remove it.\n//     'textStyle'\n// ]);\n\n/**\n * The method do not ensure performance.\n * data could be [12, 2323, {value: 223}, [1221, 23], {value: [2, 23]}]\n * This helper method retieves value from data.\n */\n\nexport function getDataItemValue(dataItem) {\n  return isObject(dataItem) && !isArray(dataItem) && !(dataItem instanceof Date) ? dataItem.value : dataItem;\n}\n/**\n * data could be [12, 2323, {value: 223}, [1221, 23], {value: [2, 23]}]\n * This helper method determine if dataItem has extra option besides value\n */\n\nexport function isDataItemOption(dataItem) {\n  return isObject(dataItem) && !(dataItem instanceof Array); // // markLine data can be array\n  // && !(dataItem[0] && isObject(dataItem[0]) && !(dataItem[0] instanceof Array));\n}\n;\n/**\n * Mapping to existings for merge.\n *\n * Mode \"normalMege\":\n *     The mapping result (merge result) will keep the order of the existing\n *     component, rather than the order of new option. Because we should ensure\n *     some specified index reference (like xAxisIndex) keep work.\n *     And in most cases, \"merge option\" is used to update partial option but not\n *     be expected to change the order.\n *\n * Mode \"replaceMege\":\n *     (1) Only the id mapped components will be merged.\n *     (2) Other existing components (except internal compoonets) will be removed.\n *     (3) Other new options will be used to create new component.\n *     (4) The index of the existing compoents will not be modified.\n *     That means their might be \"hole\" after the removal.\n *     The new components are created first at those available index.\n *\n * Mode \"replaceAll\":\n *     This mode try to support that reproduce an echarts instance from another\n *     echarts instance (via `getOption`) in some simple cases.\n *     In this senario, the `result` index are exactly the consistent with the `newCmptOptions`,\n *     which ensures the compoennt index referring (like `xAxisIndex: ?`) corrent. That is,\n *     the \"hole\" in `newCmptOptions` will also be kept.\n *     On the contrary, other modes try best to eliminate holes.\n *     PENDING: This is an experimental mode yet.\n *\n * @return See the comment of <MappingResult>.\n */\n\nexport function mappingToExists(existings, newCmptOptions, mode) {\n  var isNormalMergeMode = mode === 'normalMerge';\n  var isReplaceMergeMode = mode === 'replaceMerge';\n  var isReplaceAllMode = mode === 'replaceAll';\n  existings = existings || [];\n  newCmptOptions = (newCmptOptions || []).slice();\n  var existingIdIdxMap = createHashMap(); // Validate id and name on user input option.\n\n  each(newCmptOptions, function (cmptOption, index) {\n    if (!isObject(cmptOption)) {\n      newCmptOptions[index] = null;\n      return;\n    }\n\n    if (process.env.NODE_ENV !== 'production') {\n      // There is some legacy case that name is set as `false`.\n      // But should work normally rather than throw error.\n      if (cmptOption.id != null && !isValidIdOrName(cmptOption.id)) {\n        warnInvalidateIdOrName(cmptOption.id);\n      }\n\n      if (cmptOption.name != null && !isValidIdOrName(cmptOption.name)) {\n        warnInvalidateIdOrName(cmptOption.name);\n      }\n    }\n  });\n  var result = prepareResult(existings, existingIdIdxMap, mode);\n\n  if (isNormalMergeMode || isReplaceMergeMode) {\n    mappingById(result, existings, existingIdIdxMap, newCmptOptions);\n  }\n\n  if (isNormalMergeMode) {\n    mappingByName(result, newCmptOptions);\n  }\n\n  if (isNormalMergeMode || isReplaceMergeMode) {\n    mappingByIndex(result, newCmptOptions, isReplaceMergeMode);\n  } else if (isReplaceAllMode) {\n    mappingInReplaceAllMode(result, newCmptOptions);\n  }\n\n  makeIdAndName(result); // The array `result` MUST NOT contain elided items, otherwise the\n  // forEach will ommit those items and result in incorrect result.\n\n  return result;\n}\n\nfunction prepareResult(existings, existingIdIdxMap, mode) {\n  var result = [];\n\n  if (mode === 'replaceAll') {\n    return result;\n  } // Do not use native `map` to in case that the array `existings`\n  // contains elided items, which will be ommited.\n\n\n  for (var index = 0; index < existings.length; index++) {\n    var existing = existings[index]; // Because of replaceMerge, `existing` may be null/undefined.\n\n    if (existing && existing.id != null) {\n      existingIdIdxMap.set(existing.id, index);\n    } // For non-internal-componnets:\n    //     Mode \"normalMerge\": all existings kept.\n    //     Mode \"replaceMerge\": all existing removed unless mapped by id.\n    // For internal-components:\n    //     go with \"replaceMerge\" approach in both mode.\n\n\n    result.push({\n      existing: mode === 'replaceMerge' || isComponentIdInternal(existing) ? null : existing,\n      newOption: null,\n      keyInfo: null,\n      brandNew: null\n    });\n  }\n\n  return result;\n}\n\nfunction mappingById(result, existings, existingIdIdxMap, newCmptOptions) {\n  // Mapping by id if specified.\n  each(newCmptOptions, function (cmptOption, index) {\n    if (!cmptOption || cmptOption.id == null) {\n      return;\n    }\n\n    var optionId = makeComparableKey(cmptOption.id);\n    var existingIdx = existingIdIdxMap.get(optionId);\n\n    if (existingIdx != null) {\n      var resultItem = result[existingIdx];\n      assert(!resultItem.newOption, 'Duplicated option on id \"' + optionId + '\".');\n      resultItem.newOption = cmptOption; // In both mode, if id matched, new option will be merged to\n      // the existings rather than creating new component model.\n\n      resultItem.existing = existings[existingIdx];\n      newCmptOptions[index] = null;\n    }\n  });\n}\n\nfunction mappingByName(result, newCmptOptions) {\n  // Mapping by name if specified.\n  each(newCmptOptions, function (cmptOption, index) {\n    if (!cmptOption || cmptOption.name == null) {\n      return;\n    }\n\n    for (var i = 0; i < result.length; i++) {\n      var existing = result[i].existing;\n\n      if (!result[i].newOption // Consider name: two map to one.\n      // Can not match when both ids existing but different.\n      && existing && (existing.id == null || cmptOption.id == null) && !isComponentIdInternal(cmptOption) && !isComponentIdInternal(existing) && keyExistAndEqual('name', existing, cmptOption)) {\n        result[i].newOption = cmptOption;\n        newCmptOptions[index] = null;\n        return;\n      }\n    }\n  });\n}\n\nfunction mappingByIndex(result, newCmptOptions, brandNew) {\n  each(newCmptOptions, function (cmptOption) {\n    if (!cmptOption) {\n      return;\n    } // Find the first place that not mapped by id and not internal component (consider the \"hole\").\n\n\n    var resultItem;\n    var nextIdx = 0;\n\n    while ( // Be `!resultItem` only when `nextIdx >= result.length`.\n    (resultItem = result[nextIdx]) && ( // (1) Existing models that already have id should be able to mapped to. Because\n    // after mapping performed, model will always be assigned with an id if user not given.\n    // After that all models have id.\n    // (2) If new option has id, it can only set to a hole or append to the last. It should\n    // not be merged to the existings with different id. Because id should not be overwritten.\n    // (3) Name can be overwritten, because axis use name as 'show label text'.\n    resultItem.newOption || isComponentIdInternal(resultItem.existing) || // In mode \"replaceMerge\", here no not-mapped-non-internal-existing.\n    resultItem.existing && cmptOption.id != null && !keyExistAndEqual('id', cmptOption, resultItem.existing))) {\n      nextIdx++;\n    }\n\n    if (resultItem) {\n      resultItem.newOption = cmptOption;\n      resultItem.brandNew = brandNew;\n    } else {\n      result.push({\n        newOption: cmptOption,\n        brandNew: brandNew,\n        existing: null,\n        keyInfo: null\n      });\n    }\n\n    nextIdx++;\n  });\n}\n\nfunction mappingInReplaceAllMode(result, newCmptOptions) {\n  each(newCmptOptions, function (cmptOption) {\n    // The feature \"reproduce\" requires \"hole\" will also reproduced\n    // in case that compoennt index referring are broken.\n    result.push({\n      newOption: cmptOption,\n      brandNew: true,\n      existing: null,\n      keyInfo: null\n    });\n  });\n}\n/**\n * Make id and name for mapping result (result of mappingToExists)\n * into `keyInfo` field.\n */\n\n\nfunction makeIdAndName(mapResult) {\n  // We use this id to hash component models and view instances\n  // in echarts. id can be specified by user, or auto generated.\n  // The id generation rule ensures new view instance are able\n  // to mapped to old instance when setOption are called in\n  // no-merge mode. So we generate model id by name and plus\n  // type in view id.\n  // name can be duplicated among components, which is convenient\n  // to specify multi components (like series) by one name.\n  // Ensure that each id is distinct.\n  var idMap = createHashMap();\n  each(mapResult, function (item) {\n    var existing = item.existing;\n    existing && idMap.set(existing.id, item);\n  });\n  each(mapResult, function (item) {\n    var opt = item.newOption; // Force ensure id not duplicated.\n\n    assert(!opt || opt.id == null || !idMap.get(opt.id) || idMap.get(opt.id) === item, 'id duplicates: ' + (opt && opt.id));\n    opt && opt.id != null && idMap.set(opt.id, item);\n    !item.keyInfo && (item.keyInfo = {});\n  }); // Make name and id.\n\n  each(mapResult, function (item, index) {\n    var existing = item.existing;\n    var opt = item.newOption;\n    var keyInfo = item.keyInfo;\n\n    if (!isObject(opt)) {\n      return;\n    } // name can be overwitten. Consider case: axis.name = '20km'.\n    // But id generated by name will not be changed, which affect\n    // only in that case: setOption with 'not merge mode' and view\n    // instance will be recreated, which can be accepted.\n\n\n    keyInfo.name = opt.name != null ? makeComparableKey(opt.name) : existing ? existing.name // Avoid diffferent series has the same name,\n    // because name may be used like in color pallet.\n    : DUMMY_COMPONENT_NAME_PREFIX + index;\n\n    if (existing) {\n      keyInfo.id = makeComparableKey(existing.id);\n    } else if (opt.id != null) {\n      keyInfo.id = makeComparableKey(opt.id);\n    } else {\n      // Consider this situatoin:\n      //  optionA: [{name: 'a'}, {name: 'a'}, {..}]\n      //  optionB [{..}, {name: 'a'}, {name: 'a'}]\n      // Series with the same name between optionA and optionB\n      // should be mapped.\n      var idNum = 0;\n\n      do {\n        keyInfo.id = '\\0' + keyInfo.name + '\\0' + idNum++;\n      } while (idMap.get(keyInfo.id));\n    }\n\n    idMap.set(keyInfo.id, item);\n  });\n}\n\nfunction keyExistAndEqual(attr, obj1, obj2) {\n  var key1 = convertOptionIdName(obj1[attr], null);\n  var key2 = convertOptionIdName(obj2[attr], null); // See `MappingExistingItem`. `id` and `name` trade string equals to number.\n\n  return key1 != null && key2 != null && key1 === key2;\n}\n/**\n * @return return null if not exist.\n */\n\n\nfunction makeComparableKey(val) {\n  if (process.env.NODE_ENV !== 'production') {\n    if (val == null) {\n      throw new Error();\n    }\n  }\n\n  return convertOptionIdName(val, '');\n}\n\nexport function convertOptionIdName(idOrName, defaultValue) {\n  if (idOrName == null) {\n    return defaultValue;\n  }\n\n  return isString(idOrName) ? idOrName : isNumber(idOrName) || isStringSafe(idOrName) ? idOrName + '' : defaultValue;\n}\n\nfunction warnInvalidateIdOrName(idOrName) {\n  if (process.env.NODE_ENV !== 'production') {\n    warn('`' + idOrName + '` is invalid id or name. Must be a string or number.');\n  }\n}\n\nfunction isValidIdOrName(idOrName) {\n  return isStringSafe(idOrName) || isNumeric(idOrName);\n}\n\nexport function isNameSpecified(componentModel) {\n  var name = componentModel.name; // Is specified when `indexOf` get -1 or > 0.\n\n  return !!(name && name.indexOf(DUMMY_COMPONENT_NAME_PREFIX));\n}\n/**\n * @public\n * @param {Object} cmptOption\n * @return {boolean}\n */\n\nexport function isComponentIdInternal(cmptOption) {\n  return cmptOption && cmptOption.id != null && makeComparableKey(cmptOption.id).indexOf(INTERNAL_COMPONENT_ID_PREFIX) === 0;\n}\nexport function makeInternalComponentId(idSuffix) {\n  return INTERNAL_COMPONENT_ID_PREFIX + idSuffix;\n}\nexport function setComponentTypeToKeyInfo(mappingResult, mainType, componentModelCtor) {\n  // Set mainType and complete subType.\n  each(mappingResult, function (item) {\n    var newOption = item.newOption;\n\n    if (isObject(newOption)) {\n      item.keyInfo.mainType = mainType;\n      item.keyInfo.subType = determineSubType(mainType, newOption, item.existing, componentModelCtor);\n    }\n  });\n}\n\nfunction determineSubType(mainType, newCmptOption, existComponent, componentModelCtor) {\n  var subType = newCmptOption.type ? newCmptOption.type : existComponent ? existComponent.subType // Use determineSubType only when there is no existComponent.\n  : componentModelCtor.determineSubType(mainType, newCmptOption); // tooltip, markline, markpoint may always has no subType\n\n  return subType;\n}\n/**\n * A helper for removing duplicate items between batchA and batchB,\n * and in themselves, and categorize by series.\n *\n * @param batchA Like: [{seriesId: 2, dataIndex: [32, 4, 5]}, ...]\n * @param batchB Like: [{seriesId: 2, dataIndex: [32, 4, 5]}, ...]\n * @return result: [resultBatchA, resultBatchB]\n */\n\n\nexport function compressBatches(batchA, batchB) {\n  var mapA = {};\n  var mapB = {};\n  makeMap(batchA || [], mapA);\n  makeMap(batchB || [], mapB, mapA);\n  return [mapToArray(mapA), mapToArray(mapB)];\n\n  function makeMap(sourceBatch, map, otherMap) {\n    for (var i = 0, len = sourceBatch.length; i < len; i++) {\n      var seriesId = convertOptionIdName(sourceBatch[i].seriesId, null);\n\n      if (seriesId == null) {\n        return;\n      }\n\n      var dataIndices = normalizeToArray(sourceBatch[i].dataIndex);\n      var otherDataIndices = otherMap && otherMap[seriesId];\n\n      for (var j = 0, lenj = dataIndices.length; j < lenj; j++) {\n        var dataIndex = dataIndices[j];\n\n        if (otherDataIndices && otherDataIndices[dataIndex]) {\n          otherDataIndices[dataIndex] = null;\n        } else {\n          (map[seriesId] || (map[seriesId] = {}))[dataIndex] = 1;\n        }\n      }\n    }\n  }\n\n  function mapToArray(map, isData) {\n    var result = [];\n\n    for (var i in map) {\n      if (map.hasOwnProperty(i) && map[i] != null) {\n        if (isData) {\n          result.push(+i);\n        } else {\n          var dataIndices = mapToArray(map[i], true);\n          dataIndices.length && result.push({\n            seriesId: i,\n            dataIndex: dataIndices\n          });\n        }\n      }\n    }\n\n    return result;\n  }\n}\n/**\n * @param payload Contains dataIndex (means rawIndex) / dataIndexInside / name\n *                         each of which can be Array or primary type.\n * @return dataIndex If not found, return undefined/null.\n */\n\nexport function queryDataIndex(data, payload) {\n  if (payload.dataIndexInside != null) {\n    return payload.dataIndexInside;\n  } else if (payload.dataIndex != null) {\n    return isArray(payload.dataIndex) ? map(payload.dataIndex, function (value) {\n      return data.indexOfRawIndex(value);\n    }) : data.indexOfRawIndex(payload.dataIndex);\n  } else if (payload.name != null) {\n    return isArray(payload.name) ? map(payload.name, function (value) {\n      return data.indexOfName(value);\n    }) : data.indexOfName(payload.name);\n  }\n}\n/**\n * Enable property storage to any host object.\n * Notice: Serialization is not supported.\n *\n * For example:\n * let inner = zrUitl.makeInner();\n *\n * function some1(hostObj) {\n *      inner(hostObj).someProperty = 1212;\n *      ...\n * }\n * function some2() {\n *      let fields = inner(this);\n *      fields.someProperty1 = 1212;\n *      fields.someProperty2 = 'xx';\n *      ...\n * }\n *\n * @return {Function}\n */\n\nexport function makeInner() {\n  var key = '__ec_inner_' + innerUniqueIndex++;\n  return function (hostObj) {\n    return hostObj[key] || (hostObj[key] = {});\n  };\n}\nvar innerUniqueIndex = getRandomIdBase();\n/**\n * The same behavior as `component.getReferringComponents`.\n */\n\nexport function parseFinder(ecModel, finderInput, opt) {\n  var _a = preParseFinder(finderInput, opt),\n      mainTypeSpecified = _a.mainTypeSpecified,\n      queryOptionMap = _a.queryOptionMap,\n      others = _a.others;\n\n  var result = others;\n  var defaultMainType = opt ? opt.defaultMainType : null;\n\n  if (!mainTypeSpecified && defaultMainType) {\n    queryOptionMap.set(defaultMainType, {});\n  }\n\n  queryOptionMap.each(function (queryOption, mainType) {\n    var queryResult = queryReferringComponents(ecModel, mainType, queryOption, {\n      useDefault: defaultMainType === mainType,\n      enableAll: opt && opt.enableAll != null ? opt.enableAll : true,\n      enableNone: opt && opt.enableNone != null ? opt.enableNone : true\n    });\n    result[mainType + 'Models'] = queryResult.models;\n    result[mainType + 'Model'] = queryResult.models[0];\n  });\n  return result;\n}\nexport function preParseFinder(finderInput, opt) {\n  var finder;\n\n  if (isString(finderInput)) {\n    var obj = {};\n    obj[finderInput + 'Index'] = 0;\n    finder = obj;\n  } else {\n    finder = finderInput;\n  }\n\n  var queryOptionMap = createHashMap();\n  var others = {};\n  var mainTypeSpecified = false;\n  each(finder, function (value, key) {\n    // Exclude 'dataIndex' and other illgal keys.\n    if (key === 'dataIndex' || key === 'dataIndexInside') {\n      others[key] = value;\n      return;\n    }\n\n    var parsedKey = key.match(/^(\\w+)(Index|Id|Name)$/) || [];\n    var mainType = parsedKey[1];\n    var queryType = (parsedKey[2] || '').toLowerCase();\n\n    if (!mainType || !queryType || opt && opt.includeMainTypes && indexOf(opt.includeMainTypes, mainType) < 0) {\n      return;\n    }\n\n    mainTypeSpecified = mainTypeSpecified || !!mainType;\n    var queryOption = queryOptionMap.get(mainType) || queryOptionMap.set(mainType, {});\n    queryOption[queryType] = value;\n  });\n  return {\n    mainTypeSpecified: mainTypeSpecified,\n    queryOptionMap: queryOptionMap,\n    others: others\n  };\n}\nexport var SINGLE_REFERRING = {\n  useDefault: true,\n  enableAll: false,\n  enableNone: false\n};\nexport var MULTIPLE_REFERRING = {\n  useDefault: false,\n  enableAll: true,\n  enableNone: true\n};\nexport function queryReferringComponents(ecModel, mainType, userOption, opt) {\n  opt = opt || SINGLE_REFERRING;\n  var indexOption = userOption.index;\n  var idOption = userOption.id;\n  var nameOption = userOption.name;\n  var result = {\n    models: null,\n    specified: indexOption != null || idOption != null || nameOption != null\n  };\n\n  if (!result.specified) {\n    // Use the first as default if `useDefault`.\n    var firstCmpt = void 0;\n    result.models = opt.useDefault && (firstCmpt = ecModel.getComponent(mainType)) ? [firstCmpt] : [];\n    return result;\n  }\n\n  if (indexOption === 'none' || indexOption === false) {\n    assert(opt.enableNone, '`\"none\"` or `false` is not a valid value on index option.');\n    result.models = [];\n    return result;\n  } // `queryComponents` will return all components if\n  // both all of index/id/name are null/undefined.\n\n\n  if (indexOption === 'all') {\n    assert(opt.enableAll, '`\"all\"` is not a valid value on index option.');\n    indexOption = idOption = nameOption = null;\n  }\n\n  result.models = ecModel.queryComponents({\n    mainType: mainType,\n    index: indexOption,\n    id: idOption,\n    name: nameOption\n  });\n  return result;\n}\nexport function setAttribute(dom, key, value) {\n  dom.setAttribute ? dom.setAttribute(key, value) : dom[key] = value;\n}\nexport function getAttribute(dom, key) {\n  return dom.getAttribute ? dom.getAttribute(key) : dom[key];\n}\nexport function getTooltipRenderMode(renderModeOption) {\n  if (renderModeOption === 'auto') {\n    // Using html when `document` exists, use richText otherwise\n    return env.domSupported ? 'html' : 'richText';\n  } else {\n    return renderModeOption || 'html';\n  }\n}\n/**\n * Group a list by key.\n */\n\nexport function groupData(array, getKey // return key\n) {\n  var buckets = createHashMap();\n  var keys = [];\n  each(array, function (item) {\n    var key = getKey(item);\n    (buckets.get(key) || (keys.push(key), buckets.set(key, []))).push(item);\n  });\n  return {\n    keys: keys,\n    buckets: buckets\n  };\n}\n/**\n * Interpolate raw values of a series with percent\n *\n * @param data         data\n * @param labelModel   label model of the text element\n * @param sourceValue  start value. May be null/undefined when init.\n * @param targetValue  end value\n * @param percent      0~1 percentage; 0 uses start value while 1 uses end value\n * @return             interpolated values\n *                     If `sourceValue` and `targetValue` are `number`, return `number`.\n *                     If `sourceValue` and `targetValue` are `string`, return `string`.\n *                     If `sourceValue` and `targetValue` are `(string | number)[]`, return `(string | number)[]`.\n *                     Other cases do not supported.\n */\n\nexport function interpolateRawValues(data, precision, sourceValue, targetValue, percent) {\n  var isAutoPrecision = precision == null || precision === 'auto';\n\n  if (targetValue == null) {\n    return targetValue;\n  }\n\n  if (isNumber(targetValue)) {\n    var value = interpolateNumber(sourceValue || 0, targetValue, percent);\n    return round(value, isAutoPrecision ? Math.max(getPrecision(sourceValue || 0), getPrecision(targetValue)) : precision);\n  } else if (isString(targetValue)) {\n    return percent < 1 ? sourceValue : targetValue;\n  } else {\n    var interpolated = [];\n    var leftArr = sourceValue;\n    var rightArr = targetValue;\n    var length_1 = Math.max(leftArr ? leftArr.length : 0, rightArr.length);\n\n    for (var i = 0; i < length_1; ++i) {\n      var info = data.getDimensionInfo(i); // Don't interpolate ordinal dims\n\n      if (info && info.type === 'ordinal') {\n        // In init, there is no `sourceValue`, but should better not to get undefined result.\n        interpolated[i] = (percent < 1 && leftArr ? leftArr : rightArr)[i];\n      } else {\n        var leftVal = leftArr && leftArr[i] ? leftArr[i] : 0;\n        var rightVal = rightArr[i];\n        var value = interpolateNumber(leftVal, rightVal, percent);\n        interpolated[i] = round(value, isAutoPrecision ? Math.max(getPrecision(leftVal), getPrecision(rightVal)) : precision);\n      }\n    }\n\n    return interpolated;\n  }\n}"],"names":["map"],"mappings":";;;;AAgDA,SAAS,kBAAkB,IAAI,IAAI,SAAS;AAC1C,UAAQ,KAAK,MAAM,UAAU;AAC/B;AAQA,IAAI,8BAA8B;AAClC,IAAI,+BAA+B;AAO5B,SAAS,iBAAiB,OAAO;AACtC,SAAO,iBAAiB,QAAQ,QAAQ,SAAS,OAAO,CAAE,IAAG,CAAC,KAAK;AACrE;AAcO,SAAS,gBAAgB,KAAK,KAAK,SAAS;AAEjD,MAAI,KAAK;AACP,QAAI,OAAO,IAAI,QAAQ,CAAA;AACvB,QAAI,WAAW,IAAI,YAAY,CAAA;AAC/B,QAAI,SAAS,OAAO,IAAI,SAAS,QAAQ;AAEzC,aAAS,IAAI,GAAG,MAAM,QAAQ,QAAQ,IAAI,KAAK,KAAK;AAClD,UAAI,aAAa,QAAQ;AAEzB,UAAI,CAAC,IAAI,SAAS,KAAK,eAAe,UAAU,KAAK,IAAI,KAAK,eAAe,UAAU,GAAG;AACxF,YAAI,SAAS,KAAK,cAAc,IAAI,KAAK;AAAA,MAC1C;AAAA,IACF;AAAA,EACF;AACH;AACU,IAAC,qBAAqB,CAAC,aAAa,cAAc,YAAY,cAAc,QAAQ,OAAO,SAAS,mBAAmB,mBAAmB,SAAS,UAAU,cAAc,SAAS,iBAAiB,YAAY,eAAe,cAAc,iBAAiB,iBAAiB,mBAAmB,kBAAkB,qBAAqB,qBAAqB,mBAAmB,eAAe,eAAe,gBAAgB,SAAS;AAa5a,SAAS,iBAAiB,UAAU;AACzC,SAAO,SAAS,QAAQ,KAAK,CAAC,QAAQ,QAAQ,KAAK,EAAE,oBAAoB,QAAQ,SAAS,QAAQ;AACpG;AAMO,SAAS,iBAAiB,UAAU;AACzC,SAAO,SAAS,QAAQ,KAAK,EAAE,oBAAoB;AAErD;AAgCO,SAAS,gBAAgB,WAAW,gBAAgB,MAAM;AAC/D,MAAI,oBAAoB,SAAS;AACjC,MAAI,qBAAqB,SAAS;AAClC,MAAI,mBAAmB,SAAS;AAChC,cAAY,aAAa;AACzB,oBAAkB,kBAAkB,CAAE,GAAE,MAAK;AAC7C,MAAI,mBAAmB;AAEvB,OAAK,gBAAgB,SAAU,YAAY,OAAO;AAChD,QAAI,CAAC,SAAS,UAAU,GAAG;AACzB,qBAAe,SAAS;AACxB;AAAA,IACD;AAED,QAAI,QAAQ,IAAI,aAAa,cAAc;AAGzC,UAAI,WAAW,MAAM,QAAQ,CAAC,gBAAgB,WAAW,EAAE,GAAG;AAC5D,+BAAuB,WAAW,EAAE;AAAA,MACrC;AAED,UAAI,WAAW,QAAQ,QAAQ,CAAC,gBAAgB,WAAW,IAAI,GAAG;AAChE,+BAAuB,WAAW,IAAI;AAAA,MACvC;AAAA,IACF;AAAA,EACL,CAAG;AACD,MAAI,SAAS,cAAc,WAAW,kBAAkB,IAAI;AAE5D,MAAI,qBAAqB,oBAAoB;AAC3C,gBAAY,QAAQ,WAAW,kBAAkB,cAAc;AAAA,EAChE;AAED,MAAI,mBAAmB;AACrB,kBAAc,QAAQ,cAAc;AAAA,EACrC;AAED,MAAI,qBAAqB,oBAAoB;AAC3C,mBAAe,QAAQ,gBAAgB,kBAAkB;AAAA,EAC1D,WAAU,kBAAkB;AAC3B,4BAAwB,QAAQ,cAAc;AAAA,EAC/C;AAED,gBAAc,MAAM;AAGpB,SAAO;AACT;AAEA,SAAS,cAAc,WAAW,kBAAkB,MAAM;AACxD,MAAI,SAAS,CAAA;AAEb,MAAI,SAAS,cAAc;AACzB,WAAO;AAAA,EACR;AAID,WAAS,QAAQ,GAAG,QAAQ,UAAU,QAAQ,SAAS;AACrD,QAAI,WAAW,UAAU;AAEzB,QAAI,YAAY,SAAS,MAAM,MAAM;AACnC,uBAAiB,IAAI,SAAS,IAAI,KAAK;AAAA,IACxC;AAOD,WAAO,KAAK;AAAA,MACV,UAAU,SAAS,kBAAkB,sBAAsB,QAAQ,IAAI,OAAO;AAAA,MAC9E,WAAW;AAAA,MACX,SAAS;AAAA,MACT,UAAU;AAAA,IAChB,CAAK;AAAA,EACF;AAED,SAAO;AACT;AAEA,SAAS,YAAY,QAAQ,WAAW,kBAAkB,gBAAgB;AAExE,OAAK,gBAAgB,SAAU,YAAY,OAAO;AAChD,QAAI,CAAC,cAAc,WAAW,MAAM,MAAM;AACxC;AAAA,IACD;AAED,QAAI,WAAW,kBAAkB,WAAW,EAAE;AAC9C,QAAI,cAAc,iBAAiB,IAAI,QAAQ;AAE/C,QAAI,eAAe,MAAM;AACvB,UAAI,aAAa,OAAO;AACxB,aAAO,CAAC,WAAW,WAAW,8BAA8B,WAAW,IAAI;AAC3E,iBAAW,YAAY;AAGvB,iBAAW,WAAW,UAAU;AAChC,qBAAe,SAAS;AAAA,IACzB;AAAA,EACL,CAAG;AACH;AAEA,SAAS,cAAc,QAAQ,gBAAgB;AAE7C,OAAK,gBAAgB,SAAU,YAAY,OAAO;AAChD,QAAI,CAAC,cAAc,WAAW,QAAQ,MAAM;AAC1C;AAAA,IACD;AAED,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAI,WAAW,OAAO,GAAG;AAEzB,UAAI,CAAC,OAAO,GAAG,aAEZ,aAAa,SAAS,MAAM,QAAQ,WAAW,MAAM,SAAS,CAAC,sBAAsB,UAAU,KAAK,CAAC,sBAAsB,QAAQ,KAAK,iBAAiB,QAAQ,UAAU,UAAU,GAAG;AACzL,eAAO,GAAG,YAAY;AACtB,uBAAe,SAAS;AACxB;AAAA,MACD;AAAA,IACF;AAAA,EACL,CAAG;AACH;AAEA,SAAS,eAAe,QAAQ,gBAAgB,UAAU;AACxD,OAAK,gBAAgB,SAAU,YAAY;AACzC,QAAI,CAAC,YAAY;AACf;AAAA,IACD;AAGD,QAAI;AACJ,QAAI,UAAU;AAEd,YACC,aAAa,OAAO,cAMrB,WAAW,aAAa,sBAAsB,WAAW,QAAQ,KACjE,WAAW,YAAY,WAAW,MAAM,QAAQ,CAAC,iBAAiB,MAAM,YAAY,WAAW,QAAQ,IAAI;AACzG;AAAA,IACD;AAED,QAAI,YAAY;AACd,iBAAW,YAAY;AACvB,iBAAW,WAAW;AAAA,IAC5B,OAAW;AACL,aAAO,KAAK;AAAA,QACV,WAAW;AAAA,QACX;AAAA,QACA,UAAU;AAAA,QACV,SAAS;AAAA,MACjB,CAAO;AAAA,IACF;AAED;AAAA,EACJ,CAAG;AACH;AAEA,SAAS,wBAAwB,QAAQ,gBAAgB;AACvD,OAAK,gBAAgB,SAAU,YAAY;AAGzC,WAAO,KAAK;AAAA,MACV,WAAW;AAAA,MACX,UAAU;AAAA,MACV,UAAU;AAAA,MACV,SAAS;AAAA,IACf,CAAK;AAAA,EACL,CAAG;AACH;AAOA,SAAS,cAAc,WAAW;AAUhC,MAAI,QAAQ;AACZ,OAAK,WAAW,SAAU,MAAM;AAC9B,QAAI,WAAW,KAAK;AACpB,gBAAY,MAAM,IAAI,SAAS,IAAI,IAAI;AAAA,EAC3C,CAAG;AACD,OAAK,WAAW,SAAU,MAAM;AAC9B,QAAI,MAAM,KAAK;AAEf,WAAO,CAAC,OAAO,IAAI,MAAM,QAAQ,CAAC,MAAM,IAAI,IAAI,EAAE,KAAK,MAAM,IAAI,IAAI,EAAE,MAAM,MAAM,qBAAqB,OAAO,IAAI,GAAG;AACtH,WAAO,IAAI,MAAM,QAAQ,MAAM,IAAI,IAAI,IAAI,IAAI;AAC/C,KAAC,KAAK,YAAY,KAAK,UAAU,CAAE;AAAA,EACvC,CAAG;AAED,OAAK,WAAW,SAAU,MAAM,OAAO;AACrC,QAAI,WAAW,KAAK;AACpB,QAAI,MAAM,KAAK;AACf,QAAI,UAAU,KAAK;AAEnB,QAAI,CAAC,SAAS,GAAG,GAAG;AAClB;AAAA,IACD;AAMD,YAAQ,OAAO,IAAI,QAAQ,OAAO,kBAAkB,IAAI,IAAI,IAAI,WAAW,SAAS,OAElF,8BAA8B;AAEhC,QAAI,UAAU;AACZ,cAAQ,KAAK,kBAAkB,SAAS,EAAE;AAAA,IAChD,WAAe,IAAI,MAAM,MAAM;AACzB,cAAQ,KAAK,kBAAkB,IAAI,EAAE;AAAA,IAC3C,OAAW;AAML,UAAI,QAAQ;AAEZ,SAAG;AACD,gBAAQ,KAAK,OAAO,QAAQ,OAAO,OAAO;AAAA,MAC3C,SAAQ,MAAM,IAAI,QAAQ,EAAE;AAAA,IAC9B;AAED,UAAM,IAAI,QAAQ,IAAI,IAAI;AAAA,EAC9B,CAAG;AACH;AAEA,SAAS,iBAAiB,MAAM,MAAM,MAAM;AAC1C,MAAI,OAAO,oBAAoB,KAAK,OAAO,IAAI;AAC/C,MAAI,OAAO,oBAAoB,KAAK,OAAO,IAAI;AAE/C,SAAO,QAAQ,QAAQ,QAAQ,QAAQ,SAAS;AAClD;AAMA,SAAS,kBAAkB,KAAK;AAC9B,MAAI,QAAQ,IAAI,aAAa,cAAc;AACzC,QAAI,OAAO,MAAM;AACf,YAAM,IAAI,MAAK;AAAA,IAChB;AAAA,EACF;AAED,SAAO,oBAAoB,KAAK,EAAE;AACpC;AAEO,SAAS,oBAAoB,UAAU,cAAc;AAC1D,MAAI,YAAY,MAAM;AACpB,WAAO;AAAA,EACR;AAED,SAAO,SAAS,QAAQ,IAAI,WAAW,SAAS,QAAQ,KAAK,aAAa,QAAQ,IAAI,WAAW,KAAK;AACxG;AAEA,SAAS,uBAAuB,UAAU;AACxC,MAAI,QAAQ,IAAI,aAAa,cAAc;AACzC,SAAK,MAAM,WAAW,sDAAsD;AAAA,EAC7E;AACH;AAEA,SAAS,gBAAgB,UAAU;AACjC,SAAO,aAAa,QAAQ,KAAK,UAAU,QAAQ;AACrD;AAEO,SAAS,gBAAgB,gBAAgB;AAC9C,MAAI,OAAO,eAAe;AAE1B,SAAO,CAAC,EAAE,QAAQ,KAAK,QAAQ,2BAA2B;AAC5D;AAOO,SAAS,sBAAsB,YAAY;AAChD,SAAO,cAAc,WAAW,MAAM,QAAQ,kBAAkB,WAAW,EAAE,EAAE,QAAQ,4BAA4B,MAAM;AAC3H;AACO,SAAS,wBAAwB,UAAU;AAChD,SAAO,+BAA+B;AACxC;AACO,SAAS,0BAA0B,eAAe,UAAU,oBAAoB;AAErF,OAAK,eAAe,SAAU,MAAM;AAClC,QAAI,YAAY,KAAK;AAErB,QAAI,SAAS,SAAS,GAAG;AACvB,WAAK,QAAQ,WAAW;AACxB,WAAK,QAAQ,UAAU,iBAAiB,UAAU,WAAW,KAAK,UAAU,kBAAkB;AAAA,IAC/F;AAAA,EACL,CAAG;AACH;AAEA,SAAS,iBAAiB,UAAU,eAAe,gBAAgB,oBAAoB;AACrF,MAAI,UAAU,cAAc,OAAO,cAAc,OAAO,iBAAiB,eAAe,UACtF,mBAAmB,iBAAiB,UAAU,aAAa;AAE7D,SAAO;AACT;AAWO,SAAS,gBAAgB,QAAQ,QAAQ;AAC9C,MAAI,OAAO,CAAA;AACX,MAAI,OAAO,CAAA;AACX,UAAQ,UAAU,IAAI,IAAI;AAC1B,UAAQ,UAAU,CAAA,GAAI,MAAM,IAAI;AAChC,SAAO,CAAC,WAAW,IAAI,GAAG,WAAW,IAAI,CAAC;AAE1C,WAAS,QAAQ,aAAaA,MAAK,UAAU;AAC3C,aAAS,IAAI,GAAG,MAAM,YAAY,QAAQ,IAAI,KAAK,KAAK;AACtD,UAAI,WAAW,oBAAoB,YAAY,GAAG,UAAU,IAAI;AAEhE,UAAI,YAAY,MAAM;AACpB;AAAA,MACD;AAED,UAAI,cAAc,iBAAiB,YAAY,GAAG,SAAS;AAC3D,UAAI,mBAAmB,YAAY,SAAS;AAE5C,eAAS,IAAI,GAAG,OAAO,YAAY,QAAQ,IAAI,MAAM,KAAK;AACxD,YAAI,YAAY,YAAY;AAE5B,YAAI,oBAAoB,iBAAiB,YAAY;AACnD,2BAAiB,aAAa;AAAA,QACxC,OAAe;AACL,WAACA,KAAI,cAAcA,KAAI,YAAY,KAAK,aAAa;AAAA,QACtD;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAED,WAAS,WAAWA,MAAK,QAAQ;AAC/B,QAAI,SAAS,CAAA;AAEb,aAAS,KAAKA,MAAK;AACjB,UAAIA,KAAI,eAAe,CAAC,KAAKA,KAAI,MAAM,MAAM;AAC3C,YAAI,QAAQ;AACV,iBAAO,KAAK,CAAC,CAAC;AAAA,QACxB,OAAe;AACL,cAAI,cAAc,WAAWA,KAAI,IAAI,IAAI;AACzC,sBAAY,UAAU,OAAO,KAAK;AAAA,YAChC,UAAU;AAAA,YACV,WAAW;AAAA,UACvB,CAAW;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAED,WAAO;AAAA,EACR;AACH;AAOO,SAAS,eAAe,MAAM,SAAS;AAC5C,MAAI,QAAQ,mBAAmB,MAAM;AACnC,WAAO,QAAQ;AAAA,EACnB,WAAa,QAAQ,aAAa,MAAM;AACpC,WAAO,QAAQ,QAAQ,SAAS,IAAI,IAAI,QAAQ,WAAW,SAAU,OAAO;AAC1E,aAAO,KAAK,gBAAgB,KAAK;AAAA,IAClC,CAAA,IAAI,KAAK,gBAAgB,QAAQ,SAAS;AAAA,EAC/C,WAAa,QAAQ,QAAQ,MAAM;AAC/B,WAAO,QAAQ,QAAQ,IAAI,IAAI,IAAI,QAAQ,MAAM,SAAU,OAAO;AAChE,aAAO,KAAK,YAAY,KAAK;AAAA,IAC9B,CAAA,IAAI,KAAK,YAAY,QAAQ,IAAI;AAAA,EACnC;AACH;AAsBO,SAAS,YAAY;AAC1B,MAAI,MAAM,gBAAgB;AAC1B,SAAO,SAAU,SAAS;AACxB,WAAO,QAAQ,SAAS,QAAQ,OAAO,CAAA;AAAA,EAC3C;AACA;AACA,IAAI,mBAAmB,gBAAe;AAK/B,SAAS,YAAY,SAAS,aAAa,KAAK;AACrD,MAAI,KAAK,eAAe,aAAa,GAAG,GACpC,oBAAoB,GAAG,mBACvB,iBAAiB,GAAG,gBACpB,SAAS,GAAG;AAEhB,MAAI,SAAS;AACb,MAAI,kBAAkB,MAAM,IAAI,kBAAkB;AAElD,MAAI,CAAC,qBAAqB,iBAAiB;AACzC,mBAAe,IAAI,iBAAiB,CAAA,CAAE;AAAA,EACvC;AAED,iBAAe,KAAK,SAAU,aAAa,UAAU;AACnD,QAAI,cAAc,yBAAyB,SAAS,UAAU,aAAa;AAAA,MACzE,YAAY,oBAAoB;AAAA,MAChC,WAAW,OAAO,IAAI,aAAa,OAAO,IAAI,YAAY;AAAA,MAC1D,YAAY,OAAO,IAAI,cAAc,OAAO,IAAI,aAAa;AAAA,IACnE,CAAK;AACD,WAAO,WAAW,YAAY,YAAY;AAC1C,WAAO,WAAW,WAAW,YAAY,OAAO;AAAA,EACpD,CAAG;AACD,SAAO;AACT;AACO,SAAS,eAAe,aAAa,KAAK;AAC/C,MAAI;AAEJ,MAAI,SAAS,WAAW,GAAG;AACzB,QAAI,MAAM,CAAA;AACV,QAAI,cAAc,WAAW;AAC7B,aAAS;AAAA,EACb,OAAS;AACL,aAAS;AAAA,EACV;AAED,MAAI,iBAAiB;AACrB,MAAI,SAAS,CAAA;AACb,MAAI,oBAAoB;AACxB,OAAK,QAAQ,SAAU,OAAO,KAAK;AAEjC,QAAI,QAAQ,eAAe,QAAQ,mBAAmB;AACpD,aAAO,OAAO;AACd;AAAA,IACD;AAED,QAAI,YAAY,IAAI,MAAM,wBAAwB,KAAK,CAAA;AACvD,QAAI,WAAW,UAAU;AACzB,QAAI,aAAa,UAAU,MAAM,IAAI;AAErC,QAAI,CAAC,YAAY,CAAC,aAAa,OAAO,IAAI,oBAAoB,QAAQ,IAAI,kBAAkB,QAAQ,IAAI,GAAG;AACzG;AAAA,IACD;AAED,wBAAoB,qBAAqB,CAAC,CAAC;AAC3C,QAAI,cAAc,eAAe,IAAI,QAAQ,KAAK,eAAe,IAAI,UAAU,CAAA,CAAE;AACjF,gBAAY,aAAa;AAAA,EAC7B,CAAG;AACD,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AACA;AACU,IAAC,mBAAmB;AAAA,EAC5B,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,YAAY;AACd;AACU,IAAC,qBAAqB;AAAA,EAC9B,YAAY;AAAA,EACZ,WAAW;AAAA,EACX,YAAY;AACd;AACO,SAAS,yBAAyB,SAAS,UAAU,YAAY,KAAK;AAC3E,QAAM,OAAO;AACb,MAAI,cAAc,WAAW;AAC7B,MAAI,WAAW,WAAW;AAC1B,MAAI,aAAa,WAAW;AAC5B,MAAI,SAAS;AAAA,IACX,QAAQ;AAAA,IACR,WAAW,eAAe,QAAQ,YAAY,QAAQ,cAAc;AAAA,EACxE;AAEE,MAAI,CAAC,OAAO,WAAW;AAErB,QAAI,YAAY;AAChB,WAAO,SAAS,IAAI,eAAe,YAAY,QAAQ,aAAa,QAAQ,KAAK,CAAC,SAAS,IAAI,CAAA;AAC/F,WAAO;AAAA,EACR;AAED,MAAI,gBAAgB,UAAU,gBAAgB,OAAO;AACnD,WAAO,IAAI,YAAY,2DAA2D;AAClF,WAAO,SAAS;AAChB,WAAO;AAAA,EACR;AAID,MAAI,gBAAgB,OAAO;AACzB,WAAO,IAAI,WAAW,+CAA+C;AACrE,kBAAc,WAAW,aAAa;AAAA,EACvC;AAED,SAAO,SAAS,QAAQ,gBAAgB;AAAA,IACtC;AAAA,IACA,OAAO;AAAA,IACP,IAAI;AAAA,IACJ,MAAM;AAAA,EACV,CAAG;AACD,SAAO;AACT;AACO,SAAS,aAAa,KAAK,KAAK,OAAO;AAC5C,MAAI,eAAe,IAAI,aAAa,KAAK,KAAK,IAAI,IAAI,OAAO;AAC/D;AACO,SAAS,aAAa,KAAK,KAAK;AACrC,SAAO,IAAI,eAAe,IAAI,aAAa,GAAG,IAAI,IAAI;AACxD;AACO,SAAS,qBAAqB,kBAAkB;AACrD,MAAI,qBAAqB,QAAQ;AAE/B,WAAO,IAAI,eAAe,SAAS;AAAA,EACvC,OAAS;AACL,WAAO,oBAAoB;AAAA,EAC5B;AACH;AAiCO,SAAS,qBAAqB,MAAM,WAAW,aAAa,aAAa,SAAS;AACvF,MAAI,kBAAkB,aAAa,QAAQ,cAAc;AAEzD,MAAI,eAAe,MAAM;AACvB,WAAO;AAAA,EACR;AAED,MAAI,SAAS,WAAW,GAAG;AACzB,QAAI,QAAQ,kBAAkB,eAAe,GAAG,aAAa,OAAO;AACpE,WAAO,MAAM,OAAO,kBAAkB,KAAK,IAAI,aAAa,eAAe,CAAC,GAAG,aAAa,WAAW,CAAC,IAAI,SAAS;AAAA,EACzH,WAAa,SAAS,WAAW,GAAG;AAChC,WAAO,UAAU,IAAI,cAAc;AAAA,EACvC,OAAS;AACL,QAAI,eAAe,CAAA;AACnB,QAAI,UAAU;AACd,QAAI,WAAW;AACf,QAAI,WAAW,KAAK,IAAI,UAAU,QAAQ,SAAS,GAAG,SAAS,MAAM;AAErE,aAAS,IAAI,GAAG,IAAI,UAAU,EAAE,GAAG;AACjC,UAAI,OAAO,KAAK,iBAAiB,CAAC;AAElC,UAAI,QAAQ,KAAK,SAAS,WAAW;AAEnC,qBAAa,MAAM,UAAU,KAAK,UAAU,UAAU,UAAU;AAAA,MACxE,OAAa;AACL,YAAI,UAAU,WAAW,QAAQ,KAAK,QAAQ,KAAK;AACnD,YAAI,WAAW,SAAS;AACxB,YAAI,QAAQ,kBAAkB,SAAS,UAAU,OAAO;AACxD,qBAAa,KAAK,MAAM,OAAO,kBAAkB,KAAK,IAAI,aAAa,OAAO,GAAG,aAAa,QAAQ,CAAC,IAAI,SAAS;AAAA,MACrH;AAAA,IACF;AAED,WAAO;AAAA,EACR;AACH;"}

package/es/node_modules/echarts/lib/util/number.js

@@ -280,5 +280,27 @@ function getLeastCommonMultiple(a, b) {
   }
   return a * b / getGreatestCommonDividor(a, b);
 }
-export { addSafe, asc, getGreatestCommonDividor, getLeastCommonMultiple, getPercentWithPrecision, getPixelPrecision, getPrecision, getPrecisionSafe, getRandomIdBase, isNumeric, isRadianAroundZero, linearMap, nice, numericToNumber, parseDate, parsePercent, quantity, quantityExponent, reformIntervals, remRadian, round };
+export {
+  addSafe,
+  asc,
+  getGreatestCommonDividor,
+  getLeastCommonMultiple,
+  getPercentWithPrecision,
+  getPixelPrecision,
+  getPrecision,
+  getPrecisionSafe,
+  getRandomIdBase,
+  isNumeric,
+  isRadianAroundZero,
+  linearMap,
+  nice,
+  numericToNumber,
+  parseDate,
+  parsePercent,
+  quantity,
+  quantityExponent,
+  reformIntervals,
+  remRadian,
+  round
+};
 //# sourceMappingURL=number.js.map

package/es/node_modules/echarts/lib/util/number.js.map

@@ -1 +1 @@
-{"version":3,"file":"number.js","sources":["../../../../../node_modules/echarts/lib/util/number.js"],"sourcesContent":["\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\n\n\n/**\n * AUTO-GENERATED FILE. DO NOT MODIFY.\n */\n\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\n\n/*\n* A third-party license is embeded for some of the code in this file:\n* The method \"quantile\" was copied from \"d3.js\".\n* (See more details in the comment of the method below.)\n* The use of the source code of this file is also subject to the terms\n* and consitions of the license of \"d3.js\" (BSD-3Clause, see\n* </licenses/LICENSE-d3>).\n*/\nimport * as zrUtil from 'zrender/lib/core/util.js';\nvar RADIAN_EPSILON = 1e-4; // Although chrome already enlarge this number to 100 for `toFixed`, but\n// we sill follow the spec for compatibility.\n\nvar ROUND_SUPPORTED_PRECISION_MAX = 20;\n\nfunction _trim(str) {\n  return str.replace(/^\\s+|\\s+$/g, '');\n}\n/**\n * Linear mapping a value from domain to range\n * @param  val\n * @param  domain Domain extent domain[0] can be bigger than domain[1]\n * @param  range  Range extent range[0] can be bigger than range[1]\n * @param  clamp Default to be false\n */\n\n\nexport function linearMap(val, domain, range, clamp) {\n  var d0 = domain[0];\n  var d1 = domain[1];\n  var r0 = range[0];\n  var r1 = range[1];\n  var subDomain = d1 - d0;\n  var subRange = r1 - r0;\n\n  if (subDomain === 0) {\n    return subRange === 0 ? r0 : (r0 + r1) / 2;\n  } // Avoid accuracy problem in edge, such as\n  // 146.39 - 62.83 === 83.55999999999999.\n  // See echarts/test/ut/spec/util/number.js#linearMap#accuracyError\n  // It is a little verbose for efficiency considering this method\n  // is a hotspot.\n\n\n  if (clamp) {\n    if (subDomain > 0) {\n      if (val <= d0) {\n        return r0;\n      } else if (val >= d1) {\n        return r1;\n      }\n    } else {\n      if (val >= d0) {\n        return r0;\n      } else if (val <= d1) {\n        return r1;\n      }\n    }\n  } else {\n    if (val === d0) {\n      return r0;\n    }\n\n    if (val === d1) {\n      return r1;\n    }\n  }\n\n  return (val - d0) / subDomain * subRange + r0;\n}\n/**\n * Convert a percent string to absolute number.\n * Returns NaN if percent is not a valid string or number\n */\n\nexport function parsePercent(percent, all) {\n  switch (percent) {\n    case 'center':\n    case 'middle':\n      percent = '50%';\n      break;\n\n    case 'left':\n    case 'top':\n      percent = '0%';\n      break;\n\n    case 'right':\n    case 'bottom':\n      percent = '100%';\n      break;\n  }\n\n  if (zrUtil.isString(percent)) {\n    if (_trim(percent).match(/%$/)) {\n      return parseFloat(percent) / 100 * all;\n    }\n\n    return parseFloat(percent);\n  }\n\n  return percent == null ? NaN : +percent;\n}\nexport function round(x, precision, returnStr) {\n  if (precision == null) {\n    precision = 10;\n  } // Avoid range error\n\n\n  precision = Math.min(Math.max(0, precision), ROUND_SUPPORTED_PRECISION_MAX); // PENDING: 1.005.toFixed(2) is '1.00' rather than '1.01'\n\n  x = (+x).toFixed(precision);\n  return returnStr ? x : +x;\n}\n/**\n * Inplacd asc sort arr.\n * The input arr will be modified.\n */\n\nexport function asc(arr) {\n  arr.sort(function (a, b) {\n    return a - b;\n  });\n  return arr;\n}\n/**\n * Get precision.\n */\n\nexport function getPrecision(val) {\n  val = +val;\n\n  if (isNaN(val)) {\n    return 0;\n  } // It is much faster than methods converting number to string as follows\n  //      let tmp = val.toString();\n  //      return tmp.length - 1 - tmp.indexOf('.');\n  // especially when precision is low\n  // Notice:\n  // (1) If the loop count is over about 20, it is slower than `getPrecisionSafe`.\n  //     (see https://jsbench.me/2vkpcekkvw/1)\n  // (2) If the val is less than for example 1e-15, the result may be incorrect.\n  //     (see test/ut/spec/util/number.test.ts `getPrecision_equal_random`)\n\n\n  if (val > 1e-14) {\n    var e = 1;\n\n    for (var i = 0; i < 15; i++, e *= 10) {\n      if (Math.round(val * e) / e === val) {\n        return i;\n      }\n    }\n  }\n\n  return getPrecisionSafe(val);\n}\n/**\n * Get precision with slow but safe method\n */\n\nexport function getPrecisionSafe(val) {\n  // toLowerCase for: '3.4E-12'\n  var str = val.toString().toLowerCase(); // Consider scientific notation: '3.4e-12' '3.4e+12'\n\n  var eIndex = str.indexOf('e');\n  var exp = eIndex > 0 ? +str.slice(eIndex + 1) : 0;\n  var significandPartLen = eIndex > 0 ? eIndex : str.length;\n  var dotIndex = str.indexOf('.');\n  var decimalPartLen = dotIndex < 0 ? 0 : significandPartLen - 1 - dotIndex;\n  return Math.max(0, decimalPartLen - exp);\n}\n/**\n * Minimal dicernible data precisioin according to a single pixel.\n */\n\nexport function getPixelPrecision(dataExtent, pixelExtent) {\n  var log = Math.log;\n  var LN10 = Math.LN10;\n  var dataQuantity = Math.floor(log(dataExtent[1] - dataExtent[0]) / LN10);\n  var sizeQuantity = Math.round(log(Math.abs(pixelExtent[1] - pixelExtent[0])) / LN10); // toFixed() digits argument must be between 0 and 20.\n\n  var precision = Math.min(Math.max(-dataQuantity + sizeQuantity, 0), 20);\n  return !isFinite(precision) ? 20 : precision;\n}\n/**\n * Get a data of given precision, assuring the sum of percentages\n * in valueList is 1.\n * The largest remainer method is used.\n * https://en.wikipedia.org/wiki/Largest_remainder_method\n *\n * @param valueList a list of all data\n * @param idx index of the data to be processed in valueList\n * @param precision integer number showing digits of precision\n * @return percent ranging from 0 to 100\n */\n\nexport function getPercentWithPrecision(valueList, idx, precision) {\n  if (!valueList[idx]) {\n    return 0;\n  }\n\n  var sum = zrUtil.reduce(valueList, function (acc, val) {\n    return acc + (isNaN(val) ? 0 : val);\n  }, 0);\n\n  if (sum === 0) {\n    return 0;\n  }\n\n  var digits = Math.pow(10, precision);\n  var votesPerQuota = zrUtil.map(valueList, function (val) {\n    return (isNaN(val) ? 0 : val) / sum * digits * 100;\n  });\n  var targetSeats = digits * 100;\n  var seats = zrUtil.map(votesPerQuota, function (votes) {\n    // Assign automatic seats.\n    return Math.floor(votes);\n  });\n  var currentSum = zrUtil.reduce(seats, function (acc, val) {\n    return acc + val;\n  }, 0);\n  var remainder = zrUtil.map(votesPerQuota, function (votes, idx) {\n    return votes - seats[idx];\n  }); // Has remainding votes.\n\n  while (currentSum < targetSeats) {\n    // Find next largest remainder.\n    var max = Number.NEGATIVE_INFINITY;\n    var maxId = null;\n\n    for (var i = 0, len = remainder.length; i < len; ++i) {\n      if (remainder[i] > max) {\n        max = remainder[i];\n        maxId = i;\n      }\n    } // Add a vote to max remainder.\n\n\n    ++seats[maxId];\n    remainder[maxId] = 0;\n    ++currentSum;\n  }\n\n  return seats[idx] / digits;\n}\n/**\n * Solve the floating point adding problem like 0.1 + 0.2 === 0.30000000000000004\n * See <http://0.30000000000000004.com/>\n */\n\nexport function addSafe(val0, val1) {\n  var maxPrecision = Math.max(getPrecision(val0), getPrecision(val1)); // const multiplier = Math.pow(10, maxPrecision);\n  // return (Math.round(val0 * multiplier) + Math.round(val1 * multiplier)) / multiplier;\n\n  var sum = val0 + val1; // // PENDING: support more?\n\n  return maxPrecision > ROUND_SUPPORTED_PRECISION_MAX ? sum : round(sum, maxPrecision);\n} // Number.MAX_SAFE_INTEGER, ie do not support.\n\nexport var MAX_SAFE_INTEGER = 9007199254740991;\n/**\n * To 0 - 2 * PI, considering negative radian.\n */\n\nexport function remRadian(radian) {\n  var pi2 = Math.PI * 2;\n  return (radian % pi2 + pi2) % pi2;\n}\n/**\n * @param {type} radian\n * @return {boolean}\n */\n\nexport function isRadianAroundZero(val) {\n  return val > -RADIAN_EPSILON && val < RADIAN_EPSILON;\n} // eslint-disable-next-line\n\nvar TIME_REG = /^(?:(\\d{4})(?:[-\\/](\\d{1,2})(?:[-\\/](\\d{1,2})(?:[T ](\\d{1,2})(?::(\\d{1,2})(?::(\\d{1,2})(?:[.,](\\d+))?)?)?(Z|[\\+\\-]\\d\\d:?\\d\\d)?)?)?)?)?$/; // jshint ignore:line\n\n/**\n * @param value valid type: number | string | Date, otherwise return `new Date(NaN)`\n *   These values can be accepted:\n *   + An instance of Date, represent a time in its own time zone.\n *   + Or string in a subset of ISO 8601, only including:\n *     + only year, month, date: '2012-03', '2012-03-01', '2012-03-01 05', '2012-03-01 05:06',\n *     + separated with T or space: '2012-03-01T12:22:33.123', '2012-03-01 12:22:33.123',\n *     + time zone: '2012-03-01T12:22:33Z', '2012-03-01T12:22:33+8000', '2012-03-01T12:22:33-05:00',\n *     all of which will be treated as local time if time zone is not specified\n *     (see <https://momentjs.com/>).\n *   + Or other string format, including (all of which will be treated as loacal time):\n *     '2012', '2012-3-1', '2012/3/1', '2012/03/01',\n *     '2009/6/12 2:00', '2009/6/12 2:05:08', '2009/6/12 2:05:08.123'\n *   + a timestamp, which represent a time in UTC.\n * @return date Never be null/undefined. If invalid, return `new Date(NaN)`.\n */\n\nexport function parseDate(value) {\n  if (value instanceof Date) {\n    return value;\n  } else if (zrUtil.isString(value)) {\n    // Different browsers parse date in different way, so we parse it manually.\n    // Some other issues:\n    // new Date('1970-01-01') is UTC,\n    // new Date('1970/01/01') and new Date('1970-1-01') is local.\n    // See issue #3623\n    var match = TIME_REG.exec(value);\n\n    if (!match) {\n      // return Invalid Date.\n      return new Date(NaN);\n    } // Use local time when no timezone offset specifed.\n\n\n    if (!match[8]) {\n      // match[n] can only be string or undefined.\n      // But take care of '12' + 1 => '121'.\n      return new Date(+match[1], +(match[2] || 1) - 1, +match[3] || 1, +match[4] || 0, +(match[5] || 0), +match[6] || 0, match[7] ? +match[7].substring(0, 3) : 0);\n    } // Timezoneoffset of Javascript Date has considered DST (Daylight Saving Time,\n    // https://tc39.github.io/ecma262/#sec-daylight-saving-time-adjustment).\n    // For example, system timezone is set as \"Time Zone: America/Toronto\",\n    // then these code will get different result:\n    // `new Date(1478411999999).getTimezoneOffset();  // get 240`\n    // `new Date(1478412000000).getTimezoneOffset();  // get 300`\n    // So we should not use `new Date`, but use `Date.UTC`.\n    else {\n        var hour = +match[4] || 0;\n\n        if (match[8].toUpperCase() !== 'Z') {\n          hour -= +match[8].slice(0, 3);\n        }\n\n        return new Date(Date.UTC(+match[1], +(match[2] || 1) - 1, +match[3] || 1, hour, +(match[5] || 0), +match[6] || 0, match[7] ? +match[7].substring(0, 3) : 0));\n      }\n  } else if (value == null) {\n    return new Date(NaN);\n  }\n\n  return new Date(Math.round(value));\n}\n/**\n * Quantity of a number. e.g. 0.1, 1, 10, 100\n *\n * @param val\n * @return\n */\n\nexport function quantity(val) {\n  return Math.pow(10, quantityExponent(val));\n}\n/**\n * Exponent of the quantity of a number\n * e.g., 1234 equals to 1.234*10^3, so quantityExponent(1234) is 3\n *\n * @param val non-negative value\n * @return\n */\n\nexport function quantityExponent(val) {\n  if (val === 0) {\n    return 0;\n  }\n\n  var exp = Math.floor(Math.log(val) / Math.LN10);\n  /**\n   * exp is expected to be the rounded-down result of the base-10 log of val.\n   * But due to the precision loss with Math.log(val), we need to restore it\n   * using 10^exp to make sure we can get val back from exp. #11249\n   */\n\n  if (val / Math.pow(10, exp) >= 10) {\n    exp++;\n  }\n\n  return exp;\n}\n/**\n * find a “nice” number approximately equal to x. Round the number if round = true,\n * take ceiling if round = false. The primary observation is that the “nicest”\n * numbers in decimal are 1, 2, and 5, and all power-of-ten multiples of these numbers.\n *\n * See \"Nice Numbers for Graph Labels\" of Graphic Gems.\n *\n * @param  val Non-negative value.\n * @param  round\n * @return Niced number\n */\n\nexport function nice(val, round) {\n  var exponent = quantityExponent(val);\n  var exp10 = Math.pow(10, exponent);\n  var f = val / exp10; // 1 <= f < 10\n\n  var nf;\n\n  if (round) {\n    if (f < 1.5) {\n      nf = 1;\n    } else if (f < 2.5) {\n      nf = 2;\n    } else if (f < 4) {\n      nf = 3;\n    } else if (f < 7) {\n      nf = 5;\n    } else {\n      nf = 10;\n    }\n  } else {\n    if (f < 1) {\n      nf = 1;\n    } else if (f < 2) {\n      nf = 2;\n    } else if (f < 3) {\n      nf = 3;\n    } else if (f < 5) {\n      nf = 5;\n    } else {\n      nf = 10;\n    }\n  }\n\n  val = nf * exp10; // Fix 3 * 0.1 === 0.30000000000000004 issue (see IEEE 754).\n  // 20 is the uppper bound of toFixed.\n\n  return exponent >= -20 ? +val.toFixed(exponent < 0 ? -exponent : 0) : val;\n}\n/**\n * This code was copied from \"d3.js\"\n * <https://github.com/d3/d3/blob/9cc9a875e636a1dcf36cc1e07bdf77e1ad6e2c74/src/arrays/quantile.js>.\n * See the license statement at the head of this file.\n * @param ascArr\n */\n\nexport function quantile(ascArr, p) {\n  var H = (ascArr.length - 1) * p + 1;\n  var h = Math.floor(H);\n  var v = +ascArr[h - 1];\n  var e = H - h;\n  return e ? v + e * (ascArr[h] - v) : v;\n}\n/**\n * Order intervals asc, and split them when overlap.\n * expect(numberUtil.reformIntervals([\n *     {interval: [18, 62], close: [1, 1]},\n *     {interval: [-Infinity, -70], close: [0, 0]},\n *     {interval: [-70, -26], close: [1, 1]},\n *     {interval: [-26, 18], close: [1, 1]},\n *     {interval: [62, 150], close: [1, 1]},\n *     {interval: [106, 150], close: [1, 1]},\n *     {interval: [150, Infinity], close: [0, 0]}\n * ])).toEqual([\n *     {interval: [-Infinity, -70], close: [0, 0]},\n *     {interval: [-70, -26], close: [1, 1]},\n *     {interval: [-26, 18], close: [0, 1]},\n *     {interval: [18, 62], close: [0, 1]},\n *     {interval: [62, 150], close: [0, 1]},\n *     {interval: [150, Infinity], close: [0, 0]}\n * ]);\n * @param list, where `close` mean open or close\n *        of the interval, and Infinity can be used.\n * @return The origin list, which has been reformed.\n */\n\nexport function reformIntervals(list) {\n  list.sort(function (a, b) {\n    return littleThan(a, b, 0) ? -1 : 1;\n  });\n  var curr = -Infinity;\n  var currClose = 1;\n\n  for (var i = 0; i < list.length;) {\n    var interval = list[i].interval;\n    var close_1 = list[i].close;\n\n    for (var lg = 0; lg < 2; lg++) {\n      if (interval[lg] <= curr) {\n        interval[lg] = curr;\n        close_1[lg] = !lg ? 1 - currClose : 1;\n      }\n\n      curr = interval[lg];\n      currClose = close_1[lg];\n    }\n\n    if (interval[0] === interval[1] && close_1[0] * close_1[1] !== 1) {\n      list.splice(i, 1);\n    } else {\n      i++;\n    }\n  }\n\n  return list;\n\n  function littleThan(a, b, lg) {\n    return a.interval[lg] < b.interval[lg] || a.interval[lg] === b.interval[lg] && (a.close[lg] - b.close[lg] === (!lg ? 1 : -1) || !lg && littleThan(a, b, 1));\n  }\n}\n/**\n * [Numberic is defined as]:\n *     `parseFloat(val) == val`\n * For example:\n * numeric:\n *     typeof number except NaN, '-123', '123', '2e3', '-2e3', '011', 'Infinity', Infinity,\n *     and they rounded by white-spaces or line-terminal like ' -123 \\n ' (see es spec)\n * not-numeric:\n *     null, undefined, [], {}, true, false, 'NaN', NaN, '123ab',\n *     empty string, string with only white-spaces or line-terminal (see es spec),\n *     0x12, '0x12', '-0x12', 012, '012', '-012',\n *     non-string, ...\n *\n * @test See full test cases in `test/ut/spec/util/number.js`.\n * @return Must be a typeof number. If not numeric, return NaN.\n */\n\nexport function numericToNumber(val) {\n  var valFloat = parseFloat(val);\n  return valFloat == val // eslint-disable-line eqeqeq\n  && (valFloat !== 0 || !zrUtil.isString(val) || val.indexOf('x') <= 0) // For case ' 0x0 '.\n  ? valFloat : NaN;\n}\n/**\n * Definition of \"numeric\": see `numericToNumber`.\n */\n\nexport function isNumeric(val) {\n  return !isNaN(numericToNumber(val));\n}\n/**\n * Use random base to prevent users hard code depending on\n * this auto generated marker id.\n * @return An positive integer.\n */\n\nexport function getRandomIdBase() {\n  return Math.round(Math.random() * 9);\n}\n/**\n * Get the greatest common dividor\n *\n * @param {number} a one number\n * @param {number} b the other number\n */\n\nexport function getGreatestCommonDividor(a, b) {\n  if (b === 0) {\n    return a;\n  }\n\n  return getGreatestCommonDividor(b, a % b);\n}\n/**\n * Get the least common multiple\n *\n * @param {number} a one number\n * @param {number} b the other number\n */\n\nexport function getLeastCommonMultiple(a, b) {\n  if (a == null) {\n    return b;\n  }\n\n  if (b == null) {\n    return a;\n  }\n\n  return a * b / getGreatestCommonDividor(a, b);\n}"],"names":["zrUtil.isString","zrUtil.reduce","zrUtil.map"],"mappings":";AAqDA,IAAI,iBAAiB;AAGrB,IAAI,gCAAgC;AAEpC,eAAe,KAAK;AAClB,SAAO,IAAI,QAAQ,cAAc,EAAE;AACrC;AAUO,mBAAmB,KAAK,QAAQ,OAAO,OAAO;AACnD,MAAI,KAAK,OAAO;AAChB,MAAI,KAAK,OAAO;AAChB,MAAI,KAAK,MAAM;AACf,MAAI,KAAK,MAAM;AACf,MAAI,YAAY,KAAK;AACrB,MAAI,WAAW,KAAK;AAEpB,MAAI,cAAc,GAAG;AACnB,WAAO,aAAa,IAAI,KAAM,MAAK,MAAM;AAAA,EAC1C;AAOD,MAAI,OAAO;AACT,QAAI,YAAY,GAAG;AACjB,UAAI,OAAO,IAAI;AACb,eAAO;AAAA,MACf,WAAiB,OAAO,IAAI;AACpB,eAAO;AAAA,MACR;AAAA,IACP,OAAW;AACL,UAAI,OAAO,IAAI;AACb,eAAO;AAAA,MACf,WAAiB,OAAO,IAAI;AACpB,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACL,OAAS;AACL,QAAI,QAAQ,IAAI;AACd,aAAO;AAAA,IACR;AAED,QAAI,QAAQ,IAAI;AACd,aAAO;AAAA,IACR;AAAA,EACF;AAED,SAAQ,OAAM,MAAM,YAAY,WAAW;AAC7C;AAMO,sBAAsB,SAAS,KAAK;AACzC,UAAQ;AAAA,SACD;AAAA,SACA;AACH,gBAAU;AACV;AAAA,SAEG;AAAA,SACA;AACH,gBAAU;AACV;AAAA,SAEG;AAAA,SACA;AACH,gBAAU;AACV;AAAA;AAGJ,MAAIA,SAAgB,OAAO,GAAG;AAC5B,QAAI,MAAM,OAAO,EAAE,MAAM,IAAI,GAAG;AAC9B,aAAO,WAAW,OAAO,IAAI,MAAM;AAAA,IACpC;AAED,WAAO,WAAW,OAAO;AAAA,EAC1B;AAED,SAAO,WAAW,OAAO,MAAM,CAAC;AAClC;AACO,eAAe,GAAG,WAAW,WAAW;AAC7C,MAAI,aAAa,MAAM;AACrB,gBAAY;AAAA,EACb;AAGD,cAAY,KAAK,IAAI,KAAK,IAAI,GAAG,SAAS,GAAG,6BAA6B;AAE1E,MAAK,EAAC,GAAG,QAAQ,SAAS;AAC1B,SAAO,YAAY,IAAI,CAAC;AAC1B;AAMO,aAAa,KAAK;AACvB,MAAI,KAAK,SAAU,GAAG,GAAG;AACvB,WAAO,IAAI;AAAA,EACf,CAAG;AACD,SAAO;AACT;AAKO,sBAAsB,KAAK;AAChC,QAAM,CAAC;AAEP,MAAI,MAAM,GAAG,GAAG;AACd,WAAO;AAAA,EACR;AAWD,MAAI,MAAM,OAAO;AACf,QAAI,IAAI;AAER,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,KAAK,IAAI;AACpC,UAAI,KAAK,MAAM,MAAM,CAAC,IAAI,MAAM,KAAK;AACnC,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAED,SAAO,iBAAiB,GAAG;AAC7B;AAKO,0BAA0B,KAAK;AAEpC,MAAI,MAAM,IAAI,SAAU,EAAC,YAAW;AAEpC,MAAI,SAAS,IAAI,QAAQ,GAAG;AAC5B,MAAI,MAAM,SAAS,IAAI,CAAC,IAAI,MAAM,SAAS,CAAC,IAAI;AAChD,MAAI,qBAAqB,SAAS,IAAI,SAAS,IAAI;AACnD,MAAI,WAAW,IAAI,QAAQ,GAAG;AAC9B,MAAI,iBAAiB,WAAW,IAAI,IAAI,qBAAqB,IAAI;AACjE,SAAO,KAAK,IAAI,GAAG,iBAAiB,GAAG;AACzC;AAKO,2BAA2B,YAAY,aAAa;AACzD,MAAI,MAAM,KAAK;AACf,MAAI,OAAO,KAAK;AAChB,MAAI,eAAe,KAAK,MAAM,IAAI,WAAW,KAAK,WAAW,EAAE,IAAI,IAAI;AACvE,MAAI,eAAe,KAAK,MAAM,IAAI,KAAK,IAAI,YAAY,KAAK,YAAY,EAAE,CAAC,IAAI,IAAI;AAEnF,MAAI,YAAY,KAAK,IAAI,KAAK,IAAI,CAAC,eAAe,cAAc,CAAC,GAAG,EAAE;AACtE,SAAO,CAAC,SAAS,SAAS,IAAI,KAAK;AACrC;AAaO,iCAAiC,WAAW,KAAK,WAAW;AACjE,MAAI,CAAC,UAAU,MAAM;AACnB,WAAO;AAAA,EACR;AAED,MAAI,MAAMC,OAAc,WAAW,SAAU,KAAK,KAAK;AACrD,WAAO,MAAO,OAAM,GAAG,IAAI,IAAI;AAAA,EAChC,GAAE,CAAC;AAEJ,MAAI,QAAQ,GAAG;AACb,WAAO;AAAA,EACR;AAED,MAAI,SAAS,KAAK,IAAI,IAAI,SAAS;AACnC,MAAI,gBAAgBC,IAAW,WAAW,SAAU,KAAK;AACvD,WAAQ,OAAM,GAAG,IAAI,IAAI,OAAO,MAAM,SAAS;AAAA,EACnD,CAAG;AACD,MAAI,cAAc,SAAS;AAC3B,MAAI,QAAQA,IAAW,eAAe,SAAU,OAAO;AAErD,WAAO,KAAK,MAAM,KAAK;AAAA,EAC3B,CAAG;AACD,MAAI,aAAaD,OAAc,OAAO,SAAU,KAAK,KAAK;AACxD,WAAO,MAAM;AAAA,EACd,GAAE,CAAC;AACJ,MAAI,YAAYC,IAAW,eAAe,SAAU,OAAO,MAAK;AAC9D,WAAO,QAAQ,MAAM;AAAA,EACzB,CAAG;AAED,SAAO,aAAa,aAAa;AAE/B,QAAI,MAAM,OAAO;AACjB,QAAI,QAAQ;AAEZ,aAAS,IAAI,GAAG,MAAM,UAAU,QAAQ,IAAI,KAAK,EAAE,GAAG;AACpD,UAAI,UAAU,KAAK,KAAK;AACtB,cAAM,UAAU;AAChB,gBAAQ;AAAA,MACT;AAAA,IACF;AAGD,MAAE,MAAM;AACR,cAAU,SAAS;AACnB,MAAE;AAAA,EACH;AAED,SAAO,MAAM,OAAO;AACtB;AAMO,iBAAiB,MAAM,MAAM;AAClC,MAAI,eAAe,KAAK,IAAI,aAAa,IAAI,GAAG,aAAa,IAAI,CAAC;AAGlE,MAAI,MAAM,OAAO;AAEjB,SAAO,eAAe,gCAAgC,MAAM,MAAM,KAAK,YAAY;AACrF;AAOO,mBAAmB,QAAQ;AAChC,MAAI,MAAM,KAAK,KAAK;AACpB,SAAQ,UAAS,MAAM,OAAO;AAChC;AAMO,4BAA4B,KAAK;AACtC,SAAO,MAAM,CAAC,kBAAkB,MAAM;AACxC;AAEA,IAAI,WAAW;AAmBR,mBAAmB,OAAO;AAC/B,MAAI,iBAAiB,MAAM;AACzB,WAAO;AAAA,EACX,WAAaF,SAAgB,KAAK,GAAG;AAMjC,QAAI,QAAQ,SAAS,KAAK,KAAK;AAE/B,QAAI,CAAC,OAAO;AAEV,aAAO,IAAI,KAAK,GAAG;AAAA,IACpB;AAGD,QAAI,CAAC,MAAM,IAAI;AAGb,aAAO,IAAI,KAAK,CAAC,MAAM,IAAI,CAAE,OAAM,MAAM,KAAK,GAAG,CAAC,MAAM,MAAM,GAAG,CAAC,MAAM,MAAM,GAAG,CAAE,OAAM,MAAM,IAAI,CAAC,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,MAAM,GAAG,UAAU,GAAG,CAAC,IAAI,CAAC;AAAA,IAC5J,OAOI;AACD,UAAI,OAAO,CAAC,MAAM,MAAM;AAExB,UAAI,MAAM,GAAG,YAAW,MAAO,KAAK;AAClC,gBAAQ,CAAC,MAAM,GAAG,MAAM,GAAG,CAAC;AAAA,MAC7B;AAED,aAAO,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,IAAI,CAAE,OAAM,MAAM,KAAK,GAAG,CAAC,MAAM,MAAM,GAAG,MAAM,CAAE,OAAM,MAAM,IAAI,CAAC,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,MAAM,GAAG,UAAU,GAAG,CAAC,IAAI,CAAC,CAAC;AAAA,IAC5J;AAAA,EACP,WAAa,SAAS,MAAM;AACxB,WAAO,IAAI,KAAK,GAAG;AAAA,EACpB;AAED,SAAO,IAAI,KAAK,KAAK,MAAM,KAAK,CAAC;AACnC;AAQO,kBAAkB,KAAK;AAC5B,SAAO,KAAK,IAAI,IAAI,iBAAiB,GAAG,CAAC;AAC3C;AASO,0BAA0B,KAAK;AACpC,MAAI,QAAQ,GAAG;AACb,WAAO;AAAA,EACR;AAED,MAAI,MAAM,KAAK,MAAM,KAAK,IAAI,GAAG,IAAI,KAAK,IAAI;AAO9C,MAAI,MAAM,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI;AACjC;AAAA,EACD;AAED,SAAO;AACT;AAaO,cAAc,KAAK,QAAO;AAC/B,MAAI,WAAW,iBAAiB,GAAG;AACnC,MAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ;AACjC,MAAI,IAAI,MAAM;AAEd,MAAI;AAEJ,MAAI,QAAO;AACT,QAAI,IAAI,KAAK;AACX,WAAK;AAAA,IACX,WAAe,IAAI,KAAK;AAClB,WAAK;AAAA,IACX,WAAe,IAAI,GAAG;AAChB,WAAK;AAAA,IACX,WAAe,IAAI,GAAG;AAChB,WAAK;AAAA,IACX,OAAW;AACL,WAAK;AAAA,IACN;AAAA,EACL,OAAS;AACL,QAAI,IAAI,GAAG;AACT,WAAK;AAAA,IACX,WAAe,IAAI,GAAG;AAChB,WAAK;AAAA,IACX,WAAe,IAAI,GAAG;AAChB,WAAK;AAAA,IACX,WAAe,IAAI,GAAG;AAChB,WAAK;AAAA,IACX,OAAW;AACL,WAAK;AAAA,IACN;AAAA,EACF;AAED,QAAM,KAAK;AAGX,SAAO,YAAY,MAAM,CAAC,IAAI,QAAQ,WAAW,IAAI,CAAC,WAAW,CAAC,IAAI;AACxE;AAsCO,yBAAyB,MAAM;AACpC,OAAK,KAAK,SAAU,GAAG,GAAG;AACxB,WAAO,WAAW,GAAG,GAAG,CAAC,IAAI,KAAK;AAAA,EACtC,CAAG;AACD,MAAI,OAAO;AACX,MAAI,YAAY;AAEhB,WAAS,IAAI,GAAG,IAAI,KAAK,UAAS;AAChC,QAAI,WAAW,KAAK,GAAG;AACvB,QAAI,UAAU,KAAK,GAAG;AAEtB,aAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,UAAI,SAAS,OAAO,MAAM;AACxB,iBAAS,MAAM;AACf,gBAAQ,MAAM,CAAC,KAAK,IAAI,YAAY;AAAA,MACrC;AAED,aAAO,SAAS;AAChB,kBAAY,QAAQ;AAAA,IACrB;AAED,QAAI,SAAS,OAAO,SAAS,MAAM,QAAQ,KAAK,QAAQ,OAAO,GAAG;AAChE,WAAK,OAAO,GAAG,CAAC;AAAA,IACtB,OAAW;AACL;AAAA,IACD;AAAA,EACF;AAED,SAAO;AAEP,sBAAoB,GAAG,GAAG,KAAI;AAC5B,WAAO,EAAE,SAAS,OAAM,EAAE,SAAS,QAAO,EAAE,SAAS,SAAQ,EAAE,SAAS,QAAQ,GAAE,MAAM,OAAM,EAAE,MAAM,SAAS,EAAC,MAAK,IAAI,OAAO,CAAC,OAAM,WAAW,GAAG,GAAG,CAAC;AAAA,EAC1J;AACH;AAkBO,yBAAyB,KAAK;AACnC,MAAI,WAAW,WAAW,GAAG;AAC7B,SAAO,YAAY,OACf,cAAa,KAAK,CAACA,SAAgB,GAAG,KAAK,IAAI,QAAQ,GAAG,KAAK,KACjE,WAAW;AACf;AAKO,mBAAmB,KAAK;AAC7B,SAAO,CAAC,MAAM,gBAAgB,GAAG,CAAC;AACpC;AAOO,2BAA2B;AAChC,SAAO,KAAK,MAAM,KAAK,OAAQ,IAAG,CAAC;AACrC;AAQO,kCAAkC,GAAG,GAAG;AAC7C,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACR;AAED,SAAO,yBAAyB,GAAG,IAAI,CAAC;AAC1C;AAQO,gCAAgC,GAAG,GAAG;AAC3C,MAAI,KAAK,MAAM;AACb,WAAO;AAAA,EACR;AAED,MAAI,KAAK,MAAM;AACb,WAAO;AAAA,EACR;AAED,SAAO,IAAI,IAAI,yBAAyB,GAAG,CAAC;AAC9C;;"}
+{"version":3,"file":"number.js","sources":["../../../../../node_modules/echarts/lib/util/number.js"],"sourcesContent":["\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\n\n\n/**\n * AUTO-GENERATED FILE. DO NOT MODIFY.\n */\n\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\n\n/*\n* A third-party license is embeded for some of the code in this file:\n* The method \"quantile\" was copied from \"d3.js\".\n* (See more details in the comment of the method below.)\n* The use of the source code of this file is also subject to the terms\n* and consitions of the license of \"d3.js\" (BSD-3Clause, see\n* </licenses/LICENSE-d3>).\n*/\nimport * as zrUtil from 'zrender/lib/core/util.js';\nvar RADIAN_EPSILON = 1e-4; // Although chrome already enlarge this number to 100 for `toFixed`, but\n// we sill follow the spec for compatibility.\n\nvar ROUND_SUPPORTED_PRECISION_MAX = 20;\n\nfunction _trim(str) {\n  return str.replace(/^\\s+|\\s+$/g, '');\n}\n/**\n * Linear mapping a value from domain to range\n * @param  val\n * @param  domain Domain extent domain[0] can be bigger than domain[1]\n * @param  range  Range extent range[0] can be bigger than range[1]\n * @param  clamp Default to be false\n */\n\n\nexport function linearMap(val, domain, range, clamp) {\n  var d0 = domain[0];\n  var d1 = domain[1];\n  var r0 = range[0];\n  var r1 = range[1];\n  var subDomain = d1 - d0;\n  var subRange = r1 - r0;\n\n  if (subDomain === 0) {\n    return subRange === 0 ? r0 : (r0 + r1) / 2;\n  } // Avoid accuracy problem in edge, such as\n  // 146.39 - 62.83 === 83.55999999999999.\n  // See echarts/test/ut/spec/util/number.js#linearMap#accuracyError\n  // It is a little verbose for efficiency considering this method\n  // is a hotspot.\n\n\n  if (clamp) {\n    if (subDomain > 0) {\n      if (val <= d0) {\n        return r0;\n      } else if (val >= d1) {\n        return r1;\n      }\n    } else {\n      if (val >= d0) {\n        return r0;\n      } else if (val <= d1) {\n        return r1;\n      }\n    }\n  } else {\n    if (val === d0) {\n      return r0;\n    }\n\n    if (val === d1) {\n      return r1;\n    }\n  }\n\n  return (val - d0) / subDomain * subRange + r0;\n}\n/**\n * Convert a percent string to absolute number.\n * Returns NaN if percent is not a valid string or number\n */\n\nexport function parsePercent(percent, all) {\n  switch (percent) {\n    case 'center':\n    case 'middle':\n      percent = '50%';\n      break;\n\n    case 'left':\n    case 'top':\n      percent = '0%';\n      break;\n\n    case 'right':\n    case 'bottom':\n      percent = '100%';\n      break;\n  }\n\n  if (zrUtil.isString(percent)) {\n    if (_trim(percent).match(/%$/)) {\n      return parseFloat(percent) / 100 * all;\n    }\n\n    return parseFloat(percent);\n  }\n\n  return percent == null ? NaN : +percent;\n}\nexport function round(x, precision, returnStr) {\n  if (precision == null) {\n    precision = 10;\n  } // Avoid range error\n\n\n  precision = Math.min(Math.max(0, precision), ROUND_SUPPORTED_PRECISION_MAX); // PENDING: 1.005.toFixed(2) is '1.00' rather than '1.01'\n\n  x = (+x).toFixed(precision);\n  return returnStr ? x : +x;\n}\n/**\n * Inplacd asc sort arr.\n * The input arr will be modified.\n */\n\nexport function asc(arr) {\n  arr.sort(function (a, b) {\n    return a - b;\n  });\n  return arr;\n}\n/**\n * Get precision.\n */\n\nexport function getPrecision(val) {\n  val = +val;\n\n  if (isNaN(val)) {\n    return 0;\n  } // It is much faster than methods converting number to string as follows\n  //      let tmp = val.toString();\n  //      return tmp.length - 1 - tmp.indexOf('.');\n  // especially when precision is low\n  // Notice:\n  // (1) If the loop count is over about 20, it is slower than `getPrecisionSafe`.\n  //     (see https://jsbench.me/2vkpcekkvw/1)\n  // (2) If the val is less than for example 1e-15, the result may be incorrect.\n  //     (see test/ut/spec/util/number.test.ts `getPrecision_equal_random`)\n\n\n  if (val > 1e-14) {\n    var e = 1;\n\n    for (var i = 0; i < 15; i++, e *= 10) {\n      if (Math.round(val * e) / e === val) {\n        return i;\n      }\n    }\n  }\n\n  return getPrecisionSafe(val);\n}\n/**\n * Get precision with slow but safe method\n */\n\nexport function getPrecisionSafe(val) {\n  // toLowerCase for: '3.4E-12'\n  var str = val.toString().toLowerCase(); // Consider scientific notation: '3.4e-12' '3.4e+12'\n\n  var eIndex = str.indexOf('e');\n  var exp = eIndex > 0 ? +str.slice(eIndex + 1) : 0;\n  var significandPartLen = eIndex > 0 ? eIndex : str.length;\n  var dotIndex = str.indexOf('.');\n  var decimalPartLen = dotIndex < 0 ? 0 : significandPartLen - 1 - dotIndex;\n  return Math.max(0, decimalPartLen - exp);\n}\n/**\n * Minimal dicernible data precisioin according to a single pixel.\n */\n\nexport function getPixelPrecision(dataExtent, pixelExtent) {\n  var log = Math.log;\n  var LN10 = Math.LN10;\n  var dataQuantity = Math.floor(log(dataExtent[1] - dataExtent[0]) / LN10);\n  var sizeQuantity = Math.round(log(Math.abs(pixelExtent[1] - pixelExtent[0])) / LN10); // toFixed() digits argument must be between 0 and 20.\n\n  var precision = Math.min(Math.max(-dataQuantity + sizeQuantity, 0), 20);\n  return !isFinite(precision) ? 20 : precision;\n}\n/**\n * Get a data of given precision, assuring the sum of percentages\n * in valueList is 1.\n * The largest remainer method is used.\n * https://en.wikipedia.org/wiki/Largest_remainder_method\n *\n * @param valueList a list of all data\n * @param idx index of the data to be processed in valueList\n * @param precision integer number showing digits of precision\n * @return percent ranging from 0 to 100\n */\n\nexport function getPercentWithPrecision(valueList, idx, precision) {\n  if (!valueList[idx]) {\n    return 0;\n  }\n\n  var sum = zrUtil.reduce(valueList, function (acc, val) {\n    return acc + (isNaN(val) ? 0 : val);\n  }, 0);\n\n  if (sum === 0) {\n    return 0;\n  }\n\n  var digits = Math.pow(10, precision);\n  var votesPerQuota = zrUtil.map(valueList, function (val) {\n    return (isNaN(val) ? 0 : val) / sum * digits * 100;\n  });\n  var targetSeats = digits * 100;\n  var seats = zrUtil.map(votesPerQuota, function (votes) {\n    // Assign automatic seats.\n    return Math.floor(votes);\n  });\n  var currentSum = zrUtil.reduce(seats, function (acc, val) {\n    return acc + val;\n  }, 0);\n  var remainder = zrUtil.map(votesPerQuota, function (votes, idx) {\n    return votes - seats[idx];\n  }); // Has remainding votes.\n\n  while (currentSum < targetSeats) {\n    // Find next largest remainder.\n    var max = Number.NEGATIVE_INFINITY;\n    var maxId = null;\n\n    for (var i = 0, len = remainder.length; i < len; ++i) {\n      if (remainder[i] > max) {\n        max = remainder[i];\n        maxId = i;\n      }\n    } // Add a vote to max remainder.\n\n\n    ++seats[maxId];\n    remainder[maxId] = 0;\n    ++currentSum;\n  }\n\n  return seats[idx] / digits;\n}\n/**\n * Solve the floating point adding problem like 0.1 + 0.2 === 0.30000000000000004\n * See <http://0.30000000000000004.com/>\n */\n\nexport function addSafe(val0, val1) {\n  var maxPrecision = Math.max(getPrecision(val0), getPrecision(val1)); // const multiplier = Math.pow(10, maxPrecision);\n  // return (Math.round(val0 * multiplier) + Math.round(val1 * multiplier)) / multiplier;\n\n  var sum = val0 + val1; // // PENDING: support more?\n\n  return maxPrecision > ROUND_SUPPORTED_PRECISION_MAX ? sum : round(sum, maxPrecision);\n} // Number.MAX_SAFE_INTEGER, ie do not support.\n\nexport var MAX_SAFE_INTEGER = 9007199254740991;\n/**\n * To 0 - 2 * PI, considering negative radian.\n */\n\nexport function remRadian(radian) {\n  var pi2 = Math.PI * 2;\n  return (radian % pi2 + pi2) % pi2;\n}\n/**\n * @param {type} radian\n * @return {boolean}\n */\n\nexport function isRadianAroundZero(val) {\n  return val > -RADIAN_EPSILON && val < RADIAN_EPSILON;\n} // eslint-disable-next-line\n\nvar TIME_REG = /^(?:(\\d{4})(?:[-\\/](\\d{1,2})(?:[-\\/](\\d{1,2})(?:[T ](\\d{1,2})(?::(\\d{1,2})(?::(\\d{1,2})(?:[.,](\\d+))?)?)?(Z|[\\+\\-]\\d\\d:?\\d\\d)?)?)?)?)?$/; // jshint ignore:line\n\n/**\n * @param value valid type: number | string | Date, otherwise return `new Date(NaN)`\n *   These values can be accepted:\n *   + An instance of Date, represent a time in its own time zone.\n *   + Or string in a subset of ISO 8601, only including:\n *     + only year, month, date: '2012-03', '2012-03-01', '2012-03-01 05', '2012-03-01 05:06',\n *     + separated with T or space: '2012-03-01T12:22:33.123', '2012-03-01 12:22:33.123',\n *     + time zone: '2012-03-01T12:22:33Z', '2012-03-01T12:22:33+8000', '2012-03-01T12:22:33-05:00',\n *     all of which will be treated as local time if time zone is not specified\n *     (see <https://momentjs.com/>).\n *   + Or other string format, including (all of which will be treated as loacal time):\n *     '2012', '2012-3-1', '2012/3/1', '2012/03/01',\n *     '2009/6/12 2:00', '2009/6/12 2:05:08', '2009/6/12 2:05:08.123'\n *   + a timestamp, which represent a time in UTC.\n * @return date Never be null/undefined. If invalid, return `new Date(NaN)`.\n */\n\nexport function parseDate(value) {\n  if (value instanceof Date) {\n    return value;\n  } else if (zrUtil.isString(value)) {\n    // Different browsers parse date in different way, so we parse it manually.\n    // Some other issues:\n    // new Date('1970-01-01') is UTC,\n    // new Date('1970/01/01') and new Date('1970-1-01') is local.\n    // See issue #3623\n    var match = TIME_REG.exec(value);\n\n    if (!match) {\n      // return Invalid Date.\n      return new Date(NaN);\n    } // Use local time when no timezone offset specifed.\n\n\n    if (!match[8]) {\n      // match[n] can only be string or undefined.\n      // But take care of '12' + 1 => '121'.\n      return new Date(+match[1], +(match[2] || 1) - 1, +match[3] || 1, +match[4] || 0, +(match[5] || 0), +match[6] || 0, match[7] ? +match[7].substring(0, 3) : 0);\n    } // Timezoneoffset of Javascript Date has considered DST (Daylight Saving Time,\n    // https://tc39.github.io/ecma262/#sec-daylight-saving-time-adjustment).\n    // For example, system timezone is set as \"Time Zone: America/Toronto\",\n    // then these code will get different result:\n    // `new Date(1478411999999).getTimezoneOffset();  // get 240`\n    // `new Date(1478412000000).getTimezoneOffset();  // get 300`\n    // So we should not use `new Date`, but use `Date.UTC`.\n    else {\n        var hour = +match[4] || 0;\n\n        if (match[8].toUpperCase() !== 'Z') {\n          hour -= +match[8].slice(0, 3);\n        }\n\n        return new Date(Date.UTC(+match[1], +(match[2] || 1) - 1, +match[3] || 1, hour, +(match[5] || 0), +match[6] || 0, match[7] ? +match[7].substring(0, 3) : 0));\n      }\n  } else if (value == null) {\n    return new Date(NaN);\n  }\n\n  return new Date(Math.round(value));\n}\n/**\n * Quantity of a number. e.g. 0.1, 1, 10, 100\n *\n * @param val\n * @return\n */\n\nexport function quantity(val) {\n  return Math.pow(10, quantityExponent(val));\n}\n/**\n * Exponent of the quantity of a number\n * e.g., 1234 equals to 1.234*10^3, so quantityExponent(1234) is 3\n *\n * @param val non-negative value\n * @return\n */\n\nexport function quantityExponent(val) {\n  if (val === 0) {\n    return 0;\n  }\n\n  var exp = Math.floor(Math.log(val) / Math.LN10);\n  /**\n   * exp is expected to be the rounded-down result of the base-10 log of val.\n   * But due to the precision loss with Math.log(val), we need to restore it\n   * using 10^exp to make sure we can get val back from exp. #11249\n   */\n\n  if (val / Math.pow(10, exp) >= 10) {\n    exp++;\n  }\n\n  return exp;\n}\n/**\n * find a “nice” number approximately equal to x. Round the number if round = true,\n * take ceiling if round = false. The primary observation is that the “nicest”\n * numbers in decimal are 1, 2, and 5, and all power-of-ten multiples of these numbers.\n *\n * See \"Nice Numbers for Graph Labels\" of Graphic Gems.\n *\n * @param  val Non-negative value.\n * @param  round\n * @return Niced number\n */\n\nexport function nice(val, round) {\n  var exponent = quantityExponent(val);\n  var exp10 = Math.pow(10, exponent);\n  var f = val / exp10; // 1 <= f < 10\n\n  var nf;\n\n  if (round) {\n    if (f < 1.5) {\n      nf = 1;\n    } else if (f < 2.5) {\n      nf = 2;\n    } else if (f < 4) {\n      nf = 3;\n    } else if (f < 7) {\n      nf = 5;\n    } else {\n      nf = 10;\n    }\n  } else {\n    if (f < 1) {\n      nf = 1;\n    } else if (f < 2) {\n      nf = 2;\n    } else if (f < 3) {\n      nf = 3;\n    } else if (f < 5) {\n      nf = 5;\n    } else {\n      nf = 10;\n    }\n  }\n\n  val = nf * exp10; // Fix 3 * 0.1 === 0.30000000000000004 issue (see IEEE 754).\n  // 20 is the uppper bound of toFixed.\n\n  return exponent >= -20 ? +val.toFixed(exponent < 0 ? -exponent : 0) : val;\n}\n/**\n * This code was copied from \"d3.js\"\n * <https://github.com/d3/d3/blob/9cc9a875e636a1dcf36cc1e07bdf77e1ad6e2c74/src/arrays/quantile.js>.\n * See the license statement at the head of this file.\n * @param ascArr\n */\n\nexport function quantile(ascArr, p) {\n  var H = (ascArr.length - 1) * p + 1;\n  var h = Math.floor(H);\n  var v = +ascArr[h - 1];\n  var e = H - h;\n  return e ? v + e * (ascArr[h] - v) : v;\n}\n/**\n * Order intervals asc, and split them when overlap.\n * expect(numberUtil.reformIntervals([\n *     {interval: [18, 62], close: [1, 1]},\n *     {interval: [-Infinity, -70], close: [0, 0]},\n *     {interval: [-70, -26], close: [1, 1]},\n *     {interval: [-26, 18], close: [1, 1]},\n *     {interval: [62, 150], close: [1, 1]},\n *     {interval: [106, 150], close: [1, 1]},\n *     {interval: [150, Infinity], close: [0, 0]}\n * ])).toEqual([\n *     {interval: [-Infinity, -70], close: [0, 0]},\n *     {interval: [-70, -26], close: [1, 1]},\n *     {interval: [-26, 18], close: [0, 1]},\n *     {interval: [18, 62], close: [0, 1]},\n *     {interval: [62, 150], close: [0, 1]},\n *     {interval: [150, Infinity], close: [0, 0]}\n * ]);\n * @param list, where `close` mean open or close\n *        of the interval, and Infinity can be used.\n * @return The origin list, which has been reformed.\n */\n\nexport function reformIntervals(list) {\n  list.sort(function (a, b) {\n    return littleThan(a, b, 0) ? -1 : 1;\n  });\n  var curr = -Infinity;\n  var currClose = 1;\n\n  for (var i = 0; i < list.length;) {\n    var interval = list[i].interval;\n    var close_1 = list[i].close;\n\n    for (var lg = 0; lg < 2; lg++) {\n      if (interval[lg] <= curr) {\n        interval[lg] = curr;\n        close_1[lg] = !lg ? 1 - currClose : 1;\n      }\n\n      curr = interval[lg];\n      currClose = close_1[lg];\n    }\n\n    if (interval[0] === interval[1] && close_1[0] * close_1[1] !== 1) {\n      list.splice(i, 1);\n    } else {\n      i++;\n    }\n  }\n\n  return list;\n\n  function littleThan(a, b, lg) {\n    return a.interval[lg] < b.interval[lg] || a.interval[lg] === b.interval[lg] && (a.close[lg] - b.close[lg] === (!lg ? 1 : -1) || !lg && littleThan(a, b, 1));\n  }\n}\n/**\n * [Numberic is defined as]:\n *     `parseFloat(val) == val`\n * For example:\n * numeric:\n *     typeof number except NaN, '-123', '123', '2e3', '-2e3', '011', 'Infinity', Infinity,\n *     and they rounded by white-spaces or line-terminal like ' -123 \\n ' (see es spec)\n * not-numeric:\n *     null, undefined, [], {}, true, false, 'NaN', NaN, '123ab',\n *     empty string, string with only white-spaces or line-terminal (see es spec),\n *     0x12, '0x12', '-0x12', 012, '012', '-012',\n *     non-string, ...\n *\n * @test See full test cases in `test/ut/spec/util/number.js`.\n * @return Must be a typeof number. If not numeric, return NaN.\n */\n\nexport function numericToNumber(val) {\n  var valFloat = parseFloat(val);\n  return valFloat == val // eslint-disable-line eqeqeq\n  && (valFloat !== 0 || !zrUtil.isString(val) || val.indexOf('x') <= 0) // For case ' 0x0 '.\n  ? valFloat : NaN;\n}\n/**\n * Definition of \"numeric\": see `numericToNumber`.\n */\n\nexport function isNumeric(val) {\n  return !isNaN(numericToNumber(val));\n}\n/**\n * Use random base to prevent users hard code depending on\n * this auto generated marker id.\n * @return An positive integer.\n */\n\nexport function getRandomIdBase() {\n  return Math.round(Math.random() * 9);\n}\n/**\n * Get the greatest common dividor\n *\n * @param {number} a one number\n * @param {number} b the other number\n */\n\nexport function getGreatestCommonDividor(a, b) {\n  if (b === 0) {\n    return a;\n  }\n\n  return getGreatestCommonDividor(b, a % b);\n}\n/**\n * Get the least common multiple\n *\n * @param {number} a one number\n * @param {number} b the other number\n */\n\nexport function getLeastCommonMultiple(a, b) {\n  if (a == null) {\n    return b;\n  }\n\n  if (b == null) {\n    return a;\n  }\n\n  return a * b / getGreatestCommonDividor(a, b);\n}"],"names":["zrUtil.isString","zrUtil.reduce","zrUtil.map","idx","round","lg"],"mappings":";AAqDA,IAAI,iBAAiB;AAGrB,IAAI,gCAAgC;AAEpC,SAAS,MAAM,KAAK;AAClB,SAAO,IAAI,QAAQ,cAAc,EAAE;AACrC;AAUO,SAAS,UAAU,KAAK,QAAQ,OAAO,OAAO;AACnD,MAAI,KAAK,OAAO;AAChB,MAAI,KAAK,OAAO;AAChB,MAAI,KAAK,MAAM;AACf,MAAI,KAAK,MAAM;AACf,MAAI,YAAY,KAAK;AACrB,MAAI,WAAW,KAAK;AAEpB,MAAI,cAAc,GAAG;AACnB,WAAO,aAAa,IAAI,MAAM,KAAK,MAAM;AAAA,EAC1C;AAOD,MAAI,OAAO;AACT,QAAI,YAAY,GAAG;AACjB,UAAI,OAAO,IAAI;AACb,eAAO;AAAA,MACf,WAAiB,OAAO,IAAI;AACpB,eAAO;AAAA,MACR;AAAA,IACP,OAAW;AACL,UAAI,OAAO,IAAI;AACb,eAAO;AAAA,MACf,WAAiB,OAAO,IAAI;AACpB,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACL,OAAS;AACL,QAAI,QAAQ,IAAI;AACd,aAAO;AAAA,IACR;AAED,QAAI,QAAQ,IAAI;AACd,aAAO;AAAA,IACR;AAAA,EACF;AAED,UAAQ,MAAM,MAAM,YAAY,WAAW;AAC7C;AAMO,SAAS,aAAa,SAAS,KAAK;AACzC,UAAQ;AAAA,SACD;AAAA,SACA;AACH,gBAAU;AACV;AAAA,SAEG;AAAA,SACA;AACH,gBAAU;AACV;AAAA,SAEG;AAAA,SACA;AACH,gBAAU;AACV;AAAA;AAGJ,MAAIA,SAAgB,OAAO,GAAG;AAC5B,QAAI,MAAM,OAAO,EAAE,MAAM,IAAI,GAAG;AAC9B,aAAO,WAAW,OAAO,IAAI,MAAM;AAAA,IACpC;AAED,WAAO,WAAW,OAAO;AAAA,EAC1B;AAED,SAAO,WAAW,OAAO,MAAM,CAAC;AAClC;AACO,SAAS,MAAM,GAAG,WAAW,WAAW;AAC7C,MAAI,aAAa,MAAM;AACrB,gBAAY;AAAA,EACb;AAGD,cAAY,KAAK,IAAI,KAAK,IAAI,GAAG,SAAS,GAAG,6BAA6B;AAE1E,OAAK,CAAC,GAAG,QAAQ,SAAS;AAC1B,SAAO,YAAY,IAAI,CAAC;AAC1B;AAMO,SAAS,IAAI,KAAK;AACvB,MAAI,KAAK,SAAU,GAAG,GAAG;AACvB,WAAO,IAAI;AAAA,EACf,CAAG;AACD,SAAO;AACT;AAKO,SAAS,aAAa,KAAK;AAChC,QAAM,CAAC;AAEP,MAAI,MAAM,GAAG,GAAG;AACd,WAAO;AAAA,EACR;AAWD,MAAI,MAAM,OAAO;AACf,QAAI,IAAI;AAER,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK,KAAK,IAAI;AACpC,UAAI,KAAK,MAAM,MAAM,CAAC,IAAI,MAAM,KAAK;AACnC,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAED,SAAO,iBAAiB,GAAG;AAC7B;AAKO,SAAS,iBAAiB,KAAK;AAEpC,MAAI,MAAM,IAAI,SAAU,EAAC,YAAW;AAEpC,MAAI,SAAS,IAAI,QAAQ,GAAG;AAC5B,MAAI,MAAM,SAAS,IAAI,CAAC,IAAI,MAAM,SAAS,CAAC,IAAI;AAChD,MAAI,qBAAqB,SAAS,IAAI,SAAS,IAAI;AACnD,MAAI,WAAW,IAAI,QAAQ,GAAG;AAC9B,MAAI,iBAAiB,WAAW,IAAI,IAAI,qBAAqB,IAAI;AACjE,SAAO,KAAK,IAAI,GAAG,iBAAiB,GAAG;AACzC;AAKO,SAAS,kBAAkB,YAAY,aAAa;AACzD,MAAI,MAAM,KAAK;AACf,MAAI,OAAO,KAAK;AAChB,MAAI,eAAe,KAAK,MAAM,IAAI,WAAW,KAAK,WAAW,EAAE,IAAI,IAAI;AACvE,MAAI,eAAe,KAAK,MAAM,IAAI,KAAK,IAAI,YAAY,KAAK,YAAY,EAAE,CAAC,IAAI,IAAI;AAEnF,MAAI,YAAY,KAAK,IAAI,KAAK,IAAI,CAAC,eAAe,cAAc,CAAC,GAAG,EAAE;AACtE,SAAO,CAAC,SAAS,SAAS,IAAI,KAAK;AACrC;AAaO,SAAS,wBAAwB,WAAW,KAAK,WAAW;AACjE,MAAI,CAAC,UAAU,MAAM;AACnB,WAAO;AAAA,EACR;AAED,MAAI,MAAMC,OAAc,WAAW,SAAU,KAAK,KAAK;AACrD,WAAO,OAAO,MAAM,GAAG,IAAI,IAAI;AAAA,EAChC,GAAE,CAAC;AAEJ,MAAI,QAAQ,GAAG;AACb,WAAO;AAAA,EACR;AAED,MAAI,SAAS,KAAK,IAAI,IAAI,SAAS;AACnC,MAAI,gBAAgBC,IAAW,WAAW,SAAU,KAAK;AACvD,YAAQ,MAAM,GAAG,IAAI,IAAI,OAAO,MAAM,SAAS;AAAA,EACnD,CAAG;AACD,MAAI,cAAc,SAAS;AAC3B,MAAI,QAAQA,IAAW,eAAe,SAAU,OAAO;AAErD,WAAO,KAAK,MAAM,KAAK;AAAA,EAC3B,CAAG;AACD,MAAI,aAAaD,OAAc,OAAO,SAAU,KAAK,KAAK;AACxD,WAAO,MAAM;AAAA,EACd,GAAE,CAAC;AACJ,MAAI,YAAYC,IAAW,eAAe,SAAU,OAAOC,MAAK;AAC9D,WAAO,QAAQ,MAAMA;AAAA,EACzB,CAAG;AAED,SAAO,aAAa,aAAa;AAE/B,QAAI,MAAM,OAAO;AACjB,QAAI,QAAQ;AAEZ,aAAS,IAAI,GAAG,MAAM,UAAU,QAAQ,IAAI,KAAK,EAAE,GAAG;AACpD,UAAI,UAAU,KAAK,KAAK;AACtB,cAAM,UAAU;AAChB,gBAAQ;AAAA,MACT;AAAA,IACF;AAGD,MAAE,MAAM;AACR,cAAU,SAAS;AACnB,MAAE;AAAA,EACH;AAED,SAAO,MAAM,OAAO;AACtB;AAMO,SAAS,QAAQ,MAAM,MAAM;AAClC,MAAI,eAAe,KAAK,IAAI,aAAa,IAAI,GAAG,aAAa,IAAI,CAAC;AAGlE,MAAI,MAAM,OAAO;AAEjB,SAAO,eAAe,gCAAgC,MAAM,MAAM,KAAK,YAAY;AACrF;AAOO,SAAS,UAAU,QAAQ;AAChC,MAAI,MAAM,KAAK,KAAK;AACpB,UAAQ,SAAS,MAAM,OAAO;AAChC;AAMO,SAAS,mBAAmB,KAAK;AACtC,SAAO,MAAM,CAAC,kBAAkB,MAAM;AACxC;AAEA,IAAI,WAAW;AAmBR,SAAS,UAAU,OAAO;AAC/B,MAAI,iBAAiB,MAAM;AACzB,WAAO;AAAA,EACX,WAAaH,SAAgB,KAAK,GAAG;AAMjC,QAAI,QAAQ,SAAS,KAAK,KAAK;AAE/B,QAAI,CAAC,OAAO;AAEV,aAAO,IAAI,KAAK,GAAG;AAAA,IACpB;AAGD,QAAI,CAAC,MAAM,IAAI;AAGb,aAAO,IAAI,KAAK,CAAC,MAAM,IAAI,EAAE,MAAM,MAAM,KAAK,GAAG,CAAC,MAAM,MAAM,GAAG,CAAC,MAAM,MAAM,GAAG,EAAE,MAAM,MAAM,IAAI,CAAC,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,MAAM,GAAG,UAAU,GAAG,CAAC,IAAI,CAAC;AAAA,IAC5J,OAOI;AACD,UAAI,OAAO,CAAC,MAAM,MAAM;AAExB,UAAI,MAAM,GAAG,YAAW,MAAO,KAAK;AAClC,gBAAQ,CAAC,MAAM,GAAG,MAAM,GAAG,CAAC;AAAA,MAC7B;AAED,aAAO,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,IAAI,EAAE,MAAM,MAAM,KAAK,GAAG,CAAC,MAAM,MAAM,GAAG,MAAM,EAAE,MAAM,MAAM,IAAI,CAAC,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,MAAM,GAAG,UAAU,GAAG,CAAC,IAAI,CAAC,CAAC;AAAA,IAC5J;AAAA,EACP,WAAa,SAAS,MAAM;AACxB,WAAO,IAAI,KAAK,GAAG;AAAA,EACpB;AAED,SAAO,IAAI,KAAK,KAAK,MAAM,KAAK,CAAC;AACnC;AAQO,SAAS,SAAS,KAAK;AAC5B,SAAO,KAAK,IAAI,IAAI,iBAAiB,GAAG,CAAC;AAC3C;AASO,SAAS,iBAAiB,KAAK;AACpC,MAAI,QAAQ,GAAG;AACb,WAAO;AAAA,EACR;AAED,MAAI,MAAM,KAAK,MAAM,KAAK,IAAI,GAAG,IAAI,KAAK,IAAI;AAO9C,MAAI,MAAM,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI;AACjC;AAAA,EACD;AAED,SAAO;AACT;AAaO,SAAS,KAAK,KAAKI,QAAO;AAC/B,MAAI,WAAW,iBAAiB,GAAG;AACnC,MAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ;AACjC,MAAI,IAAI,MAAM;AAEd,MAAI;AAEJ,MAAIA,QAAO;AACT,QAAI,IAAI,KAAK;AACX,WAAK;AAAA,IACX,WAAe,IAAI,KAAK;AAClB,WAAK;AAAA,IACX,WAAe,IAAI,GAAG;AAChB,WAAK;AAAA,IACX,WAAe,IAAI,GAAG;AAChB,WAAK;AAAA,IACX,OAAW;AACL,WAAK;AAAA,IACN;AAAA,EACL,OAAS;AACL,QAAI,IAAI,GAAG;AACT,WAAK;AAAA,IACX,WAAe,IAAI,GAAG;AAChB,WAAK;AAAA,IACX,WAAe,IAAI,GAAG;AAChB,WAAK;AAAA,IACX,WAAe,IAAI,GAAG;AAChB,WAAK;AAAA,IACX,OAAW;AACL,WAAK;AAAA,IACN;AAAA,EACF;AAED,QAAM,KAAK;AAGX,SAAO,YAAY,MAAM,CAAC,IAAI,QAAQ,WAAW,IAAI,CAAC,WAAW,CAAC,IAAI;AACxE;AAsCO,SAAS,gBAAgB,MAAM;AACpC,OAAK,KAAK,SAAU,GAAG,GAAG;AACxB,WAAO,WAAW,GAAG,GAAG,CAAC,IAAI,KAAK;AAAA,EACtC,CAAG;AACD,MAAI,OAAO;AACX,MAAI,YAAY;AAEhB,WAAS,IAAI,GAAG,IAAI,KAAK,UAAS;AAChC,QAAI,WAAW,KAAK,GAAG;AACvB,QAAI,UAAU,KAAK,GAAG;AAEtB,aAAS,KAAK,GAAG,KAAK,GAAG,MAAM;AAC7B,UAAI,SAAS,OAAO,MAAM;AACxB,iBAAS,MAAM;AACf,gBAAQ,MAAM,CAAC,KAAK,IAAI,YAAY;AAAA,MACrC;AAED,aAAO,SAAS;AAChB,kBAAY,QAAQ;AAAA,IACrB;AAED,QAAI,SAAS,OAAO,SAAS,MAAM,QAAQ,KAAK,QAAQ,OAAO,GAAG;AAChE,WAAK,OAAO,GAAG,CAAC;AAAA,IACtB,OAAW;AACL;AAAA,IACD;AAAA,EACF;AAED,SAAO;AAEP,WAAS,WAAW,GAAG,GAAGC,KAAI;AAC5B,WAAO,EAAE,SAASA,OAAM,EAAE,SAASA,QAAO,EAAE,SAASA,SAAQ,EAAE,SAASA,SAAQ,EAAE,MAAMA,OAAM,EAAE,MAAMA,UAAS,CAACA,MAAK,IAAI,OAAO,CAACA,OAAM,WAAW,GAAG,GAAG,CAAC;AAAA,EAC1J;AACH;AAkBO,SAAS,gBAAgB,KAAK;AACnC,MAAI,WAAW,WAAW,GAAG;AAC7B,SAAO,YAAY,QACf,aAAa,KAAK,CAACL,SAAgB,GAAG,KAAK,IAAI,QAAQ,GAAG,KAAK,KACjE,WAAW;AACf;AAKO,SAAS,UAAU,KAAK;AAC7B,SAAO,CAAC,MAAM,gBAAgB,GAAG,CAAC;AACpC;AAOO,SAAS,kBAAkB;AAChC,SAAO,KAAK,MAAM,KAAK,OAAQ,IAAG,CAAC;AACrC;AAQO,SAAS,yBAAyB,GAAG,GAAG;AAC7C,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACR;AAED,SAAO,yBAAyB,GAAG,IAAI,CAAC;AAC1C;AAQO,SAAS,uBAAuB,GAAG,GAAG;AAC3C,MAAI,KAAK,MAAM;AACb,WAAO;AAAA,EACR;AAED,MAAI,KAAK,MAAM;AACb,WAAO;AAAA,EACR;AAED,SAAO,IAAI,IAAI,yBAAyB,GAAG,CAAC;AAC9C;"}

package/es/node_modules/echarts/lib/util/shape/sausage.js

@@ -56,6 +56,8 @@ var SausagePath = function(_super) {
   };
   return SausagePath2;
 }(Path);
-var Sausage = SausagePath;
-export { Sausage as default };
+const Sausage = SausagePath;
+export {
+  Sausage as default
+};
 //# sourceMappingURL=sausage.js.map

package/es/node_modules/echarts/lib/util/shape/sausage.js.map

@@ -1 +1 @@
-{"version":3,"file":"sausage.js","sources":["../../../../../../node_modules/echarts/lib/util/shape/sausage.js"],"sourcesContent":["\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\n\n\n/**\n * AUTO-GENERATED FILE. DO NOT MODIFY.\n */\n\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\nimport { __extends } from \"tslib\";\nimport { Path } from '../graphic.js';\n/**\n * Sausage: similar to sector, but have half circle on both sides\n */\n\nvar SausageShape =\n/** @class */\nfunction () {\n  function SausageShape() {\n    this.cx = 0;\n    this.cy = 0;\n    this.r0 = 0;\n    this.r = 0;\n    this.startAngle = 0;\n    this.endAngle = Math.PI * 2;\n    this.clockwise = true;\n  }\n\n  return SausageShape;\n}();\n\nvar SausagePath =\n/** @class */\nfunction (_super) {\n  __extends(SausagePath, _super);\n\n  function SausagePath(opts) {\n    var _this = _super.call(this, opts) || this;\n\n    _this.type = 'sausage';\n    return _this;\n  }\n\n  SausagePath.prototype.getDefaultShape = function () {\n    return new SausageShape();\n  };\n\n  SausagePath.prototype.buildPath = function (ctx, shape) {\n    var cx = shape.cx;\n    var cy = shape.cy;\n    var r0 = Math.max(shape.r0 || 0, 0);\n    var r = Math.max(shape.r, 0);\n    var dr = (r - r0) * 0.5;\n    var rCenter = r0 + dr;\n    var startAngle = shape.startAngle;\n    var endAngle = shape.endAngle;\n    var clockwise = shape.clockwise;\n    var PI2 = Math.PI * 2;\n    var lessThanCircle = clockwise ? endAngle - startAngle < PI2 : startAngle - endAngle < PI2;\n\n    if (!lessThanCircle) {\n      // Normalize angles\n      startAngle = endAngle - (clockwise ? PI2 : -PI2);\n    }\n\n    var unitStartX = Math.cos(startAngle);\n    var unitStartY = Math.sin(startAngle);\n    var unitEndX = Math.cos(endAngle);\n    var unitEndY = Math.sin(endAngle);\n\n    if (lessThanCircle) {\n      ctx.moveTo(unitStartX * r0 + cx, unitStartY * r0 + cy);\n      ctx.arc(unitStartX * rCenter + cx, unitStartY * rCenter + cy, dr, -Math.PI + startAngle, startAngle, !clockwise);\n    } else {\n      ctx.moveTo(unitStartX * r + cx, unitStartY * r + cy);\n    }\n\n    ctx.arc(cx, cy, r, startAngle, endAngle, !clockwise);\n    ctx.arc(unitEndX * rCenter + cx, unitEndY * rCenter + cy, dr, endAngle - Math.PI * 2, endAngle - Math.PI, !clockwise);\n\n    if (r0 !== 0) {\n      ctx.arc(cx, cy, r0, endAngle, startAngle, clockwise);\n    } // ctx.closePath();\n\n  };\n\n  return SausagePath;\n}(Path);\n\nexport default SausagePath;"],"names":[],"mappings":";;;AAiDA,IAAI,eAEJ,WAAY;AACV,2BAAwB;AACtB,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,IAAI;AACT,SAAK,aAAa;AAClB,SAAK,WAAW,KAAK,KAAK;AAC1B,SAAK,YAAY;AAAA,EAClB;AAED,SAAO;AACT;AAEA,IAAI,cAEJ,SAAU,QAAQ;AAChB,YAAU,cAAa,MAAM;AAE7B,wBAAqB,MAAM;AACzB,QAAI,QAAQ,OAAO,KAAK,MAAM,IAAI,KAAK;AAEvC,UAAM,OAAO;AACb,WAAO;AAAA,EACR;AAED,eAAY,UAAU,kBAAkB,WAAY;AAClD,WAAO,IAAI,aAAY;AAAA,EAC3B;AAEE,eAAY,UAAU,YAAY,SAAU,KAAK,OAAO;AACtD,QAAI,KAAK,MAAM;AACf,QAAI,KAAK,MAAM;AACf,QAAI,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,CAAC;AAClC,QAAI,IAAI,KAAK,IAAI,MAAM,GAAG,CAAC;AAC3B,QAAI,KAAM,KAAI,MAAM;AACpB,QAAI,UAAU,KAAK;AACnB,QAAI,aAAa,MAAM;AACvB,QAAI,WAAW,MAAM;AACrB,QAAI,YAAY,MAAM;AACtB,QAAI,MAAM,KAAK,KAAK;AACpB,QAAI,iBAAiB,YAAY,WAAW,aAAa,MAAM,aAAa,WAAW;AAEvF,QAAI,CAAC,gBAAgB;AAEnB,mBAAa,WAAY,aAAY,MAAM,CAAC;AAAA,IAC7C;AAED,QAAI,aAAa,KAAK,IAAI,UAAU;AACpC,QAAI,aAAa,KAAK,IAAI,UAAU;AACpC,QAAI,WAAW,KAAK,IAAI,QAAQ;AAChC,QAAI,WAAW,KAAK,IAAI,QAAQ;AAEhC,QAAI,gBAAgB;AAClB,UAAI,OAAO,aAAa,KAAK,IAAI,aAAa,KAAK,EAAE;AACrD,UAAI,IAAI,aAAa,UAAU,IAAI,aAAa,UAAU,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY,YAAY,CAAC,SAAS;AAAA,IACrH,OAAW;AACL,UAAI,OAAO,aAAa,IAAI,IAAI,aAAa,IAAI,EAAE;AAAA,IACpD;AAED,QAAI,IAAI,IAAI,IAAI,GAAG,YAAY,UAAU,CAAC,SAAS;AACnD,QAAI,IAAI,WAAW,UAAU,IAAI,WAAW,UAAU,IAAI,IAAI,WAAW,KAAK,KAAK,GAAG,WAAW,KAAK,IAAI,CAAC,SAAS;AAEpH,QAAI,OAAO,GAAG;AACZ,UAAI,IAAI,IAAI,IAAI,IAAI,UAAU,YAAY,SAAS;AAAA,IACpD;AAAA,EAEL;AAEE,SAAO;AACT,EAAE,IAAI;AAEN,IAAA,UAAe;;"}
+{"version":3,"file":"sausage.js","sources":["../../../../../../node_modules/echarts/lib/util/shape/sausage.js"],"sourcesContent":["\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\n\n\n/**\n * AUTO-GENERATED FILE. DO NOT MODIFY.\n */\n\n/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\nimport { __extends } from \"tslib\";\nimport { Path } from '../graphic.js';\n/**\n * Sausage: similar to sector, but have half circle on both sides\n */\n\nvar SausageShape =\n/** @class */\nfunction () {\n  function SausageShape() {\n    this.cx = 0;\n    this.cy = 0;\n    this.r0 = 0;\n    this.r = 0;\n    this.startAngle = 0;\n    this.endAngle = Math.PI * 2;\n    this.clockwise = true;\n  }\n\n  return SausageShape;\n}();\n\nvar SausagePath =\n/** @class */\nfunction (_super) {\n  __extends(SausagePath, _super);\n\n  function SausagePath(opts) {\n    var _this = _super.call(this, opts) || this;\n\n    _this.type = 'sausage';\n    return _this;\n  }\n\n  SausagePath.prototype.getDefaultShape = function () {\n    return new SausageShape();\n  };\n\n  SausagePath.prototype.buildPath = function (ctx, shape) {\n    var cx = shape.cx;\n    var cy = shape.cy;\n    var r0 = Math.max(shape.r0 || 0, 0);\n    var r = Math.max(shape.r, 0);\n    var dr = (r - r0) * 0.5;\n    var rCenter = r0 + dr;\n    var startAngle = shape.startAngle;\n    var endAngle = shape.endAngle;\n    var clockwise = shape.clockwise;\n    var PI2 = Math.PI * 2;\n    var lessThanCircle = clockwise ? endAngle - startAngle < PI2 : startAngle - endAngle < PI2;\n\n    if (!lessThanCircle) {\n      // Normalize angles\n      startAngle = endAngle - (clockwise ? PI2 : -PI2);\n    }\n\n    var unitStartX = Math.cos(startAngle);\n    var unitStartY = Math.sin(startAngle);\n    var unitEndX = Math.cos(endAngle);\n    var unitEndY = Math.sin(endAngle);\n\n    if (lessThanCircle) {\n      ctx.moveTo(unitStartX * r0 + cx, unitStartY * r0 + cy);\n      ctx.arc(unitStartX * rCenter + cx, unitStartY * rCenter + cy, dr, -Math.PI + startAngle, startAngle, !clockwise);\n    } else {\n      ctx.moveTo(unitStartX * r + cx, unitStartY * r + cy);\n    }\n\n    ctx.arc(cx, cy, r, startAngle, endAngle, !clockwise);\n    ctx.arc(unitEndX * rCenter + cx, unitEndY * rCenter + cy, dr, endAngle - Math.PI * 2, endAngle - Math.PI, !clockwise);\n\n    if (r0 !== 0) {\n      ctx.arc(cx, cy, r0, endAngle, startAngle, clockwise);\n    } // ctx.closePath();\n\n  };\n\n  return SausagePath;\n}(Path);\n\nexport default SausagePath;"],"names":["SausageShape","SausagePath"],"mappings":";;;AAiDA,IAAI,eAEJ,WAAY;AACV,WAASA,gBAAe;AACtB,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,KAAK;AACV,SAAK,IAAI;AACT,SAAK,aAAa;AAClB,SAAK,WAAW,KAAK,KAAK;AAC1B,SAAK,YAAY;AAAA,EAClB;AAED,SAAOA;AACT;AAEA,IAAI,cAEJ,SAAU,QAAQ;AAChB,YAAUC,cAAa,MAAM;AAE7B,WAASA,aAAY,MAAM;AACzB,QAAI,QAAQ,OAAO,KAAK,MAAM,IAAI,KAAK;AAEvC,UAAM,OAAO;AACb,WAAO;AAAA,EACR;AAED,EAAAA,aAAY,UAAU,kBAAkB,WAAY;AAClD,WAAO,IAAI,aAAY;AAAA,EAC3B;AAEE,EAAAA,aAAY,UAAU,YAAY,SAAU,KAAK,OAAO;AACtD,QAAI,KAAK,MAAM;AACf,QAAI,KAAK,MAAM;AACf,QAAI,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,CAAC;AAClC,QAAI,IAAI,KAAK,IAAI,MAAM,GAAG,CAAC;AAC3B,QAAI,MAAM,IAAI,MAAM;AACpB,QAAI,UAAU,KAAK;AACnB,QAAI,aAAa,MAAM;AACvB,QAAI,WAAW,MAAM;AACrB,QAAI,YAAY,MAAM;AACtB,QAAI,MAAM,KAAK,KAAK;AACpB,QAAI,iBAAiB,YAAY,WAAW,aAAa,MAAM,aAAa,WAAW;AAEvF,QAAI,CAAC,gBAAgB;AAEnB,mBAAa,YAAY,YAAY,MAAM,CAAC;AAAA,IAC7C;AAED,QAAI,aAAa,KAAK,IAAI,UAAU;AACpC,QAAI,aAAa,KAAK,IAAI,UAAU;AACpC,QAAI,WAAW,KAAK,IAAI,QAAQ;AAChC,QAAI,WAAW,KAAK,IAAI,QAAQ;AAEhC,QAAI,gBAAgB;AAClB,UAAI,OAAO,aAAa,KAAK,IAAI,aAAa,KAAK,EAAE;AACrD,UAAI,IAAI,aAAa,UAAU,IAAI,aAAa,UAAU,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY,YAAY,CAAC,SAAS;AAAA,IACrH,OAAW;AACL,UAAI,OAAO,aAAa,IAAI,IAAI,aAAa,IAAI,EAAE;AAAA,IACpD;AAED,QAAI,IAAI,IAAI,IAAI,GAAG,YAAY,UAAU,CAAC,SAAS;AACnD,QAAI,IAAI,WAAW,UAAU,IAAI,WAAW,UAAU,IAAI,IAAI,WAAW,KAAK,KAAK,GAAG,WAAW,KAAK,IAAI,CAAC,SAAS;AAEpH,QAAI,OAAO,GAAG;AACZ,UAAI,IAAI,IAAI,IAAI,IAAI,UAAU,YAAY,SAAS;AAAA,IACpD;AAAA,EAEL;AAEE,SAAOA;AACT,EAAE,IAAI;AAEN,MAAA,UAAe;"}

package/es/node_modules/echarts/lib/util/states.js

@@ -4,6 +4,7 @@ import { getECData } from "./innerStore.js";
 import { lift } from "../../../zrender/lib/tool/color.js";
 import { makeInner, queryDataIndex } from "./model.js";
 import Path from "../../../zrender/lib/graphic/Path.js";
+import { error } from "./log.js";
 var _highlightNextDigit = 1;
 var _highlightKeyMap = {};
 var getSavedStates = makeInner();
@@ -331,6 +332,9 @@ function blurSeriesFromHighlightPayload(seriesModel, payload, api) {
   var seriesIndex = seriesModel.seriesIndex;
   var data = seriesModel.getData(payload.dataType);
   if (!data) {
+    if (process.env.NODE_ENV !== "production") {
+      error("Unknown dataType " + payload.dataType);
+    }
     return;
   }
   var dataIndex = queryDataIndex(data, payload);
@@ -373,6 +377,9 @@ function findComponentHighDownDispatchers(componentMainType, componentIndex, nam
   var dispatchers = view.findHighDownDispatchers(name);
   var focusSelf;
   for (var i = 0; i < dispatchers.length; i++) {
+    if (process.env.NODE_ENV !== "production" && !isHighDownDispatcher(dispatchers[i])) {
+      error("param should be highDownDispatcher");
+    }
     if (getECData(dispatchers[i]).focus === "self") {
       focusSelf = true;
       break;
@@ -384,6 +391,9 @@ function findComponentHighDownDispatchers(componentMainType, componentIndex, nam
   };
 }
 function handleGlobalMouseOverForHighDown(dispatcher, e, api) {
+  if (process.env.NODE_ENV !== "production" && !isHighDownDispatcher(dispatcher)) {
+    error("param should be highDownDispatcher");
+  }
   var ecData = getECData(dispatcher);
   var _a = findComponentHighDownDispatchers(ecData.componentMainType, ecData.componentIndex, ecData.componentHighDownName, api), dispatchers = _a.dispatchers, focusSelf = _a.focusSelf;
   if (dispatchers) {
@@ -402,6 +412,9 @@ function handleGlobalMouseOverForHighDown(dispatcher, e, api) {
   }
 }
 function handleGlobalMouseOutForHighDown(dispatcher, e, api) {
+  if (process.env.NODE_ENV !== "production" && !isHighDownDispatcher(dispatcher)) {
+    error("param should be highDownDispatcher");
+  }
   allLeaveBlur(api);
   var ecData = getECData(dispatcher);
   var dispatchers = findComponentHighDownDispatchers(ecData.componentMainType, ecData.componentIndex, ecData.componentHighDownName, api).dispatchers;
@@ -534,5 +547,50 @@ function savePathStates(el) {
   store.selectFill = selectState.style && selectState.style.fill || null;
   store.selectStroke = selectState.style && selectState.style.stroke || null;
 }
-export { DISPLAY_STATES, DOWNPLAY_ACTION_TYPE, HIGHLIGHT_ACTION_TYPE, HOVER_STATE_BLUR, HOVER_STATE_EMPHASIS, HOVER_STATE_NORMAL, SELECT_ACTION_TYPE, SPECIAL_STATES, TOGGLE_SELECT_ACTION_TYPE, UNSELECT_ACTION_TYPE, Z2_EMPHASIS_LIFT, Z2_SELECT_LIFT, allLeaveBlur, blurComponent, blurSeries, blurSeriesFromHighlightPayload, disableHoverEmphasis, enableComponentHighDownFeatures, enableHoverEmphasis, enableHoverFocus, enterBlur, enterEmphasis, enterEmphasisWhenMouseOver, enterSelect, findComponentHighDownDispatchers, getAllSelectedIndices, getHighlightDigit, handleGlobalMouseOutForHighDown, handleGlobalMouseOverForHighDown, isHighDownDispatcher, isHighDownPayload, isSelectChangePayload, leaveBlur, leaveEmphasis, leaveEmphasisWhenMouseOut, leaveSelect, savePathStates, setAsHighDownDispatcher, setDefaultStateProxy, setStatesFlag, setStatesStylesFromModel, toggleHoverEmphasis, toggleSelectionFromPayload, updateSeriesElementSelection };
+export {
+  DISPLAY_STATES,
+  DOWNPLAY_ACTION_TYPE,
+  HIGHLIGHT_ACTION_TYPE,
+  HOVER_STATE_BLUR,
+  HOVER_STATE_EMPHASIS,
+  HOVER_STATE_NORMAL,
+  SELECT_ACTION_TYPE,
+  SPECIAL_STATES,
+  TOGGLE_SELECT_ACTION_TYPE,
+  UNSELECT_ACTION_TYPE,
+  Z2_EMPHASIS_LIFT,
+  Z2_SELECT_LIFT,
+  allLeaveBlur,
+  blurComponent,
+  blurSeries,
+  blurSeriesFromHighlightPayload,
+  disableHoverEmphasis,
+  enableComponentHighDownFeatures,
+  enableHoverEmphasis,
+  enableHoverFocus,
+  enterBlur,
+  enterEmphasis,
+  enterEmphasisWhenMouseOver,
+  enterSelect,
+  findComponentHighDownDispatchers,
+  getAllSelectedIndices,
+  getHighlightDigit,
+  handleGlobalMouseOutForHighDown,
+  handleGlobalMouseOverForHighDown,
+  isHighDownDispatcher,
+  isHighDownPayload,
+  isSelectChangePayload,
+  leaveBlur,
+  leaveEmphasis,
+  leaveEmphasisWhenMouseOut,
+  leaveSelect,
+  savePathStates,
+  setAsHighDownDispatcher,
+  setDefaultStateProxy,
+  setStatesFlag,
+  setStatesStylesFromModel,
+  toggleHoverEmphasis,
+  toggleSelectionFromPayload,
+  updateSeriesElementSelection
+};
 //# sourceMappingURL=states.js.map