jc-structure 0.1.2 → 0.1.5

package/dist/jc-structure.js

@@ -10,10 +10,19 @@ class j {
     return delete this.items[this.lowestCount], this.lowestCount++, t;
   }
   enqueue(...t) {
+    if (t.length === 0)
+      return this;
+    const e = t.length === 1 && Array.isArray(t[0]) ? t[0] : t;
+    return this.batchEnqueue(e), this;
+  }
+  batchEnqueue(t) {
     t.forEach((e) => {
-      this.items[this.count] = e, this.count++;
+      this.isValidItem(e) && (this.items[this.count] = e, this.count++);
     });
   }
+  isValidItem(t) {
+    return t != null;
+  }
   front() {
     return this.isEmpty() ? void 0 : this.items[this.lowestCount];
   }
@@ -42,10 +51,36 @@ class U {
     return delete this.items[this.count], t;
   }
   push(...t) {
+    if (t.length === 0)
+      return this;
+    const e = this.extractItems(t);
+    return this.addValidItems(e), this;
+  }
+  /**
+   * 从参数中提取需要添加的元素
+   * @param args 传入的参数
+   * @returns 需要添加的元素数组
+   */
+  extractItems(t) {
+    return t.length === 1 && Array.isArray(t[0]) ? t[0] : t;
+  }
+  /**
+   * 添加有效元素到集合中
+   * @param items 要添加的元素数组
+   */
+  addValidItems(t) {
     t.forEach((e) => {
-      this.items[this.count] = e, this.count++;
+      this.isValidItem(e) && (this.items[this.count] = e, this.count++);
     });
   }
+  /**
+   * 验证元素是否有效
+   * @param item 要验证的元素
+   * @returns 是否有效
+   */
+  isValidItem(t) {
+    return t != null;
+  }
   peek() {
     return this.isEmpty() ? void 0 : this.items[this.count - 1];
   }
@@ -62,13 +97,13 @@ class U {
     return this.isEmpty() ? "" : `Stack(count: ${this.count}):[${this.items[this.count - 1]},...rest]`;
   }
 }
-function O(r, t) {
+function N(r, t) {
   return r === t ? 0 : r < t ? -1 : 1;
 }
-class m {
+class w {
   heap = [];
   compareFn;
-  constructor(t = O) {
+  constructor(t = N) {
     this.compareFn = t;
   }
   static getLeftIndex(t) {
@@ -99,7 +134,7 @@ class m {
     return this.heap.toString();
   }
 }
-class P extends m {
+class R extends w {
   insert(t) {
     return t ? !1 : (this.heap.push(t), this.siftUp(this.heap.length - 1), !0);
   }
@@ -110,24 +145,24 @@ class P extends m {
     return this.heap[0] = this.heap.pop(), this.siftDown(0), t;
   }
   siftUp(t) {
-    let e = t, s = m.getLeftIndex(e), i = m.getRightIndex(e), n = this.size();
-    s < n && this.compareFn(this.heap[e], this.heap[s]) === -1 && (e = s), i < n && this.compareFn(this.heap[e], this.heap[i]) === 1 && (e = i), e !== t && (m.swap(this.heap, t, e), this.siftUp(e));
+    let e = t, s = w.getLeftIndex(e), i = w.getRightIndex(e), n = this.size();
+    s < n && this.compareFn(this.heap[e], this.heap[s]) === -1 && (e = s), i < n && this.compareFn(this.heap[e], this.heap[i]) === 1 && (e = i), e !== t && (w.swap(this.heap, t, e), this.siftUp(e));
   }
   siftDown(t) {
-    let e = m.getParentIndex(t);
+    let e = w.getParentIndex(t);
     for (; t > 0 && e && this.compareFn(this.heap[e], this.heap[t]) === 1; )
-      m.swap(this.heap, e, t), t = e, e = m.getParentIndex(t);
+      w.swap(this.heap, e, t), t = e, e = w.getParentIndex(t);
   }
 }
-class V extends P {
-  constructor(t = (e, s) => O(s, e)) {
+class q extends R {
+  constructor(t = (e, s) => N(s, e)) {
     super(t);
   }
 }
-function R(r) {
+function k(r) {
   return { value: r };
 }
-class D {
+class _ {
   capacity;
   length = 0;
   head = null;
@@ -157,14 +192,14 @@ class D {
   }
   update(t, e) {
     let s = this.lookup.get(t);
-    s ? (this.detach(s), this.prepend(s), s.value = e) : (s = R(e), this.length++, this.prepend(s), this.trimCache(), this.lookup.set(t, s), this.reverseLookup);
+    s ? (this.detach(s), this.prepend(s), s.value = e) : (s = k(e), this.length++, this.prepend(s), this.trimCache(), this.lookup.set(t, s), this.reverseLookup);
   }
 }
-let M = class {
+let A = class {
   value;
   next = void 0;
 };
-class _ {
+class $ {
   count = 0;
   head = void 0;
   constructor() {
@@ -197,7 +232,7 @@ class _ {
     return this.getElementAt(t)?.value;
   }
   insert(t, e) {
-    let s = new M();
+    let s = new A();
     if (s.value = t, e > this.count || e < 0)
       throw new Error("index error");
     this.count++;
@@ -209,7 +244,7 @@ class _ {
     i = this.getElementAt(e - 1), n = i.next, i.next = s, s.next = n;
   }
   push(t) {
-    let e = new M();
+    let e = new A();
     if (e.value = t, this.count++, this.isEmpty()) {
       this.head = e;
       return;
@@ -243,7 +278,7 @@ class _ {
     return t = t.slice(0, -1), t;
   }
 }
-class k {
+class z {
   key;
   value;
   constructor(t, e) {
@@ -253,7 +288,7 @@ class k {
 function L(r, t = { emptyString: !1, zeroNumber: !1 }) {
   return r == null ? !(t.emptyString && r === "" || t.zeroNumber && r === 0) : !1;
 }
-class z {
+class V {
   table = [];
   constructor() {
   }
@@ -272,7 +307,7 @@ class z {
       let s = this.getItemIndex(t);
       this.table[s].value = e;
     } else {
-      const s = new k(t, e);
+      const s = new z(t, e);
       this.table.push(s);
     }
   }
@@ -323,12 +358,12 @@ class z {
     return t = t.slice(0, -1), t;
   }
 }
-class q {
+class H {
   isDirected;
   vertices;
   adjList;
   constructor(t = !1) {
-    this.isDirected = t, this.vertices = [], this.adjList = new z();
+    this.isDirected = t, this.vertices = [], this.adjList = new V();
   }
   addVertex(t) {
     this.vertices.includes(t) || (this.vertices.push(t), this.adjList.set(t, []));
@@ -350,10 +385,10 @@ class q {
     return t;
   }
 }
-class f {
+class g {
   _data;
   static zero(t) {
-    return new f(...Array(t).fill(0));
+    return new g(...Array(t).fill(0));
   }
   constructor(...t) {
     this._data = t;
@@ -372,7 +407,7 @@ class f {
     if (t === 0)
       throw new Error("Cannot normalize a zero vector");
     const e = this._data.map((s) => s / t);
-    return new f(...e);
+    return new g(...e);
   }
   add(t) {
     if (this.dimension !== t.dimension)
@@ -380,7 +415,7 @@ class f {
     const e = this._data.map(
       (s, i) => s + t._data[i]
     );
-    return new f(...e);
+    return new g(...e);
   }
   sub(t) {
     if (this.dimension !== t.dimension)
@@ -388,10 +423,10 @@ class f {
     const e = this._data.map(
       (s, i) => s - t._data[i]
     );
-    return new f(...e);
+    return new g(...e);
   }
   mul(t) {
-    return new f(...this._data.map((e) => e * t));
+    return new g(...this._data.map((e) => e * t));
   }
   dot(t) {
     if (this.dimension !== t.dimension)
@@ -408,10 +443,10 @@ class f {
     return this.mul(-1);
   }
 }
-class x {
+class E {
   _matrix;
   static zero(t, e) {
-    return new x(
+    return new E(
       Array.from({ length: t }, () => Array.from({ length: e }, () => 0))
     );
   }
@@ -431,10 +466,10 @@ class x {
     return this.row * this.col;
   }
   rowVector(t) {
-    return new f(...this._matrix[t]);
+    return new g(...this._matrix[t]);
   }
   colVector(t) {
-    return new f(...this._matrix.map((e) => e[t]));
+    return new g(...this._matrix.map((e) => e[t]));
   }
   getItem(t) {
     return this._matrix[t[0]][t[1]];
@@ -443,7 +478,7 @@ class x {
     return this._matrix[t[0]][t[1]] = e, this;
   }
   mul(t) {
-    return new x(this._matrix.map((e) => e.map((s) => s * t)));
+    return new E(this._matrix.map((e) => e.map((s) => s * t)));
   }
   div(t) {
     return this.mul(1 / t);
@@ -451,7 +486,7 @@ class x {
   add(t) {
     if (this.row !== t.row || this.col !== t.col)
       throw new Error("Matrix dimensions do not match");
-    return new x(
+    return new E(
       this._matrix.map(
         (e, s) => e.map((i, n) => i + t.getItem([s, n]))
       )
@@ -469,14 +504,14 @@ class x {
   mulVector(t) {
     if (this.col !== t.dimension)
       throw new Error("Matrix dimensions do not match");
-    return new x(
+    return new E(
       this._matrix.map((e) => e.map((s, i) => s * t.getItem(i)))
     );
   }
   mulMatrix(t) {
     if (this.col !== t.row)
       throw new Error("Matrix dimensions do not match");
-    const e = x.zero(this.row, t.col);
+    const e = E.zero(this.row, t.col);
     for (let s = 0; s < this.row; s++) {
       const i = this.rowVector(s);
       for (let n = 0; n < this.col; n++)
@@ -498,102 +533,99 @@ class a {
     return a.distance(this, t);
   }
 }
-class u {
+class l {
   // 使用更合适的精度阈值常量
   static EPSILON = 1e-10;
-  // 静态方法：计算斜率
-  static sloped(t) {
-    const e = t.p2.x - t.p1.x, s = t.p2.y - t.p1.y;
-    return Math.abs(e) < u.EPSILON ? Math.abs(s) < u.EPSILON ? 0 : null : s / e;
-  }
-  // 静态方法：判断两条线是否平行
-  static isParallel(t, e) {
-    const s = u.sloped(t), i = u.sloped(e);
-    return s === null && i === null ? !0 : s === null || i === null ? !1 : Math.abs(s - i) < u.EPSILON;
-  }
-  // 静态方法：获取两条线的交点
-  static getIntersection(t, e) {
-    if (u.isParallel(t, e)) return null;
-    const s = t.p1.x, i = t.p1.y, n = t.p2.x, o = t.p2.y, l = e.p1.x, c = e.p1.y, p = e.p2.x, g = e.p2.y, d = (s - n) * (c - g) - (i - o) * (l - p);
-    if (Math.abs(d) < u.EPSILON) return null;
-    const w = ((s - l) * (c - g) - (i - c) * (l - p)) / d, I = -((s - n) * (i - c) - (i - o) * (s - l)) / d;
-    if (w >= 0 && w <= 1 && I >= 0 && I <= 1) {
-      const C = s + w * (n - s), A = i + w * (o - i);
-      return new a(C, A);
+  static sloped(t, e = l.EPSILON) {
+    const s = t.p2.x - t.p1.x, i = t.p2.y - t.p1.y;
+    return Math.abs(s) < e ? Math.abs(i) < e ? 0 : null : i / s;
+  }
+  static isParallel(t, e, s = l.EPSILON) {
+    const i = l.sloped(t), n = l.sloped(e);
+    return i === null && n === null ? !0 : i === null || n === null ? !1 : Math.abs(i - n) < s;
+  }
+  static getIntersection(t, e, s = l.EPSILON) {
+    if (l.isParallel(t, e)) return null;
+    const i = t.p1.x, n = t.p1.y, o = t.p2.x, h = t.p2.y, u = e.p1.x, p = e.p1.y, d = e.p2.x, m = e.p2.y, f = (i - o) * (p - m) - (n - h) * (u - d);
+    if (Math.abs(f) < s) return null;
+    const y = ((i - u) * (p - m) - (n - p) * (u - d)) / f, S = -((i - o) * (n - p) - (n - h) * (i - u)) / f;
+    if (y >= 0 && y <= 1 && S >= 0 && S <= 1) {
+      const O = i + y * (o - i), P = n + y * (h - n);
+      return new a(O, P);
     }
     return null;
   }
-  // 静态方法：判断两条线段是否相交
   static isIntersecting(t, e) {
-    return u.getIntersection(t, e) !== null;
-  }
-  // 静态方法：计算点到线段的距离
-  static distanceToPoint(t, e) {
-    const s = e.x - t.p1.x, i = e.y - t.p1.y, n = t.p2.x - t.p1.x, o = t.p2.y - t.p1.y, l = s * n + i * o, c = n * n + o * o;
-    let p = -1;
-    c > u.EPSILON && (p = l / c);
-    let g, d;
-    p < 0 ? (g = t.p1.x, d = t.p1.y) : p > 1 ? (g = t.p2.x, d = t.p2.y) : (g = t.p1.x + p * n, d = t.p1.y + p * o);
-    const w = e.x - g, I = e.y - d;
-    return Math.hypot(w + I);
+    return l.getIntersection(t, e) !== null;
+  }
+  static distanceToPoint(t, e, s = l.EPSILON) {
+    const i = e.x - t.p1.x, n = e.y - t.p1.y, o = t.p2.x - t.p1.x, h = t.p2.y - t.p1.y, u = i * o + n * h, p = o * o + h * h;
+    let d = -1;
+    p > s && (d = u / p);
+    let m, f;
+    d < 0 ? (m = t.p1.x, f = t.p1.y) : d > 1 ? (m = t.p2.x, f = t.p2.y) : (m = t.p1.x + d * o, f = t.p1.y + d * h);
+    const y = e.x - m, S = e.y - f;
+    return Math.hypot(y + S);
   }
   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 a(t, e);
   }
-  // 获取线段的角度（弧度）
   get angle() {
     return Math.atan2(this.p2.y - this.p1.y, this.p2.x - this.p1.x);
   }
-  // 判断点是否在线段上
-  containsPoint(t) {
-    const e = (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(e) > u.EPSILON ? !1 : (t.x - this.p1.x) * (t.x - this.p2.x) + (t.y - this.p1.y) * (t.y - this.p2.y) <= u.EPSILON;
+  containsPoint(t, e = l.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 < u.EPSILON) return new a(0, 0);
+    if (t < l.EPSILON) return new a(0, 0);
     const e = (this.p2.x - this.p1.x) / t, s = (this.p2.y - this.p1.y) / t;
     return new a(e, s);
   }
+  get start() {
+    return this.p1;
+  }
+  get end() {
+    return this.p2;
+  }
 }
-class N {
+class C {
   static EPSILON = 1e-10;
   name;
   constructor(t) {
     this.name = t;
   }
 }
-class h extends N {
+class c extends C {
   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 (!h.isValid(t, e, s))
+    if (!c.isValid(t, e, s))
       throw new Error("Invalid triangle");
     const i = (t + e + s) / 2;
     return Math.sqrt(i * (i - t) * (i - e) * (i - s));
   }
   static getType(t, e, s) {
-    if (!h.isValid(t, e, s))
+    if (!c.isValid(t, e, s))
       throw new Error("Invalid triangle sides");
-    const i = [t, e, s].sort((c, p) => c - p), [n, o, l] = i;
-    return Math.abs(n - o) < h.EPSILON && Math.abs(o - l) < h.EPSILON ? "equilateral" : Math.abs(n - o) < h.EPSILON || Math.abs(o - l) < h.EPSILON ? "isosceles" : "scalene";
+    const i = [t, e, s].sort((u, p) => u - p), [n, o, h] = i;
+    return Math.abs(n - o) < c.EPSILON && Math.abs(o - h) < c.EPSILON ? "equilateral" : Math.abs(n - o) < c.EPSILON || Math.abs(o - h) < c.EPSILON ? "isosceles" : "scalene";
   }
   static getAngles(t, e, s) {
-    if (!h.isValid(t, e, s))
+    if (!c.isValid(t, e, s))
       throw new Error("Invalid triangle sides");
     const i = Math.acos((e * e + s * s - t * t) / (2 * e * s)), n = Math.acos((t * t + s * s - e * e) / (2 * t * s)), o = Math.PI - i - n;
     return [i, n, o];
@@ -609,7 +641,7 @@ class h 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;
+    ) < C.EPSILON;
   }
   get side() {
     return [
@@ -619,19 +651,19 @@ class h extends N {
     ];
   }
   perimeter() {
-    return h.isValid(this.side[0], this.side[1], this.side[2]), this.side.reduce((t, e) => t + e, 0);
+    return c.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 h.area(t, e, s);
+    return c.area(t, e, s);
   }
   get type() {
     const [t, e, s] = this.side;
-    return h.getType(t, e, s);
+    return c.getType(t, e, s);
   }
   get angles() {
     const [t, e, s] = this.side;
-    return h.getAngles(t, e, s);
+    return c.getAngles(t, e, s);
   }
   get centroid() {
     return new a(
@@ -645,32 +677,32 @@ class h extends N {
   }
   get circumcenter() {
     const t = 2 * (this.p1.x * (this.p2.y - this.p3.y) + this.p2.x * (this.p3.y - this.p1.y) + this.p3.x * (this.p1.y - this.p2.y));
-    if (Math.abs(t) < h.EPSILON)
+    if (Math.abs(t) < c.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 a(e, s);
   }
   containsPoint(t) {
-    const e = h.area(
+    const e = c.area(
       a.distance(t, this.p1),
       a.distance(t, this.p2),
       a.distance(this.p1, this.p2)
-    ), s = h.area(
+    ), s = c.area(
       a.distance(t, this.p2),
       a.distance(t, this.p3),
       a.distance(this.p2, this.p3)
-    ), i = h.area(
+    ), i = c.area(
       a.distance(t, this.p3),
       a.distance(t, this.p1),
       a.distance(this.p3, this.p1)
     );
-    return Math.abs(e + s + i - this.area()) < h.EPSILON;
+    return Math.abs(e + s + i - this.area()) < c.EPSILON;
   }
 }
-function H(r) {
+function W(r) {
   return new Promise((t) => setTimeout(t, r));
 }
-function W(r) {
+function T(r) {
   const t = [], e = {
     "(": ")",
     "[": "]",
@@ -683,23 +715,23 @@ function W(r) {
       return !1;
   return t.length === 0;
 }
-function S(r) {
+function M(r) {
   return r !== null && (typeof r == "object" || typeof r == "function");
 }
-class T {
+class F {
   map = /* @__PURE__ */ new Map();
   weakMap = /* @__PURE__ */ new WeakMap();
   set(t, e) {
-    S(t) ? this.weakMap.set(t, e) : this.map.set(t, e);
+    M(t) ? this.weakMap.set(t, e) : this.map.set(t, e);
   }
   get(t) {
-    return S(t) ? this.weakMap.get(t) : this.map.get(t);
+    return M(t) ? this.weakMap.get(t) : this.map.get(t);
   }
   has(t) {
-    return S(t) ? this.weakMap.has(t) : this.map.has(t);
+    return M(t) ? this.weakMap.has(t) : this.map.has(t);
   }
 }
-function F(r) {
+function G(r) {
   if (!r.length) return [];
   const t = [[r[0]]];
   for (let s = 1, i = r.length; s < i; s++) {
@@ -717,7 +749,7 @@ function F(r) {
   }
   return t[t.length - 1];
 }
-class G {
+class B {
   static ROMAN_MAP = /* @__PURE__ */ new Map([
     ["M", 1e3],
     ["CM", 900],
@@ -746,10 +778,10 @@ class G {
       if (this.ROMAN_MAP.has(o))
         s += this.ROMAN_MAP.get(o), i += 2;
       else {
-        const l = t[i], c = this.ROMAN_MAP.get(l);
-        if (!c)
+        const h = t[i], u = this.ROMAN_MAP.get(h);
+        if (!u)
           throw new Error(`Invalid Roman numeral sequence at position ${i}`);
-        s += c, i += 1;
+        s += u, i += 1;
       }
     }
     if (this.toRoman(s) !== t)
@@ -768,7 +800,7 @@ class G {
     return e;
   }
 }
-function B(r) {
+function X(r) {
   let t;
   const e = new Proxy(r, {
     construct(s, i, n) {
@@ -781,7 +813,7 @@ function B(r) {
   });
   return r.prototype.constructor = e, e;
 }
-const y = {
+const x = {
   AUTH_UNAUTHORIZED: "未授权事件",
   AUTH_LOGIN_SUCCESS: "登录成功事件",
   AUTH_LOGOUT: "注销事件",
@@ -793,12 +825,12 @@ const y = {
   UI_HIDE_LOADING: "隐藏加载事件",
   UI_SHOW_MESSAGE: "显示消息事件"
 };
-class b {
+class v {
   static instance = null;
   listeners = {};
   debugMode;
   constructor(t = !1) {
-    this.debugMode = t, Object.keys(y).forEach(
+    this.debugMode = t, Object.keys(x).forEach(
       (e) => {
         this.listeners[e] = /* @__PURE__ */ new Set();
       }
@@ -806,7 +838,7 @@ class b {
   }
   // 单例模式
   static getInstance(t) {
-    return b.instance || (b.instance = new b(t)), b.instance;
+    return v.instance || (v.instance = new v(t)), v.instance;
   }
   /**
    * 添加事件监听器
@@ -814,7 +846,7 @@ class b {
    * @param listener 监听函数
    */
   on(t, e) {
-    this.debugLog(`添加事件监听: ${y[t]}`), this.listeners[t].add(e);
+    this.debugLog(`添加事件监听: ${x[t]}`), this.listeners[t].add(e);
   }
   /**
    * 触发事件
@@ -822,11 +854,11 @@ class b {
    * @param params 事件参数
    */
   emit(t, e) {
-    this.debugLog(`触发事件: ${y[t]}`, e), this.listeners[t].forEach((s) => {
+    this.debugLog(`触发事件: ${x[t]}`, e), this.listeners[t].forEach((s) => {
       try {
         s(e);
       } catch (i) {
-        console.error(`事件 ${y[t]} 处理出错:`, i);
+        console.error(`事件 ${x[t]} 处理出错:`, i);
       }
     });
   }
@@ -836,7 +868,7 @@ class b {
    * @param listener 监听函数
    */
   off(t, e) {
-    this.debugLog(`移除事件监听: ${y[t]}`), this.listeners[t].delete(e);
+    this.debugLog(`移除事件监听: ${x[t]}`), this.listeners[t].delete(e);
   }
   /**
    * 添加一次性事件监听器
@@ -844,7 +876,7 @@ class b {
    * @param listener 监听函数
    */
   once(t, e) {
-    this.debugLog(`添加一次性事件监听: ${y[t]}`);
+    this.debugLog(`添加一次性事件监听: ${x[t]}`);
     const s = (i) => {
       e(i), this.off(t, s);
     };
@@ -866,7 +898,7 @@ class b {
     this.debugMode && console.log(`[EventEmitter] ${t}`, e || "");
   }
 }
-const E = {
+const b = {
   scriptRegex: /<script\b[^<]*(?:(?!<\/script>)<[^<]*)*<\/script>/gi,
   javascriptRegex: /javascript:/gi,
   eventHandlerRegex: /on\w+\s*=/gi,
@@ -913,12 +945,12 @@ const E = {
   ]),
   allowedAttributes: /* @__PURE__ */ new Set(["class", "id", "href", "src", "alt", "title"])
 };
-class v {
+class I {
   static instance;
   constructor() {
   }
   static getInstance() {
-    return v.instance || (v.instance = new v()), v.instance;
+    return I.instance || (I.instance = new I()), I.instance;
   }
   /**
    * 创建DOM元素
@@ -928,7 +960,7 @@ class v {
    * @returns 创建的HTMLElement
    */
   createElement(t, e = {}, s = "") {
-    if (!E.allowedTags.has(t.toLowerCase()))
+    if (!b.allowedTags.has(t.toLowerCase()))
       throw new Error(`Unsupported tag: ${t}`);
     const i = document.createElement(t);
     return this._processAttributes(i, e), this._processContent(i, s), i;
@@ -964,7 +996,7 @@ class v {
    */
   _processAttributes(t, e) {
     Object.entries(e).forEach(([s, i]) => {
-      if (!E.allowedAttributes.has(s) && !s.startsWith("data-")) {
+      if (!b.allowedAttributes.has(s) && !s.startsWith("data-")) {
         console.warn(`Potentially unsafe attribute: ${s}`);
         return;
       }
@@ -1003,10 +1035,10 @@ class v {
    * @private
    */
   _sanitizeHtml(t) {
-    return t.replace(E.scriptRegex, "").replace(E.javascriptRegex, "").replace(E.eventHandlerRegex, "");
+    return t.replace(b.scriptRegex, "").replace(b.javascriptRegex, "").replace(b.eventHandlerRegex, "");
   }
 }
-class X {
+class Q {
   features;
   constructor() {
     this.features = this.detectFeatures();
@@ -1155,32 +1187,32 @@ Text.prototype.surround = function(r = "strong", t = "") {
   if (!this.nodeValue || !r || !t) return null;
   const s = r.split("."), i = s[0], n = s.slice(1).join(" "), o = this.textContent.indexOf(t);
   if (o < 0) return null;
-  const l = document.createRange();
-  l.setStart(this, o), l.setEnd(this, o + t.length);
-  const c = document.createElement(i);
-  return n && (c.className = n), l.surroundContents(c), c;
+  const h = document.createRange();
+  h.setStart(this, o), h.setEnd(this, o + t.length);
+  const u = document.createElement(i);
+  return n && (u.className = n), h.surroundContents(u), u;
 };
 export {
-  z as Dictionary,
-  v as DomHelper,
-  b as Emitter,
-  q as Graph,
-  F as LIS,
-  D as LRU,
-  u as Line,
-  _ as LinkedList,
-  x as Matrix,
-  V as MaxHeap,
-  T as MemoizeMap,
-  P as MinHeap,
+  V as Dictionary,
+  I as DomHelper,
+  v as Emitter,
+  H as Graph,
+  G as LIS,
+  _ as LRU,
+  l as Line,
+  $ as LinkedList,
+  E as Matrix,
+  q as MaxHeap,
+  F as MemoizeMap,
+  R as MinHeap,
   a as Point,
   j as Queue,
-  G as Roman,
+  B as Roman,
   U as Stack,
-  h as Triangle,
-  f as Vector,
-  X as WebAppManager,
-  W as isValidBracket,
-  B as singleton,
-  H as sleep
+  c as Triangle,
+  g as Vector,
+  Q as WebAppManager,
+  T as isValidBracket,
+  X as singleton,
+  W as sleep
 };

package/dist/jc-structure.umd.cjs

@@ -1,2 +1,2 @@
-(function(a,I){typeof exports=="object"&&typeof module<"u"?I(exports):typeof define=="function"&&define.amd?define(["exports"],I):(a=typeof globalThis<"u"?globalThis:a||self,I(a["jc-structure"]={}))})(this,(function(a){"use strict";class I{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){t.forEach(e=>{this.items[this.count]=e,this.count++})}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 k{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){t.forEach(e=>{this.items[this.count]=e,this.count++})}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]`}}function N(r,t){return r===t?0:r<t?-1:1}class m{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 O extends m{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=m.getLeftIndex(e),i=m.getRightIndex(e),n=this.size();s<n&&this.compareFn(this.heap[e],this.heap[s])===-1&&(e=s),i<n&&this.compareFn(this.heap[e],this.heap[i])===1&&(e=i),e!==t&&(m.swap(this.heap,t,e),this.siftUp(e))}siftDown(t){let e=m.getParentIndex(t);for(;t>0&&e&&this.compareFn(this.heap[e],this.heap[t])===1;)m.swap(this.heap,e,t),t=e,e=m.getParentIndex(t)}}class j extends O{constructor(t=(e,s)=>N(s,e)){super(t)}}function z(r){return{value:r}}class U{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=z(e),this.length++,this.prepend(s),this.trimCache(),this.lookup.set(t,s),this.reverseLookup)}}let A=class{value;next=void 0};class V{count=0;head=void 0;constructor(){}indexOf(t){let e=this.head,s=0,i=!1;for(;e;){if(this.equals(e.value,t)){i=!0;break}s++,e=e.next}return i?s:-1}equals(t,e){return!1}getElementAt(t){if(t<0||t>=this.count)return;if(t===0)return this.head;let e=this.head;for(let s=0;s<t;s++)e=e?.next;return e}getValueAt(t){return this.getElementAt(t)?.value}insert(t,e){let s=new A;if(s.value=t,e>this.count||e<0)throw new Error("index error");this.count++;let i,n;if(e===0){s.next=this.head,this.head=s;return}i=this.getElementAt(e-1),n=i.next,i.next=s,s.next=n}push(t){let e=new A;if(e.value=t,this.count++,this.isEmpty()){this.head=e;return}let s=this.getElementAt(this.count-1);s.next=e}remove(t){const e=this.indexOf(t);return e===-1?void 0:this.removeAt(e)}removeAt(t){if(this.isEmpty()||t<0||t>=this.count)return;let e=this.getElementAt(t),s=this.getElementAt(t-1),i=e?.next;return t===0&&(this.head=i),s&&(s.next=i),this.count--,e?.value}isEmpty(){return this.count===0}size(){return this.count}clear(){this.count=0,this.head=void 0}toString(){let t="",e=this.head;for(;e;)t+=e.value,t+=",",e=e.next;return t=t.slice(0,-1),t}}class D{key;value;constructor(t,e){this.key=t,this.value=e}}function C(r,t={emptyString:!1,zeroNumber:!1}){return r==null?!(t.emptyString&&r===""||t.zeroNumber&&r===0):!1}class P{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(C(t))throw new Error("key is required");if(C(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 D(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 i=this.table[e];if(!t(i.key,i.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 H{isDirected;vertices;adjList;constructor(t=!1){this.isDirected=t,this.vertices=[],this.adjList=new P}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 f{_data;static zero(t){return new f(...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 f(...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,i)=>s+t._data[i]);return new f(...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,i)=>s-t._data[i]);return new f(...e)}mul(t){return new f(...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,i)=>e+s*t._data[i],0)}pos(){return this.mul(1)}neg(){return this.mul(-1)}}class w{_matrix;static zero(t,e){return new w(Array.from({length:t},()=>Array.from({length:e},()=>0)))}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 f(...this._matrix[t])}colVector(t){return new f(...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 w(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 w(this._matrix.map((e,s)=>e.map((i,n)=>i+t.getItem([s,n]))))}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 w(this._matrix.map(e=>e.map((s,i)=>s*t.getItem(i))))}mulMatrix(t){if(this.col!==t.row)throw new Error("Matrix dimensions do not match");const e=w.zero(this.row,t.col);for(let s=0;s<this.row;s++){const i=this.rowVector(s);for(let n=0;n<this.col;n++)e.setItem([s,n],i.dot(t.colVector(n)))}return e}}class h{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 h.distance(this,t)}}class p{static EPSILON=1e-10;static sloped(t){const e=t.p2.x-t.p1.x,s=t.p2.y-t.p1.y;return Math.abs(e)<p.EPSILON?Math.abs(s)<p.EPSILON?0:null:s/e}static isParallel(t,e){const s=p.sloped(t),i=p.sloped(e);return s===null&&i===null?!0:s===null||i===null?!1:Math.abs(s-i)<p.EPSILON}static getIntersection(t,e){if(p.isParallel(t,e))return null;const s=t.p1.x,i=t.p1.y,n=t.p2.x,o=t.p2.y,l=e.p1.x,u=e.p1.y,d=e.p2.x,y=e.p2.y,g=(s-n)*(u-y)-(i-o)*(l-d);if(Math.abs(g)<p.EPSILON)return null;const v=((s-l)*(u-y)-(i-u)*(l-d))/g,S=-((s-n)*(i-u)-(i-o)*(s-l))/g;if(v>=0&&v<=1&&S>=0&&S<=1){const B=s+v*(n-s),X=i+v*(o-i);return new h(B,X)}return null}static isIntersecting(t,e){return p.getIntersection(t,e)!==null}static distanceToPoint(t,e){const s=e.x-t.p1.x,i=e.y-t.p1.y,n=t.p2.x-t.p1.x,o=t.p2.y-t.p1.y,l=s*n+i*o,u=n*n+o*o;let d=-1;u>p.EPSILON&&(d=l/u);let y,g;d<0?(y=t.p1.x,g=t.p1.y):d>1?(y=t.p2.x,g=t.p2.y):(y=t.p1.x+d*n,g=t.p1.y+d*o);const v=e.x-y,S=e.y-g;return Math.hypot(v+S)}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 h(t,e)}get angle(){return Math.atan2(this.p2.y-this.p1.y,this.p2.x-this.p1.x)}containsPoint(t){const e=(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(e)>p.EPSILON?!1:(t.x-this.p1.x)*(t.x-this.p2.x)+(t.y-this.p1.y)*(t.y-this.p2.y)<=p.EPSILON}get direction(){const t=this.length;if(t<p.EPSILON)return new h(0,0);const e=(this.p2.x-this.p1.x)/t,s=(this.p2.y-this.p1.y)/t;return new h(e,s)}}class R{static EPSILON=1e-10;name;constructor(t){this.name=t}}class c extends R{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(!c.isValid(t,e,s))throw new Error("Invalid triangle");const i=(t+e+s)/2;return Math.sqrt(i*(i-t)*(i-e)*(i-s))}static getType(t,e,s){if(!c.isValid(t,e,s))throw new Error("Invalid triangle sides");const i=[t,e,s].sort((u,d)=>u-d),[n,o,l]=i;return Math.abs(n-o)<c.EPSILON&&Math.abs(o-l)<c.EPSILON?"equilateral":Math.abs(n-o)<c.EPSILON||Math.abs(o-l)<c.EPSILON?"isosceles":"scalene"}static getAngles(t,e,s){if(!c.isValid(t,e,s))throw new Error("Invalid triangle sides");const i=Math.acos((e*e+s*s-t*t)/(2*e*s)),n=Math.acos((t*t+s*s-e*e)/(2*t*s)),o=Math.PI-i-n;return[i,n,o]}p1;p2;p3;constructor(t,e,s,i="triangle"){if(super(i),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))<R.EPSILON}get side(){return[h.distance(this.p1,this.p2),h.distance(this.p2,this.p3),h.distance(this.p3,this.p1)]}perimeter(){return c.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 c.area(t,e,s)}get type(){const[t,e,s]=this.side;return c.getType(t,e,s)}get angles(){const[t,e,s]=this.side;return c.getAngles(t,e,s)}get centroid(){return new h((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,i=this.perimeter()/2,n=(t*this.p1.x+e*this.p2.x+s*this.p3.x)/i,o=(t*this.p1.y+e*this.p2.y+s*this.p3.y)/i;return new h(n,o)}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)<c.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 h(e,s)}containsPoint(t){const e=c.area(h.distance(t,this.p1),h.distance(t,this.p2),h.distance(this.p1,this.p2)),s=c.area(h.distance(t,this.p2),h.distance(t,this.p3),h.distance(this.p2,this.p3)),i=c.area(h.distance(t,this.p3),h.distance(t,this.p1),h.distance(this.p3,this.p1));return Math.abs(e+s+i-this.area())<c.EPSILON}}function $(r){return new Promise(t=>setTimeout(t,r))}function W(r){const t=[],e={"(":")","[":"]","{":"}"},s=new Set(Object.values(e));for(const i of r)if(i in e)t.push(e[i]);else if(s.has(i)&&i!==t.pop())return!1;return t.length===0}function L(r){return r!==null&&(typeof r=="object"||typeof r=="function")}class _{map=new Map;weakMap=new WeakMap;set(t,e){L(t)?this.weakMap.set(t,e):this.map.set(t,e)}get(t){return L(t)?this.weakMap.get(t):this.map.get(t)}has(t){return L(t)?this.weakMap.has(t):this.map.has(t)}}function q(r){if(!r.length)return[];const t=[[r[0]]];for(let s=1,i=r.length;s<i;s++){const n=r[s];e(n)}function e(s){for(let i=t.length-1;i>=0;i--){const n=t[i],o=n[t[i].length-1];if(o<s){t[i+1]=[...n,s];break}else o>s&&i===0&&(t[i]=[s])}}return t[t.length-1]}class T{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 o of t)if(!e.has(o))throw new Error(`Invalid Roman numeral character: ${o}`);let s=0,i=0;for(;i<t.length;){const o=t.slice(i,i+2);if(this.ROMAN_MAP.has(o))s+=this.ROMAN_MAP.get(o),i+=2;else{const l=t[i],u=this.ROMAN_MAP.get(l);if(!u)throw new Error(`Invalid Roman numeral sequence at position ${i}`);s+=u,i+=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,i]of this.ROMAN_MAP)for(;t>=i;)e+=s,t-=i;return e}}function G(r){let t;const e=new Proxy(r,{construct(s,i,n){return t||(t=Reflect.construct(s,i,n)),t}});return r.prototype.constructor=e,e}const E={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(E).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(`添加事件监听: ${E[t]}`),this.listeners[t].add(e)}emit(t,e){this.debugLog(`触发事件: ${E[t]}`,e),this.listeners[t].forEach(s=>{try{s(e)}catch(i){console.error(`事件 ${E[t]} 处理出错:`,i)}})}off(t,e){this.debugLog(`移除事件监听: ${E[t]}`),this.listeners[t].delete(e)}once(t,e){this.debugLog(`添加一次性事件监听: ${E[t]}`);const s=i=>{e(i),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||"")}}const M={scriptRegex:/<script\b[^<]*(?:(?!<\/script>)<[^<]*)*<\/script>/gi,javascriptRegex:/javascript:/gi,eventHandlerRegex:/on\w+\s*=/gi,allowedTags:new Set(["div","span","p","a","img","button","input","form","label","select","option","textarea","ul","ol","li","table","tr","td","th","thead","tbody","tfoot","h1","h2","h3","h4","h5","h6","hr","br","section","article","nav","header","footer","main","aside","figure","figcaption"]),allowedAttributes:new Set(["class","id","href","src","alt","title"])};class b{static instance;constructor(){}static getInstance(){return b.instance||(b.instance=new b),b.instance}createElement(t,e={},s=""){if(!M.allowedTags.has(t.toLowerCase()))throw new Error(`Unsupported tag: ${t}`);const i=document.createElement(t);return this._processAttributes(i,e),this._processContent(i,s),i}createBatch(t,e){const s=document.createDocumentFragment();t.forEach(i=>{const n=this.createElement(i.tag,i.attributes||{},i.content||"");s.appendChild(n)}),e.appendChild(s)}setHtml(t,e){const s=this._sanitizeHtml(e);t.innerHTML=s}_processAttributes(t,e){Object.entries(e).forEach(([s,i])=>{if(!M.allowedAttributes.has(s)&&!s.startsWith("data-")){console.warn(`Potentially unsafe attribute: ${s}`);return}if(typeof i=="function")s.startsWith("on")&&t.addEventListener(s.slice(2).toLowerCase(),i);else switch(s){case"className":t.className=i;break;case"dataset":Object.assign(t.dataset,i);break;case"style":Object.assign(t.style,i);break;default:t.setAttribute(s,i)}})}_processContent(t,e){typeof e=="string"?t.textContent=e:e instanceof Node?t.appendChild(e):Array.isArray(e)&&e.forEach(s=>{typeof s=="string"?t.appendChild(document.createTextNode(s)):t.appendChild(s)})}_sanitizeHtml(t){return t.replace(M.scriptRegex,"").replace(M.javascriptRegex,"").replace(M.eventHandlerRegex,"")}}class F{features;constructor(){this.features=this.detectFeatures()}detectFeatures(){return{geolocation:"geolocation"in navigator,notification:"Notification"in window,serviceWorker:"serviceWorker"in navigator,webShare:"share"in navigator,deviceOrientation:"DeviceOrientationEvent"in window,battery:"getBattery"in navigator,online:"onLine"in navigator}}async getLocation(t={}){if(!this.features.geolocation)throw new Error("Geolocation is not supported");const e={enableHighAccuracy:!0,timeout:10*1e3,maximumAge:300*1e3};return new Promise((s,i)=>{navigator.geolocation.getCurrentPosition(n=>s({latitude:n.coords.latitude,longitude:n.coords.longitude,accuracy:n.coords.accuracy,timstamp:n.timestamp}),n=>{const o={1:"User denied the request for Geolocation.",2:"Position information is unavailable.",3:"The request to get user location timed out."};i(new Error(o[n.code]||"Unknown error"))},{...e,...t})})}async sendNotification(t,e){if(!this.features.notification)throw new Error("Notification is not supported");if(Notification.permission==="default"&&await Notification.requestPermission()!=="granted")throw new Error("Notification permission is not granted");if(Notification.permission!=="granted")throw new Error("Notification permission is not granted");return new Notification(t,{icon:e.icon,badge:e.badge,...e})}async registerServiceWorker(t){if(!this.features.serviceWorker)throw new Error("Service Worker is not supported");try{const e=await navigator.serviceWorker.register(t);return console.log("Service Worker registered with scope:",e),e}catch(e){throw console.error("Service Worker registration failed:",e),e}}async shareContent(t){if(this.features.webShare)try{return await navigator.share(t),!0}catch(e){return e instanceof Error&&e.name!="AbortError"&&console.error("Error sharing content:",e),!1}else try{return await navigator.clipboard.writeText(t.url||t.text||""),this.sendNotification("Copied to clipboard",{body:"Link copied to clipboard"}),!0}catch(e){return console.error("Error copying to clipboard:",e),!1}}}String.prototype.pointLength=function(){let r=0;for(let t=0,e=this.length;t<e;){const s=this.codePointAt(t);t+=s>65535?2:1,r++}return r},String.prototype.pointAt=function(r){if(r>=this.pointLength())return;let t=0;for(let e=0,s=this.length;e<s;){const i=this.codePointAt(e);if(!i)return;if(t===r)return String.fromCodePoint(i);e+=i>65535?2:1,t++}},String.prototype.sliceByPoint=function(r,t=this.pointLength()){let e="";for(let s=r;s<t;s++)e+=this.pointAt(s);return e},RegExp.escape=function(r){return r.replace(/[.*+?^${}()|[\]\\]/g,"\\$&")},Element.prototype.farthest=function(r){if(typeof r!="string"||!r)return null;let t=null,e=this;for(;e;){const s=e.closest(r);if(!s)break;t=s,e=s.parentElement}return t},Object.defineProperties(Element.prototype,{firstElement:{get:function(){if(!this.children.length)return null;let r=this.firstElementChild,t=null;for(;r;)t=r,r=r.firstElementChild;return t}},lastElement:{get:function(){if(!this.children.length)return null;let r=this.lastElementChild,t=null;for(;r;)t=r,r=r.lastElementChild;return t}}}),Text.prototype.surround=function(r="strong",t=""){if(!this.nodeValue||!r||!t)return null;const s=r.split("."),i=s[0],n=s.slice(1).join(" "),o=this.textContent.indexOf(t);if(o<0)return null;const l=document.createRange();l.setStart(this,o),l.setEnd(this,o+t.length);const u=document.createElement(i);return n&&(u.className=n),l.surroundContents(u),u},a.Dictionary=P,a.DomHelper=b,a.Emitter=x,a.Graph=H,a.LIS=q,a.LRU=U,a.Line=p,a.LinkedList=V,a.Matrix=w,a.MaxHeap=j,a.MemoizeMap=_,a.MinHeap=O,a.Point=h,a.Queue=I,a.Roman=T,a.Stack=k,a.Triangle=c,a.Vector=f,a.WebAppManager=F,a.isValidBracket=W,a.singleton=G,a.sleep=$,Object.defineProperty(a,Symbol.toStringTag,{value:"Module"})}));
+(function(a,M){typeof exports=="object"&&typeof module<"u"?M(exports):typeof define=="function"&&define.amd?define(["exports"],M):(a=typeof globalThis<"u"?globalThis:a||self,M(a["jc-structure"]={}))})(this,(function(a){"use strict";class M{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;const e=t.length===1&&Array.isArray(t[0])?t[0]:t;return this.batchEnqueue(e),this}batchEnqueue(t){t.forEach(e=>{this.isValidItem(e)&&(this.items[this.count]=e,this.count++)})}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 j{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;const e=this.extractItems(t);return this.addValidItems(e),this}extractItems(t){return t.length===1&&Array.isArray(t[0])?t[0]:t}addValidItems(t){t.forEach(e=>{this.isValidItem(e)&&(this.items[this.count]=e,this.count++)})}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]`}}function C(r,t){return r===t?0:r<t?-1:1}class y{heap=[];compareFn;constructor(t=C){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 N extends y{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=y.getLeftIndex(e),i=y.getRightIndex(e),n=this.size();s<n&&this.compareFn(this.heap[e],this.heap[s])===-1&&(e=s),i<n&&this.compareFn(this.heap[e],this.heap[i])===1&&(e=i),e!==t&&(y.swap(this.heap,t,e),this.siftUp(e))}siftDown(t){let e=y.getParentIndex(t);for(;t>0&&e&&this.compareFn(this.heap[e],this.heap[t])===1;)y.swap(this.heap,e,t),t=e,e=y.getParentIndex(t)}}class z extends N{constructor(t=(e,s)=>C(s,e)){super(t)}}function V(r){return{value:r}}class U{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=V(e),this.length++,this.prepend(s),this.trimCache(),this.lookup.set(t,s),this.reverseLookup)}}let O=class{value;next=void 0};class D{count=0;head=void 0;constructor(){}indexOf(t){let e=this.head,s=0,i=!1;for(;e;){if(this.equals(e.value,t)){i=!0;break}s++,e=e.next}return i?s:-1}equals(t,e){return!1}getElementAt(t){if(t<0||t>=this.count)return;if(t===0)return this.head;let e=this.head;for(let s=0;s<t;s++)e=e?.next;return e}getValueAt(t){return this.getElementAt(t)?.value}insert(t,e){let s=new O;if(s.value=t,e>this.count||e<0)throw new Error("index error");this.count++;let i,n;if(e===0){s.next=this.head,this.head=s;return}i=this.getElementAt(e-1),n=i.next,i.next=s,s.next=n}push(t){let e=new O;if(e.value=t,this.count++,this.isEmpty()){this.head=e;return}let s=this.getElementAt(this.count-1);s.next=e}remove(t){const e=this.indexOf(t);return e===-1?void 0:this.removeAt(e)}removeAt(t){if(this.isEmpty()||t<0||t>=this.count)return;let e=this.getElementAt(t),s=this.getElementAt(t-1),i=e?.next;return t===0&&(this.head=i),s&&(s.next=i),this.count--,e?.value}isEmpty(){return this.count===0}size(){return this.count}clear(){this.count=0,this.head=void 0}toString(){let t="",e=this.head;for(;e;)t+=e.value,t+=",",e=e.next;return t=t.slice(0,-1),t}}class q{key;value;constructor(t,e){this.key=t,this.value=e}}function P(r,t={emptyString:!1,zeroNumber:!1}){return r==null?!(t.emptyString&&r===""||t.zeroNumber&&r===0):!1}class R{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(P(t))throw new Error("key is required");if(P(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 q(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 i=this.table[e];if(!t(i.key,i.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 H{isDirected;vertices;adjList;constructor(t=!1){this.isDirected=t,this.vertices=[],this.adjList=new R}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 d{_data;static zero(t){return new d(...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 d(...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,i)=>s+t._data[i]);return new d(...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,i)=>s-t._data[i]);return new d(...e)}mul(t){return new d(...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,i)=>e+s*t._data[i],0)}pos(){return this.mul(1)}neg(){return this.mul(-1)}}class w{_matrix;static zero(t,e){return new w(Array.from({length:t},()=>Array.from({length:e},()=>0)))}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 d(...this._matrix[t])}colVector(t){return new d(...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 w(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 w(this._matrix.map((e,s)=>e.map((i,n)=>i+t.getItem([s,n]))))}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 w(this._matrix.map(e=>e.map((s,i)=>s*t.getItem(i))))}mulMatrix(t){if(this.col!==t.row)throw new Error("Matrix dimensions do not match");const e=w.zero(this.row,t.col);for(let s=0;s<this.row;s++){const i=this.rowVector(s);for(let n=0;n<this.col;n++)e.setItem([s,n],i.dot(t.colVector(n)))}return e}}class h{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 h.distance(this,t)}}class p{static EPSILON=1e-10;static sloped(t,e=p.EPSILON){const s=t.p2.x-t.p1.x,i=t.p2.y-t.p1.y;return Math.abs(s)<e?Math.abs(i)<e?0:null:i/s}static isParallel(t,e,s=p.EPSILON){const i=p.sloped(t),n=p.sloped(e);return i===null&&n===null?!0:i===null||n===null?!1:Math.abs(i-n)<s}static getIntersection(t,e,s=p.EPSILON){if(p.isParallel(t,e))return null;const i=t.p1.x,n=t.p1.y,o=t.p2.x,u=t.p2.y,l=e.p1.x,f=e.p1.y,g=e.p2.x,E=e.p2.y,m=(i-o)*(f-E)-(n-u)*(l-g);if(Math.abs(m)<s)return null;const I=((i-l)*(f-E)-(n-f)*(l-g))/m,L=-((i-o)*(n-f)-(n-u)*(i-l))/m;if(I>=0&&I<=1&&L>=0&&L<=1){const X=i+I*(o-i),Q=n+I*(u-n);return new h(X,Q)}return null}static isIntersecting(t,e){return p.getIntersection(t,e)!==null}static distanceToPoint(t,e,s=p.EPSILON){const i=e.x-t.p1.x,n=e.y-t.p1.y,o=t.p2.x-t.p1.x,u=t.p2.y-t.p1.y,l=i*o+n*u,f=o*o+u*u;let g=-1;f>s&&(g=l/f);let E,m;g<0?(E=t.p1.x,m=t.p1.y):g>1?(E=t.p2.x,m=t.p2.y):(E=t.p1.x+g*o,m=t.p1.y+g*u);const I=e.x-E,L=e.y-m;return Math.hypot(I+L)}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 h(t,e)}get angle(){return Math.atan2(this.p2.y-this.p1.y,this.p2.x-this.p1.x)}containsPoint(t,e=p.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<p.EPSILON)return new h(0,0);const e=(this.p2.x-this.p1.x)/t,s=(this.p2.y-this.p1.y)/t;return new h(e,s)}get start(){return this.p1}get end(){return this.p2}}class k{static EPSILON=1e-10;name;constructor(t){this.name=t}}class c extends k{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(!c.isValid(t,e,s))throw new Error("Invalid triangle");const i=(t+e+s)/2;return Math.sqrt(i*(i-t)*(i-e)*(i-s))}static getType(t,e,s){if(!c.isValid(t,e,s))throw new Error("Invalid triangle sides");const i=[t,e,s].sort((l,f)=>l-f),[n,o,u]=i;return Math.abs(n-o)<c.EPSILON&&Math.abs(o-u)<c.EPSILON?"equilateral":Math.abs(n-o)<c.EPSILON||Math.abs(o-u)<c.EPSILON?"isosceles":"scalene"}static getAngles(t,e,s){if(!c.isValid(t,e,s))throw new Error("Invalid triangle sides");const i=Math.acos((e*e+s*s-t*t)/(2*e*s)),n=Math.acos((t*t+s*s-e*e)/(2*t*s)),o=Math.PI-i-n;return[i,n,o]}p1;p2;p3;constructor(t,e,s,i="triangle"){if(super(i),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))<k.EPSILON}get side(){return[h.distance(this.p1,this.p2),h.distance(this.p2,this.p3),h.distance(this.p3,this.p1)]}perimeter(){return c.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 c.area(t,e,s)}get type(){const[t,e,s]=this.side;return c.getType(t,e,s)}get angles(){const[t,e,s]=this.side;return c.getAngles(t,e,s)}get centroid(){return new h((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,i=this.perimeter()/2,n=(t*this.p1.x+e*this.p2.x+s*this.p3.x)/i,o=(t*this.p1.y+e*this.p2.y+s*this.p3.y)/i;return new h(n,o)}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)<c.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 h(e,s)}containsPoint(t){const e=c.area(h.distance(t,this.p1),h.distance(t,this.p2),h.distance(this.p1,this.p2)),s=c.area(h.distance(t,this.p2),h.distance(t,this.p3),h.distance(this.p2,this.p3)),i=c.area(h.distance(t,this.p3),h.distance(t,this.p1),h.distance(this.p3,this.p1));return Math.abs(e+s+i-this.area())<c.EPSILON}}function _(r){return new Promise(t=>setTimeout(t,r))}function $(r){const t=[],e={"(":")","[":"]","{":"}"},s=new Set(Object.values(e));for(const i of r)if(i in e)t.push(e[i]);else if(s.has(i)&&i!==t.pop())return!1;return t.length===0}function A(r){return r!==null&&(typeof r=="object"||typeof r=="function")}class T{map=new Map;weakMap=new WeakMap;set(t,e){A(t)?this.weakMap.set(t,e):this.map.set(t,e)}get(t){return A(t)?this.weakMap.get(t):this.map.get(t)}has(t){return A(t)?this.weakMap.has(t):this.map.has(t)}}function W(r){if(!r.length)return[];const t=[[r[0]]];for(let s=1,i=r.length;s<i;s++){const n=r[s];e(n)}function e(s){for(let i=t.length-1;i>=0;i--){const n=t[i],o=n[t[i].length-1];if(o<s){t[i+1]=[...n,s];break}else o>s&&i===0&&(t[i]=[s])}}return t[t.length-1]}class G{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 o of t)if(!e.has(o))throw new Error(`Invalid Roman numeral character: ${o}`);let s=0,i=0;for(;i<t.length;){const o=t.slice(i,i+2);if(this.ROMAN_MAP.has(o))s+=this.ROMAN_MAP.get(o),i+=2;else{const u=t[i],l=this.ROMAN_MAP.get(u);if(!l)throw new Error(`Invalid Roman numeral sequence at position ${i}`);s+=l,i+=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,i]of this.ROMAN_MAP)for(;t>=i;)e+=s,t-=i;return e}}function F(r){let t;const e=new Proxy(r,{construct(s,i,n){return t||(t=Reflect.construct(s,i,n)),t}});return r.prototype.constructor=e,e}const x={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 b{static instance=null;listeners={};debugMode;constructor(t=!1){this.debugMode=t,Object.keys(x).forEach(e=>{this.listeners[e]=new Set})}static getInstance(t){return b.instance||(b.instance=new b(t)),b.instance}on(t,e){this.debugLog(`添加事件监听: ${x[t]}`),this.listeners[t].add(e)}emit(t,e){this.debugLog(`触发事件: ${x[t]}`,e),this.listeners[t].forEach(s=>{try{s(e)}catch(i){console.error(`事件 ${x[t]} 处理出错:`,i)}})}off(t,e){this.debugLog(`移除事件监听: ${x[t]}`),this.listeners[t].delete(e)}once(t,e){this.debugLog(`添加一次性事件监听: ${x[t]}`);const s=i=>{e(i),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||"")}}const S={scriptRegex:/<script\b[^<]*(?:(?!<\/script>)<[^<]*)*<\/script>/gi,javascriptRegex:/javascript:/gi,eventHandlerRegex:/on\w+\s*=/gi,allowedTags:new Set(["div","span","p","a","img","button","input","form","label","select","option","textarea","ul","ol","li","table","tr","td","th","thead","tbody","tfoot","h1","h2","h3","h4","h5","h6","hr","br","section","article","nav","header","footer","main","aside","figure","figcaption"]),allowedAttributes:new Set(["class","id","href","src","alt","title"])};class v{static instance;constructor(){}static getInstance(){return v.instance||(v.instance=new v),v.instance}createElement(t,e={},s=""){if(!S.allowedTags.has(t.toLowerCase()))throw new Error(`Unsupported tag: ${t}`);const i=document.createElement(t);return this._processAttributes(i,e),this._processContent(i,s),i}createBatch(t,e){const s=document.createDocumentFragment();t.forEach(i=>{const n=this.createElement(i.tag,i.attributes||{},i.content||"");s.appendChild(n)}),e.appendChild(s)}setHtml(t,e){const s=this._sanitizeHtml(e);t.innerHTML=s}_processAttributes(t,e){Object.entries(e).forEach(([s,i])=>{if(!S.allowedAttributes.has(s)&&!s.startsWith("data-")){console.warn(`Potentially unsafe attribute: ${s}`);return}if(typeof i=="function")s.startsWith("on")&&t.addEventListener(s.slice(2).toLowerCase(),i);else switch(s){case"className":t.className=i;break;case"dataset":Object.assign(t.dataset,i);break;case"style":Object.assign(t.style,i);break;default:t.setAttribute(s,i)}})}_processContent(t,e){typeof e=="string"?t.textContent=e:e instanceof Node?t.appendChild(e):Array.isArray(e)&&e.forEach(s=>{typeof s=="string"?t.appendChild(document.createTextNode(s)):t.appendChild(s)})}_sanitizeHtml(t){return t.replace(S.scriptRegex,"").replace(S.javascriptRegex,"").replace(S.eventHandlerRegex,"")}}class B{features;constructor(){this.features=this.detectFeatures()}detectFeatures(){return{geolocation:"geolocation"in navigator,notification:"Notification"in window,serviceWorker:"serviceWorker"in navigator,webShare:"share"in navigator,deviceOrientation:"DeviceOrientationEvent"in window,battery:"getBattery"in navigator,online:"onLine"in navigator}}async getLocation(t={}){if(!this.features.geolocation)throw new Error("Geolocation is not supported");const e={enableHighAccuracy:!0,timeout:10*1e3,maximumAge:300*1e3};return new Promise((s,i)=>{navigator.geolocation.getCurrentPosition(n=>s({latitude:n.coords.latitude,longitude:n.coords.longitude,accuracy:n.coords.accuracy,timstamp:n.timestamp}),n=>{const o={1:"User denied the request for Geolocation.",2:"Position information is unavailable.",3:"The request to get user location timed out."};i(new Error(o[n.code]||"Unknown error"))},{...e,...t})})}async sendNotification(t,e){if(!this.features.notification)throw new Error("Notification is not supported");if(Notification.permission==="default"&&await Notification.requestPermission()!=="granted")throw new Error("Notification permission is not granted");if(Notification.permission!=="granted")throw new Error("Notification permission is not granted");return new Notification(t,{icon:e.icon,badge:e.badge,...e})}async registerServiceWorker(t){if(!this.features.serviceWorker)throw new Error("Service Worker is not supported");try{const e=await navigator.serviceWorker.register(t);return console.log("Service Worker registered with scope:",e),e}catch(e){throw console.error("Service Worker registration failed:",e),e}}async shareContent(t){if(this.features.webShare)try{return await navigator.share(t),!0}catch(e){return e instanceof Error&&e.name!="AbortError"&&console.error("Error sharing content:",e),!1}else try{return await navigator.clipboard.writeText(t.url||t.text||""),this.sendNotification("Copied to clipboard",{body:"Link copied to clipboard"}),!0}catch(e){return console.error("Error copying to clipboard:",e),!1}}}String.prototype.pointLength=function(){let r=0;for(let t=0,e=this.length;t<e;){const s=this.codePointAt(t);t+=s>65535?2:1,r++}return r},String.prototype.pointAt=function(r){if(r>=this.pointLength())return;let t=0;for(let e=0,s=this.length;e<s;){const i=this.codePointAt(e);if(!i)return;if(t===r)return String.fromCodePoint(i);e+=i>65535?2:1,t++}},String.prototype.sliceByPoint=function(r,t=this.pointLength()){let e="";for(let s=r;s<t;s++)e+=this.pointAt(s);return e},RegExp.escape=function(r){return r.replace(/[.*+?^${}()|[\]\\]/g,"\\$&")},Element.prototype.farthest=function(r){if(typeof r!="string"||!r)return null;let t=null,e=this;for(;e;){const s=e.closest(r);if(!s)break;t=s,e=s.parentElement}return t},Object.defineProperties(Element.prototype,{firstElement:{get:function(){if(!this.children.length)return null;let r=this.firstElementChild,t=null;for(;r;)t=r,r=r.firstElementChild;return t}},lastElement:{get:function(){if(!this.children.length)return null;let r=this.lastElementChild,t=null;for(;r;)t=r,r=r.lastElementChild;return t}}}),Text.prototype.surround=function(r="strong",t=""){if(!this.nodeValue||!r||!t)return null;const s=r.split("."),i=s[0],n=s.slice(1).join(" "),o=this.textContent.indexOf(t);if(o<0)return null;const u=document.createRange();u.setStart(this,o),u.setEnd(this,o+t.length);const l=document.createElement(i);return n&&(l.className=n),u.surroundContents(l),l},a.Dictionary=R,a.DomHelper=v,a.Emitter=b,a.Graph=H,a.LIS=W,a.LRU=U,a.Line=p,a.LinkedList=D,a.Matrix=w,a.MaxHeap=z,a.MemoizeMap=T,a.MinHeap=N,a.Point=h,a.Queue=M,a.Roman=G,a.Stack=j,a.Triangle=c,a.Vector=d,a.WebAppManager=B,a.isValidBracket=$,a.singleton=F,a.sleep=_,Object.defineProperty(a,Symbol.toStringTag,{value:"Module"})}));

package/index.d.ts

@@ -1,125 +1,59 @@
-import { Vector } from "./lib/dataStructure";
-
 declare module "jc-structure" {
+  /// <reference path="./types/stack.d.ts">
+  /// <reference path="./types/queue.d.ts">
+  /// <reference path="./types/heap.d.ts">
+
   /**
    * 栈类，采用object实现
    */
-  export class Stack<T> implements IStack<T> {
-    constructor();
-    /**
-     * #### 向栈顶添加元素
-     * @param args 要添加的元素,可以是多个或一个元素。
-     */
-    push(...args: Array<T>): void;
-    /**
-     * #### 移除栈顶元素并返回该元素
-     */
-    pop(): T | undefined;
-    /**
-     * #### 返回栈顶元素，但不移除
-     */
-    peek(): T | undefined;
-    /**
-     * 判断数据结构是否为空
-     */
-    isEmpty(): boolean;
-    /**
-     * 数据结构元素长度
-     */
-    size(): number;
-    /**
-     * 重写 toString 方法
-     */
-    toString(): string;
-    /**
-     * 清除数据结构元素
-     */
-    clear(): void;
+  interface Stack<T> extends IStack<T> {}
+  interface StackConstructor {
+    new <T>(): Stack<T>;
+    readonly prototype: Stack<T>;
   }
+  declare const Stack: StackConstructor;
 
   /**
    * 队列类，采用object实现
    */
-  export class Queue<T> implements IQueue<T> {
-    constructor();
-    /**
-     * #### 向队列末尾添加元素
-     * @param args 要添加的元素，可以是多个或一个元素。
-     */
-    enqueue(...args: Array<T>): void;
-    /**
-     * #### 移除队列头部元素并返回该元素
-     */
-    dequeue(): T | undefined;
-    /**
-     * #### 返回队列头部元素，但不移除
-     */
-    front(): T | undefined;
-    /**
-     * 判断数据结构是否为空
-     */
-    isEmpty(): boolean;
-    /**
-     * 数据结构元素长度
-     */
-    size(): number;
-    /**
-     * 重写 toString 方法
-     */
-    toString(): string;
-    /**
-     * 清除数据结构元素
-     */
-    clear(): void;
+  interface Queue<T> extends IQueue<T> {}
+  interface QueueConstructor {
+    new <T>(): Queue<T>;
+    readonly prototype: Queue<T>;
   }
+  declare const Queue: QueueConstructor;
 
-  // export function compareFn(a: any, b: any): CompareResult;
+  type CompareResult = -1 | 0 | 1;
 
+  interface CompareFn<T> {
+    (a: T, b: T): CompareResult;
+  }
+
+  interface Obj<V = any> {
+    [key: string]: V;
+  }
   /**
    * 最小堆
    */
-  export class MinHeap<T> {
-    constructor(fn?: (a: T, b: T) => CompareResult);
-    /**
-     * 向堆中添加元素
-     * @param args 要添加的元素，可以是多个或一个元素。
-     */
-    insert(...args: Array<T>): void;
-    /**
-     * #### 移除最小值或最大值，返回该值
-     */
-    extract(): T | undefined;
-    /**
-     * 查找一个值
-     * @param value 要查找的值
-     */
-    find(): T | undefined;
-    /**
-     * 判断数据结构是否为空
-     */
-    isEmpty(): boolean;
-    /**
-     * 数据结构元素长度
-     */
-    size(): number;
-    /**
-     * 重写 toString 方法
-     */
-    toString(): string;
+  interface MinHeap<T> extends IHeap<T> {}
+  interface MinHeapConstructor {
+    new <T>(fn?: CompareFn<T>): MinHeap<T>;
+    readonly prototype: MinHeap<T>;
   }
+  declare const MinHeap: MinHeapConstructor;
 
   /**
    * 最大堆
    */
-  export class MaxHeap<T> extends MinHeap<T> {
-    constructor(fn?: (a: T, b: T) => CompareResult);
+  interface Constructor {
+    new <T>(fn?: CompareFn<T>): MinHeap<T>;
+    readonly prototype: MinHeap<T>;
   }
-
+  declare const MaxHeap: Constructor;
   /**
    * LRU缓存类
    */
-  export class LRU<K, V> {
-    constructor(capacity?: number);
+  interface LRU<K, V> {
     /**
      * 获取缓存的值
      * @param key 键值
@@ -132,6 +66,11 @@ declare module "jc-structure" {
      */
     update(key: K, value: V): void;
   }
+  interface LRUConstructor {
+    new <K, V>(capacity?: number): LRU<K, V>;
+    readonly prototype: LRU<K, V>;
+  }
+  declare const LRU: LRUConstructor;
 
   /**
    * 链表节点类
@@ -319,40 +258,47 @@ declare module "jc-structure" {
   /**
    * 罗马数字类
    */
-  export class Roman {
+  interface RomanConstructor {
     /**
      * #### 转阿拉伯数字
      * @param str 罗马数字文本
      */
-    static toInteger(str: string): number;
+    toInteger(str: string): number;
     /**
      * #### 转罗马数字
      * @param num 阿拉伯整数
      */
-    static toRoman(num: number): string;
+    toRoman(num: number): string;
   }
+  declare const Roman: RomanConstructor;
 
-  export class Point {
+  interface Point {
     /**
-     * #### 点类构造函数
-     * @param x x坐标
-     * @param y y坐标
+     * #### 点x坐标
      */
-    constructor(x: number, y: number);
+    readonly x: number;
     /**
-     * #### 计算两点之间的距离
-     * @param p1 点1
-     * @param p2 点2
+     * #### 点y坐标
      */
-    static distance(p1: Point, p2: Point): number;
+    readonly y: number;
     /**
      * #### 计算点与点之间的距离，实例方法
      * @param p 点p
      */
     distanceTo(p: Point): number;
   }
+  interface PointConstructor {
+    new (x: number, y: number): Point;
+    /**
+     * #### 计算两点之间的距离
+     * @param p1 点1
+     * @param p2 点2
+     */
+    distance(p1: Point, p2: Point): number;
+  }
+  declare var Point: PointConstructor;
 
-  export class line {
+  interface Line {
     /**
      * #### 线段长度
      */
@@ -369,39 +315,130 @@ declare module "jc-structure" {
      * #### 获取线段的方向向量
      */
     get direction(): Point;
+    /**
+     * #### 获取线段的起点
+     */
+    get start(): Point;
+    /**
+     * #### 获取线段的终点
+     */
+    get end(): Point;
     /**
      * #### 判断点是否在线段上
      * @param point
+     * @param tolerance 容差,默认1e-10
      */
-    containsPoint(point: Point): boolean;
+    containsPoint(point: Point, tolerance?: number): boolean;
   }
+  interface LineConstructor {
+    new (p1: Point, p2: Point): Line;
+    readonly prototype: Line;
 
-  /**
-   * ### 三角形类
-   */
-  export class Triangle {
     /**
-     * #### 判断三条边是否能构成三角形
-     * @param a 边长
-     * @param b 边长
-     * @param c 边长
+     * #### 判断线段是否平行
+     * @param line 线段
+     * @param tolerance 容差,默认1e-10
      */
-    static isValid(a: number, b: number, c: number): boolean;
+    sloped(line: Line, tolerance?: number): number | null;
+
     /**
-     * #### 计算三角形的面积，采用秦九昭公式或叫海伦面积公式
-     * @param a 边长
-     * @param b 边长
-     * @param c 边长
+     * #### 判断线段是否平行
+     * @param line1 线段1
+     * @param line2 线段2
+     * @param tolerance 容差,默认1e-10
      */
-    static area(a: number, b: number, c: number): number;
+    isParallel(line1: Line, line2: Line, tolerance?: number): boolean;
+
     /**
-     * #### 获取三角形的角度
-     * @param a 边长
-     * @param b 边长
-     * @param c 边长
+     * #### 判断线段是否相交
+     * @param line1 线段1
+     * @param line2 线段2
      */
-    static getAngles(a: number, b: number, c: number): [number, number, number];
-    constructor(p1: Point, p2: Point, p3: Point): Triangle;
+    isIntersecting(line1: Line, line2: Line): boolean;
+
+    /**
+     * #### 获取两线段交点
+     * @param line1 线段1
+     * @param line2 线段2
+     * @param tolerance 容差,默认1e-10
+     */
+    getIntersection(line1: Line, line2: Line, tolerance?: number): Point | null;
+
+    /**
+     * #### 获取线段到点的距离
+     * @param line1 线段1
+     * @param line2 线段2
+     * @param tolerance 容差,默认1e-10
+     */
+    distanceToPoint(line: Line, point: Point, tolerance?: number): number;
+  }
+  declare var Line: LineConstructor;
+
+  /**
+   * ### 三角形类
+   */
+  // export class Triangle {
+  //   /**
+  //    * #### 判断三条边是否能构成三角形
+  //    * @param a 边长
+  //    * @param b 边长
+  //    * @param c 边长
+  //    */
+  //   static isValid(a: number, b: number, c: number): boolean;
+  //   /**
+  //    * #### 计算三角形的面积，采用秦九昭公式或叫海伦面积公式
+  //    * @param a 边长
+  //    * @param b 边长
+  //    * @param c 边长
+  //    */
+  //   static area(a: number, b: number, c: number): number;
+  //   /**
+  //    * #### 获取三角形的角度
+  //    * @param a 边长
+  //    * @param b 边长
+  //    * @param c 边长
+  //    */
+  //   static getAngles(a: number, b: number, c: number): [number, number, number];
+  //   constructor(p1: Point, p2: Point, p3: Point): Triangle;
+  //   /**
+  //    * #### 获取三角形的边长
+  //    */
+  //   get side(): [number, number, number];
+  //   /**
+  //    * #### 获取三角形的内心点
+  //    */
+  //   get centroid(): Point;
+  //   /**
+  //    * #### 获取三角形的外切园心点
+  //    */
+  //   get circumcenter(): Point;
+  //   /**
+  //    * #### 获取三角形的内切园心点
+  //    */
+  //   get incenter(): Point;
+  //   /**
+  //    * #### 获取三角形的周长
+  //    */
+  //   perimeter(): number;
+  //   /**
+  //    * #### 获取三角形的面积
+  //    */
+  //   area(): number;
+  //   /**
+  //    * #### 判断点是否在三角形内
+  //    * @param point
+  //    */
+  //   containsPoint(point: Point): boolean;
+  // }
+  enum TriangleType {
+    Equilateral = "equilateral", // 等边
+    Isosceles = "isosceles", // 等腰
+    Scalene = "scalene", // 不等边
+  }
+  interface Triangle {
+    readonly p1: Point;
+    readonly p2: Point;
+    readonly p3: Point;
     /**
      * #### 获取三角形的边长
      */
@@ -432,7 +469,35 @@ declare module "jc-structure" {
      */
     containsPoint(point: Point): boolean;
   }
+  interface TriangleConstructor {
+    new (p1: Point, p2: Point, p3: Point): Triangle;
+    readonly prototype: Triangle;
+
+    /**
+     * #### 判断三条边是否能构成三角形
+     * @param a
+     * @param b
+     * @param c
+     */
+    isValid(a: number, b: number, c: number): boolean;
+    /**
+     * #### 计算三角形的面积，采用秦九昭公式或叫海伦面积公式
+     * @param a
+     * @param b
+     * @param c
+     */
+    area(a: number, b: number, c: number): number;
+    /**
+     * #### 获取三角形的角度
+     * @param a
+     * @param b
+     * @param c
+     */
+    getAngles(a: number, b: number, c: number): [number, number, number];
 
+    getTYpe(a: number, b: number, c: number): TriangleType;
+  }
+  declare var Triangle: TriangleConstructor;
   /**
    * ### 向量类
    */

package/package.json

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

package/types/heap.d.ts

@@ -1,3 +1,5 @@
+// import type { Structure } from "./global";
+
 interface IHeap<T> extends Structure {
   /**
    * #### 插入一个值，返回一个布尔值

package/types/queue.d.ts

@@ -8,7 +8,8 @@ interface IQueue<T> extends Structure {
    * #### 向队列末尾添加元素
    * @param args 要添加的元素
    */
-  enqueue(...args: Array<T>): void;
+  enqueue(items: T | Array<T>): this;
+  enqueue(...args: Array<T>): this;
   /**
    * #### 返回队列头部元素，但不移除
    */

package/types/stack.d.ts

@@ -12,7 +12,8 @@ interface IStack<T> extends Structure {
    * #### 向栈顶添加元素
    * @param args 要添加的元素,key可以是多个或一个元素。
    */
-  push(...args: Array<T>): void;
+  push(items: T | Array<T>): this;
+  push(...args: Array<T>): this;
 
   /**
    * #### 返回栈顶元素，但不移除