@ebiz/designer-components 0.0.18-beta.30 → 0.0.18-beta.32

package/src/components/charts/util/dom.js

@@ -1,90 +1,90 @@
-/**
- * Copyright (c) 2024 - present OpenTiny HUICharts Authors.
- * Copyright (c) 2024 - present Huawei Cloud Computing Technologies Co., Ltd.
- *
- * Use of this source code is governed by an MIT-style license.
- *
- * THE OPEN SOURCE SOFTWARE IN THIS PRODUCT IS DISTRIBUTED IN THE HOPE THAT IT WILL BE USEFUL,
- * BUT WITHOUT ANY WARRANTY, WITHOUT EVEN THE IMPLIED WARRANTY OF MERCHANTABILITY OR FITNESS FOR
- * A PARTICULAR PURPOSE. SEE THE APPLICABLE LICENSES FOR MORE DETAILS.
- *
- */
-import { isArray } from './type';
-
-// 插入HTML元素
-const appendHTML = (dom, child) => {
-    dom.insertAdjacentHTML('beforeend', child);
-};
-
-// 插入dom元素
-const appendDom = (dom, child) => {
-    dom.insertAdjacentElement('beforeend', child);
-};
-
-// 创建元素
-const createDom = (name) => {
-    return document.createElementNS('http://www.w3.org/2000/svg', name);
-};
-
-// 元素绑定样式
-const setStyle = (dom, option) => {
-    for (let i in option) {
-        if (Object.hasOwnProperty.call(option, i)) {
-            dom.setAttribute(i, option[i]);
-        }
-    }
-};
-
-//给指定dom添加class类名，classList为数组类型
-function addClass(dom, classes) {
-    if (isArray(classes)) {
-        classes.forEach(cls => {
-            dom.classList.add(cls);
-        });
-    } else {
-        dom.classList.add(classes);
-    }
-}
-
-//给指定dom添加或更改属性
-function attr(dom, key, value) {
-    dom.setAttribute(key, value);
-}
-
-// 判断父元素是否为指定的 class
-const isParent = (targetElement, parentClass) => {
-    if (targetElement === document.body) {
-        return false;
-    } else if (targetElement.parentNode.classList.contains(parentClass)) {
-        return targetElement.parentNode;
-    } else {
-        return isParent(targetElement.parentNode, parentClass);
-    }
-}
-
-
-// 计算一段字符的像素长度
-const getTextWidth = (text, fontSize = 12) => {
-    let result = 0;
-    const ele = document.createElement('span');
-    // 字符串中带有换行符时，会被自动转换成<br/>标签，若需要考虑这种情况，可以替换成空格，以获取正确的宽度
-    ele.innerText = text;
-    // 不同的大小和不同的字体都会导致渲染出来的字符串宽度变化，可以传入尽可能完备的样式信息
-    ele.setAttribute('style', `font-size: ${fontSize}px`);
-    document.documentElement.append(ele);
-    result = ele.offsetWidth;
-    document.documentElement.removeChild(ele);
-    return result;
-}
-
-
-export {
-    appendHTML,
-    appendDom,
-    createDom,
-    addClass,
-    attr,
-    setStyle,
-    isParent,
-    getTextWidth
+/**
+ * Copyright (c) 2024 - present OpenTiny HUICharts Authors.
+ * Copyright (c) 2024 - present Huawei Cloud Computing Technologies Co., Ltd.
+ *
+ * Use of this source code is governed by an MIT-style license.
+ *
+ * THE OPEN SOURCE SOFTWARE IN THIS PRODUCT IS DISTRIBUTED IN THE HOPE THAT IT WILL BE USEFUL,
+ * BUT WITHOUT ANY WARRANTY, WITHOUT EVEN THE IMPLIED WARRANTY OF MERCHANTABILITY OR FITNESS FOR
+ * A PARTICULAR PURPOSE. SEE THE APPLICABLE LICENSES FOR MORE DETAILS.
+ *
+ */
+import { isArray } from './type';
+
+// 插入HTML元素
+const appendHTML = (dom, child) => {
+    dom.insertAdjacentHTML('beforeend', child);
+};
+
+// 插入dom元素
+const appendDom = (dom, child) => {
+    dom.insertAdjacentElement('beforeend', child);
+};
+
+// 创建元素
+const createDom = (name) => {
+    return document.createElementNS('http://www.w3.org/2000/svg', name);
+};
+
+// 元素绑定样式
+const setStyle = (dom, option) => {
+    for (let i in option) {
+        if (Object.hasOwnProperty.call(option, i)) {
+            dom.setAttribute(i, option[i]);
+        }
+    }
+};
+
+//给指定dom添加class类名，classList为数组类型
+function addClass(dom, classes) {
+    if (isArray(classes)) {
+        classes.forEach(cls => {
+            dom.classList.add(cls);
+        });
+    } else {
+        dom.classList.add(classes);
+    }
+}
+
+//给指定dom添加或更改属性
+function attr(dom, key, value) {
+    dom.setAttribute(key, value);
+}
+
+// 判断父元素是否为指定的 class
+const isParent = (targetElement, parentClass) => {
+    if (targetElement === document.body) {
+        return false;
+    } else if (targetElement.parentNode.classList.contains(parentClass)) {
+        return targetElement.parentNode;
+    } else {
+        return isParent(targetElement.parentNode, parentClass);
+    }
+}
+
+
+// 计算一段字符的像素长度
+const getTextWidth = (text, fontSize = 12) => {
+    let result = 0;
+    const ele = document.createElement('span');
+    // 字符串中带有换行符时，会被自动转换成<br/>标签，若需要考虑这种情况，可以替换成空格，以获取正确的宽度
+    ele.innerText = text;
+    // 不同的大小和不同的字体都会导致渲染出来的字符串宽度变化，可以传入尽可能完备的样式信息
+    ele.setAttribute('style', `font-size: ${fontSize}px`);
+    document.documentElement.append(ele);
+    result = ele.offsetWidth;
+    document.documentElement.removeChild(ele);
+    return result;
+}
+
+
+export {
+    appendHTML,
+    appendDom,
+    createDom,
+    addClass,
+    attr,
+    setStyle,
+    isParent,
+    getTextWidth
 }

package/src/components/charts/util/equal.js

@@ -1,62 +1,62 @@
-/**
- * Copyright (c) 2024 - present OpenTiny HUICharts Authors.
- * Copyright (c) 2024 - present Huawei Cloud Computing Technologies Co., Ltd.
- *
- * Use of this source code is governed by an MIT-style license.
- *
- * THE OPEN SOURCE SOFTWARE IN THIS PRODUCT IS DISTRIBUTED IN THE HOPE THAT IT WILL BE USEFUL,
- * BUT WITHOUT ANY WARRANTY, WITHOUT EVEN THE IMPLIED WARRANTY OF MERCHANTABILITY OR FITNESS FOR
- * A PARTICULAR PURPOSE. SEE THE APPLICABLE LICENSES FOR MORE DETAILS.
- *
- */
-import { isObject, isArray } from './type';
-import { getItemCount } from './math';
-
-/**
- * 深比较两个对象
- * 如果对比的是两个数组，值一致，顺序改变，如[1,2]和[2,1]，算不等
- * 如果对比的是两个对象，值一致，顺序改变。如{a:1,b:2}和{b:2,a:1},算相等
- */
-export function isObjEqual(obj1, obj2) {
-  if (!isObject(obj1) || !isObject(obj2)) {
-    return obj1 === obj2;
-  }
-  if (obj1 === obj2) {
-    return true;
-  }
-  const obj1Keys = Object.keys(obj1);
-  const obj2Keys = Object.keys(obj2);
-  if (obj1Keys.length !== obj2Keys.length) {
-    return false;
-  }
-  for (let key in obj1) {
-    if (Object.hasOwnProperty.call(obj1, key)) {
-      const res = isObjEqual(obj1[key], obj2[key]);
-      if (!res) {
-        return false;
-      }
-    }
-  }
-  return true;
-}
-
-
-/**
- * 对比两个简单类型数组的值和长度是否完全一样（值的顺序允许改变）
- * 值一致，顺序不一致，如[1,2]和[2,1],算相等
- */
-export function isArrayEqual(arr1, arr2) {
-  if (!isArray(arr1) || !isArray(arr2)) {
-    return false;
-  }
-  if (arr1.length !== arr2.length) {
-    return false;
-  }
-  for (let key of arr1) {
-    if (getItemCount(arr1, key) !== getItemCount(arr2, key)) {
-      return false;
-    }
-  }
-  return true;
-}
-
+/**
+ * Copyright (c) 2024 - present OpenTiny HUICharts Authors.
+ * Copyright (c) 2024 - present Huawei Cloud Computing Technologies Co., Ltd.
+ *
+ * Use of this source code is governed by an MIT-style license.
+ *
+ * THE OPEN SOURCE SOFTWARE IN THIS PRODUCT IS DISTRIBUTED IN THE HOPE THAT IT WILL BE USEFUL,
+ * BUT WITHOUT ANY WARRANTY, WITHOUT EVEN THE IMPLIED WARRANTY OF MERCHANTABILITY OR FITNESS FOR
+ * A PARTICULAR PURPOSE. SEE THE APPLICABLE LICENSES FOR MORE DETAILS.
+ *
+ */
+import { isObject, isArray } from './type';
+import { getItemCount } from './math';
+
+/**
+ * 深比较两个对象
+ * 如果对比的是两个数组，值一致，顺序改变，如[1,2]和[2,1]，算不等
+ * 如果对比的是两个对象，值一致，顺序改变。如{a:1,b:2}和{b:2,a:1},算相等
+ */
+export function isObjEqual(obj1, obj2) {
+  if (!isObject(obj1) || !isObject(obj2)) {
+    return obj1 === obj2;
+  }
+  if (obj1 === obj2) {
+    return true;
+  }
+  const obj1Keys = Object.keys(obj1);
+  const obj2Keys = Object.keys(obj2);
+  if (obj1Keys.length !== obj2Keys.length) {
+    return false;
+  }
+  for (let key in obj1) {
+    if (Object.hasOwnProperty.call(obj1, key)) {
+      const res = isObjEqual(obj1[key], obj2[key]);
+      if (!res) {
+        return false;
+      }
+    }
+  }
+  return true;
+}
+
+
+/**
+ * 对比两个简单类型数组的值和长度是否完全一样（值的顺序允许改变）
+ * 值一致，顺序不一致，如[1,2]和[2,1],算相等
+ */
+export function isArrayEqual(arr1, arr2) {
+  if (!isArray(arr1) || !isArray(arr2)) {
+    return false;
+  }
+  if (arr1.length !== arr2.length) {
+    return false;
+  }
+  for (let key of arr1) {
+    if (getItemCount(arr1, key) !== getItemCount(arr2, key)) {
+      return false;
+    }
+  }
+  return true;
+}
+

package/src/components/charts/util/event.js

@@ -1,25 +1,25 @@
-/**
- * Copyright (c) 2024 - present OpenTiny HUICharts Authors.
- * Copyright (c) 2024 - present Huawei Cloud Computing Technologies Co., Ltd.
- *
- * Use of this source code is governed by an MIT-style license.
- *
- * THE OPEN SOURCE SOFTWARE IN THIS PRODUCT IS DISTRIBUTED IN THE HOPE THAT IT WILL BE USEFUL,
- * BUT WITHOUT ANY WARRANTY, WITHOUT EVEN THE IMPLIED WARRANTY OF MERCHANTABILITY OR FITNESS FOR
- * A PARTICULAR PURPOSE. SEE THE APPLICABLE LICENSES FOR MORE DETAILS.
- *
- */
-// 绑定图表事件
-export function event(chartInstance, event) {
-  if (!event) return;
-  const queryKeys = Object.keys(event);
-  queryKeys.forEach(qrKey => {
-    const eKeys = Object.keys(event[qrKey]);
-    eKeys.forEach(key => {
-      chartInstance.off(key);
-      chartInstance.on(key, qrKey, function (params) {
-        event[qrKey][key](params);
-      });
-    });
-  });
-}
+/**
+ * Copyright (c) 2024 - present OpenTiny HUICharts Authors.
+ * Copyright (c) 2024 - present Huawei Cloud Computing Technologies Co., Ltd.
+ *
+ * Use of this source code is governed by an MIT-style license.
+ *
+ * THE OPEN SOURCE SOFTWARE IN THIS PRODUCT IS DISTRIBUTED IN THE HOPE THAT IT WILL BE USEFUL,
+ * BUT WITHOUT ANY WARRANTY, WITHOUT EVEN THE IMPLIED WARRANTY OF MERCHANTABILITY OR FITNESS FOR
+ * A PARTICULAR PURPOSE. SEE THE APPLICABLE LICENSES FOR MORE DETAILS.
+ *
+ */
+// 绑定图表事件
+export function event(chartInstance, event) {
+  if (!event) return;
+  const queryKeys = Object.keys(event);
+  queryKeys.forEach(qrKey => {
+    const eKeys = Object.keys(event[qrKey]);
+    eKeys.forEach(key => {
+      chartInstance.off(key);
+      chartInstance.on(key, qrKey, function (params) {
+        event[qrKey][key](params);
+      });
+    });
+  });
+}

package/src/components/charts/util/hashMap.js

@@ -1,111 +1,111 @@
-/**
- * Copyright (c) 2024 - present OpenTiny HUICharts Authors.
- * Copyright (c) 2024 - present Huawei Cloud Computing Technologies Co., Ltd.
- *
- * Use of this source code is governed by an MIT-style license.
- *
- * THE OPEN SOURCE SOFTWARE IN THIS PRODUCT IS DISTRIBUTED IN THE HOPE THAT IT WILL BE USEFUL,
- * BUT WITHOUT ANY WARRANTY, WITHOUT EVEN THE IMPLIED WARRANTY OF MERCHANTABILITY OR FITNESS FOR
- * A PARTICULAR PURPOSE. SEE THE APPLICABLE LICENSES FOR MORE DETAILS.
- *
- */
-class HashMap {
-  data;
-
-  constructor(initObj) {
-    this.data = newMap();
-    for (const key in initObj) {
-        if (Object.hasOwnProperty.call(initObj, key)) {
-            this.set(key, initObj[key])
-        }
-    }
-  }
-
-  hasKey(key) {
-    return this.data.has(key);
-  }
-
-  get(key) {
-    return this.data.get(key);
-  }
-
-  set(key, value) {
-    this.data.set(key, value);
-    return value;
-  }
-
-  each(callback, context) {
-    this.data.forEach((value, key) => {
-      callback.call(context, value, key);
-    });
-  }
-
-  keys() {
-    const keys = this.data.keys();
-    return typeof Map === 'function' ? Array.from(keys) : keys;
-  }
-
-  removeKey(key) {
-    this.data.delete(key);
-  }
-}
-
-function newMap() {
-  return typeof Map === 'function' ? new Map() : new MapPolyfill();
-}
-
-class MapPolyfill {
-  data;
-
-  delete(key) {
-    const existed = this.has(key);
-    if (existed) {
-      delete this.data[key];
-    }
-    return existed;
-  }
-
-  has(key) {
-    return Object.hasOwnProperty.call(this.data, key);
-  }
-
-  get(key) {
-    return this.data[key];
-  }
-
-  set(key, value) {
-    this.data[key] = value;
-    return this;
-  }
-
-  keys() {
-    return keys(this.data);
-  }
-
-  forEach(callback) {
-    const data = this.data;
-    for (const key in data) {
-      if (Object.hasOwnProperty.call(data, key)) {
-        callback(data[key], key);
-      }
-    }
-  }
-}
-
-function keys(obj) {
-  if (!obj) {
-    return [];
-  }
-  if (Object.keys) {
-    return Object.keys(obj);
-  }
-  let keyList = [];
-  for (let key in obj) {
-    if (Object.hasOwnProperty.call(obj, key)) {
-      keyList.push(key);
-    }
-  }
-  return keyList;
-}
-
-export default HashMap;
+/**
+ * Copyright (c) 2024 - present OpenTiny HUICharts Authors.
+ * Copyright (c) 2024 - present Huawei Cloud Computing Technologies Co., Ltd.
+ *
+ * Use of this source code is governed by an MIT-style license.
+ *
+ * THE OPEN SOURCE SOFTWARE IN THIS PRODUCT IS DISTRIBUTED IN THE HOPE THAT IT WILL BE USEFUL,
+ * BUT WITHOUT ANY WARRANTY, WITHOUT EVEN THE IMPLIED WARRANTY OF MERCHANTABILITY OR FITNESS FOR
+ * A PARTICULAR PURPOSE. SEE THE APPLICABLE LICENSES FOR MORE DETAILS.
+ *
+ */
+class HashMap {
+  data;
+
+  constructor(initObj) {
+    this.data = newMap();
+    for (const key in initObj) {
+        if (Object.hasOwnProperty.call(initObj, key)) {
+            this.set(key, initObj[key])
+        }
+    }
+  }
+
+  hasKey(key) {
+    return this.data.has(key);
+  }
+
+  get(key) {
+    return this.data.get(key);
+  }
+
+  set(key, value) {
+    this.data.set(key, value);
+    return value;
+  }
+
+  each(callback, context) {
+    this.data.forEach((value, key) => {
+      callback.call(context, value, key);
+    });
+  }
+
+  keys() {
+    const keys = this.data.keys();
+    return typeof Map === 'function' ? Array.from(keys) : keys;
+  }
+
+  removeKey(key) {
+    this.data.delete(key);
+  }
+}
+
+function newMap() {
+  return typeof Map === 'function' ? new Map() : new MapPolyfill();
+}
+
+class MapPolyfill {
+  data;
+
+  delete(key) {
+    const existed = this.has(key);
+    if (existed) {
+      delete this.data[key];
+    }
+    return existed;
+  }
+
+  has(key) {
+    return Object.hasOwnProperty.call(this.data, key);
+  }
+
+  get(key) {
+    return this.data[key];
+  }
+
+  set(key, value) {
+    this.data[key] = value;
+    return this;
+  }
+
+  keys() {
+    return keys(this.data);
+  }
+
+  forEach(callback) {
+    const data = this.data;
+    for (const key in data) {
+      if (Object.hasOwnProperty.call(data, key)) {
+        callback(data[key], key);
+      }
+    }
+  }
+}
+
+function keys(obj) {
+  if (!obj) {
+    return [];
+  }
+  if (Object.keys) {
+    return Object.keys(obj);
+  }
+  let keyList = [];
+  for (let key in obj) {
+    if (Object.hasOwnProperty.call(obj, key)) {
+      keyList.push(key);
+    }
+  }
+  return keyList;
+}
+
+export default HashMap;