metals — Watchdog Audit

Executive summary

The system holds an adequate overall standing of 66%, reflecting a robust technical foundation that is currently undermined by significant operational friction. While the architecture is exceptionally strong and the code itself is clean, the organization faces a critical gap in how new talent integrates and retains institutional knowledge. This creates a fragile environment where the high cost of change is not due to technical debt, but to human onboarding barriers.

This is a large asset, comprising over 100,000 lines of production code, with a rebuild effort estimated at nearly two person-years and a cost of approximately €280,000. The value tied up here is substantial, yet the composition suggests a highly structured, non-boilerplate codebase. The primary risk is not that the code is broken, but that it is opaque to new engineers. The weakest lens is Maturity at 58%, meaning the system lacks the documented context and operational readiness required to scale the team or ensure safe, independent delivery. Without intervention, every change carries a hidden tax of confusion and delay.

The most pressing theme is Knowledge Siloing. With a Maturity score of 58%, the system suffers from a lack of recorded decisions and clear operational guides. This forces engineers to reverse-engineer intent rather than build upon it, leading to slower delivery and higher defect rates. The absence of Architecture Decision Records means that critical context is lost when people leave, creating a single point of failure in human memory. This directly impacts reliability and increases the cost of every maintenance task.

A secondary theme is Operational Friction. The Readiness score of 73% indicates that while the system is generally secure and observable, the barrier to entry for new contributors is too high. The lack of a clear quick-start guide means that even simple tasks require significant time investment. This slows down feature delivery and increases the risk of errors during initial setup. The high Architecture score of 98% shows the structure is sound, but the human interface with that structure is broken.

The system’s genuine strength lies in its Architectural Integrity (98%) and Code Health (85%). The code is well-structured, maintainable, and free of significant technical debt. This provides a solid platform for future growth, provided the human processes catch up. The security posture is adequate at 68%, with no confirmed critical vulnerabilities, though continuous monitoring is essential.

Focus first on improving onboarding and documentation. Adding a build/run section to the root README and implementing Architecture Decision Records will yield the highest return on effort. This low-cost, high-impact action will immediately reduce the time-to-productivity for new engineers and preserve critical institutional knowledge. Addressing these gaps will protect the significant investment in this large asset and ensure sustainable delivery speed.

Code Health 85% Strong Architecture 98% ★ Exemplary Maturity 58% Adequate · gated by M2 Readiness 73% Strong Security 68% Adequate · gated by D29, D36

How the score is built — each lens's share of the headline Width is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.

Maturity 58% · 47% weightSecurity 68% · 26% weightReadiness 73% · 14% weightCode Health 85% · 8% weightArchitecture 98% · 4% weight

Raise Maturity 58 → 70 (the Healthy floor) ⇒ headline 66 → ~72.

Code composition — where the lines go

Tests 100%

Rebuild cost & value ~ Modeled — €91,000–€460,000

Cost to rebuild	€91,000–€460,000 (0.9–2.9 person-years (1,523–4,830 h), ~1–4 engineers)
Domain complexity	Standard — harder problems cost more per line
Quality factor	0.9× (at 66% quality) — the last 20% of quality is most of the work
Size & shape	Large · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)

This codebase represents roughly ~1.9 person-years of build effort (about ~€280,000 to rebuild). Its weakest lens is Maturity at 58% — the part of that asset most exposed by the findings below.

How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.0) — standard service × a 0.9× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).

Top priorities

The highest-leverage moves; the full ranked list is in the Roadmap below.

Resolve the 1 No ADRs found finding(s) in ADR Quality.

+8.3 pts · Low effort · ADR Quality

Resolve the 4 Orphaned knowledge finding(s) in Knowledge Freshness — start with FlatMapToForComprehensionCodeAction.scala, MatchCaseCompletions.scala, ExtractRenameMember.scala.

+4.5 pts · Low effort · Knowledge Freshness

Add a build/run (quick start) section to the root README — the first thing a newcomer needs.

+9.0 pts · Medium effort · Documentation (README)

Diagnosis — what's actually going on

Value concentrated against a weak lens · Medium · Value at risk

This is a Large asset (~1.9 person-years to rebuild), and its weakest lens is Maturity at 58%. The operational and business risk on an asset this size concentrates there — that's where remediation buys the most protection.

Evidence: valuation: Large, ~1.9 person-years rebuild (106,133 LoC) · weakest lens: Maturity 58%

→ Direct remediation budget at Maturity first — highest risk-reduction per euro on an asset this size.

Highest-leverage move · Medium · Leverage

Of everything flagged, the best return on effort is: Add a build/run (quick start) section to the root README — the first thing a newcomer needs. The rest can wait behind it.

Evidence: priority ranking: top of 5 ranked by impact/effort

→ Add a build/run (quick start) section to the root README — the first thing a newcomer needs.

Architecture — module dependency matrix

Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)

276 modules, 479 dependencies. 1 dependency cycle across 54 modules, marked above the diagonal.

Showing the 40 most-connected modules; 236 more are not drawn.

Module dependency matrix. The row depends on the column; the number is how many type pairs create the dependency. A cell above the diagonal is part of a dependency cycle.
depends on →	1 internal.docstrings	2 internal.metals.ScalaDocLink.SymbolType	3 internal.metals.config	4 internal.metals.mcp.SymbolType	5 internal.mtags.JavaToplevelMtags	6 internal.parsing.JavaFoldingRangeExtractor	7 internal.pc.Params	8 internal.metals.PathMatcher	9 internal.metals.codeactions	10 internal.metals.debug.server	11 internal.metals.doctor	12 internal.metals.scalacli	13 internal.parsing	14 internal.pc.Signatures	15 internal.pc.completions.Completions	16 internal.metals.findfiles	18 internal.pc.completions.InterpolatorCompletions	19 internal.pc.completions	20 internal.pc	21 internal.mtags	22 internal.implementation	24 internal.tvp	25 internal.metals.callHierarchy	26 internal.metals.clients.language	27 internal.metals.codelenses	28 internal.metals.StatusBar	29 internal.metals.testProvider	30 metals.lsp	31 internal.metals.debug	32 internal.metals	33 internal.builds	39 internal.bsp
1 internal.docstrings
2 internal.metals.ScalaDocLink.SymbolType
3 internal.metals.config
4 internal.metals.mcp.SymbolType
5 internal.mtags.JavaToplevelMtags
6 internal.parsing.JavaFoldingRangeExtractor
7 internal.pc.Params
8 internal.metals.PathMatcher																														2
9 internal.metals.codeactions	1				2	8																								3
10 internal.metals.debug.server																														5
11 internal.metals.doctor																														10		1
12 internal.metals.scalacli																														6
13 internal.parsing				1	1	4																								1
14 internal.pc.Signatures		2					1												1	3										1
15 internal.pc.completions.Completions						2														2
16 internal.metals.findfiles						1		1
17 internal.pc.completions.DependencyCompletions						1									2
18 internal.pc.completions.InterpolatorCompletions						1									2				1	2										2
19 internal.pc.completions		2				2								1	2		1			2										3
20 internal.pc	2	7			3	18	1	1		5			4	2	3			16		17										24
21 internal.mtags		1		1	3	3	3	1											2											2
22 internal.implementation																			1	2										2
23 internal.pc.completions.ArgCompletions		1				1									2					1
24 internal.tvp		1					2													2										1
25 internal.metals.callHierarchy				1		6							1								1									5
26 internal.metals.clients.language		3		1																		4								3
27 internal.metals.codelenses						1							1								3									4
28 internal.metals.StatusBar																								1						1
29 internal.metals.testProvider											4									3	1				1					3
30 metals.lsp		2		2		2			2		2					2			2			14			2					2
31 internal.metals.debug		2						1		2	2								1					1		6				16
32 internal.metals	1	6	6	8	3	14	1	3	3	2	13	2	9			3			6	25	3	8	1	11	4	1	2	2	4		19	12
33 internal.builds																								3						12		4
34 internal.metals.MetalsEnrichments				1	1	2																								5
35 internal.metals.debug.server.testing				1						1																				1
36 internal.metals.mcp				1		1																1		7						29
37 internal.pc.completions.MatchCaseCompletions		2				2									4					3										2
38 metals																								1				2		3
39 internal.bsp				1																										6	3
40 internal.metals.ConnectionProvider																														3	2	3

Dependency, pointing down the layeringAbove the diagonal — part of a cycleThe module itself

At a glance — Code Health · 85% · Strong ·

The Good

D3 · Scala God Classes 8.2 D4 · Scala Code Duplication 9.9 D17 · Scala Explicit Debt 9.9

The Bad

D1 · Scala Cyclomatic Complexity 6.3 D2 · Scala Cognitive Complexity 5.3

At a glance — Architecture · 98% · Exemplary ·

The Good

D6 · Scala Cohesion (LCOM4) 9.5 D35 · Scala Change Coupling 9.8 AX10 · Repo Code composition 9.9

At a glance — Maturity · 58% · Adequate · gated by M2 ·

The Good

D15 · Scala Churn × Complexity Hotspots 9.9 D16 · Scala Bus Factor 9.4 D19 · Scala Documentation Quality 9.3 D21 · Scala Naming Consistency 10.0 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 10.0

The Bad

D34 · Scala Knowledge Freshness 6.4

The Ugly

D20 · Scala ADR Quality 0.0 M1 · Repo Documentation (README) 4.5 M2 · Repo Architecture documentation 2.0

At a glance — Readiness · 73% · Strong ·

The Good

D13 · Scala REDACTED Scanning 10.0 D14 · Scala License Compliance 10.0 P1 · Repo CI/CD gates 10.0 P3 · Repo Security & performance tooling 8.0 P4 · Repo Deployment & Rollback 7.0

The Bad

P6 · Repo Release Hygiene 5.0

At a glance — Security · 68% · Adequate · gated by D29, D36 ·

The Good

D28 · Scala Secrets (history) 9.0 D30 · Scala Dependency Vulnerabilities 10.0 D43 · Scala Malicious Dependencies 10.0

The Ugly

D29 · Scala Static Analysis (SAST) 2.5 D36 · Scala Supply-chain Provenance & Signing 2.5

Security & Compliance — OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP category	Findings	Severity
A03:2021 — Injection	32	High / Critical
A02:2021 — Cryptographic Failures	2	High / Critical

Roadmap

Begin by adding a build and run quick start to the root README to help newcomers get started immediately. Next, document significant architectural decisions in a dedicated, dated format and resolve any gaps in this knowledge base. Then, address orphaned knowledge by updating specific outdated files to ensure current accuracy. Finally, maintain a changelog to clearly record what is shipped in each release.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do this	Helps	Effort	Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.	+8.3 pts	Low	ADR Quality
Resolve the 4 Orphaned knowledge finding(s) in Knowledge Freshness — start with FlatMapToForComprehensionCodeAction.scala, MatchCaseCompletions.scala, ExtractRenameMember.scala.	+4.5 pts	Low	Knowledge Freshness
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.	+9.0 pts	Medium	Documentation (README)
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).	+9.0 pts	Medium	Architecture documentation
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.	+2.9 pts	Medium	Release Hygiene
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3).	+1.3 pts	Low	Static Analysis (SAST)
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness.	+1.1 pts	Low	Knowledge Freshness
Resolve the 2 Documentation finding(s) in Documentation Quality — start with README.md (2).	+1.1 pts	Low	Documentation Quality

File quality

Per-file score 0–10 — a quality signature. Of 172 files carrying findings, judged against the Production bar: 0% slop · 52% mixed · 48% near-clean.

File	Score	Band	Worst signal
REDACTED	4.4	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	4.6	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	5.1	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	5.1	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	5.1	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	5.1	Mixed	Static Analysis (SAST): High: REDACTED
metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala	5.7	Mixed	Cyclomatic Complexity: DebugProvider.startDebugSession (cyclomatic 20)
mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala	5.7	Mixed	Cyclomatic Complexity: Fuzzy.forgivingFirstCharMatcher (cyclomatic 19)
metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala	5.8	Mixed	Change Coupling: Boundary-crossing change coupling: MtagsResolver.scala ↔ V.scala
metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala	5.9	Mixed	Cognitive Complexity: MetalsLspService.definitionOrReferences (cognitive 20)
mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala	6.0	Mixed	Explicit Debt: TodoComment
mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala	6.0	Mixed	Explicit Debt: HackComment
mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala	6.0	Mixed	Explicit Debt: TodoComment
mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala	6.0	Mixed	Explicit Debt: XxxComment
mtags/src/main/scala-2/scala/meta/internal/pc/PcDefinitionProvider.scala	6.0	Mixed	Explicit Debt: TodoComment
metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala	6.0	Mixed	Explicit Debt: FixmeComment
metals/src/main/scala/scala/meta/internal/metals/Indexer.scala	6.0	Mixed	Explicit Debt: TodoComment
mtags/src/main/scala/scala/meta/internal/metals/docstrings/HtmlConverter.scala	6.7	Mixed	Explicit Debt: TodoComment
metals/src/main/scala/scala/meta/internal/metals/CompilerConfiguration.scala	7.0	Mixed	Cognitive Complexity: CompilerConfiguration.enrichWithReleaseOption (cognitive 27)
metals/src/main/scala/scala/meta/internal/metals/clients/language/ConfiguredLanguageClient.scala	7.0	Mixed	Cognitive Complexity: ConfiguredLanguageClient.metalsStatus (cognitive 20)

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 38

A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.

Serious — 390

Likely wrong, but not failing yet. It degrades the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to carry for two years either.

Minor — 11

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 44

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 26 of 29 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 3 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.

What we checked — 29 dimensions across the health lenses

D1D2D3D4D6D13D14D15D16D17D19D20D21D28D29D30D34D35D36D43AX10M1M2M3M4P1P3P4P6

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report — three questions

Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 427 of 439 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.

Method	Backs	Version	Evaluator
Roslyn static analysis	Complexity, cohesion, coupling, dead code, API surface, layering	5.3.0	✓ deterministic
Native secret scanner	Hardcoded secrets / credentials	1.0.0	✓ deterministic
Watchdog duplication detector (in-process)	Code duplication	1.0.0	✓ deterministic
Coverage (coverlet / dotnet-coverage)	Line & branch coverage	10.0.400	✓ deterministic
NuGet / dotnet	Outdated, vulnerable & deprecated dependencies	10.0.400	✓ deterministic
git / LibGit2Sharp	Churn hotspots, knowledge concentration, history	2.43.0 · 0.31.0	✓ deterministic
gitleaks · semgrep · trivy	Secrets in history, SAST, CVEs, IaC & container, PII / GDPR	1.86.0 · 0.69.3	✓ deterministic
LLM (sampled · advisory)	Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurement	Local LLM	◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a0e2f7-d515-74fa-ad64-11714869111b.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.java, .scala) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (JaCoCo XML — `mvn jacoco:report` or the Gradle `jacocoTestReport` task, or `addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (JaCoCo XML — `mvn jacoco:report` or the Gradle `jacocoTestReport` task, or `addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability not included — the Scala suite (repository root, 1035 test files) did not finish re-running within its budget: the sbt build did not finish re-running within its tier budget.
D12 Dependency Hygiene — evaluation did not complete — Dependency Hygiene not included (check did not complete) — excluded from the score.
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares an sbt build (build.sbt), but the licence verdict published here was taken over its npm package dependencies. Nothing was read about its sbt dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: it declares a published package (project/plugins.sbt), but no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `website/docusaurus.config.ts` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
D44 Platform End-of-Life — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (go.mod, a Gemfile's ruby directive, a Dockerfile) is simply not read here yet.
AX3 Project dependency cycles — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over which project references which. That is a language-neutral question, but the project-reference graph is collected from MSBuild .csproj, Gradle and Maven builds only, and this repository commits none — so there was no graph to read, and re-running the same commit reads the same nothing. Its modules are declared as: npm/pnpm/yarn packages and workspaces (package.json, pnpm-workspace.yaml, lerna.json); sbt subprojects (build.sbt). A reader for that graph is the collector this check is missing. That is a COLLECTOR gap in this analyzer — no change to the scan image closes it — and not a finding that the repository is free of what this check looks for.
AX4 Dependency direction — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the direction each project reference points. That is a language-neutral question, but the project-reference graph is collected from MSBuild .csproj, Gradle and Maven builds only, and this repository commits none — so there was no graph to read, and re-running the same commit reads the same nothing. Its modules are declared as: npm/pnpm/yarn packages and workspaces (package.json, pnpm-workspace.yaml, lerna.json); sbt subprojects (build.sbt). A reader for that graph is the collector this check is missing. That is a COLLECTOR gap in this analyzer — no change to the scan image closes it — and not a finding that the repository is free of what this check looks for.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AX8 Test isolation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over which projects are test projects, and what they reference. That is a language-neutral question, but the project-reference graph is collected from MSBuild .csproj, Gradle and Maven builds only, and this repository commits none — so there was no graph to read, and re-running the same commit reads the same nothing. Its modules are declared as: npm/pnpm/yarn packages and workspaces (package.json, pnpm-workspace.yaml, lerna.json); sbt subprojects (build.sbt). A reader for that graph is the collector this check is missing. That is a COLLECTOR gap in this analyzer — no change to the scan image closes it — and not a finding that the repository is free of what this check looks for.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
ED5 Idempotency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check finds retry-prone mutations by walking the repository's declared types, and NONE was loaded on this run, so it had nothing to look at. That is a limit of the analyzer's reach — it reads .NET projects — not a finding that this repository has no command handlers or message consumers.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X1 Async correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X12 Unreachable branch — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X13 Undrained process stream — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X14 Bypassable address classification — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X15 Unvalidated length from an untrusted reader — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X19 Unrestored process-global state — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X20 Mistyped argument guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X21 Side-effecting pattern guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X22 Contradicted release guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X23 Unguarded diagnostic materialisation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X25 Inert configuration knob — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X26 Unsynchronised callback handoff — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X27 Collection changed while being enumerated — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X28 Index access outside its own emptiness guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X30 Support guard that admits what it rejects — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X32 Type resolved by simple name across every loaded assembly — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.

Limitations & what we did not check

Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

The LLM boundary

LLM-set scores this run (3): D19, D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.

Dimensions

D1 · Cyclomatic Complexity6.3 / 10Adequate✓ Tool-verified

What it measures: How tangled the control flow is — methods with many branches are hard to test and change.

Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.

Maturity: Documented → Verified → Prevented · effective 6.3 / 10 · rule-coverage 100% · ceiling Prevented

68 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was ScalaToplevelMtags.loop at 77. A further 4 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being Compilers.toDebugCompletionType at 25 — they are counted neither in the figure above nor in this dimension's score. 4 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: metals/src/main/scala/scala/meta/internal/metals/Compilers.scala (Compilers.toDebugCompletionType at 25), metals/src/main/scala/scala/meta/internal/metals/SemanticTokensProvider.scala (SemanticTokensProvider.typeModOfNonIdentToken at 25), metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractMethodCodeAction.scala (ExtractMethodCodeAction.defnTitle at 17), mtags/src/main/scala/scala/meta/internal/mtags/ScalametaCommonEnrichments.scala (XtensionSymbolInformationKind.toLsp at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

ScalaToplevelMtags.loop (cyclomatic 77)mtags/src/main/scala/scala/meta/internal/mtags/ScalaToplevelMtags.scala:119

WorkspaceLspService.executeCommand (cyclomatic 68)metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:854

CompletionProvider.completions (cyclomatic 66)mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala:53

ClassfileParser.parseAttributes (cyclomatic 62)mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:788

ScalaMtags.apply (cyclomatic 53)mtags/src/main/scala/scala/meta/internal/mtags/ScalaMtags.scala:68

+ 63 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 1 ScalaToplevelMtags.loop (cyclomatic 77) finding(s) in Cyclomatic Complexity — start with ScalaToplevelMtags.scala. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 WorkspaceLspService.executeCommand (cyclomatic 68) finding(s) in Cyclomatic Complexity — start with WorkspaceLspService.scala. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 CompletionProvider.completions (cyclomatic 66) finding(s) in Cyclomatic Complexity — start with CompletionProvider.scala. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D2 · Cognitive Complexity5.3 / 10Adequate✓ Tool-verified

What it measures: How hard the code is for a person to follow, beyond raw branching.

Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.

Maturity: Documented → Verified → Prevented · effective 5.3 / 10 · rule-coverage 100% · ceiling Prevented

166 method(s) exceeded the cognitive complexity threshold of 15; the worst was ScalaToplevelMtags.loop at 127.

ScalaToplevelMtags.loop (cognitive 127)mtags/src/main/scala/scala/meta/internal/mtags/ScalaToplevelMtags.scala:119

MetalsGlobal.shortType (cognitive 89)mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:341

ImplementationProvider.symbolLocationsFromContext (cognitive 87)metals/src/main/scala/scala/meta/internal/implementation/ImplementationProvider.scala:252

CompletionProvider.completions (cognitive 86)mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala:53

XtensionGSymbolSSymbolInformation.properties (cognitive 78)metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala:374

+ 161 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 1 ScalaToplevelMtags.loop (cognitive 127) finding(s) in Cognitive Complexity — start with ScalaToplevelMtags.scala. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 MetalsGlobal.shortType (cognitive 89) finding(s) in Cognitive Complexity — start with MetalsGlobal.scala. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 ImplementationProvider.symbolLocationsFromContext (cognitive 87) finding(s) in Cognitive Complexity — start with ImplementationProvider.scala. — One of this dimension's main actionable groups (1 warning-level).
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D3 · God Classes8.2 / 10Strong✓ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

Maturity: Documented → Verified → Prevented · effective 8.2 / 10 · rule-coverage 100% · ceiling Prevented

63 god class(es) detected.

FileTooLong: metals/Compilers.scala · ×32metals/src/main/scala/scala/meta/internal/metals/Compilers.scala

TooManyMethods: MetalsLspService · ×15metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala:99

MethodTooLong: ScaladocParser.parseWikiAtSymbol · ×8mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:629

ClassTooLong: WorkspaceLspService · ×8metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:103

What to do

Resolve the 32 FileTooLong finding(s) in God Classes — start with Compilers.scala, MetalsLspService.scala, WorkspaceLspService.scala. — One of this dimension's main actionable groups (32 warning-level).
Resolve the 15 TooManyMethods finding(s) in God Classes — start with MetalsLspService.scala, BuildTargets.scala, Compilers.scala. — One of this dimension's main actionable groups (15 warning-level).
Resolve the 8 MethodTooLong finding(s) in God Classes — start with PcCollector.scala (2), ScaladocParser.scala, ClassfileParser.scala. — One of this dimension's main actionable groups (8 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D4 · Code Duplication9.9 / 10Stronggated by 27 serious findings✓ Tool-verified

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

Maturity: Documented → Verified → Prevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Verified

27 duplicated block group(s) detected. 1 of the 27 are in trees this repository does not ship — vendored, example/demo, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.

Duplicated block (8 lines × 2) · ×5metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:189

Duplicated block (12 lines × 2) · ×3metals/src/main/scala/scala/meta/internal/metals/JavaInteractiveSemanticdb.scala:267

Duplicated block (5 lines × 2) · ×3metals/src/main/scala/scala/meta/internal/metals/Configs.scala:34

Duplicated block (11 lines × 2) · ×3metals/src/main/scala/scala/meta/internal/metals/FallbackMetalsLspService.scala:71

Duplicated block (14 lines × 2) · ×2mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala:233

+ 11 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 5 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with WorkspaceSymbolProvider.scala, ExtractMethodProvider.scala, InferredMethodProvider.scala. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 3 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with JavaInteractiveSemanticdb.scala, HoverMarkup.scala, Compat.scala. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 3 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with Configs.scala, ImportMissingSymbol.scala, InlayHintsBench.scala. — One of this dimension's main actionable groups (3 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D6 · Cohesion (LCOM4)9.5 / 10Stronggated by 8 serious findings✓ Tool-verified

What it measures: Whether a class's methods are focused on a single responsibility.

Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.

Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 9.5 / 10 · rule-coverage 100% · ceiling Verified

8 of 185 classes have LCOM4 above 3.

Low cohesion: MetalsGlobal (LCOM4 14) · ×8mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:39

What to do

Resolve the 8 Low cohesion finding(s) in Cohesion (LCOM4) — start with MetalsGlobal.scala, MetalsHttpClient.scala, JavaMetalsGlobal.scala. — One of this dimension's main actionable groups (8 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D13 · REDACTED Scanning10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

REDACTED scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

Do you agree with this assessment?

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the licenses of third-party packages are compatible with your policy.

Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 8 shipped npm package(s) use a banned license. Licences were resolved from registry.npmjs.org over the 8 production dependency(ies) this repository's committed lockfile resolves, across 0 product package.json manifest(s). Its 1 `devDependencies` declaration(s) are excluded: a consumer installs none of them. ★ DEPTH: this is the DIRECT production set the lockfile resolves, NOT the transitive closure — only one of the four lock dialects this pass reads states a full graph, so a banned licence pulled in only by a dependency's OWN dependencies is outside this verdict, exactly as the JVM arm's declaration-site verdict is. ★ Each licence is the one the registry publishes for the package's CURRENT release rather than for the pinned version, which is the same caveat the Hex and RubyGems arms carry. ★ COVERAGE OF THIS VERDICT: it grades this repository's npm package dependencies and nothing else. The repository also declares an sbt build (build.sbt), and the licences of those dependencies were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

Do you agree with this assessment?

D15 · Churn × Complexity Hotspots9.9 / 10Stronggated by 1 serious finding✓ Tool-verified

What it measures: Files that change often and are also complex — the riskiest hotspots.

Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.

Maturity: Documented → Verified → Prevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala (2×49=98)

Hotspot: mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scalamtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:341

What to do

Resolve the 1 Hotspot finding(s) in Churn × Complexity Hotspots — start with MetalsGlobal.scala. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D16 · Bus Factor9.4 / 10Exemplary✓ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

Maturity: Documented → Verified → Prevented · effective 9.4 / 10 · rule-coverage 100% · ceiling Documented

20 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala. Counted over 351 of the 682 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1

Further sole-owners (lower concentration)

✓ On the Gold path — maintain.

Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D17 · Explicit Debt9.9 / 10Stronggated by 51 serious findings✓ Tool-verified

What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

Maturity: Documented → Verified → Prevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Prevented

51 deducted task-comment markers across 105825 LoC (0.0/KLoC) → score 9.9. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

TodoComment · ×32metals/src/main/scala/scala/meta/internal/metals/Indexer.scala:30

FixmeComment · ×14metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:1218

XxxComment · ×3mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala:585

HackComment · ×2mtags/src/main/scala-2/scala/meta/internal/pc/Signatures.scala:83

What to do

Resolve the 32 TodoComment finding(s) in Explicit Debt — start with ScaladocParser.scala (8), ClassfileParser.scala (5), SignatureHelpSuite.scala (2). — One of this dimension's main actionable groups (32 warning-level).
Resolve the 14 FixmeComment finding(s) in Explicit Debt — start with MacroAnnotation.scala (9), MetalsEnrichments.scala, ClassfileParser.scala. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 3 XxxComment finding(s) in Explicit Debt — start with MatchCaseCompletions.scala (3). — One of this dimension's main actionable groups (3 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D19 · Documentation QualityExemplary◐ Sampled · advisory

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.

Maturity: Documented → Verified → Prevented · effective Exemplary / 10 · rule-coverage 100% · ceiling Documented

The Metals repository is well documented with a strong README and architecture/Docs set. The root README gives an overview of the project (Metals as Meta+LS), links to Discord, Twitter, scaladex, and contributes guidelines plus a short alternatives section; it also documents the metals-bench directory's benchmarks work. Architecture.md explains the high-level Metals LSP architecture with entrypoints in WorkspaceLspService.scala, references rust-analyzer's ARCHITECTURE.md philosophy, and covers Bloop integration across build tools (sbt, Gradle, Maven, Mill, Bazel). The acknowledgements document gives credit to sponsors and a list of maintainers. A dedicated Build Tools Overview page lists sbt, Maven, Gradle, Mill, Bloop, and Bazel with varying installation levels plus Goto/library-dependency navigation options. All the outlined documents are present. The Metals project's documentation is comprehensive: a single README (with no install/usage guidance) plus three architecture/design docs and twelve contributor-oriented documents covering getting started, project goals, releasing, updating the website, editor support, and user configuration. The README for contributors gets its own overview, installation, usage, contributing, and license sections; it is the root document that needs to be judged on those. The repository's READMEs are strong: the Vim editor doc explains what nvim-metals is, gives prerequisites/installation links, notes Neovim-specific commands are only available via the extension, and lists alternatives. The VS Code doc covers installation, pre-release versioning, SBT launcher customization, Java separation, and a full list of supported code actions with GIFs; it also includes architecture/usage docs (configure Java version, Metals's server JDK, Settings: project's JDK, macOS, custom repositories, HTTP proxy, SNAPSHOT, show document symbols, running/debugging via test explorer/code lenses/launch.json/Metals commands/jvm options/debugging Scala Native/on type formatting/formatting on paste/searching a symbol in the workspace/coming from IntelliJ/GitHub Codespaces). The features doc is clipped mid-sentence and the architecture docs are not shown, so the outline sections exist but cannot be confirmed as missing. All four core documentation gaps (overview, installation, usage/contribution, licence) appear only at the root level.

Documentation: no project overview · ×2README.md

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

No architecture decision records were found.

No ADRs found

What to do

Resolve the 1 No ADRs found finding(s) in ADR Quality. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D21 · Naming ConsistencyExemplary◐ Sampled · advisory

What it measures: Whether names — types, methods, variables — are clear and consistent.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.

Maturity: Documented → Verified → Prevented · effective Exemplary / 10 · rule-coverage 100% · ceiling Verified

0 naming inconsistencies across 0 sampled symbols.

✓ On the Gold path — maintain.

Detailed fixes: d21_recommendation.md.

Do you agree with this assessment?

D28 · Secrets (history)9.0 / 10Adequategated by 1 critical finding✓ Tool-verified

What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.

Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.

Maturity: Documented → Verified → Prevented · effective 9.0 / 10 · rule-coverage 100% · ceiling Documented

1 finding(s): 0 critical, 1 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.

REDACTED

What to do

Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D29 · Static Analysis (SAST)2.5 / 10Weak✓ Tool-verified

What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.

Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.

Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).

Maturity: Documented → Verified → Prevented · effective 2.5 / 10 · rule-coverage 100% · ceiling Documented

32 finding(s): 0 critical, 32 high, 0 medium, 0 low. 24 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 8 file(s) — `metals/src/main/resources/gradlew` (lines 160–161, line 162, line 163, …), `metals/src/main/scala/scala/meta/internal/metals/codeactions/StringActions.scala`, `mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala`, `mtags/src/main/scala/scala/meta/internal/metals/docstrings/Comment.scala`, `mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala`, … (+3 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED

+ 2 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
No action in Static Analysis (SAST) — all 24 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (24 issue-level, 0 of them charged here).

Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D30 · Dependency Vulnerabilities10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir/Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex, Go, Java and Kotlin via Maven/Gradle, npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No known-vulnerable dependencies in any ecosystem this repository declares.

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

Do you agree with this assessment?

D34 · Knowledge Freshness6.4 / 10Adequate✓ Tool-verified

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

Maturity: Documented → Verified → Prevented · effective 6.4 / 10 · rule-coverage 100% · ceiling Documented

126 of 351 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is metals/src/main/scala/scala/meta/internal/metals/codeactions/FlatMapToForComprehensionCodeAction.scala. Counted over 351 of the 682 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledge · ×4metals/src/main/scala/scala/meta/internal/metals/codeactions/FlatMapToForComprehensionCodeAction.scala

Further orphaned files (smaller)

What to do

Resolve the 4 Orphaned knowledge finding(s) in Knowledge Freshness — start with FlatMapToForComprehensionCodeAction.scala, MatchCaseCompletions.scala, ExtractRenameMember.scala. — One of this dimension's main actionable groups (4 issue-level).
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D35 · Change Coupling9.8 / 10Adequategated by 1 critical finding✓ Tool-verified

What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: DelegatingLanguageClient.scala↔NoopLanguageClient.scala 80%; DismissedNotifications.scala↔MetalsLspService.scala 73%; MetalsLspService.scala↔PopupChoiceReset.scala 64%

Boundary-crossing change coupling: MtagsResolver.scala ↔ V.scalametals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala

Change coupling: DelegatingLanguageClient.scala ↔ NoopLanguageClient.scala · ×2metals/src/main/scala/scala/meta/internal/metals/clients/language/DelegatingLanguageClient.scala

Change-coupling hub: MetalsLspService.scala → ClientExperimentalCapabilities.scala, DismissedNotifications.scala, ImportedBuild.scala, PopupChoiceReset.scala, WorkspaceSearchVisitor.scala, JdkSources.scalametals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala

What to do

Resolve the 1 Boundary-crossing change coupling finding(s) in Change Coupling — start with MtagsResolver.scala. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 2 Change coupling finding(s) in Change Coupling — start with DelegatingLanguageClient.scala, BloopInstall.scala. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with MetalsLspService.scala. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D36 · Supply-chain Provenance & Signing2.5 / 10Weak✓ Tool-verified

What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.

Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.

Maturity: Documented → Verified → Prevented · effective 2.5 / 10 · rule-coverage 100% · ceiling Documented

1/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED

What to do

Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

Do you agree with this assessment?

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AX10 · Code composition9.9 / 10Exemplary✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

What to do

The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.

Do you agree with this assessment?

M1 · Documentation (README)4.5 / 10Weak✓ Tool-verified

Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

96 code files changed in the last 6 months but the README was not touched — it may no longer reflect the system.

What to do

Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
Add a 'Testing' section to the root README — how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Add a README to the 1 of 1 project(s) that lack one — worth up to 2 pts.
Review the README against recent changes; refresh the parts that drifted.

Do you agree with this assessment?

M2 · Architecture documentation2.0 / 10Critical✓ Tool-verified

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).

Do you agree with this assessment?

M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

Do you agree with this assessment?

M4 · Documentation accuracy10.0 / 10Exemplary◐ Sampled · advisory

Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).

Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.

Do you agree with this assessment?

P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

Do you agree with this assessment?

P3 · Security & performance tooling8.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.

What to do

Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.

Do you agree with this assessment?

P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

Do you agree with this assessment?

P6 · Release Hygiene5.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

What to do

Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.

Do you agree with this assessment?

Reference — by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

Lens	Score	Rating	Impact
Code Health	85%	Strong	Solid.
Architecture	98%	Exemplary	Strongest area.
Maturity	58%	Adequate — gated by M2	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness	73%	Strong	Solid.
Security	68%	Adequate — gated by D29, D36	Capped at Fair by a Critical contributor — resolve it before relying on this lens.

Not evidenced — 4 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control

Not included — 84 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — no DI registrations detected
AX2 Stateful singletons — no singleton implementations detected
AX3 Project dependency cycles — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository commits no project file of a kind this check models. This is a gap in the analyzer, not a finding about this repository
AX4 Dependency direction — not assessed — project cycles and dependency direction are computed over a project-reference graph that was not loaded for this repository, because the repository commits no project file of a kind this check models. This is a gap in the analyzer, not a finding about this repository
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — not assessed — test isolation is computed from a project graph (which projects are test projects, and what they reference) that was not loaded for this repository, because the repository commits no project file of a kind this check models. This is a gap in the analyzer, not a finding about this repository
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — the dev server did not expose a crawlable HTTP endpoint in time — no runtime evidence This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~114014 lines of test source are present (.java, .scala) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included
D12 Dependency Hygiene — Dependency Hygiene not included (check did not complete)
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
D23 Boundary Type-Coupling — Production source is present (.java, .scala, .ts) but bounded contexts are resolved over the C#/VB project set, which exposed none, so context scope could not be assessed. Not scored — this is a gap in the analyzer, not a verdict about this repository. Declaring the codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed — see the recommendation on this dimension for where. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D26 Project Cohesion — Project cohesion is assessed over the .NET project set; this target exposed no projects, so project size and spread could not be assessed. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D27 Navigability — symbol resolution incomplete — navigability not assessed
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — 1 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D5 Coupling — Inter-project coupling could not be assessed — no analyzable project graph was found for this repository. Not scored: a gap in the analyzer's reach, not a verdict about this repository. (Coupling here is Martin afferent/efferent/instability plus reference cycles across a project-reference graph, read today from .NET project files; other ecosystems' module graphs are not read yet.)
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
D9 Test Distribution — Test source is present (.java, .scala) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so its unit/integration/BDD/E2E split couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
DM1 Domain Modelling — applicable but not scored (2 signals for this style, 2 needed — the count is met but a required primary signal is absent): 698 value object(s); 10 domain event(s)
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — This check finds retry-prone mutations (command handlers and message/event consumers) by walking the repository's declared types, and none was loaded here, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C# syntax, and none was loaded for this repository. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P2 Observability — Observability was not assessed: this check reads a source model that does not carry this repository's product — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of a logging idiom this check recognises is NOT evidence that this repo lacks structured logging (it may log through its own ecosystem's logger). This is a gap in the analyzer, not a finding about this repository.
P7 Outbound HTTP resilience — not measured — the application kind could not be determined for this repo
P8 Schema migrations — not assessed — schema-migration practice is read from a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF2 Allocation hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
PF3 Async & latency hygiene — Performance was not assessed: this lens reads a source model that was not loaded for this repository, because the repository is written in a language this lens does not yet model or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository — in particular it is NOT a statement that this repo is unpackaged or performance-careless.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X20 Mistyped argument guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X24 Document value interpolated into markup unescaped — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X25 Inert configuration knob — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X26 Unsynchronised callback handoff — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X27 Collection changed while being enumerated — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X28 Index access outside its own emptiness guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X29 Per-element action decided by a fixed element — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 38 finding(s)

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

D34 · Knowledge Freshness · Orphaned knowledge · ×4

Orphaned knowledge metals/src/main/scala/scala/meta/internal/metals/codeactions/FlatMapToForComprehensionCodeAction.scala — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractRenameMember.scala — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.
Orphaned knowledge mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala — No living knowledge remains for this large file — its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites.

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED
REDACTED

D28 · Secrets (history) · REDACTED · ×1

REDACTED

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D35 · Change Coupling · Boundary-crossing change coupling · ×1

Boundary-crossing change coupling: MtagsResolver.scala ↔ V.scala metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala — `metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala` (context metals) and `project/V.scala` (context project) sit in DIFFERENT parts of the tree yet change together 56% of the time (24 of the 43 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 24 shared commits counted here, the most recent 3 are `a863edf5` chore: Add support for 2.12.21 (#8019); `24b57eda` chore: Add support for Scala 2.13.18 (#7962); `52b8fb2c` chore: Add support for Scala 2.13.17 (#7846) — run `git show` on any of them.

Serious — 390 finding(s)

D17 · Explicit Debt · TodoComment · ×32

TodoComment metals/src/main/scala/scala/meta/internal/metals/Indexer.scala:30 — // todo https://github.com/scalameta/metals/issues/4788
TodoComment metals/src/main/scala/scala/meta/internal/metals/scalacli/ScalaCli.scala:48 — // todo https://github.com/scalameta/metals/issues/4788
TodoComment metals/src/main/scala/scala/meta/internal/metals/codeactions/ConvertCommentCodeAction.scala:143 — // TODO replace with strip once we drop jdk 8 — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment metals/src/main/scala/scala/meta/internal/metals/debug/server/testing/LoggingEventHandler.scala:111 — // TODO: Shall we think of a better way to format this delimiter based on screen length? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment metals/src/main/scala/scala/meta/metals/MetalsLanguageServer.scala:274 — // todo https://github.com/scalameta/metals/issues/4785
TodoComment mtags-java/src/main/scala/scala/meta/internal/pc/JavaRenameProvider.scala:55 — // TODO also make sure that it's a local symbol — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:368 — // TODO More consistency with use of stub symbols in `Unpickler` — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:566 — // TODO this should be !optimized, no? See c4181f656d. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:851 — // TODO 1: parse runtime visible annotations on parameters — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:854 — // TODO 2: also parse RuntimeInvisibleAnnotation / RuntimeInvisibleParamAnnotation, — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:935 — // TODO SI-9296 duplicated code, refactor
TodoComment mtags/src/main/scala-2/scala/meta/internal/pc/PcDefinitionProvider.scala:188 — // TODO: guard with try/catch to deal with ill-typed qualifiers. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:654 — // TODO: Convert to Char — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:692 — // TODO Should this be defined at some list companion? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:998 — // TODO: The header row must match the delimiter row in the number of cells. If not, a table will not be recognized: — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:999 — // TODO: Break at following block level element: The table is broken at the first empty line, or beginning of another block-level structure: — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:1000 — // TODO: Do not return a table when: The header row must match the delimiter row in the number of cells. If not, a table will not be recognized — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:1028 — // TODO: Abandon table parsing when the delimiter is missing instead of fixing and continuing. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:1062 — // TODO: Parse the second row without parsing inline markdown — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:1063 — // TODO: Save pos when delimiter row is parsed and use here in reported errors — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mtags/src/main/scala/scala/meta/internal/metals/docstrings/HtmlConverter.scala:16 — // TODO - Add conversion of tables — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/cross/src/test/scala/tests/pc/SignatureHelpSuite.scala:667 — // TODO short names are not supported yet — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/cross/src/test/scala/tests/pc/SignatureHelpSuite.scala:690 — // TODO short names are not supported yet — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/cross/src/test/scala/tests/pc/InlayHintsScala3Suite.scala:172 — // TODO: Add a separate option for hints for context bounds — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment tests/cross/src/test/scala/tests/pc/CompletionKeywordSuite.scala:444 — // TODO: Should provide empty completions — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
+ 7 more in this group — see findings.md.

D3 · God Classes · FileTooLong · ×32

FileTooLong: metals/Compilers.scala metals/src/main/scala/scala/meta/internal/metals/Compilers.scala — FileTooLong — 1383 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: Compilers (79-1851). The bar is 500 significant lines; this is 883 over it, 2.77× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: metals/MetalsLspService.scala metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala — FileTooLong — 1372 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 872 over it, 2.74× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: metals/WorkspaceLspService.scala metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala — FileTooLong — 1290 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: WorkspaceLspService (103-1584). The bar is 500 significant lines; this is 790 over it, 2.58× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: mcp/MetalsMcpTools.scala metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala — FileTooLong — 1172 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 672 over it, 2.34× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: mtags/ScalaToplevelMtags.scala mtags/src/main/scala/scala/meta/internal/mtags/ScalaToplevelMtags.scala — FileTooLong — 1081 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: ScalaToplevelMtags (49-1272). The bar is 500 significant lines; this is 581 over it, 2.16× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: metals/MetalsEnrichments.scala metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala — FileTooLong — 1033 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 533 over it, 2.07× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: pc/MetalsGlobal.scala mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala — FileTooLong — 943 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 443 over it, 1.89× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: docstrings/ScaladocParser.scala mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala — FileTooLong — 936 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 436 over it, 1.87× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: metals/Messages.scala metals/src/main/scala/scala/meta/internal/metals/Messages.scala — FileTooLong — 919 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 419 over it, 1.84× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: metals/PackageProvider.scala metals/src/main/scala/scala/meta/internal/metals/PackageProvider.scala — FileTooLong — 900 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 400 over it, 1.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: metals/UserConfiguration.scala metals/src/main/scala/scala/meta/internal/metals/UserConfiguration.scala — FileTooLong — 839 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 339 over it, 1.68× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: classfile/ClassfileParser.scala mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala — FileTooLong — 820 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: ClassfileParser (29-1205). The bar is 500 significant lines; this is 320 over it, 1.64× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: metals/ScalafixProvider.scala metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala — FileTooLong — 802 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 302 over it, 1.60× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: metals/ServerCommands.scala metals/src/main/scala/scala/meta/internal/metals/ServerCommands.scala — FileTooLong — 778 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 278 over it, 1.56× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: debug/DebugProvider.scala metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala — FileTooLong — 762 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: DebugProvider (77-827). The bar is 500 significant lines; this is 262 over it, 1.52× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: metals/FileDecoderProvider.scala metals/src/main/scala/scala/meta/internal/metals/FileDecoderProvider.scala — FileTooLong — 714 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: FileDecoderProvider (85-940). The bar is 500 significant lines; this is 214 over it, 1.43× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: metals/ProjectMetalsLspService.scala metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala — FileTooLong — 707 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ProjectMetalsLspService (48-945). The bar is 500 significant lines; this is 207 over it, 1.41× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: completions/Completions.scala mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala — FileTooLong — 703 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 203 over it, 1.41× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: metals/ReferenceProvider.scala metals/src/main/scala/scala/meta/internal/metals/ReferenceProvider.scala — FileTooLong — 679 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: ReferenceProvider (41-732). The bar is 500 significant lines; this is 179 over it, 1.36× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: metals/ConnectionProvider.scala metals/src/main/scala/scala/meta/internal/metals/ConnectionProvider.scala — FileTooLong — 673 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: ConnectionProvider (43-793). The bar is 500 significant lines; this is 173 over it, 1.35× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: metals/BuildServerConnection.scala metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala — FileTooLong — 613 significant lines (blank, comment-only and punctuation-only lines excluded), about 62% of them inside a single declaration: BuildServerConnection (49-603). The bar is 500 significant lines; this is 113 over it, 1.23× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: rename/RenameProvider.scala metals/src/main/scala/scala/meta/internal/rename/RenameProvider.scala — FileTooLong — 611 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: RenameProvider (58-795). The bar is 500 significant lines; this is 111 over it, 1.22× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: doctor/Doctor.scala metals/src/main/scala/scala/meta/internal/metals/doctor/Doctor.scala — FileTooLong — 595 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: Doctor (57-718). The bar is 500 significant lines; this is 95 over it, 1.19× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: pc/CompletionProvider.scala mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala — FileTooLong — 576 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: CompletionProvider (23-777). The bar is 500 significant lines; this is 76 over it, 1.15× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: metals/Embedded.scala metals/src/main/scala/scala/meta/internal/metals/Embedded.scala — FileTooLong — 571 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 71 over it, 1.14× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
+ 7 more in this group — see findings.md.

D3 · God Classes · TooManyMethods · ×15

TooManyMethods: MetalsLspService metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala:99 — TooManyMethods — 91 methods. The bar is 30 methods; this is 61 over it, 3.03× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: BuildTargets metals/src/main/scala/scala/meta/internal/metals/BuildTargets.scala:30 — TooManyMethods — 79 methods. The bar is 30 methods; this is 49 over it, 2.63× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: Compilers metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:79 — TooManyMethods — 61 methods. The bar is 30 methods; this is 31 over it, 2.03× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: PresentationCompiler mtags-interfaces/src/main/java/scala/meta/pc/PresentationCompiler.java:33 — TooManyMethods — 49 methods. The bar is 30 methods; this is 19 over it, 1.63× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: BuildServerConnection metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala:49 — TooManyMethods — 46 methods. The bar is 30 methods; this is 16 over it, 1.53× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: ClassfileParser mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:29 — TooManyMethods — 42 methods. The bar is 30 methods; this is 12 over it, 1.40× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: RawPresentationCompiler mtags-interfaces/src/main/java/scala/meta/pc/RawPresentationCompiler.java:31 — TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: XtensionAbsolutePath mtags/src/main/scala/scala/meta/internal/mtags/ScalametaCommonEnrichments.scala:319 — TooManyMethods — 40 methods. The bar is 30 methods; this is 10 over it, 1.33× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: ScalaToplevelMtags mtags/src/main/scala/scala/meta/internal/mtags/ScalaToplevelMtags.scala:49 — TooManyMethods — 39 methods. The bar is 30 methods; this is 9 over it, 1.30× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: BuildTools metals/src/main/scala/scala/meta/internal/builds/BuildTools.scala:33 — TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: XtensionAbsolutePathBuffers metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:395 — TooManyMethods — 35 methods. The bar is 30 methods; this is 5 over it, 1.17× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: TargetData metals/src/main/scala/scala/meta/internal/metals/TargetData.scala:35 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: MetalsGlobal mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:39 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: FileDecoderProvider metals/src/main/scala/scala/meta/internal/metals/FileDecoderProvider.scala:85 — TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: WorkspaceLspService metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:103 — TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.

D17 · Explicit Debt · FixmeComment · ×14

FixmeComment metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:1218 — // FIXME: https://github.com/scalacenter/bloop/issues/700
FixmeComment mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:991 — // FIXME: this performs an equivalent of getExceptionTypes instead of getGenericExceptionTypes (SI-7065)
FixmeComment tests/input/src/main/scala-2/example/MacroAnnotation.scala:6 — // FIXME: https://github.com/scalameta/scalameta/issues/1789
FixmeComment tests/unit/src/test/resources/definition/example/MacroAnnotation.scala:6 — // FIXME: https://github.com/scalameta/scalameta/issues/1789
FixmeComment tests/unit/src/test/resources/documentSymbol/example/MacroAnnotation.scala:6 — // FIXME: https://github.com/scalameta/scalameta/issues/1789
FixmeComment tests/unit/src/test/resources/inlayHints/example/MacroAnnotation.scala:6 — // FIXME: https://github.com/scalameta/scalameta/issues/1789
FixmeComment tests/unit/src/test/resources/mtags/example/MacroAnnotation.scala:6 — // FIXME: https://github.com/scalameta/scalameta/issues/1789
FixmeComment tests/unit/src/test/resources/semanticdb/example/MacroAnnotation.scala:6 — // FIXME: https://github.com/scalameta/scalameta/issues/1789
FixmeComment tests/unit/src/test/resources/toplevel-with-inner/example/MacroAnnotation.scala:6 — // FIXME: https://github.com/scalameta/scalameta/issues/1789
FixmeComment tests/unit/src/test/resources/workspace-symbol/example/MacroAnnotation.scala:6 — // FIXME: https://github.com/scalameta/scalameta/issues/1789
FixmeComment tests/unit/src/test/resources/semanticTokens/example/MacroAnnotation.scala:6 — // FIXME: https://github.com/scalameta/scalameta/issues/1789>>/*comment*/
FixmeComment tests/unit/src/test/scala/tests/ReferenceLspSuite.scala:215 — // FIXME: should, but doesn't find the class declaration: https://github.com/scalameta/metals/issues/1553#issuecomment-617884934
FixmeComment tests/unit/src/test/scala/tests/DiagnosticsLspSuite.scala:129 — // FIXME: https://github.com/scalacenter/bloop/issues/785
FixmeComment tests/unit/src/test/scala/tests/CompletionLspSuite.scala:106 — // FIXME(gabro): the tests don't pass with 2.12.10, although the plugins seem to work fine when — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.

D3 · God Classes · MethodTooLong · ×8

MethodTooLong: ScaladocParser.parseWikiAtSymbol mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:629 — MethodTooLong — parseWikiAtSymbol runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.21× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ClassfileParser.parseAttributes mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:788 — MethodTooLong — parseAttributes runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: BspConnector.connect metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala:89 — MethodTooLong — connect runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: OverrideCompletions.getMembers mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala:128 — MethodTooLong — getMembers runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PcCollector.isCorrectPos mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala:98 — MethodTooLong — isCorrectPos runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PcCollector.traverseSought mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala:101 — MethodTooLong — traverseSought runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ReferenceProvider.references metals/src/main/scala/scala/meta/internal/metals/ReferenceProvider.scala:175 — MethodTooLong — references runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: BuildServerConnection.fromSockets metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala:651 — MethodTooLong — fromSockets runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.

D3 · God Classes · ClassTooLong · ×8

ClassTooLong: WorkspaceLspService metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:103 — ClassTooLong — 1171 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 771 over it, 2.93× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ClassfileParser mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:29 — ClassTooLong — 804 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 404 over it, 2.01× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ProjectMetalsLspService metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala:48 — ClassTooLong — 665 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 265 over it, 1.66× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: RenameProvider metals/src/main/scala/scala/meta/internal/rename/RenameProvider.scala:58 — ClassTooLong — 559 significant lines (blank, comment-only and punctuation-only lines excluded), 25 methods. The bar is 400 significant lines; this is 159 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: CompletionProvider mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala:23 — ClassTooLong — 559 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 159 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: SignatureHelpProvider mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala:12 — ClassTooLong — 534 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 134 over it, 1.34× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ReferenceProvider metals/src/main/scala/scala/meta/internal/metals/ReferenceProvider.scala:41 — ClassTooLong — 528 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 128 over it, 1.32× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: PcInlayHintsProvider mtags/src/main/scala-2/scala/meta/internal/pc/PcInlayHintsProvider.scala:14 — ClassTooLong — 516 significant lines (blank, comment-only and punctuation-only lines excluded), 9 methods. The bar is 400 significant lines; this is 116 over it, 1.29× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.

D6 · Cohesion (LCOM4) · Low cohesion · ×8

Low cohesion: MetalsGlobal (LCOM4 14) mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:39 — MetalsGlobal's methods fall into 14 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 14 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: MetalsHttpClient (LCOM4 5) metals/src/main/scala/scala/meta/internal/metals/clients/language/MetalsHttpClient.scala:44 — MetalsHttpClient's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: JavaMetalsGlobal (LCOM4 5) mtags-java/src/main/scala/scala/meta/internal/pc/JavaMetalsGlobal.scala:44 — JavaMetalsGlobal's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: CompilerConfiguration (LCOM4 4) metals/src/main/scala/scala/meta/internal/metals/CompilerConfiguration.scala:28 — CompilerConfiguration's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: ConfiguredLanguageClient (LCOM4 4) metals/src/main/scala/scala/meta/internal/metals/clients/language/ConfiguredLanguageClient.scala:39 — ConfiguredLanguageClient's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: DebugProvider (LCOM4 4) metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala:77 — DebugProvider's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: DebugProxy (LCOM4 4) metals/src/main/scala/scala/meta/internal/metals/debug/DebugProxy.scala:58 — DebugProxy's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: Fuzzy (LCOM4 4) mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala:45 — Fuzzy's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.

D4 · Code Duplication · Duplicated block (8 lines × 2) · ×5

Duplicated block (8 lines × 2) metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:189 — metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:189-196 | metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:217-224 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:189` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:214` calls `get`, `Some` and `metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:187` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8 lines × 2) mtags/src/main/scala-2/scala/meta/internal/pc/ExtractMethodProvider.scala:27 — mtags/src/main/scala-2/scala/meta/internal/pc/ExtractMethodProvider.scala:27-34 | mtags/src/main/scala-2/scala/meta/internal/pc/InferredTypeProvider.scala:55-62 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala:576 — mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala:576-583 | mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala:517-524 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (8 lines × 2) mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala:97 — mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala:97-104 | mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala:106-113 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala:97` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8 lines × 2) metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:735 — metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:735-742 | mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala:228-235 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:735` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D17 · Explicit Debt · XxxComment · ×3

XxxComment mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala:585 — // xxx match { — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala:590 — // xxx match { — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala:598 — // xxx match { — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.

D4 · Code Duplication · Duplicated block (12 lines × 2) · ×3

Duplicated block (12 lines × 2) metals/src/main/scala/scala/meta/internal/metals/JavaInteractiveSemanticdb.scala:267 — metals/src/main/scala/scala/meta/internal/metals/JavaInteractiveSemanticdb.scala:267-278 | sbt-metals/src/main/scala/scala/meta/metals/MetalsPlugin.scala:192-203 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `metals/src/main/scala/scala/meta/internal/metals/JavaInteractiveSemanticdb.scala:267` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala:28 — mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala:28-39 | mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala:94-105 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala:94` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala:42 — mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala:42-53 | mtags/src/main/scala-2.13/scala/meta/internal/pc/Compat.scala:66-77 — before extracting anything, compare `mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala` and `mtags/src/main/scala-2.13/scala/meta/internal/pc/Compat.scala` as WHOLE FILES: 92% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.

D4 · Code Duplication · Duplicated block (5 lines × 2) · ×3

Duplicated block (5 lines × 2) metals/src/main/scala/scala/meta/internal/metals/Configs.scala:34 — metals/src/main/scala/scala/meta/internal/metals/Configs.scala:34-43 | metals/src/main/scala/scala/meta/internal/metals/Configs.scala:52-56 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `metals/src/main/scala/scala/meta/internal/metals/Configs.scala:52` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 2) metals/src/main/scala/scala/meta/internal/metals/codeactions/ImportMissingSymbol.scala:266 — metals/src/main/scala/scala/meta/internal/metals/codeactions/ImportMissingSymbol.scala:266-270 | metals/src/main/scala/scala/meta/internal/metals/codeactions/RemoveInvalidImport.scala:391-395 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `metals/src/main/scala/scala/meta/internal/metals/codeactions/ImportMissingSymbol.scala:266` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) metals-bench/src/main/scala/scala/meta/bench/InlayHintsBench.scala:28 — metals-bench/src/main/scala/scala/meta/bench/InlayHintsBench.scala:28-32 | metals-bench/src/main/scala/scala/meta/bench/SemanticTokensBench.scala:31-35 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.

D4 · Code Duplication · Duplicated block (11 lines × 2) · ×3

Duplicated block (11 lines × 2) metals/src/main/scala/scala/meta/internal/metals/FallbackMetalsLspService.scala:71 — metals/src/main/scala/scala/meta/internal/metals/FallbackMetalsLspService.scala:71-81 | metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala:128-138 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) mtags-shared/src/main/scala/scala/meta/internal/metals/ClassfileComparator.scala:5 — mtags-shared/src/main/scala/scala/meta/internal/metals/ClassfileComparator.scala:5-15 | mtags/src/main/scala-2/scala/meta/internal/pc/SymbolSearchCandidate.scala:68-78 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala:26 — mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala:26-36 | mtags/src/main/scala-2.13/scala/meta/internal/pc/Compat.scala:33-43 — before extracting anything, compare `mtags/src/main/scala-2.12/scala/meta/internal/pc/Compat.scala` and `mtags/src/main/scala-2.13/scala/meta/internal/pc/Compat.scala` as WHOLE FILES: 92% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.

D17 · Explicit Debt · HackComment · ×2

HackComment mtags/src/main/scala-2/scala/meta/internal/pc/Signatures.scala:83 — // HACK(olafur): we're using a type pretty-printer to pretty-print term objects here. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:995 — // HACK(olafur) Check if the position of the symbol in the old — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.

D35 · Change Coupling · Change coupling · ×2

Change coupling: DelegatingLanguageClient.scala ↔ NoopLanguageClient.scala metals/src/main/scala/scala/meta/internal/metals/clients/language/DelegatingLanguageClient.scala — `metals/src/main/scala/scala/meta/internal/metals/clients/language/DelegatingLanguageClient.scala` and `metals/src/main/scala/scala/meta/internal/metals/clients/language/NoopLanguageClient.scala` change together 80% of the time (12 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `753fcc8b` improvement: Improve the UX of new file provider (#8209); `75b51685` improvement: Add fallback if showMessageRequest is not supported (#7954); `76c95fb8` LSP general progress notification support (#6055) — run `git show` on any of them.
Change coupling: BloopInstall.scala ↔ BuildTool.scala metals/src/main/scala/scala/meta/internal/builds/BloopInstall.scala — `metals/src/main/scala/scala/meta/internal/builds/BloopInstall.scala` and `metals/src/main/scala/scala/meta/internal/builds/BuildTool.scala` change together 50% of the time (12 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package — so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are `73944e46` fix: retry counting build tool digest; `9a859e0a` feat: add setting to choose preferred build server (#6121); `510386db` bugfix: Use buildServerName instead of executableName in BSP — run `git show` on any of them.

D4 · Code Duplication · Duplicated block (14 lines × 2) · ×2

Duplicated block (14 lines × 2) mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala:233 — mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala:233-246 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaMetalsGlobal.scala:144-157 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (14 lines × 2) mtags-java/src/main/scala/scala/meta/internal/pc/JavaReferencesProvider.scala:85 — mtags-java/src/main/scala/scala/meta/internal/pc/JavaReferencesProvider.scala:85-98 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaRenameProvider.scala:94-107 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `mtags-java/src/main/scala/scala/meta/internal/pc/JavaReferencesProvider.scala:85` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D1 · Cyclomatic Complexity · ScalaToplevelMtags.loop (cyclomatic 77) · ×1

ScalaToplevelMtags.loop (cyclomatic 77) mtags/src/main/scala/scala/meta/internal/mtags/ScalaToplevelMtags.scala:119 — ScalaToplevelMtags.loop has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · WorkspaceLspService.executeCommand (cyclomatic 68) · ×1

WorkspaceLspService.executeCommand (cyclomatic 68) metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:854 — WorkspaceLspService.executeCommand has cyclomatic complexity 68 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · CompletionProvider.completions (cyclomatic 66) · ×1

CompletionProvider.completions (cyclomatic 66) mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala:53 — CompletionProvider.completions has cyclomatic complexity 66 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · ClassfileParser.parseAttributes (cyclomatic 62) · ×1

ClassfileParser.parseAttributes (cyclomatic 62) mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:788 — ClassfileParser.parseAttributes has cyclomatic complexity 62 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D1 · Cyclomatic Complexity · ScalaMtags.apply (cyclomatic 53) · ×1

ScalaMtags.apply (cyclomatic 53) mtags/src/main/scala/scala/meta/internal/mtags/ScalaMtags.scala:68 — ScalaMtags.apply has cyclomatic complexity 53 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · MetalsGlobal.shortType (cyclomatic 49) · ×1

MetalsGlobal.shortType (cyclomatic 49) mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:341 — MetalsGlobal.shortType has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · ClassfileParser.sigToType (cyclomatic 46) · ×1

ClassfileParser.sigToType (cyclomatic 46) mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:614 — ClassfileParser.sigToType has cyclomatic complexity 46 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D1 · Cyclomatic Complexity · SymbolTraverser.apply (cyclomatic 43) · ×1

SymbolTraverser.apply (cyclomatic 43) metals/src/main/scala/scala/meta/internal/parsing/DocumentSymbolProvider.scala:100 — SymbolTraverser.apply has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · JavaToplevelMtags.fetchToken (cyclomatic 42) · ×1

JavaToplevelMtags.fetchToken (cyclomatic 42) mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala:169 — JavaToplevelMtags.fetchToken has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · ScaladocParser.parseAtSymbol (cyclomatic 40) · ×1

ScaladocParser.parseAtSymbol (cyclomatic 40) mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:314 — ScaladocParser.parseAtSymbol has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · XtensionGSymbolSSymbolInformation.properties (cyclomatic 38) · ×1

XtensionGSymbolSSymbolInformation.properties (cyclomatic 38) metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala:374 — XtensionGSymbolSSymbolInformation.properties has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · ProblemResolver.problemMessage (cyclomatic 36) · ×1

ProblemResolver.problemMessage (cyclomatic 36) metals/src/main/scala/scala/meta/internal/metals/doctor/ProblemResolver.scala:49 — ProblemResolver.problemMessage has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · ProblemResolver.findProblem (cyclomatic 32) · ×1

ProblemResolver.findProblem (cyclomatic 32) metals/src/main/scala/scala/meta/internal/metals/doctor/ProblemResolver.scala:194 — ProblemResolver.findProblem has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · PcCollector.traverseSought (cyclomatic 32) · ×1

PcCollector.traverseSought (cyclomatic 32) mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala:101 — PcCollector.traverseSought has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · PackageProvider.calcImportEditsForFileMove (cyclomatic 31) · ×1

PackageProvider.calcImportEditsForFileMove (cyclomatic 31) metals/src/main/scala/scala/meta/internal/metals/PackageProvider.scala:523 — PackageProvider.calcImportEditsForFileMove has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · McpMain.parseArgs (cyclomatic 28) · ×1

McpMain.parseArgs (cyclomatic 28) metals-mcp/src/main/scala/scala/meta/metals/McpMain.scala:95 — McpMain.parseArgs has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · ImplementationProvider.symbolLocationsFromContext (cyclomatic 28) · ×1

ImplementationProvider.symbolLocationsFromContext (cyclomatic 28) metals/src/main/scala/scala/meta/internal/implementation/ImplementationProvider.scala:252 — ImplementationProvider.symbolLocationsFromContext has cyclomatic complexity 28 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D1 · Cyclomatic Complexity · ClasspathTreeView.children (cyclomatic 28) · ×1

ClasspathTreeView.children (cyclomatic 28) metals/src/main/scala/scala/meta/internal/tvp/ClasspathTreeView.scala:53 — ClasspathTreeView.children has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · AutoImportsProvider.autoImports (cyclomatic 28) · ×1

AutoImportsProvider.autoImports (cyclomatic 28) mtags/src/main/scala-2/scala/meta/internal/pc/AutoImportsProvider.scala:22 — AutoImportsProvider.autoImports has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · CaseKeywordCompletion.contribute (cyclomatic 27) · ×1

CaseKeywordCompletion.contribute (cyclomatic 27) mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala:82 — CaseKeywordCompletion.contribute has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · PcSemanticTokensProvider.makeNode (cyclomatic 26) · ×1

PcSemanticTokensProvider.makeNode (cyclomatic 26) mtags/src/main/scala-2/scala/meta/internal/pc/PcSemanticTokensProvider.scala:82 — PcSemanticTokensProvider.makeNode has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · Foldable.unapply (cyclomatic 25) · ×1

Foldable.unapply (cyclomatic 25) metals/src/main/scala/scala/meta/internal/parsing/FoldingRangeExtractor.scala:159 — Foldable.unapply has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · HoverProvider.hoverOffset (cyclomatic 25) · ×1

HoverProvider.hoverOffset (cyclomatic 25) mtags/src/main/scala-2/scala/meta/internal/pc/HoverProvider.scala:33 — HoverProvider.hoverOffset has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · WikiParser.table (cyclomatic 25) · ×1

WikiParser.table (cyclomatic 25) mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:817 — WikiParser.table has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · BspConnector.connect (cyclomatic 24) · ×1

BspConnector.connect (cyclomatic 24) metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala:89 — BspConnector.connect has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · RenameProvider.rename (cyclomatic 24) · ×1

RenameProvider.rename (cyclomatic 24) metals/src/main/scala/scala/meta/internal/rename/RenameProvider.scala:119 — RenameProvider.rename has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · InferredTypeProvider.inferredTypeEdits (cyclomatic 24) · ×1

InferredTypeProvider.inferredTypeEdits (cyclomatic 24) mtags/src/main/scala-2/scala/meta/internal/pc/InferredTypeProvider.scala:39 — InferredTypeProvider.inferredTypeEdits has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · OverrideCompletions.getMembers (cyclomatic 24) · ×1

OverrideCompletions.getMembers (cyclomatic 24) mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala:128 — OverrideCompletions.getMembers has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · ExtractMethodProvider.extractMethod (cyclomatic 23) · ×1

ExtractMethodProvider.extractMethod (cyclomatic 23) mtags/src/main/scala-2/scala/meta/internal/pc/ExtractMethodProvider.scala:18 — ExtractMethodProvider.extractMethod has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · UserConfiguration.fromJson (cyclomatic 22) · ×1

UserConfiguration.fromJson (cyclomatic 22) metals/src/main/scala/scala/meta/internal/metals/UserConfiguration.scala:619 — UserConfiguration.fromJson has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · PcDefinitionProvider.definitionTypedTreeAt (cyclomatic 22) · ×1

PcDefinitionProvider.definitionTypedTreeAt (cyclomatic 22) mtags/src/main/scala-2/scala/meta/internal/pc/PcDefinitionProvider.scala:143 — PcDefinitionProvider.definitionTypedTreeAt has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · SignatureHelpProvider.toSignatureInformation (cyclomatic 22) · ×1

SignatureHelpProvider.toSignatureInformation (cyclomatic 22) mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala:642 — SignatureHelpProvider.toSignatureInformation has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · FallbackDefinitionProvider.search (cyclomatic 21) · ×1

FallbackDefinitionProvider.search (cyclomatic 21) metals/src/main/scala/scala/meta/internal/metals/FallbackDefinitionProvider.scala:33 — FallbackDefinitionProvider.search has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · DebugDiscovery.validate (cyclomatic 21) · ×1

DebugDiscovery.validate (cyclomatic 21) metals/src/main/scala/scala/meta/internal/metals/debug/DebugDiscovery.scala:71 — DebugDiscovery.validate has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · ClassFinder.findClassNameForOffset (cyclomatic 21) · ×1

ClassFinder.findClassNameForOffset (cyclomatic 21) metals/src/main/scala/scala/meta/internal/parsing/ClassFinder.scala:152 — ClassFinder.findClassNameForOffset has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · PcCollector.resultWithSought (cyclomatic 21) · ×1

PcCollector.resultWithSought (cyclomatic 21) mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala:17 — PcCollector.resultWithSought has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.

D1 · Cyclomatic Complexity · Visitor.visitClass (cyclomatic 21) · ×1

Visitor.visitClass (cyclomatic 21) mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala:300 — Visitor.visitClass has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · DebugProvider.startDebugSession (cyclomatic 20) · ×1

DebugProvider.startDebugSession (cyclomatic 20) metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala:320 — DebugProvider.startDebugSession has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D1 · Cyclomatic Complexity · HoverProvider.toHover (cyclomatic 20) · ×1

HoverProvider.toHover (cyclomatic 20) mtags/src/main/scala-2/scala/meta/internal/pc/HoverProvider.scala:213 — HoverProvider.toHover has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · FlatMapToForComprehensionCodeAction.turnPatToTerm (cyclomatic 19) · ×1

FlatMapToForComprehensionCodeAction.turnPatToTerm (cyclomatic 19) metals/src/main/scala/scala/meta/internal/metals/codeactions/FlatMapToForComprehensionCodeAction.scala:504 — FlatMapToForComprehensionCodeAction.turnPatToTerm has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · InsertInferredType.contribute (cyclomatic 19) · ×1

InsertInferredType.contribute (cyclomatic 19) metals/src/main/scala/scala/meta/internal/metals/codeactions/InsertInferredType.scala:59 — InsertInferredType.contribute has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Fuzzy.forgivingFirstCharMatcher (cyclomatic 19) · ×1

Fuzzy.forgivingFirstCharMatcher (cyclomatic 19) mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala:312 — Fuzzy.forgivingFirstCharMatcher has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · Completions.completionPositionUnsafe (cyclomatic 19) · ×1

Completions.completionPositionUnsafe (cyclomatic 19) mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala:495 — Completions.completionPositionUnsafe has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Embedded.fallbackDownload (cyclomatic 18) · ×1

Embedded.fallbackDownload (cyclomatic 18) metals/src/main/scala/scala/meta/internal/metals/Embedded.scala:626 — Embedded.fallbackDownload has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · FormattingProvider.inspectDialectRewrite (cyclomatic 18) · ×1

FormattingProvider.inspectDialectRewrite (cyclomatic 18) metals/src/main/scala/scala/meta/internal/metals/FormattingProvider.scala:394 — FormattingProvider.inspectDialectRewrite has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · Default.resolve (cyclomatic 18) · ×1

Default.resolve (cyclomatic 18) metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala:149 — Default.resolve has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · ScalafixProvider.scalafixEvaluate (cyclomatic 18) · ×1

ScalafixProvider.scalafixEvaluate (cyclomatic 18) metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala:528 — ScalafixProvider.scalafixEvaluate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · WorkspaceSymbolProvider.workspaceSearch (cyclomatic 18) · ×1

WorkspaceSymbolProvider.workspaceSearch (cyclomatic 18) metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:342 — WorkspaceSymbolProvider.workspaceSearch has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D1 · Cyclomatic Complexity · StringActions.contribute (cyclomatic 18) · ×1

StringActions.contribute (cyclomatic 18) metals/src/main/scala/scala/meta/internal/metals/codeactions/StringActions.scala:20 — StringActions.contribute has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Diff.toRevised (cyclomatic 18) · ×1

Diff.toRevised (cyclomatic 18) metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala:237 — Diff.toRevised has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · Keyword.matchesPosition (cyclomatic 18) · ×1

Keyword.matchesPosition (cyclomatic 18) mtags-shared/src/main/scala/scala/meta/internal/pc/Keyword.scala:44 — Keyword.matchesPosition has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.

D1 · Cyclomatic Complexity · HtmlConverter.processHtmlElement (cyclomatic 18) · ×1

HtmlConverter.processHtmlElement (cyclomatic 18) mtags/src/main/scala/scala/meta/internal/metals/docstrings/HtmlConverter.scala:85 — HtmlConverter.processHtmlElement has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · JavaFormattingProvider.runFormat (cyclomatic 17) · ×1

JavaFormattingProvider.runFormat (cyclomatic 17) metals/src/main/scala/scala/meta/internal/metals/JavaFormattingProvider.scala:136 — JavaFormattingProvider.runFormat has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · ScalafmtConfig.parse (cyclomatic 17) · ×1

ScalafmtConfig.parse (cyclomatic 17) metals/src/main/scala/scala/meta/internal/metals/ScalafmtConfig.scala:127 — ScalafmtConfig.parse has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D1 · Cyclomatic Complexity · ProjectWarnings.noSemanticdb (cyclomatic 17) · ×1

ProjectWarnings.noSemanticdb (cyclomatic 17) metals/src/main/scala/scala/meta/internal/metals/Warnings.scala:24 — ProjectWarnings.noSemanticdb has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · IndexedSymbols.jarSymbols (cyclomatic 17) · ×1

IndexedSymbols.jarSymbols (cyclomatic 17) metals/src/main/scala/scala/meta/internal/tvp/IndexedSymbols.scala:166 — IndexedSymbols.jarSymbols has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · XtensionSymbolSSpec.descriptor (cyclomatic 17) · ×1

XtensionSymbolSSpec.descriptor (cyclomatic 17) metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala:88 — XtensionSymbolSSpec.descriptor has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · ClassfileParser.parseClass (cyclomatic 17) · ×1

ClassfileParser.parseClass (cyclomatic 17) mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:421 — ClassfileParser.parseClass has cyclomatic complexity 17 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D1 · Cyclomatic Complexity · MetalsGlobal.inverseSemanticdbSymbols (cyclomatic 17) · ×1

MetalsGlobal.inverseSemanticdbSymbols (cyclomatic 17) mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:605 — MetalsGlobal.inverseSemanticdbSymbols has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · SignatureHelpProvider.treeSymbol (cyclomatic 17) · ×1

SignatureHelpProvider.treeSymbol (cyclomatic 17) mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala:428 — SignatureHelpProvider.treeSymbol has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · WikiParser.parseInline (cyclomatic 17) · ×1

WikiParser.parseInline (cyclomatic 17) mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:1149 — WikiParser.parseInline has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · ScalafixProvider.runScalafixRules (cyclomatic 16) · ×1

ScalafixProvider.runScalafixRules (cyclomatic 16) metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala:170 — ScalafixProvider.runScalafixRules has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · MultilineString.contributeNewline (cyclomatic 16) · ×1

MultilineString.contributeNewline (cyclomatic 16) metals/src/main/scala/scala/meta/internal/metals/formatting/MultilineString.scala:395 — MultilineString.contributeNewline has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.

D1 · Cyclomatic Complexity · TokenEditDistance.apply (cyclomatic 16) · ×1

TokenEditDistance.apply (cyclomatic 16) metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala:470 — TokenEditDistance.apply has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.

D1 · Cyclomatic Complexity · XtensionGSymbolSSymbolInformation.kind (cyclomatic 16) · ×1

XtensionGSymbolSSymbolInformation.kind (cyclomatic 16) metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala:337 — XtensionGSymbolSSymbolInformation.kind has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · ImplicitParameters.partsFromImplicitArgs (cyclomatic 16) · ×1

ImplicitParameters.partsFromImplicitArgs (cyclomatic 16) mtags/src/main/scala-2/scala/meta/internal/pc/PcInlayHintsProvider.scala:298 — ImplicitParameters.partsFromImplicitArgs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · Completions.computeRelevancePenalty (cyclomatic 16) · ×1

Completions.computeRelevancePenalty (cyclomatic 16) mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala:158 — Completions.computeRelevancePenalty has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D1 · Cyclomatic Complexity · Completions.memberOrdering (cyclomatic 16) · ×1

Completions.memberOrdering (cyclomatic 16) mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala:206 — Completions.memberOrdering has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D15 · Churn × Complexity Hotspots · Hotspot · ×1

Hotspot: mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:341 — mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala changed 2 times in last 90 days, max cyclomatic complexity 49 in MetalsGlobal.shortType at line 341. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-06-27..2026-09-25, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-27 17:09:50 +02:00' --until='2026-09-25 17:09:50 +02:00' --full-history --no-merges -- mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.

D2 · Cognitive Complexity · ScalaToplevelMtags.loop (cognitive 127) · ×1

ScalaToplevelMtags.loop (cognitive 127) mtags/src/main/scala/scala/meta/internal/mtags/ScalaToplevelMtags.scala:119 — ScalaToplevelMtags.loop has cognitive complexity 127 (threshold 15). Drivers by points: if/else 41 (78 pts), match/switch 10 (30 pts), boolean chains 19 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · MetalsGlobal.shortType (cognitive 89) · ×1

MetalsGlobal.shortType (cognitive 89) mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:341 — MetalsGlobal.shortType has cognitive complexity 89 (threshold 15). Drivers by points: if/else 34 (59 pts), match/switch 7 (18 pts), boolean chains 11, error handling 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ImplementationProvider.symbolLocationsFromContext (cognitive 87) · ×1

ImplementationProvider.symbolLocationsFromContext (cognitive 87) metals/src/main/scala/scala/meta/internal/implementation/ImplementationProvider.scala:252 — ImplementationProvider.symbolLocationsFromContext has cognitive complexity 87 (threshold 15). Drivers by points: loops 15 (55 pts), if/else 8 (16 pts), match/switch 5 (14 pts), boolean chains 2 (nesting depth added 57). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · CompletionProvider.completions (cognitive 86) · ×1

CompletionProvider.completions (cognitive 86) mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala:53 — CompletionProvider.completions has cognitive complexity 86 (threshold 15). Drivers by points: if/else 45 (58 pts), match/switch 12 (16 pts), boolean chains 12 (nesting depth added 17). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · XtensionGSymbolSSymbolInformation.properties (cognitive 78) · ×1

XtensionGSymbolSSymbolInformation.properties (cognitive 78) metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala:374 — XtensionGSymbolSSymbolInformation.properties has cognitive complexity 78 (threshold 15). Drivers by points: if/else 31 (64 pts), boolean chains 11, match/switch 1 (3 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.

D2 · Cognitive Complexity · ClassfileParser.sigToType (cognitive 71) · ×1

ClassfileParser.sigToType (cognitive 71) mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:614 — ClassfileParser.sigToType has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 9 (18 pts), match/switch 5 (16 pts), boolean chains 7 (nesting depth added 32). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D2 · Cognitive Complexity · ClassfileParser.parseAttributes (cognitive 71) · ×1

ClassfileParser.parseAttributes (cognitive 71) mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:788 — ClassfileParser.parseAttributes has cognitive complexity 71 (threshold 15). Drivers by points: if/else 23 (34 pts), match/switch 9 (22 pts), loops 6 (7 pts), boolean chains 5, error handling 3 (nesting depth added 25). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D2 · Cognitive Complexity · ScalaMtags.apply (cognitive 65) · ×1

ScalaMtags.apply (cognitive 65) mtags/src/main/scala/scala/meta/internal/mtags/ScalaMtags.scala:68 — ScalaMtags.apply has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (32 pts), match/switch 9 (19 pts), loops 5 (11 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · FallbackDefinitionProvider.search (cognitive 60) · ×1

FallbackDefinitionProvider.search (cognitive 60) metals/src/main/scala/scala/meta/internal/metals/FallbackDefinitionProvider.scala:33 — FallbackDefinitionProvider.search has cognitive complexity 60 (threshold 15). Drivers by points: match/switch 7 (30 pts), if/else 9 (19 pts), loops 3 (6 pts), error handling 2 (5 pts) (nesting depth added 39). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · CaseKeywordCompletion.contribute (cognitive 60) · ×1

CaseKeywordCompletion.contribute (cognitive 60) mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala:82 — CaseKeywordCompletion.contribute has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (41 pts), match/switch 5 (13 pts), boolean chains 6 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · DebugProvider.startDebugSession (cognitive 58) · ×1

DebugProvider.startDebugSession (cognitive 58) metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala:320 — DebugProvider.startDebugSession has cognitive complexity 58 (threshold 15). Drivers by points: loops 12 (49 pts), match/switch 2 (5 pts), if/else 3, boolean chains 1 (nesting depth added 40). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · PackageProvider.calcImportEditsForFileMove (cognitive 57) · ×1

PackageProvider.calcImportEditsForFileMove (cognitive 57) metals/src/main/scala/scala/meta/internal/metals/PackageProvider.scala:523 — PackageProvider.calcImportEditsForFileMove has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (36 pts), match/switch 7 (17 pts), boolean chains 4 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Completions.memberOrdering (cognitive 56) · ×1

Completions.memberOrdering (cognitive 56) mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala:206 — Completions.memberOrdering has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (54 pts), boolean chains 1, match/switch 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.

D2 · Cognitive Complexity · ScalafmtConfig.parse (cognitive 54) · ×1

ScalafmtConfig.parse (cognitive 54) metals/src/main/scala/scala/meta/internal/metals/ScalafmtConfig.scala:127 — ScalafmtConfig.parse has cognitive complexity 54 (threshold 15). Drivers by points: loops 8 (36 pts), if/else 13 (14 pts), error handling 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 31). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · ScaladocParser.parseAtSymbol (cognitive 53) · ×1

ScaladocParser.parseAtSymbol (cognitive 53) mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:314 — ScaladocParser.parseAtSymbol has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 10 (26 pts), if/else 15 (21 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ScalafixProvider.scalafixEvaluate (cognitive 51) · ×1

ScalafixProvider.scalafixEvaluate (cognitive 51) metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala:528 — ScalafixProvider.scalafixEvaluate has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 4 (10 pts), error handling 1 (6 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ExtractMethodProvider.extractMethod (cognitive 51) · ×1

ExtractMethodProvider.extractMethod (cognitive 51) mtags/src/main/scala-2/scala/meta/internal/pc/ExtractMethodProvider.scala:18 — ExtractMethodProvider.extractMethod has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 7 (14 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · RenameProvider.rename (cognitive 43) · ×1

RenameProvider.rename (cognitive 43) metals/src/main/scala/scala/meta/internal/rename/RenameProvider.scala:119 — RenameProvider.rename has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 6 (13 pts), boolean chains 8 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · SignatureHelpProvider.toSignatureInformation (cognitive 43) · ×1

SignatureHelpProvider.toSignatureInformation (cognitive 43) mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala:642 — SignatureHelpProvider.toSignatureInformation has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 5, loops 2 (5 pts), match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ProblemResolver.findProblem (cognitive 40) · ×1

ProblemResolver.findProblem (cognitive 40) metals/src/main/scala/scala/meta/internal/metals/doctor/ProblemResolver.scala:194 — ProblemResolver.findProblem has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 10, match/switch 5 (7 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · BspConnector.connect (cognitive 39) · ×1

BspConnector.connect (cognitive 39) metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala:89 — BspConnector.connect has cognitive complexity 39 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 8 (13 pts), match/switch 6 (10 pts), boolean chains 2 (nesting depth added 18). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · SymbolTraverser.apply (cognitive 39) · ×1

SymbolTraverser.apply (cognitive 39) metals/src/main/scala/scala/meta/internal/parsing/DocumentSymbolProvider.scala:100 — SymbolTraverser.apply has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 3 (9 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · HoverProvider.hoverOffset (cognitive 39) · ×1

HoverProvider.hoverOffset (cognitive 39) mtags/src/main/scala-2/scala/meta/internal/pc/HoverProvider.scala:33 — HoverProvider.hoverOffset has cognitive complexity 39 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 10 (13 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · InferredTypeProvider.inferredTypeEdits (cognitive 39) · ×1

InferredTypeProvider.inferredTypeEdits (cognitive 39) mtags/src/main/scala-2/scala/meta/internal/pc/InferredTypeProvider.scala:39 — InferredTypeProvider.inferredTypeEdits has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 7, match/switch 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · PcCollector.traverseSought (cognitive 39) · ×1

PcCollector.traverseSought (cognitive 39) mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala:101 — PcCollector.traverseSought has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 5 (10 pts), boolean chains 9 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ExtractValueCodeAction.contribute (cognitive 38) · ×1

ExtractValueCodeAction.contribute (cognitive 38) metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractValueCodeAction.scala:31 — ExtractValueCodeAction.contribute has cognitive complexity 38 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 5 (15 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Fuzzy.forgivingFirstCharMatcher (cognitive 38) · ×1

Fuzzy.forgivingFirstCharMatcher (cognitive 38) mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala:312 — Fuzzy.forgivingFirstCharMatcher has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 7 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ImportedBuild.fromConnection (cognitive 36) · ×1

ImportedBuild.fromConnection (cognitive 36) metals/src/main/scala/scala/meta/internal/metals/ImportedBuild.scala:77 — ImportedBuild.fromConnection has cognitive complexity 36 (threshold 15). Drivers by points: loops 8 (36 pts) (nesting depth added 28). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · ExtractValueCodeAction.withInsertNewValueDef (cognitive 36) · ×1

ExtractValueCodeAction.withInsertNewValueDef (cognitive 36) metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractValueCodeAction.scala:180 — ExtractValueCodeAction.withInsertNewValueDef has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 3 (5 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ProblemResolver.problemMessage (cognitive 36) · ×1

ProblemResolver.problemMessage (cognitive 36) metals/src/main/scala/scala/meta/internal/metals/doctor/ProblemResolver.scala:49 — ProblemResolver.problemMessage has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22, match/switch 3 (7 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · MethodCallTraverser.visit (cognitive 36) · ×1

MethodCallTraverser.visit (cognitive 36) mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala:364 — MethodCallTraverser.visit has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 2 (6 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 22). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ForwardingMetalsBuildClient.buildTaskFinish (cognitive 35) · ×1

ForwardingMetalsBuildClient.buildTaskFinish (cognitive 35) metals/src/main/scala/scala/meta/internal/metals/ForwardingMetalsBuildClient.scala:199 — ForwardingMetalsBuildClient.buildTaskFinish has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (5 pts), match/switch 2 (5 pts), error handling 1 (4 pts) (nesting depth added 22). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · JavadocParser.extractParamTags (cognitive 35) · ×1

JavadocParser.extractParamTags (cognitive 35) mtags/src/main/scala/scala/meta/internal/metals/JavadocParser.scala:67 — JavadocParser.extractParamTags has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 20). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · JavaFormattingProvider.runFormat (cognitive 34) · ×1

JavaFormattingProvider.runFormat (cognitive 34) metals/src/main/scala/scala/meta/internal/metals/JavaFormattingProvider.scala:136 — JavaFormattingProvider.runFormat has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 4 (14 pts), error handling 2, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Diff.toRevised (cognitive 34) · ×1

Diff.toRevised (cognitive 34) metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala:237 — Diff.toRevised has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 8 (16 pts), if/else 12 (15 pts), boolean chains 3 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · OverrideCompletions.getMembers (cognitive 34) · ×1

OverrideCompletions.getMembers (cognitive 34) mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala:128 — OverrideCompletions.getMembers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22 (23 pts), boolean chains 7, match/switch 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · ReferenceProvider.references (cognitive 33) · ×1

ReferenceProvider.references (cognitive 33) metals/src/main/scala/scala/meta/internal/metals/ReferenceProvider.scala:175 — ReferenceProvider.references has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 2 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ClassfileParser.parseMethod (cognitive 33) · ×1

ClassfileParser.parseMethod (cognitive 33) mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:557 — ClassfileParser.parseMethod has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (14 pts), boolean chains 4 (nesting depth added 17). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D2 · Cognitive Complexity · HoverProvider.toHover (cognitive 33) · ×1

HoverProvider.toHover (cognitive 33) mtags/src/main/scala-2/scala/meta/internal/pc/HoverProvider.scala:213 — HoverProvider.toHover has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 7 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · Connect.bloopInstallAndConnect (cognitive 32) · ×1

Connect.bloopInstallAndConnect (cognitive 32) metals/src/main/scala/scala/meta/internal/metals/ConnectionProvider.scala:700 — Connect.bloopInstallAndConnect has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3 (13 pts), loops 3 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · WikiParser.table (cognitive 32) · ×1

WikiParser.table (cognitive 32) mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:817 — WikiParser.table has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22 (25 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · FileSystemSemanticdbs.textDocument (cognitive 31) · ×1

FileSystemSemanticdbs.textDocument (cognitive 31) metals/src/main/scala/scala/meta/internal/metals/FileSystemSemanticdbs.scala:26 — FileSystemSemanticdbs.textDocument has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (9 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · FormattingProvider.inspectDialectRewrite (cognitive 31) · ×1

FormattingProvider.inspectDialectRewrite (cognitive 31) metals/src/main/scala/scala/meta/internal/metals/FormattingProvider.scala:394 — FormattingProvider.inspectDialectRewrite has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · ClassfileParser.parseClass (cognitive 31) · ×1

ClassfileParser.parseClass (cognitive 31) mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:421 — ClassfileParser.parseClass has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 10). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D2 · Cognitive Complexity · JavaToplevelMtags.fetchToken (cognitive 31) · ×1

JavaToplevelMtags.fetchToken (cognitive 31) mtags/src/main/scala/scala/meta/internal/mtags/JavaToplevelMtags.scala:169 — JavaToplevelMtags.fetchToken has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (17 pts), match/switch 6 (10 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · SbtBuildTool.checkCorrectJavaVersion (cognitive 30) · ×1

SbtBuildTool.checkCorrectJavaVersion (cognitive 30) metals/src/main/scala/scala/meta/internal/builds/SbtBuildTool.scala:515 — SbtBuildTool.checkCorrectJavaVersion has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (14 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · InteractiveSemanticdbs.textDocument (cognitive 30) · ×1

InteractiveSemanticdbs.textDocument (cognitive 30) metals/src/main/scala/scala/meta/internal/metals/InteractiveSemanticdbs.scala:60 — InteractiveSemanticdbs.textDocument has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6, match/switch 2 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · AutoImportsProvider.autoImports (cognitive 30) · ×1

AutoImportsProvider.autoImports (cognitive 30) mtags/src/main/scala-2/scala/meta/internal/pc/AutoImportsProvider.scala:22 — AutoImportsProvider.autoImports has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 6, match/switch 6 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · Visitor.visitClass (cognitive 30) · ×1

Visitor.visitClass (cognitive 30) mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala:300 — Visitor.visitClass has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 7 (11 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · Embedded.fallbackDownload (cognitive 29) · ×1

Embedded.fallbackDownload (cognitive 29) metals/src/main/scala/scala/meta/internal/metals/Embedded.scala:626 — Embedded.fallbackDownload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 4 (8 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · MetalsPasteProvider.didPaste (cognitive 29) · ×1

MetalsPasteProvider.didPaste (cognitive 29) metals/src/main/scala/scala/meta/internal/metals/MetalsPasteProvider.scala:25 — MetalsPasteProvider.didPaste has cognitive complexity 29 (threshold 15). Drivers by points: loops 4 (16 pts), if/else 7 (11 pts), boolean chains 1, match/switch 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · ProjectWarnings.noSemanticdb (cognitive 29) · ×1

ProjectWarnings.noSemanticdb (cognitive 29) metals/src/main/scala/scala/meta/internal/metals/Warnings.scala:24 — ProjectWarnings.noSemanticdb has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ScalafixProvider.runScalafixRules (cognitive 28) · ×1

ScalafixProvider.runScalafixRules (cognitive 28) metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala:170 — ScalafixProvider.runScalafixRules has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · MetalsMcpTools.createFileCompileTool (cognitive 28) · ×1

MetalsMcpTools.createFileCompileTool (cognitive 28) metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:205 — MetalsMcpTools.createFileCompileTool has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (10 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · PcSemanticTokensProvider.makeNode (cognitive 28) · ×1

PcSemanticTokensProvider.makeNode (cognitive 28) mtags/src/main/scala-2/scala/meta/internal/pc/PcSemanticTokensProvider.scala:82 — PcSemanticTokensProvider.makeNode has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23 (24 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · SignatureHelpProvider.toSignatureHelp (cognitive 28) · ×1

SignatureHelpProvider.toSignatureHelp (cognitive 28) mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala:508 — SignatureHelpProvider.toSignatureHelp has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (7 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · CompilerConfiguration.enrichWithReleaseOption (cognitive 27) · ×1

CompilerConfiguration.enrichWithReleaseOption (cognitive 27) metals/src/main/scala/scala/meta/internal/metals/CompilerConfiguration.scala:379 — CompilerConfiguration.enrichWithReleaseOption has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 6 (9 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · Compilers.semanticTokens (cognitive 27) · ×1

Compilers.semanticTokens (cognitive 27) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:551 — Compilers.semanticTokens has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · XtensionAbsolutePathBuffers.toFileOnDisk0 (cognitive 27) · ×1

XtensionAbsolutePathBuffers.toFileOnDisk0 (cognitive 27) metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:511 — XtensionAbsolutePathBuffers.toFileOnDisk0 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, match/switch 1 (2 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · UserConfiguration.fromJson (cognitive 27) · ×1

UserConfiguration.fromJson (cognitive 27) metals/src/main/scala/scala/meta/internal/metals/UserConfiguration.scala:619 — UserConfiguration.fromJson has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9, match/switch 7 (9 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · IndexedSymbols.jarSymbols (cognitive 27) · ×1

IndexedSymbols.jarSymbols (cognitive 27) metals/src/main/scala/scala/meta/internal/tvp/IndexedSymbols.scala:166 — IndexedSymbols.jarSymbols has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 3 (9 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · CompletionItemResolver.fullDocstring (cognitive 27) · ×1

CompletionItemResolver.fullDocstring (cognitive 27) mtags/src/main/scala-2/scala/meta/internal/pc/CompletionItemResolver.scala:54 — CompletionItemResolver.fullDocstring has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (20 pts), match/switch 1 (4 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · ImplicitParameters.partsFromImplicitArgs (cognitive 27) · ×1

ImplicitParameters.partsFromImplicitArgs (cognitive 27) mtags/src/main/scala-2/scala/meta/internal/pc/PcInlayHintsProvider.scala:298 — ImplicitParameters.partsFromImplicitArgs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ConnectionProvider.reloadWorkspaceAndIndex (cognitive 26) · ×1

ConnectionProvider.reloadWorkspaceAndIndex (cognitive 26) metals/src/main/scala/scala/meta/internal/metals/ConnectionProvider.scala:247 — ConnectionProvider.reloadWorkspaceAndIndex has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (9 pts), match/switch 4 (6 pts) (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · WorkspaceSymbolProvider.workspaceSearch (cognitive 26) · ×1

WorkspaceSymbolProvider.workspaceSearch (cognitive 26) metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:342 — WorkspaceSymbolProvider.workspaceSearch has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 4 (6 pts), boolean chains 2, match/switch 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · Fuzzy.bloomFilterQueryStrings (cognitive 26) · ×1

Fuzzy.bloomFilterQueryStrings (cognitive 26) mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala:508 — Fuzzy.bloomFilterQueryStrings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · McpMain.parseArgs (cognitive 25) · ×1

McpMain.parseArgs (cognitive 25) metals-mcp/src/main/scala/scala/meta/metals/McpMain.scala:95 — McpMain.parseArgs has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 5 (7 pts), boolean chains 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · WorkspaceLspService.executeCommand (cognitive 25) · ×1

WorkspaceLspService.executeCommand (cognitive 25) metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:854 — WorkspaceLspService.executeCommand has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 5 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ClasspathTreeView.children (cognitive 25) · ×1

ClasspathTreeView.children (cognitive 25) metals/src/main/scala/scala/meta/internal/tvp/ClasspathTreeView.scala:53 — ClasspathTreeView.children has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · PcDefinitionProvider.definitionTypedTreeAt (cognitive 25) · ×1

PcDefinitionProvider.definitionTypedTreeAt (cognitive 25) mtags/src/main/scala-2/scala/meta/internal/pc/PcDefinitionProvider.scala:143 — PcDefinitionProvider.definitionTypedTreeAt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4, match/switch 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · ImplementationProvider.toPcSymbolInfo (cognitive 24) · ×1

ImplementationProvider.toPcSymbolInfo (cognitive 24) metals/src/main/scala/scala/meta/internal/implementation/ImplementationProvider.scala:512 — ImplementationProvider.toPcSymbolInfo has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 5 (8 pts), if/else 5, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ReferenceProvider.referenceAlternatives (cognitive 24) · ×1

ReferenceProvider.referenceAlternatives (cognitive 24) metals/src/main/scala/scala/meta/internal/metals/ReferenceProvider.scala:338 — ReferenceProvider.referenceAlternatives has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 7 (9 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · StringActions.contribute (cognitive 24) · ×1

StringActions.contribute (cognitive 24) metals/src/main/scala/scala/meta/internal/metals/codeactions/StringActions.scala:20 — StringActions.contribute has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 5 (7 pts), boolean chains 5 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · BloopDiagnosticsParser.getDiagnosticsFromErrors (cognitive 24) · ×1

BloopDiagnosticsParser.getDiagnosticsFromErrors (cognitive 24) metals/src/main/scala/scala/meta/internal/parsing/BloopDiagnosticsParser.scala:17 — BloopDiagnosticsParser.getDiagnosticsFromErrors has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (10 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Foldable.unapply (cognitive 24) · ×1

Foldable.unapply (cognitive 24) metals/src/main/scala/scala/meta/internal/parsing/FoldingRangeExtractor.scala:159 — Foldable.unapply has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (7 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · JavaDefinitionProvider.definitionImpl (cognitive 24) · ×1

JavaDefinitionProvider.definitionImpl (cognitive 24) mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala:59 — JavaDefinitionProvider.definitionImpl has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · InferredMethodProvider.makeEditsMethodObject (cognitive 24) · ×1

InferredMethodProvider.makeEditsMethodObject (cognitive 24) mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala:434 — InferredMethodProvider.makeEditsMethodObject has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 4 (11 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · PcDefinitionProvider.definition (cognitive 24) · ×1

PcDefinitionProvider.definition (cognitive 24) mtags/src/main/scala-2/scala/meta/internal/pc/PcDefinitionProvider.scala:58 — PcDefinitionProvider.definition has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · WikiLink.atOffset (cognitive 24) · ×1

WikiLink.atOffset (cognitive 24) mtags/src/main/scala/scala/meta/internal/metals/docstrings/WikiLink.scala:53 — WikiLink.atOffset has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.

D2 · Cognitive Complexity · BuildTargetInfo.buildTargetDetail (cognitive 23) · ×1

BuildTargetInfo.buildTargetDetail (cognitive 23) metals/src/main/scala/scala/meta/internal/metals/BuildTargetInfo.scala:27 — BuildTargetInfo.buildTargetDetail has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20 (23 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · Fuzzy.matchesName (cognitive 23) · ×1

Fuzzy.matchesName (cognitive 23) mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala:247 — Fuzzy.matchesName has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Indexer.indexWorkspace (cognitive 22) · ×1

Indexer.indexWorkspace (cognitive 22) metals/src/main/scala/scala/meta/internal/metals/Indexer.scala:88 — Indexer.indexWorkspace has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 4 (8 pts), error handling 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · ExtractRenameMember.calculate (cognitive 22) · ×1

ExtractRenameMember.calculate (cognitive 22) metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractRenameMember.scala:440 — ExtractRenameMember.calculate has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 3 (6 pts), if/else 3, boolean chains 2 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ScalaCliServers.start (cognitive 22) · ×1

ScalaCliServers.start (cognitive 22) metals/src/main/scala/scala/meta/internal/metals/scalacli/ScalaCliServers.scala:124 — ScalaCliServers.start has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · TypeHierarchyProvider.subtypes (cognitive 22) · ×1

TypeHierarchyProvider.subtypes (cognitive 22) metals/src/main/scala/scala/meta/internal/metals/typeHierarchy/TypeHierarchyProvider.scala:132 — TypeHierarchyProvider.subtypes has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ClassFinder.findClassNameForOffset (cognitive 22) · ×1

ClassFinder.findClassNameForOffset (cognitive 22) metals/src/main/scala/scala/meta/internal/parsing/ClassFinder.scala:152 — ClassFinder.findClassNameForOffset has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · RenameProvider.findRealRange (cognitive 22) · ×1

RenameProvider.findRealRange (cognitive 22) metals/src/main/scala/scala/meta/internal/rename/RenameProvider.scala:628 — RenameProvider.findRealRange has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · XtensionSymbolSSpec.descriptor (cognitive 22) · ×1

XtensionSymbolSSpec.descriptor (cognitive 22) metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala:88 — XtensionSymbolSSpec.descriptor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · XtensionGSymbolSSymbolInformation.kind (cognitive 22) · ×1

XtensionGSymbolSSymbolInformation.kind (cognitive 22) metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala:337 — XtensionGSymbolSSymbolInformation.kind has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · SignatureHelpProvider.treeSymbol (cognitive 22) · ×1

SignatureHelpProvider.treeSymbol (cognitive 22) mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala:428 — SignatureHelpProvider.treeSymbol has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 7, loops 2 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Completions.inferCompletionPosition (cognitive 22) · ×1

Completions.inferCompletionPosition (cognitive 22) mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala:635 — Completions.inferCompletionPosition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · Compilers.loadCompiler (cognitive 21) · ×1

Compilers.loadCompiler (cognitive 21) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1321 — Compilers.loadCompiler has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Indexer.indexDependencyModules (cognitive 21) · ×1

Indexer.indexDependencyModules (cognitive 21) metals/src/main/scala/scala/meta/internal/metals/Indexer.scala:417 — Indexer.indexDependencyModules has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 2 (7 pts), loops 3 (6 pts), error handling 1 (5 pts), if/else 2, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ProjectMetalsLspService.maybeImportScript (cognitive 21) · ×1

ProjectMetalsLspService.maybeImportScript (cognitive 21) metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala:798 — ProjectMetalsLspService.maybeImportScript has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · RewriteBracesParensCodeAction.switchFrom (cognitive 21) · ×1

RewriteBracesParensCodeAction.switchFrom (cognitive 21) metals/src/main/scala/scala/meta/internal/metals/codeactions/RewriteBracesParensCodeAction.scala:68 — RewriteBracesParensCodeAction.switchFrom has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (7 pts) (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · McpConfig.getPort (cognitive 21) · ×1

McpConfig.getPort (cognitive 21) metals/src/main/scala/scala/meta/internal/metals/mcp/McpConfig.scala:258 — McpConfig.getPort has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (20 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · SignatureHelpProvider.cursor (cognitive 21) · ×1

SignatureHelpProvider.cursor (cognitive 21) mtags/src/main/scala-2/scala/meta/internal/pc/SignatureHelpProvider.scala:281 — SignatureHelpProvider.cursor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ScalaCliBspScope.scalaCliBspRoot (cognitive 20) · ×1

ScalaCliBspScope.scalaCliBspRoot (cognitive 20) metals/src/main/scala/scala/meta/internal/bsp/ScalaCliBspScope.scala:17 — ScalaCliBspScope.scalaCliBspRoot has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (15 pts), match/switch 1 (4 pts), if/else 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · Supermethods.getGoToSuperMethodLocation (cognitive 20) · ×1

Supermethods.getGoToSuperMethodLocation (cognitive 20) metals/src/main/scala/scala/meta/internal/implementation/Supermethods.scala:71 — Supermethods.getGoToSuperMethodLocation has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (5 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · MetalsLspService.definitionOrReferences (cognitive 20) · ×1

MetalsLspService.definitionOrReferences (cognitive 20) metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala:1744 — MetalsLspService.definitionOrReferences has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ProjectMetalsLspService.onUserConfigUpdate (cognitive 20) · ×1

ProjectMetalsLspService.onUserConfigUpdate (cognitive 20) metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala:732 — ProjectMetalsLspService.onUserConfigUpdate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · ScalafixProvider.getScalafixConf (cognitive 20) · ×1

ScalafixProvider.getScalafixConf (cognitive 20) metals/src/main/scala/scala/meta/internal/metals/ScalafixProvider.scala:689 — ScalafixProvider.getScalafixConf has cognitive complexity 20 (threshold 15). Drivers by points: error handling 2 (6 pts), if/else 4 (5 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ConfiguredLanguageClient.metalsStatus (cognitive 20) · ×1

ConfiguredLanguageClient.metalsStatus (cognitive 20) metals/src/main/scala/scala/meta/internal/metals/clients/language/ConfiguredLanguageClient.scala:66 — ConfiguredLanguageClient.metalsStatus has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 7 (8 pts), boolean chains 2 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ExtractRenameMember.contribute (cognitive 20) · ×1

ExtractRenameMember.contribute (cognitive 20) metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractRenameMember.scala:49 — ExtractRenameMember.contribute has cognitive complexity 20 (threshold 15). Drivers by points: loops 2 (7 pts), boolean chains 5, match/switch 3 (5 pts), if/else 3 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · DebugProvider.retryAfterRebuild (cognitive 20) · ×1

DebugProvider.retryAfterRebuild (cognitive 20) metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala:781 — DebugProvider.retryAfterRebuild has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 1, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · DebugProxy.modifyLocationInTests (cognitive 20) · ×1

DebugProxy.modifyLocationInTests (cognitive 20) metals/src/main/scala/scala/meta/internal/metals/debug/DebugProxy.scala:308 — DebugProxy.modifyLocationInTests has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (13 pts), match/switch 2 (5 pts), if/else 2 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · DebugeeParamsCreator.create (cognitive 20) · ×1

DebugeeParamsCreator.create (cognitive 20) metals/src/main/scala/scala/meta/internal/metals/debug/server/DebugeeParamsCreator.scala:35 — DebugeeParamsCreator.create has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), error handling 1 (5 pts), match/switch 1 (5 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · AutoImports.autoImportPosition (cognitive 20) · ×1

AutoImports.autoImportPosition (cognitive 20) mtags/src/main/scala-2/scala/meta/internal/pc/AutoImports.scala:35 — AutoImports.autoImportPosition has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · CompletionProvider.safeCompletionsAt (cognitive 20) · ×1

CompletionProvider.safeCompletionsAt (cognitive 20) mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala:510 — CompletionProvider.safeCompletionsAt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 5 (6 pts), match/switch 3 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · MetalsGlobal.inverseSemanticdbSymbols (cognitive 20) · ×1

MetalsGlobal.inverseSemanticdbSymbols (cognitive 20) mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:605 — MetalsGlobal.inverseSemanticdbSymbols has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (5 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · WikiParser.parseInline (cognitive 20) · ×1

WikiParser.parseInline (cognitive 20) mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:1149 — WikiParser.parseInline has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · Connect.disconnect (cognitive 19) · ×1

Connect.disconnect (cognitive 19) metals/src/main/scala/scala/meta/internal/metals/ConnectionProvider.scala:411 — Connect.disconnect has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 4 (6 pts), match/switch 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · FileDecoderProvider.findBuildTargetMetadata (cognitive 19) · ×1

FileDecoderProvider.findBuildTargetMetadata (cognitive 19) metals/src/main/scala/scala/meta/internal/metals/FileDecoderProvider.scala:560 — FileDecoderProvider.findBuildTargetMetadata has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (9 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · ForwardingMetalsBuildClient.buildTaskProgress (cognitive 19) · ×1

ForwardingMetalsBuildClient.buildTaskProgress (cognitive 19) metals/src/main/scala/scala/meta/internal/metals/ForwardingMetalsBuildClient.scala:257 — ForwardingMetalsBuildClient.buildTaskProgress has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (16 pts), match/switch 2, if/else 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · PackageProvider.findTopLevelDecls (cognitive 19) · ×1

PackageProvider.findTopLevelDecls (cognitive 19) metals/src/main/scala/scala/meta/internal/metals/PackageProvider.scala:749 — PackageProvider.findTopLevelDecls has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · StacktraceAnalyzer.toToplevelSymbol (cognitive 19) · ×1

StacktraceAnalyzer.toToplevelSymbol (cognitive 19) metals/src/main/scala/scala/meta/internal/metals/StacktraceAnalyzer.scala:261 — StacktraceAnalyzer.toToplevelSymbol has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · MetalsHttpClient.completeCommand (cognitive 19) · ×1

MetalsHttpClient.completeCommand (cognitive 19) metals/src/main/scala/scala/meta/internal/metals/clients/language/MetalsHttpClient.scala:229 — MetalsHttpClient.completeCommand has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · HoverMarkup.apply (cognitive 19) · ×1

HoverMarkup.apply (cognitive 19) mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala:17 — HoverMarkup.apply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · WithCompilationUnit.symbolAlternatives (cognitive 19) · ×1

WithCompilationUnit.symbolAlternatives (cognitive 19) mtags/src/main/scala-2/scala/meta/internal/pc/WithCompilationUnit.scala:40 — WithCompilationUnit.symbolAlternatives has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Completions.inferIdentOffsets (cognitive 19) · ×1

Completions.inferIdentOffsets (cognitive 19) mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala:915 — Completions.inferIdentOffsets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · MetalsLocator.traverse (cognitive 19) · ×1

MetalsLocator.traverse (cognitive 19) mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala:755 — MetalsLocator.traverse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · CompletionValueGenerator.toCaseMember (cognitive 19) · ×1

CompletionValueGenerator.toCaseMember (cognitive 19) mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala:418 — CompletionValueGenerator.toCaseMember has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · Compilers.debugCompletions (cognitive 18) · ×1

Compilers.debugCompletions (cognitive 18) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:431 — Compilers.debugCompletions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Connect.createSession (cognitive 18) · ×1

Connect.createSession (cognitive 18) metals/src/main/scala/scala/meta/internal/metals/ConnectionProvider.scala:553 — Connect.createSession has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 4 (7 pts), if/else 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · FlatMapToForComprehensionCodeAction.turnPatToTerm (cognitive 18) · ×1

FlatMapToForComprehensionCodeAction.turnPatToTerm (cognitive 18) metals/src/main/scala/scala/meta/internal/metals/codeactions/FlatMapToForComprehensionCodeAction.scala:504 — FlatMapToForComprehensionCodeAction.turnPatToTerm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · IndentOnPaste.contribute (cognitive 18) · ×1

IndentOnPaste.contribute (cognitive 18) metals/src/main/scala/scala/meta/internal/metals/formatting/IndentOnPaste.scala:44 — IndentOnPaste.contribute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ClassfileComparator.compare (cognitive 18) · ×1

ClassfileComparator.compare (cognitive 18) mtags-shared/src/main/scala/scala/meta/internal/metals/ClassfileComparator.scala:16 — ClassfileComparator.compare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · InterpolationSplice.apply (cognitive 18) · ×1

InterpolationSplice.apply (cognitive 18) mtags-shared/src/main/scala/scala/meta/internal/pc/InterpolationSplice.scala:13 — InterpolationSplice.apply has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6, match/switch 4 (6 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · CompletionProvider.filterInteresting (cognitive 18) · ×1

CompletionProvider.filterInteresting (cognitive 18) mtags/src/main/scala-2/scala/meta/internal/pc/CompletionProvider.scala:366 — CompletionProvider.filterInteresting has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · ScalaDocPrinter.toText (cognitive 18) · ×1

ScalaDocPrinter.toText (cognitive 18) mtags/src/main/scala/scala/meta/internal/metals/docstrings/printers/ScalaDocPrinter.scala:15 — ScalaDocPrinter.toText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · BspConnector.switchBuildServer (cognitive 17) · ×1

BspConnector.switchBuildServer (cognitive 17) metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala:370 — BspConnector.switchBuildServer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · BloopInstall.runIfApproved (cognitive 17) · ×1

BloopInstall.runIfApproved (cognitive 17) metals/src/main/scala/scala/meta/internal/builds/BloopInstall.scala:128 — BloopInstall.runIfApproved has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (7 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · DefinitionProviderReportBuilder.build (cognitive 17) · ×1

DefinitionProviderReportBuilder.build (cognitive 17) metals/src/main/scala/scala/meta/internal/metals/DefinitionProvider.scala:606 — DefinitionProviderReportBuilder.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 5 (7 pts), boolean chains 3 (nesting depth added 4). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Embedded.findInPath (cognitive 17) · ×1

Embedded.findInPath (cognitive 17) metals/src/main/scala/scala/meta/internal/metals/Embedded.scala:755 — Embedded.findInPath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · FormattingProvider.formatForMcp (cognitive 17) · ×1

FormattingProvider.formatForMcp (cognitive 17) metals/src/main/scala/scala/meta/internal/metals/FormattingProvider.scala:179 — FormattingProvider.formatForMcp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), error handling 4 (6 pts), match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Indexer.indexSourceFile (cognitive 17) · ×1

Indexer.indexSourceFile (cognitive 17) metals/src/main/scala/scala/meta/internal/metals/Indexer.scala:525 — Indexer.indexSourceFile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, match/switch 1 (2 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Default.resolve (cognitive 17) · ×1

Default.resolve (cognitive 17) metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala:149 — Default.resolve has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 5, error handling 2 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · SourcePathAdapter.toDapURI (cognitive 17) · ×1

SourcePathAdapter.toDapURI (cognitive 17) metals/src/main/scala/scala/meta/internal/metals/debug/SourcePathAdapter.scala:22 — SourcePathAdapter.toDapURI has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 2, boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · FoldingRangeExtractor.extractCommentRanges (cognitive 17) · ×1

FoldingRangeExtractor.extractCommentRanges (cognitive 17) metals/src/main/scala/scala/meta/internal/parsing/FoldingRangeExtractor.scala:118 — FoldingRangeExtractor.extractCommentRanges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · TokenEditDistance.apply (cognitive 17) · ×1

TokenEditDistance.apply (cognitive 17) metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala:470 — TokenEditDistance.apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, match/switch 3 (6 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · XtensionGSymbolSSymbolInformation.access (cognitive 17) · ×1

XtensionGSymbolSSymbolInformation.access (cognitive 17) metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala:461 — XtensionGSymbolSSymbolInformation.access has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Keyword.matchesPosition (cognitive 17) · ×1

Keyword.matchesPosition (cognitive 17) mtags-shared/src/main/scala/scala/meta/internal/pc/Keyword.scala:44 — Keyword.matchesPosition has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 17. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.

D2 · Cognitive Complexity · MetalsGlobal.addCompilationUnit (cognitive 17) · ×1

MetalsGlobal.addCompilationUnit (cognitive 17) mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:741 — MetalsGlobal.addCompilationUnit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.

D2 · Cognitive Complexity · WorkspaceSymbolSearch.info (cognitive 17) · ×1

WorkspaceSymbolSearch.info (cognitive 17) mtags/src/main/scala-2/scala/meta/internal/pc/WorkspaceSymbolSearch.scala:52 — WorkspaceSymbolSearch.info has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 5). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ScaladocParser.createComment (cognitive 17) · ×1

ScaladocParser.createComment (cognitive 17) mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:21 — ScaladocParser.createComment has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8 (9 pts), if/else 7, error handling 1 (nesting depth added 1). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Visitor.visitVariable (cognitive 17) · ×1

Visitor.visitVariable (cognitive 17) mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala:479 — Visitor.visitVariable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · BuildTargets.inferBuildTargets (cognitive 16) · ×1

BuildTargets.inferBuildTargets (cognitive 16) metals/src/main/scala/scala/meta/internal/metals/BuildTargets.scala:398 — BuildTargets.inferBuildTargets has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), loops 2 (5 pts), if/else 3 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ClientConfiguration.hoverContentType (cognitive 16) · ×1

ClientConfiguration.hoverContentType (cognitive 16) metals/src/main/scala/scala/meta/internal/metals/ClientConfiguration.scala:178 — ClientConfiguration.hoverContentType has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (6 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · ModuleStatus.refresh (cognitive 16) · ×1

ModuleStatus.refresh (cognitive 16) metals/src/main/scala/scala/meta/internal/metals/ModuleStatus.scala:39 — ModuleStatus.refresh has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (10 pts), loops 2 (5 pts), if/else 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · PackageProvider.calcFullyQuilifiedEdits (cognitive 16) · ×1

PackageProvider.calcFullyQuilifiedEdits (cognitive 16) metals/src/main/scala/scala/meta/internal/metals/PackageProvider.scala:402 — PackageProvider.calcFullyQuilifiedEdits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (6 pts), match/switch 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · StdReporter.create (cognitive 16) · ×1

StdReporter.create (cognitive 16) metals/src/main/scala/scala/meta/internal/metals/ReportContext.scala:137 — StdReporter.create has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · InsertInferredType.contribute (cognitive 16) · ×1

InsertInferredType.contribute (cognitive 16) metals/src/main/scala/scala/meta/internal/metals/codeactions/InsertInferredType.scala:59 — InsertInferredType.contribute has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), match/switch 4 (5 pts), if/else 2 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · OrganizeImports.contribute (cognitive 16) · ×1

OrganizeImports.contribute (cognitive 16) metals/src/main/scala/scala/meta/internal/metals/codeactions/OrganizeImports.scala:35 — OrganizeImports.contribute has cognitive complexity 16 (threshold 15). Drivers by points: loops 2 (7 pts), if/else 5 (6 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · DebugDiscovery.validate (cognitive 16) · ×1

DebugDiscovery.validate (cognitive 16) metals/src/main/scala/scala/meta/internal/metals/debug/DebugDiscovery.scala:71 — DebugDiscovery.validate has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (7 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · ClassFinder.findAllClasses (cognitive 16) · ×1

ClassFinder.findAllClasses (cognitive 16) metals/src/main/scala/scala/meta/internal/parsing/ClassFinder.scala:52 — ClassFinder.findAllClasses has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · TrigramSubstrings.fromLists (cognitive 16) · ×1

TrigramSubstrings.fromLists (cognitive 16) mtags-shared/src/main/scala/scala/meta/internal/metals/TrigramSubstrings.scala:49 — TrigramSubstrings.fromLists has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ItemResolver.enrichDocs (cognitive 16) · ×1

ItemResolver.enrichDocs (cognitive 16) mtags-shared/src/main/scala/scala/meta/internal/pc/ItemResolver.scala:14 — ItemResolver.enrichDocs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ClassfileParser.parseField (cognitive 16) · ×1

ClassfileParser.parseField (cognitive 16) mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala:519 — ClassfileParser.parseField has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.

D2 · Cognitive Complexity · PcCollector.resultWithSought (cognitive 16) · ×1

PcCollector.resultWithSought (cognitive 16) mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala:17 — PcCollector.resultWithSought has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 3, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.

D2 · Cognitive Complexity · TypeParameters.getInlayHints (cognitive 16) · ×1

TypeParameters.getInlayHints (cognitive 16) mtags/src/main/scala-2/scala/meta/internal/pc/PcInlayHintsProvider.scala:406 — TypeParameters.getInlayHints has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 5, boolean chains 3 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · Completions.computeRelevancePenalty (cognitive 16) · ×1

Completions.computeRelevancePenalty (cognitive 16) mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala:158 — Completions.computeRelevancePenalty has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, match/switch 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.

D2 · Cognitive Complexity · InterpolatorCompletions.interpolatorMemberSelect (cognitive 16) · ×1

InterpolatorCompletions.interpolatorMemberSelect (cognitive 16) mtags/src/main/scala-2/scala/meta/internal/pc/completions/InterpolatorCompletions.scala:201 — InterpolatorCompletions.interpolatorMemberSelect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.

D2 · Cognitive Complexity · OverrideCompletions.implementAll (cognitive 16) · ×1

OverrideCompletions.implementAll (cognitive 16) mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala:383 — OverrideCompletions.implementAll has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · Visitor.findNameRange (cognitive 16) · ×1

Visitor.findNameRange (cognitive 16) mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala:200 — Visitor.findNameRange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · SymbolIndexBucket.modulePaths (cognitive 16) · ×1

SymbolIndexBucket.modulePaths (cognitive 16) mtags/src/main/scala/scala/meta/internal/mtags/SymbolIndexBucket.scala:363 — SymbolIndexBucket.modulePaths has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.

D2 · Cognitive Complexity · ScriptFirstImportPosition.skipComments (cognitive 16) · ×1

ScriptFirstImportPosition.skipComments (cognitive 16) mtags/src/main/scala/scala/meta/internal/pc/ScriptFirstImportPosition.scala:80 — ScriptFirstImportPosition.skipComments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D35 · Change Coupling · Change-coupling hub · ×1

Change-coupling hub: MetalsLspService.scala → ClientExperimentalCapabilities.scala, DismissedNotifications.scala, ImportedBuild.scala, PopupChoiceReset.scala, WorkspaceSearchVisitor.scala, JdkSources.scala metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala — `metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala` changes together with 6 other files — `metals/src/main/scala/scala/meta/internal/metals/ClientExperimentalCapabilities.scala`, `metals/src/main/scala/scala/meta/internal/metals/DismissedNotifications.scala`, `metals/src/main/scala/scala/meta/internal/metals/ImportedBuild.scala`, `metals/src/main/scala/scala/meta/internal/metals/PopupChoiceReset.scala`, `metals/src/main/scala/scala/meta/internal/metals/WorkspaceSearchVisitor.scala`, `mtags/src/main/scala/scala/meta/internal/metals/JdkSources.scala` — none of which declares a dependency on it: one file is the hub of 6 separate couplings, not 6 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 6.

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D4 · Code Duplication · Duplicated block (40–46 lines × 3) · ×1

Duplicated block (40–46 lines × 3) metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:596 — metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:596-641 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:661-700 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:722-761 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:596` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (27–33 lines × 2) · ×1

Duplicated block (27–33 lines × 2) metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:492 — metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:492-518 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:535-567 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:492` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (24 lines × 2) · ×1

Duplicated block (24 lines × 2) mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala:18 — mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala:18-41 | mtags/src/main/scala-2.13/scala/meta/internal/pc/JrtClasspathCompat.scala:18-41 — before extracting anything, compare `mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala` and `mtags/src/main/scala-2.13/scala/meta/internal/pc/JrtClasspathCompat.scala` as WHOLE FILES: 100% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala:18` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala:42` calls `printStackTrace` and `mtags/src/main/scala-2.13/scala/meta/internal/pc/JrtClasspathCompat.scala:42` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.

D4 · Code Duplication · Duplicated block (17 lines × 2) · ×1

Duplicated block (17 lines × 2) mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:37 — mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:37-53 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaRenameProvider.scala:46-62 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:37` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (15 lines × 2) · ×1

Duplicated block (15 lines × 2) mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:398 — mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:398-412 | mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:449-463 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:398` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (13 lines × 3) · ×1

Duplicated block (13 lines × 3) mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:42 — mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:42-54 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaRenameProvider.scala:51-63 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaRenameProvider.scala:99-112 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:42` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.

D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×1

Duplicated block (10–11 lines × 2) metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala:81 — metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala:81-91 | metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala:95-104 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala:81` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.

D4 · Code Duplication · Duplicated block (9 lines × 2) · ×1

Duplicated block (9 lines × 2) metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:1217 — metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:1217-1225 | metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:1228-1236 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (7 lines × 2) · ×1

Duplicated block (7 lines × 2) mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:40 — mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:40-46 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:100-106 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (10 lines × 2) · ×1

Duplicated block (10 lines × 2) metals/src/main/scala/scala/meta/internal/metals/Timer.scala:54 — metals/src/main/scala/scala/meta/internal/metals/Timer.scala:54-63 | metals/src/main/scala/scala/meta/internal/metals/debug/server/testing/LoggingEventHandler.scala:176-185 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.

D4 · Code Duplication · Duplicated block (5 lines × 5) · ×1

Duplicated block (5 lines × 5) mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala:36 — mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala:36-40 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:28-32 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaHoverProvider.scala:40-44 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaReferencesProvider.scala:49-53 | mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala:51-55 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. Note first that the copies are not typed on the same thing: the declarations holding them bind `params` to `OffsetParams` in one and `ReferencesRequest` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.

M1 · Documentation (README) · README may be stale · ×1

README may be stale — 96 code files changed in the last 6 months but the README was not touched — it may no longer reflect the system.

Minor — 11 finding(s)

D19 · Documentation Quality · Documentation · ×2

Documentation: no project overview README.md — The README is a single-file repository overview that does not state what the project is for or how to use its contents (e.g., the metals-bench benchmarks directory). State what Metals is and where each documented directory lives in one sentence.
Documentation: no installation or build instructions README.md — There are no installation, build, or setup instructions for the repository root. Add a short install section covering how to get started with Metals (language server, Bloop import).

D16 · Bus Factor · Off-boarding risk · ×1

Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 13 significant file(s) lose their only recent owner: metals/src/main/scala/scala/meta/internal/metals/mcp/ScalafixLlmRuleProvider.scala, metals/src/main/scala/scala/meta/internal/builds/NewProjectProvider.scala, mtags-java/src/main/scala/scala/meta/internal/pc/JavaMetalsGlobal.scala, metals/src/main/scala/scala/meta/internal/metals/watcher/ProjectFileWatcher.scala, mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala, metals/src/main/scala/scala/meta/internal/metals/FallbackDefinitionProvider.scala, metals/src/main/scala/scala/meta/internal/search/SymbolHierarchyOps.scala, metals/src/main/scala/scala/meta/internal/metals/doctor/ScalaProblem.scala (+5 more). Pair on, review, or document these before any departure.

D16 · Bus Factor · Further sole-owners (lower concentration) · ×1

Further sole-owners (lower concentration) — 6 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (20 single-owned of 351 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 351 of the 682 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above.

D20 · ADR Quality · No ADRs found · ×1

No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.

D28 · Secrets (history) · Rotate the exposed credentials · ×1

REDACTED

D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1

Further orphaned files (smaller) — 122 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala, metals/src/main/scala/scala/meta/internal/metals/codeactions/RemoveInvalidImport.scala, metals/src/main/scala/scala/meta/internal/metals/InitializationOptions.scala, metals/src/main/scala/scala/meta/internal/metals/testProvider/frameworks/MunitTestFinder.scala, metals/src/main/scala/scala/meta/internal/metals/MetalsHttpServer.scala, mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocUtils.scala, metals/src/main/scala/scala/meta/metals/lsp/DelegatingScalaService.scala, metals/src/main/scala/scala/meta/internal/parsing/ClassFinder.scala (and 114 more) (126 orphaned of 351 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 351 of the 682 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

M2 · Architecture documentation · No ADRs · ×1

No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

P6 · Release Hygiene · No changelog · ×1

No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

Appendix B — Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.

Dimension	Tool	Version	Command	Findings	Raw output
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-a7badd07230546ffa752ee790f62eb2c/history.json --exit-code 0 --source .	5	artifacts/raw/gitleaks-history.json
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-a7badd07230546ffa752ee790f62eb2c/tree.json --exit-code 0 --source .	0	artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)	semgrep	—	semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off .	32	artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilities	trivy	—	trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs /bin/ --skip-dirs /obj/ . --skip-db-update	0	artifacts/raw/trivy-fs.json
D31 · IaC & Container Security	trivy	—	trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.	0	—
D32 · Data Compliance (PII/GDPR)	semgrep	—	semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 1 file(s) — `website/docusaurus.config.ts` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.	0	—
D37 · Vulnerability-disclosure Policy	disclosure	—	disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.	0	—
D40 · Network Egress Confinement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.	0	—
D41 · Kernel & Syscall Confinement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.	0	—
D42 · Runtime Threat Enforcement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.	0	—
D43 · Malicious Dependencies	trivy	—	trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs /bin/ --skip-dirs /obj/ . --skip-db-update	0	artifacts/raw/trivy-fs.json

Run 01a0e2f7-d515-74fa-ad64-11714869111b · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Scalameta/metals

Findings by grade

This survey was produced by

Executive summary

Top priorities

Diagnosis — what's actually going on

Architecture — module dependency matrix

At a glance — Code Health · 85% · Strong ·

At a glance — Architecture · 98% · Exemplary ·

At a glance — Maturity · 58% · Adequate · gated by M2 ·

At a glance — Readiness · 73% · Strong ·

At a glance — Security · 68% · Adequate · gated by D29, D36 ·

Security & Compliance — OWASP Top-10 mapping

Roadmap

File quality

How the grades work

Methodology & how to trust this report

Tools & methods

Run transparency — what happened this run

Limitations & what we did not check

Per-dimension blind spots

The LLM boundary

Dimensions

Frontend & cross-cutting dimensions

Reference — by lens

Appendix A — Findings (grouped)

Appendix B — Reproduction & audit trail

Downloadable artifacts