Public report of coding-horror/basic-computer-games, published 23 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 23 October 2026, 09:45 UTC · Survey ID cd_14da7df74fee4afd8d798908f84bbb96
coding-horror/basic-computer-games
Measured 23 October 2026, 09:24 UTC, at code version 5301155
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
Bus factor is not measured: No living knowledge left to concentrate.
Boundary Type-Coupling is not measured: Bounded contexts not declared.
Supply-chain provenance & signing is not measured: Supply-chain provenance is not scored (this pipeline releases no artifact), but its build steps or GitHub Actions workflows have integrity defects, or nothing watches its dependency set for published advisories.
CAI scoreWeak
CriticalWeakAdequateStrongExemplary
Up 1 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 156,959 lines of product code in 202 projects, tests not counted · Estimated rebuild effort: about 1.0 person-years · Weakest lens: Security and Compliance, 36
Findings by how serious they are
34 critical781 serious221 minor
13 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
23 October 2026, 09:24 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
74of 78 dimensions measured by tools. The other 4 are advisory notes from an AI model, which explain the code but don't count towards the score.
1022of 1036 findings point to an exact file and line, so you can open each one in the code. The other 14 concern the repository as a whole, such as missing documentation.
78dimensions across 6 lenses, read from 156,959 lines of product code in 202 projects.
coding-horror/basic-computer-games scores 41 out of 100 and is rated Weak, while three of its six lenses score higher still: Performance at 100 and Architecture at 96, both rated Exemplary, and Maturity at 46, rated Weak.
The score is lower than those three because the weakest lens counts most, and here that is Security and Compliance, which scores 36 and is rated Weak. Its Data Protection dimension scores 0 out of 10, and until that reaches 4, Security and Compliance can't be rated higher than Adequate. The first actions are to resolve the 1 No ADRs found finding(s) in ADR Quality and to resolve the 5 End-of-life runtime finding(s) in Platform End-of-Life. The weakest lenses score close to each other, so improving any of them moves the score.
34 findings are critical: 17 in Static Analysis (SAST), seven in Dependency Vulnerabilities, six in Project dependency cycles, three in Explicit Debt and one in Data Compliance (PII/GDPR).
Watchdog couldn't measure 7 dimensions in this code, among them Code Coverage, Test Reliability and Dependency Hygiene, so they are left out of the score. The product code is 156,959 lines, which would take an estimated 1.0 person-years, around €150,000, to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe 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.
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: 72 findings
These 72 critical or serious findings were in the previous survey, on 9 October 2026, and are gone from this one.
Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) 01_Acey_Ducey/csharp/Game.cs
Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) 64_Nicomachus/csharp/program.cs
€49,000 to €250,000, for 820 to 2,611 hours of work, about 1.0 person-years for 1 to 2 engineers
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.7 at a score of 41. 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
Large: 156,959 lines of product code
Comment lines
The estimate prices 152,922 lines. Comment lines count towards the size of 156,959 lines but aren't priced as work.
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.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 3 points · Low effort · ADR Quality
2
Resolve the 5 End-of-life runtime finding(s) in Platform End-of-Life — start with Tower.csproj, Weekday.csproj, Roulette.csproj.
Resolve the 3 WriteOnlyPrivateField finding(s) in Explicit Debt — start with Game.cs (2), Country.cs.
Raises the score by about 2 points · Low effort · Explicit Debt
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 €150,000 to build again, about 1.0 person-years of work. Its weakest lens is Security and Compliance, at 36 (Weak). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
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 3 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.4 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 4% to 9% on every change. The history of the code shows how much it changes: about 255 lines over the last 90 days, which is about 1,034 lines a year. At that pace, the extra work comes to an estimated 0.1 to 0.6 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; 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 — a layering smell or cycle. A clean layered graph 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.
517 modules, with 136 dependencies between them. 6 loops run through 18 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 477 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 a module listed above itPart of a loopThe module itself
6→10 BugGame.Resources uses BugGame.Partspart of a loop✕
Connections
1 pair of types, where a type in BugGame.Resources uses a type in BugGame.Parts.
The types involved
BugGame.Resources.Message → BugGame.Parts.Part
Direction
BugGame.Resources uses BugGame.Parts, so a change to BugGame.Parts can break BugGame.Resources, while a change to BugGame.Resources can't break BugGame.Parts.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
Games.Common.Randomness uses Salvo, so a change to Salvo can break Games.Common.Randomness, while a change to Games.Common.Randomness can't break Salvo.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
BugGame.Parts uses BugGame.Resources, so a change to BugGame.Resources can break BugGame.Parts, while a change to BugGame.Parts can't break BugGame.Resources.
Position
Below the diagonal: BugGame.Parts uses a module listed above it, which is the healthy direction.
Poker.Cards uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Poker.Cards, while a change to Poker.Cards can't break Games.Common.Randomness.
Position
Below the diagonal: Poker.Cards uses a module listed above it, which is the healthy direction.
Salvo.Ships uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Salvo.Ships, while a change to Salvo.Ships can't break Games.Common.Randomness.
Position
Below the diagonal: Salvo.Ships uses a module listed above it, which is the healthy direction.
Salvo.Targetting uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Salvo.Targetting, while a change to Salvo.Targetting can't break Games.Common.Randomness.
Position
Below the diagonal: Salvo.Targetting uses a module listed above it, which is the healthy direction.
Salvo.Targetting uses Games.Common.IO, so a change to Games.Common.IO can break Salvo.Targetting, while a change to Salvo.Targetting can't break Games.Common.IO.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
Salvo uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Salvo, while a change to Salvo can't break Games.Common.Randomness.
Position
Below the diagonal: Salvo uses a module listed above it, which is the healthy direction.
Basketball.Plays uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Basketball.Plays, while a change to Basketball.Plays can't break Games.Common.Randomness.
Position
Below the diagonal: Basketball.Plays uses a module listed above it, which is the healthy direction.
Basketball.Plays uses Games.Common.IO, so a change to Games.Common.IO can break Basketball.Plays, while a change to Basketball.Plays can't break Games.Common.IO.
Position
Below the diagonal: Basketball.Plays uses a module listed above it, which is the healthy direction.
19→34 Basketball.Plays uses Basketballpart of a loop✕
Connections
14 pairs of types, where a type in Basketball.Plays uses a type in Basketball.
1 pair of types, where a type in BugGame uses a type in Games.Common.Randomness.
The types involved
BugGame.Game → Games.Common.Randomness.IRandom
Direction
BugGame uses Games.Common.Randomness, so a change to Games.Common.Randomness can break BugGame, while a change to BugGame can't break Games.Common.Randomness.
Position
Below the diagonal: BugGame uses a module listed above it, which is the healthy direction.
Digits uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Digits, while a change to Digits can't break Games.Common.Randomness.
Position
Below the diagonal: Digits uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in Guess uses a type in Games.Common.Randomness.
The types involved
Guess.Game → Games.Common.Randomness.IRandom
Direction
Guess uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Guess, while a change to Guess can't break Games.Common.Randomness.
Position
Below the diagonal: Guess uses a module listed above it, which is the healthy direction.
Hexapawn uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Hexapawn, while a change to Hexapawn can't break Games.Common.Randomness.
Position
Below the diagonal: Hexapawn uses a module listed above it, which is the healthy direction.
Mugwump uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Mugwump, while a change to Mugwump can't break Games.Common.Randomness.
Position
Below the diagonal: Mugwump uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in Poetry uses a type in Games.Common.Randomness.
The types involved
Poetry.Context → Games.Common.Randomness.IRandom
Poetry.Poem → Games.Common.Randomness.IRandom
Direction
Poetry uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Poetry, while a change to Poetry can't break Games.Common.Randomness.
Position
Below the diagonal: Poetry uses a module listed above it, which is the healthy direction.
Poker.Players uses Poker.Strategies, so a change to Poker.Strategies can break Poker.Players, while a change to Poker.Players can't break Poker.Strategies.
Position
Below the diagonal: Poker.Players uses a module listed above it, which is the healthy direction.
Poker.Players uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Poker.Players, while a change to Poker.Players can't break Games.Common.Randomness.
Position
Below the diagonal: Poker.Players uses a module listed above it, which is the healthy direction.
Poker.Players uses Games.Common.IO, so a change to Games.Common.IO can break Poker.Players, while a change to Poker.Players can't break Games.Common.IO.
Position
Below the diagonal: Poker.Players uses a module listed above it, which is the healthy direction.
Queen uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Queen, while a change to Queen can't break Games.Common.Randomness.
Position
Below the diagonal: Queen uses a module listed above it, which is the healthy direction.
Roulette uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Roulette, while a change to Roulette can't break Games.Common.Randomness.
Position
Below the diagonal: Roulette uses a module listed above it, which is the healthy direction.
1 pair of types, where a type in Stars uses a type in Games.Common.Randomness.
The types involved
Stars.Game → Games.Common.Randomness.IRandom
Direction
Stars uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Stars, while a change to Stars can't break Games.Common.Randomness.
Position
Below the diagonal: Stars uses a module listed above it, which is the healthy direction.
SuperStarTrek.Space uses SuperStarTrek.Commands, so a change to SuperStarTrek.Commands can break SuperStarTrek.Space, while a change to SuperStarTrek.Space can't break SuperStarTrek.Commands.
Position
Below the diagonal: SuperStarTrek.Space uses a module listed above it, which is the healthy direction.
SuperStarTrek.Space uses Games.Common.Randomness, so a change to Games.Common.Randomness can break SuperStarTrek.Space, while a change to SuperStarTrek.Space can't break Games.Common.Randomness.
Position
Below the diagonal: SuperStarTrek.Space uses a module listed above it, which is the healthy direction.
SuperStarTrek.Space uses Games.Common.IO, so a change to Games.Common.IO can break SuperStarTrek.Space, while a change to SuperStarTrek.Space can't break Games.Common.IO.
Position
Below the diagonal: SuperStarTrek.Space uses a module listed above it, which is the healthy direction.
32→39 SuperStarTrek.Space uses SuperStarTrek.Objectspart of a loop✕
Connections
3 pairs of types, where a type in SuperStarTrek.Space uses a type in SuperStarTrek.Objects.
SuperStarTrek.Space uses SuperStarTrek.Objects, so a change to SuperStarTrek.Objects can break SuperStarTrek.Space, while a change to SuperStarTrek.Space can't break SuperStarTrek.Objects.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
Target uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Target, while a change to Target can't break Games.Common.Randomness.
Position
Below the diagonal: Target uses a module listed above it, which is the healthy direction.
Basketball uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Basketball, while a change to Basketball can't break Games.Common.Randomness.
Position
Below the diagonal: Basketball uses a module listed above it, which is the healthy direction.
2 pairs of types, where a type in Poker uses a type in Games.Common.Randomness.
The types involved
Poker.Game → Games.Common.Randomness.IRandom
Poker.Table → Games.Common.Randomness.IRandom
Direction
Poker uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Poker, while a change to Poker can't break Games.Common.Randomness.
Position
Below the diagonal: Poker uses a module listed above it, which is the healthy direction.
Roulette.Resources uses Games.Common.Randomness, so a change to Games.Common.Randomness can break Roulette.Resources, while a change to Roulette.Resources can't break Games.Common.Randomness.
Position
Below the diagonal: Roulette.Resources uses a module listed above it, which is the healthy direction.
SuperStarTrek.Systems.ComputerFunctions uses Games.Common.IO, so a change to Games.Common.IO can break SuperStarTrek.Systems.ComputerFunctions, while a change to SuperStarTrek.Systems.ComputerFunctions can't break Games.Common.IO.
Position
Below the diagonal: SuperStarTrek.Systems.ComputerFunctions uses a module listed above it, which is the healthy direction.
SuperStarTrek.Systems.ComputerFunctions uses SuperStarTrek.Space, so a change to SuperStarTrek.Space can break SuperStarTrek.Systems.ComputerFunctions, while a change to SuperStarTrek.Systems.ComputerFunctions can't break SuperStarTrek.Space.
Position
Below the diagonal: SuperStarTrek.Systems.ComputerFunctions uses a module listed above it, which is the healthy direction.
37→39 SuperStarTrek.Systems.ComputerFunctions uses SuperStarTrek.Objectspart of a loop✕
Connections
4 pairs of types, where a type in SuperStarTrek.Systems.ComputerFunctions uses a type in SuperStarTrek.Objects.
SuperStarTrek.Systems.ComputerFunctions uses SuperStarTrek.Objects, so a change to SuperStarTrek.Objects can break SuperStarTrek.Systems.ComputerFunctions, while a change to SuperStarTrek.Systems.ComputerFunctions can't break SuperStarTrek.Objects.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
37→40 SuperStarTrek.Systems.ComputerFunctions uses SuperStarTrekpart of a loop✕
Connections
1 pair of types, where a type in SuperStarTrek.Systems.ComputerFunctions uses a type in SuperStarTrek.
SuperStarTrek.Systems.ComputerFunctions uses SuperStarTrek, so a change to SuperStarTrek can break SuperStarTrek.Systems.ComputerFunctions, while a change to SuperStarTrek.Systems.ComputerFunctions can't break SuperStarTrek.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
SuperStarTrek.Systems uses SuperStarTrek.Commands, so a change to SuperStarTrek.Commands can break SuperStarTrek.Systems, while a change to SuperStarTrek.Systems can't break SuperStarTrek.Commands.
Position
Below the diagonal: SuperStarTrek.Systems uses a module listed above it, which is the healthy direction.
SuperStarTrek.Systems uses Games.Common.Randomness, so a change to Games.Common.Randomness can break SuperStarTrek.Systems, while a change to SuperStarTrek.Systems can't break Games.Common.Randomness.
Position
Below the diagonal: SuperStarTrek.Systems uses a module listed above it, which is the healthy direction.
SuperStarTrek.Systems uses Games.Common.IO, so a change to Games.Common.IO can break SuperStarTrek.Systems, while a change to SuperStarTrek.Systems can't break Games.Common.IO.
Position
Below the diagonal: SuperStarTrek.Systems uses a module listed above it, which is the healthy direction.
SuperStarTrek.Systems uses SuperStarTrek.Space, so a change to SuperStarTrek.Space can break SuperStarTrek.Systems, while a change to SuperStarTrek.Systems can't break SuperStarTrek.Space.
Position
Below the diagonal: SuperStarTrek.Systems uses a module listed above it, which is the healthy direction.
SuperStarTrek.Systems uses SuperStarTrek.Systems.ComputerFunctions, so a change to SuperStarTrek.Systems.ComputerFunctions can break SuperStarTrek.Systems, while a change to SuperStarTrek.Systems can't break SuperStarTrek.Systems.ComputerFunctions.
Position
Below the diagonal: SuperStarTrek.Systems uses a module listed above it, which is the healthy direction.
38→39 SuperStarTrek.Systems uses SuperStarTrek.Objectspart of a loop✕
Connections
7 pairs of types, where a type in SuperStarTrek.Systems uses a type in SuperStarTrek.Objects.
SuperStarTrek.Systems uses SuperStarTrek.Objects, so a change to SuperStarTrek.Objects can break SuperStarTrek.Systems, while a change to SuperStarTrek.Systems can't break SuperStarTrek.Objects.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
38→40 SuperStarTrek.Systems uses SuperStarTrekpart of a loop✕
Connections
1 pair of types, where a type in SuperStarTrek.Systems uses a type in SuperStarTrek.
SuperStarTrek.Systems uses SuperStarTrek, so a change to SuperStarTrek can break SuperStarTrek.Systems, while a change to SuperStarTrek.Systems can't break SuperStarTrek.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
SuperStarTrek.Objects uses SuperStarTrek.Commands, so a change to SuperStarTrek.Commands can break SuperStarTrek.Objects, while a change to SuperStarTrek.Objects can't break SuperStarTrek.Commands.
Position
Below the diagonal: SuperStarTrek.Objects uses a module listed above it, which is the healthy direction.
SuperStarTrek.Objects uses Games.Common.Randomness, so a change to Games.Common.Randomness can break SuperStarTrek.Objects, while a change to SuperStarTrek.Objects can't break Games.Common.Randomness.
Position
Below the diagonal: SuperStarTrek.Objects uses a module listed above it, which is the healthy direction.
SuperStarTrek.Objects uses Games.Common.IO, so a change to Games.Common.IO can break SuperStarTrek.Objects, while a change to SuperStarTrek.Objects can't break Games.Common.IO.
Position
Below the diagonal: SuperStarTrek.Objects uses a module listed above it, which is the healthy direction.
SuperStarTrek.Objects uses SuperStarTrek.Space, so a change to SuperStarTrek.Space can break SuperStarTrek.Objects, while a change to SuperStarTrek.Objects can't break SuperStarTrek.Space.
Position
Below the diagonal: SuperStarTrek.Objects uses a module listed above it, which is the healthy direction.
SuperStarTrek.Objects uses SuperStarTrek.Systems, so a change to SuperStarTrek.Systems can break SuperStarTrek.Objects, while a change to SuperStarTrek.Objects can't break SuperStarTrek.Systems.
Position
Below the diagonal: SuperStarTrek.Objects uses a module listed above it, which is the healthy direction.
SuperStarTrek uses SuperStarTrek.Commands, so a change to SuperStarTrek.Commands can break SuperStarTrek, while a change to SuperStarTrek can't break SuperStarTrek.Commands.
Position
Below the diagonal: SuperStarTrek uses a module listed above it, which is the healthy direction.
SuperStarTrek uses Games.Common.Randomness, so a change to Games.Common.Randomness can break SuperStarTrek, while a change to SuperStarTrek can't break Games.Common.Randomness.
Position
Below the diagonal: SuperStarTrek uses a module listed above it, which is the healthy direction.
SuperStarTrek uses Games.Common.IO, so a change to Games.Common.IO can break SuperStarTrek, while a change to SuperStarTrek can't break Games.Common.IO.
Position
Below the diagonal: SuperStarTrek uses a module listed above it, which is the healthy direction.
SuperStarTrek uses SuperStarTrek.Space, so a change to SuperStarTrek.Space can break SuperStarTrek, while a change to SuperStarTrek can't break SuperStarTrek.Space.
Position
Below the diagonal: SuperStarTrek uses a module listed above it, which is the healthy direction.
SuperStarTrek uses SuperStarTrek.Objects, so a change to SuperStarTrek.Objects can break SuperStarTrek, while a change to SuperStarTrek can't break SuperStarTrek.Objects.
Position
Below the diagonal: SuperStarTrek uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 38% · Weak · gated by D2, D3, R1, R2 ·
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
82
High / Critical
A03:2025 — Software Supply Chain Failures
15
High / Critical
A01:2025 — Broken Access Control
8
High / Critical
Roadmap
Immediately secure sensitive data by implementing encryption at rest and managing keys in a vault, skipping only if infrastructure handles this. Concurrently, eliminate technical debt by resolving orphaned files, updating end-of-life runtimes, and addressing explicit code issues like write-only private fields. Finally, establish architectural governance by creating the missing Architecture Decision Records to ensure long-term maintainability.
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.
Encrypt sensitive data at rest (ASP.NET Core Data Protection / column encryption) and manage keys in a vault. Skip if delegated to infra (Postgres TDE, KMS, etc.).
Per-file score 0–10 — a quality signature. Of 309 files carrying findings, judged against the Production bar: 1% slop · 63% mixed · 36% near-clean.
File
Score
Band
Worst signal
REDACTED
1.3
Slop
Dependency Vulnerabilities: High CVE: REDACTED
REDACTED
1.4
Slop
Static Analysis (SAST): High: REDACTED
REDACTED
3.0
Slop
Static Analysis (SAST): High: REDACTED
REDACTED
3.5
Slop
Data Compliance (PII/GDPR): High: REDACTED
REDACTED
4.1
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.1
Mixed
Data Compliance (PII/GDPR): Medium: REDACTED
REDACTED
4.8
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
4.8
Mixed
Static Analysis (SAST): High: REDACTED
REDACTED
5.1
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
5.7
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
5.8
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
6.1
Mixed
Data Compliance (PII/GDPR): Medium: REDACTED
REDACTED
6.3
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
6.3
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
6.4
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
6.4
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
6.4
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
6.4
Mixed
Static Analysis (SAST): Medium: REDACTED
REDACTED
6.4
Mixed
Static Analysis (SAST): Medium: REDACTED
03_Animal/vbnet/Animal/Game.vb
6.7
Mixed
Explicit Debt: TodoComment
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 — 34
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 — 781
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 — 221
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 13
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. 74 of 78 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 4 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.7 — 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 — 78 dimensions across the health lenses
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, 1022 of 1036 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
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.
D4 Code Duplication — 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. The 72 duplicated block group(s) on this row were found in the languages this pass could tokenize, and they do NOT cover all of this repository's production source: .bas (24,125 lines, 19% of production source), .java (20,871 lines, 16% of production source) went unread, because no language model this pass could load exposed a clone-unit token stream for those file kinds. Duplication in that source is UNMEASURED — its absence from the count above is a gap in this analyzer's language coverage, not a finding that the code is free of duplication.
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: this repository's production source spans .cs, .bas, .c, .cpp, .exs, .go, .java, .jl, .kt, .lua, .nim, .pas, .pl, .pm, .py, .rb, .rs, .swift, and our analyzer cannot run the .bas, .c, .cpp, .exs, .go, .java, .jl, .kt, .lua, .nim, .pas, .pl, .pm, .py, .rb, .rs, .swift test suite(s) — so no coverage was collected for the repository as a whole. The .NET half may well have built and run; what is missing is a coverage figure that covers the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — coverage is excluded from the score rather than counted as a near-zero. In the meantime, produce a coverage report in a standard format (Cobertura — `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference (.NET: C#, VB.NET and F# alike), lcov — `swift test --enable-code-coverage` or `xcodebuild -enableCodeCoverage YES` then `xcrun llvm-cov export -format=lcov` (Swift/Xcode), `cargo llvm-cov --lcov`, `go test -coverprofile`, `rebar3 do eunit --cover, cover` or covertool (Erlang/BEAM), `flutter test --coverage` or `dart test --coverage=coverage` then `dart run coverage:format_coverage --lcov` (Dart/Flutter), `sbt clean coverage test coverageReport` via the sbt-scoverage plugin in `project/plugins.sbt` (Scala/sbt), jest/nyc, JaCoCo/Cobertura XML, coverage.py … most ecosystems' coverage tools can emit one) 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 and real coverage will be read. You can widen what we reach: optional: add a coverage collector to your test run and commit (or publish into the working tree) its Cobertura/OpenCover/lcov output, and the real number is read on the next scan.
D10 Test 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. The 37 test(s) behind this row are the ones the C# collector could read, and this repository also carries at least 10 test source file(s) (.kt, .vb, .java) that it cannot: it parses C# syntax and matches C# test attributes, so a vitest/jest/JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test reliability NOT SCORED: this repository's production source spans .cs, .vb, .java, and the built-in reliability runner cannot re-run the .java test suite(s) — so reliability was not measured for the repository as a whole. The .NET suite did build and re-run, and came back with 0 flaky across 2 measured tier(s) (unit: measured (0 flaky); other: measured (0 flaky)) — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — test reliability is excluded from the score rather than counted.
D12 Dependency Hygiene — 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. Dependency Hygiene couldn't be assessed within its 5-minute budget on a solution this large — not included in this run.
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 a Python pyproject.toml/requirements.txt (pip/uv/Poetry), but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its Python dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D16 Bus Factor — 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. All 118 significant source file(s) were last meaningfully changed so long ago that no living knowledge remains — nothing since has been substantial enough to re-establish ownership (a broad, mechanical sweep that touches many files shallowly does not count, and neither does no activity at all). There is no concentration to measure, so the bus factor is not scored. This is not a clean bill: nobody currently holds working knowledge of this code (see D34 Knowledge Freshness). Counted over 118 of the 453 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
D17 Explicit Debt — 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. The 6 deducted marker(s) and the 0.2/KLoC density on this row were taken over this repository's .NET projects ALONE: .bas (24,125 lines, 19% of production source), .java (20,871 lines, 16% of production source) went unread, because every marker collector on this path is reached through a C# workspace. A read-only sweep of that source finds at least 6 task marker(s) (TODO/FIXME/HACK/XXX) across 1 file(s) that this score does not count — a floor, since only line comments are read there and D17's other eight marker kinds (suppressions, NoWarn, editorconfig severities, empty catches, commented-out code, Obsolete, dead code, preprocessor branches) need a compiler we do not have for that language. The debt in that source is UNMEASURED — its absence from the score above is a gap in this analyzer's language coverage, not a finding that the code carries none.
D21 Naming Consistency — LLM provider failed — The model provider returned an unusable result, so this LLM-assisted dimension fell back to a measurement gap (confidence 0) rather than a penalty. Re-run with a reachable provider to score it.
D23 Boundary Type-Coupling — 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. Large codebase (28,625 production LoC in the .NET projects) with no declared bounded contexts — cross-boundary type coupling is unassessed Bounded contexts cannot be inferred from a codebase that is not physically organised by them (D-321), so with none declared there are no boundaries for the coupling pass to measure across. You can widen what we reach: name this codebase's bounded contexts (≥2 module groups, e.g. per subsystem) so cross-boundary type coupling can 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"]`.
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. 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.
D30 Dependency Vulnerabilities — measured, with a gap in what it reached — 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. The solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan. 2 of 3 declared ecosystem(s) (npm,osv) WERE scanned and every vulnerability they reported is included in this result; nuget was not, so this dimension's score covers less than the dependency surface this repository declares, and nothing here is evidence that nuget is free of known-vulnerable dependencies.
D32 Data Compliance (PII/GDPR) — 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. `43_Hammurabi/csharp/Rules.cs`, `53_King/kotlin/King.kt` 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.
D39 IL Efficiency — 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. IL NOT MEASURED: the analyzer's own build of this repository failed for an ENVIRONMENT reason (exit 1) — MSBuild's engine or the CLR gave up, or our image does not carry the SDK band/targeting pack this repository needs. This is OUR limitation, not a defect in the repo, and it is not a statement that this repository fails to build. D18 owns the question of whether this repository builds; it was not answered here.
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.
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.
R10 Code Duplication — 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. 68 further occurrence(s) are not listed individually; the score already reflects all 108.
Package restore incomplete — third-party types were unresolved in part of the solution — NuGet restore did not complete for one or more projects, so those projects were analysed with framework references only: every check keyed on a third-party type saw an error type there and reported nothing. Findings on those projects are a lower bound; run `dotnet restore` on them and rescan.
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.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
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.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D22 Internal API Consistency: API-surface coherence is an LLM judgement over a sample of the public surface — consistency of intent across the whole API is approximated, not exhaustively verified.
D24 Comment Value: Comment value (WHY vs WHAT) is an LLM judgement over a bounded sample — it is advisory and cannot weigh a comment against the precise code change it was written to explain.
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.
D32 Data Compliance (PII/GDPR): PII/GDPR signals are heuristic pattern matches in code — they flag likely handling concerns, not legal compliance, and cannot trace where data actually flows at runtime.
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.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
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.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
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.
The LLM boundary
LLM-set scores this run (4): D19, D22, D24, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
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.
218 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was main at 133. A further 1 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 app._Json_equality at 19 — they are counted neither in the figure above nor in this dimension's score.
main (cyclomatic 20) · ×259_Lunar_LEM_Rocket/javascript/lunar.js:86
+ 133 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 2 bodies over 120 down to 120 or less in Cyclomatic Complexity — start with main (cyclomatic 133), salvo.main (cyclomatic 132). — 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 2 together lifts Cyclomatic Complexity from 4.7 to about 4.9/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.
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.
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.
+ 278 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 100 bodies over 60 down to 60 or less in Cognitive Complexity — start with battle.main (cognitive 425), main (cognitive 425), main (cognitive 419). — 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 100 together lifts Cognitive Complexity from 2.0 to about 4.0/10, projected with the scoring formula itself and assuming each lands exactly at 60; 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 Classes0.0 / 10Critical✓ 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.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 49 FunctionTooLong finding(s) in God Classes — start with main.rs (5), superstartrek.mjs (2), civilwar.js. — One of this dimension's main actionable groups (49 warning-level).
Resolve the 6 FileTooLong finding(s) in God Classes — start with app.js, superstartrek.mjs, superstartrek.py. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 6 MethodTooLong finding(s) in God Classes — start with Game.cs (2), BombsAway.java, Hamurabi.java. — One of this dimension's main actionable groups (6 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.
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.
72 duplicated block group(s) detected. A further 4 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. Measured on part of this repository only: .bas, .java (35% of production source) was not exposed to the token comparison, so duplication there is unmeasured and is not in this count.
+ 38 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 6 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with StringExtensions.cs, Wheel.cs, Bunny.java. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 6 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with BatNum.java (2), Bombardment.java, Love.java. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 5 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with Change.java, Chief.java, Guess.java. — One of this dimension's main actionable groups (5 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.
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.
Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with TextIO.cs. — One of this dimension's main actionable groups (1 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.
87 test methods: 87 unit, 0 integration, 0 BDD, 0 e2e. The Rust suite contributes 9 `#[test]` function(s) across 2 file(s) declaring at least one; its unit/integration split is Cargo's own — 0 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test. The java suite(s) contribute 41 test method(s), read from the language model's own test census — every XCTest `test…` method on an XCTestCase, every swift-testing `@Test` and every JUnit/TestNG `@Test`-annotated method, which is those frameworks' own discovery rule. Their tier split is INFERRED from the test target's name and path only, not declared.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
0 skipped, 0 zero-assertion, no mocking-framework packages referenced (hand-written doubles or no mocking) across 37 tests. Measured on the C# suite only — at least 10 test source file(s) (.kt, .vb, .java) went unread, so its test quality is unmeasured and is not in these counts.
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.
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.
0 of 175 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 8 direct `PackageReference`(s), and 149 further package(s) were reached beyond them by closing the graph over nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution. ★ COVERAGE OF THIS VERDICT: it grades this repository's NuGet package dependencies and nothing else. The repository also declares a Python pyproject.toml/requirements.txt (pip/uv/Poetry), 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.
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.
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.
6 deducted debt markers + 8 dead symbols across 28625 LoC in the .NET projects (0.2/KLoC) → score 9.6. Measured on the .NET source only: .bas, .java (35% of production source) was not read, and carries at least 6 uncounted task marker(s) in 1 file(s).
Resolve the 3 WriteOnlyPrivateField finding(s) in Explicit Debt — start with Game.cs (2), Country.cs. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 8 Dead code finding(s) in Explicit Debt — start with IRandomExtensions.cs (2), IRandom.cs, Methods.cs. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 2 TodoComment finding(s) in Explicit Debt — start with MockConsole.vb, Game.vb. — One of this dimension's main actionable groups (2 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.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
This is a collection of READMEs for various classic BASIC/retro computer games (Battleship, Blackjack, Bombardment, Bounce, Bowling, Boxing, Bug, Bullfight, Bullseye, Bunny, Buzzword, Calendar) and related documentation. Each document is an internal directory README that describes what it contains rather than the repository as a whole; for example, 'BATTLE' is a README of the 09_Battle/ directory (a Battleship simulation), not the root repo. The XML-doc coverage across all games is low (<20% for most) and there are no licence or architecture/design docs present in the summary, so the repository's documentation quality is judged against the READMEs alone. (12 of 25 sampled documents could not be assessed: 1 of 2 evaluation groups failed.)
Documentation: no project overview · ×220_Buzzword/README.md
Resolve the 2 Documentation finding(s) in Documentation Quality — start with README.md (2). — One of this dimension's main actionable groups (2 recommendation-level).
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
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?
D22 · Internal API ConsistencyExemplary◐ Sampled · advisory
What it measures: Whether the internal API surface is consistent and coherent.
Method: Judged by language model at low temperature over a sample of the public API surface (IsPackable or .Contracts types). Sampled, advisory; confidence discounted by model uncertainty.
What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).
Method: Judged by language model at low temperature (0.0-0.1) on deterministically sampled inline comments with surrounding code; findings verified back to sampled comments by substring match. Advisory, sampled.
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.
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).
84 finding(s): 0 critical, 17 high, 67 medium, 0 low. 6 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 4 file(s) — `00_Alternate_Languages/74_Rock_Scissors_Paper/bash/rockscissors.sh` (line 41), `43_Hammurabi/csharp/Rules.cs` (line 124), `82_Stars/rust_JWB/src/main.rs`, `84_Super_Star_Trek/javascript/index.html` (lines 109–168) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 3 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 10 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED (4), REDACTED. — One of this dimension's main actionable groups (10 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 6 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 (6 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
15 finding(s): 0 critical, 7 high, 6 medium, 2 low. Partial dependency scan: 2 of 3 declared ecosystem(s) were scanned (npm,osv), and the findings above are real and complete for them. nuget was not scanned (nuget: the solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan), so this is not the whole dependency surface and the result is reported at reduced confidence.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
What to do
Resolve the 6 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (6). — One of this dimension's main actionable groups (6 issue-level).
Resolve the 1 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 5 Medium advisory (unsound) finding(s) in Dependency Vulnerabilities — start with REDACTED (5). — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D32 · Data Compliance (PII/GDPR)3.4 / 10Weak✓ Tool-verified
What it measures: Likely personal-data (PII / GDPR) handling concerns — logging or storing data without safeguards.
Method: Heuristic PII/GDPR LEAK scan via semgrep across the repo, using Watchdog's own ruleset: personal data crossing a boundary it should not — reaching a log/console sink, a URL or query string, or unprotected browser storage. Matches map to severity and a 0-10 wide normalizer. A clean sweep is unscored rather than an unearned 10, and is a statement about the leak paths checked only — this dimension does not inventory the personal data a repository holds (the personal-data map and the C1-C5 compliance cards do that), so it never reports that a repository has no personal-data surface. Reported LOUDLY as a measurement gap if the ruleset is missing from the analyzer image. Exhaustive over the leak paths, advisory-leaning; degrades on parse failure.
8 finding(s): 0 critical, 1 high, 7 medium, 0 low. semgrep could not parse 2 file(s) — `43_Hammurabi/csharp/Rules.cs`, `53_King/kotlin/King.kt` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
REDACTED
REDACTED
What to do
Resolve the 7 REDACTED finding(s) in Data Compliance (PII/GDPR) — start with REDACTED (4), REDACTED (3). — One of this dimension's main actionable groups (7 warning-level).
Resolve the 1 REDACTED finding(s) in Data Compliance (PII/GDPR) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d32_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
118 of 118 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is 88_3-D_Tic-Tac-Toe/csharp/Qubic.cs. Counted over 118 of the 453 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Most significant orphaned file · ×388_3-D_Tic-Tac-Toe/csharp/Qubic.cs:1
Dormant codebase
What to do
Resolve the 115 Orphaned file finding(s) in Knowledge Freshness — start with REDACTED (20), Game.cs (11), View.cs (6). — One of this dimension's main actionable groups (115 recommendation-level).
Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with Qubic.cs, REDACTED, Game.cs. — One of this dimension's main actionable groups (3 recommendation-level).
Resolve the 1 Dormant codebase 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.
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.
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.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
5 end-of-life runtime(s) and 0 end-of-life framework(s), read from 200 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
Resolve the 5 End-of-life runtime finding(s) in Platform End-of-Life — start with Tower.csproj, Weekday.csproj, Roulette.csproj. — One of this dimension's main actionable groups (5 warning-level).
Detailed fixes: d44_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
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.
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.
The namespaces Games.Common.IO ↔ Games.Common.Randomness ↔ Salvo ↔ Salvo.Ships ↔ Salvo.Targetting depend on each other. The lightest dependency in the cycle is Games.Common.IO → Salvo (Games.Common.IO.IOExtensions → Salvo.Position, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface. — 77_Salvo/csharp/Extensions/IOExtensions.cs:3
The namespaces Basketball ↔ Basketball.Plays depend on each other. The lightest dependency in the cycle is Basketball → Basketball.Plays (Basketball.Team → Basketball.Plays.Play, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface. — 07_Basketball/csharp/Team.cs:1
The namespaces BugGame.Parts ↔ BugGame.Resources depend on each other. The lightest dependency in the cycle is BugGame.Resources → BugGame.Parts (BugGame.Resources.Message → BugGame.Parts.Part, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface. — 16_Bug/csharp/Resources/Message.cs:1
The namespaces Game ↔ Game.Events depend on each other. The lightest dependency in the cycle is Game → Game.Events (Game.BullFight → Game.Events.Event, 2 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface. — 17_Bullfight/csharp/BullFight.cs:9
The namespaces Poker ↔ Poker.Players depend on each other. The lightest dependency in the cycle is Poker.Players → Poker (Poker.Players.Player → Poker.Table, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface. — 71_Poker/csharp/Players/Player.cs:5
The namespaces SuperStarTrek ↔ SuperStarTrek.Objects ↔ SuperStarTrek.Space ↔ SuperStarTrek.Systems ↔ SuperStarTrek.Systems.ComputerFunctions depend on each other. The lightest dependency in the cycle is SuperStarTrek → SuperStarTrek.Objects (SuperStarTrek.Game → SuperStarTrek.Objects.Enterprise, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface. — 84_Super_Star_Trek/csharp/Game.cs:4
What to do
Break namespace cycles inside a project by moving the shared type to a namespace both sides can use, or by inverting the back edge behind an interface.
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.
Other · Architecture — Whether the codebase has a recognisable, scale-appropriate structure (a named architectural style, or modular enough for its size) rather than being an ad-hoc ball of mud.
Method: Roslyn plus csproj analysis: architecture style detection (DDD, clean, vertical-slice, CQRS) and structure fitness for repo size. Deterministic.
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.
`IReadWrite` declares 17 members under just 10 distinct name(s): `ReadCharacter`, `ReadNumber`, `Read2Numbers`, `Read3Numbers`, `Read4Numbers`, `ReadNumbers`, `ReadString`, `Read2Strings`, `Write`, `WriteLine`, `Write`, `WriteLine`, `Write`, `WriteLine`, `Write`, `WriteLine`, `Write`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. That is an OVERLOAD SET, not 17 separate responsibilities: a caller binds to 10 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 17 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface. — 00_Common/dotnet/Games.Common/IO/IReadWrite.cs:8
What to do
Collapse overload sets (optional/default parameters, or an options object) — these interfaces are wide in SIGNATURES, not in responsibilities, so segregating them would relieve no caller.
Do you agree with this assessment?
AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified
Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.
Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Do you agree with this assessment?
C1 · Data Protection0.0 / 10Critical✓ Tool-verified
Other · Security — Whether sensitive data is encrypted at rest and in transit and keys are vaulted.
Method: Roslyn plus filesystem scan: encryption presence (EF ColumnEncryption, key-vault references, HTTPS enforcement) and key-derivation KDF detection. Deterministic.
No data-protection or encryption usage (ASP.NET Data Protection, AES, column encryption, PBKDF2) was found — sensitive data at rest may be unprotected. If TDE/KMS/vault is delegated to infrastructure, ignore.
What to do
Encrypt sensitive data at rest (ASP.NET Core Data Protection / column encryption) and manage keys in a vault. Skip if delegated to infra (Postgres TDE, KMS, etc.).
Enforce HTTPS (UseHttpsRedirection / RequireHttpsMetadata) so data in transit is always encrypted.
Other · Code Health — Unreviewed-generation residue: shipped members still throwing NotImplementedException, and placeholder string literals left in 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.
Other · Code Health — Unfinished work detected by code SHAPE, not keywords: members that only throw a "not implemented" exception, methods that take inputs and return a constant, async methods that never await, dead `if (false)` / `#if false` branches, and skeleton types most of whose members are holes. A real, objective slice of technical debt.
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 line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers). (×9) — 00_Utilities/DotnetUtils/DotnetUtils/Functions.cs:30, 05_Bagels/csharp/BagelNumber.cs:60, 05_Bagels/csharp/BagelNumber.cs:66, …
What to do
Clear the softer debt: remove commented-out code and dead branches, re-enable or delete skipped tests, and replace blanket warning suppressions with targeted ones.
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.
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 a README to the 18 of 202 project(s) that lack one — worth up to 0.2 pts.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
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.
Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
Only 3/202 projects share a common root namespace — the code's module identity is inconsistent.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
Adopt a consistent root-namespace convention (a shared prefix, e.g. Acme.*); short project-file/directory names are fine as long as the RootNamespace is uniform.
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.
No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
What to do
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the `catch` blocks that emit nothing — a discarded exception is the failure the user cannot describe and you cannot reproduce.
For more than a log file, an `ActivitySource`/`EventSource` the user can switch on gives you a structured trace to attach to a bug report. A health-check endpoint does not apply here: nothing orchestrates or load-balances a binary the user launches.
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 CodeQL's csharp pack, or a .NET security analyzer package (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 2331 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: CodeQL's csharp pack, or a .NET security analyzer package — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
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?
R1 · Type Safety0.0 / 10Critical✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
0 typed · 108 plain JS — the untyped files are 00_Common/javascript/WebTerminal/HtmlTerminal.js, 00_Common/javascript/WebTerminal/terminal_tests.mjs, 00_Common/javascript/common.mjs, 00_Utilities/build-index.js, 00_Utilities/find-missing-implementations.js, 00_Utilities/find-unimplemented.js (+102 more).
What to do
Adopt TypeScript for the frontend: add a typecheck step to the build, then either type-check the existing JavaScript in place (`checkJs`/JSDoc types) or convert the highest-traffic modules first — no file is typed today, so this is an adoption, not a clean-up.
React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.
92 duplicated blocks under the repository root have copies in at least two of the sibling directories 01_Acey_Ducey, 02_Amazing, 03_Animal, 04_Awari, 05_Bagels, 06_Banner (+87 more sibling(s) not listed) — 59 of them are reported below, and 33 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 92 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 92 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 92 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — 51_Hurkle/javascript/hurkle.js:6
51_Hurkle/javascript/hurkle.js:6 · 92_Trap/javascript/trap.js:6 — the two spans are one implementation copied and then locally edited — 382 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 51_Hurkle/javascript/hurkle.js:6
30_Cube/javascript/cube.js:6 · 34_Digits/javascript/digits.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — 30_Cube/javascript/cube.js:6
13_Bounce/javascript/bounce.js:6 · 22_Change/javascript/change.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — 13_Bounce/javascript/bounce.js:6
08_Batnum/javascript/batnum.js:6 · 24_Chemist/javascript/chemist.js:6 · 47_Hi-Lo/javascript/hi-lo.js:6 · 66_Number/javascript/number.js:6 — the 4 copies are spread across 4 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — 08_Batnum/javascript/batnum.js:6
36_Flip_Flop/javascript/flipflop.js:6 · 62_Mugwump/javascript/mugwump.js:6 · 68_Orbit/javascript/orbit.js:6 — the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — 36_Flip_Flop/javascript/flipflop.js:6
49_Hockey/javascript/hockey.js:6 · 50_Horserace/javascript/horserace.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — 49_Hockey/javascript/hockey.js:6
15_Boxing/javascript/boxing.js:6 · 28_Combat/javascript/combat.js:6 — the two spans are one implementation copied and then locally edited — 252 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 15_Boxing/javascript/boxing.js:6
28_Combat/javascript/combat.js:6 · 57_Literature_Quiz/javascript/litquiz.js:6 — the two spans are one implementation copied and then locally edited — 263 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 28_Combat/javascript/combat.js:6
67_One_Check/javascript/onecheck.js:6 · 81_Splat/javascript/splat.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — 67_One_Check/javascript/onecheck.js:6
35_Even_Wins/javascript/gameofevenwins.js:6 · 76_Russian_Roulette/javascript/russianroulette.js:6 — the two spans are one implementation copied and then locally edited — 235 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 35_Even_Wins/javascript/gameofevenwins.js:6
18_Bullseye/javascript/bullseye.js:6 · 65_Nim/javascript/nim.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — 18_Bullseye/javascript/bullseye.js:6
25_Chief/javascript/chief.js:6 · 32_Diamond/javascript/diamond.js:6 · 34_Digits/javascript/digits.js:6 — the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — 25_Chief/javascript/chief.js:6
29_Craps/javascript/craps.js:6 · 57_Literature_Quiz/javascript/litquiz.js:6 — the two spans are one implementation copied and then locally edited — 237 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 29_Craps/javascript/craps.js:6
61_Math_Dice/javascript/mathdice.js:6 · 80_Slots/javascript/slots.js:6 — the two spans are one implementation copied and then locally edited — 232 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 61_Math_Dice/javascript/mathdice.js:6
63_Name/javascript/name.js:6 · 64_Nicomachus/javascript/nicomachus.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — 63_Name/javascript/name.js:6
70_Poetry/javascript/poetry.js:6 · 86_Target/javascript/target.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — 70_Poetry/javascript/poetry.js:6
35_Even_Wins/javascript/evenwins.js:6 · 55_Life/javascript/life.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — 35_Even_Wins/javascript/evenwins.js:6
15_Boxing/javascript/boxing.js:6 · 43_Hammurabi/javascript/hammurabi.js:6 — the two spans are one implementation copied and then locally edited — 224 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 15_Boxing/javascript/boxing.js:6
29_Craps/javascript/craps.js:6 · 80_Slots/javascript/slots.js:6 — the two spans are one implementation copied and then locally edited — 231 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 29_Craps/javascript/craps.js:6
31_Depth_Charge/javascript/depthcharge.js:6 · 43_Hammurabi/javascript/hammurabi.js:6 — the two spans are one implementation copied and then locally edited — 224 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 31_Depth_Charge/javascript/depthcharge.js:6
35_Even_Wins/javascript/gameofevenwins.js:6 · 91_Train/javascript/train.js:6 — the two spans are one implementation copied and then locally edited — 224 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 35_Even_Wins/javascript/gameofevenwins.js:6
14_Bowling/javascript/bowling.js:6 · 73_Reverse/javascript/reverse.js:6 — the two spans are one implementation copied and then locally edited — 208 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 14_Bowling/javascript/bowling.js:6
28_Combat/javascript/combat.js:6 · 33_Dice/javascript/dice.js:6 — the two spans are one implementation copied and then locally edited — 222 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 28_Combat/javascript/combat.js:6
29_Craps/javascript/craps.js:6 · 35_Even_Wins/javascript/gameofevenwins.js:6 — the two spans are one implementation copied and then locally edited — 219 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 29_Craps/javascript/craps.js:6
31_Depth_Charge/javascript/depthcharge.js:6 · 33_Dice/javascript/dice.js:6 — the two spans are one implementation copied and then locally edited — 222 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 31_Depth_Charge/javascript/depthcharge.js:6
37_Football/javascript/football.js:248 · 37_Football/javascript/football.js:445 — 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. — 37_Football/javascript/football.js:248
12_Bombs_Away/javascript/bombsaway.js:6 · 29_Craps/javascript/craps.js:6 — the two spans are one implementation copied and then locally edited — 209 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 12_Bombs_Away/javascript/bombsaway.js:6
16_Bug/javascript/bug.js:199 · 16_Bug/javascript/bug.js:277 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — 16_Bug/javascript/bug.js:199
73_Reverse/javascript/reverse.js:6 · 80_Slots/javascript/slots.js:6 — the two spans are one implementation copied and then locally edited — 205 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 73_Reverse/javascript/reverse.js:6
09_Battle/javascript/battle.js:6 · 10_Blackjack/javascript/blackjack.js:6 · 49_Hockey/javascript/hockey.js:6 · 50_Horserace/javascript/horserace.js:6 · +3 more site(s) not listed — the 7 copies are spread across 7 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 7 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — 09_Battle/javascript/battle.js:6
31_Depth_Charge/javascript/depthcharge.js:6 · 59_Lunar_LEM_Rocket/javascript/lem.js:6 — the two spans are one implementation copied and then locally edited — 207 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 31_Depth_Charge/javascript/depthcharge.js:6
59_Lunar_LEM_Rocket/javascript/lem.js:6 · 76_Russian_Roulette/javascript/russianroulette.js:6 — the two spans are one implementation copied and then locally edited — 207 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 59_Lunar_LEM_Rocket/javascript/lem.js:6
09_Battle/javascript/battle.js:80 · 09_Battle/javascript/battle.js:149 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — 09_Battle/javascript/battle.js:80
12_Bombs_Away/javascript/bombsaway.js:6 · 43_Hammurabi/javascript/hammurabi.js:6 — the two spans are one implementation copied and then locally edited — 191 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — 12_Bombs_Away/javascript/bombsaway.js:6
02_Amazing/javascript/amazing.js:6 · 03_Animal/javascript/animal.js:6 · 04_Awari/javascript/awari.js:6 · 05_Bagels/javascript/bagels.js:6 · +85 more site(s) not listed — the 89 copies are spread across 85 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 89 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — 02_Amazing/javascript/amazing.js:6
16_Bug/javascript/bug.js:6 · REDACTED:10 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — 16_Bug/javascript/bug.js:6
02_Amazing/javascript/amazing.js:11 · 03_Animal/javascript/animal.js:11 · 42_Gunner/javascript/gunner.js:11 — the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — 02_Amazing/javascript/amazing.js:11
04_Awari/javascript/awari.js:11 · 05_Bagels/javascript/bagels.js:11 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — 04_Awari/javascript/awari.js:11
09_Battle/javascript/battle.js:11 · 10_Blackjack/javascript/blackjack.js:11 · 49_Hockey/javascript/hockey.js:11 · 50_Horserace/javascript/horserace.js:11 · +2 more site(s) not listed — the 6 copies are spread across 6 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 6 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete. — 09_Battle/javascript/battle.js:11
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
main has cyclomatic complexity 133 and cognitive complexity 419; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 77_Salvo/javascript/salvo.js:89
main has cyclomatic complexity 113 and cognitive complexity 274; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 37_Football/javascript/ftball.js:99
main has cyclomatic complexity 111 and cognitive complexity 425; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 09_Battle/javascript/battle.js:53
main has cyclomatic complexity 93 and cognitive complexity 201; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 27_Civil_War/javascript/civilwar.js:71
main has cyclomatic complexity 92 and cognitive complexity 315; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 10_Blackjack/javascript/blackjack.js:208
main has cyclomatic complexity 83 and cognitive complexity 226; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 37_Football/javascript/football.js:124
main has cyclomatic complexity 83 and cognitive complexity 169; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 49_Hockey/javascript/hockey.js:54
main has cyclomatic complexity 80 and cognitive complexity 221; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 02_Amazing/javascript/amazing.js:54
main has cyclomatic complexity 77 and cognitive complexity 269; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 88_3-D_Tic-Tac-Toe/javascript/qubit.js:204
main has cyclomatic complexity 75 and cognitive complexity 170; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 75_Roulette/javascript/roulette.js:54
main has cyclomatic complexity 74 and cognitive complexity 246; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 89_Tic-Tac-Toe/javascript/tictactoe2.js:110
main has cyclomatic complexity 74 and cognitive complexity 218; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 71_Poker/javascript/poker.js:436
main has cyclomatic complexity 72 and cognitive complexity 180; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 46_Hexapawn/javascript/hexapawn.js:119
main has cyclomatic complexity 70 and cognitive complexity 260; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 65_Nim/javascript/nim.js:50
main has cyclomatic complexity 70 and cognitive complexity 159; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 53_King/javascript/king.js:55
main has cyclomatic complexity 67 and cognitive complexity 216; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 39_Golf/javascript/golf.js:91
main has cyclomatic complexity 57 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 81_Splat/javascript/splat.js:48
main has cyclomatic complexity 56 and cognitive complexity 156; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 23_Checkers/javascript/checkers.js:122
main has cyclomatic complexity 53 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 30_Cube/javascript/cube.js:46
main has cyclomatic complexity 50 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — 44_Hangman/javascript/hangman.js:68
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files6.7 / 10Adequate✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
84_Super_Star_Trek/javascript/superstartrek.mjs has 1506 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — 84_Super_Star_Trek/javascript/superstartrek.mjs:1
71_Poker/javascript/poker.js has 727 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — 71_Poker/javascript/poker.js:1
10_Blackjack/javascript/blackjack.js has 521 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — 10_Blackjack/javascript/blackjack.js:1
27_Civil_War/javascript/civilwar.js has 520 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — 27_Civil_War/javascript/civilwar.js:1
37_Football/javascript/ftball.js has 494 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — 37_Football/javascript/ftball.js:1
77_Salvo/javascript/salvo.js has 492 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — 77_Salvo/javascript/salvo.js:1
37_Football/javascript/football.js has 489 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — 37_Football/javascript/football.js:1
49_Hockey/javascript/hockey.js has 455 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — 49_Hockey/javascript/hockey.js:1
88_3-D_Tic-Tac-Toe/javascript/qubit.js has 432 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — 88_3-D_Tic-Tac-Toe/javascript/qubit.js:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Do you agree with this assessment?
R4 · Test Coverage0.0 / 10Critical✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
0% of 108 production file(s) reachable from 0 test file(s) via the import graph — 'production' here is the RESIDUE: every source file left once tests, tooling, generated output, config, declarations and declaration-only modules, fixture corpora, type fixtures, behaviour-free data modules, re-export barrels, registration/constant data modules and service workers are set aside, so the percentage is taken over a smaller denominator than the workspace's file count
What to do
Add tests that import the unreached modules (directly or through their public entry).
React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).
Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
Do you agree with this assessment?
R7 · Dead Code9.6 / 10Exemplary✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
Unreachable from the 101 application, 6 tooling and 0 test entry point(s) detected in this repo. Gate removals on `npm run build` — an undetected custom entry would make these reachable.
no import path from any entry point (101 application, 6 tooling, 0 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×2) — 00_Utilities/find-missing-implementations.js, 00_Utilities/find-unimplemented.js
This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it. (×3) — 01_Acey_Ducey/javascript/aceyducey.js:148, 01_Acey_Ducey/javascript/aceyducey.js:156, 01_Acey_Ducey/javascript/aceyducey.js:206
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Security — Cryptographic hygiene (weak hash/cipher, password key-derivation). This codebase has no web surface, so transport/header/cookie/CSRF controls are N/A and only crypto is scored. Markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself — a page handed to a consumer runs in that consumer's origin.
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.
`https://unpkg.com/xterm@4.10.0/lib/xterm.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. 2 such include(s) across the repository's markup. — 84_Super_Star_Trek/javascript/index.html:174
What to do
Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
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.
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.
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.
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.
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.
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.
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 `ArgumentNullException` 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.
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.
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.
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.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped5.4 / 10Adequate✓ Tool-verified
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.
`htmlContent` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — 00_Common/javascript/WebTerminal/HtmlTerminal.js:116
What to do
Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
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.
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 a `foreach` leaves the collection it is walking alone — a body that adds to or removes from the very collection the loop is enumerating invalidates the enumerator it is holding, so the next `MoveNext` throws `InvalidOperationException` and the remaining items 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.
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?
X32 · Type resolved by simple name across every loaded assembly10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a plugin lookup names the type it means — searching every assembly loaded into the process for a candidate whose SIMPLE name equals a string supplied at runtime, and taking the first one found, is decided by assembly LOAD ORDER rather than by this source, so the same name can resolve to a different type on the next run.
Method: Roslyn syntax only, no semantic model: every invocation of `First`/`FirstOrDefault`/`Single`/`SingleOrDefault` whose OWN expression subtree contains both a `GetAssemblies()` call and a `GetTypes()`/`GetExportedTypes()` call — a single-element pick out of every type loaded into the process. A nested selector in the same chain sees no `GetAssemblies()` in its own subtree and is outside the population, so one lookup counts once however many links its chain has. A finding additionally needs both remaining halves: the selector must be `First`/`FirstOrDefault` (`Single`/`SingleOrDefault` reports the ambiguity rather than resolving it, and is counted and never reported), and the chain must carry an `==` comparison of `<lambda parameter>.Name` against something that is not a literal. The receiver must be a plain identifier bound by one of the chain’s own lambdas, which places `assembly.GetName().Name == "X"` outside the rule by construction. One exemption: a `.Name` test joined by `&&` to a `FullName`/`AssemblyQualifiedName` test on the same identifier is spared; joined by `||` it is not. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. 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 `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
Other · Code Health — Whether nullable reference types are enabled and not undermined by heavy `!` suppression.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
61/99 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
~0.1 `!` suppressions per 1k syntax nodes — 6 suppression(s) across the 75180 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a `!` can suppress anything in (a `!` under `#nullable disable` is inert and is not counted, and its file's nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide.
What to do
Enable <Nullable>enable</Nullable> across all projects and resolve warnings rather than suppressing with `!`.
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.
Unscored — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
D36 Supply-chain Provenance & Signing — 3 observation(s) recorded · The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
SC1 Supply-chain hygiene — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 6 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Repo shows no audit-logging mechanism (IAuditable, an immutable audit log, an EF SaveChanges interceptor) for sensitive changes — absence of evidence is not evidence of a working control. Record an audit trail in code (or document where it lives) so this dimension can be scored.
C4 Data Retention — Repo shows no data-retention / TTL / cleanup mechanism for personal data — absence of evidence is not evidence of a working control. Define retention periods and a purge/cleanup job (or TTL) in code, or document where retention is enforced, so this dimension can be scored.
C5 Data-Subject Rights — Repo shows no corroborated data-subject-rights mechanism (erasure / export-portability / consent) tied to a subject id or GDPR vocabulary — absence of evidence is not evidence of a working control. Implement erasure, data export/portability and consent tracking over the subject's records.
P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
P6 Release Hygiene — not evidenced — no changelog, version stamp or semver release tag in the repo
Not included — 45 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 user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC2 Forms & labels — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC3 Page structure — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC4 Keyboard semantics — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC5 ARIA correctness — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC6 Visual & motion safety — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AC7 A11y enforcement — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
AX1 Captive dependencies — no DI registrations detected
AX2 Stateful singletons — no singleton implementations detected
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
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.
C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
D11 Test Reliability — Test reliability not scored — polyglot repository, one half has no runner
D12 Dependency Hygiene — Dependency Hygiene not included (time budget)
D16 Bus Factor — dormant codebase — no living knowledge left to concentrate
D18 Solution Shape — D18 scores the shape of a C#/VB .NET solution, but this repository's production source is mostly .bas, .c, .cpp, .exs, .go, .java, .jl, .kt, .lua, .nim, .pas, .pl, .pm, .py, .rb, .rs, .swift, which the C#/VB workspace does not load — the projects that loaded are an immaterial minority, so solution shape was not assessed for this repository. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
D21 Naming Consistency — LLM evaluation failed
D23 Boundary Type-Coupling — Cross-context type coupling could not be assessed — this codebase's bounded contexts are neither declared nor inferable.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 reads resolved call sites in the languages it reads only — this repository's production source is .bas, .c, .cpp, .exs, .go, .java, .jl, .kt, .lua, .nim, .pas, .pl, .pm, .py, .rb, .rs, .swift, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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 — IL not measured — the analyzer's build of the target did not succeed
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.
D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
D8 Code Coverage — Coverage not measured — analyzer environment
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): 1 aggregate root(s) (types guarding their own state behind command methods — this language has no AggregateRoot base to inherit); 53 value object(s)
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and this analysis resolves a call's owner only where the receiver's type is written down in the source. Reported as guidance rather than measured
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
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 — this isn't a service/API/worker
P8 Schema migrations — no EF Core usage detected
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (Cobertura — `dotnet test --collect:"XPlat Code Coverage"` with a `coverlet.collector` PackageReference) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
PF2 Allocation hygiene — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X2 Cancellation propagation — no async method does work a token could cancel
X6 Hand-rolled structured-format parsing — 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.
Namespace dependency cycle 77_Salvo/csharp/Extensions/IOExtensions.cs:3— The namespaces Games.Common.IO ↔ Games.Common.Randomness ↔ Salvo ↔ Salvo.Ships ↔ Salvo.Targetting depend on each other. The lightest dependency in the cycle is Games.Common.IO → Salvo (Games.Common.IO.IOExtensions → Salvo.Position, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface.
Namespace dependency cycle 07_Basketball/csharp/Team.cs:1— The namespaces Basketball ↔ Basketball.Plays depend on each other. The lightest dependency in the cycle is Basketball → Basketball.Plays (Basketball.Team → Basketball.Plays.Play, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface.
Namespace dependency cycle 16_Bug/csharp/Resources/Message.cs:1— The namespaces BugGame.Parts ↔ BugGame.Resources depend on each other. The lightest dependency in the cycle is BugGame.Resources → BugGame.Parts (BugGame.Resources.Message → BugGame.Parts.Part, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface.
Namespace dependency cycle 17_Bullfight/csharp/BullFight.cs:9— The namespaces Game ↔ Game.Events depend on each other. The lightest dependency in the cycle is Game → Game.Events (Game.BullFight → Game.Events.Event, 2 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface.
Namespace dependency cycle 71_Poker/csharp/Players/Player.cs:5— The namespaces Poker ↔ Poker.Players depend on each other. The lightest dependency in the cycle is Poker.Players → Poker (Poker.Players.Player → Poker.Table, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface.
Namespace dependency cycle 84_Super_Star_Trek/csharp/Game.cs:4— The namespaces SuperStarTrek ↔ SuperStarTrek.Objects ↔ SuperStarTrek.Space ↔ SuperStarTrek.Systems ↔ SuperStarTrek.Systems.ComputerFunctions depend on each other. The lightest dependency in the cycle is SuperStarTrek → SuperStarTrek.Objects (SuperStarTrek.Game → SuperStarTrek.Objects.Enterprise, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface.
WriteOnlyPrivateField 34_Digits/csharp/Game.cs:5— private IReadOnlyList<int> _weights — assigned 1 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField 53_King/csharp/Country.cs:8— private IRandom _random — assigned 1 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
WriteOnlyPrivateField 72_Queen/csharp/Game.cs:6— private IRandom _random — assigned 1 time(s), read never — this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments — or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there.
FunctionTooLong: civilwar.main 27_Civil_War/javascript/civilwar.js:71— FunctionTooLong — main runs 391 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 291 over it, 3.91× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: hockey.main 49_Hockey/javascript/hockey.js:54— FunctionTooLong — main runs 366 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 266 over it, 3.66× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: ftball.main 37_Football/javascript/ftball.js:99— FunctionTooLong — main runs 343 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 243 over it, 3.43× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: football.main 37_Football/javascript/football.js:124— FunctionTooLong — main runs 336 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 236 over it, 3.36× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: salvo.main 77_Salvo/javascript/salvo.js:89— FunctionTooLong — main runs 322 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 222 over it, 3.22× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: blackjack.main 10_Blackjack/javascript/blackjack.js:208— FunctionTooLong — main runs 287 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 187 over it, 2.87× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: king.main 53_King/javascript/king.js:55— FunctionTooLong — main runs 285 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 185 over it, 2.85× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: poker.main 71_Poker/javascript/poker.js:436— FunctionTooLong — main runs 270 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 170 over it, 2.70× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: lem.main 59_Lunar_LEM_Rocket/javascript/lem.js:46— FunctionTooLong — main runs 250 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 150 over it, 2.50× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: roulette.main 75_Roulette/javascript/roulette.js:54— FunctionTooLong — main runs 249 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 149 over it, 2.49× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: golf.main 39_Golf/javascript/golf.js:91— FunctionTooLong — main runs 238 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 138 over it, 2.38× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: battle.main 09_Battle/javascript/battle.js:53— FunctionTooLong — main runs 232 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 132 over it, 2.32× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: king::next_round 53_King/rust/src/main.rs:193— FunctionTooLong — king::next_round runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.30× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: amazing.main 02_Amazing/javascript/amazing.js:54— FunctionTooLong — main runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: splat.main 81_Splat/javascript/splat.js:48— FunctionTooLong — main runs 212 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 112 over it, 2.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: bug.main 16_Bug/javascript/bug.js:113— FunctionTooLong — main runs 207 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 107 over it, 2.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: qubit.main 88_3-D_Tic-Tac-Toe/javascript/qubit.js:204— FunctionTooLong — main runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.02× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: bullfight.main 17_Bullfight/javascript/bullfight.js:106— FunctionTooLong — main runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: superstartrek.commandCourseControl 84_Super_Star_Trek/javascript/superstartrek.mjs:544— FunctionTooLong — commandCourseControl runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 80 over it, 1.80× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: hangman.main 44_Hangman/javascript/hangman.js:68— FunctionTooLong — main runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: nim.main 65_Nim/javascript/nim.js:50— FunctionTooLong — main runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: hexapawn.main 46_Hexapawn/javascript/hexapawn.js:119— FunctionTooLong — main runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: hammurabi.main 43_Hammurabi/javascript/hammurabi.js:61— FunctionTooLong — main runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: furtrader.main 38_Fur_Trader/javascript/furtrader.js:55— FunctionTooLong — main runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: slalom.main 79_Slalom/javascript/slalom.js:86— FunctionTooLong — main runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
rust::run (cognitive 86) 43_Hammurabi/rust/src/main.rs:4— rust::run has cognitive complexity 86 (threshold 15). Drivers by points: if/else 28 (71 pts), loops 6 (12 pts), boolean chains 3 (nesting depth added 49). 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.
rust::main (cognitive 49) 31_Depth_Charge/rust/src/main.rs:20— rust::main has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 7 (20 pts), boolean chains 1 (nesting depth added 31). 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.
rust::main (cognitive 49) 73_Reverse/rust/src/main.rs:20— rust::main has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 7 (20 pts), boolean chains 1 (nesting depth added 31). 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.
rust::util::prompt_position (cognitive 42) 30_Cube/rust/src/util.rs:61— rust::util::prompt_position has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rust::main (cognitive 40) 13_Bounce/rust/src/main.rs:19— rust::main has cognitive complexity 40 (threshold 15). Drivers by points: loops 9 (24 pts), if/else 4 (16 pts) (nesting depth added 27). 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.
rust::main (cognitive 29) 04_Awari/rust/src/main.rs:7— rust::main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rust::main (cognitive 29) 75_Roulette/rust/src/main.rs:7— rust::main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rust::run (cognitive 26) 18_Bullseye/rust/src/lib.rs:55— rust::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (9 pts), match/switch 2 (7 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.
rust::guess (cognitive 25) 05_Bagels/rust/src/main.rs:70— rust::guess has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (12 pts), boolean chains 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.
rust::read_valid_guess (cognitive 25) 05_Bagels/rust/src/main.rs:102— rust::read_valid_guess has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 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.
rust::commands::move_enterprise (cognitive 24) 84_Super_Star_Trek/rust/src/commands.rs:129— rust::commands::move_enterprise has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (23 pts), 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.
rust::get_number_from_input (cognitive 22) 68_Orbit/rust/src/lib.rs:169— rust::get_number_from_input has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 pts), boolean chains 2, loops 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.
rust::get_number_from_input (cognitive 21) 18_Bullseye/rust/src/lib.rs:177— rust::get_number_from_input has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 pts), boolean chains 1, loops 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.
rust::get_number_from_input (cognitive 21) 24_Chemist/rust/src/lib.rs:112— rust::get_number_from_input has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 pts), boolean chains 1, loops 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.
rust::get_number_from_input (cognitive 21) 32_Diamond/rust/src/lib.rs:136— rust::get_number_from_input has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 pts), boolean chains 1, loops 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.
rust::get_number_from_input (cognitive 21) 91_Train/rust/src/lib.rs:109— rust::get_number_from_input has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 pts), boolean chains 1, loops 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.
rust::draw::draw_board (cognitive 21) 62_Mugwump/rust/src/draw.rs:3— rust::draw::draw_board has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rust::main (cognitive 19) 45_Hello/rust/src/main.rs:11— rust::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, match/switch 1 (2 pts), loops 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.
rust::main (cognitive 19) 63_Name/rust/src/main.rs:11— rust::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, match/switch 1 (2 pts), loops 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.
rust::main (cognitive 19) 84_Super_Star_Trek/rust/src/main.rs:11— rust::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, match/switch 1 (2 pts), loops 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.
rust::prompt_numbers (cognitive 18) 92_Trap/rust/src/main.rs:66— rust::prompt_numbers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 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.
rust::finish_cell_transitions (cognitive 16) 55_Life/rust/src/main.rs:167— rust::finish_cell_transitions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (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.
rust::commands::get_power_and_fire_phasers (cognitive 16) 84_Super_Star_Trek/rust/src/commands.rs:397— rust::commands::get_power_and_fire_phasers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rust::util::prompt (cognitive 16) 50_Horserace/rust/src/util.rs:9— rust::util::prompt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (4 pts), 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.
rust::util::prompt (cognitive 16) 72_Queen/rust/src/util.rs:9— rust::util::prompt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (4 pts), 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.
Dead code: Reseed 00_Common/dotnet/Games.Common/Randomness/IRandom.cs:24— Method Reseed — Roslyn's SymbolFinder walked every project the solution loads, including Games.Common, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: Previous 00_Common/dotnet/Games.Common/Randomness/IRandomExtensions.cs:59— Method Previous — Roslyn's SymbolFinder walked every project the solution loads, including Games.Common, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: Previous 00_Common/dotnet/Games.Common/Randomness/IRandomExtensions.cs:66— Method Previous — Roslyn's SymbolFinder walked every project the solution loads, including Games.Common, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: RunProcessAsync 00_Utilities/DotnetUtils/DotnetUtils/Methods.cs:48— Method RunProcessAsync — Roslyn's SymbolFinder walked every project the solution loads, including DotnetUtils, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: tryBuild 00_Utilities/DotnetUtils/DotnetUtils/Program.cs:302— Method tryBuild — Roslyn's SymbolFinder walked every project the solution loads, including DotnetUtils, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: Generate 73_Reverse/csharp/Reverse.Tests/Generators/PositiveIntegerGenerator.cs:7— Method Generate — Roslyn's SymbolFinder walked every project the solution loads, including Reverse.Tests, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: ReseedRNG 33_Dice/csharp/RollGenerator.cs:10— Method ReseedRNG — Roslyn's SymbolFinder walked every project the solution loads, including Dice, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
Dead code: StartTurn 38_Fur_Trader/csharp/GameState.cs:35— Method StartTurn — Roslyn's SymbolFinder walked every project the solution loads, including FurTrader, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository — a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol's name, and any project the workspace could not load. This is 'no caller found by this walk', not a verdict that the symbol is unused.
rust::run (cyclomatic 33) 43_Hammurabi/rust/src/main.rs:4— rust::run 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.
rust::main (cyclomatic 20) 45_Hello/rust/src/main.rs:11— rust::main 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.
rust::main (cyclomatic 20) 63_Name/rust/src/main.rs:11— rust::main 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.
rust::main (cyclomatic 20) 84_Super_Star_Trek/rust/src/main.rs:11— rust::main 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.
rust::main (cyclomatic 16) 31_Depth_Charge/rust/src/main.rs:20— rust::main 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.
rust::main (cyclomatic 16) 73_Reverse/rust/src/main.rs:20— rust::main 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.
FileTooLong: docs/app.js 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js— FileTooLong — 3307 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2807 over it, 6.61× 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: javascript/superstartrek.mjs 84_Super_Star_Trek/javascript/superstartrek.mjs— FileTooLong — 1131 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 631 over it, 2.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: python/superstartrek.py 84_Super_Star_Trek/python/superstartrek.py— FileTooLong — 914 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 414 over it, 1.83× 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: python/golf.py 39_Golf/python/golf.py— FileTooLong — 616 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 116 over it, 1.23× 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: javascript/poker.js 71_Poker/javascript/poker.js— FileTooLong — 589 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 89 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: REDACTED 39_Golf/csharp/Program.cs— FileTooLong — 531 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 31 over it, 1.06× 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.
MethodTooLong: BombsAway.play 12_Bombs_Away/java/src/BombsAway.java:141— MethodTooLong — play runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Hamurabi.play 43_Hammurabi/java/src/Hamurabi.java:67— MethodTooLong — play runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Game.SetShip 09_Battle/csharp/Game.cs:32— MethodTooLong — SetShip runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Game.ProcessExpeditionOutcome 38_Fur_Trader/csharp/Game.cs:208— MethodTooLong — ProcessExpeditionOutcome runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: BullFight.Begin 17_Bullfight/csharp/BullFight.cs:25— MethodTooLong — Begin runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: TicTacToe2.main 89_Tic-Tac-Toe/java/src/TicTacToe2.java:8— MethodTooLong — main runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Duplicated block (5 lines × 2) 61_Math_Dice/csharp/StringExtensions.cs:9— 61_Math_Dice/csharp/StringExtensions.cs:9-13 | 63_Name/csharp/StringExtensions.cs:11-15 — before extracting anything, compare `61_Math_Dice/csharp/StringExtensions.cs` and `63_Name/csharp/StringExtensions.cs` as WHOLE FILES: 85% 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (5 lines × 2) 75_Roulette/csharp/Wheel.cs:15— 75_Roulette/csharp/Wheel.cs:15-19 | 75_Roulette/csharp/Wheel.cs:33-37 — 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.
Duplicated block (5 lines × 2) 19_Bunny/java/src/Bunny.java:99— 19_Bunny/java/src/Bunny.java:99-103 | 74_Rock_Scissors_Paper/java/src/RockScissors.java:167-171 — 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 (5 lines × 2) 38_Fur_Trader/java/src/FurTrader.java:389— 38_Fur_Trader/java/src/FurTrader.java:389-393 | 52_Kinema/java/src/Kinema.java:120-124 — 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 (5 lines × 2) 49_Hockey/python/hockey.py:277— 49_Hockey/python/hockey.py:277-281 | 49_Hockey/python/hockey.py:283-287 — 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.
Duplicated block (5 lines × 2) REDACTED:243— REDACTED:243-247 | REDACTED:273-277 — 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 `REDACTED:243` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) 08_Batnum/java/src/BatNum.java:235— 08_Batnum/java/src/BatNum.java:235-241 | 11_Bombardment/java/src/Bombardment.java:304-310 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `08_Batnum/java/src/BatNum.java:232` calls `simulateTabs` and `11_Bombardment/java/src/Bombardment.java:303` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 2) 08_Batnum/java/src/BatNum.java:236— 08_Batnum/java/src/BatNum.java:236-242 | 47_Hi-Lo/java/src/HiLo.java:143-149 — 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 (7 lines × 2) 11_Bombardment/java/src/Bombardment.java:307— 11_Bombardment/java/src/Bombardment.java:307-313 | 62_Mugwump/java/src/Mugwump.java:136-142 — 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 (7 lines × 2) 58_Love/java/src/Love.java:100— 58_Love/java/src/Love.java:100-106 | 62_Mugwump/java/src/Mugwump.java:131-137 — 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 (7 lines × 2) 49_Hockey/python/hockey.py:412— 49_Hockey/python/hockey.py:412-419 | 49_Hockey/python/hockey.py:452-458 — 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 `49_Hockey/python/hockey.py:412` 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 2) 60_Mastermind/rust/Mastermind/src/main.rs:367— 60_Mastermind/rust/Mastermind/src/main.rs:367-373 | 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs:375-381 — 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.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×5
Duplicated block (6 lines × 2) 22_Change/java/src/Change.java:147— 22_Change/java/src/Change.java:147-152 | 43_Hammurabi/java/src/Hamurabi.java:324-329 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `22_Change/java/src/Change.java:147` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) 25_Chief/java/src/Chief.java:103— 25_Chief/java/src/Chief.java:103-108 | 25_Chief/java/src/Chief.java:109-114 — 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.
Duplicated block (6 lines × 2) 41_Guess/java/src/Guess.java:110— 41_Guess/java/src/Guess.java:110-115 | 80_Slots/java/src/Slots.java:204-209 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `41_Guess/java/src/Guess.java:110` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) 51_Hurkle/java/src/Hurkle.java:147— 51_Hurkle/java/src/Hurkle.java:147-153 | 92_Trap/java/src/Trap.java:128-133 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 2) 16_Bug/java/src/ComputerBug.java:7— 16_Bug/java/src/ComputerBug.java:7-12 | 16_Bug/java/src/PlayerBug.java:7-12 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
End-of-life runtime: .NET net5.0 90_Tower/csharp/Tower.csproj:5— 90_Tower/csharp/Tower.csproj declares .NET net5.0 as this project's target framework, and .NET 5, support ended 2022-05-10. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-05-10 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
End-of-life runtime: .NET net6.0 95_Weekday/csharp/Weekday.csproj:4— 95_Weekday/csharp/Weekday.csproj declares .NET net6.0 as this project's target framework, and .NET 6 LTS, support ended 2024-11-12. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2024-11-12 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
End-of-life runtime: .NET net7.0 75_Roulette/csharp/Roulette.csproj:4— 75_Roulette/csharp/Roulette.csproj declares .NET net7.0 as this project's target framework, and .NET 7, support ended 2024-05-14. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2024-05-14 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
End-of-life runtime: .NET netcoreapp2.1 11_Bombardment/csharp/Bombardment.csproj:5— 11_Bombardment/csharp/Bombardment.csproj declares .NET netcoreapp2.1 as this project's target framework, and .NET Core 2.1, support ended 2021-08-21. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2021-08-21 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
End-of-life runtime: .NET netcoreapp3.1 96_Word/csharp/word.csproj:5— 96_Word/csharp/word.csproj declares .NET netcoreapp3.1 as this project's target framework, and .NET Core 3.1 LTS, support ended 2022-12-13. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-12-13 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended.
Game::draw (cognitive 24) 72_Queen/rust/src/game.rs:115— Game::draw has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 2, 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.
Game::get_disk_to_move (cognitive 23) 90_Tower/rust/src/game.rs:90— Game::get_disk_to_move has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 15). 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.
Game::play_turn (cognitive 19) 04_Awari/rust/src/main.rs:68— Game::play_turn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, match/switch 1 (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.
Game::get_guess (cognitive 16) 51_Hurkle/rust/src/game.rs:31— Game::get_guess has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (3 pts), match/switch 1 (3 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.
Duplicated block (6 lines × 3) 09_Battle/csharp/Game.cs:64— 09_Battle/csharp/Game.cs:64-69 | 09_Battle/csharp/Game.cs:145-150 | 09_Battle/csharp/Game.cs:186-191 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (6 lines × 3) 08_Batnum/java/src/BatNum.java:235— 08_Batnum/java/src/BatNum.java:235-240 | 11_Bombardment/java/src/Bombardment.java:309-314 | 57_Literature_Quiz/java/src/LiteratureQuiz.java:132-137 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times.
Duplicated block (6 lines × 3) 08_Batnum/java/src/BatNum.java:236— 08_Batnum/java/src/BatNum.java:236-241 | 11_Bombardment/java/src/Bombardment.java:305-310 | 47_Hi-Lo/java/src/HiLo.java:143-148 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times.
Duplicated block (6 lines × 3) 11_Bombardment/java/src/Bombardment.java:304— 11_Bombardment/java/src/Bombardment.java:304-309 | 18_Bullseye/java/src/Bullseye.java:136-141 | 69_Pizza/java/src/Pizza.java:226-231 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `69_Pizza/java/src/Pizza.java:235` calls `displayMoreDirections` and `11_Bombardment/java/src/Bombardment.java:311` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) 27_Civil_War/java/src/CivilWar.java:580— 27_Civil_War/java/src/CivilWar.java:580-588 | 30_Cube/java/src/Cube.java:153-161 — 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 (9 lines × 2) 07_Basketball/python/basketball.py:271— 07_Basketball/python/basketball.py:271-279 | 07_Basketball/python/basketball.py:311-319 — 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 `07_Basketball/python/basketball.py:271` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `07_Basketball/python/basketball.py:269` calls `random` and `07_Basketball/python/basketball.py:310` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) 02_Amazing/ruby/amazing.rb:154— 02_Amazing/ruby/amazing.rb:154-162 | 02_Amazing/ruby/amazing.rb:166-174 — 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.
Duplicated block (9 lines × 2) 10_Blackjack/rust/src/main.rs:565— 10_Blackjack/rust/src/main.rs:565-573 | 10_Blackjack/rust/src/main.rs:600-608 — 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.
R10 · Code Duplication· Duplicated block with local edits (42 matched lines × 2 locations) · ×4
Duplicated block with local edits (42 matched lines × 2 locations) 15_Boxing/javascript/boxing.js:6— 15_Boxing/javascript/boxing.js:6 · 43_Hammurabi/javascript/hammurabi.js:6 — the two spans are one implementation copied and then locally edited — 224 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (42 matched lines × 2 locations) 29_Craps/javascript/craps.js:6— 29_Craps/javascript/craps.js:6 · 80_Slots/javascript/slots.js:6 — the two spans are one implementation copied and then locally edited — 231 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (42 matched lines × 2 locations) 31_Depth_Charge/javascript/depthcharge.js:6— 31_Depth_Charge/javascript/depthcharge.js:6 · 43_Hammurabi/javascript/hammurabi.js:6 — the two spans are one implementation copied and then locally edited — 224 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (42 matched lines × 2 locations) 35_Even_Wins/javascript/gameofevenwins.js:6— 35_Even_Wins/javascript/gameofevenwins.js:6 · 91_Train/javascript/train.js:6 — the two spans are one implementation copied and then locally edited — 224 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (41 matched lines × 2 locations) · ×4
Duplicated block with local edits (41 matched lines × 2 locations) 14_Bowling/javascript/bowling.js:6— 14_Bowling/javascript/bowling.js:6 · 73_Reverse/javascript/reverse.js:6 — the two spans are one implementation copied and then locally edited — 208 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (41 matched lines × 2 locations) 28_Combat/javascript/combat.js:6— 28_Combat/javascript/combat.js:6 · 33_Dice/javascript/dice.js:6 — the two spans are one implementation copied and then locally edited — 222 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (41 matched lines × 2 locations) 29_Craps/javascript/craps.js:6— 29_Craps/javascript/craps.js:6 · 35_Even_Wins/javascript/gameofevenwins.js:6 — the two spans are one implementation copied and then locally edited — 219 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (41 matched lines × 2 locations) 31_Depth_Charge/javascript/depthcharge.js:6— 31_Depth_Charge/javascript/depthcharge.js:6 · 33_Dice/javascript/dice.js:6 — the two spans are one implementation copied and then locally edited — 222 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
D1 · Cyclomatic Complexity· main (cyclomatic 39) · ×3
main (cyclomatic 39) 28_Combat/javascript/combat.js:46— main has cyclomatic complexity 39 (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.
main (cyclomatic 39) 15_Boxing/javascript/boxing.js:46— main has cyclomatic complexity 39 (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.
main (cyclomatic 39) 11_Bombardment/javascript/bombardment.js:46— main has cyclomatic complexity 39 (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.
mastermind_refactored_for_conventions::play_round_human_codemaker (cognitive 54) 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs:174— mastermind_refactored_for_conventions::play_round_human_codemaker has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 6 (13 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 32). 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.
mastermind_refactored_for_conventions::play_round_computer_codemaker (cognitive 21) 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs:111— mastermind_refactored_for_conventions::play_round_computer_codemaker has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mastermind_refactored_for_conventions::get_number_from_input (cognitive 21) 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs:417— mastermind_refactored_for_conventions::get_number_from_input has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 pts), boolean chains 1, loops 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.
Duplicated block (19 lines × 2) 37_Football/python/football.py:230— 37_Football/python/football.py:230-248 | 37_Football/python/football.py:417-435 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (19 lines × 2) 84_Super_Star_Trek/python/superstartrekins.py:37— 84_Super_Star_Trek/python/superstartrekins.py:37-55 | 84_Super_Star_Trek/python/superstartrekins.py:64-82 — 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.
Duplicated block (19 lines × 2) 07_Basketball/ruby/basketball.rb:238— 07_Basketball/ruby/basketball.rb:238-256 | 07_Basketball/ruby/basketball.rb:283-301 — 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.
Duplicated block (17 lines × 2) 27_Civil_War/python/Civilwar.py:210— 27_Civil_War/python/Civilwar.py:210-226 | 84_Super_Star_Trek/python/superstartrekins.py:49-65 — 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 (17 lines × 2) 84_Super_Star_Trek/python/superstartrekins.py:55— 84_Super_Star_Trek/python/superstartrekins.py:55-71 | 84_Super_Star_Trek/python/superstartrekins.py:117-133 — 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.
Duplicated block (17 lines × 2) 18_Bullseye/rust/src/main.rs:17— 18_Bullseye/rust/src/main.rs:17-33 | 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/main.rs:14-30 — 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 (44 lines × 2 locations) 18_Bullseye/javascript/bullseye.js:6— 18_Bullseye/javascript/bullseye.js:6 · 65_Nim/javascript/nim.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (44 lines × 2 locations) 63_Name/javascript/name.js:6— 63_Name/javascript/name.js:6 · 64_Nicomachus/javascript/nicomachus.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (44 lines × 2 locations) 70_Poetry/javascript/poetry.js:6— 70_Poetry/javascript/poetry.js:6 · 86_Target/javascript/target.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
D1 · Cyclomatic Complexity· main (cyclomatic 83) · ×2
main (cyclomatic 83) 49_Hockey/javascript/hockey.js:54— main has cyclomatic complexity 83 (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.
main (cyclomatic 83) 37_Football/javascript/football.js:124— main has cyclomatic complexity 83 (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.
nim::machines_turn (cyclomatic 35) 65_Nim/rust/src/main.rs:149— nim::machines_turn 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.
nim::main (cyclomatic 28) 65_Nim/rust/src/main.rs:14— nim::main has cyclomatic complexity 28 (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· main (cyclomatic 20) · ×2
main (cyclomatic 20) 59_Lunar_LEM_Rocket/javascript/lunar.js:86— main 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.
main (cyclomatic 20) 18_Bullseye/javascript/bullseye.js:50— main 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.
TodoComment 03_Animal/vbnet/Animal.Tests/MockConsole.vb:11— ' TODO it's possible to clear all the lines, and we'd have to check once again in WriteString and WriteCenteredLine if there are any lines — 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 03_Animal/vbnet/Animal/Game.vb:155— ' TODO how do we exit? — 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.
nim::machines_turn (cognitive 103) 65_Nim/rust/src/main.rs:149— nim::machines_turn has cognitive complexity 103 (threshold 15). Drivers by points: if/else 21 (70 pts), loops 13 (31 pts), boolean chains 2 (nesting depth added 67). 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.
nim::main (cognitive 61) 65_Nim/rust/src/main.rs:14— nim::main has cognitive complexity 61 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 10 (22 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 35). 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.
mastermind::main (cognitive 92) 60_Mastermind/rust/Mastermind/src/main.rs:125— mastermind::main has cognitive complexity 92 (threshold 15). Drivers by points: if/else 22 (67 pts), loops 7 (19 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 61). 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.
mastermind::get_number_from_user_input (cognitive 26) 60_Mastermind/rust/Mastermind/src/main.rs:390— mastermind::get_number_from_user_input has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· main (cognitive 42) · ×2
main (cognitive 42) 62_Mugwump/javascript/mugwump.js:48— main has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 8 (19 pts), boolean chains 1 (nesting depth added 26). 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.
main (cognitive 42) 03_Animal/javascript/animal.js:100— main has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 7 (16 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TooManyFunctions: rust 01_Acey_Ducey/rust/src/main.rs:50— TooManyFunctions — 105 free functions, declared across 34 files: src/main.rs (9), src/main.rs (9), src/main.rs (8), src/main.rs (7), +30 more file(s). The bar is 30 free functions; this is 75 over it, 3.50× the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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.
TooManyFunctions: rust::view 84_Super_Star_Trek/rust/src/view.rs:21— TooManyFunctions — 60 free functions. The bar is 30 free functions; this is 30 over it, 2.00× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Golf 39_Golf/csharp/Program.cs— ClassTooLong — 467 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 67 over it, 1.17× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: CivilWar 27_Civil_War/java/src/CivilWar.java:12— ClassTooLong — 428 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 28 over it, 1.07× 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.
Duplicated block (6 lines × 5) 01_Acey_Ducey/csharp/Game.cs:318— 01_Acey_Ducey/csharp/Game.cs:318-323 | 05_Bagels/csharp/GameBase.cs:31-36 | 33_Dice/csharp/Game.cs:105-110 | 38_Fur_Trader/csharp/Game.cs:105-110 | 38_Fur_Trader/csharp/Game.cs:406-411 — there are 5 copies across 4 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `01_Acey_Ducey/csharp/Game.cs:318` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (6 lines × 5) 16_Bug/java/src/Bug.java:192— 16_Bug/java/src/Bug.java:192-197 | 38_Fur_Trader/java/src/FurTrader.java:380-385 | 38_Fur_Trader/java/src/FurTrader.java:397-402 | 62_Mugwump/java/src/Mugwump.java:135-140 | 85_Synonym/java/src/Synonym.java:106-111 — there are 5 copies across 4 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `38_Fur_Trader/java/src/FurTrader.java:395` calls `intro` and `85_Synonym/java/src/Synonym.java:104` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (15 lines × 2) 68_Orbit/csharp/program.cs:80— 68_Orbit/csharp/program.cs:80-94 | 81_Splat/csharp/Program.cs:40-54 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `68_Orbit/csharp/program.cs:80` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 2) 27_Civil_War/python/Civilwar.py:208— 27_Civil_War/python/Civilwar.py:208-222 | 84_Super_Star_Trek/python/superstartrekins.py:99-113 — 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 (12 lines × 4) 64_Nicomachus/csharp/program.cs:21— 64_Nicomachus/csharp/program.cs:21-32 | 68_Orbit/csharp/program.cs:78-89 | 79_Slalom/csharp/program.cs:47-58 | 81_Splat/csharp/Program.cs:38-49 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `64_Nicomachus/csharp/program.cs:21` 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 4) 89_Tic-Tac-Toe/csharp/tictactoe2/Program.cs:149— 89_Tic-Tac-Toe/csharp/tictactoe2/Program.cs:149-160 | 89_Tic-Tac-Toe/csharp/tictactoe2/Program.cs:161-172 | 89_Tic-Tac-Toe/csharp/tictactoe2/Program.cs:202-213 | 89_Tic-Tac-Toe/csharp/tictactoe2/Program.cs:214-225 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 2) 09_Battle/csharp/Game.cs:58— 09_Battle/csharp/Game.cs:58-68 | 09_Battle/csharp/Game.cs:139-149 — 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 `09_Battle/csharp/Game.cs:139` 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.
Duplicated block (11 lines × 2) 28_Combat/python/combat.py:72— 28_Combat/python/combat.py:72-82 | 28_Combat/python/combat.py:85-95 — 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 `28_Combat/python/combat.py:72` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 3) 01_Acey_Ducey/java/src/AceyDucey.java:165— 01_Acey_Ducey/java/src/AceyDucey.java:165-171 | 08_Batnum/java/src/BatNum.java:238-244 | 24_Chemist/java/src/Chemist.java:102-108 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at `01_Acey_Ducey/java/src/AceyDucey.java:165` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 3) 18_Bullseye/java/src/Bullseye.java:136— 18_Bullseye/java/src/Bullseye.java:136-142 | 57_Literature_Quiz/java/src/LiteratureQuiz.java:132-138 | 69_Pizza/java/src/Pizza.java:226-232 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `57_Literature_Quiz/java/src/LiteratureQuiz.java:129` calls `simulateTabs` and `18_Bullseye/java/src/Bullseye.java:135` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (16–17 lines × 2) 22_Change/python/change.py:52— 22_Change/python/change.py:52-68 | 22_Change/python/change.py:70-85 — 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (16–17 lines × 2) 49_Hockey/python/hockey.py:184— 49_Hockey/python/hockey.py:184-200 | 49_Hockey/python/hockey.py:242-257 — 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 `49_Hockey/python/hockey.py:184` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (15 lines × 3) 27_Civil_War/python/Civilwar.py:209— 27_Civil_War/python/Civilwar.py:209-223 | 84_Super_Star_Trek/python/superstartrekins.py:39-53 | 84_Super_Star_Trek/python/superstartrekins.py:66-80 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (15 lines × 3) 49_Hockey/python/hockey.py:133— 49_Hockey/python/hockey.py:133-147 | 84_Super_Star_Trek/python/superstartrekins.py:57-71 | 84_Super_Star_Trek/python/superstartrekins.py:119-133 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (10 lines × 2) 40_Gomoko/python/Gomoko.py:102— 40_Gomoko/python/Gomoko.py:102-111 | 40_Gomoko/python/Gomoko.py:116-125 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) 00_Alternate_Languages/25_Chief/go/main.go:14— 00_Alternate_Languages/25_Chief/go/main.go:14-23 | 00_Alternate_Languages/25_Chief/go/main.go:28-37 — 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.
Duplicated block (11 lines × 3) 18_Bullseye/rust/src/lib.rs:155— 18_Bullseye/rust/src/lib.rs:155-165 | 32_Diamond/rust/src/lib.rs:114-124 | 68_Orbit/rust/src/lib.rs:147-157 — before extracting anything, compare `18_Bullseye/rust/src/lib.rs` and `32_Diamond/rust/src/lib.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (11 lines × 3) 24_Chemist/rust/src/lib.rs:91— 24_Chemist/rust/src/lib.rs:91-101 | 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs:396-406 | 91_Train/rust/src/lib.rs:88-98 — before extracting anything, compare `24_Chemist/rust/src/lib.rs` and `60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
R10 · Code Duplication· Duplicated block with local edits (47 matched lines × 2 locations) · ×2
Duplicated block with local edits (47 matched lines × 2 locations) 15_Boxing/javascript/boxing.js:6— 15_Boxing/javascript/boxing.js:6 · 28_Combat/javascript/combat.js:6 — the two spans are one implementation copied and then locally edited — 252 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (47 matched lines × 2 locations) 28_Combat/javascript/combat.js:6— 28_Combat/javascript/combat.js:6 · 57_Literature_Quiz/javascript/litquiz.js:6 — the two spans are one implementation copied and then locally edited — 263 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (44 matched lines × 2 locations) · ×2
Duplicated block with local edits (44 matched lines × 2 locations) 29_Craps/javascript/craps.js:6— 29_Craps/javascript/craps.js:6 · 57_Literature_Quiz/javascript/litquiz.js:6 — the two spans are one implementation copied and then locally edited — 237 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (44 matched lines × 2 locations) 61_Math_Dice/javascript/mathdice.js:6— 61_Math_Dice/javascript/mathdice.js:6 · 80_Slots/javascript/slots.js:6 — the two spans are one implementation copied and then locally edited — 232 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (40 matched lines × 2 locations) · ×2
Duplicated block with local edits (40 matched lines × 2 locations) 12_Bombs_Away/javascript/bombsaway.js:6— 12_Bombs_Away/javascript/bombsaway.js:6 · 29_Craps/javascript/craps.js:6 — the two spans are one implementation copied and then locally edited — 209 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (40 matched lines × 2 locations) 73_Reverse/javascript/reverse.js:6— 73_Reverse/javascript/reverse.js:6 · 80_Slots/javascript/slots.js:6 — the two spans are one implementation copied and then locally edited — 205 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (38 matched lines × 2 locations) · ×2
Duplicated block with local edits (38 matched lines × 2 locations) 31_Depth_Charge/javascript/depthcharge.js:6— 31_Depth_Charge/javascript/depthcharge.js:6 · 59_Lunar_LEM_Rocket/javascript/lem.js:6 — the two spans are one implementation copied and then locally edited — 207 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (38 matched lines × 2 locations) 59_Lunar_LEM_Rocket/javascript/lem.js:6— 59_Lunar_LEM_Rocket/javascript/lem.js:6 · 76_Russian_Roulette/javascript/russianroulette.js:6 — the two spans are one implementation copied and then locally edited — 207 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
C1 · Data Protection· No data-protection/encryption · ×1
No data-protection/encryption — No data-protection or encryption usage (ASP.NET Data Protection, AES, column encryption, PBKDF2) was found — sensitive data at rest may be unprotected. If TDE/KMS/vault is delegated to infrastructure, ignore.
D1 · Cyclomatic Complexity· main (cyclomatic 133) · ×1
main (cyclomatic 133) 77_Salvo/javascript/salvo.js:89— main has cyclomatic complexity 133 (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.
ftball.main (cyclomatic 113) 37_Football/javascript/ftball.js:99— ftball.main has cyclomatic complexity 113 (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.
battle.main (cyclomatic 111) 09_Battle/javascript/battle.js:53— battle.main has cyclomatic complexity 111 (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.
civilwar.main (cyclomatic 93) 27_Civil_War/javascript/civilwar.js:71— civilwar.main has cyclomatic complexity 93 (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· main (cyclomatic 92) · ×1
main (cyclomatic 92) 10_Blackjack/javascript/blackjack.js:208— main has cyclomatic complexity 92 (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.
Game.SetShip (cyclomatic 82) 09_Battle/csharp/Game.cs:32— Game.SetShip has cyclomatic complexity 82 (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· main (cyclomatic 80) · ×1
main (cyclomatic 80) 02_Amazing/javascript/amazing.js:54— main has cyclomatic complexity 80 (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· main (cyclomatic 77) · ×1
main (cyclomatic 77) 88_3-D_Tic-Tac-Toe/javascript/qubit.js:204— main has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity· main (cyclomatic 75) · ×1
main (cyclomatic 75) 75_Roulette/javascript/roulette.js:54— main has cyclomatic complexity 75 (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.
tictactoe2.main (cyclomatic 74) 89_Tic-Tac-Toe/javascript/tictactoe2.js:110— tictactoe2.main 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· main (cyclomatic 74) · ×1
main (cyclomatic 74) 71_Poker/javascript/poker.js:436— main 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· main (cyclomatic 72) · ×1
main (cyclomatic 72) 46_Hexapawn/javascript/hexapawn.js:119— main has cyclomatic complexity 72 (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.
king.main (cyclomatic 70) 53_King/javascript/king.js:55— king.main has cyclomatic complexity 70 (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· main (cyclomatic 70) · ×1
main (cyclomatic 70) 65_Nim/javascript/nim.js:50— main has cyclomatic complexity 70 (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.
Civilwar.main (cyclomatic 68) 27_Civil_War/python/Civilwar.py:107— Civilwar.main has cyclomatic complexity 68 (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· main (cyclomatic 67) · ×1
main (cyclomatic 67) 39_Golf/javascript/golf.js:91— main has cyclomatic complexity 67 (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.
football.main (cyclomatic 65) 37_Football/python/football.py:144— football.main has cyclomatic complexity 65 (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.
splat.main (cyclomatic 57) 81_Splat/javascript/splat.js:48— splat.main has cyclomatic complexity 57 (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· main (cyclomatic 56) · ×1
main (cyclomatic 56) 23_Checkers/javascript/checkers.js:122— main has cyclomatic complexity 56 (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.
cube.main (cyclomatic 53) 30_Cube/javascript/cube.js:46— cube.main has cyclomatic complexity 53 (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· main (cyclomatic 50) · ×1
main (cyclomatic 50) 44_Hangman/javascript/hangman.js:68— main has cyclomatic complexity 50 (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.
tower.main (cyclomatic 48) 90_Tower/javascript/tower.js:73— tower.main has cyclomatic complexity 48 (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.
bug.main (cyclomatic 46) 16_Bug/javascript/bug.js:113— bug.main 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.
slalom.main (cyclomatic 46) 79_Slalom/javascript/slalom.js:86— slalom.main 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.
bullfight.main (cyclomatic 45) 17_Bullfight/javascript/bullfight.js:106— bullfight.main has cyclomatic complexity 45 (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.
bombsaway.main (cyclomatic 44) 12_Bombs_Away/javascript/bombsaway.js:46— bombsaway.main has cyclomatic complexity 44 (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.
lem.main (cyclomatic 44) 59_Lunar_LEM_Rocket/javascript/lem.js:46— lem.main has cyclomatic complexity 44 (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.
BombsAway.play (cyclomatic 43) 12_Bombs_Away/java/src/BombsAway.java:141— BombsAway.play 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.
superstartrek.commandCourseControl (cyclomatic 42) 84_Super_Star_Trek/javascript/superstartrek.mjs:544— superstartrek.commandCourseControl has cyclomatic complexity 42 (threshold 15). Of this number, 41 points are the body's own statements and 1 belongs to one function item inside it that branches. 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.
Golf.Stroke (cyclomatic 41) 39_Golf/csharp/Program.cs:364— Golf.Stroke has cyclomatic complexity 41 (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.
life.main (cyclomatic 39) 55_Life/javascript/life.js:49— life.main has cyclomatic complexity 39 (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.
poetry.main (cyclomatic 39) 70_Poetry/javascript/poetry.js:46— poetry.main has cyclomatic complexity 39 (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.
Golf.stroke (cyclomatic 38) 39_Golf/python/golf.py:578— Golf.stroke has cyclomatic complexity 38 (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.
app._Debug_toAnsiString (cyclomatic 37) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:543— app._Debug_toAnsiString 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.
Hamurabi.play (cyclomatic 36) 43_Hammurabi/java/src/Hamurabi.java:67— Hamurabi.play 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· main (cyclomatic 36) · ×1
main (cyclomatic 36) 14_Bowling/javascript/bowling.js:46— main has cyclomatic complexity 36 (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.
TicTacToe2.main (cyclomatic 35) 89_Tic-Tac-Toe/java/src/TicTacToe2.java:8— TicTacToe2.main has cyclomatic complexity 35 (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.
batnum.main (cyclomatic 35) 08_Batnum/javascript/batnum.js:46— batnum.main 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.
mastermind.main (cyclomatic 35) 60_Mastermind/javascript/mastermind.js:178— mastermind.main 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· main (cyclomatic 35) · ×1
main (cyclomatic 35) 50_Horserace/javascript/horserace.js:55— main 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.
hamurabi.main (cyclomatic 34) 43_Hammurabi/python/hamurabi.py:36— hamurabi.main has cyclomatic complexity 34 (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.
app._Json_runHelp (cyclomatic 34) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:1403— app._Json_runHelp has cyclomatic complexity 34 (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.
hammurabi.main (cyclomatic 34) 43_Hammurabi/javascript/hammurabi.js:61— hammurabi.main has cyclomatic complexity 34 (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.
BullFight.Begin (cyclomatic 33) 17_Bullfight/csharp/BullFight.cs:25— BullFight.Begin 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· main (cyclomatic 33) · ×1
main (cyclomatic 33) 05_Bagels/javascript/bagels.js:64— main 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.
Game.computer (cyclomatic 32) 84_Super_Star_Trek/python/superstartrek.py:887— Game.computer has cyclomatic complexity 32 (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.
king::next_round (cyclomatic 32) 53_King/rust/src/main.rs:193— king::next_round has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
lifefortwo.main (cyclomatic 32) 56_Life_for_Two/javascript/lifefortwo.js:121— lifefortwo.main has cyclomatic complexity 32 (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.
BatNum.play (cyclomatic 30) 08_Batnum/java/src/BatNum.java:69— BatNum.play has cyclomatic complexity 30 (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.
BagelsKt.main (cyclomatic 29) 05_Bagels/kotlin/bagels.kt:3— BagelsKt.main has cyclomatic complexity 29 (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.
onecheck.main (cyclomatic 29) 67_One_Check/javascript/onecheck.js:48— onecheck.main has cyclomatic complexity 29 (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· main (cyclomatic 29) · ×1
main (cyclomatic 29) 38_Fur_Trader/javascript/furtrader.js:55— main has cyclomatic complexity 29 (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.
RockScissors.play (cyclomatic 28) 74_Rock_Scissors_Paper/java/src/RockScissors.java:58— RockScissors.play has cyclomatic complexity 28 (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· main (cyclomatic 28) · ×1
main (cyclomatic 28) 48_High_IQ/javascript/highiq.js:152— main has cyclomatic complexity 28 (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.
GameState.simulateOneYear (cyclomatic 27) 53_King/kotlin/King.kt:471— GameState.simulateOneYear 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.
life.main (cyclomatic 27) 55_Life/python/life.py:52— life.main 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.
app._VirtualDom_diffHelp (cyclomatic 27) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:3050— app._VirtualDom_diffHelp 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.
app._VirtualDom_diffKeyedKids (cyclomatic 27) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:3326— app._VirtualDom_diffKeyedKids has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Game.play_game (cyclomatic 26) 10_Blackjack/python/blackjack.py:249— Game.play_game has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mastermind::main (cyclomatic 26) 60_Mastermind/rust/Mastermind/src/main.rs:125— mastermind::main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
queen.main (cyclomatic 26) 72_Queen/javascript/queen.js:143— queen.main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity· main (cyclomatic 26) · ×1
main (cyclomatic 26) 36_Flip_Flop/javascript/flipflop.js:48— main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
hockey.simulate_game_round (cyclomatic 25) 49_Hockey/python/hockey.py:468— hockey.simulate_game_round 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.
Game.navigation (cyclomatic 25) 84_Super_Star_Trek/python/superstartrek.py:659— Game.navigation 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.
app._VirtualDom_diffFacts (cyclomatic 25) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:3217— app._VirtualDom_diffFacts 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.
basketball.player_play (cyclomatic 25) 07_Basketball/javascript/basketball.js:101— basketball.player_play 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.
digits.main (cyclomatic 25) 34_Digits/javascript/digits.js:46— digits.main 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· main (cyclomatic 25) · ×1
main (cyclomatic 25) 40_Gomoko/javascript/gomoko.js:77— main 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.
Program.Main (cyclomatic 24) 21_Calendar/csharp/Program.cs:27— Program.Main has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Slalom.DoARun (cyclomatic 24) 79_Slalom/csharp/program.cs:228— Slalom.DoARun 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.
poker.evaluate_hand (cyclomatic 24) 71_Poker/javascript/poker.js:152— poker.evaluate_hand 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.
tictactoe2.show_board (cyclomatic 24) 89_Tic-Tac-Toe/javascript/tictactoe2.js:56— tictactoe2.show_board 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.
Golf.InterpretResults (cyclomatic 23) 39_Golf/csharp/Program.cs:512— Golf.InterpretResults 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.
Bug.play (cyclomatic 23) 16_Bug/java/src/Bug.java:54— Bug.play 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.
Golf.interpret_results (cyclomatic 23) 39_Golf/python/golf.py:716— Golf.interpret_results 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.
slalom.run (cyclomatic 23) 79_Slalom/python/slalom.py:53— slalom.run 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.
furtrader.main (cyclomatic 22) 38_Fur_Trader/python/furtrader.py:127— furtrader.main 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.
chomp.main (cyclomatic 22) 26_Chomp/javascript/chomp.js:77— chomp.main has cyclomatic complexity 22 (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.
evenwins.main (cyclomatic 22) 35_Even_Wins/javascript/evenwins.js:49— evenwins.main 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.
bug.handle_roll (cyclomatic 21) 16_Bug/python/bug.py:82— bug.handle_roll 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.
Gomoko.main (cyclomatic 21) 40_Gomoko/python/Gomoko.py:67— Gomoko.main 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.
rockscissors.play_game (cyclomatic 21) 74_Rock_Scissors_Paper/python/rockscissors.py:9— rockscissors.play_game 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.
TicTacToe.next_move (cyclomatic 21) 89_Tic-Tac-Toe/python/TicTacToe_Hard.py:89— TicTacToe.next_move 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.
main.main (cyclomatic 21) REDACTED:181— main.main 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.
gameofevenwins.main (cyclomatic 21) 35_Even_Wins/javascript/gameofevenwins.js:48— gameofevenwins.main 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.
superstartrek.commandPhotonTorpedo (cyclomatic 21) 84_Super_Star_Trek/javascript/superstartrek.mjs:1023— superstartrek.commandPhotonTorpedo 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· main (cyclomatic 21) · ×1
main (cyclomatic 21) 73_Reverse/javascript/reverse.js:84— main 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.
Slots.play (cyclomatic 20) 80_Slots/java/src/Slots.java:78— Slots.play 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.
combat.attack_second (cyclomatic 20) 28_Combat/python/combat.py:108— combat.attack_second 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.
TicTacToe.check_win (cyclomatic 20) 89_Tic-Tac-Toe/python/TicTacToe_Hard.py:21— TicTacToe.check_win 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.
hello.swift.main (cyclomatic 20) 00_Alternate_Languages/45_Hello/Swift/hello.swift:18— hello.swift.main 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.
mastermind_refactored_for_conventions::play_round_human_codemaker (cyclomatic 20) 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs:174— mastermind_refactored_for_conventions::play_round_human_codemaker 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.
awari.main (cyclomatic 20) 04_Awari/javascript/awari.js:179— awari.main 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.
banner.main (cyclomatic 20) 06_Banner/javascript/banner.js:93— banner.main has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
basketball.computer_play (cyclomatic 20) 07_Basketball/javascript/basketball.js:208— basketball.computer_play 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.
checkers.eval_move (cyclomatic 20) 23_Checkers/javascript/checkers.js:69— checkers.eval_move 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.
hello.main (cyclomatic 20) 45_Hello/javascript/hello.js:46— hello.main 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.
poker.ask_for_bet (cyclomatic 20) 71_Poker/javascript/poker.js:339— poker.ask_for_bet 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.
Hand.Analyze (cyclomatic 19) 71_Poker/csharp/Cards/Hand.cs:46— Hand.Analyze 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.
FurTrader.play (cyclomatic 19) 38_Fur_Trader/java/src/FurTrader.java:66— FurTrader.play 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.
banner.print_banner (cyclomatic 19) 06_Banner/python/banner.py:55— banner.print_banner 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.
chomp.play_game (cyclomatic 19) 26_Chomp/python/chomp.py:42— chomp.play_game 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.
combat.attack_first (cyclomatic 19) 28_Combat/python/combat.py:37— combat.attack_first 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.
cube.play_game (cyclomatic 19) 30_Cube/python/cube.py:24— cube.play_game 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.
Game.photon_torpedoes (cyclomatic 19) 84_Super_Star_Trek/python/superstartrek.py:484— Game.photon_torpedoes 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.
Qubit.play (cyclomatic 19) 88_3-D_Tic-Tac-Toe/python/qubit.py:311— Qubit.play 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.
app._VirtualDom_addDomNodesHelp (cyclomatic 19) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:3590— app._VirtualDom_addDomNodesHelp 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.
Program.Main (cyclomatic 18) 60_Mastermind/csharp/Program.cs:15— Program.Main 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.
Mugwump.play (cyclomatic 18) 62_Mugwump/java/src/Mugwump.java:46— Mugwump.play 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.
queen.get_move (cyclomatic 18) 72_Queen/python/queen.py:143— queen.get_move 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.
tictactoe2.determine_winner (cyclomatic 18) 89_Tic-Tac-Toe/python/tictactoe2.py:128— tictactoe2.determine_winner 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.
slots.main (cyclomatic 18) 80_Slots/javascript/slots.js:48— slots.main 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.
weekday.main (cyclomatic 18) REDACTED:292— weekday.main has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body's own statements and 8 belong to one function item inside it that branches. 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· main (cyclomatic 18) · ×1
main (cyclomatic 18) 03_Animal/javascript/animal.js:100— main 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.
MainKt.main (cyclomatic 17) 17_Bullfight/kotlin/src/bullfight/Main.kt:50— MainKt.main 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.
Board.checkWin (cyclomatic 17) 89_Tic-Tac-Toe/java/src/Board.java:49— Board.checkWin has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
bullfight.main (cyclomatic 17) 17_Bullfight/python/bullfight.py:221— bullfight.main 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.
Game.short_range_scan (cyclomatic 17) 84_Super_Star_Trek/python/superstartrek.py:579— Game.short_range_scan has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
TicTacToe3D.machine_move (cyclomatic 17) 88_3-D_Tic-Tac-Toe/python/qubit.py:186— TicTacToe3D.machine_move has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
awari.computer_move (cyclomatic 17) 04_Awari/javascript/awari.js:128— awari.computer_move 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.
stockmarket.main (cyclomatic 17) 83_Stock_Market/javascript/stockmarket.js:132— stockmarket.main 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.
Program.ChoosePath_BlockedToTheLeft (cyclomatic 16) 02_Amazing/vbnet/program.vb:115— Program.ChoosePath_BlockedToTheLeft has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table.
Splat.PlayOneRound (cyclomatic 16) 81_Splat/csharp/Program.cs:154— Splat.PlayOneRound 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.
Game.run (cyclomatic 16) 10_Blackjack/java/src/Game.java:22— Game.run 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.
Pizza.play (cyclomatic 16) 69_Pizza/java/src/Pizza.java:59— Pizza.play 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.
awari.computer_move (cyclomatic 16) 04_Awari/python/awari.py:159— awari.computer_move 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.
GAME::play_game (cyclomatic 16) 10_Blackjack/rust/src/main.rs:372— GAME::play_game 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.
markdown_todo_rust::main (cyclomatic 16) 00_Utilities/markdown_todo_rust/src/main.rs:27— markdown_todo_rust::main 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.
app._VirtualDom_applyPatch (cyclomatic 16) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:3711— app._VirtualDom_applyPatch 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. This is NOT this file's highest cyclomatic complexity: app._Json_equality (cyclomatic 19) 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.
basketball.main (cyclomatic 16) 07_Basketball/javascript/basketball.js:302— basketball.main 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.
highiq.check_game_over (cyclomatic 16) 48_High_IQ/javascript/highiq.js:130— highiq.check_game_over 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.
mathdice.main (cyclomatic 16) 61_Math_Dice/javascript/mathdice.js:46— mathdice.main 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· main (cyclomatic 16) · ×1
main (cyclomatic 16) 62_Mugwump/javascript/mugwump.js:48— main 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.
battle.main (cognitive 425) 09_Battle/javascript/battle.js:53— battle.main has cognitive complexity 425 (threshold 15). Drivers by points: if/else 49 (309 pts), loops 22 (82 pts), boolean chains 29, match/switch 1 (5 pts) (nesting depth added 324). 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· main (cognitive 419) · ×1
main (cognitive 419) 77_Salvo/javascript/salvo.js:89— main has cognitive complexity 419 (threshold 15). Drivers by points: if/else 66 (230 pts), loops 58 (182 pts), boolean chains 7 (nesting depth added 288). 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· main (cognitive 315) · ×1
main (cognitive 315) 10_Blackjack/javascript/blackjack.js:208— main has cognitive complexity 315 (threshold 15). Drivers by points: if/else 50 (158 pts), loops 39 (135 pts), ternaries 2 (12 pts), boolean chains 10 (nesting depth added 214). 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· main (cognitive 274) · ×1
main (cognitive 274) 37_Football/javascript/ftball.js:99— main has cognitive complexity 274 (threshold 15). Drivers by points: if/else 88 (218 pts), boolean chains 20, ternaries 5 (19 pts), loops 4 (12 pts), match/switch 2 (5 pts) (nesting depth added 155). 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· main (cognitive 269) · ×1
main (cognitive 269) 88_3-D_Tic-Tac-Toe/javascript/qubit.js:204— main has cognitive complexity 269 (threshold 15). Drivers by points: if/else 40 (159 pts), loops 30 (105 pts), boolean chains 5 (nesting depth added 194). 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· main (cognitive 260) · ×1
main (cognitive 260) 65_Nim/javascript/nim.js:50— main has cognitive complexity 260 (threshold 15). Drivers by points: if/else 40 (166 pts), loops 24 (83 pts), boolean chains 11 (nesting depth added 185). 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.
tictactoe2.main (cognitive 246) 89_Tic-Tac-Toe/javascript/tictactoe2.js:110— tictactoe2.main has cognitive complexity 246 (threshold 15). Drivers by points: if/else 49 (209 pts), loops 6 (19 pts), boolean chains 18 (nesting depth added 173). 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· main (cognitive 226) · ×1
main (cognitive 226) 37_Football/javascript/football.js:124— main has cognitive complexity 226 (threshold 15). Drivers by points: if/else 70 (189 pts), loops 13 (27 pts), boolean chains 10 (nesting depth added 133). 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· main (cognitive 221) · ×1
main (cognitive 221) 02_Amazing/javascript/amazing.js:54— main has cognitive complexity 221 (threshold 15). Drivers by points: if/else 81 (190 pts), loops 11 (22 pts), boolean chains 9 (nesting depth added 120). 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· main (cognitive 218) · ×1
main (cognitive 218) 71_Poker/javascript/poker.js:436— main has cognitive complexity 218 (threshold 15). Drivers by points: if/else 67 (175 pts), loops 15 (42 pts), boolean chains 1 (nesting depth added 135). 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· main (cognitive 216) · ×1
main (cognitive 216) 39_Golf/javascript/golf.js:91— main has cognitive complexity 216 (threshold 15). Drivers by points: if/else 61 (196 pts), boolean chains 11, loops 6 (9 pts) (nesting depth added 138). 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.
civilwar.main (cognitive 201) 27_Civil_War/javascript/civilwar.js:71— civilwar.main has cognitive complexity 201 (threshold 15). Drivers by points: if/else 56 (142 pts), loops 16 (41 pts), boolean chains 14, match/switch 1 (4 pts) (nesting depth added 114). 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.
Civilwar.main (cognitive 182) 27_Civil_War/python/Civilwar.py:107— Civilwar.main has cognitive complexity 182 (threshold 15). Drivers by points: if/else 48 (126 pts), loops 15 (44 pts), boolean chains 12 (nesting depth added 107). 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· main (cognitive 180) · ×1
main (cognitive 180) 46_Hexapawn/javascript/hexapawn.js:119— main has cognitive complexity 180 (threshold 15). Drivers by points: if/else 34 (114 pts), loops 18 (50 pts), boolean chains 16 (nesting depth added 112). 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.
football.main (cognitive 179) 37_Football/python/football.py:144— football.main has cognitive complexity 179 (threshold 15). Drivers by points: if/else 56 (162 pts), loops 6 (11 pts), boolean chains 6 (nesting depth added 111). 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· main (cognitive 170) · ×1
main (cognitive 170) 75_Roulette/javascript/roulette.js:54— main has cognitive complexity 170 (threshold 15). Drivers by points: if/else 46 (115 pts), loops 16 (35 pts), boolean chains 17, match/switch 1 (3 pts) (nesting depth added 90). 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· main (cognitive 169) · ×1
main (cognitive 169) 49_Hockey/javascript/hockey.js:54— main has cognitive complexity 169 (threshold 15). Drivers by points: if/else 41 (97 pts), loops 24 (42 pts), match/switch 6 (22 pts), boolean chains 8 (nesting depth added 90). 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.
king.main (cognitive 159) 53_King/javascript/king.js:55— king.main has cognitive complexity 159 (threshold 15). Drivers by points: if/else 60 (139 pts), loops 7 (15 pts), boolean chains 5 (nesting depth added 87). 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· main (cognitive 156) · ×1
main (cognitive 156) 23_Checkers/javascript/checkers.js:122— main has cognitive complexity 156 (threshold 15). Drivers by points: if/else 25 (80 pts), loops 24 (72 pts), boolean chains 4 (nesting depth added 103). 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.
tower.main (cognitive 142) 90_Tower/javascript/tower.js:73— tower.main has cognitive complexity 142 (threshold 15). Drivers by points: if/else 25 (87 pts), loops 18 (50 pts), boolean chains 5 (nesting depth added 94). 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· main (cognitive 133) · ×1
main (cognitive 133) 14_Bowling/javascript/bowling.js:46— main has cognitive complexity 133 (threshold 15). Drivers by points: loops 19 (67 pts), if/else 14 (62 pts), boolean chains 4 (nesting depth added 96). 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· main (cognitive 128) · ×1
main (cognitive 128) 17_Bullfight/javascript/bullfight.js:106— main has cognitive complexity 128 (threshold 15). Drivers by points: if/else 42 (97 pts), loops 6 (17 pts), ternaries 3 (10 pts), boolean chains 4 (nesting depth added 73). 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.
Game.SetShip (cognitive 126) 09_Battle/csharp/Game.cs:32— Game.SetShip has cognitive complexity 126 (threshold 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· main (cognitive 120) · ×1
main (cognitive 120) 15_Boxing/javascript/boxing.js:46— main has cognitive complexity 120 (threshold 15). Drivers by points: if/else 40 (109 pts), boolean chains 6, loops 4 (5 pts) (nesting depth added 70). 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.
bombsaway.main (cognitive 119) 12_Bombs_Away/javascript/bombsaway.js:46— bombsaway.main has cognitive complexity 119 (threshold 15). Drivers by points: if/else 45 (95 pts), loops 7 (19 pts), boolean chains 5 (nesting depth added 62). 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.
lem.main (cognitive 119) 59_Lunar_LEM_Rocket/javascript/lem.js:46— lem.main has cognitive complexity 119 (threshold 15). Drivers by points: if/else 35 (93 pts), loops 8 (20 pts), boolean chains 6 (nesting depth added 70). 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.
mastermind.main (cognitive 108) 60_Mastermind/javascript/mastermind.js:178— mastermind.main has cognitive complexity 108 (threshold 15). Drivers by points: if/else 18 (62 pts), loops 16 (45 pts), boolean chains 1 (nesting depth added 73). 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· main (cognitive 102) · ×1
main (cognitive 102) 50_Horserace/javascript/horserace.js:55— main has cognitive complexity 102 (threshold 15). Drivers by points: if/else 14 (53 pts), loops 20 (48 pts), boolean chains 1 (nesting depth added 67). 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.
life.main (cognitive 101) 55_Life/javascript/life.js:49— life.main has cognitive complexity 101 (threshold 15). Drivers by points: if/else 22 (63 pts), loops 16 (36 pts), boolean chains 2 (nesting depth added 61). 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· main (cognitive 101) · ×1
main (cognitive 101) 44_Hangman/javascript/hangman.js:68— main has cognitive complexity 101 (threshold 15). Drivers by points: loops 20 (59 pts), if/else 11 (34 pts), match/switch 2 (8 pts) (nesting depth added 68). 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.
batnum.main (cognitive 96) 08_Batnum/javascript/batnum.js:46— batnum.main has cognitive complexity 96 (threshold 15). Drivers by points: if/else 23 (71 pts), loops 8 (19 pts), boolean chains 6 (nesting depth added 59). 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· main (cognitive 95) · ×1
main (cognitive 95) 05_Bagels/javascript/bagels.js:64— main has cognitive complexity 95 (threshold 15). Drivers by points: if/else 18 (55 pts), loops 13 (38 pts), boolean chains 2 (nesting depth added 62). 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.
TicTacToe2.main (cognitive 93) 89_Tic-Tac-Toe/java/src/TicTacToe2.java:8— TicTacToe2.main has cognitive complexity 93 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 8 (23 pts), error handling 5 (22 pts), boolean chains 8 (nesting depth added 54). 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.
splat.main (cognitive 92) 81_Splat/javascript/splat.js:48— splat.main has cognitive complexity 92 (threshold 15). Drivers by points: if/else 29 (64 pts), loops 9 (18 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 48). 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.
Game.computer (cognitive 90) 84_Super_Star_Trek/python/superstartrek.py:887— Game.computer has cognitive complexity 90 (threshold 15). Drivers by points: if/else 21 (57 pts), loops 6 (18 pts), ternaries 3 (10 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
hammurabi.main (cognitive 90) 43_Hammurabi/javascript/hammurabi.js:61— hammurabi.main has cognitive complexity 90 (threshold 15). Drivers by points: if/else 34 (77 pts), loops 5 (10 pts), boolean chains 3 (nesting depth added 48). 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.
slalom.main (cognitive 90) 79_Slalom/javascript/slalom.js:86— slalom.main has cognitive complexity 90 (threshold 15). Drivers by points: if/else 35 (73 pts), loops 7 (11 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 44). 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· main (cognitive 83) · ×1
main (cognitive 83) 30_Cube/javascript/cube.js:46— main has cognitive complexity 83 (threshold 15). Drivers by points: if/else 29 (63 pts), boolean chains 14, loops 3 (6 pts) (nesting depth added 37). 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.
BagelsKt.main (cognitive 82) 05_Bagels/kotlin/bagels.kt:3— BagelsKt.main has cognitive complexity 82 (threshold 15). Drivers by points: if/else 18 (53 pts), loops 9 (26 pts), boolean chains 3 (nesting depth added 52). 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· main (cognitive 82) · ×1
main (cognitive 82) 36_Flip_Flop/javascript/flipflop.js:48— main has cognitive complexity 82 (threshold 15). Drivers by points: loops 11 (34 pts), if/else 11 (29 pts), ternaries 4 (18 pts), boolean chains 1 (nesting depth added 55). 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.
Gomoko.main (cognitive 81) 40_Gomoko/python/Gomoko.py:67— Gomoko.main has cognitive complexity 81 (threshold 15). Drivers by points: if/else 10 (50 pts), loops 6 (28 pts), boolean chains 3 (nesting depth added 62). 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.
bug.main (cognitive 80) 16_Bug/javascript/bug.js:113— bug.main has cognitive complexity 80 (threshold 15). Drivers by points: if/else 40 (71 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (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.
BombsAway.play (cognitive 78) 12_Bombs_Away/java/src/BombsAway.java:141— BombsAway.play has cognitive complexity 78 (threshold 15). Drivers by points: if/else 27 (59 pts), match/switch 5 (18 pts), loops 1 (nesting depth added 45). 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.
Hamurabi.play (cognitive 77) 43_Hammurabi/java/src/Hamurabi.java:67— Hamurabi.play has cognitive complexity 77 (threshold 15). Drivers by points: if/else 30 (71 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 42). 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.
banner.main (cognitive 74) 06_Banner/javascript/banner.js:93— banner.main has cognitive complexity 74 (threshold 15). Drivers by points: loops 11 (43 pts), if/else 11 (31 pts) (nesting depth added 52). 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· main (cognitive 74) · ×1
main (cognitive 74) 59_Lunar_LEM_Rocket/javascript/lunar.js:86— main has cognitive complexity 74 (threshold 15). Drivers by points: if/else 15 (56 pts), loops 5 (18 pts) (nesting depth added 54). 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.
digits.main (cognitive 71) 34_Digits/javascript/digits.js:46— digits.main has cognitive complexity 71 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 12 (32 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· main (cognitive 69) · ×1
main (cognitive 69) 40_Gomoko/javascript/gomoko.js:77— main has cognitive complexity 69 (threshold 15). Drivers by points: if/else 10 (38 pts), loops 11 (28 pts), boolean chains 3 (nesting depth added 45). 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.
awari.main (cognitive 67) 04_Awari/javascript/awari.js:179— awari.main has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (55 pts), loops 5 (12 pts) (nesting depth added 47). 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.
superstartrek.commandCourseControl (cognitive 66) 84_Super_Star_Trek/javascript/superstartrek.mjs:544— superstartrek.commandCourseControl has cognitive complexity 66 (threshold 15). Drivers by points: if/else 28 (55 pts), boolean chains 7, loops 3, ternaries 1 (nesting depth added 27). Of this number, 65 points are the body's own statements and 1 belongs to one function item inside it that branches. 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.
RockScissors.play (cognitive 65) 74_Rock_Scissors_Paper/java/src/RockScissors.java:58— RockScissors.play has cognitive complexity 65 (threshold 15). Drivers by points: if/else 15 (43 pts), match/switch 3 (11 pts), ternaries 3 (9 pts), boolean chains 1, loops 1 (nesting depth added 42). 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.
life.main (cognitive 62) 55_Life/python/life.py:52— life.main has cognitive complexity 62 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 12 (28 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 38). 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.
evenwins.main (cognitive 62) 35_Even_Wins/javascript/evenwins.js:49— evenwins.main has cognitive complexity 62 (threshold 15). Drivers by points: if/else 22 (53 pts), loops 3 (6 pts), boolean chains 3 (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.
basketball.computer_play (cognitive 61) 07_Basketball/javascript/basketball.js:208— basketball.computer_play has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (58 pts), loops 2 (3 pts) (nesting depth added 40). 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.
gameofevenwins.main (cognitive 60) 35_Even_Wins/javascript/gameofevenwins.js:48— gameofevenwins.main has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (51 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 35). 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.
banner.print_banner (cognitive 59) 06_Banner/python/banner.py:55— banner.print_banner has cognitive complexity 59 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 8 (26 pts), error handling 2 (4 pts), ternaries 1 (nesting depth added 38). 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· main (cognitive 59) · ×1
main (cognitive 59) 11_Bombardment/javascript/bombardment.js:46— main has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (37 pts), loops 12 (18 pts), boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BatNum.play (cognitive 58) 08_Batnum/java/src/BatNum.java:69— BatNum.play has cognitive complexity 58 (threshold 15). Drivers by points: if/else 20 (49 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 32). 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.
Golf.Stroke (cognitive 57) 39_Golf/csharp/Program.cs:364— Golf.Stroke has cognitive complexity 57 (threshold 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.
hamurabi.main (cognitive 55) 43_Hammurabi/python/hamurabi.py:36— hamurabi.main has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 6 (12 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
basketball.player_play (cognitive 55) 07_Basketball/javascript/basketball.js:101— basketball.player_play has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (53 pts), boolean chains 1, loops 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity· main (cognitive 55) · ×1
main (cognitive 55) 56_Life_for_Two/javascript/lifefortwo.js:121— main has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 8 (15 pts), boolean chains 5, ternaries 1 (2 pts) (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.
slalom.run (cognitive 54) 79_Slalom/python/slalom.py:53— slalom.run has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 3 (6 pts), ternaries 1 (6 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 34). 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.
onecheck.main (cognitive 54) 67_One_Check/javascript/onecheck.js:48— onecheck.main has cognitive complexity 54 (threshold 15). Drivers by points: loops 14 (34 pts), if/else 6 (19 pts), boolean chains 1 (nesting depth added 33). 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· main (cognitive 54) · ×1
main (cognitive 54) 38_Fur_Trader/javascript/furtrader.js:55— main has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (45 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
king::next_round (cognitive 53) 53_King/rust/src/main.rs:193— king::next_round has cognitive complexity 53 (threshold 15). Drivers by points: if/else 44 (51 pts), boolean chains 2 (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· main (cognitive 53) · ×1
main (cognitive 53) 73_Reverse/javascript/reverse.js:84— main has cognitive complexity 53 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 10 (25 pts), boolean chains 2 (nesting depth added 33). 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.
app._Debug_toAnsiString (cognitive 52) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:543— app._Debug_toAnsiString has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 4 (10 pts), boolean chains 7, ternaries 2 (5 pts) (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.
Players::make_bets (cognitive 51) 50_Horserace/rust/src/players.rs:50— Players::make_bets has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (37 pts), loops 3 (7 pts), match/switch 1 (7 pts) (nesting depth added 36). 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.
bullfight.main (cognitive 50) 17_Bullfight/python/bullfight.py:221— bullfight.main has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (46 pts), loops 2 (4 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
poker.ask_for_bet (cognitive 50) 71_Poker/javascript/poker.js:339— poker.ask_for_bet has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (47 pts), boolean chains 3 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
lifefortwo.show_data (cognitive 49) 56_Life_for_Two/javascript/lifefortwo.js:56— lifefortwo.show_data has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (39 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 30). 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· main (cognitive 49) · ×1
main (cognitive 49) 72_Queen/javascript/queen.js:143— main has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 6 (11 pts), boolean chains 7 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Slalom.DoARun (cognitive 46) 79_Slalom/csharp/program.cs:228— Slalom.DoARun has cognitive complexity 46 (threshold 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· main (cognitive 46) · ×1
main (cognitive 46) 28_Combat/javascript/combat.js:46— main has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 11, loops 6, match/switch 2 (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.
Mugwump.play (cognitive 44) 62_Mugwump/java/src/Mugwump.java:46— Mugwump.play has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 5 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Golf.stroke (cognitive 44) 39_Golf/python/golf.py:578— Golf.stroke has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 16 (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.
FurTrader.play (cognitive 43) 38_Fur_Trader/java/src/FurTrader.java:66— FurTrader.play has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (33 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 27). 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.
chomp.main (cognitive 43) 26_Chomp/javascript/chomp.js:77— chomp.main has cognitive complexity 43 (threshold 15). Drivers by points: loops 10 (23 pts), if/else 7 (19 pts), boolean chains 1 (nesting depth added 25). 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.
poetry.main (cognitive 43) 70_Poetry/javascript/poetry.js:46— poetry.main has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 4 (12 pts), boolean chains 3, loops 2 (3 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.
Board.play_computer_move (cognitive 42) 23_Checkers/python/checkers.py:227— Board.play_computer_move has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 4 (14 pts), boolean chains 4 (nesting depth added 26). 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.
TicTacToe.next_move (cognitive 42) 89_Tic-Tac-Toe/python/TicTacToe_Hard.py:89— TicTacToe.next_move has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 4 (6 pts), ternaries 1 (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.
app._Json_runHelp (cognitive 42) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:1403— app._Json_runHelp has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (25 pts), ternaries 4 (8 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
poker.evaluate_hand (cognitive 42) 71_Poker/javascript/poker.js:152— poker.evaluate_hand has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (37 pts), loops 4 (5 pts) (nesting depth added 17). 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.
gunner.main (cognitive 41) 42_Gunner/javascript/gunner.js:57— gunner.main has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 3 (6 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Game.play_game (cognitive 40) 10_Blackjack/python/blackjack.py:249— Game.play_game has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 10 (12 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
word.main (cognitive 40) 96_Word/javascript/word.mjs:15— word.main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 5 (12 pts) (nesting depth added 27). 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.
cube.play_game (cognitive 39) 30_Cube/python/cube.py:24— cube.play_game has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 6 (13 pts), error handling 2 (7 pts), boolean chains 2 (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.
main.main (cognitive 39) REDACTED:88— main.main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 6 (17 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rocket::main (cognitive 39) 59_Lunar_LEM_Rocket/rust/rocket/src/main.rs:6— rocket::main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 3 (6 pts) (nesting depth added 23). 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.
awari.computer_move (cognitive 39) 04_Awari/javascript/awari.js:128— awari.computer_move has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 6 (12 pts), boolean chains 1 (nesting depth added 23). 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.
stockmarket.main (cognitive 39) 83_Stock_Market/javascript/stockmarket.js:132— stockmarket.main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 6 (11 pts) (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.
Bowling.GameLoop (cognitive 37) 14_Bowling/csharp/Bowling.cs:54— Bowling.GameLoop has cognitive complexity 37 (threshold 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.
Basketball.dartmouth_jump_shot (cognitive 37) 07_Basketball/ruby/basketball.rb:118— Basketball.dartmouth_jump_shot has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (36 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Basketball.opponent_jumpshot (cognitive 37) 07_Basketball/ruby/basketball.rb:226— Basketball.opponent_jumpshot has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (37 pts) (nesting depth added 21). 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.
main.play (cognitive 37) REDACTED:40— main.play has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 2 (3 pts) (nesting depth added 23). 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.
bounce.main (cognitive 37) 13_Bounce/javascript/bounce.js:46— bounce.main has cognitive complexity 37 (threshold 15). Drivers by points: loops 9 (25 pts), if/else 3 (12 pts) (nesting depth added 25). 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· main (cognitive 37) · ×1
main (cognitive 37) 48_High_IQ/javascript/highiq.js:152— main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 8 (16 pts), boolean chains 3 (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.
GameState.simulateOneYear (cognitive 36) 53_King/kotlin/King.kt:471— GameState.simulateOneYear has cognitive complexity 36 (threshold 15). Drivers by points: if/else 28 (32 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
awari.computer_move (cognitive 36) 04_Awari/python/awari.py:159— awari.computer_move has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
main.main (cognitive 36) REDACTED:181— main.main has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 17). 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· main (cognitive 36) · ×1
main (cognitive 36) 18_Bullseye/javascript/bullseye.js:50— main has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 9 (15 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.
Slots.play (cognitive 35) 80_Slots/java/src/Slots.java:78— Slots.play has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Digits.main (cognitive 35) 34_Digits/python/Digits.py:74— Digits.main has cognitive complexity 35 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 5 (16 pts), boolean chains 2 (nesting depth added 22). 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.
furtrader.main (cognitive 35) 38_Fur_Trader/python/furtrader.py:127— furtrader.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (34 pts), 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.
hangman.play_game (cognitive 35) 44_Hangman/python/hangman.py:173— hangman.play_game has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (10 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.
hockey.simulate_game_round (cognitive 35) 49_Hockey/python/hockey.py:468— hockey.simulate_game_round has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 5 (7 pts), boolean chains 5 (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.
Game.move_ship (cognitive 35) 84_Super_Star_Trek/python/superstartrek.py:748— Game.move_ship has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (32 pts), boolean chains 2, loops 1 (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.
basketball.main (cognitive 35) 07_Basketball/javascript/basketball.js:302— basketball.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity· main (cognitive 35) · ×1
main (cognitive 35) 31_Depth_Charge/javascript/depthcharge.js:46— main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Splat.PlayOneRound (cognitive 34) 81_Splat/csharp/Program.cs:154— Splat.PlayOneRound has cognitive complexity 34 (threshold 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.
Diamond.startGame (cognitive 34) 32_Diamond/kotlin/diamond.kt:25— Diamond.startGame has cognitive complexity 34 (threshold 15). Drivers by points: loops 6 (18 pts), if/else 7 (15 pts), error handling 1 (nesting depth added 20). 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.
hello.swift.main (cognitive 34) 00_Alternate_Languages/45_Hello/Swift/hello.swift:18— hello.swift.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 5 (8 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.
markdown_todo_rust::main (cognitive 34) 00_Utilities/markdown_todo_rust/src/main.rs:27— markdown_todo_rust::main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (9 pts), match/switch 3 (5 pts), boolean chains 3 (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.
app._VirtualDom_diffHelp (cognitive 34) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:3050— app._VirtualDom_diffHelp has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, loops 3 (6 pts), ternaries 2 (6 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
hello.main (cognitive 34) 45_Hello/javascript/hello.js:46— hello.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slots.main (cognitive 34) 80_Slots/javascript/slots.js:48— slots.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 2 (3 pts), boolean chains 2 (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.
AceyduceyKt.main (cognitive 33) 01_Acey_Ducey/kotlin/aceyducey.kt:11— AceyduceyKt.main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 5 (15 pts), boolean chains 1 (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.
Game.navigation (cognitive 33) 84_Super_Star_Trek/python/superstartrek.py:659— Game.navigation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 4, loops 2, ternaries 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.
TicTacToe3D.machine_move (cognitive 33) 88_3-D_Tic-Tac-Toe/python/qubit.py:186— TicTacToe3D.machine_move has cognitive complexity 33 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 7 (15 pts), boolean chains 1 (nesting depth added 17). 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.
GAME::play_game (cognitive 33) 10_Blackjack/rust/src/main.rs:372— GAME::play_game has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 4 (5 pts), match/switch 1 (3 pts) (nesting depth added 17). 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.
app._VirtualDom_addDomNodesHelp (cognitive 33) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:3590— app._VirtualDom_addDomNodesHelp has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, loops 3 (4 pts), ternaries 1 (2 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.
diamond.main (cognitive 33) 32_Diamond/javascript/diamond.js:46— diamond.main has cognitive complexity 33 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 5 (13 pts), ternaries 1 (3 pts) (nesting depth added 21). 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.
Program.Main (cognitive 32) 60_Mastermind/csharp/Program.cs:15— Program.Main has cognitive complexity 32 (threshold 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.
chomp.play_game (cognitive 32) 26_Chomp/python/chomp.py:42— chomp.play_game has cognitive complexity 32 (threshold 15). Drivers by points: error handling 4 (10 pts), if/else 5 (10 pts), loops 6 (9 pts), boolean chains 3 (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.
life_for_two.display_board (cognitive 32) 56_Life_for_Two/python/life_for_two.py:70— life_for_two.display_board has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (7 pts) (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.
23matches.play_game (cognitive 32) 93_23_Matches/python/23matches.py:9— 23matches.play_game has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), error handling 1 (4 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). 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.
app._VirtualDom_diffKeyedKids (cognitive 32) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:3326— app._VirtualDom_diffKeyedKids has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 14, loops 3 (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.
Program.Main (cognitive 31) 21_Calendar/csharp/Program.cs:27— Program.Main has cognitive complexity 31 (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.
Game.run (cognitive 31) 10_Blackjack/java/src/Game.java:22— Game.run has cognitive complexity 31 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 7 (13 pts), boolean chains 2 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
Basketball.dartmouth_jump_shot (cognitive 31) 07_Basketball/python/basketball.py:111— Basketball.dartmouth_jump_shot has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gunner.gunner (cognitive 31) 42_Gunner/python/gunner.py:9— gunner.gunner has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (3 pts) (nesting depth added 19). 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.
word.play_game (cognitive 31) 96_Word/python/word.py:27— word.play_game has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Golf.interpret_results (cognitive 30) 39_Golf/python/golf.py:716— Golf.interpret_results has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (21 pts), ternaries 3 (6 pts), boolean chains 3 (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.
Matches.play_game (cognitive 30) 93_23_Matches/ruby/23_matches.rb:20— Matches.play_game has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (4 pts), boolean chains 2 (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.
app.$elm$json$Json$Decode$errorToStringHelp (cognitive 30) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:4668— app.$elm$json$Json$Decode$errorToStringHelp has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), ternaries 1 (3 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 16). Of this number, 15 points are the body's own statements and 15 belong to 4 function literals inside it that branch. 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.
guess.main (cognitive 29) 41_Guess/javascript/guess.js:52— guess.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
highiq.update_board (cognitive 29) 48_High_IQ/javascript/highiq.js:83— highiq.update_board has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (3 pts) (nesting depth added 17). 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.
Golf.InterpretResults (cognitive 28) 39_Golf/csharp/Program.cs:512— Golf.InterpretResults has cognitive complexity 28 (threshold 15). 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.
MainKt.main (cognitive 28) 17_Bullfight/kotlin/src/bullfight/Main.kt:50— MainKt.main has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 5 (9 pts), loops 2 (3 pts) (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.
Game.play (cognitive 28) 10_Blackjack/java/src/Game.java:161— Game.play has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 1, loops 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.
CivilWar.startBattle (cognitive 28) 27_Civil_War/java/src/CivilWar.java:116— CivilWar.startBattle has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (5 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.
bug.handle_roll (cognitive 28) 16_Bug/python/bug.py:82— bug.handle_roll has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (27 pts), ternaries 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.
salvo.execute_turn (cognitive 28) 77_Salvo/python/salvo.py:386— salvo.execute_turn has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (5 pts), ternaries 1 (3 pts), boolean chains 2 (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.
Game.phaser_control (cognitive 28) 84_Super_Star_Trek/python/superstartrek.py:411— Game.phaser_control has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 3 (4 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.
Qubit.play (cognitive 28) 88_3-D_Tic-Tac-Toe/python/qubit.py:311— Qubit.play has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (8 pts), boolean chains 4 (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.
TicTacToe.check_win (cognitive 28) 89_Tic-Tac-Toe/python/TicTacToe_Hard.py:21— TicTacToe.check_win has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, loops 3 (4 pts), ternaries 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.
Basketball.dartmouth_non_jump_shot (cognitive 28) 07_Basketball/ruby/basketball.rb:174— Basketball.dartmouth_non_jump_shot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (28 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.
change.main (cognitive 28) 22_Change/javascript/change.js:46— change.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 1 (nesting depth added 17). 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.
craps.main (cognitive 28) 29_Craps/javascript/craps.js:51— craps.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2 (4 pts), boolean chains 2 (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.
target.main (cognitive 28) 86_Target/javascript/target.js:46— target.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (7 pts), match/switch 1 (3 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· main (cognitive 28) · ×1
main (cognitive 28) 85_Synonym/javascript/synonym.js:62— main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 7 (13 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.
KnownHitsShotSelectionStrategy.GetShots (cognitive 27) 77_Salvo/csharp/Targetting/KnownHitsShotSelectionStrategy.cs:14— KnownHitsShotSelectionStrategy.GetShots has cognitive complexity 27 (threshold 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.
BullFight.Begin (cognitive 27) 17_Bullfight/csharp/BullFight.cs:25— BullFight.Begin has cognitive complexity 27 (threshold 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.
Program.ChoosePath_BlockedToTheLeft (cognitive 27) 02_Amazing/vbnet/program.vb:115— Program.ChoosePath_BlockedToTheLeft has cognitive complexity 27 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Animal.main (cognitive 27) 03_Animal/java/src/Animal.java:18— Animal.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (5 pts), ternaries 1 (5 pts), match/switch 1 (2 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.
Game.play (cognitive 27) 01_Acey_Ducey/python/acey_ducey_oo.py:53— Game.play has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Basketball.opponent_non_jumpshot (cognitive 27) 07_Basketball/ruby/basketball.rb:275— Basketball.opponent_non_jumpshot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (27 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.
main.main (cognitive 27) 00_Alternate_Languages/03_Animal/go/main.go:115— main.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (3 pts) (nesting depth added 17). 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.
mathdice.main (cognitive 27) 61_Math_Dice/javascript/mathdice.js:46— mathdice.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, 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.
Cube.play (cognitive 26) 30_Cube/java/src/Cube.java:62— Cube.play has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (6 pts), boolean chains 2 (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.
Pizza.play (cognitive 26) 69_Pizza/java/src/Pizza.java:59— Pizza.play has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
hockey.handle_hit (cognitive 26) 49_Hockey/python/hockey.py:338— hockey.handle_hit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 1 (2 pts), loops 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.
hockey.handle_miss (cognitive 26) 49_Hockey/python/hockey.py:395— hockey.handle_miss has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (26 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.
rockscissors.play_game (cognitive 26) 74_Rock_Scissors_Paper/python/rockscissors.py:9— rockscissors.play_game has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 7, error handling 2 (5 pts), loops 3 (4 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.
aceyducey.main (cognitive 26) 01_Acey_Ducey/javascript/aceyducey.js:72— aceyducey.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
superstartrek.commandPhotonTorpedo (cognitive 26) 84_Super_Star_Trek/javascript/superstartrek.mjs:1023— superstartrek.commandPhotonTorpedo has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4, loops 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.
qubit.show_board (cognitive 26) 88_3-D_Tic-Tac-Toe/javascript/qubit.js:127— qubit.show_board has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 5 (10 pts) (nesting depth added 17). 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.
weekday.main (cognitive 26) REDACTED:292— weekday.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 1, match/switch 1 (nesting depth added 11). Of this number, 22 points are the body's own statements and 4 belong to one function item inside it that branches. 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.
Qubic.Loop (cognitive 25) 88_3-D_Tic-Tac-Toe/csharp/Qubic.cs:131— Qubic.Loop has cognitive complexity 25 (threshold 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.
Bullseye.play (cognitive 25) 18_Bullseye/java/src/Bullseye.java:62— Bullseye.play has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (10 pts), 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.
Chief.play (cognitive 25) 25_Chief/java/src/Chief.java:43— Chief.play has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (11 pts), 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.
acey_ducey.play_game (cognitive 25) 01_Acey_Ducey/python/acey_ducey.py:26— acey_ducey.play_game has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (5 pts), error handling 1 (3 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.
bagels.main (cognitive 25) 05_Bagels/python/bagels.py:105— bagels.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (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.
Basketball.dartmouth_non_jump_shot (cognitive 25) 07_Basketball/python/basketball.py:162— Basketball.dartmouth_non_jump_shot has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (25 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.
combat.attack_second (cognitive 25) 28_Combat/python/combat.py:108— combat.attack_second has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6, loops 2 (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.
main.main (cognitive 25) REDACTED:102— main.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (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.
tictactoe2.show_board (cognitive 25) 89_Tic-Tac-Toe/javascript/tictactoe2.js:56— tictactoe2.show_board has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, loops 4 (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.
Table.GetWagers (cognitive 24) 71_Poker/csharp/Table.cs:109— Table.GetWagers has cognitive complexity 24 (threshold 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.
Game.PlayRound (cognitive 24) 10_Blackjack/csharp/Game.cs:34— Game.PlayRound has cognitive complexity 24 (threshold 15). Of this number, 22 points are the body's own statements and 2 belong to one function literal inside it that branches. 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.
Bombardment.play (cognitive 24) 11_Bombardment/java/src/Bombardment.java:56— Bombardment.play has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts), match/switch 1 (2 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.
LiteratureQuiz.play (cognitive 24) 57_Literature_Quiz/java/src/LiteratureQuiz.java:41— LiteratureQuiz.play has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 1 (2 pts), loops 1 (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.
mastermind.computer_turn (cognitive 24) 60_Mastermind/python/mastermind.py:92— mastermind.computer_turn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
queen.get_move (cognitive 24) 72_Queen/python/queen.py:143— queen.get_move has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 10, error handling 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.
slalom.main (cognitive 24) 79_Slalom/python/slalom.py:133— slalom.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Bug.play (cognitive 23) 16_Bug/java/src/Bug.java:54— Bug.play has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Basketball.opponent_jumpshot (cognitive 23) 07_Basketball/python/basketball.py:245— Basketball.opponent_jumpshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 5 (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.
Game.photon_torpedoes (cognitive 23) 84_Super_Star_Trek/python/superstartrek.py:484— Game.photon_torpedoes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 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.
app._VirtualDom_diffFacts (cognitive 23) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:3217— app._VirtualDom_diffFacts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 10, loops 2 (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.
Game.BeginLoop (cognitive 22) 03_Animal/vbnet/Animal/Game.vb:47— Game.BeginLoop has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Game.PlayHand (cognitive 22) 10_Blackjack/csharp/Game.cs:120— Game.PlayHand has cognitive complexity 22 (threshold 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.
Program.GameLoop (cognitive 22) 44_Hangman/csharp/Program.cs:58— Program.GameLoop has cognitive complexity 22 (threshold 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.
Program.PrintFinalResults (cognitive 22) 02_Amazing/vbnet/program.vb:203— Program.PrintFinalResults has cognitive complexity 22 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Calendar.start (cognitive 22) 21_Calendar/ruby/calendar.rb:47— Calendar.start has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
highiq.check_game_over (cognitive 22) 48_High_IQ/javascript/highiq.js:130— highiq.check_game_over has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Qubic.MakePlayerTrap (cognitive 21) 88_3-D_Tic-Tac-Toe/csharp/Qubic.cs:586— Qubic.MakePlayerTrap has cognitive complexity 21 (threshold 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. This shape REPEATS in the file: one other method here (Qubic.BlockMachineTrap) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Qubic.BlockMachineTrap (cognitive 21) 88_3-D_Tic-Tac-Toe/csharp/Qubic.cs:661— Qubic.BlockMachineTrap has cognitive complexity 21 (threshold 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. This shape REPEATS in the file: one other method here (Qubic.MakePlayerTrap) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Game.evaluateRound (cognitive 21) 10_Blackjack/java/src/Game.java:289— Game.evaluateRound has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 1, loops 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.
Insect.draw (cognitive 21) 16_Bug/java/src/Insect.java:270— Insect.draw has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 6 (7 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
bullseye.main (cognitive 21) 18_Bullseye/python/bullseye.py:45— bullseye.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 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.
calendar.calendar (cognitive 21) 21_Calendar/python/calendar.py:67— calendar.calendar has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
combat.attack_first (cognitive 21) 28_Combat/python/combat.py:37— combat.attack_first has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, loops 2 (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.
onecheck.play_game (cognitive 21) 67_One_Check/python/onecheck.py:45— onecheck.play_game has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
roulette.query_bets (cognitive 21) 75_Roulette/python/roulette.py:63— roulette.query_bets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 4 (7 pts), error handling 2 (5 pts), boolean chains 2 (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.
checkers.eval_move (cognitive 21) 23_Checkers/javascript/checkers.js:69— checkers.eval_move has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, loops 1 (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.
pizza.main (cognitive 21) 69_Pizza/javascript/pizza.js:50— pizza.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (8 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· main (cognitive 21) · ×1
main (cognitive 21) 58_Love/javascript/love.js:59— main has cognitive complexity 21 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 2 (4 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
Table.PlayHand (cognitive 20) 71_Poker/csharp/Table.cs:30— Table.PlayHand has cognitive complexity 20 (threshold 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.
Qubic.MoveByPlane (cognitive 20) 88_3-D_Tic-Tac-Toe/csharp/Qubic.cs:778— Qubic.MoveByPlane has cognitive complexity 20 (threshold 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.
Game.UserInteraction (cognitive 20) 09_Battle/csharp/Game.cs:227— Game.UserInteraction has cognitive complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to one function literal inside it that branches. 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.
Slalom.PlayOneRound (cognitive 20) 79_Slalom/csharp/program.cs:361— Slalom.PlayOneRound has cognitive complexity 20 (threshold 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.
trap.play_game (cognitive 20) 92_Trap/python/trap.py:13— trap.play_game has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 1 (3 pts), loops 2 (3 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.
Maze.create (cognitive 20) 02_Amazing/ruby/amazing.rb:84— Maze.create has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, 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.
main.play (cognitive 20) REDACTED:42— main.play has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2, jumps 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.
highiq.print_board (cognitive 20) 48_High_IQ/javascript/highiq.js:60— highiq.print_board has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), boolean chains 2 (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.
poker.deal_card (cognitive 20) 71_Poker/javascript/poker.js:82— poker.deal_card has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 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.
stockmarket.randomize_initial (cognitive 20) 83_Stock_Market/javascript/stockmarket.js:62— stockmarket.randomize_initial has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, 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.
superstartrek.commandPhaserControl (cognitive 20) 84_Super_Star_Trek/javascript/superstartrek.mjs:901— superstartrek.commandPhaserControl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 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.
23matches.main (cognitive 20) 93_23_Matches/javascript/23matches.js:46— 23matches.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AmazingGame.WriteMaze (cognitive 19) 02_Amazing/csharp/Amazing.cs:109— AmazingGame.WriteMaze has cognitive complexity 19 (threshold 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.
Banner.PrintChar (cognitive 19) 06_Banner/csharp/banner.cs:133— Banner.PrintChar has cognitive complexity 19 (threshold 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.
boxing.play_round (cognitive 19) 15_Boxing/python/boxing.py:137— boxing.play_round has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, 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.
maze.build (cognitive 19) REDACTED:76— maze.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 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.
main.main (cognitive 19) 00_Alternate_Languages/89_Tic-Tac-Toe/go/src/tictactoe1.go:8— main.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 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.
app.$elm$core$List$foldrHelper (cognitive 19) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:5083— app.$elm$core$List$foldrHelper has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 1 (5 pts) (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.
app.$author$project$Main$calculateNewState (cognitive 19) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:5389— app.$author$project$Main$calculateNewState has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (12 pts), if/else 4 (5 pts), boolean chains 2 (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.
stars.main (cognitive 19) 82_Stars/javascript/stars.js:49— stars.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (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.
tower.show_towers (cognitive 19) 90_Tower/javascript/tower.js:48— tower.show_towers has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (4 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.
Hand.Analyze (cognitive 18) 71_Poker/csharp/Cards/Hand.cs:46— Hand.Analyze has cognitive complexity 18 (threshold 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.
Banner.PrintChar (cognitive 18) 06_Banner/vbnet/banner.vb:123— Banner.PrintChar has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
Reverse.Main (cognitive 18) 73_Reverse/vbnet/Reverse.vb:17— Reverse.Main has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function.
markdown_todo.get_data (cognitive 18) 00_Utilities/markdown_todo.py:14— markdown_todo.get_data has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 3, ternaries 1 (3 pts), 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.
mugwump.play_round (cognitive 18) 62_Mugwump/python/mugwump.py:50— mugwump.play_round has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (5 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tictactoe2.determine_winner (cognitive 18) 89_Tic-Tac-Toe/python/tictactoe2.py:128— tictactoe2.determine_winner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, ternaries 1 (3 pts), loops 2 (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.
Hello.ask_question_loop (cognitive 18) 45_Hello/ruby/hello.rb:119— Hello.ask_question_loop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 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.
maze.draw (cognitive 18) REDACTED:163— maze.draw has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (6 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.
Stats::new (cognitive 18) 81_Splat/rust/src/stats.rs:13— Stats::new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (3 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.
stars::main (cognitive 18) 82_Stars/rust/src/main.rs:4— stars::main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), match/switch 1 (3 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.
app._VirtualDom_applyFacts (cognitive 18) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:2824— app._VirtualDom_applyFacts has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (14 pts), boolean chains 3, 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.
superstartrek.newQuadrantEntered (cognitive 18) 84_Super_Star_Trek/javascript/superstartrek.mjs:265— superstartrek.newQuadrantEntered has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Controller.GetPlayerIntention (cognitive 17) 17_Bullfight/csharp/Controller.cs:34— Controller.GetPlayerIntention has cognitive complexity 17 (threshold 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.
Life.advanceToNextGeneration (cognitive 17) 55_Life/java/src/java/Life.java:64— Life.advanceToNextGeneration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 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.
Maze.display (cognitive 17) 02_Amazing/python/amazing.py:34— Maze.display has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (6 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.
amazing.build_maze (cognitive 17) 02_Amazing/python/amazing.py:87— amazing.build_maze has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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.
animal.main (cognitive 17) 03_Animal/python/animal.py:125— animal.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 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.
bounce.run_simulation (cognitive 17) 13_Bounce/python/bounce.py:54— bounce.run_simulation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 5 (8 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.
Board.evaluate_move (cognitive 17) 23_Checkers/python/checkers.py:172— Board.evaluate_move has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 1 (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.
craps.main (cognitive 17) 29_Craps/python/craps.py:21— craps.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 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.
guess.main (cognitive 17) 41_Guess/python/guess.py:57— guess.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lunar.run_simulation (cognitive 17) 59_Lunar_LEM_Rocket/python/lunar.py:291— lunar.run_simulation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, 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.
salvo.initialize_game (cognitive 17) 77_Salvo/python/salvo.py:303— salvo.initialize_game has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (5 pts) (nesting depth added 7). 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.
Game.short_range_scan (cognitive 17) 84_Super_Star_Trek/python/superstartrek.py:579— Game.short_range_scan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tictactoe2.think (cognitive 17) 89_Tic-Tac-Toe/python/tictactoe2.py:83— tictactoe2.think has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6 (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.
Game.play_hand (cognitive 17) 10_Blackjack/ruby/game.rb:97— Game.play_hand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
guessing_game::main (cognitive 17) 47_Hi-Lo/rust/src/main.rs:4— guessing_game::main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app._Scheduler_step (cognitive 17) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:1790— app._Scheduler_step has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 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.
animal.show_animals (cognitive 17) 03_Animal/javascript/animal.js:71— animal.show_animals has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 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.
hurkle.main (cognitive 17) 51_Hurkle/javascript/hurkle.js:46— hurkle.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 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.
orbit.main (cognitive 17) 68_Orbit/javascript/orbit.js:48— orbit.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 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.
trap.main (cognitive 17) 92_Trap/javascript/trap.js:46— trap.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 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.
BullseyeGame.PlayGame (cognitive 16) 18_Bullseye/csharp/BullseyeGame.cs:91— BullseyeGame.PlayGame has cognitive complexity 16 (threshold 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.
ScoringUtils.compareHands (cognitive 16) 10_Blackjack/java/src/ScoringUtils.java:37— ScoringUtils.compareHands has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5 (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.
Board.checkWin (cognitive 16) 89_Tic-Tac-Toe/java/src/Board.java:49— Board.checkWin has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
Basketball.opponent_non_jumpshot (cognitive 16) 07_Basketball/python/basketball.py:289— Basketball.opponent_non_jumpshot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Player.play_frame (cognitive 16) 14_Bowling/python/bowling.py:40— Player.play_frame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bug.main (cognitive 16) 16_Bug/python/bug.py:154— bug.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
king.resume (cognitive 16) 53_King/python/king.py:354— king.resume has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (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.
life_for_two.query_player (cognitive 16) 56_Life_for_Two/python/life_for_two.py:105— life_for_two.query_player has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mathdice.main (cognitive 16) 61_Math_Dice/python/mathdice.py:49— mathdice.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 1 (3 pts), loops 2 (3 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.
russianroulette.main (cognitive 16) 76_Russian_Roulette/python/russianroulette.py:37— russianroulette.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
main.main (cognitive 16) REDACTED:28— main.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 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.
app._VirtualDom_render (cognitive 16) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:2757— app._VirtualDom_render has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 5, loops 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app._VirtualDom_makeCallback::callback (cognitive 16) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:2959— app._VirtualDom_makeCallback::callback has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 4, if/else 3 (4 pts), loops 2 (4 pts), ternaries 3 (4 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.
app.$author$project$Main$update (cognitive 16) 00_Alternate_Languages/01_Acey_Ducey/elm/docs/app.js:5454— app.$author$project$Main$update has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 4 (6 pts), match/switch 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.
poker.player_low_in_money (cognitive 16) 71_Poker/javascript/poker.js:263— poker.player_low_in_money has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
superstartrek.gameReset (cognitive 16) 84_Super_Star_Trek/javascript/superstartrek.mjs:152— superstartrek.gameReset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 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.
superstartrek.commandDamageControl (cognitive 16) 84_Super_Star_Trek/javascript/superstartrek.mjs:1290— superstartrek.commandDamageControl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 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.
TooManyMethods: Qubic 88_3-D_Tic-Tac-Toe/csharp/Qubic.cs— TooManyMethods — 313 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10× 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.
D4 · Code Duplication· Near-duplicate member family (6 members, 40 shared lines) · ×1
Near-duplicate member family (6 members, 40 shared lines) 18_Bullseye/rust/src/lib.rs:177— 18_Bullseye/rust/src/lib.rs:177-223 | 24_Chemist/rust/src/lib.rs:112-158 | 32_Diamond/rust/src/lib.rs:136-182 | 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs:417-463 | 68_Orbit/rust/src/lib.rs:169-215 | 91_Train/rust/src/lib.rs:109-155 — These 6 members are variants of one another: a block of 40 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (6 members, 50+ identical tokens) 18_Bullseye/rust/src/lib.rs:153— 18_Bullseye/rust/src/lib.rs:153-168 | 24_Chemist/rust/src/lib.rs:89-104 | 32_Diamond/rust/src/lib.rs:112-127 | 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs:394-409 | 68_Orbit/rust/src/lib.rs:145-160 | 91_Train/rust/src/lib.rs:86-101 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) 01_Acey_Ducey/csharp/Game.cs:301— 01_Acey_Ducey/csharp/Game.cs:301-323 | 05_Bagels/csharp/GameBase.cs:14-36 | 33_Dice/csharp/Game.cs:88-110 | 38_Fur_Trader/csharp/Game.cs:86-110 | 38_Fur_Trader/csharp/Game.cs:387-411 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) 64_Nicomachus/csharp/program.cs:20— 64_Nicomachus/csharp/program.cs:20-37 | 68_Orbit/csharp/program.cs:77-94 | 79_Slalom/csharp/program.cs:46-63 | 81_Splat/csharp/Program.cs:37-54 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (24–25 lines × 2) 88_3-D_Tic-Tac-Toe/csharp/Qubic.cs:598— 88_3-D_Tic-Tac-Toe/csharp/Qubic.cs:598-622 | 88_3-D_Tic-Tac-Toe/csharp/Qubic.cs:673-696 — 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 `88_3-D_Tic-Tac-Toe/csharp/Qubic.cs:598` 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.
Duplicated block (14 lines × 2) 64_Nicomachus/csharp/program.cs:41— 64_Nicomachus/csharp/program.cs:41-54 | 68_Orbit/csharp/program.cs:98-111 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Duplicated block (12–13 lines × 2) 09_Battle/csharp/Game.cs:84— 09_Battle/csharp/Game.cs:84-96 | 09_Battle/csharp/Game.cs:166-177 — 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 `09_Battle/csharp/Game.cs:84` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11–12 lines × 2) 09_Battle/csharp/Game.cs:119— 09_Battle/csharp/Game.cs:119-129 | 09_Battle/csharp/Game.cs:200-211 — 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 `09_Battle/csharp/Game.cs:119` 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 3) 09_Battle/csharp/Game.cs:106— 09_Battle/csharp/Game.cs:106-110 | 09_Battle/csharp/Game.cs:112-116 | 09_Battle/csharp/Game.cs:193-197 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `09_Battle/csharp/Game.cs:112` 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 10) 26_Chomp/csharp/Resources/Resource.cs:38— 26_Chomp/csharp/Resources/Resource.cs:38-47 | 30_Cube/csharp/Resources/Resource.cs:35-43 | 32_Diamond/csharp/Resources/Resource.cs:19-28 | 34_Digits/csharp/Resources/Resource.cs:33-42 | 41_Guess/csharp/Resources/Resource.cs:35-43 | 56_Life_for_Two/csharp/Resources/Resource.cs:28-36 | 67_One_Check/csharp/Resources/Resource.cs:35-44 | 72_Queen/csharp/Resources/Resource.cs:32-46 | 75_Roulette/csharp/Resources/Resource.cs:22-58 | 77_Salvo/csharp/Resources/Resource.cs:21-48 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 10 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 10 times. Read the line range as the matched WINDOW rather than a finished unit: at `72_Queen/csharp/Resources/Resource.cs:32` 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.
Duplicated block (22–23 lines × 3) 89_Tic-Tac-Toe/java/src/TicTacToe2.java:85— 89_Tic-Tac-Toe/java/src/TicTacToe2.java:85-106 | 89_Tic-Tac-Toe/java/src/TicTacToe2.java:108-129 | 89_Tic-Tac-Toe/java/src/TicTacToe2.java:131-153 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `89_Tic-Tac-Toe/java/src/TicTacToe2.java:131` 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13–14 lines × 2) 22_Change/java/src/Change.java:88— 22_Change/java/src/Change.java:88-100 | 22_Change/java/src/Change.java:109-122 — 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.
Duplicated block (8 lines × 2) 08_Batnum/java/src/BatNum.java:233— 08_Batnum/java/src/BatNum.java:233-240 | 57_Literature_Quiz/java/src/LiteratureQuiz.java:130-137 — 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 (7 lines × 4) 16_Bug/java/src/Bug.java:192— 16_Bug/java/src/Bug.java:192-199 | 38_Fur_Trader/java/src/FurTrader.java:380-387 | 38_Fur_Trader/java/src/FurTrader.java:397-403 | 85_Synonym/java/src/Synonym.java:106-112 — there are 4 copies across 3 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at `16_Bug/java/src/Bug.java:192` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `38_Fur_Trader/java/src/FurTrader.java:395` calls `intro` and `85_Synonym/java/src/Synonym.java:104` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (6 lines × 6) 01_Acey_Ducey/java/src/AceyDucey.java:164— 01_Acey_Ducey/java/src/AceyDucey.java:164-169 | 08_Batnum/java/src/BatNum.java:237-242 | 24_Chemist/java/src/Chemist.java:101-106 | 62_Mugwump/java/src/Mugwump.java:133-138 | 69_Pizza/java/src/Pizza.java:236-241 | 85_Synonym/java/src/Synonym.java:104-109 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times.
Duplicated block (6 lines × 4) 24_Chemist/java/src/Chemist.java:101— 24_Chemist/java/src/Chemist.java:101-106 | 33_Dice/java/src/Dice.java:81-86 | 62_Mugwump/java/src/Mugwump.java:133-138 | 85_Synonym/java/src/Synonym.java:104-109 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times.
Duplicated block (5 lines × 9) 08_Batnum/java/src/BatNum.java:232— 08_Batnum/java/src/BatNum.java:232-236 | 22_Change/java/src/Change.java:146-150 | 24_Chemist/java/src/Chemist.java:99-103 | 33_Dice/java/src/Dice.java:79-83 | 41_Guess/java/src/Guess.java:109-113 | 43_Hammurabi/java/src/Hamurabi.java:323-327 | 57_Literature_Quiz/java/src/LiteratureQuiz.java:129-133 | 80_Slots/java/src/Slots.java:203-207 | 85_Synonym/java/src/Synonym.java:102-106 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 9 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 9 times.
Duplicated block (23 lines × 2) 28_Combat/python/combat.py:43— 28_Combat/python/combat.py:43-65 | 28_Combat/python/combat.py:122-144 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17–18 lines × 2) 37_Football/python/football.py:304— 37_Football/python/football.py:304-320 | 37_Football/python/football.py:412-429 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (16 lines × 2) 17_Bullfight/python/bullfight.py:75— 17_Bullfight/python/bullfight.py:75-90 | 84_Super_Star_Trek/python/superstartrekins.py:107-122 — 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 (9–10 lines × 2) 37_Football/python/football.py:220— 37_Football/python/football.py:220-229 | 37_Football/python/football.py:407-415 — 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 3) 38_Fur_Trader/python/furtrader.py:176— 38_Fur_Trader/python/furtrader.py:176-184 | 38_Fur_Trader/python/furtrader.py:194-202 | 38_Fur_Trader/python/furtrader.py:233-241 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (26 lines × 6) 18_Bullseye/rust/src/lib.rs:198— 18_Bullseye/rust/src/lib.rs:198-223 | 24_Chemist/rust/src/lib.rs:133-158 | 32_Diamond/rust/src/lib.rs:157-182 | 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs:438-463 | 68_Orbit/rust/src/lib.rs:190-215 | 91_Train/rust/src/lib.rs:130-155 — before extracting anything, compare `18_Bullseye/rust/src/lib.rs` and `24_Chemist/rust/src/lib.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (20 lines × 2) 50_Horserace/rust/src/util.rs:21— 50_Horserace/rust/src/util.rs:21-40 | 72_Queen/rust/src/util.rs:21-40 — 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 (14 lines × 6) 18_Bullseye/rust/src/lib.rs:179— 18_Bullseye/rust/src/lib.rs:179-192 | 24_Chemist/rust/src/lib.rs:114-127 | 32_Diamond/rust/src/lib.rs:138-151 | 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs:419-432 | 68_Orbit/rust/src/lib.rs:171-184 | 91_Train/rust/src/lib.rs:111-124 — before extracting anything, compare `18_Bullseye/rust/src/lib.rs` and `24_Chemist/rust/src/lib.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Duplicated block (12 lines × 2) 10_Blackjack/rust/src/main.rs:232— 10_Blackjack/rust/src/main.rs:232-243 | 10_Blackjack/rust/src/main.rs:261-272 — 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.
Duplicated block (5 lines × 6) 18_Bullseye/rust/src/lib.rs:164— 18_Bullseye/rust/src/lib.rs:164-168 | 24_Chemist/rust/src/lib.rs:100-104 | 32_Diamond/rust/src/lib.rs:123-127 | 60_Mastermind/rust/Mastermind_refactored_for_conventions/src/lib.rs:405-409 | 68_Orbit/rust/src/lib.rs:156-160 | 91_Train/rust/src/lib.rs:97-101 — before extracting anything, compare `18_Bullseye/rust/src/lib.rs` and `24_Chemist/rust/src/lib.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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.
Low cohesion: TextIO (LCOM4 4) 00_Common/dotnet/Games.Common/IO/TextIO.cs:14— TextIO'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.
No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
Duplication concentrated across 93 sibling directories (92 clone groups) 51_Hurkle/javascript/hurkle.js:6— 92 duplicated blocks under the repository root have copies in at least two of the sibling directories 01_Acey_Ducey, 02_Amazing, 03_Animal, 04_Awari, 05_Bagels, 06_Banner (+87 more sibling(s) not listed) — 59 of them are reported below, and 33 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 92 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 92 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 92 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication· Duplicated block with local edits (64 matched lines × 2 locations) · ×1
Duplicated block with local edits (64 matched lines × 2 locations) 51_Hurkle/javascript/hurkle.js:6— 51_Hurkle/javascript/hurkle.js:6 · 92_Trap/javascript/trap.js:6 — the two spans are one implementation copied and then locally edited — 382 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (54 lines × 2 locations) 30_Cube/javascript/cube.js:6— 30_Cube/javascript/cube.js:6 · 34_Digits/javascript/digits.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (50 lines × 2 locations) 13_Bounce/javascript/bounce.js:6— 13_Bounce/javascript/bounce.js:6 · 22_Change/javascript/change.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (49 lines × 4 locations) 08_Batnum/javascript/batnum.js:6— 08_Batnum/javascript/batnum.js:6 · 24_Chemist/javascript/chemist.js:6 · 47_Hi-Lo/javascript/hi-lo.js:6 · 66_Number/javascript/number.js:6 — the 4 copies are spread across 4 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
Duplicated block (49 lines × 3 locations) 36_Flip_Flop/javascript/flipflop.js:6— 36_Flip_Flop/javascript/flipflop.js:6 · 62_Mugwump/javascript/mugwump.js:6 · 68_Orbit/javascript/orbit.js:6 — the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
Duplicated block (48 lines × 2 locations) 49_Hockey/javascript/hockey.js:6— 49_Hockey/javascript/hockey.js:6 · 50_Horserace/javascript/horserace.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (47 lines × 2 locations) 67_One_Check/javascript/onecheck.js:6— 67_One_Check/javascript/onecheck.js:6 · 81_Splat/javascript/splat.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication· Duplicated block with local edits (45 matched lines × 2 locations) · ×1
Duplicated block with local edits (45 matched lines × 2 locations) 35_Even_Wins/javascript/gameofevenwins.js:6— 35_Even_Wins/javascript/gameofevenwins.js:6 · 76_Russian_Roulette/javascript/russianroulette.js:6 — the two spans are one implementation copied and then locally edited — 235 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (44 lines × 3 locations) 25_Chief/javascript/chief.js:6— 25_Chief/javascript/chief.js:6 · 32_Diamond/javascript/diamond.js:6 · 34_Digits/javascript/digits.js:6 — the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
Duplicated block (43 lines × 2 locations) 35_Even_Wins/javascript/evenwins.js:6— 35_Even_Wins/javascript/evenwins.js:6 · 55_Life/javascript/life.js:6 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (41 lines × 2 locations) 37_Football/javascript/football.js:248— 37_Football/javascript/football.js:248 · 37_Football/javascript/football.js:445 — 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.
Duplicated block (40 lines × 2 locations) 16_Bug/javascript/bug.js:199— 16_Bug/javascript/bug.js:199 · 16_Bug/javascript/bug.js:277 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (39 lines × 7 locations) 09_Battle/javascript/battle.js:6— 09_Battle/javascript/battle.js:6 · 10_Blackjack/javascript/blackjack.js:6 · 49_Hockey/javascript/hockey.js:6 · 50_Horserace/javascript/horserace.js:6 · +3 more site(s) not listed — the 7 copies are spread across 7 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 7 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
Duplicated block (37 lines × 2 locations) 09_Battle/javascript/battle.js:80— 09_Battle/javascript/battle.js:80 · 09_Battle/javascript/battle.js:149 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (36 matched lines × 2 locations) · ×1
Duplicated block with local edits (36 matched lines × 2 locations) 12_Bombs_Away/javascript/bombsaway.js:6— 12_Bombs_Away/javascript/bombsaway.js:6 · 43_Hammurabi/javascript/hammurabi.js:6 — the two spans are one implementation copied and then locally edited — 191 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (34 lines × 89 locations) 02_Amazing/javascript/amazing.js:6— 02_Amazing/javascript/amazing.js:6 · 03_Animal/javascript/animal.js:6 · 04_Awari/javascript/awari.js:6 · 05_Bagels/javascript/bagels.js:6 · +85 more site(s) not listed — the 89 copies are spread across 85 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 89 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
Duplicated block (28 lines × 2 locations) 16_Bug/javascript/bug.js:6— 16_Bug/javascript/bug.js:6 · REDACTED:10 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (25 lines × 3 locations) 02_Amazing/javascript/amazing.js:11— 02_Amazing/javascript/amazing.js:11 · 03_Animal/javascript/animal.js:11 · 42_Gunner/javascript/gunner.js:11 — the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
Duplicated block (25 lines × 2 locations) 04_Awari/javascript/awari.js:11— 04_Awari/javascript/awari.js:11 · 05_Bagels/javascript/bagels.js:11 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
Duplicated block (25 lines × 6 locations) 09_Battle/javascript/battle.js:11— 09_Battle/javascript/battle.js:11 · 10_Blackjack/javascript/blackjack.js:11 · 49_Hockey/javascript/hockey.js:11 · 50_Horserace/javascript/horserace.js:11 · +2 more site(s) not listed — the 6 copies are spread across 6 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 6 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape — one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values — and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 133, cognitive 419) · ×1
Complex function main (cyclomatic 133, cognitive 419) 77_Salvo/javascript/salvo.js:89— main has cyclomatic complexity 133 and cognitive complexity 419; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 113, cognitive 274) · ×1
Complex function main (cyclomatic 113, cognitive 274) 37_Football/javascript/ftball.js:99— main has cyclomatic complexity 113 and cognitive complexity 274; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 111, cognitive 425) · ×1
Complex function main (cyclomatic 111, cognitive 425) 09_Battle/javascript/battle.js:53— main has cyclomatic complexity 111 and cognitive complexity 425; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 93, cognitive 201) · ×1
Complex function main (cyclomatic 93, cognitive 201) 27_Civil_War/javascript/civilwar.js:71— main has cyclomatic complexity 93 and cognitive complexity 201; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 92, cognitive 315) · ×1
Complex function main (cyclomatic 92, cognitive 315) 10_Blackjack/javascript/blackjack.js:208— main has cyclomatic complexity 92 and cognitive complexity 315; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 83, cognitive 226) · ×1
Complex function main (cyclomatic 83, cognitive 226) 37_Football/javascript/football.js:124— main has cyclomatic complexity 83 and cognitive complexity 226; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 83, cognitive 169) · ×1
Complex function main (cyclomatic 83, cognitive 169) 49_Hockey/javascript/hockey.js:54— main has cyclomatic complexity 83 and cognitive complexity 169; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 80, cognitive 221) · ×1
Complex function main (cyclomatic 80, cognitive 221) 02_Amazing/javascript/amazing.js:54— main has cyclomatic complexity 80 and cognitive complexity 221; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 77, cognitive 269) · ×1
Complex function main (cyclomatic 77, cognitive 269) 88_3-D_Tic-Tac-Toe/javascript/qubit.js:204— main has cyclomatic complexity 77 and cognitive complexity 269; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 75, cognitive 170) · ×1
Complex function main (cyclomatic 75, cognitive 170) 75_Roulette/javascript/roulette.js:54— main has cyclomatic complexity 75 and cognitive complexity 170; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 74, cognitive 246) · ×1
Complex function main (cyclomatic 74, cognitive 246) 89_Tic-Tac-Toe/javascript/tictactoe2.js:110— main has cyclomatic complexity 74 and cognitive complexity 246; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 74, cognitive 218) · ×1
Complex function main (cyclomatic 74, cognitive 218) 71_Poker/javascript/poker.js:436— main has cyclomatic complexity 74 and cognitive complexity 218; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 72, cognitive 180) · ×1
Complex function main (cyclomatic 72, cognitive 180) 46_Hexapawn/javascript/hexapawn.js:119— main has cyclomatic complexity 72 and cognitive complexity 180; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 70, cognitive 260) · ×1
Complex function main (cyclomatic 70, cognitive 260) 65_Nim/javascript/nim.js:50— main has cyclomatic complexity 70 and cognitive complexity 260; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 70, cognitive 159) · ×1
Complex function main (cyclomatic 70, cognitive 159) 53_King/javascript/king.js:55— main has cyclomatic complexity 70 and cognitive complexity 159; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 67, cognitive 216) · ×1
Complex function main (cyclomatic 67, cognitive 216) 39_Golf/javascript/golf.js:91— main has cyclomatic complexity 67 and cognitive complexity 216; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 57, cognitive 92) · ×1
Complex function main (cyclomatic 57, cognitive 92) 81_Splat/javascript/splat.js:48— main has cyclomatic complexity 57 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 56, cognitive 156) · ×1
Complex function main (cyclomatic 56, cognitive 156) 23_Checkers/javascript/checkers.js:122— main has cyclomatic complexity 56 and cognitive complexity 156; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 53, cognitive 83) · ×1
Complex function main (cyclomatic 53, cognitive 83) 30_Cube/javascript/cube.js:46— main has cyclomatic complexity 53 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 50, cognitive 101) · ×1
Complex function main (cyclomatic 50, cognitive 101) 44_Hangman/javascript/hangman.js:68— main has cyclomatic complexity 50 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files· 84_Super_Star_Trek/javascript/superstartrek.mjs · ×1
84_Super_Star_Trek/javascript/superstartrek.mjs: 1506 lines of code 84_Super_Star_Trek/javascript/superstartrek.mjs:1— 84_Super_Star_Trek/javascript/superstartrek.mjs has 1506 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· 71_Poker/javascript/poker.js · ×1
71_Poker/javascript/poker.js: 727 lines of code 71_Poker/javascript/poker.js:1— 71_Poker/javascript/poker.js has 727 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· 10_Blackjack/javascript/blackjack.js · ×1
10_Blackjack/javascript/blackjack.js: 521 lines of code 10_Blackjack/javascript/blackjack.js:1— 10_Blackjack/javascript/blackjack.js has 521 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· 27_Civil_War/javascript/civilwar.js · ×1
27_Civil_War/javascript/civilwar.js: 520 lines of code 27_Civil_War/javascript/civilwar.js:1— 27_Civil_War/javascript/civilwar.js has 520 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· 37_Football/javascript/ftball.js · ×1
37_Football/javascript/ftball.js: 494 lines of code 37_Football/javascript/ftball.js:1— 37_Football/javascript/ftball.js has 494 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· 77_Salvo/javascript/salvo.js · ×1
77_Salvo/javascript/salvo.js: 492 lines of code 77_Salvo/javascript/salvo.js:1— 77_Salvo/javascript/salvo.js has 492 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· 37_Football/javascript/football.js · ×1
37_Football/javascript/football.js: 489 lines of code 37_Football/javascript/football.js:1— 37_Football/javascript/football.js has 489 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· 49_Hockey/javascript/hockey.js · ×1
49_Hockey/javascript/hockey.js: 455 lines of code 49_Hockey/javascript/hockey.js:1— 49_Hockey/javascript/hockey.js has 455 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· 88_3-D_Tic-Tac-Toe/javascript/qubit.js · ×1
88_3-D_Tic-Tac-Toe/javascript/qubit.js: 432 lines of code 88_3-D_Tic-Tac-Toe/javascript/qubit.js:1— 88_3-D_Tic-Tac-Toe/javascript/qubit.js has 432 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
Test Coverage — 0% of 108 production file(s) reachable from 0 test file(s) via the import graph — 'production' here is the RESIDUE: every source file left once tests, tooling, generated output, config, declarations and declaration-only modules, fixture corpora, type fixtures, behaviour-free data modules, re-export barrels, registration/constant data modules and service workers are set aside, so the percentage is taken over a smaller denominator than the workspace's file count
Dead file (~87 LoC) 00_Utilities/find-missing-implementations.js— no import path from any entry point (101 application, 6 tooling, 0 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~76 LoC) 00_Utilities/find-unimplemented.js— no import path from any entry point (101 application, 6 tooling, 0 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Third-party script without Subresource Integrity 84_Super_Star_Trek/javascript/index.html:174— `https://unpkg.com/xterm@4.10.0/lib/xterm.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. 2 such include(s) across the repository's markup.
SC1 · Supply-chain hygiene· NuGet dependencies are not locked · ×1
NuGet dependencies are not locked — No packages.lock.json and no central package management — restores aren't reproducible or pinned (SSDF PW.4.4). Enable <RestorePackagesWithLockFile>true</RestorePackagesWithLockFile> (commit the lockfile) or adopt Directory.Packages.props. Advisory — never scored.
X24 · Document value interpolated into markup unescaped· Untrusted text written into markup unescaped · ×1
Untrusted text written into markup unescaped 00_Common/javascript/WebTerminal/HtmlTerminal.js:116— `htmlContent` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Orphaned file 88_3-D_Tic-Tac-Toe/csharp/QubicData.cs: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 23_Checkers/csharp/Program.cs: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 79_Slalom/csharp/program.cs: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 81_Splat/csharp/Program.cs: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 01_Acey_Ducey/csharp/Game.cs: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 44_Hangman/csharp/Program.cs: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 09_Battle/csharp/Game.cs: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 69_Pizza/csharp/PizzaGame.cs: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 06_Banner/csharp/banner.cs: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 00_Utilities/DotnetUtils/DotnetUtils/Program.cs: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 27_Civil_War/csharp/Army.cs: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 02_Amazing/csharp/Amazing.cs: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 04_Awari/csharp/Game.cs: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 17_Bullfight/csharp/View.cs: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 10_Blackjack/csharp/Game.cs: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 18_Bullseye/csharp/BullseyeGame.cs: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 55_Life/csharp/Program.cs: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 68_Orbit/csharp/program.cs: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 43_Hammurabi/csharp/Rules.cs: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 14_Bowling/csharp/Bowling.cs: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 17_Bullfight/csharp/BullFight.cs: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 43_Hammurabi/csharp/View.cs: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 REDACTED: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 11_Bombardment/csharp/Bombardment.cs: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 84_Super_Star_Trek/csharp/Objects/Enterprise.cs: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.
Commented-out code 00_Utilities/DotnetUtils/DotnetUtils/Functions.cs:30— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code 05_Bagels/csharp/BagelNumber.cs:60— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code 05_Bagels/csharp/BagelNumber.cs:66— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code 05_Bagels/csharp/BagelNumber.cs:67— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code 06_Banner/csharp/banner.cs:231— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code 19_Bunny/csharp/Bunny.cs:60— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code 19_Bunny/csharp/Bunny.cs:62— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code 33_Dice/csharp/Game.cs:14— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Commented-out code 77_Salvo/csharp/Program.cs:8— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
D34 · Knowledge Freshness· Most significant orphaned file · ×3
Most significant orphaned file 88_3-D_Tic-Tac-Toe/csharp/Qubic.cs:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file 39_Golf/csharp/Program.cs:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file 38_Fur_Trader/csharp/Game.cs:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Documentation: no project overview 20_Buzzword/README.md— The README lists itself as a 'buzzword generator' but does not explain what it actually generates or how to use the phrases. Describe the Buzzword program and its purpose in one sentence.
Documentation: no project overview 21_Calendar/README.md— The document lists itself as a calendar-printer but gives no description of what it does or how to use it. State the Calendar program's purpose and its input/output requirements.
Fat interface: IReadWrite (17 members) 00_Common/dotnet/Games.Common/IO/IReadWrite.cs:8— `IReadWrite` declares 17 members under just 10 distinct name(s): `ReadCharacter`, `ReadNumber`, `Read2Numbers`, `Read3Numbers`, `Read4Numbers`, `ReadNumbers`, `ReadString`, `Read2Strings`, `Write`, `WriteLine`, `Write`, `WriteLine`, `Write`, `WriteLine`, `Write`, `WriteLine`, `Write`. Counted as the author wrote them — a property is ONE member and its get/set accessors are not counted separately, and an event counts once. That is an OVERLOAD SET, not 17 separate responsibilities: a caller binds to 10 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 17 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface.
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/`.
Dormant codebase — 118 of 118 significant files have no living knowledge — the codebase as a whole is dormant, not 118 separate risks. Counted over 118 of the 453 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change.
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.
No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
No SAST — No static application security testing detected. For this repository's stack, add CodeQL's csharp pack, or a .NET security analyzer package (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 2331 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.
R7 · Dead Code· Unused module-local declaration 'isValidYesNoString' · ×1
Unused module-local declaration 'isValidYesNoString' 01_Acey_Ducey/javascript/aceyducey.js:148— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code· Unused module-local declaration 'isValidNoString' · ×1
Unused module-local declaration 'isValidNoString' 01_Acey_Ducey/javascript/aceyducey.js:156— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
R7 · Dead Code· Unused module-local declaration 'printInline' · ×1
Unused module-local declaration 'printInline' 01_Acey_Ducey/javascript/aceyducey.js:206— This top-level declaration is not exported and its name occurs nowhere else in its module — not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it.
Nullable reference types not enabled everywhere — 61/99 NRT-eligible project(s) enable <Nullable>enable</Nullable> (projects targeting a pre-C#-8 framework are excluded — NRTs aren't available there). NRTs catch a whole class of null-deref bugs at compile time.
Null-forgiving operator (`!`) suppressions reduce the NRT score — ~0.1 `!` suppressions per 1k syntax nodes — 6 suppression(s) across the 75180 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a `!` can suppress anything in (a `!` under `#nullable disable` is inert and is not counted, and its file's nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide.
Silent fallback default on parse failure 09_Battle/csharp/Game.cs:259— `UserInteraction` falls back to `0` when `int.TryParse(x, out var num)` is false, with no log or throw — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer to the test rather than a stand-in for a value that could not be read, this is not a silent default: say so in a comment on the member and the row stops firing.
Off the main sequence: Games.Common 00_Common/dotnet/Games.Common/Games.Common.csproj:1— Games.Common: abstractness 0.23, instability 0.00, distance 0.77 — the shape a shared-kernel / building-block library has BY DESIGN — concrete and widely depended-on is what makes it useful, and this dimension does not penalise it (the distance is reported for completeness, not as a defect). Worth a look only if it has grown past one coherent kernel into an everything-bucket.
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.
nuget: not applicable — nuget: the solution did not restore on the analyzer's .NET SDK (an SDK/target-framework/restore mismatch, common for an older codebase), so there was no restored dependency graph to scan
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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.
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.
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.
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.
Run 01a16813-d972-7f80-a749-6595f7383d38 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 34 · Warnings: 781 · Recommendations: 145 · Info: 76 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 23-10-2026 @ 09:24 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.