jc-structure 0.1.17 → 0.1.19

package/dist/jc-structure.js

@@ -1,4 +1,4 @@
-class V {
+class z {
   items = {};
   count = 0;
   lowestCount = 0;
@@ -49,7 +49,7 @@ class V {
     return this.isEmpty() ? "" : `Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`;
   }
 }
-class z {
+class q {
   items = {};
   count = 0;
   constructor() {
@@ -100,7 +100,7 @@ class z {
     return this.isEmpty() ? "" : `Stack(count: ${this.count}):[${this.items[this.count - 1]},...rest]`;
   }
 }
-class D {
+class j {
   stack = [];
   minStack = [];
   push(t) {
@@ -132,7 +132,7 @@ class D {
 function P(r, t) {
   return r === t ? 0 : r < t ? -1 : 1;
 }
-class w {
+class y {
   heap = [];
   compareFn;
   constructor(t = P) {
@@ -166,7 +166,7 @@ class w {
     return this.heap.toString();
   }
 }
-class O extends w {
+class O extends y {
   insert(t) {
     return t ? !1 : (this.heap.push(t), this.siftUp(this.heap.length - 1), !0);
   }
@@ -177,24 +177,24 @@ class O 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 O {
+class D extends O {
   constructor(t = (e, s) => P(s, e)) {
     super(t);
   }
 }
-function L(r) {
+function N(r) {
   return { value: r };
 }
-class j {
+class U {
   capacity;
   length = 0;
   head = null;
@@ -224,14 +224,14 @@ class j {
   }
   update(t, e) {
     let s = this.lookup.get(t);
-    s ? (this.detach(s), this.prepend(s), s.value = e) : (s = L(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 = N(e), this.length++, this.prepend(s), this.trimCache(), this.lookup.set(t, s), this.reverseLookup);
   }
 }
-class v {
+class b {
   value;
   next = void 0;
 }
-class U {
+class $ {
   count = 0;
   head = void 0;
   constructor() {
@@ -264,7 +264,7 @@ class U {
     return this.getElementAt(t)?.value;
   }
   insert(t, e) {
-    let s = new v();
+    let s = new b();
     if (s.value = t, e > this.count || e < 0)
       throw new Error("index error");
     this.count++;
@@ -276,7 +276,7 @@ class U {
     i = this.getElementAt(e - 1), n = i.next, i.next = s, s.next = n;
   }
   push(t) {
-    let e = new v();
+    let e = new b();
     if (e.value = t, this.count++, this.isEmpty()) {
       this.head = e;
       return;
@@ -310,7 +310,7 @@ class U {
     return t = t.slice(0, -1), t;
   }
 }
-class C {
+class R {
   key;
   value;
   constructor(t, e) {
@@ -320,7 +320,7 @@ class C {
 function M(r, t = { emptyString: !1, zeroNumber: !1 }) {
   return r == null ? !(t.emptyString && r === "" || t.zeroNumber && r === 0) : !1;
 }
-class R {
+class C {
   table = [];
   constructor() {
   }
@@ -339,7 +339,7 @@ class R {
       let s = this.getItemIndex(t);
       this.table[s].value = e;
     } else {
-      const s = new C(t, e);
+      const s = new R(t, e);
       this.table.push(s);
     }
   }
@@ -390,12 +390,12 @@ class R {
     return t = t.slice(0, -1), t;
   }
 }
-class $ {
+class _ {
   isDirected;
   vertices;
   adjList;
   constructor(t = !1) {
-    this.isDirected = t, this.vertices = [], this.adjList = new R();
+    this.isDirected = t, this.vertices = [], this.adjList = new C();
   }
   addVertex(t) {
     this.vertices.includes(t) || (this.vertices.push(t), this.adjList.set(t, []));
@@ -417,10 +417,10 @@ class $ {
     return t;
   }
 }
-class y {
+class w {
   _data;
   static zero(t) {
-    return new y(...Array(t).fill(0));
+    return new w(...Array(t).fill(0));
   }
   constructor(...t) {
     this._data = t;
@@ -439,7 +439,7 @@ class y {
     if (t === 0)
       throw new Error("Cannot normalize a zero vector");
     const e = this._data.map((s) => s / t);
-    return new y(...e);
+    return new w(...e);
   }
   add(t) {
     if (this.dimension !== t.dimension)
@@ -447,7 +447,7 @@ class y {
     const e = this._data.map(
       (s, i) => s + t._data[i]
     );
-    return new y(...e);
+    return new w(...e);
   }
   sub(t) {
     if (this.dimension !== t.dimension)
@@ -455,10 +455,10 @@ class y {
     const e = this._data.map(
       (s, i) => s - t._data[i]
     );
-    return new y(...e);
+    return new w(...e);
   }
   mul(t) {
-    return new y(...this._data.map((e) => e * t));
+    return new w(...this._data.map((e) => e * t));
   }
   dot(t) {
     if (this.dimension !== t.dimension)
@@ -482,6 +482,15 @@ class E {
       Array.from({ length: t }, () => Array.from({ length: e }, () => 0))
     );
   }
+  static rotate(t) {
+    const e = t.length;
+    for (let s = 0; s < (e + 1) / 2; s++)
+      for (let i = s; i < e / 2; i++) {
+        const n = t[e - 1 - i][s];
+        t[e - 1 - i][s] = t[e - 1 - s][e - 1 - i], t[e - 1 - s][e - 1 - i] = t[i][e - 1 - s], t[i][e - 1 - s] = t[s][i], t[s][i] = n;
+      }
+    return t;
+  }
   constructor(t) {
     this._matrix = t;
   }
@@ -498,10 +507,10 @@ class E {
     return this.row * this.col;
   }
   rowVector(t) {
-    return new y(...this._matrix[t]);
+    return new w(...this._matrix[t]);
   }
   colVector(t) {
-    return new y(...this._matrix.map((e) => e[t]));
+    return new w(...this._matrix.map((e) => e[t]));
   }
   getItem(t) {
     return this._matrix[t[0]][t[1]];
@@ -552,7 +561,7 @@ class E {
     return e;
   }
 }
-class u {
+class o {
   static distance(t, e) {
     return Math.hypot(e.x - t.x, e.y - t.y);
   }
@@ -562,7 +571,7 @@ class u {
     this.x = t, this.y = e;
   }
   distanceTo(t) {
-    return u.distance(this, t);
+    return o.distance(this, t);
   }
 }
 class g {
@@ -578,12 +587,12 @@ class g {
   }
   static getIntersection(t, e, s = g.EPSILON) {
     if (g.isParallel(t, e)) return null;
-    const i = t.p1.x, n = t.p1.y, h = t.p2.x, o = t.p2.y, c = e.p1.x, f = e.p1.y, m = e.p2.x, a = e.p2.y, l = (i - h) * (f - a) - (n - o) * (c - m);
-    if (Math.abs(l) < s) return null;
-    const d = ((i - c) * (f - a) - (n - f) * (c - m)) / l, S = -((i - h) * (n - f) - (n - o) * (i - c)) / l;
-    if (d >= 0 && d <= 1 && S >= 0 && S <= 1) {
-      const k = i + d * (h - i), N = n + d * (o - n);
-      return new u(k, N);
+    const i = t.p1.x, n = t.p1.y, h = t.p2.x, u = t.p2.y, p = e.p1.x, f = e.p1.y, m = e.p2.x, a = e.p2.y, c = (i - h) * (f - a) - (n - u) * (p - m);
+    if (Math.abs(c) < s) return null;
+    const d = ((i - p) * (f - a) - (n - f) * (p - m)) / c, v = -((i - h) * (n - f) - (n - u) * (i - p)) / c;
+    if (d >= 0 && d <= 1 && v >= 0 && v <= 1) {
+      const k = i + d * (h - i), L = n + d * (u - n);
+      return new o(k, L);
     }
     return null;
   }
@@ -591,13 +600,13 @@ class g {
     return g.getIntersection(t, e) !== null;
   }
   static distanceToPoint(t, e, s = g.EPSILON) {
-    const i = e.x - t.p1.x, n = e.y - t.p1.y, h = t.p2.x - t.p1.x, o = t.p2.y - t.p1.y, c = i * h + n * o, f = h * h + o * o;
+    const i = e.x - t.p1.x, n = e.y - t.p1.y, h = t.p2.x - t.p1.x, u = t.p2.y - t.p1.y, p = i * h + n * u, f = h * h + u * u;
     let m = -1;
-    f > s && (m = c / f);
-    let a, l;
-    m < 0 ? (a = t.p1.x, l = t.p1.y) : m > 1 ? (a = t.p2.x, l = t.p2.y) : (a = t.p1.x + m * h, l = t.p1.y + m * o);
-    const d = e.x - a, S = e.y - l;
-    return Math.hypot(d + S);
+    f > s && (m = p / f);
+    let a, c;
+    m < 0 ? (a = t.p1.x, c = t.p1.y) : m > 1 ? (a = t.p2.x, c = t.p2.y) : (a = t.p1.x + m * h, c = t.p1.y + m * u);
+    const d = e.x - a, v = e.y - c;
+    return Math.hypot(d + v);
   }
   p1;
   p2;
@@ -610,7 +619,7 @@ class g {
   }
   get midpoint() {
     const t = (this.p1.x + this.p2.x) / 2, e = (this.p1.y + this.p2.y) / 2;
-    return new u(t, e);
+    return new o(t, e);
   }
   get angle() {
     return Math.atan2(this.p2.y - this.p1.y, this.p2.x - this.p1.x);
@@ -622,9 +631,9 @@ class g {
   // 获取线段的方向向量
   get direction() {
     const t = this.length;
-    if (t < g.EPSILON) return new u(0, 0);
+    if (t < g.EPSILON) return new o(0, 0);
     const e = (this.p2.x - this.p1.x) / t, s = (this.p2.y - this.p1.y) / t;
-    return new u(e, s);
+    return new o(e, s);
   }
   get start() {
     return this.p1;
@@ -640,24 +649,24 @@ class A {
     this.name = t;
   }
 }
-class p extends A {
+class l extends A {
   static isValid(t, e, s) {
     return t <= 0 || e <= 0 || s <= 0 ? !1 : t + e > s && t + s > e && e + s > t;
   }
   static area(t, e, s) {
-    if (!p.isValid(t, e, s))
+    if (!l.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 (!p.isValid(t, e, s))
+    if (!l.isValid(t, e, s))
       throw new Error("Invalid triangle sides");
-    const i = [t, e, s].sort((c, f) => c - f), [n, h, o] = i;
-    return Math.abs(n - h) < p.EPSILON && Math.abs(h - o) < p.EPSILON ? "equilateral" : Math.abs(n - h) < p.EPSILON || Math.abs(h - o) < p.EPSILON ? "isosceles" : "scalene";
+    const i = [t, e, s].sort((p, f) => p - f), [n, h, u] = i;
+    return Math.abs(n - h) < l.EPSILON && Math.abs(h - u) < l.EPSILON ? "equilateral" : Math.abs(n - h) < l.EPSILON || Math.abs(h - u) < l.EPSILON ? "isosceles" : "scalene";
   }
   static getAngles(t, e, s) {
-    if (!p.isValid(t, e, s))
+    if (!l.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)), h = Math.PI - i - n;
     return [i, n, h];
@@ -677,64 +686,64 @@ class p extends A {
   }
   get side() {
     return [
-      u.distance(this.p1, this.p2),
-      u.distance(this.p2, this.p3),
-      u.distance(this.p3, this.p1)
+      o.distance(this.p1, this.p2),
+      o.distance(this.p2, this.p3),
+      o.distance(this.p3, this.p1)
     ];
   }
   perimeter() {
-    return p.isValid(this.side[0], this.side[1], this.side[2]), this.side.reduce((t, e) => t + e, 0);
+    return l.isValid(this.side[0], this.side[1], this.side[2]), this.side.reduce((t, e) => t + e, 0);
   }
   area() {
     const [t, e, s] = this.side;
-    return p.area(t, e, s);
+    return l.area(t, e, s);
   }
   get type() {
     const [t, e, s] = this.side;
-    return p.getType(t, e, s);
+    return l.getType(t, e, s);
   }
   get angles() {
     const [t, e, s] = this.side;
-    return p.getAngles(t, e, s);
+    return l.getAngles(t, e, s);
   }
   get centroid() {
-    return new u(
+    return new o(
       (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, h = (t * this.p1.y + e * this.p2.y + s * this.p3.y) / i;
-    return new u(n, h);
+    return new o(n, h);
   }
   get circumcenter() {
     const t = 2 * (this.p1.x * (this.p2.y - this.p3.y) + this.p2.x * (this.p3.y - this.p1.y) + this.p3.x * (this.p1.y - this.p2.y));
-    if (Math.abs(t) < p.EPSILON)
+    if (Math.abs(t) < l.EPSILON)
       throw new Error("Cannot calculate circumcenter for collinear points");
     const e = ((this.p1.x * this.p1.x + this.p1.y * this.p1.y) * (this.p2.y - this.p3.y) + (this.p2.x * this.p2.x + this.p2.y * this.p2.y) * (this.p3.y - this.p1.y) + (this.p3.x * this.p3.x + this.p3.y * this.p3.y) * (this.p1.y - this.p2.y)) / t, s = ((this.p1.x * this.p1.x + this.p1.y * this.p1.y) * (this.p3.x - this.p2.x) + (this.p2.x * this.p2.x + this.p2.y * this.p2.y) * (this.p1.x - this.p3.x) + (this.p3.x * this.p3.x + this.p3.y * this.p3.y) * (this.p2.x - this.p1.x)) / t;
-    return new u(e, s);
+    return new o(e, s);
   }
   containsPoint(t) {
-    const e = p.area(
-      u.distance(t, this.p1),
-      u.distance(t, this.p2),
-      u.distance(this.p1, this.p2)
-    ), s = p.area(
-      u.distance(t, this.p2),
-      u.distance(t, this.p3),
-      u.distance(this.p2, this.p3)
-    ), i = p.area(
-      u.distance(t, this.p3),
-      u.distance(t, this.p1),
-      u.distance(this.p3, this.p1)
+    const e = l.area(
+      o.distance(t, this.p1),
+      o.distance(t, this.p2),
+      o.distance(this.p1, this.p2)
+    ), s = l.area(
+      o.distance(t, this.p2),
+      o.distance(t, this.p3),
+      o.distance(this.p2, this.p3)
+    ), i = l.area(
+      o.distance(t, this.p3),
+      o.distance(t, this.p1),
+      o.distance(this.p3, this.p1)
     );
-    return Math.abs(e + s + i - this.area()) < p.EPSILON;
+    return Math.abs(e + s + i - this.area()) < l.EPSILON;
   }
 }
-function _(r) {
+function H(r) {
   return new Promise((t) => setTimeout(t, r));
 }
-function H(r) {
+function F(r) {
   const t = [], e = {
     "(": ")",
     "[": "]",
@@ -747,40 +756,22 @@ function H(r) {
       return !1;
   return t.length === 0;
 }
-function b(r) {
+function S(r) {
   return r !== null && (typeof r == "object" || typeof r == "function");
 }
-class F {
+class T {
   map = /* @__PURE__ */ new Map();
   weakMap = /* @__PURE__ */ new WeakMap();
   set(t, e) {
-    b(t) ? this.weakMap.set(t, e) : this.map.set(t, e);
+    S(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 S(t) ? this.weakMap.get(t) : this.map.get(t);
   }
   has(t) {
-    return b(t) ? this.weakMap.has(t) : this.map.has(t);
+    return S(t) ? this.weakMap.has(t) : this.map.has(t);
   }
 }
-function T(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], h = n[t[i].length - 1];
-      if (h < s) {
-        t[i + 1] = [...n, s];
-        break;
-      } else h > s && i === 0 && (t[i] = [s]);
-    }
-  }
-  return t[t.length - 1];
-}
 class B {
   static ROMAN_MAP = /* @__PURE__ */ new Map([
     ["M", 1e3],
@@ -810,10 +801,10 @@ class B {
       if (this.ROMAN_MAP.has(h))
         s += this.ROMAN_MAP.get(h), i += 2;
       else {
-        const o = t[i], c = this.ROMAN_MAP.get(o);
-        if (!c)
+        const u = t[i], p = this.ROMAN_MAP.get(u);
+        if (!p)
           throw new Error(`Invalid Roman numeral sequence at position ${i}`);
-        s += c, i += 1;
+        s += p, i += 1;
       }
     }
     if (this.toRoman(s) !== t)
@@ -869,19 +860,19 @@ class G {
       return [];
     if (e < 0 || !Number.isInteger(e))
       throw new Error("Precision must be a non-negative integer");
-    const s = t.reduce((a, l) => a + l, 0);
+    const s = t.reduce((a, c) => a + c, 0);
     if (s === 0)
       return t.map(() => "0%");
-    const n = 100 * Math.pow(10, e), h = t.map((a) => a / s * n), o = h.map((a) => Math.floor(a)), c = h.map((a, l) => a - o[l]);
-    let f = o.reduce((a, l) => a + l, 0), m = n - f;
+    const n = 100 * Math.pow(10, e), h = t.map((a) => a / s * n), u = h.map((a) => Math.floor(a)), p = h.map((a, c) => a - u[c]);
+    let f = u.reduce((a, c) => a + c, 0), m = n - f;
     for (; m > 0; ) {
-      let a = -1, l = -1;
-      for (let d = 0; d < c.length; d++)
-        c[d] > l && (l = c[d], a = d);
+      let a = -1, c = -1;
+      for (let d = 0; d < p.length; d++)
+        p[d] > c && (c = p[d], a = d);
       if (a === -1) break;
-      o[a]++, c[a] = 0, m--;
+      u[a]++, p[a] = 0, m--;
     }
-    return o.map((a) => `${(a / n * 100).toFixed(e)}%`);
+    return u.map((a) => `${(a / n * 100).toFixed(e)}%`);
   }
   static fastSqrt(t) {
     if (t < 0)
@@ -947,11 +938,31 @@ class G {
     const i = e[1] - e[0];
     return (t - e[0]) * ((s[1] - s[0]) / i) + s[0];
   }
+  static isRange(t, e, s) {
+    if (s == null && (s = e, e = 0), e >= s)
+      throw new Error(
+        "The maximum value must be greater than the minimum value"
+      );
+    return e <= t && t < s;
+  }
   static clamp(t, e, s) {
-    return Math.min(Math.max(t, e), s);
+    return s == null ? Math.min(t, e) : Math.min(Math.max(t, e), s);
+  }
+  static random(t, e) {
+    if (e == null && (e = t, t = 0), t >= e)
+      throw new Error(
+        "The maximum value must be greater than the minimum value"
+      );
+    return Math.random() * (e - t) + t;
   }
   static randomInt(t, e) {
-    return Math.floor(Math.random() * (e - t + 1)) + t;
+    return Math.floor(this.random(t, e));
+  }
+  static round(t, e = 0) {
+    if (!Number.isInteger(e))
+      throw new Error("precision must be an integer");
+    const s = Math.pow(10, e);
+    return Math.round(t * s) / s;
   }
   static floatEqual(t, e, s = 1e-6) {
     return Math.abs(t - e) < s;
@@ -959,8 +970,33 @@ class G {
   static isSameSign(t, e) {
     return t >= 0 && e >= 0 || t <= 0 && e <= 0;
   }
+  static fastPower(t, e) {
+    if (t < 0)
+      throw new Error("a must be greater than 0");
+    if (e < 0 || !Number.isInteger(e))
+      throw new Error("n must be a non-negative integer");
+    if (t === 0) return 0;
+    if (e === 0) return 1;
+    const s = this.fastPower(t, e >> 1);
+    return e % 2 === 0 ? s * s : s * s * t;
+  }
+  static consecutiveSum(t) {
+    if (!this.isValidPositiveInteger)
+      throw new Error("n must be a positive integer");
+    return t * (t + 1) / 2;
+  }
+  static consecutiveSquaresSum(t) {
+    if (!this.isValidPositiveInteger)
+      throw new Error("n must be a positive integer");
+    return t * (t + 1) * (2 * t + 1) / 6;
+  }
+  static consecutivecubesSum(t) {
+    if (!this.isValidPositiveInteger)
+      throw new Error("n must be a positive integer");
+    return t * (t + 1) * (2 * t + 1) * (3 * t * t + 3 * t - 1) / 30;
+  }
 }
-class W {
+class X {
   static READ = 1;
   static WRITE = 2;
   static SHARE = 4;
@@ -979,23 +1015,34 @@ class W {
     return t ^ e;
   }
 }
-class X {
-  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 Q extends String {
+  // static longestCommonPrefix(strs: string[]): string {
+  //   if (!strs.length) return "";
+  //   let prefix = strs[0];
+  //   for (let i = 1; i < strs.length; i++) {
+  //     while (!strs[i].startsWith(prefix)) {
+  //       prefix = prefix.slice(0, -1);
+  //       if (prefix === "") return "";
+  //     }
+  //   }
+  //   return prefix;
+  // }
+  // static uuid(a?: number | string): string {
+  //   return typeof a === "number"
+  //     ? (a ^ ((Math.random() * 16) >> (a / 4))).toString(16)
+  //     : (1e7 + -1e3 + -4e3 + -8e3 + -1e11).toString().replace(/[018]/g, (c) => {
+  //         const num = parseInt(c, 10);
+  //         return this.uuid(num);
+  //       });
+  // }
+  static frequencyStatistics(t) {
+    return [...t].reduce(
+      (e, s) => (e[s] = (e[s] || 0) + 1, e),
+      {}
+    );
   }
 }
-class Q {
+class W {
   static isValidHex(t) {
     return /^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/.test(t);
   }
@@ -1132,74 +1179,100 @@ String.prototype.sliceByPoint = function(r, t = this.pointLength()) {
     e += this.pointAt(s);
   return e;
 };
-RegExp.escape = function(r) {
-  return r.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+String.prototype.capitalize = function() {
+  return this ? this.charAt(0).toUpperCase() + this.slice(1).toLowerCase() : this;
 };
-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;
+String.prototype.reverse = function() {
+  return this.split("").reverse().join("");
 };
-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;
+String.prototype.truncate = function(r, t = "...") {
+  return this.length <= r ? this : this.slice(0, r - t.length) + t;
+};
+String.prototype.isPalindrome = function() {
+  const r = this.toLowerCase().replace(/[^a-z0-9]/g, "");
+  return r === r.reverse();
+};
+String.prototype.count = function(r) {
+  const t = r.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+  return (this.match(new RegExp(t, "g")) || []).length;
+};
+String.prototype.toCamelCase = function() {
+  return this.replace(/_([a-z])/g, (r, t) => t.toUpperCase());
+};
+String.prototype.toSnakeCase = function() {
+  return this.replace(/[A-Z]/g, (r) => `_${r.toLowerCase()}`);
+};
+String.prototype.format = function(...r) {
+  return this.replace(/{(\d+)}/g, (t, e) => r[e] || "");
+};
+class V {
+  static random(t = 8) {
+    const e = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
+    let s = "";
+    for (let i = 0; i < t; i++)
+      s += e.charAt(Math.floor(Math.random() * e.length));
+    return s;
+  }
+  static template(t, e) {
+    return t.replace(/\${(\w+)}/g, (s, i) => e[i] || "");
+  }
+  static escapeHtml(t) {
+    const e = {
+      "&": "&amp;",
+      "<": "&lt;",
+      ">": "&gt;",
+      '"': "&quot;",
+      "'": "&apos;",
+      " ": "&nbsp;",
+      "±": "&plusmn;",
+      "×": "&times;",
+      "÷": "&divide;",
+      "≠": "&ne;",
+      "≤": "&le;",
+      "≥": "&ge;"
+    }, s = new RegExp(
+      `[${Object.keys(e).join("")}]`,
+      "g"
+    );
+    return t.replace(s, (i) => e[i]);
+  }
+  static isEmail(t) {
+    return /^[^\s@]+@[^\s@]+\.[^\s@]+$/.test(t);
+  }
+  static isUrl(t) {
+    try {
+      return new URL(t), !0;
+    } catch {
+      return !1;
     }
   }
-});
-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(" "), h = this.textContent.indexOf(t);
-  if (h < 0) return null;
-  const o = document.createRange();
-  o.setStart(this, h), o.setEnd(this, h + t.length);
-  const c = document.createElement(i);
-  return n && (c.className = n), o.surroundContents(c), c;
-};
+}
+Object.assign(String, V);
 export {
-  W as BitPerm,
-  Q as Color,
-  R as Dictionary,
+  X as BitPerm,
+  W as Color,
+  C as Dictionary,
   I as Emitter,
-  $ as Graph,
-  T as LIS,
-  j as LRU,
+  _ as Graph,
+  U as LRU,
   g as Line,
-  U as LinkedList,
+  $ as LinkedList,
   E as Matrix,
-  q as MaxHeap,
-  F as MemoizeMap,
+  D as MaxHeap,
+  T as MemoizeMap,
   O as MinHeap,
-  D as MinStack,
+  j as MinStack,
   G as Num,
-  u as Point,
-  V as Queue,
+  o as Point,
+  z as Queue,
   B as Roman,
-  z as Stack,
-  X as Str,
-  p as Triangle,
-  y as Vector,
+  q as Stack,
+  Q as Str,
+  V as StringExtensions,
+  l as Triangle,
+  w as Vector,
   Z as binarySearchTemplate,
-  H as isValidBracket,
+  F as isValidBracket,
   K as singleton,
-  _ as sleep
+  H as sleep
 };

package/dist/jc-structure.umd.cjs

@@ -1,2 +1,2 @@
-(function(a,b){typeof exports=="object"&&typeof module<"u"?b(exports):typeof define=="function"&&define.amd?define(["exports"],b):(a=typeof globalThis<"u"?globalThis:a||self,b(a["jc-structure"]={}))})(this,(function(a){"use strict";class b{items={};count=0;lowestCount=0;constructor(){}dequeue(){if(this.isEmpty())return;const t=this.items[this.lowestCount];return delete this.items[this.lowestCount],this.lowestCount++,t}enqueue(...t){if(t.length===0)return this;if(t.length===1){const e=t[0];return Array.isArray(e)?this.batchEnqueue(e):this.enqueueItem(e)}for(const e of t)Array.isArray(e)?this.batchEnqueue(e):this.enqueueItem(e);return this}batchEnqueue(t){return t.filter(s=>this.isValidItem(s)).forEach(s=>{this.isValidItem(s)&&(this.items[this.count]=s,this.count++)}),this}enqueueItem(t){if(!this.isValidItem(t))throw new Error("Invalid item");return this.items[this.count]=t,this.count++,this}isValidItem(t){return t!=null}front(){return this.isEmpty()?void 0:this.items[this.lowestCount]}isEmpty(){return this.size()===0}size(){return this.count-this.lowestCount}clear(){this.items={},this.count=0,this.lowestCount=0}toString(){return this.isEmpty()?"":`Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`}}class C{items={};count=0;constructor(){}pop(){if(this.isEmpty())return;this.count--;const t=this.items[this.count];return delete this.items[this.count],t}push(...t){if(t.length===0)return this;if(t.length===1){const e=t[0];return Array.isArray(e)?this.addItems(e):this.addItem(e)}for(const e of t)Array.isArray(e)?this.addItems(e):this.addItem(e);return this}addItem(t){if(!this.isValidItem(t))throw new Error("Invalid item: item cannot be null or undefined");return this.items[this.count]=t,this.count++,this}addItems(t){return t.filter(s=>this.isValidItem(s)).forEach(s=>{this.items[this.count]=s,this.count++}),this}isValidItem(t){return t!=null}peek(){return this.isEmpty()?void 0:this.items[this.count-1]}isEmpty(){return this.count===0}size(){return this.count}clear(){this.items={},this.count=0}toString(){return this.isEmpty()?"":`Stack(count: ${this.count}):[${this.items[this.count-1]},...rest]`}}class R{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 E{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 P 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,s=E.getLeftIndex(e),i=E.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&&(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 V extends P{constructor(t=(e,s)=>A(s,e)){super(t)}}function z(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=z(e),this.length++,this.prepend(s),this.trimCache(),this.lookup.set(t,s),this.reverseLookup)}}class k{value;next=void 0}class j{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 k;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 k;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 L(r,t={emptyString:!1,zeroNumber:!1}){return r==null?!(t.emptyString&&r===""||t.zeroNumber&&r===0):!1}class N{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(L(t))throw new Error("key is required");if(L(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 U{isDirected;vertices;adjList;constructor(t=!1){this.isDirected=t,this.vertices=[],this.adjList=new N}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 w{_data;static zero(t){return new w(...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 w(...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 w(...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 w(...e)}mul(t){return new w(...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 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 w(...this._matrix[t])}colVector(t){return new w(...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(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 x(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 x(this._matrix.map(e=>e.map((s,i)=>s*t.getItem(i))))}mulMatrix(t){if(this.col!==t.row)throw new Error("Matrix dimensions do not match");const e=x.zero(this.row,t.col);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 u{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 u.distance(this,t)}}class f{static EPSILON=1e-10;static sloped(t,e=f.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=f.EPSILON){const i=f.sloped(t),n=f.sloped(e);return i===null&&n===null?!0:i===null||n===null?!1:Math.abs(i-n)<s}static getIntersection(t,e,s=f.EPSILON){if(f.isParallel(t,e))return null;const i=t.p1.x,n=t.p1.y,h=t.p2.x,c=t.p2.y,l=e.p1.x,g=e.p1.y,y=e.p2.x,o=e.p2.y,d=(i-h)*(g-o)-(n-c)*(l-y);if(Math.abs(d)<s)return null;const m=((i-l)*(g-o)-(n-g)*(l-y))/d,M=-((i-h)*(n-g)-(n-c)*(i-l))/d;if(m>=0&&m<=1&&M>=0&&M<=1){const Z=i+m*(h-i),J=n+m*(c-n);return new u(Z,J)}return null}static isIntersecting(t,e){return f.getIntersection(t,e)!==null}static distanceToPoint(t,e,s=f.EPSILON){const i=e.x-t.p1.x,n=e.y-t.p1.y,h=t.p2.x-t.p1.x,c=t.p2.y-t.p1.y,l=i*h+n*c,g=h*h+c*c;let y=-1;g>s&&(y=l/g);let o,d;y<0?(o=t.p1.x,d=t.p1.y):y>1?(o=t.p2.x,d=t.p2.y):(o=t.p1.x+y*h,d=t.p1.y+y*c);const m=e.x-o,M=e.y-d;return Math.hypot(m+M)}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 u(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 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<f.EPSILON)return new u(0,0);const e=(this.p2.x-this.p1.x)/t,s=(this.p2.y-this.p1.y)/t;return new u(e,s)}get start(){return this.p1}get end(){return this.p2}}class O{static EPSILON=1e-10;name;constructor(t){this.name=t}}class p extends O{static isValid(t,e,s){return t<=0||e<=0||s<=0?!1:t+e>s&&t+s>e&&e+s>t}static area(t,e,s){if(!p.isValid(t,e,s))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(!p.isValid(t,e,s))throw new Error("Invalid triangle sides");const i=[t,e,s].sort((l,g)=>l-g),[n,h,c]=i;return Math.abs(n-h)<p.EPSILON&&Math.abs(h-c)<p.EPSILON?"equilateral":Math.abs(n-h)<p.EPSILON||Math.abs(h-c)<p.EPSILON?"isosceles":"scalene"}static getAngles(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)),h=Math.PI-i-n;return[i,n,h]}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))<O.EPSILON}get side(){return[u.distance(this.p1,this.p2),u.distance(this.p2,this.p3),u.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,s]=this.side;return p.area(t,e,s)}get type(){const[t,e,s]=this.side;return p.getType(t,e,s)}get angles(){const[t,e,s]=this.side;return p.getAngles(t,e,s)}get centroid(){return new u((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,h=(t*this.p1.y+e*this.p2.y+s*this.p3.y)/i;return new u(n,h)}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,s=((this.p1.x*this.p1.x+this.p1.y*this.p1.y)*(this.p3.x-this.p2.x)+(this.p2.x*this.p2.x+this.p2.y*this.p2.y)*(this.p1.x-this.p3.x)+(this.p3.x*this.p3.x+this.p3.y*this.p3.y)*(this.p2.x-this.p1.x))/t;return new u(e,s)}containsPoint(t){const e=p.area(u.distance(t,this.p1),u.distance(t,this.p2),u.distance(this.p1,this.p2)),s=p.area(u.distance(t,this.p2),u.distance(t,this.p3),u.distance(this.p2,this.p3)),i=p.area(u.distance(t,this.p3),u.distance(t,this.p1),u.distance(this.p3,this.p1));return Math.abs(e+s+i-this.area())<p.EPSILON}}function $(r){return new Promise(t=>setTimeout(t,r))}function H(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 v(r){return r!==null&&(typeof r=="object"||typeof r=="function")}class _{map=new Map;weakMap=new WeakMap;set(t,e){v(t)?this.weakMap.set(t,e):this.map.set(t,e)}get(t){return v(t)?this.weakMap.get(t):this.map.get(t)}has(t){return v(t)?this.weakMap.has(t):this.map.has(t)}}function T(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],h=n[t[i].length-1];if(h<s){t[i+1]=[...n,s];break}else h>s&&i===0&&(t[i]=[s])}}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 h of t)if(!e.has(h))throw new Error(`Invalid Roman numeral character: ${h}`);let s=0,i=0;for(;i<t.length;){const h=t.slice(i,i+2);if(this.ROMAN_MAP.has(h))s+=this.ROMAN_MAP.get(h),i+=2;else{const c=t[i],l=this.ROMAN_MAP.get(c);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}}class F{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(t<2)return t;let e=0,s=1;for(let i=2;i<t;i++)[e,s]=[s,(e+s)%1000000007];return 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,d)=>o+d,0);if(s===0)return t.map(()=>"0%");const n=100*Math.pow(10,e),h=t.map(o=>o/s*n),c=h.map(o=>Math.floor(o)),l=h.map((o,d)=>o-c[d]);let g=c.reduce((o,d)=>o+d,0),y=n-g;for(;y>0;){let o=-1,d=-1;for(let m=0;m<l.length;m++)l[m]>d&&(d=l[m],o=m);if(o===-1)break;c[o]++,l[o]=0,y--}return c.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=.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*.5+e/i,i=i*.5+e/i,i=i*.5+e/i,i}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 isHappy(t){const e=new Set;for(;t!==1;){if(e.has(t))return!1;e.add(t),t=(t+"").split("").reduce((s,i)=>s+Number(i)*Number(i),0)}return!0}static isPerfect(t){let e=0;for(let s=1;s<t;s++)t%s===0&&(e+=s);return e===t}static middle(t,e){return e-(e-t>>1)}static scale(t,e,s){if(e[0]>=e[1]||s[0]>=s[1])throw new Error("Invalid range");t=this.clamp(t,e[0],e[1]);const i=e[1]-e[0];return(t-e[0])*((s[1]-s[0])/i)+s[0]}static clamp(t,e,s){return Math.min(Math.max(t,e),s)}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 G{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 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 W{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 X(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 I={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 S{static instance=null;listeners={};debugMode;constructor(t=!1){this.debugMode=t,Object.keys(I).forEach(e=>{this.listeners[e]=new Set})}static getInstance(t){return S.instance||(S.instance=new S(t)),S.instance}on(t,e){this.debugLog(`添加事件监听: ${I[t]}`),this.listeners[t].add(e)}emit(t,e){this.debugLog(`触发事件: ${I[t]}`,e),this.listeners[t].forEach(s=>{try{s(e)}catch(i){console.error(`事件 ${I[t]} 处理出错:`,i)}})}off(t,e){this.debugLog(`移除事件监听: ${I[t]}`),this.listeners[t].delete(e)}once(t,e){this.debugLog(`添加一次性事件监听: ${I[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||"")}}function K(r,t,e){let s=-1,i=r.length,n;for(;i-s>1;)n=i-(i-s)>>1,e(r[n],t)?i=n:s=n;return i}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(" "),h=this.textContent.indexOf(t);if(h<0)return null;const c=document.createRange();c.setStart(this,h),c.setEnd(this,h+t.length);const l=document.createElement(i);return n&&(l.className=n),c.surroundContents(l),l},a.BitPerm=G,a.Color=W,a.Dictionary=N,a.Emitter=S,a.Graph=U,a.LIS=T,a.LRU=D,a.Line=f,a.LinkedList=j,a.Matrix=x,a.MaxHeap=V,a.MemoizeMap=_,a.MinHeap=P,a.MinStack=R,a.Num=F,a.Point=u,a.Queue=b,a.Roman=B,a.Stack=C,a.Str=Q,a.Triangle=p,a.Vector=w,a.binarySearchTemplate=K,a.isValidBracket=H,a.singleton=X,a.sleep=$,Object.defineProperty(a,Symbol.toStringTag,{value:"Module"})}));
+(function(h,S){typeof exports=="object"&&typeof module<"u"?S(exports):typeof define=="function"&&define.amd?define(["exports"],S):(h=typeof globalThis<"u"?globalThis:h||self,S(h["jc-structure"]={}))})(this,(function(h){"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;if(t.length===1){const e=t[0];return Array.isArray(e)?this.batchEnqueue(e):this.enqueueItem(e)}for(const e of t)Array.isArray(e)?this.batchEnqueue(e):this.enqueueItem(e);return this}batchEnqueue(t){return t.filter(s=>this.isValidItem(s)).forEach(s=>{this.isValidItem(s)&&(this.items[this.count]=s,this.count++)}),this}enqueueItem(t){if(!this.isValidItem(t))throw new Error("Invalid item");return this.items[this.count]=t,this.count++,this}isValidItem(t){return t!=null}front(){return this.isEmpty()?void 0:this.items[this.lowestCount]}isEmpty(){return this.size()===0}size(){return this.count-this.lowestCount}clear(){this.items={},this.count=0,this.lowestCount=0}toString(){return this.isEmpty()?"":`Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`}}class C{items={};count=0;constructor(){}pop(){if(this.isEmpty())return;this.count--;const t=this.items[this.count];return delete this.items[this.count],t}push(...t){if(t.length===0)return this;if(t.length===1){const e=t[0];return Array.isArray(e)?this.addItems(e):this.addItem(e)}for(const e of t)Array.isArray(e)?this.addItems(e):this.addItem(e);return this}addItem(t){if(!this.isValidItem(t))throw new Error("Invalid item: item cannot be null or undefined");return this.items[this.count]=t,this.count++,this}addItems(t){return t.filter(s=>this.isValidItem(s)).forEach(s=>{this.items[this.count]=s,this.count++}),this}isValidItem(t){return t!=null}peek(){return this.isEmpty()?void 0:this.items[this.count-1]}isEmpty(){return this.count===0}size(){return this.count}clear(){this.items={},this.count=0}toString(){return this.isEmpty()?"":`Stack(count: ${this.count}):[${this.items[this.count-1]},...rest]`}}class V{stack=[];minStack=[];push(t){this.stack.push(t),(this.minStack.length===0||t<=this.minStack[this.minStack.length-1])&&this.minStack.push(t)}pop(){const t=this.stack.pop();return t===this.minStack[this.minStack.length-1]&&this.minStack.pop(),t}peek(){return this.stack[this.stack.length-1]}getMin(){return this.minStack[this.minStack.length-1]}isEmpty(){return this.size()===0}size(){return this.stack.length}clear(){this.stack=[],this.minStack=[]}toString(){return this.isEmpty()?"":`MinStack(count: ${this.size()}):[${this.getMin()},...rest]`}}function A(r,t){return r===t?0:r<t?-1:1}class E{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 P 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,s=E.getLeftIndex(e),i=E.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&&(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 z extends P{constructor(t=(e,s)=>A(s,e)){super(t)}}function j(r){return{value:r}}class q{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=j(e),this.length++,this.prepend(s),this.trimCache(),this.lookup.set(t,s),this.reverseLookup)}}class k{value;next=void 0}class D{count=0;head=void 0;constructor(){}indexOf(t){let e=this.head,s=0,i=!1;for(;e;){if(this.equals(e.value,t)){i=!0;break}s++,e=e.next}return i?s:-1}equals(t,e){return!1}getElementAt(t){if(t<0||t>=this.count)return;if(t===0)return this.head;let e=this.head;for(let s=0;s<t;s++)e=e?.next;return e}getValueAt(t){return this.getElementAt(t)?.value}insert(t,e){let s=new k;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 k;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 U{key;value;constructor(t,e){this.key=t,this.value=e}}function L(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(L(t))throw new Error("key is required");if(L(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 U(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 ${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(s=>s/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((s,i)=>s+t._data[i]);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((s,i)=>s-t._data[i]);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,s,i)=>e+s*t._data[i],0)}pos(){return this.mul(1)}neg(){return this.mul(-1)}}class I{_matrix;static zero(t,e){return new I(Array.from({length:t},()=>Array.from({length:e},()=>0)))}static rotate(t){const e=t.length;for(let s=0;s<(e+1)/2;s++)for(let i=s;i<e/2;i++){const n=t[e-1-i][s];t[e-1-i][s]=t[e-1-s][e-1-i],t[e-1-s][e-1-i]=t[i][e-1-s],t[i][e-1-s]=t[s][i],t[s][i]=n}return t}constructor(t){this._matrix=t}get shape(){return[this._matrix.length,this._matrix[0].length]}get row(){return this.shape[0]}get col(){return this.shape[1]}get size(){return this.row*this.col}rowVector(t){return new 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 I(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 I(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 I(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=I.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 u{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 u.distance(this,t)}}class f{static EPSILON=1e-10;static sloped(t,e=f.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=f.EPSILON){const i=f.sloped(t),n=f.sloped(e);return i===null&&n===null?!0:i===null||n===null?!1:Math.abs(i-n)<s}static getIntersection(t,e,s=f.EPSILON){if(f.isParallel(t,e))return null;const i=t.p1.x,n=t.p1.y,a=t.p2.x,l=t.p2.y,d=e.p1.x,g=e.p1.y,w=e.p2.x,o=e.p2.y,p=(i-a)*(g-o)-(n-l)*(d-w);if(Math.abs(p)<s)return null;const m=((i-d)*(g-o)-(n-g)*(d-w))/p,b=-((i-a)*(n-g)-(n-l)*(i-d))/p;if(m>=0&&m<=1&&b>=0&&b<=1){const Z=i+m*(a-i),J=n+m*(l-n);return new u(Z,J)}return null}static isIntersecting(t,e){return f.getIntersection(t,e)!==null}static distanceToPoint(t,e,s=f.EPSILON){const i=e.x-t.p1.x,n=e.y-t.p1.y,a=t.p2.x-t.p1.x,l=t.p2.y-t.p1.y,d=i*a+n*l,g=a*a+l*l;let w=-1;g>s&&(w=d/g);let o,p;w<0?(o=t.p1.x,p=t.p1.y):w>1?(o=t.p2.x,p=t.p2.y):(o=t.p1.x+w*a,p=t.p1.y+w*l);const m=e.x-o,b=e.y-p;return Math.hypot(m+b)}p1;p2;constructor(t,e){this.p1=t,this.p2=e}get length(){const t=this.p2.x-this.p1.x,e=this.p2.y-this.p1.y;return Math.sqrt(t*t+e*e)}get midpoint(){const t=(this.p1.x+this.p2.x)/2,e=(this.p1.y+this.p2.y)/2;return new u(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 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<f.EPSILON)return new u(0,0);const e=(this.p2.x-this.p1.x)/t,s=(this.p2.y-this.p1.y)/t;return new u(e,s)}get start(){return this.p1}get end(){return this.p2}}class N{static EPSILON=1e-10;name;constructor(t){this.name=t}}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(!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((d,g)=>d-g),[n,a,l]=i;return Math.abs(n-a)<c.EPSILON&&Math.abs(a-l)<c.EPSILON?"equilateral":Math.abs(n-a)<c.EPSILON||Math.abs(a-l)<c.EPSILON?"isosceles":"scalene"}static getAngles(t,e,s){if(!c.isValid(t,e,s))throw new Error("Invalid triangle sides");const i=Math.acos((e*e+s*s-t*t)/(2*e*s)),n=Math.acos((t*t+s*s-e*e)/(2*t*s)),a=Math.PI-i-n;return[i,n,a]}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))<N.EPSILON}get side(){return[u.distance(this.p1,this.p2),u.distance(this.p2,this.p3),u.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 u((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,a=(t*this.p1.y+e*this.p2.y+s*this.p3.y)/i;return new u(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)throw new Error("Cannot calculate circumcenter for collinear points");const e=((this.p1.x*this.p1.x+this.p1.y*this.p1.y)*(this.p2.y-this.p3.y)+(this.p2.x*this.p2.x+this.p2.y*this.p2.y)*(this.p3.y-this.p1.y)+(this.p3.x*this.p3.x+this.p3.y*this.p3.y)*(this.p1.y-this.p2.y))/t,s=((this.p1.x*this.p1.x+this.p1.y*this.p1.y)*(this.p3.x-this.p2.x)+(this.p2.x*this.p2.x+this.p2.y*this.p2.y)*(this.p1.x-this.p3.x)+(this.p3.x*this.p3.x+this.p3.y*this.p3.y)*(this.p2.x-this.p1.x))/t;return new u(e,s)}containsPoint(t){const e=c.area(u.distance(t,this.p1),u.distance(t,this.p2),u.distance(this.p1,this.p2)),s=c.area(u.distance(t,this.p2),u.distance(t,this.p3),u.distance(this.p2,this.p3)),i=c.area(u.distance(t,this.p3),u.distance(t,this.p1),u.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 H(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 M(r){return r!==null&&(typeof r=="object"||typeof r=="function")}class T{map=new Map;weakMap=new WeakMap;set(t,e){M(t)?this.weakMap.set(t,e):this.map.set(t,e)}get(t){return M(t)?this.weakMap.get(t):this.map.get(t)}has(t){return M(t)?this.weakMap.has(t):this.map.has(t)}}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 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;else{const l=t[i],d=this.ROMAN_MAP.get(l);if(!d)throw new Error(`Invalid Roman numeral sequence at position ${i}`);s+=d,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}}class F{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(t<2)return t;let e=0,s=1;for(let i=2;i<t;i++)[e,s]=[s,(e+s)%1000000007];return 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,p)=>o+p,0);if(s===0)return t.map(()=>"0%");const n=100*Math.pow(10,e),a=t.map(o=>o/s*n),l=a.map(o=>Math.floor(o)),d=a.map((o,p)=>o-l[p]);let g=l.reduce((o,p)=>o+p,0),w=n-g;for(;w>0;){let o=-1,p=-1;for(let m=0;m<d.length;m++)d[m]>p&&(p=d[m],o=m);if(o===-1)break;l[o]++,d[o]=0,w--}return l.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=.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*.5+e/i,i=i*.5+e/i,i=i*.5+e/i,i}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 isHappy(t){const e=new Set;for(;t!==1;){if(e.has(t))return!1;e.add(t),t=(t+"").split("").reduce((s,i)=>s+Number(i)*Number(i),0)}return!0}static isPerfect(t){let e=0;for(let s=1;s<t;s++)t%s===0&&(e+=s);return e===t}static middle(t,e){return e-(e-t>>1)}static scale(t,e,s){if(e[0]>=e[1]||s[0]>=s[1])throw new Error("Invalid range");t=this.clamp(t,e[0],e[1]);const i=e[1]-e[0];return(t-e[0])*((s[1]-s[0])/i)+s[0]}static isRange(t,e,s){if(s==null&&(s=e,e=0),e>=s)throw new Error("The maximum value must be greater than the minimum value");return e<=t&&t<s}static clamp(t,e,s){return s==null?Math.min(t,e):Math.min(Math.max(t,e),s)}static random(t,e){if(e==null&&(e=t,t=0),t>=e)throw new Error("The maximum value must be greater than the minimum value");return Math.random()*(e-t)+t}static randomInt(t,e){return Math.floor(this.random(t,e))}static round(t,e=0){if(!Number.isInteger(e))throw new Error("precision must be an integer");const s=Math.pow(10,e);return Math.round(t*s)/s}static 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}static fastPower(t,e){if(t<0)throw new Error("a must be greater than 0");if(e<0||!Number.isInteger(e))throw new Error("n must be a non-negative integer");if(t===0)return 0;if(e===0)return 1;const s=this.fastPower(t,e>>1);return e%2===0?s*s:s*s*t}static consecutiveSum(t){if(!this.isValidPositiveInteger)throw new Error("n must be a positive integer");return t*(t+1)/2}static consecutiveSquaresSum(t){if(!this.isValidPositiveInteger)throw new Error("n must be a positive integer");return t*(t+1)*(2*t+1)/6}static consecutivecubesSum(t){if(!this.isValidPositiveInteger)throw new Error("n must be a positive integer");return t*(t+1)*(2*t+1)*(3*t*t+3*t-1)/30}}class G{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 extends String{static frequencyStatistics(t){return[...t].reduce((e,s)=>(e[s]=(e[s]||0)+1,e),{})}}class X{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 W(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 v{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 v.instance||(v.instance=new v(t)),v.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||"")}}function K(r,t,e){let s=-1,i=r.length,n;for(;i-s>1;)n=i-(i-s)>>1,e(r[n],t)?i=n:s=n;return i}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},String.prototype.capitalize=function(){return this?this.charAt(0).toUpperCase()+this.slice(1).toLowerCase():this},String.prototype.reverse=function(){return this.split("").reverse().join("")},String.prototype.truncate=function(r,t="..."){return this.length<=r?this:this.slice(0,r-t.length)+t},String.prototype.isPalindrome=function(){const r=this.toLowerCase().replace(/[^a-z0-9]/g,"");return r===r.reverse()},String.prototype.count=function(r){const t=r.replace(/[.*+?^${}()|[\]\\]/g,"\\$&");return(this.match(new RegExp(t,"g"))||[]).length},String.prototype.toCamelCase=function(){return this.replace(/_([a-z])/g,(r,t)=>t.toUpperCase())},String.prototype.toSnakeCase=function(){return this.replace(/[A-Z]/g,r=>`_${r.toLowerCase()}`)},String.prototype.format=function(...r){return this.replace(/{(\d+)}/g,(t,e)=>r[e]||"")};class R{static random(t=8){const e="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";let s="";for(let i=0;i<t;i++)s+=e.charAt(Math.floor(Math.random()*e.length));return s}static template(t,e){return t.replace(/\${(\w+)}/g,(s,i)=>e[i]||"")}static escapeHtml(t){const e={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;","'":"&apos;"," ":"&nbsp;","±":"&plusmn;","×":"&times;","÷":"&divide;","≠":"&ne;","≤":"&le;","≥":"&ge;"},s=new RegExp(`[${Object.keys(e).join("")}]`,"g");return t.replace(s,i=>e[i])}static isEmail(t){return/^[^\s@]+@[^\s@]+\.[^\s@]+$/.test(t)}static isUrl(t){try{return new URL(t),!0}catch{return!1}}}Object.assign(String,R),h.BitPerm=G,h.Color=X,h.Dictionary=O,h.Emitter=v,h.Graph=$,h.LRU=q,h.Line=f,h.LinkedList=D,h.Matrix=I,h.MaxHeap=z,h.MemoizeMap=T,h.MinHeap=P,h.MinStack=V,h.Num=F,h.Point=u,h.Queue=S,h.Roman=B,h.Stack=C,h.Str=Q,h.StringExtensions=R,h.Triangle=c,h.Vector=y,h.binarySearchTemplate=K,h.isValidBracket=H,h.singleton=W,h.sleep=_,Object.defineProperty(h,Symbol.toStringTag,{value:"Module"})}));

package/index.d.ts

@@ -1,3 +1,5 @@
+/// <reference path="./types/string.extensions.d.ts"/>
+
 declare module "jc-structure" {
   /**
    * #### 数据结构接口
@@ -20,6 +22,7 @@ declare module "jc-structure" {
      */
     toString(): string;
   }
+
   /**
    * 栈类，采用object实现
    */
@@ -119,6 +122,7 @@ declare module "jc-structure" {
     readonly prototype: MinHeap<T>;
   }
   declare var MaxHeap: MaxConstructor;
+
   /**
    * LRU缓存类
    */
@@ -579,18 +583,18 @@ declare module "jc-structure" {
    * #### 计算最长递增子序列（Longest Increasing Subsequence, LIS）
    * @param nums
    */
-  export function LIS(nums: Array<number>): Array<number>;
+  // export function LIS(nums: Array<number>): Array<number>;
   /**
    * #### 睡眠函数
    * @param ms 毫秒
    */
-  export function sleep(ms: number): Promise<void>;
+  // export function sleep(ms: number): Promise<void>;
 
   /**
    * #### 判断字符串是否是有效的成对括号
    * @param str 含括号的字符串
    */
-  export function isValidBracket(str: string): boolean;
+  // export function isValidBracket(str: string): boolean;
 
   interface NumConstructor {
     new (value?: any): Number;
@@ -637,7 +641,7 @@ declare module "jc-structure" {
     fibonacciIterative(n: number): number;
 
     /**
-     * #### 获取百分比字符串数组
+     * #### 获取准确的百分比字符串数组
      * - 使用了"最大余数法"（也称为"汉密尔顿方法"）来分配百分比
      * - 这种方法可以确保所有百分比加起来正好等于100%，避免由于四舍五入造成的误差
      * @param valueList 数值数组
@@ -684,18 +688,28 @@ declare module "jc-structure" {
      */
     isPalindrome(n: number): boolean;
 
+    /**
+     * #### 是否是快乐数
+     * - 一个“快乐数”是指一个正整数，经过有限次变换后最终会变成1。变换规则是将每个数字的平方和作为下一个数字。
+     * @param n
+     */
+    isHappy(n: number): boolean;
     /**
      * #### 是否是阿姆斯特朗数
+     * - 阿姆斯特朗数（也称水仙花数、自恋数）是指一个n位数（n≥3），它的每个位上的数字的n次幂之和等于它本身。
      * @param n
      */
     isArmstrong(n: number): boolean;
 
     /**
      * #### 是否是完美数
+     * - 完美数是指一个数恰好等于它的因子之和（不包括它本身）。
      * @param n
      */
     isPerfect(n: number): boolean;
 
+    middle(a: number, b: number);
+
     /**
      * #### 线性比例缩放取值
      * @param n
@@ -708,6 +722,24 @@ declare module "jc-structure" {
       target: [number, number]
     ): number;
 
+    isRange(n: number, min: number): boolean;
+    isRange(n: number, min: number, max: number): boolean;
+
+    clamp(n: number, bound1: number): number;
+    clamp(n: number, bound1: number, bound2: number): number;
+
+    /**
+     * #### 获取[0.min)随机数，不包含min
+     * @param min
+     */
+    random(min: number): number;
+    /**
+     * #### 获取[min,max)随机数，不包含max
+     * @param min 最小数
+     * @param max 最大数
+     */
+    random(min: number, max: number): number;
+
     /**
      * #### 获取随机整数，包含min和max
      * @param min 最小数
@@ -729,6 +761,34 @@ declare module "jc-structure" {
      * @param b
      */
     isSameSign(a: number, b: number): boolean;
+
+    /**
+     * #### 快速计算指数幂；
+     * - 快速幂算法利用了分治的思想，将大问题分解为小问题；
+     * - 核心公式：a^n = (a^(n/2))^2 （当n为偶数）
+     * - 当n为奇数时：a^n = (a^(n/2))^2 * a
+     * - 使用位运算 exponent >> 1 来代替除以2，提高效率
+     * - 时间复杂度为O(log n)，比朴素的O(n)方法快很多
+     * @param base
+     * @param exponent
+     */
+    fastPower(a: number, n: number): number;
+
+    /**
+     * #### 连续自然数之和
+     * @param n
+     */
+    consecutiveSum(n: number): number;
+    /**
+     * #### 连续自然数平方和
+     * @param n
+     */
+    consecutiveSquaresSum(n: number): number;
+    /**
+     * #### 连续自然数立方和
+     * @param n
+     */
+    consecutivecubesSum(n: number): number;
   }
   declare var Num: NumConstructor;
 
@@ -786,8 +846,8 @@ declare module "jc-structure" {
     new (value?: any): String;
     readonly prototype: String;
 
-    longestCommonPrefix(strs: string[]): string;
-    uuid(a?: number | string): 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.17",
+  "version": "0.1.19",
   "type": "module",
   "files": [
     "dist",

package/types/global.d.ts

@@ -32,3 +32,44 @@ interface CompareFn<T> {
 interface Obj<V = any> {
   [key: string]: V;
 }
+
+interface RegExpConstructor {
+  /**
+   * #### 转义正则表达式中的特殊字符
+   * @param str 字符串
+   */
+  escape(str: string): string;
+}
+
+interface Element {
+  /**
+   * #### 获取最深元素集合中的第一个元素
+   */
+  readonly firstElement: Element | null;
+  /**
+   * #### 获取最深元素集合中的最后一个元素
+   */
+  readonly lastElement: Element | null;
+  /**
+   * #### 最祖先的匹配元素
+   * @param this element
+   * @param selector 选择器
+   */
+  farthest<E extends Element = Element>(this: E, selector: string): E | null;
+}
+
+interface Text {
+  /**
+   * #### 将文本节点包裹在指定标签中
+   * @param this Text 该文本节点
+   * @param selector 要包裹的元素标签，默认为：'strong'
+   * @param text 要包裹的文本，默认为：''
+   */
+  surround(this: Text, selector?: string, text?: string): HTMLElement | null;
+}
+
+interface Array<T> {
+  groupBy<K extends string | number | symbol>(
+    generateKey: string | ((item: T, index: number, arr: T[]) => K)
+  ): Record<K, T[]>;
+}

package/types/string.extensions.d.ts

@@ -0,0 +1,93 @@
+interface String {
+  /**
+   * #### 获取字符串码点长度，1个码点对应1个码元或2个码元，譬如 "👍" 长度为2，"a" 长度为1
+   * - 计算字符串的码点长度，考虑到 Unicode 字符的特殊性
+   * @returns {number} 字符串的码元长度
+   */
+  pointLength(this: string): number;
+  /**
+   * #### 根据码点索引获取对应的字符
+   * - 处理 Unicode 字符，确保正确获取码点对应的字符
+   * @param index 码点索引
+   */
+  pointAt(this: string, index: number): string | undefined;
+
+  /**
+   * #### 根据码点索引切割字符串
+   * - 按照码点索引切割字符串，确保不会破坏 Unicode 字符
+   * @param start 开始索引
+   * @param end 结束索引
+   */
+  sliceByPoint(this: string, start: number, end?: number): string;
+
+  /**
+   * #### 字符串首字母大写
+   */
+  capitalize(): string;
+  /**
+   * #### 字符串反转
+   */
+  reverse(): string;
+  /**
+   * #### 字符串截断,超出长度时，添加后缀‘...’
+   * @param this 字符串实例
+   * @param length 指定长度，包含了后缀的长度
+   * @param suffix 后缀，默认为‘...’
+   */
+  truncate(this: string, length: number, suffix?: string): string;
+  /**
+   * #### 判断字符串是否为回文
+   */
+  isPalindrome(): boolean;
+  /**
+   * #### 子字符串在字符串中出现的次数
+   * @param substring 子字符串
+   */
+  count(substring: string): number;
+  /**
+   * #### 字符串转驼峰命名
+   */
+  toCamelCase(): string;
+  /**
+   * #### 字符串转下划线命名
+   */
+  toSnakeCase(): string;
+  /**
+   * #### 模板字符串语法，将字符串中的占位符替换为对应的值
+   * @param args 占位符对应的值
+   * @example
+   * ```ts
+   * 'Hello, {name}!'.format({name: 'world'}) // 'Hello, world!'
+   * ```
+   */
+  format(...args: any[]): string;
+}
+
+interface StringConstructor {
+  /**
+   * #### 生成指定长度的随机字符串
+   * @param length 长度
+   */
+  random(length?: number): string;
+  /**
+   * #### 模板字符串语法，将字符串中的占位符替换为对应的值
+   * @param template
+   * @param values
+   */
+  template(template: string, values: Record<string, any>): string;
+  /**
+   * #### 安全转义 HTML 字符串，防止 XSS 攻击
+   * @param str
+   */
+  escapeHtml(str: string): string;
+  /**
+   * #### 是否是有效的邮箱地址
+   * @param str
+   */
+  isEmail(str: string): boolean;
+  /**
+   * #### 是否是URL地址
+   * @param str
+   */
+  isUrl(str: string): boolean;
+}

package/types/extend.d.ts

@@ -1,57 +0,0 @@
-interface String {
-  /**
-   * #### 获取字符串码点长度，1个码点对应1个码元或2个码元，譬如 "👍" 长度为2，"a" 长度为1
-   * - 计算字符串的码点长度，考虑到 Unicode 字符的特殊性
-   * @returns {number} 字符串的码元长度
-   */
-  pointLength(this: string): number;
-  /**
-   * #### 根据码点索引获取对应的字符
-   * - 处理 Unicode 字符，确保正确获取码点对应的字符
-   * @param index 码点索引
-   */
-  pointAt(this: string, index: number): string | undefined;
-
-  /**
-   * #### 根据码点索引切割字符串
-   * - 按照码点索引切割字符串，确保不会破坏 Unicode 字符
-   * @param start 开始索引
-   * @param end 结束索引
-   */
-  sliceByPoint(this: string, start: number, end?: number): string;
-}
-
-interface RegExpConstructor {
-  /**
-   * #### 转义正则表达式中的特殊字符
-   * @param str 字符串
-   */
-  escape(str: string): string;
-}
-
-interface Element {
-  /**
-   * #### 获取最深元素集合中的第一个元素
-   */
-  readonly firstElement: Element | null;
-  /**
-   * #### 获取最深元素集合中的最后一个元素
-   */
-  readonly lastElement: Element | null;
-  /**
-   * #### 最祖先的匹配元素
-   * @param this element
-   * @param selector 选择器
-   */
-  farthest<E extends Element = Element>(this: E, selector: string): E | null;
-}
-
-interface Text {
-  /**
-   * #### 将文本节点包裹在指定标签中
-   * @param this Text 该文本节点
-   * @param selector 要包裹的元素标签，默认为：'strong'
-   * @param text 要包裹的文本，默认为：''
-   */
-  surround(this: Text, selector?: string, text?: string): HTMLElement | null;
-}