jc-structure 0.2.14 → 0.2.16

package/dist/jc-structure.js

@@ -1,4 +1,4 @@
-class V {
+class X {
   items = [];
   head = 0;
   tail = 0;
@@ -28,7 +28,7 @@ class V {
     return this.isEmpty() ? "Queue: (0) []" : `Queue: (${this.size()}) [${this.front()} ...]`;
   }
 }
-class _ {
+class Q {
   items = {};
   count = 0;
   lowestCount = 0;
@@ -108,7 +108,7 @@ class O {
     return this._arr[this._arr.length - 1];
   }
 }
-class G {
+class j {
   items = {};
   count = 0;
   constructor() {
@@ -159,7 +159,7 @@ class G {
     return this.isEmpty() ? "Stack: (0) []" : `Stack: (${this.size()}) [ ${this.peek()} ...]`;
   }
 }
-class B {
+class W {
   stack = [];
   minStack = [];
   push(t) {
@@ -188,13 +188,13 @@ class B {
     return this.isEmpty() ? "Stack: (0) []" : `Stack: (${this.size()}) [ ${this.peek()} ...]`;
   }
 }
-function T(o, t) {
+function D(o, t) {
   return o === t ? 0 : o < t ? -1 : 1;
 }
 class E {
   heap = [];
   compareFn;
-  constructor(t = T) {
+  constructor(t = D) {
     this.compareFn = t;
   }
   static getLeftIndex(t) {
@@ -225,7 +225,7 @@ class E {
     return this.heap.toString();
   }
 }
-class q extends E {
+class H extends E {
   insert(t) {
     return t ? !1 : (this.heap.push(t), this.siftUp(this.heap.length - 1), !0);
   }
@@ -245,15 +245,15 @@ class q extends E {
       E.swap(this.heap, e, t), t = e, e = E.getParentIndex(t);
   }
 }
-class X extends q {
-  constructor(t = (e, s) => T(s, e)) {
+class J extends H {
+  constructor(t = (e, s) => D(s, e)) {
     super(t);
   }
 }
-function U(o) {
+function V(o) {
   return { value: o };
 }
-class j {
+class Y {
   capacity;
   length = 0;
   head = null;
@@ -283,15 +283,15 @@ class j {
   }
   update(t, e) {
     let s = this.lookup.get(t);
-    s ? (this.detach(s), this.prepend(s), s.value = e) : (s = U(e), this.length++, this.prepend(s), this.trimCache(), this.lookup.set(t, s), this.reverseLookup);
+    s ? (this.detach(s), this.prepend(s), s.value = e) : (s = V(e), this.length++, this.prepend(s), this.trimCache(), this.lookup.set(t, s), this.reverseLookup);
   }
 }
-class k {
+class C {
   constructor(t, e = null, s = null) {
     this.value = t, this.next = e, this.prev = s;
   }
 }
-class Q {
+class Z {
   count = 0;
   head = null;
   tail = null;
@@ -350,7 +350,7 @@ class Q {
   insert(t, e) {
     if (e < 0 || e > this.count)
       throw new Error(`Index out of bounds: ${e}`);
-    const s = new k(t);
+    const s = new C(t);
     if (e === 0)
       s.next = this.head, this.head && (this.head.prev = s), this.head = s, this.count === 0 && (this.tail = s);
     else if (e === this.count)
@@ -374,7 +374,7 @@ class Q {
     return this.count++, !0;
   }
   push(t) {
-    const e = new k(t);
+    const e = new C(t);
     this.head ? this.tail && (this.tail.next = e, e.prev = this.tail, this.tail = e) : (this.head = e, this.tail = e), this.count++;
   }
   remove(t) {
@@ -439,17 +439,17 @@ class Q {
     return t;
   }
 }
-class H {
+class G {
   key;
   value;
   constructor(t, e) {
     this.key = t, this.value = e;
   }
 }
-function N(o, t = { emptyString: !1, zeroNumber: !1 }) {
+function $(o, t = { emptyString: !1, zeroNumber: !1 }) {
   return o == null ? !(t.emptyString && o === "" || t.zeroNumber && o === 0) : !1;
 }
-class F {
+class B {
   table = [];
   constructor() {
   }
@@ -460,15 +460,15 @@ class F {
     return -1;
   }
   set(t, e) {
-    if (N(t))
+    if ($(t))
       throw new Error("key is required");
-    if (N(e))
+    if ($(e))
       throw new Error("value is required");
     if (this.has(t)) {
       let s = this.getItemIndex(t);
       this.table[s].value = e;
     } else {
-      const s = new H(t, e);
+      const s = new G(t, e);
       this.table.push(s);
     }
   }
@@ -519,12 +519,12 @@ class F {
     return t = t.slice(0, -1), t;
   }
 }
-class W {
+class K {
   isDirected;
   vertices;
   adjList;
   constructor(t = !1) {
-    this.isDirected = t, this.vertices = [], this.adjList = new F();
+    this.isDirected = t, this.vertices = [], this.adjList = new B();
   }
   addVertex(t) {
     this.vertices.includes(t) || (this.vertices.push(t), this.adjList.set(t, []));
@@ -604,10 +604,10 @@ class w {
     return this.mul(-1);
   }
 }
-class S {
+class M {
   _matrix;
   static zero(t, e) {
-    return new S(
+    return new M(
       Array.from({ length: t }, () => Array.from({ length: e }, () => 0))
     );
   }
@@ -648,7 +648,7 @@ class S {
     return this._matrix[t[0]][t[1]] = e, this;
   }
   mul(t) {
-    return new S(this._matrix.map((e) => e.map((s) => s * t)));
+    return new M(this._matrix.map((e) => e.map((s) => s * t)));
   }
   div(t) {
     return this.mul(1 / t);
@@ -656,7 +656,7 @@ class S {
   add(t) {
     if (this.row !== t.row || this.col !== t.col)
       throw new Error("Matrix dimensions do not match");
-    return new S(
+    return new M(
       this._matrix.map(
         (e, s) => e.map((r, i) => r + t.getItem([s, i]))
       )
@@ -674,14 +674,14 @@ class S {
   mulVector(t) {
     if (this.col !== t.dimension)
       throw new Error("Matrix dimensions do not match");
-    return new S(
+    return new M(
       this._matrix.map((e) => e.map((s, r) => s * t.getItem(r)))
     );
   }
   mulMatrix(t) {
     if (this.col !== t.row)
       throw new Error("Matrix dimensions do not match");
-    const e = S.zero(this.row, t.col);
+    const e = M.zero(this.row, t.col);
     for (let s = 0; s < this.row; s++) {
       const r = this.rowVector(s);
       for (let i = 0; i < this.col; i++)
@@ -690,7 +690,7 @@ class S {
     return e;
   }
 }
-class p {
+class u {
   static distance(t, e) {
     return Math.hypot(e.x - t.x, e.y - t.y);
   }
@@ -700,40 +700,58 @@ class p {
     this.x = t, this.y = e;
   }
   distanceTo(t) {
-    return p.distance(this, t);
+    return u.distance(this, t);
+  }
+  static linearInterpolation(t, e, s) {
+    if (s < 0 || s > 1)
+      throw new Error("Parameter t must be in the range [0, 1]");
+    const r = t.x * (1 - s) + e.x * s, i = t.y * (1 - s) + e.y * s;
+    return new u(r, i);
+  }
+  static quadraticBezierInterpolation(t, e, s, r) {
+    if (r < 0 || r > 1)
+      throw new Error("Parameter t must be in the range [0, 1]");
+    const i = (1 - r) * (1 - r) * t.x + 2 * (1 - r) * r * e.x + r * r * s.x, n = (1 - r) * (1 - r) * t.y + 2 * (1 - r) * r * e.y + r * r * s.y;
+    return new u(i, n);
+  }
+  static cubicBezierInterpolation(t, e, s, r, i) {
+    if (i < 0 || i > 1)
+      throw new Error("Parameter t must be in the range [0, 1]");
+    const n = Math.pow(1 - i, 3) * t.x + 3 * Math.pow(1 - i, 2) * i * e.x + 3 * (1 - i) * Math.pow(i, 2) * s.x + Math.pow(i, 3) * r.x, a = Math.pow(1 - i, 3) * t.y + 3 * Math.pow(1 - i, 2) * i * e.y + 3 * (1 - i) * Math.pow(i, 2) * s.y + Math.pow(i, 3) * r.y;
+    return new u(n, a);
   }
 }
-class g {
+class y {
   static EPSILON = 1e-10;
-  static sloped(t, e = g.EPSILON) {
+  static sloped(t, e = y.EPSILON) {
     const s = t.p2.x - t.p1.x, r = t.p2.y - t.p1.y;
     return Math.abs(s) < e ? Math.abs(r) < e ? 0 : null : r / s;
   }
-  static isParallel(t, e, s = g.EPSILON) {
-    const r = g.sloped(t), i = g.sloped(e);
+  static isParallel(t, e, s = y.EPSILON) {
+    const r = y.sloped(t), i = y.sloped(e);
     return r === null && i === null ? !0 : r === null || i === null ? !1 : Math.abs(r - i) < s;
   }
-  static getIntersection(t, e, s = g.EPSILON) {
-    if (g.isParallel(t, e)) return null;
-    const r = t.p1.x, i = t.p1.y, n = t.p2.x, a = t.p2.y, c = e.p1.x, f = e.p1.y, u = e.p2.x, h = e.p2.y, l = (r - n) * (f - h) - (i - a) * (c - u);
-    if (Math.abs(l) < s) return null;
-    const m = ((r - c) * (f - h) - (i - f) * (c - u)) / l, I = -((r - n) * (i - f) - (i - a) * (r - c)) / l;
+  static getIntersection(t, e, s = y.EPSILON) {
+    if (y.isParallel(t, e)) return null;
+    const r = t.p1.x, i = t.p1.y, n = t.p2.x, a = t.p2.y, c = e.p1.x, d = e.p1.y, l = e.p2.x, h = e.p2.y, p = (r - n) * (d - h) - (i - a) * (c - l);
+    if (Math.abs(p) < s) return null;
+    const m = ((r - c) * (d - h) - (i - d) * (c - l)) / p, I = -((r - n) * (i - d) - (i - a) * (r - c)) / p;
     if (m >= 0 && m <= 1 && I >= 0 && I <= 1) {
-      const R = r + m * (n - r), D = i + m * (a - i);
-      return new p(R, D);
+      const R = r + m * (n - r), q = i + m * (a - i);
+      return new u(R, q);
     }
     return null;
   }
   static isIntersecting(t, e) {
-    return g.getIntersection(t, e) !== null;
-  }
-  static distanceToPoint(t, e, s = g.EPSILON) {
-    const r = e.x - t.p1.x, i = e.y - t.p1.y, n = t.p2.x - t.p1.x, a = t.p2.y - t.p1.y, c = r * n + i * a, f = n * n + a * a;
-    let u = -1;
-    f > s && (u = c / f);
-    let h, l;
-    u < 0 ? (h = t.p1.x, l = t.p1.y) : u > 1 ? (h = t.p2.x, l = t.p2.y) : (h = t.p1.x + u * n, l = t.p1.y + u * a);
-    const m = e.x - h, I = e.y - l;
+    return y.getIntersection(t, e) !== null;
+  }
+  static distanceToPoint(t, e, s = y.EPSILON) {
+    const r = e.x - t.p1.x, i = e.y - t.p1.y, n = t.p2.x - t.p1.x, a = t.p2.y - t.p1.y, c = r * n + i * a, d = n * n + a * a;
+    let l = -1;
+    d > s && (l = c / d);
+    let h, p;
+    l < 0 ? (h = t.p1.x, p = t.p1.y) : l > 1 ? (h = t.p2.x, p = t.p2.y) : (h = t.p1.x + l * n, p = t.p1.y + l * a);
+    const m = e.x - h, I = e.y - p;
     return Math.hypot(m + I);
   }
   p1;
@@ -747,20 +765,20 @@ class g {
   }
   get midpoint() {
     const t = (this.p1.x + this.p2.x) / 2, e = (this.p1.y + this.p2.y) / 2;
-    return new p(t, e);
+    return new u(t, e);
   }
   get angle() {
     return Math.atan2(this.p2.y - this.p1.y, this.p2.x - this.p1.x);
   }
-  containsPoint(t, e = g.EPSILON) {
+  containsPoint(t, e = y.EPSILON) {
     const s = (t.x - this.p1.x) * (this.p2.y - this.p1.y) - (t.y - this.p1.y) * (this.p2.x - this.p1.x);
     return Math.abs(s) > e ? !1 : (t.x - this.p1.x) * (t.x - this.p2.x) + (t.y - this.p1.y) * (t.y - this.p2.y) <= e;
   }
   get direction() {
     const t = this.length;
-    if (t < g.EPSILON) return new p(0, 0);
+    if (t < y.EPSILON) return new u(0, 0);
     const e = (this.p2.x - this.p1.x) / t, s = (this.p2.y - this.p1.y) / t;
-    return new p(e, s);
+    return new u(e, s);
   }
   get start() {
     return this.p1;
@@ -769,31 +787,31 @@ class g {
     return this.p2;
   }
 }
-class L {
+class N {
   static EPSILON = 1e-10;
   name;
   constructor(t) {
     this.name = t;
   }
 }
-class d extends L {
+class g extends N {
   static isValid(t, e, s) {
     return t <= 0 || e <= 0 || s <= 0 ? !1 : t + e > s && t + s > e && e + s > t;
   }
   static area(t, e, s) {
-    if (!d.isValid(t, e, s))
+    if (!g.isValid(t, e, s))
       throw new Error("Invalid triangle");
     const r = (t + e + s) / 2;
     return Math.sqrt(r * (r - t) * (r - e) * (r - s));
   }
   static getType(t, e, s) {
-    if (!d.isValid(t, e, s))
+    if (!g.isValid(t, e, s))
       throw new Error("Invalid triangle sides");
-    const r = [t, e, s].sort((c, f) => c - f), [i, n, a] = r;
-    return Math.abs(i - n) < d.EPSILON && Math.abs(n - a) < d.EPSILON ? "equilateral" : Math.abs(i - n) < d.EPSILON || Math.abs(n - a) < d.EPSILON ? "isosceles" : "scalene";
+    const r = [t, e, s].sort((c, d) => c - d), [i, n, a] = r;
+    return Math.abs(i - n) < g.EPSILON && Math.abs(n - a) < g.EPSILON ? "equilateral" : Math.abs(i - n) < g.EPSILON || Math.abs(n - a) < g.EPSILON ? "isosceles" : "scalene";
   }
   static getAngles(t, e, s) {
-    if (!d.isValid(t, e, s))
+    if (!g.isValid(t, e, s))
       throw new Error("Invalid triangle sides");
     const r = Math.acos((e * e + s * s - t * t) / (2 * e * s)), i = Math.acos((t * t + s * s - e * e) / (2 * t * s)), n = Math.PI - r - i;
     return [r, i, n];
@@ -809,65 +827,65 @@ class d extends L {
   areCollinear() {
     return Math.abs(
       (this.p2.x - this.p1.x) * (this.p3.y - this.p1.y) - (this.p3.x - this.p1.x) * (this.p2.y - this.p1.y)
-    ) < L.EPSILON;
+    ) < N.EPSILON;
   }
   get side() {
     return [
-      p.distance(this.p1, this.p2),
-      p.distance(this.p2, this.p3),
-      p.distance(this.p3, this.p1)
+      u.distance(this.p1, this.p2),
+      u.distance(this.p2, this.p3),
+      u.distance(this.p3, this.p1)
     ];
   }
   perimeter() {
-    return d.isValid(this.side[0], this.side[1], this.side[2]), this.side.reduce((t, e) => t + e, 0);
+    return g.isValid(this.side[0], this.side[1], this.side[2]), this.side.reduce((t, e) => t + e, 0);
   }
   area() {
     const [t, e, s] = this.side;
-    return d.area(t, e, s);
+    return g.area(t, e, s);
   }
   get type() {
     const [t, e, s] = this.side;
-    return d.getType(t, e, s);
+    return g.getType(t, e, s);
   }
   get angles() {
     const [t, e, s] = this.side;
-    return d.getAngles(t, e, s);
+    return g.getAngles(t, e, s);
   }
   get centroid() {
-    return new p(
+    return new u(
       (this.p1.x + this.p2.x + this.p3.x) / 3,
       (this.p1.y + this.p2.y + this.p3.y) / 3
     );
   }
   get incenter() {
     const [t, e, s] = this.side, r = this.perimeter() / 2, i = (t * this.p1.x + e * this.p2.x + s * this.p3.x) / r, n = (t * this.p1.y + e * this.p2.y + s * this.p3.y) / r;
-    return new p(i, n);
+    return new u(i, n);
   }
   get circumcenter() {
     const t = 2 * (this.p1.x * (this.p2.y - this.p3.y) + this.p2.x * (this.p3.y - this.p1.y) + this.p3.x * (this.p1.y - this.p2.y));
-    if (Math.abs(t) < d.EPSILON)
+    if (Math.abs(t) < g.EPSILON)
       throw new Error("Cannot calculate circumcenter for collinear points");
     const e = ((this.p1.x * this.p1.x + this.p1.y * this.p1.y) * (this.p2.y - this.p3.y) + (this.p2.x * this.p2.x + this.p2.y * this.p2.y) * (this.p3.y - this.p1.y) + (this.p3.x * this.p3.x + this.p3.y * this.p3.y) * (this.p1.y - this.p2.y)) / t, s = ((this.p1.x * this.p1.x + this.p1.y * this.p1.y) * (this.p3.x - this.p2.x) + (this.p2.x * this.p2.x + this.p2.y * this.p2.y) * (this.p1.x - this.p3.x) + (this.p3.x * this.p3.x + this.p3.y * this.p3.y) * (this.p2.x - this.p1.x)) / t;
-    return new p(e, s);
+    return new u(e, s);
   }
   containsPoint(t) {
-    const e = d.area(
-      p.distance(t, this.p1),
-      p.distance(t, this.p2),
-      p.distance(this.p1, this.p2)
-    ), s = d.area(
-      p.distance(t, this.p2),
-      p.distance(t, this.p3),
-      p.distance(this.p2, this.p3)
-    ), r = d.area(
-      p.distance(t, this.p3),
-      p.distance(t, this.p1),
-      p.distance(this.p3, this.p1)
+    const e = g.area(
+      u.distance(t, this.p1),
+      u.distance(t, this.p2),
+      u.distance(this.p1, this.p2)
+    ), s = g.area(
+      u.distance(t, this.p2),
+      u.distance(t, this.p3),
+      u.distance(this.p2, this.p3)
+    ), r = g.area(
+      u.distance(t, this.p3),
+      u.distance(t, this.p1),
+      u.distance(this.p3, this.p1)
     );
-    return Math.abs(e + s + r - this.area()) < d.EPSILON;
+    return Math.abs(e + s + r - this.area()) < g.EPSILON;
   }
 }
-class J {
+class tt {
   static sleep(t) {
     return new Promise((e) => setTimeout(e, t));
   }
@@ -891,7 +909,7 @@ class J {
     return t.prototype.constructor = s, s;
   }
 }
-class Y {
+class et {
   static groupBy(t, e) {
     if (!e)
       throw new Error("generateKey is required");
@@ -940,7 +958,7 @@ class Y {
 function P(o) {
   return o !== null && (typeof o == "object" || typeof o == "function");
 }
-class Z {
+class st {
   map = /* @__PURE__ */ new Map();
   weakMap = /* @__PURE__ */ new WeakMap();
   set(t, e) {
@@ -953,7 +971,7 @@ class Z {
     return P(t) ? this.weakMap.has(t) : this.map.has(t);
   }
 }
-class K {
+class rt {
   static jsonClone(t) {
     try {
       return JSON.parse(JSON.stringify(t));
@@ -1023,41 +1041,41 @@ class K {
     return r;
   }
 }
-const C = {
+const T = {
   date: "yyyy-MM-dd",
   datetime: "yyyy-MM-dd HH:mm:ss",
   time: "HH:mm:ss",
   iso: "yyyy-MM-ddTHH:mm:ss.SSS"
 };
-class v {
+class A {
   static defaultOptions = {
     paddingZero: !1,
     locale: "en-US"
   };
   static setDefaultOptions(t) {
-    v.defaultOptions = { ...v.defaultOptions, ...t };
+    A.defaultOptions = { ...A.defaultOptions, ...t };
   }
   static format(t, e, s = {}) {
-    const r = { ...v.defaultOptions, ...s }, i = v.getDateInfo(t, r);
-    return v.normalizeFormatter(e)(i);
+    const r = { ...A.defaultOptions, ...s }, i = A.getDateInfo(t, r);
+    return A.normalizeFormatter(e)(i);
   }
   // 获取日期信息
   static getDateInfo(t, e) {
-    const s = (h, l = 2) => e.paddingZero ? h.toString().padStart(l, "0") : h.toString(), r = t.getFullYear(), i = t.getMonth() + 1, n = t.getDate(), a = t.getHours(), c = t.getMinutes(), f = t.getSeconds(), u = t.getMilliseconds();
+    const s = (h, p = 2) => e.paddingZero ? h.toString().padStart(p, "0") : h.toString(), r = t.getFullYear(), i = t.getMonth() + 1, n = t.getDate(), a = t.getHours(), c = t.getMinutes(), d = t.getSeconds(), l = t.getMilliseconds();
     return {
       year: r,
       month: i,
       day: n,
       hour: a,
       minute: c,
-      second: f,
-      millisecond: u,
+      second: d,
+      millisecond: l,
       yyyy: s(r, 4),
       MM: s(i),
       dd: s(n),
       HH: s(a),
       mm: s(c),
-      ss: s(f)
+      ss: s(d)
     };
   }
   static normalizeFormatter(t) {
@@ -1065,7 +1083,7 @@ class v {
       return t;
     if (typeof t != "string")
       throw new Error("Formatter must be a string or function");
-    t in C && (t = C[t]);
+    t in T && (t = T[t]);
     const e = {
       yyyy: "yyyy",
       MM: "MM",
@@ -1090,7 +1108,7 @@ class v {
     return c > 0 ? s > 0 ? `${c}天后` : `${c}天前` : a > 0 ? s > 0 ? `${a}小时后` : `${a}小时前` : n > 0 ? s > 0 ? `${n}分钟后` : `${n}分钟前` : s > 0 ? "刚刚" : "";
   }
 }
-class $ {
+class F {
   lights;
   currentIndex;
   switchTime;
@@ -1100,7 +1118,7 @@ class $ {
     { color: "green", latest: 10 },
     { color: "yellow", latest: 3 }
   ];
-  constructor(t = $.DEFAULT_LIGHTS) {
+  constructor(t = F.DEFAULT_LIGHTS) {
     this.lights = t, this.currentIndex = 0, this.switchTime = Date.now();
   }
   render(t) {
@@ -1125,12 +1143,21 @@ class $ {
     };
   }
 }
-class tt {
+class it {
   static escape(t) {
     return t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
   }
+  static telephone = {
+    loose: /\D?(\d[0-9-]{6,}\d)\D?/g
+  };
+  static consecutiveChars = /(.)\1+/g;
+  // 匹配连续字符
+  static chineseChar = /[\u4e00-\u9fa5]/g;
+  // 匹配中文字符
+  static domain = /^(?:https?:\/\/)?(?:[^\/]+)/i;
+  static email = /^\w+([-+.]\w+)*@\w+([-.]\w+)*.\w+([-.]\w+)*$/;
 }
-class et {
+class nt {
   static ROMAN_MAP = /* @__PURE__ */ new Map([
     ["M", 1e3],
     ["CM", 900],
@@ -1181,7 +1208,13 @@ class et {
     return e;
   }
 }
-class y {
+class f {
+  static ensurePositiveInteger(t, e = 0) {
+    if (!Number.isInteger(t) || t <= e)
+      throw new Error(
+        `n must be a positive integer and greater than ${e}`
+      );
+  }
   static handleNumRange(t, e = !1, s = Number.MIN_SAFE_INTEGER, r = Number.MAX_SAFE_INTEGER) {
     if (e && !Number.isInteger(t))
       throw new Error("n must be an integer");
@@ -1189,19 +1222,19 @@ class y {
       throw new RangeError(`n must be in the range of ${s} to ${r}`);
   }
   static consecutiveSum(t) {
-    return y.handleNumRange(t, !0, 0, 1e8), t * (t + 1) / 2;
+    return f.handleNumRange(t, !0, 0, 1e8), t * (t + 1) / 2;
   }
   static consecutiveSquaresSum(t) {
-    return y.handleNumRange(t, !0, 0, 1e6), t * (t + 1) * (2 * t + 1) / 6;
+    return f.handleNumRange(t, !0, 0, 1e6), t * (t + 1) * (2 * t + 1) / 6;
   }
   static consecutivecubesSum(t) {
-    return y.handleNumRange(t, !0, 0, 1e4), t * (t + 1) * (2 * t + 1) * (3 * t * t + 3 * t - 1) / 30;
+    return f.handleNumRange(t, !0, 0, 1e4), t * (t + 1) * (2 * t + 1) * (3 * t * t + 3 * t - 1) / 30;
   }
   static clamp(t, e, s) {
     return s == null ? Math.min(t, e) : Math.min(Math.max(t, e), s);
   }
   static factorial(t) {
-    if (y.handleNumRange(t, !0, 0, 1e3), t < 2)
+    if (f.handleNumRange(t, !0, 0, 1e3), t < 2)
       return 1;
     let e = 1;
     for (let s = 2; s <= t; s++)
@@ -1209,10 +1242,10 @@ class y {
     return e;
   }
   static fibonacci(t, e = 1, s = 1) {
-    return y.handleNumRange(t, !0, 0, 1e3), t < 2 ? s : this.fibonacci(t - 1, s, s + e);
+    return f.handleNumRange(t, !0, 0, 1e3), t < 2 ? s : this.fibonacci(t - 1, s, s + e);
   }
   static fibonacciIterative(t) {
-    if (y.handleNumRange(t, !0, 0, 1e3), t < 2) return t;
+    if (f.handleNumRange(t, !0, 0, 1e3), t < 2) return t;
     let e = 0, s = 1;
     for (let r = 2; r <= t; r++)
       [e, s] = [s, (e + s) % 1000000007];
@@ -1222,13 +1255,13 @@ class y {
     return Math.abs(t - e) < s;
   }
   static fastPower(t, e) {
-    if (y.handleNumRange(e, !0, 0, 10), y.handleNumRange(t, !1, 0, 1e3), t === 0) return 0;
+    if (f.handleNumRange(e, !0, 0, 10), f.handleNumRange(t, !1, 0, 1e3), t === 0) return 0;
     if (e === 0) return 1;
     const s = this.fastPower(t, e >> 1);
     return e % 2 === 0 ? s * s : s * s * t;
   }
   static fastSqrt(t) {
-    if (y.handleNumRange(t, !1, 0, 1e8), typeof BigInt > "u")
+    if (f.handleNumRange(t, !1, 0, 1e8), typeof BigInt > "u")
       return Math.sqrt(t);
     const e = 0.5 * t, s = new ArrayBuffer(8);
     new Float64Array(s)[0] = t;
@@ -1244,23 +1277,20 @@ class y {
       return [];
     if (e < 0 || !Number.isInteger(e))
       throw new Error("Precision must be a non-negative integer");
-    const s = t.reduce((h, l) => h + l, 0);
+    const s = t.reduce((h, p) => h + p, 0);
     if (s === 0)
       return t.map(() => "0%");
-    const i = 100 * Math.pow(10, e), n = t.map((h) => h / s * i), a = n.map((h) => Math.floor(h)), c = n.map((h, l) => h - a[l]);
-    let f = a.reduce((h, l) => h + l, 0), u = i - f;
-    for (; u > 0; ) {
-      let h = -1, l = -1;
+    const i = 100 * Math.pow(10, e), n = t.map((h) => h / s * i), a = n.map((h) => Math.floor(h)), c = n.map((h, p) => h - a[p]);
+    let d = a.reduce((h, p) => h + p, 0), l = i - d;
+    for (; l > 0; ) {
+      let h = -1, p = -1;
       for (let m = 0; m < c.length; m++)
-        c[m] > l && (l = c[m], h = m);
+        c[m] > p && (p = c[m], h = m);
       if (h === -1) break;
-      a[h]++, c[h] = 0, u--;
+      a[h]++, c[h] = 0, l--;
     }
     return a.map((h) => `${(h / i * 100).toFixed(e)}%`);
   }
-  static gcd(t, e) {
-    return e === 0 ? t : this.gcd(e, t % e);
-  }
   static isValidPositiveInteger(t) {
     return Number.isInteger(t) && t > 0 && t <= Number.MAX_SAFE_INTEGER;
   }
@@ -1271,9 +1301,11 @@ class y {
     return t % 2 === 1 || t % 2 === -1;
   }
   static isPrime(t) {
-    if (t <= 1)
+    if (f.ensurePositiveInteger(t, 1), t == 2 || t == 3 || t == 5 || t == 7)
+      return !0;
+    if (t % 2 === 0 || t % 3 === 0 || t % 5 === 0 || t % 7 === 0)
       return !1;
-    for (let e = 2; e <= Math.sqrt(t); e++)
+    for (let e = 7; e <= Math.sqrt(t); e += 2)
       if (t % e === 0)
         return !1;
     return !0;
@@ -1319,6 +1351,9 @@ class y {
       );
     return e <= t && t < s;
   }
+  static gcd(t, e) {
+    return e === 0 ? t : f.gcd(e, t % e);
+  }
   static lcm(t, e) {
     return t * e / this.gcd(t, e);
   }
@@ -1351,15 +1386,19 @@ class y {
   static getPythagoreanTriple(t) {
     if (t <= 0 || !Number.isInteger(t))
       throw new Error("n must be a positive integer");
-    if (y.isOdd(t)) {
+    if (f.isOdd(t)) {
       const s = t * t;
       return [t, (s - 1) / 2, (s + 1) / 2];
     }
     const e = t / 2;
     return [t, e * e - 1, e * e + 1];
   }
+  static exclusionPrinciple(t, e, s, r) {
+    const i = Math.floor(t / e) + Math.floor(t / s) + Math.floor(t / r), n = Math.floor(t / f.lcm(e, s)) + Math.floor(t / f.lcm(e, r)) + Math.floor(t / f.lcm(s, r)), a = Math.floor(t / f.lcm(f.lcm(e, s), r));
+    return i - n + a;
+  }
 }
-class st {
+class at {
   static READ = 1;
   static WRITE = 2;
   static SHARE = 4;
@@ -1378,7 +1417,7 @@ class st {
     return t ^ e;
   }
 }
-class A {
+class S {
   static frequencyStatistics(t) {
     return [...t].reduce(
       (e, s) => (e[s] = (e[s] || 0) + 1, e),
@@ -1447,7 +1486,7 @@ class A {
     return e;
   }
   static pointAt(t, e) {
-    if (e >= A.pointLength(t)) return;
+    if (e >= S.pointLength(t)) return;
     let s = 0;
     for (let r = 0, i = t.length; r < i; ) {
       const n = t.codePointAt(r);
@@ -1457,10 +1496,10 @@ class A {
       r += n > 65535 ? 2 : 1, s++;
     }
   }
-  static sliceByPoint(t, e, s = A.pointLength(t)) {
+  static sliceByPoint(t, e, s = S.pointLength(t)) {
     let r = "";
     for (let i = e; i < s; i++)
-      r += A.pointAt(t, i);
+      r += S.pointAt(t, i);
     return r;
   }
   static capitalize(t) {
@@ -1470,10 +1509,10 @@ class A {
     return t.split("").reverse().join("");
   }
   static truncate(t, e, s = "...") {
-    return t.length <= e ? this : t.slice(0, e - s.length) + s;
+    return t.length <= e ? t : t.slice(0, e - s.length) + s;
   }
   static isPalindrome(t) {
-    return t.toLowerCase().replace(/[^a-z0-9]/g, "") === A.reverse(t);
+    return t.toLowerCase().replace(/[^a-z0-9]/g, "") === S.reverse(t);
   }
   static count(t, e) {
     const s = e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
@@ -1486,7 +1525,7 @@ class A {
     return t.replace(/[A-Z]/g, (e) => `_${e.toLowerCase()}`);
   }
 }
-class rt {
+class ot {
   static isValidHex(t) {
     return /^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/.test(t);
   }
@@ -1494,7 +1533,130 @@ class rt {
     return /^rgb\((\d{1,3}),\s*(\d{1,3}),\s*(\d{1,3})\)$/.test(t);
   }
 }
-const x = {
+const L = (o) => o == null || o === "", _ = {
+  success: {
+    background: "#67C23A",
+    border: "#67C23A",
+    color: "#fff"
+  },
+  error: {
+    background: "#F56C6C",
+    border: "#F56C6C",
+    color: "#fff"
+  },
+  warning: {
+    background: "#E6A23C",
+    border: "#E6A23C",
+    color: "#fff"
+  },
+  info: {
+    background: "#909399",
+    border: "#909399",
+    color: "#fff"
+  }
+}, z = {
+  enable: !0,
+  showTimestamp: !0,
+  maxLogLength: 30
+};
+class x {
+  //#region private static methods
+  static config = z;
+  static shouldLog() {
+    return this.config.enable && !0;
+  }
+  static formatMessage(t) {
+    return t.length > this.config.maxLogLength ? `${t.substring(0, this.config.maxLogLength)}...` : t;
+  }
+  static getTimestamp() {
+    return this.config.showTimestamp ? `[${(/* @__PURE__ */ new Date()).toLocaleTimeString()}] ` : "";
+  }
+  static prettyPrint(t, e, s) {
+    if (!this.shouldLog()) return;
+    const r = _[s], i = this.getTimestamp(), n = this.formatMessage(t), a = this.formatMessage(e);
+    console.log(
+      `%c${i} ${n} %c ${a} %c`,
+      `background:${r.background};border:1px solid ${r.border}; padding: 1px; border-radius: 2px 0 0 2px; color: ${r.color};`,
+      `border:1px solid ${r.border}; padding: 1px; border-radius: 0 2px 2px 0; color: ${r.border};`,
+      "background:transparent"
+    );
+  }
+  static handleLevel(t, e, s) {
+    const r = L(e) ? s : t, i = L(e) ? t : e;
+    return x.prettyPrint(r, i, s);
+  }
+  //#endregion
+  //#region public static methods
+  static configure(t) {
+    this.config = { ...z, ...t };
+  }
+  static success(t, e = "") {
+    x.handleLevel(t, e, "success");
+  }
+  static error(t, e = "") {
+    this.handleLevel(t, e, "error");
+  }
+  static warning(t, e = "") {
+    x.handleLevel(t, e, "warning");
+  }
+  static info(t, e = "") {
+    x.handleLevel(t, e, "info");
+  }
+  static table(t) {
+    !this.shouldLog() || !Array.isArray(t) || t.length === 0 || console.table(t);
+  }
+  static async picture(t, e = 1) {
+    if (!(!this.shouldLog() || L(t)))
+      return new Promise((s, r) => {
+        const i = new Image();
+        i.crossOrigin = "anonymous", i.onerror = () => {
+          x.error("Image Load Error", `Failed to load image: ${t}`), r(new Error(`Failed to load image: ${t}`));
+        }, i.onload = () => {
+          try {
+            const n = document.createElement("canvas"), a = n.getContext("2d");
+            if (!a)
+              throw new Error("Failed to get canvas context");
+            n.width = i.width, n.height = i.height, a.fillStyle = "red", a.fillRect(0, 0, n.width, n.height), a.drawImage(i, 0, 0);
+            const c = n.toDataURL("image/png");
+            console.log(
+              "%c sup?",
+              `font-size:1px;
+            padding:${Math.floor(i.height * e / 2)}px ${Math.floor(
+                i.width * e / 2
+              )}px;
+            background:url(${c}) no-repeat;
+            background-size:${i.width * e}px ${i.height * e}px;
+            line-height:${i.height * e}px;
+            color:transparent;
+            `
+            ), s();
+          } catch (n) {
+            x.error(
+              "Image Processing Error",
+              n instanceof Error ? n.message : String(n)
+            ), r(n);
+          }
+        }, i.src = t;
+      });
+  }
+  static time(t) {
+    this.shouldLog() && console.time(t);
+  }
+  static timeEnd(t) {
+    this.shouldLog() && console.timeEnd(t);
+  }
+  static group(t, e = !1) {
+    this.shouldLog() && (e ? console.groupCollapsed(t) : console.group(t));
+  }
+  static groupEnd() {
+    this.shouldLog() && console.groupEnd();
+  }
+  static clear() {
+    this.shouldLog() && console.clear();
+  }
+  //#endregion
+}
+const v = {
   AUTH_UNAUTHORIZED: "未授权事件",
   AUTH_LOGIN_SUCCESS: "登录成功事件",
   AUTH_LOGOUT: "注销事件",
@@ -1506,37 +1668,37 @@ const x = {
   UI_HIDE_LOADING: "隐藏加载事件",
   UI_SHOW_MESSAGE: "显示消息事件"
 };
-class M {
+class b {
   static instance = null;
   listeners = {};
   debugMode;
   constructor(t = !1) {
-    this.debugMode = t, Object.keys(x).forEach(
+    this.debugMode = t, Object.keys(v).forEach(
       (e) => {
         this.listeners[e] = /* @__PURE__ */ new Set();
       }
     );
   }
   static getInstance(t) {
-    return M.instance || (M.instance = new M(t)), M.instance;
+    return b.instance || (b.instance = new b(t)), b.instance;
   }
   on(t, e) {
-    this.debugLog(`添加事件监听: ${x[t]}`), this.listeners[t].add(e);
+    this.debugLog(`添加事件监听: ${v[t]}`), this.listeners[t].add(e);
   }
   emit(t, e) {
-    this.debugLog(`触发事件: ${x[t]}`, e), this.listeners[t].forEach((s) => {
+    this.debugLog(`触发事件: ${v[t]}`, e), this.listeners[t].forEach((s) => {
       try {
         s(e);
       } catch (r) {
-        console.error(`事件 ${x[t]} 处理出错:`, r);
+        console.error(`事件 ${v[t]} 处理出错:`, r);
       }
     });
   }
   off(t, e) {
-    this.debugLog(`移除事件监听: ${x[t]}`), this.listeners[t].delete(e);
+    this.debugLog(`移除事件监听: ${v[t]}`), this.listeners[t].delete(e);
   }
   once(t, e) {
-    this.debugLog(`添加一次性事件监听: ${x[t]}`);
+    this.debugLog(`添加一次性事件监听: ${v[t]}`);
     const s = (r) => {
       e(r), this.off(t, s);
     };
@@ -1552,7 +1714,7 @@ class M {
     this.debugMode && console.log(`[EventEmitter] ${t}`, e || "");
   }
 }
-class b {
+class k {
   //#region private static members
   static OPERATORS = /* @__PURE__ */ new Set(["+", "-", "*", "/"]);
   static VALID_CHARS_REG = /^[0-9+\-*/().\s]+$/;
@@ -1616,7 +1778,7 @@ class b {
   static EXPRESSION_REG = new RegExp("(?<!\\d)-?\\d*\\.?\\d+|[+\\-*/()]", "g");
   static toArr(t) {
     this.validateExpression(t);
-    const e = t.match(b.EXPRESSION_REG);
+    const e = t.match(k.EXPRESSION_REG);
     if (!e)
       throw new Error("Invalid expression format");
     return e.filter((s) => s.trim() !== "").map((s) => {
@@ -1645,7 +1807,7 @@ class b {
   static evaluatePostfix(t) {
     if (!t.length)
       throw new Error("Postfix expression cannot be empty");
-    typeof t == "string" && (t = b.toArr(t));
+    typeof t == "string" && (t = k.toArr(t));
     const e = new O();
     for (const s of t)
       if (this.FLOAT_NUM_REG.test(s))
@@ -1659,7 +1821,7 @@ class b {
     return e.pop() ?? 0;
   }
 }
-class z {
+class U {
   static isMatchingPair(t, e) {
     return t === "(" && e === ")" || t === "{" && e === "}" || t === "[" && e === "]";
   }
@@ -1689,58 +1851,59 @@ class z {
     return e.isEmpty();
   }
   static findPath(t, e, s) {
-    const r = t.length, i = t[0].length, n = z.arr_2d_init(r, i, !1), a = new O(), c = [
+    const r = t.length, i = t[0].length, n = U.arr_2d_init(r, i, !1), a = new O(), c = [
       [-1, 0],
       [0, 1],
       [1, 0],
       [0, -1]
     ];
-    function f(u, h) {
-      if (u < 0 || u >= r || h < 0 || h >= i || t[u][h] === 1 || n[u][h])
+    function d(l, h) {
+      if (l < 0 || l >= r || h < 0 || h >= i || t[l][h] === 1 || n[l][h])
         return !1;
-      if (t[u][h] === 2)
-        return a.push([u, h]), !0;
-      n[u][h] = !0, a.push([u, h]);
-      for (const [l, m] of c) {
-        const I = u + l, R = h + m;
-        if (f(I, R))
+      if (t[l][h] === 2)
+        return a.push([l, h]), !0;
+      n[l][h] = !0, a.push([l, h]);
+      for (const [p, m] of c) {
+        const I = l + p, R = h + m;
+        if (d(I, R))
           return !0;
       }
       return a.pop(), !1;
     }
-    return f(e, s), a;
+    return d(e, s), a;
   }
 }
 export {
-  Y as Arr,
-  V as ArrQueue,
+  et as Arr,
+  X as ArrQueue,
   O as ArrStack,
-  st as BitPerm,
-  rt as Color,
-  v as DateEx,
-  F as Dictionary,
-  M as Emitter,
-  b as Expression,
-  J as Func,
-  W as Graph,
-  j as LRU,
-  g as Line,
-  Q as LinkedList,
-  S as Matrix,
-  X as MaxHeap,
-  Z as MemoizeMap,
-  q as MinHeap,
-  B as MinStack,
-  y as Num,
-  K as Obj,
-  _ as ObjQueue,
-  G as ObjStack,
-  p as Point,
-  tt as Reg,
-  et as Roman,
-  z as StackApplication,
-  A as Str,
-  $ as TrafficLight,
-  d as Triangle,
+  at as BitPerm,
+  ot as Color,
+  A as DateEx,
+  B as Dictionary,
+  b as Emitter,
+  k as Expression,
+  tt as Func,
+  K as Graph,
+  Y as LRU,
+  y as Line,
+  Z as LinkedList,
+  x as Log,
+  M as Matrix,
+  J as MaxHeap,
+  st as MemoizeMap,
+  H as MinHeap,
+  W as MinStack,
+  f as Num,
+  rt as Obj,
+  Q as ObjQueue,
+  j as ObjStack,
+  u as Point,
+  it as Reg,
+  nt as Roman,
+  U as StackApplication,
+  S as Str,
+  F as TrafficLight,
+  g as Triangle,
   w as Vector
 };