Public report of YarnSpinnerTool/YarnSpinner, published 16 November 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.11.4). Assert signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 16 November 2026, 23:05 UTC · Survey ID cd_227b609177fb4da090b3b9f0fc65c820
YarnSpinnerTool/YarnSpinner
Measured 16 November 2026, 23:04 UTC, at code version bd829a7
Code coverage is not measured: The suite ran but produced no coverage data.
Boundary Type-Coupling is not measured: Bounded contexts not declared.
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
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 medium codebase: 44,791 lines of product code in 7 projects, tests not counted · Estimated rebuild effort: about 1.5 person-years · Weakest lens: Maturity, 57.3
Findings by how serious they are
23 critical268 serious103 minor
5 dimensions are left out of the score. For each one, we either couldn't measure it in this code, or found no evidence of the safeguard we look for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Canine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
16 November 2026, 23:04 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds the Canine Code Analyzer. It is open to any tool that
implements it, and today the Canine Code Analyzer is the only one that does.
The score is deterministic, which means the same code always gets the same score. We work it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
59of 59 dimensions measured by tools.
367of 394 findings point to an exact file and line, so you can open each one in the code. The other 27 concern the repository as a whole, such as missing documentation.
59dimensions across 6 lenses, read from 44,791 lines of product code in 7 projects.
YarnSpinnerTool/YarnSpinner falls short of our standard for production because we found no recorded design decisions and no architecture document or diagram. It scores 61.7 out of 100 and is rated Adequate, and nine of its 23 critical findings are security problems in the build pipeline and in the packages it uses.
Maturity, at 57.3, is the weakest lens and counts most in the score. The best first step is improving the documentation, worth about 4.2 points. Fixing the 38 comments that repeat the code, or contradict it comes next, worth about 3.4 points. Raising Maturity to 70 would lift the score to about 65.0.
Seven pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. One known security hole in a package the code depends on can be used by attackers, and one secret can leak from the build pipeline. Pinning each tool to an exact version, updating the vulnerable packages and limiting the secret to its own step would close these risks. The four data fields that are written but never read need removing.
The product code is 44,791 lines, about €220,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts 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.
If Maturity rose from 57.3 to 70, the lowest score rated Strong, the score would rise from 61.7 to about 65.0.
Code composition: what the lines of code are
Business logic 44%Supporting code 34%Tests 21%Code analyzers 1%
Rebuild cost: about €220,000 · Estimate
Cost to rebuild
€71,000 to €370,000, for 1,183 to 3,884 hours of work, about 1.5 person-years for 1 to 3 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.8 at a score of 62. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 44,791 lines of product code, of which 22% is declarations and boilerplate, 22% straight logic and 56% logic with branches
Comment lines
The estimate prices 33,291 lines. Comment lines count towards the size of 44,791 lines but aren't priced as work.
What it is not
Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.
How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty.
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 Documentation finding(s) in Documentation Quality — start with README.md.
Resolve the 38 redundant comment finding(s) in Comment Value — start with UserDefinedTypesListener.cs (4), NodeGroupCompiler.cs (3), Project.cs (3).
Raises the score by about 3.4 points · Medium effort · Comment Value
3
Resolve the 2 Off-boarding risk finding(s) in Bus Factor.
Raises the score by about 2.7 points · Low effort · Bus Factor
Diagnosis: what the measurements show together
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €220,000 to build again, about 1.5 person-years of work. Its weakest lens is Maturity, at 57.3 (Adequate). Maturity is about how well the project explains and looks after itself, which decides whether a new developer, or a new supplier, can take over. Because the weakest lens counts most in the score, work on Maturity also moves the score most.
Based on: the rebuild estimate · the Maturity grade · how much each lens counts
What to do: Start with the Maturity actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Documentation finding(s) in Documentation Quality. Of all the actions in this report, it raises the score most for the work it takes: about 4.2 points for low effort, because it clears the 1 Documentation 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 7.1 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 13,880 lines over the last 90 days, which is about 56,291 lines a year. At that pace, the extra work comes to an estimated 3.3 to 19.8 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 our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways, which only happens where the projects form a dependency cycle. A graph without cycles has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
13 modules, with 13 dependencies between them. 2 loops run through 4 of the modules, marked above the diagonal.
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.
Yarn.HostAnalysis uses Yarn.Shared, so a change to Yarn.Shared can break Yarn.HostAnalysis, while a change to Yarn.HostAnalysis can't break Yarn.Shared.
Position
Below the diagonal: Yarn.HostAnalysis uses a module listed above it, which is the healthy direction.
Yarn.Analyser uses Yarn.HostAnalysis, so a change to Yarn.HostAnalysis can break Yarn.Analyser, while a change to Yarn.Analyser can't break Yarn.HostAnalysis.
Position
Below the diagonal: Yarn.Analyser uses a module listed above it, which is the healthy direction.
42 pairs of types, where a type in Yarn.Compiler uses a type in Yarn. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
Yarn.Compiler.Upgrader uses Yarn.Compiler, so a change to Yarn.Compiler can break Yarn.Compiler.Upgrader, while a change to Yarn.Compiler.Upgrader can't break Yarn.Compiler.
Position
Below the diagonal: Yarn.Compiler.Upgrader uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 80.8 · Adequate · gated by D2 ·
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
14
High / Critical
A03:2025 — Software Supply Chain Failures
11
High / Critical
Roadmap
Top priorities: 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; Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md; Resolve the 38 redundant comment finding(s) in Comment Value — start with UserDefinedTypesListener.cs (4), NodeGroupCompiler.cs (3), Project.cs (3).
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md.
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.
In library code, append .ConfigureAwait(false) to every await (or set <ConfigureAwait>false</ConfigureAwait> / use the analyzer CA2007) so the library never captures the host's context.
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.
A `static` field is one slot for the whole process, however its type is created: back it with a thread-safe type (ConcurrentDictionary, Interlocked), take a lock around every write, or move it into a registered singleton that does.
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 — 23
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 — 268
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 — 103
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 5
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 59 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.9, the weighted average across measured dimensions.
Every figure here is one of two kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10.
What we checked — 59 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, 367 of 394 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 or a scanner, 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.
D8 Code Coverage — 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. Coverage NOT MEASURED: this repository's test suite BUILT and its tests PASSED in this run — so neither the build nor our analyzer environment is in question — but the run produced no coverage data, and it captured no message saying why. The usual cause is that the test projects wire up no coverage collector (`--collect:"XPlat Code Coverage"` needs a `coverlet.collector` PackageReference); on a very large suite the instrumented run can also exceed its per-target budget before writing anything. Add a `coverlet.collector` PackageReference, or commit the Cobertura/OpenCover/lcov report your CI already produces, and real coverage is measured. It is excluded from the score rather than counted as a near-zero defect. You can widen what we reach: add the `coverlet.collector` package to the test projects to enable coverage (or commit the Cobertura/OpenCover/lcov report your CI produces).
D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
D22 Internal API Consistency — not measured this run — 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 loaded project set declares no packable project and no `.Contracts` project, so there is no intentionally-exposed surface for API consistency to be judged over.
D23 Boundary Type-Coupling — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Large codebase (44,791 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"]`.
D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `YarnSpinner.Compiler/Compiler.cs`, `YarnSpinner.SourceGenerator/IndentingStringBuilder.cs` 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.
M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P10 Library API & versioning — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Library API & versioning could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository. Engine failure: ArgumentException: SyntaxTree is not part of the compilation (Parameter 'syntaxTree').
P11 BDD / executable specs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. BDD / executable specs could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository. Engine failure: ArgumentException: SyntaxTree is not part of the compilation (Parameter 'syntaxTree').
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.
P7 Outbound HTTP resilience — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Outbound HTTP resilience could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository. Engine failure: ArgumentException: SyntaxTree is not part of the compilation (Parameter 'syntaxTree').
P8 Schema migrations — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Schema migrations could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository. Engine failure: ArgumentException: SyntaxTree is not part of the compilation (Parameter 'syntaxTree').
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D18 Solution Shape: Build integrity reflects whether the solution compiled in this environment — a build that needs a private feed, a specific SDK, or a generated file absent from the repo can read as broken when it is merely unreproducible here.
D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
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.
D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
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.
M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
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.
29 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was StandardLibrary.CallFunc at 91. A further 3 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being StandardLibrary.TryGetFunction at 45 — they are counted neither in the figure above nor in this dimension's score. 2 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: YarnSpinner.Shared/Parameters/BasicParameter.cs (BasicParameter.CreateFunctionParameterString at 30), YarnSpinner.Shared/Action.cs (Action.DetermineParameterTypeFromNamedTypeForUnity at 19). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.
+ 24 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 3 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with StandardLibrary.CallFunc (cyclomatic 91), Compiler.Compile (cyclomatic 84), Validators.TryValidateMethodAsAction (cyclomatic 62). — 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 3 together lifts Cyclomatic Complexity from 5.9 to about 6.4/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
+ 45 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 6 bodies over 60 down to 60 or less in Cognitive Complexity — start with LineParser.LexMarkup (cognitive 142), LineParser.BuildMarkupTreeFromTokens (cognitive 136), Compiler.Compile (cognitive 134). — 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 6 together lifts Cognitive Complexity from 3.4 to about 5.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.8 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 11 MethodTooLong finding(s) in God Classes — start with LineParser.cs (2), StandardLibrary.cs (2), Compiler.cs. — One of this dimension's main actionable groups (11 warning-level).
Resolve the 5 FileTooLong finding(s) in God Classes — start with LineParser.cs, Compiler.cs, TypeCheckerListener.cs. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 3 ClassTooLong finding(s) in God Classes — start with Compiler.cs, LineParser.cs, StandardLibrary.cs. — One of this dimension's main actionable groups (3 warning-level).
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.
24 duplicated block group(s) detected. 2.5 % of the production lines (1,139 of 44,791) are in a reported copy. A further 20 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.
Edited copy of a member (17 corresponding lines) · ×2YarnSpinner.Compiler/TypeCheckerListener.cs:633
Edited copy of a member (27 corresponding lines) · ×2YarnSpinner.SourceGenerator/Generator.cs:277
Edited copy of a member (13 corresponding lines) · ×2YarnSpinner.Compiler/TypeSolver/Constraints/TypeHasMemberConstraint.cs:37
Edited copy of a member (10 corresponding lines) · ×2YarnSpinner.Compiler/TypeCheckerListener.cs:936
+ 29 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 3 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with Validators.cs, CompileTimeSyntaxBuilder.cs, BestLeastRecentlyViewedSaliencyStrategy.cs. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 Edited copy of a member (17 corresponding lines) finding(s) in Code Duplication — start with TypeCheckerListener.cs, CompileTimeSyntaxBuilder.cs. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 Edited copy of a member (27 corresponding lines) finding(s) in Code Duplication — start with Generator.cs, ConjunctionConstraint.cs. — One of this dimension's main actionable groups (2 warning-level).
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.
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.
Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
What it measures: Whether dependencies are current, not deprecated, and not bloated. Known vulnerabilities are D30's.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (capped-linear for deprecation, prerelease and outdated) per KLoC. Known-vulnerable packages are D30's and are not charged here (rubric-2026.11.2). Exhaustive.
Resolve the 5 Outdated finding(s) in Dependency Hygiene — start with YarnSpinner.Compiler.csproj (3), REDACTED (2). — One of this dimension's main actionable groups (5 recommendation-level).
Resolve the 1 Deprecated finding(s) in Dependency Hygiene — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
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 180 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 17 direct `PackageReference`(s), and 155 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.
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.
Resolve the 11 Hotspot finding(s) in Churn × Complexity Hotspots — start with Compiler.cs, StandardLibrary.cs, Creators+Parameters.cs. — One of this dimension's main actionable groups (11 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor7.4 / 10Strong✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
23 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is YarnSpinner.Shared/Action.cs. Counted over 88 of the 120 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1 · ×2
What to do
Resolve the 2 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (2 recommendation-level).
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 4 WriteOnlyPrivateField finding(s) in Explicit Debt — start with NodeMetadataVisitor.cs (2), Utility.cs, StringTableGeneratorVisitor.cs. — One of this dimension's main actionable groups (4 issue-level).
Resolve the 3 NoWarnInCsproj finding(s) in Explicit Debt — start with YarnSpinner.Compiler.csproj, YarnSpinner.HostAnalysis.csproj, Analyser.csproj. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 3 AnalyzerSeverityNone finding(s) in Explicit Debt — start with .editorconfig (3). — One of this dimension's main actionable groups (3 issue-level).
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the solution is laid out in a sensible, conventional structure.
Method: Solution structure: project count, decomposition, shell-project detection, build success (confirmed failures cap the score); traced to actual .sln files and binaries. Deterministic.
5 projects, 128 source files, 49529 hand-written lines of code (40437 production / 9092 test — the split is derived per file: test is what its project, its own path, or a compile-guarded region marks as test, and a file carrying no test signal counts as production), 5 inter-project edges.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 2 documentation facets pass in full; short on: F2 example. 11 document(s) read across 7 unit(s).
Documentation: no build, run or usage exampleREADME.md:1
What to do
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether comments are worth it — explaining WHY (valuable) rather than WHAT (redundant).
Method: Every inline C# comment compared word by word with the identifiers, literals and constructs of the code it annotates (taken from the syntax); a comment whose words that code already contains is redundant, as are closing-brace labels and generator template text. Comments giving a reason or a reference are kept; other scripts and languages are not judged. Deterministic, exhaustive, advisory.
doc comments repeat the names · ×5YarnSpinner.SourceGenerator/IndentingStringBuilder.cs:21
What to do
Resolve the 38 redundant comment finding(s) in Comment Value — start with UserDefinedTypesListener.cs (4), NodeGroupCompiler.cs (3), Project.cs (3). — One of this dimension's main actionable groups (38 recommendation-level).
Detailed fixes: d24_recommendation.md · top locations in Appendix A, every location in findings.md.
1 of 7 projects flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesionYarnSpinner.Compiler/YarnSpinner.Compiler.csproj:1
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with YarnSpinner.Compiler.csproj. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.
Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.
Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.
58 % of calls cross a namespace and 6 % go through an interface, but 98 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: medium — clean/modular boundaries expected.
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).
14 finding(s): 0 critical, 8 high, 6 medium, 0 low. 7 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 3 file(s) — `YarnSpinner.Compiler/Compiler.cs` (line 1711), `YarnSpinner.SourceGenerator/IndentingStringBuilder.cs` (line 23, line 125, line 127), `YarnSpinner.Tests/ErrorHandlingTests.cs` (line 535, line 570) — 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. In 1 of those file(s) — `YarnSpinner.SourceGenerator/IndentingStringBuilder.cs` — the break is a C# primary constructor, which semgrep's grammar cannot parse and which hides the type from every rule scoped to it; those files were re-scanned from a shadow copy with the constructor's parameter list blanked (line and column preserving), which restores the type to the rules, and 0 additional row(s) came from that pass. Only the header's own parameter list is unread in 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
What to do
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 warning-level).
No action in Static Analysis (SAST) — all 7 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 (7 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. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d30_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.
1 of 88 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is YarnSpinner.Compiler/NodeMetadata.cs. Counted over 88 of the 120 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
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 the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
+ 4 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Reported apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. Advisory since rubric-2026.11.2 (CAI decision 0006): the malicious-package feed is a database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.
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.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 7 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.
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.
Other · Architecture — Whether singleton services avoid mutable shared instance state that concurrent callers would race on.
Method: Roslyn scan: singleton field mutations unguarded by lock or Interlocked, per type; syntax-based guard detection. Deterministic, traceable per field.
`TypeCheckerListener` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (typeParameterCount; e.g. `typeParameterCount` at line 341). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt. — YarnSpinner.Compiler/TypeCheckerListener.cs:35
What to do
A `static` field is one slot for the whole process, however its type is created: back it with a thread-safe type (ConcurrentDictionary, Interlocked), take a lock around every write, or move it into a registered singleton that does.
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 Yarn ↔ Yarn.Saliency depend on each other. The lightest dependency in the cycle is Yarn.Saliency → Yarn (Yarn.Saliency.BestLeastRecentlyViewedSaliencyStrategy → Yarn.IVariableStorage, 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. — YarnSpinner/Saliency/BestLeastRecentlyViewedSaliencyStrategy.cs:18
The namespaces TypeChecker ↔ Yarn.Compiler depend on each other. The lightest dependency in the cycle is TypeChecker → Yarn.Compiler (TypeChecker.ConjunctionConstraint → Yarn.Compiler.Diagnostic, 6 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. — YarnSpinner.Compiler/TypeSolver/Constraints/ConjunctionConstraint.cs:16
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.
`IYarnSpinnerParserListener` declares 114 members: `EnterDialogue`, `ExitDialogue`, `EnterFile_hashtag`, `ExitFile_hashtag`, `EnterNode`, `ExitNode`, `EnterTitle_header`, `ExitTitle_header`, `EnterWhen_header`, `ExitWhen_header`, `EnterHeader`, `ExitHeader`, `EnterHeader_when_expression`, `ExitHeader_when_expression`, `EnterBody`, `ExitBody`, `EnterStatement`, `ExitStatement`, `EnterLine_statement`, `ExitLine_statement`, `EnterLine_formatted_text`, `ExitLine_formatted_text`, `EnterHashtag`, `ExitHashtag`, `EnterLineCondition`, `ExitLineCondition`, `EnterLineOnceCondition`, `ExitLineOnceCondition`, `EnterExpParens`, `ExitExpParens`, `EnterExpMultDivMod`, `ExitExpMultDivMod`, `EnterExpComparison`, `ExitExpComparison`, `EnterExpNegative`, `ExitExpNegative`, `EnterExpAndOrXor`, `ExitExpAndOrXor`, `EnterExpAddSub`, `ExitExpAddSub`, and 74 more. 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. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — YarnSpinner.Compiler/Grammars/YarnSpinnerParserListener.cs:31
`IYarnSpinnerParserVisitor<Result>` declares 57 members: `VisitDialogue`, `VisitFile_hashtag`, `VisitNode`, `VisitTitle_header`, `VisitWhen_header`, `VisitHeader`, `VisitHeader_when_expression`, `VisitBody`, `VisitStatement`, `VisitLine_statement`, `VisitLine_formatted_text`, `VisitHashtag`, `VisitLineCondition`, `VisitLineOnceCondition`, `VisitExpParens`, `VisitExpMultDivMod`, `VisitExpComparison`, `VisitExpNegative`, `VisitExpAndOrXor`, `VisitExpAddSub`, `VisitExpNot`, `VisitExpValue`, `VisitExpEquality`, `VisitValueNumber`, `VisitValueTrue`, `VisitValueFalse`, `VisitValueVar`, `VisitValueString`, `VisitValueFunc`, `VisitValueTypeMemberReference`, `VisitVariable`, `VisitFunction_call`, `VisitTypeMemberReference`, `VisitIf_statement`, `VisitIf_clause`, `VisitElse_if_clause`, `VisitElse_clause`, `VisitSet_statement`, `VisitCommand_statement`, `VisitCommand_formatted_text`, and 17 more. 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. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — YarnSpinner.Compiler/Grammars/YarnSpinnerParserVisitor.cs:32
What to do
Split fat interfaces into focused role-interfaces so clients depend only on what they use.
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 · 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.
A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface. — YarnSpinner/Types/NumberType.cs:26
What to do
Finish or delete NotImplementedException stubs and replace placeholder literals before shipping.
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.
The `if` and its `else` contain the same 1 statement, so no input can make the condition matter. Implement the distinction that was intended, or drop the branch and keep the body. — YarnSpinner.Compiler/Utility.cs:696
`ToBridgedType` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface. — YarnSpinner/Types/NumberType.cs:26
`Stop` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work. — YarnSpinner/VirtualMachine.cs:409
A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers). (×12) — YarnSpinner.Compiler/ErrorListener.cs:490, YarnSpinner.Compiler/IndentAwareLexer.cs:256, YarnSpinner.Compiler/IndentAwareLexer.cs:286, …
A test is skipped ("This diagnostic should be moved to the language server - whether or not a it's a problem that a node is unreferenced depends on the use case; additionally, at least one node will almost always be unreferenced, being the entry point") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it. — YarnSpinner.Tests/ErrorHandlingTests.cs:359
A test is skipped ("This test needs to be run in the language server, which has knowledge of commands") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it. — YarnSpinner.Tests/ErrorHandlingTests.cs:746
A test is skipped ("Must be handled by Language Server because the compiler doesn't know about valid commands") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it. — YarnSpinner.Tests/ErrorHandlingTests.cs:757
A test is skipped ("This error should be produced in the language server") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it. — YarnSpinner.Tests/ErrorHandlingTests.cs:780
A test is skipped ("Language upgrader has been removed.") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it. — REDACTED:21
What to do
Finish or delete the unfinished stubs (NotImplementedException / empty / constant-returning bodies) — they are dead surface that looks live.
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 repository and its projects have a README, and whether it is substantive.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Maturity · Maturity — Whether the project's current-state documentation describes the code that exists.
Method: Every current-state document's checkable claims looked up in the tree (links, versions, and artefact counts an order of magnitude off), plus two README checks: an advertised infrastructure product with no footprint, and a module the CHANGELOG records as removed. Deterministic, no model. Advisory.
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.
`YarnSpinner.Compiler/YarnSpinner.Compiler.csproj` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — YarnSpinner.Compiler/YarnSpinner.Compiler.csproj:33
What to do
Enable Dependabot/Renovate or a dependency-review gate.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from each language's code model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Only 0/32 awaits in library code use ConfigureAwait(false). A library that captures the caller's context can stall or deadlock its host — the classic way a dependency drags an app down.
`await vm.SetNode(node, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/Dialogue.cs:502
`await vm.Start(cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. (×2) — YarnSpinner/Dialogue.cs:503, YarnSpinner/Dialogue.cs:517
`await this.vm.SetNode(node, clearState: true, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/Dialogue.cs:841
`await this.vm.Stop()` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/Dialogue.cs:852
`await Responder.HandleNodeStart(nodeName, cts.Token)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:394
`await Responder.PrepareForLines(stringIDs ?? new List<string>(), cts.Token)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:400
`await RunInstruction(currentInstruction, dialogueCancellationSource.Token)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:470
`await ReturnFromNode(currentNode, dialogueCancellationSource.Token)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:476
`await Stop()` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. (×4) — YarnSpinner/VirtualMachine.cs:477, YarnSpinner/VirtualMachine.cs:638, YarnSpinner/VirtualMachine.cs:815, …
`await Responder.HandleDialogueComplete()` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:482
`await Responder.HandleNodeComplete(node.Name, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:497
`await Responder.HandleLine(line, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:543
`await Responder.HandleCommand(command, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:577
`await Responder.HandleOptions(new OptionSet(optionChoices.ToArray()), cancellationT...` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:654
`await CallFunction(i.CallFunc.FunctionName, state.stack, this.Responder, cancellati...` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:709
`await ReturnFromNode(currentNode, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. (×2) — YarnSpinner/VirtualMachine.cs:806, YarnSpinner/VirtualMachine.cs:833
`await ReturnFromNode(node, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:812
`await ExecuteJumpToNode(i.RunNode.NodeName, isDetour: false, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:820
`await ExecuteJumpToNode(null, isDetour: false, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:823
`await ExecuteJumpToNode(i.DetourToNode.NodeName, isDetour: true, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:826
`await ExecuteJumpToNode(null, isDetour: true, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:829
`await SetNode(returnSite.nodeName, clearState: false, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:847
`await ReturnFromNode(this.Program?.Nodes[CurrentNodeName], cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:974
`await ReturnFromNode(this.Program?.Nodes[poppedNodeName], cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:981
`await SetNode(nodeName, clearState: !isDetour, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:993
`await responder.InvokeFunction(functionName, parameters, token)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:1026
`await StandardLibrary.CallFunc(functionName, parameters, token)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`. — YarnSpinner/VirtualMachine.cs:1040
What to do
In library code, append .ConfigureAwait(false) to every await (or set <ConfigureAwait>false</ConfigureAwait> / use the analyzer CA2007) so the library never captures the host's context.
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.
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.
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.
`lineParser` is a `LineParser`, which implements `IDisposable`, and it is created here (line 252). Every use of it in `Compile` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var lineParser = …;`), which releases it at the end of the scope on every path including a throw. — YarnSpinner.Compiler/Compiler.cs:252
`lineParser` (line 23) holds a `LineParser` that `NodeMetadataVisitor` creates itself with `new`, and nothing in `NodeMetadataVisitor` ever releases it: the type is not `IDisposable`, declares no `Dispose`, and every other mention of `lineParser` only reads through it. And `NodeMetadataVisitor` is not a process-lifetime owner: `new NodeMetadataVisitor(fileUri)` (NodeMetadataVisitor.cs line 46) creates one per call and drops it when the call returns, so each call strands one unreleased `LineParser` (a timer that keeps firing, a handle, a socket) until finalization. Implement `IDisposable`, release `lineParser` there and dispose the owner at that call site — or keep one owner for the process instead of one per call. — YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:23
What to do
Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
Other · Code Health — Whether async methods accept a CancellationToken so work can be cancelled (adoption curve).
Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. 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 question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.
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 (or a repository exception type deriving from it) controlled by an `if` — directly or through the `using`, `lock` or `try` that wraps the throw — 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)`); in the `else` branch, for a conjunct of the admitting condition that is FALSE of a non-null `p`. Range guards are read for bounds that leave nothing and for a `p > C.Count` bound whose index then reaches `C[p]`, `C.RemoveAt(p)` or a method of the same type that indexes with it. 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.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
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.
`throw ex;` resets the exception's stack trace to this line, hiding where it really came from. Use a bare `throw;` to preserve the original stack. (×2) — YarnSpinner.Compiler/Utility.cs:551, YarnSpinner.Compiler/Utility.cs:567
What to do
Rethrow loses stack trace (`throw ex;`)
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.
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.
This method contradicts itself about `declaration`: line 800 writes `declaration?.Type`, which says `declaration` can be null, but line 412 then dereferences it directly as `declaration.SourceFileName` with no null test between them and no guard around it. If the `?.` is right, that dereference throws NullReferenceException on the input it was written for; if `declaration` truly cannot be null here, the `?.` is misleading. Settle it one way — test `declaration` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side. — YarnSpinner.Compiler/Compiler.cs:412
~0.2 `!` suppressions per 1k syntax nodes — 18 suppression(s) across the 108021 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. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
What to do
Where a method uses `?.` on a symbol and then dereferences it directly, settle the question once: test it before the first use and handle null, or drop the `?.`.
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.
SC1 Supply-chain hygiene — 6 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X10 Duplicated predicate — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X9 Subsumed condition operand — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 56 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — no DI registrations detected
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
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.
C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D21 Naming Consistency — D21 withholds its case and prefix conventions rows: 4 candidate(s) found and not reported.
D22 Internal API Consistency — No intentionally-exposed public API to evaluate for consistency.
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
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — 2 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
D8 Code Coverage — Coverage not measured — the suite ran but produced no coverage data
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (7 value object(s))
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
P10 Library API & versioning — Library API & versioning could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository.
P11 BDD / executable specs — BDD / executable specs could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository.
P12 CI test-gate honesty — Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
P2 Observability — This repo is a library, not a deployed service — it has no process to operate, so production observability (structured logging, tracing/metrics, health checks) is N/A. A library may log via an injected ILogger, but the absence of operational telemetry is not a defect here. If it grows a host (web API, worker), the dimension reactivates.
P7 Outbound HTTP resilience — Outbound HTTP resilience could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository.
P8 Schema migrations — Schema migrations could not be assessed in this run — the check did not complete, so it is not scored. This is a gap in the analyzer, not a finding about this repository.
P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
PF1 Benchmark discipline — Not applicable: no benchmark suite was found by the two searches this check runs — a BenchmarkDotNet package reference in any project file (loaded, or on disk), and a script whose name contains `benchmark` that this repository's CI runs. Neither can see a suite in another ecosystem's idiom, so this is not a verdict that the repository has none. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted, and nothing is asked of a repository that has none.
PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
S1 Web-Security Posture — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
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.
WriteOnlyPrivateField YarnSpinner.Compiler/Utility.cs:21— private Random 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 YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:31— private Dictionary<int, int> indentToMinSeenSince — 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 YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:33— private int lastLineNumber — 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 YarnSpinner.Compiler/Visitors/StringTableGeneratorVisitor.cs:25— private YarnSpinnerParser.NodeContext? currentNodeContext — 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.
NoWarnInCsproj YarnSpinner.Compiler/YarnSpinner.Compiler.csproj:10— 3021 — this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or — if some occurrences really are legitimate — narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project.
NoWarnInCsproj YarnSpinner.HostAnalysis/YarnSpinner.HostAnalysis.csproj:7— RS2008 — this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or — if some occurrences really are legitimate — narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project.
NoWarnInCsproj YarnSpinner.SourceGenerator/Analyser.csproj:8— RS2008 — this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or — if some occurrences really are legitimate — narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project.
AnalyzerSeverityNone .editorconfig:202— CA1805 — this rule is switched off for every file the section matches, in every project under this directory, and the only record that it was ever switched off is this line: nothing at the sites it would have reported says so, so a reader of that code has no reason to look here, and code added years from now inherits the decision silently. Fix what the rule reports and delete the entry, or — where some sites really are legitimate — leave the rule on and suppress it at those sites with their reasons, so it keeps protecting the rest of the tree. If the rule is genuinely unwanted here, say why — on this line after the entry, or in the comment run directly above it: a comment that only repeats the rule's own title is read as no explanation at all and leaves this row in place.
AnalyzerSeverityNone .editorconfig:203— CA1819 — this rule is switched off for every file the section matches, in every project under this directory, and the only record that it was ever switched off is this line: nothing at the sites it would have reported says so, so a reader of that code has no reason to look here, and code added years from now inherits the decision silently. Fix what the rule reports and delete the entry, or — where some sites really are legitimate — leave the rule on and suppress it at those sites with their reasons, so it keeps protecting the rest of the tree. If the rule is genuinely unwanted here, say why — on this line after the entry, or in the comment run directly above it: a comment that only repeats the rule's own title is read as no explanation at all and leaves this row in place.
AnalyzerSeverityNone .editorconfig:204— CA1002 — this rule is switched off for every file the section matches, in every project under this directory, and the only record that it was ever switched off is this line: nothing at the sites it would have reported says so, so a reader of that code has no reason to look here, and code added years from now inherits the decision silently. Fix what the rule reports and delete the entry, or — where some sites really are legitimate — leave the rule on and suppress it at those sites with their reasons, so it keeps protecting the rest of the tree. If the rule is genuinely unwanted here, say why — on this line after the entry, or in the comment run directly above it: a comment that only repeats the rule's own title is read as no explanation at all and leaves this row in place.
Namespace dependency cycle YarnSpinner/Saliency/BestLeastRecentlyViewedSaliencyStrategy.cs:18— The namespaces Yarn ↔ Yarn.Saliency depend on each other. The lightest dependency in the cycle is Yarn.Saliency → Yarn (Yarn.Saliency.BestLeastRecentlyViewedSaliencyStrategy → Yarn.IVariableStorage, 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 YarnSpinner.Compiler/TypeSolver/Constraints/ConjunctionConstraint.cs:16— The namespaces TypeChecker ↔ Yarn.Compiler depend on each other. The lightest dependency in the cycle is TypeChecker → Yarn.Compiler (TypeChecker.ConjunctionConstraint → Yarn.Compiler.Diagnostic, 6 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.
DiscardedPureResult YarnSpinner.Tests/TypeTests.cs:740— result.Diagnostics.Should().ContainSingle().Which.Message.Contains("if statement's expression must be a Boolean, not a String"); — strings are immutable, so this call cannot change the text it was called on: it computes a new string and the statement throws it away, leaving the original exactly as it was. The line reads as the transformation it names, and the value that comes out of this method later is the untransformed one. Assign the result — to the same variable, or to the field or property the transformed text was meant to reach — or, if the call really was pointless, delete the line rather than leaving something that looks like it works.
FileScopedPragmaDisable YarnSpinner/VirtualMachine.cs:4— #pragma warning disable CA2007 — the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers — that alone turns a standing exemption into a scoped one — or fix the cause and drop the directive entirely.
Awaits without ConfigureAwait(false) — Only 0/32 awaits in library code use ConfigureAwait(false). A library that captures the caller's context can stall or deadlock its host — the classic way a dependency drags an app down.
Awaits without ConfigureAwait(false) YarnSpinner/Dialogue.cs:502— `await vm.SetNode(node, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/Dialogue.cs:503— `await vm.Start(cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/Dialogue.cs:517— `await vm.Start(cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/Dialogue.cs:841— `await this.vm.SetNode(node, clearState: true, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/Dialogue.cs:852— `await this.vm.Stop()` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:394— `await Responder.HandleNodeStart(nodeName, cts.Token)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:400— `await Responder.PrepareForLines(stringIDs ?? new List<string>(), cts.Token)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:470— `await RunInstruction(currentInstruction, dialogueCancellationSource.Token)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:476— `await ReturnFromNode(currentNode, dialogueCancellationSource.Token)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:477— `await Stop()` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:482— `await Responder.HandleDialogueComplete()` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:497— `await Responder.HandleNodeComplete(node.Name, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:543— `await Responder.HandleLine(line, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:577— `await Responder.HandleCommand(command, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:638— `await Stop()` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:654— `await Responder.HandleOptions(new OptionSet(optionChoices.ToArray()), cancellationT...` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:709— `await CallFunction(i.CallFunc.FunctionName, state.stack, this.Responder, cancellati...` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:806— `await ReturnFromNode(currentNode, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:812— `await ReturnFromNode(node, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:815— `await Stop()` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:820— `await ExecuteJumpToNode(i.RunNode.NodeName, isDetour: false, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:823— `await ExecuteJumpToNode(null, isDetour: false, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:826— `await ExecuteJumpToNode(i.DetourToNode.NodeName, isDetour: true, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
Awaits without ConfigureAwait(false) YarnSpinner/VirtualMachine.cs:829— `await ExecuteJumpToNode(null, isDetour: true, cancellationToken)` resumes on the caller's captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock — append `.ConfigureAwait(false)`.
TodoComment YarnSpinner.Compiler/Compiler.cs:85— // TODO: we should have some sort of way to create diagnostics that aren't attached to a location in a file — 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 YarnSpinner.Compiler/Compiler.cs:262— // TODO: change how markup presents it's diagnostics so we can get more useful diagnostics — 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 YarnSpinner.Compiler/ErrorListener.cs:132— // TODO: maybe fail instead of silently dropping this? if the — 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 YarnSpinner.Compiler/IndentAwareLexer.cs:17— // TODO: come up with a better system — 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 YarnSpinner.Compiler/IndentAwareLexer.cs:234— // TODO: this should be empty by now actually... — 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 YarnSpinner.Compiler/IndentAwareLexer.cs:255— // TODO: see above comment — 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 YarnSpinner.Compiler/IndentAwareLexer.cs:285— // TODO: see above comment — 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 YarnSpinner.Compiler/IndentAwareLexer.cs:314— // TODO: see above comment — 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 YarnSpinner.Compiler/IndentAwareLexer.cs:341— // TODO: see above comment — 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 YarnSpinner.Compiler/TypeCheckerListener.cs:124— // TODO: maybe the 'real' type names should be lowercased too? Rather — 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 YarnSpinner.Compiler/Visitors/CodeGenerationVisitor.cs:216— // TODO: look into replacing this as it seems a bit odd — 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 YarnSpinner.Compiler/Visitors/CodeGenerationVisitor.cs:1336— // TODO: figure out a better way to do operators — 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 YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:292— // TODO: receive locale code from invoker instead of hard-coding — 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 YarnSpinner.Diagnostics/Generator.cs:58— // TODO: report a diagnostic — 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 YarnSpinner.Tests/ErrorHandlingTests.cs:761— // TODO: move to LSP — 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 YarnSpinner.Tests/ErrorHandlingTests.cs:853— // TODO: This should also test cases where the duplicate line is in — 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 REDACTED:35— // TODO: skip this test instead of passing — 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 YarnSpinner/Program.cs:112— // the list (TODO: maybe this list could be reused to save — 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 YarnSpinner/StandardLibrary.cs:170— // TODO: Come up with a better way for multiple types to share — 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.
BarePragmaDisable YarnSpinner.Compiler/LineTaggers/DescriptiveLineTagGenerator.cs:124— #pragma warning disable CS8602 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner.SourceGenerator/Loggers.cs:13— #pragma warning disable RS1035 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner.Tests/BasicFunctionLibrary.cs:4— #pragma warning disable CA2007 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/Dialogue.cs:4— #pragma warning disable CA2007 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner.Tests/ProjectFileTests.cs:120— #pragma warning disable CS0618 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/CRC32.cs:96— #pragma warning disable CA1307 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/Dialogue.cs:38— #pragma warning disable CA1815 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/Dialogue.cs:76— #pragma warning disable CA1815 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/Dialogue.cs:156— #pragma warning disable CA1815 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/YarnSpinner.Markup/IAttributeMarkerProcessor.cs:46— #pragma warning disable CA1815 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/YarnSpinner.Markup/MarkupParseResult.cs:10— #pragma warning disable CA1815 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/YarnSpinner.Markup/MarkupParseResult.cs:296— #pragma warning disable CA1815 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/YarnSpinner.Markup/MarkupParseResult.cs:591— #pragma warning disable CA1815 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/YarnSpinner.Markup/MarkupParseResult.cs:655— #pragma warning disable CA1815 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/Dialogue.cs:84— #pragma warning disable CA1716 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/YarnSpinner.Markup/IAttributeMarkerProcessor.cs:47— #pragma warning disable CA1051 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/YarnSpinner.Markup/MarkupParseResult.cs:295— #pragma warning disable CA1711 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
BarePragmaDisable YarnSpinner/YarnSpinner.Markup/MarkupValueType.cs:11— #pragma warning disable CA1720 — the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line — what makes this site legitimately different — or fix what the rule is pointing at and delete the pair. A rationale in the member's documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that.
Dead code: GetTagsForNode YarnSpinner/Program.cs:138— Method GetTagsForNode — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner, 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: MethodEqualTo YarnSpinner/Types/EnumType.cs:124— Method MethodEqualTo — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner, 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 YarnSpinner/YarnSpinner.Markup/LineParser.cs:231— Method Previous — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner, 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: DeregisterFunction YarnSpinner.Tests/BasicFunctionLibrary.cs:352— Method DeregisterFunction — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner.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: GetOffset REDACTED:1127— Method GetOffset — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner.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: Reset YarnSpinner.Tests/TestBase.cs:590— Method Reset — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner.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: AddOption YarnSpinner.Tests/TestPlan.cs:335— Method AddOption — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner.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: AddSelect YarnSpinner.Tests/TestPlan.cs:341— Method AddSelect — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner.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: AddCommand YarnSpinner.Tests/TestPlan.cs:347— Method AddCommand — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner.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: GetTokensFromFile YarnSpinner.Compiler/Compiler.cs:1239— Method GetTokensFromFile — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner.Compiler, 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: GetHeadersWithKey YarnSpinner.Compiler/Compiler.cs:1276— Method GetHeadersWithKey — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner.Compiler, 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: GetDeclaration YarnSpinner.Compiler/Project.cs:782— Method GetDeclaration — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner.Compiler, 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: ILanguageUpgrader YarnSpinner.Compiler/Upgrader/ILanguageUpgrader.cs:6— NamedType ILanguageUpgrader — Roslyn's SymbolFinder walked every project the solution loads, including YarnSpinner.Compiler, 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.
Hotspot: YarnSpinner.Compiler/Compiler.cs YarnSpinner.Compiler/Compiler.cs:52— YarnSpinner.Compiler/Compiler.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in Compiler.Compile at line 52. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 11:29:51 +11:00' --until='2026-11-16 11:29:51 +11:00' --full-history --no-merges -- YarnSpinner.Compiler/Compiler.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: YarnSpinner/StandardLibrary.cs YarnSpinner/StandardLibrary.cs:511— YarnSpinner/StandardLibrary.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in StandardLibrary.CallFunc at line 511. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 11:29:51 +11:00' --until='2026-11-16 11:29:51 +11:00' --full-history --no-merges -- YarnSpinner/StandardLibrary.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: YarnSpinner.HostAnalysis/Creators+Parameters.cs YarnSpinner.HostAnalysis/Creators+Parameters.cs:28— YarnSpinner.HostAnalysis/Creators+Parameters.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in Creators.TryCreateNewParameters at line 28. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 11:29:51 +11:00' --until='2026-11-16 11:29:51 +11:00' --full-history --no-merges -- YarnSpinner.HostAnalysis/Creators+Parameters.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: YarnSpinner.HostAnalysis/Validators.cs YarnSpinner.HostAnalysis/Validators.cs:32— YarnSpinner.HostAnalysis/Validators.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in Validators.TryValidateMethodAsAction at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 11:29:51 +11:00' --until='2026-11-16 11:29:51 +11:00' --full-history --no-merges -- YarnSpinner.HostAnalysis/Validators.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: YarnSpinner/VirtualMachine.cs YarnSpinner/VirtualMachine.cs:514— YarnSpinner/VirtualMachine.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in VirtualMachine.RunInstruction at line 514. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 11:29:51 +11:00' --until='2026-11-16 11:29:51 +11:00' --full-history --no-merges -- YarnSpinner/VirtualMachine.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: YarnSpinner.SourceGenerator/GeneratorExtensions.cs YarnSpinner.SourceGenerator/GeneratorExtensions.cs:71— YarnSpinner.SourceGenerator/GeneratorExtensions.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in GeneratorExtensions.ToJSON at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 11:29:51 +11:00' --until='2026-11-16 11:29:51 +11:00' --full-history --no-merges -- YarnSpinner.SourceGenerator/GeneratorExtensions.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: YarnSpinner/YarnSpinner.Markup/LineParser.cs YarnSpinner/YarnSpinner.Markup/LineParser.cs:923— YarnSpinner/YarnSpinner.Markup/LineParser.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in LineParser.BuildMarkupTreeFromTokens at line 923. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 11:29:51 +11:00' --until='2026-11-16 11:29:51 +11:00' --full-history --no-merges -- YarnSpinner/YarnSpinner.Markup/LineParser.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: YarnSpinner.SourceGenerator/Analyser.cs YarnSpinner.SourceGenerator/Analyser.cs:342— YarnSpinner.SourceGenerator/Analyser.cs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in NestedAnalyser.AnalyseActionsByInvoke at line 342. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 11:29:51 +11:00' --until='2026-11-16 11:29:51 +11:00' --full-history --no-merges -- YarnSpinner.SourceGenerator/Analyser.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: YarnSpinner.Compiler/Project.cs YarnSpinner.Compiler/Project.cs:669— YarnSpinner.Compiler/Project.cs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Definitions.Definitions.ctor at line 669. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 11:29:51 +11:00' --until='2026-11-16 11:29:51 +11:00' --full-history --no-merges -- YarnSpinner.Compiler/Project.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:363— YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in CompileTimeSyntaxBuilder.BuildCommandInvoker at line 363. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 11:29:51 +11:00' --until='2026-11-16 11:29:51 +11:00' --full-history --no-merges -- YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: YarnSpinner.HostAnalysis/Creators.cs YarnSpinner.HostAnalysis/Creators.cs:161— YarnSpinner.HostAnalysis/Creators.cs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Creators.ActionFromMethodSymbol at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-18 11:29:51 +11:00' --until='2026-11-16 11:29:51 +11:00' --full-history --no-merges -- YarnSpinner.HostAnalysis/Creators.cs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
MethodTooLong: Compiler.Compile YarnSpinner.Compiler/Compiler.cs:52— MethodTooLong — Compile runs 329 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 229 over it, 3.29× 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: VirtualMachine.RunInstruction YarnSpinner/VirtualMachine.cs:514— MethodTooLong — RunInstruction runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16× 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: LineParser.BuildMarkupTreeFromTokens YarnSpinner/YarnSpinner.Markup/LineParser.cs:923— MethodTooLong — BuildMarkupTreeFromTokens runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.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: StandardLibrary.TryGetFunction YarnSpinner/StandardLibrary.cs:205— MethodTooLong — TryGetFunction runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: StandardLibrary.CallFunc YarnSpinner/StandardLibrary.cs:511— MethodTooLong — CallFunc runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94× 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: LineParser.LexMarkup YarnSpinner/YarnSpinner.Markup/LineParser.cs:276— MethodTooLong — LexMarkup 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.
MethodTooLong: Validators.TryValidateMethodAsAction YarnSpinner.HostAnalysis/Validators.cs:32— MethodTooLong — TryValidateMethodAsAction runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54× 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: Creators.TryCreateNewParameters YarnSpinner.HostAnalysis/Creators+Parameters.cs:28— MethodTooLong — TryCreateNewParameters 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: InstructionCollectionExtensions.GetBasicBlocks YarnSpinner.Compiler/Analysis/InstructionCollectionExtensions.cs:23— MethodTooLong — GetBasicBlocks runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.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.
MethodTooLong: NodeGroupCompiler.CompileNodeGroup YarnSpinner.Compiler/NodeGroupCompiler.cs:54— MethodTooLong — CompileNodeGroup runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.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.
MethodTooLong: GeneratorExtensions.ToJSON YarnSpinner.SourceGenerator/GeneratorExtensions.cs:71— MethodTooLong — ToJSON runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
SC1 · Supply-chain hygiene· NuGet dependencies are not locked · ×6
NuGet dependencies are not locked YarnSpinner.Compiler/YarnSpinner.Compiler.csproj:33— YarnSpinner.Compiler/YarnSpinner.Compiler.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
NuGet dependencies are not locked YarnSpinner.Diagnostics/YarnSpinner.Diagnostics.csproj:13— YarnSpinner.Diagnostics/YarnSpinner.Diagnostics.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
NuGet dependencies are not locked YarnSpinner.HostAnalysis/YarnSpinner.HostAnalysis.csproj:11— YarnSpinner.HostAnalysis/YarnSpinner.HostAnalysis.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
NuGet dependencies are not locked YarnSpinner.SourceGenerator/Analyser.csproj:12— YarnSpinner.SourceGenerator/Analyser.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
NuGet dependencies are not locked REDACTED:15— REDACTED declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
NuGet dependencies are not locked YarnSpinner/YarnSpinner.csproj:27— YarnSpinner/YarnSpinner.csproj declares NuGet packages that no committed packages.lock.json resolves and no central package management pins — 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.
FileTooLong: YarnSpinner.Markup/LineParser.cs YarnSpinner/YarnSpinner.Markup/LineParser.cs— FileTooLong — 733 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 233 over it, 1.47× 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: YarnSpinner.Compiler/Compiler.cs YarnSpinner.Compiler/Compiler.cs— FileTooLong — 672 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 172 over it, 1.34× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: YarnSpinner.Compiler/TypeCheckerListener.cs YarnSpinner.Compiler/TypeCheckerListener.cs— FileTooLong — 623 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 123 over it, 1.25× 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: Visitors/CodeGenerationVisitor.cs YarnSpinner.Compiler/Visitors/CodeGenerationVisitor.cs— FileTooLong — 597 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 97 over it, 1.19× 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: YarnSpinner/StandardLibrary.cs YarnSpinner/StandardLibrary.cs— FileTooLong — 507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7 over it, 1.01× 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.
ClassTooLong: Compiler YarnSpinner.Compiler/Compiler.cs— ClassTooLong — 590 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 190 over it, 1.48× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
ClassTooLong: LineParser YarnSpinner/YarnSpinner.Markup/LineParser.cs— ClassTooLong — 573 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods. The bar is 400 significant lines; this is 173 over it, 1.43× 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: StandardLibrary YarnSpinner/StandardLibrary.cs— ClassTooLong — 481 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 81 over it, 1.20× the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them.
Duplicated block (13 lines × 2) YarnSpinner.HostAnalysis/Validators.cs:125— YarnSpinner.HostAnalysis/Validators.cs:125-137 | YarnSpinner.HostAnalysis/Validators.cs:177-189 — 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 `YarnSpinner.HostAnalysis/Validators.cs:125` 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 (13 lines × 2) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:203— YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:203-215 | YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:372-384 — 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 `YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:203` 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 (13 lines × 2) YarnSpinner/Saliency/BestLeastRecentlyViewedSaliencyStrategy.cs:46— YarnSpinner/Saliency/BestLeastRecentlyViewedSaliencyStrategy.cs:46-58 | YarnSpinner/Saliency/RandomBestLeastRecentlyViewedSaliencyStrategy.cs:48-60 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
TooManyMethods: TypeCheckerListener YarnSpinner.Compiler/TypeCheckerListener.cs— TooManyMethods — 576 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 30 methods; this is 19 over it, 1.63× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: CodeGenerationVisitor YarnSpinner.Compiler/Visitors/CodeGenerationVisitor.cs— TooManyMethods — 573 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 30 methods; this is 10 over it, 1.33× 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· Edited copy of a member (17 corresponding lines) · ×2
Edited copy of a member (17 corresponding lines) YarnSpinner.Compiler/TypeCheckerListener.cs:633— YarnSpinner.Compiler/TypeCheckerListener.cs:633-663 | YarnSpinner.Compiler/TypeCheckerListener.cs:667-683 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (17 corresponding lines) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:159— YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:159-177 | YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:179-195 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (27 corresponding lines) · ×2
Edited copy of a member (27 corresponding lines) YarnSpinner.SourceGenerator/Generator.cs:277— YarnSpinner.SourceGenerator/Generator.cs:277-303 | YarnSpinner.SourceGenerator/Generator.cs:305-339 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (27 corresponding lines) YarnSpinner.Compiler/TypeSolver/Constraints/ConjunctionConstraint.cs:56— YarnSpinner.Compiler/TypeSolver/Constraints/ConjunctionConstraint.cs:56-82 | YarnSpinner.Compiler/TypeSolver/Constraints/DisjunctionConstraint.cs:56-83 — These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (13 corresponding lines) · ×2
Edited copy of a member (13 corresponding lines) YarnSpinner.Compiler/TypeSolver/Constraints/TypeHasMemberConstraint.cs:37— YarnSpinner.Compiler/TypeSolver/Constraints/TypeHasMemberConstraint.cs:37-57 | YarnSpinner.Compiler/TypeSolver/Constraints/TypeHasNameConstraint.cs:40-52 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (13 corresponding lines) YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:206— YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:206-221 | YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:224-236 — These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (10 corresponding lines) · ×2
Edited copy of a member (10 corresponding lines) YarnSpinner.Compiler/TypeCheckerListener.cs:936— YarnSpinner.Compiler/TypeCheckerListener.cs:936-945 | YarnSpinner.Compiler/TypeCheckerListener.cs:1059-1072 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (10 corresponding lines) YarnSpinner/Dialogue.cs:901— YarnSpinner/Dialogue.cs:901-925 | YarnSpinner/Program.cs:550-559 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (20 lines × 2) YarnSpinner.HostAnalysis/Creators.cs:60— YarnSpinner.HostAnalysis/Creators.cs:60-79 | YarnSpinner.HostAnalysis/Creators.cs:181-200 — 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 `YarnSpinner.HostAnalysis/Creators.cs:60` 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 first that the copies are not typed on the same thing: the declarations holding them bind `method` to `Validators.ActionValidation validation) ValidActionFromMethodSymbol(IMethodSymbol` in one and `IMethodSymbol` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (20 lines × 2) YarnSpinner/YarnSpinner.Markup/MarkupParseResult.cs:472— YarnSpinner/YarnSpinner.Markup/MarkupParseResult.cs:472-491 | YarnSpinner/YarnSpinner.Markup/MarkupParseResult.cs:831-850 — 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. 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 (15 lines × 2) YarnSpinner.HostAnalysis/Creators.cs:110— YarnSpinner.HostAnalysis/Creators.cs:110-124 | YarnSpinner.HostAnalysis/Creators.cs:233-247 — 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 `YarnSpinner.HostAnalysis/Creators.cs:110` 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 first that the copies are not typed on the same thing: the declarations holding them bind `method` to `Validators.ActionValidation validation) ValidActionFromMethodSymbol(IMethodSymbol` in one and `IMethodSymbol` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (15 lines × 2) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:65— YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:65-79 | YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:117-131 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) YarnSpinner/StandardLibrary.cs:733— YarnSpinner/StandardLibrary.cs:733-741 | YarnSpinner/StandardLibrary.cs:744-752 — 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. 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 (9 lines × 2) YarnSpinner/StandardLibrary.cs:942— YarnSpinner/StandardLibrary.cs:942-950 | YarnSpinner/Types/EnumType.cs:126-134 — 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 (5 lines × 2) YarnSpinner.Compiler/TypeCheckerListener.cs:659— YarnSpinner.Compiler/TypeCheckerListener.cs:659-663 | YarnSpinner.Compiler/TypeCheckerListener.cs:679-683 — 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 `YarnSpinner.Compiler/TypeCheckerListener.cs:659` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `context` to `YarnSpinnerParser.ExpAddSubContext` in one and `YarnSpinnerParser.ExpMultDivModContext` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (5 lines × 2) YarnSpinner.Compiler/FileCompiler.cs:89— YarnSpinner.Compiler/FileCompiler.cs:89-93 | YarnSpinner.Compiler/NodeGroupCompiler.cs:348-352 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Rethrow loses stack trace (`throw ex;`) YarnSpinner.Compiler/Utility.cs:551— `throw ex;` resets the exception's stack trace to this line, hiding where it really came from. Use a bare `throw;` to preserve the original stack.
Rethrow loses stack trace (`throw ex;`) YarnSpinner.Compiler/Utility.cs:567— `throw ex;` resets the exception's stack trace to this line, hiding where it really came from. Use a bare `throw;` to preserve the original stack.
AX2 · Stateful singletons· Process-global static state · ×1
Process-global static state: TypeCheckerListener YarnSpinner.Compiler/TypeCheckerListener.cs:35— `TypeCheckerListener` keeps mutable `static` state — one slot for the whole process, shared by every thread that reaches the type however its instances are created — and mutates it outside any lock (typeParameterCount; e.g. `typeParameterCount` at line 341). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt.
StandardLibrary.CallFunc (cyclomatic 91) YarnSpinner/StandardLibrary.cs:511— StandardLibrary.CallFunc has cyclomatic complexity 91 (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.
Compiler.Compile (cyclomatic 84) YarnSpinner.Compiler/Compiler.cs:52— Compiler.Compile has cyclomatic complexity 84 (threshold 15). Of this number, 74 points are the body's own statements and 10 belong to 4 function items inside it that branch. 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.
Validators.TryValidateMethodAsAction (cyclomatic 62) YarnSpinner.HostAnalysis/Validators.cs:32— Validators.TryValidateMethodAsAction has cyclomatic complexity 62 (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.
VirtualMachine.RunInstruction (cyclomatic 60) YarnSpinner/VirtualMachine.cs:514— VirtualMachine.RunInstruction has cyclomatic complexity 60 (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.
Creators.TryCreateNewParameters (cyclomatic 60) YarnSpinner.HostAnalysis/Creators+Parameters.cs:28— Creators.TryCreateNewParameters has cyclomatic complexity 60 (threshold 15). Of this number, 59 points are the body's own statements and 1 belongs to one function literal 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.
LineParser.BuildMarkupTreeFromTokens (cyclomatic 55) YarnSpinner/YarnSpinner.Markup/LineParser.cs:923— LineParser.BuildMarkupTreeFromTokens has cyclomatic complexity 55 (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.
InstructionCollectionExtensions.GetBasicBlocks (cyclomatic 46) YarnSpinner.Compiler/Analysis/InstructionCollectionExtensions.cs:23— InstructionCollectionExtensions.GetBasicBlocks has cyclomatic complexity 46 (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.
LineParser.LexMarkup (cyclomatic 42) YarnSpinner/YarnSpinner.Markup/LineParser.cs:276— LineParser.LexMarkup has cyclomatic complexity 42 (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.
Creators.UnityReturnType (cyclomatic 38) YarnSpinner.HostAnalysis/Creators+Supporting.cs:55— Creators.UnityReturnType has cyclomatic complexity 38 (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.
GeneratorExtensions.ToJSON (cyclomatic 38) YarnSpinner.SourceGenerator/GeneratorExtensions.cs:71— GeneratorExtensions.ToJSON has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
Instruction.ToDescription (cyclomatic 34) YarnSpinner/Program.cs:271— Instruction.ToDescription has cyclomatic complexity 34 (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.
NestedAnalyser.AnalyseActionsByInvoke (cyclomatic 30) YarnSpinner.SourceGenerator/Analyser.cs:342— NestedAnalyser.AnalyseActionsByInvoke 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.
UserDefinedTypesListener.ExitEnum_statement (cyclomatic 27) YarnSpinner.Compiler/Visitors/UserDefinedTypesListener.cs:26— UserDefinedTypesListener.ExitEnum_statement 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.
Generator.Initialize (cyclomatic 24) YarnSpinner.Diagnostics/Generator.cs:15— Generator.Initialize has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 5 function items inside it that branch (a function literal at line 47, GetSeverityName, a function literal at line 153, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
Validators.TryValidateConverter (cyclomatic 24) YarnSpinner.HostAnalysis/Validators.cs:299— Validators.TryValidateConverter has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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.
YarnErrorListener.SyntaxError (cyclomatic 23) YarnSpinner.Compiler/ErrorListener.cs:425— YarnErrorListener.SyntaxError 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.
DescriptiveLineTagGenerator.GenerateLineTag (cyclomatic 22) YarnSpinner.Compiler/LineTaggers/DescriptiveLineTagGenerator.cs:195— DescriptiveLineTagGenerator.GenerateLineTag 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.
Definitions.Definitions.ctor (cyclomatic 21) YarnSpinner.Compiler/Project.cs:669— Definitions.Definitions.ctor has cyclomatic complexity 21 (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.
TypeCheckerListener.ResolveInitialValues (cyclomatic 20) YarnSpinner.Compiler/TypeCheckerListener.cs:1203— TypeCheckerListener.ResolveInitialValues 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.
Compiler.AddErrorsForInvalidNodeNames (cyclomatic 19) YarnSpinner.Compiler/Compiler.cs:948— Compiler.AddErrorsForInvalidNodeNames has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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.
ActionExtensions.GetDeclaration (cyclomatic 19) YarnSpinner.Compiler/Project.cs:782— ActionExtensions.GetDeclaration has cyclomatic complexity 19 (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.
MarkupParseResult.DeleteRange (cyclomatic 18) YarnSpinner/YarnSpinner.Markup/MarkupParseResult.cs:174— MarkupParseResult.DeleteRange 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.
UntaggedLineListener.RunLineTagger (cyclomatic 18) YarnSpinner.Compiler/Utility.cs:473— UntaggedLineListener.RunLineTagger 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.
CompileTimeSyntaxBuilder.BuildCommandInvoker (cyclomatic 18) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:363— CompileTimeSyntaxBuilder.BuildCommandInvoker 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.
SyntaxValidationListener.CheckMalformedCommandsInText (cyclomatic 17) YarnSpinner.Compiler/SyntaxValidationListener.cs:150— SyntaxValidationListener.CheckMalformedCommandsInText 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.
Utility.ExtractStringBlocks (cyclomatic 17) YarnSpinner.Compiler/Utility.cs:609— Utility.ExtractStringBlocks 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.
Creators.ActionFromMethodSymbol (cyclomatic 17) YarnSpinner.HostAnalysis/Creators.cs:161— Creators.ActionFromMethodSymbol 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.
CompileTimeSyntaxBuilder.BuildFunctionInvoker (cyclomatic 17) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:197— CompileTimeSyntaxBuilder.BuildFunctionInvoker 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.
Solver.TrySolve (cyclomatic 16) YarnSpinner.Compiler/TypeSolver/Solver.cs:50— Solver.TrySolve 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.
Deprecated: xunit REDACTED:20— xunit 2.4.1 — Legacy — the publisher's replacement is `xunit.v3`; that is the next major line under a new package id, so the move is a breaking rename rather than a version bump — budget for API changes in the code that uses it, not only the reference swap.
LineParser.LexMarkup (cognitive 142) YarnSpinner/YarnSpinner.Markup/LineParser.cs:276— LineParser.LexMarkup has cognitive complexity 142 (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.
LineParser.BuildMarkupTreeFromTokens (cognitive 136) YarnSpinner/YarnSpinner.Markup/LineParser.cs:923— LineParser.BuildMarkupTreeFromTokens has cognitive complexity 136 (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.
Compiler.Compile (cognitive 134) YarnSpinner.Compiler/Compiler.cs:52— Compiler.Compile has cognitive complexity 134 (threshold 15). Of this number, 128 points are the body's own statements and 6 belong to 4 function items 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.
Creators.TryCreateNewParameters (cognitive 113) YarnSpinner.HostAnalysis/Creators+Parameters.cs:28— Creators.TryCreateNewParameters has cognitive complexity 113 (threshold 15). Of this number, 112 points are the body's own statements and 1 belongs to one function literal inside it that branches. 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.
StandardLibrary.CallFunc (cognitive 93) YarnSpinner/StandardLibrary.cs:511— StandardLibrary.CallFunc has cognitive complexity 93 (threshold 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
VirtualMachine.RunInstruction (cognitive 81) YarnSpinner/VirtualMachine.cs:514— VirtualMachine.RunInstruction has cognitive complexity 81 (threshold 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
UserDefinedTypesListener.ExitEnum_statement (cognitive 56) YarnSpinner.Compiler/Visitors/UserDefinedTypesListener.cs:26— UserDefinedTypesListener.ExitEnum_statement has cognitive complexity 56 (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.
Validators.TryValidateMethodAsAction (cognitive 49) YarnSpinner.HostAnalysis/Validators.cs:32— Validators.TryValidateMethodAsAction has cognitive complexity 49 (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.
DescriptiveLineTagGenerator.PrepareForLines (cognitive 48) YarnSpinner.Compiler/LineTaggers/DescriptiveLineTagGenerator.cs:104— DescriptiveLineTagGenerator.PrepareForLines has cognitive complexity 48 (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.
InstructionCollectionExtensions.GetBasicBlocks (cognitive 46) YarnSpinner.Compiler/Analysis/InstructionCollectionExtensions.cs:23— InstructionCollectionExtensions.GetBasicBlocks 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.
Compiler.AddErrorsForInvalidNodeNames (cognitive 46) YarnSpinner.Compiler/Compiler.cs:948— Compiler.AddErrorsForInvalidNodeNames has cognitive complexity 46 (threshold 15). Of this number, 43 points are the body's own statements and 3 belong to 2 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.
NestedAnalyser.AnalyseActionsByInvoke (cognitive 42) YarnSpinner.SourceGenerator/Analyser.cs:342— NestedAnalyser.AnalyseActionsByInvoke has cognitive complexity 42 (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.
CompileTimeSyntaxBuilder.BuildCommandInvoker (cognitive 42) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:363— CompileTimeSyntaxBuilder.BuildCommandInvoker has cognitive complexity 42 (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.
UntaggedLineListener.RunLineTagger (cognitive 41) YarnSpinner.Compiler/Utility.cs:473— UntaggedLineListener.RunLineTagger has cognitive complexity 41 (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.
NestedAnalyser.ValidateActions (cognitive 41) YarnSpinner.SourceGenerator/Analyser.cs:245— NestedAnalyser.ValidateActions has cognitive complexity 41 (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.
Validators.TryValidateConverter (cognitive 40) YarnSpinner.HostAnalysis/Validators.cs:299— Validators.TryValidateConverter has cognitive complexity 40 (threshold 15). Of this number, 38 points are the body's own statements and 2 belong to 2 function literals inside it that branch. 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.
CompileTimeSyntaxBuilder.BuildFunctionInvoker (cognitive 40) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:197— CompileTimeSyntaxBuilder.BuildFunctionInvoker has cognitive complexity 40 (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.
Solver.TrySolve (cognitive 34) YarnSpinner.Compiler/TypeSolver/Solver.cs:50— Solver.TrySolve 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.
YarnErrorListener.SyntaxError (cognitive 33) YarnSpinner.Compiler/ErrorListener.cs:425— YarnErrorListener.SyntaxError has cognitive complexity 33 (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.
LineParser.WalkTree (cognitive 32) YarnSpinner/YarnSpinner.Markup/LineParser.cs:778— LineParser.WalkTree has cognitive complexity 32 (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.
DescriptiveLineTagGenerator.GenerateLineTag (cognitive 31) YarnSpinner.Compiler/LineTaggers/DescriptiveLineTagGenerator.cs:195— DescriptiveLineTagGenerator.GenerateLineTag has cognitive complexity 31 (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.
TypeCheckerListener.ResolveInitialValues (cognitive 31) YarnSpinner.Compiler/TypeCheckerListener.cs:1203— TypeCheckerListener.ResolveInitialValues has cognitive complexity 31 (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.
NestedAnalyser.CompilationEndAction (cognitive 30) YarnSpinner.SourceGenerator/Analyser.cs:93— NestedAnalyser.CompilationEndAction has cognitive complexity 30 (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.
Utility.ExtractStringBlocks (cognitive 29) YarnSpinner.Compiler/Utility.cs:609— Utility.ExtractStringBlocks has cognitive complexity 29 (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.
MarkupParseResult.DeleteRange (cognitive 28) YarnSpinner/YarnSpinner.Markup/MarkupParseResult.cs:174— MarkupParseResult.DeleteRange has cognitive complexity 28 (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.
Creators.ValidActionFromMethodSymbol (cognitive 28) YarnSpinner.HostAnalysis/Creators.cs:43— Creators.ValidActionFromMethodSymbol has cognitive complexity 28 (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.
TypeCheckerListener.GetDependenciesForVariable (cognitive 26) YarnSpinner.Compiler/TypeCheckerListener.cs:1319— TypeCheckerListener.GetDependenciesForVariable has cognitive complexity 26 (threshold 15). Of this number, 25 points are the body's own statements and 1 belongs 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.
Creators.ActionFromMethodSymbol (cognitive 26) YarnSpinner.HostAnalysis/Creators.cs:161— Creators.ActionFromMethodSymbol has cognitive complexity 26 (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.
GeneratorExtensions.ToJSON (cognitive 26) YarnSpinner.SourceGenerator/GeneratorExtensions.cs:71— GeneratorExtensions.ToJSON has cognitive complexity 26 (threshold 15). Of this number, 25 points are the body's own statements and 1 belongs 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.
NodeGroupCompiler.CompileNodeGroup (cognitive 25) YarnSpinner.Compiler/NodeGroupCompiler.cs:54— NodeGroupCompiler.CompileNodeGroup 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.
StringTableGeneratorVisitor.VisitLine_statement (cognitive 25) YarnSpinner.Compiler/Visitors/StringTableGeneratorVisitor.cs:61— StringTableGeneratorVisitor.VisitLine_statement has cognitive complexity 25 (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.
Action.TryValidateAction (cognitive 25) YarnSpinner.Shared/Action.cs:467— Action.TryValidateAction 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.
Definitions.Definitions.ctor (cognitive 24) YarnSpinner.Compiler/Project.cs:669— Definitions.Definitions.ctor 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.
Creators.UnityReturnType (cognitive 24) YarnSpinner.HostAnalysis/Creators+Supporting.cs:55— Creators.UnityReturnType has cognitive complexity 24 (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.
Project.DefinitionsFiles.get (cognitive 23) YarnSpinner.Compiler/Project.cs:290— Project.DefinitionsFiles.get has cognitive complexity 23 (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.
DocstringExtractor.TryCreateDocumentation (cognitive 23) YarnSpinner.SourceGenerator/DocstringExtractor.cs:29— DocstringExtractor.TryCreateDocumentation has cognitive complexity 23 (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.
TypeCheckerListener.ExitFunction_call (cognitive 22) YarnSpinner.Compiler/TypeCheckerListener.cs:827— TypeCheckerListener.ExitFunction_call 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.
Utility.GenerateYarnFileWithDeclarations (cognitive 20) YarnSpinner.Compiler/Utility.cs:51— Utility.GenerateYarnFileWithDeclarations 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.
Solver.TryMergeSubsitutions (cognitive 19) YarnSpinner.Compiler/TypeSolver/Solver.cs:182— Solver.TryMergeSubsitutions has cognitive complexity 19 (threshold 15). Of this number, 15 points are the body's own statements and 4 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.
CompileTimeSyntaxBuilder.BuildDefaultParameterTuple (cognitive 19) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:531— CompileTimeSyntaxBuilder.BuildDefaultParameterTuple 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.
SmartVariableEvaluationVirtualMachine.GetSaliencyOptionsForNodeGroup (cognitive 18) YarnSpinner/SmartVariableEvaluationVirtualMachine.cs:132— SmartVariableEvaluationVirtualMachine.GetSaliencyOptionsForNodeGroup 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.
Compiler.AddUnreachableCodeDiagnostics (cognitive 18) YarnSpinner.Compiler/Compiler.cs:834— Compiler.AddUnreachableCodeDiagnostics has cognitive complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs 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.
DocstringExtractor.TryGetDocumentation (cognitive 18) YarnSpinner.SourceGenerator/DocstringExtractor.cs:81— DocstringExtractor.TryGetDocumentation 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.
RuntimeSyntaxBuilder.BuildSyntax (cognitive 18) YarnSpinner.SourceGenerator/RuntimeSyntaxBuilder.cs:35— RuntimeSyntaxBuilder.BuildSyntax 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.
Compiler.GetContentIDTags (cognitive 17) YarnSpinner.Compiler/Compiler.cs:1329— Compiler.GetContentIDTags 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.
ActionExtensions.GetDeclaration (cognitive 17) YarnSpinner.Compiler/Project.cs:782— ActionExtensions.GetDeclaration 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.
LineParser.CleanUpUnmatchedCloses (cognitive 16) YarnSpinner/YarnSpinner.Markup/LineParser.cs:1415— LineParser.CleanUpUnmatchedCloses 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.
IndentAwareLexer.HandleNewLineToken (cognitive 16) YarnSpinner.Compiler/IndentAwareLexer.cs:264— IndentAwareLexer.HandleNewLineToken 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.
ActionExtensions.ParameterFromJSON (cognitive 16) YarnSpinner.Compiler/Project.cs:934— ActionExtensions.ParameterFromJSON 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.
NodeMetadataVisitor.VisitLine_statement (cognitive 16) YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:281— NodeMetadataVisitor.VisitLine_statement 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.
Near-duplicate member pair (77 shared lines) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:198— YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:198-361 | YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:364-529 — These two members are variants of one another: 77 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (47 shared lines) YarnSpinner.HostAnalysis/Creators.cs:44— YarnSpinner.HostAnalysis/Creators.cs:44-133 | YarnSpinner.HostAnalysis/Creators.cs:162-256 — These two members are variants of one another: 47 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (41 corresponding lines) · ×1
Edited copy of a member (41 corresponding lines) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:64— YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:64-104 | YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:116-156 — These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (37 corresponding lines) · ×1
Edited copy of a member (37 corresponding lines) YarnSpinner/Saliency/BestLeastRecentlyViewedSaliencyStrategy.cs:62— YarnSpinner/Saliency/BestLeastRecentlyViewedSaliencyStrategy.cs:62-98 | YarnSpinner/Saliency/RandomBestLeastRecentlyViewedSaliencyStrategy.cs:64-110 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (25 corresponding lines) · ×1
Edited copy of a member (25 corresponding lines) YarnSpinner.Compiler/ErrorListener.cs:765— YarnSpinner.Compiler/ErrorListener.cs:765-805 | YarnSpinner.Compiler/ErrorListener.cs:807-831 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (24 corresponding lines) · ×1
Edited copy of a member (24 corresponding lines) YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:103— YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:103-126 | YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:129-152 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 9+ corresponding lines) · ×1
Edited copies of one member (3 members, 9+ corresponding lines) YarnSpinner.Compiler/TypeCheckerListener.cs:744— YarnSpinner.Compiler/TypeCheckerListener.cs:744-754 | YarnSpinner.Compiler/TypeCheckerListener.cs:758-766 | YarnSpinner.Compiler/TypeCheckerListener.cs:791-800 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (12 corresponding lines) · ×1
Edited copy of a member (12 corresponding lines) YarnSpinner/YarnSpinner.Markup/LineParser.cs:946— YarnSpinner/YarnSpinner.Markup/LineParser.cs:946-958 | YarnSpinner/YarnSpinner.Markup/LineParser.cs:959-970 — These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (33 corresponding lines) · ×1
Edited copy of a member (33 corresponding lines) YarnSpinner.Shared/Parameters/ConverterParameter.cs:15— YarnSpinner.Shared/Parameters/ConverterParameter.cs:15-47 | YarnSpinner.Shared/Parameters/ConverterParameter.cs:51-83 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copies of one member (3 members, 10+ corresponding lines) · ×1
Edited copies of one member (3 members, 10+ corresponding lines) YarnSpinner.Compiler/TypeCheckerListener.cs:296— YarnSpinner.Compiler/TypeCheckerListener.cs:296-306 | YarnSpinner.Compiler/TypeCheckerListener.cs:309-318 | YarnSpinner.Compiler/TypeCheckerListener.cs:321-330 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication· Edited copy of a member (7 corresponding lines) · ×1
Edited copy of a member (7 corresponding lines) YarnSpinner.Compiler/TypeSolver/Constraints/FalseConstraint.cs:20— YarnSpinner.Compiler/TypeSolver/Constraints/FalseConstraint.cs:20-26 | YarnSpinner.Compiler/TypeSolver/Constraints/TrueConstraint.cs:17-23 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (6 corresponding lines) · ×1
Edited copy of a member (6 corresponding lines) YarnSpinner.Compiler/FileCompiler.cs:88— YarnSpinner.Compiler/FileCompiler.cs:88-93 | YarnSpinner.Compiler/NodeGroupCompiler.cs:347-352 — These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (46–47 lines × 2) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:250— YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:250-296 | YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:422-467 — 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 `YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:250` 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 (24–28 lines × 2) YarnSpinner.HostAnalysis/Validators.cs:92— YarnSpinner.HostAnalysis/Validators.cs:92-115 | YarnSpinner.HostAnalysis/Validators.cs:190-217 — 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 `YarnSpinner.HostAnalysis/Validators.cs:92` 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 (21–22 lines × 2) YarnSpinner.SourceGenerator/Generator.cs:62— YarnSpinner.SourceGenerator/Generator.cs:62-82 | YarnSpinner.SourceGenerator/Generator.cs:95-116 — 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 `YarnSpinner.SourceGenerator/Generator.cs:62` 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 (18 lines × 2) YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:338— YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:338-355 | YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs:505-522 — 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–16 lines × 2) YarnSpinner.Compiler/TypeSolver/Constraints/TypeHasMemberConstraint.cs:42— YarnSpinner.Compiler/TypeSolver/Constraints/TypeHasMemberConstraint.cs:42-57 | YarnSpinner.Compiler/TypeSolver/Constraints/TypeHasNameConstraint.cs:44-52 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `YarnSpinner.Compiler/TypeSolver/Constraints/TypeHasMemberConstraint.cs:42` 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 (16 lines × 2) YarnSpinner.SourceGenerator/Generator.cs:66— YarnSpinner.SourceGenerator/Generator.cs:66-81 | YarnSpinner.SourceGenerator/Generator.cs:169-185 — 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 `YarnSpinner.SourceGenerator/Generator.cs:66` 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 (12 lines × 2) YarnSpinner.HostAnalysis/Creators.cs:95— YarnSpinner.HostAnalysis/Creators.cs:95-106 | YarnSpinner.HostAnalysis/Creators.cs:213-224 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `YarnSpinner.HostAnalysis/Creators.cs:95` 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 first that the copies are not typed on the same thing: the declarations holding them bind `method` to `Validators.ActionValidation validation) ValidActionFromMethodSymbol(IMethodSymbol` in one and `IMethodSymbol` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (13–14 lines × 2) YarnSpinner.Compiler/TypeCheckerListener.cs:687— YarnSpinner.Compiler/TypeCheckerListener.cs:687-699 | YarnSpinner.Compiler/TypeCheckerListener.cs:703-716 — 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 first that the copies are not typed on the same thing: the declarations holding them bind `context` to `YarnSpinnerParser.ExpComparisonContext` in one and `YarnSpinnerParser.ExpEqualityContext` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (8 lines × 2) YarnSpinner/YarnSpinner.Markup/LineParser.cs:1289— YarnSpinner/YarnSpinner.Markup/LineParser.cs:1289-1296 | YarnSpinner/YarnSpinner.Markup/LineParser.cs:1301-1308 — 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 `YarnSpinner/YarnSpinner.Markup/LineParser.cs:1289` 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) YarnSpinner.Compiler/Compiler.cs:130— YarnSpinner.Compiler/Compiler.cs:130-136 | YarnSpinner.Compiler/Compiler.cs:956-962 | YarnSpinner.Compiler/Compiler.cs:1118-1124 — 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 (7 lines × 2) YarnSpinner.SourceGenerator/DocstringExtractor.cs:117— YarnSpinner.SourceGenerator/DocstringExtractor.cs:117-123 | YarnSpinner.SourceGenerator/DocstringExtractor.cs:131-138 — 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 `YarnSpinner.SourceGenerator/DocstringExtractor.cs:117` 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 (6 lines × 3) YarnSpinner.Compiler/TypeCheckerListener.cs:936— YarnSpinner.Compiler/TypeCheckerListener.cs:936-941 | YarnSpinner.Compiler/TypeCheckerListener.cs:949-954 | YarnSpinner.Compiler/TypeCheckerListener.cs:1013-1020 — 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 `YarnSpinner.Compiler/TypeCheckerListener.cs:936` 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 first that the copies are not typed on the same thing: the declarations holding them bind `context` to `YarnSpinnerParser.LineConditionContext` in one and `YarnSpinnerParser.LineOnceConditionContext` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (6 lines × 2) YarnSpinner.Compiler/TypeSolver/Constraints/FalseConstraint.cs:21— YarnSpinner.Compiler/TypeSolver/Constraints/FalseConstraint.cs:21-26 | YarnSpinner.Compiler/TypeSolver/Constraints/TrueConstraint.cs:18-23 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any `return` inside it is the body's own exit and keeps its meaning in the moved unit.
Unfinished stub — throws NotImplementedException YarnSpinner/Types/NumberType.cs:26— A shipped member still throws NotImplementedException — generated scaffolding that was never completed. Implement it or remove the dead surface.
IC1 · Incompleteness & stubs· Both branches are identical · ×1
Both branches are identical — the condition decides nothing YarnSpinner.Compiler/Utility.cs:696— The `if` and its `else` contain the same 1 statement, so no input can make the condition matter. Implement the distinction that was intended, or drop the branch and keep the body.
Unfinished stub — throws NotImplementedException YarnSpinner/Types/NumberType.cs:26— `ToBridgedType` is a shipped member whose whole body throws NotImplementedException — scaffolding that was never completed. Implement it or remove the dead surface.
Fake-async — async method never awaits YarnSpinner/VirtualMachine.cs:409— `Stop` is declared `async` but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop `async` or do the real async work.
X18 · Disposal-pattern correctness· Disposable created and abandoned in the method that made it · ×1
Disposable created and abandoned in the method that made it YarnSpinner.Compiler/Compiler.cs:252— `lineParser` is a `LineParser`, which implements `IDisposable`, and it is created here (line 252). Every use of it in `Compile` reads a member through it — it is never returned, never stored, never handed to anything else, and never disposed — so this method both creates the value and is the last thing that can release it, and does not. Nothing announces the leak: the object holds its resource until finalization if its type has a finalizer, and until the process ends if it does not, so the cost accumulates once per CALL rather than showing up as a failure. Declare it with `using` (`using var lineParser = …;`), which releases it at the end of the scope on every path including a throw.
X18 · Disposal-pattern correctness· Disposable created into a field and never released · ×1
Disposable created into a field and never released YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:23— `lineParser` (line 23) holds a `LineParser` that `NodeMetadataVisitor` creates itself with `new`, and nothing in `NodeMetadataVisitor` ever releases it: the type is not `IDisposable`, declares no `Dispose`, and every other mention of `lineParser` only reads through it. And `NodeMetadataVisitor` is not a process-lifetime owner: `new NodeMetadataVisitor(fileUri)` (NodeMetadataVisitor.cs line 46) creates one per call and drops it when the call returns, so each call strands one unreleased `LineParser` (a timer that keeps firing, a handle, a socket) until finalization. Implement `IDisposable`, release `lineParser` there and dispose the owner at that call site — or keep one owner for the process instead of one per call.
X5 · Nullable reference types· Symbol treated as nullable, then dereferenced unguarded · ×1
Symbol treated as nullable, then dereferenced unguarded YarnSpinner.Compiler/Compiler.cs:412— This method contradicts itself about `declaration`: line 800 writes `declaration?.Type`, which says `declaration` can be null, but line 412 then dereferences it directly as `declaration.SourceFileName` with no null test between them and no guard around it. If the `?.` is right, that dereference throws NullReferenceException on the input it was written for; if `declaration` truly cannot be null here, the `?.` is misleading. Settle it one way — test `declaration` once before the first use and handle the null case, or drop the `?.` — rather than leaving the two readings side by side.
redundant comment YarnSpinner.Compiler/Compiler.cs:75— "add in all the standard library functions" repeats the code it sits on: 4 of its 4 words (add, standard, library, functions) are already in `declarations.AddRange(GetDeclarationsFromLibrary(StandardLibrary.AllFunctions()));`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Compiler.cs:910— "Visit every 'set' statement in the parse tree." repeats the code it sits on: 4 of its 5 words (set, statement, parse, tree) are already in `ParseTreeWalker.WalkTree<YarnSpinnerParser.Set_statementContext>(dialogueContext, (Action<YarnSpinnerParser.Set_statemen …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/FileCompiler.cs:146— "Set the name of the node" repeats the code it sits on: 3 of its 3 words (set, name, node) are already in `this.CurrentNode.Name = context.NodeTitle;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/FileCompiler.cs:214— "Add the node to our result." repeats the code it sits on: 3 of its 3 words (add, node, result) are already in `CompilationResult.Nodes.Add(this.CurrentNode);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/IndentAwareLexer.cs:172— "Return the EOF token." repeats the code it sits on: 3 of its 3 words (return, eof, token) are already in `tokenToReturn = new CommonToken(Eof, "<EOF>");`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/NodeGroupCompiler.cs:68— "Find the node in the collection of compiled nodes." repeats the code it sits on: 4 of its 5 words (find, node, compiled, nodes) are already in `var compiledNode = FindNode(nodeContext.NodeTitle);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/NodeGroupCompiler.cs:97— "Create a new smart variable for this header" repeats the code it sits on: 4 of its 5 words (create, new, smart, variable) are already in `var compiler = new SmartVariableCompiler(this.VariableDeclarations);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/NodeGroupCompiler.cs:306— "Get the name of the 'once' variable." repeats the code it sits on: 4 of its 4 words (get, name, once, variable) are already in `var onceVariable = Compiler.GetContentViewedVariableName(nodeContext.NodeTitle`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Project.cs:725— "Enums require file version 5" repeats the code it sits on: 4 of its 4 words (enums, require, file, version) are already in `throw new InvalidOperationException($"Error in function {yarnName}: Enum parameters in functions require project file ve …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Project.cs:736— "Instances require file version 5" repeats the code it sits on: 4 of its 4 words (instances, require, file, version) are already in `throw new InvalidOperationException($"Error in function {yarnName}: Instance parameters in functions require project fil …`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Project.cs:924— "short type is everything between the first and last index" repeats the code it sits on: 5 of its 6 words (short, type, first, last, index) are already in `shortType = fullName[firstIndex..lastIndex];`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/StructuredCommandParser.cs:53— "Create a token stream from the lexer output." repeats the code it sits on: 4 of its 5 words (create, token, stream, lexer) are already in `var tokens = new Antlr4.Runtime.CommonTokenStream(lexer);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/TypeCheckerListener.cs:926— "The type of this function call is the return type of the function" repeats the code it sits on: 4 of its 4 words (type, function, call, return) are already in `this.AddEqualityConstraint(context.Type, functionType.ReturnType, context, s =>`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/TypeSolver/Solver.cs:308— "Unify the return types, too." repeats the code it sits on: 3 of its 3 words (unify, return, types) are already in `return TryUnify(xFunc.ReturnType, yFunc.ReturnType, subst);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Utility.cs:344— "if we enter a node and we have current nodes this is also an error" repeats the code it sits on: 4 of its 5 words (enter, node, current, nodes) are already in `if (currentLines != null)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Utility.cs:386— "Get the text for all of these hashtags..." repeats the code it sits on: 3 of its 3 words (get, text, hashtags) are already in `var hashtagTexts = StringTableGeneratorVisitor.GetHashtagTexts(hashtags);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Visitors/CodeGenerationVisitor.cs:395— "Get the line ID for the shortcut's line" repeats the code it sits on: 4 of its 4 words (get, line, id, shortcut) are already in `var lineID = Compiler.GetContentID(ContentIdentifierType.Line, shortcut.line_statement());`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Visitors/CodeGenerationVisitor.cs:792— "For each child statement in this line group item, evaluate that too." repeats the code it sits on: 5 of its 6 words (child, statement, line, group, item) are already in `foreach (var childStatement in lineGroupItem.statement())`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Visitors/CodeGenerationVisitor.cs:992— "Get the declaration for this variable" repeats the code it sits on: 3 of its 3 words (get, declaration, variable) are already in `if (this.compiler.VariableDeclarations.TryGetValue(variableName, out var declaration) == false)`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Visitors/NodeMetadataVisitor.cs:376— "Add option info" repeats the code it sits on: 3 of its 3 words (add, option, info) are already in `currentNode.Options.Add(new OptionInfo`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Visitors/UserDefinedTypesListener.cs:61— "No raw value in this case statement." repeats the code it sits on: 4 of its 5 words (raw, value, case, statement) are already in `caseStatement.RawValue = null;`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Visitors/UserDefinedTypesListener.cs:66— "This case statement has a raw value. Parse it." repeats the code it sits on: 4 of its 5 words (case, statement, raw, value) are already in `Value value = new LiteralValueVisitor(context, this.sourceFileName, this.diagnostics).Visit(caseStatement.rawValue);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Visitors/UserDefinedTypesListener.cs:140— "Do we have any cases that are missing values?" repeats the code it sits on: 3 of its 3 words (cases, missing, values) are already in `var casesMissingValues = context.enum_case_statement().Where(c => c.RawValue == null);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.Compiler/Visitors/UserDefinedTypesListener.cs:232— "Create the new type." repeats the code it sits on: 3 of its 3 words (create, new, type) are already in `var newEnumType = new EnumType(context.name.Text, description ?? string.Empty, (TypeBase)rawType);`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
redundant comment YarnSpinner.HostAnalysis/Creators+Parameters.cs:130— "this attribute is an enum parameter" repeats the code it sits on: 3 of its 3 words (attribute, enum, parameter) are already in `if (attribute.AttributeClass?.Name == "YarnEnumParameterAttribute")`. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence).
Commented-out code YarnSpinner.Compiler/ErrorListener.cs:490— 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 YarnSpinner.Compiler/IndentAwareLexer.cs:256— 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 YarnSpinner.Compiler/IndentAwareLexer.cs:286— 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 YarnSpinner.Compiler/IndentAwareLexer.cs:316— 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 YarnSpinner.Compiler/IndentAwareLexer.cs:332— 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 YarnSpinner.Compiler/IndentAwareLexer.cs:342— 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 YarnSpinner.Compiler/IndentAwareLexer.cs:357— 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 YarnSpinner.Compiler/LineTaggers/DescriptiveLineTagGenerator.cs:146— 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 YarnSpinner.Compiler/LineTaggers/DescriptiveLineTagGenerator.cs:151— 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 YarnSpinner.Compiler/LineTaggers/DescriptiveLineTagGenerator.cs:155— 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 YarnSpinner.Compiler/Visitors/StringTableGeneratorVisitor.cs:48— 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 YarnSpinner.SourceGenerator/Analyser.cs:64— A line of code has been commented out rather than removed — dead weight that rots and confuses. Delete it (version control remembers).
Disabled test YarnSpinner.Tests/ErrorHandlingTests.cs:359— A test is skipped ("This diagnostic should be moved to the language server - whether or not a it's a problem that a node is unreferenced depends on the use case; additionally, at least one node will almost always be unreferenced, being the entry point") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it.
Disabled test YarnSpinner.Tests/ErrorHandlingTests.cs:746— A test is skipped ("This test needs to be run in the language server, which has knowledge of commands") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it.
Disabled test YarnSpinner.Tests/ErrorHandlingTests.cs:757— A test is skipped ("Must be handled by Language Server because the compiler doesn't know about valid commands") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it.
Disabled test YarnSpinner.Tests/ErrorHandlingTests.cs:780— A test is skipped ("This error should be produced in the language server") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it.
Disabled test REDACTED:21— A test is skipped ("Language upgrader has been removed.") — coverage that looks present but never runs in any gate. If it's an opt-in suite, document how it runs; otherwise re-enable or delete it.
Fat interface: IYarnSpinnerParserListener (114 members) YarnSpinner.Compiler/Grammars/YarnSpinnerParserListener.cs:31— `IYarnSpinnerParserListener` declares 114 members: `EnterDialogue`, `ExitDialogue`, `EnterFile_hashtag`, `ExitFile_hashtag`, `EnterNode`, `ExitNode`, `EnterTitle_header`, `ExitTitle_header`, `EnterWhen_header`, `ExitWhen_header`, `EnterHeader`, `ExitHeader`, `EnterHeader_when_expression`, `ExitHeader_when_expression`, `EnterBody`, `ExitBody`, `EnterStatement`, `ExitStatement`, `EnterLine_statement`, `ExitLine_statement`, `EnterLine_formatted_text`, `ExitLine_formatted_text`, `EnterHashtag`, `ExitHashtag`, `EnterLineCondition`, `ExitLineCondition`, `EnterLineOnceCondition`, `ExitLineOnceCondition`, `EnterExpParens`, `ExitExpParens`, `EnterExpMultDivMod`, `ExitExpMultDivMod`, `EnterExpComparison`, `ExitExpComparison`, `EnterExpNegative`, `ExitExpNegative`, `EnterExpAndOrXor`, `ExitExpAndOrXor`, `EnterExpAddSub`, `ExitExpAddSub`, and 74 more. 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. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Fat interface: IYarnSpinnerParserVisitor<Result> (57 members) YarnSpinner.Compiler/Grammars/YarnSpinnerParserVisitor.cs:32— `IYarnSpinnerParserVisitor<Result>` declares 57 members: `VisitDialogue`, `VisitFile_hashtag`, `VisitNode`, `VisitTitle_header`, `VisitWhen_header`, `VisitHeader`, `VisitHeader_when_expression`, `VisitBody`, `VisitStatement`, `VisitLine_statement`, `VisitLine_formatted_text`, `VisitHashtag`, `VisitLineCondition`, `VisitLineOnceCondition`, `VisitExpParens`, `VisitExpMultDivMod`, `VisitExpComparison`, `VisitExpNegative`, `VisitExpAndOrXor`, `VisitExpAddSub`, `VisitExpNot`, `VisitExpValue`, `VisitExpEquality`, `VisitValueNumber`, `VisitValueTrue`, `VisitValueFalse`, `VisitValueVar`, `VisitValueString`, `VisitValueFunc`, `VisitValueTypeMemberReference`, `VisitVariable`, `VisitFunction_call`, `VisitTypeMemberReference`, `VisitIf_statement`, `VisitIf_clause`, `VisitElse_if_clause`, `VisitElse_clause`, `VisitSet_statement`, `VisitCommand_statement`, `VisitCommand_formatted_text`, and 17 more. 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. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 16 significant file(s) lose their only recent owner: YarnSpinner.Shared/Action.cs, YarnSpinner.SourceGenerator/CompileTimeSyntaxBuilder.cs, YarnSpinner.SourceGenerator/Generator.cs, YarnSpinner.HostAnalysis/Validators.cs, YarnSpinner.HostAnalysis/Creators+Parameters.cs, YarnSpinner.HostAnalysis/ActionDiagnostics.cs, YarnSpinner.HostAnalysis/Creators.cs, YarnSpinner.SourceGenerator/DocstringExtractor.cs (+8 more). Pair on, review, or document these before any departure.
Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 7 significant file(s) lose their only recent owner: YarnSpinner.Compiler/Declaration.cs, YarnSpinner.Compiler/NodeGroupCompiler.cs, YarnSpinner.Compiler/Visitors/UserDefinedTypesListener.cs, YarnSpinner.Diagnostics/Generator.cs, YarnSpinner.Compiler/Builders/EnumTypeBuilder.cs, YarnSpinner.Compiler/TypeSolver/Constraints/TypeConstraint.cs, YarnSpinner.Compiler/Visitors/NodeTrackingVisitor.cs. Pair on, review, or document these before any departure.
Documentation: no build, run or usage example README.md:1— the repository holds project manifests and neither `README.md` nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion YarnSpinner.Compiler/YarnSpinner.Compiler.csproj:1— `YarnSpinner.Compiler` overshoots its size bounds (22089 LoC, 138 public types across 3 namespaces). 1 of 7 project(s) overshoot their size bounds, lowering Project Cohesion to 7.1/10. Review these for cohesion — draw the boundary inside the assembly first (group each responsibility into its own namespace/folder and keep the cross-boundary members internal), since splitting a published assembly moves types between packages and breaks consumers.
D34 · Knowledge Freshness· Orphaned files with no living knowledge · ×1
Orphaned files with no living knowledge — 1 of 88 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 88 of the 120 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: YarnSpinner.Compiler/NodeMetadata.cs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
Orphaned file YarnSpinner.Compiler/NodeMetadata.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.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M2 · Architecture documentation· No architecture diagram/doc · ×1
No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
No dependency-update automation YarnSpinner.Compiler/YarnSpinner.Compiler.csproj:33— `YarnSpinner.Compiler/YarnSpinner.Compiler.csproj` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
Duplicated predicate YarnSpinner.HostAnalysis/Creators+Parameters.cs:343— `d.Severity == DiagnosticSeverity.Warning || d.Severity == DiagnosticSeverity.Error` appears character-identically in 2 files — YarnSpinner.HostAnalysis/Creators+Parameters.cs, YarnSpinner.HostAnalysis/Validators.cs. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Null-forgiving operator (`!`) suppressions override nullable warnings — ~0.2 `!` suppressions per 1k syntax nodes — 18 suppression(s) across the 108021 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. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first.
Subsumed condition operand YarnSpinner.Compiler/ErrorListener.cs:589— `loweredMsg.Contains("'==='")` can never decide this `||` — every value satisfying `loweredMsg.Contains("'==='")` also satisfies `loweredMsg.Contains("===")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Skipped (documented): TestUnreferencedNodesCreateDiagnostics YarnSpinner.Tests/ErrorHandlingTests.cs:359— Skipped with a documented reason — a deferral, not lazy debt: This diagnostic should be moved to the language server - whether or not a it's a problem that a node is unreferenced depends on the use case; additionally, at least one node will almost always be unreferenced, being the entry point
Skipped (documented): TestUnknownCommandGeneratesDiag YarnSpinner.Tests/ErrorHandlingTests.cs:746— Skipped with a documented reason — a deferral, not lazy debt: This test needs to be run in the language server, which has knowledge of commands
Skipped (documented): TestKnownCommandWithWrongParametersGeneratesDiag YarnSpinner.Tests/ErrorHandlingTests.cs:757— Skipped with a documented reason — a deferral, not lazy debt: Must be handled by Language Server because the compiler doesn't know about valid commands
Skipped (documented): TestCyclicNodesGenerateDiagnostic YarnSpinner.Tests/ErrorHandlingTests.cs:780— Skipped with a documented reason — a deferral, not lazy debt: This error should be produced in the language server
Skipped (documented): TestUpgradingFiles REDACTED:21— Skipped with a documented reason — a deferral, not lazy debt: Language upgrader has been removed.
doc comments repeat the names YarnSpinner.SourceGenerator/IndentingStringBuilder.cs:21— 0 of 49 documented parameters and 0 of 35 summaries in `Analyser` only repeat the member or parameter name (e.g. "" for `stringBuilder`). 2 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
doc comments repeat the names YarnSpinner/Dialogue.cs:230— 10 of 163 documented parameters and 14 of 312 summaries in `YarnSpinner` only repeat the member or parameter name (e.g. "The name of the variable." for `variableName`). 2 documentation tag(s) are empty. This build requires documentation, so say what the name does not: units, ranges, null handling, side effects.
doc comments repeat the names YarnSpinner.Compiler/Analysis/BasicBlock.cs:539— 12 of 284 documented parameters and 11 of 514 summaries in `YarnSpinner.Compiler` only repeat the member or parameter name (e.g. "The text of the command." for `CommandText`). 3 documentation tag(s) are empty. This build requires documentation, so say what the name does not: units, ranges, null handling, side effects.
doc comments repeat the names YarnSpinner.HostAnalysis/AnalysisConfiguration.cs:54— 0 of 44 documented parameters and 0 of 17 summaries in `YarnSpinner.HostAnalysis` only repeat the member or parameter name (e.g. "" for `SkipYSLSGeneration`). 3 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
doc comments repeat the names YarnSpinner.Shared/Action.cs:750— 0 of 37 documented parameters and 1 of 83 summaries in `YarnSpinner.Shared` only repeat the member or parameter name (e.g. "Is a Unity GameObject" for `UnityGameObject`). 1 documentation tag(s) are empty. Delete the restating tags, or add what the name does not say.
Off the main sequence: YarnSpinner.Shared YarnSpinner.Shared/YarnSpinner.Shared.csproj:1— YarnSpinner.Shared: abstractness 0.13, instability 0.00, distance 0.88 — 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.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 2 file(s) — `YarnSpinner.Compiler/Compiler.cs`, `YarnSpinner.SourceGenerator/IndentingStringBuilder.cs` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
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 01a1e69a-e33c-7017-895d-580de03fd6ab · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Appendix C — Personal-data map
Every field, property and record parameter whose name is conventional personal data — 1 field(s) across 1 category, each with an exact repo-relative file:line. This is the data inventory a compliance review starts from — right-to-erasure, retention, minimisation. Detected by NAME, from the C# syntax tree, with a deliberately specific identifier classifier — the same one the C1–C5 compliance cards use to decide whether personal data is present, so CardDefinition or FileName don't trip. Two caveats stated rather than glossed: those cards additionally require corroboration (a persistence/account signal, or two distinct PII categories) that this inventory deliberately does not, so it lists more than they gate on; and D32 Data Compliance shares nothing with it — that dimension is a separate semgrep ruleset for personal data leaking into logs, URLs and browser storage, and a clean D32 result says nothing about this list. Informational — it feeds no score.
Issues: 23 · Warnings: 268 · Recommendations: 80 · Info: 23 — Appendix A · all findings · full markdown report.
Generated by the Canine Code Analyzer: deterministic code-health analysis. 16-11-2026 @ 23:04 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.