@hkyhy/marsun-components-core 0.1.3 → 0.1.8

package/dist/node_modules/echarts/lib/data/DataStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DataStore.js","sources":["../../../../../node_modules/echarts/lib/data/DataStore.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/*\r\n* Licensed to the Apache Software Foundation (ASF) under one\r\n* or more contributor license agreements.  See the NOTICE file\r\n* distributed with this work for additional information\r\n* regarding copyright ownership.  The ASF licenses this file\r\n* to you under the Apache License, Version 2.0 (the\r\n* \"License\"); you may not use this file except in compliance\r\n* with the License.  You may obtain a copy of the License at\r\n*\r\n*   http://www.apache.org/licenses/LICENSE-2.0\r\n*\r\n* Unless required by applicable law or agreed to in writing,\r\n* software distributed under the License is distributed on an\r\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\n* KIND, either express or implied.  See the License for the\r\n* specific language governing permissions and limitations\r\n* under the License.\r\n*/\nimport { assert, clone, createHashMap, isFunction, keys, map, reduce } from 'zrender/lib/core/util.js';\nimport { parseDataValue } from './helper/dataValueHelper.js';\nimport { shouldRetrieveDataByName } from './Source.js';\nvar UNDEFINED = 'undefined';\n/* global Float64Array, Int32Array, Uint32Array, Uint16Array */\n// Caution: MUST not use `new CtorUint32Array(arr, 0, len)`, because the Ctor of array is\n// different from the Ctor of typed array.\nexport var CtorUint32Array = typeof Uint32Array === UNDEFINED ? Array : Uint32Array;\nexport var CtorUint16Array = typeof Uint16Array === UNDEFINED ? Array : Uint16Array;\nexport var CtorInt32Array = typeof Int32Array === UNDEFINED ? Array : Int32Array;\nexport var CtorFloat64Array = typeof Float64Array === UNDEFINED ? Array : Float64Array;\n/**\r\n * Multi dimensional data store\r\n */\nvar dataCtors = {\n  'float': CtorFloat64Array,\n  'int': CtorInt32Array,\n  // Ordinal data type can be string or int\n  'ordinal': Array,\n  'number': Array,\n  'time': CtorFloat64Array\n};\nvar defaultDimValueGetters;\nfunction getIndicesCtor(rawCount) {\n  // The possible max value in this._indicies is always this._rawCount despite of filtering.\n  return rawCount > 65535 ? CtorUint32Array : CtorUint16Array;\n}\n;\nfunction getInitialExtent() {\n  return [Infinity, -Infinity];\n}\n;\nfunction cloneChunk(originalChunk) {\n  var Ctor = originalChunk.constructor;\n  // Only shallow clone is enough when Array.\n  return Ctor === Array ? originalChunk.slice() : new Ctor(originalChunk);\n}\nfunction prepareStore(store, dimIdx, dimType, end, append) {\n  var DataCtor = dataCtors[dimType || 'float'];\n  if (append) {\n    var oldStore = store[dimIdx];\n    var oldLen = oldStore && oldStore.length;\n    if (!(oldLen === end)) {\n      var newStore = new DataCtor(end);\n      // The cost of the copy is probably inconsiderable\n      // within the initial chunkSize.\n      for (var j = 0; j < oldLen; j++) {\n        newStore[j] = oldStore[j];\n      }\n      store[dimIdx] = newStore;\n    }\n  } else {\n    store[dimIdx] = new DataCtor(end);\n  }\n}\n;\n/**\r\n * Basically, DataStore API keep immutable.\r\n */\nvar DataStore = /** @class */function () {\n  function DataStore() {\n    this._chunks = [];\n    // It will not be calculated until needed.\n    this._rawExtent = [];\n    this._extent = [];\n    this._count = 0;\n    this._rawCount = 0;\n    this._calcDimNameToIdx = createHashMap();\n  }\n  /**\r\n   * Initialize from data\r\n   */\n  DataStore.prototype.initData = function (provider, inputDimensions, dimValueGetter) {\n    if (process.env.NODE_ENV !== 'production') {\n      assert(isFunction(provider.getItem) && isFunction(provider.count), 'Invalid data provider.');\n    }\n    this._provider = provider;\n    // Clear\n    this._chunks = [];\n    this._indices = null;\n    this.getRawIndex = this._getRawIdxIdentity;\n    var source = provider.getSource();\n    var defaultGetter = this.defaultDimValueGetter = defaultDimValueGetters[source.sourceFormat];\n    // Default dim value getter\n    this._dimValueGetter = dimValueGetter || defaultGetter;\n    // Reset raw extent.\n    this._rawExtent = [];\n    var willRetrieveDataByName = shouldRetrieveDataByName(source);\n    this._dimensions = map(inputDimensions, function (dim) {\n      if (process.env.NODE_ENV !== 'production') {\n        if (willRetrieveDataByName) {\n          assert(dim.property != null);\n        }\n      }\n      return {\n        // Only pick these two props. Not leak other properties like orderMeta.\n        type: dim.type,\n        property: dim.property\n      };\n    });\n    this._initDataFromProvider(0, provider.count());\n  };\n  DataStore.prototype.getProvider = function () {\n    return this._provider;\n  };\n  /**\r\n   * Caution: even when a `source` instance owned by a series, the created data store\r\n   * may still be shared by different sereis (the source hash does not use all `source`\r\n   * props, see `sourceManager`). In this case, the `source` props that are not used in\r\n   * hash (like `source.dimensionDefine`) probably only belongs to a certain series and\r\n   * thus should not be fetch here.\r\n   */\n  DataStore.prototype.getSource = function () {\n    return this._provider.getSource();\n  };\n  /**\r\n   * @caution Only used in dataStack.\r\n   */\n  DataStore.prototype.ensureCalculationDimension = function (dimName, type) {\n    var calcDimNameToIdx = this._calcDimNameToIdx;\n    var dimensions = this._dimensions;\n    var calcDimIdx = calcDimNameToIdx.get(dimName);\n    if (calcDimIdx != null) {\n      if (dimensions[calcDimIdx].type === type) {\n        return calcDimIdx;\n      }\n    } else {\n      calcDimIdx = dimensions.length;\n    }\n    dimensions[calcDimIdx] = {\n      type: type\n    };\n    calcDimNameToIdx.set(dimName, calcDimIdx);\n    this._chunks[calcDimIdx] = new dataCtors[type || 'float'](this._rawCount);\n    this._rawExtent[calcDimIdx] = getInitialExtent();\n    return calcDimIdx;\n  };\n  DataStore.prototype.collectOrdinalMeta = function (dimIdx, ordinalMeta) {\n    var chunk = this._chunks[dimIdx];\n    var dim = this._dimensions[dimIdx];\n    var rawExtents = this._rawExtent;\n    var offset = dim.ordinalOffset || 0;\n    var len = chunk.length;\n    if (offset === 0) {\n      // We need to reset the rawExtent if collect is from start.\n      // Because this dimension may be guessed as number and calcuating a wrong extent.\n      rawExtents[dimIdx] = getInitialExtent();\n    }\n    var dimRawExtent = rawExtents[dimIdx];\n    // Parse from previous data offset. len may be changed after appendData\n    for (var i = offset; i < len; i++) {\n      var val = chunk[i] = ordinalMeta.parseAndCollect(chunk[i]);\n      if (!isNaN(val)) {\n        dimRawExtent[0] = Math.min(val, dimRawExtent[0]);\n        dimRawExtent[1] = Math.max(val, dimRawExtent[1]);\n      }\n    }\n    dim.ordinalMeta = ordinalMeta;\n    dim.ordinalOffset = len;\n    dim.type = 'ordinal'; // Force to be ordinal\n  };\n  DataStore.prototype.getOrdinalMeta = function (dimIdx) {\n    var dimInfo = this._dimensions[dimIdx];\n    var ordinalMeta = dimInfo.ordinalMeta;\n    return ordinalMeta;\n  };\n  DataStore.prototype.getDimensionProperty = function (dimIndex) {\n    var item = this._dimensions[dimIndex];\n    return item && item.property;\n  };\n  /**\r\n   * Caution: Can be only called on raw data (before `this._indices` created).\r\n   */\n  DataStore.prototype.appendData = function (data) {\n    if (process.env.NODE_ENV !== 'production') {\n      assert(!this._indices, 'appendData can only be called on raw data.');\n    }\n    var provider = this._provider;\n    var start = this.count();\n    provider.appendData(data);\n    var end = provider.count();\n    if (!provider.persistent) {\n      end += start;\n    }\n    if (start < end) {\n      this._initDataFromProvider(start, end, true);\n    }\n    return [start, end];\n  };\n  DataStore.prototype.appendValues = function (values, minFillLen) {\n    var chunks = this._chunks;\n    var dimensions = this._dimensions;\n    var dimLen = dimensions.length;\n    var rawExtent = this._rawExtent;\n    var start = this.count();\n    var end = start + Math.max(values.length, minFillLen || 0);\n    for (var i = 0; i < dimLen; i++) {\n      var dim = dimensions[i];\n      prepareStore(chunks, i, dim.type, end, true);\n    }\n    var emptyDataItem = [];\n    for (var idx = start; idx < end; idx++) {\n      var sourceIdx = idx - start;\n      // Store the data by dimensions\n      for (var dimIdx = 0; dimIdx < dimLen; dimIdx++) {\n        var dim = dimensions[dimIdx];\n        var val = defaultDimValueGetters.arrayRows.call(this, values[sourceIdx] || emptyDataItem, dim.property, sourceIdx, dimIdx);\n        chunks[dimIdx][idx] = val;\n        var dimRawExtent = rawExtent[dimIdx];\n        val < dimRawExtent[0] && (dimRawExtent[0] = val);\n        val > dimRawExtent[1] && (dimRawExtent[1] = val);\n      }\n    }\n    this._rawCount = this._count = end;\n    return {\n      start: start,\n      end: end\n    };\n  };\n  DataStore.prototype._initDataFromProvider = function (start, end, append) {\n    var provider = this._provider;\n    var chunks = this._chunks;\n    var dimensions = this._dimensions;\n    var dimLen = dimensions.length;\n    var rawExtent = this._rawExtent;\n    var dimNames = map(dimensions, function (dim) {\n      return dim.property;\n    });\n    for (var i = 0; i < dimLen; i++) {\n      var dim = dimensions[i];\n      if (!rawExtent[i]) {\n        rawExtent[i] = getInitialExtent();\n      }\n      prepareStore(chunks, i, dim.type, end, append);\n    }\n    if (provider.fillStorage) {\n      provider.fillStorage(start, end, chunks, rawExtent);\n    } else {\n      var dataItem = [];\n      for (var idx = start; idx < end; idx++) {\n        // NOTICE: Try not to write things into dataItem\n        dataItem = provider.getItem(idx, dataItem);\n        // Each data item is value\n        // [1, 2]\n        // 2\n        // Bar chart, line chart which uses category axis\n        // only gives the 'y' value. 'x' value is the indices of category\n        // Use a tempValue to normalize the value to be a (x, y) value\n        // Store the data by dimensions\n        for (var dimIdx = 0; dimIdx < dimLen; dimIdx++) {\n          var dimStorage = chunks[dimIdx];\n          // PENDING NULL is empty or zero\n          var val = this._dimValueGetter(dataItem, dimNames[dimIdx], idx, dimIdx);\n          dimStorage[idx] = val;\n          var dimRawExtent = rawExtent[dimIdx];\n          val < dimRawExtent[0] && (dimRawExtent[0] = val);\n          val > dimRawExtent[1] && (dimRawExtent[1] = val);\n        }\n      }\n    }\n    if (!provider.persistent && provider.clean) {\n      // Clean unused data if data source is typed array.\n      provider.clean();\n    }\n    this._rawCount = this._count = end;\n    // Reset data extent\n    this._extent = [];\n  };\n  DataStore.prototype.count = function () {\n    return this._count;\n  };\n  /**\r\n   * Get value. Return NaN if idx is out of range.\r\n   */\n  DataStore.prototype.get = function (dim, idx) {\n    if (!(idx >= 0 && idx < this._count)) {\n      return NaN;\n    }\n    var dimStore = this._chunks[dim];\n    return dimStore ? dimStore[this.getRawIndex(idx)] : NaN;\n  };\n  DataStore.prototype.getValues = function (dimensions, idx) {\n    var values = [];\n    var dimArr = [];\n    if (idx == null) {\n      idx = dimensions;\n      // TODO get all from store?\n      dimensions = [];\n      // All dimensions\n      for (var i = 0; i < this._dimensions.length; i++) {\n        dimArr.push(i);\n      }\n    } else {\n      dimArr = dimensions;\n    }\n    for (var i = 0, len = dimArr.length; i < len; i++) {\n      values.push(this.get(dimArr[i], idx));\n    }\n    return values;\n  };\n  /**\r\n   * @param dim concrete dim\r\n   */\n  DataStore.prototype.getByRawIndex = function (dim, rawIdx) {\n    if (!(rawIdx >= 0 && rawIdx < this._rawCount)) {\n      return NaN;\n    }\n    var dimStore = this._chunks[dim];\n    return dimStore ? dimStore[rawIdx] : NaN;\n  };\n  /**\r\n   * Get sum of data in one dimension\r\n   */\n  DataStore.prototype.getSum = function (dim) {\n    var dimData = this._chunks[dim];\n    var sum = 0;\n    if (dimData) {\n      for (var i = 0, len = this.count(); i < len; i++) {\n        var value = this.get(dim, i);\n        if (!isNaN(value)) {\n          sum += value;\n        }\n      }\n    }\n    return sum;\n  };\n  /**\r\n   * Get median of data in one dimension\r\n   */\n  DataStore.prototype.getMedian = function (dim) {\n    var dimDataArray = [];\n    // map all data of one dimension\n    this.each([dim], function (val) {\n      if (!isNaN(val)) {\n        dimDataArray.push(val);\n      }\n    });\n    // TODO\n    // Use quick select?\n    var sortedDimDataArray = dimDataArray.sort(function (a, b) {\n      return a - b;\n    });\n    var len = this.count();\n    // calculate median\n    return len === 0 ? 0 : len % 2 === 1 ? sortedDimDataArray[(len - 1) / 2] : (sortedDimDataArray[len / 2] + sortedDimDataArray[len / 2 - 1]) / 2;\n  };\n  /**\r\n   * Retrieve the index with given raw data index.\r\n   */\n  DataStore.prototype.indexOfRawIndex = function (rawIndex) {\n    if (rawIndex >= this._rawCount || rawIndex < 0) {\n      return -1;\n    }\n    if (!this._indices) {\n      return rawIndex;\n    }\n    // Indices are ascending\n    var indices = this._indices;\n    // If rawIndex === dataIndex\n    var rawDataIndex = indices[rawIndex];\n    if (rawDataIndex != null && rawDataIndex < this._count && rawDataIndex === rawIndex) {\n      return rawIndex;\n    }\n    var left = 0;\n    var right = this._count - 1;\n    while (left <= right) {\n      var mid = (left + right) / 2 | 0;\n      if (indices[mid] < rawIndex) {\n        left = mid + 1;\n      } else if (indices[mid] > rawIndex) {\n        right = mid - 1;\n      } else {\n        return mid;\n      }\n    }\n    return -1;\n  };\n  /**\r\n   * Retrieve the index of nearest value.\r\n   * @param dim\r\n   * @param value\r\n   * @param [maxDistance=Infinity]\r\n   * @return If and only if multiple indices have\r\n   *         the same value, they are put to the result.\r\n   */\n  DataStore.prototype.indicesOfNearest = function (dim, value, maxDistance) {\n    var chunks = this._chunks;\n    var dimData = chunks[dim];\n    var nearestIndices = [];\n    if (!dimData) {\n      return nearestIndices;\n    }\n    if (maxDistance == null) {\n      maxDistance = Infinity;\n    }\n    var minDist = Infinity;\n    var minDiff = -1;\n    var nearestIndicesLen = 0;\n    // Check the test case of `test/ut/spec/data/SeriesData.js`.\n    for (var i = 0, len = this.count(); i < len; i++) {\n      var dataIndex = this.getRawIndex(i);\n      var diff = value - dimData[dataIndex];\n      var dist = Math.abs(diff);\n      if (dist <= maxDistance) {\n        // When the `value` is at the middle of `this.get(dim, i)` and `this.get(dim, i+1)`,\n        // we'd better not push both of them to `nearestIndices`, otherwise it is easy to\n        // get more than one item in `nearestIndices` (more specifically, in `tooltip`).\n        // So we choose the one that `diff >= 0` in this case.\n        // But if `this.get(dim, i)` and `this.get(dim, j)` get the same value, both of them\n        // should be push to `nearestIndices`.\n        if (dist < minDist || dist === minDist && diff >= 0 && minDiff < 0) {\n          minDist = dist;\n          minDiff = diff;\n          nearestIndicesLen = 0;\n        }\n        if (diff === minDiff) {\n          nearestIndices[nearestIndicesLen++] = i;\n        }\n      }\n    }\n    nearestIndices.length = nearestIndicesLen;\n    return nearestIndices;\n  };\n  DataStore.prototype.getIndices = function () {\n    var newIndices;\n    var indices = this._indices;\n    if (indices) {\n      var Ctor = indices.constructor;\n      var thisCount = this._count;\n      // `new Array(a, b, c)` is different from `new Uint32Array(a, b, c)`.\n      if (Ctor === Array) {\n        newIndices = new Ctor(thisCount);\n        for (var i = 0; i < thisCount; i++) {\n          newIndices[i] = indices[i];\n        }\n      } else {\n        newIndices = new Ctor(indices.buffer, 0, thisCount);\n      }\n    } else {\n      var Ctor = getIndicesCtor(this._rawCount);\n      newIndices = new Ctor(this.count());\n      for (var i = 0; i < newIndices.length; i++) {\n        newIndices[i] = i;\n      }\n    }\n    return newIndices;\n  };\n  /**\r\n   * Data filter.\r\n   */\n  DataStore.prototype.filter = function (dims, cb) {\n    if (!this._count) {\n      return this;\n    }\n    var newStore = this.clone();\n    var count = newStore.count();\n    var Ctor = getIndicesCtor(newStore._rawCount);\n    var newIndices = new Ctor(count);\n    var value = [];\n    var dimSize = dims.length;\n    var offset = 0;\n    var dim0 = dims[0];\n    var chunks = newStore._chunks;\n    for (var i = 0; i < count; i++) {\n      var keep = void 0;\n      var rawIdx = newStore.getRawIndex(i);\n      // Simple optimization\n      if (dimSize === 0) {\n        keep = cb(i);\n      } else if (dimSize === 1) {\n        var val = chunks[dim0][rawIdx];\n        keep = cb(val, i);\n      } else {\n        var k = 0;\n        for (; k < dimSize; k++) {\n          value[k] = chunks[dims[k]][rawIdx];\n        }\n        value[k] = i;\n        keep = cb.apply(null, value);\n      }\n      if (keep) {\n        newIndices[offset++] = rawIdx;\n      }\n    }\n    // Set indices after filtered.\n    if (offset < count) {\n      newStore._indices = newIndices;\n    }\n    newStore._count = offset;\n    // Reset data extent\n    newStore._extent = [];\n    newStore._updateGetRawIdx();\n    return newStore;\n  };\n  /**\r\n   * Select data in range. (For optimization of filter)\r\n   * (Manually inline code, support 5 million data filtering in data zoom.)\r\n   */\n  DataStore.prototype.selectRange = function (range) {\n    var newStore = this.clone();\n    var len = newStore._count;\n    if (!len) {\n      return this;\n    }\n    var dims = keys(range);\n    var dimSize = dims.length;\n    if (!dimSize) {\n      return this;\n    }\n    var originalCount = newStore.count();\n    var Ctor = getIndicesCtor(newStore._rawCount);\n    var newIndices = new Ctor(originalCount);\n    var offset = 0;\n    var dim0 = dims[0];\n    var min = range[dim0][0];\n    var max = range[dim0][1];\n    var storeArr = newStore._chunks;\n    var quickFinished = false;\n    if (!newStore._indices) {\n      // Extreme optimization for common case. About 2x faster in chrome.\n      var idx = 0;\n      if (dimSize === 1) {\n        var dimStorage = storeArr[dims[0]];\n        for (var i = 0; i < len; i++) {\n          var val = dimStorage[i];\n          // NaN will not be filtered. Consider the case, in line chart, empty\n          // value indicates the line should be broken. But for the case like\n          // scatter plot, a data item with empty value will not be rendered,\n          // but the axis extent may be effected if some other dim of the data\n          // item has value. Fortunately it is not a significant negative effect.\n          if (val >= min && val <= max || isNaN(val)) {\n            newIndices[offset++] = idx;\n          }\n          idx++;\n        }\n        quickFinished = true;\n      } else if (dimSize === 2) {\n        var dimStorage = storeArr[dims[0]];\n        var dimStorage2 = storeArr[dims[1]];\n        var min2 = range[dims[1]][0];\n        var max2 = range[dims[1]][1];\n        for (var i = 0; i < len; i++) {\n          var val = dimStorage[i];\n          var val2 = dimStorage2[i];\n          // Do not filter NaN, see comment above.\n          if ((val >= min && val <= max || isNaN(val)) && (val2 >= min2 && val2 <= max2 || isNaN(val2))) {\n            newIndices[offset++] = idx;\n          }\n          idx++;\n        }\n        quickFinished = true;\n      }\n    }\n    if (!quickFinished) {\n      if (dimSize === 1) {\n        for (var i = 0; i < originalCount; i++) {\n          var rawIndex = newStore.getRawIndex(i);\n          var val = storeArr[dims[0]][rawIndex];\n          // Do not filter NaN, see comment above.\n          if (val >= min && val <= max || isNaN(val)) {\n            newIndices[offset++] = rawIndex;\n          }\n        }\n      } else {\n        for (var i = 0; i < originalCount; i++) {\n          var keep = true;\n          var rawIndex = newStore.getRawIndex(i);\n          for (var k = 0; k < dimSize; k++) {\n            var dimk = dims[k];\n            var val = storeArr[dimk][rawIndex];\n            // Do not filter NaN, see comment above.\n            if (val < range[dimk][0] || val > range[dimk][1]) {\n              keep = false;\n            }\n          }\n          if (keep) {\n            newIndices[offset++] = newStore.getRawIndex(i);\n          }\n        }\n      }\n    }\n    // Set indices after filtered.\n    if (offset < originalCount) {\n      newStore._indices = newIndices;\n    }\n    newStore._count = offset;\n    // Reset data extent\n    newStore._extent = [];\n    newStore._updateGetRawIdx();\n    return newStore;\n  };\n  // /**\n  //  * Data mapping to a plain array\n  //  */\n  // mapArray(dims: DimensionIndex[], cb: MapArrayCb): any[] {\n  //     const result: any[] = [];\n  //     this.each(dims, function () {\n  //         result.push(cb && (cb as MapArrayCb).apply(null, arguments));\n  //     });\n  //     return result;\n  // }\n  /**\r\n   * Data mapping to a new List with given dimensions\r\n   */\n  DataStore.prototype.map = function (dims, cb) {\n    // TODO only clone picked chunks.\n    var target = this.clone(dims);\n    this._updateDims(target, dims, cb);\n    return target;\n  };\n  /**\r\n   * @caution Danger!! Only used in dataStack.\r\n   */\n  DataStore.prototype.modify = function (dims, cb) {\n    this._updateDims(this, dims, cb);\n  };\n  DataStore.prototype._updateDims = function (target, dims, cb) {\n    var targetChunks = target._chunks;\n    var tmpRetValue = [];\n    var dimSize = dims.length;\n    var dataCount = target.count();\n    var values = [];\n    var rawExtent = target._rawExtent;\n    for (var i = 0; i < dims.length; i++) {\n      rawExtent[dims[i]] = getInitialExtent();\n    }\n    for (var dataIndex = 0; dataIndex < dataCount; dataIndex++) {\n      var rawIndex = target.getRawIndex(dataIndex);\n      for (var k = 0; k < dimSize; k++) {\n        values[k] = targetChunks[dims[k]][rawIndex];\n      }\n      values[dimSize] = dataIndex;\n      var retValue = cb && cb.apply(null, values);\n      if (retValue != null) {\n        // a number or string (in oridinal dimension)?\n        if (typeof retValue !== 'object') {\n          tmpRetValue[0] = retValue;\n          retValue = tmpRetValue;\n        }\n        for (var i = 0; i < retValue.length; i++) {\n          var dim = dims[i];\n          var val = retValue[i];\n          var rawExtentOnDim = rawExtent[dim];\n          var dimStore = targetChunks[dim];\n          if (dimStore) {\n            dimStore[rawIndex] = val;\n          }\n          if (val < rawExtentOnDim[0]) {\n            rawExtentOnDim[0] = val;\n          }\n          if (val > rawExtentOnDim[1]) {\n            rawExtentOnDim[1] = val;\n          }\n        }\n      }\n    }\n  };\n  /**\r\n   * Large data down sampling using largest-triangle-three-buckets\r\n   * @param {string} valueDimension\r\n   * @param {number} targetCount\r\n   */\n  DataStore.prototype.lttbDownSample = function (valueDimension, rate) {\n    var target = this.clone([valueDimension], true);\n    var targetStorage = target._chunks;\n    var dimStore = targetStorage[valueDimension];\n    var len = this.count();\n    var sampledIndex = 0;\n    var frameSize = Math.floor(1 / rate);\n    var currentRawIndex = this.getRawIndex(0);\n    var maxArea;\n    var area;\n    var nextRawIndex;\n    var newIndices = new (getIndicesCtor(this._rawCount))(Math.min((Math.ceil(len / frameSize) + 2) * 2, len));\n    // First frame use the first data.\n    newIndices[sampledIndex++] = currentRawIndex;\n    for (var i = 1; i < len - 1; i += frameSize) {\n      var nextFrameStart = Math.min(i + frameSize, len - 1);\n      var nextFrameEnd = Math.min(i + frameSize * 2, len);\n      var avgX = (nextFrameEnd + nextFrameStart) / 2;\n      var avgY = 0;\n      for (var idx = nextFrameStart; idx < nextFrameEnd; idx++) {\n        var rawIndex = this.getRawIndex(idx);\n        var y = dimStore[rawIndex];\n        if (isNaN(y)) {\n          continue;\n        }\n        avgY += y;\n      }\n      avgY /= nextFrameEnd - nextFrameStart;\n      var frameStart = i;\n      var frameEnd = Math.min(i + frameSize, len);\n      var pointAX = i - 1;\n      var pointAY = dimStore[currentRawIndex];\n      maxArea = -1;\n      nextRawIndex = frameStart;\n      var firstNaNIndex = -1;\n      var countNaN = 0;\n      // Find a point from current frame that construct a triangle with largest area with previous selected point\n      // And the average of next frame.\n      for (var idx = frameStart; idx < frameEnd; idx++) {\n        var rawIndex = this.getRawIndex(idx);\n        var y = dimStore[rawIndex];\n        if (isNaN(y)) {\n          countNaN++;\n          if (firstNaNIndex < 0) {\n            firstNaNIndex = rawIndex;\n          }\n          continue;\n        }\n        // Calculate triangle area over three buckets\n        area = Math.abs((pointAX - avgX) * (y - pointAY) - (pointAX - idx) * (avgY - pointAY));\n        if (area > maxArea) {\n          maxArea = area;\n          nextRawIndex = rawIndex; // Next a is this b\n        }\n      }\n      if (countNaN > 0 && countNaN < frameEnd - frameStart) {\n        // Append first NaN point in every bucket.\n        // It is necessary to ensure the correct order of indices.\n        newIndices[sampledIndex++] = Math.min(firstNaNIndex, nextRawIndex);\n        nextRawIndex = Math.max(firstNaNIndex, nextRawIndex);\n      }\n      newIndices[sampledIndex++] = nextRawIndex;\n      currentRawIndex = nextRawIndex; // This a is the next a (chosen b)\n    }\n    // First frame use the last data.\n    newIndices[sampledIndex++] = this.getRawIndex(len - 1);\n    target._count = sampledIndex;\n    target._indices = newIndices;\n    target.getRawIndex = this._getRawIdx;\n    return target;\n  };\n  /**\r\n   * Large data down sampling using min-max\r\n   * @param {string} valueDimension\r\n   * @param {number} rate\r\n   */\n  DataStore.prototype.minmaxDownSample = function (valueDimension, rate) {\n    var target = this.clone([valueDimension], true);\n    var targetStorage = target._chunks;\n    var frameSize = Math.floor(1 / rate);\n    var dimStore = targetStorage[valueDimension];\n    var len = this.count();\n    // Each frame results in 2 data points, one for min and one for max\n    var newIndices = new (getIndicesCtor(this._rawCount))(Math.ceil(len / frameSize) * 2);\n    var offset = 0;\n    for (var i = 0; i < len; i += frameSize) {\n      var minIndex = i;\n      var minValue = dimStore[this.getRawIndex(minIndex)];\n      var maxIndex = i;\n      var maxValue = dimStore[this.getRawIndex(maxIndex)];\n      var thisFrameSize = frameSize;\n      // Handle final smaller frame\n      if (i + frameSize > len) {\n        thisFrameSize = len - i;\n      }\n      // Determine min and max within the current frame\n      for (var k = 0; k < thisFrameSize; k++) {\n        var rawIndex = this.getRawIndex(i + k);\n        var value = dimStore[rawIndex];\n        if (value < minValue) {\n          minValue = value;\n          minIndex = i + k;\n        }\n        if (value > maxValue) {\n          maxValue = value;\n          maxIndex = i + k;\n        }\n      }\n      var rawMinIndex = this.getRawIndex(minIndex);\n      var rawMaxIndex = this.getRawIndex(maxIndex);\n      // Set the order of the min and max values, based on their ordering in the frame\n      if (minIndex < maxIndex) {\n        newIndices[offset++] = rawMinIndex;\n        newIndices[offset++] = rawMaxIndex;\n      } else {\n        newIndices[offset++] = rawMaxIndex;\n        newIndices[offset++] = rawMinIndex;\n      }\n    }\n    target._count = offset;\n    target._indices = newIndices;\n    target._updateGetRawIdx();\n    return target;\n  };\n  /**\r\n   * Large data down sampling on given dimension\r\n   * @param sampleIndex Sample index for name and id\r\n   */\n  DataStore.prototype.downSample = function (dimension, rate, sampleValue, sampleIndex) {\n    var target = this.clone([dimension], true);\n    var targetStorage = target._chunks;\n    var frameValues = [];\n    var frameSize = Math.floor(1 / rate);\n    var dimStore = targetStorage[dimension];\n    var len = this.count();\n    var rawExtentOnDim = target._rawExtent[dimension] = getInitialExtent();\n    var newIndices = new (getIndicesCtor(this._rawCount))(Math.ceil(len / frameSize));\n    var offset = 0;\n    for (var i = 0; i < len; i += frameSize) {\n      // Last frame\n      if (frameSize > len - i) {\n        frameSize = len - i;\n        frameValues.length = frameSize;\n      }\n      for (var k = 0; k < frameSize; k++) {\n        var dataIdx = this.getRawIndex(i + k);\n        frameValues[k] = dimStore[dataIdx];\n      }\n      var value = sampleValue(frameValues);\n      var sampleFrameIdx = this.getRawIndex(Math.min(i + sampleIndex(frameValues, value) || 0, len - 1));\n      // Only write value on the filtered data\n      dimStore[sampleFrameIdx] = value;\n      if (value < rawExtentOnDim[0]) {\n        rawExtentOnDim[0] = value;\n      }\n      if (value > rawExtentOnDim[1]) {\n        rawExtentOnDim[1] = value;\n      }\n      newIndices[offset++] = sampleFrameIdx;\n    }\n    target._count = offset;\n    target._indices = newIndices;\n    target._updateGetRawIdx();\n    return target;\n  };\n  /**\r\n   * Data iteration\r\n   * @param ctx default this\r\n   * @example\r\n   *  list.each('x', function (x, idx) {});\r\n   *  list.each(['x', 'y'], function (x, y, idx) {});\r\n   *  list.each(function (idx) {})\r\n   */\n  DataStore.prototype.each = function (dims, cb) {\n    if (!this._count) {\n      return;\n    }\n    var dimSize = dims.length;\n    var chunks = this._chunks;\n    for (var i = 0, len = this.count(); i < len; i++) {\n      var rawIdx = this.getRawIndex(i);\n      // Simple optimization\n      switch (dimSize) {\n        case 0:\n          cb(i);\n          break;\n        case 1:\n          cb(chunks[dims[0]][rawIdx], i);\n          break;\n        case 2:\n          cb(chunks[dims[0]][rawIdx], chunks[dims[1]][rawIdx], i);\n          break;\n        default:\n          var k = 0;\n          var value = [];\n          for (; k < dimSize; k++) {\n            value[k] = chunks[dims[k]][rawIdx];\n          }\n          // Index\n          value[k] = i;\n          cb.apply(null, value);\n      }\n    }\n  };\n  /**\r\n   * Get extent of data in one dimension\r\n   */\n  DataStore.prototype.getDataExtent = function (dim) {\n    // Make sure use concrete dim as cache name.\n    var dimData = this._chunks[dim];\n    var initialExtent = getInitialExtent();\n    if (!dimData) {\n      return initialExtent;\n    }\n    // Make more strict checkings to ensure hitting cache.\n    var currEnd = this.count();\n    // Consider the most cases when using data zoom, `getDataExtent`\n    // happened before filtering. We cache raw extent, which is not\n    // necessary to be cleared and recalculated when restore data.\n    var useRaw = !this._indices;\n    var dimExtent;\n    if (useRaw) {\n      return this._rawExtent[dim].slice();\n    }\n    dimExtent = this._extent[dim];\n    if (dimExtent) {\n      return dimExtent.slice();\n    }\n    dimExtent = initialExtent;\n    var min = dimExtent[0];\n    var max = dimExtent[1];\n    for (var i = 0; i < currEnd; i++) {\n      var rawIdx = this.getRawIndex(i);\n      var value = dimData[rawIdx];\n      value < min && (min = value);\n      value > max && (max = value);\n    }\n    dimExtent = [min, max];\n    this._extent[dim] = dimExtent;\n    return dimExtent;\n  };\n  /**\r\n   * Get raw data item\r\n   */\n  DataStore.prototype.getRawDataItem = function (idx) {\n    var rawIdx = this.getRawIndex(idx);\n    if (!this._provider.persistent) {\n      var val = [];\n      var chunks = this._chunks;\n      for (var i = 0; i < chunks.length; i++) {\n        val.push(chunks[i][rawIdx]);\n      }\n      return val;\n    } else {\n      return this._provider.getItem(rawIdx);\n    }\n  };\n  /**\r\n   * Clone shallow.\r\n   *\r\n   * @param clonedDims Determine which dims to clone. Will share the data if not specified.\r\n   */\n  DataStore.prototype.clone = function (clonedDims, ignoreIndices) {\n    var target = new DataStore();\n    var chunks = this._chunks;\n    var clonedDimsMap = clonedDims && reduce(clonedDims, function (obj, dimIdx) {\n      obj[dimIdx] = true;\n      return obj;\n    }, {});\n    if (clonedDimsMap) {\n      for (var i = 0; i < chunks.length; i++) {\n        // Not clone if dim is not picked.\n        target._chunks[i] = !clonedDimsMap[i] ? chunks[i] : cloneChunk(chunks[i]);\n      }\n    } else {\n      target._chunks = chunks;\n    }\n    this._copyCommonProps(target);\n    if (!ignoreIndices) {\n      target._indices = this._cloneIndices();\n    }\n    target._updateGetRawIdx();\n    return target;\n  };\n  DataStore.prototype._copyCommonProps = function (target) {\n    target._count = this._count;\n    target._rawCount = this._rawCount;\n    target._provider = this._provider;\n    target._dimensions = this._dimensions;\n    target._extent = clone(this._extent);\n    target._rawExtent = clone(this._rawExtent);\n  };\n  DataStore.prototype._cloneIndices = function () {\n    if (this._indices) {\n      var Ctor = this._indices.constructor;\n      var indices = void 0;\n      if (Ctor === Array) {\n        var thisCount = this._indices.length;\n        indices = new Ctor(thisCount);\n        for (var i = 0; i < thisCount; i++) {\n          indices[i] = this._indices[i];\n        }\n      } else {\n        indices = new Ctor(this._indices);\n      }\n      return indices;\n    }\n    return null;\n  };\n  DataStore.prototype._getRawIdxIdentity = function (idx) {\n    return idx;\n  };\n  DataStore.prototype._getRawIdx = function (idx) {\n    if (idx < this._count && idx >= 0) {\n      return this._indices[idx];\n    }\n    return -1;\n  };\n  DataStore.prototype._updateGetRawIdx = function () {\n    this.getRawIndex = this._indices ? this._getRawIdx : this._getRawIdxIdentity;\n  };\n  DataStore.internalField = function () {\n    function getDimValueSimply(dataItem, property, dataIndex, dimIndex) {\n      return parseDataValue(dataItem[dimIndex], this._dimensions[dimIndex]);\n    }\n    defaultDimValueGetters = {\n      arrayRows: getDimValueSimply,\n      objectRows: function (dataItem, property, dataIndex, dimIndex) {\n        return parseDataValue(dataItem[property], this._dimensions[dimIndex]);\n      },\n      keyedColumns: getDimValueSimply,\n      original: function (dataItem, property, dataIndex, dimIndex) {\n        // Performance sensitive, do not use modelUtil.getDataItemValue.\n        // If dataItem is an plain object with no value field, the let `value`\n        // will be assigned with the object, but it will be tread correctly\n        // in the `convertValue`.\n        var value = dataItem && (dataItem.value == null ? dataItem : dataItem.value);\n        return parseDataValue(value instanceof Array ? value[dimIndex]\n        // If value is a single number or something else not array.\n        : value, this._dimensions[dimIndex]);\n      },\n      typedArray: function (dataItem, property, dataIndex, dimIndex) {\n        return dataItem[dimIndex];\n      }\n    };\n  }();\n  return DataStore;\n}();\nexport default DataStore;"],"names":["UNDEFINED","CtorUint32Array","CtorUint16Array","CtorInt32Array","CtorFloat64Array","dataCtors","defaultDimValueGetters","getIndicesCtor","rawCount","getInitialExtent","cloneChunk","originalChunk","Ctor","prepareStore","store","dimIdx","dimType","end","append","DataCtor","oldStore","oldLen","newStore","j","DataStore","createHashMap","provider","inputDimensions","dimValueGetter","assert","isFunction","source","defaultGetter","willRetrieveDataByName","shouldRetrieveDataByName","map","dim","dimName","type","calcDimNameToIdx","dimensions","calcDimIdx","ordinalMeta","chunk","rawExtents","offset","len","dimRawExtent","i","val","dimInfo","dimIndex","item","data","start","values","minFillLen","chunks","dimLen","rawExtent","emptyDataItem","idx","sourceIdx","dimNames","dataItem","dimStorage","dimStore","dimArr","rawIdx","dimData","sum","value","dimDataArray","sortedDimDataArray","a","b","rawIndex","indices","rawDataIndex","left","right","mid","maxDistance","nearestIndices","minDist","minDiff","nearestIndicesLen","dataIndex","diff","dist","newIndices","thisCount","dims","cb","count","dimSize","dim0","keep","k","range","keys","originalCount","min","max","storeArr","quickFinished","dimStorage2","min2","max2","val2","dimk","target","targetChunks","tmpRetValue","dataCount","retValue","rawExtentOnDim","valueDimension","rate","targetStorage","sampledIndex","frameSize","currentRawIndex","maxArea","area","nextRawIndex","nextFrameStart","nextFrameEnd","avgX","avgY","y","frameStart","frameEnd","pointAX","pointAY","firstNaNIndex","countNaN","minIndex","minValue","maxIndex","maxValue","thisFrameSize","rawMinIndex","rawMaxIndex","dimension","sampleValue","sampleIndex","frameValues","dataIdx","sampleFrameIdx","initialExtent","currEnd","useRaw","dimExtent","clonedDims","ignoreIndices","clonedDimsMap","reduce","obj","clone","getDimValueSimply","property","parseDataValue"],"mappings":";;;AA8CA,IAAIA,IAAY,aAILC,IAAkB,OAAO,gBAAgBD,IAAY,QAAQ,aAC7DE,IAAkB,OAAO,gBAAgBF,IAAY,QAAQ,aAC7DG,IAAiB,OAAO,eAAeH,IAAY,QAAQ,YAC3DI,IAAmB,OAAO,iBAAiBJ,IAAY,QAAQ,cAItEK,IAAY;AAAA,EACd,OAASD;AAAA,EACT,KAAOD;AAAA;AAAA,EAEP,SAAW;AAAA,EACX,QAAU;AAAA,EACV,MAAQC;AACV,GACIE;AACJ,SAASC,EAAeC,GAAU;AAEhC,SAAOA,IAAW,QAAQP,IAAkBC;AAC9C;AAEA,SAASO,IAAmB;AAC1B,SAAO,CAAC,OAAU,MAAS;AAC7B;AAEA,SAASC,EAAWC,GAAe;AACjC,MAAIC,IAAOD,EAAc;AAEzB,SAAOC,MAAS,QAAQD,EAAc,MAAK,IAAK,IAAIC,EAAKD,CAAa;AACxE;AACA,SAASE,EAAaC,GAAOC,GAAQC,GAASC,GAAKC,GAAQ;AACzD,MAAIC,IAAWd,EAAUW,KAAW,OAAO;AAC3C,MAAIE,GAAQ;AACV,QAAIE,IAAWN,EAAMC,CAAM,GACvBM,IAASD,KAAYA,EAAS;AAClC,QAAMC,MAAWJ,GAAM;AAIrB,eAHIK,IAAW,IAAIH,EAASF,CAAG,GAGtBM,IAAI,GAAGA,IAAIF,GAAQE;AAC1B,QAAAD,EAASC,CAAC,IAAIH,EAASG,CAAC;AAE1B,MAAAT,EAAMC,CAAM,IAAIO;AAAA,IAClB;AAAA,EACF;AACE,IAAAR,EAAMC,CAAM,IAAI,IAAII,EAASF,CAAG;AAEpC;AAKG,IAACO;AAAA;AAAA,GAAyB,WAAY;AACvC,aAASA,IAAY;AACnB,WAAK,UAAU,CAAA,GAEf,KAAK,aAAa,CAAA,GAClB,KAAK,UAAU,CAAA,GACf,KAAK,SAAS,GACd,KAAK,YAAY,GACjB,KAAK,oBAAoBC,EAAa;AAAA,IACxC;AAIA,WAAAD,EAAU,UAAU,WAAW,SAAUE,GAAUC,GAAiBC,GAAgB;AAClF,MAAI,QAAQ,IAAI,aAAa,gBAC3BC,EAAOC,EAAWJ,EAAS,OAAO,KAAKI,EAAWJ,EAAS,KAAK,GAAG,wBAAwB,GAE7F,KAAK,YAAYA,GAEjB,KAAK,UAAU,CAAA,GACf,KAAK,WAAW,MAChB,KAAK,cAAc,KAAK;AACxB,UAAIK,IAASL,EAAS,UAAS,GAC3BM,IAAgB,KAAK,wBAAwB1B,EAAuByB,EAAO,YAAY;AAE3F,WAAK,kBAAkBH,KAAkBI,GAEzC,KAAK,aAAa,CAAA;AAClB,UAAIC,IAAyBC,EAAyBH,CAAM;AAC5D,WAAK,cAAcI,EAAIR,GAAiB,SAAUS,GAAK;AACrD,eAAI,QAAQ,IAAI,aAAa,gBACvBH,KACFJ,EAAOO,EAAI,YAAY,IAAI,GAGxB;AAAA;AAAA,UAEL,MAAMA,EAAI;AAAA,UACV,UAAUA,EAAI;AAAA,QACtB;AAAA,MACI,CAAC,GACD,KAAK,sBAAsB,GAAGV,EAAS,MAAK,CAAE;AAAA,IAChD,GACAF,EAAU,UAAU,cAAc,WAAY;AAC5C,aAAO,KAAK;AAAA,IACd,GAQAA,EAAU,UAAU,YAAY,WAAY;AAC1C,aAAO,KAAK,UAAU,UAAS;AAAA,IACjC,GAIAA,EAAU,UAAU,6BAA6B,SAAUa,GAASC,GAAM;AACxE,UAAIC,IAAmB,KAAK,mBACxBC,IAAa,KAAK,aAClBC,IAAaF,EAAiB,IAAIF,CAAO;AAC7C,UAAII,KAAc;AAChB,YAAID,EAAWC,CAAU,EAAE,SAASH;AAClC,iBAAOG;AAAA;AAGT,QAAAA,IAAaD,EAAW;AAE1B,aAAAA,EAAWC,CAAU,IAAI;AAAA,QACvB,MAAMH;AAAA,MACZ,GACIC,EAAiB,IAAIF,GAASI,CAAU,GACxC,KAAK,QAAQA,CAAU,IAAI,IAAIpC,EAAUiC,KAAQ,OAAO,EAAE,KAAK,SAAS,GACxE,KAAK,WAAWG,CAAU,IAAIhC,EAAgB,GACvCgC;AAAA,IACT,GACAjB,EAAU,UAAU,qBAAqB,SAAUT,GAAQ2B,GAAa;AACtE,UAAIC,IAAQ,KAAK,QAAQ5B,CAAM,GAC3BqB,IAAM,KAAK,YAAYrB,CAAM,GAC7B6B,IAAa,KAAK,YAClBC,IAAST,EAAI,iBAAiB,GAC9BU,IAAMH,EAAM;AAChB,MAAIE,MAAW,MAGbD,EAAW7B,CAAM,IAAIN,EAAgB;AAIvC,eAFIsC,IAAeH,EAAW7B,CAAM,GAE3BiC,IAAIH,GAAQG,IAAIF,GAAKE,KAAK;AACjC,YAAIC,IAAMN,EAAMK,CAAC,IAAIN,EAAY,gBAAgBC,EAAMK,CAAC,CAAC;AACzD,QAAK,MAAMC,CAAG,MACZF,EAAa,CAAC,IAAI,KAAK,IAAIE,GAAKF,EAAa,CAAC,CAAC,GAC/CA,EAAa,CAAC,IAAI,KAAK,IAAIE,GAAKF,EAAa,CAAC,CAAC;AAAA,MAEnD;AACA,MAAAX,EAAI,cAAcM,GAClBN,EAAI,gBAAgBU,GACpBV,EAAI,OAAO;AAAA,IACb,GACAZ,EAAU,UAAU,iBAAiB,SAAUT,GAAQ;AACrD,UAAImC,IAAU,KAAK,YAAYnC,CAAM,GACjC2B,IAAcQ,EAAQ;AAC1B,aAAOR;AAAA,IACT,GACAlB,EAAU,UAAU,uBAAuB,SAAU2B,GAAU;AAC7D,UAAIC,IAAO,KAAK,YAAYD,CAAQ;AACpC,aAAOC,KAAQA,EAAK;AAAA,IACtB,GAIA5B,EAAU,UAAU,aAAa,SAAU6B,GAAM;AAC/C,MAAI,QAAQ,IAAI,aAAa,gBAC3BxB,EAAO,CAAC,KAAK,UAAU,4CAA4C;AAErE,UAAIH,IAAW,KAAK,WAChB4B,IAAQ,KAAK,MAAK;AACtB,MAAA5B,EAAS,WAAW2B,CAAI;AACxB,UAAIpC,IAAMS,EAAS,MAAK;AACxB,aAAKA,EAAS,eACZT,KAAOqC,IAELA,IAAQrC,KACV,KAAK,sBAAsBqC,GAAOrC,GAAK,EAAI,GAEtC,CAACqC,GAAOrC,CAAG;AAAA,IACpB,GACAO,EAAU,UAAU,eAAe,SAAU+B,GAAQC,GAAY;AAO/D,eANIC,IAAS,KAAK,SACdjB,IAAa,KAAK,aAClBkB,IAASlB,EAAW,QACpBmB,IAAY,KAAK,YACjBL,IAAQ,KAAK,MAAK,GAClBrC,IAAMqC,IAAQ,KAAK,IAAIC,EAAO,QAAQC,KAAc,CAAC,GAChDR,IAAI,GAAGA,IAAIU,GAAQV,KAAK;AAC/B,YAAIZ,IAAMI,EAAWQ,CAAC;AACtB,QAAAnC,EAAa4C,GAAQT,GAAGZ,EAAI,MAAMnB,GAAK,EAAI;AAAA,MAC7C;AAEA,eADI2C,IAAgB,CAAA,GACXC,IAAMP,GAAOO,IAAM5C,GAAK4C;AAG/B,iBAFIC,IAAYD,IAAMP,GAEbvC,IAAS,GAAGA,IAAS2C,GAAQ3C,KAAU;AAC9C,cAAIqB,IAAMI,EAAWzB,CAAM,GACvBkC,IAAM3C,EAAuB,UAAU,KAAK,MAAMiD,EAAOO,CAAS,KAAKF,GAAexB,EAAI,UAAU0B,GAAW/C,CAAM;AACzH,UAAA0C,EAAO1C,CAAM,EAAE8C,CAAG,IAAIZ;AACtB,cAAIF,IAAeY,EAAU5C,CAAM;AACnC,UAAAkC,IAAMF,EAAa,CAAC,MAAMA,EAAa,CAAC,IAAIE,IAC5CA,IAAMF,EAAa,CAAC,MAAMA,EAAa,CAAC,IAAIE;AAAA,QAC9C;AAEF,kBAAK,YAAY,KAAK,SAAShC,GACxB;AAAA,QACL,OAAOqC;AAAA,QACP,KAAKrC;AAAA,MACX;AAAA,IACE,GACAO,EAAU,UAAU,wBAAwB,SAAU8B,GAAOrC,GAAKC,GAAQ;AASxE,eARIQ,IAAW,KAAK,WAChB+B,IAAS,KAAK,SACdjB,IAAa,KAAK,aAClBkB,IAASlB,EAAW,QACpBmB,IAAY,KAAK,YACjBI,IAAW5B,EAAIK,GAAY,SAAUJ,GAAK;AAC5C,eAAOA,EAAI;AAAA,MACb,CAAC,GACQY,IAAI,GAAGA,IAAIU,GAAQV,KAAK;AAC/B,YAAIZ,IAAMI,EAAWQ,CAAC;AACtB,QAAKW,EAAUX,CAAC,MACdW,EAAUX,CAAC,IAAIvC,EAAgB,IAEjCI,EAAa4C,GAAQT,GAAGZ,EAAI,MAAMnB,GAAKC,CAAM;AAAA,MAC/C;AACA,UAAIQ,EAAS;AACX,QAAAA,EAAS,YAAY4B,GAAOrC,GAAKwC,GAAQE,CAAS;AAAA;AAGlD,iBADIK,IAAW,CAAA,GACNH,IAAMP,GAAOO,IAAM5C,GAAK4C,KAAO;AAEtC,UAAAG,IAAWtC,EAAS,QAAQmC,GAAKG,CAAQ;AAQzC,mBAASjD,IAAS,GAAGA,IAAS2C,GAAQ3C,KAAU;AAC9C,gBAAIkD,IAAaR,EAAO1C,CAAM,GAE1BkC,IAAM,KAAK,gBAAgBe,GAAUD,EAAShD,CAAM,GAAG8C,GAAK9C,CAAM;AACtE,YAAAkD,EAAWJ,CAAG,IAAIZ;AAClB,gBAAIF,IAAeY,EAAU5C,CAAM;AACnC,YAAAkC,IAAMF,EAAa,CAAC,MAAMA,EAAa,CAAC,IAAIE,IAC5CA,IAAMF,EAAa,CAAC,MAAMA,EAAa,CAAC,IAAIE;AAAA,UAC9C;AAAA,QACF;AAEF,MAAI,CAACvB,EAAS,cAAcA,EAAS,SAEnCA,EAAS,MAAK,GAEhB,KAAK,YAAY,KAAK,SAAST,GAE/B,KAAK,UAAU,CAAA;AAAA,IACjB,GACAO,EAAU,UAAU,QAAQ,WAAY;AACtC,aAAO,KAAK;AAAA,IACd,GAIAA,EAAU,UAAU,MAAM,SAAUY,GAAKyB,GAAK;AAC5C,UAAI,EAAEA,KAAO,KAAKA,IAAM,KAAK;AAC3B,eAAO;AAET,UAAIK,IAAW,KAAK,QAAQ9B,CAAG;AAC/B,aAAO8B,IAAWA,EAAS,KAAK,YAAYL,CAAG,CAAC,IAAI;AAAA,IACtD,GACArC,EAAU,UAAU,YAAY,SAAUgB,GAAYqB,GAAK;AACzD,UAAIN,IAAS,CAAA,GACTY,IAAS,CAAA;AACb,UAAIN,KAAO,MAAM;AACf,QAAAA,IAAMrB,GAENA,IAAa,CAAA;AAEb,iBAASQ,IAAI,GAAGA,IAAI,KAAK,YAAY,QAAQA;AAC3C,UAAAmB,EAAO,KAAKnB,CAAC;AAAA,MAEjB;AACE,QAAAmB,IAAS3B;AAEX,eAASQ,IAAI,GAAGF,IAAMqB,EAAO,QAAQnB,IAAIF,GAAKE;AAC5C,QAAAO,EAAO,KAAK,KAAK,IAAIY,EAAOnB,CAAC,GAAGa,CAAG,CAAC;AAEtC,aAAON;AAAA,IACT,GAIA/B,EAAU,UAAU,gBAAgB,SAAUY,GAAKgC,GAAQ;AACzD,UAAI,EAAEA,KAAU,KAAKA,IAAS,KAAK;AACjC,eAAO;AAET,UAAIF,IAAW,KAAK,QAAQ9B,CAAG;AAC/B,aAAO8B,IAAWA,EAASE,CAAM,IAAI;AAAA,IACvC,GAIA5C,EAAU,UAAU,SAAS,SAAUY,GAAK;AAC1C,UAAIiC,IAAU,KAAK,QAAQjC,CAAG,GAC1BkC,IAAM;AACV,UAAID;AACF,iBAASrB,IAAI,GAAGF,IAAM,KAAK,MAAK,GAAIE,IAAIF,GAAKE,KAAK;AAChD,cAAIuB,IAAQ,KAAK,IAAInC,GAAKY,CAAC;AAC3B,UAAK,MAAMuB,CAAK,MACdD,KAAOC;AAAA,QAEX;AAEF,aAAOD;AAAA,IACT,GAIA9C,EAAU,UAAU,YAAY,SAAUY,GAAK;AAC7C,UAAIoC,IAAe,CAAA;AAEnB,WAAK,KAAK,CAACpC,CAAG,GAAG,SAAUa,GAAK;AAC9B,QAAK,MAAMA,CAAG,KACZuB,EAAa,KAAKvB,CAAG;AAAA,MAEzB,CAAC;AAGD,UAAIwB,IAAqBD,EAAa,KAAK,SAAUE,GAAGC,GAAG;AACzD,eAAOD,IAAIC;AAAA,MACb,CAAC,GACG7B,IAAM,KAAK,MAAK;AAEpB,aAAOA,MAAQ,IAAI,IAAIA,IAAM,MAAM,IAAI2B,GAAoB3B,IAAM,KAAK,CAAC,KAAK2B,EAAmB3B,IAAM,CAAC,IAAI2B,EAAmB3B,IAAM,IAAI,CAAC,KAAK;AAAA,IAC/I,GAIAtB,EAAU,UAAU,kBAAkB,SAAUoD,GAAU;AACxD,UAAIA,KAAY,KAAK,aAAaA,IAAW;AAC3C,eAAO;AAET,UAAI,CAAC,KAAK;AACR,eAAOA;AAGT,UAAIC,IAAU,KAAK,UAEfC,IAAeD,EAAQD,CAAQ;AACnC,UAAIE,KAAgB,QAAQA,IAAe,KAAK,UAAUA,MAAiBF;AACzE,eAAOA;AAIT,eAFIG,IAAO,GACPC,IAAQ,KAAK,SAAS,GACnBD,KAAQC,KAAO;AACpB,YAAIC,KAAOF,IAAOC,KAAS,IAAI;AAC/B,YAAIH,EAAQI,CAAG,IAAIL;AACjB,UAAAG,IAAOE,IAAM;AAAA,iBACJJ,EAAQI,CAAG,IAAIL;AACxB,UAAAI,IAAQC,IAAM;AAAA;AAEd,iBAAOA;AAAA,MAEX;AACA,aAAO;AAAA,IACT,GASAzD,EAAU,UAAU,mBAAmB,SAAUY,GAAKmC,GAAOW,GAAa;AACxE,UAAIzB,IAAS,KAAK,SACdY,IAAUZ,EAAOrB,CAAG,GACpB+C,IAAiB,CAAA;AACrB,UAAI,CAACd;AACH,eAAOc;AAET,MAAID,KAAe,SACjBA,IAAc;AAMhB,eAJIE,IAAU,OACVC,IAAU,IACVC,IAAoB,GAEftC,IAAI,GAAGF,IAAM,KAAK,MAAK,GAAIE,IAAIF,GAAKE,KAAK;AAChD,YAAIuC,IAAY,KAAK,YAAYvC,CAAC,GAC9BwC,IAAOjB,IAAQF,EAAQkB,CAAS,GAChCE,IAAO,KAAK,IAAID,CAAI;AACxB,QAAIC,KAAQP,OAONO,IAAOL,KAAWK,MAASL,KAAWI,KAAQ,KAAKH,IAAU,OAC/DD,IAAUK,GACVJ,IAAUG,GACVF,IAAoB,IAElBE,MAASH,MACXF,EAAeG,GAAmB,IAAItC;AAAA,MAG5C;AACA,aAAAmC,EAAe,SAASG,GACjBH;AAAA,IACT,GACA3D,EAAU,UAAU,aAAa,WAAY;AAC3C,UAAIkE,GACAb,IAAU,KAAK;AACnB,UAAIA,GAAS;AACX,YAAIjE,IAAOiE,EAAQ,aACfc,IAAY,KAAK;AAErB,YAAI/E,MAAS,OAAO;AAClB,UAAA8E,IAAa,IAAI9E,EAAK+E,CAAS;AAC/B,mBAAS3C,IAAI,GAAGA,IAAI2C,GAAW3C;AAC7B,YAAA0C,EAAW1C,CAAC,IAAI6B,EAAQ7B,CAAC;AAAA,QAE7B;AACE,UAAA0C,IAAa,IAAI9E,EAAKiE,EAAQ,QAAQ,GAAGc,CAAS;AAAA,MAEtD,OAAO;AACL,YAAI/E,IAAOL,EAAe,KAAK,SAAS;AACxC,QAAAmF,IAAa,IAAI9E,EAAK,KAAK,MAAK,CAAE;AAClC,iBAASoC,IAAI,GAAGA,IAAI0C,EAAW,QAAQ1C;AACrC,UAAA0C,EAAW1C,CAAC,IAAIA;AAAA,MAEpB;AACA,aAAO0C;AAAA,IACT,GAIAlE,EAAU,UAAU,SAAS,SAAUoE,GAAMC,GAAI;AAC/C,UAAI,CAAC,KAAK;AACR,eAAO;AAWT,eATIvE,IAAW,KAAK,MAAK,GACrBwE,IAAQxE,EAAS,MAAK,GACtBV,IAAOL,EAAee,EAAS,SAAS,GACxCoE,IAAa,IAAI9E,EAAKkF,CAAK,GAC3BvB,IAAQ,CAAA,GACRwB,IAAUH,EAAK,QACf/C,IAAS,GACTmD,IAAOJ,EAAK,CAAC,GACbnC,IAASnC,EAAS,SACb0B,IAAI,GAAGA,IAAI8C,GAAO9C,KAAK;AAC9B,YAAIiD,IAAO,QACP7B,IAAS9C,EAAS,YAAY0B,CAAC;AAEnC,YAAI+C,MAAY;AACd,UAAAE,IAAOJ,EAAG7C,CAAC;AAAA,iBACF+C,MAAY,GAAG;AACxB,cAAI9C,IAAMQ,EAAOuC,CAAI,EAAE5B,CAAM;AAC7B,UAAA6B,IAAOJ,EAAG5C,GAAKD,CAAC;AAAA,QAClB,OAAO;AAEL,mBADIkD,IAAI,GACDA,IAAIH,GAASG;AAClB,YAAA3B,EAAM2B,CAAC,IAAIzC,EAAOmC,EAAKM,CAAC,CAAC,EAAE9B,CAAM;AAEnC,UAAAG,EAAM2B,CAAC,IAAIlD,GACXiD,IAAOJ,EAAG,MAAM,MAAMtB,CAAK;AAAA,QAC7B;AACA,QAAI0B,MACFP,EAAW7C,GAAQ,IAAIuB;AAAA,MAE3B;AAEA,aAAIvB,IAASiD,MACXxE,EAAS,WAAWoE,IAEtBpE,EAAS,SAASuB,GAElBvB,EAAS,UAAU,CAAA,GACnBA,EAAS,iBAAgB,GAClBA;AAAA,IACT,GAKAE,EAAU,UAAU,cAAc,SAAU2E,GAAO;AACjD,UAAI7E,IAAW,KAAK,MAAK,GACrBwB,IAAMxB,EAAS;AACnB,UAAI,CAACwB;AACH,eAAO;AAET,UAAI8C,IAAOQ,EAAKD,CAAK,GACjBJ,IAAUH,EAAK;AACnB,UAAI,CAACG;AACH,eAAO;AAET,UAAIM,IAAgB/E,EAAS,MAAK,GAC9BV,IAAOL,EAAee,EAAS,SAAS,GACxCoE,IAAa,IAAI9E,EAAKyF,CAAa,GACnCxD,IAAS,GACTmD,IAAOJ,EAAK,CAAC,GACbU,IAAMH,EAAMH,CAAI,EAAE,CAAC,GACnBO,IAAMJ,EAAMH,CAAI,EAAE,CAAC,GACnBQ,IAAWlF,EAAS,SACpBmF,IAAgB;AACpB,UAAI,CAACnF,EAAS,UAAU;AAEtB,YAAIuC,IAAM;AACV,YAAIkC,MAAY,GAAG;AAEjB,mBADI9B,IAAauC,EAASZ,EAAK,CAAC,CAAC,GACxB5C,IAAI,GAAGA,IAAIF,GAAKE,KAAK;AAC5B,gBAAIC,IAAMgB,EAAWjB,CAAC;AAMtB,aAAIC,KAAOqD,KAAOrD,KAAOsD,KAAO,MAAMtD,CAAG,OACvCyC,EAAW7C,GAAQ,IAAIgB,IAEzBA;AAAA,UACF;AACA,UAAA4C,IAAgB;AAAA,QAClB,WAAWV,MAAY,GAAG;AAKxB,mBAJI9B,IAAauC,EAASZ,EAAK,CAAC,CAAC,GAC7Bc,IAAcF,EAASZ,EAAK,CAAC,CAAC,GAC9Be,IAAOR,EAAMP,EAAK,CAAC,CAAC,EAAE,CAAC,GACvBgB,IAAOT,EAAMP,EAAK,CAAC,CAAC,EAAE,CAAC,GAClB5C,IAAI,GAAGA,IAAIF,GAAKE,KAAK;AAC5B,gBAAIC,IAAMgB,EAAWjB,CAAC,GAClB6D,IAAOH,EAAY1D,CAAC;AAExB,aAAKC,KAAOqD,KAAOrD,KAAOsD,KAAO,MAAMtD,CAAG,OAAO4D,KAAQF,KAAQE,KAAQD,KAAQ,MAAMC,CAAI,OACzFnB,EAAW7C,GAAQ,IAAIgB,IAEzBA;AAAA,UACF;AACA,UAAA4C,IAAgB;AAAA,QAClB;AAAA,MACF;AACA,UAAI,CAACA;AACH,YAAIV,MAAY;AACd,mBAAS/C,IAAI,GAAGA,IAAIqD,GAAerD,KAAK;AACtC,gBAAI4B,IAAWtD,EAAS,YAAY0B,CAAC,GACjCC,IAAMuD,EAASZ,EAAK,CAAC,CAAC,EAAEhB,CAAQ;AAEpC,aAAI3B,KAAOqD,KAAOrD,KAAOsD,KAAO,MAAMtD,CAAG,OACvCyC,EAAW7C,GAAQ,IAAI+B;AAAA,UAE3B;AAAA;AAEA,mBAAS5B,IAAI,GAAGA,IAAIqD,GAAerD,KAAK;AAGtC,qBAFIiD,IAAO,IACPrB,IAAWtD,EAAS,YAAY0B,CAAC,GAC5BkD,IAAI,GAAGA,IAAIH,GAASG,KAAK;AAChC,kBAAIY,IAAOlB,EAAKM,CAAC,GACbjD,IAAMuD,EAASM,CAAI,EAAElC,CAAQ;AAEjC,eAAI3B,IAAMkD,EAAMW,CAAI,EAAE,CAAC,KAAK7D,IAAMkD,EAAMW,CAAI,EAAE,CAAC,OAC7Cb,IAAO;AAAA,YAEX;AACA,YAAIA,MACFP,EAAW7C,GAAQ,IAAIvB,EAAS,YAAY0B,CAAC;AAAA,UAEjD;AAIJ,aAAIH,IAASwD,MACX/E,EAAS,WAAWoE,IAEtBpE,EAAS,SAASuB,GAElBvB,EAAS,UAAU,CAAA,GACnBA,EAAS,iBAAgB,GAClBA;AAAA,IACT,GAcAE,EAAU,UAAU,MAAM,SAAUoE,GAAMC,GAAI;AAE5C,UAAIkB,IAAS,KAAK,MAAMnB,CAAI;AAC5B,kBAAK,YAAYmB,GAAQnB,GAAMC,CAAE,GAC1BkB;AAAA,IACT,GAIAvF,EAAU,UAAU,SAAS,SAAUoE,GAAMC,GAAI;AAC/C,WAAK,YAAY,MAAMD,GAAMC,CAAE;AAAA,IACjC,GACArE,EAAU,UAAU,cAAc,SAAUuF,GAAQnB,GAAMC,GAAI;AAO5D,eANImB,IAAeD,EAAO,SACtBE,IAAc,CAAA,GACdlB,IAAUH,EAAK,QACfsB,IAAYH,EAAO,MAAK,GACxBxD,IAAS,CAAA,GACTI,IAAYoD,EAAO,YACd/D,IAAI,GAAGA,IAAI4C,EAAK,QAAQ5C;AAC/B,QAAAW,EAAUiC,EAAK5C,CAAC,CAAC,IAAIvC,EAAgB;AAEvC,eAAS8E,IAAY,GAAGA,IAAY2B,GAAW3B,KAAa;AAE1D,iBADIX,IAAWmC,EAAO,YAAYxB,CAAS,GAClCW,IAAI,GAAGA,IAAIH,GAASG;AAC3B,UAAA3C,EAAO2C,CAAC,IAAIc,EAAapB,EAAKM,CAAC,CAAC,EAAEtB,CAAQ;AAE5C,QAAArB,EAAOwC,CAAO,IAAIR;AAClB,YAAI4B,IAAWtB,KAAMA,EAAG,MAAM,MAAMtC,CAAM;AAC1C,YAAI4D,KAAY,MAAM;AAEpB,UAAI,OAAOA,KAAa,aACtBF,EAAY,CAAC,IAAIE,GACjBA,IAAWF;AAEb,mBAASjE,IAAI,GAAGA,IAAImE,EAAS,QAAQnE,KAAK;AACxC,gBAAIZ,IAAMwD,EAAK5C,CAAC,GACZC,IAAMkE,EAASnE,CAAC,GAChBoE,IAAiBzD,EAAUvB,CAAG,GAC9B8B,IAAW8C,EAAa5E,CAAG;AAC/B,YAAI8B,MACFA,EAASU,CAAQ,IAAI3B,IAEnBA,IAAMmE,EAAe,CAAC,MACxBA,EAAe,CAAC,IAAInE,IAElBA,IAAMmE,EAAe,CAAC,MACxBA,EAAe,CAAC,IAAInE;AAAA,UAExB;AAAA,QACF;AAAA,MACF;AAAA,IACF,GAMAzB,EAAU,UAAU,iBAAiB,SAAU6F,GAAgBC,GAAM;AACnE,UAAIP,IAAS,KAAK,MAAM,CAACM,CAAc,GAAG,EAAI,GAC1CE,IAAgBR,EAAO,SACvB7C,IAAWqD,EAAcF,CAAc,GACvCvE,IAAM,KAAK,MAAK,GAChB0E,IAAe,GACfC,IAAY,KAAK,MAAM,IAAIH,CAAI,GAC/BI,IAAkB,KAAK,YAAY,CAAC,GACpCC,GACAC,GACAC,GACAnC,IAAa,KAAKnF,EAAe,KAAK,SAAS,GAAG,KAAK,KAAK,KAAK,KAAKuC,IAAM2E,CAAS,IAAI,KAAK,GAAG3E,CAAG,CAAC;AAEzG,MAAA4C,EAAW8B,GAAc,IAAIE;AAC7B,eAAS1E,IAAI,GAAGA,IAAIF,IAAM,GAAGE,KAAKyE,GAAW;AAK3C,iBAJIK,IAAiB,KAAK,IAAI9E,IAAIyE,GAAW3E,IAAM,CAAC,GAChDiF,IAAe,KAAK,IAAI/E,IAAIyE,IAAY,GAAG3E,CAAG,GAC9CkF,KAAQD,IAAeD,KAAkB,GACzCG,IAAO,GACFpE,IAAMiE,GAAgBjE,IAAMkE,GAAclE,KAAO;AACxD,cAAIe,IAAW,KAAK,YAAYf,CAAG,GAC/BqE,IAAIhE,EAASU,CAAQ;AACzB,UAAI,MAAMsD,CAAC,MAGXD,KAAQC;AAAA,QACV;AACA,QAAAD,KAAQF,IAAeD;AACvB,YAAIK,IAAanF,GACboF,IAAW,KAAK,IAAIpF,IAAIyE,GAAW3E,CAAG,GACtCuF,IAAUrF,IAAI,GACdsF,IAAUpE,EAASwD,CAAe;AACtC,QAAAC,IAAU,IACVE,IAAeM;AAKf,iBAJII,IAAgB,IAChBC,IAAW,GAGN3E,IAAMsE,GAAYtE,IAAMuE,GAAUvE,KAAO;AAChD,cAAIe,IAAW,KAAK,YAAYf,CAAG,GAC/BqE,IAAIhE,EAASU,CAAQ;AACzB,cAAI,MAAMsD,CAAC,GAAG;AACZ,YAAAM,KACID,IAAgB,MAClBA,IAAgB3D;AAElB;AAAA,UACF;AAEA,UAAAgD,IAAO,KAAK,KAAKS,IAAUL,MAASE,IAAII,MAAYD,IAAUxE,MAAQoE,IAAOK,EAAQ,GACjFV,IAAOD,MACTA,IAAUC,GACVC,IAAejD;AAAA,QAEnB;AACA,QAAI4D,IAAW,KAAKA,IAAWJ,IAAWD,MAGxCzC,EAAW8B,GAAc,IAAI,KAAK,IAAIe,GAAeV,CAAY,GACjEA,IAAe,KAAK,IAAIU,GAAeV,CAAY,IAErDnC,EAAW8B,GAAc,IAAIK,GAC7BH,IAAkBG;AAAA,MACpB;AAEA,aAAAnC,EAAW8B,GAAc,IAAI,KAAK,YAAY1E,IAAM,CAAC,GACrDiE,EAAO,SAASS,GAChBT,EAAO,WAAWrB,GAClBqB,EAAO,cAAc,KAAK,YACnBA;AAAA,IACT,GAMAvF,EAAU,UAAU,mBAAmB,SAAU6F,GAAgBC,GAAM;AASrE,eARIP,IAAS,KAAK,MAAM,CAACM,CAAc,GAAG,EAAI,GAC1CE,IAAgBR,EAAO,SACvBU,IAAY,KAAK,MAAM,IAAIH,CAAI,GAC/BpD,IAAWqD,EAAcF,CAAc,GACvCvE,IAAM,KAAK,MAAK,GAEhB4C,IAAa,KAAKnF,EAAe,KAAK,SAAS,GAAG,KAAK,KAAKuC,IAAM2E,CAAS,IAAI,CAAC,GAChF5E,IAAS,GACJG,IAAI,GAAGA,IAAIF,GAAKE,KAAKyE,GAAW;AACvC,YAAIgB,IAAWzF,GACX0F,IAAWxE,EAAS,KAAK,YAAYuE,CAAQ,CAAC,GAC9CE,IAAW3F,GACX4F,IAAW1E,EAAS,KAAK,YAAYyE,CAAQ,CAAC,GAC9CE,IAAgBpB;AAEpB,QAAIzE,IAAIyE,IAAY3E,MAClB+F,IAAgB/F,IAAME;AAGxB,iBAASkD,IAAI,GAAGA,IAAI2C,GAAe3C,KAAK;AACtC,cAAItB,IAAW,KAAK,YAAY5B,IAAIkD,CAAC,GACjC3B,IAAQL,EAASU,CAAQ;AAC7B,UAAIL,IAAQmE,MACVA,IAAWnE,GACXkE,IAAWzF,IAAIkD,IAEb3B,IAAQqE,MACVA,IAAWrE,GACXoE,IAAW3F,IAAIkD;AAAA,QAEnB;AACA,YAAI4C,IAAc,KAAK,YAAYL,CAAQ,GACvCM,IAAc,KAAK,YAAYJ,CAAQ;AAE3C,QAAIF,IAAWE,KACbjD,EAAW7C,GAAQ,IAAIiG,GACvBpD,EAAW7C,GAAQ,IAAIkG,MAEvBrD,EAAW7C,GAAQ,IAAIkG,GACvBrD,EAAW7C,GAAQ,IAAIiG;AAAA,MAE3B;AACA,aAAA/B,EAAO,SAASlE,GAChBkE,EAAO,WAAWrB,GAClBqB,EAAO,iBAAgB,GAChBA;AAAA,IACT,GAKAvF,EAAU,UAAU,aAAa,SAAUwH,GAAW1B,GAAM2B,GAAaC,GAAa;AAUpF,eATInC,IAAS,KAAK,MAAM,CAACiC,CAAS,GAAG,EAAI,GACrCzB,IAAgBR,EAAO,SACvBoC,IAAc,CAAA,GACd1B,IAAY,KAAK,MAAM,IAAIH,CAAI,GAC/BpD,IAAWqD,EAAcyB,CAAS,GAClClG,IAAM,KAAK,MAAK,GAChBsE,IAAiBL,EAAO,WAAWiC,CAAS,IAAIvI,EAAgB,GAChEiF,IAAa,KAAKnF,EAAe,KAAK,SAAS,GAAG,KAAK,KAAKuC,IAAM2E,CAAS,CAAC,GAC5E5E,IAAS,GACJG,IAAI,GAAGA,IAAIF,GAAKE,KAAKyE,GAAW;AAEvC,QAAIA,IAAY3E,IAAME,MACpByE,IAAY3E,IAAME,GAClBmG,EAAY,SAAS1B;AAEvB,iBAASvB,IAAI,GAAGA,IAAIuB,GAAWvB,KAAK;AAClC,cAAIkD,IAAU,KAAK,YAAYpG,IAAIkD,CAAC;AACpC,UAAAiD,EAAYjD,CAAC,IAAIhC,EAASkF,CAAO;AAAA,QACnC;AACA,YAAI7E,IAAQ0E,EAAYE,CAAW,GAC/BE,IAAiB,KAAK,YAAY,KAAK,IAAIrG,IAAIkG,EAAYC,GAAa5E,CAAK,KAAK,GAAGzB,IAAM,CAAC,CAAC;AAEjG,QAAAoB,EAASmF,CAAc,IAAI9E,GACvBA,IAAQ6C,EAAe,CAAC,MAC1BA,EAAe,CAAC,IAAI7C,IAElBA,IAAQ6C,EAAe,CAAC,MAC1BA,EAAe,CAAC,IAAI7C,IAEtBmB,EAAW7C,GAAQ,IAAIwG;AAAA,MACzB;AACA,aAAAtC,EAAO,SAASlE,GAChBkE,EAAO,WAAWrB,GAClBqB,EAAO,iBAAgB,GAChBA;AAAA,IACT,GASAvF,EAAU,UAAU,OAAO,SAAUoE,GAAMC,GAAI;AAC7C,UAAK,KAAK;AAKV,iBAFIE,IAAUH,EAAK,QACfnC,IAAS,KAAK,SACTT,IAAI,GAAGF,IAAM,KAAK,MAAK,GAAIE,IAAIF,GAAKE,KAAK;AAChD,cAAIoB,IAAS,KAAK,YAAYpB,CAAC;AAE/B,kBAAQ+C,GAAO;AAAA,YACb,KAAK;AACH,cAAAF,EAAG7C,CAAC;AACJ;AAAA,YACF,KAAK;AACH,cAAA6C,EAAGpC,EAAOmC,EAAK,CAAC,CAAC,EAAExB,CAAM,GAAGpB,CAAC;AAC7B;AAAA,YACF,KAAK;AACH,cAAA6C,EAAGpC,EAAOmC,EAAK,CAAC,CAAC,EAAExB,CAAM,GAAGX,EAAOmC,EAAK,CAAC,CAAC,EAAExB,CAAM,GAAGpB,CAAC;AACtD;AAAA,YACF;AAGE,uBAFIkD,IAAI,GACJ3B,IAAQ,CAAA,GACL2B,IAAIH,GAASG;AAClB,gBAAA3B,EAAM2B,CAAC,IAAIzC,EAAOmC,EAAKM,CAAC,CAAC,EAAE9B,CAAM;AAGnC,cAAAG,EAAM2B,CAAC,IAAIlD,GACX6C,EAAG,MAAM,MAAMtB,CAAK;AAAA,UAC9B;AAAA,QACI;AAAA,IACF,GAIA/C,EAAU,UAAU,gBAAgB,SAAUY,GAAK;AAEjD,UAAIiC,IAAU,KAAK,QAAQjC,CAAG,GAC1BkH,IAAgB7I,EAAgB;AACpC,UAAI,CAAC4D;AACH,eAAOiF;AAGT,UAAIC,IAAU,KAAK,MAAK,GAIpBC,IAAS,CAAC,KAAK,UACfC;AACJ,UAAID;AACF,eAAO,KAAK,WAAWpH,CAAG,EAAE,MAAK;AAGnC,UADAqH,IAAY,KAAK,QAAQrH,CAAG,GACxBqH;AACF,eAAOA,EAAU,MAAK;AAExB,MAAAA,IAAYH;AAGZ,eAFIhD,IAAMmD,EAAU,CAAC,GACjBlD,IAAMkD,EAAU,CAAC,GACZzG,IAAI,GAAGA,IAAIuG,GAASvG,KAAK;AAChC,YAAIoB,IAAS,KAAK,YAAYpB,CAAC,GAC3BuB,IAAQF,EAAQD,CAAM;AAC1B,QAAAG,IAAQ+B,MAAQA,IAAM/B,IACtBA,IAAQgC,MAAQA,IAAMhC;AAAA,MACxB;AACA,aAAAkF,IAAY,CAACnD,GAAKC,CAAG,GACrB,KAAK,QAAQnE,CAAG,IAAIqH,GACbA;AAAA,IACT,GAIAjI,EAAU,UAAU,iBAAiB,SAAUqC,GAAK;AAClD,UAAIO,IAAS,KAAK,YAAYP,CAAG;AACjC,UAAK,KAAK,UAAU;AAQlB,eAAO,KAAK,UAAU,QAAQO,CAAM;AALpC,eAFInB,IAAM,CAAA,GACNQ,IAAS,KAAK,SACTT,IAAI,GAAGA,IAAIS,EAAO,QAAQT;AACjC,QAAAC,EAAI,KAAKQ,EAAOT,CAAC,EAAEoB,CAAM,CAAC;AAE5B,aAAOnB;AAAA,IAIX,GAMAzB,EAAU,UAAU,QAAQ,SAAUkI,GAAYC,GAAe;AAC/D,UAAI5C,IAAS,IAAIvF,EAAS,GACtBiC,IAAS,KAAK,SACdmG,IAAgBF,KAAcG,EAAOH,GAAY,SAAUI,GAAK/I,GAAQ;AAC1E,eAAA+I,EAAI/I,CAAM,IAAI,IACP+I;AAAA,MACT,GAAG,CAAA,CAAE;AACL,UAAIF;AACF,iBAAS5G,IAAI,GAAGA,IAAIS,EAAO,QAAQT;AAEjC,UAAA+D,EAAO,QAAQ/D,CAAC,IAAK4G,EAAc5G,CAAC,IAAgBtC,EAAW+C,EAAOT,CAAC,CAAC,IAAhCS,EAAOT,CAAC;AAAA;AAGlD,QAAA+D,EAAO,UAAUtD;AAEnB,kBAAK,iBAAiBsD,CAAM,GACvB4C,MACH5C,EAAO,WAAW,KAAK,cAAa,IAEtCA,EAAO,iBAAgB,GAChBA;AAAA,IACT,GACAvF,EAAU,UAAU,mBAAmB,SAAUuF,GAAQ;AACvD,MAAAA,EAAO,SAAS,KAAK,QACrBA,EAAO,YAAY,KAAK,WACxBA,EAAO,YAAY,KAAK,WACxBA,EAAO,cAAc,KAAK,aAC1BA,EAAO,UAAUgD,EAAM,KAAK,OAAO,GACnChD,EAAO,aAAagD,EAAM,KAAK,UAAU;AAAA,IAC3C,GACAvI,EAAU,UAAU,gBAAgB,WAAY;AAC9C,UAAI,KAAK,UAAU;AACjB,YAAIZ,IAAO,KAAK,SAAS,aACrBiE,IAAU;AACd,YAAIjE,MAAS,OAAO;AAClB,cAAI+E,IAAY,KAAK,SAAS;AAC9B,UAAAd,IAAU,IAAIjE,EAAK+E,CAAS;AAC5B,mBAAS3C,IAAI,GAAGA,IAAI2C,GAAW3C;AAC7B,YAAA6B,EAAQ7B,CAAC,IAAI,KAAK,SAASA,CAAC;AAAA,QAEhC;AACE,UAAA6B,IAAU,IAAIjE,EAAK,KAAK,QAAQ;AAElC,eAAOiE;AAAA,MACT;AACA,aAAO;AAAA,IACT,GACArD,EAAU,UAAU,qBAAqB,SAAUqC,GAAK;AACtD,aAAOA;AAAA,IACT,GACArC,EAAU,UAAU,aAAa,SAAUqC,GAAK;AAC9C,aAAIA,IAAM,KAAK,UAAUA,KAAO,IACvB,KAAK,SAASA,CAAG,IAEnB;AAAA,IACT,GACArC,EAAU,UAAU,mBAAmB,WAAY;AACjD,WAAK,cAAc,KAAK,WAAW,KAAK,aAAa,KAAK;AAAA,IAC5D,GACAA,EAAU,iBAAgB,WAAY;AACpC,eAASwI,EAAkBhG,GAAUiG,GAAU1E,GAAWpC,GAAU;AAClE,eAAO+G,EAAelG,EAASb,CAAQ,GAAG,KAAK,YAAYA,CAAQ,CAAC;AAAA,MACtE;AACA,MAAA7C,IAAyB;AAAA,QACvB,WAAW0J;AAAA,QACX,YAAY,SAAUhG,GAAUiG,GAAU1E,GAAWpC,GAAU;AAC7D,iBAAO+G,EAAelG,EAASiG,CAAQ,GAAG,KAAK,YAAY9G,CAAQ,CAAC;AAAA,QACtE;AAAA,QACA,cAAc6G;AAAA,QACd,UAAU,SAAUhG,GAAUiG,GAAU1E,GAAWpC,GAAU;AAK3D,cAAIoB,IAAQP,MAAaA,EAAS,SAAS,OAAOA,IAAWA,EAAS;AACtE,iBAAOkG,EAAe3F,aAAiB,QAAQA,EAAMpB,CAAQ,IAE3DoB,GAAO,KAAK,YAAYpB,CAAQ,CAAC;AAAA,QACrC;AAAA,QACA,YAAY,SAAUa,GAAUiG,GAAU1E,GAAWpC,GAAU;AAC7D,iBAAOa,EAASb,CAAQ;AAAA,QAC1B;AAAA,MACN;AAAA,IACE,GAAC,GACM3B;AAAA,EACT,GAAC;AAAA;","x_google_ignoreList":[0]}

package/dist/node_modules/echarts/lib/data/Graph.js

@@ -0,0 +1,210 @@
+import { isNumber as l, mixin as c, createHashMap as v } from "../../../zrender/lib/core/util.js";
+function p(a) {
+  return "_EC_" + a;
+}
+var E = (
+  /** @class */
+  (function() {
+    function a(e) {
+      this.type = "graph", this.nodes = [], this.edges = [], this._nodesMap = {}, this._edgesMap = {}, this._directed = e || !1;
+    }
+    return a.prototype.isDirected = function() {
+      return this._directed;
+    }, a.prototype.addNode = function(e, t) {
+      e = e == null ? "" + t : "" + e;
+      var n = this._nodesMap;
+      if (n[p(e)]) {
+        process.env.NODE_ENV !== "production" && console.error("Graph nodes have duplicate name or id");
+        return;
+      }
+      var r = new g(e, t);
+      return r.hostGraph = this, this.nodes.push(r), n[p(e)] = r, r;
+    }, a.prototype.getNodeByIndex = function(e) {
+      var t = this.data.getRawIndex(e);
+      return this.nodes[t];
+    }, a.prototype.getNodeById = function(e) {
+      return this._nodesMap[p(e)];
+    }, a.prototype.addEdge = function(e, t, n) {
+      var r = this._nodesMap, d = this._edgesMap;
+      if (l(e) && (e = this.nodes[e]), l(t) && (t = this.nodes[t]), e instanceof g || (e = r[p(e)]), t instanceof g || (t = r[p(t)]), !(!e || !t)) {
+        var i = e.id + "-" + t.id, s = new I(e, t, n);
+        return s.hostGraph = this, this._directed && (e.outEdges.push(s), t.inEdges.push(s)), e.edges.push(s), e !== t && t.edges.push(s), this.edges.push(s), d[i] = s, s;
+      }
+    }, a.prototype.getEdgeByIndex = function(e) {
+      var t = this.edgeData.getRawIndex(e);
+      return this.edges[t];
+    }, a.prototype.getEdge = function(e, t) {
+      e instanceof g && (e = e.id), t instanceof g && (t = t.id);
+      var n = this._edgesMap;
+      return this._directed ? n[e + "-" + t] : n[e + "-" + t] || n[t + "-" + e];
+    }, a.prototype.eachNode = function(e, t) {
+      for (var n = this.nodes, r = n.length, d = 0; d < r; d++)
+        n[d].dataIndex >= 0 && e.call(t, n[d], d);
+    }, a.prototype.eachEdge = function(e, t) {
+      for (var n = this.edges, r = n.length, d = 0; d < r; d++)
+        n[d].dataIndex >= 0 && n[d].node1.dataIndex >= 0 && n[d].node2.dataIndex >= 0 && e.call(t, n[d], d);
+    }, a.prototype.breadthFirstTraverse = function(e, t, n, r) {
+      if (t instanceof g || (t = this._nodesMap[p(t)]), !!t) {
+        for (var d = n === "out" ? "outEdges" : n === "in" ? "inEdges" : "edges", i = 0; i < this.nodes.length; i++)
+          this.nodes[i].__visited = !1;
+        if (!e.call(r, t, null))
+          for (var s = [t]; s.length; )
+            for (var o = s.shift(), h = o[d], i = 0; i < h.length; i++) {
+              var u = h[i], f = u.node1 === o ? u.node2 : u.node1;
+              if (!f.__visited) {
+                if (e.call(r, f, o))
+                  return;
+                s.push(f), f.__visited = !0;
+              }
+            }
+      }
+    }, a.prototype.update = function() {
+      for (var e = this.data, t = this.edgeData, n = this.nodes, r = this.edges, d = 0, i = n.length; d < i; d++)
+        n[d].dataIndex = -1;
+      for (var d = 0, i = e.count(); d < i; d++)
+        n[e.getRawIndex(d)].dataIndex = d;
+      t.filterSelf(function(s) {
+        var o = r[t.getRawIndex(s)];
+        return o.node1.dataIndex >= 0 && o.node2.dataIndex >= 0;
+      });
+      for (var d = 0, i = r.length; d < i; d++)
+        r[d].dataIndex = -1;
+      for (var d = 0, i = t.count(); d < i; d++)
+        r[t.getRawIndex(d)].dataIndex = d;
+    }, a.prototype.clone = function() {
+      for (var e = new a(this._directed), t = this.nodes, n = this.edges, r = 0; r < t.length; r++)
+        e.addNode(t[r].id, t[r].dataIndex);
+      for (var r = 0; r < n.length; r++) {
+        var d = n[r];
+        e.addEdge(d.node1.id, d.node2.id, d.dataIndex);
+      }
+      return e;
+    }, a;
+  })()
+), g = (
+  /** @class */
+  (function() {
+    function a(e, t) {
+      this.inEdges = [], this.outEdges = [], this.edges = [], this.dataIndex = -1, this.id = e ?? "", this.dataIndex = t ?? -1;
+    }
+    return a.prototype.degree = function() {
+      return this.edges.length;
+    }, a.prototype.inDegree = function() {
+      return this.inEdges.length;
+    }, a.prototype.outDegree = function() {
+      return this.outEdges.length;
+    }, a.prototype.getModel = function(e) {
+      if (!(this.dataIndex < 0)) {
+        var t = this.hostGraph, n = t.data.getItemModel(this.dataIndex);
+        return n.getModel(e);
+      }
+    }, a.prototype.getAdjacentDataIndices = function() {
+      for (var e = {
+        edge: [],
+        node: []
+      }, t = 0; t < this.edges.length; t++) {
+        var n = this.edges[t];
+        n.dataIndex < 0 || (e.edge.push(n.dataIndex), e.node.push(n.node1.dataIndex, n.node2.dataIndex));
+      }
+      return e;
+    }, a.prototype.getTrajectoryDataIndices = function() {
+      for (var e = v(), t = v(), n = 0; n < this.edges.length; n++) {
+        var r = this.edges[n];
+        if (!(r.dataIndex < 0)) {
+          e.set(r.dataIndex, !0);
+          for (var d = [r.node1], i = [r.node2], s = 0; s < d.length; ) {
+            var o = d[s];
+            s++, t.set(o.dataIndex, !0);
+            for (var h = 0; h < o.inEdges.length; h++)
+              e.set(o.inEdges[h].dataIndex, !0), d.push(o.inEdges[h].node1);
+          }
+          for (s = 0; s < i.length; ) {
+            var u = i[s];
+            s++, t.set(u.dataIndex, !0);
+            for (var h = 0; h < u.outEdges.length; h++)
+              e.set(u.outEdges[h].dataIndex, !0), i.push(u.outEdges[h].node2);
+          }
+        }
+      }
+      return {
+        edge: e.keys(),
+        node: t.keys()
+      };
+    }, a;
+  })()
+), I = (
+  /** @class */
+  (function() {
+    function a(e, t, n) {
+      this.dataIndex = -1, this.node1 = e, this.node2 = t, this.dataIndex = n ?? -1;
+    }
+    return a.prototype.getModel = function(e) {
+      if (!(this.dataIndex < 0)) {
+        var t = this.hostGraph, n = t.edgeData.getItemModel(this.dataIndex);
+        return n.getModel(e);
+      }
+    }, a.prototype.getAdjacentDataIndices = function() {
+      return {
+        edge: [this.dataIndex],
+        node: [this.node1.dataIndex, this.node2.dataIndex]
+      };
+    }, a.prototype.getTrajectoryDataIndices = function() {
+      var e = v(), t = v();
+      e.set(this.dataIndex, !0);
+      for (var n = [this.node1], r = [this.node2], d = 0; d < n.length; ) {
+        var i = n[d];
+        d++, t.set(i.dataIndex, !0);
+        for (var s = 0; s < i.inEdges.length; s++)
+          e.set(i.inEdges[s].dataIndex, !0), n.push(i.inEdges[s].node1);
+      }
+      for (d = 0; d < r.length; ) {
+        var o = r[d];
+        d++, t.set(o.dataIndex, !0);
+        for (var s = 0; s < o.outEdges.length; s++)
+          e.set(o.outEdges[s].dataIndex, !0), r.push(o.outEdges[s].node2);
+      }
+      return {
+        edge: e.keys(),
+        node: t.keys()
+      };
+    }, a;
+  })()
+);
+function x(a, e) {
+  return {
+    /**
+     * @param Default 'value'. can be 'a', 'b', 'c', 'd', 'e'.
+     */
+    getValue: function(t) {
+      var n = this[a][e];
+      return n.getStore().get(n.getDimensionIndex(t || "value"), this.dataIndex);
+    },
+    // TODO: TYPE stricter type.
+    setVisual: function(t, n) {
+      this.dataIndex >= 0 && this[a][e].setItemVisual(this.dataIndex, t, n);
+    },
+    getVisual: function(t) {
+      return this[a][e].getItemVisual(this.dataIndex, t);
+    },
+    setLayout: function(t, n) {
+      this.dataIndex >= 0 && this[a][e].setItemLayout(this.dataIndex, t, n);
+    },
+    getLayout: function() {
+      return this[a][e].getItemLayout(this.dataIndex);
+    },
+    getGraphicEl: function() {
+      return this[a][e].getItemGraphicEl(this.dataIndex);
+    },
+    getRawIndex: function() {
+      return this[a][e].getRawIndex(this.dataIndex);
+    }
+  };
+}
+c(g, x("hostGraph", "data"));
+c(I, x("hostGraph", "edgeData"));
+export {
+  I as GraphEdge,
+  g as GraphNode,
+  E as default
+};
+//# sourceMappingURL=Graph.js.map

package/dist/node_modules/echarts/lib/data/Graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Graph.js","sources":["../../../../../node_modules/echarts/lib/data/Graph.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/*\r\n* Licensed to the Apache Software Foundation (ASF) under one\r\n* or more contributor license agreements.  See the NOTICE file\r\n* distributed with this work for additional information\r\n* regarding copyright ownership.  The ASF licenses this file\r\n* to you under the Apache License, Version 2.0 (the\r\n* \"License\"); you may not use this file except in compliance\r\n* with the License.  You may obtain a copy of the License at\r\n*\r\n*   http://www.apache.org/licenses/LICENSE-2.0\r\n*\r\n* Unless required by applicable law or agreed to in writing,\r\n* software distributed under the License is distributed on an\r\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\n* KIND, either express or implied.  See the License for the\r\n* specific language governing permissions and limitations\r\n* under the License.\r\n*/\nimport * as zrUtil from 'zrender/lib/core/util.js';\n// id may be function name of Object, add a prefix to avoid this problem.\nfunction generateNodeKey(id) {\n  return '_EC_' + id;\n}\nvar Graph = /** @class */function () {\n  function Graph(directed) {\n    this.type = 'graph';\n    this.nodes = [];\n    this.edges = [];\n    this._nodesMap = {};\n    /**\r\n     * @type {Object.<string, module:echarts/data/Graph.Edge>}\r\n     * @private\r\n     */\n    this._edgesMap = {};\n    this._directed = directed || false;\n  }\n  /**\r\n   * If is directed graph\r\n   */\n  Graph.prototype.isDirected = function () {\n    return this._directed;\n  };\n  ;\n  /**\r\n   * Add a new node\r\n   */\n  Graph.prototype.addNode = function (id, dataIndex) {\n    id = id == null ? '' + dataIndex : '' + id;\n    var nodesMap = this._nodesMap;\n    if (nodesMap[generateNodeKey(id)]) {\n      if (process.env.NODE_ENV !== 'production') {\n        console.error('Graph nodes have duplicate name or id');\n      }\n      return;\n    }\n    var node = new GraphNode(id, dataIndex);\n    node.hostGraph = this;\n    this.nodes.push(node);\n    nodesMap[generateNodeKey(id)] = node;\n    return node;\n  };\n  ;\n  /**\r\n   * Get node by data index\r\n   */\n  Graph.prototype.getNodeByIndex = function (dataIndex) {\n    var rawIdx = this.data.getRawIndex(dataIndex);\n    return this.nodes[rawIdx];\n  };\n  ;\n  /**\r\n   * Get node by id\r\n   */\n  Graph.prototype.getNodeById = function (id) {\n    return this._nodesMap[generateNodeKey(id)];\n  };\n  ;\n  /**\r\n   * Add a new edge\r\n   */\n  Graph.prototype.addEdge = function (n1, n2, dataIndex) {\n    var nodesMap = this._nodesMap;\n    var edgesMap = this._edgesMap;\n    // PENDING\n    if (zrUtil.isNumber(n1)) {\n      n1 = this.nodes[n1];\n    }\n    if (zrUtil.isNumber(n2)) {\n      n2 = this.nodes[n2];\n    }\n    if (!(n1 instanceof GraphNode)) {\n      n1 = nodesMap[generateNodeKey(n1)];\n    }\n    if (!(n2 instanceof GraphNode)) {\n      n2 = nodesMap[generateNodeKey(n2)];\n    }\n    if (!n1 || !n2) {\n      return;\n    }\n    var key = n1.id + '-' + n2.id;\n    var edge = new GraphEdge(n1, n2, dataIndex);\n    edge.hostGraph = this;\n    if (this._directed) {\n      n1.outEdges.push(edge);\n      n2.inEdges.push(edge);\n    }\n    n1.edges.push(edge);\n    if (n1 !== n2) {\n      n2.edges.push(edge);\n    }\n    this.edges.push(edge);\n    edgesMap[key] = edge;\n    return edge;\n  };\n  ;\n  /**\r\n   * Get edge by data index\r\n   */\n  Graph.prototype.getEdgeByIndex = function (dataIndex) {\n    var rawIdx = this.edgeData.getRawIndex(dataIndex);\n    return this.edges[rawIdx];\n  };\n  ;\n  /**\r\n   * Get edge by two linked nodes\r\n   */\n  Graph.prototype.getEdge = function (n1, n2) {\n    if (n1 instanceof GraphNode) {\n      n1 = n1.id;\n    }\n    if (n2 instanceof GraphNode) {\n      n2 = n2.id;\n    }\n    var edgesMap = this._edgesMap;\n    if (this._directed) {\n      return edgesMap[n1 + '-' + n2];\n    } else {\n      return edgesMap[n1 + '-' + n2] || edgesMap[n2 + '-' + n1];\n    }\n  };\n  ;\n  /**\r\n   * Iterate all nodes\r\n   */\n  Graph.prototype.eachNode = function (cb, context) {\n    var nodes = this.nodes;\n    var len = nodes.length;\n    for (var i = 0; i < len; i++) {\n      if (nodes[i].dataIndex >= 0) {\n        cb.call(context, nodes[i], i);\n      }\n    }\n  };\n  ;\n  /**\r\n   * Iterate all edges\r\n   */\n  Graph.prototype.eachEdge = function (cb, context) {\n    var edges = this.edges;\n    var len = edges.length;\n    for (var i = 0; i < len; i++) {\n      if (edges[i].dataIndex >= 0 && edges[i].node1.dataIndex >= 0 && edges[i].node2.dataIndex >= 0) {\n        cb.call(context, edges[i], i);\n      }\n    }\n  };\n  ;\n  /**\r\n   * Breadth first traverse\r\n   * Return true to stop traversing\r\n   */\n  Graph.prototype.breadthFirstTraverse = function (cb, startNode, direction, context) {\n    if (!(startNode instanceof GraphNode)) {\n      startNode = this._nodesMap[generateNodeKey(startNode)];\n    }\n    if (!startNode) {\n      return;\n    }\n    var edgeType = direction === 'out' ? 'outEdges' : direction === 'in' ? 'inEdges' : 'edges';\n    for (var i = 0; i < this.nodes.length; i++) {\n      this.nodes[i].__visited = false;\n    }\n    if (cb.call(context, startNode, null)) {\n      return;\n    }\n    var queue = [startNode];\n    while (queue.length) {\n      var currentNode = queue.shift();\n      var edges = currentNode[edgeType];\n      for (var i = 0; i < edges.length; i++) {\n        var e = edges[i];\n        var otherNode = e.node1 === currentNode ? e.node2 : e.node1;\n        if (!otherNode.__visited) {\n          if (cb.call(context, otherNode, currentNode)) {\n            // Stop traversing\n            return;\n          }\n          queue.push(otherNode);\n          otherNode.__visited = true;\n        }\n      }\n    }\n  };\n  ;\n  // TODO\n  // depthFirstTraverse(\n  //     cb, startNode, direction, context\n  // ) {\n  // };\n  // Filter update\n  Graph.prototype.update = function () {\n    var data = this.data;\n    var edgeData = this.edgeData;\n    var nodes = this.nodes;\n    var edges = this.edges;\n    for (var i = 0, len = nodes.length; i < len; i++) {\n      nodes[i].dataIndex = -1;\n    }\n    for (var i = 0, len = data.count(); i < len; i++) {\n      nodes[data.getRawIndex(i)].dataIndex = i;\n    }\n    edgeData.filterSelf(function (idx) {\n      var edge = edges[edgeData.getRawIndex(idx)];\n      return edge.node1.dataIndex >= 0 && edge.node2.dataIndex >= 0;\n    });\n    // Update edge\n    for (var i = 0, len = edges.length; i < len; i++) {\n      edges[i].dataIndex = -1;\n    }\n    for (var i = 0, len = edgeData.count(); i < len; i++) {\n      edges[edgeData.getRawIndex(i)].dataIndex = i;\n    }\n  };\n  ;\n  /**\r\n   * @return {module:echarts/data/Graph}\r\n   */\n  Graph.prototype.clone = function () {\n    var graph = new Graph(this._directed);\n    var nodes = this.nodes;\n    var edges = this.edges;\n    for (var i = 0; i < nodes.length; i++) {\n      graph.addNode(nodes[i].id, nodes[i].dataIndex);\n    }\n    for (var i = 0; i < edges.length; i++) {\n      var e = edges[i];\n      graph.addEdge(e.node1.id, e.node2.id, e.dataIndex);\n    }\n    return graph;\n  };\n  ;\n  return Graph;\n}();\nvar GraphNode = /** @class */function () {\n  function GraphNode(id, dataIndex) {\n    this.inEdges = [];\n    this.outEdges = [];\n    this.edges = [];\n    this.dataIndex = -1;\n    this.id = id == null ? '' : id;\n    this.dataIndex = dataIndex == null ? -1 : dataIndex;\n  }\n  /**\r\n   * @return {number}\r\n   */\n  GraphNode.prototype.degree = function () {\n    return this.edges.length;\n  };\n  /**\r\n   * @return {number}\r\n   */\n  GraphNode.prototype.inDegree = function () {\n    return this.inEdges.length;\n  };\n  /**\r\n  * @return {number}\r\n  */\n  GraphNode.prototype.outDegree = function () {\n    return this.outEdges.length;\n  };\n  GraphNode.prototype.getModel = function (path) {\n    if (this.dataIndex < 0) {\n      return;\n    }\n    var graph = this.hostGraph;\n    var itemModel = graph.data.getItemModel(this.dataIndex);\n    return itemModel.getModel(path);\n  };\n  GraphNode.prototype.getAdjacentDataIndices = function () {\n    var dataIndices = {\n      edge: [],\n      node: []\n    };\n    for (var i = 0; i < this.edges.length; i++) {\n      var adjacentEdge = this.edges[i];\n      if (adjacentEdge.dataIndex < 0) {\n        continue;\n      }\n      dataIndices.edge.push(adjacentEdge.dataIndex);\n      dataIndices.node.push(adjacentEdge.node1.dataIndex, adjacentEdge.node2.dataIndex);\n    }\n    return dataIndices;\n  };\n  GraphNode.prototype.getTrajectoryDataIndices = function () {\n    var connectedEdgesMap = zrUtil.createHashMap();\n    var connectedNodesMap = zrUtil.createHashMap();\n    for (var i = 0; i < this.edges.length; i++) {\n      var adjacentEdge = this.edges[i];\n      if (adjacentEdge.dataIndex < 0) {\n        continue;\n      }\n      connectedEdgesMap.set(adjacentEdge.dataIndex, true);\n      var sourceNodesQueue = [adjacentEdge.node1];\n      var targetNodesQueue = [adjacentEdge.node2];\n      var nodeIteratorIndex = 0;\n      while (nodeIteratorIndex < sourceNodesQueue.length) {\n        var sourceNode = sourceNodesQueue[nodeIteratorIndex];\n        nodeIteratorIndex++;\n        connectedNodesMap.set(sourceNode.dataIndex, true);\n        for (var j = 0; j < sourceNode.inEdges.length; j++) {\n          connectedEdgesMap.set(sourceNode.inEdges[j].dataIndex, true);\n          sourceNodesQueue.push(sourceNode.inEdges[j].node1);\n        }\n      }\n      nodeIteratorIndex = 0;\n      while (nodeIteratorIndex < targetNodesQueue.length) {\n        var targetNode = targetNodesQueue[nodeIteratorIndex];\n        nodeIteratorIndex++;\n        connectedNodesMap.set(targetNode.dataIndex, true);\n        for (var j = 0; j < targetNode.outEdges.length; j++) {\n          connectedEdgesMap.set(targetNode.outEdges[j].dataIndex, true);\n          targetNodesQueue.push(targetNode.outEdges[j].node2);\n        }\n      }\n    }\n    return {\n      edge: connectedEdgesMap.keys(),\n      node: connectedNodesMap.keys()\n    };\n  };\n  return GraphNode;\n}();\nvar GraphEdge = /** @class */function () {\n  function GraphEdge(n1, n2, dataIndex) {\n    this.dataIndex = -1;\n    this.node1 = n1;\n    this.node2 = n2;\n    this.dataIndex = dataIndex == null ? -1 : dataIndex;\n  }\n  // eslint-disable-next-line @typescript-eslint/no-unused-vars\n  GraphEdge.prototype.getModel = function (path) {\n    if (this.dataIndex < 0) {\n      return;\n    }\n    var graph = this.hostGraph;\n    var itemModel = graph.edgeData.getItemModel(this.dataIndex);\n    return itemModel.getModel(path);\n  };\n  GraphEdge.prototype.getAdjacentDataIndices = function () {\n    return {\n      edge: [this.dataIndex],\n      node: [this.node1.dataIndex, this.node2.dataIndex]\n    };\n  };\n  GraphEdge.prototype.getTrajectoryDataIndices = function () {\n    var connectedEdgesMap = zrUtil.createHashMap();\n    var connectedNodesMap = zrUtil.createHashMap();\n    connectedEdgesMap.set(this.dataIndex, true);\n    var sourceNodes = [this.node1];\n    var targetNodes = [this.node2];\n    var nodeIteratorIndex = 0;\n    while (nodeIteratorIndex < sourceNodes.length) {\n      var sourceNode = sourceNodes[nodeIteratorIndex];\n      nodeIteratorIndex++;\n      connectedNodesMap.set(sourceNode.dataIndex, true);\n      for (var j = 0; j < sourceNode.inEdges.length; j++) {\n        connectedEdgesMap.set(sourceNode.inEdges[j].dataIndex, true);\n        sourceNodes.push(sourceNode.inEdges[j].node1);\n      }\n    }\n    nodeIteratorIndex = 0;\n    while (nodeIteratorIndex < targetNodes.length) {\n      var targetNode = targetNodes[nodeIteratorIndex];\n      nodeIteratorIndex++;\n      connectedNodesMap.set(targetNode.dataIndex, true);\n      for (var j = 0; j < targetNode.outEdges.length; j++) {\n        connectedEdgesMap.set(targetNode.outEdges[j].dataIndex, true);\n        targetNodes.push(targetNode.outEdges[j].node2);\n      }\n    }\n    return {\n      edge: connectedEdgesMap.keys(),\n      node: connectedNodesMap.keys()\n    };\n  };\n  return GraphEdge;\n}();\nfunction createGraphDataProxyMixin(hostName, dataName) {\n  return {\n    /**\r\n     * @param Default 'value'. can be 'a', 'b', 'c', 'd', 'e'.\r\n     */\n    getValue: function (dimension) {\n      var data = this[hostName][dataName];\n      return data.getStore().get(data.getDimensionIndex(dimension || 'value'), this.dataIndex);\n    },\n    // TODO: TYPE stricter type.\n    setVisual: function (key, value) {\n      this.dataIndex >= 0 && this[hostName][dataName].setItemVisual(this.dataIndex, key, value);\n    },\n    getVisual: function (key) {\n      return this[hostName][dataName].getItemVisual(this.dataIndex, key);\n    },\n    setLayout: function (layout, merge) {\n      this.dataIndex >= 0 && this[hostName][dataName].setItemLayout(this.dataIndex, layout, merge);\n    },\n    getLayout: function () {\n      return this[hostName][dataName].getItemLayout(this.dataIndex);\n    },\n    getGraphicEl: function () {\n      return this[hostName][dataName].getItemGraphicEl(this.dataIndex);\n    },\n    getRawIndex: function () {\n      return this[hostName][dataName].getRawIndex(this.dataIndex);\n    }\n  };\n}\n;\n;\n;\nzrUtil.mixin(GraphNode, createGraphDataProxyMixin('hostGraph', 'data'));\nzrUtil.mixin(GraphEdge, createGraphDataProxyMixin('hostGraph', 'edgeData'));\nexport default Graph;\nexport { GraphNode, GraphEdge };"],"names":["generateNodeKey","id","Graph","directed","dataIndex","nodesMap","node","GraphNode","rawIdx","n1","n2","edgesMap","zrUtil.isNumber","key","edge","GraphEdge","cb","context","nodes","len","i","edges","startNode","direction","edgeType","queue","currentNode","e","otherNode","data","edgeData","idx","graph","path","itemModel","dataIndices","adjacentEdge","connectedEdgesMap","zrUtil.createHashMap","connectedNodesMap","sourceNodesQueue","targetNodesQueue","nodeIteratorIndex","sourceNode","j","targetNode","sourceNodes","targetNodes","createGraphDataProxyMixin","hostName","dataName","dimension","value","layout","merge","zrUtil.mixin"],"mappings":";AA6CA,SAASA,EAAgBC,GAAI;AAC3B,SAAO,SAASA;AAClB;AACG,IAACC;AAAA;AAAA,GAAqB,WAAY;AACnC,aAASA,EAAMC,GAAU;AACvB,WAAK,OAAO,SACZ,KAAK,QAAQ,CAAA,GACb,KAAK,QAAQ,CAAA,GACb,KAAK,YAAY,CAAA,GAKjB,KAAK,YAAY,CAAA,GACjB,KAAK,YAAYA,KAAY;AAAA,IAC/B;AAIA,WAAAD,EAAM,UAAU,aAAa,WAAY;AACvC,aAAO,KAAK;AAAA,IACd,GAKAA,EAAM,UAAU,UAAU,SAAUD,GAAIG,GAAW;AACjD,MAAAH,IAAKA,KAAM,OAAO,KAAKG,IAAY,KAAKH;AACxC,UAAII,IAAW,KAAK;AACpB,UAAIA,EAASL,EAAgBC,CAAE,CAAC,GAAG;AACjC,QAAI,QAAQ,IAAI,aAAa,gBAC3B,QAAQ,MAAM,uCAAuC;AAEvD;AAAA,MACF;AACA,UAAIK,IAAO,IAAIC,EAAUN,GAAIG,CAAS;AACtC,aAAAE,EAAK,YAAY,MACjB,KAAK,MAAM,KAAKA,CAAI,GACpBD,EAASL,EAAgBC,CAAE,CAAC,IAAIK,GACzBA;AAAA,IACT,GAKAJ,EAAM,UAAU,iBAAiB,SAAUE,GAAW;AACpD,UAAII,IAAS,KAAK,KAAK,YAAYJ,CAAS;AAC5C,aAAO,KAAK,MAAMI,CAAM;AAAA,IAC1B,GAKAN,EAAM,UAAU,cAAc,SAAUD,GAAI;AAC1C,aAAO,KAAK,UAAUD,EAAgBC,CAAE,CAAC;AAAA,IAC3C,GAKAC,EAAM,UAAU,UAAU,SAAUO,GAAIC,GAAIN,GAAW;AACrD,UAAIC,IAAW,KAAK,WAChBM,IAAW,KAAK;AAcpB,UAZIC,EAAgBH,CAAE,MACpBA,IAAK,KAAK,MAAMA,CAAE,IAEhBG,EAAgBF,CAAE,MACpBA,IAAK,KAAK,MAAMA,CAAE,IAEdD,aAAcF,MAClBE,IAAKJ,EAASL,EAAgBS,CAAE,CAAC,IAE7BC,aAAcH,MAClBG,IAAKL,EAASL,EAAgBU,CAAE,CAAC,IAE/B,GAACD,KAAM,CAACC,IAGZ;AAAA,YAAIG,IAAMJ,EAAG,KAAK,MAAMC,EAAG,IACvBI,IAAO,IAAIC,EAAUN,GAAIC,GAAIN,CAAS;AAC1C,eAAAU,EAAK,YAAY,MACb,KAAK,cACPL,EAAG,SAAS,KAAKK,CAAI,GACrBJ,EAAG,QAAQ,KAAKI,CAAI,IAEtBL,EAAG,MAAM,KAAKK,CAAI,GACdL,MAAOC,KACTA,EAAG,MAAM,KAAKI,CAAI,GAEpB,KAAK,MAAM,KAAKA,CAAI,GACpBH,EAASE,CAAG,IAAIC,GACTA;AAAA;AAAA,IACT,GAKAZ,EAAM,UAAU,iBAAiB,SAAUE,GAAW;AACpD,UAAII,IAAS,KAAK,SAAS,YAAYJ,CAAS;AAChD,aAAO,KAAK,MAAMI,CAAM;AAAA,IAC1B,GAKAN,EAAM,UAAU,UAAU,SAAUO,GAAIC,GAAI;AAC1C,MAAID,aAAcF,MAChBE,IAAKA,EAAG,KAENC,aAAcH,MAChBG,IAAKA,EAAG;AAEV,UAAIC,IAAW,KAAK;AACpB,aAAI,KAAK,YACAA,EAASF,IAAK,MAAMC,CAAE,IAEtBC,EAASF,IAAK,MAAMC,CAAE,KAAKC,EAASD,IAAK,MAAMD,CAAE;AAAA,IAE5D,GAKAP,EAAM,UAAU,WAAW,SAAUc,GAAIC,GAAS;AAGhD,eAFIC,IAAQ,KAAK,OACbC,IAAMD,EAAM,QACPE,IAAI,GAAGA,IAAID,GAAKC;AACvB,QAAIF,EAAME,CAAC,EAAE,aAAa,KACxBJ,EAAG,KAAKC,GAASC,EAAME,CAAC,GAAGA,CAAC;AAAA,IAGlC,GAKAlB,EAAM,UAAU,WAAW,SAAUc,GAAIC,GAAS;AAGhD,eAFII,IAAQ,KAAK,OACbF,IAAME,EAAM,QACPD,IAAI,GAAGA,IAAID,GAAKC;AACvB,QAAIC,EAAMD,CAAC,EAAE,aAAa,KAAKC,EAAMD,CAAC,EAAE,MAAM,aAAa,KAAKC,EAAMD,CAAC,EAAE,MAAM,aAAa,KAC1FJ,EAAG,KAAKC,GAASI,EAAMD,CAAC,GAAGA,CAAC;AAAA,IAGlC,GAMAlB,EAAM,UAAU,uBAAuB,SAAUc,GAAIM,GAAWC,GAAWN,GAAS;AAIlF,UAHMK,aAAqBf,MACzBe,IAAY,KAAK,UAAUtB,EAAgBsB,CAAS,CAAC,IAEnD,EAACA,GAIL;AAAA,iBADIE,IAAWD,MAAc,QAAQ,aAAaA,MAAc,OAAO,YAAY,SAC1E,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ;AACrC,eAAK,MAAM,CAAC,EAAE,YAAY;AAE5B,YAAI,CAAAP,EAAG,KAAKC,GAASK,GAAW,IAAI;AAIpC,mBADIG,IAAQ,CAACH,CAAS,GACfG,EAAM;AAGX,qBAFIC,IAAcD,EAAM,MAAK,GACzBJ,IAAQK,EAAYF,CAAQ,GACvB,IAAI,GAAG,IAAIH,EAAM,QAAQ,KAAK;AACrC,kBAAIM,IAAIN,EAAM,CAAC,GACXO,IAAYD,EAAE,UAAUD,IAAcC,EAAE,QAAQA,EAAE;AACtD,kBAAI,CAACC,EAAU,WAAW;AACxB,oBAAIZ,EAAG,KAAKC,GAASW,GAAWF,CAAW;AAEzC;AAEF,gBAAAD,EAAM,KAAKG,CAAS,GACpBA,EAAU,YAAY;AAAA,cACxB;AAAA,YACF;AAAA;AAAA,IAEJ,GAQA1B,EAAM,UAAU,SAAS,WAAY;AAKnC,eAJI2B,IAAO,KAAK,MACZC,IAAW,KAAK,UAChBZ,IAAQ,KAAK,OACbG,IAAQ,KAAK,OACRD,IAAI,GAAGD,IAAMD,EAAM,QAAQE,IAAID,GAAKC;AAC3C,QAAAF,EAAME,CAAC,EAAE,YAAY;AAEvB,eAASA,IAAI,GAAGD,IAAMU,EAAK,MAAK,GAAIT,IAAID,GAAKC;AAC3C,QAAAF,EAAMW,EAAK,YAAYT,CAAC,CAAC,EAAE,YAAYA;AAEzC,MAAAU,EAAS,WAAW,SAAUC,GAAK;AACjC,YAAIjB,IAAOO,EAAMS,EAAS,YAAYC,CAAG,CAAC;AAC1C,eAAOjB,EAAK,MAAM,aAAa,KAAKA,EAAK,MAAM,aAAa;AAAA,MAC9D,CAAC;AAED,eAASM,IAAI,GAAGD,IAAME,EAAM,QAAQD,IAAID,GAAKC;AAC3C,QAAAC,EAAMD,CAAC,EAAE,YAAY;AAEvB,eAASA,IAAI,GAAGD,IAAMW,EAAS,MAAK,GAAIV,IAAID,GAAKC;AAC/C,QAAAC,EAAMS,EAAS,YAAYV,CAAC,CAAC,EAAE,YAAYA;AAAA,IAE/C,GAKAlB,EAAM,UAAU,QAAQ,WAAY;AAIlC,eAHI8B,IAAQ,IAAI9B,EAAM,KAAK,SAAS,GAChCgB,IAAQ,KAAK,OACbG,IAAQ,KAAK,OACRD,IAAI,GAAGA,IAAIF,EAAM,QAAQE;AAChC,QAAAY,EAAM,QAAQd,EAAME,CAAC,EAAE,IAAIF,EAAME,CAAC,EAAE,SAAS;AAE/C,eAASA,IAAI,GAAGA,IAAIC,EAAM,QAAQD,KAAK;AACrC,YAAIO,IAAIN,EAAMD,CAAC;AACf,QAAAY,EAAM,QAAQL,EAAE,MAAM,IAAIA,EAAE,MAAM,IAAIA,EAAE,SAAS;AAAA,MACnD;AACA,aAAOK;AAAA,IACT,GAEO9B;AAAA,EACT,GAAC;AAAA,GACGK;AAAA;AAAA,GAAyB,WAAY;AACvC,aAASA,EAAUN,GAAIG,GAAW;AAChC,WAAK,UAAU,CAAA,GACf,KAAK,WAAW,CAAA,GAChB,KAAK,QAAQ,CAAA,GACb,KAAK,YAAY,IACjB,KAAK,KAAKH,KAAa,IACvB,KAAK,YAAYG,KAAoB;AAAA,IACvC;AAIA,WAAAG,EAAU,UAAU,SAAS,WAAY;AACvC,aAAO,KAAK,MAAM;AAAA,IACpB,GAIAA,EAAU,UAAU,WAAW,WAAY;AACzC,aAAO,KAAK,QAAQ;AAAA,IACtB,GAIAA,EAAU,UAAU,YAAY,WAAY;AAC1C,aAAO,KAAK,SAAS;AAAA,IACvB,GACAA,EAAU,UAAU,WAAW,SAAU0B,GAAM;AAC7C,UAAI,OAAK,YAAY,IAGrB;AAAA,YAAID,IAAQ,KAAK,WACbE,IAAYF,EAAM,KAAK,aAAa,KAAK,SAAS;AACtD,eAAOE,EAAU,SAASD,CAAI;AAAA;AAAA,IAChC,GACA1B,EAAU,UAAU,yBAAyB,WAAY;AAKvD,eAJI4B,IAAc;AAAA,QAChB,MAAM,CAAA;AAAA,QACN,MAAM,CAAA;AAAA,MACZ,GACaf,IAAI,GAAGA,IAAI,KAAK,MAAM,QAAQA,KAAK;AAC1C,YAAIgB,IAAe,KAAK,MAAMhB,CAAC;AAC/B,QAAIgB,EAAa,YAAY,MAG7BD,EAAY,KAAK,KAAKC,EAAa,SAAS,GAC5CD,EAAY,KAAK,KAAKC,EAAa,MAAM,WAAWA,EAAa,MAAM,SAAS;AAAA,MAClF;AACA,aAAOD;AAAA,IACT,GACA5B,EAAU,UAAU,2BAA2B,WAAY;AAGzD,eAFI8B,IAAoBC,EAAoB,GACxCC,IAAoBD,EAAoB,GACnClB,IAAI,GAAGA,IAAI,KAAK,MAAM,QAAQA,KAAK;AAC1C,YAAIgB,IAAe,KAAK,MAAMhB,CAAC;AAC/B,YAAI,EAAAgB,EAAa,YAAY,IAG7B;AAAA,UAAAC,EAAkB,IAAID,EAAa,WAAW,EAAI;AAIlD,mBAHII,IAAmB,CAACJ,EAAa,KAAK,GACtCK,IAAmB,CAACL,EAAa,KAAK,GACtCM,IAAoB,GACjBA,IAAoBF,EAAiB,UAAQ;AAClD,gBAAIG,IAAaH,EAAiBE,CAAiB;AACnD,YAAAA,KACAH,EAAkB,IAAII,EAAW,WAAW,EAAI;AAChD,qBAASC,IAAI,GAAGA,IAAID,EAAW,QAAQ,QAAQC;AAC7C,cAAAP,EAAkB,IAAIM,EAAW,QAAQC,CAAC,EAAE,WAAW,EAAI,GAC3DJ,EAAiB,KAAKG,EAAW,QAAQC,CAAC,EAAE,KAAK;AAAA,UAErD;AAEA,eADAF,IAAoB,GACbA,IAAoBD,EAAiB,UAAQ;AAClD,gBAAII,IAAaJ,EAAiBC,CAAiB;AACnD,YAAAA,KACAH,EAAkB,IAAIM,EAAW,WAAW,EAAI;AAChD,qBAASD,IAAI,GAAGA,IAAIC,EAAW,SAAS,QAAQD;AAC9C,cAAAP,EAAkB,IAAIQ,EAAW,SAASD,CAAC,EAAE,WAAW,EAAI,GAC5DH,EAAiB,KAAKI,EAAW,SAASD,CAAC,EAAE,KAAK;AAAA,UAEtD;AAAA;AAAA,MACF;AACA,aAAO;AAAA,QACL,MAAMP,EAAkB,KAAI;AAAA,QAC5B,MAAME,EAAkB,KAAI;AAAA,MAClC;AAAA,IACE,GACOhC;AAAA,EACT,GAAC;AAAA,GACGQ;AAAA;AAAA,GAAyB,WAAY;AACvC,aAASA,EAAUN,GAAIC,GAAIN,GAAW;AACpC,WAAK,YAAY,IACjB,KAAK,QAAQK,GACb,KAAK,QAAQC,GACb,KAAK,YAAYN,KAAoB;AAAA,IACvC;AAEA,WAAAW,EAAU,UAAU,WAAW,SAAUkB,GAAM;AAC7C,UAAI,OAAK,YAAY,IAGrB;AAAA,YAAID,IAAQ,KAAK,WACbE,IAAYF,EAAM,SAAS,aAAa,KAAK,SAAS;AAC1D,eAAOE,EAAU,SAASD,CAAI;AAAA;AAAA,IAChC,GACAlB,EAAU,UAAU,yBAAyB,WAAY;AACvD,aAAO;AAAA,QACL,MAAM,CAAC,KAAK,SAAS;AAAA,QACrB,MAAM,CAAC,KAAK,MAAM,WAAW,KAAK,MAAM,SAAS;AAAA,MACvD;AAAA,IACE,GACAA,EAAU,UAAU,2BAA2B,WAAY;AACzD,UAAIsB,IAAoBC,EAAoB,GACxCC,IAAoBD,EAAoB;AAC5C,MAAAD,EAAkB,IAAI,KAAK,WAAW,EAAI;AAI1C,eAHIS,IAAc,CAAC,KAAK,KAAK,GACzBC,IAAc,CAAC,KAAK,KAAK,GACzBL,IAAoB,GACjBA,IAAoBI,EAAY,UAAQ;AAC7C,YAAIH,IAAaG,EAAYJ,CAAiB;AAC9C,QAAAA,KACAH,EAAkB,IAAII,EAAW,WAAW,EAAI;AAChD,iBAASC,IAAI,GAAGA,IAAID,EAAW,QAAQ,QAAQC;AAC7C,UAAAP,EAAkB,IAAIM,EAAW,QAAQC,CAAC,EAAE,WAAW,EAAI,GAC3DE,EAAY,KAAKH,EAAW,QAAQC,CAAC,EAAE,KAAK;AAAA,MAEhD;AAEA,WADAF,IAAoB,GACbA,IAAoBK,EAAY,UAAQ;AAC7C,YAAIF,IAAaE,EAAYL,CAAiB;AAC9C,QAAAA,KACAH,EAAkB,IAAIM,EAAW,WAAW,EAAI;AAChD,iBAASD,IAAI,GAAGA,IAAIC,EAAW,SAAS,QAAQD;AAC9C,UAAAP,EAAkB,IAAIQ,EAAW,SAASD,CAAC,EAAE,WAAW,EAAI,GAC5DG,EAAY,KAAKF,EAAW,SAASD,CAAC,EAAE,KAAK;AAAA,MAEjD;AACA,aAAO;AAAA,QACL,MAAMP,EAAkB,KAAI;AAAA,QAC5B,MAAME,EAAkB,KAAI;AAAA,MAClC;AAAA,IACE,GACOxB;AAAA,EACT,GAAC;AAAA;AACD,SAASiC,EAA0BC,GAAUC,GAAU;AACrD,SAAO;AAAA;AAAA;AAAA;AAAA,IAIL,UAAU,SAAUC,GAAW;AAC7B,UAAItB,IAAO,KAAKoB,CAAQ,EAAEC,CAAQ;AAClC,aAAOrB,EAAK,WAAW,IAAIA,EAAK,kBAAkBsB,KAAa,OAAO,GAAG,KAAK,SAAS;AAAA,IACzF;AAAA;AAAA,IAEA,WAAW,SAAUtC,GAAKuC,GAAO;AAC/B,WAAK,aAAa,KAAK,KAAKH,CAAQ,EAAEC,CAAQ,EAAE,cAAc,KAAK,WAAWrC,GAAKuC,CAAK;AAAA,IAC1F;AAAA,IACA,WAAW,SAAUvC,GAAK;AACxB,aAAO,KAAKoC,CAAQ,EAAEC,CAAQ,EAAE,cAAc,KAAK,WAAWrC,CAAG;AAAA,IACnE;AAAA,IACA,WAAW,SAAUwC,GAAQC,GAAO;AAClC,WAAK,aAAa,KAAK,KAAKL,CAAQ,EAAEC,CAAQ,EAAE,cAAc,KAAK,WAAWG,GAAQC,CAAK;AAAA,IAC7F;AAAA,IACA,WAAW,WAAY;AACrB,aAAO,KAAKL,CAAQ,EAAEC,CAAQ,EAAE,cAAc,KAAK,SAAS;AAAA,IAC9D;AAAA,IACA,cAAc,WAAY;AACxB,aAAO,KAAKD,CAAQ,EAAEC,CAAQ,EAAE,iBAAiB,KAAK,SAAS;AAAA,IACjE;AAAA,IACA,aAAa,WAAY;AACvB,aAAO,KAAKD,CAAQ,EAAEC,CAAQ,EAAE,YAAY,KAAK,SAAS;AAAA,IAC5D;AAAA,EACJ;AACA;AAIAK,EAAahD,GAAWyC,EAA0B,aAAa,MAAM,CAAC;AACtEO,EAAaxC,GAAWiC,EAA0B,aAAa,UAAU,CAAC;","x_google_ignoreList":[0]}

package/dist/node_modules/echarts/lib/data/OrdinalMeta.js

@@ -0,0 +1,37 @@
+import { map as n, isString as s, createHashMap as l, isObject as o } from "../../../zrender/lib/core/util.js";
+var u = 0, p = (
+  /** @class */
+  (function() {
+    function i(e) {
+      this.categories = e.categories || [], this._needCollect = e.needCollect, this._deduplication = e.deduplication, this.uid = ++u;
+    }
+    return i.createByAxisModel = function(e) {
+      var t = e.option, a = t.data, r = a && n(a, d);
+      return new i({
+        categories: r,
+        needCollect: !r,
+        // deduplication is default in axis.
+        deduplication: t.dedplication !== !1
+      });
+    }, i.prototype.getOrdinal = function(e) {
+      return this._getOrCreateMap().get(e);
+    }, i.prototype.parseAndCollect = function(e) {
+      var t, a = this._needCollect;
+      if (!s(e) && !a)
+        return e;
+      if (a && !this._deduplication)
+        return t = this.categories.length, this.categories[t] = e, t;
+      var r = this._getOrCreateMap();
+      return t = r.get(e), t == null && (a ? (t = this.categories.length, this.categories[t] = e, r.set(e, t)) : t = NaN), t;
+    }, i.prototype._getOrCreateMap = function() {
+      return this._map || (this._map = l(this.categories));
+    }, i;
+  })()
+);
+function d(i) {
+  return o(i) && i.value != null ? i.value : i + "";
+}
+export {
+  p as default
+};
+//# sourceMappingURL=OrdinalMeta.js.map

package/dist/node_modules/echarts/lib/data/OrdinalMeta.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrdinalMeta.js","sources":["../../../../../node_modules/echarts/lib/data/OrdinalMeta.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/*\r\n* Licensed to the Apache Software Foundation (ASF) under one\r\n* or more contributor license agreements.  See the NOTICE file\r\n* distributed with this work for additional information\r\n* regarding copyright ownership.  The ASF licenses this file\r\n* to you under the Apache License, Version 2.0 (the\r\n* \"License\"); you may not use this file except in compliance\r\n* with the License.  You may obtain a copy of the License at\r\n*\r\n*   http://www.apache.org/licenses/LICENSE-2.0\r\n*\r\n* Unless required by applicable law or agreed to in writing,\r\n* software distributed under the License is distributed on an\r\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\n* KIND, either express or implied.  See the License for the\r\n* specific language governing permissions and limitations\r\n* under the License.\r\n*/\nimport { createHashMap, isObject, map, isString } from 'zrender/lib/core/util.js';\nvar uidBase = 0;\nvar OrdinalMeta = /** @class */function () {\n  function OrdinalMeta(opt) {\n    this.categories = opt.categories || [];\n    this._needCollect = opt.needCollect;\n    this._deduplication = opt.deduplication;\n    this.uid = ++uidBase;\n  }\n  OrdinalMeta.createByAxisModel = function (axisModel) {\n    var option = axisModel.option;\n    var data = option.data;\n    var categories = data && map(data, getName);\n    return new OrdinalMeta({\n      categories: categories,\n      needCollect: !categories,\n      // deduplication is default in axis.\n      deduplication: option.dedplication !== false\n    });\n  };\n  ;\n  OrdinalMeta.prototype.getOrdinal = function (category) {\n    // @ts-ignore\n    return this._getOrCreateMap().get(category);\n  };\n  /**\r\n   * @return The ordinal. If not found, return NaN.\r\n   */\n  OrdinalMeta.prototype.parseAndCollect = function (category) {\n    var index;\n    var needCollect = this._needCollect;\n    // The value of category dim can be the index of the given category set.\n    // This feature is only supported when !needCollect, because we should\n    // consider a common case: a value is 2017, which is a number but is\n    // expected to be tread as a category. This case usually happen in dataset,\n    // where it happent to be no need of the index feature.\n    if (!isString(category) && !needCollect) {\n      return category;\n    }\n    // Optimize for the scenario:\n    // category is ['2012-01-01', '2012-01-02', ...], where the input\n    // data has been ensured not duplicate and is large data.\n    // Notice, if a dataset dimension provide categroies, usually echarts\n    // should remove duplication except user tell echarts dont do that\n    // (set axis.deduplication = false), because echarts do not know whether\n    // the values in the category dimension has duplication (consider the\n    // parallel-aqi example)\n    if (needCollect && !this._deduplication) {\n      index = this.categories.length;\n      this.categories[index] = category;\n      return index;\n    }\n    var map = this._getOrCreateMap();\n    // @ts-ignore\n    index = map.get(category);\n    if (index == null) {\n      if (needCollect) {\n        index = this.categories.length;\n        this.categories[index] = category;\n        // @ts-ignore\n        map.set(category, index);\n      } else {\n        index = NaN;\n      }\n    }\n    return index;\n  };\n  // Consider big data, do not create map until needed.\n  OrdinalMeta.prototype._getOrCreateMap = function () {\n    return this._map || (this._map = createHashMap(this.categories));\n  };\n  return OrdinalMeta;\n}();\nfunction getName(obj) {\n  if (isObject(obj) && obj.value != null) {\n    return obj.value;\n  } else {\n    return obj + '';\n  }\n}\nexport default OrdinalMeta;"],"names":["uidBase","OrdinalMeta","opt","axisModel","option","data","categories","map","getName","category","index","needCollect","isString","createHashMap","obj","isObject"],"mappings":";AA4CA,IAAIA,IAAU,GACVC;AAAA;AAAA,GAA2B,WAAY;AACzC,aAASA,EAAYC,GAAK;AACxB,WAAK,aAAaA,EAAI,cAAc,CAAA,GACpC,KAAK,eAAeA,EAAI,aACxB,KAAK,iBAAiBA,EAAI,eAC1B,KAAK,MAAM,EAAEF;AAAA,IACf;AACA,WAAAC,EAAY,oBAAoB,SAAUE,GAAW;AACnD,UAAIC,IAASD,EAAU,QACnBE,IAAOD,EAAO,MACdE,IAAaD,KAAQE,EAAIF,GAAMG,CAAO;AAC1C,aAAO,IAAIP,EAAY;AAAA,QACrB,YAAYK;AAAA,QACZ,aAAa,CAACA;AAAA;AAAA,QAEd,eAAeF,EAAO,iBAAiB;AAAA,MAC7C,CAAK;AAAA,IACH,GAEAH,EAAY,UAAU,aAAa,SAAUQ,GAAU;AAErD,aAAO,KAAK,kBAAkB,IAAIA,CAAQ;AAAA,IAC5C,GAIAR,EAAY,UAAU,kBAAkB,SAAUQ,GAAU;AAC1D,UAAIC,GACAC,IAAc,KAAK;AAMvB,UAAI,CAACC,EAASH,CAAQ,KAAK,CAACE;AAC1B,eAAOF;AAUT,UAAIE,KAAe,CAAC,KAAK;AACvB,eAAAD,IAAQ,KAAK,WAAW,QACxB,KAAK,WAAWA,CAAK,IAAID,GAClBC;AAET,UAAIH,IAAM,KAAK,gBAAe;AAE9B,aAAAG,IAAQH,EAAI,IAAIE,CAAQ,GACpBC,KAAS,SACPC,KACFD,IAAQ,KAAK,WAAW,QACxB,KAAK,WAAWA,CAAK,IAAID,GAEzBF,EAAI,IAAIE,GAAUC,CAAK,KAEvBA,IAAQ,MAGLA;AAAA,IACT,GAEAT,EAAY,UAAU,kBAAkB,WAAY;AAClD,aAAO,KAAK,SAAS,KAAK,OAAOY,EAAc,KAAK,UAAU;AAAA,IAChE,GACOZ;AAAA,EACT,GAAC;AAAA;AACD,SAASO,EAAQM,GAAK;AACpB,SAAIC,EAASD,CAAG,KAAKA,EAAI,SAAS,OACzBA,EAAI,QAEJA,IAAM;AAEjB;","x_google_ignoreList":[0]}