@ebiz/designer-components 0.0.18 → 0.0.19-beta.10

package/src/components/charts/framework/charts/ForceDirectedChart/libs/collide.js

@@ -1,151 +1,151 @@
-/**
- * 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 quadtree from "./quadtree.js";
-import constant from "./constant.js";
-import jiggle from "./jiggle.js";
-
-// vx/vy是当前节点的运动速度
-function x(d) {
-  return d.x + d.vx; // 运动一步 x + vx
-}
-
-function y(d) {
-  return d.y + d.vy;
-}
-
-// 防止重叠
-export default function(radius) {
-  let nodes,
-      radii,
-      random,
-      strength = 1, // 力度
-      iterations = 1;
-
-  if (typeof radius !== "function") { // radius不是方法时，转数字常量或默认为1
-    radius = constant(radius == null ? 1 : +radius);
-  }
-
-  function force() {
-  
-    let i, 
-        tree,
-        node,
-        xi,
-        yi,
-        ri, // 半径
-        ri2; // 半径平方
-
-    const n = nodes.length;
-    for (let k = 0; k < iterations; ++k) {
-      // 以x,y访问器构建一个四叉树，即节点运动到下一步位置为坐标
-      // visitAfter是后序遍历树的节点，执行prepare为每个节点求半径r,参数为各个节点，
-      tree = quadtree(nodes, x, y).visitAfter(prepare);
-      for (i = 0; i < n; ++i) {
-        node = nodes[i];
-        ri = radii[node.index];
-        ri2 = ri * ri;
-        xi = node.x + node.vx;
-        yi = node.y + node.vy;
-        // 前序遍历所有节点，apply返回true则不访问其子节点
-        tree.visit(apply);
-      }
-    }
-
-    // 为每个节点求半径r,参数为各个节点，返回true节点不可见
-    function prepare(quad) {
-      // 是否存在叶子节点 
-      if (quad.data) return quad.r = radii[quad.data.index];
-      quad.r = 0;
-      for (let i = 0; i < 4; ++i) {
-        // 取最大r值
-        if (quad[i] && quad[i].r > quad.r) {
-          quad.r = quad[i].r;
-        }
-      }
-    }
-
-    function apply(quad, x0, y0, x1, y1) {
-      let data = quad.data;
-      let rj = quad.r;
-      let r = ri + rj; // 两个点与其作用域构成两个圆
-      if (data) { // 叶子节点
-        if (data.index > node.index) {
-          // 设第一重循环nodes[i]为节点A（xi,yi） 第二重循环为节点B(data.x,data.y)下一步运动(+=vx,+=vy)
-          let x = xi - (data.x + data.vx), // B到A的水平距离
-              y = yi - (data.y + data.vy),
-              l = x * x + y * y;
-          if (l < r * r) { // 发生了碰撞
-            if (x === 0) x = jiggle(random), l += x * x; // 避免x=0
-            if (y === 0) y = jiggle(random), l += y * y; // 避免y=0
-            // 斥力 = 重叠长度/实际距离 * 碰撞力度
-            l = (r - (l = Math.sqrt(l))) / l * strength;
-            // 计算AB节点新的运动速度和方向，AB点往相反方向运动
-            node.vx += (x *= l) * (r = (rj *= rj) / (ri2 + rj));
-            node.vy += (y *= l) * r;
-            data.vx -= x * (r = 1 - r);
-            data.vy -= y * r;
-          }
-        }
-        return;
-      }
-      // 非叶子节点
-      return x0 > xi + r || x1 < xi - r || y0 > yi + r || y1 < yi - r;
-    }
-  }
-
-
-  // 初始化
-  function initialize() {
-    if (!nodes) return;
-    const n = nodes.length;
-    radii = new Array(n);
-    for (let i = 0; i < n; ++i) {
-      let node = nodes[i];
-      radii[node.index] = +radius(node, i, nodes); // 收集所有节点的半径
-    }
-  }
-
-  force.initialize = function(_nodes, _random) {
-    nodes = _nodes;
-    random = _random;
-    initialize();
-  };
-
-  // 设置或读取半径
-  force.radius = function(_) {
-    if(arguments.length) { // set
-      radius = typeof _ === "function" ? _ : constant(+_);
-      initialize();
-      return force;
-    }
-    return radius; // get
-  };
-
-  // 设置或读取迭代次数
-  force.iterations = function(_) {
-    if (arguments.length) { // set
-      iterations = +_;
-      return force;
-    }
-    return iterations; // get
-  };
-
-  force.strength = function(_) {
-    if (arguments.length) { // set
-      strength = +_;
-      return force;
-    }
-    return strength; // get
-  };
-
-  return force;
-}
+/**
+ * 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 quadtree from "./quadtree.js";
+import constant from "./constant.js";
+import jiggle from "./jiggle.js";
+
+// vx/vy是当前节点的运动速度
+function x(d) {
+  return d.x + d.vx; // 运动一步 x + vx
+}
+
+function y(d) {
+  return d.y + d.vy;
+}
+
+// 防止重叠
+export default function(radius) {
+  let nodes,
+      radii,
+      random,
+      strength = 1, // 力度
+      iterations = 1;
+
+  if (typeof radius !== "function") { // radius不是方法时，转数字常量或默认为1
+    radius = constant(radius == null ? 1 : +radius);
+  }
+
+  function force() {
+  
+    let i, 
+        tree,
+        node,
+        xi,
+        yi,
+        ri, // 半径
+        ri2; // 半径平方
+
+    const n = nodes.length;
+    for (let k = 0; k < iterations; ++k) {
+      // 以x,y访问器构建一个四叉树，即节点运动到下一步位置为坐标
+      // visitAfter是后序遍历树的节点，执行prepare为每个节点求半径r,参数为各个节点，
+      tree = quadtree(nodes, x, y).visitAfter(prepare);
+      for (i = 0; i < n; ++i) {
+        node = nodes[i];
+        ri = radii[node.index];
+        ri2 = ri * ri;
+        xi = node.x + node.vx;
+        yi = node.y + node.vy;
+        // 前序遍历所有节点，apply返回true则不访问其子节点
+        tree.visit(apply);
+      }
+    }
+
+    // 为每个节点求半径r,参数为各个节点，返回true节点不可见
+    function prepare(quad) {
+      // 是否存在叶子节点 
+      if (quad.data) return quad.r = radii[quad.data.index];
+      quad.r = 0;
+      for (let i = 0; i < 4; ++i) {
+        // 取最大r值
+        if (quad[i] && quad[i].r > quad.r) {
+          quad.r = quad[i].r;
+        }
+      }
+    }
+
+    function apply(quad, x0, y0, x1, y1) {
+      let data = quad.data;
+      let rj = quad.r;
+      let r = ri + rj; // 两个点与其作用域构成两个圆
+      if (data) { // 叶子节点
+        if (data.index > node.index) {
+          // 设第一重循环nodes[i]为节点A（xi,yi） 第二重循环为节点B(data.x,data.y)下一步运动(+=vx,+=vy)
+          let x = xi - (data.x + data.vx), // B到A的水平距离
+              y = yi - (data.y + data.vy),
+              l = x * x + y * y;
+          if (l < r * r) { // 发生了碰撞
+            if (x === 0) x = jiggle(random), l += x * x; // 避免x=0
+            if (y === 0) y = jiggle(random), l += y * y; // 避免y=0
+            // 斥力 = 重叠长度/实际距离 * 碰撞力度
+            l = (r - (l = Math.sqrt(l))) / l * strength;
+            // 计算AB节点新的运动速度和方向，AB点往相反方向运动
+            node.vx += (x *= l) * (r = (rj *= rj) / (ri2 + rj));
+            node.vy += (y *= l) * r;
+            data.vx -= x * (r = 1 - r);
+            data.vy -= y * r;
+          }
+        }
+        return;
+      }
+      // 非叶子节点
+      return x0 > xi + r || x1 < xi - r || y0 > yi + r || y1 < yi - r;
+    }
+  }
+
+
+  // 初始化
+  function initialize() {
+    if (!nodes) return;
+    const n = nodes.length;
+    radii = new Array(n);
+    for (let i = 0; i < n; ++i) {
+      let node = nodes[i];
+      radii[node.index] = +radius(node, i, nodes); // 收集所有节点的半径
+    }
+  }
+
+  force.initialize = function(_nodes, _random) {
+    nodes = _nodes;
+    random = _random;
+    initialize();
+  };
+
+  // 设置或读取半径
+  force.radius = function(_) {
+    if(arguments.length) { // set
+      radius = typeof _ === "function" ? _ : constant(+_);
+      initialize();
+      return force;
+    }
+    return radius; // get
+  };
+
+  // 设置或读取迭代次数
+  force.iterations = function(_) {
+    if (arguments.length) { // set
+      iterations = +_;
+      return force;
+    }
+    return iterations; // get
+  };
+
+  force.strength = function(_) {
+    if (arguments.length) { // set
+      strength = +_;
+      return force;
+    }
+    return strength; // get
+  };
+
+  return force;
+}

package/src/components/charts/framework/charts/ForceDirectedChart/libs/constant.js

@@ -1,17 +1,17 @@
-/**
- * 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(x) {
-  return function() {
-    return x;
-  };
-}
+/**
+ * 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(x) {
+  return function() {
+    return x;
+  };
+}

package/src/components/charts/framework/charts/ForceDirectedChart/libs/dispatch.js

@@ -1,95 +1,95 @@
-/**
- * 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.
- *
- */
-var noop = {value: () => {}};
-
-function dispatch() {
-  for (var i = 0, n = arguments.length, _ = {}, t; i < n; ++i) {
-    if (!(t = arguments[i] + "") || (t in _) || /[\s.]/.test(t)) throw new Error("illegal type: " + t);
-    _[t] = [];
-  }
-  return new Dispatch(_);
-}
-
-function Dispatch(_) {
-  this._ = _;
-}
-
-function parseTypenames(typenames, types) {
-  return typenames.trim().split(/^|\s+/).map(function(t) {
-    var name = "", i = t.indexOf(".");
-    if (i >= 0) name = t.slice(i + 1), t = t.slice(0, i);
-    if (t && !types.hasOwnProperty(t)) throw new Error("unknown type: " + t);
-    return {type: t, name: name};
-  });
-}
-
-Dispatch.prototype = dispatch.prototype = {
-  constructor: Dispatch,
-  on: function(typename, callback) {
-    var _ = this._,
-        T = parseTypenames(typename + "", _),
-        t,
-        i = -1,
-        n = T.length;
-
-    // If no callback was specified, return the callback of the given type and name.
-    if (arguments.length < 2) {
-      while (++i < n) if ((t = (typename = T[i]).type) && (t = get(_[t], typename.name))) return t;
-      return;
-    }
-
-    // If a type was specified, set the callback for the given type and name.
-    // Otherwise, if a null callback was specified, remove callbacks of the given name.
-    if (callback != null && typeof callback !== "function") throw new Error("invalid callback: " + callback);
-    while (++i < n) {
-      if (t = (typename = T[i]).type) _[t] = set(_[t], typename.name, callback);
-      else if (callback == null) for (t in _) _[t] = set(_[t], typename.name, null);
-    }
-
-    return this;
-  },
-  copy: function() {
-    var copy = {}, _ = this._;
-    for (var t in _) copy[t] = _[t].slice();
-    return new Dispatch(copy);
-  },
-  call: function(type, that) {
-    if ((n = arguments.length - 2) > 0) for (var args = new Array(n), i = 0, n, t; i < n; ++i) args[i] = arguments[i + 2];
-    if (!this._.hasOwnProperty(type)) throw new Error("unknown type: " + type);
-    for (t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);
-  },
-  apply: function(type, that, args) {
-    if (!this._.hasOwnProperty(type)) throw new Error("unknown type: " + type);
-    for (var t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);
-  }
-};
-
-function get(type, name) {
-  for (var i = 0, n = type.length, c; i < n; ++i) {
-    if ((c = type[i]).name === name) {
-      return c.value;
-    }
-  }
-}
-
-function set(type, name, callback) {
-  for (var i = 0, n = type.length; i < n; ++i) {
-    if (type[i].name === name) {
-      type[i] = noop, type = type.slice(0, i).concat(type.slice(i + 1));
-      break;
-    }
-  }
-  if (callback != null) type.push({name: name, value: callback});
-  return type;
-}
-
-export default dispatch;
+/**
+ * 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.
+ *
+ */
+var noop = {value: () => {}};
+
+function dispatch() {
+  for (var i = 0, n = arguments.length, _ = {}, t; i < n; ++i) {
+    if (!(t = arguments[i] + "") || (t in _) || /[\s.]/.test(t)) throw new Error("illegal type: " + t);
+    _[t] = [];
+  }
+  return new Dispatch(_);
+}
+
+function Dispatch(_) {
+  this._ = _;
+}
+
+function parseTypenames(typenames, types) {
+  return typenames.trim().split(/^|\s+/).map(function(t) {
+    var name = "", i = t.indexOf(".");
+    if (i >= 0) name = t.slice(i + 1), t = t.slice(0, i);
+    if (t && !types.hasOwnProperty(t)) throw new Error("unknown type: " + t);
+    return {type: t, name: name};
+  });
+}
+
+Dispatch.prototype = dispatch.prototype = {
+  constructor: Dispatch,
+  on: function(typename, callback) {
+    var _ = this._,
+        T = parseTypenames(typename + "", _),
+        t,
+        i = -1,
+        n = T.length;
+
+    // If no callback was specified, return the callback of the given type and name.
+    if (arguments.length < 2) {
+      while (++i < n) if ((t = (typename = T[i]).type) && (t = get(_[t], typename.name))) return t;
+      return;
+    }
+
+    // If a type was specified, set the callback for the given type and name.
+    // Otherwise, if a null callback was specified, remove callbacks of the given name.
+    if (callback != null && typeof callback !== "function") throw new Error("invalid callback: " + callback);
+    while (++i < n) {
+      if (t = (typename = T[i]).type) _[t] = set(_[t], typename.name, callback);
+      else if (callback == null) for (t in _) _[t] = set(_[t], typename.name, null);
+    }
+
+    return this;
+  },
+  copy: function() {
+    var copy = {}, _ = this._;
+    for (var t in _) copy[t] = _[t].slice();
+    return new Dispatch(copy);
+  },
+  call: function(type, that) {
+    if ((n = arguments.length - 2) > 0) for (var args = new Array(n), i = 0, n, t; i < n; ++i) args[i] = arguments[i + 2];
+    if (!this._.hasOwnProperty(type)) throw new Error("unknown type: " + type);
+    for (t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);
+  },
+  apply: function(type, that, args) {
+    if (!this._.hasOwnProperty(type)) throw new Error("unknown type: " + type);
+    for (var t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);
+  }
+};
+
+function get(type, name) {
+  for (var i = 0, n = type.length, c; i < n; ++i) {
+    if ((c = type[i]).name === name) {
+      return c.value;
+    }
+  }
+}
+
+function set(type, name, callback) {
+  for (var i = 0, n = type.length; i < n; ++i) {
+    if (type[i].name === name) {
+      type[i] = noop, type = type.slice(0, i).concat(type.slice(i + 1));
+      break;
+    }
+  }
+  if (callback != null) type.push({name: name, value: callback});
+  return type;
+}
+
+export default dispatch;

package/src/components/charts/framework/charts/ForceDirectedChart/libs/index.js

@@ -1,19 +1,19 @@
-/**
- * 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 as forceCenter} from "./center.js";
-export {default as forceCollide} from "./collide.js";
-export {default as forceLink} from "./link.js";
-export {default as forceManyBody} from "./manyBody.js";
-export {default as forceRadial} from "./radial.js";
-export {default as forceSimulation} from "./simulation.js";
-export {default as forceX} from "./x.js";
-export {default as forceY} from "./y.js";
+/**
+ * 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 as forceCenter} from "./center.js";
+export {default as forceCollide} from "./collide.js";
+export {default as forceLink} from "./link.js";
+export {default as forceManyBody} from "./manyBody.js";
+export {default as forceRadial} from "./radial.js";
+export {default as forceSimulation} from "./simulation.js";
+export {default as forceX} from "./x.js";
+export {default as forceY} from "./y.js";

package/src/components/charts/framework/charts/ForceDirectedChart/libs/jiggle.js

@@ -1,16 +1,16 @@
-/**
- * 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(random) {
-  return (random() - 0.5) * 1e-6;
-}
+/**
+ * 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(random) {
+  return (random() - 0.5) * 1e-6;
+}

package/src/components/charts/framework/charts/ForceDirectedChart/libs/lcg.js

@@ -1,23 +1,23 @@
-/**
- * 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.
- *
- */
-// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use
-
-// 线性同余方法(LCG) 产生伪随机数的方法
-const a = 1664525; // 乘数（移位）
-const c = 1013904223; // 加数（偏移）
-const m = 4294967296; // 2^32  模数（取模）
-
-// (a * s + c) % m 每下一个随机数是当前随机数向左移动 log2 a 位，加上一个 c，最后对 m 取余，使随机数限制在 0 ~ m-1 内
-export default function() {
-  let s = 1; // 当前随机数
-  return () => (s = (a * s + c) % m) / m;
-}
+/**
+ * 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.
+ *
+ */
+// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use
+
+// 线性同余方法(LCG) 产生伪随机数的方法
+const a = 1664525; // 乘数（移位）
+const c = 1013904223; // 加数（偏移）
+const m = 4294967296; // 2^32  模数（取模）
+
+// (a * s + c) % m 每下一个随机数是当前随机数向左移动 log2 a 位，加上一个 c，最后对 m 取余，使随机数限制在 0 ~ m-1 内
+export default function() {
+  let s = 1; // 当前随机数
+  return () => (s = (a * s + c) % m) / m;
+}