@ebiz/designer-components 0.0.47 → 0.0.49

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

@@ -1,78 +0,0 @@
-/**
- * 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';
-
-// 将 task 中所有属性合并到 target
-function merge(target, task) {
-    if (target === undefined) {
-        target = task;
-        return target;
-    }
-    if (isObject(task)) {
-        for (const key in task) {
-            if (target[key] === undefined || target[key] === null) {
-                target[key] = task[key];
-            } else if (isObject(task[key]) && !isArray(task[key])) {
-                merge(target[key], task[key]);
-            } else {
-                target[key] = task[key];
-            }
-        }
-    }
-    return target;
-}
-
-// 覆盖Series
-function mergeSeries(iChartOption, baseOption) {
-    const userSeries = iChartOption.series;
-    const baseSeries = baseOption.series;
-    userSeries && userSeries.forEach(uitem => {
-        let isNewSeries = true;
-        baseSeries.forEach(bitem => {
-            if (bitem.name === uitem.name) {
-                isNewSeries = false;
-                merge(bitem, uitem);
-            }
-        });
-        if (isNewSeries) {
-            baseSeries.push(uitem);
-        }
-    });
-}
-
-// 覆盖VisualMap，采用直接替换的形式
-function mergeVisualMap(iChartOption, baseOption) {
-    let userVisualMap = iChartOption.visualMap;
-    if (userVisualMap) {
-        baseOption.visualMap = userVisualMap;
-    }
-}
-
-// extend属性，采用直接替换的形式
-function mergeExtend(iChartOption, baseOption) {
-    if (!iChartOption) return;
-    let extend = iChartOption.extend;
-    if (!extend) return;
-    for (const key in extend) {
-        if (Object.hasOwnProperty.call(extend, key)) {
-            baseOption[key] = extend[key];
-        }
-    }
-}
-
-export {
-    mergeSeries,
-    mergeExtend,
-    mergeVisualMap
-}
-
-export default merge;

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

@@ -1,98 +0,0 @@
-/**
- * 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.
- *
- */
-// 对canvas的画笔的简单封装
-export default class Paint {
-  ctx = null;
-  constructor(ctx) {
-    this.ctx = ctx;
-  }
-
-  beginPath() {
-    this.ctx.beginPath();
-  }
-
-  closePath() {
-    this.ctx.closePath();
-  }
-
-  moveTo(x, y) {
-    this.ctx.moveTo(x, y);
-  }
-
-  lineTo(x, y) {
-    this.ctx.lineTo(x, y);
-  }
-
-  lineCap(type) {
-    this.ctx.lineCap = type;
-  }
-
-  stroke() {
-    this.ctx.stroke();
-  }
-
-  lineJoin(type) {
-    this.ctx.lineJoin = type;
-  }
-
-  lineWidth(nub) {
-    this.ctx.lineWidth = nub;
-  }
-
-  fill() {
-    this.ctx.fill();
-  }
-
-  save() {
-    this.ctx.save();
-  }
-
-  restore() {
-    this.ctx.restore();
-  }
-
-  translate(x, y) {
-    this.ctx.translate(x, y);
-  }
-
-  createLinearGradient(x0, y0, x1, y1) {
-    return this.ctx.createLinearGradient(x0, y0, x1, y1);
-  }
-
-  clearRect(x, y, width, height) {
-    this.ctx.clearRect(x, y, width, height);
-  }
-
-  rect(x, y, width, height) {
-    this.ctx.rect(x, y, width, height);
-  }
-
-  strokeStyle(color) {
-    this.ctx.strokeStyle = color;
-  }
-
-  arc(x, y, radius, startAngle, endAngle, anticlockwise = false) {
-    this.ctx.arc(x, y, radius, startAngle, endAngle, anticlockwise);
-  }
-
-  fillStyle(color) {
-    this.ctx.fillStyle = color;
-  }
-
-  clip() {
-    this.ctx.clip();
-  }
-
-  createRadialGradient(x0, y0, r0, x1, y1, r1) {
-    return this.ctx.createRadialGradient(x0, y0, r0, x1, y1, r1);
-  }
-}

package/src/components/charts/util/sort/max.js

@@ -1,64 +0,0 @@
-/**
- * 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 default function max(arr) {
-  function handle(arr) {
-    return arr.filter(item => {
-      return Object.prototype.toString.call(item) === '[object Number]';
-    });
-  }
-
-  function heapAjust(data, i, length) {
-    let child = 2 * i + 1;
-    while (child <= length) {
-      const temp = data[i];
-      if (child + 1 <= length && data[child] < data[child + 1]) {
-        child = child + 1;
-      }
-      if (data[i] < data[child]) {
-        data[i] = data[child];
-        data[child] = temp;
-        i = child;
-        child = 2 * i + 1;
-      } else {
-        break;
-      }
-    }
-  }
-
-  function buildHeap(data) {
-    for (let i = Math.floor(data.length / 2); i >= 0; i--) {
-      heapAjust(data, i, data.length);
-    }
-  }
-
-  function swap(arr, i, j) {
-    const temp = arr[i];
-    arr[i] = arr[j];
-    arr[j] = temp;
-  }
-
-  function heapSort(arr) {
-    const data = handle(arr).slice(0);
-    if (!(data instanceof Array)) return;
-    if (data instanceof Array && data.length === 1) {
-      return data;
-    }
-    buildHeap(data);
-    for (let i = data.length - 1; i >= 0; i--) {
-      swap(data, i, 0);
-      heapAjust(data, 0, i - 1);
-    }
-    return data[data.length - 1];
-  }
-
-  return heapSort(arr);
-}

package/src/components/charts/util/sort/min.js

@@ -1,64 +0,0 @@
-/**
- * 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 default function min(arrMin) {
-  function handleMin(arrMin) {
-    return arrMin.filter(item => {
-      return Object.prototype.toString.call(item) === '[object Number]';
-    });
-  }
-
-  function heapJustMin(dataMin, iMin, length) {
-    let childMin = 2 * iMin + 1;
-    while (childMin <= length) {
-      const temp = dataMin[iMin];
-      if (childMin + 1 <= length && dataMin[childMin] < dataMin[childMin + 1]) {
-        childMin = childMin + 1;
-      }
-      if (dataMin[iMin] < dataMin[childMin]) {
-        dataMin[iMin] = dataMin[childMin];
-        dataMin[childMin] = temp;
-        iMin = childMin;
-        childMin = 2 * iMin + 1;
-      } else {
-        break;
-      }
-    }
-  }
-
-  function buildHeapMin(dataMin) {
-    for (let iMin = Math.floor(dataMin.length / 2); iMin >= 0; iMin--) {
-      heapJustMin(dataMin, iMin, dataMin.length);
-    }
-  }
-
-  function swap(arrMin, iMin, jMin) {
-    const temp = arrMin[iMin];
-    arrMin[iMin] = arrMin[jMin];
-    arrMin[jMin] = temp;
-  }
-
-  function heapSort(arrMin) {
-    const dataMin = handleMin(arrMin).slice(0);
-    if (!(dataMin instanceof Array)) return;
-    if (dataMin instanceof Array && dataMin.length === 1) {
-      return dataMin;
-    }
-    buildHeapMin(dataMin);
-    for (let iMin = dataMin.length - 1; iMin >= 0; iMin--) {
-      swap(dataMin, iMin, 0);
-      heapJustMin(dataMin, 0, iMin - 1);
-    }
-    return dataMin[0];
-  }
-
-  return heapSort(arrMin);
-}

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

@@ -1,34 +0,0 @@
-/**
- * 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.
- *
- */
-function throttle(delay, callback) {
-  let timeoutID;
-  let lastExec = 0;
-  function clearExistingTimeout() {
-    timeoutID && clearTimeout(timeoutID);
-  }
-  return function wrapper(...arguments_) {
-    const __self = this;
-    const elapsed = Date.now() - lastExec;
-    function exec() {
-      lastExec = Date.now();
-      callback.apply(__self, arguments_);
-    }
-    clearExistingTimeout();
-    if (elapsed > delay) {
-      exec();
-    } else {
-      timeoutID = setTimeout(exec, delay - elapsed);
-    }
-  }
-}
-
-export default throttle;

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

@@ -1,25 +0,0 @@
-/**
- * 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.
- *
- */
-const packageName = 'HUI-Charts'
-
-function warn(tip){
-    console.warn(`[${packageName}] Warning: ${tip}`)
-}
-
-function error(tip){
-    console.error(`[${packageName}] Error: ${tip}`)
-}
-
-export default {
-    warn,
-    error,
-}

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

@@ -1,46 +0,0 @@
-/**
- * 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 isArray(value) {
-    return Object.prototype.toString.call(value) === '[object Array]' ? true : false;
-}
-
-export const isObject = value => value !== null && typeof value === 'object';
-
-export const isFunction = value => typeof value === 'function';
-
-export const isString = value => typeof value === 'string';
-
-export const isBoolean = value => typeof value === 'boolean';
-
-export const isNumber = value => typeof value === 'number';
-
-export const isUndef = value => typeof value === 'undefined';
-
-export const isDOM = typeof HTMLElement === 'object'
-    ? function (dom) { return dom instanceof HTMLElement; }
-    : function (dom) { return dom && typeof dom === 'object' && dom.nodeType === 1 && typeof dom.nodeName === 'string'; };
-
-export const toArray = value => {
-    if (!isArray(value)) {
-        return [value];
-    } else {
-        return value;
-    }
-}
-
-/**
- * 
- * 返回对相应的数据类型
- */
-export const getType = data => {
-    return Object.prototype.toString.call(data).substring(8).split(/]/)[0]
-}