jc-structure 0.1.18 → 0.1.21

package/dist/jc-structure.js

@@ -1,4 +1,4 @@
-class V {
+class H {
   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 D {
   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 U {
   stack = [];
   minStack = [];
   push(t) {
@@ -129,13 +129,13 @@ class D {
     return this.isEmpty() ? "" : `MinStack(count: ${this.size()}):[${this.getMin()},...rest]`;
   }
 }
-function P(r, t) {
-  return r === t ? 0 : r < t ? -1 : 1;
+function k(h, t) {
+  return h === t ? 0 : h < t ? -1 : 1;
 }
-class y {
+class E {
   heap = [];
   compareFn;
-  constructor(t = P) {
+  constructor(t = k) {
     this.compareFn = t;
   }
   static getLeftIndex(t) {
@@ -166,7 +166,7 @@ class y {
     return this.heap.toString();
   }
 }
-class O extends y {
+class L extends E {
   insert(t) {
     return t ? !1 : (this.heap.push(t), this.siftUp(this.heap.length - 1), !0);
   }
@@ -177,24 +177,24 @@ class O extends y {
     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));
+    let e = t, s = E.getLeftIndex(e), r = E.getRightIndex(e), i = this.size();
+    s < i && this.compareFn(this.heap[e], this.heap[s]) === -1 && (e = s), r < i && this.compareFn(this.heap[e], this.heap[r]) === 1 && (e = r), e !== t && (E.swap(this.heap, t, e), this.siftUp(e));
   }
   siftDown(t) {
-    let e = y.getParentIndex(t);
+    let e = E.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);
+      E.swap(this.heap, e, t), t = e, e = E.getParentIndex(t);
   }
 }
-class q extends O {
-  constructor(t = (e, s) => P(s, e)) {
+class q extends L {
+  constructor(t = (e, s) => k(s, e)) {
     super(t);
   }
 }
-function L(r) {
-  return { value: r };
+function z(h) {
+  return { value: h };
 }
-class j {
+class F {
   capacity;
   length = 0;
   head = null;
@@ -224,31 +224,31 @@ 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 = z(e), this.length++, this.prepend(s), this.trimCache(), this.lookup.set(t, s), this.reverseLookup);
   }
 }
-class S {
+class O {
   value;
   next = void 0;
 }
-class U {
+class T {
   count = 0;
   head = void 0;
   constructor() {
   }
   indexOf(t) {
-    let e = this.head, s = 0, i = !1;
+    let e = this.head, s = 0, r = !1;
     for (; e; ) {
       if (this.equals(e.value, t)) {
-        i = !0;
+        r = !0;
         break;
       }
       s++, e = e.next;
     }
-    return i ? s : -1;
+    return r ? s : -1;
   }
   equals(t, e) {
-    return !1;
+    return t === e ? !0 : t == null || e == null ? !1 : typeof t == "object" && typeof e == "object" ? JSON.stringify(t) === JSON.stringify(e) : !1;
   }
   getElementAt(t) {
     if (t < 0 || t >= this.count)
@@ -264,19 +264,19 @@ class U {
     return this.getElementAt(t)?.value;
   }
   insert(t, e) {
-    let s = new S();
+    let s = new O();
     if (s.value = t, e > this.count || e < 0)
       throw new Error("index error");
     this.count++;
-    let i, n;
+    let r, i;
     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;
+    r = this.getElementAt(e - 1), i = r.next, r.next = s, s.next = i;
   }
   push(t) {
-    let e = new S();
+    let e = new O();
     if (e.value = t, this.count++, this.isEmpty()) {
       this.head = e;
       return;
@@ -291,8 +291,8 @@ class U {
   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;
+    let e = this.getElementAt(t), s = this.getElementAt(t - 1), r = e?.next;
+    return t === 0 && (this.head = r), s && (s.next = r), this.count--, e?.value;
   }
   isEmpty() {
     return this.count === 0;
@@ -310,17 +310,17 @@ class U {
     return t = t.slice(0, -1), t;
   }
 }
-class C {
+class $ {
   key;
   value;
   constructor(t, e) {
     this.key = t, this.value = e;
   }
 }
-function M(r, t = { emptyString: !1, zeroNumber: !1 }) {
-  return r == null ? !(t.emptyString && r === "" || t.zeroNumber && r === 0) : !1;
+function b(h, t = { emptyString: !1, zeroNumber: !1 }) {
+  return h == null ? !(t.emptyString && h === "" || t.zeroNumber && h === 0) : !1;
 }
-class R {
+class V {
   table = [];
   constructor() {
   }
@@ -331,15 +331,15 @@ class R {
     return -1;
   }
   set(t, e) {
-    if (M(t))
+    if (b(t))
       throw new Error("key is required");
-    if (M(e))
+    if (b(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 C(t, e);
+      const s = new $(t, e);
       this.table.push(s);
     }
   }
@@ -369,8 +369,8 @@ class R {
   }
   forEach(t) {
     for (let e = 0, s = this.size(); e < s; e++) {
-      let i = this.table[e];
-      if (!t(i.key, i.value))
+      let r = this.table[e];
+      if (!t(r.key, r.value))
         break;
     }
   }
@@ -390,12 +390,12 @@ class R {
     return t = t.slice(0, -1), t;
   }
 }
-class $ {
+class B {
   isDirected;
   vertices;
   adjList;
   constructor(t = !1) {
-    this.isDirected = t, this.vertices = [], this.adjList = new R();
+    this.isDirected = t, this.vertices = [], this.adjList = new V();
   }
   addVertex(t) {
     this.vertices.includes(t) || (this.vertices.push(t), this.adjList.set(t, []));
@@ -445,7 +445,7 @@ class w {
     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]
+      (s, r) => s + t._data[r]
     );
     return new w(...e);
   }
@@ -453,7 +453,7 @@ class w {
     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]
+      (s, r) => s - t._data[r]
     );
     return new w(...e);
   }
@@ -464,7 +464,7 @@ class w {
     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],
+      (e, s, r) => e + s * t._data[r],
       0
     );
   }
@@ -475,19 +475,19 @@ class w {
     return this.mul(-1);
   }
 }
-class x {
+class I {
   _matrix;
   static zero(t, e) {
-    return new x(
+    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;
+      for (let r = s; r < e / 2; r++) {
+        const i = t[e - 1 - r][s];
+        t[e - 1 - r][s] = t[e - 1 - s][e - 1 - r], t[e - 1 - s][e - 1 - r] = t[r][e - 1 - s], t[r][e - 1 - s] = t[s][r], t[s][r] = i;
       }
     return t;
   }
@@ -519,7 +519,7 @@ class x {
     return this._matrix[t[0]][t[1]] = e, this;
   }
   mul(t) {
-    return new x(this._matrix.map((e) => e.map((s) => s * t)));
+    return new I(this._matrix.map((e) => e.map((s) => s * t)));
   }
   div(t) {
     return this.mul(1 / t);
@@ -527,9 +527,9 @@ class x {
   add(t) {
     if (this.row !== t.row || this.col !== t.col)
       throw new Error("Matrix dimensions do not match");
-    return new x(
+    return new I(
       this._matrix.map(
-        (e, s) => e.map((i, n) => i + t.getItem([s, n]))
+        (e, s) => e.map((r, i) => r + t.getItem([s, i]))
       )
     );
   }
@@ -545,18 +545,18 @@ class x {
   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)))
+    return new I(
+      this._matrix.map((e) => e.map((s, r) => s * t.getItem(r)))
     );
   }
   mulMatrix(t) {
     if (this.col !== t.row)
       throw new Error("Matrix dimensions do not match");
-    const e = x.zero(this.row, t.col);
+    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)));
+      const r = this.rowVector(s);
+      for (let i = 0; i < this.col; i++)
+        e.setItem([s, i], r.dot(t.colVector(i)));
     }
     return e;
   }
@@ -575,24 +575,23 @@ class u {
   }
 }
 class g {
-  // 使用更合适的精度阈值常量
   static EPSILON = 1e-10;
   static sloped(t, e = g.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;
+    const s = t.p2.x - t.p1.x, r = t.p2.y - t.p1.y;
+    return Math.abs(s) < e ? Math.abs(r) < e ? 0 : null : r / s;
   }
   static isParallel(t, e, s = g.EPSILON) {
-    const i = g.sloped(t), n = g.sloped(e);
-    return i === null && n === null ? !0 : i === null || n === null ? !1 : Math.abs(i - n) < s;
+    const r = g.sloped(t), i = g.sloped(e);
+    return r === null && i === null ? !0 : r === null || i === null ? !1 : Math.abs(r - i) < s;
   }
   static getIntersection(t, e, s = g.EPSILON) {
     if (g.isParallel(t, e)) return null;
-    const 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);
+    const r = t.p1.x, i = t.p1.y, n = t.p2.x, a = t.p2.y, o = e.p1.x, d = e.p1.y, f = e.p2.x, c = e.p2.y, l = (r - n) * (d - c) - (i - a) * (o - f);
     if (Math.abs(l) < s) return null;
-    const d = ((i - c) * (f - a) - (n - f) * (c - m)) / l, v = -((i - h) * (n - f) - (n - o) * (i - c)) / l;
-    if (d >= 0 && d <= 1 && v >= 0 && v <= 1) {
-      const k = i + d * (h - i), N = n + d * (o - n);
-      return new u(k, N);
+    const m = ((r - o) * (d - c) - (i - d) * (o - f)) / l, A = -((r - n) * (i - d) - (i - a) * (r - o)) / l;
+    if (m >= 0 && m <= 1 && A >= 0 && A <= 1) {
+      const N = r + m * (n - r), C = i + m * (a - i);
+      return new u(N, C);
     }
     return null;
   }
@@ -600,13 +599,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;
-    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, v = e.y - l;
-    return Math.hypot(d + v);
+    const r = e.x - t.p1.x, i = e.y - t.p1.y, n = t.p2.x - t.p1.x, a = t.p2.y - t.p1.y, o = r * n + i * a, d = n * n + a * a;
+    let f = -1;
+    d > s && (f = o / d);
+    let c, l;
+    f < 0 ? (c = t.p1.x, l = t.p1.y) : f > 1 ? (c = t.p2.x, l = t.p2.y) : (c = t.p1.x + f * n, l = t.p1.y + f * a);
+    const m = e.x - c, A = e.y - l;
+    return Math.hypot(m + A);
   }
   p1;
   p2;
@@ -628,7 +627,6 @@ class g {
     const s = (t.x - this.p1.x) * (this.p2.y - this.p1.y) - (t.y - this.p1.y) * (this.p2.x - this.p1.x);
     return Math.abs(s) > e ? !1 : (t.x - this.p1.x) * (t.x - this.p2.x) + (t.y - this.p1.y) * (t.y - this.p2.y) <= e;
   }
-  // 获取线段的方向向量
   get direction() {
     const t = this.length;
     if (t < g.EPSILON) return new u(0, 0);
@@ -642,47 +640,47 @@ class g {
     return this.p2;
   }
 }
-class A {
+class R {
   static EPSILON = 1e-10;
   name;
   constructor(t) {
     this.name = t;
   }
 }
-class p extends A {
+class p 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 (!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));
+    const r = (t + e + s) / 2;
+    return Math.sqrt(r * (r - t) * (r - e) * (r - s));
   }
   static getType(t, e, s) {
     if (!p.isValid(t, e, s))
       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 r = [t, e, s].sort((o, d) => o - d), [i, n, a] = r;
+    return Math.abs(i - n) < p.EPSILON && Math.abs(n - a) < p.EPSILON ? "equilateral" : Math.abs(i - n) < p.EPSILON || Math.abs(n - a) < p.EPSILON ? "isosceles" : "scalene";
   }
   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];
+    const r = Math.acos((e * e + s * s - t * t) / (2 * e * s)), i = Math.acos((t * t + s * s - e * e) / (2 * t * s)), n = Math.PI - r - i;
+    return [r, i, n];
   }
   p1;
   p2;
   p3;
-  constructor(t, e, s, i = "triangle") {
-    if (super(i), this.p1 = t, this.p2 = e, this.p3 = s, this.areCollinear())
+  constructor(t, e, s, r = "triangle") {
+    if (super(r), this.p1 = t, this.p2 = e, this.p3 = s, this.areCollinear())
       throw new Error("Points are collinear, cannot form a triangle");
   }
   // 检查三点是否共线
   areCollinear() {
     return Math.abs(
       (this.p2.x - this.p1.x) * (this.p3.y - this.p1.y) - (this.p3.x - this.p1.x) * (this.p2.y - this.p1.y)
-    ) < A.EPSILON;
+    ) < R.EPSILON;
   }
   get side() {
     return [
@@ -713,8 +711,8 @@ class p extends A {
     );
   }
   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);
+    const [t, e, s] = this.side, r = this.perimeter() / 2, i = (t * this.p1.x + e * this.p2.x + s * this.p3.x) / r, n = (t * this.p1.y + e * this.p2.y + s * this.p3.y) / r;
+    return new u(i, n);
   }
   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));
@@ -732,65 +730,243 @@ class p extends A {
       u.distance(t, this.p2),
       u.distance(t, this.p3),
       u.distance(this.p2, this.p3)
-    ), i = p.area(
+    ), r = 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;
+    return Math.abs(e + s + r - this.area()) < p.EPSILON;
   }
 }
-function _(r) {
-  return new Promise((t) => setTimeout(t, r));
+class G {
+  static sleep(t) {
+    return new Promise((e) => setTimeout(e, t));
+  }
+  static binarySearchTemplate(t, e, s) {
+    let r = -1, i = t.length, n;
+    for (; i - r > 1; )
+      n = i - (i - r) >> 1, s(t[n], e) ? i = n : r = n;
+    return i;
+  }
+  static singleton(t) {
+    let e;
+    const s = new Proxy(t, {
+      construct(r, i, n) {
+        return e || (e = Reflect.construct(
+          r,
+          i,
+          n
+        )), e;
+      }
+    });
+    return t.prototype.constructor = s, s;
+  }
 }
-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;
+class _ {
+  static groupBy(t, e) {
+    if (!e)
+      throw new Error("generateKey is required");
+    const s = typeof e == "string" ? (i) => i[e] : e, r = /* @__PURE__ */ new Map();
+    for (const [i, n] of t.entries())
+      try {
+        const a = s(n, i, t);
+        if (a == null) {
+          console.warn("Invalid key generated for item:", n);
+          continue;
+        }
+        const o = r.get(a) ?? [];
+        o.push(n), r.set(a, o);
+      } catch (a) {
+        console.error("Error generating key for item:", n, a);
+      }
+    return Object.fromEntries(r);
+  }
+  static LIS(t) {
+    if (!t.length) return [];
+    const e = [[t[0]]];
+    for (let r = 1, i = t.length; r < i; r++) {
+      const n = t[r];
+      s(n);
+    }
+    function s(r) {
+      for (let i = e.length - 1; i >= 0; i--) {
+        const n = e[i], a = n[e[i].length - 1];
+        if (a < r) {
+          e[i + 1] = [...n, r];
+          break;
+        } else a > r && i === 0 && (e[i] = [r]);
+      }
+    }
+    return e[e.length - 1];
+  }
+  static LCP(t) {
+    if (!t.length) return "";
+    let e = t[0];
+    for (let s = 1; s < t.length; s++)
+      for (; !t[s].startsWith(e); )
+        if (e = e.slice(0, -1), e === "") return "";
+    return e;
+  }
 }
-function b(r) {
-  return r !== null && (typeof r == "object" || typeof r == "function");
+function v(h) {
+  return h !== null && (typeof h == "object" || typeof h == "function");
 }
-class T {
+class W {
   map = /* @__PURE__ */ new Map();
   weakMap = /* @__PURE__ */ new WeakMap();
   set(t, e) {
-    b(t) ? this.weakMap.set(t, e) : this.map.set(t, e);
+    v(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 v(t) ? this.weakMap.get(t) : this.map.get(t);
   }
   has(t) {
-    return b(t) ? this.weakMap.has(t) : this.map.has(t);
+    return v(t) ? this.weakMap.has(t) : this.map.has(t);
   }
 }
-function F(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]);
+class X {
+  static jsonClone(t) {
+    try {
+      return JSON.parse(JSON.stringify(t));
+    } catch {
+      throw new Error("Object is not JSON cloneable");
+    }
+  }
+  static structureClone(t) {
+    return structuredClone(t);
+  }
+  static deepClone(t, e = /* @__PURE__ */ new WeakMap()) {
+    if (t == null || typeof t != "object") return t;
+    if (e.has(t)) return e.get(t);
+    if (t instanceof Date) return new Date(t.getTime());
+    if (t instanceof RegExp) return new RegExp(t.source, t.flags);
+    if (t instanceof Map) {
+      const n = /* @__PURE__ */ new Map();
+      e.set(t, n);
+      for (const [a, o] of t)
+        n.set(this.deepClone(a, e), this.deepClone(o, e));
+      return n;
     }
+    if (t instanceof Set) {
+      const n = /* @__PURE__ */ new Set();
+      e.set(t, n);
+      for (const a of t)
+        n.add(this.deepClone(a, e));
+      return n;
+    }
+    if (Array.isArray(t)) {
+      const n = new Array(t.length);
+      e.set(t, n);
+      for (let a = 0, o = t.length; a < o; a++)
+        n[a] = this.deepClone(t[a], e);
+      return n;
+    }
+    if (t instanceof ArrayBuffer) return t.slice(0);
+    const s = [
+      Int8Array,
+      Uint8Array,
+      Uint8ClampedArray,
+      Int16Array,
+      Uint16Array,
+      Int32Array,
+      Uint32Array,
+      Float32Array,
+      Float64Array
+    ];
+    for (const n of s)
+      if (t instanceof n)
+        return new n(t);
+    if (typeof t == "function")
+      return new Proxy(t, {
+        apply(n, a, o) {
+          return n.apply(a, o);
+        },
+        get(n, a) {
+          if (a in n)
+            return n[a];
+        }
+      });
+    const r = Object.create(Object.getPrototypeOf(t));
+    e.set(t, r);
+    const i = Object.getOwnPropertyDescriptors(t);
+    for (const [n, a] of Object.entries(i))
+      a.value !== void 0 && (a.value = this.deepClone(a.value, e)), Object.defineProperty(r, n, a);
+    return r;
   }
-  return t[t.length - 1];
 }
-class B {
+const P = {
+  date: "yyyy-MM-dd",
+  datetime: "yyyy-MM-dd HH:mm:ss",
+  time: "HH:mm:ss",
+  iso: "yyyy-MM-ddTHH:mm:ss.SSS"
+};
+class S {
+  static defaultOptions = {
+    paddingZero: !1,
+    locale: "en-US"
+  };
+  static setDefaultOptions(t) {
+    S.defaultOptions = { ...S.defaultOptions, ...t };
+  }
+  static format(t, e, s = {}) {
+    const r = { ...S.defaultOptions, ...s }, i = S.getDateInfo(t, r);
+    return S.normalizeFormatter(e)(i);
+  }
+  // 获取日期信息
+  static getDateInfo(t, e) {
+    const s = (c, l = 2) => e.paddingZero ? c.toString().padStart(l, "0") : c.toString(), r = t.getFullYear(), i = t.getMonth() + 1, n = t.getDate(), a = t.getHours(), o = t.getMinutes(), d = t.getSeconds(), f = t.getMilliseconds();
+    return {
+      year: r,
+      month: i,
+      day: n,
+      hour: a,
+      minute: o,
+      second: d,
+      millisecond: f,
+      yyyy: s(r, 4),
+      MM: s(i),
+      dd: s(n),
+      HH: s(a),
+      mm: s(o),
+      ss: s(d)
+    };
+  }
+  static normalizeFormatter(t) {
+    if (typeof t == "function")
+      return t;
+    if (typeof t != "string")
+      throw new Error("Formatter must be a string or function");
+    t in P && (t = P[t]);
+    const e = {
+      yyyy: "yyyy",
+      MM: "MM",
+      dd: "dd",
+      HH: "HH",
+      mm: "mm",
+      ss: "ss",
+      SSS: "SSS"
+    };
+    return (s) => {
+      let r = t;
+      for (const [i, n] of Object.entries(e))
+        r = r.replace(
+          new RegExp(i, "g"),
+          String(s[n] || "")
+        );
+      return r;
+    };
+  }
+  static formatRelative(t, e = /* @__PURE__ */ new Date()) {
+    const s = t.getTime() - e.getTime(), r = Math.abs(s), i = Math.floor(r / 1e3), n = Math.floor(i / 60), a = Math.floor(n / 60), o = Math.floor(a / 24);
+    return o > 0 ? s > 0 ? `${o}天后` : `${o}天前` : a > 0 ? s > 0 ? `${a}小时后` : `${a}小时前` : n > 0 ? s > 0 ? `${n}分钟后` : `${n}分钟前` : s > 0 ? "刚刚" : "";
+  }
+}
+class Q {
+  static escape(t) {
+    return t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+  }
+}
+class j {
   static ROMAN_MAP = /* @__PURE__ */ new Map([
     ["M", 1e3],
     ["CM", 900],
@@ -810,19 +986,19 @@ class B {
     if (t.length === 0)
       throw new Error("Input cannot be empty");
     const e = /* @__PURE__ */ new Set(["I", "V", "X", "L", "C", "D", "M"]);
-    for (const 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;
+    for (const n of t)
+      if (!e.has(n))
+        throw new Error(`Invalid Roman numeral character: ${n}`);
+    let s = 0, r = 0;
+    for (; r < t.length; ) {
+      const n = t.slice(r, r + 2);
+      if (this.ROMAN_MAP.has(n))
+        s += this.ROMAN_MAP.get(n), r += 2;
       else {
-        const o = t[i], c = this.ROMAN_MAP.get(o);
-        if (!c)
-          throw new Error(`Invalid Roman numeral sequence at position ${i}`);
-        s += c, i += 1;
+        const a = t[r], o = this.ROMAN_MAP.get(a);
+        if (!o)
+          throw new Error(`Invalid Roman numeral sequence at position ${r}`);
+        s += o, r += 1;
       }
     }
     if (this.toRoman(s) !== t)
@@ -835,26 +1011,33 @@ class B {
     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;
+    for (const [s, r] of this.ROMAN_MAP)
+      for (; t >= r; )
+        e += s, t -= r;
     return e;
   }
 }
-class G {
-  static isValidPositiveInteger(t) {
-    return Number.isInteger(t) && t > 0 && t <= Number.MAX_SAFE_INTEGER;
+class y extends Number {
+  static handleNumRange(t, e = !1, s = Number.MIN_SAFE_INTEGER, r = Number.MAX_SAFE_INTEGER) {
+    if (e && !Number.isInteger(t))
+      throw new Error("n must be an integer");
+    if (t < s || t >= r)
+      throw new RangeError(`n must be in the range of ${s} to ${r}`);
   }
-  static isPowerOfTwo(t) {
-    return t > 0 && (t & t - 1) === 0;
+  static consecutiveSum(t) {
+    return y.handleNumRange(t, !0, 0, 1e8), t * (t + 1) / 2;
   }
-  static isOdd(t) {
-    return t % 2 === 1 || t % 2 === -1;
+  static consecutiveSquaresSum(t) {
+    return y.handleNumRange(t, !0, 0, 1e6), t * (t + 1) * (2 * t + 1) / 6;
+  }
+  static consecutivecubesSum(t) {
+    return y.handleNumRange(t, !0, 0, 1e4), t * (t + 1) * (2 * t + 1) * (3 * t * t + 3 * t - 1) / 30;
+  }
+  static clamp(t, e, s) {
+    return s == null ? Math.min(t, e) : Math.min(Math.max(t, e), s);
   }
   static factorial(t) {
-    if (!this.isValidPositiveInteger(t))
-      throw new Error("Input must be a non-negative integer");
-    if (t < 2)
+    if (y.handleNumRange(t, !0, 0, 1e3), t < 2)
       return 1;
     let e = 1;
     for (let s = 2; s <= t; s++)
@@ -862,50 +1045,66 @@ class G {
     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);
+    return y.handleNumRange(t, !0, 0, 1e3), t < 2 ? s : this.fibonacci(t - 1, s, s + e);
   }
   static fibonacciIterative(t) {
-    if (t < 2) return t;
+    if (y.handleNumRange(t, !0, 0, 1e3), t < 2) return t;
     let e = 0, s = 1;
-    for (let i = 2; i < t; i++)
+    for (let r = 2; r <= t; r++)
       [e, s] = [s, (e + s) % 1000000007];
     return s;
   }
+  static floatEqual(t, e, s = 1e-6) {
+    return Math.abs(t - e) < s;
+  }
+  static fastPower(t, e) {
+    if (y.handleNumRange(e, !0, 0, 10), y.handleNumRange(t, !1, 0, 1e3), t === 0) return 0;
+    if (e === 0) return 1;
+    const s = this.fastPower(t, e >> 1);
+    return e % 2 === 0 ? s * s : s * s * t;
+  }
+  static fastSqrt(t) {
+    if (y.handleNumRange(t, !1, 0, 1e8), typeof BigInt > "u")
+      return Math.sqrt(t);
+    const e = 0.5 * t, s = new ArrayBuffer(8);
+    new Float64Array(s)[0] = t;
+    let r = new BigInt64Array(s)[0];
+    r = 0x1ff7a3bea91d9b1bn + (r >> 1n);
+    const i = new ArrayBuffer(8);
+    new BigInt64Array(i)[0] = r;
+    let n = new Float64Array(i)[0];
+    return n = n * 0.5 + e / n, n = n * 0.5 + e / n, n = n * 0.5 + e / n, n;
+  }
   static getPercentWithPrecision(t, e = 2) {
     if (!Array.isArray(t) || t.length === 0)
       return [];
     if (e < 0 || !Number.isInteger(e))
       throw new Error("Precision must be a non-negative integer");
-    const s = t.reduce((a, l) => a + l, 0);
+    const s = t.reduce((c, l) => c + l, 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;
-    for (; m > 0; ) {
-      let a = -1, l = -1;
-      for (let d = 0; d < c.length; d++)
-        c[d] > l && (l = c[d], a = d);
-      if (a === -1) break;
-      o[a]++, c[a] = 0, m--;
+    const i = 100 * Math.pow(10, e), n = t.map((c) => c / s * i), a = n.map((c) => Math.floor(c)), o = n.map((c, l) => c - a[l]);
+    let d = a.reduce((c, l) => c + l, 0), f = i - d;
+    for (; f > 0; ) {
+      let c = -1, l = -1;
+      for (let m = 0; m < o.length; m++)
+        o[m] > l && (l = o[m], c = m);
+      if (c === -1) break;
+      a[c]++, o[c] = 0, f--;
     }
-    return o.map((a) => `${(a / 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;
+    return a.map((c) => `${(c / i * 100).toFixed(e)}%`);
   }
   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 isValidPositiveInteger(t) {
+    return Number.isInteger(t) && t > 0 && t <= Number.MAX_SAFE_INTEGER;
+  }
+  static isPowerOfTwo(t) {
+    return t > 0 && (t & t - 1) === 0;
+  }
+  static isOdd(t) {
+    return t % 2 === 1 || t % 2 === -1;
   }
   static isPrime(t) {
     if (t <= 1)
@@ -920,23 +1119,23 @@ class G {
       return !1;
     let e = 0, s = t;
     for (; t > 0; ) {
-      const i = t % 10;
-      e = e * 10 + i, t = Math.floor(t / 10);
+      const r = t % 10;
+      e = e * 10 + r, t = Math.floor(t / 10);
     }
     return s === e;
   }
   static isArmstrong(t) {
     const e = t.toString(), s = e.length;
-    let i = 0;
-    for (let n = 0; n < s; n++)
-      i += Math.pow(parseInt(e[n]), s);
-    return i === t;
+    let r = 0;
+    for (let i = 0; i < s; i++)
+      r += Math.pow(parseInt(e[i]), s);
+    return r === t;
   }
   static isHappy(t) {
     const e = /* @__PURE__ */ 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);
+      e.add(t), t = (t + "").split("").reduce((s, r) => s + Number(r) * Number(r), 0);
     }
     return !0;
   }
@@ -946,15 +1145,8 @@ class G {
       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 isSameSign(t, e) {
+    return t >= 0 && e >= 0 || t <= 0 && e <= 0;
   }
   static isRange(t, e, s) {
     if (s == null && (s = e, e = 0), e >= s)
@@ -963,8 +1155,11 @@ class G {
       );
     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 lcm(t, e) {
+    return t * e / this.gcd(t, e);
+  }
+  static middle(t, e) {
+    return e - (e - t >> 1);
   }
   static random(t, e) {
     if (e == null && (e = t, t = 0), t >= e)
@@ -982,39 +1177,15 @@ class G {
     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;
+  static scale(t, e, s) {
+    if (e[0] >= e[1] || s[0] >= s[1])
+      throw new Error("Invalid range");
+    t = this.clamp(t, e[0], e[1]);
+    const r = e[1] - e[0];
+    return (t - e[0]) * ((s[1] - s[0]) / r) + s[0];
   }
 }
-class W {
+class J {
   static READ = 1;
   static WRITE = 2;
   static SHARE = 4;
@@ -1033,23 +1204,118 @@ 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;
+class Z extends String {
+  static frequencyStatistics(t) {
+    return [...t].reduce(
+      (e, s) => (e[s] = (e[s] || 0) + 1, 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);
-    });
+  static isValidBracket(t) {
+    const e = [], s = {
+      "(": ")",
+      "[": "]",
+      "{": "}"
+    }, r = new Set(Object.values(s));
+    for (const i of t)
+      if (i in s)
+        e.push(s[i]);
+      else if (r.has(i) && i !== e.pop())
+        return !1;
+    return e.length === 0;
+  }
+  static random(t = 8) {
+    const e = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
+    let s = "";
+    for (let r = 0; r < t; r++)
+      s += e.charAt(Math.floor(Math.random() * e.length));
+    return s;
+  }
+  static template(t, e) {
+    return t.replace(/\${(\w+)}/g, (s, r) => e[r] || "");
+  }
+  static escapeHtml(t) {
+    const e = {
+      "&": "&amp;",
+      "<": "&lt;",
+      ">": "&gt;",
+      '"': "&quot;",
+      "'": "&apos;",
+      " ": "&nbsp;",
+      "±": "&plusmn;",
+      "×": "&times;",
+      "÷": "&divide;",
+      "≠": "&ne;",
+      "≤": "&le;",
+      "≥": "&ge;"
+    }, s = new RegExp(
+      `[${Object.keys(e).join("")}]`,
+      "g"
+    );
+    return t.replace(s, (r) => e[r]);
+  }
+  static isEmail(t) {
+    return /^[^\s@]+@[^\s@]+\.[^\s@]+$/.test(t);
+  }
+  static isUrl(t) {
+    try {
+      return new URL(t), !0;
+    } catch {
+      return !1;
+    }
+  }
+  constructor(t) {
+    super(t);
+  }
+  pointLength() {
+    let t = 0;
+    for (let e = 0, s = this.length; e < s; ) {
+      const r = this.codePointAt(e);
+      e += r > 65535 ? 2 : 1, t++;
+    }
+    return t;
+  }
+  pointAt(t) {
+    if (t >= this.pointLength()) return;
+    let e = 0;
+    for (let s = 0, r = this.length; s < r; ) {
+      const i = this.codePointAt(s);
+      if (!i) return;
+      if (e === t)
+        return String.fromCodePoint(i);
+      s += i > 65535 ? 2 : 1, e++;
+    }
+  }
+  sliceByPoint(t, e = this.pointLength()) {
+    let s = "";
+    for (let r = t; r < e; r++)
+      s += this.pointAt(r);
+    return s;
+  }
+  capitalize() {
+    return this.charAt(0).toUpperCase() + this.slice(1).toLowerCase();
+  }
+  reverse() {
+    return this.split("").reverse().join("");
+  }
+  truncate(t, e = "...") {
+    return this.length <= t ? this : this.slice(0, t - e.length) + e;
+  }
+  isPalindrome() {
+    return this.toLowerCase().replace(/[^a-z0-9]/g, "") === this.reverse();
+  }
+  count(t) {
+    const e = t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+    return (this.match(new RegExp(e, "g")) || []).length;
+  }
+  toCamelCase() {
+    return this.replace(/_([a-z])/g, (t, e) => e.toUpperCase());
+  }
+  toSnakeCase() {
+    return this.replace(/[A-Z]/g, (t) => `_${t.toLowerCase()}`);
   }
 }
-class Q {
+class Y {
   static isValidHex(t) {
     return /^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/.test(t);
   }
@@ -1057,20 +1323,7 @@ class Q {
     return /^rgb\((\d{1,3}),\s*(\d{1,3}),\s*(\d{1,3})\)$/.test(t);
   }
 }
-function K(r) {
-  let t;
-  const e = new Proxy(r, {
-    construct(s, i, n) {
-      return t || (t = Reflect.construct(
-        s,
-        i,
-        n
-      )), t;
-    }
-  });
-  return r.prototype.constructor = e, e;
-}
-const E = {
+const x = {
   AUTH_UNAUTHORIZED: "未授权事件",
   AUTH_LOGIN_SUCCESS: "登录成功事件",
   AUTH_LOGOUT: "注销事件",
@@ -1082,72 +1335,45 @@ const E = {
   UI_HIDE_LOADING: "隐藏加载事件",
   UI_SHOW_MESSAGE: "显示消息事件"
 };
-class I {
+class M {
   static instance = null;
   listeners = {};
   debugMode;
   constructor(t = !1) {
-    this.debugMode = t, Object.keys(E).forEach(
+    this.debugMode = t, Object.keys(x).forEach(
       (e) => {
         this.listeners[e] = /* @__PURE__ */ new Set();
       }
     );
   }
-  // 单例模式
   static getInstance(t) {
-    return I.instance || (I.instance = new I(t)), I.instance;
+    return M.instance || (M.instance = new M(t)), M.instance;
   }
-  /**
-   * 添加事件监听器
-   * @param event 事件名称
-   * @param listener 监听函数
-   */
   on(t, e) {
-    this.debugLog(`添加事件监听: ${E[t]}`), this.listeners[t].add(e);
+    this.debugLog(`添加事件监听: ${x[t]}`), this.listeners[t].add(e);
   }
-  /**
-   * 触发事件
-   * @param event 事件名称
-   * @param params 事件参数
-   */
   emit(t, e) {
-    this.debugLog(`触发事件: ${E[t]}`, e), this.listeners[t].forEach((s) => {
+    this.debugLog(`触发事件: ${x[t]}`, e), this.listeners[t].forEach((s) => {
       try {
         s(e);
-      } catch (i) {
-        console.error(`事件 ${E[t]} 处理出错:`, i);
+      } catch (r) {
+        console.error(`事件 ${x[t]} 处理出错:`, r);
       }
     });
   }
-  /**
-   * 移除事件监听器
-   * @param event 事件名称
-   * @param listener 监听函数
-   */
   off(t, e) {
-    this.debugLog(`移除事件监听: ${E[t]}`), this.listeners[t].delete(e);
+    this.debugLog(`移除事件监听: ${x[t]}`), this.listeners[t].delete(e);
   }
-  /**
-   * 添加一次性事件监听器
-   * @param event 事件名称
-   * @param listener 监听函数
-   */
   once(t, e) {
-    this.debugLog(`添加一次性事件监听: ${E[t]}`);
-    const s = (i) => {
-      e(i), this.off(t, s);
+    this.debugLog(`添加一次性事件监听: ${x[t]}`);
+    const s = (r) => {
+      e(r), this.off(t, s);
     };
     this.on(t, s);
   }
-  /**
-   * 清除所有事件监听器
-   */
   clear() {
     this.debugLog("清除所有事件监听器"), Object.values(this.listeners).forEach((t) => t.clear());
   }
-  /**
-   * 获取指定事件的监听器数量
-   */
   getListenerCount(t) {
     return this.listeners[t].size;
   }
@@ -1155,105 +1381,31 @@ class I {
     this.debugMode && console.log(`[EventEmitter] ${t}`, e || "");
   }
 }
-function Z(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 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;
-};
 export {
-  W as BitPerm,
-  Q as Color,
-  R as Dictionary,
-  I as Emitter,
-  $ as Graph,
-  F as LIS,
-  j as LRU,
+  _ as Arr,
+  J as BitPerm,
+  Y as Color,
+  S as DateEx,
+  V as Dictionary,
+  M as Emitter,
+  G as Func,
+  B as Graph,
+  F as LRU,
   g as Line,
-  U as LinkedList,
-  x as Matrix,
+  T as LinkedList,
+  I as Matrix,
   q as MaxHeap,
-  T as MemoizeMap,
-  O as MinHeap,
-  D as MinStack,
-  G as Num,
+  W as MemoizeMap,
+  L as MinHeap,
+  U as MinStack,
+  y as Num,
+  X as Obj,
   u as Point,
-  V as Queue,
-  B as Roman,
-  z as Stack,
-  X as Str,
+  H as Queue,
+  Q as Reg,
+  j as Roman,
+  D as Stack,
+  Z as Str,
   p as Triangle,
-  w as Vector,
-  Z as binarySearchTemplate,
-  H as isValidBracket,
-  K as singleton,
-  _ as sleep
+  w as Vector
 };