umap-gpu 0.2.11 → 0.2.13

package/dist/index.js

@@ -1,93 +1,93 @@
-var H = Object.defineProperty;
-var V = (e, n, r) => n in e ? H(e, n, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[n] = r;
-var G = (e, n, r) => V(e, typeof n != "symbol" ? n + "" : n, r);
-import { loadHnswlib as C } from "hnswlib-wasm";
-async function Y(e, n, r = {}) {
-  const { M: s = 16, efConstruction: t = 200, efSearch: p = 50 } = r, f = await C(), l = e[0].length, c = e.length, a = new f.HierarchicalNSW("l2", l, "");
-  a.initIndex(c, s, t, 200), a.setEfSearch(Math.max(p, n)), a.addItems(e, !1);
+var V = Object.defineProperty;
+var Y = (e, t, r) => t in e ? V(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
+var G = (e, t, r) => Y(e, typeof t != "symbol" ? t + "" : t, r);
+import { loadHnswlib as D } from "hnswlib-wasm";
+async function Q(e, t, r = {}) {
+  const { M: s = 16, efConstruction: n = 200, efSearch: g = 50 } = r, c = await D(), d = e[0].length, f = e.length, a = new c.HierarchicalNSW("l2", d, "");
+  a.initIndex(f, s, n, 200), a.setEfSearch(Math.max(g, t)), a.addItems(e, !1);
   const o = [], i = [];
-  for (let h = 0; h < c; h++) {
-    const d = a.searchKnn(e[h], n + 1, void 0), u = d.neighbors.map((g, m) => ({ idx: g, dist: d.distances[m] })).filter(({ idx: g }) => g !== h).slice(0, n);
-    o.push(u.map(({ idx: g }) => g)), i.push(u.map(({ dist: g }) => g));
+  for (let h = 0; h < f; h++) {
+    const l = a.searchKnn(e[h], t + 1, void 0), u = l.neighbors.map((p, m) => ({ idx: p, dist: l.distances[m] })).filter(({ idx: p }) => p !== h).slice(0, t);
+    o.push(u.map(({ idx: p }) => p)), i.push(u.map(({ dist: p }) => p));
   }
   return { indices: o, distances: i };
 }
-async function Q(e, n, r = {}) {
-  const { M: s = 16, efConstruction: t = 200, efSearch: p = 50 } = r, f = await C(), l = e[0].length, c = e.length, a = new f.HierarchicalNSW("l2", l, "");
-  a.initIndex(c, s, t, 200), a.setEfSearch(Math.max(p, n)), a.addItems(e, !1);
+async function J(e, t, r = {}) {
+  const { M: s = 16, efConstruction: n = 200, efSearch: g = 50 } = r, c = await D(), d = e[0].length, f = e.length, a = new c.HierarchicalNSW("l2", d, "");
+  a.initIndex(f, s, n, 200), a.setEfSearch(Math.max(g, t)), a.addItems(e, !1);
   const o = [], i = [];
-  for (let d = 0; d < c; d++) {
-    const u = a.searchKnn(e[d], n + 1, void 0), g = u.neighbors.map((m, w) => ({ idx: m, dist: u.distances[w] })).filter(({ idx: m }) => m !== d).slice(0, n);
-    o.push(g.map(({ idx: m }) => m)), i.push(g.map(({ dist: m }) => m));
+  for (let l = 0; l < f; l++) {
+    const u = a.searchKnn(e[l], t + 1, void 0), p = u.neighbors.map((m, _) => ({ idx: m, dist: u.distances[_] })).filter(({ idx: m }) => m !== l).slice(0, t);
+    o.push(p.map(({ idx: m }) => m)), i.push(p.map(({ dist: m }) => m));
   }
   return { knn: { indices: o, distances: i }, index: {
-    searchKnn(d, u) {
-      const g = [], m = [];
-      for (const w of d) {
-        const b = a.searchKnn(w, u, void 0), y = b.neighbors.map((v, x) => ({ idx: v, dist: b.distances[x] })).sort((v, x) => v.dist - x.dist).slice(0, u);
-        g.push(y.map(({ idx: v }) => v)), m.push(y.map(({ dist: v }) => v));
+    searchKnn(l, u) {
+      const p = [], m = [];
+      for (const _ of l) {
+        const w = a.searchKnn(_, u, void 0), b = w.neighbors.map((A, x) => ({ idx: A, dist: w.distances[x] })).sort((A, x) => A.dist - x.dist).slice(0, u);
+        p.push(b.map(({ idx: A }) => A)), m.push(b.map(({ dist: A }) => A));
       }
-      return { indices: g, distances: m };
+      return { indices: p, distances: m };
     }
   } };
 }
-function D(e, n, r, s = 1) {
-  const t = e.length, { sigmas: p, rhos: f } = L(n, r), l = [], c = [], a = [];
-  for (let i = 0; i < t; i++)
+function L(e, t, r, s = 1) {
+  const n = e.length, { sigmas: g, rhos: c } = W(t, r), d = [], f = [], a = [];
+  for (let i = 0; i < n; i++)
     for (let h = 0; h < e[i].length; h++) {
-      const d = n[i][h], u = d <= f[i] ? 1 : Math.exp(-((d - f[i]) / p[i]));
-      l.push(i), c.push(e[i][h]), a.push(u);
+      const l = t[i][h], u = l <= c[i] ? 1 : Math.exp(-((l - c[i]) / g[i]));
+      d.push(i), f.push(e[i][h]), a.push(u);
     }
-  return { ...X(l, c, a, t, s), nVertices: t };
+  return { ...Z(d, f, a, n, s), nVertices: n };
 }
-function J(e, n, r) {
-  const s = e.length, { sigmas: t, rhos: p } = L(n, r), f = [], l = [], c = [];
+function X(e, t, r) {
+  const s = e.length, { sigmas: n, rhos: g } = W(t, r), c = [], d = [], f = [];
   for (let a = 0; a < s; a++)
     for (let o = 0; o < e[a].length; o++) {
-      const i = n[a][o], h = i <= p[a] ? 1 : Math.exp(-((i - p[a]) / t[a]));
-      f.push(a), l.push(e[a][o]), c.push(h);
+      const i = t[a][o], h = i <= g[a] ? 1 : Math.exp(-((i - g[a]) / n[a]));
+      c.push(a), d.push(e[a][o]), f.push(h);
     }
   return {
-    rows: new Float32Array(f),
-    cols: new Float32Array(l),
-    vals: new Float32Array(c),
+    rows: new Float32Array(c),
+    cols: new Float32Array(d),
+    vals: new Float32Array(f),
     nVertices: s
   };
 }
-function L(e, n) {
-  const s = e.length, t = new Float32Array(s), p = new Float32Array(s);
-  for (let f = 0; f < s; f++) {
-    const l = e[f];
-    p[f] = l.find((h) => h > 0) ?? 0;
-    let c = 0, a = 1 / 0, o = 1;
-    const i = Math.log2(n);
+function W(e, t) {
+  const s = e.length, n = new Float32Array(s), g = new Float32Array(s);
+  for (let c = 0; c < s; c++) {
+    const d = e[c];
+    g[c] = d.find((h) => h > 0) ?? 0;
+    let f = 0, a = 1 / 0, o = 1;
+    const i = Math.log2(t);
     for (let h = 0; h < 64; h++) {
-      let d = 0;
-      for (let u = 0; u < l.length; u++)
-        d += Math.exp(-Math.max(0, l[u] - p[f]) / o);
-      if (Math.abs(d - i) < 1e-5) break;
-      d > i ? (a = o, o = (c + a) / 2) : (c = o, o = a === 1 / 0 ? o * 2 : (c + a) / 2);
+      let l = 0;
+      for (let u = 0; u < d.length; u++)
+        l += Math.exp(-Math.max(0, d[u] - g[c]) / o);
+      if (Math.abs(l - i) < 1e-5) break;
+      l > i ? (a = o, o = (f + a) / 2) : (f = o, o = a === 1 / 0 ? o * 2 : (f + a) / 2);
     }
-    t[f] = o;
+    n[c] = o;
   }
-  return { sigmas: t, rhos: p };
+  return { sigmas: n, rhos: g };
 }
-function X(e, n, r, s, t) {
-  const p = /* @__PURE__ */ new Map();
+function Z(e, t, r, s, n) {
+  const g = /* @__PURE__ */ new Map();
   for (let a = 0; a < e.length; a++)
-    p.set(e[a] * s + n[a], r[a]);
-  const f = [], l = [], c = [];
-  for (const [a, o] of p) {
-    const i = Math.floor(a / s), h = a % s, d = p.get(h * s + i) ?? 0, u = o + d - o * d, g = o * d;
-    f.push(i), l.push(h), c.push(t * u + (1 - t) * g);
+    g.set(e[a] * s + t[a], r[a]);
+  const c = [], d = [], f = [];
+  for (const [a, o] of g) {
+    const i = Math.floor(a / s), h = a % s, l = g.get(h * s + i) ?? 0, u = o + l - o * l, p = o * l;
+    c.push(i), d.push(h), f.push(n * u + (1 - n) * p);
   }
   return {
-    rows: new Float32Array(f),
-    cols: new Float32Array(l),
-    vals: new Float32Array(c)
+    rows: new Float32Array(c),
+    cols: new Float32Array(d),
+    vals: new Float32Array(f)
   };
 }
-const Z = `// UMAP SGD compute shader — processes one graph edge per GPU thread.
+const $ = `// UMAP SGD compute shader — processes one graph edge per GPU thread.
 // Applies attraction forces between connected nodes and repulsion forces
 // against negative samples.
 
@@ -197,18 +197,18 @@ fn main(@builtin(global_invocation_id) gid: vec3<u32>) {
     epochs_per_sample[edge_idx] / f32(params.negative_sample_rate);
 }
 `;
-class W {
+class j {
   constructor() {
     G(this, "device");
     G(this, "pipeline");
   }
   async init() {
-    const n = await navigator.gpu.requestAdapter();
-    if (!n) throw new Error("WebGPU not supported");
-    this.device = await n.requestDevice(), this.pipeline = this.device.createComputePipeline({
+    const t = await navigator.gpu.requestAdapter();
+    if (!t) throw new Error("WebGPU not supported");
+    this.device = await t.requestDevice(), this.pipeline = this.device.createComputePipeline({
       layout: "auto",
       compute: {
-        module: this.device.createShaderModule({ code: Z }),
+        module: this.device.createShaderModule({ code: $ }),
         entryPoint: "main"
       }
     });
@@ -226,203 +226,207 @@ class W {
    * @param params      - UMAP curve parameters and repulsion settings
    * @returns Optimized embedding as Float32Array
    */
-  async optimize(n, r, s, t, p, f, l, c, a) {
+  async optimize(t, r, s, n, g, c, d, f, a) {
     const { device: o } = this, i = r.length, h = this.makeBuffer(
-      n,
+      t,
       GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC
-    ), d = this.makeBuffer(r, GPUBufferUsage.STORAGE), u = this.makeBuffer(s, GPUBufferUsage.STORAGE), g = this.makeBuffer(t, GPUBufferUsage.STORAGE), m = new Float32Array(i).fill(0), w = this.makeBuffer(m, GPUBufferUsage.STORAGE), b = new Float32Array(i);
-    for (let _ = 0; _ < i; _++)
-      b[_] = t[_] / c.negativeSampleRate;
-    const y = this.makeBuffer(b, GPUBufferUsage.STORAGE), v = new Uint32Array(i);
-    for (let _ = 0; _ < i; _++)
-      v[_] = Math.random() * 4294967295 | 0;
-    const x = this.makeBuffer(v, GPUBufferUsage.STORAGE), B = o.createBuffer({
+    ), l = this.makeBuffer(r, GPUBufferUsage.STORAGE), u = this.makeBuffer(s, GPUBufferUsage.STORAGE), p = this.makeBuffer(n, GPUBufferUsage.STORAGE), m = new Float32Array(i).fill(0), _ = this.makeBuffer(m, GPUBufferUsage.STORAGE), w = new Float32Array(i);
+    for (let M = 0; M < i; M++)
+      w[M] = n[M] / f.negativeSampleRate;
+    const b = this.makeBuffer(w, GPUBufferUsage.STORAGE), A = new Uint32Array(i);
+    for (let M = 0; M < i; M++)
+      A[M] = Math.random() * 4294967295 | 0;
+    const x = this.makeBuffer(A, GPUBufferUsage.STORAGE), U = o.createBuffer({
       size: 40,
       usage: GPUBufferUsage.UNIFORM | GPUBufferUsage.COPY_DST
     });
-    for (let _ = 0; _ < l; _++) {
-      const F = 1 - _ / l, A = new ArrayBuffer(40), M = new Uint32Array(A), N = new Float32Array(A);
-      M[0] = i, M[1] = p, M[2] = f, M[3] = _, M[4] = l, N[5] = F, N[6] = c.a, N[7] = c.b, N[8] = c.gamma, M[9] = c.negativeSampleRate, o.queue.writeBuffer(B, 0, A);
-      const S = o.createBindGroup({
+    for (let M = 0; M < d; M++) {
+      const v = 1 - M / d, S = new ArrayBuffer(40), y = new Uint32Array(S), B = new Float32Array(S);
+      y[0] = i, y[1] = g, y[2] = c, y[3] = M, y[4] = d, B[5] = v, B[6] = f.a, B[7] = f.b, B[8] = f.gamma, y[9] = f.negativeSampleRate, o.queue.writeBuffer(U, 0, S);
+      const k = o.createBindGroup({
         layout: this.pipeline.getBindGroupLayout(0),
         entries: [
-          { binding: 0, resource: { buffer: g } },
-          { binding: 1, resource: { buffer: d } },
+          { binding: 0, resource: { buffer: p } },
+          { binding: 1, resource: { buffer: l } },
           { binding: 2, resource: { buffer: u } },
           { binding: 3, resource: { buffer: h } },
-          { binding: 4, resource: { buffer: w } },
-          { binding: 5, resource: { buffer: y } },
-          { binding: 6, resource: { buffer: B } },
+          { binding: 4, resource: { buffer: _ } },
+          { binding: 5, resource: { buffer: b } },
+          { binding: 6, resource: { buffer: U } },
           { binding: 7, resource: { buffer: x } }
         ]
-      }), O = o.createCommandEncoder(), U = O.beginComputePass();
-      U.setPipeline(this.pipeline), U.setBindGroup(0, S), U.dispatchWorkgroups(Math.ceil(i / 256)), U.end(), o.queue.submit([O.finish()]), _ % 10 === 0 && (await o.queue.onSubmittedWorkDone(), a == null || a(_, l));
+      }), E = o.createCommandEncoder(), P = E.beginComputePass();
+      P.setPipeline(this.pipeline), P.setBindGroup(0, k), P.dispatchWorkgroups(Math.ceil(i / 256)), P.end(), o.queue.submit([E.finish()]), M % 10 === 0 && (await o.queue.onSubmittedWorkDone(), a == null || a(M, d));
     }
-    const E = o.createBuffer({
-      size: n.byteLength,
+    const N = o.createBuffer({
+      size: t.byteLength,
       usage: GPUBufferUsage.COPY_DST | GPUBufferUsage.MAP_READ
     }), R = o.createCommandEncoder();
-    R.copyBufferToBuffer(h, 0, E, 0, n.byteLength), o.queue.submit([R.finish()]), await E.mapAsync(GPUMapMode.READ);
-    const k = new Float32Array(E.getMappedRange().slice(0));
-    return E.unmap(), h.destroy(), d.destroy(), u.destroy(), g.destroy(), w.destroy(), y.destroy(), x.destroy(), B.destroy(), E.destroy(), k;
+    R.copyBufferToBuffer(h, 0, N, 0, t.byteLength), o.queue.submit([R.finish()]), await N.mapAsync(GPUMapMode.READ);
+    const O = new Float32Array(N.getMappedRange().slice(0));
+    return N.unmap(), h.destroy(), l.destroy(), u.destroy(), p.destroy(), _.destroy(), b.destroy(), x.destroy(), U.destroy(), N.destroy(), O;
   }
-  makeBuffer(n, r) {
+  makeBuffer(t, r) {
     const s = this.device.createBuffer({
-      size: n.byteLength,
+      size: t.byteLength,
       usage: r,
       mappedAtCreation: !0
     });
-    return n instanceof Float32Array ? new Float32Array(s.getMappedRange()).set(n) : new Uint32Array(s.getMappedRange()).set(n), s.unmap(), s;
+    return t instanceof Float32Array ? new Float32Array(s.getMappedRange()).set(t) : new Uint32Array(s.getMappedRange()).set(t), s.unmap(), s;
   }
 }
-function q(e) {
+function z(e) {
   return Math.max(-4, Math.min(4, e));
 }
-function z(e, n, r, s, t, p, f, l) {
-  const { a: c, b: a, gamma: o = 1, negativeSampleRate: i = 5 } = f, h = n.rows.length, d = new Uint32Array(n.rows), u = new Uint32Array(n.cols), g = new Float32Array(h).fill(0), m = new Float32Array(h);
-  for (let w = 0; w < h; w++)
-    m[w] = r[w] / i;
-  for (let w = 0; w < p; w++) {
-    l == null || l(w, p);
-    const b = 1 - w / p;
-    for (let y = 0; y < h; y++) {
-      if (g[y] > w) continue;
-      const v = d[y], x = u[y];
-      let B = 0;
-      for (let _ = 0; _ < t; _++) {
-        const F = e[v * t + _] - e[x * t + _];
-        B += F * F;
+function I(e, t, r, s, n, g, c, d) {
+  const { a: f, b: a, gamma: o = 1, negativeSampleRate: i = 5 } = c, h = t.rows.length, l = new Uint32Array(t.rows), u = new Uint32Array(t.cols), p = new Float32Array(h).fill(0), m = new Float32Array(h);
+  for (let _ = 0; _ < h; _++)
+    m[_] = r[_] / i;
+  for (let _ = 0; _ < g; _++) {
+    d == null || d(_, g);
+    const w = 1 - _ / g;
+    for (let b = 0; b < h; b++) {
+      if (p[b] > _) continue;
+      const A = l[b], x = u[b];
+      let U = 0;
+      for (let v = 0; v < n; v++) {
+        const S = e[A * n + v] - e[x * n + v];
+        U += S * S;
       }
-      const E = Math.pow(B, a), R = -2 * c * a * (B > 0 ? E / B : 0) / (c * E + 1);
-      for (let _ = 0; _ < t; _++) {
-        const F = e[v * t + _] - e[x * t + _], A = q(R * F);
-        e[v * t + _] += b * A, e[x * t + _] -= b * A;
+      const N = Math.pow(U, a), R = -2 * f * a * (U > 0 ? N / U : 0) / (f * N + 1);
+      for (let v = 0; v < n; v++) {
+        const S = e[A * n + v] - e[x * n + v], y = z(R * S);
+        e[A * n + v] += w * y, e[x * n + v] -= w * y;
       }
-      g[y] += r[y];
-      const k = m[y] > 0 ? Math.floor(r[y] / m[y]) : 0;
-      for (let _ = 0; _ < k; _++) {
-        const F = Math.floor(Math.random() * s);
-        if (F === v) continue;
-        let A = 0;
-        for (let S = 0; S < t; S++) {
-          const O = e[v * t + S] - e[F * t + S];
-          A += O * O;
+      p[b] += r[b];
+      const O = r[b] / i, M = Math.max(0, Math.floor(
+        (_ - m[b]) / O
+      ));
+      m[b] += M * O;
+      for (let v = 0; v < M; v++) {
+        const S = Math.floor(Math.random() * s);
+        if (S === A) continue;
+        let y = 0;
+        for (let E = 0; E < n; E++) {
+          const P = e[A * n + E] - e[S * n + E];
+          y += P * P;
         }
-        const M = Math.pow(A, a), N = 2 * o * a / ((1e-3 + A) * (c * M + 1));
-        for (let S = 0; S < t; S++) {
-          const O = e[v * t + S] - e[F * t + S], U = q(N * O);
-          e[v * t + S] += b * U;
+        const B = Math.pow(y, a), k = 2 * o * a / ((1e-3 + y) * (f * B + 1));
+        for (let E = 0; E < n; E++) {
+          const P = e[A * n + E] - e[S * n + E], F = z(k * P);
+          e[A * n + E] += w * F;
         }
       }
-      m[y] += r[y] / i;
     }
   }
   return e;
 }
-function $(e, n, r, s, t, p, f, l, c, a) {
-  const { a: o, b: i, gamma: h = 1, negativeSampleRate: d = 5 } = c, u = r.rows.length, g = new Uint32Array(r.rows), m = new Uint32Array(r.cols), w = new Float32Array(u).fill(0), b = new Float32Array(u);
-  for (let y = 0; y < u; y++)
-    b[y] = s[y] / d;
-  for (let y = 0; y < l; y++) {
-    const v = 1 - y / l;
+function ee(e, t, r, s, n, g, c, d, f, a) {
+  const { a: o, b: i, gamma: h = 1, negativeSampleRate: l = 5 } = f, u = r.rows.length, p = new Uint32Array(r.rows), m = new Uint32Array(r.cols), _ = new Float32Array(u).fill(0), w = new Float32Array(u);
+  for (let b = 0; b < u; b++)
+    w[b] = s[b] / l;
+  for (let b = 0; b < d; b++) {
+    const A = 1 - b / d;
     for (let x = 0; x < u; x++) {
-      if (w[x] > y) continue;
-      const B = g[x], E = m[x];
+      if (_[x] > b) continue;
+      const U = p[x], N = m[x];
       let R = 0;
-      for (let A = 0; A < f; A++) {
-        const M = e[B * f + A] - n[E * f + A];
-        R += M * M;
+      for (let y = 0; y < c; y++) {
+        const B = e[U * c + y] - t[N * c + y];
+        R += B * B;
       }
-      const k = Math.pow(R, i), _ = -2 * o * i * (R > 0 ? k / R : 0) / (o * k + 1);
-      for (let A = 0; A < f; A++) {
-        const M = e[B * f + A] - n[E * f + A];
-        e[B * f + A] += v * q(_ * M);
+      const O = Math.pow(R, i), M = -2 * o * i * (R > 0 ? O / R : 0) / (o * O + 1);
+      for (let y = 0; y < c; y++) {
+        const B = e[U * c + y] - t[N * c + y];
+        e[U * c + y] += A * z(M * B);
       }
-      w[x] += s[x];
-      const F = b[x] > 0 ? Math.floor(s[x] / b[x]) : 0;
-      for (let A = 0; A < F; A++) {
-        const M = Math.floor(Math.random() * p);
-        if (M === E) continue;
-        let N = 0;
-        for (let U = 0; U < f; U++) {
-          const P = e[B * f + U] - n[M * f + U];
-          N += P * P;
+      _[x] += s[x];
+      const v = s[x] / l, S = Math.max(0, Math.floor(
+        (b - w[x]) / v
+      ));
+      w[x] += S * v;
+      for (let y = 0; y < S; y++) {
+        const B = Math.floor(Math.random() * g);
+        if (B === N) continue;
+        let k = 0;
+        for (let F = 0; F < c; F++) {
+          const q = e[U * c + F] - t[B * c + F];
+          k += q * q;
         }
-        const S = Math.pow(N, i), O = 2 * h * i / ((1e-3 + N) * (o * S + 1));
-        for (let U = 0; U < f; U++) {
-          const P = e[B * f + U] - n[M * f + U];
-          e[B * f + U] += v * q(O * P);
+        const E = Math.pow(k, i), P = 2 * h * i / ((1e-3 + k) * (o * E + 1));
+        for (let F = 0; F < c; F++) {
+          const q = e[U * c + F] - t[B * c + F];
+          e[U * c + F] += A * z(P * q);
         }
       }
-      b[x] += s[x] / d;
     }
   }
   return e;
 }
-function j() {
+function K() {
   return typeof navigator < "u" && !!navigator.gpu;
 }
-async function ae(e, n = {}, r) {
+async function re(e, t = {}, r) {
   const {
     nComponents: s = 2,
-    nNeighbors: t = 15,
-    minDist: p = 0.1,
-    spread: f = 1,
-    hnsw: l = {}
-  } = n, c = n.nEpochs ?? (e.length > 1e4 ? 200 : 500);
+    nNeighbors: n = 15,
+    minDist: g = 0.1,
+    spread: c = 1,
+    hnsw: d = {}
+  } = t, f = t.nEpochs ?? (e.length > 1e4 ? 200 : 500);
   console.time("knn");
-  const { indices: a, distances: o } = await Y(e, t, {
-    M: l.M ?? 16,
-    efConstruction: l.efConstruction ?? 200,
-    efSearch: l.efSearch ?? 50
+  const { indices: a, distances: o } = await Q(e, n, {
+    M: d.M ?? 16,
+    efConstruction: d.efConstruction ?? 200,
+    efSearch: d.efSearch ?? 50
   });
   console.timeEnd("knn"), console.time("fuzzy-set");
-  const i = D(a, o, t);
+  const i = L(a, o, n);
   console.timeEnd("fuzzy-set");
-  const { a: h, b: d } = K(p, f), u = I(i.vals, c), g = e.length, m = new Float32Array(g * s);
-  for (let b = 0; b < m.length; b++)
-    m[b] = Math.random() * 20 - 10;
+  const { a: h, b: l } = H(g, c), u = T(i.vals), p = e.length, m = new Float32Array(p * s);
+  for (let w = 0; w < m.length; w++)
+    m[w] = Math.random() * 20 - 10;
   console.time("sgd");
-  let w;
-  if (j())
+  let _;
+  if (K())
     try {
-      const b = new W();
-      await b.init(), w = await b.optimize(
+      const w = new j();
+      await w.init(), _ = await w.optimize(
         m,
         new Uint32Array(i.rows),
         new Uint32Array(i.cols),
         u,
-        g,
+        p,
         s,
-        c,
-        { a: h, b: d, gamma: 1, negativeSampleRate: 5 },
+        f,
+        { a: h, b: l, gamma: 1, negativeSampleRate: 5 },
         r
       );
-    } catch (b) {
-      console.warn("WebGPU SGD failed, falling back to CPU:", b), w = z(m, i, u, g, s, c, { a: h, b: d }, r);
+    } catch (w) {
+      console.warn("WebGPU SGD failed, falling back to CPU:", w), _ = I(m, i, u, p, s, f, { a: h, b: l }, r);
     }
   else
-    w = z(m, i, u, g, s, c, { a: h, b: d }, r);
-  return console.timeEnd("sgd"), w;
+    _ = I(m, i, u, p, s, f, { a: h, b: l }, r);
+  return console.timeEnd("sgd"), _;
 }
-function K(e, n) {
-  if (Math.abs(n - 1) < 1e-6 && Math.abs(e - 0.1) < 1e-6)
+function H(e, t) {
+  if (Math.abs(t - 1) < 1e-6 && Math.abs(e - 0.1) < 1e-6)
     return { a: 1.9292, b: 0.7915 };
-  if (Math.abs(n - 1) < 1e-6 && Math.abs(e - 0) < 1e-6)
+  if (Math.abs(t - 1) < 1e-6 && Math.abs(e - 0) < 1e-6)
     return { a: 1.8956, b: 0.8006 };
-  if (Math.abs(n - 1) < 1e-6 && Math.abs(e - 0.5) < 1e-6)
+  if (Math.abs(t - 1) < 1e-6 && Math.abs(e - 0.5) < 1e-6)
     return { a: 1.5769, b: 0.8951 };
-  const r = ee(e, n);
-  return { a: ne(e, n, r), b: r };
+  const r = te(e, t);
+  return { a: ne(e, t, r), b: r };
 }
-function ee(e, n) {
-  return 1 / (n * 1.2);
+function te(e, t) {
+  return 1 / (t * 1.2);
 }
-function ne(e, n, r) {
+function ne(e, t, r) {
   return e < 1e-6 ? 1.8956 : (1 / (1 + 1e-3) - 1) / -Math.pow(e, 2 * r);
 }
-class re {
-  constructor(n = {}) {
+class ie {
+  constructor(t = {}) {
     G(this, "_nComponents");
     G(this, "_nNeighbors");
     G(this, "_minDist");
@@ -435,8 +439,8 @@ class re {
     G(this, "embedding", null);
     G(this, "_hnswIndex", null);
     G(this, "_nTrain", 0);
-    this._nComponents = n.nComponents ?? 2, this._nNeighbors = n.nNeighbors ?? 15, this._minDist = n.minDist ?? 0.1, this._spread = n.spread ?? 1, this._nEpochs = n.nEpochs, this._hnswOpts = n.hnsw ?? {};
-    const { a: r, b: s } = K(this._minDist, this._spread);
+    this._nComponents = t.nComponents ?? 2, this._nNeighbors = t.nNeighbors ?? 15, this._minDist = t.minDist ?? 0.1, this._spread = t.spread ?? 1, this._nEpochs = t.nEpochs, this._hnswOpts = t.hnsw ?? {};
+    const { a: r, b: s } = H(this._minDist, this._spread);
     this._a = r, this._b = s;
   }
   /**
@@ -445,42 +449,42 @@ class re {
    * index so that transform() can project new points later.
    * Returns `this` for chaining.
    */
-  async fit(n, r) {
-    const s = n.length, t = this._nEpochs ?? (s > 1e4 ? 200 : 500), { M: p = 16, efConstruction: f = 200, efSearch: l = 50 } = this._hnswOpts;
+  async fit(t, r) {
+    const s = t.length, n = this._nEpochs ?? (s > 1e4 ? 200 : 500), { M: g = 16, efConstruction: c = 200, efSearch: d = 50 } = this._hnswOpts;
     console.time("knn");
-    const { knn: c, index: a } = await Q(n, this._nNeighbors, {
-      M: p,
-      efConstruction: f,
-      efSearch: l
+    const { knn: f, index: a } = await J(t, this._nNeighbors, {
+      M: g,
+      efConstruction: c,
+      efSearch: d
     });
     this._hnswIndex = a, this._nTrain = s, console.timeEnd("knn"), console.time("fuzzy-set");
-    const o = D(c.indices, c.distances, this._nNeighbors);
+    const o = L(f.indices, f.distances, this._nNeighbors);
     console.timeEnd("fuzzy-set");
-    const i = I(o.vals, t), h = new Float32Array(s * this._nComponents);
-    for (let d = 0; d < h.length; d++)
-      h[d] = Math.random() * 20 - 10;
-    if (console.time("sgd"), j())
+    const i = T(o.vals), h = new Float32Array(s * this._nComponents);
+    for (let l = 0; l < h.length; l++)
+      h[l] = Math.random() * 20 - 10;
+    if (console.time("sgd"), K())
       try {
-        const d = new W();
-        await d.init(), this.embedding = await d.optimize(
+        const l = new j();
+        await l.init(), this.embedding = await l.optimize(
           h,
           new Uint32Array(o.rows),
           new Uint32Array(o.cols),
           i,
           s,
           this._nComponents,
-          t,
+          n,
           { a: this._a, b: this._b, gamma: 1, negativeSampleRate: 5 },
           r
         );
-      } catch (d) {
-        console.warn("WebGPU SGD failed, falling back to CPU:", d), this.embedding = z(h, o, i, s, this._nComponents, t, {
+      } catch (l) {
+        console.warn("WebGPU SGD failed, falling back to CPU:", l), this.embedding = I(h, o, i, s, this._nComponents, n, {
           a: this._a,
           b: this._b
         }, r);
       }
     else
-      this.embedding = z(h, o, i, s, this._nComponents, t, {
+      this.embedding = I(h, o, i, s, this._nComponents, n, {
         a: this._a,
         b: this._b
       }, r);
@@ -497,35 +501,35 @@ class re {
    *   returned embedding to [0, 1].  The stored training embedding is never
    *   mutated.  Defaults to `false`.
    */
-  async transform(n, r = !1) {
+  async transform(t, r = !1) {
     if (!this._hnswIndex || !this.embedding)
       throw new Error("UMAP.transform() must be called after fit()");
-    const s = n.length, t = this._nEpochs ?? (this._nTrain > 1e4 ? 200 : 500), p = Math.max(100, Math.floor(t / 4)), f = this._hnswIndex.searchKnn(n, this._nNeighbors), l = J(f.indices, f.distances, this._nNeighbors), c = new Uint32Array(l.rows), a = new Uint32Array(l.cols), o = new Float32Array(s), i = new Float32Array(s * this._nComponents);
-    for (let u = 0; u < c.length; u++) {
-      const g = c[u], m = a[u], w = l.vals[u];
-      o[g] += w;
-      for (let b = 0; b < this._nComponents; b++)
-        i[g * this._nComponents + b] += w * this.embedding[m * this._nComponents + b];
+    const s = t.length, n = this._nEpochs ?? (this._nTrain > 1e4 ? 200 : 500), g = Math.max(100, Math.floor(n / 4)), c = this._hnswIndex.searchKnn(t, this._nNeighbors), d = X(c.indices, c.distances, this._nNeighbors), f = new Uint32Array(d.rows), a = new Uint32Array(d.cols), o = new Float32Array(s), i = new Float32Array(s * this._nComponents);
+    for (let u = 0; u < f.length; u++) {
+      const p = f[u], m = a[u], _ = d.vals[u];
+      o[p] += _;
+      for (let w = 0; w < this._nComponents; w++)
+        i[p * this._nComponents + w] += _ * this.embedding[m * this._nComponents + w];
     }
     for (let u = 0; u < s; u++)
       if (o[u] > 0)
-        for (let g = 0; g < this._nComponents; g++)
-          i[u * this._nComponents + g] /= o[u];
+        for (let p = 0; p < this._nComponents; p++)
+          i[u * this._nComponents + p] /= o[u];
       else
-        for (let g = 0; g < this._nComponents; g++)
-          i[u * this._nComponents + g] = Math.random() * 20 - 10;
-    const h = I(l.vals, p), d = $(
+        for (let p = 0; p < this._nComponents; p++)
+          i[u * this._nComponents + p] = Math.random() * 20 - 10;
+    const h = T(d.vals), l = ee(
       i,
       this.embedding,
-      l,
+      d,
       h,
       s,
       this._nTrain,
       this._nComponents,
-      p,
+      g,
       { a: this._a, b: this._b }
     );
-    return r ? T(d, s, this._nComponents) : d;
+    return r ? C(l, s, this._nComponents) : l;
   }
   /**
    * Convenience method equivalent to `fit(vectors)` followed by
@@ -536,37 +540,37 @@ class re {
    *   returned embedding to [0, 1].  `this.embedding` is never mutated.
    *   Defaults to `false`.
    */
-  async fit_transform(n, r, s = !1) {
-    return await this.fit(n, r), s ? T(this.embedding, n.length, this._nComponents) : this.embedding;
+  async fit_transform(t, r, s = !1) {
+    return await this.fit(t, r), s ? C(this.embedding, t.length, this._nComponents) : this.embedding;
   }
 }
-function T(e, n, r) {
+function C(e, t, r) {
   const s = new Float32Array(e.length);
-  for (let t = 0; t < r; t++) {
-    let p = 1 / 0, f = -1 / 0;
-    for (let c = 0; c < n; c++) {
-      const a = e[c * r + t];
-      a < p && (p = a), a > f && (f = a);
+  for (let n = 0; n < r; n++) {
+    let g = 1 / 0, c = -1 / 0;
+    for (let f = 0; f < t; f++) {
+      const a = e[f * r + n];
+      a < g && (g = a), a > c && (c = a);
     }
-    const l = f - p;
-    for (let c = 0; c < n; c++)
-      s[c * r + t] = l > 0 ? (e[c * r + t] - p) / l : 0;
+    const d = c - g;
+    for (let f = 0; f < t; f++)
+      s[f * r + n] = d > 0 ? (e[f * r + n] - g) / d : 0;
   }
   return s;
 }
-function I(e, n) {
+function T(e, t) {
   let r = -1 / 0;
-  for (let t = 0; t < e.length; t++)
-    e[t] > r && (r = e[t]);
+  for (let n = 0; n < e.length; n++)
+    e[n] > r && (r = e[n]);
   const s = new Float32Array(e.length);
-  for (let t = 0; t < e.length; t++) {
-    const p = e[t] / r;
-    s[t] = p > 0 ? n / p : -1;
+  for (let n = 0; n < e.length; n++) {
+    const g = e[n] / r;
+    s[n] = g > 0 ? 1 / g : -1;
   }
   return s;
 }
 export {
-  re as UMAP,
-  ae as fit,
-  j as isWebGPUAvailable
+  ie as UMAP,
+  re as fit,
+  K as isWebGPUAvailable
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "umap-gpu",
-  "version": "0.2.11",
+  "version": "0.2.13",
   "description": "UMAP with HNSW kNN and WebGPU-accelerated SGD",
   "type": "module",
   "main": "dist/index.js",