codebase-onboarder 0.6.0 → 0.7.0

package/shared/analyzer/history.js

@@ -7,140 +7,139 @@
 // Everything is keyed on file path, which is already the join key the rest of
 // the engine speaks — complexity comes over from scan.files, structural edges
 // from scan.edges, and the two views of "these change together" sit side by side.
-
 import { baseName } from './pathUtil.js';
-
 // Commits touching more files than this are skipped for pair counting, not for
 // churn — a 900-file reformat or a mass rename would otherwise contribute
 // C(900,2) ≈ 400k pairs of noise to co-change while saying nothing about
 // coupling. Churn still counts them; every file in them was really touched.
 const MAX_COMMIT_FILES_FOR_PAIRS = 50;
-
 // Once this many distinct pairs are tracked, new pairs stop being recorded and
 // only existing ones keep counting. A hard bound on memory for repos with long
 // histories of small commits; the top of the list is decided well before this.
 const MAX_TRACKED_PAIRS = 5000;
-
 export function analyzeHistory(scan, commits, opts = {}) {
-  const totalCommits = opts.totalCommits ?? commits.length;
-  const truncated = totalCommits > commits.length;
-
-  // ---- per-file rollup -----------------------------------------------------
-  // One pass over every commit's file list. Authors are identified by email —
-  // names collide and change; the email is what git itself keys identity on.
-  const churn = new Map();     // path -> commit count
-  const authorsOf = new Map(); // path -> Map(email -> display name)
-  const firstSeen = new Map(); // path -> earliest commit date (ISO strings sort)
-  const lastTouched = new Map();
-  const authorCommits = new Map(); // email -> { name, commits }
-  let pathsGone = 0;
-
-  for (const c of commits) {
-    const date = c.date || '';
-    const known = authorCommits.get(c.author?.email);
-    if (known) known.commits++;
-    else if (c.author?.email) authorCommits.set(c.author.email, { name: c.author.name || c.author.email, commits: 1 });
-
-    for (const p of c.files || []) {
-      churn.set(p, (churn.get(p) || 0) + 1);
-      if (!firstSeen.has(p) || date < firstSeen.get(p)) firstSeen.set(p, date);
-      if (!lastTouched.has(p) || date > lastTouched.get(p)) lastTouched.set(p, date);
-      let byEmail = authorsOf.get(p);
-      if (!byEmail) { byEmail = new Map(); authorsOf.set(p, byEmail); }
-      if (!byEmail.has(c.author?.email)) byEmail.set(c.author?.email, c.author?.name || c.author?.email || '?');
+    const totalCommits = opts.totalCommits ?? commits.length;
+    const truncated = totalCommits > commits.length;
+    // ---- per-file rollup -----------------------------------------------------
+    // One pass over every commit's file list. Authors are identified by email —
+    // names collide and change; the email is what git itself keys identity on.
+    const churn = new Map(); // path -> commit count
+    const authorsOf = new Map(); // path -> Map(email -> display name)
+    const firstSeen = new Map(); // path -> earliest commit date (ISO strings sort)
+    const lastTouched = new Map();
+    const authorCommits = new Map(); // email -> { name, commits }
+    let pathsGone = 0;
+    for (const c of commits) {
+        const date = c.date || '';
+        const known = authorCommits.get(c.author?.email);
+        if (known)
+            known.commits++;
+        else if (c.author?.email)
+            authorCommits.set(c.author.email, { name: c.author.name || c.author.email, commits: 1 });
+        for (const p of c.files || []) {
+            churn.set(p, (churn.get(p) || 0) + 1);
+            if (!firstSeen.has(p) || date < firstSeen.get(p))
+                firstSeen.set(p, date);
+            if (!lastTouched.has(p) || date > lastTouched.get(p))
+                lastTouched.set(p, date);
+            let byEmail = authorsOf.get(p);
+            if (!byEmail) {
+                byEmail = new Map();
+                authorsOf.set(p, byEmail);
+            }
+            if (!byEmail.has(c.author?.email))
+                byEmail.set(c.author?.email, c.author?.name || c.author?.email || '?');
+        }
     }
-  }
-
-  // ---- join with the scan ---------------------------------------------------
-  // Complexity lives on scan.files; history paths that are not in the scan are
-  // files deleted or renamed inside the window. They had churn once — counted,
-  // then set aside rather than silently mixed into rankings of files that no
-  // longer exist.
-  const cxOf = new Map(scan.files.map((f) => [f.path, f.complexity || 1]));
-  for (const p of churn.keys()) if (!cxOf.has(p)) pathsGone++;
-
-  const live = [...churn.entries()].filter(([p]) => cxOf.has(p));
-  const maxChurn = Math.max(1, ...live.map(([, n]) => n));
-  const maxCx = Math.max(1, ...live.map(([p]) => cxOf.get(p)));
-
-  const perFile = live.map(([p, n]) => {
-    const authors = authorsOf.get(p).size;
+    // ---- join with the scan ---------------------------------------------------
+    // Complexity lives on scan.files; history paths that are not in the scan are
+    // files deleted or renamed inside the window. They had churn once — counted,
+    // then set aside rather than silently mixed into rankings of files that no
+    // longer exist.
+    const cxOf = new Map(scan.files.map((f) => [f.path, f.complexity || 1]));
+    for (const p of churn.keys())
+        if (!cxOf.has(p))
+            pathsGone++;
+    const live = [...churn.entries()].filter(([p]) => cxOf.has(p));
+    const maxChurn = Math.max(1, ...live.map(([, n]) => n));
+    const maxCx = Math.max(1, ...live.map(([p]) => cxOf.get(p)));
+    const perFile = live.map(([p, n]) => {
+        const authors = authorsOf.get(p).size;
+        return {
+            path: p,
+            name: baseName(p),
+            churn: n,
+            authors,
+            solo: authors === 1,
+            firstSeen: firstSeen.get(p),
+            lastTouched: lastTouched.get(p),
+            complexity: cxOf.get(p),
+            // The cross-tab: both axes normalized against the repo's own worst, so
+            // the score reads "how far up both columns at once" and a file maxing
+            // one axis but not the other cannot outrank one high on both.
+            hotspot: Math.round(100 * (n / maxChurn) * (cxOf.get(p) / maxCx)),
+        };
+    });
+    perFile.sort((a, b) => b.hotspot - a.hotspot || b.churn - a.churn || a.path.localeCompare(b.path));
+    const byPath = {};
+    for (const row of perFile)
+        byPath[row.path] = row;
+    const soloFiles = perFile.filter((r) => r.solo && r.churn >= 3).length;
+    const dates = commits.map((c) => c.date).filter(Boolean);
     return {
-      path: p,
-      name: baseName(p),
-      churn: n,
-      authors,
-      solo: authors === 1,
-      firstSeen: firstSeen.get(p),
-      lastTouched: lastTouched.get(p),
-      complexity: cxOf.get(p),
-      // The cross-tab: both axes normalized against the repo's own worst, so
-      // the score reads "how far up both columns at once" and a file maxing
-      // one axis but not the other cannot outrank one high on both.
-      hotspot: Math.round(100 * (n / maxChurn) * (cxOf.get(p) / maxCx)),
+        available: true,
+        commitCount: commits.length,
+        totalCommits,
+        truncated,
+        // The raw commit list, not just the rollups. The insights view draws a
+        // 52-week heatmap and a punch card from per-commit dates; without the
+        // original array, that view rendered an empty calendar even when history
+        // was fully available. The cost is the same parsed commits we already hold
+        // — `parseGitLog` capped at 2,000 — so duplication here is honest.
+        commits,
+        authors: [...authorCommits.values()].sort((a, b) => b.commits - a.commits),
+        firstCommitAt: dates.length ? dates.reduce((a, b) => (a < b ? a : b)) : null,
+        lastCommitAt: dates.length ? dates.reduce((a, b) => (a > b ? a : b)) : null,
+        perFile,
+        byPath,
+        soloFiles,
+        coChanged: coChangePairs(commits, new Set(scan.edges.map((e) => e.from + '->' + e.to))),
+        pathsGone,
     };
-  });
-  perFile.sort((a, b) => b.hotspot - a.hotspot || b.churn - a.churn || a.path.localeCompare(b.path));
-
-  const byPath = {};
-  for (const row of perFile) byPath[row.path] = row;
-  const soloFiles = perFile.filter((r) => r.solo && r.churn >= 3).length;
-
-  const dates = commits.map((c) => c.date).filter(Boolean);
-
-  return {
-    available: true,
-    commitCount: commits.length,
-    totalCommits,
-    truncated,
-    // The raw commit list, not just the rollups. The insights view draws a
-    // 52-week heatmap and a punch card from per-commit dates; without the
-    // original array, that view rendered an empty calendar even when history
-    // was fully available. The cost is the same parsed commits we already hold
-    // — `parseGitLog` capped at 2,000 — so duplication here is honest.
-    commits,
-    authors: [...authorCommits.values()].sort((a, b) => b.commits - a.commits),
-    firstCommitAt: dates.length ? dates.reduce((a, b) => (a < b ? a : b)) : null,
-    lastCommitAt: dates.length ? dates.reduce((a, b) => (a > b ? a : b)) : null,
-    perFile,
-    byPath,
-    soloFiles,
-    coChanged: coChangePairs(commits, new Set(scan.edges.map((e) => e.from + '->' + e.to))),
-    pathsGone,
-  };
 }
-
 // Files that keep turning up in the same commit without importing each other.
 // The structural coupling matrix already shows what imports what; this is the
 // contrast — changes that travel together for reasons the import graph does
 // not know about (shared schema, feature pairs, copy-paste siblings).
 function coChangePairs(commits, structuralEdges) {
-  const pairs = new Map(); // 'a|b' (sorted) -> count
-
-  for (const c of commits) {
-    const files = c.files || [];
-    if (files.length < 2 || files.length > MAX_COMMIT_FILES_FOR_PAIRS) continue;
-    for (let i = 0; i < files.length; i++) {
-      for (let j = i + 1; j < files.length; j++) {
-        const a = files[i] < files[j] ? files[i] : files[j];
-        const b = files[i] < files[j] ? files[j] : files[i];
-        if (structuralEdges.has(a + '->' + b) || structuralEdges.has(b + '->' + a)) continue;
-        const key = a + '|' + b;
-        const seen = pairs.get(key);
-        if (seen) seen.count++;
-        else if (pairs.size < MAX_TRACKED_PAIRS) pairs.set(key, { a, b, count: 1 });
-      }
+    const pairs = new Map(); // 'a|b' (sorted) -> count
+    for (const c of commits) {
+        const files = c.files || [];
+        if (files.length < 2 || files.length > MAX_COMMIT_FILES_FOR_PAIRS)
+            continue;
+        for (let i = 0; i < files.length; i++) {
+            for (let j = i + 1; j < files.length; j++) {
+                const a = files[i] < files[j] ? files[i] : files[j];
+                const b = files[i] < files[j] ? files[j] : files[i];
+                if (structuralEdges.has(a + '->' + b) || structuralEdges.has(b + '->' + a))
+                    continue;
+                const key = a + '|' + b;
+                const seen = pairs.get(key);
+                if (seen)
+                    seen.count++;
+                else if (pairs.size < MAX_TRACKED_PAIRS)
+                    pairs.set(key, { a, b, count: 1 });
+            }
+        }
     }
-  }
-
-  return [...pairs.values()]
-    .filter((p) => p.count >= 2) // once is coincidence; the plan is about habits
-    .sort((x, y) => y.count - x.count || x.a.localeCompare(y.a))
-    .slice(0, 20);
+    return [...pairs.values()]
+        .filter((p) => p.count >= 2) // once is coincidence; the plan is about habits
+        .sort((x, y) => y.count - x.count || x.a.localeCompare(y.a))
+        .slice(0, 20);
 }
-
 // The shape callers should hold when there is nothing to analyze — same fields,
 // honest reason. Views render this instead of inventing zeros.
 export function unavailableHistory(reason) {
-  return { available: false, reason };
+    return { available: false, reason };
 }
+//# sourceMappingURL=history.js.map

package/shared/analyzer/history.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"history.js","sourceRoot":"","sources":["../../src/shared/analyzer/history.ts"],"names":[],"mappings":"AAAA,sEAAsE;AACtE,+EAA+E;AAC/E,+EAA+E;AAC/E,uDAAuD;AACvD,EAAE;AACF,mFAAmF;AACnF,8EAA8E;AAC9E,8EAA8E;AAC9E,kFAAkF;AAElF,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAEzC,+EAA+E;AAC/E,0EAA0E;AAC1E,yEAAyE;AACzE,4EAA4E;AAC5E,MAAM,0BAA0B,GAAG,EAAE,CAAC;AAEtC,+EAA+E;AAC/E,+EAA+E;AAC/E,+EAA+E;AAC/E,MAAM,iBAAiB,GAAG,IAAI,CAAC;AAE/B,MAAM,UAAU,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,GAAwB,EAAE;IAC1E,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,OAAO,CAAC,MAAM,CAAC;IACzD,MAAM,SAAS,GAAG,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC;IAEhD,6EAA6E;IAC7E,4EAA4E;IAC5E,2EAA2E;IAC3E,MAAM,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC,CAAK,uBAAuB;IACpD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,qCAAqC;IAClE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,kDAAkD;IAC/E,MAAM,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;IAC9B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,6BAA6B;IAC9D,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACjD,IAAI,KAAK;YAAE,KAAK,CAAC,OAAO,EAAE,CAAC;aACtB,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK;YAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;QAEnH,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YAC9B,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACzE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC/E,IAAI,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,OAAO,EAAE,CAAC;gBAAC,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;gBAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAAC,CAAC;YACjE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK,IAAI,GAAG,CAAC,CAAC;QAC5G,CAAC;IACH,CAAC;IAED,8EAA8E;IAC9E,6EAA6E;IAC7E,6EAA6E;IAC7E,2EAA2E;IAC3E,gBAAgB;IAChB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAiB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE;QAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS,EAAE,CAAC;IAE5D,MAAM,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE;QAClC,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACtC,OAAO;YACL,IAAI,EAAE,CAAC;YACP,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;YACjB,KAAK,EAAE,CAAC;YACR,OAAO;YACP,IAAI,EAAE,OAAO,KAAK,CAAC;YACnB,SAAS,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3B,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/B,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACvB,uEAAuE;YACvE,sEAAsE;YACtE,8DAA8D;YAC9D,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;SAClE,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAEnG,MAAM,MAAM,GAAwB,EAAE,CAAC;IACvC,KAAK,MAAM,GAAG,IAAI,OAAO;QAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;IAClD,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IAEvE,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAEzD,OAAO;QACL,SAAS,EAAE,IAAI;QACf,WAAW,EAAE,OAAO,CAAC,MAAM;QAC3B,YAAY;QACZ,SAAS;QACT,uEAAuE;QACvE,sEAAsE;QACtE,yEAAyE;QACzE,2EAA2E;QAC3E,mEAAmE;QACnE,OAAO;QACP,OAAO,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC;QAC1E,aAAa,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QAC5E,YAAY,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QAC3E,OAAO;QACP,MAAM;QACN,SAAS;QACT,SAAS,EAAE,aAAa,CAAC,OAAO,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvF,SAAS;KACV,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,8EAA8E;AAC9E,4EAA4E;AAC5E,sEAAsE;AACtE,SAAS,aAAa,CAAC,OAAO,EAAE,eAAe;IAC7C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,0BAA0B;IAEnD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,0BAA0B;YAAE,SAAS;QAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpD,IAAI,eAAe,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,eAAe,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;oBAAE,SAAS;gBACrF,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;gBACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC5B,IAAI,IAAI;oBAAE,IAAI,CAAC,KAAK,EAAE,CAAC;qBAClB,IAAI,KAAK,CAAC,IAAI,GAAG,iBAAiB;oBAAE,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9E,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;SACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,gDAAgD;SAC5E,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3D,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAClB,CAAC;AAED,gFAAgF;AAChF,+DAA+D;AAC/D,MAAM,UAAU,kBAAkB,CAAC,MAAM;IACvC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AACtC,CAAC","sourcesContent":["// Git history analysis: churn, authorship, the hotspot cross-tab, and\n// temporal co-change coupling. Pure — the commits arrive as plain data from an\n// injected provider (the server's `gitLog`), exactly as `scanRepo` takes files\n// through `FileSource`. Nothing here knows git exists.\n//\n// The unit of history is a commit: { hash, author: { name, email }, date, files }.\n// Everything is keyed on file path, which is already the join key the rest of\n// the engine speaks — complexity comes over from scan.files, structural edges\n// from scan.edges, and the two views of \"these change together\" sit side by side.\n\nimport { baseName } from './pathUtil.js';\n\n// Commits touching more files than this are skipped for pair counting, not for\n// churn — a 900-file reformat or a mass rename would otherwise contribute\n// C(900,2) ≈ 400k pairs of noise to co-change while saying nothing about\n// coupling. Churn still counts them; every file in them was really touched.\nconst MAX_COMMIT_FILES_FOR_PAIRS = 50;\n\n// Once this many distinct pairs are tracked, new pairs stop being recorded and\n// only existing ones keep counting. A hard bound on memory for repos with long\n// histories of small commits; the top of the list is decided well before this.\nconst MAX_TRACKED_PAIRS = 5000;\n\nexport function analyzeHistory(scan, commits, opts: Record<string, any> = {}) {\n  const totalCommits = opts.totalCommits ?? commits.length;\n  const truncated = totalCommits > commits.length;\n\n  // ---- per-file rollup -----------------------------------------------------\n  // One pass over every commit's file list. Authors are identified by email —\n  // names collide and change; the email is what git itself keys identity on.\n  const churn = new Map();     // path -> commit count\n  const authorsOf = new Map(); // path -> Map(email -> display name)\n  const firstSeen = new Map(); // path -> earliest commit date (ISO strings sort)\n  const lastTouched = new Map();\n  const authorCommits = new Map(); // email -> { name, commits }\n  let pathsGone = 0;\n\n  for (const c of commits) {\n    const date = c.date || '';\n    const known = authorCommits.get(c.author?.email);\n    if (known) known.commits++;\n    else if (c.author?.email) authorCommits.set(c.author.email, { name: c.author.name || c.author.email, commits: 1 });\n\n    for (const p of c.files || []) {\n      churn.set(p, (churn.get(p) || 0) + 1);\n      if (!firstSeen.has(p) || date < firstSeen.get(p)) firstSeen.set(p, date);\n      if (!lastTouched.has(p) || date > lastTouched.get(p)) lastTouched.set(p, date);\n      let byEmail = authorsOf.get(p);\n      if (!byEmail) { byEmail = new Map(); authorsOf.set(p, byEmail); }\n      if (!byEmail.has(c.author?.email)) byEmail.set(c.author?.email, c.author?.name || c.author?.email || '?');\n    }\n  }\n\n  // ---- join with the scan ---------------------------------------------------\n  // Complexity lives on scan.files; history paths that are not in the scan are\n  // files deleted or renamed inside the window. They had churn once — counted,\n  // then set aside rather than silently mixed into rankings of files that no\n  // longer exist.\n  const cxOf = new Map<string, number>(scan.files.map((f) => [f.path, f.complexity || 1]));\n  for (const p of churn.keys()) if (!cxOf.has(p)) pathsGone++;\n\n  const live = [...churn.entries()].filter(([p]) => cxOf.has(p));\n  const maxChurn = Math.max(1, ...live.map(([, n]) => n));\n  const maxCx = Math.max(1, ...live.map(([p]) => cxOf.get(p)));\n\n  const perFile = live.map(([p, n]) => {\n    const authors = authorsOf.get(p).size;\n    return {\n      path: p,\n      name: baseName(p),\n      churn: n,\n      authors,\n      solo: authors === 1,\n      firstSeen: firstSeen.get(p),\n      lastTouched: lastTouched.get(p),\n      complexity: cxOf.get(p),\n      // The cross-tab: both axes normalized against the repo's own worst, so\n      // the score reads \"how far up both columns at once\" and a file maxing\n      // one axis but not the other cannot outrank one high on both.\n      hotspot: Math.round(100 * (n / maxChurn) * (cxOf.get(p) / maxCx)),\n    };\n  });\n  perFile.sort((a, b) => b.hotspot - a.hotspot || b.churn - a.churn || a.path.localeCompare(b.path));\n\n  const byPath: Record<string, any> = {};\n  for (const row of perFile) byPath[row.path] = row;\n  const soloFiles = perFile.filter((r) => r.solo && r.churn >= 3).length;\n\n  const dates = commits.map((c) => c.date).filter(Boolean);\n\n  return {\n    available: true,\n    commitCount: commits.length,\n    totalCommits,\n    truncated,\n    // The raw commit list, not just the rollups. The insights view draws a\n    // 52-week heatmap and a punch card from per-commit dates; without the\n    // original array, that view rendered an empty calendar even when history\n    // was fully available. The cost is the same parsed commits we already hold\n    // — `parseGitLog` capped at 2,000 — so duplication here is honest.\n    commits,\n    authors: [...authorCommits.values()].sort((a, b) => b.commits - a.commits),\n    firstCommitAt: dates.length ? dates.reduce((a, b) => (a < b ? a : b)) : null,\n    lastCommitAt: dates.length ? dates.reduce((a, b) => (a > b ? a : b)) : null,\n    perFile,\n    byPath,\n    soloFiles,\n    coChanged: coChangePairs(commits, new Set(scan.edges.map((e) => e.from + '->' + e.to))),\n    pathsGone,\n  };\n}\n\n// Files that keep turning up in the same commit without importing each other.\n// The structural coupling matrix already shows what imports what; this is the\n// contrast — changes that travel together for reasons the import graph does\n// not know about (shared schema, feature pairs, copy-paste siblings).\nfunction coChangePairs(commits, structuralEdges) {\n  const pairs = new Map(); // 'a|b' (sorted) -> count\n\n  for (const c of commits) {\n    const files = c.files || [];\n    if (files.length < 2 || files.length > MAX_COMMIT_FILES_FOR_PAIRS) continue;\n    for (let i = 0; i < files.length; i++) {\n      for (let j = i + 1; j < files.length; j++) {\n        const a = files[i] < files[j] ? files[i] : files[j];\n        const b = files[i] < files[j] ? files[j] : files[i];\n        if (structuralEdges.has(a + '->' + b) || structuralEdges.has(b + '->' + a)) continue;\n        const key = a + '|' + b;\n        const seen = pairs.get(key);\n        if (seen) seen.count++;\n        else if (pairs.size < MAX_TRACKED_PAIRS) pairs.set(key, { a, b, count: 1 });\n      }\n    }\n  }\n\n  return [...pairs.values()]\n    .filter((p) => p.count >= 2) // once is coincidence; the plan is about habits\n    .sort((x, y) => y.count - x.count || x.a.localeCompare(y.a))\n    .slice(0, 20);\n}\n\n// The shape callers should hold when there is nothing to analyze — same fields,\n// honest reason. Views render this instead of inventing zeros.\nexport function unavailableHistory(reason) {\n  return { available: false, reason };\n}\n"]}

package/shared/analyzer/jsonConfig.d.ts

@@ -0,0 +1,2 @@
+/** Parse TypeScript's JSON-with-comments configs without altering quoted paths. */
+export declare function parseJsonConfig(text: string): unknown;

package/shared/analyzer/jsonConfig.js

@@ -0,0 +1,61 @@
+/** Parse TypeScript's JSON-with-comments configs without altering quoted paths. */
+export function parseJsonConfig(text) {
+    const characters = text.split('');
+    let quoted = false;
+    for (let i = 0; i < text.length; i++) {
+        const character = text[i];
+        if (quoted) {
+            if (character === '\\')
+                i++;
+            else if (character === '"')
+                quoted = false;
+            continue;
+        }
+        if (character === '"') {
+            quoted = true;
+            continue;
+        }
+        if (character === '/' && text[i + 1] === '/') {
+            while (i < text.length && text[i] !== '\n')
+                characters[i++] = ' ';
+        }
+        else if (character === '/' && text[i + 1] === '*') {
+            characters[i++] = ' ';
+            characters[i++] = ' ';
+            while (i < text.length && !(text[i] === '*' && text[i + 1] === '/')) {
+                if (text[i] !== '\n' && text[i] !== '\r')
+                    characters[i] = ' ';
+                i++;
+            }
+            if (i >= text.length)
+                throw new SyntaxError('Unterminated config comment.');
+            characters[i++] = ' ';
+            characters[i] = ' ';
+        }
+    }
+    // JSONC also accepts trailing commas. Handle them only outside strings.
+    quoted = false;
+    for (let i = 0; i < characters.length; i++) {
+        const character = characters[i];
+        if (quoted) {
+            if (character === '\\')
+                i++;
+            else if (character === '"')
+                quoted = false;
+            continue;
+        }
+        if (character === '"') {
+            quoted = true;
+            continue;
+        }
+        if (character !== ',')
+            continue;
+        let next = i + 1;
+        while (next < characters.length && /\s/.test(characters[next]))
+            next++;
+        if (characters[next] === '}' || characters[next] === ']')
+            characters[i] = ' ';
+    }
+    return JSON.parse(characters.join(''));
+}
+//# sourceMappingURL=jsonConfig.js.map

package/shared/analyzer/jsonConfig.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"jsonConfig.js","sourceRoot":"","sources":["../../src/shared/analyzer/jsonConfig.ts"],"names":[],"mappings":"AAAA,mFAAmF;AACnF,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAClC,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,SAAS,KAAK,IAAI;gBAAE,CAAC,EAAE,CAAC;iBACvB,IAAI,SAAS,KAAK,GAAG;gBAAE,MAAM,GAAG,KAAK,CAAC;YAC3C,SAAS;QACX,CAAC;QACD,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;YAAC,MAAM,GAAG,IAAI,CAAC;YAAC,SAAS;QAAC,CAAC;QACnD,IAAI,SAAS,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAC7C,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QACpE,CAAC;aAAM,IAAI,SAAS,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACpD,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YACtB,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YACtB,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;gBACpE,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;oBAAE,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBAC9D,CAAC,EAAE,CAAC;YACN,CAAC;YACD,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM;gBAAE,MAAM,IAAI,WAAW,CAAC,8BAA8B,CAAC,CAAC;YAC5E,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;YACtB,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,CAAC;IACH,CAAC;IACD,wEAAwE;IACxE,MAAM,GAAG,KAAK,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,SAAS,KAAK,IAAI;gBAAE,CAAC,EAAE,CAAC;iBACvB,IAAI,SAAS,KAAK,GAAG;gBAAE,MAAM,GAAG,KAAK,CAAC;YAC3C,SAAS;QACX,CAAC;QACD,IAAI,SAAS,KAAK,GAAG,EAAE,CAAC;YAAC,MAAM,GAAG,IAAI,CAAC;YAAC,SAAS;QAAC,CAAC;QACnD,IAAI,SAAS,KAAK,GAAG;YAAE,SAAS;QAChC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,OAAO,IAAI,GAAG,UAAU,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAAE,IAAI,EAAE,CAAC;QACvE,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG;YAAE,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IAChF,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAY,CAAC;AACpD,CAAC","sourcesContent":["/** Parse TypeScript's JSON-with-comments configs without altering quoted paths. */\nexport function parseJsonConfig(text: string): unknown {\n  const characters = text.split('');\n  let quoted = false;\n  for (let i = 0; i < text.length; i++) {\n    const character = text[i];\n    if (quoted) {\n      if (character === '\\\\') i++;\n      else if (character === '\"') quoted = false;\n      continue;\n    }\n    if (character === '\"') { quoted = true; continue; }\n    if (character === '/' && text[i + 1] === '/') {\n      while (i < text.length && text[i] !== '\\n') characters[i++] = ' ';\n    } else if (character === '/' && text[i + 1] === '*') {\n      characters[i++] = ' ';\n      characters[i++] = ' ';\n      while (i < text.length && !(text[i] === '*' && text[i + 1] === '/')) {\n        if (text[i] !== '\\n' && text[i] !== '\\r') characters[i] = ' ';\n        i++;\n      }\n      if (i >= text.length) throw new SyntaxError('Unterminated config comment.');\n      characters[i++] = ' ';\n      characters[i] = ' ';\n    }\n  }\n  // JSONC also accepts trailing commas. Handle them only outside strings.\n  quoted = false;\n  for (let i = 0; i < characters.length; i++) {\n    const character = characters[i];\n    if (quoted) {\n      if (character === '\\\\') i++;\n      else if (character === '\"') quoted = false;\n      continue;\n    }\n    if (character === '\"') { quoted = true; continue; }\n    if (character !== ',') continue;\n    let next = i + 1;\n    while (next < characters.length && /\\s/.test(characters[next])) next++;\n    if (characters[next] === '}' || characters[next] === ']') characters[i] = ' ';\n  }\n  return JSON.parse(characters.join('')) as unknown;\n}\n"]}

package/shared/analyzer/languages/csharp.d.ts

@@ -0,0 +1,26 @@
+export declare const extensions: string[];
+export declare function analyze(source: any, path: any): {
+    imports: any[];
+    exports: {
+        name: any;
+        kind: string;
+    }[];
+    functions: any[];
+    classes: any[];
+    hasMain: boolean;
+    namespace: any;
+};
+export declare function sourceRootFor(fromPath: any, namespace: any): string;
+export declare function resolveImport(spec: any, fromPath: any, has: any, context?: Record<string, any>, meta?: Record<string, any>): {
+    path?: undefined;
+    unresolved: any;
+    packageDir?: undefined;
+} | {
+    unresolved?: undefined;
+    path: string;
+    packageDir?: undefined;
+} | {
+    path?: undefined;
+    unresolved?: undefined;
+    packageDir: any;
+};

package/shared/analyzer/languages/csharp.js

@@ -8,54 +8,45 @@
 // directory and the scanner links to every file in it — the same shape Go uses
 // for packages.
 import { blankComments, lineCounter } from '../util.js';
-
 export const extensions = ['.cs'];
-
 const NAMESPACE_RE = /^\s*namespace\s+([A-Za-z0-9_.]+)\s*[;{]/m;
-
 export function analyze(source, path) {
-  const clean = blankComments(source);
-  const lineAt = lineCounter(clean);
-
-  // The file's own namespace. Captured first because every import is resolved
-  // relative to it — this declaration is the only place the root is written down.
-  // Block-scoped namespaces (`namespace A.B { }`) are the norm, and the regex
-  // accepts both the `;` and `{` forms.
-  const namespace = (clean.match(NAMESPACE_RE) || [])[1] || '';
-
-  const imports = [];
-  // `using static A.B.C;` names a type (and optionally a member of it); plain
-  // `using A.B;` names a namespace. The distinction decides whether we look for
-  // a file or a directory.
-  for (const m of clean.matchAll(/\busing\s+(static\s+)?([A-Za-z0-9_.]+)\s*;/g)) {
-    imports.push({ spec: m[2], static: !!m[1], namespace, line: lineAt(m.index) });
-  }
-  // `using X = Y;` aliases and global usings are out of scope; a spec that fails
-  // to resolve is reported as unresolved rather than guessed at.
-
-  const classes = [];
-  for (const m of clean.matchAll(/(\[[^\]]+\]\s*)*\b(?:public\s+|private\s+|protected\s+|internal\s+)*(?:abstract\s+|sealed\s+|static\s+|partial\s+)*(?:class|interface|struct|record|enum)\s+([a-zA-Z0-9_]+)/g)) {
-    const attributes = [];
-    if (m[1]) {
-      for (const am of m[1].matchAll(/\[([A-Za-z0-9_]+)/g)) {
-        attributes.push(am[1]);
-      }
+    const clean = blankComments(source);
+    const lineAt = lineCounter(clean);
+    // The file's own namespace. Captured first because every import is resolved
+    // relative to it — this declaration is the only place the root is written down.
+    // Block-scoped namespaces (`namespace A.B { }`) are the norm, and the regex
+    // accepts both the `;` and `{` forms.
+    const namespace = (clean.match(NAMESPACE_RE) || [])[1] || '';
+    const imports = [];
+    // `using static A.B.C;` names a type (and optionally a member of it); plain
+    // `using A.B;` names a namespace. The distinction decides whether we look for
+    // a file or a directory.
+    for (const m of clean.matchAll(/\busing\s+(static\s+)?([A-Za-z0-9_.]+)\s*;/g)) {
+        imports.push({ spec: m[2], static: !!m[1], namespace, line: lineAt(m.index) });
     }
-    classes.push({ name: m[2], attributes, line: lineAt(m.index) });
-  }
-
-  const hasMain = /static\s+(?:async\s+Task|void|int|async\s+Task<int>)\s+Main\s*\(/.test(clean);
-
-  return {
-    imports,
-    exports: classes.map(c => ({ name: c.name, kind: 'class' })),
-    functions: [],
-    classes,
-    hasMain,
-    namespace,
-  };
+    // `using X = Y;` aliases and global usings are out of scope; a spec that fails
+    // to resolve is reported as unresolved rather than guessed at.
+    const classes = [];
+    for (const m of clean.matchAll(/(\[[^\]]+\]\s*)*\b(?:public\s+|private\s+|protected\s+|internal\s+)*(?:abstract\s+|sealed\s+|static\s+|partial\s+)*(?:class|interface|struct|record|enum)\s+([a-zA-Z0-9_]+)/g)) {
+        const attributes = [];
+        if (m[1]) {
+            for (const am of m[1].matchAll(/\[([A-Za-z0-9_]+)/g)) {
+                attributes.push(am[1]);
+            }
+        }
+        classes.push({ name: m[2], attributes, line: lineAt(m.index) });
+    }
+    const hasMain = /static\s+(?:async\s+Task|void|int|async\s+Task<int>)\s+Main\s*\(/.test(clean);
+    return {
+        imports,
+        exports: classes.map(c => ({ name: c.name, kind: 'class' })),
+        functions: [],
+        classes,
+        hasMain,
+        namespace,
+    };
 }
-
 // A C# `using` is resolved by *path suffix*, not by a root prefix. See
 // `resolveImport` below for why that distinction matters — it is the whole
 // difference between C# and Java, and getting it backwards drops every import.
@@ -64,51 +55,55 @@ export function analyze(source, path) {
 // where a project *does* mirror the full namespace (`Acme/Services/User.cs`).
 // It is a fallback, not the main path.
 export function sourceRootFor(fromPath, namespace) {
-  if (!namespace) return null;
-  const suffix = namespace.replace(/\./g, '/');
-  const normalized = String(fromPath).replace(/\\/g, '/');
-  const nested = normalized.lastIndexOf('/' + suffix + '/');
-  if (nested >= 0) return normalized.slice(0, nested + 1);
-  if (normalized === suffix || normalized.startsWith(suffix + '/')) return '';
-  return null;
+    if (!namespace)
+        return null;
+    const suffix = namespace.replace(/\./g, '/');
+    const normalized = String(fromPath).replace(/\\/g, '/');
+    const nested = normalized.lastIndexOf('/' + suffix + '/');
+    if (nested >= 0)
+        return normalized.slice(0, nested + 1);
+    if (normalized === suffix || normalized.startsWith(suffix + '/'))
+        return '';
+    return null;
 }
-
 export function resolveImport(spec, fromPath, has, context = {}, meta = {}) {
-  const parts = spec.split('.').filter(Boolean);
-  const findDir = (segments) => (segments.length ? context.findDirEndingWith?.(segments.join('/')) : null);
-  if (!parts.length) return { unresolved: spec };
-
-  // A C# `using` is ambiguous from the string alone: in `using Acme.Models;`,
-  // `Models` might be a namespace (link its directory) or a type (link the
-  // file). Both readings are tried, most specific first.
-  //
-  // The other half of the puzzle is that C# resolves by *path suffix*, not by a
-  // root prefix the way Java does. `namespace Acme.Services` conventionally
-  // lives in `src/Services/`: the folders mirror the namespace, but the leading
-  // `Acme` — the project or company root — is not a directory. So the namespace
-  // segments are matched against the *tail* of a real directory path, which is
-  // what `findDirEndingWith` answers. Stripping the whole namespace instead, the
-  // Java approach, matches nothing here and silently drops every import.
-
-  // Reading 1: the last segment is a type. Find the directory holding its
-  // namespace, then the file named after it.
-  const namespaceParts = parts.slice(0, -1);
-  for (let take = namespaceParts.length; take > 0; take -= 1) {
-    const dir = findDir(namespaceParts.slice(namespaceParts.length - take));
-    if (!dir) continue;
-    const exact = dir + '/' + parts[parts.length - 1] + '.cs';
-    if (has(exact)) return { path: exact };
-    if (meta.static) return { unresolved: spec }; // `using static A.B.C;` is always a type
-  }
-
-  // Reading 2: the whole spec is a namespace, so link its directory.
-  for (let take = parts.length; take > 0; take -= 1) {
-    const dir = findDir(parts.slice(parts.length - take));
-    if (dir) return { packageDir: dir };
-  }
-
-  // The BCL (`System`, `System.Collections.Generic`) and every NuGet package land
-  // here. Staying unresolved is the honest answer: a file we invent would be a
-  // node in the graph that does not exist.
-  return { unresolved: spec };
+    const parts = spec.split('.').filter(Boolean);
+    const findDir = (segments) => (segments.length ? context.findDirEndingWith?.(segments.join('/')) : null);
+    if (!parts.length)
+        return { unresolved: spec };
+    // A C# `using` is ambiguous from the string alone: in `using Acme.Models;`,
+    // `Models` might be a namespace (link its directory) or a type (link the
+    // file). Both readings are tried, most specific first.
+    //
+    // The other half of the puzzle is that C# resolves by *path suffix*, not by a
+    // root prefix the way Java does. `namespace Acme.Services` conventionally
+    // lives in `src/Services/`: the folders mirror the namespace, but the leading
+    // `Acme` — the project or company root — is not a directory. So the namespace
+    // segments are matched against the *tail* of a real directory path, which is
+    // what `findDirEndingWith` answers. Stripping the whole namespace instead, the
+    // Java approach, matches nothing here and silently drops every import.
+    // Reading 1: the last segment is a type. Find the directory holding its
+    // namespace, then the file named after it.
+    const namespaceParts = parts.slice(0, -1);
+    for (let take = namespaceParts.length; take > 0; take -= 1) {
+        const dir = findDir(namespaceParts.slice(namespaceParts.length - take));
+        if (!dir)
+            continue;
+        const exact = dir + '/' + parts[parts.length - 1] + '.cs';
+        if (has(exact))
+            return { path: exact };
+        if (meta.static)
+            return { unresolved: spec }; // `using static A.B.C;` is always a type
+    }
+    // Reading 2: the whole spec is a namespace, so link its directory.
+    for (let take = parts.length; take > 0; take -= 1) {
+        const dir = findDir(parts.slice(parts.length - take));
+        if (dir)
+            return { packageDir: dir };
+    }
+    // The BCL (`System`, `System.Collections.Generic`) and every NuGet package land
+    // here. Staying unresolved is the honest answer: a file we invent would be a
+    // node in the graph that does not exist.
+    return { unresolved: spec };
 }
+//# sourceMappingURL=csharp.js.map

package/shared/analyzer/languages/csharp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"csharp.js","sourceRoot":"","sources":["../../../src/shared/analyzer/languages/csharp.ts"],"names":[],"mappings":"AAAA,cAAc;AACd,EAAE;AACF,iFAAiF;AACjF,4EAA4E;AAC5E,6EAA6E;AAC7E,+EAA+E;AAC/E,+EAA+E;AAC/E,+EAA+E;AAC/E,gBAAgB;AAChB,OAAO,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAExD,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,KAAK,CAAC,CAAC;AAElC,MAAM,YAAY,GAAG,0CAA0C,CAAC;AAEhE,MAAM,UAAU,OAAO,CAAC,MAAM,EAAE,IAAI;IAClC,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IAElC,4EAA4E;IAC5E,gFAAgF;IAChF,4EAA4E;IAC5E,sCAAsC;IACtC,MAAM,SAAS,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAE7D,MAAM,OAAO,GAAG,EAAE,CAAC;IACnB,4EAA4E;IAC5E,8EAA8E;IAC9E,yBAAyB;IACzB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,6CAA6C,CAAC,EAAE,CAAC;QAC9E,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACjF,CAAC;IACD,+EAA+E;IAC/E,+DAA+D;IAE/D,MAAM,OAAO,GAAG,EAAE,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,8KAA8K,CAAC,EAAE,CAAC;QAC/M,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACT,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,oBAAoB,CAAC,EAAE,CAAC;gBACrD,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,MAAM,OAAO,GAAG,kEAAkE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAE/F,OAAO;QACL,OAAO;QACP,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QAC5D,SAAS,EAAE,EAAE;QACb,OAAO;QACP,OAAO;QACP,SAAS;KACV,CAAC;AACJ,CAAC;AAED,uEAAuE;AACvE,2EAA2E;AAC3E,+EAA+E;AAC/E,EAAE;AACF,gFAAgF;AAChF,8EAA8E;AAC9E,uCAAuC;AACvC,MAAM,UAAU,aAAa,CAAC,QAAQ,EAAE,SAAS;IAC/C,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAC5B,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAC7C,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACxD,MAAM,MAAM,GAAG,UAAU,CAAC,WAAW,CAAC,GAAG,GAAG,MAAM,GAAG,GAAG,CAAC,CAAC;IAC1D,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IACxD,IAAI,UAAU,KAAK,MAAM,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAC5E,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,GAAwB,EAAE,EAAE,IAAI,GAAwB,EAAE;IAClH,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9C,MAAM,OAAO,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACzG,IAAI,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;IAE/C,4EAA4E;IAC5E,yEAAyE;IACzE,uDAAuD;IACvD,EAAE;IACF,8EAA8E;IAC9E,0EAA0E;IAC1E,8EAA8E;IAC9E,8EAA8E;IAC9E,6EAA6E;IAC7E,+EAA+E;IAC/E,uEAAuE;IAEvE,wEAAwE;IACxE,2CAA2C;IAC3C,MAAM,cAAc,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1C,KAAK,IAAI,IAAI,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC3D,MAAM,GAAG,GAAG,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;QACxE,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAC1D,IAAI,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,yCAAyC;IACzF,CAAC;IAED,mEAAmE;IACnE,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAClD,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;QACtD,IAAI,GAAG;YAAE,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;IACtC,CAAC;IAED,gFAAgF;IAChF,6EAA6E;IAC7E,yCAAyC;IACzC,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;AAC9B,CAAC","sourcesContent":["// C# analyzer\n//\n// C# is namespace-rooted exactly as Java is package-rooted: a file's path is its\n// namespace spelled with slashes, under a project root. The difference that\n// matters is the import. Java's `import a.b.C;` names a *class*, so one path\n// answers it; C#'s `using A.B;` names a *namespace*, and the classes inside it\n// are not knowable from the import string. So a namespace import resolves to a\n// directory and the scanner links to every file in it — the same shape Go uses\n// for packages.\nimport { blankComments, lineCounter } from '../util.js';\n\nexport const extensions = ['.cs'];\n\nconst NAMESPACE_RE = /^\\s*namespace\\s+([A-Za-z0-9_.]+)\\s*[;{]/m;\n\nexport function analyze(source, path) {\n  const clean = blankComments(source);\n  const lineAt = lineCounter(clean);\n\n  // The file's own namespace. Captured first because every import is resolved\n  // relative to it — this declaration is the only place the root is written down.\n  // Block-scoped namespaces (`namespace A.B { }`) are the norm, and the regex\n  // accepts both the `;` and `{` forms.\n  const namespace = (clean.match(NAMESPACE_RE) || [])[1] || '';\n\n  const imports = [];\n  // `using static A.B.C;` names a type (and optionally a member of it); plain\n  // `using A.B;` names a namespace. The distinction decides whether we look for\n  // a file or a directory.\n  for (const m of clean.matchAll(/\\busing\\s+(static\\s+)?([A-Za-z0-9_.]+)\\s*;/g)) {\n    imports.push({ spec: m[2], static: !!m[1], namespace, line: lineAt(m.index) });\n  }\n  // `using X = Y;` aliases and global usings are out of scope; a spec that fails\n  // to resolve is reported as unresolved rather than guessed at.\n\n  const classes = [];\n  for (const m of clean.matchAll(/(\\[[^\\]]+\\]\\s*)*\\b(?:public\\s+|private\\s+|protected\\s+|internal\\s+)*(?:abstract\\s+|sealed\\s+|static\\s+|partial\\s+)*(?:class|interface|struct|record|enum)\\s+([a-zA-Z0-9_]+)/g)) {\n    const attributes = [];\n    if (m[1]) {\n      for (const am of m[1].matchAll(/\\[([A-Za-z0-9_]+)/g)) {\n        attributes.push(am[1]);\n      }\n    }\n    classes.push({ name: m[2], attributes, line: lineAt(m.index) });\n  }\n\n  const hasMain = /static\\s+(?:async\\s+Task|void|int|async\\s+Task<int>)\\s+Main\\s*\\(/.test(clean);\n\n  return {\n    imports,\n    exports: classes.map(c => ({ name: c.name, kind: 'class' })),\n    functions: [],\n    classes,\n    hasMain,\n    namespace,\n  };\n}\n\n// A C# `using` is resolved by *path suffix*, not by a root prefix. See\n// `resolveImport` below for why that distinction matters — it is the whole\n// difference between C# and Java, and getting it backwards drops every import.\n//\n// `sourceRootFor` is kept and exported because it is the answer for the layouts\n// where a project *does* mirror the full namespace (`Acme/Services/User.cs`).\n// It is a fallback, not the main path.\nexport function sourceRootFor(fromPath, namespace) {\n  if (!namespace) return null;\n  const suffix = namespace.replace(/\\./g, '/');\n  const normalized = String(fromPath).replace(/\\\\/g, '/');\n  const nested = normalized.lastIndexOf('/' + suffix + '/');\n  if (nested >= 0) return normalized.slice(0, nested + 1);\n  if (normalized === suffix || normalized.startsWith(suffix + '/')) return '';\n  return null;\n}\n\nexport function resolveImport(spec, fromPath, has, context: Record<string, any> = {}, meta: Record<string, any> = {}) {\n  const parts = spec.split('.').filter(Boolean);\n  const findDir = (segments) => (segments.length ? context.findDirEndingWith?.(segments.join('/')) : null);\n  if (!parts.length) return { unresolved: spec };\n\n  // A C# `using` is ambiguous from the string alone: in `using Acme.Models;`,\n  // `Models` might be a namespace (link its directory) or a type (link the\n  // file). Both readings are tried, most specific first.\n  //\n  // The other half of the puzzle is that C# resolves by *path suffix*, not by a\n  // root prefix the way Java does. `namespace Acme.Services` conventionally\n  // lives in `src/Services/`: the folders mirror the namespace, but the leading\n  // `Acme` — the project or company root — is not a directory. So the namespace\n  // segments are matched against the *tail* of a real directory path, which is\n  // what `findDirEndingWith` answers. Stripping the whole namespace instead, the\n  // Java approach, matches nothing here and silently drops every import.\n\n  // Reading 1: the last segment is a type. Find the directory holding its\n  // namespace, then the file named after it.\n  const namespaceParts = parts.slice(0, -1);\n  for (let take = namespaceParts.length; take > 0; take -= 1) {\n    const dir = findDir(namespaceParts.slice(namespaceParts.length - take));\n    if (!dir) continue;\n    const exact = dir + '/' + parts[parts.length - 1] + '.cs';\n    if (has(exact)) return { path: exact };\n    if (meta.static) return { unresolved: spec }; // `using static A.B.C;` is always a type\n  }\n\n  // Reading 2: the whole spec is a namespace, so link its directory.\n  for (let take = parts.length; take > 0; take -= 1) {\n    const dir = findDir(parts.slice(parts.length - take));\n    if (dir) return { packageDir: dir };\n  }\n\n  // The BCL (`System`, `System.Collections.Generic`) and every NuGet package land\n  // here. Staying unresolved is the honest answer: a file we invent would be a\n  // node in the graph that does not exist.\n  return { unresolved: spec };\n}\n"]}