jc-structure 0.1.15 → 0.1.18

package/dist/jc-structure.js

@@ -1,4 +1,4 @@
-class j {
+class V {
   items = {};
   count = 0;
   lowestCount = 0;
@@ -12,13 +12,23 @@ class j {
   enqueue(...t) {
     if (t.length === 0)
       return this;
-    const e = t.length === 1 && Array.isArray(t[0]) ? t[0] : t;
-    return this.batchEnqueue(e), this;
+    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) {
-    t.forEach((e) => {
-      this.isValidItem(e) && (this.items[this.count] = e, this.count++);
-    });
+    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;
@@ -39,7 +49,7 @@ class j {
     return this.isEmpty() ? "" : `Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`;
   }
 }
-class U {
+class z {
   items = {};
   count = 0;
   constructor() {
@@ -50,8 +60,16 @@ class U {
     const t = this.items[this.count];
     return delete this.items[this.count], t;
   }
-  push(t) {
-    return t == null || t == null ? this : Array.isArray(t) ? this.addItems(t) : this.addItem(t);
+  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))
@@ -82,7 +100,7 @@ class U {
     return this.isEmpty() ? "" : `Stack(count: ${this.count}):[${this.items[this.count - 1]},...rest]`;
   }
 }
-class $ {
+class D {
   stack = [];
   minStack = [];
   push(t) {
@@ -111,13 +129,13 @@ class $ {
     return this.isEmpty() ? "" : `MinStack(count: ${this.size()}):[${this.getMin()},...rest]`;
   }
 }
-function k(r, t) {
+function P(r, t) {
   return r === t ? 0 : r < t ? -1 : 1;
 }
 class y {
   heap = [];
   compareFn;
-  constructor(t = k) {
+  constructor(t = P) {
     this.compareFn = t;
   }
   static getLeftIndex(t) {
@@ -169,14 +187,14 @@ class O extends y {
   }
 }
 class q extends O {
-  constructor(t = (e, s) => k(s, e)) {
+  constructor(t = (e, s) => P(s, e)) {
     super(t);
   }
 }
-function R(r) {
+function L(r) {
   return { value: r };
 }
-class D {
+class j {
   capacity;
   length = 0;
   head = null;
@@ -206,14 +224,14 @@ class D {
   }
   update(t, e) {
     let s = this.lookup.get(t);
-    s ? (this.detach(s), this.prepend(s), s.value = e) : (s = R(e), this.length++, this.prepend(s), this.trimCache(), this.lookup.set(t, s), this.reverseLookup);
+    s ? (this.detach(s), this.prepend(s), s.value = e) : (s = L(e), this.length++, this.prepend(s), this.trimCache(), this.lookup.set(t, s), this.reverseLookup);
   }
 }
-let A = class {
+class S {
   value;
   next = void 0;
-};
-class H {
+}
+class U {
   count = 0;
   head = void 0;
   constructor() {
@@ -246,7 +264,7 @@ class H {
     return this.getElementAt(t)?.value;
   }
   insert(t, e) {
-    let s = new A();
+    let s = new S();
     if (s.value = t, e > this.count || e < 0)
       throw new Error("index error");
     this.count++;
@@ -258,7 +276,7 @@ class H {
     i = this.getElementAt(e - 1), n = i.next, i.next = s, s.next = n;
   }
   push(t) {
-    let e = new A();
+    let e = new S();
     if (e.value = t, this.count++, this.isEmpty()) {
       this.head = e;
       return;
@@ -292,17 +310,17 @@ class H {
     return t = t.slice(0, -1), t;
   }
 }
-class V {
+class C {
   key;
   value;
   constructor(t, e) {
     this.key = t, this.value = e;
   }
 }
-function P(r, t = { emptyString: !1, zeroNumber: !1 }) {
+function M(r, t = { emptyString: !1, zeroNumber: !1 }) {
   return r == null ? !(t.emptyString && r === "" || t.zeroNumber && r === 0) : !1;
 }
-class z {
+class R {
   table = [];
   constructor() {
   }
@@ -313,15 +331,15 @@ class z {
     return -1;
   }
   set(t, e) {
-    if (P(t))
+    if (M(t))
       throw new Error("key is required");
-    if (P(e))
+    if (M(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 V(t, e);
+      const s = new C(t, e);
       this.table.push(s);
     }
   }
@@ -372,12 +390,12 @@ class z {
     return t = t.slice(0, -1), t;
   }
 }
-class W {
+class $ {
   isDirected;
   vertices;
   adjList;
   constructor(t = !1) {
-    this.isDirected = t, this.vertices = [], this.adjList = new z();
+    this.isDirected = t, this.vertices = [], this.adjList = new R();
   }
   addVertex(t) {
     this.vertices.includes(t) || (this.vertices.push(t), this.adjList.set(t, []));
@@ -457,13 +475,22 @@ class w {
     return this.mul(-1);
   }
 }
-class E {
+class x {
   _matrix;
   static zero(t, e) {
-    return new E(
+    return new x(
       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;
   }
@@ -492,7 +519,7 @@ class E {
     return this._matrix[t[0]][t[1]] = e, this;
   }
   mul(t) {
-    return new E(this._matrix.map((e) => e.map((s) => s * t)));
+    return new x(this._matrix.map((e) => e.map((s) => s * t)));
   }
   div(t) {
     return this.mul(1 / t);
@@ -500,7 +527,7 @@ class E {
   add(t) {
     if (this.row !== t.row || this.col !== t.col)
       throw new Error("Matrix dimensions do not match");
-    return new E(
+    return new x(
       this._matrix.map(
         (e, s) => e.map((i, n) => i + t.getItem([s, n]))
       )
@@ -518,14 +545,14 @@ class E {
   mulVector(t) {
     if (this.col !== t.dimension)
       throw new Error("Matrix dimensions do not match");
-    return new E(
+    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 = E.zero(this.row, t.col);
+    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++)
@@ -534,7 +561,7 @@ class E {
     return e;
   }
 }
-class c {
+class u {
   static distance(t, e) {
     return Math.hypot(e.x - t.x, e.y - t.y);
   }
@@ -544,42 +571,42 @@ class c {
     this.x = t, this.y = e;
   }
   distanceTo(t) {
-    return c.distance(this, t);
+    return u.distance(this, t);
   }
 }
-class m {
+class g {
   // 使用更合适的精度阈值常量
   static EPSILON = 1e-10;
-  static sloped(t, e = m.EPSILON) {
+  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;
   }
-  static isParallel(t, e, s = m.EPSILON) {
-    const i = m.sloped(t), n = m.sloped(e);
+  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;
   }
-  static getIntersection(t, e, s = m.EPSILON) {
-    if (m.isParallel(t, e)) return null;
-    const i = t.p1.x, n = t.p1.y, a = t.p2.x, h = t.p2.y, u = e.p1.x, f = e.p1.y, g = e.p2.x, o = e.p2.y, l = (i - a) * (f - o) - (n - h) * (u - g);
+  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 - u) * (f - o) - (n - f) * (u - g)) / l, S = -((i - a) * (n - f) - (n - h) * (i - u)) / l;
-    if (d >= 0 && d <= 1 && S >= 0 && S <= 1) {
-      const C = i + d * (a - i), L = n + d * (h - n);
-      return new c(C, L);
+    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);
     }
     return null;
   }
   static isIntersecting(t, e) {
-    return m.getIntersection(t, e) !== null;
+    return g.getIntersection(t, e) !== null;
   }
-  static distanceToPoint(t, e, s = m.EPSILON) {
-    const i = e.x - t.p1.x, n = e.y - t.p1.y, a = t.p2.x - t.p1.x, h = t.p2.y - t.p1.y, u = i * a + n * h, f = a * a + h * h;
-    let g = -1;
-    f > s && (g = u / f);
-    let o, l;
-    g < 0 ? (o = t.p1.x, l = t.p1.y) : g > 1 ? (o = t.p2.x, l = t.p2.y) : (o = t.p1.x + g * a, l = t.p1.y + g * h);
-    const d = e.x - o, S = e.y - l;
-    return Math.hypot(d + S);
+  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);
   }
   p1;
   p2;
@@ -592,21 +619,21 @@ class m {
   }
   get midpoint() {
     const t = (this.p1.x + this.p2.x) / 2, e = (this.p1.y + this.p2.y) / 2;
-    return new c(t, e);
+    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 = m.EPSILON) {
+  containsPoint(t, e = g.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 < m.EPSILON) return new c(0, 0);
+    if (t < g.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 c(e, s);
+    return new u(e, s);
   }
   get start() {
     return this.p1;
@@ -615,14 +642,14 @@ class m {
     return this.p2;
   }
 }
-class N {
+class A {
   static EPSILON = 1e-10;
   name;
   constructor(t) {
     this.name = t;
   }
 }
-class p extends N {
+class p extends A {
   static isValid(t, e, s) {
     return t <= 0 || e <= 0 || s <= 0 ? !1 : t + e > s && t + s > e && e + s > t;
   }
@@ -635,14 +662,14 @@ class p extends N {
   static getType(t, e, s) {
     if (!p.isValid(t, e, s))
       throw new Error("Invalid triangle sides");
-    const i = [t, e, s].sort((u, f) => u - f), [n, a, h] = i;
-    return Math.abs(n - a) < p.EPSILON && Math.abs(a - h) < p.EPSILON ? "equilateral" : Math.abs(n - a) < p.EPSILON || Math.abs(a - h) < p.EPSILON ? "isosceles" : "scalene";
+    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";
   }
   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)), a = Math.PI - i - n;
-    return [i, n, a];
+    const i = Math.acos((e * e + s * s - t * t) / (2 * e * s)), n = Math.acos((t * t + s * s - e * e) / (2 * t * s)), h = Math.PI - i - n;
+    return [i, n, h];
   }
   p1;
   p2;
@@ -655,13 +682,13 @@ class p extends N {
   areCollinear() {
     return Math.abs(
       (this.p2.x - this.p1.x) * (this.p3.y - this.p1.y) - (this.p3.x - this.p1.x) * (this.p2.y - this.p1.y)
-    ) < N.EPSILON;
+    ) < A.EPSILON;
   }
   get side() {
     return [
-      c.distance(this.p1, this.p2),
-      c.distance(this.p2, this.p3),
-      c.distance(this.p3, this.p1)
+      u.distance(this.p1, this.p2),
+      u.distance(this.p2, this.p3),
+      u.distance(this.p3, this.p1)
     ];
   }
   perimeter() {
@@ -680,43 +707,43 @@ class p extends N {
     return p.getAngles(t, e, s);
   }
   get centroid() {
-    return new c(
+    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 c(n, a);
+    const [t, e, s] = this.side, i = this.perimeter() / 2, n = (t * this.p1.x + e * this.p2.x + s * this.p3.x) / i, 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 c(e, s);
+    return new u(e, s);
   }
   containsPoint(t) {
     const e = p.area(
-      c.distance(t, this.p1),
-      c.distance(t, this.p2),
-      c.distance(this.p1, this.p2)
+      u.distance(t, this.p1),
+      u.distance(t, this.p2),
+      u.distance(this.p1, this.p2)
     ), s = p.area(
-      c.distance(t, this.p2),
-      c.distance(t, this.p3),
-      c.distance(this.p2, this.p3)
+      u.distance(t, this.p2),
+      u.distance(t, this.p3),
+      u.distance(this.p2, this.p3)
     ), i = p.area(
-      c.distance(t, this.p3),
-      c.distance(t, this.p1),
-      c.distance(this.p3, this.p1)
+      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 T(r) {
+function _(r) {
   return new Promise((t) => setTimeout(t, r));
 }
-function F(r) {
+function H(r) {
   const t = [], e = {
     "(": ")",
     "[": "]",
@@ -729,23 +756,23 @@ function F(r) {
       return !1;
   return t.length === 0;
 }
-function M(r) {
+function b(r) {
   return r !== null && (typeof r == "object" || typeof r == "function");
 }
-class B {
+class T {
   map = /* @__PURE__ */ new Map();
   weakMap = /* @__PURE__ */ new WeakMap();
   set(t, e) {
-    M(t) ? this.weakMap.set(t, e) : this.map.set(t, e);
+    b(t) ? this.weakMap.set(t, e) : this.map.set(t, e);
   }
   get(t) {
-    return M(t) ? this.weakMap.get(t) : this.map.get(t);
+    return b(t) ? this.weakMap.get(t) : this.map.get(t);
   }
   has(t) {
-    return M(t) ? this.weakMap.has(t) : this.map.has(t);
+    return b(t) ? this.weakMap.has(t) : this.map.has(t);
   }
 }
-function G(r) {
+function F(r) {
   if (!r.length) return [];
   const t = [[r[0]]];
   for (let s = 1, i = r.length; s < i; s++) {
@@ -754,16 +781,16 @@ function G(r) {
   }
   function e(s) {
     for (let i = t.length - 1; i >= 0; i--) {
-      const n = t[i], a = n[t[i].length - 1];
-      if (a < s) {
+      const n = t[i], h = n[t[i].length - 1];
+      if (h < s) {
         t[i + 1] = [...n, s];
         break;
-      } else a > s && i === 0 && (t[i] = [s]);
+      } else h > s && i === 0 && (t[i] = [s]);
     }
   }
   return t[t.length - 1];
 }
-class X {
+class B {
   static ROMAN_MAP = /* @__PURE__ */ new Map([
     ["M", 1e3],
     ["CM", 900],
@@ -783,19 +810,19 @@ class X {
     if (t.length === 0)
       throw new Error("Input cannot be empty");
     const e = /* @__PURE__ */ new Set(["I", "V", "X", "L", "C", "D", "M"]);
-    for (const a of t)
-      if (!e.has(a))
-        throw new Error(`Invalid Roman numeral character: ${a}`);
+    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 a = t.slice(i, i + 2);
-      if (this.ROMAN_MAP.has(a))
-        s += this.ROMAN_MAP.get(a), i += 2;
+      const h = t.slice(i, i + 2);
+      if (this.ROMAN_MAP.has(h))
+        s += this.ROMAN_MAP.get(h), i += 2;
       else {
-        const h = t[i], u = this.ROMAN_MAP.get(h);
-        if (!u)
+        const o = t[i], c = this.ROMAN_MAP.get(o);
+        if (!c)
           throw new Error(`Invalid Roman numeral sequence at position ${i}`);
-        s += u, i += 1;
+        s += c, i += 1;
       }
     }
     if (this.toRoman(s) !== t)
@@ -814,7 +841,7 @@ class X {
     return e;
   }
 }
-class Q {
+class G {
   static isValidPositiveInteger(t) {
     return Number.isInteger(t) && t > 0 && t <= Number.MAX_SAFE_INTEGER;
   }
@@ -840,31 +867,30 @@ class Q {
     return t < 2 ? s : this.fibonacci(t - 1, s, s + e);
   }
   static fibonacciIterative(t) {
-    if (!this.isValidPositiveInteger(t))
-      throw new Error("Input must be a non-negative integer");
-    let e = 1, s = 1;
+    if (t < 2) return t;
+    let e = 0, s = 1;
     for (let i = 2; i < t; i++)
-      [e, s] = [s, e + s];
-    return t === 0 ? 0 : s;
+      [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, l) => o + l, 0);
+    const s = t.reduce((a, l) => a + l, 0);
     if (s === 0)
       return t.map(() => "0%");
-    const n = 100 * Math.pow(10, e), a = t.map((o) => o / s * n), h = a.map((o) => Math.floor(o)), u = a.map((o, l) => o - h[l]);
-    let f = h.reduce((o, l) => o + l, 0), g = n - f;
-    for (; g > 0; ) {
-      let o = -1, l = -1;
-      for (let d = 0; d < u.length; d++)
-        u[d] > l && (l = u[d], o = d);
-      if (o === -1) break;
-      h[o]++, u[o] = 0, g--;
+    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--;
     }
-    return h.map((o) => `${(o / n * 100).toFixed(e)}%`);
+    return o.map((a) => `${(a / n * 100).toFixed(e)}%`);
   }
   static fastSqrt(t) {
     if (t < 0)
@@ -875,9 +901,6 @@ class Q {
     let i = new Float64Array(new BigInt64Array([s]).buffer)[0];
     return i = i * 0.5 + e / i, i = i * 0.5 + e / i, i = i * 0.5 + e / i, i;
   }
-  static middle(t, e) {
-    return e - (e - t >> 1);
-  }
   static gcd(t, e) {
     return e === 0 ? t : this.gcd(e, t % e);
   }
@@ -909,20 +932,55 @@ class Q {
       i += Math.pow(parseInt(e[n]), s);
     return i === 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);
+    }
+    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(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;
@@ -930,8 +988,33 @@ class Q {
   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 K {
+class W {
   static READ = 1;
   static WRITE = 2;
   static SHARE = 4;
@@ -950,7 +1033,7 @@ class K {
     return t ^ e;
   }
 }
-class Z {
+class X {
   static longestCommonPrefix(t) {
     if (!t.length) return "";
     let e = t[0];
@@ -966,7 +1049,7 @@ class Z {
     });
   }
 }
-class J {
+class Q {
   static isValidHex(t) {
     return /^#([A-Fa-f0-9]{6}|[A-Fa-f0-9]{3})$/.test(t);
   }
@@ -974,7 +1057,7 @@ class J {
     return /^rgb\((\d{1,3}),\s*(\d{1,3}),\s*(\d{1,3})\)$/.test(t);
   }
 }
-function Y(r) {
+function K(r) {
   let t;
   const e = new Proxy(r, {
     construct(s, i, n) {
@@ -987,7 +1070,7 @@ function Y(r) {
   });
   return r.prototype.constructor = e, e;
 }
-const x = {
+const E = {
   AUTH_UNAUTHORIZED: "未授权事件",
   AUTH_LOGIN_SUCCESS: "登录成功事件",
   AUTH_LOGOUT: "注销事件",
@@ -1004,7 +1087,7 @@ class I {
   listeners = {};
   debugMode;
   constructor(t = !1) {
-    this.debugMode = t, Object.keys(x).forEach(
+    this.debugMode = t, Object.keys(E).forEach(
       (e) => {
         this.listeners[e] = /* @__PURE__ */ new Set();
       }
@@ -1020,7 +1103,7 @@ class I {
    * @param listener 监听函数
    */
   on(t, e) {
-    this.debugLog(`添加事件监听: ${x[t]}`), this.listeners[t].add(e);
+    this.debugLog(`添加事件监听: ${E[t]}`), this.listeners[t].add(e);
   }
   /**
    * 触发事件
@@ -1028,11 +1111,11 @@ class I {
    * @param params 事件参数
    */
   emit(t, e) {
-    this.debugLog(`触发事件: ${x[t]}`, e), this.listeners[t].forEach((s) => {
+    this.debugLog(`触发事件: ${E[t]}`, e), this.listeners[t].forEach((s) => {
       try {
         s(e);
       } catch (i) {
-        console.error(`事件 ${x[t]} 处理出错:`, i);
+        console.error(`事件 ${E[t]} 处理出错:`, i);
       }
     });
   }
@@ -1042,7 +1125,7 @@ class I {
    * @param listener 监听函数
    */
   off(t, e) {
-    this.debugLog(`移除事件监听: ${x[t]}`), this.listeners[t].delete(e);
+    this.debugLog(`移除事件监听: ${E[t]}`), this.listeners[t].delete(e);
   }
   /**
    * 添加一次性事件监听器
@@ -1050,7 +1133,7 @@ class I {
    * @param listener 监听函数
    */
   once(t, e) {
-    this.debugLog(`添加一次性事件监听: ${x[t]}`);
+    this.debugLog(`添加一次性事件监听: ${E[t]}`);
     const s = (i) => {
       e(i), this.off(t, s);
     };
@@ -1072,231 +1155,11 @@ class I {
     this.debugMode && console.log(`[EventEmitter] ${t}`, e || "");
   }
 }
-const b = {
-  scriptRegex: /<script\b[^<]*(?:(?!<\/script>)<[^<]*)*<\/script>/gi,
-  javascriptRegex: /javascript:/gi,
-  eventHandlerRegex: /on\w+\s*=/gi,
-  allowedTags: /* @__PURE__ */ new Set([
-    "div",
-    "span",
-    "p",
-    "a",
-    "img",
-    "button",
-    "input",
-    "form",
-    "label",
-    "select",
-    "option",
-    "textarea",
-    "ul",
-    "ol",
-    "li",
-    "table",
-    "tr",
-    "td",
-    "th",
-    "thead",
-    "tbody",
-    "tfoot",
-    "h1",
-    "h2",
-    "h3",
-    "h4",
-    "h5",
-    "h6",
-    "hr",
-    "br",
-    "section",
-    "article",
-    "nav",
-    "header",
-    "footer",
-    "main",
-    "aside",
-    "figure",
-    "figcaption"
-  ]),
-  allowedAttributes: /* @__PURE__ */ new Set(["class", "id", "href", "src", "alt", "title"])
-};
-class v {
-  static instance;
-  constructor() {
-  }
-  static getInstance() {
-    return v.instance || (v.instance = new v()), v.instance;
-  }
-  /**
-   * 创建DOM元素
-   * @param tagName 标签名
-   * @param attributes 属性对象
-   * @param content 元素内容
-   * @returns 创建的HTMLElement
-   */
-  createElement(t, e = {}, s = "") {
-    if (!b.allowedTags.has(t.toLowerCase()))
-      throw new Error(`Unsupported tag: ${t}`);
-    const i = document.createElement(t);
-    return this._processAttributes(i, e), this._processContent(i, s), i;
-  }
-  /**
-   * 批量创建元素
-   * @param items 元素配置数组
-   * @param container 容器元素
-   */
-  createBatch(t, e) {
-    const s = document.createDocumentFragment();
-    t.forEach((i) => {
-      const n = this.createElement(
-        i.tag,
-        i.attributes || {},
-        i.content || ""
-      );
-      s.appendChild(n);
-    }), e.appendChild(s);
-  }
-  /**
-   * 安全地设置HTML内容
-   * @param element 目标元素
-   * @param html HTML字符串
-   */
-  setHtml(t, e) {
-    const s = this._sanitizeHtml(e);
-    t.innerHTML = s;
-  }
-  /**
-   * 处理元素属性
-   * @private
-   */
-  _processAttributes(t, e) {
-    Object.entries(e).forEach(([s, i]) => {
-      if (!b.allowedAttributes.has(s) && !s.startsWith("data-")) {
-        console.warn(`Potentially unsafe attribute: ${s}`);
-        return;
-      }
-      if (typeof i == "function")
-        s.startsWith("on") && t.addEventListener(
-          s.slice(2).toLowerCase(),
-          i
-        );
-      else
-        switch (s) {
-          case "className":
-            t.className = i;
-            break;
-          case "dataset":
-            Object.assign(t.dataset, i);
-            break;
-          case "style":
-            Object.assign(t.style, i);
-            break;
-          default:
-            t.setAttribute(s, i);
-        }
-    });
-  }
-  /**
-   * 处理元素内容
-   * @private
-   */
-  _processContent(t, e) {
-    typeof e == "string" ? t.textContent = e : e instanceof Node ? t.appendChild(e) : Array.isArray(e) && e.forEach((s) => {
-      typeof s == "string" ? t.appendChild(document.createTextNode(s)) : t.appendChild(s);
-    });
-  }
-  /**
-   * 清理HTML字符串
-   * @private
-   */
-  _sanitizeHtml(t) {
-    return t.replace(b.scriptRegex, "").replace(b.javascriptRegex, "").replace(b.eventHandlerRegex, "");
-  }
-}
-class tt {
-  features;
-  constructor() {
-    this.features = this.detectFeatures();
-  }
-  detectFeatures() {
-    return {
-      geolocation: "geolocation" in navigator,
-      notification: "Notification" in window,
-      serviceWorker: "serviceWorker" in navigator,
-      webShare: "share" in navigator,
-      deviceOrientation: "DeviceOrientationEvent" in window,
-      battery: "getBattery" in navigator,
-      online: "onLine" in navigator
-    };
-  }
-  async getLocation(t = {}) {
-    if (!this.features.geolocation)
-      throw new Error("Geolocation is not supported");
-    const e = {
-      enableHighAccuracy: !0,
-      timeout: 10 * 1e3,
-      maximumAge: 300 * 1e3
-    };
-    return new Promise((s, i) => {
-      navigator.geolocation.getCurrentPosition(
-        (n) => s({
-          latitude: n.coords.latitude,
-          longitude: n.coords.longitude,
-          accuracy: n.coords.accuracy,
-          timstamp: n.timestamp
-        }),
-        (n) => {
-          const a = {
-            1: "User denied the request for Geolocation.",
-            2: "Position information is unavailable.",
-            3: "The request to get user location timed out."
-          };
-          i(new Error(a[n.code] || "Unknown error"));
-        },
-        { ...e, ...t }
-      );
-    });
-  }
-  async sendNotification(t, e) {
-    if (!this.features.notification)
-      throw new Error("Notification is not supported");
-    if (Notification.permission === "default" && await Notification.requestPermission() !== "granted")
-      throw new Error("Notification permission is not granted");
-    if (Notification.permission !== "granted")
-      throw new Error("Notification permission is not granted");
-    return new Notification(t, {
-      icon: e.icon,
-      badge: e.badge,
-      ...e
-    });
-  }
-  async registerServiceWorker(t) {
-    if (!this.features.serviceWorker)
-      throw new Error("Service Worker is not supported");
-    try {
-      const e = await navigator.serviceWorker.register(t);
-      return console.log("Service Worker registered with scope:", e), e;
-    } catch (e) {
-      throw console.error("Service Worker registration failed:", e), e;
-    }
-  }
-  async shareContent(t) {
-    if (this.features.webShare)
-      try {
-        return await navigator.share(t), !0;
-      } catch (e) {
-        return e instanceof Error && e.name != "AbortError" && console.error("Error sharing content:", e), !1;
-      }
-    else
-      try {
-        return await navigator.clipboard.writeText(
-          t.url || t.text || ""
-        ), this.sendNotification("Copied to clipboard", {
-          body: "Link copied to clipboard"
-        }), !0;
-      } catch (e) {
-        return console.error("Error copying to clipboard:", e), !1;
-      }
-  }
+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;
@@ -1359,39 +1222,38 @@ Object.defineProperties(Element.prototype, {
 });
 Text.prototype.surround = function(r = "strong", t = "") {
   if (!this.nodeValue || !r || !t) return null;
-  const s = r.split("."), i = s[0], n = s.slice(1).join(" "), a = this.textContent.indexOf(t);
-  if (a < 0) return null;
-  const h = document.createRange();
-  h.setStart(this, a), h.setEnd(this, a + t.length);
-  const u = document.createElement(i);
-  return n && (u.className = n), h.surroundContents(u), u;
+  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 {
-  K as BitPerm,
-  J as Color,
-  z as Dictionary,
-  v as DomHelper,
+  W as BitPerm,
+  Q as Color,
+  R as Dictionary,
   I as Emitter,
-  W as Graph,
-  G as LIS,
-  D as LRU,
-  m as Line,
-  H as LinkedList,
-  E as Matrix,
+  $ as Graph,
+  F as LIS,
+  j as LRU,
+  g as Line,
+  U as LinkedList,
+  x as Matrix,
   q as MaxHeap,
-  B as MemoizeMap,
+  T as MemoizeMap,
   O as MinHeap,
-  $ as MinStack,
-  Q as Num,
-  c as Point,
-  j as Queue,
-  X as Roman,
-  U as Stack,
-  Z as Str,
+  D as MinStack,
+  G as Num,
+  u as Point,
+  V as Queue,
+  B as Roman,
+  z as Stack,
+  X as Str,
   p as Triangle,
   w as Vector,
-  tt as WebAppManager,
-  F as isValidBracket,
-  Y as singleton,
-  T as sleep
+  Z as binarySearchTemplate,
+  H as isValidBracket,
+  K as singleton,
+  _ as sleep
 };