fix: resolve lint and TypeScript errors in CI

Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>

Author: github-actions[bot]

src/metrics/cluster_metrics.ts

@@ -19,8 +19,7 @@ export function calinskiHarabaszScore(
   // Global centroid
   const globalMean = new Float64Array(d);
   for (const x of X)
-    for (let j = 0; j < d; j++)
-      globalMean[j] = (globalMean[j] ?? 0) + (x[j] ?? 0) / n;
+    for (let j = 0; j < d; j++) globalMean[j] = (globalMean[j] ?? 0) + (x[j] ?? 0) / n;
 
   // Between-cluster dispersion
   let bcd = 0;
@@ -29,8 +28,7 @@ export function calinskiHarabaszScore(
     const nc = mask.filter(Boolean).length;
     const cm = new Float64Array(d);
     for (let i = 0; i < n; i++)
-      if (mask[i])
-        for (let j = 0; j < d; j++) cm[j] = (cm[j] ?? 0) + (X[i]?.[j] ?? 0) / nc;
+      if (mask[i]) for (let j = 0; j < d; j++) cm[j] = (cm[j] ?? 0) + (X[i]?.[j] ?? 0) / nc;
     for (let j = 0; j < d; j++) bcd += nc * (cm[j]! - globalMean[j]!) ** 2;
   }
 
@@ -42,8 +40,7 @@ export function calinskiHarabaszScore(
     if (nc === 0) continue;
     const cm = new Float64Array(d);
     for (let i = 0; i < n; i++)
-      if (mask[i])
-        for (let j = 0; j < d; j++) cm[j] = (cm[j] ?? 0) + (X[i]?.[j] ?? 0) / nc;
+      if (mask[i]) for (let j = 0; j < d; j++) cm[j] = (cm[j] ?? 0) + (X[i]?.[j] ?? 0) / nc;
     for (let i = 0; i < n; i++) {
       if (!mask[i]) continue;
       for (let j = 0; j < d; j++) wcd += ((X[i]?.[j] ?? 0) - cm[j]!) ** 2;
@@ -75,8 +72,7 @@ export function daviesBouldinScore(
     const nc = mask.filter(Boolean).length;
     const cm = new Float64Array(d);
     for (let i = 0; i < n; i++)
-      if (mask[i])
-        for (let j = 0; j < d; j++) cm[j] = (cm[j] ?? 0) + (X[i]?.[j] ?? 0) / nc;
+      if (mask[i]) for (let j = 0; j < d; j++) cm[j] = (cm[j] ?? 0) + (X[i]?.[j] ?? 0) / nc;
     centroids.push(cm);
     let scatter = 0;
     for (let i = 0; i < n; i++) {
@@ -168,12 +164,11 @@ export function xieBeniIndex(
     for (let c = 0; c < k; c++) {
       const mu = (membershipMatrix[i]?.[c] ?? 0) ** m;
       membershipSums[c] = (membershipSums[c] ?? 0) + mu;
-      for (let j = 0; j < d; j++)
-        centroids[c]![j] = (centroids[c]![j] ?? 0) + mu * (X[i]?.[j] ?? 0);
+      for (let j = 0; j < d; j++) centroids[c]![j] = (centroids[c]![j] ?? 0) + mu * (X[i]?.[j] ?? 0);
     }
   }
   for (let c = 0; c < k; c++) {
-    for (let j = 0; j < d; j++) centroids[c]![j] = (centroids[c]![j] ?? 0) / ((membershipSums[c] ?? 1) || 1);
+    for (let j = 0; j < d; j++) centroids[c]![j] = (centroids[c]![j] ?? 0) / (membershipSums[c] ?? 1 || 1);
   }
 
   // Compactness