jc-structure 0.1.14 → 0.1.15

package/dist/jc-structure.js

@@ -1,4 +1,4 @@
-class V {
+class j {
   items = {};
   count = 0;
   lowestCount = 0;
@@ -111,13 +111,13 @@ class $ {
     return this.isEmpty() ? "" : `MinStack(count: ${this.size()}):[${this.getMin()},...rest]`;
   }
 }
-function C(r, t) {
+function k(r, t) {
   return r === t ? 0 : r < t ? -1 : 1;
 }
-class w {
+class y {
   heap = [];
   compareFn;
-  constructor(t = C) {
+  constructor(t = k) {
     this.compareFn = t;
   }
   static getLeftIndex(t) {
@@ -148,7 +148,7 @@ class w {
     return this.heap.toString();
   }
 }
-class P extends w {
+class O extends y {
   insert(t) {
     return t ? !1 : (this.heap.push(t), this.siftUp(this.heap.length - 1), !0);
   }
@@ -159,24 +159,24 @@ class P extends w {
     return this.heap[0] = this.heap.pop(), this.siftDown(0), t;
   }
   siftUp(t) {
-    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));
+    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 = w.getParentIndex(t);
+    let e = y.getParentIndex(t);
     for (; t > 0 && e && this.compareFn(this.heap[e], this.heap[t]) === 1; )
-      w.swap(this.heap, e, t), t = e, e = w.getParentIndex(t);
+      y.swap(this.heap, e, t), t = e, e = y.getParentIndex(t);
   }
 }
-class q extends P {
-  constructor(t = (e, s) => C(s, e)) {
+class q extends O {
+  constructor(t = (e, s) => k(s, e)) {
     super(t);
   }
 }
 function R(r) {
   return { value: r };
 }
-class _ {
+class D {
   capacity;
   length = 0;
   head = null;
@@ -292,17 +292,17 @@ class H {
     return t = t.slice(0, -1), t;
   }
 }
-class z {
+class V {
   key;
   value;
   constructor(t, e) {
     this.key = t, this.value = e;
   }
 }
-function L(r, t = { emptyString: !1, zeroNumber: !1 }) {
+function P(r, t = { emptyString: !1, zeroNumber: !1 }) {
   return r == null ? !(t.emptyString && r === "" || t.zeroNumber && r === 0) : !1;
 }
-class j {
+class z {
   table = [];
   constructor() {
   }
@@ -313,15 +313,15 @@ class j {
     return -1;
   }
   set(t, e) {
-    if (L(t))
+    if (P(t))
       throw new Error("key is required");
-    if (L(e))
+    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 z(t, e);
+      const s = new V(t, e);
       this.table.push(s);
     }
   }
@@ -377,7 +377,7 @@ class W {
   vertices;
   adjList;
   constructor(t = !1) {
-    this.isDirected = t, this.vertices = [], this.adjList = new j();
+    this.isDirected = t, this.vertices = [], this.adjList = new z();
   }
   addVertex(t) {
     this.vertices.includes(t) || (this.vertices.push(t), this.adjList.set(t, []));
@@ -399,10 +399,10 @@ class W {
     return t;
   }
 }
-class g {
+class w {
   _data;
   static zero(t) {
-    return new g(...Array(t).fill(0));
+    return new w(...Array(t).fill(0));
   }
   constructor(...t) {
     this._data = t;
@@ -421,7 +421,7 @@ class g {
     if (t === 0)
       throw new Error("Cannot normalize a zero vector");
     const e = this._data.map((s) => s / t);
-    return new g(...e);
+    return new w(...e);
   }
   add(t) {
     if (this.dimension !== t.dimension)
@@ -429,7 +429,7 @@ class g {
     const e = this._data.map(
       (s, i) => s + t._data[i]
     );
-    return new g(...e);
+    return new w(...e);
   }
   sub(t) {
     if (this.dimension !== t.dimension)
@@ -437,10 +437,10 @@ class g {
     const e = this._data.map(
       (s, i) => s - t._data[i]
     );
-    return new g(...e);
+    return new w(...e);
   }
   mul(t) {
-    return new g(...this._data.map((e) => e * t));
+    return new w(...this._data.map((e) => e * t));
   }
   dot(t) {
     if (this.dimension !== t.dimension)
@@ -480,10 +480,10 @@ class E {
     return this.row * this.col;
   }
   rowVector(t) {
-    return new g(...this._matrix[t]);
+    return new w(...this._matrix[t]);
   }
   colVector(t) {
-    return new g(...this._matrix.map((e) => e[t]));
+    return new w(...this._matrix.map((e) => e[t]));
   }
   getItem(t) {
     return this._matrix[t[0]][t[1]];
@@ -534,7 +534,7 @@ class E {
     return e;
   }
 }
-class a {
+class c {
   static distance(t, e) {
     return Math.hypot(e.x - t.x, e.y - t.y);
   }
@@ -544,42 +544,42 @@ class a {
     this.x = t, this.y = e;
   }
   distanceTo(t) {
-    return a.distance(this, t);
+    return c.distance(this, t);
   }
 }
-class l {
+class m {
   // 使用更合适的精度阈值常量
   static EPSILON = 1e-10;
-  static sloped(t, e = l.EPSILON) {
+  static sloped(t, e = m.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);
+  static isParallel(t, e, s = m.EPSILON) {
+    const i = m.sloped(t), n = m.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 N = i + y * (o - i), O = n + y * (h - n);
-      return new a(N, O);
+  static getIntersection(t, e, s = m.EPSILON) {
+    if (m.isParallel(t, e)) return null;
+    const i = t.p1.x, n = t.p1.y, a = t.p2.x, h = t.p2.y, u = e.p1.x, f = e.p1.y, g = e.p2.x, o = e.p2.y, l = (i - a) * (f - o) - (n - h) * (u - g);
+    if (Math.abs(l) < s) return null;
+    const d = ((i - u) * (f - o) - (n - f) * (u - g)) / l, S = -((i - a) * (n - f) - (n - h) * (i - u)) / l;
+    if (d >= 0 && d <= 1 && S >= 0 && S <= 1) {
+      const C = i + d * (a - i), L = n + d * (h - n);
+      return new c(C, L);
     }
     return null;
   }
   static isIntersecting(t, e) {
-    return l.getIntersection(t, e) !== null;
+    return m.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);
+  static distanceToPoint(t, e, s = m.EPSILON) {
+    const i = e.x - t.p1.x, n = e.y - t.p1.y, a = t.p2.x - t.p1.x, h = t.p2.y - t.p1.y, u = i * a + n * h, f = a * a + h * h;
+    let g = -1;
+    f > s && (g = u / f);
+    let o, l;
+    g < 0 ? (o = t.p1.x, l = t.p1.y) : g > 1 ? (o = t.p2.x, l = t.p2.y) : (o = t.p1.x + g * a, l = t.p1.y + g * h);
+    const d = e.x - o, S = e.y - l;
+    return Math.hypot(d + S);
   }
   p1;
   p2;
@@ -592,21 +592,21 @@ class l {
   }
   get midpoint() {
     const t = (this.p1.x + this.p2.x) / 2, e = (this.p1.y + this.p2.y) / 2;
-    return new a(t, e);
+    return new c(t, e);
   }
   get angle() {
     return Math.atan2(this.p2.y - this.p1.y, this.p2.x - this.p1.x);
   }
-  containsPoint(t, e = l.EPSILON) {
+  containsPoint(t, e = m.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 < l.EPSILON) return new a(0, 0);
+    if (t < m.EPSILON) return new c(0, 0);
     const e = (this.p2.x - this.p1.x) / t, s = (this.p2.y - this.p1.y) / t;
-    return new a(e, s);
+    return new c(e, s);
   }
   get start() {
     return this.p1;
@@ -615,34 +615,34 @@ class l {
     return this.p2;
   }
 }
-class k {
+class N {
   static EPSILON = 1e-10;
   name;
   constructor(t) {
     this.name = t;
   }
 }
-class c extends k {
+class p 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 (!c.isValid(t, e, s))
+    if (!p.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))
+    if (!p.isValid(t, e, s))
       throw new Error("Invalid triangle sides");
-    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";
+    const i = [t, e, s].sort((u, f) => u - f), [n, a, h] = i;
+    return Math.abs(n - a) < p.EPSILON && Math.abs(a - h) < p.EPSILON ? "equilateral" : Math.abs(n - a) < p.EPSILON || Math.abs(a - h) < p.EPSILON ? "isosceles" : "scalene";
   }
   static getAngles(t, e, s) {
-    if (!c.isValid(t, e, s))
+    if (!p.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];
+    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)), a = Math.PI - i - n;
+    return [i, n, a];
   }
   p1;
   p2;
@@ -655,62 +655,62 @@ class c extends k {
   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;
+    ) < N.EPSILON;
   }
   get side() {
     return [
-      a.distance(this.p1, this.p2),
-      a.distance(this.p2, this.p3),
-      a.distance(this.p3, this.p1)
+      c.distance(this.p1, this.p2),
+      c.distance(this.p2, this.p3),
+      c.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);
+    return p.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);
+    return p.area(t, e, s);
   }
   get type() {
     const [t, e, s] = this.side;
-    return c.getType(t, e, s);
+    return p.getType(t, e, s);
   }
   get angles() {
     const [t, e, s] = this.side;
-    return c.getAngles(t, e, s);
+    return p.getAngles(t, e, s);
   }
   get centroid() {
-    return new a(
+    return new c(
       (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 a(n, o);
+    const [t, e, s] = this.side, i = this.perimeter() / 2, n = (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 c(n, a);
   }
   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)
+    if (Math.abs(t) < p.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);
+    return new c(e, s);
   }
   containsPoint(t) {
-    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)
+    const e = p.area(
+      c.distance(t, this.p1),
+      c.distance(t, this.p2),
+      c.distance(this.p1, this.p2)
+    ), s = p.area(
+      c.distance(t, this.p2),
+      c.distance(t, this.p3),
+      c.distance(this.p2, this.p3)
+    ), i = p.area(
+      c.distance(t, this.p3),
+      c.distance(t, this.p1),
+      c.distance(this.p3, this.p1)
     );
-    return Math.abs(e + s + i - this.area()) < c.EPSILON;
+    return Math.abs(e + s + i - this.area()) < p.EPSILON;
   }
 }
 function T(r) {
@@ -732,7 +732,7 @@ function F(r) {
 function M(r) {
   return r !== null && (typeof r == "object" || typeof r == "function");
 }
-class G {
+class B {
   map = /* @__PURE__ */ new Map();
   weakMap = /* @__PURE__ */ new WeakMap();
   set(t, e) {
@@ -745,7 +745,7 @@ class G {
     return M(t) ? this.weakMap.has(t) : this.map.has(t);
   }
 }
-function B(r) {
+function G(r) {
   if (!r.length) return [];
   const t = [[r[0]]];
   for (let s = 1, i = r.length; s < i; s++) {
@@ -754,11 +754,11 @@ function B(r) {
   }
   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) {
+      const n = t[i], a = n[t[i].length - 1];
+      if (a < s) {
         t[i + 1] = [...n, s];
         break;
-      } else o > s && i === 0 && (t[i] = [s]);
+      } else a > s && i === 0 && (t[i] = [s]);
     }
   }
   return t[t.length - 1];
@@ -783,14 +783,14 @@ class X {
     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 o of t)
-      if (!e.has(o))
-        throw new Error(`Invalid Roman numeral character: ${o}`);
+    for (const a of t)
+      if (!e.has(a))
+        throw new Error(`Invalid Roman numeral character: ${a}`);
     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;
+      const a = t.slice(i, i + 2);
+      if (this.ROMAN_MAP.has(a))
+        s += this.ROMAN_MAP.get(a), i += 2;
       else {
         const h = t[i], u = this.ROMAN_MAP.get(h);
         if (!u)
@@ -814,7 +814,167 @@ class X {
     return e;
   }
 }
-function Q(r) {
+class Q {
+  static isValidPositiveInteger(t) {
+    return Number.isInteger(t) && t > 0 && t <= Number.MAX_SAFE_INTEGER;
+  }
+  static isPowerOfTwo(t) {
+    return t > 0 && (t & t - 1) === 0;
+  }
+  static isOdd(t) {
+    return t % 2 === 1 || t % 2 === -1;
+  }
+  static factorial(t) {
+    if (!this.isValidPositiveInteger(t))
+      throw new Error("Input must be a non-negative integer");
+    if (t < 2)
+      return 1;
+    let e = 1;
+    for (let s = 2; s <= t; s++)
+      e *= s;
+    return e;
+  }
+  static fibonacci(t, e = 1, s = 1) {
+    if (!this.isValidPositiveInteger(t))
+      throw new Error("Input must be a non-negative integer");
+    return t < 2 ? s : this.fibonacci(t - 1, s, s + e);
+  }
+  static fibonacciIterative(t) {
+    if (!this.isValidPositiveInteger(t))
+      throw new Error("Input must be a non-negative integer");
+    let e = 1, s = 1;
+    for (let i = 2; i < t; i++)
+      [e, s] = [s, e + s];
+    return t === 0 ? 0 : s;
+  }
+  static getPercentWithPrecision(t, e = 2) {
+    if (!Array.isArray(t) || t.length === 0)
+      return [];
+    if (e < 0 || !Number.isInteger(e))
+      throw new Error("Precision must be a non-negative integer");
+    const s = t.reduce((o, l) => o + l, 0);
+    if (s === 0)
+      return t.map(() => "0%");
+    const n = 100 * Math.pow(10, e), a = t.map((o) => o / s * n), h = a.map((o) => Math.floor(o)), u = a.map((o, l) => o - h[l]);
+    let f = h.reduce((o, l) => o + l, 0), g = n - f;
+    for (; g > 0; ) {
+      let o = -1, l = -1;
+      for (let d = 0; d < u.length; d++)
+        u[d] > l && (l = u[d], o = d);
+      if (o === -1) break;
+      h[o]++, u[o] = 0, g--;
+    }
+    return h.map((o) => `${(o / n * 100).toFixed(e)}%`);
+  }
+  static fastSqrt(t) {
+    if (t < 0)
+      throw new Error("n must be a non-negative number");
+    const e = 0.5 * t;
+    let s = new BigInt64Array(new Float32Array([t]).buffer)[0];
+    s = 0x1ff7a3bea91d9b1bn + (s >> 1n);
+    let i = new Float64Array(new BigInt64Array([s]).buffer)[0];
+    return i = i * 0.5 + e / i, i = i * 0.5 + e / i, i = i * 0.5 + e / i, i;
+  }
+  static middle(t, e) {
+    return e - (e - t >> 1);
+  }
+  static gcd(t, e) {
+    return e === 0 ? t : this.gcd(e, t % e);
+  }
+  static lcm(t, e) {
+    return t * e / this.gcd(t, e);
+  }
+  static isPrime(t) {
+    if (t <= 1)
+      return !1;
+    for (let e = 2; e <= Math.sqrt(t); e++)
+      if (t % e === 0)
+        return !1;
+    return !0;
+  }
+  static isPalindrome(t) {
+    if (t < 0 || t % 10 === 0 && t !== 0)
+      return !1;
+    let e = 0, s = t;
+    for (; t > 0; ) {
+      const i = t % 10;
+      e = e * 10 + i, t = Math.floor(t / 10);
+    }
+    return s === e;
+  }
+  static isArmstrong(t) {
+    const e = t.toString(), s = e.length;
+    let i = 0;
+    for (let n = 0; n < s; n++)
+      i += Math.pow(parseInt(e[n]), s);
+    return i === t;
+  }
+  static isPerfect(t) {
+    let e = 0;
+    for (let s = 1; s < t; s++)
+      t % s === 0 && (e += s);
+    return e === t;
+  }
+  static scale(t, e, s) {
+    if (e[0] >= e[1] || s[0] >= s[1])
+      throw new Error("Invalid range");
+    const i = e[1] - e[0];
+    return (t - e[0]) * ((s[1] - s[0]) / i) + s[0];
+  }
+  static randomInt(t, e) {
+    return Math.floor(Math.random() * (e - t + 1)) + t;
+  }
+  static floatEqual(t, e, s = 1e-6) {
+    return Math.abs(t - e) < s;
+  }
+  static isSameSign(t, e) {
+    return t >= 0 && e >= 0 || t <= 0 && e <= 0;
+  }
+}
+class K {
+  static READ = 1;
+  static WRITE = 2;
+  static SHARE = 4;
+  static DELETE = 8;
+  static CREATE = 16;
+  static include(t, e) {
+    return (t & e) === e;
+  }
+  static add(t, e) {
+    return t | e;
+  }
+  static remove(t, e) {
+    return t & ~e;
+  }
+  static toggle(t, e) {
+    return t ^ e;
+  }
+}
+class Z {
+  static longestCommonPrefix(t) {
+    if (!t.length) return "";
+    let e = t[0];
+    for (let s = 1; s < t.length; s++)
+      for (; !t[s].startsWith(e); )
+        if (e = e.slice(0, -1), e === "") return "";
+    return e;
+  }
+  static uuid(t) {
+    return typeof t == "number" ? (t ^ Math.random() * 16 >> t / 4).toString(16) : (9987e3 + -1e11).toString().replace(/[018]/g, (e) => {
+      const s = parseInt(e, 10);
+      return this.uuid(s);
+    });
+  }
+}
+class J {
+  static isValidHex(t) {
+    return /^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/.test(t);
+  }
+  static isValidRGB(t) {
+    return /^rgb\((\d{1,3}),\s*(\d{1,3}),\s*(\d{1,3})\)$/.test(t);
+  }
+}
+function Y(r) {
   let t;
   const e = new Proxy(r, {
     construct(s, i, n) {
@@ -839,7 +999,7 @@ const x = {
   UI_HIDE_LOADING: "隐藏加载事件",
   UI_SHOW_MESSAGE: "显示消息事件"
 };
-class v {
+class I {
   static instance = null;
   listeners = {};
   debugMode;
@@ -852,7 +1012,7 @@ class v {
   }
   // 单例模式
   static getInstance(t) {
-    return v.instance || (v.instance = new v(t)), v.instance;
+    return I.instance || (I.instance = new I(t)), I.instance;
   }
   /**
    * 添加事件监听器
@@ -959,12 +1119,12 @@ const b = {
   ]),
   allowedAttributes: /* @__PURE__ */ new Set(["class", "id", "href", "src", "alt", "title"])
 };
-class I {
+class v {
   static instance;
   constructor() {
   }
   static getInstance() {
-    return I.instance || (I.instance = new I()), I.instance;
+    return v.instance || (v.instance = new v()), v.instance;
   }
   /**
    * 创建DOM元素
@@ -1052,7 +1212,7 @@ class I {
     return t.replace(b.scriptRegex, "").replace(b.javascriptRegex, "").replace(b.eventHandlerRegex, "");
   }
 }
-class K {
+class tt {
   features;
   constructor() {
     this.features = this.detectFeatures();
@@ -1085,12 +1245,12 @@ class K {
           timstamp: n.timestamp
         }),
         (n) => {
-          const o = {
+          const a = {
             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"));
+          i(new Error(a[n.code] || "Unknown error"));
         },
         { ...e, ...t }
       );
@@ -1199,35 +1359,39 @@ Object.defineProperties(Element.prototype, {
 });
 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 s = r.split("."), i = s[0], n = s.slice(1).join(" "), a = this.textContent.indexOf(t);
+  if (a < 0) return null;
   const h = document.createRange();
-  h.setStart(this, o), h.setEnd(this, o + t.length);
+  h.setStart(this, a), h.setEnd(this, a + t.length);
   const u = document.createElement(i);
   return n && (u.className = n), h.surroundContents(u), u;
 };
 export {
-  j as Dictionary,
-  I as DomHelper,
-  v as Emitter,
+  K as BitPerm,
+  J as Color,
+  z as Dictionary,
+  v as DomHelper,
+  I as Emitter,
   W as Graph,
-  B as LIS,
-  _ as LRU,
-  l as Line,
+  G as LIS,
+  D as LRU,
+  m as Line,
   H as LinkedList,
   E as Matrix,
   q as MaxHeap,
-  G as MemoizeMap,
-  P as MinHeap,
+  B as MemoizeMap,
+  O as MinHeap,
   $ as MinStack,
-  a as Point,
-  V as Queue,
+  Q as Num,
+  c as Point,
+  j as Queue,
   X as Roman,
   U as Stack,
-  c as Triangle,
-  g as Vector,
-  K as WebAppManager,
+  Z as Str,
+  p as Triangle,
+  w as Vector,
+  tt as WebAppManager,
   F as isValidBracket,
-  Q as singleton,
+  Y as singleton,
   T as sleep
 };

package/dist/jc-structure.umd.cjs

@@ -1,2 +1,2 @@
-(function(a,S){typeof exports=="object"&&typeof module<"u"?S(exports):typeof define=="function"&&define.amd?define(["exports"],S):(a=typeof globalThis<"u"?globalThis:a||self,S(a["jc-structure"]={}))})(this,(function(a){"use strict";class S{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 z{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){return t==null||t==null?this:Array.isArray(t)?this.addItems(t):this.addItem(t)}addItem(t){if(!this.isValidItem(t))throw new Error("Invalid item: item cannot be null or undefined");return this.items[this.count]=t,this.count++,this}addItems(t){return t.filter(s=>this.isValidItem(s)).forEach(s=>{this.items[this.count]=s,this.count++}),this}isValidItem(t){return t!=null}peek(){return this.isEmpty()?void 0:this.items[this.count-1]}isEmpty(){return this.count===0}size(){return this.count}clear(){this.items={},this.count=0}toString(){return this.isEmpty()?"":`Stack(count: ${this.count}):[${this.items[this.count-1]},...rest]`}}class j{stack=[];minStack=[];push(t){this.stack.push(t),(this.minStack.length===0||t<=this.minStack[this.minStack.length-1])&&this.minStack.push(t)}pop(){const t=this.stack.pop();return t===this.minStack[this.minStack.length-1]&&this.minStack.pop(),t}peek(){return this.stack[this.stack.length-1]}getMin(){return this.minStack[this.minStack.length-1]}isEmpty(){return this.size()===0}size(){return this.stack.length}clear(){this.stack=[],this.minStack=[]}toString(){return this.isEmpty()?"":`MinStack(count: ${this.size()}):[${this.getMin()},...rest]`}}function A(r,t){return r===t?0:r<t?-1:1}class y{heap=[];compareFn;constructor(t=A){this.compareFn=t}static getLeftIndex(t){return 2*t+1}static getRightIndex(t){return 2*t+2}static getParentIndex(t){return t===0?void 0:Math.floor((t-1)/2)}static swap(t,e,s){[t[e],t[s]]=[t[s],t[e]]}find(){return this.isEmpty()?void 0:this.heap[0]}size(){return this.heap.length}isEmpty(){return this.size()===0}clear(){this.heap=[]}toString(){return this.heap.toString()}}class C extends 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 V extends C{constructor(t=(e,s)=>A(s,e)){super(t)}}function U(r){return{value:r}}class D{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=U(e),this.length++,this.prepend(s),this.trimCache(),this.lookup.set(t,s),this.reverseLookup)}}let N=class{value;next=void 0};class ${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 N;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 N;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 O{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 O}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 Q=i+I*(o-i),K=n+I*(u-n);return new h(Q,K)}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 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((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))<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 k(r){return r!==null&&(typeof r=="object"||typeof r=="function")}class T{map=new Map;weakMap=new WeakMap;set(t,e){k(t)?this.weakMap.set(t,e):this.map.set(t,e)}get(t){return k(t)?this.weakMap.get(t):this.map.get(t)}has(t){return k(t)?this.weakMap.has(t):this.map.has(t)}}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 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 F{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 B(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 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 v{static instance;constructor(){}static getInstance(){return v.instance||(v.instance=new v),v.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 X{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=O,a.DomHelper=v,a.Emitter=b,a.Graph=H,a.LIS=G,a.LRU=D,a.Line=p,a.LinkedList=$,a.Matrix=w,a.MaxHeap=V,a.MemoizeMap=T,a.MinHeap=C,a.MinStack=j,a.Point=h,a.Queue=S,a.Roman=F,a.Stack=z,a.Triangle=c,a.Vector=d,a.WebAppManager=X,a.isValidBracket=W,a.singleton=B,a.sleep=_,Object.defineProperty(a,Symbol.toStringTag,{value:"Module"})}));
+(function(o,S){typeof exports=="object"&&typeof module<"u"?S(exports):typeof define=="function"&&define.amd?define(["exports"],S):(o=typeof globalThis<"u"?globalThis:o||self,S(o["jc-structure"]={}))})(this,(function(o){"use strict";class S{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 V{items={};count=0;constructor(){}pop(){if(this.isEmpty())return;this.count--;const t=this.items[this.count];return delete this.items[this.count],t}push(t){return t==null||t==null?this:Array.isArray(t)?this.addItems(t):this.addItem(t)}addItem(t){if(!this.isValidItem(t))throw new Error("Invalid item: item cannot be null or undefined");return this.items[this.count]=t,this.count++,this}addItems(t){return t.filter(i=>this.isValidItem(i)).forEach(i=>{this.items[this.count]=i,this.count++}),this}isValidItem(t){return t!=null}peek(){return this.isEmpty()?void 0:this.items[this.count-1]}isEmpty(){return this.count===0}size(){return this.count}clear(){this.items={},this.count=0}toString(){return this.isEmpty()?"":`Stack(count: ${this.count}):[${this.items[this.count-1]},...rest]`}}class z{stack=[];minStack=[];push(t){this.stack.push(t),(this.minStack.length===0||t<=this.minStack[this.minStack.length-1])&&this.minStack.push(t)}pop(){const t=this.stack.pop();return t===this.minStack[this.minStack.length-1]&&this.minStack.pop(),t}peek(){return this.stack[this.stack.length-1]}getMin(){return this.minStack[this.minStack.length-1]}isEmpty(){return this.size()===0}size(){return this.stack.length}clear(){this.stack=[],this.minStack=[]}toString(){return this.isEmpty()?"":`MinStack(count: ${this.size()}):[${this.getMin()},...rest]`}}function k(r,t){return r===t?0:r<t?-1:1}class E{heap=[];compareFn;constructor(t=k){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,i){[t[e],t[i]]=[t[i],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 E{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,i=E.getLeftIndex(e),s=E.getRightIndex(e),n=this.size();i<n&&this.compareFn(this.heap[e],this.heap[i])===-1&&(e=i),s<n&&this.compareFn(this.heap[e],this.heap[s])===1&&(e=s),e!==t&&(E.swap(this.heap,t,e),this.siftUp(e))}siftDown(t){let e=E.getParentIndex(t);for(;t>0&&e&&this.compareFn(this.heap[e],this.heap[t])===1;)E.swap(this.heap,e,t),t=e,e=E.getParentIndex(t)}}class j extends N{constructor(t=(e,i)=>k(i,e)){super(t)}}function U(r){return{value:r}}class D{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 i=this.lookup.get(t);i?(this.detach(i),this.prepend(i),i.value=e):(i=U(e),this.length++,this.prepend(i),this.trimCache(),this.lookup.set(t,i),this.reverseLookup)}}let L=class{value;next=void 0};class ${count=0;head=void 0;constructor(){}indexOf(t){let e=this.head,i=0,s=!1;for(;e;){if(this.equals(e.value,t)){s=!0;break}i++,e=e.next}return s?i:-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 i=0;i<t;i++)e=e?.next;return e}getValueAt(t){return this.getElementAt(t)?.value}insert(t,e){let i=new L;if(i.value=t,e>this.count||e<0)throw new Error("index error");this.count++;let s,n;if(e===0){i.next=this.head,this.head=i;return}s=this.getElementAt(e-1),n=s.next,s.next=i,i.next=n}push(t){let e=new L;if(e.value=t,this.count++,this.isEmpty()){this.head=e;return}let i=this.getElementAt(this.count-1);i.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),i=this.getElementAt(t-1),s=e?.next;return t===0&&(this.head=s),i&&(i.next=s),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 C(r,t={emptyString:!1,zeroNumber:!1}){return r==null?!(t.emptyString&&r===""||t.zeroNumber&&r===0):!1}class O{table=[];constructor(){}getItemIndex(t){for(let e=0,i=this.table.length;e<i;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 i=this.getItemIndex(t);this.table[i].value=e}else{const i=new q(t,e);this.table.push(i)}}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,i=this.size();e<i;e++){let s=this.table[e];if(!t(s.key,s.value))break}}isEmpty(){return!this.size()}size(){return this.table.length}clear(){this.table=[]}toString(){let t="";for(let e=0,i=this.table.length;e<i;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 O}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 y{_data;static zero(t){return new y(...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(i=>i/t);return new y(...e)}add(t){if(this.dimension!==t.dimension)throw new Error("Vectors must have the same dimension to add");const e=this._data.map((i,s)=>i+t._data[s]);return new y(...e)}sub(t){if(this.dimension!==t.dimension)throw new Error("Vectors must have the same dimension to subtract");const e=this._data.map((i,s)=>i-t._data[s]);return new y(...e)}mul(t){return new y(...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,i,s)=>e+i*t._data[s],0)}pos(){return this.mul(1)}neg(){return this.mul(-1)}}class x{_matrix;static zero(t,e){return new x(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 y(...this._matrix[t])}colVector(t){return new y(...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 x(this._matrix.map(e=>e.map(i=>i*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 x(this._matrix.map((e,i)=>e.map((s,n)=>s+t.getItem([i,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 x(this._matrix.map(e=>e.map((i,s)=>i*t.getItem(s))))}mulMatrix(t){if(this.col!==t.row)throw new Error("Matrix dimensions do not match");const e=x.zero(this.row,t.col);for(let i=0;i<this.row;i++){const s=this.rowVector(i);for(let n=0;n<this.col;n++)e.setItem([i,n],s.dot(t.colVector(n)))}return e}}class c{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 c.distance(this,t)}}class f{static EPSILON=1e-10;static sloped(t,e=f.EPSILON){const i=t.p2.x-t.p1.x,s=t.p2.y-t.p1.y;return Math.abs(i)<e?Math.abs(s)<e?0:null:s/i}static isParallel(t,e,i=f.EPSILON){const s=f.sloped(t),n=f.sloped(e);return s===null&&n===null?!0:s===null||n===null?!1:Math.abs(s-n)<i}static getIntersection(t,e,i=f.EPSILON){if(f.isParallel(t,e))return null;const s=t.p1.x,n=t.p1.y,a=t.p2.x,u=t.p2.y,l=e.p1.x,m=e.p1.y,w=e.p2.x,h=e.p2.y,d=(s-a)*(m-h)-(n-u)*(l-w);if(Math.abs(d)<i)return null;const g=((s-l)*(m-h)-(n-m)*(l-w))/d,A=-((s-a)*(n-m)-(n-u)*(s-l))/d;if(g>=0&&g<=1&&A>=0&&A<=1){const Y=s+g*(a-s),tt=n+g*(u-n);return new c(Y,tt)}return null}static isIntersecting(t,e){return f.getIntersection(t,e)!==null}static distanceToPoint(t,e,i=f.EPSILON){const s=e.x-t.p1.x,n=e.y-t.p1.y,a=t.p2.x-t.p1.x,u=t.p2.y-t.p1.y,l=s*a+n*u,m=a*a+u*u;let w=-1;m>i&&(w=l/m);let h,d;w<0?(h=t.p1.x,d=t.p1.y):w>1?(h=t.p2.x,d=t.p2.y):(h=t.p1.x+w*a,d=t.p1.y+w*u);const g=e.x-h,A=e.y-d;return Math.hypot(g+A)}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 c(t,e)}get angle(){return Math.atan2(this.p2.y-this.p1.y,this.p2.x-this.p1.x)}containsPoint(t,e=f.EPSILON){const i=(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(i)>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<f.EPSILON)return new c(0,0);const e=(this.p2.x-this.p1.x)/t,i=(this.p2.y-this.p1.y)/t;return new c(e,i)}get start(){return this.p1}get end(){return this.p2}}class R{static EPSILON=1e-10;name;constructor(t){this.name=t}}class p extends R{static isValid(t,e,i){return t<=0||e<=0||i<=0?!1:t+e>i&&t+i>e&&e+i>t}static area(t,e,i){if(!p.isValid(t,e,i))throw new Error("Invalid triangle");const s=(t+e+i)/2;return Math.sqrt(s*(s-t)*(s-e)*(s-i))}static getType(t,e,i){if(!p.isValid(t,e,i))throw new Error("Invalid triangle sides");const s=[t,e,i].sort((l,m)=>l-m),[n,a,u]=s;return Math.abs(n-a)<p.EPSILON&&Math.abs(a-u)<p.EPSILON?"equilateral":Math.abs(n-a)<p.EPSILON||Math.abs(a-u)<p.EPSILON?"isosceles":"scalene"}static getAngles(t,e,i){if(!p.isValid(t,e,i))throw new Error("Invalid triangle sides");const s=Math.acos((e*e+i*i-t*t)/(2*e*i)),n=Math.acos((t*t+i*i-e*e)/(2*t*i)),a=Math.PI-s-n;return[s,n,a]}p1;p2;p3;constructor(t,e,i,s="triangle"){if(super(s),this.p1=t,this.p2=e,this.p3=i,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[c.distance(this.p1,this.p2),c.distance(this.p2,this.p3),c.distance(this.p3,this.p1)]}perimeter(){return p.isValid(this.side[0],this.side[1],this.side[2]),this.side.reduce((t,e)=>t+e,0)}area(){const[t,e,i]=this.side;return p.area(t,e,i)}get type(){const[t,e,i]=this.side;return p.getType(t,e,i)}get angles(){const[t,e,i]=this.side;return p.getAngles(t,e,i)}get centroid(){return new c((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,i]=this.side,s=this.perimeter()/2,n=(t*this.p1.x+e*this.p2.x+i*this.p3.x)/s,a=(t*this.p1.y+e*this.p2.y+i*this.p3.y)/s;return new c(n,a)}get circumcenter(){const t=2*(this.p1.x*(this.p2.y-this.p3.y)+this.p2.x*(this.p3.y-this.p1.y)+this.p3.x*(this.p1.y-this.p2.y));if(Math.abs(t)<p.EPSILON)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,i=((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 c(e,i)}containsPoint(t){const e=p.area(c.distance(t,this.p1),c.distance(t,this.p2),c.distance(this.p1,this.p2)),i=p.area(c.distance(t,this.p2),c.distance(t,this.p3),c.distance(this.p2,this.p3)),s=p.area(c.distance(t,this.p3),c.distance(t,this.p1),c.distance(this.p3,this.p1));return Math.abs(e+i+s-this.area())<p.EPSILON}}function T(r){return new Promise(t=>setTimeout(t,r))}function _(r){const t=[],e={"(":")","[":"]","{":"}"},i=new Set(Object.values(e));for(const s of r)if(s in e)t.push(e[s]);else if(i.has(s)&&s!==t.pop())return!1;return t.length===0}function P(r){return r!==null&&(typeof r=="object"||typeof r=="function")}class W{map=new Map;weakMap=new WeakMap;set(t,e){P(t)?this.weakMap.set(t,e):this.map.set(t,e)}get(t){return P(t)?this.weakMap.get(t):this.map.get(t)}has(t){return P(t)?this.weakMap.has(t):this.map.has(t)}}function F(r){if(!r.length)return[];const t=[[r[0]]];for(let i=1,s=r.length;i<s;i++){const n=r[i];e(n)}function e(i){for(let s=t.length-1;s>=0;s--){const n=t[s],a=n[t[s].length-1];if(a<i){t[s+1]=[...n,i];break}else a>i&&s===0&&(t[s]=[i])}}return t[t.length-1]}class B{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 a of t)if(!e.has(a))throw new Error(`Invalid Roman numeral character: ${a}`);let i=0,s=0;for(;s<t.length;){const a=t.slice(s,s+2);if(this.ROMAN_MAP.has(a))i+=this.ROMAN_MAP.get(a),s+=2;else{const u=t[s],l=this.ROMAN_MAP.get(u);if(!l)throw new Error(`Invalid Roman numeral sequence at position ${s}`);i+=l,s+=1}}if(this.toRoman(i)!==t)throw new Error("Invalid Roman numeral sequence");return i}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[i,s]of this.ROMAN_MAP)for(;t>=s;)e+=i,t-=s;return e}}class G{static isValidPositiveInteger(t){return Number.isInteger(t)&&t>0&&t<=Number.MAX_SAFE_INTEGER}static isPowerOfTwo(t){return t>0&&(t&t-1)===0}static isOdd(t){return t%2===1||t%2===-1}static factorial(t){if(!this.isValidPositiveInteger(t))throw new Error("Input must be a non-negative integer");if(t<2)return 1;let e=1;for(let i=2;i<=t;i++)e*=i;return e}static fibonacci(t,e=1,i=1){if(!this.isValidPositiveInteger(t))throw new Error("Input must be a non-negative integer");return t<2?i:this.fibonacci(t-1,i,i+e)}static fibonacciIterative(t){if(!this.isValidPositiveInteger(t))throw new Error("Input must be a non-negative integer");let e=1,i=1;for(let s=2;s<t;s++)[e,i]=[i,e+i];return t===0?0:i}static getPercentWithPrecision(t,e=2){if(!Array.isArray(t)||t.length===0)return[];if(e<0||!Number.isInteger(e))throw new Error("Precision must be a non-negative integer");const i=t.reduce((h,d)=>h+d,0);if(i===0)return t.map(()=>"0%");const n=100*Math.pow(10,e),a=t.map(h=>h/i*n),u=a.map(h=>Math.floor(h)),l=a.map((h,d)=>h-u[d]);let m=u.reduce((h,d)=>h+d,0),w=n-m;for(;w>0;){let h=-1,d=-1;for(let g=0;g<l.length;g++)l[g]>d&&(d=l[g],h=g);if(h===-1)break;u[h]++,l[h]=0,w--}return u.map(h=>`${(h/n*100).toFixed(e)}%`)}static fastSqrt(t){if(t<0)throw new Error("n must be a non-negative number");const e=.5*t;let i=new BigInt64Array(new Float32Array([t]).buffer)[0];i=0x1ff7a3bea91d9b1bn+(i>>1n);let s=new Float64Array(new BigInt64Array([i]).buffer)[0];return s=s*.5+e/s,s=s*.5+e/s,s=s*.5+e/s,s}static middle(t,e){return e-(e-t>>1)}static gcd(t,e){return e===0?t:this.gcd(e,t%e)}static lcm(t,e){return t*e/this.gcd(t,e)}static isPrime(t){if(t<=1)return!1;for(let e=2;e<=Math.sqrt(t);e++)if(t%e===0)return!1;return!0}static isPalindrome(t){if(t<0||t%10===0&&t!==0)return!1;let e=0,i=t;for(;t>0;){const s=t%10;e=e*10+s,t=Math.floor(t/10)}return i===e}static isArmstrong(t){const e=t.toString(),i=e.length;let s=0;for(let n=0;n<i;n++)s+=Math.pow(parseInt(e[n]),i);return s===t}static isPerfect(t){let e=0;for(let i=1;i<t;i++)t%i===0&&(e+=i);return e===t}static scale(t,e,i){if(e[0]>=e[1]||i[0]>=i[1])throw new Error("Invalid range");const s=e[1]-e[0];return(t-e[0])*((i[1]-i[0])/s)+i[0]}static randomInt(t,e){return Math.floor(Math.random()*(e-t+1))+t}static floatEqual(t,e,i=1e-6){return Math.abs(t-e)<i}static isSameSign(t,e){return t>=0&&e>=0||t<=0&&e<=0}}class X{static READ=1;static WRITE=2;static SHARE=4;static DELETE=8;static CREATE=16;static include(t,e){return(t&e)===e}static add(t,e){return t|e}static remove(t,e){return t&~e}static toggle(t,e){return t^e}}class Q{static longestCommonPrefix(t){if(!t.length)return"";let e=t[0];for(let i=1;i<t.length;i++)for(;!t[i].startsWith(e);)if(e=e.slice(0,-1),e==="")return"";return e}static uuid(t){return typeof t=="number"?(t^Math.random()*16>>t/4).toString(16):(9987e3+-1e11).toString().replace(/[018]/g,e=>{const i=parseInt(e,10);return this.uuid(i)})}}class K{static isValidHex(t){return/^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/.test(t)}static isValidRGB(t){return/^rgb\((\d{1,3}),\s*(\d{1,3}),\s*(\d{1,3})\)$/.test(t)}}function Z(r){let t;const e=new Proxy(r,{construct(i,s,n){return t||(t=Reflect.construct(i,s,n)),t}});return r.prototype.constructor=e,e}const b={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 I{static instance=null;listeners={};debugMode;constructor(t=!1){this.debugMode=t,Object.keys(b).forEach(e=>{this.listeners[e]=new Set})}static getInstance(t){return I.instance||(I.instance=new I(t)),I.instance}on(t,e){this.debugLog(`添加事件监听: ${b[t]}`),this.listeners[t].add(e)}emit(t,e){this.debugLog(`触发事件: ${b[t]}`,e),this.listeners[t].forEach(i=>{try{i(e)}catch(s){console.error(`事件 ${b[t]} 处理出错:`,s)}})}off(t,e){this.debugLog(`移除事件监听: ${b[t]}`),this.listeners[t].delete(e)}once(t,e){this.debugLog(`添加一次性事件监听: ${b[t]}`);const i=s=>{e(s),this.off(t,i)};this.on(t,i)}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 v{static instance;constructor(){}static getInstance(){return v.instance||(v.instance=new v),v.instance}createElement(t,e={},i=""){if(!M.allowedTags.has(t.toLowerCase()))throw new Error(`Unsupported tag: ${t}`);const s=document.createElement(t);return this._processAttributes(s,e),this._processContent(s,i),s}createBatch(t,e){const i=document.createDocumentFragment();t.forEach(s=>{const n=this.createElement(s.tag,s.attributes||{},s.content||"");i.appendChild(n)}),e.appendChild(i)}setHtml(t,e){const i=this._sanitizeHtml(e);t.innerHTML=i}_processAttributes(t,e){Object.entries(e).forEach(([i,s])=>{if(!M.allowedAttributes.has(i)&&!i.startsWith("data-")){console.warn(`Potentially unsafe attribute: ${i}`);return}if(typeof s=="function")i.startsWith("on")&&t.addEventListener(i.slice(2).toLowerCase(),s);else switch(i){case"className":t.className=s;break;case"dataset":Object.assign(t.dataset,s);break;case"style":Object.assign(t.style,s);break;default:t.setAttribute(i,s)}})}_processContent(t,e){typeof e=="string"?t.textContent=e:e instanceof Node?t.appendChild(e):Array.isArray(e)&&e.forEach(i=>{typeof i=="string"?t.appendChild(document.createTextNode(i)):t.appendChild(i)})}_sanitizeHtml(t){return t.replace(M.scriptRegex,"").replace(M.javascriptRegex,"").replace(M.eventHandlerRegex,"")}}class J{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((i,s)=>{navigator.geolocation.getCurrentPosition(n=>i({latitude:n.coords.latitude,longitude:n.coords.longitude,accuracy:n.coords.accuracy,timstamp:n.timestamp}),n=>{const a={1:"User denied the request for Geolocation.",2:"Position information is unavailable.",3:"The request to get user location timed out."};s(new Error(a[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 i=this.codePointAt(t);t+=i>65535?2:1,r++}return r},String.prototype.pointAt=function(r){if(r>=this.pointLength())return;let t=0;for(let e=0,i=this.length;e<i;){const s=this.codePointAt(e);if(!s)return;if(t===r)return String.fromCodePoint(s);e+=s>65535?2:1,t++}},String.prototype.sliceByPoint=function(r,t=this.pointLength()){let e="";for(let i=r;i<t;i++)e+=this.pointAt(i);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 i=e.closest(r);if(!i)break;t=i,e=i.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 i=r.split("."),s=i[0],n=i.slice(1).join(" "),a=this.textContent.indexOf(t);if(a<0)return null;const u=document.createRange();u.setStart(this,a),u.setEnd(this,a+t.length);const l=document.createElement(s);return n&&(l.className=n),u.surroundContents(l),l},o.BitPerm=X,o.Color=K,o.Dictionary=O,o.DomHelper=v,o.Emitter=I,o.Graph=H,o.LIS=F,o.LRU=D,o.Line=f,o.LinkedList=$,o.Matrix=x,o.MaxHeap=j,o.MemoizeMap=W,o.MinHeap=N,o.MinStack=z,o.Num=G,o.Point=c,o.Queue=S,o.Roman=B,o.Stack=V,o.Str=Q,o.Triangle=p,o.Vector=y,o.WebAppManager=J,o.isValidBracket=_,o.singleton=Z,o.sleep=T,Object.defineProperty(o,Symbol.toStringTag,{value:"Module"})}));

package/index.d.ts

@@ -324,23 +324,6 @@ declare module "jc-structure" {
     has(key: unknown): boolean;
   }
 
-  /**
-   * 罗马数字类
-   */
-  interface RomanConstructor {
-    /**
-     * #### 转阿拉伯数字
-     * @param str 罗马数字文本
-     */
-    toInteger(str: string): number;
-    /**
-     * #### 转罗马数字
-     * @param num 阿拉伯整数
-     */
-    toRoman(num: number): string;
-  }
-  declare var Roman: RomanConstructor;
-
   interface Point {
     /**
      * #### 点x坐标
@@ -443,67 +426,14 @@ declare module "jc-structure" {
   }
   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;
@@ -567,6 +497,7 @@ declare module "jc-structure" {
     getTYpe(a: number, b: number, c: number): TriangleType;
   }
   declare var Triangle: TriangleConstructor;
+
   /**
    * ### 向量类
    */
@@ -660,4 +591,203 @@ declare module "jc-structure" {
    * @param str 含括号的字符串
    */
   export function isValidBracket(str: string): boolean;
+
+  interface NumConstructor {
+    new (value?: any): Number;
+    readonly prototype: Number;
+
+    /**
+     * #### 判断是否是有效的正整数
+     * @param n A numeric value
+     */
+    isValidPositiveInteger(n: number): boolean;
+
+    /**
+     * #### 判断是否是2的幂
+     * @param n A numeric value
+     */
+    isPowerOfTwo(n: number): boolean;
+
+    /**
+     * #### 判断是否是奇数
+     * @param n A numeric value
+     */
+    isOdd(n: number): boolean;
+
+    /**
+     * #### 正整数阶乘
+     * @param n A numeric value
+     */
+    factorial(n: number): number;
+
+    /**
+     * #### 计算斐波那契数
+     * - 采用尾递归的方法，避免递归深度过深导致的栈溢出问题
+     * @param n A positive integer
+     * @param start 起始值,默认为1
+     * @param total 总数,默认为1
+     */
+    fibonacci(n: number, start?: number, total?: number): number;
+
+    /**
+     * #### 计算斐波那契数
+     * - 采用滑动数组的方法，避免递归深度过深导致的栈溢出问题
+     * @param n A positive integer
+     */
+    fibonacciIterative(n: number): number;
+
+    /**
+     * #### 获取百分比字符串数组
+     * - 使用了"最大余数法"（也称为"汉密尔顿方法"）来分配百分比
+     * - 这种方法可以确保所有百分比加起来正好等于100%，避免由于四舍五入造成的误差
+     * @param valueList 数值数组
+     * @param precision 精度位数，默认2位小数
+     * @returns 格式化的百分比字符串数组
+     */
+    getPercentWithPrecision(valueList: number[], precision?: number): string[];
+
+    /**
+     * #### 史上最快开方算法
+     * @param n A non-negative number
+     */
+    fastSqrt(n: number): number;
+
+    /**
+     * #### 获取中位数
+     * @param n A numeric value
+     */
+    middle(n: number): number;
+
+    /**
+     * #### 获取最大公约数
+     * @param a
+     * @param b
+     */
+    gcd(a: number, b: number): number;
+
+    /**
+     * #### 获取最小公倍数
+     * @param a
+     * @param b
+     */
+    lcm(a: number, b: number): number;
+
+    /**
+     * #### 是否是素数
+     * @param n
+     */
+    isPrime(n: number): boolean;
+
+    /**
+     * #### 是否是回文数
+     * @param n
+     */
+    isPalindrome(n: number): boolean;
+
+    /**
+     * #### 是否是阿姆斯特朗数
+     * @param n
+     */
+    isArmstrong(n: number): boolean;
+
+    /**
+     * #### 是否是完美数
+     * @param n
+     */
+    isPerfect(n: number): boolean;
+
+    /**
+     * #### 线性比例缩放取值
+     * @param n
+     * @param original 原范围
+     * @param target 现范围
+     */
+    scale(
+      n: number,
+      original: [number, number],
+      target: [number, number]
+    ): number;
+
+    /**
+     * #### 获取随机整数，包含min和max
+     * @param min 最小数
+     * @param max 最大数
+     */
+    randomInt(min: number, max: number): number;
+
+    /**
+     * #### 大约相等
+     * @param a
+     * @param b
+     * @param epsilon 默认为0.000001
+     */
+    floatEqual(a: number, b: number, epsilon?: number): boolean;
+
+    /**
+     * #### 判断两个数是否同号
+     * @param a
+     * @param b
+     */
+    isSameSign(a: number, b: number): boolean;
+  }
+  declare var Num: NumConstructor;
+
+  /**
+   * 罗马数字类
+   */
+  interface RomanConstructor {
+    /**
+     * #### 转阿拉伯数字
+     * @param str 罗马数字文本
+     */
+    toInteger(str: string): number;
+    /**
+     * #### 转罗马数字
+     * @param num 阿拉伯整数
+     */
+    toRoman(num: number): string;
+  }
+  declare var Roman: RomanConstructor;
+
+  interface BitPerConstructor {
+    readonly READ: number;
+    readonly WRITE: number;
+    readonly SHARE: number;
+    readonly DELETE: number;
+    readonly CREATE: number;
+    /**
+     * #### 判断权限是否包含
+     * @param permission
+     * @param target
+     */
+    include(permission: number, target: number): boolean;
+    /**
+     * #### 添加权限
+     * @param permission
+     * @param target
+     */
+    add(permission: number, target: number): number;
+    /**
+     * #### 移除权限
+     * @param permission
+     * @param target
+     */
+    remove(permission: number, target: number): number;
+    /**
+     * #### 切换权限
+     * @param permission
+     * @param target
+     */
+    toggle(permission: number, target: number): number;
+  }
+  declare var BitPer: BitPerConstructor;
+
+  interface StrConstructor {
+    new (value?: any): String;
+    readonly prototype: String;
+
+    longestCommonPrefix(strs: string[]): string;
+    uuid(a?: number | string): string;
+  }
+  declare var Str: StrConstructor;
 }

package/package.json

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