jc-structure 0.1.14 → 0.1.17

package/dist/jc-structure.js

@@ -12,13 +12,23 @@ class V {
   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 V {
     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 C(r, t) {
+function P(r, t) {
   return r === t ? 0 : r < t ? -1 : 1;
 }
 class w {
   heap = [];
   compareFn;
-  constructor(t = C) {
+  constructor(t = P) {
     this.compareFn = t;
   }
   static getLeftIndex(t) {
@@ -148,7 +166,7 @@ class w {
     return this.heap.toString();
   }
 }
-class P extends w {
+class O extends w {
   insert(t) {
     return t ? !1 : (this.heap.push(t), this.siftUp(this.heap.length - 1), !0);
   }
@@ -168,15 +186,15 @@ class P extends w {
       w.swap(this.heap, e, t), t = e, e = w.getParentIndex(t);
   }
 }
-class q extends P {
-  constructor(t = (e, s) => C(s, e)) {
+class q extends O {
+  constructor(t = (e, s) => P(s, e)) {
     super(t);
   }
 }
-function R(r) {
+function L(r) {
   return { value: r };
 }
-class _ {
+class j {
   capacity;
   length = 0;
   head = null;
@@ -206,14 +224,14 @@ class _ {
   }
   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 v {
   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 v();
     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 v();
     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 z {
+class C {
   key;
   value;
   constructor(t, e) {
     this.key = t, this.value = e;
   }
 }
-function L(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 j {
+class R {
   table = [];
   constructor() {
   }
@@ -313,15 +331,15 @@ class j {
     return -1;
   }
   set(t, e) {
-    if (L(t))
+    if (M(t))
       throw new Error("key is required");
-    if (L(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 z(t, e);
+      const s = new C(t, e);
       this.table.push(s);
     }
   }
@@ -372,12 +390,12 @@ class j {
     return t = t.slice(0, -1), t;
   }
 }
-class W {
+class $ {
   isDirected;
   vertices;
   adjList;
   constructor(t = !1) {
-    this.isDirected = t, this.vertices = [], this.adjList = new j();
+    this.isDirected = t, this.vertices = [], this.adjList = new R();
   }
   addVertex(t) {
     this.vertices.includes(t) || (this.vertices.push(t), this.adjList.set(t, []));
@@ -399,10 +417,10 @@ class W {
     return t;
   }
 }
-class g {
+class y {
   _data;
   static zero(t) {
-    return new g(...Array(t).fill(0));
+    return new y(...Array(t).fill(0));
   }
   constructor(...t) {
     this._data = t;
@@ -421,7 +439,7 @@ class g {
     if (t === 0)
       throw new Error("Cannot normalize a zero vector");
     const e = this._data.map((s) => s / t);
-    return new g(...e);
+    return new y(...e);
   }
   add(t) {
     if (this.dimension !== t.dimension)
@@ -429,7 +447,7 @@ class g {
     const e = this._data.map(
       (s, i) => s + t._data[i]
     );
-    return new g(...e);
+    return new y(...e);
   }
   sub(t) {
     if (this.dimension !== t.dimension)
@@ -437,10 +455,10 @@ class g {
     const e = this._data.map(
       (s, i) => s - t._data[i]
     );
-    return new g(...e);
+    return new y(...e);
   }
   mul(t) {
-    return new g(...this._data.map((e) => e * t));
+    return new y(...this._data.map((e) => e * t));
   }
   dot(t) {
     if (this.dimension !== t.dimension)
@@ -480,10 +498,10 @@ class E {
     return this.row * this.col;
   }
   rowVector(t) {
-    return new g(...this._matrix[t]);
+    return new y(...this._matrix[t]);
   }
   colVector(t) {
-    return new g(...this._matrix.map((e) => e[t]));
+    return new y(...this._matrix.map((e) => e[t]));
   }
   getItem(t) {
     return this._matrix[t[0]][t[1]];
@@ -534,7 +552,7 @@ class E {
     return e;
   }
 }
-class a {
+class u {
   static distance(t, e) {
     return Math.hypot(e.x - t.x, e.y - t.y);
   }
@@ -544,42 +562,42 @@ class a {
     this.x = t, this.y = e;
   }
   distanceTo(t) {
-    return a.distance(this, t);
+    return u.distance(this, t);
   }
 }
-class l {
+class g {
   // 使用更合适的精度阈值常量
   static EPSILON = 1e-10;
-  static sloped(t, e = l.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 = l.EPSILON) {
-    const i = l.sloped(t), n = l.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 = l.EPSILON) {
-    if (l.isParallel(t, e)) return null;
-    const i = t.p1.x, n = t.p1.y, o = t.p2.x, h = t.p2.y, u = e.p1.x, p = e.p1.y, d = e.p2.x, m = e.p2.y, f = (i - o) * (p - m) - (n - h) * (u - d);
-    if (Math.abs(f) < s) return null;
-    const y = ((i - u) * (p - m) - (n - p) * (u - d)) / f, S = -((i - o) * (n - p) - (n - h) * (i - u)) / f;
-    if (y >= 0 && y <= 1 && S >= 0 && S <= 1) {
-      const N = i + y * (o - i), O = n + y * (h - n);
-      return new a(N, O);
+  static getIntersection(t, e, s = 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);
     }
     return null;
   }
   static isIntersecting(t, e) {
-    return l.getIntersection(t, e) !== null;
+    return g.getIntersection(t, e) !== null;
   }
-  static distanceToPoint(t, e, s = l.EPSILON) {
-    const i = e.x - t.p1.x, n = e.y - t.p1.y, o = t.p2.x - t.p1.x, h = t.p2.y - t.p1.y, u = i * o + n * h, p = o * o + h * h;
-    let d = -1;
-    p > s && (d = u / p);
-    let m, f;
-    d < 0 ? (m = t.p1.x, f = t.p1.y) : d > 1 ? (m = t.p2.x, f = t.p2.y) : (m = t.p1.x + d * o, f = t.p1.y + d * h);
-    const y = e.x - m, S = e.y - f;
-    return Math.hypot(y + S);
+  static distanceToPoint(t, e, s = 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, S = e.y - l;
+    return Math.hypot(d + S);
   }
   p1;
   p2;
@@ -592,21 +610,21 @@ class l {
   }
   get midpoint() {
     const t = (this.p1.x + this.p2.x) / 2, e = (this.p1.y + this.p2.y) / 2;
-    return new a(t, e);
+    return new u(t, e);
   }
   get angle() {
     return Math.atan2(this.p2.y - this.p1.y, this.p2.x - this.p1.x);
   }
-  containsPoint(t, e = l.EPSILON) {
+  containsPoint(t, e = 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 < l.EPSILON) return new a(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 a(e, s);
+    return new u(e, s);
   }
   get start() {
     return this.p1;
@@ -615,34 +633,34 @@ class l {
     return this.p2;
   }
 }
-class k {
+class A {
   static EPSILON = 1e-10;
   name;
   constructor(t) {
     this.name = t;
   }
 }
-class c extends k {
+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;
   }
   static area(t, e, s) {
-    if (!c.isValid(t, e, s))
+    if (!p.isValid(t, e, s))
       throw new Error("Invalid triangle");
     const i = (t + e + s) / 2;
     return Math.sqrt(i * (i - t) * (i - e) * (i - s));
   }
   static getType(t, e, s) {
-    if (!c.isValid(t, e, s))
+    if (!p.isValid(t, e, s))
       throw new Error("Invalid triangle sides");
-    const i = [t, e, s].sort((u, p) => u - p), [n, o, h] = i;
-    return Math.abs(n - o) < c.EPSILON && Math.abs(o - h) < c.EPSILON ? "equilateral" : Math.abs(n - o) < c.EPSILON || Math.abs(o - h) < c.EPSILON ? "isosceles" : "scalene";
+    const i = [t, e, s].sort((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 (!c.isValid(t, e, s))
+    if (!p.isValid(t, e, s))
       throw new Error("Invalid triangle sides");
-    const i = Math.acos((e * e + s * s - t * t) / (2 * e * s)), n = Math.acos((t * t + s * s - e * e) / (2 * t * s)), o = Math.PI - i - n;
-    return [i, n, o];
+    const i = Math.acos((e * e + s * s - t * t) / (2 * e * s)), n = Math.acos((t * t + s * s - e * e) / (2 * t * s)), h = Math.PI - i - n;
+    return [i, n, h];
   }
   p1;
   p2;
@@ -655,68 +673,68 @@ class c extends k {
   areCollinear() {
     return Math.abs(
       (this.p2.x - this.p1.x) * (this.p3.y - this.p1.y) - (this.p3.x - this.p1.x) * (this.p2.y - this.p1.y)
-    ) < k.EPSILON;
+    ) < A.EPSILON;
   }
   get side() {
     return [
-      a.distance(this.p1, this.p2),
-      a.distance(this.p2, this.p3),
-      a.distance(this.p3, this.p1)
+      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);
+    return p.isValid(this.side[0], this.side[1], this.side[2]), this.side.reduce((t, e) => t + e, 0);
   }
   area() {
     const [t, e, s] = this.side;
-    return c.area(t, e, s);
+    return p.area(t, e, s);
   }
   get type() {
     const [t, e, s] = this.side;
-    return c.getType(t, e, s);
+    return p.getType(t, e, s);
   }
   get angles() {
     const [t, e, s] = this.side;
-    return c.getAngles(t, e, s);
+    return p.getAngles(t, e, s);
   }
   get centroid() {
-    return new a(
+    return new 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, o = (t * this.p1.y + e * this.p2.y + s * this.p3.y) / i;
-    return new a(n, o);
+    const [t, e, s] = this.side, i = this.perimeter() / 2, n = (t * this.p1.x + e * this.p2.x + s * this.p3.x) / i, 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) < c.EPSILON)
+    if (Math.abs(t) < p.EPSILON)
       throw new Error("Cannot calculate circumcenter for collinear points");
     const e = ((this.p1.x * this.p1.x + this.p1.y * this.p1.y) * (this.p2.y - this.p3.y) + (this.p2.x * this.p2.x + this.p2.y * this.p2.y) * (this.p3.y - this.p1.y) + (this.p3.x * this.p3.x + this.p3.y * this.p3.y) * (this.p1.y - this.p2.y)) / t, s = ((this.p1.x * this.p1.x + this.p1.y * this.p1.y) * (this.p3.x - this.p2.x) + (this.p2.x * this.p2.x + this.p2.y * this.p2.y) * (this.p1.x - this.p3.x) + (this.p3.x * this.p3.x + this.p3.y * this.p3.y) * (this.p2.x - this.p1.x)) / t;
-    return new a(e, s);
+    return new u(e, s);
   }
   containsPoint(t) {
-    const e = c.area(
-      a.distance(t, this.p1),
-      a.distance(t, this.p2),
-      a.distance(this.p1, this.p2)
-    ), s = c.area(
-      a.distance(t, this.p2),
-      a.distance(t, this.p3),
-      a.distance(this.p2, this.p3)
-    ), i = c.area(
-      a.distance(t, this.p3),
-      a.distance(t, this.p1),
-      a.distance(this.p3, this.p1)
+    const e = p.area(
+      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()) < c.EPSILON;
+    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 +747,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 G {
+class F {
   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 B(r) {
+function T(r) {
   if (!r.length) return [];
   const t = [[r[0]]];
   for (let s = 1, i = r.length; s < i; s++) {
@@ -754,16 +772,16 @@ function B(r) {
   }
   function e(s) {
     for (let i = t.length - 1; i >= 0; i--) {
-      const n = t[i], o = n[t[i].length - 1];
-      if (o < s) {
+      const n = t[i], h = n[t[i].length - 1];
+      if (h < s) {
         t[i + 1] = [...n, s];
         break;
-      } else o > 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 +801,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 o of t)
-      if (!e.has(o))
-        throw new Error(`Invalid Roman numeral character: ${o}`);
+    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 o = t.slice(i, i + 2);
-      if (this.ROMAN_MAP.has(o))
-        s += this.ROMAN_MAP.get(o), 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 +832,178 @@ class X {
     return e;
   }
 }
-function Q(r) {
+class G {
+  static isValidPositiveInteger(t) {
+    return Number.isInteger(t) && t > 0 && t <= Number.MAX_SAFE_INTEGER;
+  }
+  static isPowerOfTwo(t) {
+    return t > 0 && (t & t - 1) === 0;
+  }
+  static isOdd(t) {
+    return t % 2 === 1 || t % 2 === -1;
+  }
+  static factorial(t) {
+    if (!this.isValidPositiveInteger(t))
+      throw new Error("Input must be a non-negative integer");
+    if (t < 2)
+      return 1;
+    let e = 1;
+    for (let 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((a, l) => a + 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--;
+    }
+    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;
+  }
+  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 = /* @__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 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 W {
+  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 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 {
+  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 K(r) {
   let t;
   const e = new Proxy(r, {
     construct(s, i, n) {
@@ -839,7 +1028,7 @@ const x = {
   UI_HIDE_LOADING: "隐藏加载事件",
   UI_SHOW_MESSAGE: "显示消息事件"
 };
-class v {
+class I {
   static instance = null;
   listeners = {};
   debugMode;
@@ -852,7 +1041,7 @@ class v {
   }
   // 单例模式
   static getInstance(t) {
-    return v.instance || (v.instance = new v(t)), v.instance;
+    return I.instance || (I.instance = new I(t)), I.instance;
   }
   /**
    * 添加事件监听器
@@ -912,231 +1101,11 @@ class v {
     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 I {
-  static instance;
-  constructor() {
-  }
-  static getInstance() {
-    return I.instance || (I.instance = new I()), I.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 K {
-  features;
-  constructor() {
-    this.features = this.detectFeatures();
-  }
-  detectFeatures() {
-    return {
-      geolocation: "geolocation" in navigator,
-      notification: "Notification" in window,
-      serviceWorker: "serviceWorker" in navigator,
-      webShare: "share" in navigator,
-      deviceOrientation: "DeviceOrientationEvent" in window,
-      battery: "getBattery" in navigator,
-      online: "onLine" in navigator
-    };
-  }
-  async getLocation(t = {}) {
-    if (!this.features.geolocation)
-      throw new Error("Geolocation is not supported");
-    const e = {
-      enableHighAccuracy: !0,
-      timeout: 10 * 1e3,
-      maximumAge: 300 * 1e3
-    };
-    return new Promise((s, i) => {
-      navigator.geolocation.getCurrentPosition(
-        (n) => s({
-          latitude: n.coords.latitude,
-          longitude: n.coords.longitude,
-          accuracy: n.coords.accuracy,
-          timstamp: n.timestamp
-        }),
-        (n) => {
-          const o = {
-            1: "User denied the request for Geolocation.",
-            2: "Position information is unavailable.",
-            3: "The request to get user location timed out."
-          };
-          i(new Error(o[n.code] || "Unknown error"));
-        },
-        { ...e, ...t }
-      );
-    });
-  }
-  async sendNotification(t, e) {
-    if (!this.features.notification)
-      throw new Error("Notification is not supported");
-    if (Notification.permission === "default" && await Notification.requestPermission() !== "granted")
-      throw new Error("Notification permission is not granted");
-    if (Notification.permission !== "granted")
-      throw new Error("Notification permission is not granted");
-    return new Notification(t, {
-      icon: e.icon,
-      badge: e.badge,
-      ...e
-    });
-  }
-  async registerServiceWorker(t) {
-    if (!this.features.serviceWorker)
-      throw new Error("Service Worker is not supported");
-    try {
-      const e = await navigator.serviceWorker.register(t);
-      return console.log("Service Worker registered with scope:", e), e;
-    } catch (e) {
-      throw console.error("Service Worker registration failed:", e), e;
-    }
-  }
-  async shareContent(t) {
-    if (this.features.webShare)
-      try {
-        return await navigator.share(t), !0;
-      } catch (e) {
-        return e instanceof Error && e.name != "AbortError" && console.error("Error sharing content:", e), !1;
-      }
-    else
-      try {
-        return await navigator.clipboard.writeText(
-          t.url || t.text || ""
-        ), this.sendNotification("Copied to clipboard", {
-          body: "Link copied to clipboard"
-        }), !0;
-      } catch (e) {
-        return console.error("Error copying to clipboard:", e), !1;
-      }
-  }
+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;
@@ -1199,35 +1168,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(" "), o = this.textContent.indexOf(t);
-  if (o < 0) return null;
-  const h = document.createRange();
-  h.setStart(this, o), h.setEnd(this, o + t.length);
-  const u = document.createElement(i);
-  return n && (u.className = n), h.surroundContents(u), u;
+  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 {
-  j as Dictionary,
-  I as DomHelper,
-  v as Emitter,
-  W as Graph,
-  B as LIS,
-  _ as LRU,
-  l as Line,
-  H as LinkedList,
+  W as BitPerm,
+  Q as Color,
+  R as Dictionary,
+  I as Emitter,
+  $ as Graph,
+  T as LIS,
+  j as LRU,
+  g as Line,
+  U as LinkedList,
   E as Matrix,
   q as MaxHeap,
-  G as MemoizeMap,
-  P as MinHeap,
-  $ as MinStack,
-  a as Point,
+  F as MemoizeMap,
+  O as MinHeap,
+  D as MinStack,
+  G as Num,
+  u as Point,
   V as Queue,
-  X as Roman,
-  U as Stack,
-  c as Triangle,
-  g as Vector,
-  K as WebAppManager,
-  F as isValidBracket,
-  Q as singleton,
-  T as sleep
+  B as Roman,
+  z as Stack,
+  X as Str,
+  p as Triangle,
+  y as Vector,
+  Z as binarySearchTemplate,
+  H as isValidBracket,
+  K as singleton,
+  _ as sleep
 };