@ecan-bi/datav 1.0.90 → 1.0.92

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

@@ -1 +0,0 @@
-{"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/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\nimport { 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.\n\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/**\n * Multi dimensional data store\n */\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;\n\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\n;\n\nfunction getInitialExtent() {\n  return [Infinity, -Infinity];\n}\n\n;\n\nfunction cloneChunk(originalChunk) {\n  var Ctor = originalChunk.constructor; // Only shallow clone is enough when Array.\n\n  return Ctor === Array ? originalChunk.slice() : new Ctor(originalChunk);\n}\n\nfunction prepareStore(store, dimIdx, dimType, end, append) {\n  var DataCtor = dataCtors[dimType || 'float'];\n\n  if (append) {\n    var oldStore = store[dimIdx];\n    var oldLen = oldStore && oldStore.length;\n\n    if (!(oldLen === end)) {\n      var newStore = new DataCtor(end); // The cost of the copy is probably inconsiderable\n      // within the initial chunkSize.\n\n      for (var j = 0; j < oldLen; j++) {\n        newStore[j] = oldStore[j];\n      }\n\n      store[dimIdx] = newStore;\n    }\n  } else {\n    store[dimIdx] = new DataCtor(end);\n  }\n}\n\n;\n/**\n * Basically, DataStore API keep immutable.\n */\n\nvar DataStore =\n/** @class */\nfunction () {\n  function DataStore() {\n    this._chunks = []; // It will not be calculated util needed.\n\n    this._rawExtent = [];\n    this._extent = [];\n    this._count = 0;\n    this._rawCount = 0;\n    this._calcDimNameToIdx = createHashMap();\n  }\n  /**\n   * Initialize from data\n   */\n\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\n    this._provider = provider; // Clear\n\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]; // Default dim value getter\n\n    this._dimValueGetter = dimValueGetter || defaultGetter; // Reset raw extent.\n\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\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\n    this._initDataFromProvider(0, provider.count());\n  };\n\n  DataStore.prototype.getProvider = function () {\n    return this._provider;\n  };\n  /**\n   * Caution: even when a `source` instance owned by a series, the created data store\n   * may still be shared by different sereis (the source hash does not use all `source`\n   * props, see `sourceManager`). In this case, the `source` props that are not used in\n   * hash (like `source.dimensionDefine`) probably only belongs to a certain series and\n   * thus should not be fetch here.\n   */\n\n\n  DataStore.prototype.getSource = function () {\n    return this._provider.getSource();\n  };\n  /**\n   * @caution Only used in dataStack.\n   */\n\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\n    if (calcDimIdx != null) {\n      if (dimensions[calcDimIdx].type === type) {\n        return calcDimIdx;\n      }\n    } else {\n      calcDimIdx = dimensions.length;\n    }\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\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\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\n    var dimRawExtent = rawExtents[dimIdx]; // Parse from previous data offset. len may be changed after appendData\n\n    for (var i = offset; i < len; i++) {\n      var val = chunk[i] = ordinalMeta.parseAndCollect(chunk[i]);\n\n      if (!isNaN(val)) {\n        dimRawExtent[0] = Math.min(val, dimRawExtent[0]);\n        dimRawExtent[1] = Math.max(val, dimRawExtent[1]);\n      }\n    }\n\n    dim.ordinalMeta = ordinalMeta;\n    dim.ordinalOffset = len;\n    dim.type = 'ordinal'; // Force to be ordinal\n  };\n\n  DataStore.prototype.getOrdinalMeta = function (dimIdx) {\n    var dimInfo = this._dimensions[dimIdx];\n    var ordinalMeta = dimInfo.ordinalMeta;\n    return ordinalMeta;\n  };\n\n  DataStore.prototype.getDimensionProperty = function (dimIndex) {\n    var item = this._dimensions[dimIndex];\n    return item && item.property;\n  };\n  /**\n   * Caution: Can be only called on raw data (before `this._indices` created).\n   */\n\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\n    var provider = this._provider;\n    var start = this.count();\n    provider.appendData(data);\n    var end = provider.count();\n\n    if (!provider.persistent) {\n      end += start;\n    }\n\n    if (start < end) {\n      this._initDataFromProvider(start, end, true);\n    }\n\n    return [start, end];\n  };\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\n    for (var i = 0; i < dimLen; i++) {\n      var dim = dimensions[i];\n      prepareStore(chunks, i, dim.type, end, true);\n    }\n\n    var emptyDataItem = [];\n\n    for (var idx = start; idx < end; idx++) {\n      var sourceIdx = idx - start; // Store the data by dimensions\n\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\n    this._rawCount = this._count = end;\n    return {\n      start: start,\n      end: end\n    };\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\n    for (var i = 0; i < dimLen; i++) {\n      var dim = dimensions[i];\n\n      if (!rawExtent[i]) {\n        rawExtent[i] = getInitialExtent();\n      }\n\n      prepareStore(chunks, i, dim.type, end, append);\n    }\n\n    if (provider.fillStorage) {\n      provider.fillStorage(start, end, chunks, rawExtent);\n    } else {\n      var dataItem = [];\n\n      for (var idx = start; idx < end; idx++) {\n        // NOTICE: Try not to write things into dataItem\n        dataItem = provider.getItem(idx, dataItem); // 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\n        for (var dimIdx = 0; dimIdx < dimLen; dimIdx++) {\n          var dimStorage = chunks[dimIdx]; // PENDING NULL is empty or zero\n\n          var val = this._dimValueGetter(dataItem, dimNames[dimIdx], idx, dimIdx);\n\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\n    if (!provider.persistent && provider.clean) {\n      // Clean unused data if data source is typed array.\n      provider.clean();\n    }\n\n    this._rawCount = this._count = end; // Reset data extent\n\n    this._extent = [];\n  };\n\n  DataStore.prototype.count = function () {\n    return this._count;\n  };\n  /**\n   * Get value. Return NaN if idx is out of range.\n   */\n\n\n  DataStore.prototype.get = function (dim, idx) {\n    if (!(idx >= 0 && idx < this._count)) {\n      return NaN;\n    }\n\n    var dimStore = this._chunks[dim];\n    return dimStore ? dimStore[this.getRawIndex(idx)] : NaN;\n  };\n\n  DataStore.prototype.getValues = function (dimensions, idx) {\n    var values = [];\n    var dimArr = [];\n\n    if (idx == null) {\n      idx = dimensions; // TODO get all from store?\n\n      dimensions = []; // All dimensions\n\n      for (var i = 0; i < this._dimensions.length; i++) {\n        dimArr.push(i);\n      }\n    } else {\n      dimArr = dimensions;\n    }\n\n    for (var i = 0, len = dimArr.length; i < len; i++) {\n      values.push(this.get(dimArr[i], idx));\n    }\n\n    return values;\n  };\n  /**\n   * @param dim concrete dim\n   */\n\n\n  DataStore.prototype.getByRawIndex = function (dim, rawIdx) {\n    if (!(rawIdx >= 0 && rawIdx < this._rawCount)) {\n      return NaN;\n    }\n\n    var dimStore = this._chunks[dim];\n    return dimStore ? dimStore[rawIdx] : NaN;\n  };\n  /**\n   * Get sum of data in one dimension\n   */\n\n\n  DataStore.prototype.getSum = function (dim) {\n    var dimData = this._chunks[dim];\n    var sum = 0;\n\n    if (dimData) {\n      for (var i = 0, len = this.count(); i < len; i++) {\n        var value = this.get(dim, i);\n\n        if (!isNaN(value)) {\n          sum += value;\n        }\n      }\n    }\n\n    return sum;\n  };\n  /**\n   * Get median of data in one dimension\n   */\n\n\n  DataStore.prototype.getMedian = function (dim) {\n    var dimDataArray = []; // map all data of one dimension\n\n    this.each([dim], function (val) {\n      if (!isNaN(val)) {\n        dimDataArray.push(val);\n      }\n    }); // TODO\n    // Use quick select?\n\n    var sortedDimDataArray = dimDataArray.sort(function (a, b) {\n      return a - b;\n    });\n    var len = this.count(); // calculate median\n\n    return len === 0 ? 0 : len % 2 === 1 ? sortedDimDataArray[(len - 1) / 2] : (sortedDimDataArray[len / 2] + sortedDimDataArray[len / 2 - 1]) / 2;\n  };\n  /**\n   * Retreive the index with given raw data index\n   */\n\n\n  DataStore.prototype.indexOfRawIndex = function (rawIndex) {\n    if (rawIndex >= this._rawCount || rawIndex < 0) {\n      return -1;\n    }\n\n    if (!this._indices) {\n      return rawIndex;\n    } // Indices are ascending\n\n\n    var indices = this._indices; // If rawIndex === dataIndex\n\n    var rawDataIndex = indices[rawIndex];\n\n    if (rawDataIndex != null && rawDataIndex < this._count && rawDataIndex === rawIndex) {\n      return rawIndex;\n    }\n\n    var left = 0;\n    var right = this._count - 1;\n\n    while (left <= right) {\n      var mid = (left + right) / 2 | 0;\n\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\n    return -1;\n  };\n  /**\n   * Retreive the index of nearest value\n   * @param dim\n   * @param value\n   * @param [maxDistance=Infinity]\n   * @return If and only if multiple indices has\n   *         the same value, they are put to the result.\n   */\n\n\n  DataStore.prototype.indicesOfNearest = function (dim, value, maxDistance) {\n    var chunks = this._chunks;\n    var dimData = chunks[dim];\n    var nearestIndices = [];\n\n    if (!dimData) {\n      return nearestIndices;\n    }\n\n    if (maxDistance == null) {\n      maxDistance = Infinity;\n    }\n\n    var minDist = Infinity;\n    var minDiff = -1;\n    var nearestIndicesLen = 0; // Check the test case of `test/ut/spec/data/SeriesData.js`.\n\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\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 chose the one that `diff >= 0` in this csae.\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\n        if (diff === minDiff) {\n          nearestIndices[nearestIndicesLen++] = i;\n        }\n      }\n    }\n\n    nearestIndices.length = nearestIndicesLen;\n    return nearestIndices;\n  };\n\n  DataStore.prototype.getIndices = function () {\n    var newIndices;\n    var indices = this._indices;\n\n    if (indices) {\n      var Ctor = indices.constructor;\n      var thisCount = this._count; // `new Array(a, b, c)` is different from `new Uint32Array(a, b, c)`.\n\n      if (Ctor === Array) {\n        newIndices = new Ctor(thisCount);\n\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\n      for (var i = 0; i < newIndices.length; i++) {\n        newIndices[i] = i;\n      }\n    }\n\n    return newIndices;\n  };\n  /**\n   * Data filter.\n   */\n\n\n  DataStore.prototype.filter = function (dims, cb) {\n    if (!this._count) {\n      return this;\n    }\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\n    for (var i = 0; i < count; i++) {\n      var keep = void 0;\n      var rawIdx = newStore.getRawIndex(i); // Simple optimization\n\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\n        for (; k < dimSize; k++) {\n          value[k] = chunks[dims[k]][rawIdx];\n        }\n\n        value[k] = i;\n        keep = cb.apply(null, value);\n      }\n\n      if (keep) {\n        newIndices[offset++] = rawIdx;\n      }\n    } // Set indices after filtered.\n\n\n    if (offset < count) {\n      newStore._indices = newIndices;\n    }\n\n    newStore._count = offset; // Reset data extent\n\n    newStore._extent = [];\n\n    newStore._updateGetRawIdx();\n\n    return newStore;\n  };\n  /**\n   * Select data in range. (For optimization of filter)\n   * (Manually inline code, support 5 million data filtering in data zoom.)\n   */\n\n\n  DataStore.prototype.selectRange = function (range) {\n    var newStore = this.clone();\n    var len = newStore._count;\n\n    if (!len) {\n      return this;\n    }\n\n    var dims = keys(range);\n    var dimSize = dims.length;\n\n    if (!dimSize) {\n      return this;\n    }\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\n    if (!newStore._indices) {\n      // Extreme optimization for common case. About 2x faster in chrome.\n      var idx = 0;\n\n      if (dimSize === 1) {\n        var dimStorage = storeArr[dims[0]];\n\n        for (var i = 0; i < len; i++) {\n          var val = dimStorage[i]; // 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\n          if (val >= min && val <= max || isNaN(val)) {\n            newIndices[offset++] = idx;\n          }\n\n          idx++;\n        }\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\n        for (var i = 0; i < len; i++) {\n          var val = dimStorage[i];\n          var val2 = dimStorage2[i]; // Do not filter NaN, see comment above.\n\n          if ((val >= min && val <= max || isNaN(val)) && (val2 >= min2 && val2 <= max2 || isNaN(val2))) {\n            newIndices[offset++] = idx;\n          }\n\n          idx++;\n        }\n\n        quickFinished = true;\n      }\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]; // Do not filter NaN, see comment above.\n\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\n          for (var k = 0; k < dimSize; k++) {\n            var dimk = dims[k];\n            var val = storeArr[dimk][rawIndex]; // Do not filter NaN, see comment above.\n\n            if (val < range[dimk][0] || val > range[dimk][1]) {\n              keep = false;\n            }\n          }\n\n          if (keep) {\n            newIndices[offset++] = newStore.getRawIndex(i);\n          }\n        }\n      }\n    } // Set indices after filtered.\n\n\n    if (offset < originalCount) {\n      newStore._indices = newIndices;\n    }\n\n    newStore._count = offset; // Reset data extent\n\n    newStore._extent = [];\n\n    newStore._updateGetRawIdx();\n\n    return newStore;\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\n  /**\n   * Data mapping to a new List with given dimensions\n   */\n\n\n  DataStore.prototype.map = function (dims, cb) {\n    // TODO only clone picked chunks.\n    var target = this.clone(dims);\n\n    this._updateDims(target, dims, cb);\n\n    return target;\n  };\n  /**\n   * @caution Danger!! Only used in dataStack.\n   */\n\n\n  DataStore.prototype.modify = function (dims, cb) {\n    this._updateDims(this, dims, cb);\n  };\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\n    for (var i = 0; i < dims.length; i++) {\n      rawExtent[dims[i]] = getInitialExtent();\n    }\n\n    for (var dataIndex = 0; dataIndex < dataCount; dataIndex++) {\n      var rawIndex = target.getRawIndex(dataIndex);\n\n      for (var k = 0; k < dimSize; k++) {\n        values[k] = targetChunks[dims[k]][rawIndex];\n      }\n\n      values[dimSize] = dataIndex;\n      var retValue = cb && cb.apply(null, values);\n\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\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\n          if (dimStore) {\n            dimStore[rawIndex] = val;\n          }\n\n          if (val < rawExtentOnDim[0]) {\n            rawExtentOnDim[0] = val;\n          }\n\n          if (val > rawExtentOnDim[1]) {\n            rawExtentOnDim[1] = val;\n          }\n        }\n      }\n    }\n  };\n  /**\n   * Large data down sampling using largest-triangle-three-buckets\n   * @param {string} valueDimension\n   * @param {number} targetCount\n   */\n\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)); // First frame use the first data.\n\n    newIndices[sampledIndex++] = currentRawIndex;\n\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\n      for (var idx = nextFrameStart; idx < nextFrameEnd; idx++) {\n        var rawIndex = this.getRawIndex(idx);\n        var y = dimStore[rawIndex];\n\n        if (isNaN(y)) {\n          continue;\n        }\n\n        avgY += y;\n      }\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; // Find a point from current frame that construct a triangel with largest area with previous selected point\n      // And the average of next frame.\n\n      for (var idx = frameStart; idx < frameEnd; idx++) {\n        var rawIndex = this.getRawIndex(idx);\n        var y = dimStore[rawIndex];\n\n        if (isNaN(y)) {\n          countNaN++;\n\n          if (firstNaNIndex < 0) {\n            firstNaNIndex = rawIndex;\n          }\n\n          continue;\n        } // Calculate triangle area over three buckets\n\n\n        area = Math.abs((pointAX - avgX) * (y - pointAY) - (pointAX - idx) * (avgY - pointAY));\n\n        if (area > maxArea) {\n          maxArea = area;\n          nextRawIndex = rawIndex; // Next a is this b\n        }\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\n      newIndices[sampledIndex++] = nextRawIndex;\n      currentRawIndex = nextRawIndex; // This a is the next a (chosen b)\n    } // First frame use the last data.\n\n\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  /**\n   * Large data down sampling on given dimension\n   * @param sampleIndex Sample index for name and id\n   */\n\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\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\n      for (var k = 0; k < frameSize; k++) {\n        var dataIdx = this.getRawIndex(i + k);\n        frameValues[k] = dimStore[dataIdx];\n      }\n\n      var value = sampleValue(frameValues);\n      var sampleFrameIdx = this.getRawIndex(Math.min(i + sampleIndex(frameValues, value) || 0, len - 1)); // Only write value on the filtered data\n\n      dimStore[sampleFrameIdx] = value;\n\n      if (value < rawExtentOnDim[0]) {\n        rawExtentOnDim[0] = value;\n      }\n\n      if (value > rawExtentOnDim[1]) {\n        rawExtentOnDim[1] = value;\n      }\n\n      newIndices[offset++] = sampleFrameIdx;\n    }\n\n    target._count = offset;\n    target._indices = newIndices;\n\n    target._updateGetRawIdx();\n\n    return target;\n  };\n  /**\n   * Data iteration\n   * @param ctx default this\n   * @example\n   *  list.each('x', function (x, idx) {});\n   *  list.each(['x', 'y'], function (x, y, idx) {});\n   *  list.each(function (idx) {})\n   */\n\n\n  DataStore.prototype.each = function (dims, cb) {\n    if (!this._count) {\n      return;\n    }\n\n    var dimSize = dims.length;\n    var chunks = this._chunks;\n\n    for (var i = 0, len = this.count(); i < len; i++) {\n      var rawIdx = this.getRawIndex(i); // Simple optimization\n\n      switch (dimSize) {\n        case 0:\n          cb(i);\n          break;\n\n        case 1:\n          cb(chunks[dims[0]][rawIdx], i);\n          break;\n\n        case 2:\n          cb(chunks[dims[0]][rawIdx], chunks[dims[1]][rawIdx], i);\n          break;\n\n        default:\n          var k = 0;\n          var value = [];\n\n          for (; k < dimSize; k++) {\n            value[k] = chunks[dims[k]][rawIdx];\n          } // Index\n\n\n          value[k] = i;\n          cb.apply(null, value);\n      }\n    }\n  };\n  /**\n   * Get extent of data in one dimension\n   */\n\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\n    if (!dimData) {\n      return initialExtent;\n    } // Make more strict checkings to ensure hitting cache.\n\n\n    var currEnd = this.count(); // 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\n    var useRaw = !this._indices;\n    var dimExtent;\n\n    if (useRaw) {\n      return this._rawExtent[dim].slice();\n    }\n\n    dimExtent = this._extent[dim];\n\n    if (dimExtent) {\n      return dimExtent.slice();\n    }\n\n    dimExtent = initialExtent;\n    var min = dimExtent[0];\n    var max = dimExtent[1];\n\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\n    dimExtent = [min, max];\n    this._extent[dim] = dimExtent;\n    return dimExtent;\n  };\n  /**\n   * Get raw data item\n   */\n\n\n  DataStore.prototype.getRawDataItem = function (idx) {\n    var rawIdx = this.getRawIndex(idx);\n\n    if (!this._provider.persistent) {\n      var val = [];\n      var chunks = this._chunks;\n\n      for (var i = 0; i < chunks.length; i++) {\n        val.push(chunks[i][rawIdx]);\n      }\n\n      return val;\n    } else {\n      return this._provider.getItem(rawIdx);\n    }\n  };\n  /**\n   * Clone shallow.\n   *\n   * @param clonedDims Determine which dims to clone. Will share the data if not specified.\n   */\n\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\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\n    this._copyCommonProps(target);\n\n    if (!ignoreIndices) {\n      target._indices = this._cloneIndices();\n    }\n\n    target._updateGetRawIdx();\n\n    return target;\n  };\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\n  DataStore.prototype._cloneIndices = function () {\n    if (this._indices) {\n      var Ctor = this._indices.constructor;\n      var indices = void 0;\n\n      if (Ctor === Array) {\n        var thisCount = this._indices.length;\n        indices = new Ctor(thisCount);\n\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\n      return indices;\n    }\n\n    return null;\n  };\n\n  DataStore.prototype._getRawIdxIdentity = function (idx) {\n    return idx;\n  };\n\n  DataStore.prototype._getRawIdx = function (idx) {\n    if (idx < this._count && idx >= 0) {\n      return this._indices[idx];\n    }\n\n    return -1;\n  };\n\n  DataStore.prototype._updateGetRawIdx = function () {\n    this.getRawIndex = this._indices ? this._getRawIdx : this._getRawIdxIdentity;\n  };\n\n  DataStore.internalField = function () {\n    function getDimValueSimply(dataItem, property, dataIndex, dimIndex) {\n      return parseDataValue(dataItem[dimIndex], this._dimensions[dimIndex]);\n    }\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] // 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\n  return DataStore;\n}();\n\nexport default DataStore;"],"names":["DataStore","createHashMap","assert","isFunction","shouldRetrieveDataByName","map","dim","keys","reduce","clone","parseDataValue"],"mappings":";;;;;AA8CA,IAAI,YAAY;AAKN,IAAC,kBAAkB,OAAO,gBAAgB,YAAY,QAAQ;AAC9D,IAAC,kBAAkB,OAAO,gBAAgB,YAAY,QAAQ;AAC9D,IAAC,iBAAiB,OAAO,eAAe,YAAY,QAAQ;AAC5D,IAAC,mBAAmB,OAAO,iBAAiB,YAAY,QAAQ;AAK1E,IAAI,YAAY;AAAA,EACd,SAAS;AAAA,EACT,OAAO;AAAA,EAEP,WAAW;AAAA,EACX,UAAU;AAAA,EACV,QAAQ;AACV;AACA,IAAI;AAEJ,SAAS,eAAe,UAAU;AAEhC,SAAO,WAAW,QAAQ,kBAAkB;AAC9C;AAIA,SAAS,mBAAmB;AAC1B,SAAO,CAAC,UAAU,SAAS;AAC7B;AAIA,SAAS,WAAW,eAAe;AACjC,MAAI,OAAO,cAAc;AAEzB,SAAO,SAAS,QAAQ,cAAc,MAAK,IAAK,IAAI,KAAK,aAAa;AACxE;AAEA,SAAS,aAAa,OAAO,QAAQ,SAAS,KAAK,QAAQ;AACzD,MAAI,WAAW,UAAU,WAAW;AAEpC,MAAI,QAAQ;AACV,QAAI,WAAW,MAAM;AACrB,QAAI,SAAS,YAAY,SAAS;AAElC,QAAI,EAAE,WAAW,MAAM;AACrB,UAAI,WAAW,IAAI,SAAS,GAAG;AAG/B,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,iBAAS,KAAK,SAAS;AAAA,MACxB;AAED,YAAM,UAAU;AAAA,IACjB;AAAA,EACL,OAAS;AACL,UAAM,UAAU,IAAI,SAAS,GAAG;AAAA,EACjC;AACH;AAOG,IAAC,YAEJ,WAAY;AACV,WAASA,aAAY;AACnB,SAAK,UAAU;AAEf,SAAK,aAAa;AAClB,SAAK,UAAU;AACf,SAAK,SAAS;AACd,SAAK,YAAY;AACjB,SAAK,oBAAoBC,KAAAA;EAC1B;AAMD,EAAAD,WAAU,UAAU,WAAW,SAAU,UAAU,iBAAiB,gBAAgB;AAClF,QAAI,QAAQ,IAAI,aAAa,cAAc;AACzCE,kBAAOC,KAAAA,WAAW,SAAS,OAAO,KAAKA,KAAU,WAAC,SAAS,KAAK,GAAG,wBAAwB;AAAA,IAC5F;AAED,SAAK,YAAY;AAEjB,SAAK,UAAU;AACf,SAAK,WAAW;AAChB,SAAK,cAAc,KAAK;AACxB,QAAI,SAAS,SAAS;AACtB,QAAI,gBAAgB,KAAK,wBAAwB,uBAAuB,OAAO;AAE/E,SAAK,kBAAkB,kBAAkB;AAEzC,SAAK,aAAa;AAClB,QAAI,yBAAyBC,gCAAyB,MAAM;AAC5D,SAAK,cAAcC,KAAAA,IAAI,iBAAiB,SAAU,KAAK;AACrD,UAAI,QAAQ,IAAI,aAAa,cAAc;AACzC,YAAI,wBAAwB;AAC1BH,eAAAA,OAAO,IAAI,YAAY,IAAI;AAAA,QAC5B;AAAA,MACF;AAED,aAAO;AAAA,QAEL,MAAM,IAAI;AAAA,QACV,UAAU,IAAI;AAAA,MACtB;AAAA,IACA,CAAK;AAED,SAAK,sBAAsB,GAAG,SAAS,MAAO,CAAA;AAAA,EAClD;AAEE,EAAAF,WAAU,UAAU,cAAc,WAAY;AAC5C,WAAO,KAAK;AAAA,EAChB;AAUE,EAAAA,WAAU,UAAU,YAAY,WAAY;AAC1C,WAAO,KAAK,UAAU;EAC1B;AAME,EAAAA,WAAU,UAAU,6BAA6B,SAAU,SAAS,MAAM;AACxE,QAAI,mBAAmB,KAAK;AAC5B,QAAI,aAAa,KAAK;AACtB,QAAI,aAAa,iBAAiB,IAAI,OAAO;AAE7C,QAAI,cAAc,MAAM;AACtB,UAAI,WAAW,YAAY,SAAS,MAAM;AACxC,eAAO;AAAA,MACR;AAAA,IACP,OAAW;AACL,mBAAa,WAAW;AAAA,IACzB;AAED,eAAW,cAAc;AAAA,MACvB;AAAA,IACN;AACI,qBAAiB,IAAI,SAAS,UAAU;AACxC,SAAK,QAAQ,cAAc,IAAI,UAAU,QAAQ,SAAS,KAAK,SAAS;AACxE,SAAK,WAAW,cAAc,iBAAgB;AAC9C,WAAO;AAAA,EACX;AAEE,EAAAA,WAAU,UAAU,qBAAqB,SAAU,QAAQ,aAAa;AACtE,QAAI,QAAQ,KAAK,QAAQ;AACzB,QAAI,MAAM,KAAK,YAAY;AAC3B,QAAI,aAAa,KAAK;AACtB,QAAI,SAAS,IAAI,iBAAiB;AAClC,QAAI,MAAM,MAAM;AAEhB,QAAI,WAAW,GAAG;AAGhB,iBAAW,UAAU;IACtB;AAED,QAAI,eAAe,WAAW;AAE9B,aAAS,IAAI,QAAQ,IAAI,KAAK,KAAK;AACjC,UAAI,MAAM,MAAM,KAAK,YAAY,gBAAgB,MAAM,EAAE;AAEzD,UAAI,CAAC,MAAM,GAAG,GAAG;AACf,qBAAa,KAAK,KAAK,IAAI,KAAK,aAAa,EAAE;AAC/C,qBAAa,KAAK,KAAK,IAAI,KAAK,aAAa,EAAE;AAAA,MAChD;AAAA,IACF;AAED,QAAI,cAAc;AAClB,QAAI,gBAAgB;AACpB,QAAI,OAAO;AAAA,EACf;AAEE,EAAAA,WAAU,UAAU,iBAAiB,SAAU,QAAQ;AACrD,QAAI,UAAU,KAAK,YAAY;AAC/B,QAAI,cAAc,QAAQ;AAC1B,WAAO;AAAA,EACX;AAEE,EAAAA,WAAU,UAAU,uBAAuB,SAAU,UAAU;AAC7D,QAAI,OAAO,KAAK,YAAY;AAC5B,WAAO,QAAQ,KAAK;AAAA,EACxB;AAME,EAAAA,WAAU,UAAU,aAAa,SAAU,MAAM;AAC/C,QAAI,QAAQ,IAAI,aAAa,cAAc;AACzCE,WAAAA,OAAO,CAAC,KAAK,UAAU,4CAA4C;AAAA,IACpE;AAED,QAAI,WAAW,KAAK;AACpB,QAAI,QAAQ,KAAK;AACjB,aAAS,WAAW,IAAI;AACxB,QAAI,MAAM,SAAS;AAEnB,QAAI,CAAC,SAAS,YAAY;AACxB,aAAO;AAAA,IACR;AAED,QAAI,QAAQ,KAAK;AACf,WAAK,sBAAsB,OAAO,KAAK,IAAI;AAAA,IAC5C;AAED,WAAO,CAAC,OAAO,GAAG;AAAA,EACtB;AAEE,EAAAF,WAAU,UAAU,eAAe,SAAU,QAAQ,YAAY;AAC/D,QAAI,SAAS,KAAK;AAClB,QAAI,aAAa,KAAK;AACtB,QAAI,SAAS,WAAW;AACxB,QAAI,YAAY,KAAK;AACrB,QAAI,QAAQ,KAAK;AACjB,QAAI,MAAM,QAAQ,KAAK,IAAI,OAAO,QAAQ,cAAc,CAAC;AAEzD,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAI,MAAM,WAAW;AACrB,mBAAa,QAAQ,GAAG,IAAI,MAAM,KAAK,IAAI;AAAA,IAC5C;AAED,QAAI,gBAAgB,CAAA;AAEpB,aAAS,MAAM,OAAO,MAAM,KAAK,OAAO;AACtC,UAAI,YAAY,MAAM;AAEtB,eAAS,SAAS,GAAG,SAAS,QAAQ,UAAU;AAC9C,YAAI,MAAM,WAAW;AACrB,YAAI,MAAM,uBAAuB,UAAU,KAAK,MAAM,OAAO,cAAc,eAAe,IAAI,UAAU,WAAW,MAAM;AACzH,eAAO,QAAQ,OAAO;AACtB,YAAI,eAAe,UAAU;AAC7B,cAAM,aAAa,OAAO,aAAa,KAAK;AAC5C,cAAM,aAAa,OAAO,aAAa,KAAK;AAAA,MAC7C;AAAA,IACF;AAED,SAAK,YAAY,KAAK,SAAS;AAC/B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,IACN;AAAA,EACA;AAEE,EAAAA,WAAU,UAAU,wBAAwB,SAAU,OAAO,KAAK,QAAQ;AACxE,QAAI,WAAW,KAAK;AACpB,QAAI,SAAS,KAAK;AAClB,QAAI,aAAa,KAAK;AACtB,QAAI,SAAS,WAAW;AACxB,QAAI,YAAY,KAAK;AACrB,QAAI,WAAWK,KAAAA,IAAI,YAAY,SAAUC,MAAK;AAC5C,aAAOA,KAAI;AAAA,IACjB,CAAK;AAED,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAI,MAAM,WAAW;AAErB,UAAI,CAAC,UAAU,IAAI;AACjB,kBAAU,KAAK;MAChB;AAED,mBAAa,QAAQ,GAAG,IAAI,MAAM,KAAK,MAAM;AAAA,IAC9C;AAED,QAAI,SAAS,aAAa;AACxB,eAAS,YAAY,OAAO,KAAK,QAAQ,SAAS;AAAA,IACxD,OAAW;AACL,UAAI,WAAW,CAAA;AAEf,eAAS,MAAM,OAAO,MAAM,KAAK,OAAO;AAEtC,mBAAW,SAAS,QAAQ,KAAK,QAAQ;AAQzC,iBAAS,SAAS,GAAG,SAAS,QAAQ,UAAU;AAC9C,cAAI,aAAa,OAAO;AAExB,cAAI,MAAM,KAAK,gBAAgB,UAAU,SAAS,SAAS,KAAK,MAAM;AAEtE,qBAAW,OAAO;AAClB,cAAI,eAAe,UAAU;AAC7B,gBAAM,aAAa,OAAO,aAAa,KAAK;AAC5C,gBAAM,aAAa,OAAO,aAAa,KAAK;AAAA,QAC7C;AAAA,MACF;AAAA,IACF;AAED,QAAI,CAAC,SAAS,cAAc,SAAS,OAAO;AAE1C,eAAS,MAAK;AAAA,IACf;AAED,SAAK,YAAY,KAAK,SAAS;AAE/B,SAAK,UAAU;EACnB;AAEE,EAAAN,WAAU,UAAU,QAAQ,WAAY;AACtC,WAAO,KAAK;AAAA,EAChB;AAME,EAAAA,WAAU,UAAU,MAAM,SAAU,KAAK,KAAK;AAC5C,QAAI,EAAE,OAAO,KAAK,MAAM,KAAK,SAAS;AACpC,aAAO;AAAA,IACR;AAED,QAAI,WAAW,KAAK,QAAQ;AAC5B,WAAO,WAAW,SAAS,KAAK,YAAY,GAAG,KAAK;AAAA,EACxD;AAEE,EAAAA,WAAU,UAAU,YAAY,SAAU,YAAY,KAAK;AACzD,QAAI,SAAS,CAAA;AACb,QAAI,SAAS,CAAA;AAEb,QAAI,OAAO,MAAM;AACf,YAAM;AAEN,mBAAa,CAAA;AAEb,eAAS,IAAI,GAAG,IAAI,KAAK,YAAY,QAAQ,KAAK;AAChD,eAAO,KAAK,CAAC;AAAA,MACd;AAAA,IACP,OAAW;AACL,eAAS;AAAA,IACV;AAED,aAAS,IAAI,GAAG,MAAM,OAAO,QAAQ,IAAI,KAAK,KAAK;AACjD,aAAO,KAAK,KAAK,IAAI,OAAO,IAAI,GAAG,CAAC;AAAA,IACrC;AAED,WAAO;AAAA,EACX;AAME,EAAAA,WAAU,UAAU,gBAAgB,SAAU,KAAK,QAAQ;AACzD,QAAI,EAAE,UAAU,KAAK,SAAS,KAAK,YAAY;AAC7C,aAAO;AAAA,IACR;AAED,QAAI,WAAW,KAAK,QAAQ;AAC5B,WAAO,WAAW,SAAS,UAAU;AAAA,EACzC;AAME,EAAAA,WAAU,UAAU,SAAS,SAAU,KAAK;AAC1C,QAAI,UAAU,KAAK,QAAQ;AAC3B,QAAI,MAAM;AAEV,QAAI,SAAS;AACX,eAAS,IAAI,GAAG,MAAM,KAAK,MAAK,GAAI,IAAI,KAAK,KAAK;AAChD,YAAI,QAAQ,KAAK,IAAI,KAAK,CAAC;AAE3B,YAAI,CAAC,MAAM,KAAK,GAAG;AACjB,iBAAO;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAED,WAAO;AAAA,EACX;AAME,EAAAA,WAAU,UAAU,YAAY,SAAU,KAAK;AAC7C,QAAI,eAAe,CAAA;AAEnB,SAAK,KAAK,CAAC,GAAG,GAAG,SAAU,KAAK;AAC9B,UAAI,CAAC,MAAM,GAAG,GAAG;AACf,qBAAa,KAAK,GAAG;AAAA,MACtB;AAAA,IACP,CAAK;AAGD,QAAI,qBAAqB,aAAa,KAAK,SAAU,GAAG,GAAG;AACzD,aAAO,IAAI;AAAA,IACjB,CAAK;AACD,QAAI,MAAM,KAAK;AAEf,WAAO,QAAQ,IAAI,IAAI,MAAM,MAAM,IAAI,oBAAoB,MAAM,KAAK,MAAM,mBAAmB,MAAM,KAAK,mBAAmB,MAAM,IAAI,MAAM;AAAA,EACjJ;AAME,EAAAA,WAAU,UAAU,kBAAkB,SAAU,UAAU;AACxD,QAAI,YAAY,KAAK,aAAa,WAAW,GAAG;AAC9C,aAAO;AAAA,IACR;AAED,QAAI,CAAC,KAAK,UAAU;AAClB,aAAO;AAAA,IACR;AAGD,QAAI,UAAU,KAAK;AAEnB,QAAI,eAAe,QAAQ;AAE3B,QAAI,gBAAgB,QAAQ,eAAe,KAAK,UAAU,iBAAiB,UAAU;AACnF,aAAO;AAAA,IACR;AAED,QAAI,OAAO;AACX,QAAI,QAAQ,KAAK,SAAS;AAE1B,WAAO,QAAQ,OAAO;AACpB,UAAI,OAAO,OAAO,SAAS,IAAI;AAE/B,UAAI,QAAQ,OAAO,UAAU;AAC3B,eAAO,MAAM;AAAA,MACd,WAAU,QAAQ,OAAO,UAAU;AAClC,gBAAQ,MAAM;AAAA,MACtB,OAAa;AACL,eAAO;AAAA,MACR;AAAA,IACF;AAED,WAAO;AAAA,EACX;AAWE,EAAAA,WAAU,UAAU,mBAAmB,SAAU,KAAK,OAAO,aAAa;AACxE,QAAI,SAAS,KAAK;AAClB,QAAI,UAAU,OAAO;AACrB,QAAI,iBAAiB,CAAA;AAErB,QAAI,CAAC,SAAS;AACZ,aAAO;AAAA,IACR;AAED,QAAI,eAAe,MAAM;AACvB,oBAAc;AAAA,IACf;AAED,QAAI,UAAU;AACd,QAAI,UAAU;AACd,QAAI,oBAAoB;AAExB,aAAS,IAAI,GAAG,MAAM,KAAK,MAAK,GAAI,IAAI,KAAK,KAAK;AAChD,UAAI,YAAY,KAAK,YAAY,CAAC;AAClC,UAAI,OAAO,QAAQ,QAAQ;AAC3B,UAAI,OAAO,KAAK,IAAI,IAAI;AAExB,UAAI,QAAQ,aAAa;AAOvB,YAAI,OAAO,WAAW,SAAS,WAAW,QAAQ,KAAK,UAAU,GAAG;AAClE,oBAAU;AACV,oBAAU;AACV,8BAAoB;AAAA,QACrB;AAED,YAAI,SAAS,SAAS;AACpB,yBAAe,uBAAuB;AAAA,QACvC;AAAA,MACF;AAAA,IACF;AAED,mBAAe,SAAS;AACxB,WAAO;AAAA,EACX;AAEE,EAAAA,WAAU,UAAU,aAAa,WAAY;AAC3C,QAAI;AACJ,QAAI,UAAU,KAAK;AAEnB,QAAI,SAAS;AACX,UAAI,OAAO,QAAQ;AACnB,UAAI,YAAY,KAAK;AAErB,UAAI,SAAS,OAAO;AAClB,qBAAa,IAAI,KAAK,SAAS;AAE/B,iBAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,qBAAW,KAAK,QAAQ;AAAA,QACzB;AAAA,MACT,OAAa;AACL,qBAAa,IAAI,KAAK,QAAQ,QAAQ,GAAG,SAAS;AAAA,MACnD;AAAA,IACP,OAAW;AACL,UAAI,OAAO,eAAe,KAAK,SAAS;AACxC,mBAAa,IAAI,KAAK,KAAK,MAAO,CAAA;AAElC,eAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,mBAAW,KAAK;AAAA,MACjB;AAAA,IACF;AAED,WAAO;AAAA,EACX;AAME,EAAAA,WAAU,UAAU,SAAS,SAAU,MAAM,IAAI;AAC/C,QAAI,CAAC,KAAK,QAAQ;AAChB,aAAO;AAAA,IACR;AAED,QAAI,WAAW,KAAK;AACpB,QAAI,QAAQ,SAAS;AACrB,QAAI,OAAO,eAAe,SAAS,SAAS;AAC5C,QAAI,aAAa,IAAI,KAAK,KAAK;AAC/B,QAAI,QAAQ,CAAA;AACZ,QAAI,UAAU,KAAK;AACnB,QAAI,SAAS;AACb,QAAI,OAAO,KAAK;AAChB,QAAI,SAAS,SAAS;AAEtB,aAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,UAAI,OAAO;AACX,UAAI,SAAS,SAAS,YAAY,CAAC;AAEnC,UAAI,YAAY,GAAG;AACjB,eAAO,GAAG,CAAC;AAAA,MACnB,WAAiB,YAAY,GAAG;AACxB,YAAI,MAAM,OAAO,MAAM;AACvB,eAAO,GAAG,KAAK,CAAC;AAAA,MACxB,OAAa;AACL,YAAI,IAAI;AAER,eAAO,IAAI,SAAS,KAAK;AACvB,gBAAM,KAAK,OAAO,KAAK,IAAI;AAAA,QAC5B;AAED,cAAM,KAAK;AACX,eAAO,GAAG,MAAM,MAAM,KAAK;AAAA,MAC5B;AAED,UAAI,MAAM;AACR,mBAAW,YAAY;AAAA,MACxB;AAAA,IACF;AAGD,QAAI,SAAS,OAAO;AAClB,eAAS,WAAW;AAAA,IACrB;AAED,aAAS,SAAS;AAElB,aAAS,UAAU;AAEnB,aAAS,iBAAgB;AAEzB,WAAO;AAAA,EACX;AAOE,EAAAA,WAAU,UAAU,cAAc,SAAU,OAAO;AACjD,QAAI,WAAW,KAAK;AACpB,QAAI,MAAM,SAAS;AAEnB,QAAI,CAAC,KAAK;AACR,aAAO;AAAA,IACR;AAED,QAAI,OAAOO,UAAK,KAAK;AACrB,QAAI,UAAU,KAAK;AAEnB,QAAI,CAAC,SAAS;AACZ,aAAO;AAAA,IACR;AAED,QAAI,gBAAgB,SAAS;AAC7B,QAAI,OAAO,eAAe,SAAS,SAAS;AAC5C,QAAI,aAAa,IAAI,KAAK,aAAa;AACvC,QAAI,SAAS;AACb,QAAI,OAAO,KAAK;AAChB,QAAI,MAAM,MAAM,MAAM;AACtB,QAAI,MAAM,MAAM,MAAM;AACtB,QAAI,WAAW,SAAS;AACxB,QAAI,gBAAgB;AAEpB,QAAI,CAAC,SAAS,UAAU;AAEtB,UAAI,MAAM;AAEV,UAAI,YAAY,GAAG;AACjB,YAAI,aAAa,SAAS,KAAK;AAE/B,iBAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,cAAI,MAAM,WAAW;AAMrB,cAAI,OAAO,OAAO,OAAO,OAAO,MAAM,GAAG,GAAG;AAC1C,uBAAW,YAAY;AAAA,UACxB;AAED;AAAA,QACD;AAED,wBAAgB;AAAA,MACxB,WAAiB,YAAY,GAAG;AACxB,YAAI,aAAa,SAAS,KAAK;AAC/B,YAAI,cAAc,SAAS,KAAK;AAChC,YAAI,OAAO,MAAM,KAAK,IAAI;AAC1B,YAAI,OAAO,MAAM,KAAK,IAAI;AAE1B,iBAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,cAAI,MAAM,WAAW;AACrB,cAAI,OAAO,YAAY;AAEvB,eAAK,OAAO,OAAO,OAAO,OAAO,MAAM,GAAG,OAAO,QAAQ,QAAQ,QAAQ,QAAQ,MAAM,IAAI,IAAI;AAC7F,uBAAW,YAAY;AAAA,UACxB;AAED;AAAA,QACD;AAED,wBAAgB;AAAA,MACjB;AAAA,IACF;AAED,QAAI,CAAC,eAAe;AAClB,UAAI,YAAY,GAAG;AACjB,iBAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,cAAI,WAAW,SAAS,YAAY,CAAC;AACrC,cAAI,MAAM,SAAS,KAAK,IAAI;AAE5B,cAAI,OAAO,OAAO,OAAO,OAAO,MAAM,GAAG,GAAG;AAC1C,uBAAW,YAAY;AAAA,UACxB;AAAA,QACF;AAAA,MACT,OAAa;AACL,iBAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,cAAI,OAAO;AACX,cAAI,WAAW,SAAS,YAAY,CAAC;AAErC,mBAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,gBAAI,OAAO,KAAK;AAChB,gBAAI,MAAM,SAAS,MAAM;AAEzB,gBAAI,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,IAAI;AAChD,qBAAO;AAAA,YACR;AAAA,UACF;AAED,cAAI,MAAM;AACR,uBAAW,YAAY,SAAS,YAAY,CAAC;AAAA,UAC9C;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAGD,QAAI,SAAS,eAAe;AAC1B,eAAS,WAAW;AAAA,IACrB;AAED,aAAS,SAAS;AAElB,aAAS,UAAU;AAEnB,aAAS,iBAAgB;AAEzB,WAAO;AAAA,EACX;AAgBE,EAAAP,WAAU,UAAU,MAAM,SAAU,MAAM,IAAI;AAE5C,QAAI,SAAS,KAAK,MAAM,IAAI;AAE5B,SAAK,YAAY,QAAQ,MAAM,EAAE;AAEjC,WAAO;AAAA,EACX;AAME,EAAAA,WAAU,UAAU,SAAS,SAAU,MAAM,IAAI;AAC/C,SAAK,YAAY,MAAM,MAAM,EAAE;AAAA,EACnC;AAEE,EAAAA,WAAU,UAAU,cAAc,SAAU,QAAQ,MAAM,IAAI;AAC5D,QAAI,eAAe,OAAO;AAC1B,QAAI,cAAc,CAAA;AAClB,QAAI,UAAU,KAAK;AACnB,QAAI,YAAY,OAAO;AACvB,QAAI,SAAS,CAAA;AACb,QAAI,YAAY,OAAO;AAEvB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,gBAAU,KAAK,MAAM,iBAAgB;AAAA,IACtC;AAED,aAAS,YAAY,GAAG,YAAY,WAAW,aAAa;AAC1D,UAAI,WAAW,OAAO,YAAY,SAAS;AAE3C,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,eAAO,KAAK,aAAa,KAAK,IAAI;AAAA,MACnC;AAED,aAAO,WAAW;AAClB,UAAI,WAAW,MAAM,GAAG,MAAM,MAAM,MAAM;AAE1C,UAAI,YAAY,MAAM;AAEpB,YAAI,OAAO,aAAa,UAAU;AAChC,sBAAY,KAAK;AACjB,qBAAW;AAAA,QACZ;AAED,iBAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,cAAI,MAAM,KAAK;AACf,cAAI,MAAM,SAAS;AACnB,cAAI,iBAAiB,UAAU;AAC/B,cAAI,WAAW,aAAa;AAE5B,cAAI,UAAU;AACZ,qBAAS,YAAY;AAAA,UACtB;AAED,cAAI,MAAM,eAAe,IAAI;AAC3B,2BAAe,KAAK;AAAA,UACrB;AAED,cAAI,MAAM,eAAe,IAAI;AAC3B,2BAAe,KAAK;AAAA,UACrB;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACL;AAQE,EAAAA,WAAU,UAAU,iBAAiB,SAAU,gBAAgB,MAAM;AACnE,QAAI,SAAS,KAAK,MAAM,CAAC,cAAc,GAAG,IAAI;AAC9C,QAAI,gBAAgB,OAAO;AAC3B,QAAI,WAAW,cAAc;AAC7B,QAAI,MAAM,KAAK;AACf,QAAI,eAAe;AACnB,QAAI,YAAY,KAAK,MAAM,IAAI,IAAI;AACnC,QAAI,kBAAkB,KAAK,YAAY,CAAC;AACxC,QAAI;AACJ,QAAI;AACJ,QAAI;AACJ,QAAI,aAAa,KAAK,eAAe,KAAK,SAAS,GAAG,KAAK,KAAK,KAAK,KAAK,MAAM,SAAS,IAAI,KAAK,GAAG,GAAG,CAAC;AAEzG,eAAW,kBAAkB;AAE7B,aAAS,IAAI,GAAG,IAAI,MAAM,GAAG,KAAK,WAAW;AAC3C,UAAI,iBAAiB,KAAK,IAAI,IAAI,WAAW,MAAM,CAAC;AACpD,UAAI,eAAe,KAAK,IAAI,IAAI,YAAY,GAAG,GAAG;AAClD,UAAI,QAAQ,eAAe,kBAAkB;AAC7C,UAAI,OAAO;AAEX,eAAS,MAAM,gBAAgB,MAAM,cAAc,OAAO;AACxD,YAAI,WAAW,KAAK,YAAY,GAAG;AACnC,YAAI,IAAI,SAAS;AAEjB,YAAI,MAAM,CAAC,GAAG;AACZ;AAAA,QACD;AAED,gBAAQ;AAAA,MACT;AAED,cAAQ,eAAe;AACvB,UAAI,aAAa;AACjB,UAAI,WAAW,KAAK,IAAI,IAAI,WAAW,GAAG;AAC1C,UAAI,UAAU,IAAI;AAClB,UAAI,UAAU,SAAS;AACvB,gBAAU;AACV,qBAAe;AACf,UAAI,gBAAgB;AACpB,UAAI,WAAW;AAGf,eAAS,MAAM,YAAY,MAAM,UAAU,OAAO;AAChD,YAAI,WAAW,KAAK,YAAY,GAAG;AACnC,YAAI,IAAI,SAAS;AAEjB,YAAI,MAAM,CAAC,GAAG;AACZ;AAEA,cAAI,gBAAgB,GAAG;AACrB,4BAAgB;AAAA,UACjB;AAED;AAAA,QACD;AAGD,eAAO,KAAK,KAAK,UAAU,SAAS,IAAI,YAAY,UAAU,QAAQ,OAAO,QAAQ;AAErF,YAAI,OAAO,SAAS;AAClB,oBAAU;AACV,yBAAe;AAAA,QAChB;AAAA,MACF;AAED,UAAI,WAAW,KAAK,WAAW,WAAW,YAAY;AAGpD,mBAAW,kBAAkB,KAAK,IAAI,eAAe,YAAY;AACjE,uBAAe,KAAK,IAAI,eAAe,YAAY;AAAA,MACpD;AAED,iBAAW,kBAAkB;AAC7B,wBAAkB;AAAA,IACnB;AAGD,eAAW,kBAAkB,KAAK,YAAY,MAAM,CAAC;AACrD,WAAO,SAAS;AAChB,WAAO,WAAW;AAClB,WAAO,cAAc,KAAK;AAC1B,WAAO;AAAA,EACX;AAOE,EAAAA,WAAU,UAAU,aAAa,SAAU,WAAW,MAAM,aAAa,aAAa;AACpF,QAAI,SAAS,KAAK,MAAM,CAAC,SAAS,GAAG,IAAI;AACzC,QAAI,gBAAgB,OAAO;AAC3B,QAAI,cAAc,CAAA;AAClB,QAAI,YAAY,KAAK,MAAM,IAAI,IAAI;AACnC,QAAI,WAAW,cAAc;AAC7B,QAAI,MAAM,KAAK;AACf,QAAI,iBAAiB,OAAO,WAAW,aAAa,iBAAgB;AACpE,QAAI,aAAa,KAAK,eAAe,KAAK,SAAS,GAAG,KAAK,KAAK,MAAM,SAAS,CAAC;AAChF,QAAI,SAAS;AAEb,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,WAAW;AAEvC,UAAI,YAAY,MAAM,GAAG;AACvB,oBAAY,MAAM;AAClB,oBAAY,SAAS;AAAA,MACtB;AAED,eAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,YAAI,UAAU,KAAK,YAAY,IAAI,CAAC;AACpC,oBAAY,KAAK,SAAS;AAAA,MAC3B;AAED,UAAI,QAAQ,YAAY,WAAW;AACnC,UAAI,iBAAiB,KAAK,YAAY,KAAK,IAAI,IAAI,YAAY,aAAa,KAAK,KAAK,GAAG,MAAM,CAAC,CAAC;AAEjG,eAAS,kBAAkB;AAE3B,UAAI,QAAQ,eAAe,IAAI;AAC7B,uBAAe,KAAK;AAAA,MACrB;AAED,UAAI,QAAQ,eAAe,IAAI;AAC7B,uBAAe,KAAK;AAAA,MACrB;AAED,iBAAW,YAAY;AAAA,IACxB;AAED,WAAO,SAAS;AAChB,WAAO,WAAW;AAElB,WAAO,iBAAgB;AAEvB,WAAO;AAAA,EACX;AAWE,EAAAA,WAAU,UAAU,OAAO,SAAU,MAAM,IAAI;AAC7C,QAAI,CAAC,KAAK,QAAQ;AAChB;AAAA,IACD;AAED,QAAI,UAAU,KAAK;AACnB,QAAI,SAAS,KAAK;AAElB,aAAS,IAAI,GAAG,MAAM,KAAK,MAAK,GAAI,IAAI,KAAK,KAAK;AAChD,UAAI,SAAS,KAAK,YAAY,CAAC;AAE/B,cAAQ;AAAA,aACD;AACH,aAAG,CAAC;AACJ;AAAA,aAEG;AACH,aAAG,OAAO,KAAK,IAAI,SAAS,CAAC;AAC7B;AAAA,aAEG;AACH,aAAG,OAAO,KAAK,IAAI,SAAS,OAAO,KAAK,IAAI,SAAS,CAAC;AACtD;AAAA;AAGA,cAAI,IAAI;AACR,cAAI,QAAQ,CAAA;AAEZ,iBAAO,IAAI,SAAS,KAAK;AACvB,kBAAM,KAAK,OAAO,KAAK,IAAI;AAAA,UAC5B;AAGD,gBAAM,KAAK;AACX,aAAG,MAAM,MAAM,KAAK;AAAA;AAAA,IAEzB;AAAA,EACL;AAME,EAAAA,WAAU,UAAU,gBAAgB,SAAU,KAAK;AAEjD,QAAI,UAAU,KAAK,QAAQ;AAC3B,QAAI,gBAAgB;AAEpB,QAAI,CAAC,SAAS;AACZ,aAAO;AAAA,IACR;AAGD,QAAI,UAAU,KAAK;AAInB,QAAI,SAAS,CAAC,KAAK;AACnB,QAAI;AAEJ,QAAI,QAAQ;AACV,aAAO,KAAK,WAAW,KAAK,MAAK;AAAA,IAClC;AAED,gBAAY,KAAK,QAAQ;AAEzB,QAAI,WAAW;AACb,aAAO,UAAU;IAClB;AAED,gBAAY;AACZ,QAAI,MAAM,UAAU;AACpB,QAAI,MAAM,UAAU;AAEpB,aAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,UAAI,SAAS,KAAK,YAAY,CAAC;AAC/B,UAAI,QAAQ,QAAQ;AACpB,cAAQ,QAAQ,MAAM;AACtB,cAAQ,QAAQ,MAAM;AAAA,IACvB;AAED,gBAAY,CAAC,KAAK,GAAG;AACrB,SAAK,QAAQ,OAAO;AACpB,WAAO;AAAA,EACX;AAME,EAAAA,WAAU,UAAU,iBAAiB,SAAU,KAAK;AAClD,QAAI,SAAS,KAAK,YAAY,GAAG;AAEjC,QAAI,CAAC,KAAK,UAAU,YAAY;AAC9B,UAAI,MAAM,CAAA;AACV,UAAI,SAAS,KAAK;AAElB,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,YAAI,KAAK,OAAO,GAAG,OAAO;AAAA,MAC3B;AAED,aAAO;AAAA,IACb,OAAW;AACL,aAAO,KAAK,UAAU,QAAQ,MAAM;AAAA,IACrC;AAAA,EACL;AAQE,EAAAA,WAAU,UAAU,QAAQ,SAAU,YAAY,eAAe;AAC/D,QAAI,SAAS,IAAIA;AACjB,QAAI,SAAS,KAAK;AAClB,QAAI,gBAAgB,cAAcQ,KAAAA,OAAO,YAAY,SAAU,KAAK,QAAQ;AAC1E,UAAI,UAAU;AACd,aAAO;AAAA,IACR,GAAE,CAAE,CAAA;AAEL,QAAI,eAAe;AACjB,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AAEtC,eAAO,QAAQ,KAAK,CAAC,cAAc,KAAK,OAAO,KAAK,WAAW,OAAO,EAAE;AAAA,MACzE;AAAA,IACP,OAAW;AACL,aAAO,UAAU;AAAA,IAClB;AAED,SAAK,iBAAiB,MAAM;AAE5B,QAAI,CAAC,eAAe;AAClB,aAAO,WAAW,KAAK;IACxB;AAED,WAAO,iBAAgB;AAEvB,WAAO;AAAA,EACX;AAEE,EAAAR,WAAU,UAAU,mBAAmB,SAAU,QAAQ;AACvD,WAAO,SAAS,KAAK;AACrB,WAAO,YAAY,KAAK;AACxB,WAAO,YAAY,KAAK;AACxB,WAAO,cAAc,KAAK;AAC1B,WAAO,UAAUS,KAAAA,MAAM,KAAK,OAAO;AACnC,WAAO,aAAaA,KAAAA,MAAM,KAAK,UAAU;AAAA,EAC7C;AAEE,EAAAT,WAAU,UAAU,gBAAgB,WAAY;AAC9C,QAAI,KAAK,UAAU;AACjB,UAAI,OAAO,KAAK,SAAS;AACzB,UAAI,UAAU;AAEd,UAAI,SAAS,OAAO;AAClB,YAAI,YAAY,KAAK,SAAS;AAC9B,kBAAU,IAAI,KAAK,SAAS;AAE5B,iBAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,kBAAQ,KAAK,KAAK,SAAS;AAAA,QAC5B;AAAA,MACT,OAAa;AACL,kBAAU,IAAI,KAAK,KAAK,QAAQ;AAAA,MACjC;AAED,aAAO;AAAA,IACR;AAED,WAAO;AAAA,EACX;AAEE,EAAAA,WAAU,UAAU,qBAAqB,SAAU,KAAK;AACtD,WAAO;AAAA,EACX;AAEE,EAAAA,WAAU,UAAU,aAAa,SAAU,KAAK;AAC9C,QAAI,MAAM,KAAK,UAAU,OAAO,GAAG;AACjC,aAAO,KAAK,SAAS;AAAA,IACtB;AAED,WAAO;AAAA,EACX;AAEE,EAAAA,WAAU,UAAU,mBAAmB,WAAY;AACjD,SAAK,cAAc,KAAK,WAAW,KAAK,aAAa,KAAK;AAAA,EAC9D;AAEE,EAAAA,WAAU,gBAAgB,WAAY;AACpC,aAAS,kBAAkB,UAAU,UAAU,WAAW,UAAU;AAClE,aAAOU,gBAAAA,eAAe,SAAS,WAAW,KAAK,YAAY,SAAS;AAAA,IACrE;AAED,6BAAyB;AAAA,MACvB,WAAW;AAAA,MACX,YAAY,SAAU,UAAU,UAAU,WAAW,UAAU;AAC7D,eAAOA,gBAAAA,eAAe,SAAS,WAAW,KAAK,YAAY,SAAS;AAAA,MACrE;AAAA,MACD,cAAc;AAAA,MACd,UAAU,SAAU,UAAU,UAAU,WAAW,UAAU;AAK3D,YAAI,QAAQ,aAAa,SAAS,SAAS,OAAO,WAAW,SAAS;AACtE,eAAOA,gBAAc,eAAC,iBAAiB,QAAQ,MAAM,YACnD,OAAO,KAAK,YAAY,SAAS;AAAA,MACpC;AAAA,MACD,YAAY,SAAU,UAAU,UAAU,WAAW,UAAU;AAC7D,eAAO,SAAS;AAAA,MACjB;AAAA,IACP;AAAA,EACA;AAEE,SAAOV;AACT,EAAC;;;;;;"}

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

@@ -1,63 +0,0 @@
-"use strict";
-Object.defineProperties(exports, { __esModule: { value: true }, [Symbol.toStringTag]: { value: "Module" } });
-const util = require("../../../zrender/lib/core/util.js");
-var uidBase = 0;
-var OrdinalMeta = function() {
-  function OrdinalMeta2(opt) {
-    this.categories = opt.categories || [];
-    this._needCollect = opt.needCollect;
-    this._deduplication = opt.deduplication;
-    this.uid = ++uidBase;
-  }
-  OrdinalMeta2.createByAxisModel = function(axisModel) {
-    var option = axisModel.option;
-    var data = option.data;
-    var categories = data && util.map(data, getName);
-    return new OrdinalMeta2({
-      categories,
-      needCollect: !categories,
-      deduplication: option.dedplication !== false
-    });
-  };
-  OrdinalMeta2.prototype.getOrdinal = function(category) {
-    return this._getOrCreateMap().get(category);
-  };
-  OrdinalMeta2.prototype.parseAndCollect = function(category) {
-    var index;
-    var needCollect = this._needCollect;
-    if (!util.isString(category) && !needCollect) {
-      return category;
-    }
-    if (needCollect && !this._deduplication) {
-      index = this.categories.length;
-      this.categories[index] = category;
-      return index;
-    }
-    var map = this._getOrCreateMap();
-    index = map.get(category);
-    if (index == null) {
-      if (needCollect) {
-        index = this.categories.length;
-        this.categories[index] = category;
-        map.set(category, index);
-      } else {
-        index = NaN;
-      }
-    }
-    return index;
-  };
-  OrdinalMeta2.prototype._getOrCreateMap = function() {
-    return this._map || (this._map = util.createHashMap(this.categories));
-  };
-  return OrdinalMeta2;
-}();
-function getName(obj) {
-  if (util.isObject(obj) && obj.value != null) {
-    return obj.value;
-  } else {
-    return obj + "";
-  }
-}
-const OrdinalMeta$1 = OrdinalMeta;
-exports.default = OrdinalMeta$1;
-//# sourceMappingURL=OrdinalMeta.js.map

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

@@ -1 +0,0 @@
-{"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/*\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements.  See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership.  The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License.  You may obtain a copy of the License at\n*\n*   http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing,\n* software distributed under the License is distributed on an\n* \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n* KIND, either express or implied.  See the License for the\n* specific language governing permissions and limitations\n* under the License.\n*/\nimport { createHashMap, isObject, map, isString } from 'zrender/lib/core/util.js';\nvar uidBase = 0;\n\nvar OrdinalMeta =\n/** @class */\nfunction () {\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\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  ;\n\n  OrdinalMeta.prototype.getOrdinal = function (category) {\n    // @ts-ignore\n    return this._getOrCreateMap().get(category);\n  };\n  /**\n   * @return The ordinal. If not found, return NaN.\n   */\n\n\n  OrdinalMeta.prototype.parseAndCollect = function (category) {\n    var index;\n    var needCollect = this._needCollect; // 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\n    if (!isString(category) && !needCollect) {\n      return category;\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\n\n    if (needCollect && !this._deduplication) {\n      index = this.categories.length;\n      this.categories[index] = category;\n      return index;\n    }\n\n    var map = this._getOrCreateMap(); // @ts-ignore\n\n\n    index = map.get(category);\n\n    if (index == null) {\n      if (needCollect) {\n        index = this.categories.length;\n        this.categories[index] = category; // @ts-ignore\n\n        map.set(category, index);\n      } else {\n        index = NaN;\n      }\n    }\n\n    return index;\n  }; // Consider big data, do not create map until needed.\n\n\n  OrdinalMeta.prototype._getOrCreateMap = function () {\n    return this._map || (this._map = createHashMap(this.categories));\n  };\n\n  return OrdinalMeta;\n}();\n\nfunction getName(obj) {\n  if (isObject(obj) && obj.value != null) {\n    return obj.value;\n  } else {\n    return obj + '';\n  }\n}\n\nexport default OrdinalMeta;"],"names":["OrdinalMeta","map","isString","createHashMap","isObject"],"mappings":";;;AA4CA,IAAI,UAAU;AAEd,IAAI,cAEJ,WAAY;AACV,WAASA,aAAY,KAAK;AACxB,SAAK,aAAa,IAAI,cAAc,CAAA;AACpC,SAAK,eAAe,IAAI;AACxB,SAAK,iBAAiB,IAAI;AAC1B,SAAK,MAAM,EAAE;AAAA,EACd;AAED,EAAAA,aAAY,oBAAoB,SAAU,WAAW;AACnD,QAAI,SAAS,UAAU;AACvB,QAAI,OAAO,OAAO;AAClB,QAAI,aAAa,QAAQC,KAAG,IAAC,MAAM,OAAO;AAC1C,WAAO,IAAID,aAAY;AAAA,MACrB;AAAA,MACA,aAAa,CAAC;AAAA,MAEd,eAAe,OAAO,iBAAiB;AAAA,IAC7C,CAAK;AAAA,EACL;AAIE,EAAAA,aAAY,UAAU,aAAa,SAAU,UAAU;AAErD,WAAO,KAAK,gBAAe,EAAG,IAAI,QAAQ;AAAA,EAC9C;AAME,EAAAA,aAAY,UAAU,kBAAkB,SAAU,UAAU;AAC1D,QAAI;AACJ,QAAI,cAAc,KAAK;AAMvB,QAAI,CAACE,KAAQ,SAAC,QAAQ,KAAK,CAAC,aAAa;AACvC,aAAO;AAAA,IACR;AAUD,QAAI,eAAe,CAAC,KAAK,gBAAgB;AACvC,cAAQ,KAAK,WAAW;AACxB,WAAK,WAAW,SAAS;AACzB,aAAO;AAAA,IACR;AAED,QAAI,MAAM,KAAK;AAGf,YAAQ,IAAI,IAAI,QAAQ;AAExB,QAAI,SAAS,MAAM;AACjB,UAAI,aAAa;AACf,gBAAQ,KAAK,WAAW;AACxB,aAAK,WAAW,SAAS;AAEzB,YAAI,IAAI,UAAU,KAAK;AAAA,MAC/B,OAAa;AACL,gBAAQ;AAAA,MACT;AAAA,IACF;AAED,WAAO;AAAA,EACX;AAGE,EAAAF,aAAY,UAAU,kBAAkB,WAAY;AAClD,WAAO,KAAK,SAAS,KAAK,OAAOG,KAAAA,cAAc,KAAK,UAAU;AAAA,EAClE;AAEE,SAAOH;AACT;AAEA,SAAS,QAAQ,KAAK;AACpB,MAAII,KAAQ,SAAC,GAAG,KAAK,IAAI,SAAS,MAAM;AACtC,WAAO,IAAI;AAAA,EACf,OAAS;AACL,WAAO,MAAM;AAAA,EACd;AACH;AAEA,MAAA,gBAAe;;"}