@wbern/obscene 1.0.1 → 1.1.0

package/dist/cli.js

@@ -344,6 +344,62 @@ function getNestingDepths(filePaths) {
   }
   return depths;
 }
+var RRF_K = 10;
+function computeComposite(rankings, churn, top) {
+  const fileScores = /* @__PURE__ */ new Map();
+  for (const ranking of Object.values(rankings)) {
+    for (let i = 0; i < ranking.entries.length; i++) {
+      const file = ranking.entries[i].file;
+      const rrf = 1 / (RRF_K + i + 1);
+      const existing = fileScores.get(file);
+      if (existing) {
+        existing.score += rrf;
+        existing.dims += 1;
+      } else {
+        fileScores.set(file, { score: rrf, dims: 1 });
+      }
+    }
+  }
+  const entries = [];
+  for (const [file, data] of fileScores) {
+    entries.push({
+      file,
+      score: Math.round(data.score * 1e4) / 1e4,
+      percentOfTotal: 0,
+      tier: "stable",
+      churn: churn.get(file) ?? 0,
+      dimensionCount: data.dims
+    });
+  }
+  entries.sort((a, b) => b.score - a.score);
+  const totalScore = entries.reduce((sum, e) => sum + e.score, 0);
+  if (totalScore === 0) {
+    return {
+      label: "Combined",
+      scoreFormula: "reciprocal rank fusion across all dimensions",
+      totalScore: 0,
+      tierCounts: { danger: 0, watch: 0, stable: 0 },
+      totalEntries: 0,
+      showing: 0,
+      entries: []
+    };
+  }
+  assignTiers(entries, totalScore);
+  const limited = top > 0 ? entries.slice(0, top) : entries;
+  const tierCounts = { danger: 0, watch: 0, stable: 0 };
+  for (const e of entries) {
+    tierCounts[e.tier]++;
+  }
+  return {
+    label: "Combined",
+    scoreFormula: "reciprocal rank fusion across all dimensions",
+    totalScore: Math.round(totalScore * 1e4) / 1e4,
+    tierCounts,
+    totalEntries: entries.length,
+    showing: limited.length,
+    entries: limited
+  };
+}
 
 // src/color.ts
 import pc from "picocolors";
@@ -590,10 +646,29 @@ function formatCouplingTable(output) {
   lines.push("Docs: https://github.com/wbern/obscene#metrics");
   return lines.join("\n");
 }
+function formatCompositeTable(output) {
+  const lines = [];
+  lines.push(
+    `${output.label} \u2014 Total score: ${output.totalScore.toLocaleString()}`
+  );
+  lines.push(
+    ...tierSummary(output.tierCounts, output.showing, output.totalEntries)
+  );
+  lines.push("");
+  lines.push(
+    padRight("File", 50) + padLeft("Score", 9) + padLeft("Churn", 7) + padLeft("Dims", 6) + padLeft("Tier", 12)
+  );
+  lines.push("\u2500".repeat(84));
+  for (const entry of output.entries) {
+    const rawRow = padRight(truncate(entry.file, 48), 50) + padLeft(entry.score.toFixed(4), 9) + padLeft(String(entry.churn), 7) + padLeft(`${entry.dimensionCount}/4`, 6) + padLeft(tierLabel(entry.tier), 12);
+    lines.push(colorRow(entry.tier, rawRow));
+  }
+  return lines.join("\n");
+}
 
 // src/cli.ts
 var program = new Command();
-program.name("obscene").description("Identify hotspot files \u2014 complex code that changes frequently").version("1.0.1");
+program.name("obscene").description("Identify hotspot files \u2014 complex code that changes frequently").version("1.1.0");
 var REPORT_GUIDE = {
   complexity: "Cyclomatic complexity (branch/loop count). NOT a quality judgment \u2014 a 500-line parser will naturally score high. Compare density, not raw values.",
   complexityDensity: "Complexity per line of code. Normalizes for file size. >0.25 suggests dense logic worth reviewing; <0.10 is typical for straightforward code.",
@@ -605,6 +680,7 @@ var HOTSPOTS_GUIDE = {
   nesting: "maxNesting \xD7 churn. Deeply nested code that changes often is harder to reason about.",
   defects: "defects \xD7 churn. Files with fix: commits that also churn heavily may contain latent bugs.",
   authors: "authors \xD7 churn. Files touched by many authors and changing often may lack clear ownership.",
+  composite: "Combined ranking using Reciprocal Rank Fusion (RRF) across all dimensions. Files appearing near the top of multiple rankings score highest.",
   tier: "Relative ranking within THIS codebase (top 50% = danger, next 30% = watch, bottom 20% = stable). NOT an absolute quality grade."
 };
 var COUPLING_GUIDE = {
@@ -695,15 +771,22 @@ function runHotspots(opts) {
     authors,
     top
   );
+  const composite = computeComposite(rankings, churn, top);
   const output = {
     generated: (/* @__PURE__ */ new Date()).toISOString(),
     guide: HOTSPOTS_GUIDE,
     churnWindow: `${months} months`,
-    rankings
+    rankings,
+    composite
   };
   if (opts.format === "table") {
     process.stdout.write(`${formatHotspotsTable(output)}
 `);
+    if (composite.entries.length > 0) {
+      process.stdout.write(`
+${formatCompositeTable(composite)}
+`);
+    }
   } else {
     process.stdout.write(`${JSON.stringify(output, null, 2)}
 `);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@wbern/obscene",
-  "version": "1.0.1",
+  "version": "1.1.0",
   "description": "Identify hotspot files — complex code that changes frequently. Churn × complexity analysis for any git repo.",
   "type": "module",
   "bin": {