scalameta/scalafmt

Executive summary

scalameta/scalafmt falls short of our standard for production, in part because we found no recorded design decisions and no architecture document or diagram. It scores 58 out of 100 and is rated Adequate, and 36 of its 43 critical findings are security problems.

Maturity, at 47, is the weakest lens and counts most in the score. The best first step is recording design decisions, worth about 10 points. Fixing the part of the code only one person knows comes next, worth about 9 points. Raising Maturity to 70 would lift the score to about 67.

Twenty-eight pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Four secrets can leak from the build pipeline, and seven parts of the code are no longer understood by anyone working on it. Pinning each tool to an exact version, limiting each secret to its own step and having someone learn the forgotten files would close these risks. Setting a waiting period for automatic updates would fix the automatic dependency update that takes a new release at once, and the two unsafe settings in infrastructure or container files need changing to safe values.

The product code is 42,208 lines, about €50,000 to rebuild.

Code Health 67 Adequate, capped by Cognitive Complexity and Nullable reference types Architecture 88 Adequate, capped by Project Cohesion Maturity 47 Weak, capped by Bus Factor and Architecture documentation Production Readiness 63 Adequate Security and Compliance 77 Adequate, capped by Static Analysis (SAST) and Supply-chain Provenance & Signing Performance 80 Strong

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.

Maturity 47 · counts for 46%Production Readiness 63 · counts for 25%Code Health 67 · counts for 14%Security and Compliance 77 · counts for 8%Performance 80 · counts for 4%Architecture 88 · counts for 2%

If Maturity rose from 47 to 70, the lowest score rated Strong, the score would rise from 58 to about 67.

Code composition: what the lines of code are

Product code 88%Tests 12%

New since the last survey: 3 findings

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

Cognitive Complexity · SplitsAfterDo.get (cognitive 16) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala
Churn × Complexity Hotspots · Hotspot: scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala
Supply-chain Provenance & Signing · REDACTED

Watchdog compares 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: 1 finding

This critical or serious finding was in the previous survey, on 12 October 2026, and is gone from this one.

Supply-chain Provenance & Signing REDACTED

Rebuild cost: about €50,000 · Estimate

Cost to rebuild	€17,000 to €84,000, for 279 to 885 hours of work, about 0.3 person-years for one engineer
Difficulty of the problem	Standard, 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.8 at a score of 58. 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.
Size	Medium: 42,208 lines of product code
What it is not	Not 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: Watchdog prices 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.

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

Raises the score by about 10 points · Low effort · ADR Quality

Resolve the 1 Off-boarding risk finding(s) in Bus Factor.

Raises the score by about 9 points · Low effort · Bus Factor

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.

Raises the score by about 9 points · Medium effort · Architecture documentation

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 €50,000 to build again, about 0.3 person-years of work. Its weakest lens is Maturity, at 47 (Weak). Maturity is about how well the project explains and looks after itself, which decides whether a new developer, or a new supplier, can take over. Because the weakest lens counts most in the score, work on Maturity also moves the score most.

Based on: the rebuild estimate · the Maturity grade · how much each lens counts

What to do: Start with the Maturity actions in Top priorities.

If you do one thing first · First action

Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 10 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.

Based on: the ranked actions in Top priorities, by score gain and effort

What hard-to-read code costs each year · Cost

Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.6 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 3% to 8% on every change. The history of the code shows how much it changes: about 33,082 lines over the last 90 days, which is about 134,166 lines a year. At that pace, the extra work comes to an estimated 11.5 to 69.1 engineer-days a year, and it grows as more code changes.

How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.

Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history

What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

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.

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.

186 modules, with 313 dependencies between them. 2 loops run through 40 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 146 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 scalafmt.config.BinPack	2 scalafmt.config.Comments	3 scalafmt.config.Docstrings	4 scalafmt.config.Indents	5 scalafmt.config.Literals	6 scalafmt.config.Spaces	7 scalafmt.config.Newlines	8 scalafmt.config.RewriteScala3Settings	9 scalafmt.config.RewriteSettings.InsertBraces	10 scalafmt.config.ScalafmtParser	11 scalafmt.interfaces	12 scalafmt.internal.BestFirstSearch	13 scalafmt.internal.State	14 scalafmt.config.RewriteSettings	15 scalafmt.internal.FormatOps	16 scalafmt.internal.FormatWriter.FormatLocations	17 scalafmt.util	18 scalafmt.internal.FormatWriter	19 scalafmt.internal	20 scalafmt.internal.Policy	21 scalajs.core.tools.linker.frontend.optimizer.OptimizerCore	22 scalajs.core.tools.javascript.Trees	23 scalafmt.config.TreePattern	24 scalafmt.rewrite.FormatTokensRewrite	25 scalafmt.sysops	26 scalafmt.config.ProjectFiles	27 scalafmt.rewrite	28 scalafmt.cli	30 scalafmt.cli.WriteMode	31 scalafmt.config	34 scalafmt.Formatted	36 scalafmt	37 scalafmt.internal.MissingBraces
1 scalafmt.config.BinPack
2 scalafmt.config.Comments
3 scalafmt.config.Docstrings
4 scalafmt.config.Indents
5 scalafmt.config.Literals
6 scalafmt.config.Spaces
7 scalafmt.config.Newlines	1																					4								1
8 scalafmt.config.RewriteScala3Settings				1																										1
9 scalafmt.config.RewriteSettings.InsertBraces																						1								1
10 scalafmt.config.ScalafmtParser																						1								3
11 scalafmt.interfaces																													1			1
12 scalafmt.internal.BestFirstSearch																			4		2								1	1
13 scalafmt.internal.State																					1									1
14 scalafmt.config.RewriteSettings									1													1
15 scalafmt.internal.FormatOps							1												3			2								1
16 scalafmt.internal.FormatWriter.FormatLocations							1			1												1								2
17 scalafmt.util					1		2			1									11	1	1	14							1	7
18 scalafmt.internal.FormatWriter																1			2	1	2	2								2
19 scalafmt.internal	2						4					1	1	1	3		1	2		2	4	18							4	82	1	1
20 scalafmt.internal.Policy																			16													5
21 scalajs.core.tools.linker.frontend.optimizer.OptimizerCore																				5		16							7
22 scalajs.core.tools.javascript.Trees																					3								10
23 scalafmt.config.TreePattern																						1								1
24 scalafmt.rewrite.FormatTokensRewrite																			1			1								5		1
25 scalafmt.sysops																						4
26 scalafmt.config.ProjectFiles																									1					3
27 scalafmt.rewrite					1		1	1	1	1									10			5		24						17
28 scalafmt.cli											2														3	1				1
29 scalafmt.rewrite.Imports							1			1												1					1
30 scalafmt.cli.WriteMode																												5
31 scalafmt.config	2	3	3	3	2	3	16	3	1					1						2		7	1		2	2	2		3
32 scalajs.core.compiler.GenJSCode																				1		10							1
33 scalajs.core.tools.linker.frontend.optimizer																			1	1	9	9							1
34 scalafmt.Formatted																														1		3
35 scalafmt.config.FormatEvent																		1	3		1									7
36 scalafmt																			2			1								3	1
37 scalafmt.internal.MissingBraces														13					13			2									13
38 scalafmt.Error																			1		1	2										9
39 scalafmt.dynamic											8											2							1			2
40 scalafmt.internal.OptionalBraces																			40			2							1	19			17

Uses a module listed above itPart of a loopThe module itself

At a glance — Code Health · 67% · Adequate · gated by D2, X5 ·

The Good

D3 · Scala God Classes 8.0 D4 · Scala Code Duplication 9.9 D17 · Scala Explicit Debt 9.8 GD1 · Repo Unfinished & placeholder code 10.0 IC1 · Repo Incompleteness & stubs 10.0 X1 · Repo Async correctness 10.0 X12 · Repo Unreachable branch 10.0 X13 · Repo Undrained process stream 10.0 X16 · Repo Unfloored truncation loop 10.0 X18 · Repo Disposal-pattern correctness 10.0 X19 · Repo Unrestored process-global state 10.0 X20 · Repo Mistyped argument guard 10.0 X21 · Repo Side-effecting pattern guard 10.0 X22 · Repo Contradicted release guard 10.0 X25 · Repo Inert configuration knob 10.0 X26 · Repo Unsynchronised callback handoff 10.0 X27 · Repo Collection changed while being enumerated 10.0 X28 · Repo Index access outside its own emptiness guard 10.0 X29 · Repo Per-element action decided by a fixed element 10.0 X3 · Repo Exception handling 10.0 X30 · Repo Support guard that admits what it rejects 10.0

The Bad

X23 · Repo Unguarded diagnostic materialisation 5.4

The Ugly

D1 · Scala Cyclomatic Complexity 4.7 D2 · Scala Cognitive Complexity 2.3 X5 · Repo Nullable reference types 2.0

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

The Good

D5 · Scala Coupling 10.0 D6 · Scala Cohesion (LCOM4) 9.6 D35 · Scala Change Coupling 9.9 AX10 · Repo Code composition 9.1 AX3 · Repo Project dependency cycles 10.0 AX4 · Repo Dependency direction 10.0 AX6 · Repo Interface segregation 10.0

The Ugly

D26 · Scala Project Cohesion 0.0

At a glance — Maturity · 47% · Weak · gated by D16, M2 ·

The Good

D15 · Scala Churn × Complexity Hotspots 9.6 D19 · Scala Documentation Quality 10.0 D34 · Scala Knowledge Freshness 8.1 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 10.0

The Ugly

D16 · Scala Bus Factor 1.6 D20 · Scala ADR Quality 0.0 M1 · Repo Documentation (README) 4.5 M2 · Repo Architecture documentation 0.0

At a glance — Readiness · 63% · Adequate ·

The Good

D9 · Scala Test Distribution 10.0 D12 · Scala Dependency Hygiene 8.4 D13 · Scala Secret Scanning 10.0 D14 · Scala License Compliance 10.0 P1 · Repo CI/CD gates 10.0 P2 · Repo Observability 7.0 P6 · Repo Release Hygiene 10.0

The Bad

P10 · Repo Library API & versioning 6.0 P4 · Repo Deployment & Rollback 5.0

The Ugly

P3 · Repo Security & performance tooling 4.0

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

The Good

D28 · Scala Secrets (history) 10.0 D30 · Scala Dependency Vulnerabilities 10.0 D31 · Scala IaC & Container Security 9.2 D43 · Scala Malicious Dependencies 10.0 S1 · Repo Web-Security Posture 8.0 X14 · Repo Bypassable address classification 10.0 X15 · Repo Unvalidated length from an untrusted reader 10.0 X17 · Repo Uncapped recursion over a caller-supplied document 10.0 X24 · Repo Document value interpolated into markup unescaped 10.0

The Ugly

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

At a glance — Performance · 80% · Strong ·

The Good

PF1 · Repo Benchmark discipline 8.5 PF3 · Repo Async & latency hygiene 10.0

The Bad

PF2 · Repo Allocation hygiene 6.4

Security & Compliance — OWASP Top-10 mapping

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

OWASP category	Findings	Severity
A05:2025 — Injection	37	High / Critical
A03:2025 — Software Supply Chain Failures	5	Medium
A02:2025 — Security Misconfiguration	3	High / Critical

Roadmap

Begin by addressing the single missing architecture decision record and the off-boarding risk to stabilize core governance and team resilience. Next, establish a dedicated folder for design documents to capture significant decisions and add a quick-start section to the root README to help newcomers get started. Finally, update the seven orphaned knowledge files, prioritizing GenJSCode.scala, OptimizerCore.scala, and HiveMetastoreCatalog.scala, to ensure critical code knowledge remains current.

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

Do this	Helps	Effort	Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.	+10.5 pts	Low	ADR Quality
Resolve the 1 Off-boarding risk finding(s) in Bus Factor.	+9.4 pts	Low	Bus Factor
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.	+9.2 pts	Medium	Architecture documentation
Resolve the 7 Orphaned knowledge finding(s) in Knowledge Freshness — start with GenJSCode.scala, OptimizerCore.scala, HiveMetastoreCatalog.scala.	+3.1 pts	Low	Knowledge Freshness
Add a build/run (quick start) section to the root README — the first thing a newcomer needs.	+5.2 pts	Medium	Documentation (README)
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.	+2.0 pts	Medium	Nullable reference types
Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.	+1.7 pts	Medium	Security & performance tooling
Resolve the 12 Orphaned file finding(s) in Knowledge Freshness — start with BaseLinker.scala, Primality.scala, SourceMapWriter.scala.	+1.7 pts	Medium	Knowledge Freshness

File quality

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

File	Score	Band	Worst signal
REDACTED	0.7	Slop	Static Analysis (SAST): High: REDACTED
REDACTED	2.4	Slop	Static Analysis (SAST): High: REDACTED
REDACTED	3.7	Slop	IaC & Container Security: High IaC: REDACTED
REDACTED	4.4	Mixed	Static Analysis (SAST): High: REDACTED
scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala	6.0	Mixed	Explicit Debt: TodoComment
scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala	6.0	Mixed	Explicit Debt: XxxComment
scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala	6.0	Mixed	Explicit Debt: TodoComment
scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala	6.0	Mixed	Explicit Debt: TodoComment
scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala	6.0	Mixed	Explicit Debt: TodoComment
scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala	6.0	Mixed	Explicit Debt: TodoComment
scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala	6.0	Mixed	Explicit Debt: TodoComment
scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala	6.0	Mixed	Explicit Debt: TodoComment
scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala	6.0	Mixed	Explicit Debt: TodoComment
scalafmt-benchmarks/src/resources/Endpoint.scala	6.0	Mixed	Explicit Debt: FixmeComment
scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala	6.0	Mixed	Explicit Debt: TodoComment
scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala	6.0	Mixed	Explicit Debt: TodoComment
scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Router.scala	6.3	Mixed	Cyclomatic Complexity: Router.getSplits (cyclomatic 22)
scalafmt-core/shared/src/main/scala/org/scalafmt/util/LoggerOps.scala	6.7	Mixed	Explicit Debt: TodoComment
scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala	7.0	Mixed	Cyclomatic Complexity: JSCodePhase.genSimpleOp (cyclomatic 89)
scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala	7.0	Mixed	Cyclomatic Complexity: RedundantBraces.onLeftBrace (cyclomatic 37)

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

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

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

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

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

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

What we checked — 66 dimensions across the health lenses

D1D2D3D4D5D6D9D12D13D14D15D16D17D19D20D26D28D29D30D31D34D35D36D43AX10AX3AX4AX6GD1IC1M1M2M3M4P1P10P2P3P4P6PF1PF2PF3S1X1X12X13X14X15X16X17X18X19X20X21X22X23X24X25X26X27X28X29X3X30X5

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

How to trust any code-health report — three questions

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

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1770b-1509-7ce7-88d2-8c801ca72f55.

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

Run transparency — what happened this run

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

D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.scala) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (`addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (`addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.scala) and this repository declares an sbt build (repository root, 72 test files), but it was not re-run: no test result was produced. 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 — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares 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.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `scalafmt-benchmarks/src/resources/Endpoint.scala`, `scalafmt-benchmarks/src/resources/scala3/Scala3Syntax.scala`, `scalafmt-benchmarks/src/resources/scalafmt/Basic.scala`, `scalafmt-dynamic-core/src/main/scala/org/scalafmt/dynamic/ScalafmtDynamicSession.scala`, `website/docusaurus.config.ts` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
D44 Platform End-of-Life — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, 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 build.sbt 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 REDACTED) is simply not read here yet.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DevServer (start). the dev server did not expose a crawlable HTTP endpoint in time — no runtime evidence.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
M4 Documentation accuracy — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9). 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.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
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.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
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 Secret Scanning: Secret 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 is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
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.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity4.7 / 10Weak✓ 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 4.7 / 10 · rule-coverage 100% · ceiling Prevented

81 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was OptimizerCore.foldBinaryOp at 236. A further 3 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 TreeSyntacticGroup.apply at 67 — they are counted neither in the figure above nor in this dimension's score. 1 file carries no cyclomatic complexity row at all for this reason — every one of its over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: scalafmt-core/shared/src/main/scala/org/scalafmt/internal/TreeSyntacticGroup.scala (TreeSyntacticGroup.apply at 67). 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.

OptimizerCore.foldBinaryOp (cyclomatic 236)scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:2261

SplitsAfterLeftParenOrBracket.getNoBinPack (cyclomatic 101)scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1763

JSCodePhase.genSimpleOp (cyclomatic 89)scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:2584

OptimizerCore.transform (cyclomatic 78)scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:256

SplitsAfterLeftBrace.getRest (cyclomatic 76)scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:278

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

What to do

Bring the 1 body over 120 down to 120 or less in Cyclomatic Complexity — start with OptimizerCore.foldBinaryOp (cyclomatic 236). — Refactoring it lifts Cyclomatic Complexity from 4.7 to about 5.5/10.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

D2 · Cognitive Complexity2.3 / 10Critical✓ 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 2.3 / 10 · rule-coverage 100% · ceiling Prevented

142 method(s) exceeded the cognitive complexity threshold of 15; the worst was OptimizerCore.foldBinaryOp at 222.

OptimizerCore.foldBinaryOp (cognitive 222)scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:2261

SplitsAfterLeftParenOrBracket.getNoBinPack (cognitive 152)scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1763

SplitsBeforeDot.getSelect (cognitive 145)scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2595

SplitsAfterLeftBrace.getRest (cognitive 133)scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:278

BestFirstSearch.shortestPath (cognitive 115)scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala:118

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

What to do

Bring the 4 bodies over 120 down to 120 or less in Cognitive Complexity — start with OptimizerCore.foldBinaryOp (cognitive 222), SplitsAfterLeftParenOrBracket.getNoBinPack (cognitive 152), SplitsBeforeDot.getSelect (cognitive 145). — 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 Cognitive Complexity from 2.3 to about 3.6/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

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

24 god class(es) detected.

FileTooLong: internal/Splits.scala · ×14scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala

TooManyMethods: TreeOps · ×9scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala:20

ClassTooLong: GenJSCodescalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:30

What to do

Resolve the 14 FileTooLong finding(s) in God Classes — start with Splits.scala, OptimizerCore.scala, GenJSCode.scala. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 9 TooManyMethods finding(s) in God Classes — start with TreeOps.scala, FormatTokens.scala, GenJSCode.scala. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 1 ClassTooLong finding(s) in God Classes — start with GenJSCode.scala. — One of this dimension's main actionable groups (1 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

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

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

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

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

8 duplicated block group(s) detected.

Duplicated block (6 lines × 2) · ×2scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/CliOptions.scala:173

Duplicated block (13 lines × 2)scalafmt-benchmarks/src/resources/scala-js/Division.scala:251

Duplicated block (10 lines × 2)scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:328

Duplicated block (9 lines × 2)scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:99

Duplicated block (7 lines × 2)scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:411

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

What to do

Resolve the 2 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with CliOptions.scala, MissingBraces.scala. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with Division.scala. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Duplicated block (10 lines × 2) finding(s) in Code Duplication — start with GenJSCode.scala. — One of this dimension's main actionable groups (1 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

Do you agree with this assessment?

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, and main-sequence distance (abstractness) is not computed for these modules yet.

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

Do you agree with this assessment?

D6 · Cohesion (LCOM4)9.6 / 10Stronggated by 2 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

2 of 60 classes have LCOM4 above 3.

Low cohesion: FormatOps (LCOM4 17) · ×2scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:19

What to do

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

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

Do you agree with this assessment?

D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

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

142 test methods: 142 unit, 0 integration, 0 BDD, 0 e2e. The Scala suite contributes 142 test case(s) across 23 file(s) in a test source set declaring at least one — every `test("…")`, `it("…")`, `property("…")` and `"…" in {…}` registration and every JUnit `@Test`, which is how munit, ScalaTest, utest, ZIO Test and specs2 declare a case; a case registered under a computed name is not counted, so this is a floor. Its tier split is INFERRED from paths and file names, except sbt's src/it source set, which the build declares.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

Do you agree with this assessment?

D12 · Dependency Hygiene~~9.8~~ 8.4 / 10Strong✓ Tool-verified

What it measures: Whether dependencies are current, secure, and not bloated.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 8.4 / 10 · rule-coverage 86% · ceiling Verified

3 outdated direct sbt declarations. 6 of 7 direct declarations were graded against Maven Central (1 not published there, which is what a private Nexus or Artifactory artifact looks like, 0 declaring a version range rather than an exact version). 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.github.scopt:scopt_2.13 · ×3

What to do

Enforce Dependency Hygiene in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

Do you agree with this assessment?

D13 · Secret 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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

Do you agree with this assessment?

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

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

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

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

0 of 6 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 4 sbt build file(s) (build.sbt 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. 2 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. A further 1 coordinate(s) are not published to Maven Central — another repository (Google's Maven hosts androidx), a SNAPSHOT, or a private artifact — so their licences are not readable from here and they are outside this verdict. ★ 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.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

Do you agree with this assessment?

D15 · Churn × Complexity Hotspots9.6 / 10Stronggated by 4 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 9.6 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala (15×76=1140); scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala (11×35=385); scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala (6×20=120)

Hotspot: scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala · ×4scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:278

What to do

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

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

Do you agree with this assessment?

D16 · Bus Factor1.6 / 10Critical✓ 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 1.6 / 10 · rule-coverage 100% · ceiling Documented

78 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala. Counted over 93 of the 248 production source files in this repository: 138 are under the ~2,400-byte size floor this dimension measures over, and the remaining 17 have no attributable history left to measure.

Off-boarding risk: anonymized user #1

What to do

Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

D17 · Explicit Debt9.8 / 10Stronggated by 34 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.8 / 10 · rule-coverage 100% · ceiling Prevented

34 deducted task-comment markers across 42208 LoC (0.1/KLoC) → score 9.8. 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 · ×27scalafmt-tests/shared/src/test/scala/org/scalafmt/FormatTests.scala:13

FixmeComment · ×3scalafmt-dynamic-core/src/main/scala/org/scalafmt/dynamic/ScalafmtReflect.scala:21

XxxComment · ×3scalafmt-core/shared/src/main/scala/org/scalafmt/Scalafmt.scala:30

HackCommentscalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:475

What to do

Resolve the 27 TodoComment finding(s) in Explicit Debt — start with HiveMetastoreCatalog.scala (5), OptimizerCore.scala (5), FormatOps.scala (3). — One of this dimension's main actionable groups (27 warning-level).
Resolve the 3 FixmeComment finding(s) in Explicit Debt — start with Endpoint.scala (2), ScalafmtReflect.scala. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 3 XxxComment finding(s) in Explicit Debt — start with Scalafmt.scala (2), Splits.scala. — One of this dimension's main actionable groups (3 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

Do you agree with this assessment?

D19 · Documentation 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. 12 document(s) read across 1 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

Do you agree with this assessment?

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

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

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

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

No architecture decision records were found.

No ADRs found

What to do

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

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

Do you agree with this assessment?

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, LLM-independent.

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

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

Projects may be oversized for their cohesion

What to do

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.

Do you agree with this assessment?

D28 · Secrets (history)10.0 / 10Exemplary○ Nothing flagged

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

Method: Secret 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 10.0 / 10 · rule-coverage 100% · ceiling Documented

gitleaks scanned the full history AND the current working tree and found no secrets.

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

Do you agree with this assessment?

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

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

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

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

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

37 finding(s): 0 critical, 34 high, 3 medium, 0 low. 28 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 7 file(s) — `bin/install-scalafmt-native.sh` (line 20, line 29, line 50), `bin/scalafmt_ng` (line 4), `scalafmt-benchmarks/src/resources/Endpoint.scala`, `scalafmt-benchmarks/src/resources/scala3/Scala3Syntax.scala`, `scalafmt-benchmarks/src/resources/scalafmt/Basic.scala`, … (+2 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

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

What to do

Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED. — One of this dimension's main actionable groups (4 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
No action in Static Analysis (SAST) — all 28 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 (28 issue-level, 0 of them charged here).

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

Do you agree with this assessment?

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

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir 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.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

Do you agree with this assessment?

D31 · IaC & Container Security9.2 / 10Adequategated by 2 critical findings✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

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

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

REDACTED

What to do

Resolve the 2 High IaC finding(s) in IaC & Container Security — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 Medium IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

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

Do you agree with this assessment?

D34 · Knowledge Freshness8.1 / 10Adequategated by 7 critical findings✓ 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 8.1 / 10 · rule-coverage 100% · ceiling Documented

19 of 110 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala. Counted over 110 of the 248 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned knowledge · ×7scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:1

Orphaned file · ×12scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala:1

Further orphaned files (smaller)

What to do

Resolve the 7 Orphaned knowledge finding(s) in Knowledge Freshness — start with GenJSCode.scala, OptimizerCore.scala, HiveMetastoreCatalog.scala. — One of this dimension's main actionable groups (7 issue-level).
Resolve the 12 Orphaned file finding(s) in Knowledge Freshness — start with BaseLinker.scala, Primality.scala, SourceMapWriter.scala. — One of this dimension's main actionable groups (12 recommendation-level).
Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

Do you agree with this assessment?

D35 · Change Coupling9.9 / 10Stronggated by 1 serious 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.9 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: Router.scala↔TokenClasses.scala 80%

Change coupling: Router.scala ↔ TokenClasses.scalascalafmt-core/shared/src/main/scala/org/scalafmt/internal/Router.scala:1

What to do

Resolve the 1 Change coupling finding(s) in Change Coupling — start with Router.scala. — One of this dimension's main actionable groups (1 warning-level).

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

Do you agree with this assessment?

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

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

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

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

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

REDACTED

What to do

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

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

Do you agree with this assessment?

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

Do you agree with this assessment?

Frontend & cross-cutting dimensions

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

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

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

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

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

What to do

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

Do you agree with this assessment?

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

AX6 · Interface segregation10.0 / 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.

Do you agree with this assessment?

GD1 · Unfinished & placeholder code10.0 / 10Exemplary○ Nothing flagged

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.

Do you agree with this assessment?

IC1 · Incompleteness & stubs10.0 / 10Exemplary○ Nothing flagged

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.

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. — scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/CliArgParser.scala:39

What to do

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.

Do you agree with this assessment?

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

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

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

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

What to do

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

Do you agree with this assessment?

M2 · Architecture documentation0.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.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.

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.
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

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

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

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

Do you agree with this assessment?

P10 · Library API & versioning6.0 / 10Adequate✓ Tool-verified

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

14/14 types (100%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.

What to do

Keep implementation types off the public surface (Java: package-private (no modifier), or leave its package out of `module-info` exports) so internals can change without breaking consumers.

Do you agree with this assessment?

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.

Do you agree with this assessment?

P3 · Security & performance tooling4.0 / 10Weak✓ 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.

No static application security testing detected. For this repository's stack, add scalafix or scapegoat (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 16096 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

What to do

Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Dependabot is configured but does not watch `npm` — add that `package-ecosystem` entry to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.

Do you agree with this assessment?

P4 · Deployment & Rollback5.0 / 10Adequate✓ 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.

The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.

What to do

Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.

Do you agree with this assessment?

P6 · Release Hygiene10.0 / 10Exemplary✓ 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.

Do you agree with this assessment?

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. — scalafmt-benchmarks/src/main/scala-2.12/benchmarks/MacroBenchmark.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.

Do you agree with this assessment?

PF2 · Allocation hygiene6.4 / 10Adequate✓ Tool-verified

Readiness · Performance — Whether the code is written to minimise allocations so it doesn't pressure its host's memory manager — buffer/slice views over copies, object pooling, stack or value-type allocation, and buffer writers. Reward-only: credited where present, never penalised where a simpler style is fine.

Method: Production-source scan: density (per 1k LoC) of allocation-aware APIs — in .NET Span/Memory, ArrayPool/ObjectPool, stackalloc, ValueTask, value-type structs, IBufferWriter, string.Create, SkipLocalsInit; off .NET, with comments and strings blanked, Go's sync.Pool, preallocated slices/maps, Grow, strconv.Append* and buf[:0] reuse; the JVM's NIO buffer views, MemorySegment, primitive collections, pools and literal presizes (plus Kotlin primitive arrays and value classes, Scala AnyVal and @specialized); Swift's reserveCapacity, ContiguousArray, withUnsafe* access and ~Copyable. Activated off .NET on the same floor (400 lines, and benchmarks or 8 uses); Rust and garbage-collected scripting languages are not applicable. Reward-only. Deterministic, syntax/text detection.

What to do

Raise allocation-aware density on the hot paths — currently 34 use(s) across 47,481 production line(s) (~0.7/1k). More of the idioms below on the allocation-heavy paths climbs this toward 10.
Java: on hot paths, work through buffer views (ByteBuffer/LongBuffer slices, MemorySegment) instead of copies, avoid boxing with primitive collections (fastutil, Eclipse Collections, HPPC, Trove), presize collections and StringBuilders, and pool expensive buffers (Netty's pooled allocator, commons-pool).
Scala: on hot paths, make small wrappers value classes (extends AnyVal), @specialized generic code over primitives, use primitive collections, and presize builders.

Do you agree with this assessment?

PF3 · Async & latency hygiene10.0 / 10Exemplary✓ 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 the language 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.

Do you agree with this assessment?

S1 · Web-Security Posture8.0 / 10Strong✓ 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 no HTTP of its own — no HTTP-server artifact (akka-http, pekko-http, http4s, Play, Finagle, zio-http, cask, Scalatra, a tapir server, Jetty, Undertow, …) outside test scope in its build, and no server package imported or server bound in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker.

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. — scalafmt-dynamic/src/main/scala/org/scalafmt/dynamic/coursier/ClasspathCache.scala:41

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.

Do you agree with this assessment?

X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

X14 · Bypassable address classification10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.

Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.

Do you agree with this assessment?

X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.

Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.

Do you agree with this assessment?

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.

Do you agree with this assessment?

X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.

Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.

Do you agree with this assessment?

X18 · Disposal-pattern correctness10.0 / 10Exemplary○ Nothing flagged

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

X20 · Mistyped argument guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `NullPointerException` (Java, Kotlin, Scala), `ArgumentError.notNull` (Dart) or `ArgumentNullException` (F#'s `nullArg`) tells the caller a parameter was null when it provably was not.

Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.

Do you agree with this assessment?

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.

Do you agree with this assessment?

X22 · Contradicted release guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.

Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.

Do you agree with this assessment?

X23 · Unguarded diagnostic materialisation5.4 / 10Adequate✓ Tool-verified

Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.

Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. 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 `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.

`debug` at line 79 is called with an argument built by `sel.elements.mkString("…", "…", "…")` (line 81), whose cost grows with the collection it walks. Scala evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: the logger takes a built `String` (SLF4J, Akka/Pekko `LoggingAdapter`, `context.log`), and there is no `isDebugEnabled`/`isTraceEnabled` test and no debug flag. — scalafmt-benchmarks/src/resources/Endpoint.scala:79

What to do

In Scala, put the construction behind the logger's own check (`if (log.isDebugEnabled)`), or log through a logger that takes the message by name or by macro and so builds it only when the level is on — scala-logging's `LazyLogging`/`StrictLogging` (`logger.debug(s"rows: ${rows.mkString(", ")}")` expands to that check), log4s or log4cats. Interpolating into an `s"…"` is not the fix on SLF4J or Akka's `LoggingAdapter`: their `debug` takes a `String`, so the interpolation and every `mkString` inside it run before the call is entered.

Do you agree with this assessment?

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

X26 · Unsynchronised callback handoff10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.

Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.

Do you agree with this assessment?

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.

Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.

Do you agree with this assessment?

X3 · Exception handling10.0 / 10Exemplary○ Nothing flagged

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.

Do you agree with this assessment?

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.

Do you agree with this assessment?

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

Do you agree with this assessment?

Reference — by lens

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

Lens	Score	Rating	Impact
Code Health	67%	Adequate — gated by D2, X5	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture	88%	Adequate — gated by D26	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity	47%	Weak — gated by D16, M2	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness	63%	Adequate	Acceptable, with room to improve.
Security	77%	Adequate — gated by D29, D36	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance	80%	Strong	Strongest area.

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 — 54 check(s) not relevant to this codebase

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

AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — 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
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — the dev server did not expose a crawlable HTTP endpoint in time — no runtime evidence This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
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 — ~5785 lines of test source are present (.scala) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — 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.
D21 Naming Consistency — Naming consistency is measured on C# only; Java, JavaScript, Scala not measured.
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+ projects each declaring an entity of their own. 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# and Visual Basic comments only — this repository's production source is .java, .scala, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
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.
D32 Data Compliance (PII/GDPR) — 5 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
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): 147 value object(s); 1 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
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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
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.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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 — 43 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
REDACTED
+ 3 more in this group — see findings.md.

D34 · Knowledge Freshness · Orphaned knowledge · ×7

Orphaned knowledge scalafmt-benchmarks/src/resources/scala-js/GenJSCode.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 scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.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 scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.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 scalafmt-benchmarks/src/resources/Endpoint.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 scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.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 scalafmt-benchmarks/src/resources/scala-js/Division.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 scalafmt-benchmarks/src/resources/scala-js/Analyzer.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
REDACTED

D31 · IaC & Container Security · High IaC · ×2

REDACTED
REDACTED

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

REDACTED

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

REDACTED

Serious — 304 finding(s)

D17 · Explicit Debt · TodoComment · ×27

TodoComment scalafmt-tests/shared/src/test/scala/org/scalafmt/FormatTests.scala:13 — // TODO(olafur) property test: same solution without optimization or timeout. — 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 scalafmt-tests/shared/src/test/scala/org/scalafmt/UnitTests.scala:20 — // TODO(olafur) make possible to limit states per unit test. — 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 scalafmt-tests/shared/src/test/scala/org/scalafmt/util/FormatAssertions.scala:73 — // TODO(olafur) move this to scala.meta? — 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 scalafmt-docs/src/main/scala/website/package.scala:98 — // TODO: make this pretty — 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 scalafmt-core/shared/src/main/scala/org/scalafmt/util/LoggerOps.scala:26 — // TODO(olafur) parameterize — 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 scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala:383 — // TODO(olafur) inefficient, precalculate? — 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 scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala:501 — // TODO(olafur) document why/how this optimization works. — 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 scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:182 — // TODO(olafur) clear queue between arguments, they are independent. — 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 scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:199 — // TODO(olafur) what the right { decides to be single line? — 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 scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:377 — // TODO: if that ever changes, modify how rewrite rules handle infix — 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 scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:1209 — // TODO(olafur) Refactor implementation to make it maintainable. It's super — 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 scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala:135 — // TODO: amend for additional cases when the parser supports them — 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 scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:206 — // TODO(olafur) expire policy, see #18.
TodoComment scalafmt-cli/shared/src/test/scala/org/scalafmt/cli/CliTest.scala:241 — // TODO: We need to pass customFiles information to ProjectFiles — 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 scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala:101 — // TODO: replace this with o.a.s.sql.hive.HiveCatalog once we merge SQLContext and HiveContext — 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 scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala:329 — // TODO: We need to place the SQL string here — 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 scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala:332 — // TODO: Support persisting partitioned data source relations in Hive compatible format — 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 scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala:816 — // TODO: merge this with HiveClientImpl#toHiveTable — 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 scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala:859 — // TODO: check if this estimate is valid for tables after partition pruning. — 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 scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala:454 — // TODO In theory we should filter out protected methods — 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 scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala:110 — // TODO Make it always fatal when we can get rid of bypassLinkingErrors — 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 scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:487 — // TODO This cast is suspicious — 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 scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:830 — // TODO This cast is suspicious — 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 scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:1208 — // TODO? Inline multiple non-trait-impl-forwarder with the exact same body? — 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 scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:1472 — // TODO Support assignment of record — 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.
+ 2 more in this group — see findings.md.

D3 · God Classes · FileTooLong · ×14

FileTooLong: internal/Splits.scala scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala — FileTooLong — 3025 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2525 over it, 6.05× 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: scala-js/OptimizerCore.scala scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala — FileTooLong — 2750 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2250 over it, 5.50× 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: scala-js/GenJSCode.scala scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala — FileTooLong — 2719 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: GenJSCode (30-4664). The bar is 500 significant lines; this is 2219 over it, 5.44× 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: internal/FormatWriter.scala scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala — FileTooLong — 1683 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: FormatWriter (23-1727). The bar is 500 significant lines; this is 1183 over it, 3.37× 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: internal/FormatOps.scala scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala — FileTooLong — 1367 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 867 over it, 2.73× 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: util/TreeOps.scala scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala — FileTooLong — 867 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 367 over it, 1.73× 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: resources/Endpoint.scala scalafmt-benchmarks/src/resources/Endpoint.scala — FileTooLong — 699 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 199 over it, 1.40× 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: internal/OptionalBraces.scala scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala — FileTooLong — 669 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 169 over it, 1.34× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: rewrite/Imports.scala scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala — FileTooLong — 667 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 167 over it, 1.33× 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: spark/HiveMetastoreCatalog.scala scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala — FileTooLong — 630 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 130 over it, 1.26× 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: rewrite/RedundantBraces.scala scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala — FileTooLong — 594 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: RedundantBraces (152-819). The bar is 500 significant lines; this is 94 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: scala-js/ScalaJSClassEmitter.scala scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.scala — FileTooLong — 588 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 88 over it, 1.18× 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: scala-js/Division.scala scalafmt-benchmarks/src/resources/scala-js/Division.scala — FileTooLong — 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 over it, 1.04× 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: scala-js/Analyzer.scala scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala — FileTooLong — 505 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: Analyzer (22-828). The bar is 500 significant lines; this is 5 over it, 1.01× 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.

D3 · God Classes · TooManyMethods · ×9

TooManyMethods: TreeOps scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala:20 — TooManyMethods — 116 methods. The bar is 30 methods; this is 86 over it, 3.87× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: FormatTokens scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatTokens.scala:15 — TooManyMethods — 90 methods. The bar is 30 methods; this is 60 over it, 3.00× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: JSCodePhase scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:121 — TooManyMethods — 87 methods. The bar is 30 methods; this is 57 over it, 2.90× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: OptimizerCore scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:38 — TooManyMethods — 76 methods. The bar is 30 methods; this is 46 over it, 2.53× 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.
TooManyMethods: FormatOps scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:19 — TooManyMethods — 65 methods. The bar is 30 methods; this is 35 over it, 2.17× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: CopyOnWriteArrayList scalafmt-benchmarks/src/resources/scala-js/CopyOnWriteArrayList.scala:12 — TooManyMethods — 38 methods. The bar is 30 methods; this is 8 over it, 1.27× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: ScalaJSClassEmitter scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.scala:31 — TooManyMethods — 38 methods. The bar is 30 methods; this is 8 over it, 1.27× 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.
TooManyMethods: Readme readme/src/main/scala/org/scalafmt/readme/Readme.scala:20 — TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.
TooManyMethods: LoggerOps scalafmt-core/shared/src/main/scala/org/scalafmt/util/LoggerOps.scala:19 — TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. This type is on a published API surface — a MiMa binary-compatibility gate (build.sbt) declares its compatibility contractual — so moving members onto a smaller type is a breaking change for every consumer, not a local refactor. To reduce it, treat the split as an API migration: move each cohesive group onto its own published type and keep the old members as deprecated forwards for a deprecation period, removing them at the next compatibility break. Where the surface has to stay as it is, that is a decision to record rather than a change to make.

D15 · Churn × Complexity Hotspots · Hotspot · ×4

Hotspot: scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:278 — scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in SplitsAfterLeftBrace.getRest at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-16 18:49:19 -07:00' --until='2026-10-14 18:49:19 -07:00' --full-history --no-merges -- scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.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.
Hotspot: scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:1211 — scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in FormatLocations.alignmentTokens at line 1211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-16 18:49:19 -07:00' --until='2026-10-14 18:49:19 -07:00' --full-history --no-merges -- scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.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.
Hotspot: scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala:164 — scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in RemoveScala3OptionalBraces.onRightFromBraces at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-16 18:49:19 -07:00' --until='2026-10-14 18:49:19 -07:00' --full-history --no-merges -- scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.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.
Hotspot: scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala:371 — scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ScalafmtConfig.checkErrors at line 371. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-16..2026-10-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-16 18:49:19 -07:00' --until='2026-10-14 18:49:19 -07:00' --full-history --no-merges -- scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.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 · FixmeComment · ×3

FixmeComment scalafmt-dynamic-core/src/main/scala/org/scalafmt/dynamic/ScalafmtReflect.scala:21 — // FIXME: the class does not exist for version old versions, e.g. v0.2.8 — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment scalafmt-benchmarks/src/resources/Endpoint.scala:639 — // FIXME remove these counters when tuning/testing is completed — 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 scalafmt-benchmarks/src/resources/Endpoint.scala:687 — // FIXME remove this when testing/tuning is completed — 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.

D17 · Explicit Debt · XxxComment · ×3

XxxComment scalafmt-core/shared/src/main/scala/org/scalafmt/Scalafmt.scala:30 — // XXX: don't modify signature, scalafmt-dynamic expects it via reflection — 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 scalafmt-core/shared/src/main/scala/org/scalafmt/Scalafmt.scala:140 — // XXX: don't modify signature, scalafmt-dynamic expects it via reflection — 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 scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1793 — // XXX: sometimes we have zero args, so multipleArgs != !singleArgument — 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.

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED

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

Duplicated block (6 lines × 2) scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/CliOptions.scala:173 — scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/CliOptions.scala:173-178 | scalafmt-core/shared/src/main/scala/org/scalafmt/config/FilterMatcher.scala:40-45 — 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 (6 lines × 2) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/MissingBraces.scala:109 — scalafmt-core/shared/src/main/scala/org/scalafmt/internal/MissingBraces.scala:109-114 | scalafmt-core/shared/src/main/scala/org/scalafmt/internal/MissingBraces.scala:126-131 — 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 `scalafmt-core/shared/src/main/scala/org/scalafmt/internal/MissingBraces.scala:109` 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.

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

Low cohesion: FormatOps (LCOM4 17) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:19 — FormatOps's methods fall into 17 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 17 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: CopyOnWriteArrayList (LCOM4 4) scalafmt-benchmarks/src/resources/scala-js/CopyOnWriteArrayList.scala:12 — CopyOnWriteArrayList'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.

D1 · Cyclomatic Complexity · OptimizerCore.foldBinaryOp (cyclomatic 236) · ×1

OptimizerCore.foldBinaryOp (cyclomatic 236) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:2261 — OptimizerCore.foldBinaryOp has cyclomatic complexity 236 (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 · SplitsAfterLeftParenOrBracket.getNoBinPack (cyclomatic 101) · ×1

SplitsAfterLeftParenOrBracket.getNoBinPack (cyclomatic 101) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1763 — SplitsAfterLeftParenOrBracket.getNoBinPack has cyclomatic complexity 101 (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 · JSCodePhase.genSimpleOp (cyclomatic 89) · ×1

JSCodePhase.genSimpleOp (cyclomatic 89) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:2584 — JSCodePhase.genSimpleOp has cyclomatic complexity 89 (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 · OptimizerCore.transform (cyclomatic 78) · ×1

OptimizerCore.transform (cyclomatic 78) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:256 — OptimizerCore.transform has cyclomatic complexity 78 (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 · SplitsAfterLeftBrace.getRest (cyclomatic 76) · ×1

SplitsAfterLeftBrace.getRest (cyclomatic 76) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:278 — SplitsAfterLeftBrace.getRest has cyclomatic complexity 76 (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 · SplitsBeforeDot.getSelect (cyclomatic 74) · ×1

SplitsBeforeDot.getSelect (cyclomatic 74) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2595 — SplitsBeforeDot.getSelect has cyclomatic complexity 74 (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 · InfixSplits.getBeforeLhsOrRhs (cyclomatic 61) · ×1

InfixSplits.getBeforeLhsOrRhs (cyclomatic 61) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/InfixSplits.scala:332 — InfixSplits.getBeforeLhsOrRhs has cyclomatic complexity 61 (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 · SplitsAfterLeftParenOrBracket.getArgSiteBinPack (cyclomatic 60) · ×1

SplitsAfterLeftParenOrBracket.getArgSiteBinPack (cyclomatic 60) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1512 — SplitsAfterLeftParenOrBracket.getArgSiteBinPack has cyclomatic complexity 60 (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 · JSCodePhase.genStatOrExpr (cyclomatic 52) · ×1

JSCodePhase.genStatOrExpr (cyclomatic 52) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:1345 — JSCodePhase.genStatOrExpr has cyclomatic complexity 52 (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 · OptimizerCore.callIntrinsic (cyclomatic 52) · ×1

OptimizerCore.callIntrinsic (cyclomatic 52) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:1510 — OptimizerCore.callIntrinsic has cyclomatic complexity 52 (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 · SplitsBeforeLeftParenOrBracket.get (cyclomatic 46) · ×1

SplitsBeforeLeftParenOrBracket.get (cyclomatic 46) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1237 — SplitsBeforeLeftParenOrBracket.get has cyclomatic complexity 46 (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 · FormatOps.insideInfixSplit (cyclomatic 45) · ×1

FormatOps.insideInfixSplit (cyclomatic 45) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:324 — FormatOps.insideInfixSplit has cyclomatic complexity 45 (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 · FormatOps.getSlbEndOnLeft (cyclomatic 44) · ×1

FormatOps.getSlbEndOnLeft (cyclomatic 44) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:58 — FormatOps.getSlbEndOnLeft has cyclomatic complexity 44 (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 · BestFirstSearch.shortestPath (cyclomatic 43) · ×1

BestFirstSearch.shortestPath (cyclomatic 43) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala:118 — BestFirstSearch.shortestPath has cyclomatic complexity 43 (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 · OptimizerCore.foldUnaryOp (cyclomatic 41) · ×1

OptimizerCore.foldUnaryOp (cyclomatic 41) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:2084 — OptimizerCore.foldUnaryOp has cyclomatic complexity 41 (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 · Fold.addClausesToGroup (cyclomatic 41) · ×1

Fold.addClausesToGroup (cyclomatic 41) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala:788 — Fold.addClausesToGroup has cyclomatic complexity 41 (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 · RewriteLiterals.prettyPrintFloatingPoint (cyclomatic 38) · ×1

RewriteLiterals.prettyPrintFloatingPoint (cyclomatic 38) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RewriteLiterals.scala:24 — RewriteLiterals.prettyPrintFloatingPoint 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 · SplitsAfterComma.get (cyclomatic 37) · ×1

SplitsAfterComma.get (cyclomatic 37) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2391 — SplitsAfterComma.get has cyclomatic complexity 37 (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 · RedundantBraces.onLeftBrace (cyclomatic 37) · ×1

RedundantBraces.onLeftBrace (cyclomatic 37) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:358 — RedundantBraces.onLeftBrace has cyclomatic complexity 37 (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 · RedundantParens.okToReplaceWithCount (cyclomatic 37) · ×1

RedundantParens.okToReplaceWithCount (cyclomatic 37) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantParens.scala:113 — RedundantParens.okToReplaceWithCount has cyclomatic complexity 37 (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 · JSCodePhase.genJSPrimitive (cyclomatic 36) · ×1

JSCodePhase.genJSPrimitive (cyclomatic 36) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:3292 — JSCodePhase.genJSPrimitive has cyclomatic complexity 36 (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 · TreeOps.getStyleAndOwners (cyclomatic 36) · ×1

TreeOps.getStyleAndOwners (cyclomatic 36) scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala:854 — TreeOps.getStyleAndOwners has cyclomatic complexity 36 (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 · FormatOps.verticalMultiline (cyclomatic 35) · ×1

FormatOps.verticalMultiline (cyclomatic 35) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:630 — FormatOps.verticalMultiline has cyclomatic complexity 35 (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 · FormatLocations.alignmentTokens (cyclomatic 35) · ×1

FormatLocations.alignmentTokens (cyclomatic 35) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:1211 — FormatLocations.alignmentTokens has cyclomatic complexity 35 (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 · AlignBlock.tryAppendToBlock (cyclomatic 35) · ×1

AlignBlock.tryAppendToBlock (cyclomatic 35) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:1912 — AlignBlock.tryAppendToBlock has cyclomatic complexity 35 (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 · Builder.processForStatements (cyclomatic 35) · ×1

Builder.processForStatements (cyclomatic 35) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptimizationEntities.scala:153 — Builder.processForStatements has cyclomatic complexity 35 (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 · OptimizerCore.foldIf (cyclomatic 34) · ×1

OptimizerCore.foldIf (cyclomatic 34) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:1918 — OptimizerCore.foldIf has cyclomatic complexity 34 (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 · FormatWriter.checkInsertBraces (cyclomatic 34) · ×1

FormatWriter.checkInsertBraces (cyclomatic 34) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:333 — FormatWriter.checkInsertBraces has cyclomatic complexity 34 (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 · State.next (cyclomatic 33) · ×1

State.next (cyclomatic 33) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:60 — State.next has cyclomatic complexity 33 (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 · RemoveScala3OptionalBraces.onLeftForBlock (cyclomatic 32) · ×1

RemoveScala3OptionalBraces.onLeftForBlock (cyclomatic 32) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala:284 — RemoveScala3OptionalBraces.onLeftForBlock has cyclomatic complexity 32 (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 · ConvertToNewScala3Syntax.onToken (cyclomatic 31) · ×1

ConvertToNewScala3Syntax.onToken (cyclomatic 31) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/ConvertToNewScala3Syntax.scala:31 — ConvertToNewScala3Syntax.onToken has cyclomatic complexity 31 (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 · FormatWriter.getEndMarkerLabel (cyclomatic 28) · ×1

FormatWriter.getEndMarkerLabel (cyclomatic 28) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:2155 — FormatWriter.getEndMarkerLabel 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 · OptimizerCore.pretransformExpr (cyclomatic 27) · ×1

OptimizerCore.pretransformExpr (cyclomatic 27) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:703 — OptimizerCore.pretransformExpr has cyclomatic complexity 27 (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 · FormatOps.getBinpackSiteFlags (cyclomatic 27) · ×1

FormatOps.getBinpackSiteFlags (cyclomatic 27) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1426 — FormatOps.getBinpackSiteFlags has cyclomatic complexity 27 (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 · CtrlBodySplits.foldedNonEmptyNonComment (cyclomatic 27) · ×1

CtrlBodySplits.foldedNonEmptyNonComment (cyclomatic 27) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1018 — CtrlBodySplits.foldedNonEmptyNonComment has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.

D1 · Cyclomatic Complexity · State.getOverflowPenalty (cyclomatic 27) · ×1

State.getOverflowPenalty (cyclomatic 27) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:228 — State.getOverflowPenalty has cyclomatic complexity 27 (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 · JSCodePhase.tryGenAndRecordAnonFunctionClassGeneric (cyclomatic 25) · ×1

JSCodePhase.tryGenAndRecordAnonFunctionClassGeneric (cyclomatic 25) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:4177 — JSCodePhase.tryGenAndRecordAnonFunctionClassGeneric has cyclomatic complexity 25 (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 · RedundantBraces.shouldRemoveSingleStatBlock (cyclomatic 25) · ×1

RedundantBraces.shouldRemoveSingleStatBlock (cyclomatic 25) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:716 — RedundantBraces.shouldRemoveSingleStatBlock 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 · RemoveScala3OptionalBraces.onToken (cyclomatic 25) · ×1

RemoveScala3OptionalBraces.onToken (cyclomatic 25) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala:41 — RemoveScala3OptionalBraces.onToken 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 · JSCodePhase.genApplyDynamic (cyclomatic 24) · ×1

JSCodePhase.genApplyDynamic (cyclomatic 24) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:3017 — JSCodePhase.genApplyDynamic 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 · ScalafmtConfig.checkErrors (cyclomatic 24) · ×1

ScalafmtConfig.checkErrors (cyclomatic 24) scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala:371 — ScalafmtConfig.checkErrors 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 · SplitsAfterIdent.get (cyclomatic 24) · ×1

SplitsAfterIdent.get (cyclomatic 24) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2900 — SplitsAfterIdent.get has cyclomatic complexity 24 (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 · AvoidInfix.rewriteImpl (cyclomatic 24) · ×1

AvoidInfix.rewriteImpl (cyclomatic 24) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/AvoidInfix.scala:49 — AvoidInfix.rewriteImpl has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.

D1 · Cyclomatic Complexity · ExpandBase.processImports (cyclomatic 24) · ×1

ExpandBase.processImports (cyclomatic 24) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala:554 — ExpandBase.processImports 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 · RedundantBraces.onLeftParen (cyclomatic 24) · ×1

RedundantBraces.onLeftParen (cyclomatic 24) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:192 — RedundantBraces.onLeftParen 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 · RedundantBraces.okToRemoveBlock (cyclomatic 24) · ×1

RedundantBraces.okToRemoveBlock (cyclomatic 24) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:614 — RedundantBraces.okToRemoveBlock has cyclomatic complexity 24 (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 · JSCodePhase.genMethodWithCurrentLocalNameScope (cyclomatic 23) · ×1

JSCodePhase.genMethodWithCurrentLocalNameScope (cyclomatic 23) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:1020 — JSCodePhase.genMethodWithCurrentLocalNameScope has cyclomatic complexity 23 (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 · SplitsAfterLeftParenOrBracket.getParamSiteBinPack (cyclomatic 23) · ×1

SplitsAfterLeftParenOrBracket.getParamSiteBinPack (cyclomatic 23) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1677 — SplitsAfterLeftParenOrBracket.getParamSiteBinPack 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 · TreeOps.addDialectFeatures (cyclomatic 23) · ×1

TreeOps.addDialectFeatures (cyclomatic 23) scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala:1196 — TreeOps.addDialectFeatures has cyclomatic complexity 23 (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 · Router.getSplits (cyclomatic 22) · ×1

Router.getSplits (cyclomatic 22) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Router.scala:22 — Router.getSplits 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 · SplitsBeforeStatement.get (cyclomatic 22) · ×1

SplitsBeforeStatement.get (cyclomatic 22) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:72 — SplitsBeforeStatement.get 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 · FormatTokensRewrite.getRewrittenTokens (cyclomatic 22) · ×1

FormatTokensRewrite.getRewrittenTokens (cyclomatic 22) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/FormatTokensRewrite.scala:162 — FormatTokensRewrite.getRewrittenTokens 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 · Entry.formatWhitespace (cyclomatic 21) · ×1

Entry.formatWhitespace (cyclomatic 21) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:503 — Entry.formatWhitespace has cyclomatic complexity 21 (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 · SplitsAfterFunctionArrow.functionOrSelf (cyclomatic 21) · ×1

SplitsAfterFunctionArrow.functionOrSelf (cyclomatic 21) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:870 — SplitsAfterFunctionArrow.functionOrSelf 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 · BaseLinker.linkedClassDef (cyclomatic 20) · ×1

BaseLinker.linkedClassDef (cyclomatic 20) scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala:173 — BaseLinker.linkedClassDef has cyclomatic complexity 20 (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 · BinPackOneline.policyOnRightDelim (cyclomatic 20) · ×1

BinPackOneline.policyOnRightDelim (cyclomatic 20) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1539 — BinPackOneline.policyOnRightDelim has cyclomatic complexity 20 (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 · SplitsAfterCase.getCaseTree (cyclomatic 20) · ×1

SplitsAfterCase.getCaseTree (cyclomatic 20) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:3418 — SplitsAfterCase.getCaseTree has cyclomatic complexity 20 (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 · RemoveScala3OptionalBraces.onRightFromBraces (cyclomatic 20) · ×1

RemoveScala3OptionalBraces.onRightFromBraces (cyclomatic 20) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala:164 — RemoveScala3OptionalBraces.onRightFromBraces has cyclomatic complexity 20 (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 · Division.modInverseLorencz (cyclomatic 19) · ×1

Division.modInverseLorencz (cyclomatic 19) scalafmt-benchmarks/src/resources/scala-js/Division.scala:503 — Division.modInverseLorencz 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 · JSCodePhase.genJSCallGeneric (cyclomatic 19) · ×1

JSCodePhase.genJSCallGeneric (cyclomatic 19) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:3581 — JSCodePhase.genJSCallGeneric has cyclomatic complexity 19 (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 · OptimizerCore.pretransformApply (cyclomatic 19) · ×1

OptimizerCore.pretransformApply (cyclomatic 19) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:1125 — OptimizerCore.pretransformApply 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 · FormatWriter.mkString (cyclomatic 19) · ×1

FormatWriter.mkString (cyclomatic 19) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:29 — FormatWriter.mkString 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 · FormatLocations.getAlignContainerParent (cyclomatic 19) · ×1

FormatLocations.getAlignContainerParent (cyclomatic 19) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:1359 — FormatLocations.getAlignContainerParent 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 · Imports.validateImports (cyclomatic 19) · ×1

Imports.validateImports (cyclomatic 19) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala:89 — Imports.validateImports has cyclomatic complexity 19 (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 · JSCodePhase.genClass (cyclomatic 18) · ×1

JSCodePhase.genClass (cyclomatic 18) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:286 — JSCodePhase.genClass 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 · OptimizerCore.withNewLocalDef (cyclomatic 18) · ×1

OptimizerCore.withNewLocalDef (cyclomatic 18) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:3191 — OptimizerCore.withNewLocalDef 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 · HiveMetastoreCatalog.createDataSourceTable (cyclomatic 18) · ×1

HiveMetastoreCatalog.createDataSourceTable (cyclomatic 18) scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala:213 — HiveMetastoreCatalog.createDataSourceTable has cyclomatic complexity 18 (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 · SplitsAfterLeftParen.getRest (cyclomatic 18) · ×1

SplitsAfterLeftParen.getRest (cyclomatic 18) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2107 — SplitsAfterLeftParen.getRest 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 · State.getRelativeToLhsLastLineEnd (cyclomatic 18) · ×1

State.getRelativeToLhsLastLineEnd (cyclomatic 18) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:344 — State.getRelativeToLhsLastLineEnd 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 · DefaultMessageDispatcher.dispatch (cyclomatic 17) · ×1

DefaultMessageDispatcher.dispatch (cyclomatic 17) scalafmt-benchmarks/src/resources/Endpoint.scala:50 — DefaultMessageDispatcher.dispatch 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 · JSCodePhase.apply (cyclomatic 17) · ×1

JSCodePhase.apply (cyclomatic 17) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:191 — JSCodePhase.apply 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 · ScalaJSClassEmitter.genInstanceTests (cyclomatic 17) · ×1

ScalaJSClassEmitter.genInstanceTests (cyclomatic 17) scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.scala:481 — ScalaJSClassEmitter.genInstanceTests 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 · FormatWriter.checkRemoveEndMarkers (cyclomatic 17) · ×1

FormatWriter.checkRemoveEndMarkers (cyclomatic 17) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:219 — FormatWriter.checkRemoveEndMarkers 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 · FormatMlDoc.formatTerm (cyclomatic 17) · ×1

FormatMlDoc.formatTerm (cyclomatic 17) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:930 — FormatMlDoc.formatTerm 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 · ColonEolImpl.onArgClause (cyclomatic 17) · ×1

ColonEolImpl.onArgClause (cyclomatic 17) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala:169 — ColonEolImpl.onArgClause 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. This is NOT this file's highest cyclomatic complexity: OptionalBraces.getWithBrace (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.

D1 · Cyclomatic Complexity · SplitsBeforeLeftBrace.get (cyclomatic 17) · ×1

SplitsBeforeLeftBrace.get (cyclomatic 17) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:743 — SplitsBeforeLeftBrace.get 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 · RedundantBraces.onRightBrace (cyclomatic 17) · ×1

RedundantBraces.onRightBrace (cyclomatic 17) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:430 — RedundantBraces.onRightBrace 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 · EndpointWriter.sendBufferedMessages (cyclomatic 16) · ×1

EndpointWriter.sendBufferedMessages (cyclomatic 16) scalafmt-benchmarks/src/resources/Endpoint.scala:657 — EndpointWriter.sendBufferedMessages 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 · MethodInfo.doReach (cyclomatic 16) · ×1

MethodInfo.doReach (cyclomatic 16) scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala:741 — MethodInfo.doReach has cyclomatic complexity 16 (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 · FormatWriter.getFormatLocations (cyclomatic 16) · ×1

FormatWriter.getFormatLocations (cyclomatic 16) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:101 — FormatWriter.getFormatLocations 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 · RedundantBraces.canRewriteStatWithParens (cyclomatic 16) · ×1

RedundantBraces.canRewriteStatWithParens (cyclomatic 16) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:43 — RedundantBraces.canRewriteStatWithParens 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.

D17 · Explicit Debt · HackComment · ×1

HackComment scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:475 — // Hack to allow any annotations with arguments like @foo(1) — 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.

D2 · Cognitive Complexity · OptimizerCore.foldBinaryOp (cognitive 222) · ×1

OptimizerCore.foldBinaryOp (cognitive 222) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:2261 — OptimizerCore.foldBinaryOp has cognitive complexity 222 (threshold 15). Drivers by points: if/else 71 (106 pts), match/switch 49 (104 pts), boolean chains 12 (nesting depth added 90). 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 · SplitsAfterLeftParenOrBracket.getNoBinPack (cognitive 152) · ×1

SplitsAfterLeftParenOrBracket.getNoBinPack (cognitive 152) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1763 — SplitsAfterLeftParenOrBracket.getNoBinPack has cognitive complexity 152 (threshold 15). Drivers by points: if/else 68 (88 pts), boolean chains 53, match/switch 7 (11 pts) (nesting depth added 24). 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 · SplitsBeforeDot.getSelect (cognitive 145) · ×1

SplitsBeforeDot.getSelect (cognitive 145) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2595 — SplitsBeforeDot.getSelect has cognitive complexity 145 (threshold 15). Drivers by points: if/else 68 (102 pts), boolean chains 22, match/switch 9 (21 pts) (nesting depth added 46). 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 · SplitsAfterLeftBrace.getRest (cognitive 133) · ×1

SplitsAfterLeftBrace.getRest (cognitive 133) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:278 — SplitsAfterLeftBrace.getRest has cognitive complexity 133 (threshold 15). Drivers by points: if/else 65 (85 pts), match/switch 17 (31 pts), boolean chains 17 (nesting depth added 34). 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 · BestFirstSearch.shortestPath (cognitive 115) · ×1

BestFirstSearch.shortestPath (cognitive 115) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala:118 — BestFirstSearch.shortestPath has cognitive complexity 115 (threshold 15). Drivers by points: if/else 39 (90 pts), boolean chains 13, match/switch 1 (7 pts), loops 2 (5 pts) (nesting depth added 60). 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 · InfixSplits.getBeforeLhsOrRhs (cognitive 103) · ×1

InfixSplits.getBeforeLhsOrRhs (cognitive 103) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/InfixSplits.scala:332 — InfixSplits.getBeforeLhsOrRhs has cognitive complexity 103 (threshold 15). Drivers by points: if/else 54 (72 pts), boolean chains 25, match/switch 5 (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 · SplitsAfterLeftParenOrBracket.getArgSiteBinPack (cognitive 97) · ×1

SplitsAfterLeftParenOrBracket.getArgSiteBinPack (cognitive 97) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1512 — SplitsAfterLeftParenOrBracket.getArgSiteBinPack has cognitive complexity 97 (threshold 15). Drivers by points: if/else 49 (61 pts), boolean chains 24, match/switch 6 (12 pts) (nesting depth added 18). 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 · State.next (cognitive 93) · ×1

State.next (cognitive 93) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:60 — State.next has cognitive complexity 93 (threshold 15). Drivers by points: if/else 42 (81 pts), loops 2 (6 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 44). 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 · SplitsBeforeLeftParenOrBracket.get (cognitive 90) · ×1

SplitsBeforeLeftParenOrBracket.get (cognitive 90) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1237 — SplitsBeforeLeftParenOrBracket.get has cognitive complexity 90 (threshold 15). Drivers by points: if/else 37 (54 pts), match/switch 11 (28 pts), boolean chains 8 (nesting depth added 34). 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 · TreeOps.getStyleAndOwners (cognitive 86) · ×1

TreeOps.getStyleAndOwners (cognitive 86) scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala:854 — TreeOps.getStyleAndOwners has cognitive complexity 86 (threshold 15). Drivers by points: if/else 30 (73 pts), boolean chains 8, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 45). 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 · JSCodePhase.genSimpleOp (cognitive 81) · ×1

JSCodePhase.genSimpleOp (cognitive 81) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:2584 — JSCodePhase.genSimpleOp has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (41 pts), match/switch 13 (36 pts), boolean chains 4 (nesting depth added 39). 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 · FormatOps.insideInfixSplit (cognitive 75) · ×1

FormatOps.insideInfixSplit (cognitive 75) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:324 — FormatOps.insideInfixSplit has cognitive complexity 75 (threshold 15). Drivers by points: if/else 35 (46 pts), boolean chains 16, match/switch 7 (13 pts) (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 · FormatLocations.alignmentTokens (cognitive 74) · ×1

FormatLocations.alignmentTokens (cognitive 74) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:1211 — FormatLocations.alignmentTokens has cognitive complexity 74 (threshold 15). Drivers by points: if/else 21 (58 pts), boolean chains 14, loops 1 (2 pts) (nesting depth added 38). 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 · OptimizerCore.transform (cognitive 71) · ×1

OptimizerCore.transform (cognitive 71) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:256 — OptimizerCore.transform has cognitive complexity 71 (threshold 15). Drivers by points: if/else 27 (41 pts), match/switch 13 (29 pts), boolean chains 1 (nesting depth added 30). 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 · RewriteLiterals.prettyPrintFloatingPoint (cognitive 67) · ×1

RewriteLiterals.prettyPrintFloatingPoint (cognitive 67) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RewriteLiterals.scala:24 — RewriteLiterals.prettyPrintFloatingPoint has cognitive complexity 67 (threshold 15). Drivers by points: if/else 42 (57 pts), boolean chains 8, match/switch 1 (2 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 · OptimizerCore.pretransformApply (cognitive 61) · ×1

OptimizerCore.pretransformApply (cognitive 61) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:1125 — OptimizerCore.pretransformApply has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (33 pts), match/switch 5 (25 pts), boolean chains 3 (nesting depth added 35). 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 · JSCodePhase.genStatOrExpr (cognitive 59) · ×1

JSCodePhase.genStatOrExpr (cognitive 59) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:1345 — JSCodePhase.genStatOrExpr has cognitive complexity 59 (threshold 15). Drivers by points: if/else 29 (48 pts), match/switch 5 (9 pts), boolean chains 2 (nesting depth added 23). 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 · FormatOps.getSlbEndOnLeft (cognitive 57) · ×1

FormatOps.getSlbEndOnLeft (cognitive 57) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:58 — FormatOps.getSlbEndOnLeft has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (31 pts), match/switch 8 (19 pts), boolean chains 7 (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 · SplitsAfterComma.get (cognitive 57) · ×1

SplitsAfterComma.get (cognitive 57) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2391 — SplitsAfterComma.get has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 15, match/switch 4 (9 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 · SplitsAfterLeftParenOrBracket.getParamSiteBinPack (cognitive 55) · ×1

SplitsAfterLeftParenOrBracket.getParamSiteBinPack (cognitive 55) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1677 — SplitsAfterLeftParenOrBracket.getParamSiteBinPack has cognitive complexity 55 (threshold 15). Drivers by points: if/else 29 (46 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 21). 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 · JSCodePhase.genJSPrimitive (cognitive 53) · ×1

JSCodePhase.genJSPrimitive (cognitive 53) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:3292 — JSCodePhase.genJSPrimitive has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 11 (30 pts), if/else 16 (21 pts), boolean chains 2 (nesting depth added 24). 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 · CtrlBodySplits.foldedNonEmptyNonComment (cognitive 53) · ×1

CtrlBodySplits.foldedNonEmptyNonComment (cognitive 53) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1018 — CtrlBodySplits.foldedNonEmptyNonComment has cognitive complexity 53 (threshold 15). Drivers by points: if/else 29 (40 pts), match/switch 5 (9 pts), boolean chains 4 (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 · FormatWriter.checkInsertBraces (cognitive 51) · ×1

FormatWriter.checkInsertBraces (cognitive 51) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:333 — FormatWriter.checkInsertBraces has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (28 pts), boolean chains 16, match/switch 4 (7 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 · JSCodePhase.genApplyDynamic (cognitive 49) · ×1

JSCodePhase.genApplyDynamic (cognitive 49) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:3017 — JSCodePhase.genApplyDynamic has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 10, match/switch 2 (8 pts), loops 1 (2 pts) (nesting depth added 22). 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 · FormatOps.verticalMultiline (cognitive 49) · ×1

FormatOps.verticalMultiline (cognitive 49) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:630 — FormatOps.verticalMultiline has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25 (31 pts), boolean chains 9, match/switch 6 (9 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 · RedundantBraces.onLeftBrace (cognitive 49) · ×1

RedundantBraces.onLeftBrace (cognitive 49) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:358 — RedundantBraces.onLeftBrace has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 11, match/switch 4 (8 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 · OptimizerCore.callIntrinsic (cognitive 46) · ×1

OptimizerCore.callIntrinsic (cognitive 46) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:1510 — OptimizerCore.callIntrinsic has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 12 (25 pts), if/else 17 (21 pts) (nesting depth added 17). 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 · Fold.addClausesToGroup (cognitive 46) · ×1

Fold.addClausesToGroup (cognitive 46) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala:788 — Fold.addClausesToGroup has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 9, match/switch 5 (8 pts), loops 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 · AlignBlock.tryAppendToBlock (cognitive 45) · ×1

AlignBlock.tryAppendToBlock (cognitive 45) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:1912 — AlignBlock.tryAppendToBlock has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 15, match/switch 2 (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 · TreeOps.addDialectFeatures (cognitive 45) · ×1

TreeOps.addDialectFeatures (cognitive 45) scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala:1196 — TreeOps.addDialectFeatures has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 11 (24 pts), if/else 15 (18 pts), boolean chains 3 (nesting depth added 16). 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 · Division.modInverseLorencz (cognitive 44) · ×1

Division.modInverseLorencz (cognitive 44) scalafmt-benchmarks/src/resources/scala-js/Division.scala:503 — Division.modInverseLorencz has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (41 pts), boolean chains 2, loops 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 · State.getOverflowPenalty (cognitive 44) · ×1

State.getOverflowPenalty (cognitive 44) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:228 — State.getOverflowPenalty has cognitive complexity 44 (threshold 15). Drivers by points: if/else 25 (31 pts), boolean chains 8, match/switch 2 (5 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 · RedundantBraces.onLeftParen (cognitive 43) · ×1

RedundantBraces.onLeftParen (cognitive 43) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:192 — RedundantBraces.onLeftParen has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (25 pts), match/switch 6 (13 pts), boolean chains 5 (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 · OptimizerCore.foldIf (cognitive 42) · ×1

OptimizerCore.foldIf (cognitive 42) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:1918 — OptimizerCore.foldIf has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 20, if/else 10 (15 pts), match/switch 3 (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 · FormatTokensRewrite.getRewrittenTokens (cognitive 39) · ×1

FormatTokensRewrite.getRewrittenTokens (cognitive 39) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/FormatTokensRewrite.scala:162 — FormatTokensRewrite.getRewrittenTokens has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (34 pts), boolean chains 2, match/switch 2, loops 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 · JSCodePhase.tryGenAndRecordAnonFunctionClassGeneric (cognitive 38) · ×1

JSCodePhase.tryGenAndRecordAnonFunctionClassGeneric (cognitive 38) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:4177 — JSCodePhase.tryGenAndRecordAnonFunctionClassGeneric has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 6, error handling 1, 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 · OptimizerCore.tryOptimizePatternMatch (cognitive 37) · ×1

OptimizerCore.tryOptimizePatternMatch (cognitive 37) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:3094 — OptimizerCore.tryOptimizePatternMatch has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 4 (14 pts) (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 · FormatOps.getBinpackSiteFlags (cognitive 37) · ×1

FormatOps.getBinpackSiteFlags (cognitive 37) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1426 — FormatOps.getBinpackSiteFlags has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 15, match/switch 3 (5 pts) (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 · ExpandBase.processImports (cognitive 37) · ×1

ExpandBase.processImports (cognitive 37) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala:554 — ExpandBase.processImports has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (28 pts), match/switch 4 (6 pts), boolean chains 3 (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 · Entry.formatWhitespace (cognitive 36) · ×1

Entry.formatWhitespace (cognitive 36) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:503 — Entry.formatWhitespace has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 9, match/switch 3 (7 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 · JSCodePhase.genMethodWithCurrentLocalNameScope (cognitive 35) · ×1

JSCodePhase.genMethodWithCurrentLocalNameScope (cognitive 35) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:1020 — JSCodePhase.genMethodWithCurrentLocalNameScope has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 9, match/switch 1 (2 pts), loops 1 (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 · SplitsBeforeRightArrow.get (cognitive 35) · ×1

SplitsBeforeRightArrow.get (cognitive 35) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:1057 — SplitsBeforeRightArrow.get has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 7 (22 pts), if/else 9 (12 pts), boolean chains 1 (nesting depth added 18). 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 · SplitsAfterLeftParen.getRest (cognitive 35) · ×1

SplitsAfterLeftParen.getRest (cognitive 35) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2107 — SplitsAfterLeftParen.getRest has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 5, match/switch 3 (5 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 · ConvertToNewScala3Syntax.onToken (cognitive 35) · ×1

ConvertToNewScala3Syntax.onToken (cognitive 35) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/ConvertToNewScala3Syntax.scala:31 — ConvertToNewScala3Syntax.onToken has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 12, boolean chains 8 (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 · OptimizerCore.pretransformExpr (cognitive 34) · ×1

OptimizerCore.pretransformExpr (cognitive 34) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:703 — OptimizerCore.pretransformExpr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 6 (13 pts), loops 1 (2 pts), boolean chains 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 · SplitsBeforeStatement.get (cognitive 34) · ×1

SplitsBeforeStatement.get (cognitive 34) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:72 — SplitsBeforeStatement.get has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 12, match/switch 2 (6 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 · SplitsBeforeLeftBrace.get (cognitive 33) · ×1

SplitsBeforeLeftBrace.get (cognitive 33) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:743 — SplitsBeforeLeftBrace.get has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 2 (6 pts), boolean chains 3 (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 · RemoveScala3OptionalBraces.onToken (cognitive 33) · ×1

RemoveScala3OptionalBraces.onToken (cognitive 33) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala:41 — RemoveScala3OptionalBraces.onToken has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 5 (12 pts), boolean chains 3 (nesting depth added 13). 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 · ScalaJSClassEmitter.genInstanceTests (cognitive 32) · ×1

ScalaJSClassEmitter.genInstanceTests (cognitive 32) scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.scala:481 — ScalaJSClassEmitter.genInstanceTests has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6, match/switch 2 (5 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 · AvoidInfix.rewriteImpl (cognitive 32) · ×1

AvoidInfix.rewriteImpl (cognitive 32) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/AvoidInfix.scala:49 — AvoidInfix.rewriteImpl has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 5 (9 pts), boolean chains 6 (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 · RemoveScala3OptionalBraces.onLeftForBlock (cognitive 32) · ×1

RemoveScala3OptionalBraces.onLeftForBlock (cognitive 32) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala:284 — RemoveScala3OptionalBraces.onLeftForBlock has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 5 (9 pts), boolean chains 2 (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 · Division.divide (cognitive 31) · ×1

Division.divide (cognitive 31) scalafmt-benchmarks/src/resources/scala-js/Division.scala:80 — Division.divide has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (5 pts) (nesting depth added 17). 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 · OptimizerCore.foldUnaryOp (cognitive 31) · ×1

OptimizerCore.foldUnaryOp (cognitive 31) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:2084 — OptimizerCore.foldUnaryOp has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 9 (18 pts), if/else 11 (13 pts) (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 · OptimizerCore.withNewLocalDef (cognitive 30) · ×1

OptimizerCore.withNewLocalDef (cognitive 30) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:3191 — OptimizerCore.withNewLocalDef has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 5 (11 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 · FormatWriter.checkRemoveEndMarkers (cognitive 30) · ×1

FormatWriter.checkRemoveEndMarkers (cognitive 30) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:219 — FormatWriter.checkRemoveEndMarkers has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 3 (5 pts), boolean chains 3 (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 · SplitsAfterFunctionArrow.functionOrSelf (cognitive 30) · ×1

SplitsAfterFunctionArrow.functionOrSelf (cognitive 30) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:870 — SplitsAfterFunctionArrow.functionOrSelf has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 5 (9 pts), boolean chains 6 (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 · SplitsAfterIdent.get (cognitive 30) · ×1

SplitsAfterIdent.get (cognitive 30) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2900 — SplitsAfterIdent.get has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5 (12 pts), boolean chains 6 (nesting depth added 10). 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 · SplitsAfterCase.getCaseTree (cognitive 30) · ×1

SplitsAfterCase.getCaseTree (cognitive 30) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:3418 — SplitsAfterCase.getCaseTree has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 6, 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 · RedundantBraces.shouldRemoveSingleStatBlock (cognitive 30) · ×1

RedundantBraces.shouldRemoveSingleStatBlock (cognitive 30) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:716 — RedundantBraces.shouldRemoveSingleStatBlock has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 8 (19 pts), if/else 8, 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 · Router.getSplits (cognitive 29) · ×1

Router.getSplits (cognitive 29) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Router.scala:22 — Router.getSplits has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20 (23 pts), match/switch 3 (4 pts), boolean chains 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 · State.getRelativeToLhsLastLineEnd (cognitive 29) · ×1

State.getRelativeToLhsLastLineEnd (cognitive 29) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:344 — State.getRelativeToLhsLastLineEnd has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 6, match/switch 3 (6 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 · TreeOps.findEnclosedBetweenParens (cognitive 29) · ×1

TreeOps.findEnclosedBetweenParens (cognitive 29) scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala:825 — TreeOps.findEnclosedBetweenParens has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 2 (nesting depth added 14). 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 · MethodInfo.doReach (cognitive 28) · ×1

MethodInfo.doReach (cognitive 28) scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala:741 — MethodInfo.doReach has cognitive complexity 28 (threshold 15). Drivers by points: loops 11 (17 pts), if/else 5 (11 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 · FormatWriter.checkInsertEndMarkers (cognitive 28) · ×1

FormatWriter.checkInsertEndMarkers (cognitive 28) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:285 — FormatWriter.checkInsertEndMarkers has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 16). 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 · Builder.processForStatements (cognitive 28) · ×1

Builder.processForStatements (cognitive 28) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptimizationEntities.scala:153 — Builder.processForStatements has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 4 (8 pts), boolean chains 4 (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 · ColonEolImpl.onArgClause (cognitive 28) · ×1

ColonEolImpl.onArgClause (cognitive 28) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala:169 — ColonEolImpl.onArgClause has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 6 (10 pts), boolean chains 5 (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 · SplitsAfterInterpolationStart.get (cognitive 28) · ×1

SplitsAfterInterpolationStart.get (cognitive 28) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:117 — SplitsAfterInterpolationStart.get has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 5 (11 pts), boolean chains 2 (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 · SplitsBeforeIf.get (cognitive 28) · ×1

SplitsBeforeIf.get (cognitive 28) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:3111 — SplitsBeforeIf.get has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 4 (9 pts) (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 · RedundantParens.okToReplaceWithCount (cognitive 28) · ×1

RedundantParens.okToReplaceWithCount (cognitive 28) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantParens.scala:113 — RedundantParens.okToReplaceWithCount has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (11 pts), boolean chains 9, if/else 7 (8 pts) (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 · DefaultMessageDispatcher.dispatch (cognitive 27) · ×1

DefaultMessageDispatcher.dispatch (cognitive 27) scalafmt-benchmarks/src/resources/Endpoint.scala:50 — DefaultMessageDispatcher.dispatch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, match/switch 2 (3 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 · Primality.nextProbablePrime (cognitive 27) · ×1

Primality.nextProbablePrime (cognitive 27) scalafmt-benchmarks/src/resources/scala-js/Primality.scala:164 — Primality.nextProbablePrime has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 7 (12 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 · ScalafmtConfig.checkErrors (cognitive 27) · ×1

ScalafmtConfig.checkErrors (cognitive 27) scalafmt-core/shared/src/main/scala/org/scalafmt/config/ScalafmtConfig.scala:371 — ScalafmtConfig.checkErrors has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 10, match/switch 1 (2 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 · Primality.millerRabin (cognitive 26) · ×1

Primality.millerRabin (cognitive 26) scalafmt-benchmarks/src/resources/scala-js/Primality.scala:243 — Primality.millerRabin has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (7 pts), boolean chains 2 (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 · BinPackOneline.policyOnRightDelim (cognitive 26) · ×1

BinPackOneline.policyOnRightDelim (cognitive 26) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1539 — BinPackOneline.policyOnRightDelim has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 5 (8 pts), boolean chains 5 (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 · FormatMlc.format (cognitive 26) · ×1

FormatMlc.format (cognitive 26) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:773 — FormatMlc.format has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, loops 2 (5 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 · SplitsAfterEqualsLeftArrow.getSplitsEnumerator (cognitive 26) · ×1

SplitsAfterEqualsLeftArrow.getSplitsEnumerator (cognitive 26) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:703 — SplitsAfterEqualsLeftArrow.getSplitsEnumerator has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2 (5 pts), boolean chains 2 (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 · Imports.validateImports (cognitive 26) · ×1

Imports.validateImports (cognitive 26) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala:89 — Imports.validateImports has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 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 · RedundantBraces.onRightBrace (cognitive 26) · ×1

RedundantBraces.onRightBrace (cognitive 26) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:430 — RedundantBraces.onRightBrace has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 6 (14 pts), boolean chains 6, if/else 6 (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 · FormatLocations.getAlignContainerParent (cognitive 25) · ×1

FormatLocations.getAlignContainerParent (cognitive 25) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:1359 — FormatLocations.getAlignContainerParent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 3 (5 pts), boolean chains 1 (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 · SplitsAfterLeftParen.getLambdaAsSingleArg (cognitive 25) · ×1

SplitsAfterLeftParen.getLambdaAsSingleArg (cognitive 25) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2174 — SplitsAfterLeftParen.getLambdaAsSingleArg has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 4, 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 · ConvertToNewScala3Syntax.onRight (cognitive 25) · ×1

ConvertToNewScala3Syntax.onRight (cognitive 25) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/ConvertToNewScala3Syntax.scala:120 — ConvertToNewScala3Syntax.onRight has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). 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 · OptimizerCore.fold3WayComparison (cognitive 24) · ×1

OptimizerCore.fold3WayComparison (cognitive 24) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:2873 — OptimizerCore.fold3WayComparison has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (24 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 · OptimizerCore.returnable (cognitive 24) · ×1

OptimizerCore.returnable (cognitive 24) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:3011 — OptimizerCore.returnable has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (6 pts), boolean chains 2 (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 · FormatWriter.getFormatLocations (cognitive 24) · ×1

FormatWriter.getFormatLocations (cognitive 24) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:101 — FormatWriter.getFormatLocations has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 1, match/switch 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 · SplitsBeforeCommentLowPriority.get (cognitive 24) · ×1

SplitsBeforeCommentLowPriority.get (cognitive 24) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:3711 — SplitsBeforeCommentLowPriority.get has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 3 (6 pts), boolean chains 2 (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 · RemoveScala3OptionalBraces.onRightFromBraces (cognitive 24) · ×1

RemoveScala3OptionalBraces.onRightFromBraces (cognitive 24) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RemoveScala3OptionalBraces.scala:164 — RemoveScala3OptionalBraces.onRightFromBraces has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9, boolean chains 8, match/switch 5 (7 pts) (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 · JSCodePhase.apply (cognitive 23) · ×1

JSCodePhase.apply (cognitive 23) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:191 — JSCodePhase.apply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, loops 2, match/switch 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 · Entry.formatMarginized (cognitive 23) · ×1

Entry.formatMarginized (cognitive 23) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:576 — Entry.formatMarginized has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (2 pts), match/switch 2, boolean chains 1 (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 · EndpointWriter.sendBufferedMessages (cognitive 22) · ×1

EndpointWriter.sendBufferedMessages (cognitive 22) scalafmt-benchmarks/src/resources/Endpoint.scala:657 — EndpointWriter.sendBufferedMessages has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, 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 · CreateTables.apply (cognitive 22) · ×1

CreateTables.apply (cognitive 22) scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala:605 — CreateTables.apply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, 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 · FormatWriter.replaceRedundantBraces (cognitive 22) · ×1

FormatWriter.replaceRedundantBraces (cognitive 22) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:150 — FormatWriter.replaceRedundantBraces has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (17 pts), boolean chains 4, loops 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 · ExtraBlankTokens.setTopStats (cognitive 22) · ×1

ExtraBlankTokens.setTopStats (cognitive 22) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:1501 — ExtraBlankTokens.setTopStats has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 3 (4 pts), boolean chains 1 (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 · SplitsWithOptionalNL.get (cognitive 22) · ×1

SplitsWithOptionalNL.get (cognitive 22) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:3804 — SplitsWithOptionalNL.get has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (4 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 · MarkdownParser.transformMdoc (cognitive 22) · ×1

MarkdownParser.transformMdoc (cognitive 22) scalafmt-core/shared/src/main/scala/org/scalafmt/util/MarkdownParser.scala:13 — MarkdownParser.transformMdoc has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (5 pts), boolean chains 1, loops 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 · Division.slidingWindow (cognitive 21) · ×1

Division.slidingWindow (cognitive 21) scalafmt-benchmarks/src/resources/scala-js/Division.scala:835 — Division.slidingWindow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (8 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 · JSCodePhase.genClass (cognitive 21) · ×1

JSCodePhase.genClass (cognitive 21) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:286 — JSCodePhase.genClass has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 6, match/switch 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 · FormatOps.getForceConfigStyle (cognitive 21) · ×1

FormatOps.getForceConfigStyle (cognitive 21) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:591 — FormatOps.getForceConfigStyle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 pts), boolean chains 3 (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 · FormatWriter.mkString (cognitive 21) · ×1

FormatWriter.mkString (cognitive 21) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:29 — FormatWriter.mkString has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (20 pts), 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 · FormatMlDoc.formatTerm (cognitive 21) · ×1

FormatMlDoc.formatTerm (cognitive 21) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:930 — FormatMlDoc.formatTerm has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (4 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 · Base.getImporteesToKeep (cognitive 21) · ×1

Base.getImporteesToKeep (cognitive 21) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala:455 — Base.getImporteesToKeep has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 1 (2 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 · RedundantBraces.getBlockToReplaceAsFuncBodyInSingleArgApply (cognitive 21) · ×1

RedundantBraces.getBlockToReplaceAsFuncBodyInSingleArgApply (cognitive 21) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:511 — RedundantBraces.getBlockToReplaceAsFuncBodyInSingleArgApply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (6 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 · BaseLinker.linkInternal (cognitive 20) · ×1

BaseLinker.linkInternal (cognitive 20) scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala:89 — BaseLinker.linkInternal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (2 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 · BaseLinker.linkedClassDef (cognitive 20) · ×1

BaseLinker.linkedClassDef (cognitive 20) scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala:173 — BaseLinker.linkedClassDef has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (3 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 · ClassInfo.instantiated (cognitive 19) · ×1

ClassInfo.instantiated (cognitive 19) scalafmt-benchmarks/src/resources/scala-js/Analyzer.scala:583 — ClassInfo.instantiated has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (6 pts), boolean chains 2 (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 · JSCodePhase.genTry (cognitive 19) · ×1

JSCodePhase.genTry (cognitive 19) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:1681 — JSCodePhase.genTry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (7 pts), boolean chains 1 (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 · JSCodePhase.genJSCallGeneric (cognitive 19) · ×1

JSCodePhase.genJSCallGeneric (cognitive 19) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:3581 — JSCodePhase.genJSCallGeneric has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, match/switch 3 (5 pts) (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 · CtrlBodySplits.unfoldedNonComment (cognitive 19) · ×1

CtrlBodySplits.unfoldedNonComment (cognitive 19) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1169 — CtrlBodySplits.unfoldedNonComment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 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 · FormatMlDoc.formatNoWrap (cognitive 19) · ×1

FormatMlDoc.formatNoWrap (cognitive 19) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:1159 — FormatMlDoc.formatNoWrap has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (19 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 · SplitsAfterRightArrow.caseTree (cognitive 19) · ×1

SplitsAfterRightArrow.caseTree (cognitive 19) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:982 — SplitsAfterRightArrow.caseTree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, match/switch 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 · SplitsAfterTryCatchFinally.getOneLineTry (cognitive 19) · ×1

SplitsAfterTryCatchFinally.getOneLineTry (cognitive 19) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:3536 — SplitsAfterTryCatchFinally.getOneLineTry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 1 (3 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 · FormatTokensRewrite.mergeWhitespaceLeftToRight (cognitive 19) · ×1

FormatTokensRewrite.mergeWhitespaceLeftToRight (cognitive 19) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/FormatTokensRewrite.scala:601 — FormatTokensRewrite.mergeWhitespaceLeftToRight has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 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 · TreeOps.getSingleArgOnLeftBraceOnLeft (cognitive 19) · ×1

TreeOps.getSingleArgOnLeftBraceOnLeft (cognitive 19) scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala:401 — TreeOps.getSingleArgOnLeftBraceOnLeft has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (8 pts) (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 · Division.divideArrayByInt (cognitive 18) · ×1

Division.divideArrayByInt (cognitive 18) scalafmt-benchmarks/src/resources/scala-js/Division.scala:227 — Division.divideArrayByInt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). 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 · ScalaJSClassEmitter.genTypeData (cognitive 18) · ×1

ScalaJSClassEmitter.genTypeData (cognitive 18) scalafmt-benchmarks/src/resources/scala-js/ScalaJSClassEmitter.scala:653 — ScalaJSClassEmitter.genTypeData has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3 (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 · Utils.printEscapeJS (cognitive 18) · ×1

Utils.printEscapeJS (cognitive 18) scalafmt-benchmarks/src/resources/scala-js/Utils.scala:75 — Utils.printEscapeJS has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 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 · ScalafmtRunner.runInputs (cognitive 18) · ×1

ScalafmtRunner.runInputs (cognitive 18) scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/ScalafmtRunner.scala:100 — ScalafmtRunner.runInputs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (3 pts) (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 · BestFirstSearch.processOptimalToken (cognitive 18) · ×1

BestFirstSearch.processOptimalToken (cognitive 18) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala:260 — BestFirstSearch.processOptimalToken has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 2 (3 pts), boolean chains 1 (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 · FormatOps.binPackParentConstructorSplits (cognitive 18) · ×1

FormatOps.binPackParentConstructorSplits (cognitive 18) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:526 — FormatOps.binPackParentConstructorSplits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (3 pts), boolean chains 2 (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 · CatchImpl.create (cognitive 18) · ×1

CatchImpl.create (cognitive 18) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala:497 — CatchImpl.create has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), boolean chains 4, if/else 4 (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 · SplitsBeforeColon.get (cognitive 18) · ×1

SplitsBeforeColon.get (cognitive 18) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:2314 — SplitsBeforeColon.get has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 2 (3 pts) (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 · OptimizerCore.pretransformStaticApply (cognitive 17) · ×1

OptimizerCore.pretransformStaticApply (cognitive 17) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:1230 — OptimizerCore.pretransformStaticApply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 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 · FormatOps.insideBracesBlockIfBracesToParens (cognitive 17) · ×1

FormatOps.insideBracesBlockIfBracesToParens (cognitive 17) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala:1641 — FormatOps.insideBracesBlockIfBracesToParens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (4 pts), boolean chains 3 (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 · FormatMlDoc.formatCodeBlock (cognitive 17) · ×1

FormatMlDoc.formatCodeBlock (cognitive 17) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:1054 — FormatMlDoc.formatCodeBlock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), 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.

D2 · Cognitive Complexity · FormatWriter.getEndMarkerLabel (cognitive 17) · ×1

FormatWriter.getEndMarkerLabel (cognitive 17) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala:2155 — FormatWriter.getEndMarkerLabel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (7 pts) (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 · SplitsAfterElse.get (cognitive 17) · ×1

SplitsAfterElse.get (cognitive 17) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:3340 — SplitsAfterElse.get has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (6 pts), boolean chains 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 · FormatTokensRewrite.rewrite (cognitive 17) · ×1

FormatTokensRewrite.rewrite (cognitive 17) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/FormatTokensRewrite.scala:35 — FormatTokensRewrite.rewrite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), 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 · RedundantBraces.checkValidInfixParent (cognitive 17) · ×1

RedundantBraces.checkValidInfixParent (cognitive 17) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:579 — RedundantBraces.checkValidInfixParent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, match/switch 3 (5 pts) (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 · RedundantBraces.okToRemoveBlock (cognitive 17) · ×1

RedundantBraces.okToRemoveBlock (cognitive 17) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:614 — RedundantBraces.okToRemoveBlock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 3 (6 pts), boolean chains 5 (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 · Division.modInverseMontgomery (cognitive 16) · ×1

Division.modInverseMontgomery (cognitive 16) scalafmt-benchmarks/src/resources/scala-js/Division.scala:586 — Division.modInverseMontgomery has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (3 pts) (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 · JSCodePhase.genMethodDef (cognitive 16) · ×1

JSCodePhase.genMethodDef (cognitive 16) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:1234 — JSCodePhase.genMethodDef has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), loops 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 · JSCodePhase.genApplyTypeApply (cognitive 16) · ×1

JSCodePhase.genApplyTypeApply (cognitive 16) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:1827 — JSCodePhase.genApplyTypeApply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, match/switch 1 (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 · JSCodePhase.genEqEqPrimitive (cognitive 16) · ×1

JSCodePhase.genEqEqPrimitive (cognitive 16) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:2784 — JSCodePhase.genEqEqPrimitive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 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 · OptimizerCore.pretransformSelectCommon (cognitive 16) · ×1

OptimizerCore.pretransformSelectCommon (cognitive 16) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:924 — OptimizerCore.pretransformSelectCommon has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 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 · HiveMetastoreCatalog.createDataSourceTable (cognitive 16) · ×1

HiveMetastoreCatalog.createDataSourceTable (cognitive 16) scalafmt-benchmarks/src/resources/spark/HiveMetastoreCatalog.scala:213 — HiveMetastoreCatalog.createDataSourceTable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, error handling 1 (2 pts), match/switch 2 (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 · CliOptions.auto (cognitive 16) · ×1

CliOptions.auto (cognitive 16) scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/CliOptions.scala:30 — CliOptions.auto has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, match/switch 1 (2 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 · BestFirstSearch.getActiveSplits (cognitive 16) · ×1

BestFirstSearch.getActiveSplits (cognitive 16) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/BestFirstSearch.scala:298 — BestFirstSearch.getActiveSplits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2 (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 · RightParenImpl.create (cognitive 16) · ×1

RightParenImpl.create (cognitive 16) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala:284 — RightParenImpl.create has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, match/switch 2 (3 pts) (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 · SplitsAfterEquals.getSplitsDefValEquals (cognitive 16) · ×1

SplitsAfterEquals.getSplitsDefValEquals (cognitive 16) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:572 — SplitsAfterEquals.getSplitsDefValEquals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 4, match/switch 2 (3 pts) (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 · SplitsAfterDo.get (cognitive 16) · ×1

SplitsAfterDo.get (cognitive 16) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala:3251 — SplitsAfterDo.get has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, match/switch 1 (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 · RedundantBraces.canRewriteStatWithParens (cognitive 16) · ×1

RedundantBraces.canRewriteStatWithParens (cognitive 16) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:43 — RedundantBraces.canRewriteStatWithParens has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (4 pts), boolean chains 2 (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 · RedundantBraces.onRightParen (cognitive 16) · ×1

RedundantBraces.onRightParen (cognitive 16) scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala:268 — RedundantBraces.onRightParen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (5 pts) (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 · PlatformPathMatcher.glob (cognitive 16) · ×1

PlatformPathMatcher.glob (cognitive 16) scalafmt-sysops/js/src/main/scala/org/scalafmt/sysops/PlatformPathMatcher.scala:18 — PlatformPathMatcher.glob has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 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.

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

REDACTED

D3 · God Classes · ClassTooLong · ×1

ClassTooLong: GenJSCode scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:30 — ClassTooLong — 2707 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 2307 over it, 6.77× 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.

D31 · IaC & Container Security · Medium IaC · ×1

REDACTED

D35 · Change Coupling · Change coupling · ×1

Change coupling: Router.scala ↔ TokenClasses.scala scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Router.scala:1 — `scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Router.scala` and `scalafmt-core/shared/src/main/scala/org/scalafmt/util/TokenClasses.scala` change together 80% of the time (12 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — 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) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; 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 `83f68e03` Router: remove overlapping match rules; `1e3bcd4c` Use new tree/token implicit extensions; `6edbb3ea` TokenClasses: add matches/apply, to join unapply — run `git show` on any of them.

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

REDACTED

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

REDACTED

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

Duplicated block (13 lines × 2) scalafmt-benchmarks/src/resources/scala-js/Division.scala:251 — scalafmt-benchmarks/src/resources/scala-js/Division.scala:251-263 | scalafmt-benchmarks/src/resources/scala-js/Division.scala:298-310 — 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 `scalafmt-benchmarks/src/resources/scala-js/Division.scala:251` 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 (10 lines × 2) · ×1

Duplicated block (10 lines × 2) scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:328 — scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:328-337 | scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:418-427 — 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 `scalafmt-benchmarks/src/resources/scala-js/GenJSCode.scala:328` 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 (9 lines × 2) · ×1

Duplicated block (9 lines × 2) scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:99 — scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:99-107 | scalafmt-core/shared/src/main/scala/org/scalafmt/internal/State.scala:113-121 — 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) scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:411 — scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:411-417 | scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:783-789 — 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 `scalafmt-benchmarks/src/resources/scala-js/OptimizerCore.scala:411` 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 (29 lines × 2) · ×1

Duplicated block (29 lines × 2) scalafmt-core/shared/src/main/scala/org/scalafmt/config/ReflectOps.scala:9 — scalafmt-core/shared/src/main/scala/org/scalafmt/config/ReflectOps.scala:9-37 | scalafmt-dynamic-core/src/main/scala/org/scalafmt/dynamic/utils/ReflectUtils.scala:9-37 — before extracting anything, compare `scalafmt-core/shared/src/main/scala/org/scalafmt/config/ReflectOps.scala` and `scalafmt-dynamic-core/src/main/scala/org/scalafmt/dynamic/utils/ReflectUtils.scala` as WHOLE FILES: 88% 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 `scalafmt-core/shared/src/main/scala/org/scalafmt/config/ReflectOps.scala:9` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.

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

Duplicated block (25 lines × 2) scalafmt-interfaces/js/src/main/scala/org/scalafmt/interfaces/ScalafmtReporter.scala:40 — scalafmt-interfaces/js/src/main/scala/org/scalafmt/interfaces/ScalafmtReporter.scala:40-64 | scalafmt-interfaces/native/src/main/java/org/scalafmt/interfaces/ScalafmtReporter.scala:40-64 — before extracting anything, compare `scalafmt-interfaces/js/src/main/scala/org/scalafmt/interfaces/ScalafmtReporter.scala` and `scalafmt-interfaces/native/src/main/java/org/scalafmt/interfaces/ScalafmtReporter.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.

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

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

S1 · Web-Security Posture · Weak hash algorithm · ×1

Weak hash algorithm scalafmt-dynamic/src/main/scala/org/scalafmt/dynamic/coursier/ClasspathCache.scala:41 — 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.

Minor — 28 finding(s)

D34 · Knowledge Freshness · Orphaned file · ×12

Orphaned file scalafmt-benchmarks/src/resources/scala-js/BaseLinker.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 scalafmt-benchmarks/src/resources/scala-js/Primality.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 scalafmt-benchmarks/src/resources/scala-js/SourceMapWriter.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 scalafmt-benchmarks/src/resources/scala-js/TypeKinds.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 scalafmt-benchmarks/src/resources/scala-js/CopyOnWriteArrayList.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 scalafmt-benchmarks/src/resources/scala-js/Trees.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 scalafmt-benchmarks/src/resources/scala-js/JavaLangString.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 scalafmt-benchmarks/src/resources/scala-js/Utils.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 scalafmt-benchmarks/src/resources/scala-js/Semantics.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 scalafmt-benchmarks/src/resources/scala-js/JSDependency.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 scalafmt-interfaces/jvm/src/main/java/org/scalafmt/interfaces/ScalafmtReporter.java: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 scalafmt-interfaces/native/src/main/java/org/scalafmt/interfaces/ScalafmtReporter.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.

D16 · Bus Factor · Off-boarding risk · ×1

Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 78 significant file(s) lose their only recent owner: scalafmt-core/shared/src/main/scala/org/scalafmt/internal/Splits.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatWriter.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/internal/FormatOps.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/util/TreeOps.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/Imports.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/rewrite/RedundantBraces.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/config/Newlines.scala, scalafmt-core/shared/src/main/scala/org/scalafmt/internal/OptionalBraces.scala (+70 more). Pair on, review, or document these before any departure.

D20 · ADR Quality · No ADRs found · ×1

No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.

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)` (42215 LoC, 984 module-visible types across 40 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.

D34 · Knowledge Freshness · Further orphaned files (smaller) · ×1

Further orphaned files (smaller) — 12 smaller file(s) also have no living knowledge — folded into the freshness score and metrics rather than raised one row each — most significant first: scalafmt-benchmarks/src/resources/scala-js/BaseLinker.scala, scalafmt-benchmarks/src/resources/scala-js/Primality.scala, scalafmt-benchmarks/src/resources/scala-js/SourceMapWriter.scala, scalafmt-benchmarks/src/resources/scala-js/TypeKinds.scala, scalafmt-benchmarks/src/resources/scala-js/CopyOnWriteArrayList.scala, scalafmt-benchmarks/src/resources/scala-js/Trees.scala, scalafmt-benchmarks/src/resources/scala-js/JavaLangString.scala, scalafmt-benchmarks/src/resources/scala-js/Utils.scala (and 4 more) (19 orphaned of 110 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; 110 of the 248 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

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

REDACTED

IC1 · Incompleteness & stubs · Blanket warning suppression · ×1

Blanket warning suppression scalafmt-cli/shared/src/main/scala/org/scalafmt/cli/CliArgParser.scala:39 — 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.

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.

M2 · Architecture documentation · No architecture diagram/doc · ×1

No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.

P10 · Library API & versioning · Large public API surface · ×1

Large public API surface — 14/14 types (100%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.

P3 · Security & performance tooling · No SAST · ×1

No SAST — No static application security testing detected. For this repository's stack, add scalafix or scapegoat (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 16096 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

P4 · Deployment & Rollback · No release approval gate · ×1

No release approval gate — The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.

PF1 · Benchmark discipline · Benchmarks don't track allocations · ×1

Benchmarks don't track allocations scalafmt-benchmarks/src/main/scala-2.12/benchmarks/MacroBenchmark.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.

X23 · Unguarded diagnostic materialisation · Diagnostic log message is built whether or not it is wanted · ×1

Diagnostic log message is built whether or not it is wanted scalafmt-benchmarks/src/resources/Endpoint.scala:79 — `debug` at line 79 is called with an argument built by `sel.elements.mkString("…", "…", "…")` (line 81), whose cost grows with the collection it walks. Scala evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: the logger takes a built `String` (SLF4J, Akka/Pekko `LoggingAdapter`, `context.log`), and there is no `isDebugEnabled`/`isTraceEnabled` test and no debug flag.

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

Minor — 3 finding(s)

D12 · Dependency Hygiene · Outdated · ×3

Outdated: com.github.scopt:scopt_2.13 — `com.github.scopt %% scopt_2.13` is declared at 4.1.0 in build.sbt, but 4.2.0 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 4.1.0 until the declaration is edited — there is no lockfile refresh that would move it.
Outdated: org.jline:jline — `org.jline %% jline` is declared at 3.30.17 in build.sbt, but 4.4.8 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 3.30.17 until the declaration is edited — there is no lockfile refresh that would move it.
Outdated: org.scala-lang.modules:scala-parallel-collections_2.13 — `org.scala-lang.modules %% scala-parallel-collections_2.13` is declared at 1.2.0 in project/Extensions.scala, but 1.3.0 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 1.2.0 until the declaration is edited — there is no lockfile refresh that would move it.

Appendix B — Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.

Dimension	Tool	Version	Command	Findings	Raw output
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-3b36297fb55a43c8b9fe991821a9c875/history.json --exit-code 0 --source .	1	artifacts/raw/gitleaks-history.json
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-3b36297fb55a43c8b9fe991821a9c875/tree.json --exit-code 0 --source .	0	artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)	semgrep	—	semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --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 .	37	artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilities	trivy	—	trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs /bin/ --skip-dirs /obj/ . --skip-db-update	0	artifacts/raw/trivy-fs.json
D31 · IaC & Container Security	trivy	—	trivy config --format json --quiet .	3	artifacts/raw/trivy-config.json
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 5 file(s) — `scalafmt-benchmarks/src/resources/Endpoint.scala`, `scalafmt-benchmarks/src/resources/scala3/Scala3Syntax.scala`, `scalafmt-benchmarks/src/resources/scalafmt/Basic.scala`, `scalafmt-dynamic-core/src/main/scala/org/scalafmt/dynamic/ScalafmtDynamicSession.scala`, `website/docusaurus.config.ts` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.	0	—
D37 · Vulnerability-disclosure Policy	disclosure	—	disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.	0	—
D40 · Network Egress Confinement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.	0	—
D41 · Kernel & Syscall Confinement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.	0	—
D42 · Runtime Threat Enforcement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.	0	—
D43 · Malicious Dependencies	trivy	—	trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs /bin/ --skip-dirs /obj/ . --skip-db-update	0	artifacts/raw/trivy-fs.json

Run 01a1770b-1509-7ce7-88d2-8c801ca72f55 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Findings by how serious they are

This survey was produced by

Executive summary

Top priorities

Diagnosis: what the measurements show together

Architecture — module dependency graph

Architecture: which parts of the code depend on which

At a glance — Code Health · 67% · Adequate · gated by D2, X5 ·

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

At a glance — Maturity · 47% · Weak · gated by D16, M2 ·

At a glance — Readiness · 63% · Adequate ·

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

At a glance — Performance · 80% · Strong ·

Security & Compliance — OWASP Top-10 mapping

Roadmap

File quality

How the grades work

Methodology & how to trust this report

Tools & methods

Run transparency — what happened this run

Limitations & what we did not check

Per-dimension blind spots

Dimensions

Frontend & cross-cutting dimensions

Reference — by lens

Appendix A — Findings (grouped)

Appendix B — Reproduction & audit trail

Downloadable artifacts