jc-structure 0.2.13 → 0.2.15

package/dist/jc-structure.js

@@ -1,4 +1,34 @@
-class V {
+class G {
+  items = [];
+  head = 0;
+  tail = 0;
+  dequeue() {
+    if (this.isEmpty()) return;
+    const t = this.items[this.head];
+    return this.head++, t;
+  }
+  enqueue(...t) {
+    for (const e of t)
+      Array.isArray(e) ? (this.items.push(...e), this.tail += e.length) : (this.items.push(e), this.tail++);
+    return this;
+  }
+  front() {
+    return this.isEmpty() ? void 0 : this.items[this.head];
+  }
+  isEmpty() {
+    return this.head === this.tail;
+  }
+  size() {
+    return this.tail - this.head;
+  }
+  cleanup() {
+    this.items = [], this.head = 0, this.tail = 0;
+  }
+  toString() {
+    return this.isEmpty() ? "Queue: (0) []" : `Queue: (${this.size()}) [${this.front()} ...]`;
+  }
+}
+class B {
   items = {};
   count = 0;
   lowestCount = 0;
@@ -42,14 +72,43 @@ class V {
   size() {
     return this.count - this.lowestCount;
   }
-  clear() {
+  cleanup() {
     this.items = {}, this.count = 0, this.lowestCount = 0;
   }
   toString() {
-    return this.isEmpty() ? "" : `Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`;
+    return this.isEmpty() ? "Queue: (0) []" : `Queue: (${this.size()}) [${this.front()} ...]`;
   }
 }
-class F {
+class O {
+  _arr;
+  constructor() {
+    this._arr = [];
+  }
+  isEmpty() {
+    return this._arr.length === 0;
+  }
+  cleanup() {
+    this._arr = [];
+  }
+  size() {
+    return this._arr.length;
+  }
+  toString() {
+    return this.isEmpty() ? "Stack: (0) []" : `Stack: (${this.size()}) [${this.peek()}, ...]`;
+  }
+  pop() {
+    return this._arr.pop();
+  }
+  push(...t) {
+    for (const e of t)
+      Array.isArray(e) ? this._arr.push(...e) : this._arr.push(e);
+    return this;
+  }
+  peek() {
+    return this._arr[this._arr.length - 1];
+  }
+}
+class _ {
   items = {};
   count = 0;
   constructor() {
@@ -93,14 +152,14 @@ class F {
   size() {
     return this.count;
   }
-  clear() {
+  cleanup() {
     this.items = {}, this.count = 0;
   }
   toString() {
-    return this.isEmpty() ? "" : `Stack(count: ${this.count}):[${this.items[this.count - 1]},...rest]`;
+    return this.isEmpty() ? "Stack: (0) []" : `Stack: (${this.size()}) [ ${this.peek()} ...]`;
   }
 }
-class _ {
+class X {
   stack = [];
   minStack = [];
   push(t) {
@@ -126,45 +185,16 @@ class _ {
     this.stack = [], this.minStack = [];
   }
   toString() {
-    return this.isEmpty() ? "" : `MinStack(count: ${this.size()}):[${this.getMin()},...rest]`;
+    return this.isEmpty() ? "Stack: (0) []" : `Stack: (${this.size()}) [ ${this.peek()} ...]`;
   }
 }
-class R {
-  _arr;
-  constructor() {
-    this._arr = [];
-  }
-  isEmpty() {
-    return this._arr.length === 0;
-  }
-  clear() {
-    this._arr = [];
-  }
-  size() {
-    return this._arr.length;
-  }
-  toString() {
-    return this.isEmpty() ? "Stack: (0) []" : `Stack: (${this.size()}) [${this.peek()}, ...]`;
-  }
-  pop() {
-    return this._arr.pop();
-  }
-  push(...t) {
-    for (const e of t)
-      Array.isArray(e) ? this._arr.push(...e) : this._arr.push(e);
-    return this;
-  }
-  peek() {
-    return this._arr[this._arr.length - 1];
-  }
-}
-function C(h, t) {
+function T(h, t) {
   return h === t ? 0 : h < t ? -1 : 1;
 }
 class E {
   heap = [];
   compareFn;
-  constructor(t = C) {
+  constructor(t = T) {
     this.compareFn = t;
   }
   static getLeftIndex(t) {
@@ -188,14 +218,14 @@ class E {
   isEmpty() {
     return this.size() === 0;
   }
-  clear() {
+  cleanup() {
     this.heap = [];
   }
   toString() {
     return this.heap.toString();
   }
 }
-class D extends E {
+class F extends E {
   insert(t) {
     return t ? !1 : (this.heap.push(t), this.siftUp(this.heap.length - 1), !0);
   }
@@ -215,15 +245,15 @@ class D extends E {
       E.swap(this.heap, e, t), t = e, e = E.getParentIndex(t);
   }
 }
-class G extends D {
-  constructor(t = (e, s) => C(s, e)) {
+class j extends F {
+  constructor(t = (e, s) => T(s, e)) {
     super(t);
   }
 }
 function U(h) {
   return { value: h };
 }
-class B {
+class Q {
   capacity;
   length = 0;
   head = null;
@@ -256,12 +286,12 @@ class B {
     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);
   }
 }
-class b {
+class N {
   constructor(t, e = null, s = null) {
     this.value = t, this.next = e, this.prev = s;
   }
 }
-class X {
+class W {
   count = 0;
   head = null;
   tail = null;
@@ -320,7 +350,7 @@ class X {
   insert(t, e) {
     if (e < 0 || e > this.count)
       throw new Error(`Index out of bounds: ${e}`);
-    const s = new b(t);
+    const s = new N(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)
@@ -344,7 +374,7 @@ class X {
     return this.count++, !0;
   }
   push(t) {
-    const e = new b(t);
+    const e = new N(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) {
@@ -390,7 +420,7 @@ class X {
   size() {
     return this.count;
   }
-  clear() {
+  cleanup() {
     this.head = null, this.tail = null, this.count = 0;
   }
   toString() {
@@ -416,10 +446,10 @@ class H {
     this.key = t, this.value = e;
   }
 }
-function k(h, t = { emptyString: !1, zeroNumber: !1 }) {
+function C(h, t = { emptyString: !1, zeroNumber: !1 }) {
   return h == null ? !(t.emptyString && h === "" || t.zeroNumber && h === 0) : !1;
 }
-class q {
+class V {
   table = [];
   constructor() {
   }
@@ -430,9 +460,9 @@ class q {
     return -1;
   }
   set(t, e) {
-    if (k(t))
+    if (C(t))
       throw new Error("key is required");
-    if (k(e))
+    if (C(e))
       throw new Error("value is required");
     if (this.has(t)) {
       let s = this.getItemIndex(t);
@@ -479,7 +509,7 @@ class q {
   size() {
     return this.table.length;
   }
-  clear() {
+  cleanup() {
     this.table = [];
   }
   toString() {
@@ -489,12 +519,12 @@ class q {
     return t = t.slice(0, -1), t;
   }
 }
-class j {
+class J {
   isDirected;
   vertices;
   adjList;
   constructor(t = !1) {
-    this.isDirected = t, this.vertices = [], this.adjList = new q();
+    this.isDirected = t, this.vertices = [], this.adjList = new V();
   }
   addVertex(t) {
     this.vertices.includes(t) || (this.vertices.push(t), this.adjList.set(t, []));
@@ -574,10 +604,10 @@ class w {
     return this.mul(-1);
   }
 }
-class I {
+class S {
   _matrix;
   static zero(t, e) {
-    return new I(
+    return new S(
       Array.from({ length: t }, () => Array.from({ length: e }, () => 0))
     );
   }
@@ -618,7 +648,7 @@ class I {
     return this._matrix[t[0]][t[1]] = e, this;
   }
   mul(t) {
-    return new I(this._matrix.map((e) => e.map((s) => s * t)));
+    return new S(this._matrix.map((e) => e.map((s) => s * t)));
   }
   div(t) {
     return this.mul(1 / t);
@@ -626,7 +656,7 @@ class I {
   add(t) {
     if (this.row !== t.row || this.col !== t.col)
       throw new Error("Matrix dimensions do not match");
-    return new I(
+    return new S(
       this._matrix.map(
         (e, s) => e.map((r, i) => r + t.getItem([s, i]))
       )
@@ -644,14 +674,14 @@ class I {
   mulVector(t) {
     if (this.col !== t.dimension)
       throw new Error("Matrix dimensions do not match");
-    return new I(
+    return new S(
       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 = I.zero(this.row, t.col);
+    const e = S.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++)
@@ -672,39 +702,57 @@ class u {
   distanceTo(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, o = e.p1.x, f = e.p1.y, d = e.p2.x, c = e.p2.y, l = (r - n) * (f - c) - (i - a) * (o - d);
-    if (Math.abs(l) < s) return null;
-    const m = ((r - o) * (f - c) - (i - f) * (o - d)) / l, M = -((r - n) * (i - f) - (i - a) * (r - o)) / l;
-    if (m >= 0 && m <= 1 && M >= 0 && M <= 1) {
-      const z = r + m * (n - r), $ = i + m * (a - i);
-      return new u(z, $);
+  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, f = e.p1.y, l = e.p2.x, o = e.p2.y, p = (r - n) * (f - o) - (i - a) * (c - l);
+    if (Math.abs(p) < s) return null;
+    const m = ((r - c) * (f - o) - (i - f) * (c - l)) / p, x = -((r - n) * (i - f) - (i - a) * (r - c)) / p;
+    if (m >= 0 && m <= 1 && x >= 0 && x <= 1) {
+      const P = r + m * (n - r), q = i + m * (a - i);
+      return new u(P, q);
     }
     return null;
   }
   static isIntersecting(t, e) {
-    return g.getIntersection(t, e) !== null;
+    return y.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, o = r * n + i * a, f = n * n + a * a;
-    let d = -1;
-    f > s && (d = o / f);
-    let c, l;
-    d < 0 ? (c = t.p1.x, l = t.p1.y) : d > 1 ? (c = t.p2.x, l = t.p2.y) : (c = t.p1.x + d * n, l = t.p1.y + d * a);
-    const m = e.x - c, M = e.y - l;
-    return Math.hypot(m + M);
+  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, f = n * n + a * a;
+    let l = -1;
+    f > s && (l = c / f);
+    let o, p;
+    l < 0 ? (o = t.p1.x, p = t.p1.y) : l > 1 ? (o = t.p2.x, p = t.p2.y) : (o = t.p1.x + l * n, p = t.p1.y + l * a);
+    const m = e.x - o, x = e.y - p;
+    return Math.hypot(m + x);
   }
   p1;
   p2;
@@ -722,13 +770,13 @@ class g {
   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 u(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 u(e, s);
   }
@@ -739,31 +787,31 @@ class g {
     return this.p2;
   }
 }
-class N {
+class L {
   static EPSILON = 1e-10;
   name;
   constructor(t) {
     this.name = t;
   }
 }
-class p extends N {
+class d extends L {
   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 (!p.isValid(t, e, s))
+    if (!d.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 (!p.isValid(t, e, s))
+    if (!d.isValid(t, e, s))
       throw new Error("Invalid triangle sides");
-    const r = [t, e, s].sort((o, f) => o - f), [i, n, a] = r;
-    return Math.abs(i - n) < p.EPSILON && Math.abs(n - a) < p.EPSILON ? "equilateral" : Math.abs(i - n) < p.EPSILON || Math.abs(n - a) < p.EPSILON ? "isosceles" : "scalene";
+    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";
   }
   static getAngles(t, e, s) {
-    if (!p.isValid(t, e, s))
+    if (!d.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];
@@ -779,7 +827,7 @@ class p extends N {
   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)
-    ) < N.EPSILON;
+    ) < L.EPSILON;
   }
   get side() {
     return [
@@ -789,19 +837,19 @@ class p extends N {
     ];
   }
   perimeter() {
-    return p.isValid(this.side[0], this.side[1], this.side[2]), this.side.reduce((t, e) => t + e, 0);
+    return d.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 p.area(t, e, s);
+    return d.area(t, e, s);
   }
   get type() {
     const [t, e, s] = this.side;
-    return p.getType(t, e, s);
+    return d.getType(t, e, s);
   }
   get angles() {
     const [t, e, s] = this.side;
-    return p.getAngles(t, e, s);
+    return d.getAngles(t, e, s);
   }
   get centroid() {
     return new u(
@@ -815,29 +863,29 @@ class p extends 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) < p.EPSILON)
+    if (Math.abs(t) < d.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 u(e, s);
   }
   containsPoint(t) {
-    const e = p.area(
+    const e = d.area(
       u.distance(t, this.p1),
       u.distance(t, this.p2),
       u.distance(this.p1, this.p2)
-    ), s = p.area(
+    ), s = d.area(
       u.distance(t, this.p2),
       u.distance(t, this.p3),
       u.distance(this.p2, this.p3)
-    ), r = p.area(
+    ), r = d.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()) < p.EPSILON;
+    return Math.abs(e + s + r - this.area()) < d.EPSILON;
   }
 }
-class W {
+class Y {
   static sleep(t) {
     return new Promise((e) => setTimeout(e, t));
   }
@@ -861,7 +909,7 @@ class W {
     return t.prototype.constructor = s, s;
   }
 }
-class Q {
+class Z {
   static groupBy(t, e) {
     if (!e)
       throw new Error("generateKey is required");
@@ -873,8 +921,8 @@ class Q {
           console.warn("Invalid key generated for item:", n);
           continue;
         }
-        const o = r.get(a) ?? [];
-        o.push(n), r.set(a, o);
+        const c = r.get(a) ?? [];
+        c.push(n), r.set(a, c);
       } catch (a) {
         console.error("Error generating key for item:", n, a);
       }
@@ -907,23 +955,23 @@ class Q {
     return e;
   }
 }
-function O(h) {
+function R(h) {
   return h !== null && (typeof h == "object" || typeof h == "function");
 }
-class J {
+class K {
   map = /* @__PURE__ */ new Map();
   weakMap = /* @__PURE__ */ new WeakMap();
   set(t, e) {
-    O(t) ? this.weakMap.set(t, e) : this.map.set(t, e);
+    R(t) ? this.weakMap.set(t, e) : this.map.set(t, e);
   }
   get(t) {
-    return O(t) ? this.weakMap.get(t) : this.map.get(t);
+    return R(t) ? this.weakMap.get(t) : this.map.get(t);
   }
   has(t) {
-    return O(t) ? this.weakMap.has(t) : this.map.has(t);
+    return R(t) ? this.weakMap.has(t) : this.map.has(t);
   }
 }
-class Z {
+class tt {
   static jsonClone(t) {
     try {
       return JSON.parse(JSON.stringify(t));
@@ -942,8 +990,8 @@ class Z {
     if (t instanceof Map) {
       const n = /* @__PURE__ */ new Map();
       e.set(t, n);
-      for (const [a, o] of t)
-        n.set(this.deepClone(a, e), this.deepClone(o, e));
+      for (const [a, c] of t)
+        n.set(this.deepClone(a, e), this.deepClone(c, e));
       return n;
     }
     if (t instanceof Set) {
@@ -956,7 +1004,7 @@ class Z {
     if (Array.isArray(t)) {
       const n = new Array(t.length);
       e.set(t, n);
-      for (let a = 0, o = t.length; a < o; a++)
+      for (let a = 0, c = t.length; a < c; a++)
         n[a] = this.deepClone(t[a], e);
       return n;
     }
@@ -977,8 +1025,8 @@ class Z {
         return new n(t);
     if (typeof t == "function")
       return new Proxy(t, {
-        apply(n, a, o) {
-          return n.apply(a, o);
+        apply(n, a, c) {
+          return n.apply(a, c);
         },
         get(n, a) {
           if (a in n)
@@ -993,40 +1041,40 @@ class Z {
     return r;
   }
 }
-const L = {
+const $ = {
   date: "yyyy-MM-dd",
   datetime: "yyyy-MM-dd HH:mm:ss",
   time: "HH:mm:ss",
   iso: "yyyy-MM-ddTHH:mm:ss.SSS"
 };
-class S {
+class v {
   static defaultOptions = {
     paddingZero: !1,
     locale: "en-US"
   };
   static setDefaultOptions(t) {
-    S.defaultOptions = { ...S.defaultOptions, ...t };
+    v.defaultOptions = { ...v.defaultOptions, ...t };
   }
   static format(t, e, s = {}) {
-    const r = { ...S.defaultOptions, ...s }, i = S.getDateInfo(t, r);
-    return S.normalizeFormatter(e)(i);
+    const r = { ...v.defaultOptions, ...s }, i = v.getDateInfo(t, r);
+    return v.normalizeFormatter(e)(i);
   }
   // 获取日期信息
   static getDateInfo(t, e) {
-    const s = (c, l = 2) => e.paddingZero ? c.toString().padStart(l, "0") : c.toString(), r = t.getFullYear(), i = t.getMonth() + 1, n = t.getDate(), a = t.getHours(), o = t.getMinutes(), f = t.getSeconds(), d = t.getMilliseconds();
+    const s = (o, p = 2) => e.paddingZero ? o.toString().padStart(p, "0") : o.toString(), r = t.getFullYear(), i = t.getMonth() + 1, n = t.getDate(), a = t.getHours(), c = t.getMinutes(), f = t.getSeconds(), l = t.getMilliseconds();
     return {
       year: r,
       month: i,
       day: n,
       hour: a,
-      minute: o,
+      minute: c,
       second: f,
-      millisecond: d,
+      millisecond: l,
       yyyy: s(r, 4),
       MM: s(i),
       dd: s(n),
       HH: s(a),
-      mm: s(o),
+      mm: s(c),
       ss: s(f)
     };
   }
@@ -1035,7 +1083,7 @@ class S {
       return t;
     if (typeof t != "string")
       throw new Error("Formatter must be a string or function");
-    t in L && (t = L[t]);
+    t in $ && (t = $[t]);
     const e = {
       yyyy: "yyyy",
       MM: "MM",
@@ -1056,11 +1104,11 @@ class S {
     };
   }
   static formatRelative(t, e = /* @__PURE__ */ new Date()) {
-    const s = t.getTime() - e.getTime(), r = Math.abs(s), i = Math.floor(r / 1e3), n = Math.floor(i / 60), a = Math.floor(n / 60), o = Math.floor(a / 24);
-    return o > 0 ? s > 0 ? `${o}天后` : `${o}天前` : a > 0 ? s > 0 ? `${a}小时后` : `${a}小时前` : n > 0 ? s > 0 ? `${n}分钟后` : `${n}分钟前` : s > 0 ? "刚刚" : "";
+    const s = t.getTime() - e.getTime(), r = Math.abs(s), i = Math.floor(r / 1e3), n = Math.floor(i / 60), a = Math.floor(n / 60), c = Math.floor(a / 24);
+    return c > 0 ? s > 0 ? `${c}天后` : `${c}天前` : a > 0 ? s > 0 ? `${a}小时后` : `${a}小时前` : n > 0 ? s > 0 ? `${n}分钟后` : `${n}分钟前` : s > 0 ? "刚刚" : "";
   }
 }
-class T {
+class z {
   lights;
   currentIndex;
   switchTime;
@@ -1070,7 +1118,7 @@ class T {
     { color: "green", latest: 10 },
     { color: "yellow", latest: 3 }
   ];
-  constructor(t = T.DEFAULT_LIGHTS) {
+  constructor(t = z.DEFAULT_LIGHTS) {
     this.lights = t, this.currentIndex = 0, this.switchTime = Date.now();
   }
   render(t) {
@@ -1095,12 +1143,21 @@ class T {
     };
   }
 }
-class Y {
+class et {
   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 K {
+class st {
   static ROMAN_MAP = /* @__PURE__ */ new Map([
     ["M", 1e3],
     ["CM", 900],
@@ -1129,10 +1186,10 @@ class K {
       if (this.ROMAN_MAP.has(n))
         s += this.ROMAN_MAP.get(n), r += 2;
       else {
-        const a = t[r], o = this.ROMAN_MAP.get(a);
-        if (!o)
+        const a = t[r], c = this.ROMAN_MAP.get(a);
+        if (!c)
           throw new Error(`Invalid Roman numeral sequence at position ${r}`);
-        s += o, r += 1;
+        s += c, r += 1;
       }
     }
     if (this.toRoman(s) !== t)
@@ -1151,7 +1208,13 @@ class K {
     return e;
   }
 }
-class y {
+class g {
+  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");
@@ -1159,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 g.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 g.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 g.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 (g.handleNumRange(t, !0, 0, 1e3), t < 2)
       return 1;
     let e = 1;
     for (let s = 2; s <= t; s++)
@@ -1179,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 g.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 (g.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];
@@ -1192,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 (g.handleNumRange(e, !0, 0, 10), g.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 (g.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;
@@ -1214,19 +1277,19 @@ class y {
       return [];
     if (e < 0 || !Number.isInteger(e))
       throw new Error("Precision must be a non-negative integer");
-    const s = t.reduce((c, l) => c + l, 0);
+    const s = t.reduce((o, p) => o + p, 0);
     if (s === 0)
       return t.map(() => "0%");
-    const i = 100 * Math.pow(10, e), n = t.map((c) => c / s * i), a = n.map((c) => Math.floor(c)), o = n.map((c, l) => c - a[l]);
-    let f = a.reduce((c, l) => c + l, 0), d = i - f;
-    for (; d > 0; ) {
-      let c = -1, l = -1;
-      for (let m = 0; m < o.length; m++)
-        o[m] > l && (l = o[m], c = m);
-      if (c === -1) break;
-      a[c]++, o[c] = 0, d--;
+    const i = 100 * Math.pow(10, e), n = t.map((o) => o / s * i), a = n.map((o) => Math.floor(o)), c = n.map((o, p) => o - a[p]);
+    let f = a.reduce((o, p) => o + p, 0), l = i - f;
+    for (; l > 0; ) {
+      let o = -1, p = -1;
+      for (let m = 0; m < c.length; m++)
+        c[m] > p && (p = c[m], o = m);
+      if (o === -1) break;
+      a[o]++, c[o] = 0, l--;
     }
-    return a.map((c) => `${(c / i * 100).toFixed(e)}%`);
+    return a.map((o) => `${(o / i * 100).toFixed(e)}%`);
   }
   static gcd(t, e) {
     return e === 0 ? t : this.gcd(e, t % e);
@@ -1241,9 +1304,11 @@ class y {
     return t % 2 === 1 || t % 2 === -1;
   }
   static isPrime(t) {
-    if (t <= 1)
+    if (g.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;
@@ -1318,8 +1383,18 @@ class y {
     const r = e[1] - e[0];
     return (t - e[0]) * ((s[1] - s[0]) / r) + s[0];
   }
+  static getPythagoreanTriple(t) {
+    if (t <= 0 || !Number.isInteger(t))
+      throw new Error("n must be a positive integer");
+    if (g.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];
+  }
 }
-class tt {
+class rt {
   static READ = 1;
   static WRITE = 2;
   static SHARE = 4;
@@ -1338,7 +1413,7 @@ class tt {
     return t ^ e;
   }
 }
-class v {
+class M {
   static frequencyStatistics(t) {
     return [...t].reduce(
       (e, s) => (e[s] = (e[s] || 0) + 1, e),
@@ -1407,7 +1482,7 @@ class v {
     return e;
   }
   static pointAt(t, e) {
-    if (e >= v.pointLength(t)) return;
+    if (e >= M.pointLength(t)) return;
     let s = 0;
     for (let r = 0, i = t.length; r < i; ) {
       const n = t.codePointAt(r);
@@ -1417,10 +1492,10 @@ class v {
       r += n > 65535 ? 2 : 1, s++;
     }
   }
-  static sliceByPoint(t, e, s = v.pointLength(t)) {
+  static sliceByPoint(t, e, s = M.pointLength(t)) {
     let r = "";
     for (let i = e; i < s; i++)
-      r += v.pointAt(t, i);
+      r += M.pointAt(t, i);
     return r;
   }
   static capitalize(t) {
@@ -1430,10 +1505,10 @@ class v {
     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, "") === v.reverse(t);
+    return t.toLowerCase().replace(/[^a-z0-9]/g, "") === M.reverse(t);
   }
   static count(t, e) {
     const s = e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
@@ -1446,7 +1521,7 @@ class v {
     return t.replace(/[A-Z]/g, (e) => `_${e.toLowerCase()}`);
   }
 }
-class et {
+class it {
   static isValidHex(t) {
     return /^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/.test(t);
   }
@@ -1454,7 +1529,28 @@ class et {
     return /^rgb\((\d{1,3}),\s*(\d{1,3}),\s*(\d{1,3})\)$/.test(t);
   }
 }
-const x = {
+class A {
+  static basePriunt(t, e = {}) {
+    const { title: s = "", color: r = "#909399", fontSize: i = "16px" } = e, n = s ? `background-color:${r};border:1px solid ${r};border-radius:3px 0 0 3px;padding:5px;color:#fff;font-size:${i};font-weight:bold;line-height:1.5;` : "", a = `border:1px solid ${r};color:${r};font-size:${i};padding:5px;border-radius:0 3px 3px 0;padding-right:30px;line-height:1.5;`;
+    console.log(`%c ${s} %c ${t}`, n, a);
+  }
+  static success(t) {
+    return A.basePriunt(t, { title: "success", color: "#67C23A" });
+  }
+  static error(t) {
+    return A.basePriunt(t, { title: "error", color: "#F56C6C" });
+  }
+  static warning(t) {
+    return A.basePriunt(t, { title: "warning", color: "#E6A23C" });
+  }
+  static normal(t) {
+    return A.basePriunt(t, { title: "normal", color: "#909399" });
+  }
+  static primary(t) {
+    return A.basePriunt(t, { title: "primary", color: "#409EFF" });
+  }
+}
+const I = {
   AUTH_UNAUTHORIZED: "未授权事件",
   AUTH_LOGIN_SUCCESS: "登录成功事件",
   AUTH_LOGOUT: "注销事件",
@@ -1466,37 +1562,37 @@ const x = {
   UI_HIDE_LOADING: "隐藏加载事件",
   UI_SHOW_MESSAGE: "显示消息事件"
 };
-class A {
+class b {
   static instance = null;
   listeners = {};
   debugMode;
   constructor(t = !1) {
-    this.debugMode = t, Object.keys(x).forEach(
+    this.debugMode = t, Object.keys(I).forEach(
       (e) => {
         this.listeners[e] = /* @__PURE__ */ new Set();
       }
     );
   }
   static getInstance(t) {
-    return A.instance || (A.instance = new A(t)), A.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(`添加事件监听: ${I[t]}`), this.listeners[t].add(e);
   }
   emit(t, e) {
-    this.debugLog(`触发事件: ${x[t]}`, e), this.listeners[t].forEach((s) => {
+    this.debugLog(`触发事件: ${I[t]}`, e), this.listeners[t].forEach((s) => {
       try {
         s(e);
       } catch (r) {
-        console.error(`事件 ${x[t]} 处理出错:`, r);
+        console.error(`事件 ${I[t]} 处理出错:`, r);
       }
     });
   }
   off(t, e) {
-    this.debugLog(`移除事件监听: ${x[t]}`), this.listeners[t].delete(e);
+    this.debugLog(`移除事件监听: ${I[t]}`), this.listeners[t].delete(e);
   }
   once(t, e) {
-    this.debugLog(`添加一次性事件监听: ${x[t]}`);
+    this.debugLog(`添加一次性事件监听: ${I[t]}`);
     const s = (r) => {
       e(r), this.off(t, s);
     };
@@ -1512,7 +1608,7 @@ class A {
     this.debugMode && console.log(`[EventEmitter] ${t}`, e || "");
   }
 }
-class P {
+class k {
   //#region private static members
   static OPERATORS = /* @__PURE__ */ new Set(["+", "-", "*", "/"]);
   static VALID_CHARS_REG = /^[0-9+\-*/().\s]+$/;
@@ -1576,7 +1672,7 @@ class P {
   static EXPRESSION_REG = new RegExp("(?<!\\d)-?\\d*\\.?\\d+|[+\\-*/()]", "g");
   static toArr(t) {
     this.validateExpression(t);
-    const e = t.match(P.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) => {
@@ -1588,7 +1684,7 @@ class P {
   static infixToPostfix(t) {
     if (!t?.trim())
       throw new Error("Expression cannot be empty");
-    const e = new R(), s = this.toArr(t);
+    const e = new O(), s = this.toArr(t);
     console.log(s);
     const r = [];
     for (const i of s)
@@ -1605,8 +1701,8 @@ class P {
   static evaluatePostfix(t) {
     if (!t.length)
       throw new Error("Postfix expression cannot be empty");
-    typeof t == "string" && (t = P.toArr(t));
-    const e = new R();
+    typeof t == "string" && (t = k.toArr(t));
+    const e = new O();
     for (const s of t)
       if (this.FLOAT_NUM_REG.test(s))
         e.push(parseFloat(s));
@@ -1619,12 +1715,21 @@ class P {
     return e.pop() ?? 0;
   }
 }
-class st {
+class D {
   static isMatchingPair(t, e) {
     return t === "(" && e === ")" || t === "{" && e === "}" || t === "[" && e === "]";
   }
+  static arr_2d_init(t, e, s = !1) {
+    return typeof s == "boolean" ? Array.from(
+      { length: t },
+      () => Array(e).fill(s)
+    ) : Array.from(
+      { length: t },
+      () => Array(e).fill(s)
+    );
+  }
   static isvalidBrackets(t) {
-    const e = new R();
+    const e = new O();
     for (let s = 0, r = t.length; s < r; s++) {
       const i = t[s];
       if (["{", "[", "("].includes(i))
@@ -1639,36 +1744,60 @@ class st {
     }
     return e.isEmpty();
   }
+  static findPath(t, e, s) {
+    const r = t.length, i = t[0].length, n = D.arr_2d_init(r, i, !1), a = new O(), c = [
+      [-1, 0],
+      [0, 1],
+      [1, 0],
+      [0, -1]
+    ];
+    function f(l, o) {
+      if (l < 0 || l >= r || o < 0 || o >= i || t[l][o] === 1 || n[l][o])
+        return !1;
+      if (t[l][o] === 2)
+        return a.push([l, o]), !0;
+      n[l][o] = !0, a.push([l, o]);
+      for (const [p, m] of c) {
+        const x = l + p, P = o + m;
+        if (f(x, P))
+          return !0;
+      }
+      return a.pop(), !1;
+    }
+    return f(e, s), a;
+  }
 }
 export {
-  Q as Arr,
-  R as ArrStack,
-  tt as BitPerm,
-  et as Color,
-  S as DateEx,
-  q as Dictionary,
-  A as Emitter,
-  P as Expression,
-  W as Func,
-  j as Graph,
-  B as LRU,
-  g as Line,
-  X as LinkedList,
-  I as Matrix,
-  G as MaxHeap,
-  J as MemoizeMap,
-  D as MinHeap,
-  _ as MinStack,
-  y as Num,
-  Z as Obj,
+  Z as Arr,
+  G as ArrQueue,
+  O as ArrStack,
+  rt as BitPerm,
+  it as Color,
+  v as DateEx,
+  V as Dictionary,
+  b as Emitter,
+  k as Expression,
+  Y as Func,
+  J as Graph,
+  Q as LRU,
+  y as Line,
+  W as LinkedList,
+  A as Log,
+  S as Matrix,
+  j as MaxHeap,
+  K as MemoizeMap,
+  F as MinHeap,
+  X as MinStack,
+  g as Num,
+  tt as Obj,
+  B as ObjQueue,
+  _ as ObjStack,
   u as Point,
-  V as Queue,
-  Y as Reg,
-  K as Roman,
-  F as Stack,
-  st as StackApplication,
-  v as Str,
-  T as TrafficLight,
-  p as Triangle,
+  et as Reg,
+  st as Roman,
+  D as StackApplication,
+  M as Str,
+  z as TrafficLight,
+  d as Triangle,
   w as Vector
 };