Public report of scalameta/metals, published 14 November 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey → Signed and filed in the standard's public register, 14 November 2026, 07:15 UTC · Survey ID cd_fcd64f5a560a4054a7e2d4acda743a48

scalameta/metals

Measured 14 November 2026, 07:14 UTC, at code version 8640c91

CAI score 54out of 100 At risk Down 2 since the last survey

The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.

A large codebase: 107,310 lines of product code in 16 projects, tests not counted · Estimated rebuild effort: about 1.5 person-years · Weakest lens: Security and Compliance, 43

Findings by how serious they are

42 critical 492 serious 216 minor

11 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
14 November 2026, 07:14 UTC

A measurement, not a certificate. The Code Assurance Index records a number together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that implements it, and today the Canine Code Analyzer is the only one that does.

A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.

The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

58of 58 dimensions measured by tools.
710of 750 findings point to an exact file and line, so you can open each one in the code. The other 40 concern the repository as a whole, such as missing documentation.
58dimensions across 6 lenses, read from 107,310 lines of product code in 16 projects.
Chapters

Executive summary

scalameta/metals is rated At risk because critical security findings are open, most of them in the build pipeline. Its score is held back in part because it has pipeline tools referenced by a changeable name. It scores 54 out of 100, which the At risk rating leaves unchanged.

Security and Compliance, at 43, is the weakest lens and counts most in the score. The best first step is replacing the weak hashes, worth about 9 points. Fixing the three pipeline jobs with more access than they need would lift Security and Compliance itself, worth about 3 points. Raising Security and Compliance to 70 would lift the score to about 63.

Twenty-four pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Three weaknesses in the code could be used by an attacker, and five parts of the code are no longer understood by anyone working on it. Pinning each tool to an exact version, fixing the weaknesses the scanner points to and having someone learn the forgotten files would close these risks. Updating the vulnerable packages would fix the two packages with a known security hole, and limiting each secret to its own step would deal with the two secrets exposed to more of the pipeline than needed. The package under a licence on your banned list needs replacing, or clearing with your legal team.

The product code is 107,310 lines, about €220,000 to rebuild.

A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.

How the score is built: what each lens counts for The lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Security and Compliance 43 · counts for 46%Code Health 56 · counts for 25%Maturity 64 · counts for 14%Performance 71 · counts for 8%Production Readiness 72 · counts for 4%Architecture 91 · counts for 2%

If Security and Compliance rose from 43 to 70, the lowest score rated Strong, the score would rise from 54 to about 63.

Code composition: what the lines of code are
Product code 48%Tests 52%
New since the last survey: 58 findings

These 58 critical or serious findings weren't in the previous survey, on 26 October 2026.

  • Cognitive Complexity · NotebookKernelInstaller.ensure (cognitive 26) metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookKernelInstaller.scala
  • Cognitive Complexity · NotebookKernelInstaller.ensureKernel (cognitive 17) metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookKernelInstaller.scala
  • Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala
  • Code Duplication · Edited copy of a member (25 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractValueCodeAction.scala
  • Code Duplication · Edited copy of a member (34 corresponding lines) mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala
  • Code Duplication · Edited copy of a member (24 corresponding lines) REDACTED
  • Code Duplication · Edited copies of one member (3 members, 27+ corresponding lines) mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala
  • Code Duplication · Edited copy of a member (26 corresponding lines) mtags-shared/src/main/scala/scala/meta/internal/metals/ClassfileComparator.scala
  • Code Duplication · Edited copy of a member (18 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractValueCodeAction.scala
  • Code Duplication · Edited copy of a member (26 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/formatting/OnTypeFormattingProvider.scala
  • Code Duplication · Edited copy of a member (15 corresponding lines) mtags/src/main/scala/scala/meta/internal/pc/KeywordCompletionsUtils.scala
  • Code Duplication · Edited copy of a member (31 corresponding lines) mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala
  • Code Duplication · Edited copy of a member (24 corresponding lines) metals/src/main/scala/scala/meta/internal/bsp/BspConfigGenerator.scala
  • Code Duplication · Edited copies of one member (4 members, 24+ corresponding lines) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala
  • Code Duplication · Edited copy of a member (37 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala
  • Code Duplication · Edited copy of a member (19 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/JavaInteractiveSemanticdb.scala
  • Code Duplication · Edited copies of one member (3 members, 22+ corresponding lines) metals/src/main/scala/scala/meta/internal/metals/codeactions/ConvertToNamedArguments.scala
  • Code Duplication · Edited copy of a member (21 corresponding lines) metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala
  • Code Duplication · Edited copy of a member (15 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala
  • Code Duplication · Edited copy of a member (24 corresponding lines) mtags/src/main/scala/scala/meta/internal/mtags/Mtags.scala
  • Code Duplication · Edited copy of a member (19 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala
  • Code Duplication · Edited copy of a member (24 corresponding lines) mtags-shared/src/main/scala/scala/meta/internal/mtags/CommonMtagsEnrichments.scala
  • Code Duplication · Edited copy of a member (14 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/ScalaPresentationCompiler.scala
  • Code Duplication · Edited copy of a member (13 corresponding lines) metals/src/main/scala/scala/meta/internal/builds/Digests.scala
  • Code Duplication · Edited copy of a member (31 corresponding lines) metals-bench/src/main/scala/scala/meta/bench/InlayHintsBench.scala
  • Code Duplication · Edited copy of a member (11 corresponding lines) mtags/src/main/scala/scala/meta/internal/metals/docstrings/printers/MarkdownGenerator.scala
  • Code Duplication · Edited copy of a member (18 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/codeactions/CreateNewSymbol.scala
  • Code Duplication · Edited copies of one member (6 members, 10+ corresponding lines) mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala
  • Code Duplication · Edited copy of a member (14 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala
  • Code Duplication · Edited copy of a member (13 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala
  • Code Duplication · Edited copy of a member (10 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala
  • Code Duplication · Edited copy of a member (12 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala
  • Code Duplication · Edited copy of a member (6 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/Keywords.scala
  • Code Duplication · Edited copy of a member (13 corresponding lines) mtags/src/main/scala/scala/meta/internal/mtags/DefinitionAlternatives.scala
  • Code Duplication · Edited copies of one member (3 members, 12+ corresponding lines) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala
  • Code Duplication · Edited copy of a member (9 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala
  • Code Duplication · Edited copy of a member (8 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala
  • Code Duplication · Edited copy of a member (8 corresponding lines) mtags-java/src/main/scala/scala/meta/internal/pc/SourceJavaFileObject.scala
  • Code Duplication · Edited copy of a member (12 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/ScalaPresentationCompiler.scala
  • Code Duplication · Edited copy of a member (10 corresponding lines) metals/src/main/scala/scala/meta/internal/builds/BloopInstall.scala
  • Code Duplication · Edited copy of a member (8 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/completions/MillIvyCompletions.scala
  • Code Duplication · Edited copy of a member (10 corresponding lines) mtags-java/src/main/scala/scala/meta/internal/pc/JavaHover.scala
  • Code Duplication · Edited copy of a member (7 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala
  • Code Duplication · Edited copy of a member (8 corresponding lines) metals/src/main/scala/scala/meta/internal/builds/Digests.scala
  • Code Duplication · Edited copy of a member (6 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/completions/MultilineCommentCompletion.scala
  • Code Duplication · Edited copy of a member (7 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/FileDecoderProvider.scala
  • Code Duplication · Edited copy of a member (7 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/DependencySources.scala
  • Code Duplication · Edited copy of a member (9 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/PresentationCompilerClassLoader.scala
  • Code Duplication · Edited copy of a member (8 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/DependencySources.scala
  • Code Duplication · Edited copy of a member (5 corresponding lines) mtags-java/src/main/scala/scala/meta/internal/pc/JavaHoverProvider.scala
  • Code Duplication · Edited copy of a member (3 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookAdjustLspData.scala
  • Code Duplication · Edited copy of a member (4 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/JsonParser.scala
  • Code Duplication · Duplicated block (40–48 lines × 4) metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala
  • Code Duplication · Edited copy of a member (20 corresponding lines) metals-docs/src/main/scala/docs/Docs.scala
  • Churn × Complexity Hotspots · Repeated repair: metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala
  • Exception handling · Swallowed exception (caught, then discarded) mtags-shared/src/main/scala/scala/meta/internal/metals/PackageIndex.scala
  • Exception handling · Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/metals/notebook/AlmondKernelInstaller.scala
  • Async & latency hygiene · Sync-over-async blocking metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala

We compare every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.

Fixed since the last survey: 4 findings

These 4 critical or serious findings were in the previous survey, on 26 October 2026, and are gone from this one.

  • Code Duplication · Duplicated block (40–46 lines × 3) metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala
  • Code Duplication · Duplicated block (5 lines × 2) metals/src/main/scala/scala/meta/internal/metals/Configs.scala
  • Cohesion (LCOM4) · Low cohesion: ConfiguredLanguageClient (LCOM4 4) metals/src/main/scala/scala/meta/internal/metals/clients/language/ConfiguredLanguageClient.scala
  • Documentation (README) · README may be stale
Rebuild cost: about €220,000 · Estimate
Cost to rebuild€73,000 to €370,000, for 1,213 to 3,848 hours of work, about 1.5 person-years for 1 to 3 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 54. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeLarge: 107,310 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key.
This repository constructs a collision-broken hash (MD5/SHA1) at 6 sites, not one: `metals/src/main/scala/scala/meta/internal/bsp/BspServers.scala:208` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/BSPErrorHandler.scala:36` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/BspOnly.scala:18` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/Digest.scala:219` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/worksheets/WorksheetProvider.scala:627` (MessageDigest.getInstance("MD5")), `mtags-shared/src/main/scala/scala/meta/internal/mtags/MD5.scala:12` (MessageDigest.getInstance("MD5")). Each is a separate decision — fixing only the line this row cites leaves the others in place.
Raises the score by about 9 points · Medium effort · Web-Security Posture
2
Resolve the 3 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED.
Raises the score by about 3 points · Low effort · Supply-chain Provenance & Signing
3
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3).
Raises the score by about 2 points · Low effort · Static Analysis (SAST)

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €220,000 to build again, about 1.5 person-years of work. Its weakest lens is Security and Compliance, at 43 (Weak). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. Of all the actions in this report, it raises the score most for the work it takes: about 9 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.

arch cross cross mtest mtest cross->mtest docs docs metals metals docs->metals input input input3 input3 interfaces interfaces javapc javapc javapc->mtest mtags mtags metals->mtags metals-mcp metals-mcp metals-mcp->metals metalsDependencies metalsDependencies mtagsShared mtagsShared mtags->mtagsShared mtags-java mtags-java mtags-java->interfaces mtags-java->mtagsShared mtagsShared->interfaces mtest->mtags sbt-metals sbt-metals slow slow unit unit slow->unit unit->metals unit->mtest

Architecture: which parts of the code depend on which

The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.

273 modules, with 223 dependencies between them. One loop runs through 28 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 233 more are left out to keep it readable.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 scala.meta.internal.bsp.BspConfigGenerationStatus2 scala.meta.internal.builds.Digest3 scala.meta.internal.docstrings4 scala.meta.internal.metals.Compilers5 scala.meta.internal.metals.debug.DebugProxy6 scala.meta.internal.mtags7 scala.meta.internal.docstrings.printers8 scala.meta.internal.metals.Indexer9 scala.meta.internal.metals.PathMatcher10 scala.meta.internal.metals.debug.server11 scala.meta.internal.metals.scalacli12 scala.meta.internal.parsing13 scala.meta.internal.pc14 scala.meta.internal.tvp15 scala.meta.internal.worksheets16 scala.meta.internal.implementation17 scala.meta.internal.metals.Configs18 scala.meta.internal.metals.clients.language19 scala.meta.internal.metals.findfiles20 scala.meta.internal.builds21 scala.meta.internal.metals.callHierarchy22 scala.meta.internal.metals.codelenses23 scala.meta.internal.metals.debug24 scala.meta.internal.search25 scala.meta.internal.bsp26 scala.meta.internal.builds.WorkspaceLoadedStatus27 scala.meta.internal.metals.doctor28 scala.meta.metals.lsp29 scala.meta.internal.metals30 scala.meta.internal.metals.BuildServerConnection31 scala.meta.internal.metals.CompilerConfiguration32 scala.meta.internal.metals.ConnectionProvider33 scala.meta.internal.metals.ConnectionProvider.Connect34 scala.meta.internal.metals.FormattingProvider35 scala.meta.internal.metals.Messages36 scala.meta.internal.metals.SemanticTokensProvider.Interpolator37 scala.meta.internal.metals.doctor.MetalsServiceInfo38 scala.meta.internal.metals.mcp39 scala.meta.metals40 docs
1 scala.meta.internal.bsp.BspConfigGenerationStatus
2 scala.meta.internal.builds.Digest
3 scala.meta.internal.docstrings
4 scala.meta.internal.metals.Compilers
5 scala.meta.internal.metals.debug.DebugProxy
6 scala.meta.internal.mtags
7 scala.meta.internal.docstrings.printers8
8 scala.meta.internal.metals.Indexer2
9 scala.meta.internal.metals.PathMatcher2
10 scala.meta.internal.metals.debug.server5
11 scala.meta.internal.metals.scalacli6
12 scala.meta.internal.parsing1
13 scala.meta.internal.pc5
14 scala.meta.internal.tvp11
15 scala.meta.internal.worksheets2
16 scala.meta.internal.implementation212
17 scala.meta.internal.metals.Configs1
18 scala.meta.internal.metals.clients.language43
19 scala.meta.internal.metals.findfiles1
20 scala.meta.internal.builds353112
21 scala.meta.internal.metals.callHierarchy115
22 scala.meta.internal.metals.codelenses134
23 scala.meta.internal.metals.debug221116
24 scala.meta.internal.search11
25 scala.meta.internal.bsp36
26 scala.meta.internal.builds.WorkspaceLoadedStatus17
27 scala.meta.internal.metals.doctor110
28 scala.meta.metals.lsp14222
29 scala.meta.internal.metals125129382321131511411072
30 scala.meta.internal.metals.BuildServerConnection4
31 scala.meta.internal.metals.CompilerConfiguration12
32 scala.meta.internal.metals.ConnectionProvider1223
33 scala.meta.internal.metals.ConnectionProvider.Connect11
34 scala.meta.internal.metals.FormattingProvider2
35 scala.meta.internal.metals.Messages131
36 scala.meta.internal.metals.SemanticTokensProvider.Interpolator1
37 scala.meta.internal.metals.doctor.MetalsServiceInfo1122
38 scala.meta.internal.metals.mcp1726
39 scala.meta.metals123
40 docs21
Uses a module listed above itPart of a loopThe module itself
1 scala.meta.internal.bsp.BspConfigGenerationStatus2 scala.meta.internal.builds.Digest3 scala.meta.internal.docstrings4 scala.meta.internal.metals.Compilers5 scala.meta.internal.metals.debug.DebugProxy6 scala.meta.internal.mtags7 scala.meta.internal.docstrings.printers8 scala.meta.internal.metals.Indexer9 scala.meta.internal.metals.PathMatcher10 scala.meta.internal.metals.debug.server11 scala.meta.internal.metals.scalacli12 scala.meta.internal.parsing13 scala.meta.internal.pc14 scala.meta.internal.tvp15 scala.meta.internal.worksheets16 scala.meta.internal.implementation17 scala.meta.internal.metals.Configs18 scala.meta.internal.metals.clients.language19 scala.meta.internal.metals.findfiles20 scala.meta.internal.builds21 scala.meta.internal.metals.callHierarchy22 scala.meta.internal.metals.codelenses23 scala.meta.internal.metals.debug24 scala.meta.internal.search25 scala.meta.internal.bsp26 scala.meta.internal.builds.WorkspaceLoadedStatus27 scala.meta.internal.metals.doctor28 scala.meta.metals.lsp29 scala.meta.internal.metals30 scala.meta.internal.metals.BuildServerConnection31 scala.meta.internal.metals.CompilerConfiguration32 scala.meta.internal.metals.ConnectionProvider33 scala.meta.internal.metals.ConnectionProvider.Connect34 scala.meta.internal.metals.FormattingProvider35 scala.meta.internal.metals.Messages36 scala.meta.internal.metals.SemanticTokensProvider.Interpolator37 scala.meta.internal.metals.doctor.MetalsServiceInfo38 scala.meta.internal.metals.mcp39 scala.meta.metals40 docsscala.meta.internal.bsp.BspConfigGenerationStatus1scala.meta.internal.builds.Digest2scala.meta.internal.docstrings3scala.meta.internal.metals.Compilers4scala.meta.internal.metals.debug.DebugProxy5scala.meta.internal.mtags6scala.meta.internal.docstrings.printers7scala.meta.internal.metals.Indexer8scala.meta.internal.metals.PathMatcher9scala.meta.internal.metals.debug.server10scala.meta.internal.metals.scalacli11scala.meta.internal.parsing12scala.meta.internal.pc13scala.meta.internal.tvp14scala.meta.internal.worksheets15scala.meta.internal.implementation16scala.meta.internal.metals.Configs17scala.meta.internal.metals.clients.language18scala.meta.internal.metals.findfiles19scala.meta.internal.builds20scala.meta.internal.metals.callHierarchy21scala.meta.internal.metals.codelenses22scala.meta.internal.metals.debug23scala.meta.internal.search24scala.meta.internal.bsp25scala.meta.internal.builds.WorkspaceLoadedStatus26scala.meta.internal.metals.doctor27scala.meta.metals.lsp28scala.meta.internal.metals29scala.meta.internal.metals.BuildServerConnection30scala.meta.internal.metals.CompilerConfiguration31scala.meta.internal.metals.ConnectionProvider32scala.meta.internal.metals.ConnectionProvider.Connect33scala.meta.internal.metals.FormattingProvider34scala.meta.internal.metals.Messages35scala.meta.internal.metals.SemanticTokensProvider.Interpolator36scala.meta.internal.metals.doctor.MetalsServiceInfo37scala.meta.internal.metals.mcp38scala.meta.metals39docs408225615112212143135311211513422111611361711014222125129382321131511411072412122311213111122172612321+233 more modules (most-connected shown)

At a glance — Code Health · 56% · Adequate · gated by X5 ·

At a glance — Architecture · 91% · Adequate · gated by D26 ·

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

At a glance — Readiness · 72% · Strong ·

At a glance — Security · 43% · Weak · gated by D29, D36 ·

At a glance — Performance · 71% · Strong ·

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 categoryFindingsSeverity
A05:2025 — Injection33High / Critical
A03:2025 — Software Supply Chain Failures10High / Critical
A07:2025 — Authentication Failures2High / Critical

Roadmap

Top priorities: Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. This repository constructs a collision-broken hash (MD5/SHA1) at 6 sites, not one: `metals/src/main/scala/scala/meta/internal/bsp/BspServers.scala:208` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/BSPErrorHandler.scala:36` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/BspOnly.scala:18` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/Digest.scala:219` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/worksheets/WorksheetProvider.scala:627` (MessageDigest.getInstance("MD5")), `mtags-shared/src/main/scala/scala/meta/internal/mtags/MD5.scala:12` (MessageDigest.getInstance("MD5")). Each is a separate decision — fixing only the line this row cites leaves the others in place; On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it; Resolve the 3 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED.

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

Do thisHelpsEffortDimension
Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. This repository constructs a collision-broken hash (MD5/SHA1) at 6 sites, not one: `metals/src/main/scala/scala/meta/internal/bsp/BspServers.scala:208` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/BSPErrorHandler.scala:36` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/BspOnly.scala:18` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/Digest.scala:219` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/worksheets/WorksheetProvider.scala:627` (MessageDigest.getInstance("MD5")), `mtags-shared/src/main/scala/scala/meta/internal/mtags/MD5.scala:12` (MessageDigest.getInstance("MD5")). Each is a separate decision — fixing only the line this row cites leaves the others in place.+8.9 ptsMediumWeb-Security Posture
Resolve the 3 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED.+3.0 ptsLowSupply-chain Provenance & Signing
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3).+2.4 ptsLowStatic Analysis (SAST)
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with REDACTED.+2.0 ptsLowADR Quality
Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED.+1.9 ptsLowSecrets (history)
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED.+1.9 ptsLowStatic Analysis (SAST)
Resolve the 1 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED.+1.9 ptsLowDependency Vulnerabilities
Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED.+1.9 ptsLowDependency Vulnerabilities

File quality

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

FileScoreBandWorst signal
REDACTED2.3SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.5SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED3.6SlopStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.3MixedDependency Vulnerabilities: Critical CVE: REDACTED
metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala5.7MixedCyclomatic Complexity: DebugProvider.startDebugSession (cyclomatic 20)
mtags-shared/src/main/scala/scala/meta/internal/metals/Fuzzy.scala5.7MixedCyclomatic Complexity: Fuzzy.forgivingFirstCharMatcher (cyclomatic 19)
metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala5.8MixedChange Coupling: Boundary-crossing change coupling: MtagsResolver.scala ↔ REDACTED
metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala5.9MixedCognitive Complexity: MetalsLspService.definitionOrReferences (cognitive 20)
mtags/src/main/scala-2.11/scala/tools/nsc/symtab/classfile/ClassfileParser.scala6.0MixedExplicit Debt: TodoComment
mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala6.0MixedExplicit Debt: HackComment
mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala6.0MixedExplicit Debt: TodoComment
mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala6.0MixedExplicit Debt: XxxComment
mtags/src/main/scala-2/scala/meta/internal/pc/PcDefinitionProvider.scala6.0MixedExplicit Debt: TodoComment
metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala6.0MixedExplicit Debt: FixmeComment
metals/src/main/scala/scala/meta/internal/metals/Indexer.scala6.0MixedExplicit Debt: TodoComment
metals/src/main/scala/scala/meta/internal/builds/BloopInstall.scala6.3MixedCognitive Complexity: BloopInstall.runIfApproved (cognitive 17)
metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala6.7MixedGod Classes: TooManyMethods: BuildServerConnection

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 — 42

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 — 492

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 — 216

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

Could not be resolved — 11

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

This survey 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. All 58 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.

Every figure here is one of two 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. 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.

What we checked — 58 dimensions across the health lenses
D1D2D3D4D5D6D12D13D14D15D16D17D19D20D21D26D28D29D30D34D35D36D43AX10AX3AX4AX6AX8GD1IC1M1M2M3M4P1P10P2P3P4P6P8PF1PF3S1X1X12X13X16X18X19X21X24X25X27X28X3X30X5

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
  1. 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, 710 of 750 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.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. 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.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Canine Code Analyzer duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivySecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3✓ deterministic

Every finding is locatable in findings.md. Run 01a1d8e8-be02-7c95-aba7-f9d959d4a3bd.

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 — We 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 (.scala, .java) 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.
  • D11 Test Reliability — not measured this run — We 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 source is present (.scala, .java) and this repository declares an sbt build (repository root, 1041 test files), but it was not re-run: the analyzer environment could not run it. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we 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 package.json, but the licence verdict published here was taken over its sbt dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We 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 an ADMISSION gap, not an environment fault: it declares a published package (project/plugins.sbt), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict. For npm the surface is what a published package.json's entry points (exports, main, module, types) export, followed through the source; an entry that names build output the tree does not commit (dist/, build/) is not followed back to source, because only a tsconfig outDir/rootDir pair states that mapping and a bundler's input lives in executable configuration this engine does not evaluate.
  • D24 Comment Value — not measured this run — We 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. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • D27 Navigability — not measured this run — We 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. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • D32 Data Compliance (PII/GDPR) — not measured this run — We 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. `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`, `mtags/src/main/scala/scala/meta/internal/mtags/ScalametaCommonEnrichments.scala`, … (+1 more) 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 — We 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, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a REDACTED scalaVersion, 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 (Package.swift, a Dockerfile) is simply not read here yet.
  • AXB2 Runtime readiness — not measured this run — We 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. `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. (rule: no-root-manifest). The renderer reported: the dev server (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
  • AXR1 Runtime accessibility — not measured this run — We 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. Render strategy: boot via DevServer (start). the dev server (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered.
  • C1 Data Protection — not measured this run — We 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 — We 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.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we 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. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.

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

Limitations & what we did not check

We assess the repository exactly as committed, and only the repository. By design we do 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.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • 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.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • 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 publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • 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: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • 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.

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

69 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 70)metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:872
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

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

What to do

  1. Bring the 4 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with ScalaToplevelMtags.loop (cyclomatic 77), WorkspaceLspService.executeCommand (cyclomatic 70), CompletionProvider.completions (cyclomatic 66). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 4 together lifts Cyclomatic Complexity from 6.3 to about 6.5/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

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

170 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

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

What to do

  1. Bring the 9 bodies over 60 down to 60 or less in Cognitive Complexity — start with ScalaToplevelMtags.loop (cognitive 127), MetalsGlobal.shortType (cognitive 89), ImplementationProvider.symbolLocationsFromContext (cognitive 87). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 9 together lifts Cognitive Complexity from 5.3 to about 6.3/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D3 · God Classes8.3 / 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.3 / 10 · rule-coverage 100% · ceiling Prevented

62 god class(es) detected.

FileTooLong: metals/MetalsLspService.scala · ×31metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala
TooManyMethods: MetalsLspService · ×15metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala:102
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:107

What to do

  1. Resolve the 31 FileTooLong finding(s) in God Classes — start with MetalsLspService.scala, Compilers.scala, WorkspaceLspService.scala. — One of this dimension's main actionable groups (31 warning-level).
  2. 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).
  3. Resolve the 8 MethodTooLong finding(s) in God Classes — start with PcCollector.scala (2), ScaladocParser.scala, BspConnector.scala. — One of this dimension's main actionable groups (8 warning-level).

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

D4 · Code Duplication9.2 / 10Stronggated by 78 serious findings✓ Tool-verified

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

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

27 duplicated block group(s) detected. 2.1 % of the production lines (2,279 of 107,310) are in a reported copy. A further 51 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 1 of the 78 are in trees this repository does not ship — vendored, example/demo, project-template, 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.

Edited copy of a member (8 corresponding lines) · ×5mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala:43
Duplicated block (8 lines × 2) · ×5metals/src/main/scala/scala/meta/internal/metals/WorkspaceSymbolProvider.scala:189
Edited copy of a member (24 corresponding lines) · ×4REDACTED:46
Edited copy of a member (13 corresponding lines) · ×3metals/src/main/scala/scala/meta/internal/builds/Digests.scala:26
Edited copy of a member (10 corresponding lines) · ×3metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1647

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

What to do

  1. Resolve the 5 Edited copy of a member (8 corresponding lines) finding(s) in Code Duplication — start with MtagsEnrichments.scala, SourceJavaFileObject.scala, MillIvyCompletions.scala. — One of this dimension's main actionable groups (5 warning-level).
  2. 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).
  3. Resolve the 4 Edited copy of a member (24 corresponding lines) finding(s) in Code Duplication — start with REDACTED, BspConfigGenerator.scala, Mtags.scala. — One of this dimension's main actionable groups (4 warning-level).

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

D5 · Coupling10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

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

16 production modules (sbt), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; a dependsOn spread (deps: _*) and a project whose directory a helper computes are not visible there; 0 module(s) off the main sequence, with abstractness counted on 8 of the 16 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)9.6 / 10Stronggated by 7 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.6 / 10 · rule-coverage 100% · ceiling Verified

7 of 187 classes have LCOM4 above 3.

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

What to do

  1. Resolve the 7 Low cohesion finding(s) in Cohesion (LCOM4) — start with MetalsGlobal.scala, MetalsHttpClient.scala, JavaMetalsGlobal.scala. — One of this dimension's main actionable groups (7 warning-level).

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

D12 · Dependency Hygiene8.7 / 10Strong✓ Tool-verified

What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.

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

26 outdated direct sbt declarations. An sbt declaration names an EXACT version, so the remedy is an edit to the build file — there is no lockfile refresh that would move it. Test-, Provided- and it-scoped declarations are excluded, because a consumer of this project never receives them. A version held in a Scala val is read only when the val is one string literal: sbt is a program rather than a manifest, and evaluating a computed version would invent the measurement rather than take it. Whether any artifact is DEPRECATED or ABANDONED is not graded and cannot be — Maven Central publishes no such marker, and release age does not stand in for one: the most widely depended-upon libraries are routinely the stalest, being finished rather than abandoned. Known CVEs in this dependency graph are D30's question.

Outdated: com.lihaoyi:mill-contrib-testng · ×26

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

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.

D14 · License Compliance8.0 / 10Adequategated by 1 critical finding✓ Tool-verified

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 8.0 / 10 · rule-coverage 100% · ceiling Verified

1 of 68 declared sbt dependency artifact(s) use a banned license. Licences were resolved from the POMs Maven Central publishes, over the production coordinates this repository's 10 sbt build file(s) (REDACTED and project/*.scala) declare with a literal version, directly or through a string-literal val — `%%` resolved to the Scala binary suffix Central publishes under, test-scoped declarations excluded — the same declaration-site closure this analysis reads for dependency currency. sbt has no lockfile a checkout carries, so this is deliberately NOT the transitive closure. 6 further production coordinate(s) are declared with a version the build computes rather than writes as a literal — sbt is a program, and this pass does not run it — and are NOT graded: this verdict covers what the build pins literally or through a string-literal val, not the full graph. 1 of them resolve to no licence at all on Central, even through their parent POMs; that is missing data, not a violation, and none of them is charged. ★ COVERAGE OF THIS VERDICT: it grades this repository's sbt dependencies and nothing else. The repository also declares package.json, 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.

Banned license: org.openjdk.jol:jol-core

What to do

  1. Resolve the 1 Banned license finding(s) in License Compliance. — One of this dimension's main actionable groups (1 issue-level).

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

D15 · Churn × Complexity Hotspots10.0 / 10Stronggated by 2 serious findings✓ 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 10.0 / 10 · rule-coverage 100% · ceiling Documented

No churn × complexity hotspots in the window. Repeated repair below the complexity floor: metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala (4 of 6 changes were fixes); metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala (3 of 4 changes were fixes)

Repeated repair: metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala · ×2metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala:1819

What to do

  1. Resolve the 2 Repeated repair finding(s) in Churn × Complexity Hotspots — start with MetalsLspService.scala, ProjectMetalsLspService.scala. — One of this dimension's main actionable groups (2 warning-level).

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

D16 · Bus Factor9.3 / 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.3 / 10 · rule-coverage 100% · ceiling Documented

24 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 352 of the 689 production source files in this repository: 333 are under the ~2,400-byte size floor this dimension measures over, and the remaining 4 have no attributable history left to measure.

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.

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 107310 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 · ×32tests/unit/src/test/scala/tests/rangeFormatting/ScalaCliDependencyRangeFormatter.scala:126
FixmeComment · ×14tests/unit/src/test/scala/tests/CompletionLspSuite.scala:106
XxxComment · ×3mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala:583
HackComment · ×2mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:995

What to do

  1. Resolve the 32 TodoComment finding(s) in Explicit Debt — start with ScaladocParser.scala (8), ClassfileParser.scala (5), ScalaCliDependencyRangeFormatter.scala (2). — One of this dimension's main actionable groups (32 warning-level).
  2. Resolve the 14 FixmeComment finding(s) in Explicit Debt — start with MacroAnnotation.scala (9), CompletionLspSuite.scala, DiagnosticsLspSuite.scala. — One of this dimension's main actionable groups (14 warning-level).
  3. 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).

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

D19 · Documentation Quality10.0 / 10Exemplary○ Nothing flagged

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

Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.

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

1 of 1 documentation facets pass in full. 34 document(s) read across 2 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

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

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

Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.

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

No architecture decision records were found.

No ADRs foundREDACTED:389

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality — start with REDACTED. — 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.

D21 · Naming Consistency6.8 / 10Adequate✓ Tool-verified

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

Method: Seven vocabulary-free rules (N1-N7) mine each naming convention from the repository and flag a name that breaks a convention its structural peers in the same unit follow; production C# and TypeScript, each its own population. Deterministic, no model, no sample. Advisory.

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

3 naming inconsistencies among 95 declarations measured against a convention their peers follow.

`isScalaCLI` spells `CLI` where 43 names in the project spell it `Cli`metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala:108
`headerID` spells `ID` where 58 names in the project spell it `Id`metals/src/main/scala/scala/meta/internal/metals/UserConfigurationOption.scala:32
`isScalaCLIGeneratedFile` spells `CLI` where 43 names in the project spell it `Cli`mtags-shared/src/main/scala/scala/meta/internal/mtags/CommonMtagsEnrichments.scala:266

What to do

  1. Resolve the 1 `isScalaCLI` spells `CLI` where 43 names in the project spell it `Cli` finding(s) in Naming Consistency — start with BuildServerConnection.scala. — One of this dimension's main actionable groups (1 recommendation-level).
  2. Resolve the 1 `headerID` spells `ID` where 58 names in the project spell it `Id` finding(s) in Naming Consistency — start with UserConfigurationOption.scala. — One of this dimension's main actionable groups (1 recommendation-level).
  3. Resolve the 1 `isScalaCLIGeneratedFile` spells `CLI` where 43 names in the project… finding(s) in Naming Consistency — start with CommonMtagsEnrichments.scala. — One of this dimension's main actionable groups (1 recommendation-level).

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

D26 · Project Cohesion0.0 / 10Critical✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic.

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

1 of 2 build units (npm, sbt) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).

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

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
REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. 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.

D29 · Static Analysis (SAST)2.4 / 10Critical✓ 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.4 / 10 · rule-coverage 100% · ceiling Documented

33 finding(s): 0 critical, 32 high, 1 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 10 file(s) — `metals/src/main/resources/gradlew` (lines 160–161, line 162, line 163, …), `metals/src/main/resources/sbt-launchers/1/sbt` (line 109), `metals/src/main/resources/sbt-launchers/2/sbt` (line 109), `metals/src/main/scala/scala/meta/internal/metals/codeactions/StringActions.scala`, `mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala`, … (+5 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
REDACTED
REDACTED
REDACTED
REDACTED

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

What to do

  1. 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).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. 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.

D30 · Dependency Vulnerabilities7.9 / 10Adequategated by 2 critical findings✓ Tool-verified

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via 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 (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), 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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

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

3 finding(s): 1 critical, 1 high, 1 medium, 0 low.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 1 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. Resolve the 1 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

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

D34 · Knowledge Freshness5.7 / 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 5.7 / 10 · rule-coverage 100% · ceiling Documented

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

Orphaned knowledge · ×5mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala:1
Orphaned file · ×148metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala:1
Further orphaned files (smaller)

What to do

  1. Resolve the 148 Orphaned file finding(s) in Knowledge Freshness — start with ScalacpCopyPaste.scala, OverrideCompletions.scala, RemoveInvalidImport.scala. — One of this dimension's main actionable groups (148 recommendation-level).
  2. Resolve the 5 Orphaned knowledge finding(s) in Knowledge Freshness — start with Completions.scala, FlatMapToForComprehensionCodeAction.scala, ExtractRenameMember.scala. — One of this dimension's main actionable groups (5 issue-level).
  3. 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.

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: DismissedNotifications.scala↔MetalsLspService.scala 73%; DelegatingLanguageClient.scala↔NoopLanguageClient.scala 73%; MetalsLspService.scala↔PopupChoiceReset.scala 64%

Boundary-crossing change coupling: MtagsResolver.scala ↔ REDACTEDmetals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala:1
Change coupling: DelegatingLanguageClient.scala ↔ NoopLanguageClient.scala · ×2metals/src/main/scala/scala/meta/internal/metals/clients/language/DelegatingLanguageClient.scala:1
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

  1. 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).
  2. 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).
  3. 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.

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
REDACTED
REDACTED
REDACTED
REDACTED

What to do

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

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

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. Reported 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. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

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.

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.

AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

AX6 · Interface segregation9.9 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').

Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.

  • `IndexProviders` declares 28 abstract members: `languageClient`, `executionContext`, `tables`, `statusBar`, `workDoneProgress`, `timerProvider`, `indexingPromise`, `buildData`, `clientConfig`, `definitionIndex`, `referencesProvider`, `workspaceSymbols`, `buildTargets`, `semanticDBIndexer`, `fileWatcher`, `focusedDocument`, `focusedDocumentBuildTarget`, `buildTargetClasses`, `userConfig`, `sh`, `symbolDocs`, `scalaVersionSelector`, `sourceMapper`, `folder`, `implementationProvider`, `resetService`, `fileChanges`, `notebookProvider`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — metals/src/main/scala/scala/meta/internal/metals/IndexProviders.scala:19
  • `TextDocumentService` declares 33 abstract members: `didOpen`, `didChange`, `didClose`, `didSave`, `definition`, `typeDefinition`, `implementation`, `hover`, `documentHighlights`, `documentSymbol`, `formatting`, `onTypeFormatting`, `rangeFormatting`, `prepareRename`, `rename`, `references`, `prepareCallHierarchy`, `callHierarchyIncomingCalls`, `callHierarchyOutgoingCalls`, `prepareTypeHierarchy`, `typeHierarchySupertypes`, `typeHierarchySubtypes`, `completion`, `completionItemResolve`, `signatureHelp`, `codeAction`, `codeActionResolve`, `codeLens`, `foldingRange`, `selectionRange`, `semanticTokensFull`, `inlayHints`, `inlayHintResolve`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — metals/src/main/scala/scala/meta/metals/lsp/TextDocumentService.scala:20

What to do

  • Split fat interfaces into focused role-interfaces so clients depend only on what they use.
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.

Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.

GD1 · Unfinished & placeholder code10.0 / 10Exemplary✓ Tool-verified

Other · Code Health — Unreviewed-generation residue in this repository's Scala: methods whose whole body is still `???` or a "not implemented" throw where nothing overrides them, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.

  • `subSequence` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — mtags-shared/src/main/scala/scala/meta/internal/metals/ConcatSequence.scala:16

What to do

  • Finish or delete the members whose body is still `???` or a "not implemented" throw where nothing overrides them, and replace placeholder text before shipping.
IC1 · Incompleteness & stubs8.5 / 10Strong✓ Tool-verified

Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Scala: methods whose body is `???` or only throws a "not implemented" error, methods that take inputs and return a constant or do nothing, dead `if (false)` branches, and skeleton classes most of whose methods are holes.

Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.

  • `subSequence` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — mtags-shared/src/main/scala/scala/meta/internal/metals/ConcatSequence.scala:16
  • `clearJrtClassPathCaches` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in. — mtags/src/main/scala-2.11/scala/meta/internal/pc/JrtClasspathCompat.scala:7
  • A bare `// scalastyle:off`, `// scalafix:off` or `@nowarn` (or Wartremover's `warts.All`) switches every rule or warning off — hidden debt. Suppress the specific rule on the specific line, with a justification, instead. (×2) — metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:612, metals/src/main/scala/scala/meta/internal/metals/codeactions/CodeAction.scala:60
  • A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something. (×7) — tests/cross/src/test/scala/tests/pc/CompletionArgSuite.scala:1130, tests/unit/src/test/scala/tests/CancelCompileLspSuite.scala:10, tests/unit/src/test/scala/tests/DiagnosticsLspSuite.scala:96, …

What to do

  • Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
  • Clear the softer debt: re-enable or delete `ignore`d and `pending` tests, decide whether each empty method or UnsupportedOperationException is deliberate (and say so in a comment), and replace a bare `// scalastyle:off` or `@nowarn` with targeted, justified suppressions.
M1 · Documentation (README)7.3 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repository and its projects have a README, and whether it is substantive.

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

What to do

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
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 your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.

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

M4 · Documentation accuracy10.0 / 10Exemplary○ Nothing flagged

Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.

Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.

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.

P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language's code model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.

P2 · Observability7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

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.
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.

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.
P8 · Schema migrations10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — Whether database schema changes go through versioned migrations rather than being auto-created from the model at startup.

Method: Roslyn scan: EF Core DbContext for a versioned migrations directory versus bare EnsureCreated usage; off .NET, a file scan of dependency manifests, migration histories (Flyway, Liquibase, Alembic, Django, Rails, Prisma, TypeORM, Knex/Sequelize, golang-migrate, goose, Laravel, Doctrine, Diesel/sqlx) and schema auto-create in production source or config. Exhaustive, deterministic.

PF1 · Benchmark discipline8.5 / 10Strong✓ Tool-verified

Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.

Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.

  • A JMH/Jetpack Benchmark suite exists but nothing turns on its allocation measurement — allocations (the main way hot code pressures a garbage collector or allocator) aren't being measured. — metals-bench/src/main/scala/scala/meta/bench/ClasspathFuzzBench.scala

What to do

  • Run JMH with the GC profiler (`-prof gc`, or addProfiler(GCProfiler.class)) so allocation rate regressions are visible, not just time.
PF3 · Async & latency hygiene6.0 / 10Adequate✓ Tool-verified

Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

  • `connect` is async and calls Thread.sleep — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs. (×2) — metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala:90, metals/src/main/scala/scala/meta/internal/metals/BloopServers.scala:438
  • `withTimeout` is async and calls Await.result — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs. — metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:293
  • `disconnectOldBuildServer` is async and calls Thread.sleep — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs. — metals/src/main/scala/scala/meta/internal/metals/scalacli/ScalaCli.scala:149

What to do

  • Scala: compose the Future or effect (map/flatMap, a for-comprehension) instead of Await.result or unsafeRunSync, and wrap unavoidable blocking calls in blocking { } (Future), IO.blocking or ZIO.attemptBlocking.
S1 · Web-Security Posture4.0 / 10Weak✓ Tool-verified

Other · Security — Read from this repository's Scala source and the Java beside it: cryptographic hygiene (weak hash or cipher, key material fixed in the source) and outbound TLS (certificate validation, protocol version) — facts about code that hold whether or not it serves anything itself. This repository serves HTTP itself (metals/src/main/scala/scala/meta/internal/metals/MetalsHttpServer.scala:139 — `Undertow.builder`), so its Scala source was also read for the server controls: TLS served or HSTS set, security response headers, cookie flags and inbound validation — each credited where its Scala spelling appears in production source, not proven on every route. A Play application is credited the security headers Play's default `SecurityHeadersFilter` sends unless its build or configuration switches that filter off, and its cookies the HttpOnly flag Play sets by default.

Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.

  • MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call. (×6) — metals/src/main/scala/scala/meta/internal/bsp/BspServers.scala:208, metals/src/main/scala/scala/meta/internal/builds/BSPErrorHandler.scala:36, metals/src/main/scala/scala/meta/internal/builds/BspOnly.scala:18, …
  • This repository runs an HTTP server and nothing in its Scala source or committed configuration secures the transport: no HTTPS served (akka/pekko-http `ConnectionContext.httpsServer`/`enableHttps`, an http4s builder's `withTLS`, Jetty's `SslContextFactory`, zio-http's `SSLConfig`, Play's `https.port`), no `Strict-Transport-Security` header, HSTS middleware or Play `RedirectHttpsFilter`, no `X-Forwarded-Proto` read or Play `play.http.forwarded.trustedProxies` for a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: metals/src/main/scala/scala/meta/internal/metals/MetalsHttpServer.scala:139 — `Undertow.builder`.
  • None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, …) is set on a response this repository's Scala server sends — defense in depth, even when a proxy could set them. (−2.0 on this card.) The server: metals/src/main/scala/scala/meta/internal/metals/MetalsHttpServer.scala:139 — `Undertow.builder`.

What to do

  • Review each MD5/SHA1 use by what it protects: replace it with SHA-256+ (or a KDF for passwords) where the digest is security-relevant, and switch it to a non-cryptographic hash (xxhash, murmurhash) where it only derives an identifier such as a cache key. This repository constructs a collision-broken hash (MD5/SHA1) at 6 sites, not one: `metals/src/main/scala/scala/meta/internal/bsp/BspServers.scala:208` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/BSPErrorHandler.scala:36` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/BspOnly.scala:18` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/builds/Digest.scala:219` (MessageDigest.getInstance("MD5")), `metals/src/main/scala/scala/meta/internal/worksheets/WorksheetProvider.scala:627` (MessageDigest.getInstance("MD5")), `mtags-shared/src/main/scala/scala/meta/internal/mtags/MD5.scala:12` (MessageDigest.getInstance("MD5")). Each is a separate decision — fixing only the line this row cites leaves the others in place.
  • Secure the server's transport: serve TLS itself (akka/pekko-http `ConnectionContext.httpsServer(sslContext)` with `newServerAt(…).enableHttps(…)`, an http4s server builder's `withTLS(…)`, Play's `https.port`), or run it behind a TLS-terminating proxy and trust it (`X-Forwarded-Proto`; Play `play.http.forwarded.trustedProxies`); send `Strict-Transport-Security` once it is HTTPS-only (http4s `HSTS(…)`, Play `RedirectHttpsFilter`).
  • Set security response headers on what the server sends — keep Play's `SecurityHeadersFilter` enabled, wrap akka/pekko-http routes in `respondWithHeaders(RawHeader("X-Content-Type-Options", "nosniff"), …)`, or add an http4s middleware that sets `Content-Security-Policy`, `X-Content-Type-Options` and a frame policy on every response.
X1 · Async correctness7.6 / 10Strong✓ Tool-verified

Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.

Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.

  • The `Future` this starts is not kept anywhere, and `scala.concurrent.Future` never reports a failure on its own: `Future { … }` catches any non-fatal exception its body throws and stores it as the future's `Failure` — not rethrown, not printed, not passed to the `ExecutionContext`'s `reportFailure` — so once nobody holds the future the error is gone, and nothing can wait for the work to finish either. Keep the future and compose it into what the caller returns (`for`/`flatMap`, `Future.sequence`), or, for genuine fire-and-forget, attach a handler that reports the failure — `Future { … }.failed.foreach(error => log.error("…", error))` or `.onComplete { case Failure(e) => report(e); case _ => }` — or catch and report inside the body itself. — metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala:964

What to do

  • Future started here is not kept
X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.

Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.

X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.

Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.

X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.

Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.

X18 · Disposal-pattern correctness5.5 / 10Adequate✓ Tool-verified

Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.

Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.

  • `Files.newDirectoryStream(…)` opens something that has to be given back — a file descriptor, a socket, a directory handle — and its only use reads `.iterator` through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: `Too many open files` under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with `scala.util.Using.resource(Files.newDirectoryStream(…)) { r => … }`, which releases it on every path including a throw, or hold it and call `.close()` in a `finally`. — mtags-shared/src/main/scala/scala/meta/internal/metals/PackageIndex.scala:183
  • `Files.list(…)` opens something that has to be given back — a file descriptor, a socket, a directory handle — and its only use reads `.iterator` through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: `Too many open files` under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with `scala.util.Using.resource(Files.list(…)) { r => … }`, which releases it on every path including a throw, or hold it and call `.close()` in a `finally`. — mtags-shared/src/main/scala/scala/meta/internal/metals/PackageIndex.scala:184

What to do

  • Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.

Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.

X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.

Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.

X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.

Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.

Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether an enhanced `for` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is iterating invalidates the fail-fast iterator it is holding, so the next `next()` throws `ConcurrentModificationException` and the remaining elements are never seen. Whether a `for` comprehension or `foreach` leaves the mutable collection it is walking alone — an `ArrayBuffer` or `ListBuffer` counts its changes and its iterator checks the count, an `ArrayDeque` (and `mutable.Queue`/`mutable.Stack`) is walked by index up to its starting length, and a `java.util` collection walked through `asScala` is fail-fast, so a body that adds to or removes from the very collection the loop is walking makes a later step throw `ConcurrentModificationException` (`IndexOutOfBoundsException` for a deque) and the remaining elements are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.

Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.

X3 · Exception handling5.4 / 10Adequate✓ Tool-verified

Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.

Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.

  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×7) — mtags-shared/src/main/scala/scala/meta/internal/pc/CompilerAccess.scala:233, mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala:590, mtags/src/main/scala/scala/meta/internal/metals/SemanticdbDefinition.scala:101, …
  • `case _: Throwable` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — mtags-shared/src/main/scala/scala/meta/internal/mtags/CoursierComplete.scala:29
  • `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×19) — mtags-shared/src/main/scala/scala/meta/internal/mtags/OpenClassLoader.scala:55, mtags-shared/src/main/scala/scala/meta/internal/metals/PackageIndex.scala:272, mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:620, …

What to do

  • Swallowed exception (empty catch)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.

Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.

X5 · Nullable reference types2.0 / 10Critical✓ Tool-verified

Other · Code Health — Whether Scala's null is held to the type system and not undermined by assertions — a file compiled with `-Yexplicit-nulls` is one where `String` excludes null and `String | Null` admits it, a file under WartRemover's `Null` wart or Scalafix's `DisableSyntax.noNulls` is one whose code cannot write `null` and must say `Option`, and each `.nn`, `import scala.language.unsafeNulls` or null-lint suppression is the author overruling that.

Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.

  • No build over this repository's 642 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.

What to do

  • On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.

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.

LensScoreRatingImpact
Code Health56%Adequate — gated by X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture91%Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity64%Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness72%StrongStrongest area.
Security43%Weak — gated by D29, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance71%StrongSolid.
Unscored — 3 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • X10 Duplicated predicate — 9 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X6 Hand-rolled structured-format parsing — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 4 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 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.

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 56 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.
  • AX1 Captive dependencies — Not applicable: this repository's Java imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Scala imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No class in this Java code is a Spring, JSR-330 or CDI singleton bean. No class in this Scala code is a Play controller, a Cask routes object, a Scalatra servlet, a Finatra controller, an Akka/Pekko HTTP routes holder or a JSR-330/Spring singleton, so no instance is shared between request threads. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • 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
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • 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 (`npm run start`) exited before it served a page. Likely cause (our sandbox): `npm run` found no package.json in the folder where our sandbox ran it. This is a limit of our sandbox, not of your repository. Last output: "npm error code ENOENT / npm error syscall open / npm error path <repo>/package.json / npm error errno -2 / npm error enoent Could not read package.json: Error: ENOENT: no such file or directory, open '<repo>/package.json' / npm error enoent This is related to npm not being able to find a file. / npm error enoent / npm error A complete log of this run can be found in: <path>" No runtime evidence was gathered. 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.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named column (email, first_name, date_of_birth, phone_number, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, a MongoDB or Cassandra driver, JDBC) imported either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D10 Test Quality — ~116608 lines of test source are present (.scala, .java) 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 — the .scala suite was found but not re-run
  • 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 — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. 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 — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only; comments in this repository's .java, .scala source were not judged.
  • D25 ADR Conformance — no ADRs to check
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.scala), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • 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) — 6 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.
  • 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
  • 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
  • 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): 598 value object(s); 10 domain event(s); its domain events are published by services or handlers — no domain entity raises one
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • 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'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JVM, JavaScript/TypeScript source, so there is no service whose uptime a failing dependency could take down
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no C# was loaded; this repository's Scala and Java were read, and no request in it can be cancelled by a caller — a Scala request takes no token: a Future cannot be cancelled, and cats-effect, ZIO and Monix interrupt the fiber that made the request from outside the call, not through a parameter; a Java request off Android takes no token: it is cancelled through the handle it returns (Future.cancel, Call.cancel, a Disposable), ambiently (io.grpc.Context) or by interrupting its thread, not through a parameter
  • X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Java was read, and it logs through none that an assembled message defeats: java.util.logging's level methods, log4j 1, commons-logging, JBoss Logging and Flogger take one finished message (as log4net does in C#), or it makes no call through a named logger at all. Calls made through SLF4J or log4j 2 (`org.slf4j.Logger`, `org.apache.logging.log4j.Logger`, Lombok's `@Slf4j`) would be judged.
  • 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 — 42 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 · ×5
  • Orphaned knowledge mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala:1 — 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/FlatMapToForComprehensionCodeAction.scala:1 — 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:1 — 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/testProvider/TestSuitesProvider.scala:1 — 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:1 — 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
D14 · License Compliance · Banned license · ×1
  • Banned license: org.openjdk.jol:jol-core — `org.openjdk.jol:jol-core` 0.17 is published on Maven Central under `GPL-2.0`, which this policy bans, and this repository declares it in its sbt build. The licence was read from the artifact's POM `<licenses>` block — following `<parent>` where the POM inherits them — and normalised to SPDX before it was judged, because Maven publishes the name as free text (`GNU Affero General Public License v3` is AGPL-3.0). Where a POM lists several licences they are read as a CHOICE, per Maven's own documentation, so this is charged only because EVERY listed licence is banned. Replace the dependency, or record an accepted exception.
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
D30 · Dependency Vulnerabilities · Critical CVE · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · High CVE · ×1
  • REDACTED
D35 · Change Coupling · Boundary-crossing change coupling · ×1
  • Boundary-crossing change coupling: MtagsResolver.scala ↔ REDACTED metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala:1 — `metals/src/main/scala/scala/meta/internal/metals/MtagsResolver.scala` (context metals) and `REDACTED` (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 — 492 finding(s)
D17 · Explicit Debt · TodoComment · ×32
  • TodoComment tests/unit/src/test/scala/tests/rangeFormatting/ScalaCliDependencyRangeFormatter.scala:126 — // TODO: @@ — 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/unit/src/test/scala/tests/rangeFormatting/ScalaCliDependencyRangeFormatter.scala:134 — // TODO: "org.scalameta" %% "munit" % "0.7.26" — 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/unit/src/test/scala/tests/inlayHints/InlayHintsHoverSuite.scala:128 — // TODO: We should show info about renames (`val ttt: S[Int]` instead of `val ttt: Set[Int]`) — 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/unit/src/main/scala/tests/TestingClient.scala:365 — // TODO(olafur): Start actual file watcher. — 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/unit/src/main/scala/tests/debug/BaseStepDapSuite.scala:95 — // TODO: delete condition after https://github.com/com-lihaoyi/mill/issues/3148
  • TodoComment tests/javapc/src/test/scala/hover/HoverDefnSuite.scala:148 — // todo investigate — 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/CompletionArgSuite.scala:394 — // TODO: this isn't right, we should see `snd = : Int` here as well — 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.
  • 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/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 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/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 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.
  • + 7 more in this group — see findings.md.
D3 · God Classes · FileTooLong · ×31
  • FileTooLong: metals/MetalsLspService.scala metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala — FileTooLong — 1423 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 923 over it, 2.85× 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/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/WorkspaceLspService.scala metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala — FileTooLong — 1324 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: WorkspaceLspService (107-1631). The bar is 500 significant lines; this is 824 over it, 2.65× 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 — 1213 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 713 over it, 2.43× 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 — 1048 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 548 over it, 2.10× 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 — 928 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 428 over it, 1.86× 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 — 855 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 355 over it, 1.71× 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 — 800 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 300 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: debug/DebugProvider.scala metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala — FileTooLong — 777 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: DebugProvider (77-850). The bar is 500 significant lines; this is 277 over it, 1.55× 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 — 711 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: ProjectMetalsLspService (49-950). The bar is 500 significant lines; this is 211 over it, 1.42× 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 — 675 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: ConnectionProvider (44-797). The bar is 500 significant lines; this is 175 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 — 615 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 115 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 — 593 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: Doctor (57-716). The bar is 500 significant lines; this is 93 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 — 572 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 72 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.
  • + 6 more in this group — see findings.md.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×20
  • Swallowed exception (caught, then discarded) mtags-shared/src/main/scala/scala/meta/internal/mtags/CoursierComplete.scala:29 — `case _: Throwable` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) mtags-shared/src/main/scala/scala/meta/internal/mtags/OpenClassLoader.scala:55 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) mtags-shared/src/main/scala/scala/meta/internal/metals/PackageIndex.scala:272 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:620 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:1232 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:1345 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) mtags/src/main/scala-2/scala/meta/internal/pc/WorkspaceSymbolSearch.scala:238 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) mtags/src/main/scala-2/scala/meta/internal/pc/completions/Completions.scala:110 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) mtags/src/main/scala-2/scala/meta/internal/pc/completions/FilenameCompletions.scala:70 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/search/SymbolHierarchyOps.scala:201 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/metals/BuildTargets.scala:567 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/metals/Embedded.scala:617 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/metals/ReportContext.scala:131 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/metals/StacktraceAnalyzer.scala:84 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/metals/notebook/AlmondKernelInstaller.scala:220 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/builds/Digest.scala:125 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/builds/Digest.scala:156 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/builds/Digest.scala:175 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/builds/Digest.scala:196 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) metals/src/main/scala/scala/meta/internal/builds/MillDigest.scala:97 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
D3 · God Classes · TooManyMethods · ×15
  • TooManyMethods: MetalsLspService metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala:102 — TooManyMethods — 97 methods. The bar is 30 methods; this is 67 over it, 3.23× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (REDACTED) 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 (REDACTED) 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 (REDACTED) 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 (REDACTED) 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 (REDACTED) 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 (REDACTED) 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 (REDACTED) 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 (REDACTED) 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 (REDACTED) 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 (REDACTED) 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:396 — 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 (REDACTED) 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 (REDACTED) 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 (REDACTED) 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 (REDACTED) 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:107 — 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 (REDACTED) 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 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.
  • 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/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/resources/workspace-symbol/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/semanticdb/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/inlayHints/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/definition/example/MacroAnnotation.scala:6 — // FIXME: https://github.com/scalameta/scalameta/issues/1789
  • 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/semanticTokens/example/MacroAnnotation.scala:6 — // FIXME: https://github.com/scalameta/scalameta/issues/1789>>/*comment*/
  • 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 metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:1226 — // FIXME: https://github.com/scalacenter/bloop/issues/700
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: BspConnector.connect metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala:90 — MethodTooLong — connect runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88× 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: 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:107 — ClassTooLong — 1201 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 801 over it, 3.00× 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:49 — ClassTooLong — 668 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 268 over it, 1.67× 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 · ×7
  • 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: 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.
X3 · Exception handling · Swallowed exception (empty catch) · ×7
  • Swallowed exception (empty catch) mtags-shared/src/main/scala/scala/meta/internal/pc/CompilerAccess.scala:233 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala:590 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) mtags/src/main/scala/scala/meta/internal/metals/SemanticdbDefinition.scala:101 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) metals/src/main/scala/scala/meta/internal/metals/IdentifierIndex.scala:56 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) metals/src/main/scala/scala/meta/internal/metals/IdentifierIndex.scala:69 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala:152 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) metals/src/main/scala/scala/meta/internal/metals/scalacli/ScalaCli.scala:77 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
S1 · Web-Security Posture · Weak hash algorithm · ×6
  • Weak hash algorithm metals/src/main/scala/scala/meta/internal/bsp/BspServers.scala:208 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm metals/src/main/scala/scala/meta/internal/builds/BSPErrorHandler.scala:36 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm metals/src/main/scala/scala/meta/internal/builds/BspOnly.scala:18 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm metals/src/main/scala/scala/meta/internal/builds/Digest.scala:219 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm metals/src/main/scala/scala/meta/internal/worksheets/WorksheetProvider.scala:627 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
  • Weak hash algorithm mtags-shared/src/main/scala/scala/meta/internal/mtags/MD5.scala:12 — MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything — a signature, an integrity or tamper check, a credential, or any value an attacker can influence — that is a real weakness: use SHA-256+ (`MessageDigest.getInstance("SHA-256")`) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead — a non-cryptographic hash such as xxhash or murmurhash says it in code — since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call.
D4 · Code Duplication · Edited copy of a member (8 corresponding lines) · ×5
  • Edited copy of a member (8 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala:43 — mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala:43-50 | mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala:57-66 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) mtags-java/src/main/scala/scala/meta/internal/pc/SourceJavaFileObject.scala:13 — mtags-java/src/main/scala/scala/meta/internal/pc/SourceJavaFileObject.scala:13-22 | mtags/src/main/scala/scala/meta/internal/mtags/JavacMtags.scala:96-103 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/completions/MillIvyCompletions.scala:33 — mtags/src/main/scala-2/scala/meta/internal/pc/completions/MillIvyCompletions.scala:33-47 | mtags/src/main/scala-2/scala/meta/internal/pc/completions/ScalaCliCompletions.scala:44-51 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) metals/src/main/scala/scala/meta/internal/builds/Digests.scala:16 — metals/src/main/scala/scala/meta/internal/builds/Digests.scala:16-23 | metals/src/main/scala/scala/meta/internal/metals/ChosenBuildServers.scala:34-43 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (8 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/DependencySources.scala:14 — metals/src/main/scala/scala/meta/internal/metals/DependencySources.scala:14-21 | metals/src/main/scala/scala/meta/internal/metals/WorksheetDependencySources.scala:13-20 — These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
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:736 — metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:736-743 | 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:736` 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 · Edited copy of a member (24 corresponding lines) · ×4
  • Edited copy of a member (24 corresponding lines) REDACTED:46 — REDACTED:46-69 | REDACTED:189-220 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (24 corresponding lines) metals/src/main/scala/scala/meta/internal/bsp/BspConfigGenerator.scala:70 — metals/src/main/scala/scala/meta/internal/bsp/BspConfigGenerator.scala:70-93 | metals/src/main/scala/scala/meta/internal/builds/BuildToolSelector.scala:57-84 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (24 corresponding lines) mtags/src/main/scala/scala/meta/internal/mtags/Mtags.scala:27 — mtags/src/main/scala/scala/meta/internal/mtags/Mtags.scala:27-50 | mtags/src/main/scala/scala/meta/internal/mtags/Mtags.scala:60-84 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (24 corresponding lines) mtags-shared/src/main/scala/scala/meta/internal/mtags/CommonMtagsEnrichments.scala:220 — mtags-shared/src/main/scala/scala/meta/internal/mtags/CommonMtagsEnrichments.scala:220-243 | mtags/src/main/scala/scala/meta/internal/mtags/ScalametaCommonEnrichments.scala:536-559 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
PF3 · Async & latency hygiene · Sync-over-async blocking · ×4
  • Sync-over-async blocking metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala:90 — `connect` is async and calls Thread.sleep — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs.
  • Sync-over-async blocking metals/src/main/scala/scala/meta/internal/metals/BloopServers.scala:438 — `connect` is async and calls Thread.sleep — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs.
  • Sync-over-async blocking metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:293 — `withTimeout` is async and calls Await.result — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs.
  • Sync-over-async blocking metals/src/main/scala/scala/meta/internal/metals/scalacli/ScalaCli.scala:149 — `disconnectOldBuildServer` is async and calls Thread.sleep — a blocking call inside async code stalls the execution-context thread, and every future or fiber scheduled on it for as long as it runs.
D17 · Explicit Debt · XxxComment · ×3
  • XxxComment mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala:583 — // 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:588 — // 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:596 — // 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.
D36 · Supply-chain Provenance & Signing · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (13 corresponding lines) · ×3
  • Edited copy of a member (13 corresponding lines) metals/src/main/scala/scala/meta/internal/builds/Digests.scala:26 — metals/src/main/scala/scala/meta/internal/builds/Digests.scala:26-38 | metals/src/main/scala/scala/meta/internal/builds/Digests.scala:41-53 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (13 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1533 — metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1533-1545 | metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1551-1563 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (13 corresponding lines) mtags/src/main/scala/scala/meta/internal/mtags/DefinitionAlternatives.scala:67 — mtags/src/main/scala/scala/meta/internal/mtags/DefinitionAlternatives.scala:67-81 | mtags/src/main/scala/scala/meta/internal/mtags/DefinitionAlternatives.scala:90-102 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×3
  • Edited copy of a member (10 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1647 — metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1647-1656 | metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1661-1670 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) metals/src/main/scala/scala/meta/internal/builds/BloopInstall.scala:113 — metals/src/main/scala/scala/meta/internal/builds/BloopInstall.scala:113-122 | metals/src/main/scala/scala/meta/internal/builds/WorkspaceReload.scala:26-35 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) mtags-java/src/main/scala/scala/meta/internal/pc/JavaHover.scala:23 — mtags-java/src/main/scala/scala/meta/internal/pc/JavaHover.scala:23-32 | mtags-shared/src/main/scala/scala/meta/internal/pc/ScalaHover.scala:42-53 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (7 corresponding lines) · ×3
  • Edited copy of a member (7 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala:553 — mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala:553-564 | mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala:499-505 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/FileDecoderProvider.scala:894 — metals/src/main/scala/scala/meta/internal/metals/FileDecoderProvider.scala:894-900 | metals/src/main/scala/scala/meta/internal/metals/codeactions/ExplainDiagnostic.scala:118-124 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (7 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/DependencySources.scala:24 — metals/src/main/scala/scala/meta/internal/metals/DependencySources.scala:24-30 | metals/src/main/scala/scala/meta/internal/metals/WorksheetDependencySources.scala:23-29 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
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 (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:129-139 — 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.
D15 · Churn × Complexity Hotspots · Repeated repair · ×2
  • Repeated repair: metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala:1819 — metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.scala changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is MetalsLspService.definitionOrReferences at line 1819), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “bugfix: Fix issues with exception being thrown from semantic refresh (#8981)”; “fix: end stale "Compiling" progress and make it cancellable (#8874)”; “bugfix: Properly save last know configuration (#8868)”; “fix: suggest imports for symbols inherited into package objects (#8504)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 17:07:22 +01:00' --until='2026-11-13 17:07:22 +01:00' --full-history --no-merges -- metals/src/main/scala/scala/meta/internal/metals/MetalsLspService.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.
  • Repeated repair: metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala:737 — metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.scala changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is ProjectMetalsLspService.onUserConfigUpdate at line 737), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “bugfix: Stop Metals when stdin is closed (#8974)”; “fix(mcp): inspect returns no members (#8942)”; “bugfix: Properly save last know configuration (#8868)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-15 17:07:22 +01:00' --until='2026-11-13 17:07:22 +01:00' --full-history --no-merges -- metals/src/main/scala/scala/meta/internal/metals/ProjectMetalsLspService.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.
D17 · Explicit Debt · HackComment · ×2
  • 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.
  • 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.
D35 · Change Coupling · Change coupling · ×2
  • Change coupling: DelegatingLanguageClient.scala ↔ NoopLanguageClient.scala metals/src/main/scala/scala/meta/internal/metals/clients/language/DelegatingLanguageClient.scala:1 — `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 73% of the time (11 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 11 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:1 — `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 · Edited copy of a member (26 corresponding lines) · ×2
  • Edited copy of a member (26 corresponding lines) mtags-shared/src/main/scala/scala/meta/internal/metals/ClassfileComparator.scala:16 — mtags-shared/src/main/scala/scala/meta/internal/metals/ClassfileComparator.scala:16-48 | mtags/src/main/scala-2/scala/meta/internal/pc/SymbolSearchCandidate.scala:41-66 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (26 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/formatting/OnTypeFormattingProvider.scala:47 — metals/src/main/scala/scala/meta/internal/metals/formatting/OnTypeFormattingProvider.scala:47-73 | metals/src/main/scala/scala/meta/internal/metals/formatting/RangeFormattingProvider.scala:45-70 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (18 corresponding lines) · ×2
  • Edited copy of a member (18 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractValueCodeAction.scala:334 — metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractValueCodeAction.scala:334-352 | metals/src/main/scala/scala/meta/internal/metals/codeactions/MetalsNames.scala:20-37 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (18 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/codeactions/CreateNewSymbol.scala:32 — metals/src/main/scala/scala/meta/internal/metals/codeactions/CreateNewSymbol.scala:32-51 | metals/src/main/scala/scala/meta/internal/metals/codeactions/InsertInferredType.scala:40-57 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (15 corresponding lines) · ×2
  • Edited copy of a member (15 corresponding lines) mtags/src/main/scala/scala/meta/internal/pc/KeywordCompletionsUtils.scala:7 — mtags/src/main/scala/scala/meta/internal/pc/KeywordCompletionsUtils.scala:7-25 | mtags/src/main/scala/scala/meta/internal/pc/KeywordCompletionsUtils.scala:27-41 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (15 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:1164 — mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:1164-1178 | mtags/src/main/scala-2/scala/meta/internal/pc/MetalsGlobal.scala:1217-1234 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (31 corresponding lines) · ×2
  • Edited copy of a member (31 corresponding lines) mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala:17 — mtags/src/main/scala-2.12/scala/meta/internal/pc/JrtClasspathCompat.scala:17-48 | mtags/src/main/scala-2.13/scala/meta/internal/pc/JrtClasspathCompat.scala:17-47 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (31 corresponding lines) metals-bench/src/main/scala/scala/meta/bench/InlayHintsBench.scala:35 — metals-bench/src/main/scala/scala/meta/bench/InlayHintsBench.scala:35-66 | metals-bench/src/main/scala/scala/meta/bench/SemanticTokensBench.scala:37-67 — These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (19 corresponding lines) · ×2
  • Edited copy of a member (19 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/JavaInteractiveSemanticdb.scala:266 — metals/src/main/scala/scala/meta/internal/metals/JavaInteractiveSemanticdb.scala:266-284 | sbt-metals/src/main/scala/scala/meta/metals/MetalsPlugin.scala:191-209 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (19 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala:234 — metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala:234-253 | metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala:258-276 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (14 corresponding lines) · ×2
  • Edited copy of a member (14 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/ScalaPresentationCompiler.scala:309 — mtags/src/main/scala-2/scala/meta/internal/pc/ScalaPresentationCompiler.scala:309-326 | mtags/src/main/scala-2/scala/meta/internal/pc/ScalaPresentationCompiler.scala:330-343 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (14 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:821 — metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:821-837 | metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:902-915 — These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (12 corresponding lines) · ×2
  • Edited copy of a member (12 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala:80 — metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala:80-91 | metals/src/main/scala/scala/meta/internal/metals/doctor/DoctorResults.scala:94-105 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (12 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/ScalaPresentationCompiler.scala:214 — mtags/src/main/scala-2/scala/meta/internal/pc/ScalaPresentationCompiler.scala:214-226 | mtags/src/main/scala-2/scala/meta/internal/pc/ScalaPresentationCompiler.scala:294-305 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (6 corresponding lines) · ×2
  • Edited copy of a member (6 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/Keywords.scala:144 — mtags/src/main/scala-2/scala/meta/internal/pc/Keywords.scala:144-149 | mtags/src/main/scala-2/scala/meta/internal/pc/Keywords.scala:189-194 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (6 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/completions/MultilineCommentCompletion.scala:36 — mtags/src/main/scala-2/scala/meta/internal/pc/completions/MultilineCommentCompletion.scala:36-41 | mtags/src/main/scala-2/scala/meta/internal/pc/completions/ScaladocCompletions.scala:161-167 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×2
  • Edited copy of a member (9 corresponding lines) mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala:575 — mtags/src/main/scala-2/scala/meta/internal/pc/InferredMethodProvider.scala:575-583 | mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala:516-524 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (9 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/PresentationCompilerClassLoader.scala:13 — metals/src/main/scala/scala/meta/internal/metals/PresentationCompilerClassLoader.scala:13-24 | metals/src/main/scala/scala/meta/internal/worksheets/WorksheetClassLoader.scala:13-21 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
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.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×2
  • 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.
  • 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.
X18 · Disposal-pattern correctness · Disposable created and abandoned in the function that made it · ×2
  • Disposable created and abandoned in the function that made it mtags-shared/src/main/scala/scala/meta/internal/metals/PackageIndex.scala:183 — `Files.newDirectoryStream(…)` opens something that has to be given back — a file descriptor, a socket, a directory handle — and its only use reads `.iterator` through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: `Too many open files` under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with `scala.util.Using.resource(Files.newDirectoryStream(…)) { r => … }`, which releases it on every path including a throw, or hold it and call `.close()` in a `finally`.
  • Disposable created and abandoned in the function that made it mtags-shared/src/main/scala/scala/meta/internal/metals/PackageIndex.scala:184 — `Files.list(…)` opens something that has to be given back — a file descriptor, a socket, a directory handle — and its only use reads `.iterator` through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: `Too many open files` under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with `scala.util.Using.resource(Files.list(…)) { r => … }`, which releases it on every path including a throw, or hold it and call `.close()` in a `finally`.
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 70) · ×1
  • WorkspaceLspService.executeCommand (cyclomatic 70) metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:872 — WorkspaceLspService.executeCommand has cyclomatic complexity 70 (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 · BspConnector.connect (cyclomatic 33) · ×1
  • BspConnector.connect (cyclomatic 33) metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala:90 — BspConnector.connect has cyclomatic complexity 33 (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 · 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 · CaseKeywordCompletion.contribute (cyclomatic 26) · ×1
  • CaseKeywordCompletion.contribute (cyclomatic 26) mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala:82 — CaseKeywordCompletion.contribute has cyclomatic complexity 26 (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 · 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 · 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:634 — 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:628 — 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:312 — 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:239 — 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 · TestServer.listenToTests (cyclomatic 16) · ×1
  • TestServer.listenToTests (cyclomatic 16) metals/src/main/scala/scala/meta/internal/metals/debug/server/testing/TestServer.scala:48 — TestServer.listenToTests has cyclomatic complexity 16 (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 · 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:516 — 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.
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 · CaseKeywordCompletion.contribute (cognitive 61) · ×1
  • CaseKeywordCompletion.contribute (cognitive 61) mtags/src/main/scala-2/scala/meta/internal/pc/completions/MatchCaseCompletions.scala:82 — CaseKeywordCompletion.contribute has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (42 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 · 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 · BspConnector.connect (cognitive 58) · ×1
  • BspConnector.connect (cognitive 58) metals/src/main/scala/scala/meta/internal/bsp/BspConnector.scala:90 — BspConnector.connect has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 6 (19 pts), match/switch 7 (12 pts), boolean chains 4 (nesting depth added 27). 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.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 · 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 · McpTestRunner.runTests (cognitive 38) · ×1
  • McpTestRunner.runTests (cognitive 38) metals/src/main/scala/scala/meta/internal/metals/mcp/McpTestRunner.scala:31 — McpTestRunner.runTests has cognitive complexity 38 (threshold 15). Drivers by points: loops 8 (36 pts), match/switch 2 (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 · 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 · 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:239 — 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:704 — 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:312 — 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:553 — 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:628 — 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:204 — 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:512 — 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:634 — 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:248 — 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 · ForwardingMetalsBuildClient.buildTaskFinish (cognitive 26) · ×1
  • ForwardingMetalsBuildClient.buildTaskFinish (cognitive 26) metals/src/main/scala/scala/meta/internal/metals/ForwardingMetalsBuildClient.scala:234 — ForwardingMetalsBuildClient.buildTaskFinish has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (4 pts), error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 14). 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 · NotebookKernelInstaller.ensure (cognitive 26) · ×1
  • NotebookKernelInstaller.ensure (cognitive 26) metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookKernelInstaller.scala:112 — NotebookKernelInstaller.ensure has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (5 pts), match/switch 1 (2 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 · 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:872 — 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:92 — 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:421 — 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:803 — 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 · NotebookProvider.didChange (cognitive 21) · ×1
  • NotebookProvider.didChange (cognitive 21) metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookProvider.scala:102 — NotebookProvider.didChange has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (15 pts), match/switch 1 (5 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 · 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:1819 — 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:737 — 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:67 — 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:804 — 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:412 — 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:297 — 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:416 — 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:557 — 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 · TestServer.listenToTests (cognitive 18) · ×1
  • TestServer.listenToTests (cognitive 18) metals/src/main/scala/scala/meta/internal/metals/debug/server/testing/TestServer.scala:48 — TestServer.listenToTests has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 5, match/switch 3, error handling 1 (nesting depth added 6). 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 · 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:414 — 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:757 — 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 · Indexer.indexSourceFile (cognitive 17) · ×1
  • Indexer.indexSourceFile (cognitive 17) metals/src/main/scala/scala/meta/internal/metals/Indexer.scala:529 — 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 · NotebookKernelInstaller.ensureKernel (cognitive 17) · ×1
  • NotebookKernelInstaller.ensureKernel (cognitive 17) metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookKernelInstaller.scala:52 — NotebookKernelInstaller.ensureKernel has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (14 pts), match/switch 2, if/else 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:516 — 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.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Medium CVE · ×1
  • REDACTED
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 · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (4 members, 50+ identical tokens) metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:592 — metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:592-654 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:656-715 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:717-768 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:1222-1294 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Edited copy of a member (25 corresponding lines) · ×1
  • Edited copy of a member (25 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractValueCodeAction.scala:112 — metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractValueCodeAction.scala:112-140 | metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractValueCodeAction.scala:144-168 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (34 corresponding lines) · ×1
  • Edited copy of a member (34 corresponding lines) mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala:24 — mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala:24-66 | mtags-shared/src/main/scala/scala/meta/internal/pc/HoverMarkup.scala:90-123 — These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 27+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 27+ corresponding lines) mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:36 — mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala:36-62 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaReferencesProvider.scala:84-117 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaRenameProvider.scala:93-125 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 24+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 24+ corresponding lines) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:842 — metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:842-868 | metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:874-897 | metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1032-1058 | metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1063-1089 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (37 corresponding lines) · ×1
  • Edited copy of a member (37 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:884 — metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:884-922 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:1184-1220 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 22+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 22+ corresponding lines) metals/src/main/scala/scala/meta/internal/metals/codeactions/ConvertToNamedArguments.scala:37 — metals/src/main/scala/scala/meta/internal/metals/codeactions/ConvertToNamedArguments.scala:37-58 | metals/src/main/scala/scala/meta/internal/metals/codeactions/ConvertToNamedLambdaParameters.scala:40-62 | metals/src/main/scala/scala/meta/internal/metals/codeactions/ExtractMethodCodeAction.scala:36-59 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (21 corresponding lines) · ×1
  • Edited copy of a member (21 corresponding lines) metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala:64 — metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala:64-84 | metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala:86-106 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×1
  • Edited copy of a member (11 corresponding lines) mtags/src/main/scala/scala/meta/internal/metals/docstrings/printers/MarkdownGenerator.scala:36 — mtags/src/main/scala/scala/meta/internal/metals/docstrings/printers/MarkdownGenerator.scala:36-51 | mtags/src/main/scala/scala/meta/internal/metals/docstrings/printers/PlaintextGenerator.scala:8-18 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (6 members, 10+ corresponding lines) · ×1
  • Edited copies of one member (6 members, 10+ corresponding lines) mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:39 — mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:39-48 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:53-63 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:68-77 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:79-88 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:99-108 | mtags-java/src/main/scala/scala/meta/internal/pc/JavaTreeScanner.scala:122-134 — These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 12+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 12+ corresponding lines) metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1128 — metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1128-1139 | metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1144-1157 | metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:1162-1176 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (5 corresponding lines) · ×1
  • Edited copy of a member (5 corresponding lines) mtags-java/src/main/scala/scala/meta/internal/pc/JavaHoverProvider.scala:34 — mtags-java/src/main/scala/scala/meta/internal/pc/JavaHoverProvider.scala:34-38 | mtags/src/main/scala-2/scala/meta/internal/pc/HoverProvider.scala:24-31 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (3 corresponding lines) · ×1
  • Edited copy of a member (3 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookAdjustLspData.scala:60 — metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookAdjustLspData.scala:60-62 | metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookProvider.scala:458-460 — These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (4 corresponding lines) · ×1
  • Edited copy of a member (4 corresponding lines) metals/src/main/scala/scala/meta/internal/metals/JsonParser.scala:31 — metals/src/main/scala/scala/meta/internal/metals/JsonParser.scala:31-34 | metals/src/main/scala/scala/meta/internal/metals/debug/DapJsonParser.scala:52-55 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (40–48 lines × 4) · ×1
  • Duplicated block (40–48 lines × 4) metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:593 — metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:593-638 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:657-696 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:718-757 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:1223-1270 — all 4 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:593` 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 (42–46 lines × 2) · ×1
  • Duplicated block (42–46 lines × 2) metals/src/main/scala/scala/meta/internal/metals/UserConfiguration.scala:217 — metals/src/main/scala/scala/meta/internal/metals/UserConfiguration.scala:217-262 | metals/src/main/scala/scala/meta/internal/metals/UserConfiguration.scala:496-537 — 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/UserConfiguration.scala:217` 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. 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 (27–33 lines × 2) · ×1
  • Duplicated block (27–33 lines × 2) metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:491 — metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:491-517 | metals/src/main/scala/scala/meta/internal/metals/mcp/MetalsMcpTools.scala:533-565 — 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:491` 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:1250 — metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:1250-1258 | metals/src/main/scala/scala/meta/internal/metals/WorkspaceLspService.scala:1261-1269 — 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.
D4 · Code Duplication · Edited copy of a member (20 corresponding lines) · ×1
  • Edited copy of a member (20 corresponding lines) metals-docs/src/main/scala/docs/Docs.scala:11 — metals-docs/src/main/scala/docs/Docs.scala:11-33 | metals-docs/src/main/scala/docs/Docs.scala:35-54 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
GD1 · Unfinished & placeholder code · Unfinished stub · ×1
  • Unfinished stub — body is `???` mtags-shared/src/main/scala/scala/meta/internal/metals/ConcatSequence.scala:16 — `subSequence` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
IC1 · Incompleteness & stubs · Unfinished stub · ×1
  • Unfinished stub — body is ??? / NotImplementedError mtags-shared/src/main/scala/scala/meta/internal/metals/ConcatSequence.scala:16 — `subSequence` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
IC1 · Incompleteness & stubs · Hollow method · ×1
  • Hollow method — returns a constant without doing the work mtags/src/main/scala-2.11/scala/meta/internal/pc/JrtClasspathCompat.scala:7 — `clearJrtClassPathCaches` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in.
X1 · Async correctness · Future started here is not kept · ×1
  • Future started here is not kept metals/src/main/scala/scala/meta/internal/metals/debug/DebugProvider.scala:964 — The `Future` this starts is not kept anywhere, and `scala.concurrent.Future` never reports a failure on its own: `Future { … }` catches any non-fatal exception its body throws and stores it as the future's `Failure` — not rethrown, not printed, not passed to the `ExecutionContext`'s `reportFailure` — so once nobody holds the future the error is gone, and nothing can wait for the work to finish either. Keep the future and compose it into what the caller returns (`for`/`flatMap`, `Future.sequence`), or, for genuine fire-and-forget, attach a handler that reports the failure — `Future { … }.failed.foreach(error => log.error("…", error))` or `.onComplete { case Failure(e) => report(e); case _ => }` — or catch and report inside the body itself.
Minor — 190 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×148
  • Orphaned file metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/codeactions/RemoveInvalidImport.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file mtags/src/main/scala/scala/meta/internal/mtags/ScalaMtags.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/scalacli/ScalaCli.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/parsing/FoldingRangeExtractor.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/InitializationOptions.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file mtags/src/main/scala-2/scala/meta/internal/pc/HoverProvider.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/testProvider/frameworks/MunitTestFinder.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/MetalsHttpServer.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/metals/MetalsLanguageServer.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocUtils.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/clients/language/MetalsHttpClient.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/parsing/ClassFinder.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/ScalafmtConfig.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/ClientConfiguration.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file mtags/src/main/scala-2/scala/meta/internal/pc/completions/ArgCompletions.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/SQLTokenizer.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/BuildTargetInfo.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/ReportContext.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file mtags/src/main/scala-2/scala/meta/internal/pc/WorkspaceSymbolSearch.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/callHierarchy/OutgoingCallsFinder.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file metals/src/main/scala/scala/meta/internal/metals/mcp/McpInspectProvider.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file mtags/src/main/scala-2/scala/meta/internal/pc/completions/InterpolatorCompletions.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • + 123 more in this group — see findings.md.
X10 · Duplicated predicate · Duplicated predicate · ×9
  • Duplicated predicate metals/src/main/scala/scala/meta/internal/metals/ScaladocDefinitionProvider.scala:121 — `child.pos.start <= pos.start && pos.start <= child.pos.end` appears character-identically in 3 files — metals/src/main/scala/scala/meta/internal/metals/ScaladocDefinitionProvider.scala, metals/src/main/scala/scala/meta/internal/parsing/ClassFinder.scala, metals/src/main/scala/scala/meta/internal/parsing/Trees.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate mtags-shared/src/main/scala/scala/meta/internal/mtags/CommonMtagsEnrichments.scala:158 — `encloses(other.getStart) && encloses(other.getEnd)` appears character-identically in 2 files — mtags-shared/src/main/scala/scala/meta/internal/mtags/CommonMtagsEnrichments.scala, mtags/src/main/scala/scala/meta/internal/mtags/ScalametaCommonEnrichments.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookAdjustLspData.scala:60 — `idx + 1 < offsets.length && offsets(idx + 1) <= line` appears character-identically in 2 files — metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookAdjustLspData.scala, metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookProvider.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala:739 — `index >= safeLowerBound && value(index) != char` appears character-identically in 2 files — metals/src/main/scala/scala/meta/internal/metals/MetalsEnrichments.scala, mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate metals/src/main/scala/scala/meta/internal/metals/codelenses/RunTestCodeLens.scala:244 — `occurrence.role.isDefinition || occurrence.symbol == "scala/main#"` appears character-identically in 2 files — metals/src/main/scala/scala/meta/internal/metals/codelenses/RunTestCodeLens.scala, metals/src/main/scala/scala/meta/internal/metals/debug/DebugDiscovery.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala:37 — `params.offset() < 0 || params.offset() >= params.text().length || params.text().charAt(params.offset()).isWhitespace` appears character-identically in 5 files — mtags-java/src/main/scala/scala/meta/internal/pc/JavaDefinitionProvider.scala, mtags-java/src/main/scala/scala/meta/internal/pc/JavaDocumentHighlightProvider.scala, mtags-java/src/main/scala/scala/meta/internal/pc/JavaHoverProvider.scala, mtags-java/src/main/scala/scala/meta/internal/pc/JavaReferencesProvider.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate mtags/src/main/scala-2/scala/meta/internal/metals/PositionSyntax.scala:37 — `pos.start <= other.start && pos.end >= other.end` appears character-identically in 3 files — mtags/src/main/scala-2/scala/meta/internal/metals/PositionSyntax.scala, mtags/src/main/scala-2/scala/meta/internal/mtags/MtagsEnrichments.scala, mtags/src/main/scala/scala/meta/internal/mtags/ScalametaCommonEnrichments.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala:712 — `serverName == BloopServers.name || ScalaCli.names(serverName)` appears character-identically in 2 files — metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala, metals/src/main/scala/scala/meta/internal/metals/ServerLivenessMonitor.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate metals/src/main/scala/scala/meta/internal/metals/codeactions/MillifyDependencyCodeAction.scala:35 — `t.pos.startLine == range.getStart.getLine && t.pos.endLine == range.getEnd.getLine` appears character-identically in 2 files — metals/src/main/scala/scala/meta/internal/metals/codeactions/MillifyDependencyCodeAction.scala, metals/src/main/scala/scala/meta/internal/metals/codeactions/StringActions.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
IC1 · Incompleteness & stubs · Disabled test · ×7
  • Disabled test tests/cross/src/test/scala/tests/pc/CompletionArgSuite.scala:1130 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test tests/unit/src/test/scala/tests/CancelCompileLspSuite.scala:10 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test tests/unit/src/test/scala/tests/DiagnosticsLspSuite.scala:96 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test tests/unit/src/test/scala/tests/FormattingLspSuite.scala:222 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test tests/unit/src/test/scala/tests/RenameFilesLspSuite.scala:1053 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test tests/unit/src/test/scala/tests/SupportedScalaSuite.scala:11 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
  • Disabled test tests/unit/src/test/scala/tests/SupportedScalaSuite.scala:42 — A test is skipped/ignored — coverage that looks present but never runs. Re-enable it or delete it so the green run means something.
X7 · Silent fallback defaults · Silent fallback default in catch · ×4
  • Silent fallback default in catch metals/src/main/scala/scala/meta/internal/builds/MillDigest.scala:97 — `findImportedScripts` swallows every exception into `Nil` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing.
  • Silent fallback default in catch mtags-shared/src/main/scala/scala/meta/internal/mtags/CoursierComplete.scala:29 — `completions` swallows every exception into `Nil` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing.
  • Silent fallback default in catch mtags-shared/src/main/scala/scala/meta/internal/semver/SemVer.scala:104 — `tryToInt` swallows every exception into `0` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing.
  • Silent fallback default in catch mtags/src/main/scala-2/scala/meta/internal/pc/completions/FilenameCompletions.scala:70 — `contribute` swallows every exception into `Nil` — a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch case or in the Scaladoc, and the row stops firing.
AX6 · Interface segregation · Fat interface · ×2
  • Fat interface: IndexProviders (28 abstract members) metals/src/main/scala/scala/meta/internal/metals/IndexProviders.scala:19 — `IndexProviders` declares 28 abstract members: `languageClient`, `executionContext`, `tables`, `statusBar`, `workDoneProgress`, `timerProvider`, `indexingPromise`, `buildData`, `clientConfig`, `definitionIndex`, `referencesProvider`, `workspaceSymbols`, `buildTargets`, `semanticDBIndexer`, `fileWatcher`, `focusedDocument`, `focusedDocumentBuildTarget`, `buildTargetClasses`, `userConfig`, `sh`, `symbolDocs`, `scalaVersionSelector`, `sourceMapper`, `folder`, `implementationProvider`, `resetService`, `fileChanges`, `notebookProvider`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: TextDocumentService (33 abstract members) metals/src/main/scala/scala/meta/metals/lsp/TextDocumentService.scala:20 — `TextDocumentService` declares 33 abstract members: `didOpen`, `didChange`, `didClose`, `didSave`, `definition`, `typeDefinition`, `implementation`, `hover`, `documentHighlights`, `documentSymbol`, `formatting`, `onTypeFormatting`, `rangeFormatting`, `prepareRename`, `rename`, `references`, `prepareCallHierarchy`, `callHierarchyIncomingCalls`, `callHierarchyOutgoingCalls`, `prepareTypeHierarchy`, `typeHierarchySupertypes`, `typeHierarchySubtypes`, `completion`, `completionItemResolve`, `signatureHelp`, `codeAction`, `codeActionResolve`, `codeLens`, `foldingRange`, `selectionRange`, `semanticTokensFull`, `inlayHints`, `inlayHintResolve`. Counted over its ABSTRACT members — a `def` with no body or a `val`/`var` with no initializer, once per signature; concrete members, private and protected members, and members of a companion `object` are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
IC1 · Incompleteness & stubs · Blanket warning suppression · ×2
  • Blanket warning suppression metals/src/main/scala/scala/meta/internal/metals/Compilers.scala:612 — A bare `// scalastyle:off`, `// scalafix:off` or `@nowarn` (or Wartremover's `warts.All`) switches every rule or warning off — hidden debt. Suppress the specific rule on the specific line, with a justification, instead.
  • Blanket warning suppression metals/src/main/scala/scala/meta/internal/metals/codeactions/CodeAction.scala:60 — A bare `// scalastyle:off`, `// scalafix:off` or `@nowarn` (or Wartremover's `warts.All`) switches every rule or warning off — hidden debt. Suppress the specific rule on the specific line, with a justification, instead.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 16 significant file(s) lose their only recent owner: metals/src/main/scala/scala/meta/internal/parsing/TokenEditDistance.scala, metals/src/main/scala/scala/meta/internal/metals/mcp/ScalafixLlmRuleProvider.scala, metals/src/main/scala/scala/meta/internal/builds/NewProjectProvider.scala, metals-mcp/src/main/scala/scala/meta/metals/McpMain.scala, metals/src/main/scala/scala/meta/internal/metals/clients/language/ConfiguredLanguageClient.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 (+8 more). Pair on, review, or document these before any departure.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 7 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 (24 single-owned of 352 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 352 of the 689 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)) (+1 more) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala, mtags/src/main/scala-2/scala/meta/internal/pc/PackageObjectMemberSearch.scala, metals/src/main/scala/scala/meta/internal/metals/notebook/NotebookProvider.scala, metals/src/main/scala/scala/meta/internal/metals/codeactions/ConvertToNamedLambdaParameters.scala, project/SemanticDbSupport.scala, metals/src/main/scala/scala/meta/internal/metals/mcp/McpTomlConfig.scala, metals/src/main/scala/scala/meta/internal/metals/mcp/McpSymbolProvider.scala, metals/src/main/scala/scala/meta/internal/metals/scalacli/DependencyConverter.scala.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found REDACTED:389 — 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/`. ADRs are expected here because `REDACTED` makes this repository a deployable product (line 389).
D21 · Naming Consistency · `isScalaCLI` spells `CLI` where 43 names in the project spell it `Cli` · ×1
  • `isScalaCLI` spells `CLI` where 43 names in the project spell it `Cli` metals/src/main/scala/scala/meta/internal/metals/BuildServerConnection.scala:108 — 43 of 45 names in project repository spell the token `Cli` (43 of 45; unit: names in project repository containing `Cli`). Peers: scala.meta.internal.bsp.ScalaCliBspScope (metals/src/main/scala/scala/meta/internal/bsp/ScalaCliBspScope.scala:9); ScalaCliBspScope.scalaCliBspRoot (metals/src/main/scala/scala/meta/internal/bsp/ScalaCliBspScope.scala:17); BuildTools.scalaCliProject (metals/src/main/scala/scala/meta/internal/builds/BuildTools.scala:112); scala.meta.internal.builds.ScalaCliBuildTool (metals/src/main/scala/scala/meta/internal/builds/ScalaCliBuildTool.scala:15); scala.meta.internal.builds.ScalaCliBuildTool (metals/src/main/scala/scala/meta/internal/builds/ScalaCliBuildTool.scala:70). Rename to `isScalaCli`. [rule N6]
D21 · Naming Consistency · `headerID` spells `ID` where 58 names in the project spell it `Id` · ×1
  • `headerID` spells `ID` where 58 names in the project spell it `Id` metals/src/main/scala/scala/meta/internal/metals/UserConfigurationOption.scala:32 — 58 of 59 names in project repository spell the token `Id` (58 of 59; unit: names in project repository containing `Id`). Peers: BatchedFunction.fromFuture(functionId) (metals/src/main/scala/scala/meta/internal/metals/BatchedFunction.scala:173); BuildTargetInfo.buildTargetDetail(targetId) (metals/src/main/scala/scala/meta/internal/metals/BuildTargetInfo.scala:27); BuildTargetInfo.getSingleClassPathInfo(buildTargetId) (metals/src/main/scala/scala/meta/internal/metals/BuildTargetInfo.scala:173); BuildTargetInfo.getClassPath(buildTargetId) (metals/src/main/scala/scala/meta/internal/metals/BuildTargetInfo.scala:195); LazyCompiler.buildTargetId (metals/src/main/scala/scala/meta/internal/metals/CompilerConfiguration.scala:120). Rename to `headerId`. [rule N6]
D21 · Naming Consistency · `isScalaCLIGeneratedFile` spells `CLI` where 43 names in the project spell it `Cli` · ×1
  • `isScalaCLIGeneratedFile` spells `CLI` where 43 names in the project spell it `Cli` mtags-shared/src/main/scala/scala/meta/internal/mtags/CommonMtagsEnrichments.scala:266 — 43 of 45 names in project repository spell the token `Cli` (43 of 45; unit: names in project repository containing `Cli`). Peers: scala.meta.internal.bsp.ScalaCliBspScope (metals/src/main/scala/scala/meta/internal/bsp/ScalaCliBspScope.scala:9); ScalaCliBspScope.scalaCliBspRoot (metals/src/main/scala/scala/meta/internal/bsp/ScalaCliBspScope.scala:17); BuildTools.scalaCliProject (metals/src/main/scala/scala/meta/internal/builds/BuildTools.scala:112); scala.meta.internal.builds.ScalaCliBuildTool (metals/src/main/scala/scala/meta/internal/builds/ScalaCliBuildTool.scala:15); scala.meta.internal.builds.ScalaCliBuildTool (metals/src/main/scala/scala/meta/internal/builds/ScalaCliBuildTool.scala:70). Rename to `isScalaCliGeneratedFile`. [rule N6]
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (108398 LoC, 2000 module-visible types across 69 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D28 · Secrets (history) · Rotate the exposed credentials · ×1
  • REDACTED
D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1
  • Further orphaned files (smaller) — 148 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: metals/src/main/scala/scala/meta/internal/tvp/ScalacpCopyPaste.scala, mtags/src/main/scala-2/scala/meta/internal/pc/completions/OverrideCompletions.scala, metals/src/main/scala/scala/meta/internal/metals/codeactions/RemoveInvalidImport.scala, mtags/src/main/scala/scala/meta/internal/mtags/ScalaMtags.scala, metals/src/main/scala/scala/meta/internal/metals/scalacli/ScalaCli.scala, metals/src/main/scala/scala/meta/internal/parsing/FoldingRangeExtractor.scala, metals/src/main/scala/scala/meta/internal/metals/InitializationOptions.scala, mtags/src/main/scala-2/scala/meta/internal/pc/PcCollector.scala (and 140 more) (153 orphaned of 356 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 356 of the 689 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.)
PF1 · Benchmark discipline · Benchmarks don't track allocations · ×1
  • Benchmarks don't track allocations metals-bench/src/main/scala/scala/meta/bench/ClasspathFuzzBench.scala — A JMH/Jetpack Benchmark suite exists but nothing turns on its allocation measurement — allocations (the main way hot code pressures a garbage collector or allocator) aren't being measured.
S1 · Web-Security Posture · No app-layer HTTPS enforcement detected · ×1
  • No app-layer HTTPS enforcement detected — This repository runs an HTTP server and nothing in its Scala source or committed configuration secures the transport: no HTTPS served (akka/pekko-http `ConnectionContext.httpsServer`/`enableHttps`, an http4s builder's `withTLS`, Jetty's `SslContextFactory`, zio-http's `SSLConfig`, Play's `https.port`), no `Strict-Transport-Security` header, HSTS middleware or Play `RedirectHttpsFilter`, no `X-Forwarded-Proto` read or Play `play.http.forwarded.trustedProxies` for a TLS-terminating proxy — so its traffic may cross the network in clear text. (−2.0 on this card.) The server: metals/src/main/scala/scala/meta/internal/metals/MetalsHttpServer.scala:139 — `Undertow.builder`.
S1 · Web-Security Posture · No security response headers detected · ×1
  • No security response headers detected — None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, …) is set on a response this repository's Scala server sends — defense in depth, even when a proxy could set them. (−2.0 on this card.) The server: metals/src/main/scala/scala/meta/internal/metals/MetalsHttpServer.scala:139 — `Undertow.builder`.
X5 · Nullable reference types · Scala's null is not held to the type system everywhere · ×1
  • Scala's null is not held to the type system everywhere — No build over this repository's 642 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.
X6 · Hand-rolled structured-format parsing · Hand-rolled JSON/XML parsing via regex · ×1
  • Hand-rolled JSON/XML parsing via regex mtags/src/main/scala/scala/meta/internal/metals/docstrings/ScaladocParser.scala:240 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This JVM code already uses a real parser in the same package; use it here too.
Minor — 26 finding(s)
D12 · Dependency Hygiene · Outdated · ×26
  • Outdated: com.lihaoyi:mill-contrib-testng — `com.lihaoyi %% mill-contrib-testng` is declared at 1.3.1 in REDACTED, but 2780582bcfd73c8888a7bfa198351e413b684459-0-278058 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 1.3.1 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: io.modelcontextprotocol.sdk:mcp — `io.modelcontextprotocol.sdk %% mcp` is declared at 2.1.0 in REDACTED, but 2.2.0 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 2.1.0 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: io.undertow:undertow-core — `io.undertow %% undertow-core` is declared at 2.2.20.Final in REDACTED, but 2.4.4.Final is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 2.2.20.Final until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: io.undertow:undertow-servlet — `io.undertow %% undertow-servlet` is declared at 2.3.12.Final in REDACTED, but 2.3.27.Final is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 2.3.12.Final until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.jdt:org.eclipse.jdt.core — `org.eclipse.jdt %% org.eclipse.jdt.core` is declared at 3.25.0 in REDACTED, but 3.47.0 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.25.0 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.ant.core — `org.eclipse.platform %% org.eclipse.ant.core` is declared at 3.5.500 in REDACTED, but 3.7.1000 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.5.500 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.compare.core — `org.eclipse.platform %% org.eclipse.compare.core` is declared at 3.6.600 in REDACTED, but 3.8.900 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.6.600 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.core.commands — `org.eclipse.platform %% org.eclipse.core.commands` is declared at 3.9.500 in REDACTED, but 3.13.0 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.9.500 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.core.contenttype — `org.eclipse.platform %% org.eclipse.core.contenttype` is declared at 3.7.500 in REDACTED, but 3.9.900 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.7.500 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.core.expressions — `org.eclipse.platform %% org.eclipse.core.expressions` is declared at 3.6.500 in REDACTED, but 3.9.700 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.6.500 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.core.filesystem — `org.eclipse.platform %% org.eclipse.core.filesystem` is declared at 1.7.500 in REDACTED, but 1.11.500 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 1.7.500 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.core.jobs — `org.eclipse.platform %% org.eclipse.core.jobs` is declared at 3.10.500 in REDACTED, but 3.15.900 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.10.500 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.core.resources — `org.eclipse.platform %% org.eclipse.core.resources` is declared at 3.13.500 in REDACTED, but 3.24.100 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.13.500 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.core.runtime — `org.eclipse.platform %% org.eclipse.core.runtime` is declared at 3.16.0 in REDACTED, but 3.35.0 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.16.0 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.core.variables — `org.eclipse.platform %% org.eclipse.core.variables` is declared at 3.4.600 in REDACTED, but 3.6.900 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.4.600 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.equinox.app — `org.eclipse.platform %% org.eclipse.equinox.app` is declared at 1.4.300 in REDACTED, but 1.7.600 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 1.4.300 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.equinox.common — `org.eclipse.platform %% org.eclipse.equinox.common` is declared at 3.10.600 in REDACTED, but 3.21.0 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.10.600 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.equinox.preferences — `org.eclipse.platform %% org.eclipse.equinox.preferences` is declared at 3.7.600 in REDACTED, but 3.12.100 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.7.600 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.equinox.registry — `org.eclipse.platform %% org.eclipse.equinox.registry` is declared at 3.8.600 in REDACTED, but 3.12.600 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.8.600 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.osgi — `org.eclipse.platform %% org.eclipse.osgi` is declared at 3.15.0 in REDACTED, but 3.24.300 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.15.0 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.team.core — `org.eclipse.platform %% org.eclipse.team.core` is declared at 3.8.700 in REDACTED, but 3.10.1100 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.8.700 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.eclipse.platform:org.eclipse.text — `org.eclipse.platform %% org.eclipse.text` is declared at 3.9.0 in REDACTED, but 3.14.800 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.9.0 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.flywaydb:flyway-core — `org.flywaydb %% flyway-core` is declared at 12.10.0 in REDACTED, but 13.12.2 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 12.10.0 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.scalameta:mtags-interfaces — `org.scalameta %% mtags-interfaces` is declared at 1.2.2 in REDACTED, but 1.6.9 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 1.2.2 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.virtuslab.scala-cli:cli_3 — `org.virtuslab.scala-cli %% cli_3` is declared at 1.14.0 in REDACTED, but 1.19.0 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 1.14.0 until the declaration is edited — there is no lockfile refresh that would move it.
  • + 1 more in this group — see findings.md.

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.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-6104617cc18f4e4590a8b7404dc2df82/history.json --exit-code 0 --source .5artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-6104617cc18f4e4590a8b7404dc2df82/tree.json --exit-code 0 --source .0artifacts/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/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .33artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .3artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—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 6 file(s) — `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`, `mtags/src/main/scala/scala/meta/internal/mtags/ScalametaCommonEnrichments.scala`, … (+1 more) — 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 Policydisclosure—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 Confinementruntime-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 Confinementruntime-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 Enforcementruntime-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 Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** .0artifacts/raw/trivy-fs.json

Run 01a1d8e8-be02-7c95-aba7-f9d959d4a3bd · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md