viral-viewer-2 7.1.6 → 7.1.7

package/dist/index.mjs

@@ -1,4 +1,4 @@
-import { k as r, z as i, C as s, t as l, e as t, s as n, D as o, E as V, F as u, G as d, H as m, L as g, T as E, u as c, c as y, V as M, w as T, d as h, g as p, x as v, h as D, v as C, r as R, b, f, j as B, i as w, p as G, o as H, l as L, y as P, n as k, m as x, q as F } from "./index-COHsRNue.mjs";
+import { k as r, z as i, C as s, t as l, e as t, s as n, D as o, E as V, F as u, G as d, H as m, L as g, T as E, u as c, c as y, V as M, w as T, d as h, g as p, x as v, h as D, v as C, r as R, b, f, j as B, i as w, p as G, o as H, l as L, y as P, n as k, m as x, q as F } from "./index-BcLyNWVF.mjs";
 export {
   r as BufferElement,
   i as CheckClashResult,

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "viral-viewer-2",
-    "version": "7.1.6",
+    "version": "7.1.7",
     "description": "",
     "main": "dist/index.mjs",
     "types": "dist/index.d.ts",

package/dist/graph-layout.worker-DgEom1wW.mjs

@@ -1,109 +0,0 @@
-import { W as G } from "./index-COHsRNue.mjs";
-function C() {
-  function W(s) {
-    let r = 0;
-    for (let t = 0; t < s.length; t++)
-      r = (r << 5) - r + s.charCodeAt(t), r |= 0;
-    return Math.abs(r);
-  }
-  function M(s) {
-    const r = Math.sin(s) * 1e4;
-    return r - Math.floor(r);
-  }
-  function p(s, r, t) {
-    const d = (t == null ? void 0 : t.width) ?? 1e3, o = (t == null ? void 0 : t.height) ?? 1e3, f = (t == null ? void 0 : t.iterations) ?? 50, k = (t == null ? void 0 : t.boundaryShape) ?? "circular", v = s.length;
-    if (v === 0)
-      return /* @__PURE__ */ new Map();
-    const b = d * o, w = Math.sqrt(b / v), x = /* @__PURE__ */ new Map();
-    s.forEach((i) => {
-      const c = (t == null ? void 0 : t.seed) ?? W(i.id);
-      x.set(i.id, {
-        x: M(c) * d,
-        y: M(c * 2) * o,
-        vx: 0,
-        vy: 0
-      });
-    });
-    let L = d / 10;
-    const q = L / f;
-    for (let i = 0; i < f; i++)
-      i % Math.max(1, Math.floor(f / 10)) === 0 && self.postMessage({
-        type: "progress",
-        percent: Math.floor(i / f * 100),
-        iteration: i,
-        total: f
-      }), s.forEach((c) => {
-        const e = x.get(c.id);
-        e.vx = 0, e.vy = 0, s.forEach((g) => {
-          if (c.id === g.id)
-            return;
-          const h = x.get(g.id), n = e.x - h.x, y = e.y - h.y, u = n * n + y * y, a = Math.sqrt(u) || 1, l = w * w / a;
-          e.vx += n / a * l, e.vy += y / a * l;
-        });
-      }), r.forEach((c) => {
-        const e = String(c.source), g = String(c.target), h = x.get(e), n = x.get(g);
-        if (!h || !n)
-          return;
-        const y = h.x - n.x, u = h.y - n.y, a = Math.sqrt(y * y + u * u) || 1, l = a * a / w, E = y / a * l, m = u / a * l;
-        h.vx -= E, h.vy -= m, n.vx += E, n.vy += m;
-      }), s.forEach((c) => {
-        const e = x.get(c.id), g = Math.sqrt(e.vx * e.vx + e.vy * e.vy) || 1, h = Math.min(g, L);
-        if (e.x += e.vx / g * h, e.y += e.vy / g * h, k === "circular") {
-          const n = d / 2, y = o / 2, u = Math.min(d, o) / 2, a = e.x - n, l = e.y - y;
-          if (Math.sqrt(a * a + l * l) > u) {
-            const m = Math.atan2(l, a);
-            e.x = n + u * Math.cos(m), e.y = y + u * Math.sin(m);
-          }
-        } else
-          e.x = Math.max(0, Math.min(d, e.x)), e.y = Math.max(0, Math.min(o, e.y));
-      }), L -= q;
-    const S = /* @__PURE__ */ new Map();
-    return x.forEach((i, c) => {
-      S.set(c, { x: i.x, y: i.y });
-    }), S;
-  }
-  self.onmessage = function(s) {
-    try {
-      console.log("[GraphLayout Worker] Received message");
-      const { nodes: r, edges: t, options: d } = s.data;
-      if (!r || !t) {
-        console.error("[GraphLayout Worker] Missing nodes or edges"), self.postMessage({ error: "Missing nodes or edges" });
-        return;
-      }
-      console.log("[GraphLayout Worker] Computing layout for", r.length, "nodes and", t.length, "edges");
-      const o = p(r, t, d), f = {};
-      o.forEach((k, v) => {
-        f[v] = k;
-      }), console.log("[GraphLayout Worker] Layout computation complete"), self.postMessage({ type: "complete", positions: f });
-    } catch (r) {
-      console.error("[GraphLayout Worker] Error:", r), self.postMessage({ error: String(r) });
-    }
-  };
-}
-const F = C;
-class R {
-  constructor() {
-    const M = new Blob([`(${F})()`]), p = URL.createObjectURL(M);
-    this.workerPool = new G(2, p);
-  }
-  computeLayout(M, p, s, r, t) {
-    const d = {
-      nodes: M.map((o) => ({ id: o.id, group: o.group })),
-      edges: p,
-      options: s
-    };
-    this.workerPool.Enqueue(d, (o) => {
-      if (o.error) {
-        console.error("[GraphLayoutWorker] Error:", o.error);
-        return;
-      }
-      o.type === "progress" && r ? r(o.percent) : o.type === "complete" && t && t(o.positions);
-    });
-  }
-  dispose() {
-    this.workerPool.dispose();
-  }
-}
-export {
-  R as GraphLayoutWorker
-};