@ecan-bi/datav 1.0.62 → 1.0.63

package/es/node_modules/echarts/lib/core/impl.js

@@ -1,9 +1,23 @@
+import { error } from "../util/log.js";
 var implsStore = {};
 function registerImpl(name, impl) {
+  if (process.env.NODE_ENV !== "production") {
+    if (implsStore[name]) {
+      error("Already has an implementation of " + name + ".");
+    }
+  }
   implsStore[name] = impl;
 }
 function getImpl(name) {
+  if (process.env.NODE_ENV !== "production") {
+    if (!implsStore[name]) {
+      error("Implementation of " + name + " doesn't exists.");
+    }
+  }
   return implsStore[name];
 }
-export { getImpl, registerImpl };
+export {
+  getImpl,
+  registerImpl
+};
 //# sourceMappingURL=impl.js.map

package/es/node_modules/echarts/lib/core/impl.js.map

@@ -1 +1 @@
-{"version":3,"file":"impl.js","sources":["../../../../../node_modules/echarts/lib/core/impl.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 { error } from '../util/log.js'; // Implementation of exported APIs. For example registerMap, getMap.\n// The implentations will be registered when installing the component.\n// Avoid these code being bundled to the core module.\n\nvar implsStore = {}; // TODO Type\n\nexport function registerImpl(name, impl) {\n  if (process.env.NODE_ENV !== 'production') {\n    if (implsStore[name]) {\n      error(\"Already has an implementation of \" + name + \".\");\n    }\n  }\n\n  implsStore[name] = impl;\n}\nexport function getImpl(name) {\n  if (process.env.NODE_ENV !== 'production') {\n    if (!implsStore[name]) {\n      error(\"Implementation of \" + name + \" doesn't exists.\");\n    }\n  }\n\n  return implsStore[name];\n}"],"names":[],"mappings":"AA+CA,IAAI,aAAa,CAAA;AAEV,sBAAsB,MAAM,MAAM;AAOvC,aAAW,QAAQ;AACrB;AACO,iBAAiB,MAAM;AAO5B,SAAO,WAAW;AACpB;;"}
+{"version":3,"file":"impl.js","sources":["../../../../../node_modules/echarts/lib/core/impl.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 { error } from '../util/log.js'; // Implementation of exported APIs. For example registerMap, getMap.\n// The implentations will be registered when installing the component.\n// Avoid these code being bundled to the core module.\n\nvar implsStore = {}; // TODO Type\n\nexport function registerImpl(name, impl) {\n  if (process.env.NODE_ENV !== 'production') {\n    if (implsStore[name]) {\n      error(\"Already has an implementation of \" + name + \".\");\n    }\n  }\n\n  implsStore[name] = impl;\n}\nexport function getImpl(name) {\n  if (process.env.NODE_ENV !== 'production') {\n    if (!implsStore[name]) {\n      error(\"Implementation of \" + name + \" doesn't exists.\");\n    }\n  }\n\n  return implsStore[name];\n}"],"names":[],"mappings":";AA+CA,IAAI,aAAa,CAAA;AAEV,SAAS,aAAa,MAAM,MAAM;AACvC,MAAI,QAAQ,IAAI,aAAa,cAAc;AACzC,QAAI,WAAW,OAAO;AACpB,YAAM,sCAAsC,OAAO,GAAG;AAAA,IACvD;AAAA,EACF;AAED,aAAW,QAAQ;AACrB;AACO,SAAS,QAAQ,MAAM;AAC5B,MAAI,QAAQ,IAAI,aAAa,cAAc;AACzC,QAAI,CAAC,WAAW,OAAO;AACrB,YAAM,uBAAuB,OAAO,kBAAkB;AAAA,IACvD;AAAA,EACF;AAED,SAAO,WAAW;AACpB;"}

package/es/node_modules/echarts/lib/core/lifecycle.js

@@ -1,5 +1,7 @@
 import Eventful from "../../../zrender/lib/core/Eventful.js";
 var lifecycle = new Eventful();
-var lifecycle$1 = lifecycle;
-export { lifecycle$1 as default };
+const lifecycle$1 = lifecycle;
+export {
+  lifecycle$1 as default
+};
 //# sourceMappingURL=lifecycle.js.map

package/es/node_modules/echarts/lib/core/lifecycle.js.map

@@ -1 +1 @@
-{"version":3,"file":"lifecycle.js","sources":["../../../../../node_modules/echarts/lib/core/lifecycle.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 Eventful from 'zrender/lib/core/Eventful.js';\n;\nvar lifecycle = new Eventful();\nexport default lifecycle;"],"names":[],"mappings":";AA6CA,IAAI,YAAY,IAAI;AACpB,IAAA,cAAe;;"}
+{"version":3,"file":"lifecycle.js","sources":["../../../../../node_modules/echarts/lib/core/lifecycle.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 Eventful from 'zrender/lib/core/Eventful.js';\n;\nvar lifecycle = new Eventful();\nexport default lifecycle;"],"names":[],"mappings":";AA6CA,IAAI,YAAY,IAAI;AACpB,MAAA,cAAe;"}

package/es/node_modules/echarts/lib/core/locale.js

@@ -37,5 +37,11 @@ function getDefaultLocaleModel() {
 }
 registerLocale(LOCALE_EN, langEN);
 registerLocale(LOCALE_ZH, langZH);
-export { SYSTEM_LANG, createLocaleObject, getDefaultLocaleModel, getLocaleModel, registerLocale };
+export {
+  SYSTEM_LANG,
+  createLocaleObject,
+  getDefaultLocaleModel,
+  getLocaleModel,
+  registerLocale
+};
 //# sourceMappingURL=locale.js.map

package/es/node_modules/echarts/lib/core/locale.js.map

@@ -1 +1 @@
-{"version":3,"file":"locale.js","sources":["../../../../../node_modules/echarts/lib/core/locale.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 Model from '../model/Model.js';\nimport env from 'zrender/lib/core/env.js'; // default import ZH and EN lang\n\nimport langEN from '../i18n/langEN.js';\nimport langZH from '../i18n/langZH.js';\nimport { isString, clone, merge } from 'zrender/lib/core/util.js';\nvar LOCALE_ZH = 'ZH';\nvar LOCALE_EN = 'EN';\nvar DEFAULT_LOCALE = LOCALE_EN;\nvar localeStorage = {};\nvar localeModels = {};\nexport var SYSTEM_LANG = !env.domSupported ? DEFAULT_LOCALE : function () {\n  var langStr = (\n  /* eslint-disable-next-line */\n  document.documentElement.lang || navigator.language || navigator.browserLanguage).toUpperCase();\n  return langStr.indexOf(LOCALE_ZH) > -1 ? LOCALE_ZH : DEFAULT_LOCALE;\n}();\nexport function registerLocale(locale, localeObj) {\n  locale = locale.toUpperCase();\n  localeModels[locale] = new Model(localeObj);\n  localeStorage[locale] = localeObj;\n} // export function getLocale(locale: string) {\n//     return localeStorage[locale];\n// }\n\nexport function createLocaleObject(locale) {\n  if (isString(locale)) {\n    var localeObj = localeStorage[locale.toUpperCase()] || {};\n\n    if (locale === LOCALE_ZH || locale === LOCALE_EN) {\n      return clone(localeObj);\n    } else {\n      return merge(clone(localeObj), clone(localeStorage[DEFAULT_LOCALE]), false);\n    }\n  } else {\n    return merge(clone(locale), clone(localeStorage[DEFAULT_LOCALE]), false);\n  }\n}\nexport function getLocaleModel(lang) {\n  return localeModels[lang];\n}\nexport function getDefaultLocaleModel() {\n  return localeModels[DEFAULT_LOCALE];\n} // Default locale\n\nregisterLocale(LOCALE_EN, langEN);\nregisterLocale(LOCALE_ZH, langZH);"],"names":[],"mappings":";;;;;AAiDA,IAAI,YAAY;AAChB,IAAI,YAAY;AAChB,IAAI,iBAAiB;AACrB,IAAI,gBAAgB,CAAA;AACpB,IAAI,eAAe,CAAA;AACT,IAAC,cAAc,CAAC,IAAI,eAAe,iBAAiB,WAAY;AACxE,MAAI,UAEJ,UAAS,gBAAgB,QAAQ,UAAU,YAAY,UAAU,iBAAiB;AAClF,SAAO,QAAQ,QAAQ,SAAS,IAAI,KAAK,YAAY;AACvD,EAAI;AACG,wBAAwB,QAAQ,WAAW;AAChD,WAAS,OAAO;AAChB,eAAa,UAAU,IAAI,MAAM,SAAS;AAC1C,gBAAc,UAAU;AAC1B;AAIO,4BAA4B,QAAQ;AACzC,MAAI,SAAS,MAAM,GAAG;AACpB,QAAI,YAAY,cAAc,OAAO,YAAa,MAAK,CAAA;AAEvD,QAAI,WAAW,aAAa,WAAW,WAAW;AAChD,aAAO,MAAM,SAAS;AAAA,IAC5B,OAAW;AACL,aAAO,MAAM,MAAM,SAAS,GAAG,MAAM,cAAc,eAAe,GAAG,KAAK;AAAA,IAC3E;AAAA,EACL,OAAS;AACL,WAAO,MAAM,MAAM,MAAM,GAAG,MAAM,cAAc,eAAe,GAAG,KAAK;AAAA,EACxE;AACH;AACO,wBAAwB,MAAM;AACnC,SAAO,aAAa;AACtB;AACO,iCAAiC;AACtC,SAAO,aAAa;AACtB;AAEA,eAAe,WAAW,MAAM;AAChC,eAAe,WAAW,MAAM;;"}
+{"version":3,"file":"locale.js","sources":["../../../../../node_modules/echarts/lib/core/locale.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 Model from '../model/Model.js';\nimport env from 'zrender/lib/core/env.js'; // default import ZH and EN lang\n\nimport langEN from '../i18n/langEN.js';\nimport langZH from '../i18n/langZH.js';\nimport { isString, clone, merge } from 'zrender/lib/core/util.js';\nvar LOCALE_ZH = 'ZH';\nvar LOCALE_EN = 'EN';\nvar DEFAULT_LOCALE = LOCALE_EN;\nvar localeStorage = {};\nvar localeModels = {};\nexport var SYSTEM_LANG = !env.domSupported ? DEFAULT_LOCALE : function () {\n  var langStr = (\n  /* eslint-disable-next-line */\n  document.documentElement.lang || navigator.language || navigator.browserLanguage).toUpperCase();\n  return langStr.indexOf(LOCALE_ZH) > -1 ? LOCALE_ZH : DEFAULT_LOCALE;\n}();\nexport function registerLocale(locale, localeObj) {\n  locale = locale.toUpperCase();\n  localeModels[locale] = new Model(localeObj);\n  localeStorage[locale] = localeObj;\n} // export function getLocale(locale: string) {\n//     return localeStorage[locale];\n// }\n\nexport function createLocaleObject(locale) {\n  if (isString(locale)) {\n    var localeObj = localeStorage[locale.toUpperCase()] || {};\n\n    if (locale === LOCALE_ZH || locale === LOCALE_EN) {\n      return clone(localeObj);\n    } else {\n      return merge(clone(localeObj), clone(localeStorage[DEFAULT_LOCALE]), false);\n    }\n  } else {\n    return merge(clone(locale), clone(localeStorage[DEFAULT_LOCALE]), false);\n  }\n}\nexport function getLocaleModel(lang) {\n  return localeModels[lang];\n}\nexport function getDefaultLocaleModel() {\n  return localeModels[DEFAULT_LOCALE];\n} // Default locale\n\nregisterLocale(LOCALE_EN, langEN);\nregisterLocale(LOCALE_ZH, langZH);"],"names":[],"mappings":";;;;;AAiDA,IAAI,YAAY;AAChB,IAAI,YAAY;AAChB,IAAI,iBAAiB;AACrB,IAAI,gBAAgB,CAAA;AACpB,IAAI,eAAe,CAAA;AACT,IAAC,cAAc,CAAC,IAAI,eAAe,iBAAiB,WAAY;AACxE,MAAI,WAEJ,SAAS,gBAAgB,QAAQ,UAAU,YAAY,UAAU,iBAAiB;AAClF,SAAO,QAAQ,QAAQ,SAAS,IAAI,KAAK,YAAY;AACvD,EAAI;AACG,SAAS,eAAe,QAAQ,WAAW;AAChD,WAAS,OAAO;AAChB,eAAa,UAAU,IAAI,MAAM,SAAS;AAC1C,gBAAc,UAAU;AAC1B;AAIO,SAAS,mBAAmB,QAAQ;AACzC,MAAI,SAAS,MAAM,GAAG;AACpB,QAAI,YAAY,cAAc,OAAO,YAAa,MAAK,CAAA;AAEvD,QAAI,WAAW,aAAa,WAAW,WAAW;AAChD,aAAO,MAAM,SAAS;AAAA,IAC5B,OAAW;AACL,aAAO,MAAM,MAAM,SAAS,GAAG,MAAM,cAAc,eAAe,GAAG,KAAK;AAAA,IAC3E;AAAA,EACL,OAAS;AACL,WAAO,MAAM,MAAM,MAAM,GAAG,MAAM,cAAc,eAAe,GAAG,KAAK;AAAA,EACxE;AACH;AACO,SAAS,eAAe,MAAM;AACnC,SAAO,aAAa;AACtB;AACO,SAAS,wBAAwB;AACtC,SAAO,aAAa;AACtB;AAEA,eAAe,WAAW,MAAM;AAChC,eAAe,WAAW,MAAM;"}

package/es/node_modules/echarts/lib/core/task.js

@@ -1,4 +1,4 @@
-import { isArray } from "../../../zrender/lib/core/util.js";
+import { assert, isArray } from "../../../zrender/lib/core/util.js";
 function createTask(define) {
   return new Task(define);
 }
@@ -45,8 +45,14 @@ var Task = function() {
     this._modDataCount = modDataCount;
     var step = performArgs && performArgs.step;
     if (upTask) {
+      if (process.env.NODE_ENV !== "production") {
+        assert(upTask._outputDueEnd != null);
+      }
       this._dueEnd = upTask._outputDueEnd;
     } else {
+      if (process.env.NODE_ENV !== "production") {
+        assert(!this._progress || this._count);
+      }
       this._dueEnd = this._count ? this._count(this.context) : Infinity;
     }
     if (this._progress) {
@@ -64,6 +70,9 @@ var Task = function() {
       }
       this._dueIndex = end;
       var outputDueEnd = this._settedOutputEnd != null ? this._settedOutputEnd : end;
+      if (process.env.NODE_ENV !== "production") {
+        assert(outputDueEnd >= this._outputDueEnd);
+      }
       this._outputDueEnd = outputDueEnd;
     } else {
       this._dueIndex = this._outputDueEnd = this._settedOutputEnd != null ? this._settedOutputEnd : this._dueEnd;
@@ -109,6 +118,9 @@ var Task = function() {
     return this._progress && this._dueIndex < this._dueEnd;
   };
   Task2.prototype.pipe = function(downTask) {
+    if (process.env.NODE_ENV !== "production") {
+      assert(downTask && !downTask._disposed && downTask !== this);
+    }
     if (this._downstream !== downTask || this._dirty) {
       this._downstream = downTask;
       downTask._upstream = this;
@@ -162,5 +174,8 @@ var iterator = function() {
     return result;
   }
 }();
-export { Task, createTask };
+export {
+  Task,
+  createTask
+};
 //# sourceMappingURL=task.js.map

package/es/node_modules/echarts/lib/core/task.js.map

@@ -1 +1 @@
-{"version":3,"file":"task.js","sources":["../../../../../node_modules/echarts/lib/core/task.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, isArray } from 'zrender/lib/core/util.js';\n;\n/**\n * @param {Object} define\n * @return See the return of `createTask`.\n */\n\nexport function createTask(define) {\n  return new Task(define);\n}\n\nvar Task =\n/** @class */\nfunction () {\n  function Task(define) {\n    define = define || {};\n    this._reset = define.reset;\n    this._plan = define.plan;\n    this._count = define.count;\n    this._onDirty = define.onDirty;\n    this._dirty = true;\n  }\n  /**\n   * @param step Specified step.\n   * @param skip Skip customer perform call.\n   * @param modBy Sampling window size.\n   * @param modDataCount Sampling count.\n   * @return whether unfinished.\n   */\n\n\n  Task.prototype.perform = function (performArgs) {\n    var upTask = this._upstream;\n    var skip = performArgs && performArgs.skip; // TODO some refactor.\n    // Pull data. Must pull data each time, because context.data\n    // may be updated by Series.setData.\n\n    if (this._dirty && upTask) {\n      var context = this.context;\n      context.data = context.outputData = upTask.context.outputData;\n    }\n\n    if (this.__pipeline) {\n      this.__pipeline.currentTask = this;\n    }\n\n    var planResult;\n\n    if (this._plan && !skip) {\n      planResult = this._plan(this.context);\n    } // Support sharding by mod, which changes the render sequence and makes the rendered graphic\n    // elements uniformed distributed when progress, especially when moving or zooming.\n\n\n    var lastModBy = normalizeModBy(this._modBy);\n    var lastModDataCount = this._modDataCount || 0;\n    var modBy = normalizeModBy(performArgs && performArgs.modBy);\n    var modDataCount = performArgs && performArgs.modDataCount || 0;\n\n    if (lastModBy !== modBy || lastModDataCount !== modDataCount) {\n      planResult = 'reset';\n    }\n\n    function normalizeModBy(val) {\n      !(val >= 1) && (val = 1); // jshint ignore:line\n\n      return val;\n    }\n\n    var forceFirstProgress;\n\n    if (this._dirty || planResult === 'reset') {\n      this._dirty = false;\n      forceFirstProgress = this._doReset(skip);\n    }\n\n    this._modBy = modBy;\n    this._modDataCount = modDataCount;\n    var step = performArgs && performArgs.step;\n\n    if (upTask) {\n      if (process.env.NODE_ENV !== 'production') {\n        assert(upTask._outputDueEnd != null);\n      }\n\n      this._dueEnd = upTask._outputDueEnd;\n    } // DataTask or overallTask\n    else {\n        if (process.env.NODE_ENV !== 'production') {\n          assert(!this._progress || this._count);\n        }\n\n        this._dueEnd = this._count ? this._count(this.context) : Infinity;\n      } // Note: Stubs, that its host overall task let it has progress, has progress.\n    // If no progress, pass index from upstream to downstream each time plan called.\n\n\n    if (this._progress) {\n      var start = this._dueIndex;\n      var end = Math.min(step != null ? this._dueIndex + step : Infinity, this._dueEnd);\n\n      if (!skip && (forceFirstProgress || start < end)) {\n        var progress = this._progress;\n\n        if (isArray(progress)) {\n          for (var i = 0; i < progress.length; i++) {\n            this._doProgress(progress[i], start, end, modBy, modDataCount);\n          }\n        } else {\n          this._doProgress(progress, start, end, modBy, modDataCount);\n        }\n      }\n\n      this._dueIndex = end; // If no `outputDueEnd`, assume that output data and\n      // input data is the same, so use `dueIndex` as `outputDueEnd`.\n\n      var outputDueEnd = this._settedOutputEnd != null ? this._settedOutputEnd : end;\n\n      if (process.env.NODE_ENV !== 'production') {\n        // ??? Can not rollback.\n        assert(outputDueEnd >= this._outputDueEnd);\n      }\n\n      this._outputDueEnd = outputDueEnd;\n    } else {\n      // (1) Some overall task has no progress.\n      // (2) Stubs, that its host overall task do not let it has progress, has no progress.\n      // This should always be performed so it can be passed to downstream.\n      this._dueIndex = this._outputDueEnd = this._settedOutputEnd != null ? this._settedOutputEnd : this._dueEnd;\n    }\n\n    return this.unfinished();\n  };\n\n  Task.prototype.dirty = function () {\n    this._dirty = true;\n    this._onDirty && this._onDirty(this.context);\n  };\n\n  Task.prototype._doProgress = function (progress, start, end, modBy, modDataCount) {\n    iterator.reset(start, end, modBy, modDataCount);\n    this._callingProgress = progress;\n\n    this._callingProgress({\n      start: start,\n      end: end,\n      count: end - start,\n      next: iterator.next\n    }, this.context);\n  };\n\n  Task.prototype._doReset = function (skip) {\n    this._dueIndex = this._outputDueEnd = this._dueEnd = 0;\n    this._settedOutputEnd = null;\n    var progress;\n    var forceFirstProgress;\n\n    if (!skip && this._reset) {\n      progress = this._reset(this.context);\n\n      if (progress && progress.progress) {\n        forceFirstProgress = progress.forceFirstProgress;\n        progress = progress.progress;\n      } // To simplify no progress checking, array must has item.\n\n\n      if (isArray(progress) && !progress.length) {\n        progress = null;\n      }\n    }\n\n    this._progress = progress;\n    this._modBy = this._modDataCount = null;\n    var downstream = this._downstream;\n    downstream && downstream.dirty();\n    return forceFirstProgress;\n  };\n\n  Task.prototype.unfinished = function () {\n    return this._progress && this._dueIndex < this._dueEnd;\n  };\n  /**\n   * @param downTask The downstream task.\n   * @return The downstream task.\n   */\n\n\n  Task.prototype.pipe = function (downTask) {\n    if (process.env.NODE_ENV !== 'production') {\n      assert(downTask && !downTask._disposed && downTask !== this);\n    } // If already downstream, do not dirty downTask.\n\n\n    if (this._downstream !== downTask || this._dirty) {\n      this._downstream = downTask;\n      downTask._upstream = this;\n      downTask.dirty();\n    }\n  };\n\n  Task.prototype.dispose = function () {\n    if (this._disposed) {\n      return;\n    }\n\n    this._upstream && (this._upstream._downstream = null);\n    this._downstream && (this._downstream._upstream = null);\n    this._dirty = false;\n    this._disposed = true;\n  };\n\n  Task.prototype.getUpstream = function () {\n    return this._upstream;\n  };\n\n  Task.prototype.getDownstream = function () {\n    return this._downstream;\n  };\n\n  Task.prototype.setOutputEnd = function (end) {\n    // This only happend in dataTask, dataZoom, map, currently.\n    // where dataZoom do not set end each time, but only set\n    // when reset. So we should record the setted end, in case\n    // that the stub of dataZoom perform again and earse the\n    // setted end by upstream.\n    this._outputDueEnd = this._settedOutputEnd = end;\n  };\n\n  return Task;\n}();\n\nexport { Task };\n\nvar iterator = function () {\n  var end;\n  var current;\n  var modBy;\n  var modDataCount;\n  var winCount;\n  var it = {\n    reset: function (s, e, sStep, sCount) {\n      current = s;\n      end = e;\n      modBy = sStep;\n      modDataCount = sCount;\n      winCount = Math.ceil(modDataCount / modBy);\n      it.next = modBy > 1 && modDataCount > 0 ? modNext : sequentialNext;\n    }\n  };\n  return it;\n\n  function sequentialNext() {\n    return current < end ? current++ : null;\n  }\n\n  function modNext() {\n    var dataIndex = current % winCount * modBy + Math.ceil(current / winCount);\n    var result = current >= end ? null : dataIndex < modDataCount ? dataIndex // If modDataCount is smaller than data.count() (consider `appendData` case),\n    // Use normal linear rendering mode.\n    : current;\n    current++;\n    return result;\n  }\n}(); ///////////////////////////////////////////////////////////\n// For stream debug (Should be commented out after used!)\n// @usage: printTask(this, 'begin');\n// @usage: printTask(this, null, {someExtraProp});\n// @usage: Use `__idxInPipeline` as conditional breakpiont.\n//\n// window.printTask = function (task: any, prefix: string, extra: { [key: string]: unknown }): void {\n//     window.ecTaskUID == null && (window.ecTaskUID = 0);\n//     task.uidDebug == null && (task.uidDebug = `task_${window.ecTaskUID++}`);\n//     task.agent && task.agent.uidDebug == null && (task.agent.uidDebug = `task_${window.ecTaskUID++}`);\n//     let props = [];\n//     if (task.__pipeline) {\n//         let val = `${task.__idxInPipeline}/${task.__pipeline.tail.__idxInPipeline} ${task.agent ? '(stub)' : ''}`;\n//         props.push({text: '__idxInPipeline/total', value: val});\n//     } else {\n//         let stubCount = 0;\n//         task.agentStubMap.each(() => stubCount++);\n//         props.push({text: 'idx', value: `overall (stubs: ${stubCount})`});\n//     }\n//     props.push({text: 'uid', value: task.uidDebug});\n//     if (task.__pipeline) {\n//         props.push({text: 'pipelineId', value: task.__pipeline.id});\n//         task.agent && props.push(\n//             {text: 'stubFor', value: task.agent.uidDebug}\n//         );\n//     }\n//     props.push(\n//         {text: 'dirty', value: task._dirty},\n//         {text: 'dueIndex', value: task._dueIndex},\n//         {text: 'dueEnd', value: task._dueEnd},\n//         {text: 'outputDueEnd', value: task._outputDueEnd}\n//     );\n//     if (extra) {\n//         Object.keys(extra).forEach(key => {\n//             props.push({text: key, value: extra[key]});\n//         });\n//     }\n//     let args = ['color: blue'];\n//     let msg = `%c[${prefix || 'T'}] %c` + props.map(item => (\n//         args.push('color: green', 'color: red'),\n//         `${item.text}: %c${item.value}`\n//     )).join('%c, ');\n//     console.log.apply(console, [msg].concat(args));\n//     // console.log(this);\n// };\n// window.printPipeline = function (task: any, prefix: string) {\n//     const pipeline = task.__pipeline;\n//     let currTask = pipeline.head;\n//     while (currTask) {\n//         window.printTask(currTask, prefix);\n//         currTask = currTask._downstream;\n//     }\n// };\n// window.showChain = function (chainHeadTask) {\n//     var chain = [];\n//     var task = chainHeadTask;\n//     while (task) {\n//         chain.push({\n//             task: task,\n//             up: task._upstream,\n//             down: task._downstream,\n//             idxInPipeline: task.__idxInPipeline\n//         });\n//         task = task._downstream;\n//     }\n//     return chain;\n// };\n// window.findTaskInChain = function (task, chainHeadTask) {\n//     let chain = window.showChain(chainHeadTask);\n//     let result = [];\n//     for (let i = 0; i < chain.length; i++) {\n//         let chainItem = chain[i];\n//         if (chainItem.task === task) {\n//             result.push(i);\n//         }\n//     }\n//     return result;\n// };\n// window.printChainAEachInChainB = function (chainHeadTaskA, chainHeadTaskB) {\n//     let chainA = window.showChain(chainHeadTaskA);\n//     for (let i = 0; i < chainA.length; i++) {\n//         console.log('chainAIdx:', i, 'inChainB:', window.findTaskInChain(chainA[i].task, chainHeadTaskB));\n//     }\n// };"],"names":[],"mappings":";AAkDO,oBAAoB,QAAQ;AACjC,SAAO,IAAI,KAAK,MAAM;AACxB;AAEG,IAAC,OAEJ,WAAY;AACV,iBAAc,QAAQ;AACpB,aAAS,UAAU;AACnB,SAAK,SAAS,OAAO;AACrB,SAAK,QAAQ,OAAO;AACpB,SAAK,SAAS,OAAO;AACrB,SAAK,WAAW,OAAO;AACvB,SAAK,SAAS;AAAA,EACf;AAUD,QAAK,UAAU,UAAU,SAAU,aAAa;AAC9C,QAAI,SAAS,KAAK;AAClB,QAAI,OAAO,eAAe,YAAY;AAItC,QAAI,KAAK,UAAU,QAAQ;AACzB,UAAI,UAAU,KAAK;AACnB,cAAQ,OAAO,QAAQ,aAAa,OAAO,QAAQ;AAAA,IACpD;AAED,QAAI,KAAK,YAAY;AACnB,WAAK,WAAW,cAAc;AAAA,IAC/B;AAED,QAAI;AAEJ,QAAI,KAAK,SAAS,CAAC,MAAM;AACvB,mBAAa,KAAK,MAAM,KAAK,OAAO;AAAA,IACrC;AAID,QAAI,YAAY,eAAe,KAAK,MAAM;AAC1C,QAAI,mBAAmB,KAAK,iBAAiB;AAC7C,QAAI,QAAQ,eAAe,eAAe,YAAY,KAAK;AAC3D,QAAI,eAAe,eAAe,YAAY,gBAAgB;AAE9D,QAAI,cAAc,SAAS,qBAAqB,cAAc;AAC5D,mBAAa;AAAA,IACd;AAED,4BAAwB,KAAK;AAC3B,OAAE,QAAO,MAAO,OAAM;AAEtB,aAAO;AAAA,IACR;AAED,QAAI;AAEJ,QAAI,KAAK,UAAU,eAAe,SAAS;AACzC,WAAK,SAAS;AACd,2BAAqB,KAAK,SAAS,IAAI;AAAA,IACxC;AAED,SAAK,SAAS;AACd,SAAK,gBAAgB;AACrB,QAAI,OAAO,eAAe,YAAY;AAEtC,QAAI,QAAQ;AAKV,WAAK,UAAU,OAAO;AAAA,IACvB,OACI;AAKD,WAAK,UAAU,KAAK,SAAS,KAAK,OAAO,KAAK,OAAO,IAAI;AAAA,IAC1D;AAIH,QAAI,KAAK,WAAW;AAClB,UAAI,QAAQ,KAAK;AACjB,UAAI,MAAM,KAAK,IAAI,QAAQ,OAAO,KAAK,YAAY,OAAO,UAAU,KAAK,OAAO;AAEhF,UAAI,CAAC,QAAS,uBAAsB,QAAQ,MAAM;AAChD,YAAI,WAAW,KAAK;AAEpB,YAAI,QAAQ,QAAQ,GAAG;AACrB,mBAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,iBAAK,YAAY,SAAS,IAAI,OAAO,KAAK,OAAO,YAAY;AAAA,UAC9D;AAAA,QACX,OAAe;AACL,eAAK,YAAY,UAAU,OAAO,KAAK,OAAO,YAAY;AAAA,QAC3D;AAAA,MACF;AAED,WAAK,YAAY;AAGjB,UAAI,eAAe,KAAK,oBAAoB,OAAO,KAAK,mBAAmB;AAO3E,WAAK,gBAAgB;AAAA,IAC3B,OAAW;AAIL,WAAK,YAAY,KAAK,gBAAgB,KAAK,oBAAoB,OAAO,KAAK,mBAAmB,KAAK;AAAA,IACpG;AAED,WAAO,KAAK;EAChB;AAEE,QAAK,UAAU,QAAQ,WAAY;AACjC,SAAK,SAAS;AACd,SAAK,YAAY,KAAK,SAAS,KAAK,OAAO;AAAA,EAC/C;AAEE,QAAK,UAAU,cAAc,SAAU,UAAU,OAAO,KAAK,OAAO,cAAc;AAChF,aAAS,MAAM,OAAO,KAAK,OAAO,YAAY;AAC9C,SAAK,mBAAmB;AAExB,SAAK,iBAAiB;AAAA,MACpB;AAAA,MACA;AAAA,MACA,OAAO,MAAM;AAAA,MACb,MAAM,SAAS;AAAA,IACrB,GAAO,KAAK,OAAO;AAAA,EACnB;AAEE,QAAK,UAAU,WAAW,SAAU,MAAM;AACxC,SAAK,YAAY,KAAK,gBAAgB,KAAK,UAAU;AACrD,SAAK,mBAAmB;AACxB,QAAI;AACJ,QAAI;AAEJ,QAAI,CAAC,QAAQ,KAAK,QAAQ;AACxB,iBAAW,KAAK,OAAO,KAAK,OAAO;AAEnC,UAAI,YAAY,SAAS,UAAU;AACjC,6BAAqB,SAAS;AAC9B,mBAAW,SAAS;AAAA,MACrB;AAGD,UAAI,QAAQ,QAAQ,KAAK,CAAC,SAAS,QAAQ;AACzC,mBAAW;AAAA,MACZ;AAAA,IACF;AAED,SAAK,YAAY;AACjB,SAAK,SAAS,KAAK,gBAAgB;AACnC,QAAI,aAAa,KAAK;AACtB,kBAAc,WAAW;AACzB,WAAO;AAAA,EACX;AAEE,QAAK,UAAU,aAAa,WAAY;AACtC,WAAO,KAAK,aAAa,KAAK,YAAY,KAAK;AAAA,EACnD;AAOE,QAAK,UAAU,OAAO,SAAU,UAAU;AAMxC,QAAI,KAAK,gBAAgB,YAAY,KAAK,QAAQ;AAChD,WAAK,cAAc;AACnB,eAAS,YAAY;AACrB,eAAS,MAAK;AAAA,IACf;AAAA,EACL;AAEE,QAAK,UAAU,UAAU,WAAY;AACnC,QAAI,KAAK,WAAW;AAClB;AAAA,IACD;AAED,SAAK,aAAc,MAAK,UAAU,cAAc;AAChD,SAAK,eAAgB,MAAK,YAAY,YAAY;AAClD,SAAK,SAAS;AACd,SAAK,YAAY;AAAA,EACrB;AAEE,QAAK,UAAU,cAAc,WAAY;AACvC,WAAO,KAAK;AAAA,EAChB;AAEE,QAAK,UAAU,gBAAgB,WAAY;AACzC,WAAO,KAAK;AAAA,EAChB;AAEE,QAAK,UAAU,eAAe,SAAU,KAAK;AAM3C,SAAK,gBAAgB,KAAK,mBAAmB;AAAA,EACjD;AAEE,SAAO;AACT,EAAI;AAIJ,IAAI,WAAW,WAAY;AACzB,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI,KAAK;AAAA,IACP,OAAO,SAAU,GAAG,GAAG,OAAO,QAAQ;AACpC,gBAAU;AACV,YAAM;AACN,cAAQ;AACR,qBAAe;AACf,iBAAW,KAAK,KAAK,eAAe,KAAK;AACzC,SAAG,OAAO,QAAQ,KAAK,eAAe,IAAI,UAAU;AAAA,IACrD;AAAA,EACL;AACE,SAAO;AAEP,4BAA0B;AACxB,WAAO,UAAU,MAAM,YAAY;AAAA,EACpC;AAED,qBAAmB;AACjB,QAAI,YAAY,UAAU,WAAW,QAAQ,KAAK,KAAK,UAAU,QAAQ;AACzE,QAAI,SAAS,WAAW,MAAM,OAAO,YAAY,eAAe,YAE9D;AACF;AACA,WAAO;AAAA,EACR;AACH;;"}
+{"version":3,"file":"task.js","sources":["../../../../../node_modules/echarts/lib/core/task.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, isArray } from 'zrender/lib/core/util.js';\n;\n/**\n * @param {Object} define\n * @return See the return of `createTask`.\n */\n\nexport function createTask(define) {\n  return new Task(define);\n}\n\nvar Task =\n/** @class */\nfunction () {\n  function Task(define) {\n    define = define || {};\n    this._reset = define.reset;\n    this._plan = define.plan;\n    this._count = define.count;\n    this._onDirty = define.onDirty;\n    this._dirty = true;\n  }\n  /**\n   * @param step Specified step.\n   * @param skip Skip customer perform call.\n   * @param modBy Sampling window size.\n   * @param modDataCount Sampling count.\n   * @return whether unfinished.\n   */\n\n\n  Task.prototype.perform = function (performArgs) {\n    var upTask = this._upstream;\n    var skip = performArgs && performArgs.skip; // TODO some refactor.\n    // Pull data. Must pull data each time, because context.data\n    // may be updated by Series.setData.\n\n    if (this._dirty && upTask) {\n      var context = this.context;\n      context.data = context.outputData = upTask.context.outputData;\n    }\n\n    if (this.__pipeline) {\n      this.__pipeline.currentTask = this;\n    }\n\n    var planResult;\n\n    if (this._plan && !skip) {\n      planResult = this._plan(this.context);\n    } // Support sharding by mod, which changes the render sequence and makes the rendered graphic\n    // elements uniformed distributed when progress, especially when moving or zooming.\n\n\n    var lastModBy = normalizeModBy(this._modBy);\n    var lastModDataCount = this._modDataCount || 0;\n    var modBy = normalizeModBy(performArgs && performArgs.modBy);\n    var modDataCount = performArgs && performArgs.modDataCount || 0;\n\n    if (lastModBy !== modBy || lastModDataCount !== modDataCount) {\n      planResult = 'reset';\n    }\n\n    function normalizeModBy(val) {\n      !(val >= 1) && (val = 1); // jshint ignore:line\n\n      return val;\n    }\n\n    var forceFirstProgress;\n\n    if (this._dirty || planResult === 'reset') {\n      this._dirty = false;\n      forceFirstProgress = this._doReset(skip);\n    }\n\n    this._modBy = modBy;\n    this._modDataCount = modDataCount;\n    var step = performArgs && performArgs.step;\n\n    if (upTask) {\n      if (process.env.NODE_ENV !== 'production') {\n        assert(upTask._outputDueEnd != null);\n      }\n\n      this._dueEnd = upTask._outputDueEnd;\n    } // DataTask or overallTask\n    else {\n        if (process.env.NODE_ENV !== 'production') {\n          assert(!this._progress || this._count);\n        }\n\n        this._dueEnd = this._count ? this._count(this.context) : Infinity;\n      } // Note: Stubs, that its host overall task let it has progress, has progress.\n    // If no progress, pass index from upstream to downstream each time plan called.\n\n\n    if (this._progress) {\n      var start = this._dueIndex;\n      var end = Math.min(step != null ? this._dueIndex + step : Infinity, this._dueEnd);\n\n      if (!skip && (forceFirstProgress || start < end)) {\n        var progress = this._progress;\n\n        if (isArray(progress)) {\n          for (var i = 0; i < progress.length; i++) {\n            this._doProgress(progress[i], start, end, modBy, modDataCount);\n          }\n        } else {\n          this._doProgress(progress, start, end, modBy, modDataCount);\n        }\n      }\n\n      this._dueIndex = end; // If no `outputDueEnd`, assume that output data and\n      // input data is the same, so use `dueIndex` as `outputDueEnd`.\n\n      var outputDueEnd = this._settedOutputEnd != null ? this._settedOutputEnd : end;\n\n      if (process.env.NODE_ENV !== 'production') {\n        // ??? Can not rollback.\n        assert(outputDueEnd >= this._outputDueEnd);\n      }\n\n      this._outputDueEnd = outputDueEnd;\n    } else {\n      // (1) Some overall task has no progress.\n      // (2) Stubs, that its host overall task do not let it has progress, has no progress.\n      // This should always be performed so it can be passed to downstream.\n      this._dueIndex = this._outputDueEnd = this._settedOutputEnd != null ? this._settedOutputEnd : this._dueEnd;\n    }\n\n    return this.unfinished();\n  };\n\n  Task.prototype.dirty = function () {\n    this._dirty = true;\n    this._onDirty && this._onDirty(this.context);\n  };\n\n  Task.prototype._doProgress = function (progress, start, end, modBy, modDataCount) {\n    iterator.reset(start, end, modBy, modDataCount);\n    this._callingProgress = progress;\n\n    this._callingProgress({\n      start: start,\n      end: end,\n      count: end - start,\n      next: iterator.next\n    }, this.context);\n  };\n\n  Task.prototype._doReset = function (skip) {\n    this._dueIndex = this._outputDueEnd = this._dueEnd = 0;\n    this._settedOutputEnd = null;\n    var progress;\n    var forceFirstProgress;\n\n    if (!skip && this._reset) {\n      progress = this._reset(this.context);\n\n      if (progress && progress.progress) {\n        forceFirstProgress = progress.forceFirstProgress;\n        progress = progress.progress;\n      } // To simplify no progress checking, array must has item.\n\n\n      if (isArray(progress) && !progress.length) {\n        progress = null;\n      }\n    }\n\n    this._progress = progress;\n    this._modBy = this._modDataCount = null;\n    var downstream = this._downstream;\n    downstream && downstream.dirty();\n    return forceFirstProgress;\n  };\n\n  Task.prototype.unfinished = function () {\n    return this._progress && this._dueIndex < this._dueEnd;\n  };\n  /**\n   * @param downTask The downstream task.\n   * @return The downstream task.\n   */\n\n\n  Task.prototype.pipe = function (downTask) {\n    if (process.env.NODE_ENV !== 'production') {\n      assert(downTask && !downTask._disposed && downTask !== this);\n    } // If already downstream, do not dirty downTask.\n\n\n    if (this._downstream !== downTask || this._dirty) {\n      this._downstream = downTask;\n      downTask._upstream = this;\n      downTask.dirty();\n    }\n  };\n\n  Task.prototype.dispose = function () {\n    if (this._disposed) {\n      return;\n    }\n\n    this._upstream && (this._upstream._downstream = null);\n    this._downstream && (this._downstream._upstream = null);\n    this._dirty = false;\n    this._disposed = true;\n  };\n\n  Task.prototype.getUpstream = function () {\n    return this._upstream;\n  };\n\n  Task.prototype.getDownstream = function () {\n    return this._downstream;\n  };\n\n  Task.prototype.setOutputEnd = function (end) {\n    // This only happend in dataTask, dataZoom, map, currently.\n    // where dataZoom do not set end each time, but only set\n    // when reset. So we should record the setted end, in case\n    // that the stub of dataZoom perform again and earse the\n    // setted end by upstream.\n    this._outputDueEnd = this._settedOutputEnd = end;\n  };\n\n  return Task;\n}();\n\nexport { Task };\n\nvar iterator = function () {\n  var end;\n  var current;\n  var modBy;\n  var modDataCount;\n  var winCount;\n  var it = {\n    reset: function (s, e, sStep, sCount) {\n      current = s;\n      end = e;\n      modBy = sStep;\n      modDataCount = sCount;\n      winCount = Math.ceil(modDataCount / modBy);\n      it.next = modBy > 1 && modDataCount > 0 ? modNext : sequentialNext;\n    }\n  };\n  return it;\n\n  function sequentialNext() {\n    return current < end ? current++ : null;\n  }\n\n  function modNext() {\n    var dataIndex = current % winCount * modBy + Math.ceil(current / winCount);\n    var result = current >= end ? null : dataIndex < modDataCount ? dataIndex // If modDataCount is smaller than data.count() (consider `appendData` case),\n    // Use normal linear rendering mode.\n    : current;\n    current++;\n    return result;\n  }\n}(); ///////////////////////////////////////////////////////////\n// For stream debug (Should be commented out after used!)\n// @usage: printTask(this, 'begin');\n// @usage: printTask(this, null, {someExtraProp});\n// @usage: Use `__idxInPipeline` as conditional breakpiont.\n//\n// window.printTask = function (task: any, prefix: string, extra: { [key: string]: unknown }): void {\n//     window.ecTaskUID == null && (window.ecTaskUID = 0);\n//     task.uidDebug == null && (task.uidDebug = `task_${window.ecTaskUID++}`);\n//     task.agent && task.agent.uidDebug == null && (task.agent.uidDebug = `task_${window.ecTaskUID++}`);\n//     let props = [];\n//     if (task.__pipeline) {\n//         let val = `${task.__idxInPipeline}/${task.__pipeline.tail.__idxInPipeline} ${task.agent ? '(stub)' : ''}`;\n//         props.push({text: '__idxInPipeline/total', value: val});\n//     } else {\n//         let stubCount = 0;\n//         task.agentStubMap.each(() => stubCount++);\n//         props.push({text: 'idx', value: `overall (stubs: ${stubCount})`});\n//     }\n//     props.push({text: 'uid', value: task.uidDebug});\n//     if (task.__pipeline) {\n//         props.push({text: 'pipelineId', value: task.__pipeline.id});\n//         task.agent && props.push(\n//             {text: 'stubFor', value: task.agent.uidDebug}\n//         );\n//     }\n//     props.push(\n//         {text: 'dirty', value: task._dirty},\n//         {text: 'dueIndex', value: task._dueIndex},\n//         {text: 'dueEnd', value: task._dueEnd},\n//         {text: 'outputDueEnd', value: task._outputDueEnd}\n//     );\n//     if (extra) {\n//         Object.keys(extra).forEach(key => {\n//             props.push({text: key, value: extra[key]});\n//         });\n//     }\n//     let args = ['color: blue'];\n//     let msg = `%c[${prefix || 'T'}] %c` + props.map(item => (\n//         args.push('color: green', 'color: red'),\n//         `${item.text}: %c${item.value}`\n//     )).join('%c, ');\n//     console.log.apply(console, [msg].concat(args));\n//     // console.log(this);\n// };\n// window.printPipeline = function (task: any, prefix: string) {\n//     const pipeline = task.__pipeline;\n//     let currTask = pipeline.head;\n//     while (currTask) {\n//         window.printTask(currTask, prefix);\n//         currTask = currTask._downstream;\n//     }\n// };\n// window.showChain = function (chainHeadTask) {\n//     var chain = [];\n//     var task = chainHeadTask;\n//     while (task) {\n//         chain.push({\n//             task: task,\n//             up: task._upstream,\n//             down: task._downstream,\n//             idxInPipeline: task.__idxInPipeline\n//         });\n//         task = task._downstream;\n//     }\n//     return chain;\n// };\n// window.findTaskInChain = function (task, chainHeadTask) {\n//     let chain = window.showChain(chainHeadTask);\n//     let result = [];\n//     for (let i = 0; i < chain.length; i++) {\n//         let chainItem = chain[i];\n//         if (chainItem.task === task) {\n//             result.push(i);\n//         }\n//     }\n//     return result;\n// };\n// window.printChainAEachInChainB = function (chainHeadTaskA, chainHeadTaskB) {\n//     let chainA = window.showChain(chainHeadTaskA);\n//     for (let i = 0; i < chainA.length; i++) {\n//         console.log('chainAIdx:', i, 'inChainB:', window.findTaskInChain(chainA[i].task, chainHeadTaskB));\n//     }\n// };"],"names":["Task"],"mappings":";AAkDO,SAAS,WAAW,QAAQ;AACjC,SAAO,IAAI,KAAK,MAAM;AACxB;AAEG,IAAC,OAEJ,WAAY;AACV,WAASA,MAAK,QAAQ;AACpB,aAAS,UAAU;AACnB,SAAK,SAAS,OAAO;AACrB,SAAK,QAAQ,OAAO;AACpB,SAAK,SAAS,OAAO;AACrB,SAAK,WAAW,OAAO;AACvB,SAAK,SAAS;AAAA,EACf;AAUD,EAAAA,MAAK,UAAU,UAAU,SAAU,aAAa;AAC9C,QAAI,SAAS,KAAK;AAClB,QAAI,OAAO,eAAe,YAAY;AAItC,QAAI,KAAK,UAAU,QAAQ;AACzB,UAAI,UAAU,KAAK;AACnB,cAAQ,OAAO,QAAQ,aAAa,OAAO,QAAQ;AAAA,IACpD;AAED,QAAI,KAAK,YAAY;AACnB,WAAK,WAAW,cAAc;AAAA,IAC/B;AAED,QAAI;AAEJ,QAAI,KAAK,SAAS,CAAC,MAAM;AACvB,mBAAa,KAAK,MAAM,KAAK,OAAO;AAAA,IACrC;AAID,QAAI,YAAY,eAAe,KAAK,MAAM;AAC1C,QAAI,mBAAmB,KAAK,iBAAiB;AAC7C,QAAI,QAAQ,eAAe,eAAe,YAAY,KAAK;AAC3D,QAAI,eAAe,eAAe,YAAY,gBAAgB;AAE9D,QAAI,cAAc,SAAS,qBAAqB,cAAc;AAC5D,mBAAa;AAAA,IACd;AAED,aAAS,eAAe,KAAK;AAC3B,QAAE,OAAO,OAAO,MAAM;AAEtB,aAAO;AAAA,IACR;AAED,QAAI;AAEJ,QAAI,KAAK,UAAU,eAAe,SAAS;AACzC,WAAK,SAAS;AACd,2BAAqB,KAAK,SAAS,IAAI;AAAA,IACxC;AAED,SAAK,SAAS;AACd,SAAK,gBAAgB;AACrB,QAAI,OAAO,eAAe,YAAY;AAEtC,QAAI,QAAQ;AACV,UAAI,QAAQ,IAAI,aAAa,cAAc;AACzC,eAAO,OAAO,iBAAiB,IAAI;AAAA,MACpC;AAED,WAAK,UAAU,OAAO;AAAA,IACvB,OACI;AACD,UAAI,QAAQ,IAAI,aAAa,cAAc;AACzC,eAAO,CAAC,KAAK,aAAa,KAAK,MAAM;AAAA,MACtC;AAED,WAAK,UAAU,KAAK,SAAS,KAAK,OAAO,KAAK,OAAO,IAAI;AAAA,IAC1D;AAIH,QAAI,KAAK,WAAW;AAClB,UAAI,QAAQ,KAAK;AACjB,UAAI,MAAM,KAAK,IAAI,QAAQ,OAAO,KAAK,YAAY,OAAO,UAAU,KAAK,OAAO;AAEhF,UAAI,CAAC,SAAS,sBAAsB,QAAQ,MAAM;AAChD,YAAI,WAAW,KAAK;AAEpB,YAAI,QAAQ,QAAQ,GAAG;AACrB,mBAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,iBAAK,YAAY,SAAS,IAAI,OAAO,KAAK,OAAO,YAAY;AAAA,UAC9D;AAAA,QACX,OAAe;AACL,eAAK,YAAY,UAAU,OAAO,KAAK,OAAO,YAAY;AAAA,QAC3D;AAAA,MACF;AAED,WAAK,YAAY;AAGjB,UAAI,eAAe,KAAK,oBAAoB,OAAO,KAAK,mBAAmB;AAE3E,UAAI,QAAQ,IAAI,aAAa,cAAc;AAEzC,eAAO,gBAAgB,KAAK,aAAa;AAAA,MAC1C;AAED,WAAK,gBAAgB;AAAA,IAC3B,OAAW;AAIL,WAAK,YAAY,KAAK,gBAAgB,KAAK,oBAAoB,OAAO,KAAK,mBAAmB,KAAK;AAAA,IACpG;AAED,WAAO,KAAK;EAChB;AAEE,EAAAA,MAAK,UAAU,QAAQ,WAAY;AACjC,SAAK,SAAS;AACd,SAAK,YAAY,KAAK,SAAS,KAAK,OAAO;AAAA,EAC/C;AAEE,EAAAA,MAAK,UAAU,cAAc,SAAU,UAAU,OAAO,KAAK,OAAO,cAAc;AAChF,aAAS,MAAM,OAAO,KAAK,OAAO,YAAY;AAC9C,SAAK,mBAAmB;AAExB,SAAK,iBAAiB;AAAA,MACpB;AAAA,MACA;AAAA,MACA,OAAO,MAAM;AAAA,MACb,MAAM,SAAS;AAAA,IACrB,GAAO,KAAK,OAAO;AAAA,EACnB;AAEE,EAAAA,MAAK,UAAU,WAAW,SAAU,MAAM;AACxC,SAAK,YAAY,KAAK,gBAAgB,KAAK,UAAU;AACrD,SAAK,mBAAmB;AACxB,QAAI;AACJ,QAAI;AAEJ,QAAI,CAAC,QAAQ,KAAK,QAAQ;AACxB,iBAAW,KAAK,OAAO,KAAK,OAAO;AAEnC,UAAI,YAAY,SAAS,UAAU;AACjC,6BAAqB,SAAS;AAC9B,mBAAW,SAAS;AAAA,MACrB;AAGD,UAAI,QAAQ,QAAQ,KAAK,CAAC,SAAS,QAAQ;AACzC,mBAAW;AAAA,MACZ;AAAA,IACF;AAED,SAAK,YAAY;AACjB,SAAK,SAAS,KAAK,gBAAgB;AACnC,QAAI,aAAa,KAAK;AACtB,kBAAc,WAAW;AACzB,WAAO;AAAA,EACX;AAEE,EAAAA,MAAK,UAAU,aAAa,WAAY;AACtC,WAAO,KAAK,aAAa,KAAK,YAAY,KAAK;AAAA,EACnD;AAOE,EAAAA,MAAK,UAAU,OAAO,SAAU,UAAU;AACxC,QAAI,QAAQ,IAAI,aAAa,cAAc;AACzC,aAAO,YAAY,CAAC,SAAS,aAAa,aAAa,IAAI;AAAA,IAC5D;AAGD,QAAI,KAAK,gBAAgB,YAAY,KAAK,QAAQ;AAChD,WAAK,cAAc;AACnB,eAAS,YAAY;AACrB,eAAS,MAAK;AAAA,IACf;AAAA,EACL;AAEE,EAAAA,MAAK,UAAU,UAAU,WAAY;AACnC,QAAI,KAAK,WAAW;AAClB;AAAA,IACD;AAED,SAAK,cAAc,KAAK,UAAU,cAAc;AAChD,SAAK,gBAAgB,KAAK,YAAY,YAAY;AAClD,SAAK,SAAS;AACd,SAAK,YAAY;AAAA,EACrB;AAEE,EAAAA,MAAK,UAAU,cAAc,WAAY;AACvC,WAAO,KAAK;AAAA,EAChB;AAEE,EAAAA,MAAK,UAAU,gBAAgB,WAAY;AACzC,WAAO,KAAK;AAAA,EAChB;AAEE,EAAAA,MAAK,UAAU,eAAe,SAAU,KAAK;AAM3C,SAAK,gBAAgB,KAAK,mBAAmB;AAAA,EACjD;AAEE,SAAOA;AACT,EAAI;AAIJ,IAAI,WAAW,WAAY;AACzB,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI;AACJ,MAAI,KAAK;AAAA,IACP,OAAO,SAAU,GAAG,GAAG,OAAO,QAAQ;AACpC,gBAAU;AACV,YAAM;AACN,cAAQ;AACR,qBAAe;AACf,iBAAW,KAAK,KAAK,eAAe,KAAK;AACzC,SAAG,OAAO,QAAQ,KAAK,eAAe,IAAI,UAAU;AAAA,IACrD;AAAA,EACL;AACE,SAAO;AAEP,WAAS,iBAAiB;AACxB,WAAO,UAAU,MAAM,YAAY;AAAA,EACpC;AAED,WAAS,UAAU;AACjB,QAAI,YAAY,UAAU,WAAW,QAAQ,KAAK,KAAK,UAAU,QAAQ;AACzE,QAAI,SAAS,WAAW,MAAM,OAAO,YAAY,eAAe,YAE9D;AACF;AACA,WAAO;AAAA,EACR;AACH;"}

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

@@ -145,6 +145,8 @@ var DataDiffer = function() {
   };
   return DataDiffer2;
 }();
-var DataDiffer$1 = DataDiffer;
-export { DataDiffer$1 as default };
+const DataDiffer$1 = DataDiffer;
+export {
+  DataDiffer$1 as default
+};
 //# sourceMappingURL=DataDiffer.js.map

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

@@ -1 +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/*\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*/\nfunction dataIndexMapValueLength(valNumOrArrLengthMoreThan2) {\n  return valNumOrArrLengthMoreThan2 == null ? 0 : valNumOrArrLengthMoreThan2.length || 1;\n}\n\nfunction defaultKeyGetter(item) {\n  return item;\n}\n\nvar DataDiffer =\n/** @class */\nfunction () {\n  /**\n   * @param context Can be visited by this.context in callback.\n   */\n  function DataDiffer(oldArr, newArr, oldKeyGetter, newKeyGetter, context, // By default: 'oneToOne'.\n  diffMode) {\n    this._old = oldArr;\n    this._new = newArr;\n    this._oldKeyGetter = oldKeyGetter || defaultKeyGetter;\n    this._newKeyGetter = newKeyGetter || defaultKeyGetter; // Visible in callback via `this.context`;\n\n    this.context = context;\n    this._diffModeMultiple = diffMode === 'multiple';\n  }\n  /**\n   * Callback function when add a data\n   */\n\n\n  DataDiffer.prototype.add = function (func) {\n    this._add = func;\n    return this;\n  };\n  /**\n   * Callback function when update a data\n   */\n\n\n  DataDiffer.prototype.update = function (func) {\n    this._update = func;\n    return this;\n  };\n  /**\n   * Callback function when update a data and only work in `cbMode: 'byKey'`.\n   */\n\n\n  DataDiffer.prototype.updateManyToOne = function (func) {\n    this._updateManyToOne = func;\n    return this;\n  };\n  /**\n   * Callback function when update a data and only work in `cbMode: 'byKey'`.\n   */\n\n\n  DataDiffer.prototype.updateOneToMany = function (func) {\n    this._updateOneToMany = func;\n    return this;\n  };\n  /**\n   * Callback function when update a data and only work in `cbMode: 'byKey'`.\n   */\n\n\n  DataDiffer.prototype.updateManyToMany = function (func) {\n    this._updateManyToMany = func;\n    return this;\n  };\n  /**\n   * Callback function when remove a data\n   */\n\n\n  DataDiffer.prototype.remove = function (func) {\n    this._remove = func;\n    return this;\n  };\n\n  DataDiffer.prototype.execute = function () {\n    this[this._diffModeMultiple ? '_executeMultiple' : '_executeOneToOne']();\n  };\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\n    this._initIndexMap(oldArr, null, oldDataKeyArr, '_oldKeyGetter');\n\n    this._initIndexMap(newArr, newDataIndexMap, newDataKeyArr, '_newKeyGetter');\n\n    for (var i = 0; i < oldArr.length; i++) {\n      var oldKey = oldDataKeyArr[i];\n      var newIdxMapVal = newDataIndexMap[oldKey];\n      var newIdxMapValLen = dataIndexMapValueLength(newIdxMapVal); // idx can never be empty array here. see 'set null' logic below.\n\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\n        if (newIdxMapVal.length === 1) {\n          newDataIndexMap[oldKey] = newIdxMapVal[0];\n        }\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\n    this._performRestAdd(newDataKeyArr, newDataIndexMap);\n  };\n  /**\n   * For example, consider the case:\n   * oldData: [o0, o1, o2, o3, o4, o5, o6, o7],\n   * newData: [n0, n1, n2, n3, n4, n5, n6, n7, n8],\n   * Where:\n   *     o0, o1, n0 has key 'a' (many to one)\n   *     o5, n4, n5, n6 has key 'b' (one to many)\n   *     o2, n1 has key 'c' (one to one)\n   *     n2, n3 has key 'd' (add)\n   *     o3, o4 has key 'e' (remove)\n   *     o6, o7, n7, n8 has key 'f' (many to many, treated as add and remove)\n   * Then:\n   *     (The order of the following directives are not ensured.)\n   *     this._updateManyToOne(n0, [o0, o1]);\n   *     this._updateOneToMany([n4, n5, n6], o5);\n   *     this._update(n1, o2);\n   *     this._remove(o3);\n   *     this._remove(o4);\n   *     this._remove(o6);\n   *     this._remove(o7);\n   *     this._add(n2);\n   *     this._add(n3);\n   *     this._add(n7);\n   *     this._add(n8);\n   */\n\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\n    this._initIndexMap(oldArr, oldDataIndexMap, oldDataKeyArr, '_oldKeyGetter');\n\n    this._initIndexMap(newArr, newDataIndexMap, newDataKeyArr, '_newKeyGetter');\n\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\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\n    this._performRestAdd(newDataKeyArr, newDataIndexMap);\n  };\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\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      } // Support both `newDataKeyArr` are duplication removed or not removed.\n\n\n      newDataIndexMap[newKey] = null;\n    }\n  };\n\n  DataDiffer.prototype._initIndexMap = function (arr, // Can be null.\n  map, // 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\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\n      if (!cbModeMultiple) {\n        keyArr[i] = key;\n      }\n\n      if (!map) {\n        continue;\n      }\n\n      var idxMapVal = map[key];\n      var idxMapValLen = dataIndexMapValueLength(idxMapVal);\n\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\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\n  return DataDiffer;\n}();\n\nexport default DataDiffer;"],"names":[],"mappings":"AA2CA,iCAAiC,4BAA4B;AAC3D,SAAO,8BAA8B,OAAO,IAAI,2BAA2B,UAAU;AACvF;AAEA,0BAA0B,MAAM;AAC9B,SAAO;AACT;AAEA,IAAI,aAEJ,WAAY;AAIV,uBAAoB,QAAQ,QAAQ,cAAc,cAAc,SAChE,UAAU;AACR,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,gBAAgB,gBAAgB;AACrC,SAAK,gBAAgB,gBAAgB;AAErC,SAAK,UAAU;AACf,SAAK,oBAAoB,aAAa;AAAA,EACvC;AAMD,cAAW,UAAU,MAAM,SAAU,MAAM;AACzC,SAAK,OAAO;AACZ,WAAO;AAAA,EACX;AAME,cAAW,UAAU,SAAS,SAAU,MAAM;AAC5C,SAAK,UAAU;AACf,WAAO;AAAA,EACX;AAME,cAAW,UAAU,kBAAkB,SAAU,MAAM;AACrD,SAAK,mBAAmB;AACxB,WAAO;AAAA,EACX;AAME,cAAW,UAAU,kBAAkB,SAAU,MAAM;AACrD,SAAK,mBAAmB;AACxB,WAAO;AAAA,EACX;AAME,cAAW,UAAU,mBAAmB,SAAU,MAAM;AACtD,SAAK,oBAAoB;AACzB,WAAO;AAAA,EACX;AAME,cAAW,UAAU,SAAS,SAAU,MAAM;AAC5C,SAAK,UAAU;AACf,WAAO;AAAA,EACX;AAEE,cAAW,UAAU,UAAU,WAAY;AACzC,SAAK,KAAK,oBAAoB,qBAAqB,oBAAmB;AAAA,EAC1E;AAEE,cAAW,UAAU,mBAAmB,WAAY;AAClD,QAAI,SAAS,KAAK;AAClB,QAAI,SAAS,KAAK;AAClB,QAAI,kBAAkB,CAAA;AACtB,QAAI,gBAAgB,IAAI,MAAM,OAAO,MAAM;AAC3C,QAAI,gBAAgB,IAAI,MAAM,OAAO,MAAM;AAE3C,SAAK,cAAc,QAAQ,MAAM,eAAe,eAAe;AAE/D,SAAK,cAAc,QAAQ,iBAAiB,eAAe,eAAe;AAE1E,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAI,SAAS,cAAc;AAC3B,UAAI,eAAe,gBAAgB;AACnC,UAAI,kBAAkB,wBAAwB,YAAY;AAE1D,UAAI,kBAAkB,GAAG;AAGvB,YAAI,SAAS,aAAa;AAE1B,YAAI,aAAa,WAAW,GAAG;AAC7B,0BAAgB,UAAU,aAAa;AAAA,QACxC;AAED,aAAK,WAAW,KAAK,QAAQ,QAAQ,CAAC;AAAA,MAC9C,WAAiB,oBAAoB,GAAG;AAChC,wBAAgB,UAAU;AAC1B,aAAK,WAAW,KAAK,QAAQ,cAAc,CAAC;AAAA,MACpD,OAAa;AACL,aAAK,WAAW,KAAK,QAAQ,CAAC;AAAA,MAC/B;AAAA,IACF;AAED,SAAK,gBAAgB,eAAe,eAAe;AAAA,EACvD;AA4BE,cAAW,UAAU,mBAAmB,WAAY;AAClD,QAAI,SAAS,KAAK;AAClB,QAAI,SAAS,KAAK;AAClB,QAAI,kBAAkB,CAAA;AACtB,QAAI,kBAAkB,CAAA;AACtB,QAAI,gBAAgB,CAAA;AACpB,QAAI,gBAAgB,CAAA;AAEpB,SAAK,cAAc,QAAQ,iBAAiB,eAAe,eAAe;AAE1E,SAAK,cAAc,QAAQ,iBAAiB,eAAe,eAAe;AAE1E,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,UAAI,SAAS,cAAc;AAC3B,UAAI,eAAe,gBAAgB;AACnC,UAAI,eAAe,gBAAgB;AACnC,UAAI,kBAAkB,wBAAwB,YAAY;AAC1D,UAAI,kBAAkB,wBAAwB,YAAY;AAE1D,UAAI,kBAAkB,KAAK,oBAAoB,GAAG;AAChD,aAAK,oBAAoB,KAAK,iBAAiB,cAAc,YAAY;AACzE,wBAAgB,UAAU;AAAA,MAC3B,WAAU,oBAAoB,KAAK,kBAAkB,GAAG;AACvD,aAAK,oBAAoB,KAAK,iBAAiB,cAAc,YAAY;AACzE,wBAAgB,UAAU;AAAA,MAC3B,WAAU,oBAAoB,KAAK,oBAAoB,GAAG;AACzD,aAAK,WAAW,KAAK,QAAQ,cAAc,YAAY;AACvD,wBAAgB,UAAU;AAAA,MAC3B,WAAU,kBAAkB,KAAK,kBAAkB,GAAG;AACrD,aAAK,qBAAqB,KAAK,kBAAkB,cAAc,YAAY;AAC3E,wBAAgB,UAAU;AAAA,MAClC,WAAiB,kBAAkB,GAAG;AAC9B,iBAAS,MAAM,GAAG,MAAM,iBAAiB,OAAO;AAC9C,eAAK,WAAW,KAAK,QAAQ,aAAa,IAAI;AAAA,QAC/C;AAAA,MACT,OAAa;AACL,aAAK,WAAW,KAAK,QAAQ,YAAY;AAAA,MAC1C;AAAA,IACF;AAED,SAAK,gBAAgB,eAAe,eAAe;AAAA,EACvD;AAEE,cAAW,UAAU,kBAAkB,SAAU,eAAe,iBAAiB;AAC/E,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,UAAI,SAAS,cAAc;AAC3B,UAAI,eAAe,gBAAgB;AACnC,UAAI,eAAe,wBAAwB,YAAY;AAEvD,UAAI,eAAe,GAAG;AACpB,iBAAS,IAAI,GAAG,IAAI,cAAc,KAAK;AACrC,eAAK,QAAQ,KAAK,KAAK,aAAa,EAAE;AAAA,QACvC;AAAA,MACT,WAAiB,iBAAiB,GAAG;AAC7B,aAAK,QAAQ,KAAK,KAAK,YAAY;AAAA,MACpC;AAGD,sBAAgB,UAAU;AAAA,IAC3B;AAAA,EACL;AAEE,cAAW,UAAU,gBAAgB,SAAU,KAC/C,KAGA,QAAQ,eAAe;AACrB,QAAI,iBAAiB,KAAK;AAE1B,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAEnC,UAAI,MAAM,SAAS,KAAK,eAAe,IAAI,IAAI,CAAC;AAEhD,UAAI,CAAC,gBAAgB;AACnB,eAAO,KAAK;AAAA,MACb;AAED,UAAI,CAAC,KAAK;AACR;AAAA,MACD;AAED,UAAI,YAAY,IAAI;AACpB,UAAI,eAAe,wBAAwB,SAAS;AAEpD,UAAI,iBAAiB,GAAG;AAGtB,YAAI,OAAO;AAEX,YAAI,gBAAgB;AAClB,iBAAO,KAAK,GAAG;AAAA,QAChB;AAAA,MACT,WAAiB,iBAAiB,GAAG;AAC7B,YAAI,OAAO,CAAC,WAAW,CAAC;AAAA,MAChC,OAAa;AACL,kBAAU,KAAK,CAAC;AAAA,MACjB;AAAA,IACF;AAAA,EACL;AAEE,SAAO;AACT;AAEA,IAAA,eAAe;;"}
+{"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/*\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*/\nfunction dataIndexMapValueLength(valNumOrArrLengthMoreThan2) {\n  return valNumOrArrLengthMoreThan2 == null ? 0 : valNumOrArrLengthMoreThan2.length || 1;\n}\n\nfunction defaultKeyGetter(item) {\n  return item;\n}\n\nvar DataDiffer =\n/** @class */\nfunction () {\n  /**\n   * @param context Can be visited by this.context in callback.\n   */\n  function DataDiffer(oldArr, newArr, oldKeyGetter, newKeyGetter, context, // By default: 'oneToOne'.\n  diffMode) {\n    this._old = oldArr;\n    this._new = newArr;\n    this._oldKeyGetter = oldKeyGetter || defaultKeyGetter;\n    this._newKeyGetter = newKeyGetter || defaultKeyGetter; // Visible in callback via `this.context`;\n\n    this.context = context;\n    this._diffModeMultiple = diffMode === 'multiple';\n  }\n  /**\n   * Callback function when add a data\n   */\n\n\n  DataDiffer.prototype.add = function (func) {\n    this._add = func;\n    return this;\n  };\n  /**\n   * Callback function when update a data\n   */\n\n\n  DataDiffer.prototype.update = function (func) {\n    this._update = func;\n    return this;\n  };\n  /**\n   * Callback function when update a data and only work in `cbMode: 'byKey'`.\n   */\n\n\n  DataDiffer.prototype.updateManyToOne = function (func) {\n    this._updateManyToOne = func;\n    return this;\n  };\n  /**\n   * Callback function when update a data and only work in `cbMode: 'byKey'`.\n   */\n\n\n  DataDiffer.prototype.updateOneToMany = function (func) {\n    this._updateOneToMany = func;\n    return this;\n  };\n  /**\n   * Callback function when update a data and only work in `cbMode: 'byKey'`.\n   */\n\n\n  DataDiffer.prototype.updateManyToMany = function (func) {\n    this._updateManyToMany = func;\n    return this;\n  };\n  /**\n   * Callback function when remove a data\n   */\n\n\n  DataDiffer.prototype.remove = function (func) {\n    this._remove = func;\n    return this;\n  };\n\n  DataDiffer.prototype.execute = function () {\n    this[this._diffModeMultiple ? '_executeMultiple' : '_executeOneToOne']();\n  };\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\n    this._initIndexMap(oldArr, null, oldDataKeyArr, '_oldKeyGetter');\n\n    this._initIndexMap(newArr, newDataIndexMap, newDataKeyArr, '_newKeyGetter');\n\n    for (var i = 0; i < oldArr.length; i++) {\n      var oldKey = oldDataKeyArr[i];\n      var newIdxMapVal = newDataIndexMap[oldKey];\n      var newIdxMapValLen = dataIndexMapValueLength(newIdxMapVal); // idx can never be empty array here. see 'set null' logic below.\n\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\n        if (newIdxMapVal.length === 1) {\n          newDataIndexMap[oldKey] = newIdxMapVal[0];\n        }\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\n    this._performRestAdd(newDataKeyArr, newDataIndexMap);\n  };\n  /**\n   * For example, consider the case:\n   * oldData: [o0, o1, o2, o3, o4, o5, o6, o7],\n   * newData: [n0, n1, n2, n3, n4, n5, n6, n7, n8],\n   * Where:\n   *     o0, o1, n0 has key 'a' (many to one)\n   *     o5, n4, n5, n6 has key 'b' (one to many)\n   *     o2, n1 has key 'c' (one to one)\n   *     n2, n3 has key 'd' (add)\n   *     o3, o4 has key 'e' (remove)\n   *     o6, o7, n7, n8 has key 'f' (many to many, treated as add and remove)\n   * Then:\n   *     (The order of the following directives are not ensured.)\n   *     this._updateManyToOne(n0, [o0, o1]);\n   *     this._updateOneToMany([n4, n5, n6], o5);\n   *     this._update(n1, o2);\n   *     this._remove(o3);\n   *     this._remove(o4);\n   *     this._remove(o6);\n   *     this._remove(o7);\n   *     this._add(n2);\n   *     this._add(n3);\n   *     this._add(n7);\n   *     this._add(n8);\n   */\n\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\n    this._initIndexMap(oldArr, oldDataIndexMap, oldDataKeyArr, '_oldKeyGetter');\n\n    this._initIndexMap(newArr, newDataIndexMap, newDataKeyArr, '_newKeyGetter');\n\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\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\n    this._performRestAdd(newDataKeyArr, newDataIndexMap);\n  };\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\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      } // Support both `newDataKeyArr` are duplication removed or not removed.\n\n\n      newDataIndexMap[newKey] = null;\n    }\n  };\n\n  DataDiffer.prototype._initIndexMap = function (arr, // Can be null.\n  map, // 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\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\n      if (!cbModeMultiple) {\n        keyArr[i] = key;\n      }\n\n      if (!map) {\n        continue;\n      }\n\n      var idxMapVal = map[key];\n      var idxMapValLen = dataIndexMapValueLength(idxMapVal);\n\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\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\n  return DataDiffer;\n}();\n\nexport default DataDiffer;"],"names":["DataDiffer"],"mappings":"AA2CA,SAAS,wBAAwB,4BAA4B;AAC3D,SAAO,8BAA8B,OAAO,IAAI,2BAA2B,UAAU;AACvF;AAEA,SAAS,iBAAiB,MAAM;AAC9B,SAAO;AACT;AAEA,IAAI,aAEJ,WAAY;AAIV,WAASA,YAAW,QAAQ,QAAQ,cAAc,cAAc,SAChE,UAAU;AACR,SAAK,OAAO;AACZ,SAAK,OAAO;AACZ,SAAK,gBAAgB,gBAAgB;AACrC,SAAK,gBAAgB,gBAAgB;AAErC,SAAK,UAAU;AACf,SAAK,oBAAoB,aAAa;AAAA,EACvC;AAMD,EAAAA,YAAW,UAAU,MAAM,SAAU,MAAM;AACzC,SAAK,OAAO;AACZ,WAAO;AAAA,EACX;AAME,EAAAA,YAAW,UAAU,SAAS,SAAU,MAAM;AAC5C,SAAK,UAAU;AACf,WAAO;AAAA,EACX;AAME,EAAAA,YAAW,UAAU,kBAAkB,SAAU,MAAM;AACrD,SAAK,mBAAmB;AACxB,WAAO;AAAA,EACX;AAME,EAAAA,YAAW,UAAU,kBAAkB,SAAU,MAAM;AACrD,SAAK,mBAAmB;AACxB,WAAO;AAAA,EACX;AAME,EAAAA,YAAW,UAAU,mBAAmB,SAAU,MAAM;AACtD,SAAK,oBAAoB;AACzB,WAAO;AAAA,EACX;AAME,EAAAA,YAAW,UAAU,SAAS,SAAU,MAAM;AAC5C,SAAK,UAAU;AACf,WAAO;AAAA,EACX;AAEE,EAAAA,YAAW,UAAU,UAAU,WAAY;AACzC,SAAK,KAAK,oBAAoB,qBAAqB,oBAAmB;AAAA,EAC1E;AAEE,EAAAA,YAAW,UAAU,mBAAmB,WAAY;AAClD,QAAI,SAAS,KAAK;AAClB,QAAI,SAAS,KAAK;AAClB,QAAI,kBAAkB,CAAA;AACtB,QAAI,gBAAgB,IAAI,MAAM,OAAO,MAAM;AAC3C,QAAI,gBAAgB,IAAI,MAAM,OAAO,MAAM;AAE3C,SAAK,cAAc,QAAQ,MAAM,eAAe,eAAe;AAE/D,SAAK,cAAc,QAAQ,iBAAiB,eAAe,eAAe;AAE1E,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAI,SAAS,cAAc;AAC3B,UAAI,eAAe,gBAAgB;AACnC,UAAI,kBAAkB,wBAAwB,YAAY;AAE1D,UAAI,kBAAkB,GAAG;AAGvB,YAAI,SAAS,aAAa;AAE1B,YAAI,aAAa,WAAW,GAAG;AAC7B,0BAAgB,UAAU,aAAa;AAAA,QACxC;AAED,aAAK,WAAW,KAAK,QAAQ,QAAQ,CAAC;AAAA,MAC9C,WAAiB,oBAAoB,GAAG;AAChC,wBAAgB,UAAU;AAC1B,aAAK,WAAW,KAAK,QAAQ,cAAc,CAAC;AAAA,MACpD,OAAa;AACL,aAAK,WAAW,KAAK,QAAQ,CAAC;AAAA,MAC/B;AAAA,IACF;AAED,SAAK,gBAAgB,eAAe,eAAe;AAAA,EACvD;AA4BE,EAAAA,YAAW,UAAU,mBAAmB,WAAY;AAClD,QAAI,SAAS,KAAK;AAClB,QAAI,SAAS,KAAK;AAClB,QAAI,kBAAkB,CAAA;AACtB,QAAI,kBAAkB,CAAA;AACtB,QAAI,gBAAgB,CAAA;AACpB,QAAI,gBAAgB,CAAA;AAEpB,SAAK,cAAc,QAAQ,iBAAiB,eAAe,eAAe;AAE1E,SAAK,cAAc,QAAQ,iBAAiB,eAAe,eAAe;AAE1E,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,UAAI,SAAS,cAAc;AAC3B,UAAI,eAAe,gBAAgB;AACnC,UAAI,eAAe,gBAAgB;AACnC,UAAI,kBAAkB,wBAAwB,YAAY;AAC1D,UAAI,kBAAkB,wBAAwB,YAAY;AAE1D,UAAI,kBAAkB,KAAK,oBAAoB,GAAG;AAChD,aAAK,oBAAoB,KAAK,iBAAiB,cAAc,YAAY;AACzE,wBAAgB,UAAU;AAAA,MAC3B,WAAU,oBAAoB,KAAK,kBAAkB,GAAG;AACvD,aAAK,oBAAoB,KAAK,iBAAiB,cAAc,YAAY;AACzE,wBAAgB,UAAU;AAAA,MAC3B,WAAU,oBAAoB,KAAK,oBAAoB,GAAG;AACzD,aAAK,WAAW,KAAK,QAAQ,cAAc,YAAY;AACvD,wBAAgB,UAAU;AAAA,MAC3B,WAAU,kBAAkB,KAAK,kBAAkB,GAAG;AACrD,aAAK,qBAAqB,KAAK,kBAAkB,cAAc,YAAY;AAC3E,wBAAgB,UAAU;AAAA,MAClC,WAAiB,kBAAkB,GAAG;AAC9B,iBAAS,MAAM,GAAG,MAAM,iBAAiB,OAAO;AAC9C,eAAK,WAAW,KAAK,QAAQ,aAAa,IAAI;AAAA,QAC/C;AAAA,MACT,OAAa;AACL,aAAK,WAAW,KAAK,QAAQ,YAAY;AAAA,MAC1C;AAAA,IACF;AAED,SAAK,gBAAgB,eAAe,eAAe;AAAA,EACvD;AAEE,EAAAA,YAAW,UAAU,kBAAkB,SAAU,eAAe,iBAAiB;AAC/E,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,UAAI,SAAS,cAAc;AAC3B,UAAI,eAAe,gBAAgB;AACnC,UAAI,eAAe,wBAAwB,YAAY;AAEvD,UAAI,eAAe,GAAG;AACpB,iBAAS,IAAI,GAAG,IAAI,cAAc,KAAK;AACrC,eAAK,QAAQ,KAAK,KAAK,aAAa,EAAE;AAAA,QACvC;AAAA,MACT,WAAiB,iBAAiB,GAAG;AAC7B,aAAK,QAAQ,KAAK,KAAK,YAAY;AAAA,MACpC;AAGD,sBAAgB,UAAU;AAAA,IAC3B;AAAA,EACL;AAEE,EAAAA,YAAW,UAAU,gBAAgB,SAAU,KAC/C,KAGA,QAAQ,eAAe;AACrB,QAAI,iBAAiB,KAAK;AAE1B,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAEnC,UAAI,MAAM,SAAS,KAAK,eAAe,IAAI,IAAI,CAAC;AAEhD,UAAI,CAAC,gBAAgB;AACnB,eAAO,KAAK;AAAA,MACb;AAED,UAAI,CAAC,KAAK;AACR;AAAA,MACD;AAED,UAAI,YAAY,IAAI;AACpB,UAAI,eAAe,wBAAwB,SAAS;AAEpD,UAAI,iBAAiB,GAAG;AAGtB,YAAI,OAAO;AAEX,YAAI,gBAAgB;AAClB,iBAAO,KAAK,GAAG;AAAA,QAChB;AAAA,MACT,WAAiB,iBAAiB,GAAG;AAC7B,YAAI,OAAO,CAAC,WAAW,CAAC;AAAA,MAChC,OAAa;AACL,kBAAU,KAAK,CAAC;AAAA,MACjB;AAAA,IACF;AAAA,EACL;AAEE,SAAOA;AACT;AAEA,MAAA,eAAe;"}

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

@@ -1,4 +1,4 @@
-import { createHashMap, map, keys, reduce, clone } from "../../../zrender/lib/core/util.js";
+import { createHashMap, assert, isFunction, map, keys, reduce, clone } from "../../../zrender/lib/core/util.js";
 import { parseDataValue } from "./helper/dataValueHelper.js";
 import { shouldRetrieveDataByName } from "./Source.js";
 var UNDEFINED = "undefined";
@@ -50,6 +50,9 @@ var DataStore = function() {
     this._calcDimNameToIdx = createHashMap();
   }
   DataStore2.prototype.initData = function(provider, inputDimensions, dimValueGetter) {
+    if (process.env.NODE_ENV !== "production") {
+      assert(isFunction(provider.getItem) && isFunction(provider.count), "Invalid data provider.");
+    }
     this._provider = provider;
     this._chunks = [];
     this._indices = null;
@@ -58,8 +61,13 @@ var DataStore = function() {
     var defaultGetter = this.defaultDimValueGetter = defaultDimValueGetters[source.sourceFormat];
     this._dimValueGetter = dimValueGetter || defaultGetter;
     this._rawExtent = [];
-    shouldRetrieveDataByName(source);
+    var willRetrieveDataByName = shouldRetrieveDataByName(source);
     this._dimensions = map(inputDimensions, function(dim) {
+      if (process.env.NODE_ENV !== "production") {
+        if (willRetrieveDataByName) {
+          assert(dim.property != null);
+        }
+      }
       return {
         type: dim.type,
         property: dim.property
@@ -123,6 +131,9 @@ var DataStore = function() {
     return item && item.property;
   };
   DataStore2.prototype.appendData = function(data) {
+    if (process.env.NODE_ENV !== "production") {
+      assert(!this._indices, "appendData can only be called on raw data.");
+    }
     var provider = this._provider;
     var start = this.count();
     provider.appendData(data);
@@ -762,5 +773,11 @@ var DataStore = function() {
   }();
   return DataStore2;
 }();
-export { CtorFloat64Array, CtorInt32Array, CtorUint16Array, CtorUint32Array, DataStore as default };
+export {
+  CtorFloat64Array,
+  CtorInt32Array,
+  CtorUint16Array,
+  CtorUint32Array,
+  DataStore as default
+};
 //# sourceMappingURL=DataStore.js.map