Codebase intelligence for AI and humans: code health scores, auto-generated docs, git analytics, dead code detection, and architectural decisions via MCP.
Python aicode-complexitycode-healthcode-intelligencecode-qualitydead-codedeveloper-toolsdocumentationgit-analyticsmcpopen-sourcepythonrefactoringstatic-analysistechnical-debt
import * as vscode from "vscode";
import { getDeadCodeSummary, listDeadCode } from "@repowise-dev/api-client/dead-code";
import type { DeadCodeFindingResponse } from "@repowise-dev/api-client/types";
import {
baseName,
openFileCommand,
RepowiseTreeProvider,
type RepoTreeNode,
} from "./shared";
const FINDINGS_KEY = "deadcode:findings";
const SUMMARY_KEY = "deadcode:summary";
/** Confidence tiers, most-confident first, with their inclusive lower bounds. */
const TIERS: Array<{ key: string; label: string; min: number }> = [
{ key: "high", label: "High", min: 0.75 },
{ key: "medium", label: "Medium", min: 0.5 },
{ key: "low", label: "Low", min: 0 },
];
/**
* Dead Code roots: findings grouped into High / Medium / Low confidence tiers.
* Empty tiers are dropped. Findings use `start_line`/`end_line` (distinct from
* the health findings' `line_start`/`line_end`); a click jumps to `start_line`
* when present. Mounted as a section of the Findings composite, which owns the
* view badge (failing health files, deliberately not dead-code counts).
*/
export class DeadCodeTreeProvider extends RepowiseTreeProvider {
protected readonly name = "Dead Code";
protected async loadRoots(repoId: string): Promise<RepoTreeNode[]> {
const findings = await this.cached(FINDINGS_KEY, () =>
listDeadCode(repoId, { limit: 500 }),
);
if (findings.length === 0) {
// A failed summary throws to the tree's error row, never to "clean".
const summary = await this.cached(SUMMARY_KEY, () => getDeadCodeSummary(repoId));
// No findings only means "clean" once an analysis has actually run.
return [
summary.analyzed_at
? this.messageNode(
"No dead code",
new vscode.ThemeIcon("pass", new vscode.ThemeColor("testing.iconPassed")),
)
: this.messageNode("Not analysed yet"),
];
}
const roots: RepoTreeNode[] = [];
for (const tier of TIERS) {
const rows = findings.filter((f) => tierOf(f.confidence) === tier.key);
if (rows.length === 0) continue;
roots.push({
key: `tier:${tier.key}`,
label: tier.label,
description: `${rows.length}`,
collapsibleState: vscode.TreeItemCollapsibleState.Expanded,
children: rows.map((row) => this.findingNode(row)),
});
}
return roots;
}
private findingNode(row: DeadCodeFindingResponse): RepoTreeNode {
const tooltip = new vscode.MarkdownString();
tooltip.appendMarkdown(`\`${row.file_path}\`\n\n`);
tooltip.appendMarkdown(`- Kind: ${row.kind}\n`);
tooltip.appendMarkdown(`- Confidence: ${row.confidence.toFixed(2)}\n`);
tooltip.appendMarkdown(`- ${row.reason}\n`);
return {
key: `dead:${row.id}`,
label: row.symbol_name ?? baseName(row.file_path),
description: row.lines === null ? row.kind : `${row.kind} · ${row.lines} lines`,
tooltip,
collapsibleState: vscode.TreeItemCollapsibleState.None,
command: openFileCommand(this.ctx, row.file_path, row.start_line),
};
}
}
/** Maps a 0-1 confidence to its tier key. */
function tierOf(confidence: number): string {
for (const tier of TIERS) {
if (confidence >= tier.min) return tier.key;
}
return "low";
}