jc-structure 0.0.9 → 0.1.1

package/dist/jc-structure.js

@@ -1,4 +1,4 @@
-class m {
+class z {
   items = {};
   count = 0;
   lowestCount = 0;
@@ -30,7 +30,7 @@ class m {
     return this.isEmpty() ? "" : `Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`;
   }
 }
-class v {
+class j {
   items = {};
   count = 0;
   constructor() {
@@ -62,13 +62,13 @@ class v {
     return this.isEmpty() ? "" : `Stack(count: ${this.count}):[${this.items[this.count - 1]},...rest]`;
   }
 }
-function c(s, t) {
-  return s === t ? 0 : s < t ? -1 : 1;
+function N(n, t) {
+  return n === t ? 0 : n < t ? -1 : 1;
 }
-class n {
+class g {
   heap = [];
   compareFn;
-  constructor(t = c) {
+  constructor(t = N) {
     this.compareFn = t;
   }
   static getLeftIndex(t) {
@@ -80,8 +80,8 @@ class n {
   static getParentIndex(t) {
     return t === 0 ? void 0 : Math.floor((t - 1) / 2);
   }
-  static swap(t, e, i) {
-    [t[e], t[i]] = [t[i], t[e]];
+  static swap(t, e, s) {
+    [t[e], t[s]] = [t[s], t[e]];
   }
   find() {
     return this.isEmpty() ? void 0 : this.heap[0];
@@ -99,7 +99,7 @@ class n {
     return this.heap.toString();
   }
 }
-class p extends n {
+class A extends g {
   insert(t) {
     return t ? !1 : (this.heap.push(t), this.siftUp(this.heap.length - 1), !0);
   }
@@ -110,24 +110,24 @@ class p extends n {
     return this.heap[0] = this.heap.pop(), this.siftDown(0), t;
   }
   siftUp(t) {
-    let e = t, i = n.getLeftIndex(e), r = n.getRightIndex(e), h = this.size();
-    i < h && this.compareFn(this.heap[e], this.heap[i]) === -1 && (e = i), r < h && this.compareFn(this.heap[e], this.heap[r]) === 1 && (e = r), e !== t && (n.swap(this.heap, t, e), this.siftUp(e));
+    let e = t, s = g.getLeftIndex(e), i = g.getRightIndex(e), r = this.size();
+    s < r && this.compareFn(this.heap[e], this.heap[s]) === -1 && (e = s), i < r && this.compareFn(this.heap[e], this.heap[i]) === 1 && (e = i), e !== t && (g.swap(this.heap, t, e), this.siftUp(e));
   }
   siftDown(t) {
-    let e = n.getParentIndex(t);
+    let e = g.getParentIndex(t);
     for (; t > 0 && e && this.compareFn(this.heap[e], this.heap[t]) === 1; )
-      n.swap(this.heap, e, t), t = e, e = n.getParentIndex(t);
+      g.swap(this.heap, e, t), t = e, e = g.getParentIndex(t);
   }
 }
-class w extends p {
-  constructor(t = (e, i) => c(i, e)) {
+class R extends A {
+  constructor(t = (e, s) => N(s, e)) {
     super(t);
   }
 }
-function f(s) {
-  return { value: s };
+function C(n) {
+  return { value: n };
 }
-class x {
+class V {
   capacity;
   length = 0;
   head = null;
@@ -156,29 +156,29 @@ class x {
       return this.detach(e), this.prepend(e), e.value;
   }
   update(t, e) {
-    let i = this.lookup.get(t);
-    i ? (this.detach(i), this.prepend(i), i.value = e) : (i = f(e), this.length++, this.prepend(i), this.trimCache(), this.lookup.set(t, i), this.reverseLookup);
+    let s = this.lookup.get(t);
+    s ? (this.detach(s), this.prepend(s), s.value = e) : (s = C(e), this.length++, this.prepend(s), this.trimCache(), this.lookup.set(t, s), this.reverseLookup);
   }
 }
-class o {
+let I = class {
   value;
   next = void 0;
-}
-class E {
+};
+class W {
   count = 0;
   head = void 0;
   constructor() {
   }
   indexOf(t) {
-    let e = this.head, i = 0, r = !1;
+    let e = this.head, s = 0, i = !1;
     for (; e; ) {
       if (this.equals(e.value, t)) {
-        r = !0;
+        i = !0;
         break;
       }
-      i++, e = e.next;
+      s++, e = e.next;
     }
-    return r ? i : -1;
+    return i ? s : -1;
   }
   equals(t, e) {
     return !1;
@@ -189,7 +189,7 @@ class E {
     if (t === 0)
       return this.head;
     let e = this.head;
-    for (let i = 0; i < t; i++)
+    for (let s = 0; s < t; s++)
       e = e?.next;
     return e;
   }
@@ -197,25 +197,25 @@ class E {
     return this.getElementAt(t)?.value;
   }
   insert(t, e) {
-    let i = new o();
-    if (i.value = t, e > this.count || e < 0)
+    let s = new I();
+    if (s.value = t, e > this.count || e < 0)
       throw new Error("index error");
     this.count++;
-    let r, h;
+    let i, r;
     if (e === 0) {
-      i.next = this.head, this.head = i;
+      s.next = this.head, this.head = s;
       return;
     }
-    r = this.getElementAt(e - 1), h = r.next, r.next = i, i.next = h;
+    i = this.getElementAt(e - 1), r = i.next, i.next = s, s.next = r;
   }
   push(t) {
-    let e = new o();
+    let e = new I();
     if (e.value = t, this.count++, this.isEmpty()) {
       this.head = e;
       return;
     }
-    let i = this.getElementAt(this.count - 1);
-    i.next = e;
+    let s = this.getElementAt(this.count - 1);
+    s.next = e;
   }
   remove(t) {
     const e = this.indexOf(t);
@@ -224,8 +224,8 @@ class E {
   removeAt(t) {
     if (this.isEmpty() || t < 0 || t >= this.count)
       return;
-    let e = this.getElementAt(t), i = this.getElementAt(t - 1), r = e?.next;
-    return t === 0 && (this.head = r), i && (i.next = r), this.count--, e?.value;
+    let e = this.getElementAt(t), s = this.getElementAt(t - 1), i = e?.next;
+    return t === 0 && (this.head = i), s && (s.next = i), this.count--, e?.value;
   }
   isEmpty() {
     return this.count === 0;
@@ -243,37 +243,37 @@ class E {
     return t = t.slice(0, -1), t;
   }
 }
-class d {
+class O {
   key;
   value;
   constructor(t, e) {
     this.key = t, this.value = e;
   }
 }
-function l(s, t = { emptyString: !1, zeroNumber: !1 }) {
-  return s == null ? !(t.emptyString && s === "" || t.zeroNumber && s === 0) : !1;
+function M(n, t = { emptyString: !1, zeroNumber: !1 }) {
+  return n == null ? !(t.emptyString && n === "" || t.zeroNumber && n === 0) : !1;
 }
-class g {
+class k {
   table = [];
   constructor() {
   }
   getItemIndex(t) {
-    for (let e = 0, i = this.table.length; e < i; e++)
+    for (let e = 0, s = this.table.length; e < s; e++)
       if (this.table[e].key === t)
         return e;
     return -1;
   }
   set(t, e) {
-    if (l(t))
+    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 i = this.getItemIndex(t);
-      this.table[i].value = e;
+      let s = this.getItemIndex(t);
+      this.table[s].value = e;
     } else {
-      const i = new d(t, e);
-      this.table.push(i);
+      const s = new O(t, e);
+      this.table.push(s);
     }
   }
   remove(t) {
@@ -301,9 +301,9 @@ class g {
     return this.table.map((t) => [t.key, t.value]);
   }
   forEach(t) {
-    for (let e = 0, i = this.size(); e < i; e++) {
-      let r = this.table[e];
-      if (!t(r.key, r.value))
+    for (let e = 0, s = this.size(); e < s; e++) {
+      let i = this.table[e];
+      if (!t(i.key, i.value))
         break;
     }
   }
@@ -318,17 +318,17 @@ class g {
   }
   toString() {
     let t = "";
-    for (let e = 0, i = this.table.length; e < i; e++)
+    for (let e = 0, s = this.table.length; e < s; e++)
       t += this.table[e].toString(), t += ",";
     return t = t.slice(0, -1), t;
   }
 }
-class y {
+class D {
   isDirected;
   vertices;
   adjList;
   constructor(t = !1) {
-    this.isDirected = t, this.vertices = [], this.adjList = new g();
+    this.isDirected = t, this.vertices = [], this.adjList = new k();
   }
   addVertex(t) {
     this.vertices.includes(t) || (this.vertices.push(t), this.adjList.set(t, []));
@@ -350,67 +350,683 @@ class y {
     return t;
   }
 }
-function b(s) {
-  return new Promise((t) => setTimeout(t, s));
+class f {
+  _data;
+  static zero(t) {
+    return new f(...Array(t).fill(0));
+  }
+  constructor(...t) {
+    this._data = t;
+  }
+  get dimension() {
+    return this._data.length;
+  }
+  get norm() {
+    return Math.hypot(...this._data);
+  }
+  getItem(t) {
+    return this._data[t];
+  }
+  normalize() {
+    const t = this.norm;
+    if (t === 0)
+      throw new Error("Cannot normalize a zero vector");
+    const e = this._data.map((s) => s / t);
+    return new f(...e);
+  }
+  add(t) {
+    if (this.dimension !== t.dimension)
+      throw new Error("Vectors must have the same dimension to add");
+    const e = this._data.map(
+      (s, i) => s + t._data[i]
+    );
+    return new f(...e);
+  }
+  sub(t) {
+    if (this.dimension !== t.dimension)
+      throw new Error("Vectors must have the same dimension to subtract");
+    const e = this._data.map(
+      (s, i) => s - t._data[i]
+    );
+    return new f(...e);
+  }
+  mul(t) {
+    return new f(...this._data.map((e) => e * t));
+  }
+  dot(t) {
+    if (this.dimension !== t.dimension)
+      throw new Error("Vectors must have the same dimension to dot product");
+    return this._data.reduce(
+      (e, s, i) => e + s * t._data[i],
+      0
+    );
+  }
+  pos() {
+    return this.mul(1);
+  }
+  neg() {
+    return this.mul(-1);
+  }
+}
+class y {
+  _matrix;
+  static zero(t, e) {
+    return new y(
+      Array.from({ length: t }, () => Array.from({ length: e }, () => 0))
+    );
+  }
+  constructor(t) {
+    this._matrix = t;
+  }
+  get shape() {
+    return [this._matrix.length, this._matrix[0].length];
+  }
+  get row() {
+    return this.shape[0];
+  }
+  get col() {
+    return this.shape[1];
+  }
+  get size() {
+    return this.row * this.col;
+  }
+  rowVector(t) {
+    return new f(...this._matrix[t]);
+  }
+  colVector(t) {
+    return new f(...this._matrix.map((e) => e[t]));
+  }
+  getItem(t) {
+    return this._matrix[t[0]][t[1]];
+  }
+  setItem(t, e) {
+    return this._matrix[t[0]][t[1]] = e, this;
+  }
+  mul(t) {
+    return new y(this._matrix.map((e) => e.map((s) => s * t)));
+  }
+  div(t) {
+    return this.mul(1 / t);
+  }
+  add(t) {
+    if (this.row !== t.row || this.col !== t.col)
+      throw new Error("Matrix dimensions do not match");
+    return new y(
+      this._matrix.map(
+        (e, s) => e.map((i, r) => i + t.getItem([s, r]))
+      )
+    );
+  }
+  sub(t) {
+    return this.add(t.neg());
+  }
+  pos() {
+    return this.mul(1);
+  }
+  neg() {
+    return this.mul(-1);
+  }
+  mulVector(t) {
+    if (this.col !== t.dimension)
+      throw new Error("Matrix dimensions do not match");
+    return new y(
+      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 = y.zero(this.row, t.col);
+    for (let s = 0; s < this.row; s++) {
+      const i = this.rowVector(s);
+      for (let r = 0; r < this.col; r++)
+        e.setItem([s, r], i.dot(t.colVector(r)));
+    }
+    return e;
+  }
+}
+class o {
+  static distance(t, e) {
+    return Math.hypot(e.x - t.x, e.y - t.y);
+  }
+  x;
+  y;
+  constructor(t, e) {
+    this.x = t, this.y = e;
+  }
+  distanceTo(t) {
+    return o.distance(this, t);
+  }
+}
+class c {
+  // 使用更合适的精度阈值常量
+  static EPSILON = 1e-10;
+  // 静态方法：计算斜率
+  static sloped(t) {
+    const e = t.p2.x - t.p1.x, s = t.p2.y - t.p1.y;
+    return Math.abs(e) < c.EPSILON ? Math.abs(s) < c.EPSILON ? 0 : null : s / e;
+  }
+  // 静态方法：判断两条线是否平行
+  static isParallel(t, e) {
+    const s = c.sloped(t), i = c.sloped(e);
+    return s === null && i === null ? !0 : s === null || i === null ? !1 : Math.abs(s - i) < c.EPSILON;
+  }
+  // 静态方法：获取两条线的交点
+  static getIntersection(t, e) {
+    if (c.isParallel(t, e)) return null;
+    const s = t.p1.x, i = t.p1.y, r = t.p2.x, a = t.p2.y, l = e.p1.x, u = e.p1.y, p = e.p2.x, m = e.p2.y, d = (s - r) * (u - m) - (i - a) * (l - p);
+    if (Math.abs(d) < c.EPSILON) return null;
+    const w = ((s - l) * (u - m) - (i - u) * (l - p)) / d, E = -((s - r) * (i - u) - (i - a) * (s - l)) / d;
+    if (w >= 0 && w <= 1 && E >= 0 && E <= 1) {
+      const P = s + w * (r - s), L = i + w * (a - i);
+      return new o(P, L);
+    }
+    return null;
+  }
+  // 静态方法：判断两条线段是否相交
+  static isIntersecting(t, e) {
+    return c.getIntersection(t, e) !== null;
+  }
+  // 静态方法：计算点到线段的距离
+  static distanceToPoint(t, e) {
+    const s = e.x - t.p1.x, i = e.y - t.p1.y, r = t.p2.x - t.p1.x, a = t.p2.y - t.p1.y, l = s * r + i * a, u = r * r + a * a;
+    let p = -1;
+    u > c.EPSILON && (p = l / u);
+    let m, d;
+    p < 0 ? (m = t.p1.x, d = t.p1.y) : p > 1 ? (m = t.p2.x, d = t.p2.y) : (m = t.p1.x + p * r, d = t.p1.y + p * a);
+    const w = e.x - m, E = e.y - d;
+    return Math.hypot(w + E);
+  }
+  p1;
+  p2;
+  constructor(t, e) {
+    this.p1 = t, this.p2 = e;
+  }
+  // 获取线段长度
+  get length() {
+    const t = this.p2.x - this.p1.x, e = this.p2.y - this.p1.y;
+    return Math.sqrt(t * t + e * e);
+  }
+  // 获取线段中点
+  get midpoint() {
+    const t = (this.p1.x + this.p2.x) / 2, e = (this.p1.y + this.p2.y) / 2;
+    return new o(t, e);
+  }
+  // 获取线段的角度（弧度）
+  get angle() {
+    return Math.atan2(this.p2.y - this.p1.y, this.p2.x - this.p1.x);
+  }
+  // 判断点是否在线段上
+  containsPoint(t) {
+    const e = (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(e) > c.EPSILON ? !1 : (t.x - this.p1.x) * (t.x - this.p2.x) + (t.y - this.p1.y) * (t.y - this.p2.y) <= c.EPSILON;
+  }
+  // 获取线段的方向向量
+  get direction() {
+    const t = this.length;
+    if (t < c.EPSILON) return new o(0, 0);
+    const e = (this.p2.x - this.p1.x) / t, s = (this.p2.y - this.p1.y) / t;
+    return new o(e, s);
+  }
+}
+class S {
+  static EPSILON = 1e-10;
+  name;
+  constructor(t) {
+    this.name = t;
+  }
+}
+class h extends S {
+  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 (!h.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 (!h.isValid(t, e, s))
+      throw new Error("Invalid triangle sides");
+    const i = [t, e, s].sort((u, p) => u - p), [r, a, l] = i;
+    return Math.abs(r - a) < h.EPSILON && Math.abs(a - l) < h.EPSILON ? "equilateral" : Math.abs(r - a) < h.EPSILON || Math.abs(a - l) < h.EPSILON ? "isosceles" : "scalene";
+  }
+  static getAngles(t, e, s) {
+    if (!h.isValid(t, e, s))
+      throw new Error("Invalid triangle sides");
+    const i = Math.acos((e * e + s * s - t * t) / (2 * e * s)), r = Math.acos((t * t + s * s - e * e) / (2 * t * s)), a = Math.PI - i - r;
+    return [i, r, a];
+  }
+  p1;
+  p2;
+  p3;
+  constructor(t, e, s, i = "triangle") {
+    if (super(i), this.p1 = t, this.p2 = e, this.p3 = s, this.areCollinear())
+      throw new Error("Points are collinear, cannot form a triangle");
+  }
+  // 检查三点是否共线
+  areCollinear() {
+    return Math.abs(
+      (this.p2.x - this.p1.x) * (this.p3.y - this.p1.y) - (this.p3.x - this.p1.x) * (this.p2.y - this.p1.y)
+    ) < S.EPSILON;
+  }
+  get side() {
+    return [
+      o.distance(this.p1, this.p2),
+      o.distance(this.p2, this.p3),
+      o.distance(this.p3, this.p1)
+    ];
+  }
+  perimeter() {
+    return h.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 h.area(t, e, s);
+  }
+  get type() {
+    const [t, e, s] = this.side;
+    return h.getType(t, e, s);
+  }
+  get angles() {
+    const [t, e, s] = this.side;
+    return h.getAngles(t, e, s);
+  }
+  get centroid() {
+    return new o(
+      (this.p1.x + this.p2.x + this.p3.x) / 3,
+      (this.p1.y + this.p2.y + this.p3.y) / 3
+    );
+  }
+  get incenter() {
+    const [t, e, s] = this.side, i = this.perimeter() / 2, r = (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 o(r, a);
+  }
+  get circumcenter() {
+    const t = 2 * (this.p1.x * (this.p2.y - this.p3.y) + this.p2.x * (this.p3.y - this.p1.y) + this.p3.x * (this.p1.y - this.p2.y));
+    if (Math.abs(t) < h.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 o(e, s);
+  }
+  containsPoint(t) {
+    const e = h.area(
+      o.distance(t, this.p1),
+      o.distance(t, this.p2),
+      o.distance(this.p1, this.p2)
+    ), s = h.area(
+      o.distance(t, this.p2),
+      o.distance(t, this.p3),
+      o.distance(this.p2, this.p3)
+    ), i = h.area(
+      o.distance(t, this.p3),
+      o.distance(t, this.p1),
+      o.distance(this.p3, this.p1)
+    );
+    return Math.abs(e + s + i - this.area()) < h.EPSILON;
+  }
+}
+function F(n) {
+  return new Promise((t) => setTimeout(t, n));
+}
+function $(n) {
+  const t = [], e = {
+    "(": ")",
+    "[": "]",
+    "{": "}"
+  }, s = new Set(Object.values(e));
+  for (const i of n)
+    if (i in e)
+      t.push(e[i]);
+    else if (s.has(i) && i !== t.pop())
+      return !1;
+  return t.length === 0;
 }
-function a(s) {
-  return s !== null && (typeof s == "object" || typeof s == "function");
+function b(n) {
+  return n !== null && (typeof n == "object" || typeof n == "function");
 }
-class L {
+class H {
   map = /* @__PURE__ */ new Map();
   weakMap = /* @__PURE__ */ new WeakMap();
   set(t, e) {
-    a(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 a(t) ? this.weakMap.get(t) : this.map.get(t);
+    return b(t) ? this.weakMap.get(t) : this.map.get(t);
   }
   has(t) {
-    return a(t) ? this.weakMap.has(t) : this.map.has(t);
+    return b(t) ? this.weakMap.has(t) : this.map.has(t);
   }
 }
-function k(s) {
-  if (!s.length) return [];
-  const t = [[s[0]]];
-  for (let i = 1, r = s.length; i < r; i++) {
-    const h = s[i];
-    e(h);
-  }
-  function e(i) {
-    for (let r = t.length - 1; r >= 0; r--) {
-      const h = t[r], u = h[t[r].length - 1];
-      if (u < i) {
-        t[r + 1] = [...h, i];
+function U(n) {
+  if (!n.length) return [];
+  const t = [[n[0]]];
+  for (let s = 1, i = n.length; s < i; s++) {
+    const r = n[s];
+    e(r);
+  }
+  function e(s) {
+    for (let i = t.length - 1; i >= 0; i--) {
+      const r = t[i], a = r[t[i].length - 1];
+      if (a < s) {
+        t[i + 1] = [...r, s];
         break;
-      } else u > i && r === 0 && (t[r] = [i]);
+      } else a > s && i === 0 && (t[i] = [s]);
     }
   }
   return t[t.length - 1];
 }
-function I(s) {
+class B {
+  static ROMAN_MAP = /* @__PURE__ */ new Map([
+    ["M", 1e3],
+    ["CM", 900],
+    ["D", 500],
+    ["CD", 400],
+    ["C", 100],
+    ["XC", 90],
+    ["L", 50],
+    ["XL", 40],
+    ["X", 10],
+    ["IX", 9],
+    ["V", 5],
+    ["IV", 4],
+    ["I", 1]
+  ]);
+  static toInteger(t) {
+    if (t.length === 0)
+      throw new Error("Input cannot be empty");
+    const e = /* @__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}`);
+    let s = 0, i = 0;
+    for (; i < t.length; ) {
+      const a = t.slice(i, i + 2);
+      if (this.ROMAN_MAP.has(a))
+        s += this.ROMAN_MAP.get(a), i += 2;
+      else {
+        const l = t[i], u = this.ROMAN_MAP.get(l);
+        if (!u)
+          throw new Error(`Invalid Roman numeral sequence at position ${i}`);
+        s += u, i += 1;
+      }
+    }
+    if (this.toRoman(s) !== t)
+      throw new Error("Invalid Roman numeral sequence");
+    return s;
+  }
+  static toRoman(t) {
+    if (t <= 0 || t >= 4e3)
+      throw new Error("Number must be between 1 and 3999");
+    if (!Number.isInteger(t))
+      throw new Error("Number must be an integer");
+    let e = "";
+    for (const [s, i] of this.ROMAN_MAP)
+      for (; t >= i; )
+        e += s, t -= i;
+    return e;
+  }
+}
+function X(n) {
   let t;
-  const e = new Proxy(s, {
-    construct(i, r, h) {
+  const e = new Proxy(n, {
+    construct(s, i, r) {
       return t || (t = Reflect.construct(
+        s,
         i,
-        r,
-        h
+        r
       )), t;
     }
   });
-  return s.prototype.constructor = e, e;
+  return n.prototype.constructor = e, e;
+}
+const x = {
+  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 (!x.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 r = this.createElement(
+        i.tag,
+        i.attributes || {},
+        i.content || ""
+      );
+      s.appendChild(r);
+    }), 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 (!x.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(x.scriptRegex, "").replace(x.javascriptRegex, "").replace(x.eventHandlerRegex, "");
+  }
+}
+class G {
+  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(
+        (r) => s({
+          latitude: r.coords.latitude,
+          longitude: r.coords.longitude,
+          accuracy: r.coords.accuracy,
+          timstamp: r.timestamp
+        }),
+        (r) => {
+          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[r.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;
+      }
+  }
 }
 export {
-  g as Dictionary,
-  y as Graph,
-  k as LIS,
-  x as LRU,
-  E as LinkedList,
-  w as MaxHeap,
-  L as MemoizeMap,
-  p as MinHeap,
-  m as Queue,
-  v as Stack,
-  I as singleton,
-  b as sleep
+  k as Dictionary,
+  v as DomHelper,
+  D as Graph,
+  U as LIS,
+  V as LRU,
+  c as Line,
+  W as LinkedList,
+  y as Matrix,
+  R as MaxHeap,
+  H as MemoizeMap,
+  A as MinHeap,
+  o as Point,
+  z as Queue,
+  B as Roman,
+  j as Stack,
+  h as Triangle,
+  f as Vector,
+  G as WebAppManager,
+  $ as isValidBracket,
+  X as singleton,
+  F as sleep
 };

package/dist/jc-structure.umd.cjs

@@ -1,2 +1,2 @@
-(function(n,u){typeof exports=="object"&&typeof module<"u"?u(exports):typeof define=="function"&&define.amd?define(["exports"],u):(n=typeof globalThis<"u"?globalThis:n||self,u(n["jc-structure"]={}))})(this,(function(n){"use strict";class u{items={};count=0;lowestCount=0;constructor(){}dequeue(){if(this.isEmpty())return;const t=this.items[this.lowestCount];return delete this.items[this.lowestCount],this.lowestCount++,t}enqueue(...t){t.forEach(e=>{this.items[this.count]=e,this.count++})}front(){return this.isEmpty()?void 0:this.items[this.lowestCount]}isEmpty(){return this.size()===0}size(){return this.count-this.lowestCount}clear(){this.items={},this.count=0,this.lowestCount=0}toString(){return this.isEmpty()?"":`Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`}}class m{items={};count=0;constructor(){}pop(){if(this.isEmpty())return;this.count--;const t=this.items[this.count];return delete this.items[this.count],t}push(...t){t.forEach(e=>{this.items[this.count]=e,this.count++})}peek(){return this.isEmpty()?void 0:this.items[this.count-1]}isEmpty(){return this.count===0}size(){return this.count}clear(){this.items={},this.count=0}toString(){return this.isEmpty()?"":`Stack(count: ${this.count}):[${this.items[this.count-1]},...rest]`}}function l(s,t){return s===t?0:s<t?-1:1}class a{heap=[];compareFn;constructor(t=l){this.compareFn=t}static getLeftIndex(t){return 2*t+1}static getRightIndex(t){return 2*t+2}static getParentIndex(t){return t===0?void 0:Math.floor((t-1)/2)}static swap(t,e,i){[t[e],t[i]]=[t[i],t[e]]}find(){return this.isEmpty()?void 0:this.heap[0]}size(){return this.heap.length}isEmpty(){return this.size()===0}clear(){this.heap=[]}toString(){return this.heap.toString()}}class c extends a{insert(t){return t?!1:(this.heap.push(t),this.siftUp(this.heap.length-1),!0)}extract(){if(this.isEmpty())return;if(this.heap.length===1)return this.heap.shift();const t=this.heap[0];return this.heap[0]=this.heap.pop(),this.siftDown(0),t}siftUp(t){let e=t,i=a.getLeftIndex(e),r=a.getRightIndex(e),h=this.size();i<h&&this.compareFn(this.heap[e],this.heap[i])===-1&&(e=i),r<h&&this.compareFn(this.heap[e],this.heap[r])===1&&(e=r),e!==t&&(a.swap(this.heap,t,e),this.siftUp(e))}siftDown(t){let e=a.getParentIndex(t);for(;t>0&&e&&this.compareFn(this.heap[e],this.heap[t])===1;)a.swap(this.heap,e,t),t=e,e=a.getParentIndex(t)}}class v extends c{constructor(t=(e,i)=>l(i,e)){super(t)}}function w(s){return{value:s}}class y{capacity;length=0;head=null;tail=null;lookup=new Map;reverseLookup=new Map;constructor(t=10){this.capacity=t}prepend(t){this.head?(t.next=this.head,this.head.prev=t,this.head=t):this.head=this.tail=t}detach(t){t.prev&&(t.prev.next=t.next),t.next&&(t.next.prev=t.prev),this.head===t&&(this.head=this.head.next||null),this.tail===t&&(this.tail=this.tail.prev||null),t.next=void 0,t.prev=void 0}trimCache(){if(this.length<=this.capacity)return;const t=this.tail;this.detach(t);const e=this.reverseLookup.get(t);this.lookup.delete(e),this.reverseLookup.delete(t),this.length--}get(t){const e=this.lookup.get(t);if(e)return this.detach(e),this.prepend(e),e.value}update(t,e){let i=this.lookup.get(t);i?(this.detach(i),this.prepend(i),i.value=e):(i=w(e),this.length++,this.prepend(i),this.trimCache(),this.lookup.set(t,i),this.reverseLookup)}}class p{value;next=void 0}class E{count=0;head=void 0;constructor(){}indexOf(t){let e=this.head,i=0,r=!1;for(;e;){if(this.equals(e.value,t)){r=!0;break}i++,e=e.next}return r?i:-1}equals(t,e){return!1}getElementAt(t){if(t<0||t>=this.count)return;if(t===0)return this.head;let e=this.head;for(let i=0;i<t;i++)e=e?.next;return e}getValueAt(t){return this.getElementAt(t)?.value}insert(t,e){let i=new p;if(i.value=t,e>this.count||e<0)throw new Error("index error");this.count++;let r,h;if(e===0){i.next=this.head,this.head=i;return}r=this.getElementAt(e-1),h=r.next,r.next=i,i.next=h}push(t){let e=new p;if(e.value=t,this.count++,this.isEmpty()){this.head=e;return}let i=this.getElementAt(this.count-1);i.next=e}remove(t){const e=this.indexOf(t);return e===-1?void 0:this.removeAt(e)}removeAt(t){if(this.isEmpty()||t<0||t>=this.count)return;let e=this.getElementAt(t),i=this.getElementAt(t-1),r=e?.next;return t===0&&(this.head=r),i&&(i.next=r),this.count--,e?.value}isEmpty(){return this.count===0}size(){return this.count}clear(){this.count=0,this.head=void 0}toString(){let t="",e=this.head;for(;e;)t+=e.value,t+=",",e=e.next;return t=t.slice(0,-1),t}}class L{key;value;constructor(t,e){this.key=t,this.value=e}}function f(s,t={emptyString:!1,zeroNumber:!1}){return s==null?!(t.emptyString&&s===""||t.zeroNumber&&s===0):!1}class d{table=[];constructor(){}getItemIndex(t){for(let e=0,i=this.table.length;e<i;e++)if(this.table[e].key===t)return e;return-1}set(t,e){if(f(t))throw new Error("key is required");if(f(e))throw new Error("value is required");if(this.has(t)){let i=this.getItemIndex(t);this.table[i].value=e}else{const i=new L(t,e);this.table.push(i)}}remove(t){if(this.has(t)){let e=this.getItemIndex(t);return this.table.splice(e,1)[0]}}has(t){return this.getItemIndex(t)!==-1}get(t){if(this.has(t)){let e=this.getItemIndex(t);return this.table[e]}}keys(){return this.table.map(t=>t.key)}values(){return this.table.map(t=>t.value)}keyValues(){return this.table.map(t=>[t.key,t.value])}forEach(t){for(let e=0,i=this.size();e<i;e++){let r=this.table[e];if(!t(r.key,r.value))break}}isEmpty(){return!this.size()}size(){return this.table.length}clear(){this.table=[]}toString(){let t="";for(let e=0,i=this.table.length;e<i;e++)t+=this.table[e].toString(),t+=",";return t=t.slice(0,-1),t}}class b{isDirected;vertices;adjList;constructor(t=!1){this.isDirected=t,this.vertices=[],this.adjList=new d}addVertex(t){this.vertices.includes(t)||(this.vertices.push(t),this.adjList.set(t,[]))}addEdge(t,e){this.adjList.get(t)||this.addVertex(t),this.adjList.get(e)||this.addVertex(e),this.adjList.get(t)?.value.indexOf(e)===-1&&this.adjList.get(t)?.value.push(e),this.isDirected||this.adjList.get(e)?.value.indexOf(t)===-1&&this.adjList.get(e)?.value.push(t)}getVertices(){return this.vertices}getAdjacencyList(){return this.adjList}toString(){let t="";for(let e=0;e<this.vertices.length;e++)t+=this.vertices[e]+"-->",t+=this.adjList.get(this.vertices[e])?.toString()||"",t+=`
-`;return t}}function k(s){return new Promise(t=>setTimeout(t,s))}function o(s){return s!==null&&(typeof s=="object"||typeof s=="function")}class x{map=new Map;weakMap=new WeakMap;set(t,e){o(t)?this.weakMap.set(t,e):this.map.set(t,e)}get(t){return o(t)?this.weakMap.get(t):this.map.get(t)}has(t){return o(t)?this.weakMap.has(t):this.map.has(t)}}function I(s){if(!s.length)return[];const t=[[s[0]]];for(let i=1,r=s.length;i<r;i++){const h=s[i];e(h)}function e(i){for(let r=t.length-1;r>=0;r--){const h=t[r],g=h[t[r].length-1];if(g<i){t[r+1]=[...h,i];break}else g>i&&r===0&&(t[r]=[i])}}return t[t.length-1]}function M(s){let t;const e=new Proxy(s,{construct(i,r,h){return t||(t=Reflect.construct(i,r,h)),t}});return s.prototype.constructor=e,e}n.Dictionary=d,n.Graph=b,n.LIS=I,n.LRU=y,n.LinkedList=E,n.MaxHeap=v,n.MemoizeMap=x,n.MinHeap=c,n.Queue=u,n.Stack=m,n.singleton=M,n.sleep=k,Object.defineProperty(n,Symbol.toStringTag,{value:"Module"})}));
+(function(o,E){typeof exports=="object"&&typeof module<"u"?E(exports):typeof define=="function"&&define.amd?define(["exports"],E):(o=typeof globalThis<"u"?globalThis:o||self,E(o["jc-structure"]={}))})(this,(function(o){"use strict";class E{items={};count=0;lowestCount=0;constructor(){}dequeue(){if(this.isEmpty())return;const t=this.items[this.lowestCount];return delete this.items[this.lowestCount],this.lowestCount++,t}enqueue(...t){t.forEach(e=>{this.items[this.count]=e,this.count++})}front(){return this.isEmpty()?void 0:this.items[this.lowestCount]}isEmpty(){return this.size()===0}size(){return this.count-this.lowestCount}clear(){this.items={},this.count=0,this.lowestCount=0}toString(){return this.isEmpty()?"":`Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`}}class O{items={};count=0;constructor(){}pop(){if(this.isEmpty())return;this.count--;const t=this.items[this.count];return delete this.items[this.count],t}push(...t){t.forEach(e=>{this.items[this.count]=e,this.count++})}peek(){return this.isEmpty()?void 0:this.items[this.count-1]}isEmpty(){return this.count===0}size(){return this.count}clear(){this.items={},this.count=0}toString(){return this.isEmpty()?"":`Stack(count: ${this.count}):[${this.items[this.count-1]},...rest]`}}function S(n,t){return n===t?0:n<t?-1:1}class g{heap=[];compareFn;constructor(t=S){this.compareFn=t}static getLeftIndex(t){return 2*t+1}static getRightIndex(t){return 2*t+2}static getParentIndex(t){return t===0?void 0:Math.floor((t-1)/2)}static swap(t,e,s){[t[e],t[s]]=[t[s],t[e]]}find(){return this.isEmpty()?void 0:this.heap[0]}size(){return this.heap.length}isEmpty(){return this.size()===0}clear(){this.heap=[]}toString(){return this.heap.toString()}}class L extends g{insert(t){return t?!1:(this.heap.push(t),this.siftUp(this.heap.length-1),!0)}extract(){if(this.isEmpty())return;if(this.heap.length===1)return this.heap.shift();const t=this.heap[0];return this.heap[0]=this.heap.pop(),this.siftDown(0),t}siftUp(t){let e=t,s=g.getLeftIndex(e),i=g.getRightIndex(e),r=this.size();s<r&&this.compareFn(this.heap[e],this.heap[s])===-1&&(e=s),i<r&&this.compareFn(this.heap[e],this.heap[i])===1&&(e=i),e!==t&&(g.swap(this.heap,t,e),this.siftUp(e))}siftDown(t){let e=g.getParentIndex(t);for(;t>0&&e&&this.compareFn(this.heap[e],this.heap[t])===1;)g.swap(this.heap,e,t),t=e,e=g.getParentIndex(t)}}class k extends L{constructor(t=(e,s)=>S(s,e)){super(t)}}function z(n){return{value:n}}class j{capacity;length=0;head=null;tail=null;lookup=new Map;reverseLookup=new Map;constructor(t=10){this.capacity=t}prepend(t){this.head?(t.next=this.head,this.head.prev=t,this.head=t):this.head=this.tail=t}detach(t){t.prev&&(t.prev.next=t.next),t.next&&(t.next.prev=t.prev),this.head===t&&(this.head=this.head.next||null),this.tail===t&&(this.tail=this.tail.prev||null),t.next=void 0,t.prev=void 0}trimCache(){if(this.length<=this.capacity)return;const t=this.tail;this.detach(t);const e=this.reverseLookup.get(t);this.lookup.delete(e),this.reverseLookup.delete(t),this.length--}get(t){const e=this.lookup.get(t);if(e)return this.detach(e),this.prepend(e),e.value}update(t,e){let s=this.lookup.get(t);s?(this.detach(s),this.prepend(s),s.value=e):(s=z(e),this.length++,this.prepend(s),this.trimCache(),this.lookup.set(t,s),this.reverseLookup)}}let N=class{value;next=void 0};class R{count=0;head=void 0;constructor(){}indexOf(t){let e=this.head,s=0,i=!1;for(;e;){if(this.equals(e.value,t)){i=!0;break}s++,e=e.next}return i?s:-1}equals(t,e){return!1}getElementAt(t){if(t<0||t>=this.count)return;if(t===0)return this.head;let e=this.head;for(let s=0;s<t;s++)e=e?.next;return e}getValueAt(t){return this.getElementAt(t)?.value}insert(t,e){let s=new N;if(s.value=t,e>this.count||e<0)throw new Error("index error");this.count++;let i,r;if(e===0){s.next=this.head,this.head=s;return}i=this.getElementAt(e-1),r=i.next,i.next=s,s.next=r}push(t){let e=new N;if(e.value=t,this.count++,this.isEmpty()){this.head=e;return}let s=this.getElementAt(this.count-1);s.next=e}remove(t){const e=this.indexOf(t);return e===-1?void 0:this.removeAt(e)}removeAt(t){if(this.isEmpty()||t<0||t>=this.count)return;let e=this.getElementAt(t),s=this.getElementAt(t-1),i=e?.next;return t===0&&(this.head=i),s&&(s.next=i),this.count--,e?.value}isEmpty(){return this.count===0}size(){return this.count}clear(){this.count=0,this.head=void 0}toString(){let t="",e=this.head;for(;e;)t+=e.value,t+=",",e=e.next;return t=t.slice(0,-1),t}}class V{key;value;constructor(t,e){this.key=t,this.value=e}}function P(n,t={emptyString:!1,zeroNumber:!1}){return n==null?!(t.emptyString&&n===""||t.zeroNumber&&n===0):!1}class A{table=[];constructor(){}getItemIndex(t){for(let e=0,s=this.table.length;e<s;e++)if(this.table[e].key===t)return e;return-1}set(t,e){if(P(t))throw new Error("key is required");if(P(e))throw new Error("value is required");if(this.has(t)){let s=this.getItemIndex(t);this.table[s].value=e}else{const s=new V(t,e);this.table.push(s)}}remove(t){if(this.has(t)){let e=this.getItemIndex(t);return this.table.splice(e,1)[0]}}has(t){return this.getItemIndex(t)!==-1}get(t){if(this.has(t)){let e=this.getItemIndex(t);return this.table[e]}}keys(){return this.table.map(t=>t.key)}values(){return this.table.map(t=>t.value)}keyValues(){return this.table.map(t=>[t.key,t.value])}forEach(t){for(let e=0,s=this.size();e<s;e++){let i=this.table[e];if(!t(i.key,i.value))break}}isEmpty(){return!this.size()}size(){return this.table.length}clear(){this.table=[]}toString(){let t="";for(let e=0,s=this.table.length;e<s;e++)t+=this.table[e].toString(),t+=",";return t=t.slice(0,-1),t}}class q{isDirected;vertices;adjList;constructor(t=!1){this.isDirected=t,this.vertices=[],this.adjList=new A}addVertex(t){this.vertices.includes(t)||(this.vertices.push(t),this.adjList.set(t,[]))}addEdge(t,e){this.adjList.get(t)||this.addVertex(t),this.adjList.get(e)||this.addVertex(e),this.adjList.get(t)?.value.indexOf(e)===-1&&this.adjList.get(t)?.value.push(e),this.isDirected||this.adjList.get(e)?.value.indexOf(t)===-1&&this.adjList.get(e)?.value.push(t)}getVertices(){return this.vertices}getAdjacencyList(){return this.adjList}toString(){let t="";for(let e=0;e<this.vertices.length;e++)t+=this.vertices[e]+"-->",t+=this.adjList.get(this.vertices[e])?.toString()||"",t+=`
+`;return t}}class f{_data;static zero(t){return new f(...Array(t).fill(0))}constructor(...t){this._data=t}get dimension(){return this._data.length}get norm(){return Math.hypot(...this._data)}getItem(t){return this._data[t]}normalize(){const t=this.norm;if(t===0)throw new Error("Cannot normalize a zero vector");const e=this._data.map(s=>s/t);return new f(...e)}add(t){if(this.dimension!==t.dimension)throw new Error("Vectors must have the same dimension to add");const e=this._data.map((s,i)=>s+t._data[i]);return new f(...e)}sub(t){if(this.dimension!==t.dimension)throw new Error("Vectors must have the same dimension to subtract");const e=this._data.map((s,i)=>s-t._data[i]);return new f(...e)}mul(t){return new f(...this._data.map(e=>e*t))}dot(t){if(this.dimension!==t.dimension)throw new Error("Vectors must have the same dimension to dot product");return this._data.reduce((e,s,i)=>e+s*t._data[i],0)}pos(){return this.mul(1)}neg(){return this.mul(-1)}}class w{_matrix;static zero(t,e){return new w(Array.from({length:t},()=>Array.from({length:e},()=>0)))}constructor(t){this._matrix=t}get shape(){return[this._matrix.length,this._matrix[0].length]}get row(){return this.shape[0]}get col(){return this.shape[1]}get size(){return this.row*this.col}rowVector(t){return new f(...this._matrix[t])}colVector(t){return new f(...this._matrix.map(e=>e[t]))}getItem(t){return this._matrix[t[0]][t[1]]}setItem(t,e){return this._matrix[t[0]][t[1]]=e,this}mul(t){return new w(this._matrix.map(e=>e.map(s=>s*t)))}div(t){return this.mul(1/t)}add(t){if(this.row!==t.row||this.col!==t.col)throw new Error("Matrix dimensions do not match");return new w(this._matrix.map((e,s)=>e.map((i,r)=>i+t.getItem([s,r]))))}sub(t){return this.add(t.neg())}pos(){return this.mul(1)}neg(){return this.mul(-1)}mulVector(t){if(this.col!==t.dimension)throw new Error("Matrix dimensions do not match");return new w(this._matrix.map(e=>e.map((s,i)=>s*t.getItem(i))))}mulMatrix(t){if(this.col!==t.row)throw new Error("Matrix dimensions do not match");const e=w.zero(this.row,t.col);for(let s=0;s<this.row;s++){const i=this.rowVector(s);for(let r=0;r<this.col;r++)e.setItem([s,r],i.dot(t.colVector(r)))}return e}}class h{static distance(t,e){return Math.hypot(e.x-t.x,e.y-t.y)}x;y;constructor(t,e){this.x=t,this.y=e}distanceTo(t){return h.distance(this,t)}}class u{static EPSILON=1e-10;static sloped(t){const e=t.p2.x-t.p1.x,s=t.p2.y-t.p1.y;return Math.abs(e)<u.EPSILON?Math.abs(s)<u.EPSILON?0:null:s/e}static isParallel(t,e){const s=u.sloped(t),i=u.sloped(e);return s===null&&i===null?!0:s===null||i===null?!1:Math.abs(s-i)<u.EPSILON}static getIntersection(t,e){if(u.isParallel(t,e))return null;const s=t.p1.x,i=t.p1.y,r=t.p2.x,a=t.p2.y,p=e.p1.x,l=e.p1.y,d=e.p2.x,y=e.p2.y,m=(s-r)*(l-y)-(i-a)*(p-d);if(Math.abs(m)<u.EPSILON)return null;const v=((s-p)*(l-y)-(i-l)*(p-d))/m,I=-((s-r)*(i-l)-(i-a)*(s-p))/m;if(v>=0&&v<=1&&I>=0&&I<=1){const X=s+v*(r-s),G=i+v*(a-i);return new h(X,G)}return null}static isIntersecting(t,e){return u.getIntersection(t,e)!==null}static distanceToPoint(t,e){const s=e.x-t.p1.x,i=e.y-t.p1.y,r=t.p2.x-t.p1.x,a=t.p2.y-t.p1.y,p=s*r+i*a,l=r*r+a*a;let d=-1;l>u.EPSILON&&(d=p/l);let y,m;d<0?(y=t.p1.x,m=t.p1.y):d>1?(y=t.p2.x,m=t.p2.y):(y=t.p1.x+d*r,m=t.p1.y+d*a);const v=e.x-y,I=e.y-m;return Math.hypot(v+I)}p1;p2;constructor(t,e){this.p1=t,this.p2=e}get length(){const t=this.p2.x-this.p1.x,e=this.p2.y-this.p1.y;return Math.sqrt(t*t+e*e)}get midpoint(){const t=(this.p1.x+this.p2.x)/2,e=(this.p1.y+this.p2.y)/2;return new h(t,e)}get angle(){return Math.atan2(this.p2.y-this.p1.y,this.p2.x-this.p1.x)}containsPoint(t){const e=(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(e)>u.EPSILON?!1:(t.x-this.p1.x)*(t.x-this.p2.x)+(t.y-this.p1.y)*(t.y-this.p2.y)<=u.EPSILON}get direction(){const t=this.length;if(t<u.EPSILON)return new h(0,0);const e=(this.p2.x-this.p1.x)/t,s=(this.p2.y-this.p1.y)/t;return new h(e,s)}}class C{static EPSILON=1e-10;name;constructor(t){this.name=t}}class c extends C{static isValid(t,e,s){return t<=0||e<=0||s<=0?!1:t+e>s&&t+s>e&&e+s>t}static area(t,e,s){if(!c.isValid(t,e,s))throw new Error("Invalid triangle");const i=(t+e+s)/2;return Math.sqrt(i*(i-t)*(i-e)*(i-s))}static getType(t,e,s){if(!c.isValid(t,e,s))throw new Error("Invalid triangle sides");const i=[t,e,s].sort((l,d)=>l-d),[r,a,p]=i;return Math.abs(r-a)<c.EPSILON&&Math.abs(a-p)<c.EPSILON?"equilateral":Math.abs(r-a)<c.EPSILON||Math.abs(a-p)<c.EPSILON?"isosceles":"scalene"}static getAngles(t,e,s){if(!c.isValid(t,e,s))throw new Error("Invalid triangle sides");const i=Math.acos((e*e+s*s-t*t)/(2*e*s)),r=Math.acos((t*t+s*s-e*e)/(2*t*s)),a=Math.PI-i-r;return[i,r,a]}p1;p2;p3;constructor(t,e,s,i="triangle"){if(super(i),this.p1=t,this.p2=e,this.p3=s,this.areCollinear())throw new Error("Points are collinear, cannot form a triangle")}areCollinear(){return Math.abs((this.p2.x-this.p1.x)*(this.p3.y-this.p1.y)-(this.p3.x-this.p1.x)*(this.p2.y-this.p1.y))<C.EPSILON}get side(){return[h.distance(this.p1,this.p2),h.distance(this.p2,this.p3),h.distance(this.p3,this.p1)]}perimeter(){return c.isValid(this.side[0],this.side[1],this.side[2]),this.side.reduce((t,e)=>t+e,0)}area(){const[t,e,s]=this.side;return c.area(t,e,s)}get type(){const[t,e,s]=this.side;return c.getType(t,e,s)}get angles(){const[t,e,s]=this.side;return c.getAngles(t,e,s)}get centroid(){return new h((this.p1.x+this.p2.x+this.p3.x)/3,(this.p1.y+this.p2.y+this.p3.y)/3)}get incenter(){const[t,e,s]=this.side,i=this.perimeter()/2,r=(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 h(r,a)}get circumcenter(){const t=2*(this.p1.x*(this.p2.y-this.p3.y)+this.p2.x*(this.p3.y-this.p1.y)+this.p3.x*(this.p1.y-this.p2.y));if(Math.abs(t)<c.EPSILON)throw new Error("Cannot calculate circumcenter for collinear points");const e=((this.p1.x*this.p1.x+this.p1.y*this.p1.y)*(this.p2.y-this.p3.y)+(this.p2.x*this.p2.x+this.p2.y*this.p2.y)*(this.p3.y-this.p1.y)+(this.p3.x*this.p3.x+this.p3.y*this.p3.y)*(this.p1.y-this.p2.y))/t,s=((this.p1.x*this.p1.x+this.p1.y*this.p1.y)*(this.p3.x-this.p2.x)+(this.p2.x*this.p2.x+this.p2.y*this.p2.y)*(this.p1.x-this.p3.x)+(this.p3.x*this.p3.x+this.p3.y*this.p3.y)*(this.p2.x-this.p1.x))/t;return new h(e,s)}containsPoint(t){const e=c.area(h.distance(t,this.p1),h.distance(t,this.p2),h.distance(this.p1,this.p2)),s=c.area(h.distance(t,this.p2),h.distance(t,this.p3),h.distance(this.p2,this.p3)),i=c.area(h.distance(t,this.p3),h.distance(t,this.p1),h.distance(this.p3,this.p1));return Math.abs(e+s+i-this.area())<c.EPSILON}}function D(n){return new Promise(t=>setTimeout(t,n))}function W(n){const t=[],e={"(":")","[":"]","{":"}"},s=new Set(Object.values(e));for(const i of n)if(i in e)t.push(e[i]);else if(s.has(i)&&i!==t.pop())return!1;return t.length===0}function M(n){return n!==null&&(typeof n=="object"||typeof n=="function")}class H{map=new Map;weakMap=new WeakMap;set(t,e){M(t)?this.weakMap.set(t,e):this.map.set(t,e)}get(t){return M(t)?this.weakMap.get(t):this.map.get(t)}has(t){return M(t)?this.weakMap.has(t):this.map.has(t)}}function F(n){if(!n.length)return[];const t=[[n[0]]];for(let s=1,i=n.length;s<i;s++){const r=n[s];e(r)}function e(s){for(let i=t.length-1;i>=0;i--){const r=t[i],a=r[t[i].length-1];if(a<s){t[i+1]=[...r,s];break}else a>s&&i===0&&(t[i]=[s])}}return t[t.length-1]}class ${static ROMAN_MAP=new Map([["M",1e3],["CM",900],["D",500],["CD",400],["C",100],["XC",90],["L",50],["XL",40],["X",10],["IX",9],["V",5],["IV",4],["I",1]]);static toInteger(t){if(t.length===0)throw new Error("Input cannot be empty");const e=new Set(["I","V","X","L","C","D","M"]);for(const a of t)if(!e.has(a))throw new Error(`Invalid Roman numeral character: ${a}`);let s=0,i=0;for(;i<t.length;){const a=t.slice(i,i+2);if(this.ROMAN_MAP.has(a))s+=this.ROMAN_MAP.get(a),i+=2;else{const p=t[i],l=this.ROMAN_MAP.get(p);if(!l)throw new Error(`Invalid Roman numeral sequence at position ${i}`);s+=l,i+=1}}if(this.toRoman(s)!==t)throw new Error("Invalid Roman numeral sequence");return s}static toRoman(t){if(t<=0||t>=4e3)throw new Error("Number must be between 1 and 3999");if(!Number.isInteger(t))throw new Error("Number must be an integer");let e="";for(const[s,i]of this.ROMAN_MAP)for(;t>=i;)e+=s,t-=i;return e}}function U(n){let t;const e=new Proxy(n,{construct(s,i,r){return t||(t=Reflect.construct(s,i,r)),t}});return n.prototype.constructor=e,e}const b={scriptRegex:/<script\b[^<]*(?:(?!<\/script>)<[^<]*)*<\/script>/gi,javascriptRegex:/javascript:/gi,eventHandlerRegex:/on\w+\s*=/gi,allowedTags:new Set(["div","span","p","a","img","button","input","form","label","select","option","textarea","ul","ol","li","table","tr","td","th","thead","tbody","tfoot","h1","h2","h3","h4","h5","h6","hr","br","section","article","nav","header","footer","main","aside","figure","figcaption"]),allowedAttributes:new Set(["class","id","href","src","alt","title"])};class x{static instance;constructor(){}static getInstance(){return x.instance||(x.instance=new x),x.instance}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}createBatch(t,e){const s=document.createDocumentFragment();t.forEach(i=>{const r=this.createElement(i.tag,i.attributes||{},i.content||"");s.appendChild(r)}),e.appendChild(s)}setHtml(t,e){const s=this._sanitizeHtml(e);t.innerHTML=s}_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)}})}_processContent(t,e){typeof e=="string"?t.textContent=e:e instanceof Node?t.appendChild(e):Array.isArray(e)&&e.forEach(s=>{typeof s=="string"?t.appendChild(document.createTextNode(s)):t.appendChild(s)})}_sanitizeHtml(t){return t.replace(b.scriptRegex,"").replace(b.javascriptRegex,"").replace(b.eventHandlerRegex,"")}}class B{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(r=>s({latitude:r.coords.latitude,longitude:r.coords.longitude,accuracy:r.coords.accuracy,timstamp:r.timestamp}),r=>{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[r.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}}}o.Dictionary=A,o.DomHelper=x,o.Graph=q,o.LIS=F,o.LRU=j,o.Line=u,o.LinkedList=R,o.Matrix=w,o.MaxHeap=k,o.MemoizeMap=H,o.MinHeap=L,o.Point=h,o.Queue=E,o.Roman=$,o.Stack=O,o.Triangle=c,o.Vector=f,o.WebAppManager=B,o.isValidBracket=W,o.singleton=U,o.sleep=D,Object.defineProperty(o,Symbol.toStringTag,{value:"Module"})}));

package/index.d.ts

@@ -1,3 +1,5 @@
+import { Vector } from "./lib/dataStructure";
+
 declare module "jc-structure" {
   /**
    * 栈类，采用object实现
@@ -314,6 +316,192 @@ declare module "jc-structure" {
     has(key: unknown): boolean;
   }
 
+  /**
+   * 罗马数字类
+   */
+  export class Roman {
+    /**
+     * #### 转阿拉伯数字
+     * @param str 罗马数字文本
+     */
+    static toInteger(str: string): number;
+    /**
+     * #### 转罗马数字
+     * @param num 阿拉伯整数
+     */
+    static toRoman(num: number): string;
+  }
+
+  export class Point {
+    /**
+     * #### 点类构造函数
+     * @param x x坐标
+     * @param y y坐标
+     */
+    constructor(x: number, y: number);
+    /**
+     * #### 计算两点之间的距离
+     * @param p1 点1
+     * @param p2 点2
+     */
+    static distance(p1: Point, p2: Point): number;
+    /**
+     * #### 计算点与点之间的距离，实例方法
+     * @param p 点p
+     */
+    distanceTo(p: Point): number;
+  }
+
+  export class line {
+    /**
+     * #### 线段长度
+     */
+    get length(): number;
+    /**
+     * #### 线段中点
+     */
+    get midpoint(): Point;
+    /**
+     * #### 线段角度（弧度）
+     */
+    get angle(): number;
+    /**
+     * #### 获取线段的方向向量
+     */
+    get direction(): Point;
+    /**
+     * #### 判断点是否在线段上
+     * @param point
+     */
+    containsPoint(point: Point): boolean;
+  }
+
+  /**
+   * ### 三角形类
+   */
+  export class Triangle {
+    /**
+     * #### 判断三条边是否能构成三角形
+     * @param a 边长
+     * @param b 边长
+     * @param c 边长
+     */
+    static isValid(a: number, b: number, c: number): boolean;
+    /**
+     * #### 计算三角形的面积，采用秦九昭公式或叫海伦面积公式
+     * @param a 边长
+     * @param b 边长
+     * @param c 边长
+     */
+    static area(a: number, b: number, c: number): number;
+    /**
+     * #### 获取三角形的角度
+     * @param a 边长
+     * @param b 边长
+     * @param c 边长
+     */
+    static getAngles(a: number, b: number, c: number): [number, number, number];
+    constructor(p1: Point, p2: Point, p3: Point): Triangle;
+    /**
+     * #### 获取三角形的边长
+     */
+    get side(): [number, number, number];
+    /**
+     * #### 获取三角形的内心点
+     */
+    get centroid(): Point;
+    /**
+     * #### 获取三角形的外切园心点
+     */
+    get circumcenter(): Point;
+    /**
+     * #### 获取三角形的内切园心点
+     */
+    get incenter(): Point;
+    /**
+     * #### 获取三角形的周长
+     */
+    perimeter(): number;
+    /**
+     * #### 获取三角形的面积
+     */
+    area(): number;
+    /**
+     * #### 判断点是否在三角形内
+     * @param point
+     */
+    containsPoint(point: Point): boolean;
+  }
+
+  /**
+   * ### 向量类
+   */
+  export class Vector {
+    /**
+     * #### 获取向量的维度
+     */
+    get dimension(): number;
+    /**
+     * #### 获取向量的模
+     */
+    get norm(): number;
+    /**
+     * #### 根据索引获取向量元素
+     * @param index 索引
+     */
+    getItem(index: number): number;
+    /**
+     * #### 标准化向量
+     */
+    normalize(): Vector;
+    /**
+     * #### 向量加法
+     * @param v
+     */
+    add(v: Vector): Vector;
+    /**
+     * #### 向量减法
+     * @param v
+     * */
+    sub(v: Vector): Vector;
+    /**
+     * #### 向量乘法
+     * @param k
+     *  */
+    mul(k: number): Vector;
+    /**
+     * #### 向量点积
+     * @param v
+     * */
+    dot(v: Vector): number;
+    /**
+     * #### 向量取正
+     */
+    pos(): Vector;
+    /**
+     * #### 向量取反
+     */
+    neg(): Vector;
+  }
+
+  export class Matrix {
+    get row(): number;
+    get col(): number;
+    get size(): number;
+    rowVector(row: number): Vector;
+    colVector(col: number): Vector;
+    getItem(position: [number, number]): number;
+    setItem(position: [number, number], value: number): Matrix;
+    mul(k: number): Matrix;
+    div(k: number): Matrix;
+    add(matrix: Matrix): Matrix;
+    sub(matrix: Matrix): Matrix;
+    pos(): Matrix;
+    neg(): Matrix;
+    mulVector(vector: Vector): Vector;
+    mulMatrix(matrix: Matrix): Matrix;
+  }
+
   /**
    * #### 单例模式
    * @param classCtor 类构造函数
@@ -323,7 +511,7 @@ declare module "jc-structure" {
   ): T;
 
   /**
-   * #### 最长递增子序列
+   * #### 计算最长递增子序列（Longest Increasing Subsequence, LIS）
    * @param nums
    */
   export function LIS(nums: Array<number>): Array<number>;
@@ -332,4 +520,10 @@ declare module "jc-structure" {
    * @param ms 毫秒
    */
   export function sleep(ms: number): Promise<void>;
+
+  /**
+   * #### 判断字符串是否是有效的成对括号
+   * @param str 含括号的字符串
+   */
+  export function isValidBracket(str: string): boolean;
 }

package/package.json

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

package/types/global.d.ts

@@ -22,3 +22,7 @@ type CompareResult = -1 | 0 | 1;
 interface CompareFn<T> {
   (a: T, b: T): CompareResult;
 }
+
+interface Obj<V = any> {
+  [key: string]: V;
+}