@hkyhy/marsun-components-core 0.1.3 → 0.1.8

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

@@ -0,0 +1,81 @@
+function a(r) {
+  return r == null ? 0 : r.length || 1;
+}
+function c(r) {
+  return r;
+}
+var d = (
+  /** @class */
+  (function() {
+    function r(t, h, i, n, o, e) {
+      this._old = t, this._new = h, this._oldKeyGetter = i || c, this._newKeyGetter = n || c, this.context = o, this._diffModeMultiple = e === "multiple";
+    }
+    return r.prototype.add = function(t) {
+      return this._add = t, this;
+    }, r.prototype.update = function(t) {
+      return this._update = t, this;
+    }, r.prototype.updateManyToOne = function(t) {
+      return this._updateManyToOne = t, this;
+    }, r.prototype.updateOneToMany = function(t) {
+      return this._updateOneToMany = t, this;
+    }, r.prototype.updateManyToMany = function(t) {
+      return this._updateManyToMany = t, this;
+    }, r.prototype.remove = function(t) {
+      return this._remove = t, this;
+    }, r.prototype.execute = function() {
+      this[this._diffModeMultiple ? "_executeMultiple" : "_executeOneToOne"]();
+    }, r.prototype._executeOneToOne = function() {
+      var t = this._old, h = this._new, i = {}, n = new Array(t.length), o = new Array(h.length);
+      this._initIndexMap(t, null, n, "_oldKeyGetter"), this._initIndexMap(h, i, o, "_newKeyGetter");
+      for (var e = 0; e < t.length; e++) {
+        var s = n[e], u = i[s], _ = a(u);
+        if (_ > 1) {
+          var f = u.shift();
+          u.length === 1 && (i[s] = u[0]), this._update && this._update(f, e);
+        } else _ === 1 ? (i[s] = null, this._update && this._update(u, e)) : this._remove && this._remove(e);
+      }
+      this._performRestAdd(o, i);
+    }, r.prototype._executeMultiple = function() {
+      var t = this._old, h = this._new, i = {}, n = {}, o = [], e = [];
+      this._initIndexMap(t, i, o, "_oldKeyGetter"), this._initIndexMap(h, n, e, "_newKeyGetter");
+      for (var s = 0; s < o.length; s++) {
+        var u = o[s], _ = i[u], f = n[u], v = a(_), p = a(f);
+        if (v > 1 && p === 1)
+          this._updateManyToOne && this._updateManyToOne(f, _), n[u] = null;
+        else if (v === 1 && p > 1)
+          this._updateOneToMany && this._updateOneToMany(f, _), n[u] = null;
+        else if (v === 1 && p === 1)
+          this._update && this._update(f, _), n[u] = null;
+        else if (v > 1 && p > 1)
+          this._updateManyToMany && this._updateManyToMany(f, _), n[u] = null;
+        else if (v > 1)
+          for (var y = 0; y < v; y++)
+            this._remove && this._remove(_[y]);
+        else
+          this._remove && this._remove(_);
+      }
+      this._performRestAdd(e, n);
+    }, r.prototype._performRestAdd = function(t, h) {
+      for (var i = 0; i < t.length; i++) {
+        var n = t[i], o = h[n], e = a(o);
+        if (e > 1)
+          for (var s = 0; s < e; s++)
+            this._add && this._add(o[s]);
+        else e === 1 && this._add && this._add(o);
+        h[n] = null;
+      }
+    }, r.prototype._initIndexMap = function(t, h, i, n) {
+      for (var o = this._diffModeMultiple, e = 0; e < t.length; e++) {
+        var s = "_ec_" + this[n](t[e], e);
+        if (o || (i[e] = s), !!h) {
+          var u = h[s], _ = a(u);
+          _ === 0 ? (h[s] = e, o && i.push(s)) : _ === 1 ? h[s] = [u, e] : u.push(e);
+        }
+      }
+    }, r;
+  })()
+);
+export {
+  d as default
+};
+//# sourceMappingURL=DataDiffer.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"DataDiffer.js","sources":["../../../../../node_modules/echarts/lib/data/DataDiffer.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*/\nfunction dataIndexMapValueLength(valNumOrArrLengthMoreThan2) {\n  return valNumOrArrLengthMoreThan2 == null ? 0 : valNumOrArrLengthMoreThan2.length || 1;\n}\nfunction defaultKeyGetter(item) {\n  return item;\n}\nvar DataDiffer = /** @class */function () {\n  /**\r\n   * @param context Can be visited by this.context in callback.\r\n   */\n  function DataDiffer(oldArr, newArr, oldKeyGetter, newKeyGetter, context,\n  // By default: 'oneToOne'.\n  diffMode) {\n    this._old = oldArr;\n    this._new = newArr;\n    this._oldKeyGetter = oldKeyGetter || defaultKeyGetter;\n    this._newKeyGetter = newKeyGetter || defaultKeyGetter;\n    // Visible in callback via `this.context`;\n    this.context = context;\n    this._diffModeMultiple = diffMode === 'multiple';\n  }\n  /**\r\n   * Callback function when add a data\r\n   */\n  DataDiffer.prototype.add = function (func) {\n    this._add = func;\n    return this;\n  };\n  /**\r\n   * Callback function when update a data\r\n   */\n  DataDiffer.prototype.update = function (func) {\n    this._update = func;\n    return this;\n  };\n  /**\r\n   * Callback function when update a data and only work in `cbMode: 'byKey'`.\r\n   */\n  DataDiffer.prototype.updateManyToOne = function (func) {\n    this._updateManyToOne = func;\n    return this;\n  };\n  /**\r\n   * Callback function when update a data and only work in `cbMode: 'byKey'`.\r\n   */\n  DataDiffer.prototype.updateOneToMany = function (func) {\n    this._updateOneToMany = func;\n    return this;\n  };\n  /**\r\n   * Callback function when update a data and only work in `cbMode: 'byKey'`.\r\n   */\n  DataDiffer.prototype.updateManyToMany = function (func) {\n    this._updateManyToMany = func;\n    return this;\n  };\n  /**\r\n   * Callback function when remove a data\r\n   */\n  DataDiffer.prototype.remove = function (func) {\n    this._remove = func;\n    return this;\n  };\n  DataDiffer.prototype.execute = function () {\n    this[this._diffModeMultiple ? '_executeMultiple' : '_executeOneToOne']();\n  };\n  DataDiffer.prototype._executeOneToOne = function () {\n    var oldArr = this._old;\n    var newArr = this._new;\n    var newDataIndexMap = {};\n    var oldDataKeyArr = new Array(oldArr.length);\n    var newDataKeyArr = new Array(newArr.length);\n    this._initIndexMap(oldArr, null, oldDataKeyArr, '_oldKeyGetter');\n    this._initIndexMap(newArr, newDataIndexMap, newDataKeyArr, '_newKeyGetter');\n    for (var i = 0; i < oldArr.length; i++) {\n      var oldKey = oldDataKeyArr[i];\n      var newIdxMapVal = newDataIndexMap[oldKey];\n      var newIdxMapValLen = dataIndexMapValueLength(newIdxMapVal);\n      // idx can never be empty array here. see 'set null' logic below.\n      if (newIdxMapValLen > 1) {\n        // Consider there is duplicate key (for example, use dataItem.name as key).\n        // We should make sure every item in newArr and oldArr can be visited.\n        var newIdx = newIdxMapVal.shift();\n        if (newIdxMapVal.length === 1) {\n          newDataIndexMap[oldKey] = newIdxMapVal[0];\n        }\n        this._update && this._update(newIdx, i);\n      } else if (newIdxMapValLen === 1) {\n        newDataIndexMap[oldKey] = null;\n        this._update && this._update(newIdxMapVal, i);\n      } else {\n        this._remove && this._remove(i);\n      }\n    }\n    this._performRestAdd(newDataKeyArr, newDataIndexMap);\n  };\n  /**\r\n   * For example, consider the case:\r\n   * oldData: [o0, o1, o2, o3, o4, o5, o6, o7],\r\n   * newData: [n0, n1, n2, n3, n4, n5, n6, n7, n8],\r\n   * Where:\r\n   *     o0, o1, n0 has key 'a' (many to one)\r\n   *     o5, n4, n5, n6 has key 'b' (one to many)\r\n   *     o2, n1 has key 'c' (one to one)\r\n   *     n2, n3 has key 'd' (add)\r\n   *     o3, o4 has key 'e' (remove)\r\n   *     o6, o7, n7, n8 has key 'f' (many to many, treated as add and remove)\r\n   * Then:\r\n   *     (The order of the following directives are not ensured.)\r\n   *     this._updateManyToOne(n0, [o0, o1]);\r\n   *     this._updateOneToMany([n4, n5, n6], o5);\r\n   *     this._update(n1, o2);\r\n   *     this._remove(o3);\r\n   *     this._remove(o4);\r\n   *     this._remove(o6);\r\n   *     this._remove(o7);\r\n   *     this._add(n2);\r\n   *     this._add(n3);\r\n   *     this._add(n7);\r\n   *     this._add(n8);\r\n   */\n  DataDiffer.prototype._executeMultiple = function () {\n    var oldArr = this._old;\n    var newArr = this._new;\n    var oldDataIndexMap = {};\n    var newDataIndexMap = {};\n    var oldDataKeyArr = [];\n    var newDataKeyArr = [];\n    this._initIndexMap(oldArr, oldDataIndexMap, oldDataKeyArr, '_oldKeyGetter');\n    this._initIndexMap(newArr, newDataIndexMap, newDataKeyArr, '_newKeyGetter');\n    for (var i = 0; i < oldDataKeyArr.length; i++) {\n      var oldKey = oldDataKeyArr[i];\n      var oldIdxMapVal = oldDataIndexMap[oldKey];\n      var newIdxMapVal = newDataIndexMap[oldKey];\n      var oldIdxMapValLen = dataIndexMapValueLength(oldIdxMapVal);\n      var newIdxMapValLen = dataIndexMapValueLength(newIdxMapVal);\n      if (oldIdxMapValLen > 1 && newIdxMapValLen === 1) {\n        this._updateManyToOne && this._updateManyToOne(newIdxMapVal, oldIdxMapVal);\n        newDataIndexMap[oldKey] = null;\n      } else if (oldIdxMapValLen === 1 && newIdxMapValLen > 1) {\n        this._updateOneToMany && this._updateOneToMany(newIdxMapVal, oldIdxMapVal);\n        newDataIndexMap[oldKey] = null;\n      } else if (oldIdxMapValLen === 1 && newIdxMapValLen === 1) {\n        this._update && this._update(newIdxMapVal, oldIdxMapVal);\n        newDataIndexMap[oldKey] = null;\n      } else if (oldIdxMapValLen > 1 && newIdxMapValLen > 1) {\n        this._updateManyToMany && this._updateManyToMany(newIdxMapVal, oldIdxMapVal);\n        newDataIndexMap[oldKey] = null;\n      } else if (oldIdxMapValLen > 1) {\n        for (var i_1 = 0; i_1 < oldIdxMapValLen; i_1++) {\n          this._remove && this._remove(oldIdxMapVal[i_1]);\n        }\n      } else {\n        this._remove && this._remove(oldIdxMapVal);\n      }\n    }\n    this._performRestAdd(newDataKeyArr, newDataIndexMap);\n  };\n  DataDiffer.prototype._performRestAdd = function (newDataKeyArr, newDataIndexMap) {\n    for (var i = 0; i < newDataKeyArr.length; i++) {\n      var newKey = newDataKeyArr[i];\n      var newIdxMapVal = newDataIndexMap[newKey];\n      var idxMapValLen = dataIndexMapValueLength(newIdxMapVal);\n      if (idxMapValLen > 1) {\n        for (var j = 0; j < idxMapValLen; j++) {\n          this._add && this._add(newIdxMapVal[j]);\n        }\n      } else if (idxMapValLen === 1) {\n        this._add && this._add(newIdxMapVal);\n      }\n      // Support both `newDataKeyArr` are duplication removed or not removed.\n      newDataIndexMap[newKey] = null;\n    }\n  };\n  DataDiffer.prototype._initIndexMap = function (arr,\n  // Can be null.\n  map,\n  // In 'byKey', the output `keyArr` is duplication removed.\n  // In 'byIndex', the output `keyArr` is not duplication removed and\n  //     its indices are accurately corresponding to `arr`.\n  keyArr, keyGetterName) {\n    var cbModeMultiple = this._diffModeMultiple;\n    for (var i = 0; i < arr.length; i++) {\n      // Add prefix to avoid conflict with Object.prototype.\n      var key = '_ec_' + this[keyGetterName](arr[i], i);\n      if (!cbModeMultiple) {\n        keyArr[i] = key;\n      }\n      if (!map) {\n        continue;\n      }\n      var idxMapVal = map[key];\n      var idxMapValLen = dataIndexMapValueLength(idxMapVal);\n      if (idxMapValLen === 0) {\n        // Simple optimize: in most cases, one index has one key,\n        // do not need array.\n        map[key] = i;\n        if (cbModeMultiple) {\n          keyArr.push(key);\n        }\n      } else if (idxMapValLen === 1) {\n        map[key] = [idxMapVal, i];\n      } else {\n        idxMapVal.push(i);\n      }\n    }\n  };\n  return DataDiffer;\n}();\nexport default DataDiffer;"],"names":["dataIndexMapValueLength","valNumOrArrLengthMoreThan2","defaultKeyGetter","item","DataDiffer","oldArr","newArr","oldKeyGetter","newKeyGetter","context","diffMode","func","newDataIndexMap","oldDataKeyArr","newDataKeyArr","i","oldKey","newIdxMapVal","newIdxMapValLen","newIdx","oldDataIndexMap","oldIdxMapVal","oldIdxMapValLen","i_1","newKey","idxMapValLen","j","arr","map","keyArr","keyGetterName","cbModeMultiple","key","idxMapVal"],"mappings":"AA2CA,SAASA,EAAwBC,GAA4B;AAC3D,SAAOA,KAA8B,OAAO,IAAIA,EAA2B,UAAU;AACvF;AACA,SAASC,EAAiBC,GAAM;AAC9B,SAAOA;AACT;AACG,IAACC;AAAA;AAAA,GAA0B,WAAY;AAIxC,aAASA,EAAWC,GAAQC,GAAQC,GAAcC,GAAcC,GAEhEC,GAAU;AACR,WAAK,OAAOL,GACZ,KAAK,OAAOC,GACZ,KAAK,gBAAgBC,KAAgBL,GACrC,KAAK,gBAAgBM,KAAgBN,GAErC,KAAK,UAAUO,GACf,KAAK,oBAAoBC,MAAa;AAAA,IACxC;AAIA,WAAAN,EAAW,UAAU,MAAM,SAAUO,GAAM;AACzC,kBAAK,OAAOA,GACL;AAAA,IACT,GAIAP,EAAW,UAAU,SAAS,SAAUO,GAAM;AAC5C,kBAAK,UAAUA,GACR;AAAA,IACT,GAIAP,EAAW,UAAU,kBAAkB,SAAUO,GAAM;AACrD,kBAAK,mBAAmBA,GACjB;AAAA,IACT,GAIAP,EAAW,UAAU,kBAAkB,SAAUO,GAAM;AACrD,kBAAK,mBAAmBA,GACjB;AAAA,IACT,GAIAP,EAAW,UAAU,mBAAmB,SAAUO,GAAM;AACtD,kBAAK,oBAAoBA,GAClB;AAAA,IACT,GAIAP,EAAW,UAAU,SAAS,SAAUO,GAAM;AAC5C,kBAAK,UAAUA,GACR;AAAA,IACT,GACAP,EAAW,UAAU,UAAU,WAAY;AACzC,WAAK,KAAK,oBAAoB,qBAAqB,kBAAkB,EAAC;AAAA,IACxE,GACAA,EAAW,UAAU,mBAAmB,WAAY;AAClD,UAAIC,IAAS,KAAK,MACdC,IAAS,KAAK,MACdM,IAAkB,CAAA,GAClBC,IAAgB,IAAI,MAAMR,EAAO,MAAM,GACvCS,IAAgB,IAAI,MAAMR,EAAO,MAAM;AAC3C,WAAK,cAAcD,GAAQ,MAAMQ,GAAe,eAAe,GAC/D,KAAK,cAAcP,GAAQM,GAAiBE,GAAe,eAAe;AAC1E,eAASC,IAAI,GAAGA,IAAIV,EAAO,QAAQU,KAAK;AACtC,YAAIC,IAASH,EAAcE,CAAC,GACxBE,IAAeL,EAAgBI,CAAM,GACrCE,IAAkBlB,EAAwBiB,CAAY;AAE1D,YAAIC,IAAkB,GAAG;AAGvB,cAAIC,IAASF,EAAa,MAAK;AAC/B,UAAIA,EAAa,WAAW,MAC1BL,EAAgBI,CAAM,IAAIC,EAAa,CAAC,IAE1C,KAAK,WAAW,KAAK,QAAQE,GAAQJ,CAAC;AAAA,QACxC,MAAO,CAAIG,MAAoB,KAC7BN,EAAgBI,CAAM,IAAI,MAC1B,KAAK,WAAW,KAAK,QAAQC,GAAcF,CAAC,KAE5C,KAAK,WAAW,KAAK,QAAQA,CAAC;AAAA,MAElC;AACA,WAAK,gBAAgBD,GAAeF,CAAe;AAAA,IACrD,GA0BAR,EAAW,UAAU,mBAAmB,WAAY;AAClD,UAAIC,IAAS,KAAK,MACdC,IAAS,KAAK,MACdc,IAAkB,CAAA,GAClBR,IAAkB,CAAA,GAClBC,IAAgB,CAAA,GAChBC,IAAgB,CAAA;AACpB,WAAK,cAAcT,GAAQe,GAAiBP,GAAe,eAAe,GAC1E,KAAK,cAAcP,GAAQM,GAAiBE,GAAe,eAAe;AAC1E,eAASC,IAAI,GAAGA,IAAIF,EAAc,QAAQE,KAAK;AAC7C,YAAIC,IAASH,EAAcE,CAAC,GACxBM,IAAeD,EAAgBJ,CAAM,GACrCC,IAAeL,EAAgBI,CAAM,GACrCM,IAAkBtB,EAAwBqB,CAAY,GACtDH,IAAkBlB,EAAwBiB,CAAY;AAC1D,YAAIK,IAAkB,KAAKJ,MAAoB;AAC7C,eAAK,oBAAoB,KAAK,iBAAiBD,GAAcI,CAAY,GACzET,EAAgBI,CAAM,IAAI;AAAA,iBACjBM,MAAoB,KAAKJ,IAAkB;AACpD,eAAK,oBAAoB,KAAK,iBAAiBD,GAAcI,CAAY,GACzET,EAAgBI,CAAM,IAAI;AAAA,iBACjBM,MAAoB,KAAKJ,MAAoB;AACtD,eAAK,WAAW,KAAK,QAAQD,GAAcI,CAAY,GACvDT,EAAgBI,CAAM,IAAI;AAAA,iBACjBM,IAAkB,KAAKJ,IAAkB;AAClD,eAAK,qBAAqB,KAAK,kBAAkBD,GAAcI,CAAY,GAC3ET,EAAgBI,CAAM,IAAI;AAAA,iBACjBM,IAAkB;AAC3B,mBAASC,IAAM,GAAGA,IAAMD,GAAiBC;AACvC,iBAAK,WAAW,KAAK,QAAQF,EAAaE,CAAG,CAAC;AAAA;AAGhD,eAAK,WAAW,KAAK,QAAQF,CAAY;AAAA,MAE7C;AACA,WAAK,gBAAgBP,GAAeF,CAAe;AAAA,IACrD,GACAR,EAAW,UAAU,kBAAkB,SAAUU,GAAeF,GAAiB;AAC/E,eAAS,IAAI,GAAG,IAAIE,EAAc,QAAQ,KAAK;AAC7C,YAAIU,IAASV,EAAc,CAAC,GACxBG,IAAeL,EAAgBY,CAAM,GACrCC,IAAezB,EAAwBiB,CAAY;AACvD,YAAIQ,IAAe;AACjB,mBAASC,IAAI,GAAGA,IAAID,GAAcC;AAChC,iBAAK,QAAQ,KAAK,KAAKT,EAAaS,CAAC,CAAC;AAAA,YAEnC,CAAID,MAAiB,KAC1B,KAAK,QAAQ,KAAK,KAAKR,CAAY;AAGrC,QAAAL,EAAgBY,CAAM,IAAI;AAAA,MAC5B;AAAA,IACF,GACApB,EAAW,UAAU,gBAAgB,SAAUuB,GAE/CC,GAIAC,GAAQC,GAAe;AAErB,eADIC,IAAiB,KAAK,mBACjBhB,IAAI,GAAGA,IAAIY,EAAI,QAAQZ,KAAK;AAEnC,YAAIiB,IAAM,SAAS,KAAKF,CAAa,EAAEH,EAAIZ,CAAC,GAAGA,CAAC;AAIhD,YAHKgB,MACHF,EAAOd,CAAC,IAAIiB,IAEV,EAACJ,GAGL;AAAA,cAAIK,IAAYL,EAAII,CAAG,GACnBP,IAAezB,EAAwBiC,CAAS;AACpD,UAAIR,MAAiB,KAGnBG,EAAII,CAAG,IAAIjB,GACPgB,KACFF,EAAO,KAAKG,CAAG,KAERP,MAAiB,IAC1BG,EAAII,CAAG,IAAI,CAACC,GAAWlB,CAAC,IAExBkB,EAAU,KAAKlB,CAAC;AAAA;AAAA,MAEpB;AAAA,IACF,GACOX;AAAA,EACT,GAAC;AAAA;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,431 @@
+import { createHashMap as B, assert as k, isFunction as U, map as x, keys as T, reduce as L, clone as z } from "../../../zrender/lib/core/util.js";
+import { parseDataValue as O } from "./helper/dataValueHelper.js";
+import { shouldRetrieveDataByName as q } from "./Source.js";
+var E = "undefined", H = typeof Uint32Array === E ? Array : Uint32Array, J = typeof Uint16Array === E ? Array : Uint16Array, K = typeof Int32Array === E ? Array : Int32Array, V = typeof Float64Array === E ? Array : Float64Array, b = {
+  float: V,
+  int: K,
+  // Ordinal data type can be string or int
+  ordinal: Array,
+  number: Array,
+  time: V
+}, P;
+function C(f) {
+  return f > 65535 ? H : J;
+}
+function M() {
+  return [1 / 0, -1 / 0];
+}
+function Q(f) {
+  var t = f.constructor;
+  return t === Array ? f.slice() : new t(f);
+}
+function F(f, t, r, e, a) {
+  var n = b[r || "float"];
+  if (a) {
+    var o = f[t], s = o && o.length;
+    if (s !== e) {
+      for (var i = new n(e), u = 0; u < s; u++)
+        i[u] = o[u];
+      f[t] = i;
+    }
+  } else
+    f[t] = new n(e);
+}
+var X = (
+  /** @class */
+  (function() {
+    function f() {
+      this._chunks = [], this._rawExtent = [], this._extent = [], this._count = 0, this._rawCount = 0, this._calcDimNameToIdx = B();
+    }
+    return f.prototype.initData = function(t, r, e) {
+      process.env.NODE_ENV !== "production" && k(U(t.getItem) && U(t.count), "Invalid data provider."), this._provider = t, this._chunks = [], this._indices = null, this.getRawIndex = this._getRawIdxIdentity;
+      var a = t.getSource(), n = this.defaultDimValueGetter = P[a.sourceFormat];
+      this._dimValueGetter = e || n, this._rawExtent = [];
+      var o = q(a);
+      this._dimensions = x(r, function(s) {
+        return process.env.NODE_ENV !== "production" && o && k(s.property != null), {
+          // Only pick these two props. Not leak other properties like orderMeta.
+          type: s.type,
+          property: s.property
+        };
+      }), this._initDataFromProvider(0, t.count());
+    }, f.prototype.getProvider = function() {
+      return this._provider;
+    }, f.prototype.getSource = function() {
+      return this._provider.getSource();
+    }, f.prototype.ensureCalculationDimension = function(t, r) {
+      var e = this._calcDimNameToIdx, a = this._dimensions, n = e.get(t);
+      if (n != null) {
+        if (a[n].type === r)
+          return n;
+      } else
+        n = a.length;
+      return a[n] = {
+        type: r
+      }, e.set(t, n), this._chunks[n] = new b[r || "float"](this._rawCount), this._rawExtent[n] = M(), n;
+    }, f.prototype.collectOrdinalMeta = function(t, r) {
+      var e = this._chunks[t], a = this._dimensions[t], n = this._rawExtent, o = a.ordinalOffset || 0, s = e.length;
+      o === 0 && (n[t] = M());
+      for (var i = n[t], u = o; u < s; u++) {
+        var v = e[u] = r.parseAndCollect(e[u]);
+        isNaN(v) || (i[0] = Math.min(v, i[0]), i[1] = Math.max(v, i[1]));
+      }
+      a.ordinalMeta = r, a.ordinalOffset = s, a.type = "ordinal";
+    }, f.prototype.getOrdinalMeta = function(t) {
+      var r = this._dimensions[t], e = r.ordinalMeta;
+      return e;
+    }, f.prototype.getDimensionProperty = function(t) {
+      var r = this._dimensions[t];
+      return r && r.property;
+    }, f.prototype.appendData = function(t) {
+      process.env.NODE_ENV !== "production" && k(!this._indices, "appendData can only be called on raw data.");
+      var r = this._provider, e = this.count();
+      r.appendData(t);
+      var a = r.count();
+      return r.persistent || (a += e), e < a && this._initDataFromProvider(e, a, !0), [e, a];
+    }, f.prototype.appendValues = function(t, r) {
+      for (var e = this._chunks, a = this._dimensions, n = a.length, o = this._rawExtent, s = this.count(), i = s + Math.max(t.length, r || 0), u = 0; u < n; u++) {
+        var v = a[u];
+        F(e, u, v.type, i, !0);
+      }
+      for (var y = [], p = s; p < i; p++)
+        for (var c = p - s, h = 0; h < n; h++) {
+          var v = a[h], g = P.arrayRows.call(this, t[c] || y, v.property, c, h);
+          e[h][p] = g;
+          var _ = o[h];
+          g < _[0] && (_[0] = g), g > _[1] && (_[1] = g);
+        }
+      return this._rawCount = this._count = i, {
+        start: s,
+        end: i
+      };
+    }, f.prototype._initDataFromProvider = function(t, r, e) {
+      for (var a = this._provider, n = this._chunks, o = this._dimensions, s = o.length, i = this._rawExtent, u = x(o, function(w) {
+        return w.property;
+      }), v = 0; v < s; v++) {
+        var y = o[v];
+        i[v] || (i[v] = M()), F(n, v, y.type, r, e);
+      }
+      if (a.fillStorage)
+        a.fillStorage(t, r, n, i);
+      else
+        for (var p = [], c = t; c < r; c++) {
+          p = a.getItem(c, p);
+          for (var h = 0; h < s; h++) {
+            var g = n[h], _ = this._dimValueGetter(p, u[h], c, h);
+            g[c] = _;
+            var l = i[h];
+            _ < l[0] && (l[0] = _), _ > l[1] && (l[1] = _);
+          }
+        }
+      !a.persistent && a.clean && a.clean(), this._rawCount = this._count = r, this._extent = [];
+    }, f.prototype.count = function() {
+      return this._count;
+    }, f.prototype.get = function(t, r) {
+      if (!(r >= 0 && r < this._count))
+        return NaN;
+      var e = this._chunks[t];
+      return e ? e[this.getRawIndex(r)] : NaN;
+    }, f.prototype.getValues = function(t, r) {
+      var e = [], a = [];
+      if (r == null) {
+        r = t, t = [];
+        for (var n = 0; n < this._dimensions.length; n++)
+          a.push(n);
+      } else
+        a = t;
+      for (var n = 0, o = a.length; n < o; n++)
+        e.push(this.get(a[n], r));
+      return e;
+    }, f.prototype.getByRawIndex = function(t, r) {
+      if (!(r >= 0 && r < this._rawCount))
+        return NaN;
+      var e = this._chunks[t];
+      return e ? e[r] : NaN;
+    }, f.prototype.getSum = function(t) {
+      var r = this._chunks[t], e = 0;
+      if (r)
+        for (var a = 0, n = this.count(); a < n; a++) {
+          var o = this.get(t, a);
+          isNaN(o) || (e += o);
+        }
+      return e;
+    }, f.prototype.getMedian = function(t) {
+      var r = [];
+      this.each([t], function(n) {
+        isNaN(n) || r.push(n);
+      });
+      var e = r.sort(function(n, o) {
+        return n - o;
+      }), a = this.count();
+      return a === 0 ? 0 : a % 2 === 1 ? e[(a - 1) / 2] : (e[a / 2] + e[a / 2 - 1]) / 2;
+    }, f.prototype.indexOfRawIndex = function(t) {
+      if (t >= this._rawCount || t < 0)
+        return -1;
+      if (!this._indices)
+        return t;
+      var r = this._indices, e = r[t];
+      if (e != null && e < this._count && e === t)
+        return t;
+      for (var a = 0, n = this._count - 1; a <= n; ) {
+        var o = (a + n) / 2 | 0;
+        if (r[o] < t)
+          a = o + 1;
+        else if (r[o] > t)
+          n = o - 1;
+        else
+          return o;
+      }
+      return -1;
+    }, f.prototype.indicesOfNearest = function(t, r, e) {
+      var a = this._chunks, n = a[t], o = [];
+      if (!n)
+        return o;
+      e == null && (e = 1 / 0);
+      for (var s = 1 / 0, i = -1, u = 0, v = 0, y = this.count(); v < y; v++) {
+        var p = this.getRawIndex(v), c = r - n[p], h = Math.abs(c);
+        h <= e && ((h < s || h === s && c >= 0 && i < 0) && (s = h, i = c, u = 0), c === i && (o[u++] = v));
+      }
+      return o.length = u, o;
+    }, f.prototype.getIndices = function() {
+      var t, r = this._indices;
+      if (r) {
+        var e = r.constructor, a = this._count;
+        if (e === Array) {
+          t = new e(a);
+          for (var n = 0; n < a; n++)
+            t[n] = r[n];
+        } else
+          t = new e(r.buffer, 0, a);
+      } else {
+        var e = C(this._rawCount);
+        t = new e(this.count());
+        for (var n = 0; n < t.length; n++)
+          t[n] = n;
+      }
+      return t;
+    }, f.prototype.filter = function(t, r) {
+      if (!this._count)
+        return this;
+      for (var e = this.clone(), a = e.count(), n = C(e._rawCount), o = new n(a), s = [], i = t.length, u = 0, v = t[0], y = e._chunks, p = 0; p < a; p++) {
+        var c = void 0, h = e.getRawIndex(p);
+        if (i === 0)
+          c = r(p);
+        else if (i === 1) {
+          var g = y[v][h];
+          c = r(g, p);
+        } else {
+          for (var _ = 0; _ < i; _++)
+            s[_] = y[t[_]][h];
+          s[_] = p, c = r.apply(null, s);
+        }
+        c && (o[u++] = h);
+      }
+      return u < a && (e._indices = o), e._count = u, e._extent = [], e._updateGetRawIdx(), e;
+    }, f.prototype.selectRange = function(t) {
+      var r = this.clone(), e = r._count;
+      if (!e)
+        return this;
+      var a = T(t), n = a.length;
+      if (!n)
+        return this;
+      var o = r.count(), s = C(r._rawCount), i = new s(o), u = 0, v = a[0], y = t[v][0], p = t[v][1], c = r._chunks, h = !1;
+      if (!r._indices) {
+        var g = 0;
+        if (n === 1) {
+          for (var _ = c[a[0]], l = 0; l < e; l++) {
+            var w = _[l];
+            (w >= y && w <= p || isNaN(w)) && (i[u++] = g), g++;
+          }
+          h = !0;
+        } else if (n === 2) {
+          for (var _ = c[a[0]], d = c[a[1]], R = t[a[1]][0], D = t[a[1]][1], l = 0; l < e; l++) {
+            var w = _[l], I = d[l];
+            (w >= y && w <= p || isNaN(w)) && (I >= R && I <= D || isNaN(I)) && (i[u++] = g), g++;
+          }
+          h = !0;
+        }
+      }
+      if (!h)
+        if (n === 1)
+          for (var l = 0; l < o; l++) {
+            var N = r.getRawIndex(l), w = c[a[0]][N];
+            (w >= y && w <= p || isNaN(w)) && (i[u++] = N);
+          }
+        else
+          for (var l = 0; l < o; l++) {
+            for (var S = !0, N = r.getRawIndex(l), A = 0; A < n; A++) {
+              var m = a[A], w = c[m][N];
+              (w < t[m][0] || w > t[m][1]) && (S = !1);
+            }
+            S && (i[u++] = r.getRawIndex(l));
+          }
+      return u < o && (r._indices = i), r._count = u, r._extent = [], r._updateGetRawIdx(), r;
+    }, f.prototype.map = function(t, r) {
+      var e = this.clone(t);
+      return this._updateDims(e, t, r), e;
+    }, f.prototype.modify = function(t, r) {
+      this._updateDims(this, t, r);
+    }, f.prototype._updateDims = function(t, r, e) {
+      for (var a = t._chunks, n = [], o = r.length, s = t.count(), i = [], u = t._rawExtent, v = 0; v < r.length; v++)
+        u[r[v]] = M();
+      for (var y = 0; y < s; y++) {
+        for (var p = t.getRawIndex(y), c = 0; c < o; c++)
+          i[c] = a[r[c]][p];
+        i[o] = y;
+        var h = e && e.apply(null, i);
+        if (h != null) {
+          typeof h != "object" && (n[0] = h, h = n);
+          for (var v = 0; v < h.length; v++) {
+            var g = r[v], _ = h[v], l = u[g], w = a[g];
+            w && (w[p] = _), _ < l[0] && (l[0] = _), _ > l[1] && (l[1] = _);
+          }
+        }
+      }
+    }, f.prototype.lttbDownSample = function(t, r) {
+      var e = this.clone([t], !0), a = e._chunks, n = a[t], o = this.count(), s = 0, i = Math.floor(1 / r), u = this.getRawIndex(0), v, y, p, c = new (C(this._rawCount))(Math.min((Math.ceil(o / i) + 2) * 2, o));
+      c[s++] = u;
+      for (var h = 1; h < o - 1; h += i) {
+        for (var g = Math.min(h + i, o - 1), _ = Math.min(h + i * 2, o), l = (_ + g) / 2, w = 0, d = g; d < _; d++) {
+          var R = this.getRawIndex(d), D = n[R];
+          isNaN(D) || (w += D);
+        }
+        w /= _ - g;
+        var I = h, N = Math.min(h + i, o), S = h - 1, A = n[u];
+        v = -1, p = I;
+        for (var m = -1, G = 0, d = I; d < N; d++) {
+          var R = this.getRawIndex(d), D = n[R];
+          if (isNaN(D)) {
+            G++, m < 0 && (m = R);
+            continue;
+          }
+          y = Math.abs((S - l) * (D - A) - (S - d) * (w - A)), y > v && (v = y, p = R);
+        }
+        G > 0 && G < N - I && (c[s++] = Math.min(m, p), p = Math.max(m, p)), c[s++] = p, u = p;
+      }
+      return c[s++] = this.getRawIndex(o - 1), e._count = s, e._indices = c, e.getRawIndex = this._getRawIdx, e;
+    }, f.prototype.minmaxDownSample = function(t, r) {
+      for (var e = this.clone([t], !0), a = e._chunks, n = Math.floor(1 / r), o = a[t], s = this.count(), i = new (C(this._rawCount))(Math.ceil(s / n) * 2), u = 0, v = 0; v < s; v += n) {
+        var y = v, p = o[this.getRawIndex(y)], c = v, h = o[this.getRawIndex(c)], g = n;
+        v + n > s && (g = s - v);
+        for (var _ = 0; _ < g; _++) {
+          var l = this.getRawIndex(v + _), w = o[l];
+          w < p && (p = w, y = v + _), w > h && (h = w, c = v + _);
+        }
+        var d = this.getRawIndex(y), R = this.getRawIndex(c);
+        y < c ? (i[u++] = d, i[u++] = R) : (i[u++] = R, i[u++] = d);
+      }
+      return e._count = u, e._indices = i, e._updateGetRawIdx(), e;
+    }, f.prototype.downSample = function(t, r, e, a) {
+      for (var n = this.clone([t], !0), o = n._chunks, s = [], i = Math.floor(1 / r), u = o[t], v = this.count(), y = n._rawExtent[t] = M(), p = new (C(this._rawCount))(Math.ceil(v / i)), c = 0, h = 0; h < v; h += i) {
+        i > v - h && (i = v - h, s.length = i);
+        for (var g = 0; g < i; g++) {
+          var _ = this.getRawIndex(h + g);
+          s[g] = u[_];
+        }
+        var l = e(s), w = this.getRawIndex(Math.min(h + a(s, l) || 0, v - 1));
+        u[w] = l, l < y[0] && (y[0] = l), l > y[1] && (y[1] = l), p[c++] = w;
+      }
+      return n._count = c, n._indices = p, n._updateGetRawIdx(), n;
+    }, f.prototype.each = function(t, r) {
+      if (this._count)
+        for (var e = t.length, a = this._chunks, n = 0, o = this.count(); n < o; n++) {
+          var s = this.getRawIndex(n);
+          switch (e) {
+            case 0:
+              r(n);
+              break;
+            case 1:
+              r(a[t[0]][s], n);
+              break;
+            case 2:
+              r(a[t[0]][s], a[t[1]][s], n);
+              break;
+            default:
+              for (var i = 0, u = []; i < e; i++)
+                u[i] = a[t[i]][s];
+              u[i] = n, r.apply(null, u);
+          }
+        }
+    }, f.prototype.getDataExtent = function(t) {
+      var r = this._chunks[t], e = M();
+      if (!r)
+        return e;
+      var a = this.count(), n = !this._indices, o;
+      if (n)
+        return this._rawExtent[t].slice();
+      if (o = this._extent[t], o)
+        return o.slice();
+      o = e;
+      for (var s = o[0], i = o[1], u = 0; u < a; u++) {
+        var v = this.getRawIndex(u), y = r[v];
+        y < s && (s = y), y > i && (i = y);
+      }
+      return o = [s, i], this._extent[t] = o, o;
+    }, f.prototype.getRawDataItem = function(t) {
+      var r = this.getRawIndex(t);
+      if (this._provider.persistent)
+        return this._provider.getItem(r);
+      for (var e = [], a = this._chunks, n = 0; n < a.length; n++)
+        e.push(a[n][r]);
+      return e;
+    }, f.prototype.clone = function(t, r) {
+      var e = new f(), a = this._chunks, n = t && L(t, function(s, i) {
+        return s[i] = !0, s;
+      }, {});
+      if (n)
+        for (var o = 0; o < a.length; o++)
+          e._chunks[o] = n[o] ? Q(a[o]) : a[o];
+      else
+        e._chunks = a;
+      return this._copyCommonProps(e), r || (e._indices = this._cloneIndices()), e._updateGetRawIdx(), e;
+    }, f.prototype._copyCommonProps = function(t) {
+      t._count = this._count, t._rawCount = this._rawCount, t._provider = this._provider, t._dimensions = this._dimensions, t._extent = z(this._extent), t._rawExtent = z(this._rawExtent);
+    }, f.prototype._cloneIndices = function() {
+      if (this._indices) {
+        var t = this._indices.constructor, r = void 0;
+        if (t === Array) {
+          var e = this._indices.length;
+          r = new t(e);
+          for (var a = 0; a < e; a++)
+            r[a] = this._indices[a];
+        } else
+          r = new t(this._indices);
+        return r;
+      }
+      return null;
+    }, f.prototype._getRawIdxIdentity = function(t) {
+      return t;
+    }, f.prototype._getRawIdx = function(t) {
+      return t < this._count && t >= 0 ? this._indices[t] : -1;
+    }, f.prototype._updateGetRawIdx = function() {
+      this.getRawIndex = this._indices ? this._getRawIdx : this._getRawIdxIdentity;
+    }, f.internalField = (function() {
+      function t(r, e, a, n) {
+        return O(r[n], this._dimensions[n]);
+      }
+      P = {
+        arrayRows: t,
+        objectRows: function(r, e, a, n) {
+          return O(r[e], this._dimensions[n]);
+        },
+        keyedColumns: t,
+        original: function(r, e, a, n) {
+          var o = r && (r.value == null ? r : r.value);
+          return O(o instanceof Array ? o[n] : o, this._dimensions[n]);
+        },
+        typedArray: function(r, e, a, n) {
+          return r[n];
+        }
+      };
+    })(), f;
+  })()
+);
+export {
+  V as CtorFloat64Array,
+  K as CtorInt32Array,
+  J as CtorUint16Array,
+  H as CtorUint32Array,
+  X as default
+};
+//# sourceMappingURL=DataStore.js.map