jc-structure 0.2.13 → 0.2.14

package/dist/jc-structure.js

@@ -1,4 +1,34 @@
 class V {
+  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 _ {
   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 G {
   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 B {
   stack = [];
   minStack = [];
   push(t) {
@@ -126,45 +185,16 @@ class _ {
     this.stack = [], this.minStack = [];
   }
   toString() {
-    return this.isEmpty() ? "" : `MinStack(count: ${this.size()}):[${this.getMin()},...rest]`;
-  }
-}
-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];
+    return this.isEmpty() ? "Stack: (0) []" : `Stack: (${this.size()}) [ ${this.peek()} ...]`;
   }
 }
-function C(h, t) {
-  return h === t ? 0 : h < t ? -1 : 1;
+function T(o, t) {
+  return o === t ? 0 : o < 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 q 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 X extends q {
+  constructor(t = (e, s) => T(s, e)) {
     super(t);
   }
 }
-function U(h) {
-  return { value: h };
+function U(o) {
+  return { value: o };
 }
-class B {
+class j {
   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 k {
   constructor(t, e = null, s = null) {
     this.value = t, this.next = e, this.prev = s;
   }
 }
-class X {
+class Q {
   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 k(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 k(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 }) {
-  return h == null ? !(t.emptyString && h === "" || t.zeroNumber && h === 0) : !1;
+function N(o, t = { emptyString: !1, zeroNumber: !1 }) {
+  return o == null ? !(t.emptyString && o === "" || t.zeroNumber && o === 0) : !1;
 }
-class q {
+class F {
   table = [];
   constructor() {
   }
@@ -430,9 +460,9 @@ class q {
     return -1;
   }
   set(t, e) {
-    if (k(t))
+    if (N(t))
       throw new Error("key is required");
-    if (k(e))
+    if (N(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 W {
   isDirected;
   vertices;
   adjList;
   constructor(t = !1) {
-    this.isDirected = t, this.vertices = [], this.adjList = new q();
+    this.isDirected = t, this.vertices = [], this.adjList = new F();
   }
   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++)
@@ -660,7 +690,7 @@ class I {
     return e;
   }
 }
-class u {
+class p {
   static distance(t, e) {
     return Math.hypot(e.x - t.x, e.y - t.y);
   }
@@ -670,7 +700,7 @@ class u {
     this.x = t, this.y = e;
   }
   distanceTo(t) {
-    return u.distance(this, t);
+    return p.distance(this, t);
   }
 }
 class g {
@@ -685,12 +715,12 @@ class g {
   }
   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);
+    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 - 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, $);
+    const m = ((r - c) * (f - h) - (i - f) * (c - u)) / l, I = -((r - n) * (i - f) - (i - a) * (r - c)) / l;
+    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);
     }
     return null;
   }
@@ -698,13 +728,13 @@ class g {
     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, 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);
+    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 Math.hypot(m + I);
   }
   p1;
   p2;
@@ -717,7 +747,7 @@ class g {
   }
   get midpoint() {
     const t = (this.p1.x + this.p2.x) / 2, e = (this.p1.y + this.p2.y) / 2;
-    return new u(t, e);
+    return new p(t, e);
   }
   get angle() {
     return Math.atan2(this.p2.y - this.p1.y, this.p2.x - this.p1.x);
@@ -728,9 +758,9 @@ class g {
   }
   get direction() {
     const t = this.length;
-    if (t < g.EPSILON) return new u(0, 0);
+    if (t < g.EPSILON) return new p(0, 0);
     const e = (this.p2.x - this.p1.x) / t, s = (this.p2.y - this.p1.y) / t;
-    return new u(e, s);
+    return new p(e, s);
   }
   get start() {
     return this.p1;
@@ -739,31 +769,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,65 +809,65 @@ 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 [
-      u.distance(this.p1, this.p2),
-      u.distance(this.p2, this.p3),
-      u.distance(this.p3, this.p1)
+      p.distance(this.p1, this.p2),
+      p.distance(this.p2, this.p3),
+      p.distance(this.p3, this.p1)
     ];
   }
   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(
+    return new p(
       (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 u(i, n);
+    return new p(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) < 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);
+    return new p(e, s);
   }
   containsPoint(t) {
-    const e = p.area(
-      u.distance(t, this.p1),
-      u.distance(t, this.p2),
-      u.distance(this.p1, this.p2)
-    ), s = p.area(
-      u.distance(t, this.p2),
-      u.distance(t, this.p3),
-      u.distance(this.p2, this.p3)
-    ), r = p.area(
-      u.distance(t, this.p3),
-      u.distance(t, this.p1),
-      u.distance(this.p3, this.p1)
+    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)
     );
-    return Math.abs(e + s + r - this.area()) < p.EPSILON;
+    return Math.abs(e + s + r - this.area()) < d.EPSILON;
   }
 }
-class W {
+class J {
   static sleep(t) {
     return new Promise((e) => setTimeout(e, t));
   }
@@ -861,7 +891,7 @@ class W {
     return t.prototype.constructor = s, s;
   }
 }
-class Q {
+class Y {
   static groupBy(t, e) {
     if (!e)
       throw new Error("generateKey is required");
@@ -873,8 +903,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 +937,23 @@ class Q {
     return e;
   }
 }
-function O(h) {
-  return h !== null && (typeof h == "object" || typeof h == "function");
+function P(o) {
+  return o !== null && (typeof o == "object" || typeof o == "function");
 }
-class J {
+class Z {
   map = /* @__PURE__ */ new Map();
   weakMap = /* @__PURE__ */ new WeakMap();
   set(t, e) {
-    O(t) ? this.weakMap.set(t, e) : this.map.set(t, e);
+    P(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 P(t) ? this.weakMap.get(t) : this.map.get(t);
   }
   has(t) {
-    return O(t) ? this.weakMap.has(t) : this.map.has(t);
+    return P(t) ? this.weakMap.has(t) : this.map.has(t);
   }
 }
-class Z {
+class K {
   static jsonClone(t) {
     try {
       return JSON.parse(JSON.stringify(t));
@@ -942,8 +972,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 +986,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 +1007,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 +1023,40 @@ class Z {
     return r;
   }
 }
-const L = {
+const C = {
   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 = (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();
     return {
       year: r,
       month: i,
       day: n,
       hour: a,
-      minute: o,
+      minute: c,
       second: f,
-      millisecond: d,
+      millisecond: u,
       yyyy: s(r, 4),
       MM: s(i),
       dd: s(n),
       HH: s(a),
-      mm: s(o),
+      mm: s(c),
       ss: s(f)
     };
   }
@@ -1035,7 +1065,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 C && (t = C[t]);
     const e = {
       yyyy: "yyyy",
       MM: "MM",
@@ -1056,11 +1086,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 $ {
   lights;
   currentIndex;
   switchTime;
@@ -1070,7 +1100,7 @@ class T {
     { color: "green", latest: 10 },
     { color: "yellow", latest: 3 }
   ];
-  constructor(t = T.DEFAULT_LIGHTS) {
+  constructor(t = $.DEFAULT_LIGHTS) {
     this.lights = t, this.currentIndex = 0, this.switchTime = Date.now();
   }
   render(t) {
@@ -1095,12 +1125,12 @@ class T {
     };
   }
 }
-class Y {
+class tt {
   static escape(t) {
     return t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
   }
 }
-class K {
+class et {
   static ROMAN_MAP = /* @__PURE__ */ new Map([
     ["M", 1e3],
     ["CM", 900],
@@ -1129,10 +1159,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)
@@ -1214,19 +1244,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((h, l) => h + l, 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((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;
+      for (let m = 0; m < c.length; m++)
+        c[m] > l && (l = c[m], h = m);
+      if (h === -1) break;
+      a[h]++, c[h] = 0, u--;
     }
-    return a.map((c) => `${(c / i * 100).toFixed(e)}%`);
+    return a.map((h) => `${(h / i * 100).toFixed(e)}%`);
   }
   static gcd(t, e) {
     return e === 0 ? t : this.gcd(e, t % e);
@@ -1318,8 +1348,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 (y.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 st {
   static READ = 1;
   static WRITE = 2;
   static SHARE = 4;
@@ -1338,7 +1378,7 @@ class tt {
     return t ^ e;
   }
 }
-class v {
+class A {
   static frequencyStatistics(t) {
     return [...t].reduce(
       (e, s) => (e[s] = (e[s] || 0) + 1, e),
@@ -1407,7 +1447,7 @@ class v {
     return e;
   }
   static pointAt(t, e) {
-    if (e >= v.pointLength(t)) return;
+    if (e >= A.pointLength(t)) return;
     let s = 0;
     for (let r = 0, i = t.length; r < i; ) {
       const n = t.codePointAt(r);
@@ -1417,10 +1457,10 @@ class v {
       r += n > 65535 ? 2 : 1, s++;
     }
   }
-  static sliceByPoint(t, e, s = v.pointLength(t)) {
+  static sliceByPoint(t, e, s = A.pointLength(t)) {
     let r = "";
     for (let i = e; i < s; i++)
-      r += v.pointAt(t, i);
+      r += A.pointAt(t, i);
     return r;
   }
   static capitalize(t) {
@@ -1433,7 +1473,7 @@ class v {
     return t.length <= e ? this : 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, "") === A.reverse(t);
   }
   static count(t, e) {
     const s = e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
@@ -1446,7 +1486,7 @@ class v {
     return t.replace(/[A-Z]/g, (e) => `_${e.toLowerCase()}`);
   }
 }
-class et {
+class rt {
   static isValidHex(t) {
     return /^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/.test(t);
   }
@@ -1466,7 +1506,7 @@ const x = {
   UI_HIDE_LOADING: "隐藏加载事件",
   UI_SHOW_MESSAGE: "显示消息事件"
 };
-class A {
+class M {
   static instance = null;
   listeners = {};
   debugMode;
@@ -1478,7 +1518,7 @@ class A {
     );
   }
   static getInstance(t) {
-    return A.instance || (A.instance = new A(t)), A.instance;
+    return M.instance || (M.instance = new M(t)), M.instance;
   }
   on(t, e) {
     this.debugLog(`添加事件监听: ${x[t]}`), this.listeners[t].add(e);
@@ -1512,7 +1552,7 @@ class A {
     this.debugMode && console.log(`[EventEmitter] ${t}`, e || "");
   }
 }
-class P {
+class b {
   //#region private static members
   static OPERATORS = /* @__PURE__ */ new Set(["+", "-", "*", "/"]);
   static VALID_CHARS_REG = /^[0-9+\-*/().\s]+$/;
@@ -1576,7 +1616,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(b.EXPRESSION_REG);
     if (!e)
       throw new Error("Invalid expression format");
     return e.filter((s) => s.trim() !== "").map((s) => {
@@ -1588,7 +1628,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 +1645,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 = b.toArr(t));
+    const e = new O();
     for (const s of t)
       if (this.FLOAT_NUM_REG.test(s))
         e.push(parseFloat(s));
@@ -1619,12 +1659,21 @@ class P {
     return e.pop() ?? 0;
   }
 }
-class st {
+class z {
   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 +1688,59 @@ class st {
     }
     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 = [
+      [-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])
+        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))
+          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,
+  Y as Arr,
+  V 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,
-  X as LinkedList,
-  I as Matrix,
-  G as MaxHeap,
-  J as MemoizeMap,
-  D as MinHeap,
-  _ as MinStack,
+  Q as LinkedList,
+  S as Matrix,
+  X as MaxHeap,
+  Z as MemoizeMap,
+  q as MinHeap,
+  B as MinStack,
   y as Num,
-  Z as Obj,
-  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,
+  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,
   w as Vector
 };

package/dist/jc-structure.umd.cjs

@@ -1,2 +1,2 @@
-(function(o,O){typeof exports=="object"&&typeof module<"u"?O(exports):typeof define=="function"&&define.amd?define(["exports"],O):(o=typeof globalThis<"u"?globalThis:o||self,O(o["jc-structure"]={}))})(this,(function(o){"use strict";class O{items={};count=0;lowestCount=0;constructor(){}dequeue(){if(this.isEmpty())return;const t=this.items[this.lowestCount];return delete this.items[this.lowestCount],this.lowestCount++,t}enqueue(...t){if(t.length===0)return this;if(t.length===1){const e=t[0];return Array.isArray(e)?this.batchEnqueue(e):this.enqueueItem(e)}for(const e of t)Array.isArray(e)?this.batchEnqueue(e):this.enqueueItem(e);return this}batchEnqueue(t){return t.filter(s=>this.isValidItem(s)).forEach(s=>{this.isValidItem(s)&&(this.items[this.count]=s,this.count++)}),this}enqueueItem(t){if(!this.isValidItem(t))throw new Error("Invalid item");return this.items[this.count]=t,this.count++,this}isValidItem(t){return t!=null}front(){return this.isEmpty()?void 0:this.items[this.lowestCount]}isEmpty(){return this.size()===0}size(){return this.count-this.lowestCount}clear(){this.items={},this.count=0,this.lowestCount=0}toString(){return this.isEmpty()?"":`Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`}}class U{items={};count=0;constructor(){}pop(){if(this.isEmpty())return;this.count--;const t=this.items[this.count];return delete this.items[this.count],t}push(...t){if(t.length===0)return this;if(t.length===1){const e=t[0];return Array.isArray(e)?this.addItems(e):this.addItem(e)}for(const e of t)Array.isArray(e)?this.addItems(e):this.addItem(e);return this}addItem(t){if(!this.isValidItem(t))throw new Error("Invalid item: item cannot be null or undefined");return this.items[this.count]=t,this.count++,this}addItems(t){return t.filter(s=>this.isValidItem(s)).forEach(s=>{this.items[this.count]=s,this.count++}),this}isValidItem(t){return t!=null}peek(){return this.isEmpty()?void 0:this.items[this.count-1]}isEmpty(){return this.count===0}size(){return this.count}clear(){this.items={},this.count=0}toString(){return this.isEmpty()?"":`Stack(count: ${this.count}):[${this.items[this.count-1]},...rest]`}}class V{stack=[];minStack=[];push(t){this.stack.push(t),(this.minStack.length===0||t<=this.minStack[this.minStack.length-1])&&this.minStack.push(t)}pop(){const t=this.stack.pop();return t===this.minStack[this.minStack.length-1]&&this.minStack.pop(),t}peek(){return this.stack[this.stack.length-1]}getMin(){return this.minStack[this.minStack.length-1]}isEmpty(){return this.size()===0}size(){return this.stack.length}clear(){this.stack=[],this.minStack=[]}toString(){return this.isEmpty()?"":`MinStack(count: ${this.size()}):[${this.getMin()},...rest]`}}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 N(h,t){return h===t?0:h<t?-1:1}class I{heap=[];compareFn;constructor(t=N){this.compareFn=t}static getLeftIndex(t){return 2*t+1}static getRightIndex(t){return 2*t+2}static getParentIndex(t){return t===0?void 0:Math.floor((t-1)/2)}static swap(t,e,s){[t[e],t[s]]=[t[s],t[e]]}find(){return this.isEmpty()?void 0:this.heap[0]}size(){return this.heap.length}isEmpty(){return this.size()===0}clear(){this.heap=[]}toString(){return this.heap.toString()}}class C extends I{insert(t){return t?!1:(this.heap.push(t),this.siftUp(this.heap.length-1),!0)}extract(){if(this.isEmpty())return;if(this.heap.length===1)return this.heap.shift();const t=this.heap[0];return this.heap[0]=this.heap.pop(),this.siftDown(0),t}siftUp(t){let e=t,s=I.getLeftIndex(e),r=I.getRightIndex(e),i=this.size();s<i&&this.compareFn(this.heap[e],this.heap[s])===-1&&(e=s),r<i&&this.compareFn(this.heap[e],this.heap[r])===1&&(e=r),e!==t&&(I.swap(this.heap,t,e),this.siftUp(e))}siftDown(t){let e=I.getParentIndex(t);for(;t>0&&e&&this.compareFn(this.heap[e],this.heap[t])===1;)I.swap(this.heap,e,t),t=e,e=I.getParentIndex(t)}}class q extends C{constructor(t=(e,s)=>N(s,e)){super(t)}}function F(h){return{value:h}}class _{capacity;length=0;head=null;tail=null;lookup=new Map;reverseLookup=new Map;constructor(t=10){this.capacity=t}prepend(t){this.head?(t.next=this.head,this.head.prev=t,this.head=t):this.head=this.tail=t}detach(t){t.prev&&(t.prev.next=t.next),t.next&&(t.next.prev=t.prev),this.head===t&&(this.head=this.head.next||null),this.tail===t&&(this.tail=this.tail.prev||null),t.next=void 0,t.prev=void 0}trimCache(){if(this.length<=this.capacity)return;const t=this.tail;this.detach(t);const e=this.reverseLookup.get(t);this.lookup.delete(e),this.reverseLookup.delete(t),this.length--}get(t){const e=this.lookup.get(t);if(e)return this.detach(e),this.prepend(e),e.value}update(t,e){let s=this.lookup.get(t);s?(this.detach(s),this.prepend(s),s.value=e):(s=F(e),this.length++,this.prepend(s),this.trimCache(),this.lookup.set(t,s),this.reverseLookup)}}class T{constructor(t,e=null,s=null){this.value=t,this.next=e,this.prev=s}}class G{count=0;head=null;tail=null;constructor(t){t&&t.forEach(e=>this.push(e))}[Symbol.iterator](){let t=this.head;return{next(){if(t){const e=t.value;return t=t.next,{value:e,done:!1}}return{value:void 0,done:!0}}}}equals(t,e){if(t===e)return!0;if(t==null||e==null)return!1;if(typeof t=="object"&&typeof e=="object"){if(t.equals&&typeof t.equals=="function")return t.equals(e);const s=Object.keys(t),r=Object.keys(e);return s.length!==r.length?!1:s.every(i=>t[i]===e[i])}return!1}indexOf(t){let e=this.head,s=0;for(;e;){if(this.equals(e.value,t))return s;s++,e=e.next}return-1}getElementAt(t){if(t<0||t>=this.count)return null;if(t>this.count/2){let s=this.tail,r=this.count-1;for(;r>t&&s;)s=s.prev,r--;return s}let e=this.head;for(let s=0;s<t&&e;s++)e=e.next;return e}getValueAt(t){return this.getElementAt(t)?.value}insert(t,e){if(e<0||e>this.count)throw new Error(`Index out of bounds: ${e}`);const s=new T(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)s.prev=this.tail,this.tail&&(this.tail.next=s),this.tail=s;else{let r;if(e<this.count/2){r=this.head;for(let i=0;i<e-1&&r;i++)r=r.next}else{r=this.tail;for(let i=this.count-1;i>e-1&&r;i--)r=r.prev}if(r){const i=r.next;s.prev=r,s.next=i,r.next=s,i&&(i.prev=s)}}return this.count++,!0}push(t){const e=new T(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){let e=this.head,s=this.tail,r=0,i=this.count-1;for(;e&&s;){if(this.equals(e.value,t))return this.removeAt(r);if(this.equals(s.value,t))return this.removeAt(i);if(e=e.next,s=s.prev,r++,i--,r>i)break}return null}removeAt(t){if(t<0||t>=this.count)return null;let e;if(t===0)e=this.head,e&&(this.head=e.next,this.head&&(this.head.prev=null),this.count===1&&(this.tail=null));else if(t===this.count-1)e=this.tail,e&&(this.tail=e.prev,this.tail&&(this.tail.next=null),this.count===1&&(this.head=null));else{if(t<this.count/2){e=this.head;for(let s=0;s<t&&e;s++)e=e.next}else{e=this.tail;for(let s=this.count-1;s>t&&e;s--)e=e.prev}if(e){const s=e.prev,r=e.next;s&&(s.next=r),r&&(r.prev=s)}}return this.count--,e?.value||null}isEmpty(){return this.count===0}size(){return this.count}clear(){this.head=null,this.tail=null,this.count=0}toString(){if(this.isEmpty())return"";let t="",e=this.head;for(;e;)t+=JSON.stringify(e.value),e.next&&(t+=","),e=e.next;return t}toArray(){const t=[];let e=this.head;for(;e;)t.push(e.value),e=e.next;return t}}class B{key;value;constructor(t,e){this.key=t,this.value=e}}function z(h,t={emptyString:!1,zeroNumber:!1}){return h==null?!(t.emptyString&&h===""||t.zeroNumber&&h===0):!1}class ${table=[];constructor(){}getItemIndex(t){for(let e=0,s=this.table.length;e<s;e++)if(this.table[e].key===t)return e;return-1}set(t,e){if(z(t))throw new Error("key is required");if(z(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 B(t,e);this.table.push(s)}}remove(t){if(this.has(t)){let e=this.getItemIndex(t);return this.table.splice(e,1)[0]}}has(t){return this.getItemIndex(t)!==-1}get(t){if(this.has(t)){let e=this.getItemIndex(t);return this.table[e]}}keys(){return this.table.map(t=>t.key)}values(){return this.table.map(t=>t.value)}keyValues(){return this.table.map(t=>[t.key,t.value])}forEach(t){for(let e=0,s=this.size();e<s;e++){let r=this.table[e];if(!t(r.key,r.value))break}}isEmpty(){return!this.size()}size(){return this.table.length}clear(){this.table=[]}toString(){let t="";for(let e=0,s=this.table.length;e<s;e++)t+=this.table[e].toString(),t+=",";return t=t.slice(0,-1),t}}class j{isDirected;vertices;adjList;constructor(t=!1){this.isDirected=t,this.vertices=[],this.adjList=new $}addVertex(t){this.vertices.includes(t)||(this.vertices.push(t),this.adjList.set(t,[]))}addEdge(t,e){this.adjList.get(t)||this.addVertex(t),this.adjList.get(e)||this.addVertex(e),this.adjList.get(t)?.value.indexOf(e)===-1&&this.adjList.get(t)?.value.push(e),this.isDirected||this.adjList.get(e)?.value.indexOf(t)===-1&&this.adjList.get(e)?.value.push(t)}getVertices(){return this.vertices}getAdjacencyList(){return this.adjList}toString(){let t="";for(let e=0;e<this.vertices.length;e++)t+=this.vertices[e]+"-->",t+=this.adjList.get(this.vertices[e])?.toString()||"",t+=`
-`;return t}}class E{_data;static zero(t){return new E(...Array(t).fill(0))}constructor(...t){this._data=t}get dimension(){return this._data.length}get norm(){return Math.hypot(...this._data)}getItem(t){return this._data[t]}normalize(){const t=this.norm;if(t===0)throw new Error("Cannot normalize a zero vector");const e=this._data.map(s=>s/t);return new E(...e)}add(t){if(this.dimension!==t.dimension)throw new Error("Vectors must have the same dimension to add");const e=this._data.map((s,r)=>s+t._data[r]);return new E(...e)}sub(t){if(this.dimension!==t.dimension)throw new Error("Vectors must have the same dimension to subtract");const e=this._data.map((s,r)=>s-t._data[r]);return new E(...e)}mul(t){return new E(...this._data.map(e=>e*t))}dot(t){if(this.dimension!==t.dimension)throw new Error("Vectors must have the same dimension to dot product");return this._data.reduce((e,s,r)=>e+s*t._data[r],0)}pos(){return this.mul(1)}neg(){return this.mul(-1)}}class S{_matrix;static zero(t,e){return new S(Array.from({length:t},()=>Array.from({length:e},()=>0)))}static rotate(t){const e=t.length;for(let s=0;s<(e+1)/2;s++)for(let r=s;r<e/2;r++){const i=t[e-1-r][s];t[e-1-r][s]=t[e-1-s][e-1-r],t[e-1-s][e-1-r]=t[r][e-1-s],t[r][e-1-s]=t[s][r],t[s][r]=i}return t}constructor(t){this._matrix=t}get shape(){return[this._matrix.length,this._matrix[0].length]}get row(){return this.shape[0]}get col(){return this.shape[1]}get size(){return this.row*this.col}rowVector(t){return new E(...this._matrix[t])}colVector(t){return new E(...this._matrix.map(e=>e[t]))}getItem(t){return this._matrix[t[0]][t[1]]}setItem(t,e){return this._matrix[t[0]][t[1]]=e,this}mul(t){return new S(this._matrix.map(e=>e.map(s=>s*t)))}div(t){return this.mul(1/t)}add(t){if(this.row!==t.row||this.col!==t.col)throw new Error("Matrix dimensions do not match");return new S(this._matrix.map((e,s)=>e.map((r,i)=>r+t.getItem([s,i]))))}sub(t){return this.add(t.neg())}pos(){return this.mul(1)}neg(){return this.mul(-1)}mulVector(t){if(this.col!==t.dimension)throw new Error("Matrix dimensions do not match");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=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++)e.setItem([s,i],r.dot(t.colVector(i)))}return e}}class l{static distance(t,e){return Math.hypot(e.x-t.x,e.y-t.y)}x;y;constructor(t,e){this.x=t,this.y=e}distanceTo(t){return l.distance(this,t)}}class g{static EPSILON=1e-10;static sloped(t,e=g.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);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,d=e.p1.y,m=e.p2.x,u=e.p2.y,p=(r-n)*(d-u)-(i-a)*(c-m);if(Math.abs(p)<s)return null;const y=((r-c)*(d-u)-(i-d)*(c-m))/p,b=-((r-n)*(i-d)-(i-a)*(r-c))/p;if(y>=0&&y<=1&&b>=0&&b<=1){const st=r+y*(n-r),rt=i+y*(a-i);return new l(st,rt)}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,d=n*n+a*a;let m=-1;d>s&&(m=c/d);let u,p;m<0?(u=t.p1.x,p=t.p1.y):m>1?(u=t.p2.x,p=t.p2.y):(u=t.p1.x+m*n,p=t.p1.y+m*a);const y=e.x-u,b=e.y-p;return Math.hypot(y+b)}p1;p2;constructor(t,e){this.p1=t,this.p2=e}get length(){const t=this.p2.x-this.p1.x,e=this.p2.y-this.p1.y;return Math.sqrt(t*t+e*e)}get midpoint(){const t=(this.p1.x+this.p2.x)/2,e=(this.p1.y+this.p2.y)/2;return new l(t,e)}get angle(){return Math.atan2(this.p2.y-this.p1.y,this.p2.x-this.p1.x)}containsPoint(t,e=g.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 l(0,0);const e=(this.p2.x-this.p1.x)/t,s=(this.p2.y-this.p1.y)/t;return new l(e,s)}get start(){return this.p1}get end(){return this.p2}}class D{static EPSILON=1e-10;name;constructor(t){this.name=t}}class f extends D{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(!f.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(!f.isValid(t,e,s))throw new Error("Invalid triangle sides");const r=[t,e,s].sort((c,d)=>c-d),[i,n,a]=r;return Math.abs(i-n)<f.EPSILON&&Math.abs(n-a)<f.EPSILON?"equilateral":Math.abs(i-n)<f.EPSILON||Math.abs(n-a)<f.EPSILON?"isosceles":"scalene"}static getAngles(t,e,s){if(!f.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]}p1;p2;p3;constructor(t,e,s,r="triangle"){if(super(r),this.p1=t,this.p2=e,this.p3=s,this.areCollinear())throw new Error("Points are collinear, cannot form a triangle")}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))<D.EPSILON}get side(){return[l.distance(this.p1,this.p2),l.distance(this.p2,this.p3),l.distance(this.p3,this.p1)]}perimeter(){return f.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 f.area(t,e,s)}get type(){const[t,e,s]=this.side;return f.getType(t,e,s)}get angles(){const[t,e,s]=this.side;return f.getAngles(t,e,s)}get centroid(){return new l((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 l(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)<f.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 l(e,s)}containsPoint(t){const e=f.area(l.distance(t,this.p1),l.distance(t,this.p2),l.distance(this.p1,this.p2)),s=f.area(l.distance(t,this.p2),l.distance(t,this.p3),l.distance(this.p2,this.p3)),r=f.area(l.distance(t,this.p3),l.distance(t,this.p1),l.distance(this.p3,this.p1));return Math.abs(e+s+r-this.area())<f.EPSILON}}class X{static sleep(t){return new Promise(e=>setTimeout(e,t))}static binarySearchTemplate(t,e,s){let r=-1,i=t.length,n;for(;i-r>1;)n=i-(i-r)>>1,s(t[n],e)?i=n:r=n;return i}static singleton(t){let e;const s=new Proxy(t,{construct(r,i,n){return e||(e=Reflect.construct(r,i,n)),e}});return t.prototype.constructor=s,s}}class W{static groupBy(t,e){if(!e)throw new Error("generateKey is required");const s=typeof e=="string"?i=>i[e]:e,r=new Map;for(const[i,n]of t.entries())try{const a=s(n,i,t);if(a==null){console.warn("Invalid key generated for item:",n);continue}const c=r.get(a)??[];c.push(n),r.set(a,c)}catch(a){console.error("Error generating key for item:",n,a)}return Object.fromEntries(r)}static LIS(t){if(!t.length)return[];const e=[[t[0]]];for(let r=1,i=t.length;r<i;r++){const n=t[r];s(n)}function s(r){for(let i=e.length-1;i>=0;i--){const n=e[i],a=n[e[i].length-1];if(a<r){e[i+1]=[...n,r];break}else a>r&&i===0&&(e[i]=[r])}}return e[e.length-1]}static LCP(t){if(!t.length)return"";let e=t[0];for(let s=1;s<t.length;s++)for(;!t[s].startsWith(e);)if(e=e.slice(0,-1),e==="")return"";return e}}function k(h){return h!==null&&(typeof h=="object"||typeof h=="function")}class Q{map=new Map;weakMap=new WeakMap;set(t,e){k(t)?this.weakMap.set(t,e):this.map.set(t,e)}get(t){return k(t)?this.weakMap.get(t):this.map.get(t)}has(t){return k(t)?this.weakMap.has(t):this.map.has(t)}}class J{static jsonClone(t){try{return JSON.parse(JSON.stringify(t))}catch{throw new Error("Object is not JSON cloneable")}}static structureClone(t){return structuredClone(t)}static deepClone(t,e=new WeakMap){if(t==null||typeof t!="object")return t;if(e.has(t))return e.get(t);if(t instanceof Date)return new Date(t.getTime());if(t instanceof RegExp)return new RegExp(t.source,t.flags);if(t instanceof Map){const n=new Map;e.set(t,n);for(const[a,c]of t)n.set(this.deepClone(a,e),this.deepClone(c,e));return n}if(t instanceof Set){const n=new Set;e.set(t,n);for(const a of t)n.add(this.deepClone(a,e));return n}if(Array.isArray(t)){const n=new Array(t.length);e.set(t,n);for(let a=0,c=t.length;a<c;a++)n[a]=this.deepClone(t[a],e);return n}if(t instanceof ArrayBuffer)return t.slice(0);const s=[Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array];for(const n of s)if(t instanceof n)return new n(t);if(typeof t=="function")return new Proxy(t,{apply(n,a,c){return n.apply(a,c)},get(n,a){if(a in n)return n[a]}});const r=Object.create(Object.getPrototypeOf(t));e.set(t,r);const i=Object.getOwnPropertyDescriptors(t);for(const[n,a]of Object.entries(i))a.value!==void 0&&(a.value=this.deepClone(a.value,e)),Object.defineProperty(r,n,a);return r}}const H={date:"yyyy-MM-dd",datetime:"yyyy-MM-dd HH:mm:ss",time:"HH:mm:ss",iso:"yyyy-MM-ddTHH:mm:ss.SSS"};class M{static defaultOptions={paddingZero:!1,locale:"en-US"};static setDefaultOptions(t){M.defaultOptions={...M.defaultOptions,...t}}static format(t,e,s={}){const r={...M.defaultOptions,...s},i=M.getDateInfo(t,r);return M.normalizeFormatter(e)(i)}static getDateInfo(t,e){const s=(u,p=2)=>e.paddingZero?u.toString().padStart(p,"0"):u.toString(),r=t.getFullYear(),i=t.getMonth()+1,n=t.getDate(),a=t.getHours(),c=t.getMinutes(),d=t.getSeconds(),m=t.getMilliseconds();return{year:r,month:i,day:n,hour:a,minute:c,second:d,millisecond:m,yyyy:s(r,4),MM:s(i),dd:s(n),HH:s(a),mm:s(c),ss:s(d)}}static normalizeFormatter(t){if(typeof t=="function")return t;if(typeof t!="string")throw new Error("Formatter must be a string or function");t in H&&(t=H[t]);const e={yyyy:"yyyy",MM:"MM",dd:"dd",HH:"HH",mm:"mm",ss:"ss",SSS:"SSS"};return s=>{let r=t;for(const[i,n]of Object.entries(e))r=r.replace(new RegExp(i,"g"),String(s[n]||""));return r}}static formatRelative(t,e=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),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 L{lights;currentIndex;switchTime;static DEFAULT_LIGHTS=[{color:"red",latest:7},{color:"yellow",latest:3},{color:"green",latest:10},{color:"yellow",latest:3}];constructor(t=L.DEFAULT_LIGHTS){this.lights=t,this.currentIndex=0,this.switchTime=Date.now()}render(t){requestAnimationFrame(this.render.bind(this,t));const e=this.getCurrentLight();t(e)}get current(){return this.lights[this.currentIndex]}get disTime(){return Date.now()-this.switchTime}update(){for(;!(this.disTime<this.current.latest);)this.switchTime+=this.current.latest*1e3,this.currentIndex=(this.currentIndex+1)%this.lights.length}getCurrentLight(){return this.update(),{color:this.current.color,remain:this.current.latest-this.disTime}}}class Z{static escape(t){return t.replace(/[.*+?^${}()|[\]\\]/g,"\\$&")}}class Y{static ROMAN_MAP=new Map([["M",1e3],["CM",900],["D",500],["CD",400],["C",100],["XC",90],["L",50],["XL",40],["X",10],["IX",9],["V",5],["IV",4],["I",1]]);static toInteger(t){if(t.length===0)throw new Error("Input cannot be empty");const e=new Set(["I","V","X","L","C","D","M"]);for(const n of t)if(!e.has(n))throw new Error(`Invalid Roman numeral character: ${n}`);let s=0,r=0;for(;r<t.length;){const n=t.slice(r,r+2);if(this.ROMAN_MAP.has(n))s+=this.ROMAN_MAP.get(n),r+=2;else{const a=t[r],c=this.ROMAN_MAP.get(a);if(!c)throw new Error(`Invalid Roman numeral sequence at position ${r}`);s+=c,r+=1}}if(this.toRoman(s)!==t)throw new Error("Invalid Roman numeral sequence");return s}static toRoman(t){if(t<=0||t>=4e3)throw new Error("Number must be between 1 and 3999");if(!Number.isInteger(t))throw new Error("Number must be an integer");let e="";for(const[s,r]of this.ROMAN_MAP)for(;t>=r;)e+=s,t-=r;return e}}class w{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");if(t<s||t>=r)throw new RangeError(`n must be in the range of ${s} to ${r}`)}static consecutiveSum(t){return w.handleNumRange(t,!0,0,1e8),t*(t+1)/2}static consecutiveSquaresSum(t){return w.handleNumRange(t,!0,0,1e6),t*(t+1)*(2*t+1)/6}static consecutivecubesSum(t){return w.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(w.handleNumRange(t,!0,0,1e3),t<2)return 1;let e=1;for(let s=2;s<=t;s++)e*=s;return e}static fibonacci(t,e=1,s=1){return w.handleNumRange(t,!0,0,1e3),t<2?s:this.fibonacci(t-1,s,s+e)}static fibonacciIterative(t){if(w.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];return s}static floatEqual(t,e,s=1e-6){return Math.abs(t-e)<s}static fastPower(t,e){if(w.handleNumRange(e,!0,0,10),w.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(w.handleNumRange(t,!1,0,1e8),typeof BigInt>"u")return Math.sqrt(t);const e=.5*t,s=new ArrayBuffer(8);new Float64Array(s)[0]=t;let r=new BigInt64Array(s)[0];r=0x1ff7a3bea91d9b1bn+(r>>1n);const i=new ArrayBuffer(8);new BigInt64Array(i)[0]=r;let n=new Float64Array(i)[0];return n=n*.5+e/n,n=n*.5+e/n,n=n*.5+e/n,n}static getPercentWithPrecision(t,e=2){if(!Array.isArray(t)||t.length===0)return[];if(e<0||!Number.isInteger(e))throw new Error("Precision must be a non-negative integer");const s=t.reduce((u,p)=>u+p,0);if(s===0)return t.map(()=>"0%");const i=100*Math.pow(10,e),n=t.map(u=>u/s*i),a=n.map(u=>Math.floor(u)),c=n.map((u,p)=>u-a[p]);let d=a.reduce((u,p)=>u+p,0),m=i-d;for(;m>0;){let u=-1,p=-1;for(let y=0;y<c.length;y++)c[y]>p&&(p=c[y],u=y);if(u===-1)break;a[u]++,c[u]=0,m--}return a.map(u=>`${(u/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}static isPowerOfTwo(t){return t>0&&(t&t-1)===0}static isOdd(t){return t%2===1||t%2===-1}static isPrime(t){if(t<=1)return!1;for(let e=2;e<=Math.sqrt(t);e++)if(t%e===0)return!1;return!0}static isPalindrome(t){if(t<0||t%10===0&&t!==0)return!1;let e=0,s=t;for(;t>0;){const r=t%10;e=e*10+r,t=Math.floor(t/10)}return s===e}static isArmstrong(t){const e=t.toString(),s=e.length;let r=0;for(let i=0;i<s;i++)r+=Math.pow(parseInt(e[i]),s);return r===t}static isHappy(t){const e=new Set;for(;t!==1;){if(e.has(t))return!1;e.add(t),t=(t+"").split("").reduce((s,r)=>s+Number(r)*Number(r),0)}return!0}static isPerfect(t){let e=0;for(let s=1;s<t;s++)t%s===0&&(e+=s);return e===t}static isSameSign(t,e){return t>=0&&e>=0||t<=0&&e<=0}static isRange(t,e,s){if(s==null&&(s=e,e=0),e>=s)throw new Error("The maximum value must be greater than the minimum value");return e<=t&&t<s}static lcm(t,e){return t*e/this.gcd(t,e)}static middle(t,e){return e-(e-t>>1)}static random(t,e){if(e==null&&(e=t,t=0),t>=e)throw new Error("The maximum value must be greater than the minimum value");return Math.random()*(e-t)+t}static randomInt(t,e){return Math.floor(this.random(t,e))}static round(t,e=0){if(!Number.isInteger(e))throw new Error("precision must be an integer");const s=Math.pow(10,e);return Math.round(t*s)/s}static scale(t,e,s){if(e[0]>=e[1]||s[0]>=s[1])throw new Error("Invalid range");t=this.clamp(t,e[0],e[1]);const r=e[1]-e[0];return(t-e[0])*((s[1]-s[0])/r)+s[0]}}class K{static READ=1;static WRITE=2;static SHARE=4;static DELETE=8;static CREATE=16;static include(t,e){return(t&e)===e}static add(t,e){return t|e}static remove(t,e){return t&~e}static toggle(t,e){return t^e}}class x{static frequencyStatistics(t){return[...t].reduce((e,s)=>(e[s]=(e[s]||0)+1,e),{})}static isValidBracket(t){const e=[],s={"(":")","[":"]","{":"}"},r=new Set(Object.values(s));for(const i of t)if(i in s)e.push(s[i]);else if(r.has(i)&&i!==e.pop())return!1;return e.length===0}static random(t=8){const e="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";let s="";for(let r=0;r<t;r++)s+=e.charAt(Math.floor(Math.random()*e.length));return s}static template(t,e){return t.replace(/\${(\w+)}/g,(s,r)=>e[r]||"")}static escapeHtml(t){const e={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;","'":"&apos;"," ":"&nbsp;","±":"&plusmn;","×":"&times;","÷":"&divide;","≠":"&ne;","≤":"&le;","≥":"&ge;"},s=new RegExp(`[${Object.keys(e).join("")}]`,"g");return t.replace(s,r=>e[r])}static isEmail(t){return/^[^\s@]+@[^\s@]+\.[^\s@]+$/.test(t)}static isUrl(t){try{return new URL(t),!0}catch{return!1}}static pointLength(t){let e=0;for(let s=0,r=t.length;s<r;){const i=t.codePointAt(s);s+=i>65535?2:1,e++}return e}static pointAt(t,e){if(e>=x.pointLength(t))return;let s=0;for(let r=0,i=t.length;r<i;){const n=t.codePointAt(r);if(!n)return;if(s===e)return String.fromCodePoint(n);r+=n>65535?2:1,s++}}static sliceByPoint(t,e,s=x.pointLength(t)){let r="";for(let i=e;i<s;i++)r+=x.pointAt(t,i);return r}static capitalize(t){return t.charAt(0).toUpperCase()+t.slice(1).toLowerCase()}static reverse(t){return t.split("").reverse().join("")}static truncate(t,e,s="..."){return t.length<=e?this:t.slice(0,e-s.length)+s}static isPalindrome(t){return t.toLowerCase().replace(/[^a-z0-9]/g,"")===x.reverse(t)}static count(t,e){const s=e.replace(/[.*+?^${}()|[\]\\]/g,"\\$&");return(t.match(new RegExp(s,"g"))||[]).length}static toCamelCase(t){return t.replace(/_([a-z])/g,(e,s)=>s.toUpperCase())}static toSnakeCase(t){return t.replace(/[A-Z]/g,e=>`_${e.toLowerCase()}`)}}class tt{static isValidHex(t){return/^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/.test(t)}static isValidRGB(t){return/^rgb\((\d{1,3}),\s*(\d{1,3}),\s*(\d{1,3})\)$/.test(t)}}const v={AUTH_UNAUTHORIZED:"未授权事件",AUTH_LOGIN_SUCCESS:"登录成功事件",AUTH_LOGOUT:"注销事件",AUTH_TOKEN_EXPIRED:"令牌过期事件",REQUEST_ERROR:"请求错误事件",REQUEST_TIMEOUT:"请求超时事件",REQUEST_NETWORK_ERROR:"网络错误事件",UI_SHOW_LOADING:"显示加载事件",UI_HIDE_LOADING:"隐藏加载事件",UI_SHOW_MESSAGE:"显示消息事件"};class A{static instance=null;listeners={};debugMode;constructor(t=!1){this.debugMode=t,Object.keys(v).forEach(e=>{this.listeners[e]=new Set})}static getInstance(t){return A.instance||(A.instance=new A(t)),A.instance}on(t,e){this.debugLog(`添加事件监听: ${v[t]}`),this.listeners[t].add(e)}emit(t,e){this.debugLog(`触发事件: ${v[t]}`,e),this.listeners[t].forEach(s=>{try{s(e)}catch(r){console.error(`事件 ${v[t]} 处理出错:`,r)}})}off(t,e){this.debugLog(`移除事件监听: ${v[t]}`),this.listeners[t].delete(e)}once(t,e){this.debugLog(`添加一次性事件监听: ${v[t]}`);const s=r=>{e(r),this.off(t,s)};this.on(t,s)}clear(){this.debugLog("清除所有事件监听器"),Object.values(this.listeners).forEach(t=>t.clear())}getListenerCount(t){return this.listeners[t].size}debugLog(t,e){this.debugMode&&console.log(`[EventEmitter] ${t}`,e||"")}}class P{static OPERATORS=new Set(["+","-","*","/"]);static VALID_CHARS_REG=/^[0-9+\-*/().\s]+$/;static PRIORITY_MAP=new Map([["+",1],["-",1],["*",2],["/",2],["(",0],[")",0]]);static getPriority(t){return this.PRIORITY_MAP.get(t)??0}static validateExpression(t){if(!t)throw new Error("Expression cannot be empty");if(!this.VALID_CHARS_REG.test(t))throw new Error("Expression contains invalid characters")}static processClosingParenthesis(t,e){for(;!t.isEmpty();){if(t.peek()==="("){t.pop();break}const r=t.pop();r&&e.push(r)}}static processOperator(t,e,s){for(;!e.isEmpty();){const r=e.peek();if(!r||r==="(")break;if(this.getPriority(t)<=this.getPriority(r)){const i=e.pop();i&&s.push(i)}else break}e.push(t)}static applyOperator(t,e,s){switch(s){case"+":return t+e;case"-":return t-e;case"*":return t*e;case"/":if(e===0)throw new Error("Division by zero");return t/e;default:throw new Error("Invalid operator")}}static FLOAT_NUM_REG=/^-?\d*\.?\d+$/;static EXPRESSION_REG=new RegExp("(?<!\\d)-?\\d*\\.?\\d+|[+\\-*/()]","g");static toArr(t){this.validateExpression(t);const e=t.match(P.EXPRESSION_REG);if(!e)throw new Error("Invalid expression format");return e.filter(s=>s.trim()!=="").map(s=>{if(this.FLOAT_NUM_REG.test(s)||this.OPERATORS.has(s)||s==="("||s===")")return s;throw new Error(`Invalid token: ${s}`)})}static infixToPostfix(t){if(!t?.trim())throw new Error("Expression cannot be empty");const e=new R,s=this.toArr(t);console.log(s);const r=[];for(const i of s)this.FLOAT_NUM_REG.test(i)?r.push(i):i==="("?e.push(i):i===")"?this.processClosingParenthesis(e,r):this.OPERATORS.has(i)&&this.processOperator(i,e,r);for(;!e.isEmpty();){const i=e.pop();i&&i!=="("&&r.push(i)}return{postfix:r.join(" "),postfixArr:r}}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;for(const s of t)if(this.FLOAT_NUM_REG.test(s))e.push(parseFloat(s));else if(this.OPERATORS.has(s)){const r=e.pop(),i=e.pop();if(i===void 0||r===void 0)throw new Error("Invalid postfix expression");e.push(this.applyOperator(i,r,s))}return e.pop()??0}}class et{static isMatchingPair(t,e){return t==="("&&e===")"||t==="{"&&e==="}"||t==="["&&e==="]"}static isvalidBrackets(t){const e=new R;for(let s=0,r=t.length;s<r;s++){const i=t[s];if(["{","[","("].includes(i))e.push(i);else if(["}","]",")"].includes(i)){if(e.isEmpty())return!1;const n=e.pop();if(!n||!this.isMatchingPair(n,i))return!1}}return e.isEmpty()}}o.Arr=W,o.ArrStack=R,o.BitPerm=K,o.Color=tt,o.DateEx=M,o.Dictionary=$,o.Emitter=A,o.Expression=P,o.Func=X,o.Graph=j,o.LRU=_,o.Line=g,o.LinkedList=G,o.Matrix=S,o.MaxHeap=q,o.MemoizeMap=Q,o.MinHeap=C,o.MinStack=V,o.Num=w,o.Obj=J,o.Point=l,o.Queue=O,o.Reg=Z,o.Roman=Y,o.Stack=U,o.StackApplication=et,o.Str=x,o.TrafficLight=L,o.Triangle=f,o.Vector=E,Object.defineProperty(o,Symbol.toStringTag,{value:"Module"})}));
+(function(o,R){typeof exports=="object"&&typeof module<"u"?R(exports):typeof define=="function"&&define.amd?define(["exports"],R):(o=typeof globalThis<"u"?globalThis:o||self,R(o["jc-structure"]={}))})(this,(function(o){"use strict";class R{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 F{items={};count=0;lowestCount=0;constructor(){}dequeue(){if(this.isEmpty())return;const t=this.items[this.lowestCount];return delete this.items[this.lowestCount],this.lowestCount++,t}enqueue(...t){if(t.length===0)return this;if(t.length===1){const e=t[0];return Array.isArray(e)?this.batchEnqueue(e):this.enqueueItem(e)}for(const e of t)Array.isArray(e)?this.batchEnqueue(e):this.enqueueItem(e);return this}batchEnqueue(t){return t.filter(s=>this.isValidItem(s)).forEach(s=>{this.isValidItem(s)&&(this.items[this.count]=s,this.count++)}),this}enqueueItem(t){if(!this.isValidItem(t))throw new Error("Invalid item");return this.items[this.count]=t,this.count++,this}isValidItem(t){return t!=null}front(){return this.isEmpty()?void 0:this.items[this.lowestCount]}isEmpty(){return this.size()===0}size(){return this.count-this.lowestCount}cleanup(){this.items={},this.count=0,this.lowestCount=0}toString(){return this.isEmpty()?"Queue: (0) []":`Queue: (${this.size()}) [${this.front()} ...]`}}class P{_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 V{items={};count=0;constructor(){}pop(){if(this.isEmpty())return;this.count--;const t=this.items[this.count];return delete this.items[this.count],t}push(...t){if(t.length===0)return this;if(t.length===1){const e=t[0];return Array.isArray(e)?this.addItems(e):this.addItem(e)}for(const e of t)Array.isArray(e)?this.addItems(e):this.addItem(e);return this}addItem(t){if(!this.isValidItem(t))throw new Error("Invalid item: item cannot be null or undefined");return this.items[this.count]=t,this.count++,this}addItems(t){return t.filter(s=>this.isValidItem(s)).forEach(s=>{this.items[this.count]=s,this.count++}),this}isValidItem(t){return t!=null}peek(){return this.isEmpty()?void 0:this.items[this.count-1]}isEmpty(){return this.count===0}size(){return this.count}cleanup(){this.items={},this.count=0}toString(){return this.isEmpty()?"Stack: (0) []":`Stack: (${this.size()}) [ ${this.peek()} ...]`}}class _{stack=[];minStack=[];push(t){this.stack.push(t),(this.minStack.length===0||t<=this.minStack[this.minStack.length-1])&&this.minStack.push(t)}pop(){const t=this.stack.pop();return t===this.minStack[this.minStack.length-1]&&this.minStack.pop(),t}peek(){return this.stack[this.stack.length-1]}getMin(){return this.minStack[this.minStack.length-1]}isEmpty(){return this.size()===0}size(){return this.stack.length}clear(){this.stack=[],this.minStack=[]}toString(){return this.isEmpty()?"Stack: (0) []":`Stack: (${this.size()}) [ ${this.peek()} ...]`}}function T(c,t){return c===t?0:c<t?-1:1}class I{heap=[];compareFn;constructor(t=T){this.compareFn=t}static getLeftIndex(t){return 2*t+1}static getRightIndex(t){return 2*t+2}static getParentIndex(t){return t===0?void 0:Math.floor((t-1)/2)}static swap(t,e,s){[t[e],t[s]]=[t[s],t[e]]}find(){return this.isEmpty()?void 0:this.heap[0]}size(){return this.heap.length}isEmpty(){return this.size()===0}cleanup(){this.heap=[]}toString(){return this.heap.toString()}}class $ extends I{insert(t){return t?!1:(this.heap.push(t),this.siftUp(this.heap.length-1),!0)}extract(){if(this.isEmpty())return;if(this.heap.length===1)return this.heap.shift();const t=this.heap[0];return this.heap[0]=this.heap.pop(),this.siftDown(0),t}siftUp(t){let e=t,s=I.getLeftIndex(e),r=I.getRightIndex(e),i=this.size();s<i&&this.compareFn(this.heap[e],this.heap[s])===-1&&(e=s),r<i&&this.compareFn(this.heap[e],this.heap[r])===1&&(e=r),e!==t&&(I.swap(this.heap,t,e),this.siftUp(e))}siftDown(t){let e=I.getParentIndex(t);for(;t>0&&e&&this.compareFn(this.heap[e],this.heap[t])===1;)I.swap(this.heap,e,t),t=e,e=I.getParentIndex(t)}}class G extends ${constructor(t=(e,s)=>T(s,e)){super(t)}}function B(c){return{value:c}}class j{capacity;length=0;head=null;tail=null;lookup=new Map;reverseLookup=new Map;constructor(t=10){this.capacity=t}prepend(t){this.head?(t.next=this.head,this.head.prev=t,this.head=t):this.head=this.tail=t}detach(t){t.prev&&(t.prev.next=t.next),t.next&&(t.next.prev=t.prev),this.head===t&&(this.head=this.head.next||null),this.tail===t&&(this.tail=this.tail.prev||null),t.next=void 0,t.prev=void 0}trimCache(){if(this.length<=this.capacity)return;const t=this.tail;this.detach(t);const e=this.reverseLookup.get(t);this.lookup.delete(e),this.reverseLookup.delete(t),this.length--}get(t){const e=this.lookup.get(t);if(e)return this.detach(e),this.prepend(e),e.value}update(t,e){let s=this.lookup.get(t);s?(this.detach(s),this.prepend(s),s.value=e):(s=B(e),this.length++,this.prepend(s),this.trimCache(),this.lookup.set(t,s),this.reverseLookup)}}class z{constructor(t,e=null,s=null){this.value=t,this.next=e,this.prev=s}}class Q{count=0;head=null;tail=null;constructor(t){t&&t.forEach(e=>this.push(e))}[Symbol.iterator](){let t=this.head;return{next(){if(t){const e=t.value;return t=t.next,{value:e,done:!1}}return{value:void 0,done:!0}}}}equals(t,e){if(t===e)return!0;if(t==null||e==null)return!1;if(typeof t=="object"&&typeof e=="object"){if(t.equals&&typeof t.equals=="function")return t.equals(e);const s=Object.keys(t),r=Object.keys(e);return s.length!==r.length?!1:s.every(i=>t[i]===e[i])}return!1}indexOf(t){let e=this.head,s=0;for(;e;){if(this.equals(e.value,t))return s;s++,e=e.next}return-1}getElementAt(t){if(t<0||t>=this.count)return null;if(t>this.count/2){let s=this.tail,r=this.count-1;for(;r>t&&s;)s=s.prev,r--;return s}let e=this.head;for(let s=0;s<t&&e;s++)e=e.next;return e}getValueAt(t){return this.getElementAt(t)?.value}insert(t,e){if(e<0||e>this.count)throw new Error(`Index out of bounds: ${e}`);const s=new z(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)s.prev=this.tail,this.tail&&(this.tail.next=s),this.tail=s;else{let r;if(e<this.count/2){r=this.head;for(let i=0;i<e-1&&r;i++)r=r.next}else{r=this.tail;for(let i=this.count-1;i>e-1&&r;i--)r=r.prev}if(r){const i=r.next;s.prev=r,s.next=i,r.next=s,i&&(i.prev=s)}}return this.count++,!0}push(t){const e=new z(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){let e=this.head,s=this.tail,r=0,i=this.count-1;for(;e&&s;){if(this.equals(e.value,t))return this.removeAt(r);if(this.equals(s.value,t))return this.removeAt(i);if(e=e.next,s=s.prev,r++,i--,r>i)break}return null}removeAt(t){if(t<0||t>=this.count)return null;let e;if(t===0)e=this.head,e&&(this.head=e.next,this.head&&(this.head.prev=null),this.count===1&&(this.tail=null));else if(t===this.count-1)e=this.tail,e&&(this.tail=e.prev,this.tail&&(this.tail.next=null),this.count===1&&(this.head=null));else{if(t<this.count/2){e=this.head;for(let s=0;s<t&&e;s++)e=e.next}else{e=this.tail;for(let s=this.count-1;s>t&&e;s--)e=e.prev}if(e){const s=e.prev,r=e.next;s&&(s.next=r),r&&(r.prev=s)}}return this.count--,e?.value||null}isEmpty(){return this.count===0}size(){return this.count}cleanup(){this.head=null,this.tail=null,this.count=0}toString(){if(this.isEmpty())return"";let t="",e=this.head;for(;e;)t+=JSON.stringify(e.value),e.next&&(t+=","),e=e.next;return t}toArray(){const t=[];let e=this.head;for(;e;)t.push(e.value),e=e.next;return t}}class X{key;value;constructor(t,e){this.key=t,this.value=e}}function D(c,t={emptyString:!1,zeroNumber:!1}){return c==null?!(t.emptyString&&c===""||t.zeroNumber&&c===0):!1}class H{table=[];constructor(){}getItemIndex(t){for(let e=0,s=this.table.length;e<s;e++)if(this.table[e].key===t)return e;return-1}set(t,e){if(D(t))throw new Error("key is required");if(D(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 X(t,e);this.table.push(s)}}remove(t){if(this.has(t)){let e=this.getItemIndex(t);return this.table.splice(e,1)[0]}}has(t){return this.getItemIndex(t)!==-1}get(t){if(this.has(t)){let e=this.getItemIndex(t);return this.table[e]}}keys(){return this.table.map(t=>t.key)}values(){return this.table.map(t=>t.value)}keyValues(){return this.table.map(t=>[t.key,t.value])}forEach(t){for(let e=0,s=this.size();e<s;e++){let r=this.table[e];if(!t(r.key,r.value))break}}isEmpty(){return!this.size()}size(){return this.table.length}cleanup(){this.table=[]}toString(){let t="";for(let e=0,s=this.table.length;e<s;e++)t+=this.table[e].toString(),t+=",";return t=t.slice(0,-1),t}}class W{isDirected;vertices;adjList;constructor(t=!1){this.isDirected=t,this.vertices=[],this.adjList=new H}addVertex(t){this.vertices.includes(t)||(this.vertices.push(t),this.adjList.set(t,[]))}addEdge(t,e){this.adjList.get(t)||this.addVertex(t),this.adjList.get(e)||this.addVertex(e),this.adjList.get(t)?.value.indexOf(e)===-1&&this.adjList.get(t)?.value.push(e),this.isDirected||this.adjList.get(e)?.value.indexOf(t)===-1&&this.adjList.get(e)?.value.push(t)}getVertices(){return this.vertices}getAdjacencyList(){return this.adjList}toString(){let t="";for(let e=0;e<this.vertices.length;e++)t+=this.vertices[e]+"-->",t+=this.adjList.get(this.vertices[e])?.toString()||"",t+=`
+`;return t}}class E{_data;static zero(t){return new E(...Array(t).fill(0))}constructor(...t){this._data=t}get dimension(){return this._data.length}get norm(){return Math.hypot(...this._data)}getItem(t){return this._data[t]}normalize(){const t=this.norm;if(t===0)throw new Error("Cannot normalize a zero vector");const e=this._data.map(s=>s/t);return new E(...e)}add(t){if(this.dimension!==t.dimension)throw new Error("Vectors must have the same dimension to add");const e=this._data.map((s,r)=>s+t._data[r]);return new E(...e)}sub(t){if(this.dimension!==t.dimension)throw new Error("Vectors must have the same dimension to subtract");const e=this._data.map((s,r)=>s-t._data[r]);return new E(...e)}mul(t){return new E(...this._data.map(e=>e*t))}dot(t){if(this.dimension!==t.dimension)throw new Error("Vectors must have the same dimension to dot product");return this._data.reduce((e,s,r)=>e+s*t._data[r],0)}pos(){return this.mul(1)}neg(){return this.mul(-1)}}class S{_matrix;static zero(t,e){return new S(Array.from({length:t},()=>Array.from({length:e},()=>0)))}static rotate(t){const e=t.length;for(let s=0;s<(e+1)/2;s++)for(let r=s;r<e/2;r++){const i=t[e-1-r][s];t[e-1-r][s]=t[e-1-s][e-1-r],t[e-1-s][e-1-r]=t[r][e-1-s],t[r][e-1-s]=t[s][r],t[s][r]=i}return t}constructor(t){this._matrix=t}get shape(){return[this._matrix.length,this._matrix[0].length]}get row(){return this.shape[0]}get col(){return this.shape[1]}get size(){return this.row*this.col}rowVector(t){return new E(...this._matrix[t])}colVector(t){return new E(...this._matrix.map(e=>e[t]))}getItem(t){return this._matrix[t[0]][t[1]]}setItem(t,e){return this._matrix[t[0]][t[1]]=e,this}mul(t){return new S(this._matrix.map(e=>e.map(s=>s*t)))}div(t){return this.mul(1/t)}add(t){if(this.row!==t.row||this.col!==t.col)throw new Error("Matrix dimensions do not match");return new S(this._matrix.map((e,s)=>e.map((r,i)=>r+t.getItem([s,i]))))}sub(t){return this.add(t.neg())}pos(){return this.mul(1)}neg(){return this.mul(-1)}mulVector(t){if(this.col!==t.dimension)throw new Error("Matrix dimensions do not match");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=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++)e.setItem([s,i],r.dot(t.colVector(i)))}return e}}class p{static distance(t,e){return Math.hypot(e.x-t.x,e.y-t.y)}x;y;constructor(t,e){this.x=t,this.y=e}distanceTo(t){return p.distance(this,t)}}class y{static EPSILON=1e-10;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=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=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,u=e.p1.x,m=e.p1.y,l=e.p2.x,h=e.p2.y,f=(r-n)*(m-h)-(i-a)*(u-l);if(Math.abs(f)<s)return null;const g=((r-u)*(m-h)-(i-m)*(u-l))/f,O=-((r-n)*(i-m)-(i-a)*(r-u))/f;if(g>=0&&g<=1&&O>=0&&O<=1){const C=r+g*(n-r),it=i+g*(a-i);return new p(C,it)}return null}static isIntersecting(t,e){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,u=r*n+i*a,m=n*n+a*a;let l=-1;m>s&&(l=u/m);let h,f;l<0?(h=t.p1.x,f=t.p1.y):l>1?(h=t.p2.x,f=t.p2.y):(h=t.p1.x+l*n,f=t.p1.y+l*a);const g=e.x-h,O=e.y-f;return Math.hypot(g+O)}p1;p2;constructor(t,e){this.p1=t,this.p2=e}get length(){const t=this.p2.x-this.p1.x,e=this.p2.y-this.p1.y;return Math.sqrt(t*t+e*e)}get midpoint(){const t=(this.p1.x+this.p2.x)/2,e=(this.p1.y+this.p2.y)/2;return new p(t,e)}get angle(){return Math.atan2(this.p2.y-this.p1.y,this.p2.x-this.p1.x)}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<y.EPSILON)return new p(0,0);const e=(this.p2.x-this.p1.x)/t,s=(this.p2.y-this.p1.y)/t;return new p(e,s)}get start(){return this.p1}get end(){return this.p2}}class U{static EPSILON=1e-10;name;constructor(t){this.name=t}}class d extends U{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))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))throw new Error("Invalid triangle sides");const r=[t,e,s].sort((u,m)=>u-m),[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(!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]}p1;p2;p3;constructor(t,e,s,r="triangle"){if(super(r),this.p1=t,this.p2=e,this.p3=s,this.areCollinear())throw new Error("Points are collinear, cannot form a triangle")}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))<U.EPSILON}get side(){return[p.distance(this.p1,this.p2),p.distance(this.p2,this.p3),p.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)}area(){const[t,e,s]=this.side;return d.area(t,e,s)}get type(){const[t,e,s]=this.side;return d.getType(t,e,s)}get angles(){const[t,e,s]=this.side;return d.getAngles(t,e,s)}get centroid(){return new p((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)}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)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)}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));return Math.abs(e+s+r-this.area())<d.EPSILON}}class J{static sleep(t){return new Promise(e=>setTimeout(e,t))}static binarySearchTemplate(t,e,s){let r=-1,i=t.length,n;for(;i-r>1;)n=i-(i-r)>>1,s(t[n],e)?i=n:r=n;return i}static singleton(t){let e;const s=new Proxy(t,{construct(r,i,n){return e||(e=Reflect.construct(r,i,n)),e}});return t.prototype.constructor=s,s}}class Y{static groupBy(t,e){if(!e)throw new Error("generateKey is required");const s=typeof e=="string"?i=>i[e]:e,r=new Map;for(const[i,n]of t.entries())try{const a=s(n,i,t);if(a==null){console.warn("Invalid key generated for item:",n);continue}const u=r.get(a)??[];u.push(n),r.set(a,u)}catch(a){console.error("Error generating key for item:",n,a)}return Object.fromEntries(r)}static LIS(t){if(!t.length)return[];const e=[[t[0]]];for(let r=1,i=t.length;r<i;r++){const n=t[r];s(n)}function s(r){for(let i=e.length-1;i>=0;i--){const n=e[i],a=n[e[i].length-1];if(a<r){e[i+1]=[...n,r];break}else a>r&&i===0&&(e[i]=[r])}}return e[e.length-1]}static LCP(t){if(!t.length)return"";let e=t[0];for(let s=1;s<t.length;s++)for(;!t[s].startsWith(e);)if(e=e.slice(0,-1),e==="")return"";return e}}function k(c){return c!==null&&(typeof c=="object"||typeof c=="function")}class Z{map=new Map;weakMap=new WeakMap;set(t,e){k(t)?this.weakMap.set(t,e):this.map.set(t,e)}get(t){return k(t)?this.weakMap.get(t):this.map.get(t)}has(t){return k(t)?this.weakMap.has(t):this.map.has(t)}}class K{static jsonClone(t){try{return JSON.parse(JSON.stringify(t))}catch{throw new Error("Object is not JSON cloneable")}}static structureClone(t){return structuredClone(t)}static deepClone(t,e=new WeakMap){if(t==null||typeof t!="object")return t;if(e.has(t))return e.get(t);if(t instanceof Date)return new Date(t.getTime());if(t instanceof RegExp)return new RegExp(t.source,t.flags);if(t instanceof Map){const n=new Map;e.set(t,n);for(const[a,u]of t)n.set(this.deepClone(a,e),this.deepClone(u,e));return n}if(t instanceof Set){const n=new Set;e.set(t,n);for(const a of t)n.add(this.deepClone(a,e));return n}if(Array.isArray(t)){const n=new Array(t.length);e.set(t,n);for(let a=0,u=t.length;a<u;a++)n[a]=this.deepClone(t[a],e);return n}if(t instanceof ArrayBuffer)return t.slice(0);const s=[Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array];for(const n of s)if(t instanceof n)return new n(t);if(typeof t=="function")return new Proxy(t,{apply(n,a,u){return n.apply(a,u)},get(n,a){if(a in n)return n[a]}});const r=Object.create(Object.getPrototypeOf(t));e.set(t,r);const i=Object.getOwnPropertyDescriptors(t);for(const[n,a]of Object.entries(i))a.value!==void 0&&(a.value=this.deepClone(a.value,e)),Object.defineProperty(r,n,a);return r}}const q={date:"yyyy-MM-dd",datetime:"yyyy-MM-dd HH:mm:ss",time:"HH:mm:ss",iso:"yyyy-MM-ddTHH:mm:ss.SSS"};class A{static defaultOptions={paddingZero:!1,locale:"en-US"};static setDefaultOptions(t){A.defaultOptions={...A.defaultOptions,...t}}static format(t,e,s={}){const r={...A.defaultOptions,...s},i=A.getDateInfo(t,r);return A.normalizeFormatter(e)(i)}static getDateInfo(t,e){const s=(h,f=2)=>e.paddingZero?h.toString().padStart(f,"0"):h.toString(),r=t.getFullYear(),i=t.getMonth()+1,n=t.getDate(),a=t.getHours(),u=t.getMinutes(),m=t.getSeconds(),l=t.getMilliseconds();return{year:r,month:i,day:n,hour:a,minute:u,second:m,millisecond:l,yyyy:s(r,4),MM:s(i),dd:s(n),HH:s(a),mm:s(u),ss:s(m)}}static normalizeFormatter(t){if(typeof t=="function")return t;if(typeof t!="string")throw new Error("Formatter must be a string or function");t in q&&(t=q[t]);const e={yyyy:"yyyy",MM:"MM",dd:"dd",HH:"HH",mm:"mm",ss:"ss",SSS:"SSS"};return s=>{let r=t;for(const[i,n]of Object.entries(e))r=r.replace(new RegExp(i,"g"),String(s[n]||""));return r}}static formatRelative(t,e=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),u=Math.floor(a/24);return u>0?s>0?`${u}天后`:`${u}天前`:a>0?s>0?`${a}小时后`:`${a}小时前`:n>0?s>0?`${n}分钟后`:`${n}分钟前`:s>0?"刚刚":""}}class L{lights;currentIndex;switchTime;static DEFAULT_LIGHTS=[{color:"red",latest:7},{color:"yellow",latest:3},{color:"green",latest:10},{color:"yellow",latest:3}];constructor(t=L.DEFAULT_LIGHTS){this.lights=t,this.currentIndex=0,this.switchTime=Date.now()}render(t){requestAnimationFrame(this.render.bind(this,t));const e=this.getCurrentLight();t(e)}get current(){return this.lights[this.currentIndex]}get disTime(){return Date.now()-this.switchTime}update(){for(;!(this.disTime<this.current.latest);)this.switchTime+=this.current.latest*1e3,this.currentIndex=(this.currentIndex+1)%this.lights.length}getCurrentLight(){return this.update(),{color:this.current.color,remain:this.current.latest-this.disTime}}}class tt{static escape(t){return t.replace(/[.*+?^${}()|[\]\\]/g,"\\$&")}}class et{static ROMAN_MAP=new Map([["M",1e3],["CM",900],["D",500],["CD",400],["C",100],["XC",90],["L",50],["XL",40],["X",10],["IX",9],["V",5],["IV",4],["I",1]]);static toInteger(t){if(t.length===0)throw new Error("Input cannot be empty");const e=new Set(["I","V","X","L","C","D","M"]);for(const n of t)if(!e.has(n))throw new Error(`Invalid Roman numeral character: ${n}`);let s=0,r=0;for(;r<t.length;){const n=t.slice(r,r+2);if(this.ROMAN_MAP.has(n))s+=this.ROMAN_MAP.get(n),r+=2;else{const a=t[r],u=this.ROMAN_MAP.get(a);if(!u)throw new Error(`Invalid Roman numeral sequence at position ${r}`);s+=u,r+=1}}if(this.toRoman(s)!==t)throw new Error("Invalid Roman numeral sequence");return s}static toRoman(t){if(t<=0||t>=4e3)throw new Error("Number must be between 1 and 3999");if(!Number.isInteger(t))throw new Error("Number must be an integer");let e="";for(const[s,r]of this.ROMAN_MAP)for(;t>=r;)e+=s,t-=r;return e}}class w{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");if(t<s||t>=r)throw new RangeError(`n must be in the range of ${s} to ${r}`)}static consecutiveSum(t){return w.handleNumRange(t,!0,0,1e8),t*(t+1)/2}static consecutiveSquaresSum(t){return w.handleNumRange(t,!0,0,1e6),t*(t+1)*(2*t+1)/6}static consecutivecubesSum(t){return w.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(w.handleNumRange(t,!0,0,1e3),t<2)return 1;let e=1;for(let s=2;s<=t;s++)e*=s;return e}static fibonacci(t,e=1,s=1){return w.handleNumRange(t,!0,0,1e3),t<2?s:this.fibonacci(t-1,s,s+e)}static fibonacciIterative(t){if(w.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];return s}static floatEqual(t,e,s=1e-6){return Math.abs(t-e)<s}static fastPower(t,e){if(w.handleNumRange(e,!0,0,10),w.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(w.handleNumRange(t,!1,0,1e8),typeof BigInt>"u")return Math.sqrt(t);const e=.5*t,s=new ArrayBuffer(8);new Float64Array(s)[0]=t;let r=new BigInt64Array(s)[0];r=0x1ff7a3bea91d9b1bn+(r>>1n);const i=new ArrayBuffer(8);new BigInt64Array(i)[0]=r;let n=new Float64Array(i)[0];return n=n*.5+e/n,n=n*.5+e/n,n=n*.5+e/n,n}static getPercentWithPrecision(t,e=2){if(!Array.isArray(t)||t.length===0)return[];if(e<0||!Number.isInteger(e))throw new Error("Precision must be a non-negative integer");const s=t.reduce((h,f)=>h+f,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)),u=n.map((h,f)=>h-a[f]);let m=a.reduce((h,f)=>h+f,0),l=i-m;for(;l>0;){let h=-1,f=-1;for(let g=0;g<u.length;g++)u[g]>f&&(f=u[g],h=g);if(h===-1)break;a[h]++,u[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}static isPowerOfTwo(t){return t>0&&(t&t-1)===0}static isOdd(t){return t%2===1||t%2===-1}static isPrime(t){if(t<=1)return!1;for(let e=2;e<=Math.sqrt(t);e++)if(t%e===0)return!1;return!0}static isPalindrome(t){if(t<0||t%10===0&&t!==0)return!1;let e=0,s=t;for(;t>0;){const r=t%10;e=e*10+r,t=Math.floor(t/10)}return s===e}static isArmstrong(t){const e=t.toString(),s=e.length;let r=0;for(let i=0;i<s;i++)r+=Math.pow(parseInt(e[i]),s);return r===t}static isHappy(t){const e=new Set;for(;t!==1;){if(e.has(t))return!1;e.add(t),t=(t+"").split("").reduce((s,r)=>s+Number(r)*Number(r),0)}return!0}static isPerfect(t){let e=0;for(let s=1;s<t;s++)t%s===0&&(e+=s);return e===t}static isSameSign(t,e){return t>=0&&e>=0||t<=0&&e<=0}static isRange(t,e,s){if(s==null&&(s=e,e=0),e>=s)throw new Error("The maximum value must be greater than the minimum value");return e<=t&&t<s}static lcm(t,e){return t*e/this.gcd(t,e)}static middle(t,e){return e-(e-t>>1)}static random(t,e){if(e==null&&(e=t,t=0),t>=e)throw new Error("The maximum value must be greater than the minimum value");return Math.random()*(e-t)+t}static randomInt(t,e){return Math.floor(this.random(t,e))}static round(t,e=0){if(!Number.isInteger(e))throw new Error("precision must be an integer");const s=Math.pow(10,e);return Math.round(t*s)/s}static scale(t,e,s){if(e[0]>=e[1]||s[0]>=s[1])throw new Error("Invalid range");t=this.clamp(t,e[0],e[1]);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(w.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 st{static READ=1;static WRITE=2;static SHARE=4;static DELETE=8;static CREATE=16;static include(t,e){return(t&e)===e}static add(t,e){return t|e}static remove(t,e){return t&~e}static toggle(t,e){return t^e}}class v{static frequencyStatistics(t){return[...t].reduce((e,s)=>(e[s]=(e[s]||0)+1,e),{})}static isValidBracket(t){const e=[],s={"(":")","[":"]","{":"}"},r=new Set(Object.values(s));for(const i of t)if(i in s)e.push(s[i]);else if(r.has(i)&&i!==e.pop())return!1;return e.length===0}static random(t=8){const e="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";let s="";for(let r=0;r<t;r++)s+=e.charAt(Math.floor(Math.random()*e.length));return s}static template(t,e){return t.replace(/\${(\w+)}/g,(s,r)=>e[r]||"")}static escapeHtml(t){const e={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;","'":"&apos;"," ":"&nbsp;","±":"&plusmn;","×":"&times;","÷":"&divide;","≠":"&ne;","≤":"&le;","≥":"&ge;"},s=new RegExp(`[${Object.keys(e).join("")}]`,"g");return t.replace(s,r=>e[r])}static isEmail(t){return/^[^\s@]+@[^\s@]+\.[^\s@]+$/.test(t)}static isUrl(t){try{return new URL(t),!0}catch{return!1}}static pointLength(t){let e=0;for(let s=0,r=t.length;s<r;){const i=t.codePointAt(s);s+=i>65535?2:1,e++}return e}static pointAt(t,e){if(e>=v.pointLength(t))return;let s=0;for(let r=0,i=t.length;r<i;){const n=t.codePointAt(r);if(!n)return;if(s===e)return String.fromCodePoint(n);r+=n>65535?2:1,s++}}static sliceByPoint(t,e,s=v.pointLength(t)){let r="";for(let i=e;i<s;i++)r+=v.pointAt(t,i);return r}static capitalize(t){return t.charAt(0).toUpperCase()+t.slice(1).toLowerCase()}static reverse(t){return t.split("").reverse().join("")}static truncate(t,e,s="..."){return t.length<=e?this:t.slice(0,e-s.length)+s}static isPalindrome(t){return t.toLowerCase().replace(/[^a-z0-9]/g,"")===v.reverse(t)}static count(t,e){const s=e.replace(/[.*+?^${}()|[\]\\]/g,"\\$&");return(t.match(new RegExp(s,"g"))||[]).length}static toCamelCase(t){return t.replace(/_([a-z])/g,(e,s)=>s.toUpperCase())}static toSnakeCase(t){return t.replace(/[A-Z]/g,e=>`_${e.toLowerCase()}`)}}class rt{static isValidHex(t){return/^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/.test(t)}static isValidRGB(t){return/^rgb\((\d{1,3}),\s*(\d{1,3}),\s*(\d{1,3})\)$/.test(t)}}const M={AUTH_UNAUTHORIZED:"未授权事件",AUTH_LOGIN_SUCCESS:"登录成功事件",AUTH_LOGOUT:"注销事件",AUTH_TOKEN_EXPIRED:"令牌过期事件",REQUEST_ERROR:"请求错误事件",REQUEST_TIMEOUT:"请求超时事件",REQUEST_NETWORK_ERROR:"网络错误事件",UI_SHOW_LOADING:"显示加载事件",UI_HIDE_LOADING:"隐藏加载事件",UI_SHOW_MESSAGE:"显示消息事件"};class x{static instance=null;listeners={};debugMode;constructor(t=!1){this.debugMode=t,Object.keys(M).forEach(e=>{this.listeners[e]=new Set})}static getInstance(t){return x.instance||(x.instance=new x(t)),x.instance}on(t,e){this.debugLog(`添加事件监听: ${M[t]}`),this.listeners[t].add(e)}emit(t,e){this.debugLog(`触发事件: ${M[t]}`,e),this.listeners[t].forEach(s=>{try{s(e)}catch(r){console.error(`事件 ${M[t]} 处理出错:`,r)}})}off(t,e){this.debugLog(`移除事件监听: ${M[t]}`),this.listeners[t].delete(e)}once(t,e){this.debugLog(`添加一次性事件监听: ${M[t]}`);const s=r=>{e(r),this.off(t,s)};this.on(t,s)}clear(){this.debugLog("清除所有事件监听器"),Object.values(this.listeners).forEach(t=>t.clear())}getListenerCount(t){return this.listeners[t].size}debugLog(t,e){this.debugMode&&console.log(`[EventEmitter] ${t}`,e||"")}}class b{static OPERATORS=new Set(["+","-","*","/"]);static VALID_CHARS_REG=/^[0-9+\-*/().\s]+$/;static PRIORITY_MAP=new Map([["+",1],["-",1],["*",2],["/",2],["(",0],[")",0]]);static getPriority(t){return this.PRIORITY_MAP.get(t)??0}static validateExpression(t){if(!t)throw new Error("Expression cannot be empty");if(!this.VALID_CHARS_REG.test(t))throw new Error("Expression contains invalid characters")}static processClosingParenthesis(t,e){for(;!t.isEmpty();){if(t.peek()==="("){t.pop();break}const r=t.pop();r&&e.push(r)}}static processOperator(t,e,s){for(;!e.isEmpty();){const r=e.peek();if(!r||r==="(")break;if(this.getPriority(t)<=this.getPriority(r)){const i=e.pop();i&&s.push(i)}else break}e.push(t)}static applyOperator(t,e,s){switch(s){case"+":return t+e;case"-":return t-e;case"*":return t*e;case"/":if(e===0)throw new Error("Division by zero");return t/e;default:throw new Error("Invalid operator")}}static FLOAT_NUM_REG=/^-?\d*\.?\d+$/;static EXPRESSION_REG=new RegExp("(?<!\\d)-?\\d*\\.?\\d+|[+\\-*/()]","g");static toArr(t){this.validateExpression(t);const e=t.match(b.EXPRESSION_REG);if(!e)throw new Error("Invalid expression format");return e.filter(s=>s.trim()!=="").map(s=>{if(this.FLOAT_NUM_REG.test(s)||this.OPERATORS.has(s)||s==="("||s===")")return s;throw new Error(`Invalid token: ${s}`)})}static infixToPostfix(t){if(!t?.trim())throw new Error("Expression cannot be empty");const e=new P,s=this.toArr(t);console.log(s);const r=[];for(const i of s)this.FLOAT_NUM_REG.test(i)?r.push(i):i==="("?e.push(i):i===")"?this.processClosingParenthesis(e,r):this.OPERATORS.has(i)&&this.processOperator(i,e,r);for(;!e.isEmpty();){const i=e.pop();i&&i!=="("&&r.push(i)}return{postfix:r.join(" "),postfixArr:r}}static evaluatePostfix(t){if(!t.length)throw new Error("Postfix expression cannot be empty");typeof t=="string"&&(t=b.toArr(t));const e=new P;for(const s of t)if(this.FLOAT_NUM_REG.test(s))e.push(parseFloat(s));else if(this.OPERATORS.has(s)){const r=e.pop(),i=e.pop();if(i===void 0||r===void 0)throw new Error("Invalid postfix expression");e.push(this.applyOperator(i,r,s))}return e.pop()??0}}class N{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 P;for(let s=0,r=t.length;s<r;s++){const i=t[s];if(["{","[","("].includes(i))e.push(i);else if(["}","]",")"].includes(i)){if(e.isEmpty())return!1;const n=e.pop();if(!n||!this.isMatchingPair(n,i))return!1}}return e.isEmpty()}static findPath(t,e,s){const r=t.length,i=t[0].length,n=N.arr_2d_init(r,i,!1),a=new P,u=[[-1,0],[0,1],[1,0],[0,-1]];function m(l,h){if(l<0||l>=r||h<0||h>=i||t[l][h]===1||n[l][h])return!1;if(t[l][h]===2)return a.push([l,h]),!0;n[l][h]=!0,a.push([l,h]);for(const[f,g]of u){const O=l+f,C=h+g;if(m(O,C))return!0}return a.pop(),!1}return m(e,s),a}}o.Arr=Y,o.ArrQueue=R,o.ArrStack=P,o.BitPerm=st,o.Color=rt,o.DateEx=A,o.Dictionary=H,o.Emitter=x,o.Expression=b,o.Func=J,o.Graph=W,o.LRU=j,o.Line=y,o.LinkedList=Q,o.Matrix=S,o.MaxHeap=G,o.MemoizeMap=Z,o.MinHeap=$,o.MinStack=_,o.Num=w,o.Obj=K,o.ObjQueue=F,o.ObjStack=V,o.Point=p,o.Reg=tt,o.Roman=et,o.StackApplication=N,o.Str=v,o.TrafficLight=L,o.Triangle=d,o.Vector=E,Object.defineProperty(o,Symbol.toStringTag,{value:"Module"})}));

package/index.d.ts

@@ -12,7 +12,7 @@ declare module "jc-structure" {
     peek(): T | undefined;
     isEmpty(): boolean;
     size(): number;
-    clear(): void;
+    cleanup(): void;
     toString(): string;
   }
 
@@ -23,7 +23,7 @@ declare module "jc-structure" {
     peek(): T | undefined;
     isEmpty(): boolean;
     size(): number;
-    clear(): void;
+    cleanup(): void;
     toString(): string;
   }
 
@@ -37,7 +37,7 @@ declare module "jc-structure" {
     front(): T | undefined;
     isEmpty(): boolean;
     size(): number;
-    clear(): void;
+    cleanup(): void;
     toString(): string;
   }
 
@@ -62,7 +62,7 @@ declare module "jc-structure" {
     removeAt(index: number): T | null;
     isEmpty(): boolean;
     size(): number;
-    clear(): void;
+    cleanup(): void;
     toString(): string;
     toArray(): T[];
     [Symbol.iterator](): Iterator<T>;
@@ -76,7 +76,7 @@ declare module "jc-structure" {
     find(): T | undefined;
     isEmpty(): boolean;
     size(): number;
-    clear(): void;
+    cleanup(): void;
     toString(): string;
   }
 
@@ -107,7 +107,7 @@ declare module "jc-structure" {
     forEach(callbackFunc: (key: K, value: V) => boolean | void): void;
     isEmpty(): boolean;
     size(): number;
-    clear(): void;
+    cleanup(): void;
     toString(): string;
   }
 
@@ -566,6 +566,13 @@ declare module "jc-structure" {
      * @param n
      */
     consecutivecubesSum(n: number): number;
+    /**
+     * #### 获取勾股数，也叫毕达哥拉斯三元组
+     * - 勾股数是指满足勾股定理的三个正整数a、b、c，即a² + b² = c²
+     * - 偶数半方加减一，奇数平方写连续；
+     * @param n 正整数
+     */
+    getPythagoreanTriple(n: number): [number, number, number];
   }
   var Num: NumConstructor;
 

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "jc-structure",
   "private": false,
-  "version": "0.2.13",
+  "version": "0.2.14",
   "type": "module",
   "files": [
     "dist",

package/types/global.d.ts

@@ -10,7 +10,7 @@ interface Structure {
   /**
    * 清除数据结构元素
    */
-  clear(): void;
+  cleanup(): void;
   /**
    * 重写 toString 方法
    */

package/types/linkedList.d.ts

@@ -49,7 +49,7 @@ interface ILinkedList<T> {
   /**
    * #### 清空链表
    */
-  clear(): void;
+  cleanup(): void;
   /**
    * #### 将链表转换为字符串
    */