jc-structure 0.1.1 → 0.1.3

package/dist/jc-structure.js

@@ -1,4 +1,4 @@
-class z {
+class U {
   items = {};
   count = 0;
   lowestCount = 0;
@@ -30,7 +30,7 @@ class z {
     return this.isEmpty() ? "" : `Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`;
   }
 }
-class j {
+class V {
   items = {};
   count = 0;
   constructor() {
@@ -62,13 +62,13 @@ class j {
     return this.isEmpty() ? "" : `Stack(count: ${this.count}):[${this.items[this.count - 1]},...rest]`;
   }
 }
-function N(n, t) {
-  return n === t ? 0 : n < t ? -1 : 1;
+function A(r, t) {
+  return r === t ? 0 : r < t ? -1 : 1;
 }
-class g {
+class w {
   heap = [];
   compareFn;
-  constructor(t = N) {
+  constructor(t = A) {
     this.compareFn = t;
   }
   static getLeftIndex(t) {
@@ -99,7 +99,7 @@ class g {
     return this.heap.toString();
   }
 }
-class A extends g {
+class R extends w {
   insert(t) {
     return t ? !1 : (this.heap.push(t), this.siftUp(this.heap.length - 1), !0);
   }
@@ -110,24 +110,24 @@ class A extends g {
     return this.heap[0] = this.heap.pop(), this.siftDown(0), t;
   }
   siftUp(t) {
-    let e = t, s = g.getLeftIndex(e), i = g.getRightIndex(e), r = this.size();
-    s < r && this.compareFn(this.heap[e], this.heap[s]) === -1 && (e = s), i < r && this.compareFn(this.heap[e], this.heap[i]) === 1 && (e = i), e !== t && (g.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 = g.getParentIndex(t);
+    let e = w.getParentIndex(t);
     for (; t > 0 && e && this.compareFn(this.heap[e], this.heap[t]) === 1; )
-      g.swap(this.heap, e, t), t = e, e = g.getParentIndex(t);
+      w.swap(this.heap, e, t), t = e, e = w.getParentIndex(t);
   }
 }
-class R extends A {
-  constructor(t = (e, s) => N(s, e)) {
+class _ extends R {
+  constructor(t = (e, s) => A(s, e)) {
     super(t);
   }
 }
-function C(n) {
-  return { value: n };
+function k(r) {
+  return { value: r };
 }
-class V {
+class D {
   capacity;
   length = 0;
   head = null;
@@ -157,14 +157,14 @@ class V {
   }
   update(t, e) {
     let s = this.lookup.get(t);
-    s ? (this.detach(s), this.prepend(s), s.value = e) : (s = C(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 I = class {
+let L = class {
   value;
   next = void 0;
 };
-class W {
+class q {
   count = 0;
   head = void 0;
   constructor() {
@@ -197,19 +197,19 @@ class W {
     return this.getElementAt(t)?.value;
   }
   insert(t, e) {
-    let s = new I();
+    let s = new L();
     if (s.value = t, e > this.count || e < 0)
       throw new Error("index error");
     this.count++;
-    let i, r;
+    let i, n;
     if (e === 0) {
       s.next = this.head, this.head = s;
       return;
     }
-    i = this.getElementAt(e - 1), r = i.next, i.next = s, s.next = r;
+    i = this.getElementAt(e - 1), n = i.next, i.next = s, s.next = n;
   }
   push(t) {
-    let e = new I();
+    let e = new L();
     if (e.value = t, this.count++, this.isEmpty()) {
       this.head = e;
       return;
@@ -243,17 +243,17 @@ class W {
     return t = t.slice(0, -1), t;
   }
 }
-class O {
+class z {
   key;
   value;
   constructor(t, e) {
     this.key = t, this.value = e;
   }
 }
-function M(n, t = { emptyString: !1, zeroNumber: !1 }) {
-  return n == null ? !(t.emptyString && n === "" || t.zeroNumber && n === 0) : !1;
+function C(r, t = { emptyString: !1, zeroNumber: !1 }) {
+  return r == null ? !(t.emptyString && r === "" || t.zeroNumber && r === 0) : !1;
 }
-class k {
+class j {
   table = [];
   constructor() {
   }
@@ -264,15 +264,15 @@ class k {
     return -1;
   }
   set(t, e) {
-    if (M(t))
+    if (C(t))
       throw new Error("key is required");
-    if (M(e))
+    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 O(t, e);
+      const s = new z(t, e);
       this.table.push(s);
     }
   }
@@ -323,12 +323,12 @@ class k {
     return t = t.slice(0, -1), t;
   }
 }
-class D {
+class H {
   isDirected;
   vertices;
   adjList;
   constructor(t = !1) {
-    this.isDirected = t, this.vertices = [], this.adjList = new k();
+    this.isDirected = t, this.vertices = [], this.adjList = new j();
   }
   addVertex(t) {
     this.vertices.includes(t) || (this.vertices.push(t), this.adjList.set(t, []));
@@ -350,10 +350,10 @@ class D {
     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 +372,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 +380,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 +388,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 +408,10 @@ class f {
     return this.mul(-1);
   }
 }
-class y {
+class E {
   _matrix;
   static zero(t, e) {
-    return new y(
+    return new E(
       Array.from({ length: t }, () => Array.from({ length: e }, () => 0))
     );
   }
@@ -431,10 +431,10 @@ class y {
     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 +443,7 @@ class y {
     return this._matrix[t[0]][t[1]] = e, this;
   }
   mul(t) {
-    return new y(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,9 +451,9 @@ class y {
   add(t) {
     if (this.row !== t.row || this.col !== t.col)
       throw new Error("Matrix dimensions do not match");
-    return new y(
+    return new E(
       this._matrix.map(
-        (e, s) => e.map((i, r) => i + t.getItem([s, r]))
+        (e, s) => e.map((i, n) => i + t.getItem([s, n]))
       )
     );
   }
@@ -469,23 +469,23 @@ class y {
   mulVector(t) {
     if (this.col !== t.dimension)
       throw new Error("Matrix dimensions do not match");
-    return new y(
+    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 = y.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 r = 0; r < this.col; r++)
-        e.setItem([s, r], i.dot(t.colVector(r)));
+      for (let n = 0; n < this.col; n++)
+        e.setItem([s, n], i.dot(t.colVector(n)));
     }
     return e;
   }
 }
-class o {
+class a {
   static distance(t, e) {
     return Math.hypot(e.x - t.x, e.y - t.y);
   }
@@ -495,108 +495,105 @@ class o {
     this.x = t, this.y = e;
   }
   distanceTo(t) {
-    return o.distance(this, t);
+    return a.distance(this, t);
   }
 }
-class c {
+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) < c.EPSILON ? Math.abs(s) < c.EPSILON ? 0 : null : s / e;
-  }
-  // 静态方法：判断两条线是否平行
-  static isParallel(t, e) {
-    const s = c.sloped(t), i = c.sloped(e);
-    return s === null && i === null ? !0 : s === null || i === null ? !1 : Math.abs(s - i) < c.EPSILON;
-  }
-  // 静态方法：获取两条线的交点
-  static getIntersection(t, e) {
-    if (c.isParallel(t, e)) return null;
-    const s = t.p1.x, i = t.p1.y, r = t.p2.x, a = t.p2.y, l = e.p1.x, u = e.p1.y, p = e.p2.x, m = e.p2.y, d = (s - r) * (u - m) - (i - a) * (l - p);
-    if (Math.abs(d) < c.EPSILON) return null;
-    const w = ((s - l) * (u - m) - (i - u) * (l - p)) / d, E = -((s - r) * (i - u) - (i - a) * (s - l)) / d;
-    if (w >= 0 && w <= 1 && E >= 0 && E <= 1) {
-      const P = s + w * (r - s), L = i + w * (a - i);
-      return new o(P, L);
+  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 c.getIntersection(t, e) !== null;
-  }
-  // 静态方法：计算点到线段的距离
-  static distanceToPoint(t, e) {
-    const s = e.x - t.p1.x, i = e.y - t.p1.y, r = t.p2.x - t.p1.x, a = t.p2.y - t.p1.y, l = s * r + i * a, u = r * r + a * a;
-    let p = -1;
-    u > c.EPSILON && (p = l / u);
-    let m, d;
-    p < 0 ? (m = t.p1.x, d = t.p1.y) : p > 1 ? (m = t.p2.x, d = t.p2.y) : (m = t.p1.x + p * r, d = t.p1.y + p * a);
-    const w = e.x - m, E = e.y - d;
-    return Math.hypot(w + E);
+    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 o(t, e);
+    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) > c.EPSILON ? !1 : (t.x - this.p1.x) * (t.x - this.p2.x) + (t.y - this.p1.y) * (t.y - this.p2.y) <= c.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 < c.EPSILON) return new o(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 o(e, s);
+    return new a(e, s);
+  }
+  get start() {
+    return this.p1;
+  }
+  get end() {
+    return this.p2;
   }
 }
-class S {
+class N {
   static EPSILON = 1e-10;
   name;
   constructor(t) {
     this.name = t;
   }
 }
-class h extends S {
+class c extends N {
   static isValid(t, e, s) {
     return t <= 0 || e <= 0 || s <= 0 ? !1 : t + e > s && t + s > e && e + s > t;
   }
   static area(t, e, s) {
-    if (!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((u, p) => u - p), [r, a, l] = i;
-    return Math.abs(r - a) < h.EPSILON && Math.abs(a - l) < h.EPSILON ? "equilateral" : Math.abs(r - a) < h.EPSILON || Math.abs(a - 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)), r = Math.acos((t * t + s * s - e * e) / (2 * t * s)), a = Math.PI - i - r;
-    return [i, r, a];
+    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;
@@ -609,110 +606,110 @@ class h extends S {
   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)
-    ) < S.EPSILON;
+    ) < N.EPSILON;
   }
   get side() {
     return [
-      o.distance(this.p1, this.p2),
-      o.distance(this.p2, this.p3),
-      o.distance(this.p3, this.p1)
+      a.distance(this.p1, this.p2),
+      a.distance(this.p2, this.p3),
+      a.distance(this.p3, this.p1)
     ];
   }
   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 o(
+    return new a(
       (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, r = (t * this.p1.x + e * this.p2.x + s * this.p3.x) / i, a = (t * this.p1.y + e * this.p2.y + s * this.p3.y) / i;
-    return new o(r, a);
+    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 a(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) < 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 o(e, s);
+    return new a(e, s);
   }
   containsPoint(t) {
-    const e = h.area(
-      o.distance(t, this.p1),
-      o.distance(t, this.p2),
-      o.distance(this.p1, this.p2)
-    ), s = h.area(
-      o.distance(t, this.p2),
-      o.distance(t, this.p3),
-      o.distance(this.p2, this.p3)
-    ), i = h.area(
-      o.distance(t, this.p3),
-      o.distance(t, this.p1),
-      o.distance(this.p3, this.p1)
+    const e = c.area(
+      a.distance(t, this.p1),
+      a.distance(t, this.p2),
+      a.distance(this.p1, this.p2)
+    ), s = c.area(
+      a.distance(t, this.p2),
+      a.distance(t, this.p3),
+      a.distance(this.p2, this.p3)
+    ), 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 F(n) {
-  return new Promise((t) => setTimeout(t, n));
+function W(r) {
+  return new Promise((t) => setTimeout(t, r));
 }
-function $(n) {
+function T(r) {
   const t = [], e = {
     "(": ")",
     "[": "]",
     "{": "}"
   }, s = new Set(Object.values(e));
-  for (const i of n)
+  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 b(n) {
-  return n !== null && (typeof n == "object" || typeof n == "function");
+function M(r) {
+  return r !== null && (typeof r == "object" || typeof r == "function");
 }
-class H {
+class F {
   map = /* @__PURE__ */ new Map();
   weakMap = /* @__PURE__ */ new WeakMap();
   set(t, e) {
-    b(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 b(t) ? this.weakMap.get(t) : this.map.get(t);
+    return M(t) ? this.weakMap.get(t) : this.map.get(t);
   }
   has(t) {
-    return b(t) ? this.weakMap.has(t) : this.map.has(t);
+    return M(t) ? this.weakMap.has(t) : this.map.has(t);
   }
 }
-function U(n) {
-  if (!n.length) return [];
-  const t = [[n[0]]];
-  for (let s = 1, i = n.length; s < i; s++) {
-    const r = n[s];
-    e(r);
+function G(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 r = t[i], a = r[t[i].length - 1];
-      if (a < s) {
-        t[i + 1] = [...r, s];
+      const n = t[i], o = n[t[i].length - 1];
+      if (o < s) {
+        t[i + 1] = [...n, s];
         break;
-      } else a > s && i === 0 && (t[i] = [s]);
+      } else o > s && i === 0 && (t[i] = [s]);
     }
   }
   return t[t.length - 1];
@@ -737,16 +734,16 @@ class B {
     if (t.length === 0)
       throw new Error("Input cannot be empty");
     const e = /* @__PURE__ */ new Set(["I", "V", "X", "L", "C", "D", "M"]);
-    for (const a of t)
-      if (!e.has(a))
-        throw new Error(`Invalid Roman numeral character: ${a}`);
+    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 a = t.slice(i, i + 2);
-      if (this.ROMAN_MAP.has(a))
-        s += this.ROMAN_MAP.get(a), i += 2;
+      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);
+        const h = t[i], u = this.ROMAN_MAP.get(h);
         if (!u)
           throw new Error(`Invalid Roman numeral sequence at position ${i}`);
         s += u, i += 1;
@@ -768,20 +765,105 @@ class B {
     return e;
   }
 }
-function X(n) {
+function X(r) {
   let t;
-  const e = new Proxy(n, {
-    construct(s, i, r) {
+  const e = new Proxy(r, {
+    construct(s, i, n) {
       return t || (t = Reflect.construct(
         s,
         i,
-        r
+        n
       )), t;
     }
   });
-  return n.prototype.constructor = e, e;
+  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 v {
+  static instance = null;
+  listeners = {};
+  debugMode;
+  constructor(t = !1) {
+    this.debugMode = t, Object.keys(x).forEach(
+      (e) => {
+        this.listeners[e] = /* @__PURE__ */ new Set();
+      }
+    );
+  }
+  // 单例模式
+  static getInstance(t) {
+    return v.instance || (v.instance = new v(t)), v.instance;
+  }
+  /**
+   * 添加事件监听器
+   * @param event 事件名称
+   * @param listener 监听函数
+   */
+  on(t, e) {
+    this.debugLog(`添加事件监听: ${x[t]}`), this.listeners[t].add(e);
+  }
+  /**
+   * 触发事件
+   * @param event 事件名称
+   * @param params 事件参数
+   */
+  emit(t, e) {
+    this.debugLog(`触发事件: ${x[t]}`, e), this.listeners[t].forEach((s) => {
+      try {
+        s(e);
+      } catch (i) {
+        console.error(`事件 ${x[t]} 处理出错:`, i);
+      }
+    });
+  }
+  /**
+   * 移除事件监听器
+   * @param event 事件名称
+   * @param listener 监听函数
+   */
+  off(t, e) {
+    this.debugLog(`移除事件监听: ${x[t]}`), this.listeners[t].delete(e);
+  }
+  /**
+   * 添加一次性事件监听器
+   * @param event 事件名称
+   * @param listener 监听函数
+   */
+  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 b = {
   scriptRegex: /<script\b[^<]*(?:(?!<\/script>)<[^<]*)*<\/script>/gi,
   javascriptRegex: /javascript:/gi,
   eventHandlerRegex: /on\w+\s*=/gi,
@@ -828,12 +910,12 @@ const x = {
   ]),
   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元素
@@ -843,7 +925,7 @@ class v {
    * @returns 创建的HTMLElement
    */
   createElement(t, e = {}, s = "") {
-    if (!x.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;
@@ -856,12 +938,12 @@ class v {
   createBatch(t, e) {
     const s = document.createDocumentFragment();
     t.forEach((i) => {
-      const r = this.createElement(
+      const n = this.createElement(
         i.tag,
         i.attributes || {},
         i.content || ""
       );
-      s.appendChild(r);
+      s.appendChild(n);
     }), e.appendChild(s);
   }
   /**
@@ -879,7 +961,7 @@ class v {
    */
   _processAttributes(t, e) {
     Object.entries(e).forEach(([s, i]) => {
-      if (!x.allowedAttributes.has(s) && !s.startsWith("data-")) {
+      if (!b.allowedAttributes.has(s) && !s.startsWith("data-")) {
         console.warn(`Potentially unsafe attribute: ${s}`);
         return;
       }
@@ -918,10 +1000,10 @@ class v {
    * @private
    */
   _sanitizeHtml(t) {
-    return t.replace(x.scriptRegex, "").replace(x.javascriptRegex, "").replace(x.eventHandlerRegex, "");
+    return t.replace(b.scriptRegex, "").replace(b.javascriptRegex, "").replace(b.eventHandlerRegex, "");
   }
 }
-class G {
+class Q {
   features;
   constructor() {
     this.features = this.detectFeatures();
@@ -947,19 +1029,19 @@ class G {
     };
     return new Promise((s, i) => {
       navigator.geolocation.getCurrentPosition(
-        (r) => s({
-          latitude: r.coords.latitude,
-          longitude: r.coords.longitude,
-          accuracy: r.coords.accuracy,
-          timstamp: r.timestamp
+        (n) => s({
+          latitude: n.coords.latitude,
+          longitude: n.coords.longitude,
+          accuracy: n.coords.accuracy,
+          timstamp: n.timestamp
         }),
-        (r) => {
-          const a = {
+        (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(a[r.code] || "Unknown error"));
+          i(new Error(o[n.code] || "Unknown error"));
         },
         { ...e, ...t }
       );
@@ -1007,26 +1089,95 @@ class G {
       }
   }
 }
+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 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 {
-  k as Dictionary,
-  v as DomHelper,
-  D as Graph,
-  U as LIS,
-  V as LRU,
-  c as Line,
-  W as LinkedList,
-  y as Matrix,
-  R as MaxHeap,
-  H as MemoizeMap,
-  A as MinHeap,
-  o as Point,
-  z as Queue,
+  j as Dictionary,
+  I as DomHelper,
+  v as Emitter,
+  H as Graph,
+  G as LIS,
+  D as LRU,
+  l as Line,
+  q as LinkedList,
+  E as Matrix,
+  _ as MaxHeap,
+  F as MemoizeMap,
+  R as MinHeap,
+  a as Point,
+  U as Queue,
   B as Roman,
-  j as Stack,
-  h as Triangle,
-  f as Vector,
-  G as WebAppManager,
-  $ as isValidBracket,
+  V as Stack,
+  c as Triangle,
+  g as Vector,
+  Q as WebAppManager,
+  T as isValidBracket,
   X as singleton,
-  F as sleep
+  W as sleep
 };